Quantum secured gigabit optical access networks

PubMed Central

Fröhlich, Bernd; Dynes, James F.; Lucamarini, Marco; Sharpe, Andrew W.; Tam, Simon W.-B.; Yuan, Zhiliang; Shields, Andrew J.

2015-01-01

Optical access networks connect multiple endpoints to a common network node via shared fibre infrastructure. They will play a vital role to scale up the number of users in quantum key distribution (QKD) networks. However, the presence of power splitters in the commonly used passive network architecture makes successful transmission of weak quantum signals challenging. This is especially true if QKD and data signals are multiplexed in the passive network. The splitter introduces an imbalance between quantum signal and Raman noise, which can prevent the recovery of the quantum signal completely. Here we introduce a method to overcome this limitation and demonstrate coexistence of multi-user QKD and full power data traffic from a gigabit passive optical network (GPON) for the first time. The dual feeder implementation is compatible with standard GPON architectures and can support up to 128 users, highlighting that quantum protected GPON networks could be commonplace in the future. PMID:26656307

A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models

NASA Astrophysics Data System (ADS)

Ma, Fei; Su, Jing; Yao, Bing

2018-05-01

The problem of determining and calculating the number of spanning trees of any finite graph (model) is a great challenge, and has been studied in various fields, such as discrete applied mathematics, theoretical computer science, physics, chemistry and the like. In this paper, firstly, thank to lots of real-life systems and artificial networks built by all kinds of functions and combinations among some simpler and smaller elements (components), we discuss some helpful network-operation, including link-operation and merge-operation, to design more realistic and complicated network models. Secondly, we present a method for computing the total number of spanning trees. As an accessible example, we apply this method to space of trees and cycles respectively, and our results suggest that it is indeed a better one for such models. In order to reflect more widely practical applications and potentially theoretical significance, we study the enumerating method in some existing scale-free network models. On the other hand, we set up a class of new models displaying scale-free feature, that is to say, following P(k) k-γ, where γ is the degree exponent. Based on detailed calculation, the degree exponent γ of our deterministic scale-free models satisfies γ > 3. In the rest of our discussions, we not only calculate analytically the solutions of average path length, which indicates our models have small-world property being prevailing in amounts of complex systems, but also derive the number of spanning trees by means of the recursive method described in this paper, which clarifies our method is convenient to research these models.

A Social Network Approach to the Estimation of Perceived Quality of Health Care

PubMed Central

Carletti, Giulia; Soriani, Nicola; Mattiazzi, Martina; Gregori, Dario

2017-01-01

Background: Measuring service quality aids health care providers to recognize specific and unmet needs of patients. Nevertheless, perceived quality of health care services (PQC) is often investigated with inadequate techniques which may lead to biased results. Objective: The aim of the present study is to develop a proof-of-concept for estimating the PQC using the scale-up estimator, with reference to a concrete assessment in patients of a major Oncology Hospital in Veneto (IOV). Results have then been compared with those collected by the Customer Relations Office (CRO) after the annual survey conducted with traditional questionnaire based techniques. Material and Methods: Seven hundred and eighty-three sets consisting of two questionnaires were handed out to IOV patients between 26 and 28 November 2012. The first questionnaire was the CRO annual one composed by 15 direct questions about the perception of quality satisfaction rate using a Likert scale. The second questionnaire was the scale-up (NSUM) one, composed by 20 indirect questions, 5 of which were reproducing the main target of CRO for estimating PQC. Results: The comparisons made over 299 sets of questionnaires showed differences between the two techniques. Network Scale-Up Method (NSUM) questionnaire seems to be able to produce lower estimates of PQC with respect to the CRO annual questionnaire. In some cases, the NSUM showed dissatisfaction rates which are 20-fold higher respect to CRO. Conclusion: NSUM could be a promising method for assessing the perceived quality of care. PMID:29238425

Enumeration of Smallest Intervention Strategies in Genome-Scale Metabolic Networks

PubMed Central

von Kamp, Axel; Klamt, Steffen

2014-01-01

One ultimate goal of metabolic network modeling is the rational redesign of biochemical networks to optimize the production of certain compounds by cellular systems. Although several constraint-based optimization techniques have been developed for this purpose, methods for systematic enumeration of intervention strategies in genome-scale metabolic networks are still lacking. In principle, Minimal Cut Sets (MCSs; inclusion-minimal combinations of reaction or gene deletions that lead to the fulfilment of a given intervention goal) provide an exhaustive enumeration approach. However, their disadvantage is the combinatorial explosion in larger networks and the requirement to compute first the elementary modes (EMs) which itself is impractical in genome-scale networks. We present MCSEnumerator, a new method for effective enumeration of the smallest MCSs (with fewest interventions) in genome-scale metabolic network models. For this we combine two approaches, namely (i) the mapping of MCSs to EMs in a dual network, and (ii) a modified algorithm by which shortest EMs can be effectively determined in large networks. In this way, we can identify the smallest MCSs by calculating the shortest EMs in the dual network. Realistic application examples demonstrate that our algorithm is able to list thousands of the most efficient intervention strategies in genome-scale networks for various intervention problems. For instance, for the first time we could enumerate all synthetic lethals in E.coli with combinations of up to 5 reactions. We also applied the new algorithm exemplarily to compute strain designs for growth-coupled synthesis of different products (ethanol, fumarate, serine) by E.coli. We found numerous new engineering strategies partially requiring less knockouts and guaranteeing higher product yields (even without the assumption of optimal growth) than reported previously. The strength of the presented approach is that smallest intervention strategies can be quickly calculated and screened with neither network size nor the number of required interventions posing major challenges. PMID:24391481

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.

Energy-Efficient Data Collection Method for Sensor Networks by Integrating Asymmetric Communication and Wake-Up Radio

PubMed Central

Iwata, Masanari; Tang, Suhua; Obana, Sadao

2018-01-01

In large-scale wireless sensor networks (WSNs), nodes close to sink nodes consume energy more quickly than other nodes due to packet forwarding. A mobile sink is a good solution to this issue, although it causes two new problems to nodes: (i) overhead of updating routing information; and (ii) increased operating time due to aperiodic query. To solve these problems, this paper proposes an energy-efficient data collection method, Sink-based Centralized transmission Scheduling (SC-Sched), by integrating asymmetric communication and wake-up radio. Specifically, each node is equipped with a low-power wake-up receiver. The sink node determines transmission scheduling, and transmits a wake-up message using a large transmission power, directly activating a pair of nodes simultaneously which will communicate with a normal transmission power. This paper further investigates how to deal with frame loss caused by fading and how to mitigate the impact of the wake-up latency of communication modules. Simulation evaluations confirm that using multiple channels effectively reduces data collection time and SC-Sched works well with a mobile sink. Compared with the conventional duty-cycling method, SC-Sched greatly reduces total energy consumption and improves the network lifetime by 7.47 times in a WSN with 4 data collection points and 300 sensor nodes. PMID:29642397

Scintillometer networks for calibration and validation of energy balance and soil moisture remote sensing algorithms

NASA Astrophysics Data System (ADS)

Hendrickx, Jan M. H.; Kleissl, Jan; Gómez Vélez, Jesús D.; Hong, Sung-ho; Fábrega Duque, José R.; Vega, David; Moreno Ramírez, Hernán A.; Ogden, Fred L.

2007-04-01

Accurate estimation of sensible and latent heat fluxes as well as soil moisture from remotely sensed satellite images poses a great challenge. Yet, it is critical to face this challenge since the estimation of spatial and temporal distributions of these parameters over large areas is impossible using only ground measurements. A major difficulty for the calibration and validation of operational remote sensing methods such as SEBAL, METRIC, and ALEXI is the ground measurement of sensible heat fluxes at a scale similar to the spatial resolution of the remote sensing image. While the spatial length scale of remote sensing images covers a range from 30 m (LandSat) to 1000 m (MODIS) direct methods to measure sensible heat fluxes such as eddy covariance (EC) only provide point measurements at a scale that may be considerably smaller than the estimate obtained from a remote sensing method. The Large Aperture scintillometer (LAS) flux footprint area is larger (up to 5000 m long) and its spatial extent better constraint than that of EC systems. Therefore, scintillometers offer the unique possibility of measuring the vertical flux of sensible heat averaged over areas comparable with several pixels of a satellite image (up to about 40 Landsat thermal pixels or about 5 MODIS thermal pixels). The objective of this paper is to present our experiences with an existing network of seven scintillometers in New Mexico and a planned network of three scintillometers in the humid tropics of Panama and Colombia.

Size Estimation of Groups at High Risk of HIV/AIDS using Network Scale Up in Kerman, Iran

PubMed Central

Shokoohi, Mostafa; Baneshi, Mohammad Reza; Haghdoost, Ali-Akbar

2012-01-01

Objective: To estimate the size of groups at high risk of HIV, Network Scale UP (NSU), an indirect method, was used. Methods: 500 Kermanian male aged 18 to 45 were recruited. 8 groups at high risk of HIV were defined: Users of opium, unknown drug, ecstasy, and alcohol; intra-venous drug users (IDUs; males who have extra-marital sex with females (MSF); male who have sex with female sex workers (MFSW); and male who have sex with other male (MSMs). We asked respondents whether they know anybody (probability method), and if yes, how many people (frequency method) in our target groups. Results: Estimates derived in the probability method were higher than the frequency method. Based on the probability method, 13.7% (95% CI: 11.3%, 16.1%) of males used alcohol at least once in last year; the corresponding percent for opium was 13.1% (95% CI: 10.9%, 15.3%). In addition, 12% has extra-marital sex in last year (95% CI: 10%, 14%); while 7% (95% CI: 5.8%, 8.2%) had sex with a female sex worker. Conclusion: We showed that drug use is more common among young and mid-age males; although their sexual contacts were also considerable. These percentages show that special preventive program is needed to control an HIV transmission. Estimates derived from probability method were comparable with data from external sources. The underestimation in frequency method might be due to the fact that respondents are not aware of sensitive characteristics of all those in their network and underreporting is likely to occur. PMID:22891148

Multi-time scale control of demand flexibility in smart distribution networks

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

Bhattarai, Bishnu; Myers, Kurt; Bak-Jensen, Birgitte

This study presents a multi-timescale control strategy to deploy demand flexibilities of electric vehicles (EV) for providing system balancing and local congestion management by simultaneously ensuring economic benefits to participating actors. First, the EV charging problem from consumer, aggregator, and grid operator’s perspective is investigated. A hierarchical control architecture (HCA) comprising scheduling, coordinative, and adaptive layers is then designed to realize their coordinative goal. This is realized by integrating a multi-time scale control, which works from a day-ahead scheduling up to real-time adaptive control. The performance of the developed method is investigated with high EV penetration in a typical distributionmore » network. The simulation results demonstrates that HCA exploit EV flexibility to solve grid unbalancing and congestions with simultaneous maximization of economic benefits by ensuring EV participation to day-ahead, balancing, and regulation markets. For the given network configuration and pricing structure, HCA ensures the EV owners to get paid up to 5 times the cost they were paying without control.« less

Multi-time scale control of demand flexibility in smart distribution networks

DOE PAGES

Bhattarai, Bishnu; Myers, Kurt; Bak-Jensen, Birgitte; ...

2017-01-01

This study presents a multi-timescale control strategy to deploy demand flexibilities of electric vehicles (EV) for providing system balancing and local congestion management by simultaneously ensuring economic benefits to participating actors. First, the EV charging problem from consumer, aggregator, and grid operator’s perspective is investigated. A hierarchical control architecture (HCA) comprising scheduling, coordinative, and adaptive layers is then designed to realize their coordinative goal. This is realized by integrating a multi-time scale control, which works from a day-ahead scheduling up to real-time adaptive control. The performance of the developed method is investigated with high EV penetration in a typical distributionmore » network. The simulation results demonstrates that HCA exploit EV flexibility to solve grid unbalancing and congestions with simultaneous maximization of economic benefits by ensuring EV participation to day-ahead, balancing, and regulation markets. For the given network configuration and pricing structure, HCA ensures the EV owners to get paid up to 5 times the cost they were paying without control.« less

School Improvement Networks as a Strategy for Large-Scale Education Reform: The Role of Educational Environments

ERIC Educational Resources Information Center

Glazer, Joshua L.; Peurach, Donald J.

2013-01-01

The development and scale-up of school improvement networks is among the most important educational innovations of the last decade, and current federal, state, and district efforts attempt to use school improvement networks as a mechanism for supporting large-scale change. The potential of improvement networks, however, rests on the extent to…

Big data driven cycle time parallel prediction for production planning in wafer manufacturing

NASA Astrophysics Data System (ADS)

Wang, Junliang; Yang, Jungang; Zhang, Jie; Wang, Xiaoxi; Zhang, Wenjun Chris

2018-07-01

Cycle time forecasting (CTF) is one of the most crucial issues for production planning to keep high delivery reliability in semiconductor wafer fabrication systems (SWFS). This paper proposes a novel data-intensive cycle time (CT) prediction system with parallel computing to rapidly forecast the CT of wafer lots with large datasets. First, a density peak based radial basis function network (DP-RBFN) is designed to forecast the CT with the diverse and agglomerative CT data. Second, the network learning method based on a clustering technique is proposed to determine the density peak. Third, a parallel computing approach for network training is proposed in order to speed up the training process with large scaled CT data. Finally, an experiment with respect to SWFS is presented, which demonstrates that the proposed CTF system can not only speed up the training process of the model but also outperform the radial basis function network, the back-propagation-network and multivariate regression methodology based CTF methods in terms of the mean absolute deviation and standard deviation.

The Game of Contacts: Estimating the Social Visibility of Groups.

PubMed

Salganik, Matthew J; Mello, Maeve B; Abdo, Alexandre H; Bertoni, Neilane; Fazito, Dimitri; Bastos, Francisco I

2011-01-01

Estimating the sizes of hard-to-count populations is a challenging and important problem that occurs frequently in social science, public health, and public policy. This problem is particularly pressing in HIV/AIDS research because estimates of the sizes of the most at-risk populations-illicit drug users, men who have sex with men, and sex workers-are needed for designing, evaluating, and funding programs to curb the spread of the disease. A promising new approach in this area is the network scale-up method, which uses information about the personal networks of respondents to make population size estimates. However, if the target population has low social visibility, as is likely to be the case in HIV/AIDS research, scale-up estimates will be too low. In this paper we develop a game-like activity that we call the game of contacts in order to estimate the social visibility of groups, and report results from a study of heavy drug users in Curitiba, Brazil (n = 294). The game produced estimates of social visibility that were consistent with qualitative expectations but of surprising magnitude. Further, a number of checks suggest that the data are high-quality. While motivated by the specific problem of population size estimation, our method could be used by researchers more broadly and adds to long-standing efforts to combine the richness of social network analysis with the power and scale of sample surveys.

Regional Evapotranspiration Estimation by Using Wireless Sap Flow and Soil Moisture Measurement Systems

NASA Astrophysics Data System (ADS)

Kuo, C.; Yu, P.; Yang, T.; Davis, T. W.; Liang, X.; Tseng, C.; Cheng, C.

2011-12-01

The objective of this study proposed herein is to estimate regional evapotranspiration via sap flow and soil moisture measurements associated with wireless sensor network in the field. Evapotranspiration is one of the important factors in water balance computation. Pan evaporation collected from the meteorological station can only be accounted as a single-point scale measurement rather than the water loss of the entire region. Thus, we need a multiple-site measurement for understanding the regional evapotranspiration. Applying sap flow method with self-made probes, we could calculate transpiration. Soil moisture measurement was used to monitor the daily soil moisture variety for evaporation. Sap flow and soil moisture measurements in multiple sites are integrated by using wireless sensor network (WSN). Then, the measurement results of each site were scaled up and combined into the regional evapotranspiration. This study used thermal dissipation method to measure sap flow in trees to represent the plant transpiration. Sap flow was measured by using the self-made sap probes which needed to be calibrated before setting up at the observation field. Regional transpiration was scaled up through the Leaf Area Index (LAI). The LAI of regional scale was from the MODIS image calculated at 1km X 1km grid size. The soil moistures collected from areas outside the distributing area of tree roots and tree canopy were used to represent the evaporation. The observation was undertaken to collect soil moisture variety from five different soil depths of 10, 20, 30, 40 and 50 cm respectively. The regional evaporation can be estimated by averaging the variation of soil moisture from each site within the region. The result data measured by both sap flow and soil moisture measurements of each site were collected through the wireless sensor network. The WSN performs the functions of P2P and mesh networking. That can collect data in multiple locations simultaneously and has less power consumption. WSN is the best way for collecting sap flow and soil moisture data in this study. Since the data were collected through the radio in the field, there may have some noise randomly. The weighted least-squares method was used to filter the raw data. Through collecting the observation data by WSN and transferring them into regional scale, we could get regional evapotranspiration.

Exploring network operations for data and information networks

NASA Astrophysics Data System (ADS)

Yao, Bing; Su, Jing; Ma, Fei; Wang, Xiaomin; Zhao, Xiyang; Yao, Ming

2017-01-01

Barabási and Albert, in 1999, formulated scale-free models based on some real networks: World-Wide Web, Internet, metabolic and protein networks, language or sexual networks. Scale-free networks not only appear around us, but also have high qualities in the world. As known, high quality information networks can transfer feasibly and efficiently data, clearly, their topological structures are very important for data safety. We build up network operations for constructing large scale of dynamic networks from smaller scale of network models having good property and high quality. We focus on the simplest operators to formulate complex operations, and are interesting on the closeness of operations to desired network properties.

Self-Reported and Network Scale-Up Estimates of Substance Use Prevalence among University Students in Kerman, Iran.

PubMed

Zahedi, Razieh; Noroozi, Alireza; Hajebi, Ahmad; Haghdoost, Ali Akbar; Baneshi, Mohammad Reza; Sharifi, Hamid; Mirzazadeh, Ali

2018-04-30

This study aimed to estimate the prevalence of substance use among university students measured by direct and indirect methods, and to calculate the visibility factor (VF) defined as ratio of indirect to direct estimates of substance use prevalence. A cross-sectional study. Using a multistage non-random sampling approach, we recruited 2157 students from three universities in Kerman, Iran, in 2016. We collected data on substance use by individual face-to-face interview using direct (i.e. self-report of their own behaviors) and indirect (NSU: Network scale up) methods. All estimates from direct and indirect methods were weighted based on inverse probability weight of sampling university. The response rate was 83.6%. The last year prevalence of water pipe, alcohol, and cigarettes indirect method was 44.6%, 18.1%, and 13.2% respectively. Corresponding figures in NSU analysis were 36.4%, 18.2%, and 16.5% respectively. In the female population, VF for all types of substance was less than male. Considerable numbers of university students used substances like a water pipe, alcohol, and cigarettes. NSU seems a promising method, especially among male students. Among female students, direct method provided more reliable results mainly due to transmission and prestige biases.

Correlations of stock price fluctuations under multi-scale and multi-threshold scenarios

NASA Astrophysics Data System (ADS)

Sui, Guo; Li, Huajiao; Feng, Sida; Liu, Xueyong; Jiang, Meihui

2018-01-01

The multi-scale method is widely used in analyzing time series of financial markets and it can provide market information for different economic entities who focus on different periods. Through constructing multi-scale networks of price fluctuation correlation in the stock market, we can detect the topological relationship between each time series. Previous research has not addressed the problem that the original fluctuation correlation networks are fully connected networks and more information exists within these networks that is currently being utilized. Here we use listed coal companies as a case study. First, we decompose the original stock price fluctuation series into different time scales. Second, we construct the stock price fluctuation correlation networks at different time scales. Third, we delete the edges of the network based on thresholds and analyze the network indicators. Through combining the multi-scale method with the multi-threshold method, we bring to light the implicit information of fully connected networks.

Advances in the mechanical modeling of filamentous actin and its cross-linked networks on multiple scales.

PubMed

Unterberger, Michael J; Holzapfel, Gerhard A

2014-11-01

The protein actin is a part of the cytoskeleton and, therefore, responsible for the mechanical properties of the cells. Starting with the single molecule up to the final structure, actin creates a hierarchical structure of several levels exhibiting a remarkable behavior. The hierarchy spans several length scales and limitations in computational power; therefore, there is a call for different mechanical modeling approaches for the different scales. On the molecular level, we may consider each atom in molecular dynamics simulations. Actin forms filaments by combining the molecules into a double helix. In a model, we replace molecular subdomains using coarse-graining methods, allowing the investigation of larger systems of several atoms. These models on the nanoscale inform continuum mechanical models of large filaments, which are based on worm-like chain models for polymers. Assemblies of actin filaments are connected with cross-linker proteins. Models with discrete filaments, so-called Mikado models, allow us to investigate the dependence of the properties of networks on the parameters of the constituents. Microstructurally motivated continuum models of the networks provide insights into larger systems containing cross-linked actin networks. Modeling of such systems helps to gain insight into the processes on such small scales. On the other hand, they call for verification and hence trigger the improvement of established experiments and the development of new methods.

Inter-allotropic transformations in the heterogeneous carbon nanotube networks.

PubMed

Jung, Hyun Young; Jung, Sung Mi; Kim, Dong Won; Jung, Yung Joon

2017-01-19

The allotropic transformations of carbon provide an immense technological interest for tailoring the desired molecular structures in the scalable nanoelectronic devices. Herein, we explore the effects of morphology and geometric alignment of the nanotubes for the re-engineering of carbon bonds in the heterogeneous carbon nanotube (CNT) networks. By applying alternating voltage pulses and electrical forces, the single-walled CNTs in networks were predominantly transformed into other predetermined sp 2 carbon structures (multi-walled CNTs and multi-layered graphitic nanoribbons), showing a larger intensity in a coalescence-induced mode of Raman spectra with the increasing channel width. Moreover, the transformed networks have a newly discovered sp 2 -sp 3 hybrid nanostructures in accordance with the alignment. The sp 3 carbon structures at the small channel are controlled, such that they contain up to about 29.4% networks. This study provides a controllable method for specific types of inter-allotropic transformations/hybridizations, which opens up the further possibility for the engineering of nanocarbon allotropes in the robust large-scale network-based devices.

Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large Scale Complex Networks

PubMed Central

Mall, Raghvendra; Langone, Rocco; Suykens, Johan A. K.

2014-01-01

Kernel spectral clustering corresponds to a weighted kernel principal component analysis problem in a constrained optimization framework. The primal formulation leads to an eigen-decomposition of a centered Laplacian matrix at the dual level. The dual formulation allows to build a model on a representative subgraph of the large scale network in the training phase and the model parameters are estimated in the validation stage. The KSC model has a powerful out-of-sample extension property which allows cluster affiliation for the unseen nodes of the big data network. In this paper we exploit the structure of the projections in the eigenspace during the validation stage to automatically determine a set of increasing distance thresholds. We use these distance thresholds in the test phase to obtain multiple levels of hierarchy for the large scale network. The hierarchical structure in the network is determined in a bottom-up fashion. We empirically showcase that real-world networks have multilevel hierarchical organization which cannot be detected efficiently by several state-of-the-art large scale hierarchical community detection techniques like the Louvain, OSLOM and Infomap methods. We show that a major advantage of our proposed approach is the ability to locate good quality clusters at both the finer and coarser levels of hierarchy using internal cluster quality metrics on 7 real-life networks. PMID:24949877

Network Approaches to Substance Use and HIV/Hepatitis C Risk among Homeless Youth and Adult Women in the United States: A Review

PubMed Central

Dombrowski, Kirk; Sittner, Kelley; Crawford, Devan; Welch-Lazoritz, Melissa; Habecker, Patrick; Khan, Bilal

2016-01-01

During the United States economic recession of 2008–2011, the number of homeless and unstably housed people in the United States increased considerably. Homeless adult women and unaccompanied homeless youth make up the most marginal segments of this population. Because homeless individuals are a hard to reach population, research into these marginal groups has traditionally been a challenge for researchers interested in substance abuse and mental health. Network analysis techniques and research strategies offer means for dealing with traditional challenges such as missing sampling frames, variation in definitions of homelessness and study inclusion criteria, and enumeration/population estimation procedures. This review focuses on the need for, and recent steps toward, solutions to these problems that involve network science strategies for data collection and analysis. Research from a range of fields is reviewed and organized according to a new stress process framework aimed at understanding how homeless status interacts with issues related to substance abuse and mental health. Three types of network innovation are discussed: network scale-up methods, a network ecology approach to social resources, and the integration of network variables into the proposed stress process model of homeless substance abuse and mental health. By employing network methods and integrating these methods into existing models, research on homeless and unstably housed women and unaccompanied young people can address existing research challenges and promote more effective intervention and care programs. PMID:28042394

Network Approaches to Substance Use and HIV/Hepatitis C Risk among Homeless Youth and Adult Women in the United States: A Review.

PubMed

Dombrowski, Kirk; Sittner, Kelley; Crawford, Devan; Welch-Lazoritz, Melissa; Habecker, Patrick; Khan, Bilal

2016-09-01

During the United States economic recession of 2008-2011, the number of homeless and unstably housed people in the United States increased considerably. Homeless adult women and unaccompanied homeless youth make up the most marginal segments of this population. Because homeless individuals are a hard to reach population, research into these marginal groups has traditionally been a challenge for researchers interested in substance abuse and mental health. Network analysis techniques and research strategies offer means for dealing with traditional challenges such as missing sampling frames, variation in definitions of homelessness and study inclusion criteria, and enumeration/population estimation procedures. This review focuses on the need for, and recent steps toward, solutions to these problems that involve network science strategies for data collection and analysis. Research from a range of fields is reviewed and organized according to a new stress process framework aimed at understanding how homeless status interacts with issues related to substance abuse and mental health. Three types of network innovation are discussed: network scale-up methods, a network ecology approach to social resources, and the integration of network variables into the proposed stress process model of homeless substance abuse and mental health. By employing network methods and integrating these methods into existing models, research on homeless and unstably housed women and unaccompanied young people can address existing research challenges and promote more effective intervention and care programs.

Automatic detection of kidney in 3D pediatric ultrasound images using deep neural networks

NASA Astrophysics Data System (ADS)

Tabrizi, Pooneh R.; Mansoor, Awais; Biggs, Elijah; Jago, James; Linguraru, Marius George

2018-02-01

Ultrasound (US) imaging is the routine and safe diagnostic modality for detecting pediatric urology problems, such as hydronephrosis in the kidney. Hydronephrosis is the swelling of one or both kidneys because of the build-up of urine. Early detection of hydronephrosis can lead to a substantial improvement in kidney health outcomes. Generally, US imaging is a challenging modality for the evaluation of pediatric kidneys with different shape, size, and texture characteristics. The aim of this study is to present an automatic detection method to help kidney analysis in pediatric 3DUS images. The method localizes the kidney based on its minimum volume oriented bounding box) using deep neural networks. Separate deep neural networks are trained to estimate the kidney position, orientation, and scale, making the method computationally efficient by avoiding full parameter training. The performance of the method was evaluated using a dataset of 45 kidneys (18 normal and 27 diseased kidneys diagnosed with hydronephrosis) through the leave-one-out cross validation method. Quantitative results show the proposed detection method could extract the kidney position, orientation, and scale ratio with root mean square values of 1.3 +/- 0.9 mm, 6.34 +/- 4.32 degrees, and 1.73 +/- 0.04, respectively. This method could be helpful in automating kidney segmentation for routine clinical evaluation.

fastBMA: scalable network inference and transitive reduction.

PubMed

Hung, Ling-Hong; Shi, Kaiyuan; Wu, Migao; Young, William Chad; Raftery, Adrian E; Yeung, Ka Yee

2017-10-01

Inferring genetic networks from genome-wide expression data is extremely demanding computationally. We have developed fastBMA, a distributed, parallel, and scalable implementation of Bayesian model averaging (BMA) for this purpose. fastBMA also includes a computationally efficient module for eliminating redundant indirect edges in the network by mapping the transitive reduction to an easily solved shortest-path problem. We evaluated the performance of fastBMA on synthetic data and experimental genome-wide time series yeast and human datasets. When using a single CPU core, fastBMA is up to 100 times faster than the next fastest method, LASSO, with increased accuracy. It is a memory-efficient, parallel, and distributed application that scales to human genome-wide expression data. A 10 000-gene regulation network can be obtained in a matter of hours using a 32-core cloud cluster (2 nodes of 16 cores). fastBMA is a significant improvement over its predecessor ScanBMA. It is more accurate and orders of magnitude faster than other fast network inference methods such as the 1 based on LASSO. The improved scalability allows it to calculate networks from genome scale data in a reasonable time frame. The transitive reduction method can improve accuracy in denser networks. fastBMA is available as code (M.I.T. license) from GitHub (https://github.com/lhhunghimself/fastBMA), as part of the updated networkBMA Bioconductor package (https://www.bioconductor.org/packages/release/bioc/html/networkBMA.html) and as ready-to-deploy Docker images (https://hub.docker.com/r/biodepot/fastbma/). © The Authors 2017. Published by Oxford University Press.

The Game of Contacts: Estimating the Social Visibility of Groups☆

PubMed Central

Salganik, Matthew J.; Mello, Maeve B.; Abdo, Alexandre H.; Bertoni, Neilane; Fazito, Dimitri; Bastos, Francisco I.

2010-01-01

Estimating the sizes of hard-to-count populations is a challenging and important problem that occurs frequently in social science, public health, and public policy. This problem is particularly pressing in HIV/AIDS research because estimates of the sizes of the most at-risk populations—illicit drug users, men who have sex with men, and sex workers—are needed for designing, evaluating, and funding programs to curb the spread of the disease. A promising new approach in this area is the network scale-up method, which uses information about the personal networks of respondents to make population size estimates. However, if the target population has low social visibility, as is likely to be the case in HIV/AIDS research, scale-up estimates will be too low. In this paper we develop a game-like activity that we call the game of contacts in order to estimate the social visibility of groups, and report results from a study of heavy drug users in Curitiba, Brazil (n = 294). The game produced estimates of social visibility that were consistent with qualitative expectations but of surprising magnitude. Further, a number of checks suggest that the data are high-quality. While motivated by the specific problem of population size estimation, our method could be used by researchers more broadly and adds to long-standing efforts to combine the richness of social network analysis with the power and scale of sample surveys. PMID:21318126

Eco-hydrological Wireless Sensor Network and upscaling method research in the Heihe River Basin, China

NASA Astrophysics Data System (ADS)

Jin, Rui; kang, Jian

2017-04-01

Wireless Sensor Networks are recognized as one of most important near-surface components of GEOSS (Global Earth Observation System of Systems), with flourish development of low-cost, robust and integrated data loggers and sensors. A nested eco-hydrological wireless sensor network (EHWSN) was installed in the up- and middle-reaches of the Heihe River Basin, operated to obtain multi-scale observation of soil moisture, soil temperature and land surface temperature from 2012 till now. The spatial distribution of EHWSN was optimally designed based on the geo-statistical theory, with the aim to capture the spatial variations and temporal dynamics of soil moisture and soil temperature, and to produce ground truth at grid scale for validating the related remote sensing products and model simulation in the heterogeneous land surface. In terms of upscaling research, we have developed a set of method to aggregate multi-point WSN observations to grid scale ( 1km), including regression kriging estimation to utilize multi-resource remote sensing auxiliary information, block kriging with homogeneous measurement errors, and bayesian-based upscaling algorithm that utilizes MODIS-derived apparent thermal inertia. All the EHWSN observation are organized as datasets to be freely published at http://westdc.westgis.ac.cn/hiwater. EHWSN integrates distributed observation nodes to achieve an automated, intelligent and remote-controllable network that provides superior integrated, standardized and automated observation capabilities for hydrological and ecological processes research at the basin scale.

Towards a comprehensive understanding of emerging dynamics and function of pancreatic islets: A complex network approach. Comment on "Network science of biological systems at different scales: A review" by Gosak et al.

NASA Astrophysics Data System (ADS)

Loppini, Alessandro

2018-03-01

Complex network theory represents a comprehensive mathematical framework to investigate biological systems, ranging from sub-cellular and cellular scales up to large-scale networks describing species interactions and ecological systems. In their exhaustive and comprehensive work [1], Gosak et al. discuss several scenarios in which the network approach was able to uncover general properties and underlying mechanisms of cells organization and regulation, tissue functions and cell/tissue failure in pathology, by the study of chemical reaction networks, structural networks and functional connectivities.

Scaling of counter-current imbibition recovery curves using artificial neural networks

NASA Astrophysics Data System (ADS)

Jafari, Iman; Masihi, Mohsen; Nasiri Zarandi, Masoud

2018-06-01

Scaling imbibition curves are of great importance in the characterization and simulation of oil production from naturally fractured reservoirs. Different parameters such as matrix porosity and permeability, oil and water viscosities, matrix dimensions, and oil/water interfacial tensions have an effective on the imbibition process. Studies on the scaling imbibition curves along with the consideration of different assumptions have resulted in various scaling equations. In this work, using an artificial neural network (ANN) method, a novel technique is presented for scaling imbibition recovery curves, which can be used for scaling the experimental and field-scale imbibition cases. The imbibition recovery curves for training and testing the neural network were gathered through the simulation of different scenarios using a commercial reservoir simulator. In this ANN-based method, six parameters were assumed to have an effect on the imbibition process and were considered as the inputs for training the network. Using the ‘Bayesian regularization’ training algorithm, the network was trained and tested. Training and testing phases showed superior results in comparison with the other scaling methods. It is concluded that using the new technique is useful for scaling imbibition recovery curves, especially for complex cases, for which the common scaling methods are not designed.

Cascade heterogeneous face sketch-photo synthesis via dual-scale Markov Network

NASA Astrophysics Data System (ADS)

Yao, Saisai; Chen, Zhenxue; Jia, Yunyi; Liu, Chengyun

2018-03-01

Heterogeneous face sketch-photo synthesis is an important and challenging task in computer vision, which has widely applied in law enforcement and digital entertainment. According to the different synthesis results based on different scales, this paper proposes a cascade sketch-photo synthesis method via dual-scale Markov Network. Firstly, Markov Network with larger scale is used to synthesise the initial sketches and the local vertical and horizontal neighbour search (LVHNS) method is used to search for the neighbour patches of test patches in training set. Then, the initial sketches and test photos are jointly entered into smaller scale Markov Network. Finally, the fine sketches are obtained after cascade synthesis process. Extensive experimental results on various databases demonstrate the superiority of the proposed method compared with several state-of-the-art methods.

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.

Definition of parameters of daily anisotropy of cosmic rays according to the world network of neutron monitors

NASA Astrophysics Data System (ADS)

Grigoryev, V. G.; Starodubtsev, S. A.; Potapova, V. D.

2013-02-01

In our previous works we have created the method of determination of parameters of cosmic ray daily anisotropy in the interplanetary environment based on the data provided by only single station - cosmic ray spectrograph named after A.I.Kuzmin. This method allows to predict the ingress of the Earth into large-scale solar wind disturbances with a probability of more than 70% and in advance time of about from several hours up to 2 days. Now it became possible to use the data of the neutron monitor networks, which can be seen in the neutron monitor database (NMDB) in real time. In this case the well-known method of global survey is applied for determination of cosmic ray anisotropy. Usage of the data of the cosmic ray station network allows to determine parameters of daily cosmic ray anisotropy with a greater accuracy.

The NEON Aquatic Network: Expanding the Availability of Biogeochemical Data

NASA Astrophysics Data System (ADS)

Vance, J. M.; Bohall, C.; Fitzgerald, M.; Utz, R.; Parker, S. M.; Roehm, C. L.; Goodman, K. J.; McLaughlin, B.

2013-12-01

Aquatic ecosystems are facing unprecedented pressure from climate change and land-use practices. Invasive species, whether plant, animal, insect or microbe present additional threat to aquatic ecosystem services. There are significant scientific challenges to understanding how these forces will interact to affect aquatic ecosystems, as the flow of energy and materials in the environment is driven by multivariate and non-linear biogeochemical cycles. The National Ecological Observatory Network (NEON) will collect and provide observational data across multiple scales. Sites were selected to maximize representation of major North American ecosystems using a multivariate geographic clustering method that partitioned the continental US, AK, HI, and Puerto Rico into 20 eco-climatic domains. The NEON data collection systems and methods are designed to yield standardized, near real-time data subjected to rigorous quality controls prior to public dissemination through an online data portal. NEON will collect data for 30 years to facilitate spatial-temporal analysis of environmental responses and drivers of ecosystem change, ranging from local through continental scales. Here we present the NEON Aquatic Network, a multi-parameter network consisting of a combination of in situ sensor and observational data. This network will provide data to examine biogeochemical, biological, hydrologic and geomorphic metrics at 36 sites, which are a combination of small 1st/2nd order wadeable streams, large rivers and lakes. A typical NEON Aquatic site will host up to two in-stream sensor sets designed to collect near-continuous water quality data (e.g. pH/ORP, temperature, conductivity, dissolved oxygen, CDOM) along with up to 8 shallow groundwater monitoring wells (level, temp., cond.), and a local meteorological station (e.g. 2D wind speed, PAR, barometric pressure, temperature, net radiation). These coupled sensor suites will be complemented by observational data (e.g. water/sediment chemistry, aquatic organisms, geomorphology). The aquatic network will produce ~212 low-level data products for each site. NEON will produce several higher level data products such as measurements of whole-stream metabolism, gross primary productivity, ecosystem respiration, and fluxes of nitrogen, phosphorous and carbon that will enable users to analyze processes on a gross scale. These data may be integrated with NEON's terrestrial and airborne networks to bridge the gap between aquatic and terrestrial biogeochemical research. The NEON Aquatic Network is poised to greatly expand our ability to create more robust biogeochemical models. For example, hydrologic and stable isotope data will allow investigation of terrestrial-aquatic carbon flux. Constraints provided by NEON's terrestrial and atmospheric data concurrent with remotely sensed data will facilitate the scaling to regional and continental scales, potentially leading to greater accuracy in the global carbon budget. The NEON Aquatic Network represents a powerful tool that will give the scientific community access to standardized data over spatiotemporal scales that are needed to answer fundamental questions about natural ecological variability and responses to changes in the environment.

Influence network linkages across implementation strategy conditions in a randomized controlled trial of two strategies for scaling up evidence-based practices in public youth-serving systems

PubMed Central

2013-01-01

Background Given the importance of influence networks in the implementation of evidence-based practices and interventions, it is unclear whether such networks continue to operate as sources of information and advice when they are segmented and disrupted by randomization to different implementation strategy conditions. The present study examines the linkages across implementation strategy conditions of social influence networks of leaders of youth-serving systems in 12 California counties participating in a randomized controlled trial of community development teams (CDTs) to scale up use of an evidence-based practice. Methods Semi-structured interviews were conducted with 38 directors, assistant directors, and program managers of county probation, mental health, and child welfare departments. A web-based survey collected additional quantitative data on information and advice networks of study participants. A mixed-methods approach to data analysis was used to create a sociometric data set (n = 176) to examine linkages between treatment and standard conditions. Results Of those network members who were affiliated with a county (n = 137), only 6 (4.4%) were directly connected to a member of the opposite implementation strategy condition; 19 (13.9%) were connected by two steps or fewer to a member of the opposite implementation strategy condition; 64 (46.7%) were connected by three or fewer steps to a member of the opposite implementation strategy condition. Most of the indirect steps between individuals who were in different implementation strategy conditions were connections involving a third non-county organizational entity that had an important role in the trial in keeping the implementation strategy conditions separate. When these entities were excluded, the CDT network exhibited fewer components and significantly higher betweenness centralization than did the standard condition network. Conclusion Although the integrity of the RCT in this instance was not compromised by study participant influence networks, RCT designs should consider how influence networks may extend beyond boundaries established by the randomization process in implementation studies. Trial registration NCT00880126 PMID:24229373

Quantum realization of the bilinear interpolation method for NEQR.

PubMed

Zhou, Ri-Gui; Hu, Wenwen; Fan, Ping; Ian, Hou

2017-05-31

In recent years, quantum image processing is one of the most active fields in quantum computation and quantum information. Image scaling as a kind of image geometric transformation has been widely studied and applied in the classical image processing, however, the quantum version of which does not exist. This paper is concerned with the feasibility of the classical bilinear interpolation based on novel enhanced quantum image representation (NEQR). Firstly, the feasibility of the bilinear interpolation for NEQR is proven. Then the concrete quantum circuits of the bilinear interpolation including scaling up and scaling down for NEQR are given by using the multiply Control-Not operation, special adding one operation, the reverse parallel adder, parallel subtractor, multiplier and division operations. Finally, the complexity analysis of the quantum network circuit based on the basic quantum gates is deduced. Simulation result shows that the scaled-up image using bilinear interpolation is clearer and less distorted than nearest interpolation.

Examining the Emergence of Large-Scale Structures in Collaboration Networks: Methods in Sociological Analysis

ERIC Educational Resources Information Center

Ghosh, Jaideep; Kshitij, Avinash

2017-01-01

This article introduces a number of methods that can be useful for examining the emergence of large-scale structures in collaboration networks. The study contributes to sociological research by investigating how clusters of research collaborators evolve and sometimes percolate in a collaboration network. Typically, we find that in our networks,…

Rotation and scale change invariant point pattern relaxation matching by the Hopfield neural network

NASA Astrophysics Data System (ADS)

Sang, Nong; Zhang, Tianxu

1997-12-01

Relaxation matching is one of the most relevant methods for image matching. The original relaxation matching technique using point patterns is sensitive to rotations and scale changes. We improve the original point pattern relaxation matching technique to be invariant to rotations and scale changes. A method that makes the Hopfield neural network perform this matching process is discussed. An advantage of this is that the relaxation matching process can be performed in real time with the neural network's massively parallel capability to process information. Experimental results with large simulated images demonstrate the effectiveness and feasibility of the method to perform point patten relaxation matching invariant to rotations and scale changes and the method to perform this matching by the Hopfield neural network. In addition, we show that the method presented can be tolerant to small random error.

Learning Traffic as Images: A Deep Convolutional Neural Network for Large-Scale Transportation Network Speed Prediction.

PubMed

Ma, Xiaolei; Dai, Zhuang; He, Zhengbing; Ma, Jihui; Wang, Yong; Wang, Yunpeng

2017-04-10

This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks.

Learning Traffic as Images: A Deep Convolutional Neural Network for Large-Scale Transportation Network Speed Prediction

PubMed Central

Ma, Xiaolei; Dai, Zhuang; He, Zhengbing; Ma, Jihui; Wang, Yong; Wang, Yunpeng

2017-01-01

This paper proposes a convolutional neural network (CNN)-based method that learns traffic as images and predicts large-scale, network-wide traffic speed with a high accuracy. Spatiotemporal traffic dynamics are converted to images describing the time and space relations of traffic flow via a two-dimensional time-space matrix. A CNN is applied to the image following two consecutive steps: abstract traffic feature extraction and network-wide traffic speed prediction. The effectiveness of the proposed method is evaluated by taking two real-world transportation networks, the second ring road and north-east transportation network in Beijing, as examples, and comparing the method with four prevailing algorithms, namely, ordinary least squares, k-nearest neighbors, artificial neural network, and random forest, and three deep learning architectures, namely, stacked autoencoder, recurrent neural network, and long-short-term memory network. The results show that the proposed method outperforms other algorithms by an average accuracy improvement of 42.91% within an acceptable execution time. The CNN can train the model in a reasonable time and, thus, is suitable for large-scale transportation networks. PMID:28394270

Scaling Deep Learning on GPU and Knights Landing clusters

DOE PAGES

You, Yang; Buluc, Aydin; Demmel, James

2017-09-26

The speed of deep neural networks training has become a big bottleneck of deep learning research and development. For example, training GoogleNet by ImageNet dataset on one Nvidia K20 GPU needs 21 days. To speed up the training process, the current deep learning systems heavily rely on the hardware accelerators. However, these accelerators have limited on-chip memory compared with CPUs. To handle large datasets, they need to fetch data from either CPU memory or remote processors. We use both self-hosted Intel Knights Landing (KNL) clusters and multi-GPU clusters as our target platforms. From an algorithm aspect, current distributed machine learningmore » systems are mainly designed for cloud systems. These methods are asynchronous because of the slow network and high fault-tolerance requirement on cloud systems. We focus on Elastic Averaging SGD (EASGD) to design algorithms for HPC clusters. Original EASGD used round-robin method for communication and updating. The communication is ordered by the machine rank ID, which is inefficient on HPC clusters. First, we redesign four efficient algorithms for HPC systems to improve EASGD's poor scaling on clusters. Async EASGD, Async MEASGD, and Hogwild EASGD are faster \\textcolor{black}{than} their existing counterparts (Async SGD, Async MSGD, and Hogwild SGD, resp.) in all the comparisons. Finally, we design Sync EASGD, which ties for the best performance among all the methods while being deterministic. In addition to the algorithmic improvements, we use some system-algorithm codesign techniques to scale up the algorithms. By reducing the percentage of communication from 87% to 14%, our Sync EASGD achieves 5.3x speedup over original EASGD on the same platform. We get 91.5% weak scaling efficiency on 4253 KNL cores, which is higher than the state-of-the-art implementation.« less

Scaling Deep Learning on GPU and Knights Landing clusters

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

You, Yang; Buluc, Aydin; Demmel, James

The speed of deep neural networks training has become a big bottleneck of deep learning research and development. For example, training GoogleNet by ImageNet dataset on one Nvidia K20 GPU needs 21 days. To speed up the training process, the current deep learning systems heavily rely on the hardware accelerators. However, these accelerators have limited on-chip memory compared with CPUs. To handle large datasets, they need to fetch data from either CPU memory or remote processors. We use both self-hosted Intel Knights Landing (KNL) clusters and multi-GPU clusters as our target platforms. From an algorithm aspect, current distributed machine learningmore » systems are mainly designed for cloud systems. These methods are asynchronous because of the slow network and high fault-tolerance requirement on cloud systems. We focus on Elastic Averaging SGD (EASGD) to design algorithms for HPC clusters. Original EASGD used round-robin method for communication and updating. The communication is ordered by the machine rank ID, which is inefficient on HPC clusters. First, we redesign four efficient algorithms for HPC systems to improve EASGD's poor scaling on clusters. Async EASGD, Async MEASGD, and Hogwild EASGD are faster \\textcolor{black}{than} their existing counterparts (Async SGD, Async MSGD, and Hogwild SGD, resp.) in all the comparisons. Finally, we design Sync EASGD, which ties for the best performance among all the methods while being deterministic. In addition to the algorithmic improvements, we use some system-algorithm codesign techniques to scale up the algorithms. By reducing the percentage of communication from 87% to 14%, our Sync EASGD achieves 5.3x speedup over original EASGD on the same platform. We get 91.5% weak scaling efficiency on 4253 KNL cores, which is higher than the state-of-the-art implementation.« less

Mono-isotope Prediction for Mass Spectra Using Bayes Network.

PubMed

Li, Hui; Liu, Chunmei; Rwebangira, Mugizi Robert; Burge, Legand

2014-12-01

Mass spectrometry is one of the widely utilized important methods to study protein functions and components. The challenge of mono-isotope pattern recognition from large scale protein mass spectral data needs computational algorithms and tools to speed up the analysis and improve the analytic results. We utilized naïve Bayes network as the classifier with the assumption that the selected features are independent to predict mono-isotope pattern from mass spectrometry. Mono-isotopes detected from validated theoretical spectra were used as prior information in the Bayes method. Three main features extracted from the dataset were employed as independent variables in our model. The application of the proposed algorithm to publicMo dataset demonstrates that our naïve Bayes classifier is advantageous over existing methods in both accuracy and sensitivity.

A multi-scale network method for two-phase flow in porous media

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

Khayrat, Karim, E-mail: khayratk@ifd.mavt.ethz.ch; Jenny, Patrick

Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces withinmore » each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.« less

The success factors of scaling-up Estonian sexual and reproductive health youth clinic network--from a grassroots initiative to a national programme 1991-2013.

PubMed

Kempers, Jari; Ketting, Evert; Chandra-Mouli, Venkatraman; Raudsepp, Triin

2015-01-08

A growing number of middle-income countries are scaling up youth-friendly sexual and reproductive health pilot projects to national level programmes. Yet, there are few case studies on successful national level scale-up of such programmes. Estonia is an excellent example of scale-up of a small grassroots adolescent sexual and reproductive health initiative to a national programme, which most likely contributed to improved adolescent sexual and reproductive health outcomes. This study; (1) documents the scale-up process of the Estonian youth clinic network 1991-2013, and (2) analyses factors that contributed to the successful scale-up. This research provides policy makers and programme managers with new insights to success factors of the scale-up, that can be used to support planning, implementation and scale-up of adolescent sexual and reproductive health programmes in other countries. Information on the scale-up process and success factors were collected by conducting a literature review and interviewing key stakeholders. The findings were analysed using the WHO-ExpandNet framework, which provides a step-by-step process approach for design, implementation and assessment of the results of scaling-up health innovations. The scale-up was divided into two main phases: (1) planning the scale-up strategy 1991-1995 and (2) managing the scaling-up 1996-2013. The planning phase analysed innovation, user organizations (youth clinics), environment and resource team (a national NGO and international assistance). The managing phase examines strategic choices, advocacy, organization, resource mobilization, monitoring and evaluation, strategic planning and management of the scale-up. The main factors that contributed to the successful scale-up in Estonia were: (1) favourable social and political climate, (2) clear demonstrated need for the adolescent services, (3) a national professional organization that advocated, coordinated and represented the youth clinics, (4) enthusiasm and dedication of personnel, (5) acceptance by user organizations and (6) sustainable funding through the national health insurance system. Finally, the measurement and recognition of the remarkable improvement of adolescent SRH outcomes in Estonia would not have been possible without development of good reporting and monitoring systems, and many studies and international publications.

Network rewiring dynamics with convergence towards a star network

PubMed Central

Dick, G.; Parry, M.

2016-01-01

Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz (Nature 393, 440–442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach. PMID:27843396

Network rewiring dynamics with convergence towards a star network.

PubMed

Whigham, P A; Dick, G; Parry, M

2016-10-01

Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440-442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.

Traffic sign recognition based on deep convolutional neural network

NASA Astrophysics Data System (ADS)

Yin, Shi-hao; Deng, Ji-cai; Zhang, Da-wei; Du, Jing-yuan

2017-11-01

Traffic sign recognition (TSR) is an important component of automated driving systems. It is a rather challenging task to design a high-performance classifier for the TSR system. In this paper, we propose a new method for TSR system based on deep convolutional neural network. In order to enhance the expression of the network, a novel structure (dubbed block-layer below) which combines network-in-network and residual connection is designed. Our network has 10 layers with parameters (block-layer seen as a single layer): the first seven are alternate convolutional layers and block-layers, and the remaining three are fully-connected layers. We train our TSR network on the German traffic sign recognition benchmark (GTSRB) dataset. To reduce overfitting, we perform data augmentation on the training images and employ a regularization method named "dropout". The activation function we employ in our network adopts scaled exponential linear units (SELUs), which can induce self-normalizing properties. To speed up the training, we use an efficient GPU to accelerate the convolutional operation. On the test dataset of GTSRB, we achieve the accuracy rate of 99.67%, exceeding the state-of-the-art results.

Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

On the Reliability of Individual Brain Activity Networks.

PubMed

Cassidy, Ben; Bowman, F DuBois; Rae, Caroline; Solo, Victor

2018-02-01

There is intense interest in fMRI research on whole-brain functional connectivity, and however, two fundamental issues are still unresolved: the impact of spatiotemporal data resolution (spatial parcellation and temporal sampling) and the impact of the network construction method on the reliability of functional brain networks. In particular, the impact of spatiotemporal data resolution on the resulting connectivity findings has not been sufficiently investigated. In fact, a number of studies have already observed that functional networks often give different conclusions across different parcellation scales. If the interpretations from functional networks are inconsistent across spatiotemporal scales, then the whole validity of the functional network paradigm is called into question. This paper investigates the consistency of resting state network structure when using different temporal sampling or spatial parcellation, or different methods for constructing the networks. To pursue this, we develop a novel network comparison framework based on persistent homology from a topological data analysis. We use the new network comparison tools to characterize the spatial and temporal scales under which consistent functional networks can be constructed. The methods are illustrated on Human Connectome Project data, showing that the DISCOH 2 network construction method outperforms other approaches at most data spatiotemporal resolutions.

Mixed Transportation Network Design under a Sustainable Development Perspective

PubMed Central

Qin, Jin; Ni, Ling-lin; Shi, Feng

2013-01-01

A mixed transportation network design problem considering sustainable development was studied in this paper. Based on the discretization of continuous link-grade decision variables, a bilevel programming model was proposed to describe the problem, in which sustainability factors, including vehicle exhaust emissions, land-use scale, link load, and financial budget, are considered. The objective of the model is to minimize the total amount of resources exploited under the premise of meeting all the construction goals. A heuristic algorithm, which combined the simulated annealing and path-based gradient projection algorithm, was developed to solve the model. The numerical example shows that the transportation network optimized with the method above not only significantly alleviates the congestion on the link, but also reduces vehicle exhaust emissions within the network by up to 41.56%. PMID:23476142

Mixed transportation network design under a sustainable development perspective.

PubMed

Qin, Jin; Ni, Ling-lin; Shi, Feng

2013-01-01

A mixed transportation network design problem considering sustainable development was studied in this paper. Based on the discretization of continuous link-grade decision variables, a bilevel programming model was proposed to describe the problem, in which sustainability factors, including vehicle exhaust emissions, land-use scale, link load, and financial budget, are considered. The objective of the model is to minimize the total amount of resources exploited under the premise of meeting all the construction goals. A heuristic algorithm, which combined the simulated annealing and path-based gradient projection algorithm, was developed to solve the model. The numerical example shows that the transportation network optimized with the method above not only significantly alleviates the congestion on the link, but also reduces vehicle exhaust emissions within the network by up to 41.56%.

Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers.

PubMed

Jordan, Jakob; Ippen, Tammo; Helias, Moritz; Kitayama, Itaru; Sato, Mitsuhisa; Igarashi, Jun; Diesmann, Markus; Kunkel, Susanne

2018-01-01

State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems.

Extremely Scalable Spiking Neuronal Network Simulation Code: From Laptops to Exascale Computers

PubMed Central

Jordan, Jakob; Ippen, Tammo; Helias, Moritz; Kitayama, Itaru; Sato, Mitsuhisa; Igarashi, Jun; Diesmann, Markus; Kunkel, Susanne

2018-01-01

State-of-the-art software tools for neuronal network simulations scale to the largest computing systems available today and enable investigations of large-scale networks of up to 10 % of the human cortex at a resolution of individual neurons and synapses. Due to an upper limit on the number of incoming connections of a single neuron, network connectivity becomes extremely sparse at this scale. To manage computational costs, simulation software ultimately targeting the brain scale needs to fully exploit this sparsity. Here we present a two-tier connection infrastructure and a framework for directed communication among compute nodes accounting for the sparsity of brain-scale networks. We demonstrate the feasibility of this approach by implementing the technology in the NEST simulation code and we investigate its performance in different scaling scenarios of typical network simulations. Our results show that the new data structures and communication scheme prepare the simulation kernel for post-petascale high-performance computing facilities without sacrificing performance in smaller systems. PMID:29503613

Gender Recognition from Human-Body Images Using Visible-Light and Thermal Camera Videos Based on a Convolutional Neural Network for Image Feature Extraction

PubMed Central

Nguyen, Dat Tien; Kim, Ki Wan; Hong, Hyung Gil; Koo, Ja Hyung; Kim, Min Cheol; Park, Kang Ryoung

2017-01-01

Extracting powerful image features plays an important role in computer vision systems. Many methods have previously been proposed to extract image features for various computer vision applications, such as the scale-invariant feature transform (SIFT), speed-up robust feature (SURF), local binary patterns (LBP), histogram of oriented gradients (HOG), and weighted HOG. Recently, the convolutional neural network (CNN) method for image feature extraction and classification in computer vision has been used in various applications. In this research, we propose a new gender recognition method for recognizing males and females in observation scenes of surveillance systems based on feature extraction from visible-light and thermal camera videos through CNN. Experimental results confirm the superiority of our proposed method over state-of-the-art recognition methods for the gender recognition problem using human body images. PMID:28335510

Gender Recognition from Human-Body Images Using Visible-Light and Thermal Camera Videos Based on a Convolutional Neural Network for Image Feature Extraction.

PubMed

Nguyen, Dat Tien; Kim, Ki Wan; Hong, Hyung Gil; Koo, Ja Hyung; Kim, Min Cheol; Park, Kang Ryoung

2017-03-20

Extracting powerful image features plays an important role in computer vision systems. Many methods have previously been proposed to extract image features for various computer vision applications, such as the scale-invariant feature transform (SIFT), speed-up robust feature (SURF), local binary patterns (LBP), histogram of oriented gradients (HOG), and weighted HOG. Recently, the convolutional neural network (CNN) method for image feature extraction and classification in computer vision has been used in various applications. In this research, we propose a new gender recognition method for recognizing males and females in observation scenes of surveillance systems based on feature extraction from visible-light and thermal camera videos through CNN. Experimental results confirm the superiority of our proposed method over state-of-the-art recognition methods for the gender recognition problem using human body images.

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

Cortical network architecture for context processing in primate brain

PubMed Central

Chao, Zenas C; Nagasaka, Yasuo; Fujii, Naotaka

2015-01-01

Context is information linked to a situation that can guide behavior. In the brain, context is encoded by sensory processing and can later be retrieved from memory. How context is communicated within the cortical network in sensory and mnemonic forms is unknown due to the lack of methods for high-resolution, brain-wide neuronal recording and analysis. Here, we report the comprehensive architecture of a cortical network for context processing. Using hemisphere-wide, high-density electrocorticography, we measured large-scale neuronal activity from monkeys observing videos of agents interacting in situations with different contexts. We extracted five context-related network structures including a bottom-up network during encoding and, seconds later, cue-dependent retrieval of the same network with the opposite top-down connectivity. These findings show that context is represented in the cortical network as distributed communication structures with dynamic information flows. This study provides a general methodology for recording and analyzing cortical network neuronal communication during cognition. DOI: http://dx.doi.org/10.7554/eLife.06121.001 PMID:26416139

A Computational Solution to Automatically Map Metabolite Libraries in the Context of Genome Scale Metabolic Networks.

PubMed

Merlet, Benjamin; Paulhe, Nils; Vinson, Florence; Frainay, Clément; Chazalviel, Maxime; Poupin, Nathalie; Gloaguen, Yoann; Giacomoni, Franck; Jourdan, Fabien

2016-01-01

This article describes a generic programmatic method for mapping chemical compound libraries on organism-specific metabolic networks from various databases (KEGG, BioCyc) and flat file formats (SBML and Matlab files). We show how this pipeline was successfully applied to decipher the coverage of chemical libraries set up by two metabolomics facilities MetaboHub (French National infrastructure for metabolomics and fluxomics) and Glasgow Polyomics (GP) on the metabolic networks available in the MetExplore web server. The present generic protocol is designed to formalize and reduce the volume of information transfer between the library and the network database. Matching of metabolites between libraries and metabolic networks is based on InChIs or InChIKeys and therefore requires that these identifiers are specified in both libraries and networks. In addition to providing covering statistics, this pipeline also allows the visualization of mapping results in the context of metabolic networks. In order to achieve this goal, we tackled issues on programmatic interaction between two servers, improvement of metabolite annotation in metabolic networks and automatic loading of a mapping in genome scale metabolic network analysis tool MetExplore. It is important to note that this mapping can also be performed on a single or a selection of organisms of interest and is thus not limited to large facilities.

Scaling-up camera traps: monitoring the planet's biodiversity with networks of remote sensors

USGS Publications Warehouse

Steenweg, Robin; Hebblewhite, Mark; Kays, Roland; Ahumada, Jorge A.; Fisher, Jason T.; Burton, Cole; Townsend, Susan E.; Carbone, Chris; Rowcliffe, J. Marcus; Whittington, Jesse; Brodie, Jedediah; Royle, Andy; Switalski, Adam; Clevenger, Anthony P.; Heim, Nicole; Rich, Lindsey N.

2017-01-01

Countries committed to implementing the Convention on Biological Diversity's 2011–2020 strategic plan need effective tools to monitor global trends in biodiversity. Remote cameras are a rapidly growing technology that has great potential to transform global monitoring for terrestrial biodiversity and can be an important contributor to the call for measuring Essential Biodiversity Variables. Recent advances in camera technology and methods enable researchers to estimate changes in abundance and distribution for entire communities of animals and to identify global drivers of biodiversity trends. We suggest that interconnected networks of remote cameras will soon monitor biodiversity at a global scale, help answer pressing ecological questions, and guide conservation policy. This global network will require greater collaboration among remote-camera studies and citizen scientists, including standardized metadata, shared protocols, and security measures to protect records about sensitive species. With modest investment in infrastructure, and continued innovation, synthesis, and collaboration, we envision a global network of remote cameras that not only provides real-time biodiversity data but also serves to connect people with nature.

Atomic switch networks-nanoarchitectonic design of a complex system for natural computing.

PubMed

Demis, E C; Aguilera, R; Sillin, H O; Scharnhorst, K; Sandouk, E J; Aono, M; Stieg, A Z; Gimzewski, J K

2015-05-22

Self-organized complex systems are ubiquitous in nature, and the structural complexity of these natural systems can be used as a model to design new classes of functional nanotechnology based on highly interconnected networks of interacting units. Conventional fabrication methods for electronic computing devices are subject to known scaling limits, confining the diversity of possible architectures. This work explores methods of fabricating a self-organized complex device known as an atomic switch network and discusses its potential utility in computing. Through a merger of top-down and bottom-up techniques guided by mathematical and nanoarchitectonic design principles, we have produced functional devices comprising nanoscale elements whose intrinsic nonlinear dynamics and memorization capabilities produce robust patterns of distributed activity and a capacity for nonlinear transformation of input signals when configured in the appropriate network architecture. Their operational characteristics represent a unique potential for hardware implementation of natural computation, specifically in the area of reservoir computing-a burgeoning field that investigates the computational aptitude of complex biologically inspired systems.

Network Events on Multiple Space and Time Scales in Cultured Neural Networks and in a Stochastic Rate Model

PubMed Central

Gigante, Guido; Deco, Gustavo; Marom, Shimon; Del Giudice, Paolo

2015-01-01

Cortical networks, in-vitro as well as in-vivo, can spontaneously generate a variety of collective dynamical events such as network spikes, UP and DOWN states, global oscillations, and avalanches. Though each of them has been variously recognized in previous works as expression of the excitability of the cortical tissue and the associated nonlinear dynamics, a unified picture of the determinant factors (dynamical and architectural) is desirable and not yet available. Progress has also been partially hindered by the use of a variety of statistical measures to define the network events of interest. We propose here a common probabilistic definition of network events that, applied to the firing activity of cultured neural networks, highlights the co-occurrence of network spikes, power-law distributed avalanches, and exponentially distributed ‘quasi-orbits’, which offer a third type of collective behavior. A rate model, including synaptic excitation and inhibition with no imposed topology, synaptic short-term depression, and finite-size noise, accounts for all these different, coexisting phenomena. We find that their emergence is largely regulated by the proximity to an oscillatory instability of the dynamics, where the non-linear excitable behavior leads to a self-amplification of activity fluctuations over a wide range of scales in space and time. In this sense, the cultured network dynamics is compatible with an excitation-inhibition balance corresponding to a slightly sub-critical regime. Finally, we propose and test a method to infer the characteristic time of the fatigue process, from the observed time course of the network’s firing rate. Unlike the model, possessing a single fatigue mechanism, the cultured network appears to show multiple time scales, signalling the possible coexistence of different fatigue mechanisms. PMID:26558616

High-resolution of particle contacts via fluorophore exclusion in deep-imaging of jammed colloidal packings

NASA Astrophysics Data System (ADS)

Kyeyune-Nyombi, Eru; Morone, Flaviano; Liu, Wenwei; Li, Shuiqing; Gilchrist, M. Lane; Makse, Hernán A.

2018-01-01

Understanding the structural properties of random packings of jammed colloids requires an unprecedented high-resolution determination of the contact network providing mechanical stability to the packing. Here, we address the determination of the contact network by a novel strategy based on fluorophore signal exclusion of quantum dot nanoparticles from the contact points. We use fluorescence labeling schemes on particles inspired by biology and biointerface science in conjunction with fluorophore exclusion at the contact region. The method provides high-resolution contact network data that allows us to measure structural properties of the colloidal packing near marginal stability. We determine scaling laws of force distributions, soft modes, correlation functions, coordination number and free volume that define the universality class of jammed colloidal packings and can be compared with theoretical predictions. The contact detection method opens up further experimental testing at the interface of jamming and glass physics.

Controllability of multiplex, multi-time-scale networks

NASA Astrophysics Data System (ADS)

Pósfai, Márton; Gao, Jianxi; Cornelius, Sean P.; Barabási, Albert-László; D'Souza, Raissa M.

2016-09-01

The paradigm of layered networks is used to describe many real-world systems, from biological networks to social organizations and transportation systems. While recently there has been much progress in understanding the general properties of multilayer networks, our understanding of how to control such systems remains limited. One fundamental aspect that makes this endeavor challenging is that each layer can operate at a different time scale; thus, we cannot directly apply standard ideas from structural control theory of individual networks. Here we address the problem of controlling multilayer and multi-time-scale networks focusing on two-layer multiplex networks with one-to-one interlayer coupling. We investigate the practically relevant case when the control signal is applied to the nodes of one layer. We develop a theory based on disjoint path covers to determine the minimum number of inputs (Ni) necessary for full control. We show that if both layers operate on the same time scale, then the network structure of both layers equally affect controllability. In the presence of time-scale separation, controllability is enhanced if the controller interacts with the faster layer: Ni decreases as the time-scale difference increases up to a critical time-scale difference, above which Ni remains constant and is completely determined by the faster layer. We show that the critical time-scale difference is large if layer I is easy and layer II is hard to control in isolation. In contrast, control becomes increasingly difficult if the controller interacts with the layer operating on the slower time scale and increasing time-scale separation leads to increased Ni, again up to a critical value, above which Ni still depends on the structure of both layers. This critical value is largely determined by the longest path in the faster layer that does not involve cycles. By identifying the underlying mechanisms that connect time-scale difference and controllability for a simplified model, we provide crucial insight into disentangling how our ability to control real interacting complex systems is affected by a variety of sources of complexity.

Modeling the Lower Part of the Topside Ionospheric Vertical Electron Density Profile Over the European Region by Means of Swarm Satellites Data and IRI UP Method

NASA Astrophysics Data System (ADS)

Pignalberi, A.; Pezzopane, M.; Rizzi, R.

2018-03-01

An empirical method to model the lower part of the ionospheric topside region from the F2 layer peak height to about 500-600 km of altitude over the European region is proposed. The method is based on electron density values recorded from December 2013 to June 2016 by Swarm satellites and on foF2 and hmF2 values provided by IRI UP (International Reference Ionosphere UPdate), which is a method developed to update the IRI model relying on the assimilation of foF2 and M(3000)F2 data routinely recorded by a network of European ionosonde stations. Topside effective scale heights are calculated by fitting some definite analytical functions (α-Chapman, β-Chapman, Epstein, and exponential) through the values recorded by Swarm and the ones output by IRI UP, with the assumption that the effective scale height is constant in the altitude range considered. Calculated effective scale heights are then modeled as a function of foF2 and hmF2, in order to be operationally applicable to both ionosonde measurements and ionospheric models, like IRI. The method produces two-dimensional grids of the median effective scale height binned as a function of foF2 and hmF2, for each of the considered topside profiles. A statistical comparison with Constellation Observing System for Meteorology, Ionosphere, and Climate/FORMOsa SATellite-3 collected Radio Occultation profiles is carried out to assess the validity of the proposed method and to investigate which of the considered topside profiles is the best one. The α-Chapman topside function displays the best performance compared to the others and also when compared to the NeQuick topside option of IRI.

Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks

NASA Astrophysics Data System (ADS)

Eom, Young-Ho; Jo, Hang-Hyun

2015-05-01

Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributions in large-scale networks only using local information of a small fraction of sampled nodes. Here we propose a tail-scope method based on local observational bias of the friendship paradox. We show that the tail-scope method outperforms the uniform node sampling for estimating heavy tails of degree distributions, while the opposite tendency is observed in the range of small degrees. In order to take advantages of both sampling methods, we devise the hybrid method that successfully recovers the whole range of degree distributions. Our tail-scope method shows how structural heterogeneities of large-scale complex networks can be used to effectively reveal the network structure only with limited local information.

Performance of Social Network Sensors during Hurricane Sandy

PubMed Central

Kryvasheyeu, Yury; Chen, Haohui; Moro, Esteban; Van Hentenryck, Pascal; Cebrian, Manuel

2015-01-01

Information flow during catastrophic events is a critical aspect of disaster management. Modern communication platforms, in particular online social networks, provide an opportunity to study such flow and derive early-warning sensors, thus improving emergency preparedness and response. Performance of the social networks sensor method, based on topological and behavioral properties derived from the “friendship paradox”, is studied here for over 50 million Twitter messages posted before, during, and after Hurricane Sandy. We find that differences in users’ network centrality effectively translate into moderate awareness advantage (up to 26 hours); and that geo-location of users within or outside of the hurricane-affected area plays a significant role in determining the scale of such an advantage. Emotional response appears to be universal regardless of the position in the network topology, and displays characteristic, easily detectable patterns, opening a possibility to implement a simple “sentiment sensing” technique that can detect and locate disasters. PMID:25692690

Performance of social network sensors during Hurricane Sandy.

PubMed

Kryvasheyeu, Yury; Chen, Haohui; Moro, Esteban; Van Hentenryck, Pascal; Cebrian, Manuel

2015-01-01

Information flow during catastrophic events is a critical aspect of disaster management. Modern communication platforms, in particular online social networks, provide an opportunity to study such flow and derive early-warning sensors, thus improving emergency preparedness and response. Performance of the social networks sensor method, based on topological and behavioral properties derived from the "friendship paradox", is studied here for over 50 million Twitter messages posted before, during, and after Hurricane Sandy. We find that differences in users' network centrality effectively translate into moderate awareness advantage (up to 26 hours); and that geo-location of users within or outside of the hurricane-affected area plays a significant role in determining the scale of such an advantage. Emotional response appears to be universal regardless of the position in the network topology, and displays characteristic, easily detectable patterns, opening a possibility to implement a simple "sentiment sensing" technique that can detect and locate disasters.

Influence network linkages across implementation strategy conditions in a randomized controlled trial of two strategies for scaling up evidence-based practices in public youth-serving systems.

PubMed

Palinkas, Lawrence A; Holloway, Ian W; Rice, Eric; Brown, C Hendricks; Valente, Thomas W; Chamberlain, Patricia

2013-11-14

Given the importance of influence networks in the implementation of evidence-based practices and interventions, it is unclear whether such networks continue to operate as sources of information and advice when they are segmented and disrupted by randomization to different implementation strategy conditions. The present study examines the linkages across implementation strategy conditions of social influence networks of leaders of youth-serving systems in 12 California counties participating in a randomized controlled trial of community development teams (CDTs) to scale up use of an evidence-based practice. Semi-structured interviews were conducted with 38 directors, assistant directors, and program managers of county probation, mental health, and child welfare departments. A web-based survey collected additional quantitative data on information and advice networks of study participants. A mixed-methods approach to data analysis was used to create a sociometric data set (n = 176) to examine linkages between treatment and standard conditions. Of those network members who were affiliated with a county (n = 137), only 6 (4.4%) were directly connected to a member of the opposite implementation strategy condition; 19 (13.9%) were connected by two steps or fewer to a member of the opposite implementation strategy condition; 64 (46.7%) were connected by three or fewer steps to a member of the opposite implementation strategy condition. Most of the indirect steps between individuals who were in different implementation strategy conditions were connections involving a third non-county organizational entity that had an important role in the trial in keeping the implementation strategy conditions separate. When these entities were excluded, the CDT network exhibited fewer components and significantly higher betweenness centralization than did the standard condition network. Although the integrity of the RCT in this instance was not compromised by study participant influence networks, RCT designs should consider how influence networks may extend beyond boundaries established by the randomization process in implementation studies. NCT00880126.

Magnetron Sputtered Pulsed Laser Deposition Scale Up

DTIC Science & Technology

2003-08-14

2:721-726 34 S. J. P. Laube and E. F. Stark, “ Artificial Intellegence in Process Control of Pulsed Laser Deposition”, Proceedings of...The model would be based on mathematical simulation of real process data, neural-networks, or other artificial intelligence methods based on in situ...Laube and E. F. Stark, Proc. Symp. Artificial Intel. Real Time Control, Valencia, Spain, 3-5 Oct. ,1994, p.159-163. International Federation of

Synaptic up-scaling preserves motor circuit output after chronic, natural inactivity

PubMed Central

Vallejo, Mauricio; Hartzler, Lynn K

2017-01-01

Neural systems use homeostatic plasticity to maintain normal brain functions and to prevent abnormal activity. Surprisingly, homeostatic mechanisms that regulate circuit output have mainly been demonstrated during artificial and/or pathological perturbations. Natural, physiological scenarios that activate these stabilizing mechanisms in neural networks of mature animals remain elusive. To establish the extent to which a naturally inactive circuit engages mechanisms of homeostatic plasticity, we utilized the respiratory motor circuit in bullfrogs that normally remains inactive for several months during the winter. We found that inactive respiratory motoneurons exhibit a classic form of homeostatic plasticity, up-scaling of AMPA-glutamate receptors. Up-scaling increased the synaptic strength of respiratory motoneurons and acted to boost motor amplitude from the respiratory network following months of inactivity. Our results show that synaptic scaling sustains strength of the respiratory motor output following months of inactivity, thereby supporting a major neuroscience hypothesis in a normal context for an adult animal. PMID:28914603

Estimation of Global Network Statistics from Incomplete Data

PubMed Central

Bliss, Catherine A.; Danforth, Christopher M.; Dodds, Peter Sheridan

2014-01-01

Complex networks underlie an enormous variety of social, biological, physical, and virtual systems. A profound complication for the science of complex networks is that in most cases, observing all nodes and all network interactions is impossible. Previous work addressing the impacts of partial network data is surprisingly limited, focuses primarily on missing nodes, and suggests that network statistics derived from subsampled data are not suitable estimators for the same network statistics describing the overall network topology. We generate scaling methods to predict true network statistics, including the degree distribution, from only partial knowledge of nodes, links, or weights. Our methods are transparent and do not assume a known generating process for the network, thus enabling prediction of network statistics for a wide variety of applications. We validate analytical results on four simulated network classes and empirical data sets of various sizes. We perform subsampling experiments by varying proportions of sampled data and demonstrate that our scaling methods can provide very good estimates of true network statistics while acknowledging limits. Lastly, we apply our techniques to a set of rich and evolving large-scale social networks, Twitter reply networks. Based on 100 million tweets, we use our scaling techniques to propose a statistical characterization of the Twitter Interactome from September 2008 to November 2008. Our treatment allows us to find support for Dunbar's hypothesis in detecting an upper threshold for the number of active social contacts that individuals maintain over the course of one week. PMID:25338183

Population size estimation of female sex workers in Iran: Synthesis of methods and results

PubMed Central

Sharifi, Hamid; Karamouzian, Mohammad; Baneshi, Mohammad Reza; Shokoohi, Mostafa; Haghdoost, AliAkbar; McFarland, Willi

2017-01-01

Introduction Estimating the number of key populations at risk of HIV is essential for planning, monitoring, and evaluating prevention, care, and treatment programmes. We conducted this study to estimate the number of female sex workers (FSW) in major cities of Iran. Methods We used three population size estimation methods (i.e., wisdom of the crowds, multiplier method, and network scale-up) to calculate the number of FSW in 13 cities in Iran. The wisdom of the crowds and multiplier methods were integrated into a nationwide bio-behavioural surveillance survey in 2015, and the network scale-up method was included in a national survey of the general population in 2014. The median of the three methods was used to calculate the proportion of the adult female population who practice sex work in the 13 cities. These figures were then extrapolated to provide a national population size estimation of FSW across urban areas. Results The population size of FSW was 91,500 (95% Uncertainty Intervals [UIs] 61,400–117,700), corresponding to 1.43% (95% UIs 0.96–1.84) of the adult (i.e., 15–49 year-old) female population living in these 13 cities. The projected numbers of FSW for all 31 provincial capital cities were 130,800 (95% UIs 87,800–168,200) and 228,700 (95% UIs 153,500–294,300) for all urban settings in Iran. Conclusions Using methods of comparable rigor, our study provided a data-driven national estimate of the population size of FSW in urban areas of Iran. Our findings provide vital information for enhancing HIV programme planning and lay a foundation for assessing the impact of harm reduction efforts within this marginalized population. PMID:28796847

Dominating Scale-Free Networks Using Generalized Probabilistic Methods

PubMed Central

Molnár,, F.; Derzsy, N.; Czabarka, É.; Székely, L.; Szymanski, B. K.; Korniss, G.

2014-01-01

We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for applications. We propose two novel probabilistic dominating set selection strategies that are applicable to heterogeneous networks. One of them obtains the smallest probabilistic dominating set and also outperforms the deterministic degree-ranked method. We show that a degree-dependent probabilistic selection method becomes optimal in its deterministic limit. In addition, we also find the precise limit where selecting high-degree nodes exclusively becomes inefficient for network domination. We validate our results on several real-world networks, and provide highly accurate analytical estimates for our methods. PMID:25200937

Empirical Comparison of Visualization Tools for Larger-Scale Network Analysis

DOE PAGES

Pavlopoulos, Georgios A.; Paez-Espino, David; Kyrpides, Nikos C.; ...

2017-07-18

Gene expression, signal transduction, protein/chemical interactions, biomedical literature cooccurrences, and other concepts are often captured in biological network representations where nodes represent a certain bioentity and edges the connections between them. While many tools to manipulate, visualize, and interactively explore such networks already exist, only few of them can scale up and follow today’s indisputable information growth. In this review, we shortly list a catalog of available network visualization tools and, from a user-experience point of view, we identify four candidate tools suitable for larger-scale network analysis, visualization, and exploration. Lastly, we comment on their strengths and their weaknesses andmore » empirically discuss their scalability, user friendliness, and postvisualization capabilities.« less

Empirical Comparison of Visualization Tools for Larger-Scale Network Analysis

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

Pavlopoulos, Georgios A.; Paez-Espino, David; Kyrpides, Nikos C.

Gene expression, signal transduction, protein/chemical interactions, biomedical literature cooccurrences, and other concepts are often captured in biological network representations where nodes represent a certain bioentity and edges the connections between them. While many tools to manipulate, visualize, and interactively explore such networks already exist, only few of them can scale up and follow today’s indisputable information growth. In this review, we shortly list a catalog of available network visualization tools and, from a user-experience point of view, we identify four candidate tools suitable for larger-scale network analysis, visualization, and exploration. Lastly, we comment on their strengths and their weaknesses andmore » empirically discuss their scalability, user friendliness, and postvisualization capabilities.« less

Classification of spontaneous EEG signals in migraine

NASA Astrophysics Data System (ADS)

Bellotti, R.; De Carlo, F.; de Tommaso, M.; Lucente, M.

2007-08-01

We set up a classification system able to detect patients affected by migraine without aura, through the analysis of their spontaneous EEG patterns. First, the signals are characterized by means of wavelet-based features, than a supervised neural network is used to classify the multichannel data. For the feature extraction, scale-dependent and scale-independent methods are considered with a variety of wavelet functions. Both the approaches provide very high and almost comparable classification performances. A complete separation of the two groups is obtained when the data are plotted in the plane spanned by two suitable neural outputs.

The Frequency of Alcohol Use in Iranian Urban Population: The Results of a National Network Scale Up Survey.

PubMed

Nikfarjam, Ali; Hajimaghsoudi, Saiedeh; Rastegari, Azam; Haghdoost, Ali Akbar; Nasehi, Abbas Ali; Memaryan, Nadereh; Tarjoman, Terme; Baneshi, Mohammad Reza

2016-08-17

In Islamic countries alcohol consumption is considered as against religious values. Therefore, estimation of frequency of alcohol consumptions using direct methods is prone to different biases. In this study, we indirectly estimated the frequency of alcohol use in Iran, in network of a representative sample using network scale up (NSU) method. In a national survey, about 400 participants aged above 18 at each province, around 12 000 in total, were recruited. In a gender-match face to face interview, respondents were asked about the number of those who used alcohol (even one episode) in previous year in their active social network, classified by age and gender. The results were corrected for the level of visibility of alcohol consumption. The relative frequency of alcohol use at least once in previous year, among general population aged above 15, was estimated at 2.31% (95% CI: 2.12%, 2.53%). The relative frequency among males was about 8 times higher than females (4.13% versus 0.56%). The relative frequency among those aged 18 to 30 was 3 times higher than those aged above 30 (3.97% versus 1.36%). The relative frequency among male aged 18 to 30 was about 7%. It seems that the NSU is a feasible method to monitor the relative frequency of alcohol use in Iran, and possibly in countries with similar culture. Alcohol use was lower than non-Muslim countries, however, its relative frequency, in particular in young males, was noticeable. © 2017 The Author(s); Published by Kerman University of Medical Sciences. This is an open-access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

The Mathematics of Networks Science: Scale-Free, Power-Law Graphs and Continuum Theoretical Analysis

ERIC Educational Resources Information Center

Padula, Janice

2012-01-01

When hoping to initiate or sustain students' interest in mathematics teachers should always consider relevance, relevance to students' lives and in the middle and later years of instruction in high school and university, accessibility. A topic such as the mathematics behind networks science, more specifically scale-free graphs, is up-to-date,…

Real-time method for establishing a detection map for a network of sensors

DOEpatents

Nguyen, Hung D; Koch, Mark W; Giron, Casey; Rondeau, Daniel M; Russell, John L

2012-09-11

A method for establishing a detection map of a dynamically configurable sensor network. This method determines an appropriate set of locations for a plurality of sensor units of a sensor network and establishes a detection map for the network of sensors while the network is being set up; the detection map includes the effects of the local terrain and individual sensor performance. Sensor performance is characterized during the placement of the sensor units, which enables dynamic adjustment or reconfiguration of the placement of individual elements of the sensor network during network set-up to accommodate variations in local terrain and individual sensor performance. The reconfiguration of the network during initial set-up to accommodate deviations from idealized individual sensor detection zones improves the effectiveness of the sensor network in detecting activities at a detection perimeter and can provide the desired sensor coverage of an area while minimizing unintentional gaps in coverage.

The Pennsylvania Positive Behavior Support Network: Describing Our Scale-Up

ERIC Educational Resources Information Center

Runge, Timothy J.; Longwill, Douglas A.; Staszkiewicz, Mark J.; Palmiero, James; Lawson, Tina M.

2016-01-01

Pennsylvania began scaling up high-fidelity implementation of SchoolWide Positive Behavioral Interventions and Supports (SWPBIS) in 2006-2007 due to converging regulatory, legal, ethical, and practical influences. The Pennsylvania Community of Practice on School-Based Behavioral Health adopted Algozzine et al.'s (2010) blueprint to describe and…

ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies.

PubMed

Ren, Yuanfang; Sarkar, Aisharjya; Kahveci, Tamer

2018-06-26

Identifying motifs in biological networks is essential in uncovering key functions served by these networks. Finding non-overlapping motif instances is however a computationally challenging task. The fact that biological interactions are uncertain events further complicates the problem, as it makes the existence of an embedding of a given motif an uncertain event as well. In this paper, we develop a novel method, ProMotE (Probabilistic Motif Embedding), to count non-overlapping embeddings of a given motif in probabilistic networks. We utilize a polynomial model to capture the uncertainty. We develop three strategies to scale our algorithm to large networks. Our experiments demonstrate that our method scales to large networks in practical time with high accuracy where existing methods fail. Moreover, our experiments on cancer and degenerative disease networks show that our method helps in uncovering key functional characteristics of biological networks.

Population size estimation of female sex workers in Iran: Synthesis of methods and results.

PubMed

Sharifi, Hamid; Karamouzian, Mohammad; Baneshi, Mohammad Reza; Shokoohi, Mostafa; Haghdoost, AliAkbar; McFarland, Willi; Mirzazadeh, Ali

2017-01-01

Estimating the number of key populations at risk of HIV is essential for planning, monitoring, and evaluating prevention, care, and treatment programmes. We conducted this study to estimate the number of female sex workers (FSW) in major cities of Iran. We used three population size estimation methods (i.e., wisdom of the crowds, multiplier method, and network scale-up) to calculate the number of FSW in 13 cities in Iran. The wisdom of the crowds and multiplier methods were integrated into a nationwide bio-behavioural surveillance survey in 2015, and the network scale-up method was included in a national survey of the general population in 2014. The median of the three methods was used to calculate the proportion of the adult female population who practice sex work in the 13 cities. These figures were then extrapolated to provide a national population size estimation of FSW across urban areas. The population size of FSW was 91,500 (95% Uncertainty Intervals [UIs] 61,400-117,700), corresponding to 1.43% (95% UIs 0.96-1.84) of the adult (i.e., 15-49 year-old) female population living in these 13 cities. The projected numbers of FSW for all 31 provincial capital cities were 130,800 (95% UIs 87,800-168,200) and 228,700 (95% UIs 153,500-294,300) for all urban settings in Iran. Using methods of comparable rigor, our study provided a data-driven national estimate of the population size of FSW in urban areas of Iran. Our findings provide vital information for enhancing HIV programme planning and lay a foundation for assessing the impact of harm reduction efforts within this marginalized population.

Accurate prediction of protein–protein interactions from sequence alignments using a Bayesian method

PubMed Central

Burger, Lukas; van Nimwegen, Erik

2008-01-01

Accurate and large-scale prediction of protein–protein interactions directly from amino-acid sequences is one of the great challenges in computational biology. Here we present a new Bayesian network method that predicts interaction partners using only multiple alignments of amino-acid sequences of interacting protein domains, without tunable parameters, and without the need for any training examples. We first apply the method to bacterial two-component systems and comprehensively reconstruct two-component signaling networks across all sequenced bacteria. Comparisons of our predictions with known interactions show that our method infers interaction partners genome-wide with high accuracy. To demonstrate the general applicability of our method we show that it also accurately predicts interaction partners in a recent dataset of polyketide synthases. Analysis of the predicted genome-wide two-component signaling networks shows that cognates (interacting kinase/regulator pairs, which lie adjacent on the genome) and orphans (which lie isolated) form two relatively independent components of the signaling network in each genome. In addition, while most genes are predicted to have only a small number of interaction partners, we find that 10% of orphans form a separate class of ‘hub' nodes that distribute and integrate signals to and from up to tens of different interaction partners. PMID:18277381

Toward the automated generation of genome-scale metabolic networks in the SEED.

PubMed

DeJongh, Matthew; Formsma, Kevin; Boillot, Paul; Gould, John; Rycenga, Matthew; Best, Aaron

2007-04-26

Current methods for the automated generation of genome-scale metabolic networks focus on genome annotation and preliminary biochemical reaction network assembly, but do not adequately address the process of identifying and filling gaps in the reaction network, and verifying that the network is suitable for systems level analysis. Thus, current methods are only sufficient for generating draft-quality networks, and refinement of the reaction network is still largely a manual, labor-intensive process. We have developed a method for generating genome-scale metabolic networks that produces substantially complete reaction networks, suitable for systems level analysis. Our method partitions the reaction space of central and intermediary metabolism into discrete, interconnected components that can be assembled and verified in isolation from each other, and then integrated and verified at the level of their interconnectivity. We have developed a database of components that are common across organisms, and have created tools for automatically assembling appropriate components for a particular organism based on the metabolic pathways encoded in the organism's genome. This focuses manual efforts on that portion of an organism's metabolism that is not yet represented in the database. We have demonstrated the efficacy of our method by reverse-engineering and automatically regenerating the reaction network from a published genome-scale metabolic model for Staphylococcus aureus. Additionally, we have verified that our method capitalizes on the database of common reaction network components created for S. aureus, by using these components to generate substantially complete reconstructions of the reaction networks from three other published metabolic models (Escherichia coli, Helicobacter pylori, and Lactococcus lactis). We have implemented our tools and database within the SEED, an open-source software environment for comparative genome annotation and analysis. Our method sets the stage for the automated generation of substantially complete metabolic networks for over 400 complete genome sequences currently in the SEED. With each genome that is processed using our tools, the database of common components grows to cover more of the diversity of metabolic pathways. This increases the likelihood that components of reaction networks for subsequently processed genomes can be retrieved from the database, rather than assembled and verified manually.

Environmental Response Laboratory Network

EPA Pesticide Factsheets

The ERLN as a national network of laboratories that can be ramped up as needed to support large scale environmental responses. It integrates capabilities of existing public and private sector labs, providing consistent capacity and quality data.

Spiking neural network simulation: memory-optimal synaptic event scheduling.

PubMed

Stewart, Robert D; Gurney, Kevin N

2011-06-01

Spiking neural network simulations incorporating variable transmission delays require synaptic events to be scheduled prior to delivery. Conventional methods have memory requirements that scale with the total number of synapses in a network. We introduce novel scheduling algorithms for both discrete and continuous event delivery, where the memory requirement scales instead with the number of neurons. Superior algorithmic performance is demonstrated using large-scale, benchmarking network simulations.

optGpSampler: an improved tool for uniformly sampling the solution-space of genome-scale metabolic networks.

PubMed

Megchelenbrink, Wout; Huynen, Martijn; Marchiori, Elena

2014-01-01

Constraint-based models of metabolic networks are typically underdetermined, because they contain more reactions than metabolites. Therefore the solutions to this system do not consist of unique flux rates for each reaction, but rather a space of possible flux rates. By uniformly sampling this space, an estimated probability distribution for each reaction's flux in the network can be obtained. However, sampling a high dimensional network is time-consuming. Furthermore, the constraints imposed on the network give rise to an irregularly shaped solution space. Therefore more tailored, efficient sampling methods are needed. We propose an efficient sampling algorithm (called optGpSampler), which implements the Artificial Centering Hit-and-Run algorithm in a different manner than the sampling algorithm implemented in the COBRA Toolbox for metabolic network analysis, here called gpSampler. Results of extensive experiments on different genome-scale metabolic networks show that optGpSampler is up to 40 times faster than gpSampler. Application of existing convergence diagnostics on small network reconstructions indicate that optGpSampler converges roughly ten times faster than gpSampler towards similar sampling distributions. For networks of higher dimension (i.e. containing more than 500 reactions), we observed significantly better convergence of optGpSampler and a large deviation between the samples generated by the two algorithms. optGpSampler for Matlab and Python is available for non-commercial use at: http://cs.ru.nl/~wmegchel/optGpSampler/.

Selection of neural network structure for system error correction of electro-optical tracker system with horizontal gimbal

NASA Astrophysics Data System (ADS)

Liu, Xing-fa; Cen, Ming

2007-12-01

Neural Network system error correction method is more precise than lest square system error correction method and spheric harmonics function system error correction method. The accuracy of neural network system error correction method is mainly related to the frame of Neural Network. Analysis and simulation prove that both BP neural network system error correction method and RBF neural network system error correction method have high correction accuracy; it is better to use RBF Network system error correction method than BP Network system error correction method for little studying stylebook considering training rate and neural network scale.

Localization Algorithm Based on a Spring Model (LASM) for Large Scale Wireless Sensor Networks.

PubMed

Chen, Wanming; Mei, Tao; Meng, Max Q-H; Liang, Huawei; Liu, Yumei; Li, Yangming; Li, Shuai

2008-03-15

A navigation method for a lunar rover based on large scale wireless sensornetworks is proposed. To obtain high navigation accuracy and large exploration area, highnode localization accuracy and large network scale are required. However, thecomputational and communication complexity and time consumption are greatly increasedwith the increase of the network scales. A localization algorithm based on a spring model(LASM) method is proposed to reduce the computational complexity, while maintainingthe localization accuracy in large scale sensor networks. The algorithm simulates thedynamics of physical spring system to estimate the positions of nodes. The sensor nodesare set as particles with masses and connected with neighbor nodes by virtual springs. Thevirtual springs will force the particles move to the original positions, the node positionscorrespondingly, from the randomly set positions. Therefore, a blind node position can bedetermined from the LASM algorithm by calculating the related forces with the neighbornodes. The computational and communication complexity are O(1) for each node, since thenumber of the neighbor nodes does not increase proportionally with the network scale size.Three patches are proposed to avoid local optimization, kick out bad nodes and deal withnode variation. Simulation results show that the computational and communicationcomplexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps arealmost unrelated with the network scale size.

Approximating natural connectivity of scale-free networks based on largest eigenvalue

NASA Astrophysics Data System (ADS)

Tan, S.-Y.; Wu, J.; Li, M.-J.; Lu, X.

2016-06-01

It has been recently proposed that natural connectivity can be used to efficiently characterize the robustness of complex networks. The natural connectivity has an intuitive physical meaning and a simple mathematical formulation, which corresponds to an average eigenvalue calculated from the graph spectrum. However, as a network model close to the real-world system that widely exists, the scale-free network is found difficult to obtain its spectrum analytically. In this article, we investigate the approximation of natural connectivity based on the largest eigenvalue in both random and correlated scale-free networks. It is demonstrated that the natural connectivity of scale-free networks can be dominated by the largest eigenvalue, which can be expressed asymptotically and analytically to approximate natural connectivity with small errors. Then we show that the natural connectivity of random scale-free networks increases linearly with the average degree given the scaling exponent and decreases monotonically with the scaling exponent given the average degree. Moreover, it is found that, given the degree distribution, the more assortative a scale-free network is, the more robust it is. Experiments in real networks validate our methods and results.

Post-stroke social networks, depressive symptoms, and disability in Tanzania: A prospective study.

PubMed

Saadi, Altaf; Okeng'o, Kigocha; Biseko, Maijo R; Shayo, Agness F; Mmbando, Theoflo N; Grundy, Sara J; Xu, Ai; Parker, Robert A; Wibecan, Leah; Iyer, Geetha; Onesmo, Peter M; Kapina, Boniphace N; Regenhardt, Robert W; Mateen, Farrah J

2018-01-01

Background Evidence suggests that social networks improve functional recovery after stroke, but this work has not been extended to low- and middle-income countries (LMICs). Post-stroke depression interferes with functional outcome but is understudied in LMICs. Aims To determine the relationships between social networks, disability, and depressive symptoms in patients surviving 90-days post-stroke in Dar es Salaam, Tanzania. Methods Participants ≥ 18 years, admitted ≤ 14 days of stroke onset, were enrolled. Disability was measured using the modified Rankin Scale, social networks by the Berkman-Syme social network index, and depressive symptoms by the Patient Health Questionnaire-9 (PHQ-9) by telephone interview at 90 days. A Kruskal-Wallis test or Spearman's correlation coefficient was used to assess the associations between social networks, depressive symptoms, and disability. Results Of 176 participants, 43% (n = 75) died, with an additional 11% (n = 20) lost to follow-up by 90 days. Among 81 survivors, 94% (n = 76, 57% male, average age 54 years) had complete information on all scales (mean and median follow-up time of 101 and 88 days). Thirty percent (n = 23, 41.9%, 95% confidence interval 20.2) had at least mild depressive symptoms (PHQ-9 ≥ 5 points). Nearly two-thirds (n = 46, 61%) reported ≥ 3 close friends. A higher social network index score was associated with fewer depressive symptoms (p < 0.0001) and showed a trend towards significance with lower disability (p = 0.061). Higher depressive symptom burden was correlated with higher disability (r = 0.52, p < 0.0001). Conclusion Post-stroke social isolation is associated with more depressive symptoms in Tanzania. Understanding social networks and the associated mechanisms of recovery in stroke is especially relevant in the context of limited resources.

Partnering for Improvement: Improvement Communities and Their Role in Scale Up

ERIC Educational Resources Information Center

Cannata, Marisa; Cohen-Vogel, Lora; Sorum, Michael

2017-01-01

There is increasing interest in researcher-practitioner partnerships, particularly those that take the form of a networked improvement community. In this paper, we describe the partnership between the National Center on Scaling Up Effective Schools and the Fort Worth Independent School District to build student ownership and responsibility. By…

Well test mathematical model for fractures network in tight oil reservoirs

NASA Astrophysics Data System (ADS)

Diwu, Pengxiang; Liu, Tongjing; Jiang, Baoyi; Wang, Rui; Yang, Peidie; Yang, Jiping; Wang, Zhaoming

2018-02-01

Well test, especially build-up test, has been applied widely in the development of tight oil reservoirs, since it is the only available low cost way to directly quantify flow ability and formation heterogeneity parameters. However, because of the fractures network near wellbore, generated from artificial fracturing linking up natural factures, traditional infinite and finite conductivity fracture models usually result in significantly deviation in field application. In this work, considering the random distribution of natural fractures, physical model of fractures network is proposed, and it shows a composite model feature in the large scale. Consequently, a nonhomogeneous composite mathematical model is established with threshold pressure gradient. To solve this model semi-analytically, we proposed a solution approach including Laplace transform and virtual argument Bessel function, and this method is verified by comparing with existing analytical solution. The matching data of typical type curves generated from semi-analytical solution indicates that the proposed physical and mathematical model can describe the type curves characteristic in typical tight oil reservoirs, which have up warping in late-term rather than parallel lines with slope 1/2 or 1/4. It means the composite model could be used into pressure interpretation of artificial fracturing wells in tight oil reservoir.

Neocortical dynamics due to axon propagation delays in cortico-cortical fibers: EEG traveling and standing waves with implications for top-down influences on local networks and white matter disease

PubMed Central

Nunez, Paul L.; Srinivasan, Ramesh

2013-01-01

The brain is treated as a nested hierarchical complex system with substantial interactions across spatial scales. Local networks are pictured as embedded within global fields of synaptic action and action potentials. Global fields may act top-down on multiple networks, acting to bind remote networks. Because of scale-dependent properties, experimental electrophysiology requires both local and global models that match observational scales. Multiple local alpha rhythms are embedded in a global alpha rhythm. Global models are outlined in which cm-scale dynamic behaviors result largely from propagation delays in cortico-cortical axons and cortical background excitation level, controlled by neuromodulators on long time scales. The idealized global models ignore the bottom-up influences of local networks on global fields so as to employ relatively simple mathematics. The resulting models are transparently related to several EEG and steady state visually evoked potentials correlated with cognitive states, including estimates of neocortical coherence structure, traveling waves, and standing waves. The global models suggest that global oscillatory behavior of self-sustained (limit-cycle) modes lower than about 20 Hz may easily occur in neocortical/white matter systems provided: Background cortical excitability is sufficiently high; the strength of long cortico-cortical axon systems is sufficiently high; and the bottom-up influence of local networks on the global dynamic field is sufficiently weak. The global models provide "entry points" to more detailed studies of global top-down influences, including binding of weakly connected networks, modulation of gamma oscillations by theta or alpha rhythms, and the effects of white matter deficits. PMID:24505628

Experimental performance evaluation of software defined networking (SDN) based data communication networks for large scale flexi-grid optical networks.

PubMed

Zhao, Yongli; He, Ruiying; Chen, Haoran; Zhang, Jie; Ji, Yuefeng; Zheng, Haomian; Lin, Yi; Wang, Xinbo

2014-04-21

Software defined networking (SDN) has become the focus in the current information and communication technology area because of its flexibility and programmability. It has been introduced into various network scenarios, such as datacenter networks, carrier networks, and wireless networks. Optical transport network is also regarded as an important application scenario for SDN, which is adopted as the enabling technology of data communication networks (DCN) instead of general multi-protocol label switching (GMPLS). However, the practical performance of SDN based DCN for large scale optical networks, which is very important for the technology selection in the future optical network deployment, has not been evaluated up to now. In this paper we have built a large scale flexi-grid optical network testbed with 1000 virtual optical transport nodes to evaluate the performance of SDN based DCN, including network scalability, DCN bandwidth limitation, and restoration time. A series of network performance parameters including blocking probability, bandwidth utilization, average lightpath provisioning time, and failure restoration time have been demonstrated under various network environments, such as with different traffic loads and different DCN bandwidths. The demonstration in this work can be taken as a proof for the future network deployment.

Detecting the Influence of Spreading in Social Networks with Excitable Sensor Networks

PubMed Central

Pei, Sen; Tang, Shaoting; Zheng, Zhiming

2015-01-01

Detecting spreading outbreaks in social networks with sensors is of great significance in applications. Inspired by the formation mechanism of humans’ physical sensations to external stimuli, we propose a new method to detect the influence of spreading by constructing excitable sensor networks. Exploiting the amplifying effect of excitable sensor networks, our method can better detect small-scale spreading processes. At the same time, it can also distinguish large-scale diffusion instances due to the self-inhibition effect of excitable elements. Through simulations of diverse spreading dynamics on typical real-world social networks (Facebook, coauthor, and email social networks), we find that the excitable sensor networks are capable of detecting and ranking spreading processes in a much wider range of influence than other commonly used sensor placement methods, such as random, targeted, acquaintance and distance strategies. In addition, we validate the efficacy of our method with diffusion data from a real-world online social system, Twitter. We find that our method can detect more spreading topics in practice. Our approach provides a new direction in spreading detection and should be useful for designing effective detection methods. PMID:25950181

A new multi-scale method to reveal hierarchical modular structures in biological networks.

PubMed

Jiao, Qing-Ju; Huang, Yan; Shen, Hong-Bin

2016-11-15

Biological networks are effective tools for studying molecular interactions. Modular structure, in which genes or proteins may tend to be associated with functional modules or protein complexes, is a remarkable feature of biological networks. Mining modular structure from biological networks enables us to focus on a set of potentially important nodes, which provides a reliable guide to future biological experiments. The first fundamental challenge in mining modular structure from biological networks is that the quality of the observed network data is usually low owing to noise and incompleteness in the obtained networks. The second problem that poses a challenge to existing approaches to the mining of modular structure is that the organization of both functional modules and protein complexes in networks is far more complicated than was ever thought. For instance, the sizes of different modules vary considerably from each other and they often form multi-scale hierarchical structures. To solve these problems, we propose a new multi-scale protocol for mining modular structure (named ISIMB) driven by a node similarity metric, which works in an iteratively converged space to reduce the effects of the low data quality of the observed network data. The multi-scale node similarity metric couples both the local and the global topology of the network with a resolution regulator. By varying this resolution regulator to give different weightings to the local and global terms in the metric, the ISIMB method is able to fit the shape of modules and to detect them on different scales. Experiments on protein-protein interaction and genetic interaction networks show that our method can not only mine functional modules and protein complexes successfully, but can also predict functional modules from specific to general and reveal the hierarchical organization of protein complexes.

Analyzing and interpreting genome data at the network level with ConsensusPathDB.

PubMed

Herwig, Ralf; Hardt, Christopher; Lienhard, Matthias; Kamburov, Atanas

2016-10-01

ConsensusPathDB consists of a comprehensive collection of human (as well as mouse and yeast) molecular interaction data integrated from 32 different public repositories and a web interface featuring a set of computational methods and visualization tools to explore these data. This protocol describes the use of ConsensusPathDB (http://consensuspathdb.org) with respect to the functional and network-based characterization of biomolecules (genes, proteins and metabolites) that are submitted to the system either as a priority list or together with associated experimental data such as RNA-seq. The tool reports interaction network modules, biochemical pathways and functional information that are significantly enriched by the user's input, applying computational methods for statistical over-representation, enrichment and graph analysis. The results of this protocol can be observed within a few minutes, even with genome-wide data. The resulting network associations can be used to interpret high-throughput data mechanistically, to characterize and prioritize biomarkers, to integrate different omics levels, to design follow-up functional assay experiments and to generate topology for kinetic models at different scales.

Carbon black networking in elastomers monitored by simultaneous rheological and dielectric investigations.

PubMed

Steinhauser, Dagmar; Möwes, Markus; Klüppel, Manfred

2016-12-14

The rheo-dielectric response of carbon black filled elastomer melts is investigated by dielectric relaxation spectroscopy in the frequency range from 0.1 Hz up to 10 MHz during oszillatory shearing in a plate-plate rheometer. Various concentrations and types of carbon blacks dispersed in a non-crosslinked EPDM melt are considered. It is demonstrated that during heat treatment at low strain amplitude a pronounced flocculation of filler particles takes place leading to a successive increase of the shear modulus and conductivity. Followed up by a strain sweep, the filler network breaks up and both quantities decrease simultaneously with increasing strain amplitude. Two relaxation times, obtained from a Cole-Cole fit of the dielectric spectra, are identified, which both decrease strongly with increasing flocculation time. This behaviour is analyzed in the frame of fractal network models, describing the effect of structural disorder of the conducting carbon black network on the diffusive charge transport. Significant deviations from the predictions of percolation theory are observed, which are traced back to a superimposed cluster-cluster aggregation process (CCA). During flocculation, a universal scaling behaviour holds between the conductivity and the corresponding high frequency relaxation time, which fits all the measured data. The scaling exponent agrees fairly well with the prediction obtained from CCA. It is demonstrated that the underlying basic mechanism is a change of the correlation length of the filler network, i.e. the size of the fractal heterogeneities. This decreases during flocculation due to the formation of additional conductive paths, making the system more homogeneous. An addition less pronounced effect is found from nanoscopic gaps between adjacent filler particles, which decrease during flocculation. The same universal scaling behaviour, as obtained for flocculation, is found for temperature-dependent dielectric measurements of the cured crosslinked systems, which are heated from room temperature up to 200 °C. Thereby, the conductivity decreases significantly and the relaxation time increases, indicating that the filler network breaks up randomly due to the thermal expansion of the rubber matrix.

Carbon black networking in elastomers monitored by simultaneous rheological and dielectric investigations

NASA Astrophysics Data System (ADS)

Steinhauser, Dagmar; Möwes, Markus; Klüppel, Manfred

2016-12-01

The rheo-dielectric response of carbon black filled elastomer melts is investigated by dielectric relaxation spectroscopy in the frequency range from 0.1 Hz up to 10 MHz during oszillatory shearing in a plate-plate rheometer. Various concentrations and types of carbon blacks dispersed in a non-crosslinked EPDM melt are considered. It is demonstrated that during heat treatment at low strain amplitude a pronounced flocculation of filler particles takes place leading to a successive increase of the shear modulus and conductivity. Followed up by a strain sweep, the filler network breaks up and both quantities decrease simultaneously with increasing strain amplitude. Two relaxation times, obtained from a Cole-Cole fit of the dielectric spectra, are identified, which both decrease strongly with increasing flocculation time. This behaviour is analyzed in the frame of fractal network models, describing the effect of structural disorder of the conducting carbon black network on the diffusive charge transport. Significant deviations from the predictions of percolation theory are observed, which are traced back to a superimposed cluster-cluster aggregation process (CCA). During flocculation, a universal scaling behaviour holds between the conductivity and the corresponding high frequency relaxation time, which fits all the measured data. The scaling exponent agrees fairly well with the prediction obtained from CCA. It is demonstrated that the underlying basic mechanism is a change of the correlation length of the filler network, i.e. the size of the fractal heterogeneities. This decreases during flocculation due to the formation of additional conductive paths, making the system more homogeneous. An addition less pronounced effect is found from nanoscopic gaps between adjacent filler particles, which decrease during flocculation. The same universal scaling behaviour, as obtained for flocculation, is found for temperature-dependent dielectric measurements of the cured crosslinked systems, which are heated from room temperature up to 200 °C. Thereby, the conductivity decreases significantly and the relaxation time increases, indicating that the filler network breaks up randomly due to the thermal expansion of the rubber matrix.

A hybrid multiscale Monte Carlo algorithm (HyMSMC) to cope with disparity in time scales and species populations in intracellular networks.

PubMed

Samant, Asawari; Ogunnaike, Babatunde A; Vlachos, Dionisios G

2007-05-24

The fundamental role that intrinsic stochasticity plays in cellular functions has been shown via numerous computational and experimental studies. In the face of such evidence, it is important that intracellular networks are simulated with stochastic algorithms that can capture molecular fluctuations. However, separation of time scales and disparity in species population, two common features of intracellular networks, make stochastic simulation of such networks computationally prohibitive. While recent work has addressed each of these challenges separately, a generic algorithm that can simultaneously tackle disparity in time scales and population scales in stochastic systems is currently lacking. In this paper, we propose the hybrid, multiscale Monte Carlo (HyMSMC) method that fills in this void. The proposed HyMSMC method blends stochastic singular perturbation concepts, to deal with potential stiffness, with a hybrid of exact and coarse-grained stochastic algorithms, to cope with separation in population sizes. In addition, we introduce the computational singular perturbation (CSP) method as a means of systematically partitioning fast and slow networks and computing relaxation times for convergence. We also propose a new criteria of convergence of fast networks to stochastic low-dimensional manifolds, which further accelerates the algorithm. We use several prototype and biological examples, including a gene expression model displaying bistability, to demonstrate the efficiency, accuracy and applicability of the HyMSMC method. Bistable models serve as stringent tests for the success of multiscale MC methods and illustrate limitations of some literature methods.

LFNet: A Novel Bidirectional Recurrent Convolutional Neural Network for Light-Field Image Super-Resolution.

PubMed

Wang, Yunlong; Liu, Fei; Zhang, Kunbo; Hou, Guangqi; Sun, Zhenan; Tan, Tieniu

2018-09-01

The low spatial resolution of light-field image poses significant difficulties in exploiting its advantage. To mitigate the dependency of accurate depth or disparity information as priors for light-field image super-resolution, we propose an implicitly multi-scale fusion scheme to accumulate contextual information from multiple scales for super-resolution reconstruction. The implicitly multi-scale fusion scheme is then incorporated into bidirectional recurrent convolutional neural network, which aims to iteratively model spatial relations between horizontally or vertically adjacent sub-aperture images of light-field data. Within the network, the recurrent convolutions are modified to be more effective and flexible in modeling the spatial correlations between neighboring views. A horizontal sub-network and a vertical sub-network of the same network structure are ensembled for final outputs via stacked generalization. Experimental results on synthetic and real-world data sets demonstrate that the proposed method outperforms other state-of-the-art methods by a large margin in peak signal-to-noise ratio and gray-scale structural similarity indexes, which also achieves superior quality for human visual systems. Furthermore, the proposed method can enhance the performance of light field applications such as depth estimation.

Atomic switch networks—nanoarchitectonic design of a complex system for natural computing

NASA Astrophysics Data System (ADS)

Demis, E. C.; Aguilera, R.; Sillin, H. O.; Scharnhorst, K.; Sandouk, E. J.; Aono, M.; Stieg, A. Z.; Gimzewski, J. K.

2015-05-01

Self-organized complex systems are ubiquitous in nature, and the structural complexity of these natural systems can be used as a model to design new classes of functional nanotechnology based on highly interconnected networks of interacting units. Conventional fabrication methods for electronic computing devices are subject to known scaling limits, confining the diversity of possible architectures. This work explores methods of fabricating a self-organized complex device known as an atomic switch network and discusses its potential utility in computing. Through a merger of top-down and bottom-up techniques guided by mathematical and nanoarchitectonic design principles, we have produced functional devices comprising nanoscale elements whose intrinsic nonlinear dynamics and memorization capabilities produce robust patterns of distributed activity and a capacity for nonlinear transformation of input signals when configured in the appropriate network architecture. Their operational characteristics represent a unique potential for hardware implementation of natural computation, specifically in the area of reservoir computing—a burgeoning field that investigates the computational aptitude of complex biologically inspired systems.

a Method for the Seamlines Network Automatic Selection Based on Building Vector

NASA Astrophysics Data System (ADS)

Li, P.; Dong, Y.; Hu, Y.; Li, X.; Tan, P.

2018-04-01

In order to improve the efficiency of large scale orthophoto production of city, this paper presents a method for automatic selection of seamlines network in large scale orthophoto based on the buildings' vector. Firstly, a simple model of the building is built by combining building's vector, height and DEM, and the imaging area of the building on single DOM is obtained. Then, the initial Voronoi network of the measurement area is automatically generated based on the positions of the bottom of all images. Finally, the final seamlines network is obtained by optimizing all nodes and seamlines in the network automatically based on the imaging areas of the buildings. The experimental results show that the proposed method can not only get around the building seamlines network quickly, but also remain the Voronoi network' characteristics of projection distortion minimum theory, which can solve the problem of automatic selection of orthophoto seamlines network in image mosaicking effectively.

Using Friends as Sensors to Detect Global-Scale Contagious Outbreaks

PubMed Central

Garcia-Herranz, Manuel; Moro, Esteban; Cebrian, Manuel; Christakis, Nicholas A.; Fowler, James H.

2014-01-01

Recent research has focused on the monitoring of global–scale online data for improved detection of epidemics, mood patterns, movements in the stock market political revolutions, box-office revenues, consumer behaviour and many other important phenomena. However, privacy considerations and the sheer scale of data available online are quickly making global monitoring infeasible, and existing methods do not take full advantage of local network structure to identify key nodes for monitoring. Here, we develop a model of the contagious spread of information in a global-scale, publicly-articulated social network and show that a simple method can yield not just early detection, but advance warning of contagious outbreaks. In this method, we randomly choose a small fraction of nodes in the network and then we randomly choose a friend of each node to include in a group for local monitoring. Using six months of data from most of the full Twittersphere, we show that this friend group is more central in the network and it helps us to detect viral outbreaks of the use of novel hashtags about 7 days earlier than we could with an equal-sized randomly chosen group. Moreover, the method actually works better than expected due to network structure alone because highly central actors are both more active and exhibit increased diversity in the information they transmit to others. These results suggest that local monitoring is not just more efficient, but also more effective, and it may be applied to monitor contagious processes in global–scale networks. PMID:24718030

Using friends as sensors to detect global-scale contagious outbreaks.

PubMed

Garcia-Herranz, Manuel; Moro, Esteban; Cebrian, Manuel; Christakis, Nicholas A; Fowler, James H

2014-01-01

Recent research has focused on the monitoring of global-scale online data for improved detection of epidemics, mood patterns, movements in the stock market political revolutions, box-office revenues, consumer behaviour and many other important phenomena. However, privacy considerations and the sheer scale of data available online are quickly making global monitoring infeasible, and existing methods do not take full advantage of local network structure to identify key nodes for monitoring. Here, we develop a model of the contagious spread of information in a global-scale, publicly-articulated social network and show that a simple method can yield not just early detection, but advance warning of contagious outbreaks. In this method, we randomly choose a small fraction of nodes in the network and then we randomly choose a friend of each node to include in a group for local monitoring. Using six months of data from most of the full Twittersphere, we show that this friend group is more central in the network and it helps us to detect viral outbreaks of the use of novel hashtags about 7 days earlier than we could with an equal-sized randomly chosen group. Moreover, the method actually works better than expected due to network structure alone because highly central actors are both more active and exhibit increased diversity in the information they transmit to others. These results suggest that local monitoring is not just more efficient, but also more effective, and it may be applied to monitor contagious processes in global-scale networks.

Constructing Neuronal Network Models in Massively Parallel Environments.

PubMed

Ippen, Tammo; Eppler, Jochen M; Plesser, Hans E; Diesmann, Markus

2017-01-01

Recent advances in the development of data structures to represent spiking neuron network models enable us to exploit the complete memory of petascale computers for a single brain-scale network simulation. In this work, we investigate how well we can exploit the computing power of such supercomputers for the creation of neuronal networks. Using an established benchmark, we divide the runtime of simulation code into the phase of network construction and the phase during which the dynamical state is advanced in time. We find that on multi-core compute nodes network creation scales well with process-parallel code but exhibits a prohibitively large memory consumption. Thread-parallel network creation, in contrast, exhibits speedup only up to a small number of threads but has little overhead in terms of memory. We further observe that the algorithms creating instances of model neurons and their connections scale well for networks of ten thousand neurons, but do not show the same speedup for networks of millions of neurons. Our work uncovers that the lack of scaling of thread-parallel network creation is due to inadequate memory allocation strategies and demonstrates that thread-optimized memory allocators recover excellent scaling. An analysis of the loop order used for network construction reveals that more complex tests on the locality of operations significantly improve scaling and reduce runtime by allowing construction algorithms to step through large networks more efficiently than in existing code. The combination of these techniques increases performance by an order of magnitude and harnesses the increasingly parallel compute power of the compute nodes in high-performance clusters and supercomputers.

Constructing Neuronal Network Models in Massively Parallel Environments

PubMed Central

Ippen, Tammo; Eppler, Jochen M.; Plesser, Hans E.; Diesmann, Markus

2017-01-01

Recent advances in the development of data structures to represent spiking neuron network models enable us to exploit the complete memory of petascale computers for a single brain-scale network simulation. In this work, we investigate how well we can exploit the computing power of such supercomputers for the creation of neuronal networks. Using an established benchmark, we divide the runtime of simulation code into the phase of network construction and the phase during which the dynamical state is advanced in time. We find that on multi-core compute nodes network creation scales well with process-parallel code but exhibits a prohibitively large memory consumption. Thread-parallel network creation, in contrast, exhibits speedup only up to a small number of threads but has little overhead in terms of memory. We further observe that the algorithms creating instances of model neurons and their connections scale well for networks of ten thousand neurons, but do not show the same speedup for networks of millions of neurons. Our work uncovers that the lack of scaling of thread-parallel network creation is due to inadequate memory allocation strategies and demonstrates that thread-optimized memory allocators recover excellent scaling. An analysis of the loop order used for network construction reveals that more complex tests on the locality of operations significantly improve scaling and reduce runtime by allowing construction algorithms to step through large networks more efficiently than in existing code. The combination of these techniques increases performance by an order of magnitude and harnesses the increasingly parallel compute power of the compute nodes in high-performance clusters and supercomputers. PMID:28559808

Jimena: efficient computing and system state identification for genetic regulatory networks.

PubMed

Karl, Stefan; Dandekar, Thomas

2013-10-11

Boolean networks capture switching behavior of many naturally occurring regulatory networks. For semi-quantitative modeling, interpolation between ON and OFF states is necessary. The high degree polynomial interpolation of Boolean genetic regulatory networks (GRNs) in cellular processes such as apoptosis or proliferation allows for the modeling of a wider range of node interactions than continuous activator-inhibitor models, but suffers from scaling problems for networks which contain nodes with more than ~10 inputs. Many GRNs from literature or new gene expression experiments exceed those limitations and a new approach was developed. (i) As a part of our new GRN simulation framework Jimena we introduce and setup Boolean-tree-based data structures; (ii) corresponding algorithms greatly expedite the calculation of the polynomial interpolation in almost all cases, thereby expanding the range of networks which can be simulated by this model in reasonable time. (iii) Stable states for discrete models are efficiently counted and identified using binary decision diagrams. As application example, we show how system states can now be sampled efficiently in small up to large scale hormone disease networks (Arabidopsis thaliana development and immunity, pathogen Pseudomonas syringae and modulation by cytokinins and plant hormones). Jimena simulates currently available GRNs about 10-100 times faster than the previous implementation of the polynomial interpolation model and even greater gains are achieved for large scale-free networks. This speed-up also facilitates a much more thorough sampling of continuous state spaces which may lead to the identification of new stable states. Mutants of large networks can be constructed and analyzed very quickly enabling new insights into network robustness and behavior.

Increasing Scalability of Researcher Network Extraction from the Web

NASA Astrophysics Data System (ADS)

Asada, Yohei; Matsuo, Yutaka; Ishizuka, Mitsuru

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

A ground-base Radar network to access the 3D structure of MLT winds

NASA Astrophysics Data System (ADS)

Stober, G.; Chau, J. L.; Wilhelm, S.; Jacobi, C.

2016-12-01

The mesosphere/lower thermosphere (MLT) is a highly variable atmospheric region driven by wave dynamics at various scales including planetary waves, tides and gravity waves. Some of these propagate through the MLT into the thermosphere/ionosphere carrying energy and momentum from the middle atmosphere into the upper atmosphere. To improve our understanding of the wave energetics and momentum transfer during their dissipation it is essential to characterize their space time properties. During the last two years we developed a new experimental approach to access the horizontal structure of wind fields at the MLT using a meteor radar network in Germany, which we called MMARIA - Multi-static Multi-frequency Agile Radar for Investigation of the Atmosphere. The network combines classical backscatter meteor radars and passive forward scatter radio links. We present our preliminary results using up to 7 different active and passive radio links to obtain horizontally resolved wind fields applying a statistical inverse method. The wind fields are retrieved with 15-30 minutes temporal resolution on a grid with 30x30 km horizontal spacing. Depending on the number of observed meteors, we are able to apply the wind field inversion at heights between 84-94 km. The horizontally resolved wind fields provide insights of the typical horizontal gravity wave length and the energy cascade from large scales to small scales. We present first power spectra indicating the transition from the synoptic wave scale to the gravity wave scale.

Micro-CT Pore Scale Study Of Flow In Porous Media: Effect Of Voxel Resolution

NASA Astrophysics Data System (ADS)

Shah, S.; Gray, F.; Crawshaw, J.; Boek, E.

2014-12-01

In the last few years, pore scale studies have become the key to understanding the complex fluid flow processes in the fields of groundwater remediation, hydrocarbon recovery and environmental issues related to carbon storage and capture. A pore scale study is often comprised of two key procedures: 3D pore scale imaging and numerical modelling techniques. The essence of a pore scale study is to test the physics implemented in a model of complicated fluid flow processes at one scale (microscopic) and then apply the model to solve the problems associated with water resources and oil recovery at other scales (macroscopic and field). However, the process of up-scaling from the pore scale to the macroscopic scale has encountered many challenges due to both pore scale imaging and modelling techniques. Due to the technical limitations in the imaging method, there is always a compromise between the spatial (voxel) resolution and the physical volume of the sample (field of view, FOV) to be scanned by the imaging methods, specifically X-ray micro-CT (XMT) in our case In this study, a careful analysis was done to understand the effect of voxel size, using XMT to image the 3D pore space of a variety of porous media from sandstones to carbonates scanned at different voxel resolution (4.5 μm, 6.2 μm, 8.3 μm and 10.2 μm) but keeping the scanned FOV constant for all the samples. We systematically segment the micro-CT images into three phases, the macro-pore phase, an intermediate phase (unresolved micro-pores + grains) and the grain phase and then study the effect of voxel size on the structure of the macro-pore and the intermediate phases and the fluid flow properties using lattice-Boltzmann (LB) and pore network (PN) modelling methods. We have also applied a numerical coarsening algorithm (up-scale method) to reduce the computational power and time required to accurately predict the flow properties using the LB and PN method.

Estimating the size of hidden populations using respondent-driven sampling data: Case examples from Morocco

PubMed Central

Johnston, Lisa G; McLaughlin, Katherine R; Rhilani, Houssine El; Latifi, Amina; Toufik, Abdalla; Bennani, Aziza; Alami, Kamal; Elomari, Boutaina; Handcock, Mark S

2015-01-01

Background Respondent-driven sampling is used worldwide to estimate the population prevalence of characteristics such as HIV/AIDS and associated risk factors in hard-to-reach populations. Estimating the total size of these populations is of great interest to national and international organizations, however reliable measures of population size often do not exist. Methods Successive Sampling-Population Size Estimation (SS-PSE) along with network size imputation allows population size estimates to be made without relying on separate studies or additional data (as in network scale-up, multiplier and capture-recapture methods), which may be biased. Results Ten population size estimates were calculated for people who inject drugs, female sex workers, men who have sex with other men, and migrants from sub-Sahara Africa in six different cities in Morocco. SS-PSE estimates fell within or very close to the likely values provided by experts and the estimates from previous studies using other methods. Conclusions SS-PSE is an effective method for estimating the size of hard-to-reach populations that leverages important information within respondent-driven sampling studies. The addition of a network size imputation method helps to smooth network sizes allowing for more accurate results. However, caution should be used particularly when there is reason to believe that clustered subgroups may exist within the population of interest or when the sample size is small in relation to the population. PMID:26258908

An indirect estimation of the population size of students with high-risk behaviors in select universities of medical sciences: A network scale-up study.

PubMed

Sajjadi, Homeira; Jorjoran Shushtari, Zahra; Shati, Mohsen; Salimi, Yahya; Dejman, Masoomeh; Vameghi, Meroe; Karimi, Salahedin; Mahmoodi, Zohreh

2018-01-01

Network scale-up is one of the most important indirect methods of estimating the size of clandestine populations and people with high-risk behaviors. The present study is an indirect estimation of the population size of students with high-risk behaviors in select universities of medical sciences. A total of 801 students from two University of Medical Sciences at Tehran and Alborz University of Medical Sciences were selected through convenience sampling. Six subgroups of high-risk behaviors were examined in the study, including Tramadol use, cannabis use, opium use, alcohol consumption, extramarital heterosexual intercourse, and heterosexual intercourse in return for money. To estimate the social network size in the study population, each participant was asked to name their close student friends from the two select universities. Data were collected using a checklist designed for this purpose. The participants' mean number of close friends from the selected medical universities was C = 8.14 (CI: 7.54-8.75). Within these social networks, friends with extramarital heterosexual intercourse (5.53%) and friends who consumed alcohol (4.92%) had the highest frequency, and friends who used opium (0.33%) had the lowest frequency. The variables of age, gender, marital status, type of residence and academic degree were significantly related to the likelihood of having close friends with certain high-risk behaviors (P<0.001). According to the results obtained, alcohol consumption and extramarital heterosexual intercourse are very common among students. Special HIV prevention programs are therefore necessary for this age group.

Parameterisation of multi-scale continuum perfusion models from discrete vascular networks.

PubMed

Hyde, Eoin R; Michler, Christian; Lee, Jack; Cookson, Andrew N; Chabiniok, Radek; Nordsletten, David A; Smith, Nicolas P

2013-05-01

Experimental data and advanced imaging techniques are increasingly enabling the extraction of detailed vascular anatomy from biological tissues. Incorporation of anatomical data within perfusion models is non-trivial, due to heterogeneous vessel density and disparate radii scales. Furthermore, previous idealised networks have assumed a spatially repeating motif or periodic canonical cell, thereby allowing for a flow solution via homogenisation. However, such periodicity is not observed throughout anatomical networks. In this study, we apply various spatial averaging methods to discrete vascular geometries in order to parameterise a continuum model of perfusion. Specifically, a multi-compartment Darcy model was used to provide vascular scale separation for the fluid flow. Permeability tensor fields were derived from both synthetic and anatomically realistic networks using (1) porosity-scaled isotropic, (2) Huyghe and Van Campen, and (3) projected-PCA methods. The Darcy pressure fields were compared via a root-mean-square error metric to an averaged Poiseuille pressure solution over the same domain. The method of Huyghe and Van Campen performed better than the other two methods in all simulations, even for relatively coarse networks. Furthermore, inter-compartment volumetric flux fields, determined using the spatially averaged discrete flux per unit pressure difference, were shown to be accurate across a range of pressure boundary conditions. This work justifies the application of continuum flow models to characterise perfusion resulting from flow in an underlying vascular network.

Autonomous management of a recursive area hierarchy for large scale wireless sensor networks using multiple parents

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

Cree, Johnathan Vee; Delgado-Frias, Jose

Large scale wireless sensor networks have been proposed for applications ranging from anomaly detection in an environment to vehicle tracking. Many of these applications require the networks to be distributed across a large geographic area while supporting three to five year network lifetimes. In order to support these requirements large scale wireless sensor networks of duty-cycled devices need a method of efficient and effective autonomous configuration/maintenance. This method should gracefully handle the synchronization tasks duty-cycled networks. Further, an effective configuration solution needs to recognize that in-network data aggregation and analysis presents significant benefits to wireless sensor network and should configuremore » the network in a way such that said higher level functions benefit from the logically imposed structure. NOA, the proposed configuration and maintenance protocol, provides a multi-parent hierarchical logical structure for the network that reduces the synchronization workload. It also provides higher level functions with significant inherent benefits such as but not limited to: removing network divisions that are created by single-parent hierarchies, guarantees for when data will be compared in the hierarchy, and redundancies for communication as well as in-network data aggregation/analysis/storage.« less

Expectation propagation for large scale Bayesian inference of non-linear molecular networks from perturbation data.

PubMed

Narimani, Zahra; Beigy, Hamid; Ahmad, Ashar; Masoudi-Nejad, Ali; Fröhlich, Holger

2017-01-01

Inferring the structure of molecular networks from time series protein or gene expression data provides valuable information about the complex biological processes of the cell. Causal network structure inference has been approached using different methods in the past. Most causal network inference techniques, such as Dynamic Bayesian Networks and ordinary differential equations, are limited by their computational complexity and thus make large scale inference infeasible. This is specifically true if a Bayesian framework is applied in order to deal with the unavoidable uncertainty about the correct model. We devise a novel Bayesian network reverse engineering approach using ordinary differential equations with the ability to include non-linearity. Besides modeling arbitrary, possibly combinatorial and time dependent perturbations with unknown targets, one of our main contributions is the use of Expectation Propagation, an algorithm for approximate Bayesian inference over large scale network structures in short computation time. We further explore the possibility of integrating prior knowledge into network inference. We evaluate the proposed model on DREAM4 and DREAM8 data and find it competitive against several state-of-the-art existing network inference methods.

ANI-1: an extensible neural network potential with DFT accuracy at force field computational cost† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c6sc05720a Click here for additional data file.

PubMed Central

Smith, J. S.

2017-01-01

Deep learning is revolutionizing many areas of science and technology, especially image, text, and speech recognition. In this paper, we demonstrate how a deep neural network (NN) trained on quantum mechanical (QM) DFT calculations can learn an accurate and transferable potential for organic molecules. We introduce ANAKIN-ME (Accurate NeurAl networK engINe for Molecular Energies) or ANI for short. ANI is a new method designed with the intent of developing transferable neural network potentials that utilize a highly-modified version of the Behler and Parrinello symmetry functions to build single-atom atomic environment vectors (AEV) as a molecular representation. AEVs provide the ability to train neural networks to data that spans both configurational and conformational space, a feat not previously accomplished on this scale. We utilized ANI to build a potential called ANI-1, which was trained on a subset of the GDB databases with up to 8 heavy atoms in order to predict total energies for organic molecules containing four atom types: H, C, N, and O. To obtain an accelerated but physically relevant sampling of molecular potential surfaces, we also proposed a Normal Mode Sampling (NMS) method for generating molecular conformations. Through a series of case studies, we show that ANI-1 is chemically accurate compared to reference DFT calculations on much larger molecular systems (up to 54 atoms) than those included in the training data set. PMID:28507695

Epidemic dynamics and endemic states in complex networks

NASA Astrophysics Data System (ADS)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-06-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Prediction of mean monthly river discharges in Colombia through Empirical Mode Decomposition

NASA Astrophysics Data System (ADS)

Carmona, A. M.; Poveda, G.

2015-04-01

The hydro-climatology of Colombia exhibits strong natural variability at a broad range of time scales including: inter-decadal, decadal, inter-annual, annual, intra-annual, intra-seasonal, and diurnal. Diverse applied sectors rely on quantitative predictions of river discharges for operational purposes including hydropower generation, agriculture, human health, fluvial navigation, territorial planning and management, risk preparedness and mitigation, among others. Various methodologies have been used to predict monthly mean river discharges that are based on "Predictive Analytics", an area of statistical analysis that studies the extraction of information from historical data to infer future trends and patterns. Our study couples the Empirical Mode Decomposition (EMD) with traditional methods, e.g. Autoregressive Model of Order 1 (AR1) and Neural Networks (NN), to predict mean monthly river discharges in Colombia, South America. The EMD allows us to decompose the historical time series of river discharges into a finite number of intrinsic mode functions (IMF) that capture the different oscillatory modes of different frequencies associated with the inherent time scales coexisting simultaneously in the signal (Huang et al. 1998, Huang and Wu 2008, Rao and Hsu, 2008). Our predictive method states that it is easier and simpler to predict each IMF at a time and then add them up together to obtain the predicted river discharge for a certain month, than predicting the full signal. This method is applied to 10 series of monthly mean river discharges in Colombia, using calibration periods of more than 25 years, and validation periods of about 12 years. Predictions are performed for time horizons spanning from 1 to 12 months. Our results show that predictions obtained through the traditional methods improve when the EMD is used as a previous step, since errors decrease by up to 13% when the AR1 model is used, and by up to 18% when using Neural Networks is combined with the EMD.

The impact of new forms of large-scale general practice provider collaborations on England's NHS: a systematic review.

PubMed

Pettigrew, Luisa M; Kumpunen, Stephanie; Mays, Nicholas; Rosen, Rebecca; Posaner, Rachel

2018-03-01

Over the past decade, collaboration between general practices in England to form new provider networks and large-scale organisations has been driven largely by grassroots action among GPs. However, it is now being increasingly advocated for by national policymakers. Expectations of what scaling up general practice in England will achieve are significant. To review the evidence of the impact of new forms of large-scale general practice provider collaborations in England. Systematic review. Embase, MEDLINE, Health Management Information Consortium, and Social Sciences Citation Index were searched for studies reporting the impact on clinical processes and outcomes, patient experience, workforce satisfaction, or costs of new forms of provider collaborations between general practices in England. A total of 1782 publications were screened. Five studies met the inclusion criteria and four examined the same general practice networks, limiting generalisability. Substantial financial investment was required to establish the networks and the associated interventions that were targeted at four clinical areas. Quality improvements were achieved through standardised processes, incentives at network level, information technology-enabled performance dashboards, and local network management. The fifth study of a large-scale multisite general practice organisation showed that it may be better placed to implement safety and quality processes than conventional practices. However, unintended consequences may arise, such as perceptions of disenfranchisement among staff and reductions in continuity of care. Good-quality evidence of the impacts of scaling up general practice provider organisations in England is scarce. As more general practice collaborations emerge, evaluation of their impacts will be important to understand which work, in which settings, how, and why. © British Journal of General Practice 2018.

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming

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

Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. Tomore » alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Results: Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs.« less

Disrupted coupling of large-scale networks is associated with relapse behaviour in heroin-dependent men

PubMed Central

Li, Qiang; Liu, Jierong; Wang, Wei; Wang, Yarong; Li, Wei; Chen, Jiajie; Zhu, Jia; Yan, Xuejiao; Li, Yongbin; Li, Zhe; Ye, Jianjun; Wang, Wei

2018-01-01

Background It is unknown whether impaired coupling among 3 core large-scale brain networks (salience [SN], default mode [DMN] and executive control networks [ECN]) is associated with relapse behaviour in treated heroin-dependent patients. Methods We conducted a prospective resting-state functional MRI study comparing the functional connectivity strength among healthy controls and heroin-dependent men who had either relapsed or were in early remission. Men were considered to be either relapsed or in early remission based on urine drug screens during a 3-month follow-up period. We also examined how the coupling of large-scale networks correlated with relapse behaviour among heroin-dependent men. Results We included 20 controls and 50 heroin-dependent men (26 relapsed and 24 early remission) in our analyses. The relapsed men showed greater connectivity than the early remission and control groups between the dorsal anterior cingulate cortex (key node of the SN) and the dorsomedial prefrontal cortex (included in the DMN). The relapsed men and controls showed lower connectivity than the early remission group between the left dorsolateral prefrontal cortex (key node of the left ECN) and the dorsomedial prefrontal cortex. The percentage of positive urine drug screens positively correlated with the coupling between the dorsal anterior cingulate cortex and dorsomedial prefrontal cortex, but negatively correlated with the coupling between the left dorsolateral prefrontal cortex and dorsomedial prefrontal cortex. Limitations We examined deficits in only 3 core networks leading to relapse behaviour. Other networks may also contribute to relapse. Conclusion Greater coupling between the SN and DMN and lower coupling between the left ECN and DMN is associated with relapse behaviour. These findings may shed light on the development of new treatments for heroin addiction. PMID:29252165

A neuromorphic implementation of multiple spike-timing synaptic plasticity rules for large-scale neural networks

PubMed Central

Wang, Runchun M.; Hamilton, Tara J.; Tapson, Jonathan C.; van Schaik, André

2015-01-01

We present a neuromorphic implementation of multiple synaptic plasticity learning rules, which include both Spike Timing Dependent Plasticity (STDP) and Spike Timing Dependent Delay Plasticity (STDDP). We present a fully digital implementation as well as a mixed-signal implementation, both of which use a novel dynamic-assignment time-multiplexing approach and support up to 226 (64M) synaptic plasticity elements. Rather than implementing dedicated synapses for particular types of synaptic plasticity, we implemented a more generic synaptic plasticity adaptor array that is separate from the neurons in the neural network. Each adaptor performs synaptic plasticity according to the arrival times of the pre- and post-synaptic spikes assigned to it, and sends out a weighted or delayed pre-synaptic spike to the post-synaptic neuron in the neural network. This strategy provides great flexibility for building complex large-scale neural networks, as a neural network can be configured for multiple synaptic plasticity rules without changing its structure. We validate the proposed neuromorphic implementations with measurement results and illustrate that the circuits are capable of performing both STDP and STDDP. We argue that it is practical to scale the work presented here up to 236 (64G) synaptic adaptors on a current high-end FPGA platform. PMID:26041985

Maximal Neighbor Similarity Reveals Real Communities in Networks

PubMed Central

Žalik, Krista Rizman

2015-01-01

An important problem in the analysis of network data is the detection of groups of densely interconnected nodes also called modules or communities. Community structure reveals functions and organizations of networks. Currently used algorithms for community detection in large-scale real-world networks are computationally expensive or require a priori information such as the number or sizes of communities or are not able to give the same resulting partition in multiple runs. In this paper we investigate a simple and fast algorithm that uses the network structure alone and requires neither optimization of pre-defined objective function nor information about number of communities. We propose a bottom up community detection algorithm in which starting from communities consisting of adjacent pairs of nodes and their maximal similar neighbors we find real communities. We show that the overall advantage of the proposed algorithm compared to the other community detection algorithms is its simple nature, low computational cost and its very high accuracy in detection communities of different sizes also in networks with blurred modularity structure consisting of poorly separated communities. All communities identified by the proposed method for facebook network and E-Coli transcriptional regulatory network have strong structural and functional coherence. PMID:26680448

Maximizing algebraic connectivity in air transportation networks

NASA Astrophysics Data System (ADS)

Wei, Peng

In air transportation networks the robustness of a network regarding node and link failures is a key factor for its design. An experiment based on the real air transportation network is performed to show that the algebraic connectivity is a good measure for network robustness. Three optimization problems of algebraic connectivity maximization are then formulated in order to find the most robust network design under different constraints. The algebraic connectivity maximization problem with flight routes addition or deletion is first formulated. Three methods to optimize and analyze the network algebraic connectivity are proposed. The Modified Greedy Perturbation Algorithm (MGP) provides a sub-optimal solution in a fast iterative manner. The Weighted Tabu Search (WTS) is designed to offer a near optimal solution with longer running time. The relaxed semi-definite programming (SDP) is used to set a performance upper bound and three rounding techniques are discussed to find the feasible solution. The simulation results present the trade-off among the three methods. The case study on two air transportation networks of Virgin America and Southwest Airlines show that the developed methods can be applied in real world large scale networks. The algebraic connectivity maximization problem is extended by adding the leg number constraint, which considers the traveler's tolerance for the total connecting stops. The Binary Semi-Definite Programming (BSDP) with cutting plane method provides the optimal solution. The tabu search and 2-opt search heuristics can find the optimal solution in small scale networks and the near optimal solution in large scale networks. The third algebraic connectivity maximization problem with operating cost constraint is formulated. When the total operating cost budget is given, the number of the edges to be added is not fixed. Each edge weight needs to be calculated instead of being pre-determined. It is illustrated that the edge addition and the weight assignment can not be studied separately for the problem with operating cost constraint. Therefore a relaxed SDP method with golden section search is developed to solve both at the same time. The cluster decomposition is utilized to solve large scale networks.

A mixed-integer linear programming approach to the reduction of genome-scale metabolic networks.

PubMed

Röhl, Annika; Bockmayr, Alexander

2017-01-03

Constraint-based analysis has become a widely used method to study metabolic networks. While some of the associated algorithms can be applied to genome-scale network reconstructions with several thousands of reactions, others are limited to small or medium-sized models. In 2015, Erdrich et al. introduced a method called NetworkReducer, which reduces large metabolic networks to smaller subnetworks, while preserving a set of biological requirements that can be specified by the user. Already in 2001, Burgard et al. developed a mixed-integer linear programming (MILP) approach for computing minimal reaction sets under a given growth requirement. Here we present an MILP approach for computing minimum subnetworks with the given properties. The minimality (with respect to the number of active reactions) is not guaranteed by NetworkReducer, while the method by Burgard et al. does not allow specifying the different biological requirements. Our procedure is about 5-10 times faster than NetworkReducer and can enumerate all minimum subnetworks in case there exist several ones. This allows identifying common reactions that are present in all subnetworks, and reactions appearing in alternative pathways. Applying complex analysis methods to genome-scale metabolic networks is often not possible in practice. Thus it may become necessary to reduce the size of the network while keeping important functionalities. We propose a MILP solution to this problem. Compared to previous work, our approach is more efficient and allows computing not only one, but even all minimum subnetworks satisfying the required properties.

Cascading failure in the wireless sensor scale-free networks

NASA Astrophysics Data System (ADS)

Liu, Hao-Ran; Dong, Ming-Ru; Yin, Rong-Rong; Han, Li

2015-05-01

In the practical wireless sensor networks (WSNs), the cascading failure caused by a failure node has serious impact on the network performance. In this paper, we deeply research the cascading failure of scale-free topology in WSNs. Firstly, a cascading failure model for scale-free topology in WSNs is studied. Through analyzing the influence of the node load on cascading failure, the critical load triggering large-scale cascading failure is obtained. Then based on the critical load, a control method for cascading failure is presented. In addition, the simulation experiments are performed to validate the effectiveness of the control method. The results show that the control method can effectively prevent cascading failure. Project supported by the Natural Science Foundation of Hebei Province, China (Grant No. F2014203239), the Autonomous Research Fund of Young Teacher in Yanshan University (Grant No. 14LGB017) and Yanshan University Doctoral Foundation, China (Grant No. B867).

Multiscale simulations of patchy particle systems combining Molecular Dynamics, Path Sampling and Green's Function Reaction Dynamics

NASA Astrophysics Data System (ADS)

Bolhuis, Peter

Important reaction-diffusion processes, such as biochemical networks in living cells, or self-assembling soft matter, span many orders in length and time scales. In these systems, the reactants' spatial dynamics at mesoscopic length and time scales of microns and seconds is coupled to the reactions between the molecules at microscopic length and time scales of nanometers and milliseconds. This wide range of length and time scales makes these systems notoriously difficult to simulate. While mean-field rate equations cannot describe such processes, the mesoscopic Green's Function Reaction Dynamics (GFRD) method enables efficient simulation at the particle level provided the microscopic dynamics can be integrated out. Yet, many processes exhibit non-trivial microscopic dynamics that can qualitatively change the macroscopic behavior, calling for an atomistic, microscopic description. The recently developed multiscale Molecular Dynamics Green's Function Reaction Dynamics (MD-GFRD) approach combines GFRD for simulating the system at the mesocopic scale where particles are far apart, with microscopic Molecular (or Brownian) Dynamics, for simulating the system at the microscopic scale where reactants are in close proximity. The association and dissociation of particles are treated with rare event path sampling techniques. I will illustrate the efficiency of this method for patchy particle systems. Replacing the microscopic regime with a Markov State Model avoids the microscopic regime completely. The MSM is then pre-computed using advanced path-sampling techniques such as multistate transition interface sampling. I illustrate this approach on patchy particle systems that show multiple modes of binding. MD-GFRD is generic, and can be used to efficiently simulate reaction-diffusion systems at the particle level, including the orientational dynamics, opening up the possibility for large-scale simulations of e.g. protein signaling networks.

Network Modeling and Energy-Efficiency Optimization for Advanced Machine-to-Machine Sensor Networks

PubMed Central

Jung, Sungmo; Kim, Jong Hyun; Kim, Seoksoo

2012-01-01

Wireless machine-to-machine sensor networks with multiple radio interfaces are expected to have several advantages, including high spatial scalability, low event detection latency, and low energy consumption. Here, we propose a network model design method involving network approximation and an optimized multi-tiered clustering algorithm that maximizes node lifespan by minimizing energy consumption in a non-uniformly distributed network. Simulation results show that the cluster scales and network parameters determined with the proposed method facilitate a more efficient performance compared to existing methods. PMID:23202190

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition.

PubMed

Peng, Min; Wang, Chongyang; Chen, Tong; Liu, Guangyuan; Fu, Xiaolan

2017-01-01

Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN) for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II) showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve.

Appplication of statistical mechanical methods to the modeling of social networks

NASA Astrophysics Data System (ADS)

Strathman, Anthony Robert

With the recent availability of large-scale social data sets, social networks have become open to quantitative analysis via the methods of statistical physics. We examine the statistical properties of a real large-scale social network, generated from cellular phone call-trace logs. We find this network, like many other social networks to be assortative (r = 0.31) and clustered (i.e., strongly transitive, C = 0.21). We measure fluctuation scaling to identify the presence of internal structure in the network and find that structural inhomogeneity effectively disappears at the scale of a few hundred nodes, though there is no sharp cutoff. We introduce an agent-based model of social behavior, designed to model the formation and dissolution of social ties. The model is a modified Metropolis algorithm containing agents operating under the basic sociological constraints of reciprocity, communication need and transitivity. The model introduces the concept of a social temperature. We go on to show that this simple model reproduces the global statistical network features (incl. assortativity, connected fraction, mean degree, clustering, and mean shortest path length) of the real network data and undergoes two phase transitions, one being from a "gas" to a "liquid" state and the second from a liquid to a glassy state as function of this social temperature.

Salient object detection based on multi-scale contrast.

PubMed

Wang, Hai; Dai, Lei; Cai, Yingfeng; Sun, Xiaoqiang; Chen, Long

2018-05-01

Due to the development of deep learning networks, a salient object detection based on deep learning networks, which are used to extract the features, has made a great breakthrough compared to the traditional methods. At present, the salient object detection mainly relies on very deep convolutional network, which is used to extract the features. In deep learning networks, an dramatic increase of network depth may cause more training errors instead. In this paper, we use the residual network to increase network depth and to mitigate the errors caused by depth increase simultaneously. Inspired by image simplification, we use color and texture features to obtain simplified image with multiple scales by means of region assimilation on the basis of super-pixels in order to reduce the complexity of images and to improve the accuracy of salient target detection. We refine the feature on pixel level by the multi-scale feature correction method to avoid the feature error when the image is simplified at the above-mentioned region level. The final full connection layer not only integrates features of multi-scale and multi-level but also works as classifier of salient targets. The experimental results show that proposed model achieves better results than other salient object detection models based on original deep learning networks. Copyright © 2018 Elsevier Ltd. All rights reserved.

SIOS: A regional cooperation of international research infrastructures as a building block for an Arctic observing system

NASA Astrophysics Data System (ADS)

Holmen, K. J.; Lønne, O. J.

2016-12-01

The Svalbard Integrated Earth Observing System (SIOS) is a regional response to the Earth System Science (ESS) challenges posed by the Amsterdam Declaration on Global Change. SIOS is intended to develop and implement methods for how observational networks in the Arctic are to be designed in order to address such issues in a regional scale. SIOS builds on the extensive observation capacity and research installations already in place by many international institutions and will provide upgraded and relevant Observing Systems and Research Facilities of world class in and around Svalbard. It is a distributed research infrastructure set up to provide a regional observational system for long term measurements under a joint framework. As one of the large scale research infrastructure initiatives on the ESFRI roadmap (European Strategy Forum on Research Infrastructures), SIOS is now being implemented. The new research infrastructure organization, the SIOS Knowledge Center (SIOS-KC), is instrumental in developing methods and solutions for setting up its regional contribution to a systematically constructed Arctic observational network useful for global change studies. We will discuss cross-disciplinary research experiences some case studies and lessons learned so far. SIOS aims to provide an effective, easily accessible data management system which makes use of existing data handling systems in the thematic fields covered by SIOS. SIOS will, implement a data policy which matches the ambitions that are set for the new European research infrastructures, but at the same time be flexible enough to consider `historical' legacies. Given the substantial international presence in the Svalbard archipelago and the pan-Arctic nature of the issue, there is an opportunity to build SIOS further into a wider regional network and pan-Arctic context, ideally under the umbrella of the Sustaining Arctic Observing Networks (SAON) initiative. It is necessary to anchor SIOS strongly in a European context and connect it to extra-EU initiatives, in order to establish a pan-Arctic perspective. SIOS must develop and secure a robust communication with other bodies carrying out and funding research activities in the Arctic (observational as well as modelling) and actively promote a sustained Arctic observing network.

Scalable Parameter Estimation for Genome-Scale Biochemical Reaction Networks

PubMed Central

Kaltenbacher, Barbara; Hasenauer, Jan

2017-01-01

Mechanistic mathematical modeling of biochemical reaction networks using ordinary differential equation (ODE) models has improved our understanding of small- and medium-scale biological processes. While the same should in principle hold for large- and genome-scale processes, the computational methods for the analysis of ODE models which describe hundreds or thousands of biochemical species and reactions are missing so far. While individual simulations are feasible, the inference of the model parameters from experimental data is computationally too intensive. In this manuscript, we evaluate adjoint sensitivity analysis for parameter estimation in large scale biochemical reaction networks. We present the approach for time-discrete measurement and compare it to state-of-the-art methods used in systems and computational biology. Our comparison reveals a significantly improved computational efficiency and a superior scalability of adjoint sensitivity analysis. The computational complexity is effectively independent of the number of parameters, enabling the analysis of large- and genome-scale models. Our study of a comprehensive kinetic model of ErbB signaling shows that parameter estimation using adjoint sensitivity analysis requires a fraction of the computation time of established methods. The proposed method will facilitate mechanistic modeling of genome-scale cellular processes, as required in the age of omics. PMID:28114351

Modeling virtual organizations with Latent Dirichlet Allocation: a case for natural language processing.

PubMed

Gross, Alexander; Murthy, Dhiraj

2014-10-01

This paper explores a variety of methods for applying the Latent Dirichlet Allocation (LDA) automated topic modeling algorithm to the modeling of the structure and behavior of virtual organizations found within modern social media and social networking environments. As the field of Big Data reveals, an increase in the scale of social data available presents new challenges which are not tackled by merely scaling up hardware and software. Rather, they necessitate new methods and, indeed, new areas of expertise. Natural language processing provides one such method. This paper applies LDA to the study of scientific virtual organizations whose members employ social technologies. Because of the vast data footprint in these virtual platforms, we found that natural language processing was needed to 'unlock' and render visible latent, previously unseen conversational connections across large textual corpora (spanning profiles, discussion threads, forums, and other social media incarnations). We introduce variants of LDA and ultimately make the argument that natural language processing is a critical interdisciplinary methodology to make better sense of social 'Big Data' and we were able to successfully model nested discussion topics from forums and blog posts using LDA. Importantly, we found that LDA can move us beyond the state-of-the-art in conventional Social Network Analysis techniques. Copyright © 2014 Elsevier Ltd. All rights reserved.

Joint multiple fully connected convolutional neural network with extreme learning machine for hepatocellular carcinoma nuclei grading.

PubMed

Li, Siqi; Jiang, Huiyan; Pang, Wenbo

2017-05-01

Accurate cell grading of cancerous tissue pathological image is of great importance in medical diagnosis and treatment. This paper proposes a joint multiple fully connected convolutional neural network with extreme learning machine (MFC-CNN-ELM) architecture for hepatocellular carcinoma (HCC) nuclei grading. First, in preprocessing stage, each grayscale image patch with the fixed size is obtained using center-proliferation segmentation (CPS) method and the corresponding labels are marked under the guidance of three pathologists. Next, a multiple fully connected convolutional neural network (MFC-CNN) is designed to extract the multi-form feature vectors of each input image automatically, which considers multi-scale contextual information of deep layer maps sufficiently. After that, a convolutional neural network extreme learning machine (CNN-ELM) model is proposed to grade HCC nuclei. Finally, a back propagation (BP) algorithm, which contains a new up-sample method, is utilized to train MFC-CNN-ELM architecture. The experiment comparison results demonstrate that our proposed MFC-CNN-ELM has superior performance compared with related works for HCC nuclei grading. Meanwhile, external validation using ICPR 2014 HEp-2 cell dataset shows the good generalization of our MFC-CNN-ELM architecture. Copyright © 2017 Elsevier Ltd. All rights reserved.

Wet Chemistry Synthesis of Multidimensional Nanocarbon-Sulfur Hybrid Materials with Ultrahigh Sulfur Loading for Lithium-Sulfur Batteries.

PubMed

Du, Wen-Cheng; Yin, Ya-Xia; Zeng, Xian-Xiang; Shi, Ji-Lei; Zhang, Shuai-Feng; Wan, Li-Jun; Guo, Yu-Guo

2016-02-17

An optimized nanocarbon-sulfur cathode material with ultrahigh sulfur loading of up to 90 wt % is realized in the form of sulfur nanolayer-coated three-dimensional (3D) conducting network. This 3D nanocarbon-sulfur network combines three different nanocarbons, as follows: zero-dimensional carbon nanoparticle, one-dimensional carbon nanotube, and two-dimensional graphene. This 3D nanocarbon-sulfur network is synthesized by using a method based on soluble chemistry of elemental sulfur and three types of nanocarbons in well-chosen solvents. The resultant sulfur-carbon material shows a high specific capacity of 1115 mA h g(-1) at 0.02C and good rate performance of 551 mA h g(-1) at 1C based on the mass of sulfur-carbon composite. Good battery performance can be attributed to the homogeneous compositing of sulfur with the 3D hierarchical hybrid nanocarbon networks at nanometer scale, which provides efficient multidimensional transport pathways for electrons and ions. Wet chemical method developed here provides an easy and cost-effective way to prepare sulfur-carbon cathode materials with high sulfur loading for application in high-energy Li-S batteries.

Shortwave surface radiation network for observing small-scale cloud inhomogeneity fields

NASA Astrophysics Data System (ADS)

Lakshmi Madhavan, Bomidi; Kalisch, John; Macke, Andreas

2016-03-01

As part of the High Definition Clouds and Precipitation for advancing Climate Prediction Observational Prototype Experiment (HOPE), a high-density network of 99 silicon photodiode pyranometers was set up around Jülich (10 km × 12 km area) from April to July 2013 to capture the small-scale variability of cloud-induced radiation fields at the surface. In this paper, we provide the details of this unique setup of the pyranometer network, data processing, quality control, and uncertainty assessment under variable conditions. Some exemplary days with clear, broken cloudy, and overcast skies were explored to assess the spatiotemporal observations from the network along with other collocated radiation and sky imager measurements available during the HOPE period.

Querying Large Biological Network Datasets

ERIC Educational Resources Information Center

Gulsoy, Gunhan

2013-01-01

New experimental methods has resulted in increasing amount of genetic interaction data to be generated every day. Biological networks are used to store genetic interaction data gathered. Increasing amount of data available requires fast large scale analysis methods. Therefore, we address the problem of querying large biological network datasets.…

Enhanced storage capacity with errors in scale-free Hopfield neural networks: An analytical study.

PubMed

Kim, Do-Hyun; Park, Jinha; Kahng, Byungnam

2017-01-01

The Hopfield model is a pioneering neural network model with associative memory retrieval. The analytical solution of the model in mean field limit revealed that memories can be retrieved without any error up to a finite storage capacity of O(N), where N is the system size. Beyond the threshold, they are completely lost. Since the introduction of the Hopfield model, the theory of neural networks has been further developed toward realistic neural networks using analog neurons, spiking neurons, etc. Nevertheless, those advances are based on fully connected networks, which are inconsistent with recent experimental discovery that the number of connections of each neuron seems to be heterogeneous, following a heavy-tailed distribution. Motivated by this observation, we consider the Hopfield model on scale-free networks and obtain a different pattern of associative memory retrieval from that obtained on the fully connected network: the storage capacity becomes tremendously enhanced but with some error in the memory retrieval, which appears as the heterogeneity of the connections is increased. Moreover, the error rates are also obtained on several real neural networks and are indeed similar to that on scale-free model networks.

Wireless Testbed Bonsai

DTIC Science & Technology

2006-02-01

wireless sensor device network, and a about 200 Stargate nodes higher-tier multi-hop peer- to-peer 802.11b wireless network. Leading up to the full ExScal...deployment, we conducted spatial scaling tests on our higher-tier protocols on a 7 × 7 grid of Stargates nodes 45m and with 90m separations respectively...onW and its scaled version W̃ . III. EXPERIMENTAL SETUP Description of Kansei testbed. A stargate is a single board linux-based computer [7]. It uses a

Scaling relationships and concavity of small valley networks on Mars

NASA Astrophysics Data System (ADS)

Penido, Julita C.; Fassett, Caleb I.; Som, Sanjoy M.

2013-01-01

Valley networks are widely interpreted as the preserved erosional record of water flowing across the martian surface. The manner in which valley morphometric properties scale with drainage area has been widely examined on Earth. Earlier studies assessing these properties on Mars have suggested that martian valleys are morphometrically distinct from those on Earth. However, these earlier measurements were generally made on large valley systems because of the limited topographic data available. In this study, we determine the scaling properties of valley networks at smaller scales than have been previously assessed, using digital elevation models from the High Resolution Stereo Camera (HRSC). We find a Hack's law exponent of 0.74, larger than on Earth, and our measurements also reveal that individual small valleys have concave up, concave down, and quasi-linear longitudinal profiles, consistent with earlier studies of dissected terrain on Mars. However, for many valleys, widths are observed to increase downstream similarly to how they scale in terrestrial channels. The similarities and differences between valley networks on Mars and Earth are consistent with the idea that valleys on Mars are comparatively immature, and precipitation was a likely mechanism for delivering water to these networks.

Strategic Studies Quarterly. Volume 6, Number 3. Fall 2012

DTIC Science & Technology

2012-01-01

a particular TOR site, the number of Iranian users on the network drops precipitously. It picks up again after TOR developers announce a workaround...benefit, hence value of the network , is then proportional to the area under the curve or natural log of N (lnN). The increase (decrease) in network ...necessary sensors and automation to strengthen and de­ fend network operations at the scale required for a global industry or military operations

Efficient Characterization of Parametric Uncertainty of Complex (Bio)chemical Networks.

PubMed

Schillings, Claudia; Sunnåker, Mikael; Stelling, Jörg; Schwab, Christoph

2015-08-01

Parametric uncertainty is a particularly challenging and relevant aspect of systems analysis in domains such as systems biology where, both for inference and for assessing prediction uncertainties, it is essential to characterize the system behavior globally in the parameter space. However, current methods based on local approximations or on Monte-Carlo sampling cope only insufficiently with high-dimensional parameter spaces associated with complex network models. Here, we propose an alternative deterministic methodology that relies on sparse polynomial approximations. We propose a deterministic computational interpolation scheme which identifies most significant expansion coefficients adaptively. We present its performance in kinetic model equations from computational systems biology with several hundred parameters and state variables, leading to numerical approximations of the parametric solution on the entire parameter space. The scheme is based on adaptive Smolyak interpolation of the parametric solution at judiciously and adaptively chosen points in parameter space. As Monte-Carlo sampling, it is "non-intrusive" and well-suited for massively parallel implementation, but affords higher convergence rates. This opens up new avenues for large-scale dynamic network analysis by enabling scaling for many applications, including parameter estimation, uncertainty quantification, and systems design.

Efficient Characterization of Parametric Uncertainty of Complex (Bio)chemical Networks

PubMed Central

Schillings, Claudia; Sunnåker, Mikael; Stelling, Jörg; Schwab, Christoph

2015-01-01

Parametric uncertainty is a particularly challenging and relevant aspect of systems analysis in domains such as systems biology where, both for inference and for assessing prediction uncertainties, it is essential to characterize the system behavior globally in the parameter space. However, current methods based on local approximations or on Monte-Carlo sampling cope only insufficiently with high-dimensional parameter spaces associated with complex network models. Here, we propose an alternative deterministic methodology that relies on sparse polynomial approximations. We propose a deterministic computational interpolation scheme which identifies most significant expansion coefficients adaptively. We present its performance in kinetic model equations from computational systems biology with several hundred parameters and state variables, leading to numerical approximations of the parametric solution on the entire parameter space. The scheme is based on adaptive Smolyak interpolation of the parametric solution at judiciously and adaptively chosen points in parameter space. As Monte-Carlo sampling, it is “non-intrusive” and well-suited for massively parallel implementation, but affords higher convergence rates. This opens up new avenues for large-scale dynamic network analysis by enabling scaling for many applications, including parameter estimation, uncertainty quantification, and systems design. PMID:26317784

COSMOS: COsmic-ray Soil Moisture Observing System planned for the United States

NASA Astrophysics Data System (ADS)

Zweck, C.; Zreda, M.; Shuttleworth, J.; Zeng, X.

2008-12-01

Because soil water exerts a critical control on weather, climate, ecosystem, and water cycle, understanding soil moisture changes in time and space is crucial for many fields within natural sciences. A serious handicap in soil moisture measurements is the mismatch between limited point measurements using contact methods and remote sensing estimates over large areas. We present a novel method to measure soil moisture non- invasively at an intermediate spatial scale that will alleviate this problem. The method takes advantage of the dependence of cosmic-ray neutron intensity on the hydrogen content of soils (Zreda et al., Geophysical Research Letters, accepted). Low-energy cosmic-ray neutrons are produced and moderated in the soil, transported from the soil into the atmosphere where they are measured with a cosmic-ray neutron probe to provide integrated soil moisture content over a footprint of several hundred meters and a depth of a few decimeters. The method and the instrument are intended for deployment in the continental-scale COSMOS network that is designed to cover the contiguous region of the USA. Fully deployed, the COSMOS network will consist of up to 500 probes, and will provide continuous soil moisture content (together with atmospheric pressure, temperature and relative humidity) measured and reported hourly. These data will be used for initialization and assimilation of soil moisture conditions in weather and short-term (seasonal) climate forecasting, and for other land-surface applications.

A hierarchical pyramid method for managing large-scale high-resolution drainage networks extracted from DEM

NASA Astrophysics Data System (ADS)

Bai, Rui; Tiejian, Li; Huang, Yuefei; Jiaye, Li; Wang, Guangqian; Yin, Dongqin

2015-12-01

The increasing resolution of Digital Elevation Models (DEMs) and the development of drainage network extraction algorithms make it possible to develop high-resolution drainage networks for large river basins. These vector networks contain massive numbers of river reaches with associated geographical features, including topological connections and topographical parameters. These features create challenges for efficient map display and data management. Of particular interest are the requirements of data management for multi-scale hydrological simulations using multi-resolution river networks. In this paper, a hierarchical pyramid method is proposed, which generates coarsened vector drainage networks from the originals iteratively. The method is based on the Horton-Strahler's (H-S) order schema. At each coarsening step, the river reaches with the lowest H-S order are pruned, and their related sub-basins are merged. At the same time, the topological connections and topographical parameters of each coarsened drainage network are inherited from the former level using formulas that are presented in this study. The method was applied to the original drainage networks of a watershed in the Huangfuchuan River basin extracted from a 1-m-resolution airborne LiDAR DEM and applied to the full Yangtze River basin in China, which was extracted from a 30-m-resolution ASTER GDEM. In addition, a map-display and parameter-query web service was published for the Mississippi River basin, and its data were extracted from the 30-m-resolution ASTER GDEM. The results presented in this study indicate that the developed method can effectively manage and display massive amounts of drainage network data and can facilitate multi-scale hydrological simulations.

Coordinated control of active and reactive power of distribution network with distributed PV cluster via model predictive control

NASA Astrophysics Data System (ADS)

Ji, Yu; Sheng, Wanxing; Jin, Wei; Wu, Ming; Liu, Haitao; Chen, Feng

2018-02-01

A coordinated optimal control method of active and reactive power of distribution network with distributed PV cluster based on model predictive control is proposed in this paper. The method divides the control process into long-time scale optimal control and short-time scale optimal control with multi-step optimization. The models are transformed into a second-order cone programming problem due to the non-convex and nonlinear of the optimal models which are hard to be solved. An improved IEEE 33-bus distribution network system is used to analyse the feasibility and the effectiveness of the proposed control method

Physics of soft hyaluronic acid-collagen type II double network gels

NASA Astrophysics Data System (ADS)

Morozova, Svetlana; Muthukumar, Murugappan

2015-03-01

Many biological hydrogels are made up of multiple interpenetrating, charged components. We study the swelling, elastic diffusion, mechanical, and optical behaviors of 100 mol% ionizable hyaluronic acid (HA) and collagen type II fiber networks. Dilute, 0.05-0.5 wt% hyaluronic acid networks are extremely sensitive to solution salt concentration, but are stable at pH above 2. When swelled in 0.1M NaCl, single-network hyaluronic acid gels follow scaling laws relevant to high salt semidilute solutions; the elastic shear modulus G' and diffusion constant D scale with the volume fraction ϕ as G' ~ϕ 9 / 4 and D ~ϕ 3 / 4 , respectively. With the addition of a collagen fiber network, we find that the hyaluronic acid network swells to suspend the rigid collagen fibers, providing extra strength to the hydrogel. Results on swelling equilibria, elasticity, and collective diffusion on these double network hydrogels will be presented.

Microarray Data Processing Techniques for Genome-Scale Network Inference from Large Public Repositories.

PubMed

Chockalingam, Sriram; Aluru, Maneesha; Aluru, Srinivas

2016-09-19

Pre-processing of microarray data is a well-studied problem. Furthermore, all popular platforms come with their own recommended best practices for differential analysis of genes. However, for genome-scale network inference using microarray data collected from large public repositories, these methods filter out a considerable number of genes. This is primarily due to the effects of aggregating a diverse array of experiments with different technical and biological scenarios. Here we introduce a pre-processing pipeline suitable for inferring genome-scale gene networks from large microarray datasets. We show that partitioning of the available microarray datasets according to biological relevance into tissue- and process-specific categories significantly extends the limits of downstream network construction. We demonstrate the effectiveness of our pre-processing pipeline by inferring genome-scale networks for the model plant Arabidopsis thaliana using two different construction methods and a collection of 11,760 Affymetrix ATH1 microarray chips. Our pre-processing pipeline and the datasets used in this paper are made available at http://alurulab.cc.gatech.edu/microarray-pp.

The dissimilarity of species interaction networks.

PubMed

Poisot, Timothée; Canard, Elsa; Mouillot, David; Mouquet, Nicolas; Gravel, Dominique

2012-12-01

In a context of global changes, and amidst the perpetual modification of community structure undergone by most natural ecosystems, it is more important than ever to understand how species interactions vary through space and time. The integration of biogeography and network theory will yield important results and further our understanding of species interactions. It has, however, been hampered so far by the difficulty to quantify variation among interaction networks. Here, we propose a general framework to study the dissimilarity of species interaction networks over time, space or environments, allowing both the use of quantitative and qualitative data. We decompose network dissimilarity into interactions and species turnover components, so that it is immediately comparable to common measures of β-diversity. We emphasise that scaling up β-diversity of community composition to the β-diversity of interactions requires only a small methodological step, which we foresee will help empiricists adopt this method. We illustrate the framework with a large dataset of hosts and parasites interactions and highlight other possible usages. We discuss a research agenda towards a biogeographical theory of species interactions. © 2012 Blackwell Publishing Ltd/CNRS.

CMIP: a software package capable of reconstructing genome-wide regulatory networks using gene expression data.

PubMed

Zheng, Guangyong; Xu, Yaochen; Zhang, Xiujun; Liu, Zhi-Ping; Wang, Zhuo; Chen, Luonan; Zhu, Xin-Guang

2016-12-23

A gene regulatory network (GRN) represents interactions of genes inside a cell or tissue, in which vertexes and edges stand for genes and their regulatory interactions respectively. Reconstruction of gene regulatory networks, in particular, genome-scale networks, is essential for comparative exploration of different species and mechanistic investigation of biological processes. Currently, most of network inference methods are computationally intensive, which are usually effective for small-scale tasks (e.g., networks with a few hundred genes), but are difficult to construct GRNs at genome-scale. Here, we present a software package for gene regulatory network reconstruction at a genomic level, in which gene interaction is measured by the conditional mutual information measurement using a parallel computing framework (so the package is named CMIP). The package is a greatly improved implementation of our previous PCA-CMI algorithm. In CMIP, we provide not only an automatic threshold determination method but also an effective parallel computing framework for network inference. Performance tests on benchmark datasets show that the accuracy of CMIP is comparable to most current network inference methods. Moreover, running tests on synthetic datasets demonstrate that CMIP can handle large datasets especially genome-wide datasets within an acceptable time period. In addition, successful application on a real genomic dataset confirms its practical applicability of the package. This new software package provides a powerful tool for genomic network reconstruction to biological community. The software can be accessed at http://www.picb.ac.cn/CMIP/ .

Deep multi-scale convolutional neural network for hyperspectral image classification

NASA Astrophysics Data System (ADS)

Zhang, Feng-zhe; Yang, Xia

2018-04-01

In this paper, we proposed a multi-scale convolutional neural network for hyperspectral image classification task. Firstly, compared with conventional convolution, we utilize multi-scale convolutions, which possess larger respective fields, to extract spectral features of hyperspectral image. We design a deep neural network with a multi-scale convolution layer which contains 3 different convolution kernel sizes. Secondly, to avoid overfitting of deep neural network, dropout is utilized, which randomly sleeps neurons, contributing to improve the classification accuracy a bit. In addition, new skills like ReLU in deep learning is utilized in this paper. We conduct experiments on University of Pavia and Salinas datasets, and obtained better classification accuracy compared with other methods.

A multiscale method for a robust detection of the default mode network

NASA Astrophysics Data System (ADS)

Baquero, Katherine; Gómez, Francisco; Cifuentes, Christian; Guldenmund, Pieter; Demertzi, Athena; Vanhaudenhuyse, Audrey; Gosseries, Olivia; Tshibanda, Jean-Flory; Noirhomme, Quentin; Laureys, Steven; Soddu, Andrea; Romero, Eduardo

2013-11-01

The Default Mode Network (DMN) is a resting state network widely used for the analysis and diagnosis of mental disorders. It is normally detected in fMRI data, but for its detection in data corrupted by motion artefacts or low neuronal activity, the use of a robust analysis method is mandatory. In fMRI it has been shown that the signal-to-noise ratio (SNR) and the detection sensitivity of neuronal regions is increased with di erent smoothing kernels sizes. Here we propose to use a multiscale decomposition based of a linear scale-space representation for the detection of the DMN. Three main points are proposed in this methodology: rst, the use of fMRI data at di erent smoothing scale-spaces, second, detection of independent neuronal components of the DMN at each scale by using standard preprocessing methods and ICA decomposition at scale-level, and nally, a weighted contribution of each scale by the Goodness of Fit measurement. This method was applied to a group of control subjects and was compared with a standard preprocesing baseline. The detection of the DMN was improved at single subject level and at group level. Based on these results, we suggest to use this methodology to enhance the detection of the DMN in data perturbed with artefacts or applied to subjects with low neuronal activity. Furthermore, the multiscale method could be extended for the detection of other resting state neuronal networks.

Coarse graining for synchronization in directed networks

NASA Astrophysics Data System (ADS)

Zeng, An; Lü, Linyuan

2011-05-01

Coarse-graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve statistical properties as well as the dynamic behaviors of the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse-graining directed networks lacks of consideration. In this paper we proposed a path-based coarse-graining (PCG) method to coarse grain the directed networks. Performing the linear stability analysis of synchronization and numerical simulation of the Kuramoto model on four kinds of directed networks, including tree networks and variants of Barabási-Albert networks, Watts-Strogatz networks, and Erdös-Rényi networks, we find our method can effectively preserve the network synchronizability.

Optimal topologies for maximizing network transmission capacity

NASA Astrophysics Data System (ADS)

Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

2018-04-01

It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

Unravelling daily human mobility motifs

PubMed Central

Schneider, Christian M.; Belik, Vitaly; Couronné, Thomas; Smoreda, Zbigniew; González, Marta C.

2013-01-01

Human mobility is differentiated by time scales. While the mechanism for long time scales has been studied, the underlying mechanism on the daily scale is still unrevealed. Here, we uncover the mechanism responsible for the daily mobility patterns by analysing the temporal and spatial trajectories of thousands of persons as individual networks. Using the concept of motifs from network theory, we find only 17 unique networks are present in daily mobility and they follow simple rules. These networks, called here motifs, are sufficient to capture up to 90 per cent of the population in surveys and mobile phone datasets for different countries. Each individual exhibits a characteristic motif, which seems to be stable over several months. Consequently, daily human mobility can be reproduced by an analytically tractable framework for Markov chains by modelling periods of high-frequency trips followed by periods of lower activity as the key ingredient. PMID:23658117

Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation

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

Wolfe, Noah; Carothers, Christopher; Mubarak, Misbah

As supercomputers close in on exascale performance, the increased number of processors and processing power translates to an increased demand on the underlying network interconnect. The Slim Fly network topology, a new lowdiameter and low-latency interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this paper, we present a high-fidelity Slim Fly it-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate our Slim Fly model with the Kathareios et al. Slim Fly model results provided at moderately sized network scales. We further scale the modelmore » size up to n unprecedented 1 million compute nodes; and through visualization of network simulation metrics such as link bandwidth, packet latency, and port occupancy, we get an insight into the network behavior at the million-node scale. We also show linear strong scaling of the Slim Fly model on an Intel cluster achieving a peak event rate of 36 million events per second using 128 MPI tasks to process 7 billion events. Detailed analysis of the underlying discrete-event simulation performance shows that a million-node Slim Fly model simulation can execute in 198 seconds on the Intel cluster.« less

Spatial connections in regional climate model rainfall outputs at different temporal scales: Application of network theory

NASA Astrophysics Data System (ADS)

Naufan, Ihsan; Sivakumar, Bellie; Woldemeskel, Fitsum M.; Raghavan, Srivatsan V.; Vu, Minh Tue; Liong, Shie-Yui

2018-01-01

Understanding the spatial and temporal variability of rainfall has always been a great challenge, and the impacts of climate change further complicate this issue. The present study employs the concepts of complex networks to study the spatial connections in rainfall, with emphasis on climate change and rainfall scaling. Rainfall outputs (during 1961-1990) from a regional climate model (i.e. Weather Research and Forecasting (WRF) model that downscaled the European Centre for Medium-range Weather Forecasts, ECMWF ERA-40 reanalyses) over Southeast Asia are studied, and data corresponding to eight different temporal scales (6-hr, 12-hr, daily, 2-day, 4-day, weekly, biweekly, and monthly) are analyzed. Two network-based methods are applied to examine the connections in rainfall: clustering coefficient (a measure of the network's local density) and degree distribution (a measure of the network's spread). The influence of rainfall correlation threshold (T) on spatial connections is also investigated by considering seven different threshold levels (ranging from 0.5 to 0.8). The results indicate that: (1) rainfall networks corresponding to much coarser temporal scales exhibit properties similar to that of small-world networks, regardless of the threshold; (2) rainfall networks corresponding to much finer temporal scales may be classified as either small-world networks or scale-free networks, depending upon the threshold; and (3) rainfall spatial connections exhibit a transition phase at intermediate temporal scales, especially at high thresholds. These results suggest that the most appropriate model for studying spatial connections may often be different at different temporal scales, and that a combination of small-world and scale-free network models might be more appropriate for rainfall upscaling/downscaling across all scales, in the strict sense of scale-invariance. The results also suggest that spatial connections in the studied rainfall networks in Southeast Asia are weak, especially when more stringent conditions are imposed (i.e. when T is very high), except at the monthly scale.

Hierarchical combinatorial deep learning architecture for pancreas segmentation of medical computed tomography cancer images.

PubMed

Fu, Min; Wu, Wenming; Hong, Xiafei; Liu, Qiuhua; Jiang, Jialin; Ou, Yaobin; Zhao, Yupei; Gong, Xinqi

2018-04-24

Efficient computational recognition and segmentation of target organ from medical images are foundational in diagnosis and treatment, especially about pancreas cancer. In practice, the diversity in appearance of pancreas and organs in abdomen, makes detailed texture information of objects important in segmentation algorithm. According to our observations, however, the structures of previous networks, such as the Richer Feature Convolutional Network (RCF), are too coarse to segment the object (pancreas) accurately, especially the edge. In this paper, we extend the RCF, proposed to the field of edge detection, for the challenging pancreas segmentation, and put forward a novel pancreas segmentation network. By employing multi-layer up-sampling structure replacing the simple up-sampling operation in all stages, the proposed network fully considers the multi-scale detailed contexture information of object (pancreas) to perform per-pixel segmentation. Additionally, using the CT scans, we supply and train our network, thus get an effective pipeline. Working with our pipeline with multi-layer up-sampling model, we achieve better performance than RCF in the task of single object (pancreas) segmentation. Besides, combining with multi scale input, we achieve the 76.36% DSC (Dice Similarity Coefficient) value in testing data. The results of our experiments show that our advanced model works better than previous networks in our dataset. On the other words, it has better ability in catching detailed contexture information. Therefore, our new single object segmentation model has practical meaning in computational automatic diagnosis.

Enhancing the transmission efficiency by edge deletion in scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Guo-Qing; Wang, Di; Li, Guo-Jie

2007-07-01

How to improve the transmission efficiency of Internet-like packet switching networks is one of the most important problems in complex networks as well as for the Internet research community. In this paper we propose a convenient method to enhance the transmission efficiency of scale-free networks dramatically by kicking out the edges linking to nodes with large betweenness, which we called the “black sheep.” The advantages of our method are of facility and practical importance. Since the black sheep edges are very costly due to their large bandwidth, our method could decrease the cost as well as gain higher throughput of networks. Moreover, we analyze the curve of the largest betweenness on deleting more and more black sheep edges and find that there is a sharp transition at the critical point where the average degree of the nodes ⟨k⟩→2 .

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

NASA Astrophysics Data System (ADS)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

Fast numerical methods for simulating large-scale integrate-and-fire neuronal networks.

PubMed

Rangan, Aaditya V; Cai, David

2007-02-01

We discuss numerical methods for simulating large-scale, integrate-and-fire (I&F) neuronal networks. Important elements in our numerical methods are (i) a neurophysiologically inspired integrating factor which casts the solution as a numerically tractable integral equation, and allows us to obtain stable and accurate individual neuronal trajectories (i.e., voltage and conductance time-courses) even when the I&F neuronal equations are stiff, such as in strongly fluctuating, high-conductance states; (ii) an iterated process of spike-spike corrections within groups of strongly coupled neurons to account for spike-spike interactions within a single large numerical time-step; and (iii) a clustering procedure of firing events in the network to take advantage of localized architectures, such as spatial scales of strong local interactions, which are often present in large-scale computational models-for example, those of the primary visual cortex. (We note that the spike-spike corrections in our methods are more involved than the correction of single neuron spike-time via a polynomial interpolation as in the modified Runge-Kutta methods commonly used in simulations of I&F neuronal networks.) Our methods can evolve networks with relatively strong local interactions in an asymptotically optimal way such that each neuron fires approximately once in [Formula: see text] operations, where N is the number of neurons in the system. We note that quantifications used in computational modeling are often statistical, since measurements in a real experiment to characterize physiological systems are typically statistical, such as firing rate, interspike interval distributions, and spike-triggered voltage distributions. We emphasize that it takes much less computational effort to resolve statistical properties of certain I&F neuronal networks than to fully resolve trajectories of each and every neuron within the system. For networks operating in realistic dynamical regimes, such as strongly fluctuating, high-conductance states, our methods are designed to achieve statistical accuracy when very large time-steps are used. Moreover, our methods can also achieve trajectory-wise accuracy when small time-steps are used.

Advantages of Social Network Analysis in Educational Research

ERIC Educational Resources Information Center

Ushakov, K. M.; Kukso, K. N.

2015-01-01

Currently one of the main tools for the large scale studies of schools is statistical analysis. Although it is the most common method and it offers greatest opportunities for analysis, there are other quantitative methods for studying schools, such as network analysis. We discuss the potential advantages that network analysis has for educational…

A method of examining the structure and topological properties of public-transport networks

NASA Astrophysics Data System (ADS)

Dimitrov, Stavri Dimitri; Ceder, Avishai (Avi)

2016-06-01

This work presents a new method of examining the structure of public-transport networks (PTNs) and analyzes their topological properties through a combination of computer programming, statistical data and large-network analyses. In order to automate the extraction, processing and exporting of data, a software program was developed allowing to extract the needed data from General Transit Feed Specification, thus overcoming difficulties occurring in accessing and collecting data. The proposed method was applied to a real-life PTN in Auckland, New Zealand, with the purpose of examining whether it showed characteristics of scale-free networks and exhibited features of ;small-world; networks. As a result, new regression equations were derived analytically describing observed, strong, non-linear relationships among the probabilities of randomly chosen stops in the PTN to be serviced by a given number of routes. The established dependence is best fitted by an exponential rather than a power-law function, showing that the PTN examined is neither random nor scale-free, but a mixture of the two. This finding explains the presence of hubs that are not typical of exponential networks and simultaneously not highly connected to the other nodes as is the case with scale-free networks. On the other hand, the observed values of the topological properties of the network show that although it is highly clustered, owing to its representation as a directed graph, it differs slightly from ;small-world; networks, which are characterized by strong clustering and a short average path length.

Supersampling and Network Reconstruction of Urban Mobility.

PubMed

Sagarra, Oleguer; Szell, Michael; Santi, Paolo; Díaz-Guilera, Albert; Ratti, Carlo

2015-01-01

Understanding human mobility is of vital importance for urban planning, epidemiology, and many other fields that draw policies from the activities of humans in space. Despite the recent availability of large-scale data sets of GPS traces or mobile phone records capturing human mobility, typically only a subsample of the population of interest is represented, giving a possibly incomplete picture of the entire system under study. Methods to reliably extract mobility information from such reduced data and to assess their sampling biases are lacking. To that end, we analyzed a data set of millions of taxi movements in New York City. We first show that, once they are appropriately transformed, mobility patterns are highly stable over long time scales. Based on this observation, we develop a supersampling methodology to reliably extrapolate mobility records from a reduced sample based on an entropy maximization procedure, and we propose a number of network-based metrics to assess the accuracy of the predicted vehicle flows. Our approach provides a well founded way to exploit temporal patterns to save effort in recording mobility data, and opens the possibility to scale up data from limited records when information on the full system is required.

Millimeter-scale epileptiform spike propagation patterns and their relationship to seizures

PubMed Central

Vanleer, Ann C; Blanco, Justin A; Wagenaar, Joost B; Viventi, Jonathan; Contreras, Diego; Litt, Brian

2016-01-01

Objective Current mapping of epileptic networks in patients prior to epilepsy surgery utilizes electrode arrays with sparse spatial sampling (∼1.0 cm inter-electrode spacing). Recent research demonstrates that sub-millimeter, cortical-column-scale domains have a role in seizure generation that may be clinically significant. We use high-resolution, active, flexible surface electrode arrays with 500 μm inter-electrode spacing to explore epileptiform local field potential spike propagation patterns in two dimensions recorded from subdural micro-electrocorticographic signals in vivo in cat. In this study, we aimed to develop methods to quantitatively characterize the spatiotemporal dynamics of epileptiform activity at high-resolution. Approach We topically administered a GABA-antagonist, picrotoxin, to induce acute neocortical epileptiform activity leading up to discrete electrographic seizures. We extracted features from local field potential spikes to characterize spatiotemporal patterns in these events. We then tested the hypothesis that two dimensional spike patterns during seizures were different from those between seizures. Main results We showed that spatially correlated events can be used to distinguish ictal versus interictal spikes. Significance We conclude that sub-millimeter-scale spatiotemporal spike patterns reveal network dynamics that are invisible to standard clinical recordings and contain information related to seizure-state. PMID:26859260

Millimeter-scale epileptiform spike propagation patterns and their relationship to seizures

NASA Astrophysics Data System (ADS)

Vanleer, Ann C.; Blanco, Justin A.; Wagenaar, Joost B.; Viventi, Jonathan; Contreras, Diego; Litt, Brian

2016-04-01

Objective. Current mapping of epileptic networks in patients prior to epilepsy surgery utilizes electrode arrays with sparse spatial sampling (∼1.0 cm inter-electrode spacing). Recent research demonstrates that sub-millimeter, cortical-column-scale domains have a role in seizure generation that may be clinically significant. We use high-resolution, active, flexible surface electrode arrays with 500 μm inter-electrode spacing to explore epileptiform local field potential (LFP) spike propagation patterns in two dimensions recorded from subdural micro-electrocorticographic signals in vivo in cat. In this study, we aimed to develop methods to quantitatively characterize the spatiotemporal dynamics of epileptiform activity at high-resolution. Approach. We topically administered a GABA-antagonist, picrotoxin, to induce acute neocortical epileptiform activity leading up to discrete electrographic seizures. We extracted features from LFP spikes to characterize spatiotemporal patterns in these events. We then tested the hypothesis that two-dimensional spike patterns during seizures were different from those between seizures. Main results. We showed that spatially correlated events can be used to distinguish ictal versus interictal spikes. Significance. We conclude that sub-millimeter-scale spatiotemporal spike patterns reveal network dynamics that are invisible to standard clinical recordings and contain information related to seizure-state.

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition

PubMed Central

Peng, Min; Wang, Chongyang; Chen, Tong; Liu, Guangyuan; Fu, Xiaolan

2017-01-01

Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN) for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II) showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve. PMID:29081753

Recent developments in VSD imaging of small neuronal networks

PubMed Central

Hill, Evan S.; Bruno, Angela M.

2014-01-01

Voltage-sensitive dye (VSD) imaging is a powerful technique that can provide, in single experiments, a large-scale view of network activity unobtainable with traditional sharp electrode recording methods. Here we review recent work using VSDs to study small networks and highlight several results from this approach. Topics covered include circuit mapping, network multifunctionality, the network basis of decision making, and the presence of variably participating neurons in networks. Analytical tools being developed and applied to large-scale VSD imaging data sets are discussed, and the future prospects for this exciting field are considered. PMID:25225295

Assessing opportunities for physical activity in the built environment of children: interrelation between kernel density and neighborhood scale.

PubMed

Buck, Christoph; Kneib, Thomas; Tkaczick, Tobias; Konstabel, Kenn; Pigeot, Iris

2015-12-22

Built environment studies provide broad evidence that urban characteristics influence physical activity (PA). However, findings are still difficult to compare, due to inconsistent measures assessing urban point characteristics and varying definitions of spatial scale. Both were found to influence the strength of the association between the built environment and PA. We simultaneously evaluated the effect of kernel approaches and network-distances to investigate the association between urban characteristics and physical activity depending on spatial scale and intensity measure. We assessed urban measures of point characteristics such as intersections, public transit stations, and public open spaces in ego-centered network-dependent neighborhoods based on geographical data of one German study region of the IDEFICS study. We calculated point intensities using the simple intensity and kernel approaches based on fixed bandwidths, cross-validated bandwidths including isotropic and anisotropic kernel functions and considering adaptive bandwidths that adjust for residential density. We distinguished six network-distances from 500 m up to 2 km to calculate each intensity measure. A log-gamma regression model was used to investigate the effect of each urban measure on moderate-to-vigorous physical activity (MVPA) of 400 2- to 9.9-year old children who participated in the IDEFICS study. Models were stratified by sex and age groups, i.e. pre-school children (2 to <6 years) and school children (6-9.9 years), and were adjusted for age, body mass index (BMI), education and safety concerns of parents, season and valid weartime of accelerometers. Association between intensity measures and MVPA strongly differed by network-distance, with stronger effects found for larger network-distances. Simple intensity revealed smaller effect estimates and smaller goodness-of-fit compared to kernel approaches. Smallest variation in effect estimates over network-distances was found for kernel intensity measures based on isotropic and anisotropic cross-validated bandwidth selection. We found a strong variation in the association between the built environment and PA of children based on the choice of intensity measure and network-distance. Kernel intensity measures provided stable results over various scales and improved the assessment compared to the simple intensity measure. Considering different spatial scales and kernel intensity methods might reduce methodological limitations in assessing opportunities for PA in the built environment.

Constructing a Watts-Strogatz network from a small-world network with symmetric degree distribution.

PubMed

Menezes, Mozart B C; Kim, Seokjin; Huang, Rongbing

2017-01-01

Though the small-world phenomenon is widespread in many real networks, it is still challenging to replicate a large network at the full scale for further study on its structure and dynamics when sufficient data are not readily available. We propose a method to construct a Watts-Strogatz network using a sample from a small-world network with symmetric degree distribution. Our method yields an estimated degree distribution which fits closely with that of a Watts-Strogatz network and leads into accurate estimates of network metrics such as clustering coefficient and degree of separation. We observe that the accuracy of our method increases as network size increases.

Metabolic Network Modeling of Microbial Communities

PubMed Central

Biggs, Matthew B.; Medlock, Gregory L.; Kolling, Glynis L.

2015-01-01

Genome-scale metabolic network reconstructions and constraint-based analysis are powerful methods that have the potential to make functional predictions about microbial communities. Current use of genome-scale metabolic networks to characterize the metabolic functions of microbial communities includes species compartmentalization, separating species-level and community-level objectives, dynamic analysis, the “enzyme-soup” approach, multi-scale modeling, and others. There are many challenges inherent to the field, including a need for tools that accurately assign high-level omics signals to individual community members, new automated reconstruction methods that rival manual curation, and novel algorithms for integrating omics data and engineering communities. As technologies and modeling frameworks improve, we expect that there will be proportional advances in the fields of ecology, health science, and microbial community engineering. PMID:26109480

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

NASA Astrophysics Data System (ADS)

Li, Ming-Xia; Palchykov, Vasyl; Jiang, Zhi-Qiang; Kaski, Kimmo; Kertész, János; Miccichè, Salvatore; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2014-08-01

Big data open up unprecedented opportunities for investigating complex systems, including society. In particular, communication data serve as major sources for computational social sciences, but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple-hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, generalized to the directed case. We study two large datasets of mobile phone records, one from Europe and the other from China. For both datasets we compare the raw data networks with the corresponding Bonferroni networks and point out significant differences in the structures and in the basic network measures. We show evidence that the Bonferroni network provides a better proxy for the network of social interactions than the original one. Using the filtered networks, we investigated the statistics and temporal evolution of small directed 3-motifs and concluded that closed communication triads have a formation time scale, which is quite fast and typically intraday. We also find that open communication triads preferentially evolve into other open triads with a higher fraction of reciprocated calls. These stylized facts were observed for both datasets.

Estimating National-scale Emissions using Dense Monitoring Networks

NASA Astrophysics Data System (ADS)

Ganesan, A.; Manning, A.; Grant, A.; Young, D.; Oram, D.; Sturges, W. T.; Moncrieff, J. B.; O'Doherty, S.

2014-12-01

The UK's DECC (Deriving Emissions linked to Climate Change) network consists of four greenhouse gas measurement stations that are situated to constrain emissions from the UK and Northwest Europe. These four stations are located in Mace Head (West Coast of Ireland), and on telecommunication towers at Ridge Hill (Western England), Tacolneston (Eastern England) and Angus (Eastern Scotland). With the exception of Angus, which currently only measures carbon dioxide (CO2) and methane (CH4), the remaining sites are additionally equipped to monitor nitrous oxide (N2O). We present an analysis of the network's CH4 and N2O observations from 2011-2013 and compare derived top-down regional emissions with bottom-up inventories, including a recently produced high-resolution inventory (UK National Atmospheric Emissions Inventory). As countries are moving toward national-level emissions estimation, we also address some of the considerations that need to be made when designing these national networks. One of the novel aspects of this work is that we use a hierarchical Bayesian inversion framework. This methodology, which has newly been applied to greenhouse gas emissions estimation, is designed to estimate temporally and spatially varying model-measurement uncertainties and correlation scales, in addition to fluxes. Through this analysis, we demonstrate the importance of characterizing these covariance parameters in order to properly use data from high-density monitoring networks. This UK case study highlights the ways in which this new inverse framework can be used to address some of the limitations of traditional Bayesian inverse methods.

Flexible sampling large-scale social networks by self-adjustable random walk

NASA Astrophysics Data System (ADS)

Xu, Xiao-Ke; Zhu, Jonathan J. H.

2016-12-01

Online social networks (OSNs) have become an increasingly attractive gold mine for academic and commercial researchers. However, research on OSNs faces a number of difficult challenges. One bottleneck lies in the massive quantity and often unavailability of OSN population data. Sampling perhaps becomes the only feasible solution to the problems. How to draw samples that can represent the underlying OSNs has remained a formidable task because of a number of conceptual and methodological reasons. Especially, most of the empirically-driven studies on network sampling are confined to simulated data or sub-graph data, which are fundamentally different from real and complete-graph OSNs. In the current study, we propose a flexible sampling method, called Self-Adjustable Random Walk (SARW), and test it against with the population data of a real large-scale OSN. We evaluate the strengths of the sampling method in comparison with four prevailing methods, including uniform, breadth-first search (BFS), random walk (RW), and revised RW (i.e., MHRW) sampling. We try to mix both induced-edge and external-edge information of sampled nodes together in the same sampling process. Our results show that the SARW sampling method has been able to generate unbiased samples of OSNs with maximal precision and minimal cost. The study is helpful for the practice of OSN research by providing a highly needed sampling tools, for the methodological development of large-scale network sampling by comparative evaluations of existing sampling methods, and for the theoretical understanding of human networks by highlighting discrepancies and contradictions between existing knowledge/assumptions of large-scale real OSN data.

Exploring the spiral of silence in adjustable social networks

NASA Astrophysics Data System (ADS)

Wu, Yue; Du, Ya-Jun; Li, Xian-Yong; Chen, Xiao-Liang

2015-03-01

This study extends the understanding of the spiral of silence theory by taking into account four factors, including the topology of networks, the time factor of information transmission, the node degree of individuals and the freedom of expression. Simulation experiments analyze the silencers, public opinion in steady state and relaxation time in small-world networks, scale-free networks and community-structured networks by adjusting the initial conditions. Results highlight that individuals are easier to keep silent in scale-free network, especially when the individual with big degree and minority opinion starts the discussion. Conversely, there are only a few individuals keep silent in the community-structured network when the two communities hold opposite opinions. Moreover, the number of silencers grows as the degree of coupling increases, and it decreases as the freedom of expression goes up. By analyzing the public opinion evolution, we also find some important conditions, such as the network topology, the potential public opinion distribution, and the status and sides of the first speaker, can drive the minority reversal.

Rich-Cores in Networks

PubMed Central

Ma, Athen; Mondragón, Raúl J.

2015-01-01

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively. PMID:25799585

Rich-cores in networks.

PubMed

Ma, Athen; Mondragón, Raúl J

2015-01-01

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively.

How a European network may help with estimating methane emissions on the French national scale

NASA Astrophysics Data System (ADS)

Pison, Isabelle; Berchet, Antoine; Saunois, Marielle; Bousquet, Philippe; Broquet, Grégoire; Conil, Sébastien; Delmotte, Marc; Ganesan, Anita; Laurent, Olivier; Martin, Damien; O'Doherty, Simon; Ramonet, Michel; Spain, T. Gerard; Vermeulen, Alex; Yver Kwok, Camille

2018-03-01

Methane emissions on the national scale in France in 2012 are inferred by assimilating continuous atmospheric mixing ratio measurements from nine stations of the European network ICOS located in France and surrounding countries. To assess the robustness of the fluxes deduced by our inversion system based on an objectified quantification of uncertainties, two complementary inversion set-ups are computed and analysed: (i) a regional run correcting for the spatial distribution of fluxes in France and (ii) a sectorial run correcting fluxes for activity sectors on the national scale. In addition, our results for the two set-ups are compared with fluxes produced in the framework of the inversion inter-comparison exercise of the InGOS project. The seasonal variability in fluxes is consistent between different set-ups, with maximum emissions in summer, likely due to agricultural activity. However, very high monthly posterior uncertainties (up to ≈ 65 to 74 % in the sectorial run in May and June) make it difficult to attribute maximum emissions to a specific sector. On the yearly and national scales, the two inversions range from 3835 to 4050 Gg CH4 and from 3570 to 4190 Gg CH4 for the regional and sectorial runs, respectively, consistently with the InGOS products. These estimates are 25 to 55 % higher than the total national emissions from bottom-up approaches (biogeochemical models from natural emissions, plus inventories for anthropogenic ones), consistently pointing at missing or underestimated sources in the inventories and/or in natural sources. More specifically, in the sectorial set-up, agricultural emissions are inferred as 66% larger than estimates reported to the UNFCCC. Uncertainties in the total annual national budget are 108 and 312 Gg CH4, i.e, 3 to 8 %, for the regional and sectorial runs respectively, smaller than uncertainties in available bottom-up products, proving the added value of top-down atmospheric inversions. Therefore, even though the surface network used in 2012 does not allow us to fully constrain all regions in France accurately, a regional inversion set-up makes it possible to provide estimates of French methane fluxes with an uncertainty in the total budget of less than 10 % on the yearly timescale. Additional sites deployed since 2012 would help to constrain French emissions on finer spatial and temporal scales and attributing missing emissions to specific sectors.

Accurate detection of hierarchical communities in complex networks based on nonlinear dynamical evolution

NASA Astrophysics Data System (ADS)

Zhuo, Zhao; Cai, Shi-Min; Tang, Ming; Lai, Ying-Cheng

2018-04-01

One of the most challenging problems in network science is to accurately detect communities at distinct hierarchical scales. Most existing methods are based on structural analysis and manipulation, which are NP-hard. We articulate an alternative, dynamical evolution-based approach to the problem. The basic principle is to computationally implement a nonlinear dynamical process on all nodes in the network with a general coupling scheme, creating a networked dynamical system. Under a proper system setting and with an adjustable control parameter, the community structure of the network would "come out" or emerge naturally from the dynamical evolution of the system. As the control parameter is systematically varied, the community hierarchies at different scales can be revealed. As a concrete example of this general principle, we exploit clustered synchronization as a dynamical mechanism through which the hierarchical community structure can be uncovered. In particular, for quite arbitrary choices of the nonlinear nodal dynamics and coupling scheme, decreasing the coupling parameter from the global synchronization regime, in which the dynamical states of all nodes are perfectly synchronized, can lead to a weaker type of synchronization organized as clusters. We demonstrate the existence of optimal choices of the coupling parameter for which the synchronization clusters encode accurate information about the hierarchical community structure of the network. We test and validate our method using a standard class of benchmark modular networks with two distinct hierarchies of communities and a number of empirical networks arising from the real world. Our method is computationally extremely efficient, eliminating completely the NP-hard difficulty associated with previous methods. The basic principle of exploiting dynamical evolution to uncover hidden community organizations at different scales represents a "game-change" type of approach to addressing the problem of community detection in complex networks.

An Efficient and Reliable Statistical Method for Estimating Functional Connectivity in Large Scale Brain Networks Using Partial Correlation

PubMed Central

Wang, Yikai; Kang, Jian; Kemmer, Phebe B.; Guo, Ying

2016-01-01

Currently, network-oriented analysis of fMRI data has become an important tool for understanding brain organization and brain networks. Among the range of network modeling methods, partial correlation has shown great promises in accurately detecting true brain network connections. However, the application of partial correlation in investigating brain connectivity, especially in large-scale brain networks, has been limited so far due to the technical challenges in its estimation. In this paper, we propose an efficient and reliable statistical method for estimating partial correlation in large-scale brain network modeling. Our method derives partial correlation based on the precision matrix estimated via Constrained L1-minimization Approach (CLIME), which is a recently developed statistical method that is more efficient and demonstrates better performance than the existing methods. To help select an appropriate tuning parameter for sparsity control in the network estimation, we propose a new Dens-based selection method that provides a more informative and flexible tool to allow the users to select the tuning parameter based on the desired sparsity level. Another appealing feature of the Dens-based method is that it is much faster than the existing methods, which provides an important advantage in neuroimaging applications. Simulation studies show that the Dens-based method demonstrates comparable or better performance with respect to the existing methods in network estimation. We applied the proposed partial correlation method to investigate resting state functional connectivity using rs-fMRI data from the Philadelphia Neurodevelopmental Cohort (PNC) study. Our results show that partial correlation analysis removed considerable between-module marginal connections identified by full correlation analysis, suggesting these connections were likely caused by global effects or common connection to other nodes. Based on partial correlation, we find that the most significant direct connections are between homologous brain locations in the left and right hemisphere. When comparing partial correlation derived under different sparse tuning parameters, an important finding is that the sparse regularization has more shrinkage effects on negative functional connections than on positive connections, which supports previous findings that many of the negative brain connections are due to non-neurophysiological effects. An R package “DensParcorr” can be downloaded from CRAN for implementing the proposed statistical methods. PMID:27242395

An Efficient and Reliable Statistical Method for Estimating Functional Connectivity in Large Scale Brain Networks Using Partial Correlation.

PubMed

Wang, Yikai; Kang, Jian; Kemmer, Phebe B; Guo, Ying

2016-01-01

Currently, network-oriented analysis of fMRI data has become an important tool for understanding brain organization and brain networks. Among the range of network modeling methods, partial correlation has shown great promises in accurately detecting true brain network connections. However, the application of partial correlation in investigating brain connectivity, especially in large-scale brain networks, has been limited so far due to the technical challenges in its estimation. In this paper, we propose an efficient and reliable statistical method for estimating partial correlation in large-scale brain network modeling. Our method derives partial correlation based on the precision matrix estimated via Constrained L1-minimization Approach (CLIME), which is a recently developed statistical method that is more efficient and demonstrates better performance than the existing methods. To help select an appropriate tuning parameter for sparsity control in the network estimation, we propose a new Dens-based selection method that provides a more informative and flexible tool to allow the users to select the tuning parameter based on the desired sparsity level. Another appealing feature of the Dens-based method is that it is much faster than the existing methods, which provides an important advantage in neuroimaging applications. Simulation studies show that the Dens-based method demonstrates comparable or better performance with respect to the existing methods in network estimation. We applied the proposed partial correlation method to investigate resting state functional connectivity using rs-fMRI data from the Philadelphia Neurodevelopmental Cohort (PNC) study. Our results show that partial correlation analysis removed considerable between-module marginal connections identified by full correlation analysis, suggesting these connections were likely caused by global effects or common connection to other nodes. Based on partial correlation, we find that the most significant direct connections are between homologous brain locations in the left and right hemisphere. When comparing partial correlation derived under different sparse tuning parameters, an important finding is that the sparse regularization has more shrinkage effects on negative functional connections than on positive connections, which supports previous findings that many of the negative brain connections are due to non-neurophysiological effects. An R package "DensParcorr" can be downloaded from CRAN for implementing the proposed statistical methods.

Making Practice Public: Teacher Learning in the 21st Century

ERIC Educational Resources Information Center

Lieberman, Ann; Pointer Mace, Desiree

2010-01-01

We propose that the advent and ubiquity of new media tools and social networking resources provide a means for professional, networked learning to "scale up." We preface our discussion with a review of research that has led us to argue for professional learning communities, document the policies and practices of professional development…

National population size estimation of illicit drug users through the network scale-up method in 2013 in Iran.

PubMed

Nikfarjam, Ali; Shokoohi, Mostafa; Shahesmaeili, Armita; Haghdoost, Ali Akbar; Baneshi, Mohammad Reza; Haji-Maghsoudi, Saiedeh; Rastegari, Azam; Nasehi, Abbas Ali; Memaryan, Nadereh; Tarjoman, Termeh

2016-05-01

For a better understanding of the current situation of drug use in Iran, we utilized the network scale-up approach to estimate the prevalence of illicit drug use in the entire country. We implemented a self-administered, street-based questionnaire to 7535 passersby from the general public over 18 years of age by street based random walk quota sampling (based on gender, age and socio-economic status) from 31 provinces in Iran. The sample size in each province was approximately 400, ranging from 200 to 1000. In each province 75% of sample was recruited from the capital and the remaining 25% was recruited from one of the large cities of that province through stratified sampling. The questionnaire comprised questions on demographic information as well as questions to measure the total network size of participants as well as the network size in each of seven drug use groups including Opium, Shire (combination of Opium residue and pure opium), Crystal Methamphetamine, heroin/crack (which in Iranian context is a cocaine-free drug that mostly contains heroin, codeine, morphine and caffeine with or without other drugs), Hashish, Methamphetamine/LSD/ecstasy, and injecting drugs. The estimated size for each group was adjusted for transmission and barrier ratios. The most common type of illicit drug used was opium with the prevalence of 1500 per 100,000 population followed by shire (660), crystal methamphetamine (590), hashish (470), heroin/crack (350), methamphetamine, LSD and ecstasy (300) and injecting drugs (280). All types of substances were more common among men than women. The use of opium, shire and injecting drugs was more common in individuals over 30 whereas the use of stimulants and hashish was largest among individuals between 18 and 30 years of age. It seems that younger individuals and women are more desired to use new synthetic drugs such as crystal methamphetamine. Extending the preventive programs especially in youth as like as scaling up harm reduction services would be the main priorities in prevention and control of substance use in Iran. Because of poor service coverage and high stigma in women, more targeted programs in this affected population are needed. Copyright © 2016 Elsevier B.V. All rights reserved.

Scale-Up of Lubricant Mixing Process by Using V-Type Blender Based on Discrete Element Method.

PubMed

Horibe, Masashi; Sonoda, Ryoichi; Watano, Satoru

2018-01-01

A method for scale-up of a lubricant mixing process in a V-type blender was proposed. Magnesium stearate was used for the lubricant, and the lubricant mixing experiment was conducted using three scales of V-type blenders (1.45, 21 and 130 L) under the same fill level and Froude (Fr) number. However, the properties of lubricated mixtures and tablets could not correspond with the mixing time or the total revolution number. To find the optimum scale-up factor, discrete element method (DEM) simulations of three scales of V-type blender mixing were conducted, and the total travel distance of particles under the different scales was calculated. The properties of the lubricated mixture and tablets obtained from the scale-up experiment were well correlated with the mixing time determined by the total travel distance. It was found that a scale-up simulation based on the travel distance of particles is valid for the lubricant mixing scale-up processes.

Editorial [Special issue on software defined networks and infrastructures, network function virtualisation, autonomous systems and network management

DOE PAGES

Biswas, Amitava; Liu, Chen; Monga, Inder; ...

2016-01-01

For last few years, there has been a tremendous growth in data traffic due to high adoption rate of mobile devices and cloud computing. Internet of things (IoT) will stimulate even further growth. This is increasing scale and complexity of telecom/internet service provider (SP) and enterprise data centre (DC) compute and network infrastructures. As a result, managing these large network-compute converged infrastructures is becoming complex and cumbersome. To cope up, network and DC operators are trying to automate network and system operations, administrations and management (OAM) functions. OAM includes all non-functional mechanisms which keep the network running.

Inverse targeting —An effective immunization strategy

NASA Astrophysics Data System (ADS)

Schneider, C. M.; Mihaljev, T.; Herrmann, H. J.

2012-05-01

We propose a new method to immunize populations or computer networks against epidemics which is more efficient than any continuous immunization method considered before. The novelty of our method resides in the way of determining the immunization targets. First we identify those individuals or computers that contribute the least to the disease spreading measured through their contribution to the size of the largest connected cluster in the social or a computer network. The immunization process follows the list of identified individuals or computers in inverse order, immunizing first those which are most relevant for the epidemic spreading. We have applied our immunization strategy to several model networks and two real networks, the Internet and the collaboration network of high-energy physicists. We find that our new immunization strategy is in the case of model networks up to 14%, and for real networks up to 33% more efficient than immunizing dynamically the most connected nodes in a network. Our strategy is also numerically efficient and can therefore be applied to large systems.

Scaling up HIV viral load - lessons from the large-scale implementation of HIV early infant diagnosis and CD4 testing.

PubMed

Peter, Trevor; Zeh, Clement; Katz, Zachary; Elbireer, Ali; Alemayehu, Bereket; Vojnov, Lara; Costa, Alex; Doi, Naoko; Jani, Ilesh

2017-11-01

The scale-up of effective HIV viral load (VL) testing is an urgent public health priority. Implementation of testing is supported by the availability of accurate, nucleic acid based laboratory and point-of-care (POC) VL technologies and strong WHO guidance recommending routine testing to identify treatment failure. However, test implementation faces challenges related to the developing health systems in many low-resource countries. The purpose of this commentary is to review the challenges and solutions from the large-scale implementation of other diagnostic tests, namely nucleic-acid based early infant HIV diagnosis (EID) and CD4 testing, and identify key lessons to inform the scale-up of VL. Experience with EID and CD4 testing provides many key lessons to inform VL implementation and may enable more effective and rapid scale-up. The primary lessons from earlier implementation efforts are to strengthen linkage to clinical care after testing, and to improve the efficiency of testing. Opportunities to improve linkage include data systems to support the follow-up of patients through the cascade of care and test delivery, rapid sample referral networks, and POC tests. Opportunities to increase testing efficiency include improvements to procurement and supply chain practices, well connected tiered laboratory networks with rational deployment of test capacity across different levels of health services, routine resource mapping and mobilization to ensure adequate resources for testing programs, and improved operational and quality management of testing services. If applied to VL testing programs, these approaches could help improve the impact of VL on ART failure management and patient outcomes, reduce overall costs and help ensure the sustainable access to reduced pricing for test commodities, as well as improve supportive health systems such as efficient, and more rigorous quality assurance. These lessons draw from traditional laboratory practices as well as fields such as logistics, operations management and business. The lessons and innovations from large-scale EID and CD4 programs described here can be adapted to inform more effective scale-up approaches for VL. They demonstrate that an integrated approach to health system strengthening focusing on key levers for test access such as data systems, supply efficiencies and network management. They also highlight the challenges with implementation and the need for more innovative approaches and effective partnerships to achieve equitable and cost-effective test access. © 2017 The Authors. Journal of the International AIDS Society published by John Wiley & sons Ltd on behalf of the International AIDS Society.

Performance of an Abbreviated Version of the Lubben Social Network Scale among Three European Community-Dwelling Older Adult Populations

ERIC Educational Resources Information Center

Lubben, James; Blozik, Eva; Gillmann, Gerhard; Iliffe, Steve; von Renteln-Kruse, Wolfgang; Beck, John C.; Stuck, Andreas E.

2006-01-01

Purpose: There is a need for valid and reliable short scales that can be used to assess social networks and social supports and to screen for social isolation in older persons. Design and Methods: The present study is a cross-national and cross-cultural evaluation of the performance of an abbreviated version of the Lubben Social Network Scale…

Multifractal analysis of mobile social networks

NASA Astrophysics Data System (ADS)

Zheng, Wei; Zhang, Zifeng; Deng, Yufan

2017-09-01

As Wireless Fidelity (Wi-Fi)-enabled handheld devices have been widely used, the mobile social networks (MSNs) has been attracting extensive attention. Fractal approaches have also been widely applied to characterierize natural networks as useful tools to depict their spatial distribution and scaling properties. Moreover, when the complexity of the spatial distribution of MSNs cannot be properly charaterized by single fractal dimension, multifractal analysis is required. For further research, we introduced a multifractal analysis method based on box-covering algorithm to describe the structure of MSNs. Using this method, we find that the networks are multifractal at different time interval. The simulation results demonstrate that the proposed method is efficient for analyzing the multifractal characteristic of MSNs, which provides a distribution of singularities adequately describing both the heterogeneity of fractal patterns and the statistics of measurements across spatial scales in MSNs.

Multiscale modeling of brain dynamics: from single neurons and networks to mathematical tools.

PubMed

Siettos, Constantinos; Starke, Jens

2016-09-01

The extreme complexity of the brain naturally requires mathematical modeling approaches on a large variety of scales; the spectrum ranges from single neuron dynamics over the behavior of groups of neurons to neuronal network activity. Thus, the connection between the microscopic scale (single neuron activity) to macroscopic behavior (emergent behavior of the collective dynamics) and vice versa is a key to understand the brain in its complexity. In this work, we attempt a review of a wide range of approaches, ranging from the modeling of single neuron dynamics to machine learning. The models include biophysical as well as data-driven phenomenological models. The discussed models include Hodgkin-Huxley, FitzHugh-Nagumo, coupled oscillators (Kuramoto oscillators, Rössler oscillators, and the Hindmarsh-Rose neuron), Integrate and Fire, networks of neurons, and neural field equations. In addition to the mathematical models, important mathematical methods in multiscale modeling and reconstruction of the causal connectivity are sketched. The methods include linear and nonlinear tools from statistics, data analysis, and time series analysis up to differential equations, dynamical systems, and bifurcation theory, including Granger causal connectivity analysis, phase synchronization connectivity analysis, principal component analysis (PCA), independent component analysis (ICA), and manifold learning algorithms such as ISOMAP, and diffusion maps and equation-free techniques. WIREs Syst Biol Med 2016, 8:438-458. doi: 10.1002/wsbm.1348 For further resources related to this article, please visit the WIREs website. © 2016 Wiley Periodicals, Inc.

Deformation analysis of the unified lunar control networks

NASA Astrophysics Data System (ADS)

Iz, H. Bâki; Chen, Yong Qi; King, Bruce Anthony; Ding, Xiaoli; Wu, Chen

2009-12-01

This study compares the latest Unified Lunar Control Network, ULCN 2005, solution with the earlier ULCN 1994 solution at global and local scales. At the global scale, the relative rotation, translation, and deformation (normal strains and shears) parameters between the two networks are estimated as a whole using their colocated station Cartesian coordinate differences. At the local scale, the network station coordinate differences are examined in local topocentric coordinate systems whose origins are located at the geometric center of quadrangles and tetrahedrons. This study identified that the omission of the topography in the old ULCN solutions shifted the geometric center of the lunar figure up to 5 km in the lunar equatorial plane and induced a few hundred-meter level global rotations of the ULCN 1994 reference frame with respect to ULCN 2005. The displacements between the old and new control networks are less than ± 2 km on the average at the local scale, which behave like translations, caused by the omission of lunar topography in the earlier solution. The contribution of local rigid body rotations and dilatational and compressional components to the local displacements are approximately ± 100 m for a quadrangle/tetrahedron of an average side length of 10 km.

SoilSCAPE in-Situ Observations of Soil Moisture for SMAP Validation: Pushing the Envelopes of Spatial Coverage and Energy Efficiency in Sparse Wireless Sensor Networks (Invited)

NASA Astrophysics Data System (ADS)

Moghaddam, M.; Silva, A.; Clewley, D.; Akbar, R.; Entekhabi, D.

2013-12-01

Soil Moisture Sensing Controller and oPtimal Estimator (SoilSCAPE) is a wireless in-situ sensor network technology, developed under the support of NASA ESTO/AIST program, for multi-scale validation of soil moisture retrievals from the Soil Moisture Active and Passive (SMAP) mission. The SMAP sensor suite is expected to produce soil moisture retrievals at 3 km scale from the radar instrument, at 36 km from the radiometer, and at 10 km from the combination of the two sensors. To validate the retrieved soil moisture maps at any of these scales, it is necessary to perform in-situ observations at multiple scales (ten, hundreds, and thousands of meters), representative of the true spatial variability of soil moisture fields. The most recent SoilSCAPE network, deployed in the California central valley, has been designed, built, and deployed to accomplish this goal, and is expected to become a core validation site for SMAP. The network consists of up to 150 sensor nodes, each comprised of 3-4 soil moisture sensors at various depths, deployed over a spatial extent of 36 km by 36 km. The network contains multiple sub-networks, each having up to 30 nodes, whose location is selected in part based on maximizing the land cover diversity within the 36 km cell. The network has achieved unprecedented energy efficiency, longevity, and spatial coverage using custom-designed hardware and software protocols. The network architecture utilizes a nested strategy, where a number of end devices (EDs) communicate to a local coordinator (LC) using our recently developed hardware with ultra-efficient circuitry and best-effort-timeslot allocation communication protocol. The LCs in turn communicates with the base station (BS) via text messages and a new compression scheme. The hardware and software technologies required to implement this latest deployment of the SoilSCAPE network will be presented in this paper, and several data sets resulting from the measurements will be shown. The data are available publicly in near-real-time from the project web site, and are also available and searchable via an extensive set of metadata fields through the ORNL-DAAC.

Towards 1D nanolines on a monolayered supramolecular network adsorbed on a silicon surface.

PubMed

Makoudi, Younes; Beyer, Matthieu; Lamare, Simon; Jeannoutot, Judicael; Palmino, Frank; Chérioux, Frédéric

2016-06-16

The growth of 3D extended periodic networks made up of π-conjugated molecules on semi-conductor surfaces is of interest for the integration of nano-components in the future generations of smart devices. In the work presented in this article, we successfully achieved the formation of bilayered networks on a silicon surface including 1D-isolated nanolines in the second layer. Firstly, we observed the formation of a 2D large-scale supramolecular network in the plane of a silicon surface through the deposition of tailored molecules. Then using the same molecules, a second-layer, based on 1D nanolines, grew above the first layer, thanks to a template effect. Mono- or bi-layered networks were found to be stable from 100 K up to room temperature. These networks were investigated by scanning tunnel microscopy imaging under an ultra-high vacuum (UHV-STM).

Training a whole-book LSTM-based recognizer with an optimal training set

NASA Astrophysics Data System (ADS)

Soheili, Mohammad Reza; Yousefi, Mohammad Reza; Kabir, Ehsanollah; Stricker, Didier

2018-04-01

Despite the recent progress in OCR technologies, whole-book recognition, is still a challenging task, in particular in case of old and historical books, that the unknown font faces or low quality of paper and print contributes to the challenge. Therefore, pre-trained recognizers and generic methods do not usually perform up to required standards, and usually the performance degrades for larger scale recognition tasks, such as of a book. Such reportedly low error-rate methods turn out to require a great deal of manual correction. Generally, such methodologies do not make effective use of concepts such redundancy in whole-book recognition. In this work, we propose to train Long Short Term Memory (LSTM) networks on a minimal training set obtained from the book to be recognized. We show that clustering all the sub-words in the book, and using the sub-word cluster centers as the training set for the LSTM network, we can train models that outperform any identical network that is trained with randomly selected pages of the book. In our experiments, we also show that although the sub-word cluster centers are equivalent to about 8 pages of text for a 101- page book, a LSTM network trained on such a set performs competitively compared to an identical network that is trained on a set of 60 randomly selected pages of the book.

Vanishing point: Scale independence in geomorphological hierarchies

NASA Astrophysics Data System (ADS)

Phillips, Jonathan D.

2016-08-01

Scale linkage problems in geosciences are often associated with a hierarchy of components. Both dynamical systems perspectives and intuition suggest that processes or relationships operating at fundamentally different scales are independent with respect to influences on system dynamics. But how far apart is ;fundamentally different;-that is, what is the ;vanishing point; at which scales are no longer interdependent? And how do we reconcile that with the idea (again, supported by both theory and intuition) that we can work our way along scale hierarchies from microscale to planetary (and vice-versa)? Graph and network theory are employed here to address these questions. Analysis of two archetypal hierarchical networks shows low algebraic connectivity, indicating low levels of inferential synchronization. This explains the apparent paradox between scale independence and hierarchical linkages. Incorporating more hierarchical levels results in an increase in complexity or entropy of the network as a whole, but at a nonlinear rate. Complexity increases as a power α of the number of levels in the hierarchy, with α < 1 and usually ≤ 0.6. However, algebraic connectivity decreases at a more rapid rate. Thus, the ability to infer one part of the hierarchical network from other level decays rapidly as more levels are added. Relatedness among system components decreases with differences in scale or resolution, analogous to distance decay in the spatial domain. These findings suggest a strategy of identifying and focusing on the most important or interesting scale levels, rather than attempting to identify the smallest or largest scale levels and work top-down or bottom-up from there. Examples are given from soil geomorphology and karst flow networks.

Predicting Slag Generation in Sub-Scale Test Motors Using a Neural Network

NASA Technical Reports Server (NTRS)

Wiesenberg, Brent

1999-01-01

Generation of slag (aluminum oxide) is an important issue for the Reusable Solid Rocket Motor (RSRM). Thiokol performed testing to quantify the relationship between raw material variations and slag generation in solid propellants by testing sub-scale motors cast with propellant containing various combinations of aluminum fuel and ammonium perchlorate (AP) oxidizer particle sizes. The test data were analyzed using statistical methods and an artificial neural network. This paper primarily addresses the neural network results with some comparisons to the statistical results. The neural network showed that the particle sizes of both the aluminum and unground AP have a measurable effect on slag generation. The neural network analysis showed that aluminum particle size is the dominant driver in slag generation, about 40% more influential than AP. The network predictions of the amount of slag produced during firing of sub-scale motors were 16% better than the predictions of a statistically derived empirical equation. Another neural network successfully characterized the slag generated during full-scale motor tests. The success is attributable to the ability of neural networks to characterize multiple complex factors including interactions that affect slag generation.

Research-informed design, management and maintenance of infrastructure slopes: development of a multi-scalar approach

NASA Astrophysics Data System (ADS)

Glendinning, S.; Helm, P. R.; Rouainia, M.; Stirling, R. A.; Asquith, J. D.; Hughes, P. N.; Toll, D. G.; Clarke, D.; Powrie, W.; Smethurst, J.; Hughes, D.; Harley, R.; Karim, R.; Dixon, N.; Crosby, C.; Chambers, J.; Dijkstra, T.; Gunn, D.; Briggs, K.; Muddle, D.

2015-09-01

The UK's transport infrastructure is one of the most heavily used in the world. The performance of these networks is critically dependent on the performance of cutting and embankment slopes which make up £20B of the £60B asset value of major highway infrastructure alone. The rail network in particular is also one of the oldest in the world: many of these slopes are suffering high incidents of instability (increasing with time). This paper describes the development of a fundamental understanding of earthwork material and system behaviour, through the systematic integration of research across a range of spatial and temporal scales. Spatially these range from microscopic studies of soil fabric, through elemental materials behaviour to whole slope modelling and monitoring and scaling up to transport networks. Temporally, historical and current weather event sequences are being used to understand and model soil deterioration processes, and climate change scenarios to examine their potential effects on slope performance in futures up to and including the 2080s. The outputs of this research are being mapped onto the different spatial and temporal scales of infrastructure slope asset management to inform the design of new slopes through to changing the way in which investment is made into aging assets. The aim ultimately is to help create a more reliable, cost effective, safer and more resilient transport system.

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

PubMed

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

2010-10-25

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

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks.

PubMed

Lee, Seungseob; Lee, SuKyoung; Kim, Kyungsoo; Kim, Yoon Hyuk

2015-01-01

Data traffic demands in cellular networks today are increasing at an exponential rate, giving rise to the development of heterogeneous networks (HetNets), in which small cells complement traditional macro cells by extending coverage to indoor areas. However, the deployment of small cells as parts of HetNets creates a key challenge for operators' careful network planning. In particular, massive and unplanned deployment of base stations can cause high interference, resulting in highly degrading network performance. Although different mathematical modeling and optimization methods have been used to approach various problems related to this issue, most traditional network planning models are ill-equipped to deal with HetNet-specific characteristics due to their focus on classical cellular network designs. Furthermore, increased wireless data demands have driven mobile operators to roll out large-scale networks of small long term evolution (LTE) cells. Therefore, in this paper, we aim to derive an optimum network planning algorithm for large-scale LTE HetNets. Recently, attempts have been made to apply evolutionary algorithms (EAs) to the field of radio network planning, since they are characterized as global optimization methods. Yet, EA performance often deteriorates rapidly with the growth of search space dimensionality. To overcome this limitation when designing optimum network deployments for large-scale LTE HetNets, we attempt to decompose the problem and tackle its subcomponents individually. Particularly noting that some HetNet cells have strong correlations due to inter-cell interference, we propose a correlation grouping approach in which cells are grouped together according to their mutual interference. Both the simulation and analytical results indicate that the proposed solution outperforms the random-grouping based EA as well as an EA that detects interacting variables by monitoring the changes in the objective function algorithm in terms of system throughput performance.

Impact of censoring on learning Bayesian networks in survival modelling.

PubMed

Stajduhar, Ivan; Dalbelo-Basić, Bojana; Bogunović, Nikola

2009-11-01

Bayesian networks are commonly used for presenting uncertainty and covariate interactions in an easily interpretable way. Because of their efficient inference and ability to represent causal relationships, they are an excellent choice for medical decision support systems in diagnosis, treatment, and prognosis. Although good procedures for learning Bayesian networks from data have been defined, their performance in learning from censored survival data has not been widely studied. In this paper, we explore how to use these procedures to learn about possible interactions between prognostic factors and their influence on the variate of interest. We study how censoring affects the probability of learning correct Bayesian network structures. Additionally, we analyse the potential usefulness of the learnt models for predicting the time-independent probability of an event of interest. We analysed the influence of censoring with a simulation on synthetic data sampled from randomly generated Bayesian networks. We used two well-known methods for learning Bayesian networks from data: a constraint-based method and a score-based method. We compared the performance of each method under different levels of censoring to those of the naive Bayes classifier and the proportional hazards model. We did additional experiments on several datasets from real-world medical domains. The machine-learning methods treated censored cases in the data as event-free. We report and compare results for several commonly used model evaluation metrics. On average, the proportional hazards method outperformed other methods in most censoring setups. As part of the simulation study, we also analysed structural similarities of the learnt networks. Heavy censoring, as opposed to no censoring, produces up to a 5% surplus and up to 10% missing total arcs. It also produces up to 50% missing arcs that should originally be connected to the variate of interest. Presented methods for learning Bayesian networks from data can be used to learn from censored survival data in the presence of light censoring (up to 20%) by treating censored cases as event-free. Given intermediate or heavy censoring, the learnt models become tuned to the majority class and would thus require a different approach.

Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk

NASA Astrophysics Data System (ADS)

Ye, Dandan; Dai, Meifeng; Sun, Yanqiu; Shao, Shuxiang; Xie, Qi

2016-09-01

Based on the weighted Koch networks and the self-similarity of fractals, we present a family of weighted polygon Koch networks with a weight factor r(0 < r ≤ 1) . We study the average receiving time (ART) on weight-dependent walk (i.e., the walker moves to any of its neighbors with probability proportional to the weight of edge linking them), whose key step is to calculate the sum of mean first-passage times (MFPTs) for all nodes absorpt at a hub node. We use a recursive division method to divide the weighted polygon Koch networks in order to calculate the ART scaling more conveniently. We show that the ART scaling exhibits a sublinear or linear dependence on network order. Thus, the weighted polygon Koch networks are more efficient than expended Koch networks in receiving information. Finally, compared with other previous studies' results (i.e., Koch networks, weighted Koch networks), we find out that our models are more general.

Extracting Communities from Complex Networks by the k-Dense Method

NASA Astrophysics Data System (ADS)

Saito, Kazumi; Yamada, Takeshi; Kazama, Kazuhiro

To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it produces only coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the three different types of networks assembled from real data, namely, from blog trackbacks, word associations and Wikipedia references, and demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.

Validation of the Social Networking Activity Intensity Scale among Junior Middle School Students in China

PubMed Central

Li, Jibin; Lau, Joseph T. F.; Mo, Phoenix K. H.; Su, Xuefen; Wu, Anise M. S.; Tang, Jie; Qin, Zuguo

2016-01-01

Background Online social networking use has been integrated into adolescents’ daily life and the intensity of online social networking use may have important consequences on adolescents’ well-being. However, there are few validated instruments to measure social networking use intensity. The present study aims to develop the Social Networking Activity Intensity Scale (SNAIS) and validate it among junior middle school students in China. Methods A total of 910 students who were social networking users were recruited from two junior middle schools in Guangzhou, and 114 students were retested after two weeks to examine the test-retest reliability. The psychometrics of the SNAIS were estimated using appropriate statistical methods. Results Two factors, Social Function Use Intensity (SFUI) and Entertainment Function Use Intensity (EFUI), were clearly identified by both exploratory and confirmatory factor analyses. No ceiling or floor effects were observed for the SNAIS and its two subscales. The SNAIS and its two subscales exhibited acceptable reliability (Cronbach’s alpha = 0.89, 0.90 and 0.60, and test-retest Intra-class Correlation Coefficient = 0.85, 0.87 and 0.67 for Overall scale, SFUI and EFUI subscale, respectively, p<0.001). As expected, the SNAIS and its subscale scores were correlated significantly with emotional connection to social networking, social networking addiction, Internet addiction, and characteristics related to social networking use. Conclusions The SNAIS is an easily self-administered scale with good psychometric properties. It would facilitate more research in this field worldwide and specifically in the Chinese population. PMID:27798699

Experience in running relational databases on clustered storage

NASA Astrophysics Data System (ADS)

Gaspar Aparicio, Ruben; Potocky, Miroslav

2015-12-01

For past eight years, CERN IT Database group has based its backend storage on NAS (Network-Attached Storage) architecture, providing database access via NFS (Network File System) protocol. In last two and half years, our storage has evolved from a scale-up architecture to a scale-out one. This paper describes our setup and a set of functionalities providing key features to other services like Database on Demand [1] or CERN Oracle backup and recovery service. It also outlines possible trend of evolution that, storage for databases could follow.

Autonomous smart sensor network for full-scale structural health monitoring

NASA Astrophysics Data System (ADS)

Rice, Jennifer A.; Mechitov, Kirill A.; Spencer, B. F., Jr.; Agha, Gul A.

2010-04-01

The demands of aging infrastructure require effective methods for structural monitoring and maintenance. Wireless smart sensor networks offer the ability to enhance structural health monitoring (SHM) practices through the utilization of onboard computation to achieve distributed data management. Such an approach is scalable to the large number of sensor nodes required for high-fidelity modal analysis and damage detection. While smart sensor technology is not new, the number of full-scale SHM applications has been limited. This slow progress is due, in part, to the complex network management issues that arise when moving from a laboratory setting to a full-scale monitoring implementation. This paper presents flexible network management software that enables continuous and autonomous operation of wireless smart sensor networks for full-scale SHM applications. The software components combine sleep/wake cycling for enhanced power management with threshold detection for triggering network wide tasks, such as synchronized sensing or decentralized modal analysis, during periods of critical structural response.

Exploring metabolic pathways in genome-scale networks via generating flux modes.

PubMed

Rezola, A; de Figueiredo, L F; Brock, M; Pey, J; Podhorski, A; Wittmann, C; Schuster, S; Bockmayr, A; Planes, F J

2011-02-15

The reconstruction of metabolic networks at the genome scale has allowed the analysis of metabolic pathways at an unprecedented level of complexity. Elementary flux modes (EFMs) are an appropriate concept for such analysis. However, their number grows in a combinatorial fashion as the size of the metabolic network increases, which renders the application of EFMs approach to large metabolic networks difficult. Novel methods are expected to deal with such complexity. In this article, we present a novel optimization-based method for determining a minimal generating set of EFMs, i.e. a convex basis. We show that a subset of elements of this convex basis can be effectively computed even in large metabolic networks. Our method was applied to examine the structure of pathways producing lysine in Escherichia coli. We obtained a more varied and informative set of pathways in comparison with existing methods. In addition, an alternative pathway to produce lysine was identified using a detour via propionyl-CoA, which shows the predictive power of our novel approach. The source code in C++ is available upon request.

Towards Online Multiresolution Community Detection in Large-Scale Networks

PubMed Central

Huang, Jianbin; Sun, Heli; Liu, Yaguang; Song, Qinbao; Weninger, Tim

2011-01-01

The investigation of community structure in networks has aroused great interest in multiple disciplines. One of the challenges is to find local communities from a starting vertex in a network without global information about the entire network. Many existing methods tend to be accurate depending on a priori assumptions of network properties and predefined parameters. In this paper, we introduce a new quality function of local community and present a fast local expansion algorithm for uncovering communities in large-scale networks. The proposed algorithm can detect multiresolution community from a source vertex or communities covering the whole network. Experimental results show that the proposed algorithm is efficient and well-behaved in both real-world and synthetic networks. PMID:21887325

Association between suicidal symptoms and repeat suicidal behaviour within a sample of hospital-treated suicide attempters

PubMed Central

van Borkulo, Claudia D.; O’Connor, Rory C.

2017-01-01

Background Suicidal behaviour is the end result of the complex relation between many factors which are biological, psychological and environmental in nature. Network analysis is a novel method that may help us better understand the complex association between different factors. Aims To examine the relationship between suicidal symptoms as assessed by the Beck Scale for Suicide Ideation and future suicidal behaviour in patients admitted to hospital following a suicide attempt, using network analysis. Method Secondary analysis was conducted on previously collected data from a sample of 366 patients who were admitted to a Scottish hospital following a suicide attempt. Network models were estimated to visualise and test the association between baseline symptom network structure and suicidal behaviour at 15-month follow-up. Results Network analysis showed that the desire for an active attempt was found to be the most central, strongly related suicide symptom. Of the 19 suicide symptoms that were assessed at baseline, 10 symptoms were directly related to repeat suicidal behaviour. When comparing baseline network structure of repeaters (n=94) with the network of non-repeaters (n=272), no significant differences were found. Conclusions Network analysis can help us better understand suicidal behaviour by visualising the complex relation between relevant symptoms and by indicating which symptoms are most central within the network. These insights have theoretical implications as well as informing the assessment and treatment of suicidal behaviour. Declaration of interest None. Copyright and usage © The Royal College of Psychiatrists 2017. This is an open access article distributed under the terms of the Creative Commons Non-Commercial, No Derivatives (CC BY-NC-ND) license. PMID:28507771

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

PubMed Central

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

2006-01-01

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

Nanoporous Metallic Networks: Fabrication, Optical Properties, and Applications.

PubMed

Ron, Racheli; Haleva, Emir; Salomon, Adi

2018-05-17

Nanoporous metallic networks are a group of porous materials made of solid metals with suboptical wavelength sizes of both particles and voids. They are characterized by unique optical properties, as well as high surface area and permeability of guest materials. As such, they attract a great focus as novel materials for photonics, catalysis, sensing, and renewable energy. Their properties together with the ability for scaling-up evoke an increased interest also in the industrial field. Here, fabrication techniques of large-scale metallic networks are discussed, and their interesting optical properties as well as their applications are considered. In particular, the focus is on disordered systems, which may facilitate the fabrication technique, yet, endow the three-dimensional (3D) network with distinct optical properties. These metallic networks bridge the nanoworld into the macroscopic world, and therefore pave the way to the fabrication of innovative materials with unique optoelectronic properties. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Programmability of nanowire networks

NASA Astrophysics Data System (ADS)

Bellew, A. T.; Bell, A. P.; McCarthy, E. K.; Fairfield, J. A.; Boland, J. J.

2014-07-01

Electrical connectivity in networks of nanoscale junctions must be better understood if nanowire devices are to be scaled up from single wires to functional material systems. We show that the natural connectivity behaviour found in random nanowire networks presents a new paradigm for creating multi-functional, programmable materials. In devices made from networks of Ni/NiO core-shell nanowires at different length scales, we discover the emergence of distinct behavioural regimes when networks are electrically stressed. We show that a small network, with few nanowire-nanowire junctions, acts as a unipolar resistive switch, demonstrating very high ON/OFF current ratios (>105). However, large networks of nanowires distribute an applied bias across a large number of junctions, and thus respond not by switching but instead by evolving connectivity. We demonstrate that these emergent properties lead to fault-tolerant materials whose resistance may be tuned, and which are capable of adaptively reconfiguring under stress. By combining these two behavioural regimes, we demonstrate that the same nanowire network may be programmed to act both as a metallic interconnect, and a resistive switch device with high ON/OFF ratio. These results enable the fabrication of programmable, multi-functional materials from random nanowire networks.Electrical connectivity in networks of nanoscale junctions must be better understood if nanowire devices are to be scaled up from single wires to functional material systems. We show that the natural connectivity behaviour found in random nanowire networks presents a new paradigm for creating multi-functional, programmable materials. In devices made from networks of Ni/NiO core-shell nanowires at different length scales, we discover the emergence of distinct behavioural regimes when networks are electrically stressed. We show that a small network, with few nanowire-nanowire junctions, acts as a unipolar resistive switch, demonstrating very high ON/OFF current ratios (>105). However, large networks of nanowires distribute an applied bias across a large number of junctions, and thus respond not by switching but instead by evolving connectivity. We demonstrate that these emergent properties lead to fault-tolerant materials whose resistance may be tuned, and which are capable of adaptively reconfiguring under stress. By combining these two behavioural regimes, we demonstrate that the same nanowire network may be programmed to act both as a metallic interconnect, and a resistive switch device with high ON/OFF ratio. These results enable the fabrication of programmable, multi-functional materials from random nanowire networks. Electronic supplementary information (ESI) available: Nanowire statistics (length, diameter statistics, and oxide thickness) are provided. Forming curves for single junctions and networks. Passive voltage contrast image demonstrating selectivity of conductive pathways in 100 μm network. See DOI: 10.1039/c4nr02338b

Robust scalable stabilisability conditions for large-scale heterogeneous multi-agent systems with uncertain nonlinear interactions: towards a distributed computing architecture

NASA Astrophysics Data System (ADS)

Manfredi, Sabato

2016-06-01

Large-scale dynamic systems are becoming highly pervasive in their occurrence with applications ranging from system biology, environment monitoring, sensor networks, and power systems. They are characterised by high dimensionality, complexity, and uncertainty in the node dynamic/interactions that require more and more computational demanding methods for their analysis and control design, as well as the network size and node system/interaction complexity increase. Therefore, it is a challenging problem to find scalable computational method for distributed control design of large-scale networks. In this paper, we investigate the robust distributed stabilisation problem of large-scale nonlinear multi-agent systems (briefly MASs) composed of non-identical (heterogeneous) linear dynamical systems coupled by uncertain nonlinear time-varying interconnections. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, new conditions are given for the distributed control design of large-scale MASs that can be easily solved by the toolbox of MATLAB. The stabilisability of each node dynamic is a sufficient assumption to design a global stabilising distributed control. The proposed approach improves some of the existing LMI-based results on MAS by both overcoming their computational limits and extending the applicative scenario to large-scale nonlinear heterogeneous MASs. Additionally, the proposed LMI conditions are further reduced in terms of computational requirement in the case of weakly heterogeneous MASs, which is a common scenario in real application where the network nodes and links are affected by parameter uncertainties. One of the main advantages of the proposed approach is to allow to move from a centralised towards a distributed computing architecture so that the expensive computation workload spent to solve LMIs may be shared among processors located at the networked nodes, thus increasing the scalability of the approach than the network size. Finally, a numerical example shows the applicability of the proposed method and its advantage in terms of computational complexity when compared with the existing approaches.

Similarity from multi-dimensional scaling: solving the accuracy and diversity dilemma in information filtering.

PubMed

Zeng, Wei; Zeng, An; Liu, Hao; Shang, Ming-Sheng; Zhang, Yi-Cheng

2014-01-01

Recommender systems are designed to assist individual users to navigate through the rapidly growing amount of information. One of the most successful recommendation techniques is the collaborative filtering, which has been extensively investigated and has already found wide applications in e-commerce. One of challenges in this algorithm is how to accurately quantify the similarities of user pairs and item pairs. In this paper, we employ the multidimensional scaling (MDS) method to measure the similarities between nodes in user-item bipartite networks. The MDS method can extract the essential similarity information from the networks by smoothing out noise, which provides a graphical display of the structure of the networks. With the similarity measured from MDS, we find that the item-based collaborative filtering algorithm can outperform the diffusion-based recommendation algorithms. Moreover, we show that this method tends to recommend unpopular items and increase the global diversification of the networks in long term.

Facile one-step construction of covalently networked, self-healable, and transparent superhydrophobic composite films

NASA Astrophysics Data System (ADS)

Lee, Yujin; You, Eun-Ah; Ha, Young-Geun

2018-07-01

Despite the considerable demand for bioinspired superhydrophobic surfaces with highly transparent, self-cleaning, and self-healable properties, a facile and scalable fabrication method for multifunctional superhydrophobic films with strong chemical networks has rarely been established. Here, we report a rationally designed facile one-step construction of covalently networked, transparent, self-cleaning, and self-healable superhydrophobic films via a one-step preparation and single-reaction process of multi-components. As coating materials for achieving the one-step fabrication of multifunctional superhydrophobic films, we included two different sizes of Al2O3 nanoparticles for hierarchical micro/nano dual-scale structures and transparent films, fluoroalkylsilane for both low surface energy and covalent binding functions, and aluminum nitrate for aluminum oxide networked films. On the basis of stability tests for the robust film composition, the optimized, covalently linked superhydrophobic composite films with a high water contact angle (>160°) and low sliding angle (<1°) showed excellent thermal stability (up to 400 °C), transparency (≈80%), self-healing, self-cleaning, and waterproof abilities. Therefore, the rationally designed, covalently networked superhydrophobic composite films, fabricated via a one-step solution-based process, can be further utilized for various optical and optoelectronic applications.

Evolving Scale-Free Networks by Poisson Process: Modeling and Degree Distribution.

PubMed

Feng, Minyu; Qu, Hong; Yi, Zhang; Xie, Xiurui; Kurths, Jurgen

2016-05-01

Since the great mathematician Leonhard Euler initiated the study of graph theory, the network has been one of the most significant research subject in multidisciplinary. In recent years, the proposition of the small-world and scale-free properties of complex networks in statistical physics made the network science intriguing again for many researchers. One of the challenges of the network science is to propose rational models for complex networks. In this paper, in order to reveal the influence of the vertex generating mechanism of complex networks, we propose three novel models based on the homogeneous Poisson, nonhomogeneous Poisson and birth death process, respectively, which can be regarded as typical scale-free networks and utilized to simulate practical networks. The degree distribution and exponent are analyzed and explained in mathematics by different approaches. In the simulation, we display the modeling process, the degree distribution of empirical data by statistical methods, and reliability of proposed networks, results show our models follow the features of typical complex networks. Finally, some future challenges for complex systems are discussed.

Multiplex Networks of Cortical and Hippocampal Neurons Revealed at Different Timescales

PubMed Central

Timme, Nicholas; Ito, Shinya; Myroshnychenko, Maxym; Yeh, Fang-Chin; Hiolski, Emma; Hottowy, Pawel; Beggs, John M.

2014-01-01

Recent studies have emphasized the importance of multiplex networks – interdependent networks with shared nodes and different types of connections – in systems primarily outside of neuroscience. Though the multiplex properties of networks are frequently not considered, most networks are actually multiplex networks and the multiplex specific features of networks can greatly affect network behavior (e.g. fault tolerance). Thus, the study of networks of neurons could potentially be greatly enhanced using a multiplex perspective. Given the wide range of temporally dependent rhythms and phenomena present in neural systems, we chose to examine multiplex networks of individual neurons with time scale dependent connections. To study these networks, we used transfer entropy – an information theoretic quantity that can be used to measure linear and nonlinear interactions – to systematically measure the connectivity between individual neurons at different time scales in cortical and hippocampal slice cultures. We recorded the spiking activity of almost 12,000 neurons across 60 tissue samples using a 512-electrode array with 60 micrometer inter-electrode spacing and 50 microsecond temporal resolution. To the best of our knowledge, this preparation and recording method represents a superior combination of number of recorded neurons and temporal and spatial recording resolutions to any currently available in vivo system. We found that highly connected neurons (“hubs”) were localized to certain time scales, which, we hypothesize, increases the fault tolerance of the network. Conversely, a large proportion of non-hub neurons were not localized to certain time scales. In addition, we found that long and short time scale connectivity was uncorrelated. Finally, we found that long time scale networks were significantly less modular and more disassortative than short time scale networks in both tissue types. As far as we are aware, this analysis represents the first systematic study of temporally dependent multiplex networks among individual neurons. PMID:25536059

Robust visual tracking via multiscale deep sparse networks

NASA Astrophysics Data System (ADS)

Wang, Xin; Hou, Zhiqiang; Yu, Wangsheng; Xue, Yang; Jin, Zefenfen; Dai, Bo

2017-04-01

In visual tracking, deep learning with offline pretraining can extract more intrinsic and robust features. It has significant success solving the tracking drift in a complicated environment. However, offline pretraining requires numerous auxiliary training datasets and is considerably time-consuming for tracking tasks. To solve these problems, a multiscale sparse networks-based tracker (MSNT) under the particle filter framework is proposed. Based on the stacked sparse autoencoders and rectifier linear unit, the tracker has a flexible and adjustable architecture without the offline pretraining process and exploits the robust and powerful features effectively only through online training of limited labeled data. Meanwhile, the tracker builds four deep sparse networks of different scales, according to the target's profile type. During tracking, the tracker selects the matched tracking network adaptively in accordance with the initial target's profile type. It preserves the inherent structural information more efficiently than the single-scale networks. Additionally, a corresponding update strategy is proposed to improve the robustness of the tracker. Extensive experimental results on a large scale benchmark dataset show that the proposed method performs favorably against state-of-the-art methods in challenging environments.

Inference of scale-free networks from gene expression time series.

PubMed

Daisuke, Tominaga; Horton, Paul

2006-04-01

Quantitative time-series observation of gene expression is becoming possible, for example by cell array technology. However, there are no practical methods with which to infer network structures using only observed time-series data. As most computational models of biological networks for continuous time-series data have a high degree of freedom, it is almost impossible to infer the correct structures. On the other hand, it has been reported that some kinds of biological networks, such as gene networks and metabolic pathways, may have scale-free properties. We hypothesize that the architecture of inferred biological network models can be restricted to scale-free networks. We developed an inference algorithm for biological networks using only time-series data by introducing such a restriction. We adopt the S-system as the network model, and a distributed genetic algorithm to optimize models to fit its simulated results to observed time series data. We have tested our algorithm on a case study (simulated data). We compared optimization under no restriction, which allows for a fully connected network, and under the restriction that the total number of links must equal that expected from a scale free network. The restriction reduced both false positive and false negative estimation of the links and also the differences between model simulation and the given time-series data.

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.

Statistical downscaling of precipitation using long short-term memory recurrent neural networks

NASA Astrophysics Data System (ADS)

Misra, Saptarshi; Sarkar, Sudeshna; Mitra, Pabitra

2017-11-01

Hydrological impacts of global climate change on regional scale are generally assessed by downscaling large-scale climatic variables, simulated by General Circulation Models (GCMs), to regional, small-scale hydrometeorological variables like precipitation, temperature, etc. In this study, we propose a new statistical downscaling model based on Recurrent Neural Network with Long Short-Term Memory which captures the spatio-temporal dependencies in local rainfall. The previous studies have used several other methods such as linear regression, quantile regression, kernel regression, beta regression, and artificial neural networks. Deep neural networks and recurrent neural networks have been shown to be highly promising in modeling complex and highly non-linear relationships between input and output variables in different domains and hence we investigated their performance in the task of statistical downscaling. We have tested this model on two datasets—one on precipitation in Mahanadi basin in India and the second on precipitation in Campbell River basin in Canada. Our autoencoder coupled long short-term memory recurrent neural network model performs the best compared to other existing methods on both the datasets with respect to temporal cross-correlation, mean squared error, and capturing the extremes.

Understanding pathways for scaling up health services through the lens of complex adaptive systems.

PubMed

Paina, Ligia; Peters, David H

2012-08-01

Despite increased prominence and funding of global health initiatives, efforts to scale up health services in developing countries are falling short of the expectations of the Millennium Development Goals. Arguing that the dominant assumptions for scaling up are inadequate, we propose that interpreting change in health systems through the lens of complex adaptive systems (CAS) provides better models of pathways for scaling up. Based on an understanding of CAS behaviours, we describe how phenomena such as path dependence, feedback loops, scale-free networks, emergent behaviour and phase transitions can uncover relevant lessons for the design and implementation of health policy and programmes in the context of scaling up health services. The implications include paying more attention to local context, incentives and institutions, as well as anticipating certain types of unintended consequences that can undermine scaling up efforts, and developing and implementing programmes that engage key actors through transparent use of data for ongoing problem-solving and adaptation. We propose that future efforts to scale up should adapt and apply the models and methodologies which have been used in other fields that study CAS, yet are underused in public health. This can help policy makers, planners, implementers and researchers to explore different and innovative approaches for reaching populations in need with effective, equitable and efficient health services. The old assumptions have led to disappointed expectations about how to scale up health services, and offer little insight on how to scale up effective interventions in the future. The alternative perspectives offered by CAS may better reflect the complex and changing nature of health systems, and create new opportunities for understanding and scaling up health services.

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

Carothers, Christopher D.; Meredith, Jeremy S.; Blanco, Marc

Performance modeling of extreme-scale applications on accurate representations of potential architectures is critical for designing next generation supercomputing systems because it is impractical to construct prototype systems at scale with new network hardware in order to explore designs and policies. However, these simulations often rely on static application traces that can be difficult to work with because of their size and lack of flexibility to extend or scale up without rerunning the original application. To address this problem, we have created a new technique for generating scalable, flexible workloads from real applications, we have implemented a prototype, called Durango, thatmore » combines a proven analytical performance modeling language, Aspen, with the massively parallel HPC network modeling capabilities of the CODES framework.Our models are compact, parameterized and representative of real applications with computation events. They are not resource intensive to create and are portable across simulator environments. We demonstrate the utility of Durango by simulating the LULESH application in the CODES simulation environment on several topologies and show that Durango is practical to use for simulation without loss of fidelity, as quantified by simulation metrics. During our validation of Durango's generated communication model of LULESH, we found that the original LULESH miniapp code had a latent bug where the MPI_Waitall operation was used incorrectly. This finding underscores the potential need for a tool such as Durango, beyond its benefits for flexible workload generation and modeling.Additionally, we demonstrate the efficacy of Durango's direct integration approach, which links Aspen into CODES as part of the running network simulation model. Here, Aspen generates the application-level computation timing events, which in turn drive the start of a network communication phase. Results show that Durango's performance scales well when executing both torus and dragonfly network models on up to 4K Blue Gene/Q nodes using 32K MPI ranks, Durango also avoids the overheads and complexities associated with extreme-scale trace files.« less

Meeting the memory challenges of brain-scale network simulation.

PubMed

Kunkel, Susanne; Potjans, Tobias C; Eppler, Jochen M; Plesser, Hans Ekkehard; Morrison, Abigail; Diesmann, Markus

2011-01-01

The development of high-performance simulation software is crucial for studying the brain connectome. Using connectome data to generate neurocomputational models requires software capable of coping with models on a variety of scales: from the microscale, investigating plasticity, and dynamics of circuits in local networks, to the macroscale, investigating the interactions between distinct brain regions. Prior to any serious dynamical investigation, the first task of network simulations is to check the consistency of data integrated in the connectome and constrain ranges for yet unknown parameters. Thanks to distributed computing techniques, it is possible today to routinely simulate local cortical networks of around 10(5) neurons with up to 10(9) synapses on clusters and multi-processor shared-memory machines. However, brain-scale networks are orders of magnitude larger than such local networks, in terms of numbers of neurons and synapses as well as in terms of computational load. Such networks have been investigated in individual studies, but the underlying simulation technologies have neither been described in sufficient detail to be reproducible nor made publicly available. Here, we discover that as the network model sizes approach the regime of meso- and macroscale simulations, memory consumption on individual compute nodes becomes a critical bottleneck. This is especially relevant on modern supercomputers such as the Blue Gene/P architecture where the available working memory per CPU core is rather limited. We develop a simple linear model to analyze the memory consumption of the constituent components of neuronal simulators as a function of network size and the number of cores used. This approach has multiple benefits. The model enables identification of key contributing components to memory saturation and prediction of the effects of potential improvements to code before any implementation takes place. As a consequence, development cycles can be shorter and less expensive. Applying the model to our freely available Neural Simulation Tool (NEST), we identify the software components dominant at different scales, and develop general strategies for reducing the memory consumption, in particular by using data structures that exploit the sparseness of the local representation of the network. We show that these adaptations enable our simulation software to scale up to the order of 10,000 processors and beyond. As memory consumption issues are likely to be relevant for any software dealing with complex connectome data on such architectures, our approach and our findings should be useful for researchers developing novel neuroinformatics solutions to the challenges posed by the connectome project.

Directed deposition of inorganic oxide networks on patterned polymer templates

NASA Astrophysics Data System (ADS)

Ford, Thomas James Robert

Inspired by nature, we have successfully directed the deposition of inorganic oxide materials on polymer templates via a combination of top-down and bottom-up fabrication methods. We have functionally mimicked the hierarchical silica exoskeletons of diatoms, where specialized proteins chaperone the condensation of silicic acid into nanoscale silica networks confined by microscopic vesicle walls. We replaced the proteins with functionally analogous polyamines and vesicles with lithographically defined polymer templates. We grafted the polyamines either to the surface or throughout the template by changing the template chemistry and altering our grafting strategy. Exposure to an inorganic oxide precursor solution led to electrostatic aggregation at the polyamine chains, catalyzing hydrolysis and condensation to form long-range inorganic oxide nanoparticle networks. Grafted to epoxy surfaces, swelling effects and the hyperbranched brush morphology lead to the formation of nanofruit features that generated thin, conformal inorganic coatings. When the polyamines were grafted throughout hydrogel templates, we obtained composite networks that yielded faithful inorganic replicas of the original patterns. By varying the polyamine chain length and combustion parameters, we controlled the nanoparticle size, morphology, and crystalline phase. The polyamine morphology affected the resulting inorganic network in both fabrication schemes and we could control the depostion over multiple length scales. Because our methods were compatible with a variety of lithographic methods, we were able to generate inorganic replicas of 1D, 2D, and 3D polymer structures. These may be used for a wide range of applications, including sensing, catalysis, photonic, phononic, photovoltaic, and others that require well-defined inorganic structures.

Recognition of Roasted Coffee Bean Levels using Image Processing and Neural Network

NASA Astrophysics Data System (ADS)

Nasution, T. H.; Andayani, U.

2017-03-01

The coffee beans roast levels have some characteristics. However, some people cannot recognize the coffee beans roast level. In this research, we propose to design a method to recognize the coffee beans roast level of images digital by processing the image and classifying with backpropagation neural network. The steps consist of how to collect the images data with image acquisition, pre-processing, feature extraction using Gray Level Co-occurrence Matrix (GLCM) method and finally normalization of data extraction using decimal scaling features. The values of decimal scaling features become an input of classifying in backpropagation neural network. We use the method of backpropagation to recognize the coffee beans roast levels. The results showed that the proposed method is able to identify the coffee roasts beans level with an accuracy of 97.5%.

Convergent evolution of gene networks by single-gene duplications in higher eukaryotes.

PubMed

Amoutzias, Gregory D; Robertson, David L; Oliver, Stephen G; Bornberg-Bauer, Erich

2004-03-01

By combining phylogenetic, proteomic and structural information, we have elucidated the evolutionary driving forces for the gene-regulatory interaction networks of basic helix-loop-helix transcription factors. We infer that recurrent events of single-gene duplication and domain rearrangement repeatedly gave rise to distinct networks with almost identical hub-based topologies, and multiple activators and repressors. We thus provide the first empirical evidence for scale-free protein networks emerging through single-gene duplications, the dominant importance of molecular modularity in the bottom-up construction of complex biological entities, and the convergent evolution of networks.

Optimal knockout strategies in genome-scale metabolic networks using particle swarm optimization.

PubMed

Nair, Govind; Jungreuthmayer, Christian; Zanghellini, Jürgen

2017-02-01

Knockout strategies, particularly the concept of constrained minimal cut sets (cMCSs), are an important part of the arsenal of tools used in manipulating metabolic networks. Given a specific design, cMCSs can be calculated even in genome-scale networks. We would however like to find not only the optimal intervention strategy for a given design but the best possible design too. Our solution (PSOMCS) is to use particle swarm optimization (PSO) along with the direct calculation of cMCSs from the stoichiometric matrix to obtain optimal designs satisfying multiple objectives. To illustrate the working of PSOMCS, we apply it to a toy network. Next we show its superiority by comparing its performance against other comparable methods on a medium sized E. coli core metabolic network. PSOMCS not only finds solutions comparable to previously published results but also it is orders of magnitude faster. Finally, we use PSOMCS to predict knockouts satisfying multiple objectives in a genome-scale metabolic model of E. coli and compare it with OptKnock and RobustKnock. PSOMCS finds competitive knockout strategies and designs compared to other current methods and is in some cases significantly faster. It can be used in identifying knockouts which will force optimal desired behaviors in large and genome scale metabolic networks. It will be even more useful as larger metabolic models of industrially relevant organisms become available.

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

A Neutral Network based Early Eathquake Warning model in California region

NASA Astrophysics Data System (ADS)

Xiao, H.; MacAyeal, D. R.

2016-12-01

Early Earthquake Warning systems could reduce loss of lives and other economic impact resulted from natural disaster or man-made calamity. Current systems could be further enhanced by neutral network method. A 3 layer neural network model combined with onsite method was deployed in this paper to improve the recognition time and detection time for large scale earthquakes.The 3 layer neutral network early earthquake warning model adopted the vector feature design for sample events happened within 150 km radius of the epicenters. Dataset used in this paper contained both destructive events and small scale events. All the data was extracted from IRIS database to properly train the model. In the training process, backpropagation algorithm was used to adjust the weight matrices and bias matrices during each iteration. The information in all three channels of the seismometers served as the source in this model. Through designed tests, it was indicated that this model could identify approximately 90 percent of the events' scale correctly. And the early detection could provide informative evidence for public authorities to make further decisions. This indicated that neutral network model could have the potential to strengthen current early warning system, since the onsite method may greatly reduce the responding time and save more lives in such disasters.

Distributed weighted least-squares estimation with fast convergence for large-scale systems.

PubMed

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods.

Distributed weighted least-squares estimation with fast convergence for large-scale systems☆

PubMed Central

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods. PMID:25641976

Closing the water balance with cosmic-ray soil moisture measurements and assessing their spatial variability within two semiarid watersheds

NASA Astrophysics Data System (ADS)

Schreiner-McGraw, A. P.; Vivoni, E. R.; Mascaro, G.; Franz, T. E.

2015-06-01

Soil moisture dynamics reflect the complex interactions of meteorological conditions with soil, vegetation and terrain properties. In this study, intermediate scale soil moisture estimates from the cosmic-ray sensing (CRS) method are evaluated for two semiarid ecosystems in the southwestern United States: a mesquite savanna at the Santa Rita Experimental Range (SRER) and a mixed shrubland at the Jornada Experimental Range (JER). Evaluations of the CRS method are performed for small watersheds instrumented with a distributed sensor network consisting of soil moisture sensor profiles, an eddy covariance tower and runoff flumes used to close the water balance. We found an excellent agreement between the CRS method and the distributed sensor network (RMSE of 0.009 and 0.013 m3 m-3 at SRER and JER) at the hourly time scale over the 19-month study period, primarily due to the inclusion of 5 cm observations of shallow soil moisture. Good agreement was obtained in soil moisture changes estimated from the CRS and watershed water balance methods (RMSE = 0.001 and 0.038 m3 m-3 at SRER and JER), with deviations due to bypassing of the CRS measurement depth during large rainfall events. This limitation, however, was used to show that drier-than-average conditions at SRER promoted plant water uptake from deeper layers, while the wetter-than-average period at JER resulted in leakage towards deeper soils. Using the distributed sensor network, we quantified the spatial variability of soil moisture in the CRS footprint and the relation between evapotranspiration and soil moisture, in both cases finding similar predictive relations at both sites that are applicable to other semiarid ecosystems in the southwestern US. Furthermore, soil moisture spatial variability was related to evapotranspiration in a manner consistent with analytical relations derived using the CRS method, opening up new possibilities for understanding land-atmosphere interactions.

A Spiking Neural Simulator Integrating Event-Driven and Time-Driven Computation Schemes Using Parallel CPU-GPU Co-Processing: A Case Study.

PubMed

Naveros, Francisco; Luque, Niceto R; Garrido, Jesús A; Carrillo, Richard R; Anguita, Mancia; Ros, Eduardo

2015-07-01

Time-driven simulation methods in traditional CPU architectures perform well and precisely when simulating small-scale spiking neural networks. Nevertheless, they still have drawbacks when simulating large-scale systems. Conversely, event-driven simulation methods in CPUs and time-driven simulation methods in graphic processing units (GPUs) can outperform CPU time-driven methods under certain conditions. With this performance improvement in mind, we have developed an event-and-time-driven spiking neural network simulator suitable for a hybrid CPU-GPU platform. Our neural simulator is able to efficiently simulate bio-inspired spiking neural networks consisting of different neural models, which can be distributed heterogeneously in both small layers and large layers or subsystems. For the sake of efficiency, the low-activity parts of the neural network can be simulated in CPU using event-driven methods while the high-activity subsystems can be simulated in either CPU (a few neurons) or GPU (thousands or millions of neurons) using time-driven methods. In this brief, we have undertaken a comparative study of these different simulation methods. For benchmarking the different simulation methods and platforms, we have used a cerebellar-inspired neural-network model consisting of a very dense granular layer and a Purkinje layer with a smaller number of cells (according to biological ratios). Thus, this cerebellar-like network includes a dense diverging neural layer (increasing the dimensionality of its internal representation and sparse coding) and a converging neural layer (integration) similar to many other biologically inspired and also artificial neural networks.

The Global Geometry of River Drainage Basins and the Signature of Tectonic and Autogenic Processes

NASA Astrophysics Data System (ADS)

Giachetta, E.; Willett, S.

2015-12-01

The plan-form structure of the world's river basins contains extensive information regarding tectonic, paleo-geographic and paleo-climate conditions, but interpretation of this structure is complicated by the need to disentangle these processes from the autogenic behavior of fluvial processes. One method of interpreting this structure is by utilizing the well-established scaling between drainage area and channel slope. Integration of this scaling relationship predicts a relationship between channel length and downstream integrated drainage area, referred to in recent studies as χ (Willett et al., 2014). In this paper, we apply this methodology at a continental scale by calculating χ for the world's river networks using hydrological information from the HydroSHED (Hydrological data and maps based on SHuttleElevation Derivatives at multiple Scales) suite of geo-referenced data sets (drainage directions and flow accumulations). River pixels were identified using a minimum drainage area of 5 km2. A constant value of m/n of 0.45 was assumed. We applied a new method to correct χ within closed basins where base level is different from sea level. Mapping of χ illustrates the geometric stability of a river network, thus highlighting where tectonic or climatic forcing has perturbed the shape and geometry. Each continent shows characteristic features. Continental rift margins on all continents show clear asymmetric escarpments indicating inland migration. Active orogenic belts break up older river basins, but are difficult to interpret because of spatially variable uplift rates. Regions of recent tilting are evident even in cratonic areas by lateral reorganizations of basins. Past and pending river captures are identified on all continents. Very few regions on Earth appear to be in near-equilibrium, though some are identified; for example the Urals appears to provide a stable continental divide for Eurasia. Our analysis of maps of χ at the global scale quantifies a dynamic view of Earth's river networks and helps to identify past and ongoing evolution of Earth's landscapes. References Willett, S.D., McCoy, S.W., Perron, J.T., Goren, L., Chen C.Y. (2014): Dynamic reorganization of river basins, Science 343, 1248765. DOI: 10.1126/science.1248765.

Assessment of habitat representation across a network of marine protected areas with implications for the spatial design of monitoring.

PubMed

Young, Mary; Carr, Mark

2015-01-01

Networks of marine protected areas (MPAs) are being adopted globally to protect ecosystems and supplement fisheries management. The state of California recently implemented a coast-wide network of MPAs, a statewide seafloor mapping program, and ecological characterizations of species and ecosystems targeted for protection by the network. The main goals of this study were to use these data to evaluate how well seafloor features, as proxies for habitats, are represented and replicated across an MPA network and how well ecological surveys representatively sampled fish habitats inside MPAs and adjacent reference sites. Seafloor data were classified into broad substrate categories (rock and sediment) and finer scale geomorphic classifications standard to marine classification schemes using surface analyses (slope, ruggedness, etc.) done on the digital elevation model derived from multibeam bathymetry data. These classifications were then used to evaluate the representation and replication of seafloor structure within the MPAs and across the ecological surveys. Both the broad substrate categories and the finer scale geomorphic features were proportionately represented for many of the classes with deviations of 1-6% and 0-7%, respectively. Within MPAs, however, representation of seafloor features differed markedly from original estimates, with differences ranging up to 28%. Seafloor structure in the biological monitoring design had mismatches between sampling in the MPAs and their corresponding reference sites and some seafloor structure classes were missed entirely. The geomorphic variables derived from multibeam bathymetry data for these analyses are known determinants of the distribution and abundance of marine species and for coastal marine biodiversity. Thus, analyses like those performed in this study can be a valuable initial method of evaluating and predicting the conservation value of MPAs across a regional network.

Metamodeling and the Critic-based approach to multi-level optimization.

PubMed

Werbos, Ludmilla; Kozma, Robert; Silva-Lugo, Rodrigo; Pazienza, Giovanni E; Werbos, Paul J

2012-08-01

Large-scale networks with hundreds of thousands of variables and constraints are becoming more and more common in logistics, communications, and distribution domains. Traditionally, the utility functions defined on such networks are optimized using some variation of Linear Programming, such as Mixed Integer Programming (MIP). Despite enormous progress both in hardware (multiprocessor systems and specialized processors) and software (Gurobi) we are reaching the limits of what these tools can handle in real time. Modern logistic problems, for example, call for expanding the problem both vertically (from one day up to several days) and horizontally (combining separate solution stages into an integrated model). The complexity of such integrated models calls for alternative methods of solution, such as Approximate Dynamic Programming (ADP), which provide a further increase in the performance necessary for the daily operation. In this paper, we present the theoretical basis and related experiments for solving the multistage decision problems based on the results obtained for shorter periods, as building blocks for the models and the solution, via Critic-Model-Action cycles, where various types of neural networks are combined with traditional MIP models in a unified optimization system. In this system architecture, fast and simple feed-forward networks are trained to reasonably initialize more complicated recurrent networks, which serve as approximators of the value function (Critic). The combination of interrelated neural networks and optimization modules allows for multiple queries for the same system, providing flexibility and optimizing performance for large-scale real-life problems. A MATLAB implementation of our solution procedure for a realistic set of data and constraints shows promising results, compared to the iterative MIP approach. Copyright © 2012 Elsevier Ltd. All rights reserved.

Assessment of Habitat Representation across a Network of Marine Protected Areas with Implications for the Spatial Design of Monitoring

PubMed Central

Young, Mary; Carr, Mark

2015-01-01

Networks of marine protected areas (MPAs) are being adopted globally to protect ecosystems and supplement fisheries management. The state of California recently implemented a coast-wide network of MPAs, a statewide seafloor mapping program, and ecological characterizations of species and ecosystems targeted for protection by the network. The main goals of this study were to use these data to evaluate how well seafloor features, as proxies for habitats, are represented and replicated across an MPA network and how well ecological surveys representatively sampled fish habitats inside MPAs and adjacent reference sites. Seafloor data were classified into broad substrate categories (rock and sediment) and finer scale geomorphic classifications standard to marine classification schemes using surface analyses (slope, ruggedness, etc.) done on the digital elevation model derived from multibeam bathymetry data. These classifications were then used to evaluate the representation and replication of seafloor structure within the MPAs and across the ecological surveys. Both the broad substrate categories and the finer scale geomorphic features were proportionately represented for many of the classes with deviations of 1-6% and 0-7%, respectively. Within MPAs, however, representation of seafloor features differed markedly from original estimates, with differences ranging up to 28%. Seafloor structure in the biological monitoring design had mismatches between sampling in the MPAs and their corresponding reference sites and some seafloor structure classes were missed entirely. The geomorphic variables derived from multibeam bathymetry data for these analyses are known determinants of the distribution and abundance of marine species and for coastal marine biodiversity. Thus, analyses like those performed in this study can be a valuable initial method of evaluating and predicting the conservation value of MPAs across a regional network. PMID:25760858

Constructing an integrated gene similarity network for the identification of disease genes.

PubMed

Tian, Zhen; Guo, Maozu; Wang, Chunyu; Xing, LinLin; Wang, Lei; Zhang, Yin

2017-09-20

Discovering novel genes that are involved human diseases is a challenging task in biomedical research. In recent years, several computational approaches have been proposed to prioritize candidate disease genes. Most of these methods are mainly based on protein-protein interaction (PPI) networks. However, since these PPI networks contain false positives and only cover less half of known human genes, their reliability and coverage are very low. Therefore, it is highly necessary to fuse multiple genomic data to construct a credible gene similarity network and then infer disease genes on the whole genomic scale. We proposed a novel method, named RWRB, to infer causal genes of interested diseases. First, we construct five individual gene (protein) similarity networks based on multiple genomic data of human genes. Then, an integrated gene similarity network (IGSN) is reconstructed based on similarity network fusion (SNF) method. Finally, we employee the random walk with restart algorithm on the phenotype-gene bilayer network, which combines phenotype similarity network, IGSN as well as phenotype-gene association network, to prioritize candidate disease genes. We investigate the effectiveness of RWRB through leave-one-out cross-validation methods in inferring phenotype-gene relationships. Results show that RWRB is more accurate than state-of-the-art methods on most evaluation metrics. Further analysis shows that the success of RWRB is benefited from IGSN which has a wider coverage and higher reliability comparing with current PPI networks. Moreover, we conduct a comprehensive case study for Alzheimer's disease and predict some novel disease genes that supported by literature. RWRB is an effective and reliable algorithm in prioritizing candidate disease genes on the genomic scale. Software and supplementary information are available at http://nclab.hit.edu.cn/~tianzhen/RWRB/ .

A Low Collision and High Throughput Data Collection Mechanism for Large-Scale Super Dense Wireless Sensor Networks.

PubMed

Lei, Chunyang; Bie, Hongxia; Fang, Gengfa; Gaura, Elena; Brusey, James; Zhang, Xuekun; Dutkiewicz, Eryk

2016-07-18

Super dense wireless sensor networks (WSNs) have become popular with the development of Internet of Things (IoT), Machine-to-Machine (M2M) communications and Vehicular-to-Vehicular (V2V) networks. While highly-dense wireless networks provide efficient and sustainable solutions to collect precise environmental information, a new channel access scheme is needed to solve the channel collision problem caused by the large number of competing nodes accessing the channel simultaneously. In this paper, we propose a space-time random access method based on a directional data transmission strategy, by which collisions in the wireless channel are significantly decreased and channel utility efficiency is greatly enhanced. Simulation results show that our proposed method can decrease the packet loss rate to less than 2 % in large scale WSNs and in comparison with other channel access schemes for WSNs, the average network throughput can be doubled.

Autoscoring Essays Based on Complex Networks

ERIC Educational Resources Information Center

Ke, Xiaohua; Zeng, Yongqiang; Luo, Haijiao

2016-01-01

This article presents a novel method, the Complex Dynamics Essay Scorer (CDES), for automated essay scoring using complex network features. Texts produced by college students in China were represented as scale-free networks (e.g., a word adjacency model) from which typical network features, such as the in-/out-degrees, clustering coefficient (CC),…

Counting motifs in dynamic networks.

PubMed

Mukherjee, Kingshuk; Hasan, Md Mahmudul; Boucher, Christina; Kahveci, Tamer

2018-04-11

A network motif is a sub-network that occurs frequently in a given network. Detection of such motifs is important since they uncover functions and local properties of the given biological network. Finding motifs is however a computationally challenging task as it requires solving the costly subgraph isomorphism problem. Moreover, the topology of biological networks change over time. These changing networks are called dynamic biological networks. As the network evolves, frequency of each motif in the network also changes. Computing the frequency of a given motif from scratch in a dynamic network as the network topology evolves is infeasible, particularly for large and fast evolving networks. In this article, we design and develop a scalable method for counting the number of motifs in a dynamic biological network. Our method incrementally updates the frequency of each motif as the underlying network's topology evolves. Our experiments demonstrate that our method can update the frequency of each motif in orders of magnitude faster than counting the motif embeddings every time the network changes. If the network evolves more frequently, the margin with which our method outperforms the existing static methods, increases. We evaluated our method extensively using synthetic and real datasets, and show that our method is highly accurate(≥ 96%) and that it can be scaled to large dense networks. The results on real data demonstrate the utility of our method in revealing interesting insights on the evolution of biological processes.

[Scale effect of Nanjing urban green infrastructure network pattern and connectivity analysis.

PubMed

Yu, Ya Ping; Yin, Hai Wei; Kong, Fan Hua; Wang, Jing Jing; Xu, Wen Bin

2016-07-01

Based on ArcGIS, Erdas, GuidosToolbox, Conefor and other software platforms, using morphological spatial pattern analysis (MSPA) and landscape connectivity analysis methods, this paper quantitatively analysed the scale effect, edge effect and distance effect of the Nanjing urban green infrastructure network pattern in 2013 by setting different pixel sizes (P) and edge widths in MSPA analysis, and setting different dispersal distance thresholds in landscape connectivity analysis. The results showed that the type of landscape acquired based on the MSPA had a clear scale effect and edge effect, and scale effects only slightly affected landscape types, whereas edge effects were more obvious. Different dispersal distances had a great impact on the landscape connectivity, 2 km or 2.5 km dispersal distance was a critical threshold for Nanjing. When selecting the pixel size 30 m of the input data and the edge wide 30 m used in the morphological model, we could get more detailed landscape information of Nanjing UGI network. Based on MSPA and landscape connectivity, analysis of the scale effect, edge effect, and distance effect on the landscape types of the urban green infrastructure (UGI) network was helpful for selecting the appropriate size, edge width, and dispersal distance when developing these networks, and for better understanding the spatial pattern of UGI networks and the effects of scale and distance on the ecology of a UGI network. This would facilitate a more scientifically valid set of design parameters for UGI network spatiotemporal pattern analysis. The results of this study provided an important reference for Nanjing UGI networks and a basis for the analysis of the spatial and temporal patterns of medium-scale UGI landscape networks in other regions.

Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks

PubMed Central

Vestergaard, Christian L.; Génois, Mathieu

2015-01-01

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling. PMID:26517860

Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks.

PubMed

Vestergaard, Christian L; Génois, Mathieu

2015-10-01

Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling.

Fractional parentage analysis and a scale-free reproductive network of brown trout.

PubMed

Koyano, Hitoshi; Serbezov, Dimitar; Kishino, Hirohisa; Schweder, Tore

2013-11-07

In this study, we developed a method of fractional parentage analysis using microsatellite markers. We propose a method for calculating parentage probability, which considers missing data and genotyping errors due to null alleles and other causes, by regarding observed alleles as realizations of random variables which take values in the set of alleles at the locus and developing a method for simultaneously estimating the true and null allele frequencies of all alleles at each locus. We then applied our proposed method to a large sample collected from a wild population of brown trout (Salmo trutta). On analyzing the data using our method, we found that the reproductive success of brown trout obeyed a power law, indicating that when the parent-offspring relationship is regarded as a link, the reproductive system of brown trout is a scale-free network. Characteristics of the reproductive network of brown trout include individuals with large bodies as hubs in the network and different power exponents of degree distributions between males and females. © 2013 Elsevier Ltd. All rights reserved.

Decompositions of large-scale biological systems based on dynamical properties.

PubMed

Soranzo, Nicola; Ramezani, Fahimeh; Iacono, Giovanni; Altafini, Claudio

2012-01-01

Given a large-scale biological network represented as an influence graph, in this article we investigate possible decompositions of the network aimed at highlighting specific dynamical properties. The first decomposition we study consists in finding a maximal directed acyclic subgraph of the network, which dynamically corresponds to searching for a maximal open-loop subsystem of the given system. Another dynamical property investigated is strong monotonicity. We propose two methods to deal with this property, both aimed at decomposing the system into strongly monotone subsystems, but with different structural characteristics: one method tends to produce a single large strongly monotone component, while the other typically generates a set of smaller disjoint strongly monotone subsystems. Original heuristics for the methods investigated are described in the article. altafini@sissa.it

Streaming parallel GPU acceleration of large-scale filter-based spiking neural networks.

PubMed

Slażyński, Leszek; Bohte, Sander

2012-01-01

The arrival of graphics processing (GPU) cards suitable for massively parallel computing promises affordable large-scale neural network simulation previously only available at supercomputing facilities. While the raw numbers suggest that GPUs may outperform CPUs by at least an order of magnitude, the challenge is to develop fine-grained parallel algorithms to fully exploit the particulars of GPUs. Computation in a neural network is inherently parallel and thus a natural match for GPU architectures: given inputs, the internal state for each neuron can be updated in parallel. We show that for filter-based spiking neurons, like the Spike Response Model, the additive nature of membrane potential dynamics enables additional update parallelism. This also reduces the accumulation of numerical errors when using single precision computation, the native precision of GPUs. We further show that optimizing simulation algorithms and data structures to the GPU's architecture has a large pay-off: for example, matching iterative neural updating to the memory architecture of the GPU speeds up this simulation step by a factor of three to five. With such optimizations, we can simulate in better-than-realtime plausible spiking neural networks of up to 50 000 neurons, processing over 35 million spiking events per second.

High Fidelity Simulations of Large-Scale Wireless Networks (Plus-Up)

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

Onunkwo, Uzoma

Sandia has built a strong reputation in scalable network simulation and emulation for cyber security studies to protect our nation’s critical information infrastructures. Georgia Tech has preeminent reputation in academia for excellence in scalable discrete event simulations, with strong emphasis on simulating cyber networks. Many of the experts in this field, such as Dr. Richard Fujimoto, Dr. George Riley, and Dr. Chris Carothers, have strong affiliations with Georgia Tech. The collaborative relationship that we intend to immediately pursue is in high fidelity simulations of practical large-scale wireless networks using ns-3 simulator via Dr. George Riley. This project will have mutualmore » benefits in bolstering both institutions’ expertise and reputation in the field of scalable simulation for cyber-security studies. This project promises to address high fidelity simulations of large-scale wireless networks. This proposed collaboration is directly in line with Georgia Tech’s goals for developing and expanding the Communications Systems Center, the Georgia Tech Broadband Institute, and Georgia Tech Information Security Center along with its yearly Emerging Cyber Threats Report. At Sandia, this work benefits the defense systems and assessment area with promise for large-scale assessment of cyber security needs and vulnerabilities of our nation’s critical cyber infrastructures exposed to wireless communications.« less

A protocol for generating a high-quality genome-scale metabolic reconstruction.

PubMed

Thiele, Ines; Palsson, Bernhard Ø

2010-01-01

Network reconstructions are a common denominator in systems biology. Bottom-up metabolic network reconstructions have been developed over the last 10 years. These reconstructions represent structured knowledge bases that abstract pertinent information on the biochemical transformations taking place within specific target organisms. The conversion of a reconstruction into a mathematical format facilitates a myriad of computational biological studies, including evaluation of network content, hypothesis testing and generation, analysis of phenotypic characteristics and metabolic engineering. To date, genome-scale metabolic reconstructions for more than 30 organisms have been published and this number is expected to increase rapidly. However, these reconstructions differ in quality and coverage that may minimize their predictive potential and use as knowledge bases. Here we present a comprehensive protocol describing each step necessary to build a high-quality genome-scale metabolic reconstruction, as well as the common trials and tribulations. Therefore, this protocol provides a helpful manual for all stages of the reconstruction process.

A protocol for generating a high-quality genome-scale metabolic reconstruction

PubMed Central

Thiele, Ines; Palsson, Bernhard Ø.

2011-01-01

Network reconstructions are a common denominator in systems biology. Bottom-up metabolic network reconstructions have developed over the past 10 years. These reconstructions represent structured knowledge-bases that abstract pertinent information on the biochemical transformations taking place within specific target organisms. The conversion of a reconstruction into a mathematical format facilitates myriad computational biological studies including evaluation of network content, hypothesis testing and generation, analysis of phenotypic characteristics, and metabolic engineering. To date, genome-scale metabolic reconstructions for more than 30 organisms have been published and this number is expected to increase rapidly. However, these reconstructions differ in quality and coverage that may minimize their predictive potential and use as knowledge-bases. Here, we present a comprehensive protocol describing each step necessary to build a high-quality genome-scale metabolic reconstruction as well as common trials and tribulations. Therefore, this protocol provides a helpful manual for all stages of the reconstruction process. PMID:20057383

Identifying influential nodes in complex networks: A node information dimension approach

NASA Astrophysics Data System (ADS)

Bian, Tian; Deng, Yong

2018-04-01

In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method.

SegAN: Adversarial Network with Multi-scale L1 Loss for Medical Image Segmentation.

PubMed

Xue, Yuan; Xu, Tao; Zhang, Han; Long, L Rodney; Huang, Xiaolei

2018-05-03

Inspired by classic Generative Adversarial Networks (GANs), we propose a novel end-to-end adversarial neural network, called SegAN, for the task of medical image segmentation. Since image segmentation requires dense, pixel-level labeling, the single scalar real/fake output of a classic GAN's discriminator may be ineffective in producing stable and sufficient gradient feedback to the networks. Instead, we use a fully convolutional neural network as the segmentor to generate segmentation label maps, and propose a novel adversarial critic network with a multi-scale L 1 loss function to force the critic and segmentor to learn both global and local features that capture long- and short-range spatial relationships between pixels. In our SegAN framework, the segmentor and critic networks are trained in an alternating fashion in a min-max game: The critic is trained by maximizing a multi-scale loss function, while the segmentor is trained with only gradients passed along by the critic, with the aim to minimize the multi-scale loss function. We show that such a SegAN framework is more effective and stable for the segmentation task, and it leads to better performance than the state-of-the-art U-net segmentation method. We tested our SegAN method using datasets from the MICCAI BRATS brain tumor segmentation challenge. Extensive experimental results demonstrate the effectiveness of the proposed SegAN with multi-scale loss: on BRATS 2013 SegAN gives performance comparable to the state-of-the-art for whole tumor and tumor core segmentation while achieves better precision and sensitivity for Gd-enhance tumor core segmentation; on BRATS 2015 SegAN achieves better performance than the state-of-the-art in both dice score and precision.

Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks

PubMed Central

2014-01-01

Protein-protein interaction (PPI) networks carry vital information on the organization of molecular interactions in cellular systems. The identification of functionally relevant modules in PPI networks is one of the most important applications of biological network analysis. Computational analysis is becoming an indispensable tool to understand large-scale biomolecular interaction networks. Several types of computational methods have been developed and employed for the analysis of PPI networks. Of these computational methods, graph comparison and module detection are the two most commonly used strategies. This review summarizes current literature on graph kernel and graph alignment methods for graph comparison strategies, as well as module detection approaches including seed-and-extend, hierarchical clustering, optimization-based, probabilistic, and frequent subgraph methods. Herein, we provide a comprehensive review of the major algorithms employed under each theme, including our recently published frequent subgraph method, for detecting functional modules commonly shared across multiple cancer PPI networks. PMID:24800226

Flow interaction based propagation model and bursty influence behavior analysis of Internet flows

NASA Astrophysics Data System (ADS)

Wu, Xiao-Yu; Gu, Ren-Tao; Ji, Yue-Feng

2016-11-01

QoS (quality of service) fluctuations caused by Internet bursty flows influence the user experience in the Internet, such as the increment of packet loss and transmission time. In this paper, we establish a mathematical model to study the influence propagation behavior of the bursty flow, which is helpful for developing a deep understanding of the network dynamics in the Internet complex system. To intuitively reflect the propagation process, a data flow interaction network with a hierarchical structure is constructed, where the neighbor order is proposed to indicate the neighborhood relationship between the bursty flow and other flows. The influence spreads from the bursty flow to each order of neighbors through flow interactions. As the influence spreads, the bursty flow has negative effects on the odd order neighbors and positive effects on the even order neighbors. The influence intensity of bursty flow decreases sharply between two adjacent orders and the decreasing degree can reach up to dozens of times in the experimental simulation. Moreover, the influence intensity increases significantly when network congestion situation becomes serious, especially for the 1st order neighbors. Network structural factors are considered to make a further study. Simulation results show that the physical network scale expansion can reduce the influence intensity of bursty flow by decreasing the flow distribution density. Furthermore, with the same network scale, the influence intensity in WS small-world networks is 38.18% and 18.40% lower than that in ER random networks and BA scale-free networks, respectively, due to a lower interaction probability between flows. These results indicate that the macro-structural changes such as network scales and styles will affect the inner propagation behaviors of the bursty flow.

A fast button surface defects detection method based on convolutional neural network

NASA Astrophysics Data System (ADS)

Liu, Lizhe; Cao, Danhua; Wu, Songlin; Wu, Yubin; Wei, Taoran

2018-01-01

Considering the complexity of the button surface texture and the variety of buttons and defects, we propose a fast visual method for button surface defect detection, based on convolutional neural network (CNN). CNN has the ability to extract the essential features by training, avoiding designing complex feature operators adapted to different kinds of buttons, textures and defects. Firstly, we obtain the normalized button region and then use HOG-SVM method to identify the front and back side of the button. Finally, a convolutional neural network is developed to recognize the defects. Aiming at detecting the subtle defects, we propose a network structure with multiple feature channels input. To deal with the defects of different scales, we take a strategy of multi-scale image block detection. The experimental results show that our method is valid for a variety of buttons and able to recognize all kinds of defects that have occurred, including dent, crack, stain, hole, wrong paint and uneven. The detection rate exceeds 96%, which is much better than traditional methods based on SVM and methods based on template match. Our method can reach the speed of 5 fps on DSP based smart camera with 600 MHz frequency.

Conversion of alcohols to enantiopure amines through dual enzyme hydrogen-borrowing cascades

PubMed Central

Mutti, Francesco G.; Knaus, Tanja; Scrutton, Nigel S.; Breuer, Michael; Turner, Nicholas J.

2016-01-01

α-Chiral amines are key intermediates for the synthesis of a plethora of chemical compounds on industrial scale. Here we present a biocatalytic hydrogen-borrowing amination of primary and secondary alcohols that allows for the efficient and environmentally benign production of enantiopure amines. The method relies on the combination of an alcohol dehydrogenase (ADHs from Aromatoleum sp., Lactobacillus sp. and Bacillus sp.) enzyme operating in tandem with an amine dehydrogenase (AmDHs engineered from Bacillus sp.) to aminate a structurally diverse range of aromatic and aliphatic alcohols (up to 96% conversion and 99% enantiomeric excess). Furthermore, primary alcohols are aminated with high conversion (up to 99%). This redox self-sufficient network possesses high atom efficiency, sourcing nitrogen from ammonium and generating water as the sole by-product. PMID:26404833

Highly ordered large-scale neuronal networks of individual cells - toward single cell to 3D nanowire intracellular interfaces.

PubMed

Kwiat, Moria; Elnathan, Roey; Pevzner, Alexander; Peretz, Asher; Barak, Boaz; Peretz, Hagit; Ducobni, Tamir; Stein, Daniel; Mittelman, Leonid; Ashery, Uri; Patolsky, Fernando

2012-07-25

The use of artificial, prepatterned neuronal networks in vitro is a promising approach for studying the development and dynamics of small neural systems in order to understand the basic functionality of neurons and later on of the brain. The present work presents a high fidelity and robust procedure for controlling neuronal growth on substrates such as silicon wafers and glass, enabling us to obtain mature and durable neural networks of individual cells at designed geometries. It offers several advantages compared to other related techniques that have been reported in recent years mainly because of its high yield and reproducibility. The procedure is based on surface chemistry that allows the formation of functional, tailormade neural architectures with a micrometer high-resolution partition, that has the ability to promote or repel cells attachment. The main achievements of this work are deemed to be the creation of a large scale neuronal network at low density down to individual cells, that develop intact typical neurites and synapses without any glia-supportive cells straight from the plating stage and with a relatively long term survival rate, up to 4 weeks. An important application of this method is its use on 3D nanopillars and 3D nanowire-device arrays, enabling not only the cell bodies, but also their neurites to be positioned directly on electrical devices and grow with registration to the recording elements underneath.

Intrinsic brain connectivity predicts impulse control disorders in patients with Parkinson's disease.

PubMed

Tessitore, Alessandro; De Micco, Rosa; Giordano, Alfonso; di Nardo, Federica; Caiazzo, Giuseppina; Siciliano, Mattia; De Stefano, Manuela; Russo, Antonio; Esposito, Fabrizio; Tedeschi, Gioacchino

2017-12-01

Impulse control disorders can be triggered by dopamine replacement therapies in patients with PD. Using resting-state functional MRI, we investigated the intrinsic brain network connectivity at baseline in a cohort of drug-naive PD patients who successively developed impulse control disorders over a 36-month follow-up period compared with patients who did not. Baseline 3-Tesla MRI images of 30 drug-naive PD patients and 20 matched healthy controls were analyzed. The impulse control disorders' presence and severity at follow-up were assessed by the Questionnaire for Impulsive-Compulsive Disorders in Parkinson's Disease Rating Scale. Single-subject and group-level independent component analysis was used to investigate functional connectivity differences within the major resting-state networks. We also compared internetwork connectivity between patients. Finally, a multivariate Cox regression model was used to investigate baseline predictors of impulse control disorder development. At baseline, decreased connectivity in the default-mode and right central executive networks and increased connectivity in the salience network were detected in PD patients with impulse control disorders at follow-up compared with those without. Increased default-mode/central executive internetwork connectivity was significantly associated with impulse control disorders development (P < 0.05). Our findings demonstrated that abnormal brain connectivity in the three large-scale networks characterizes drug-naive PD patients who will eventually develop impulse control disorders while on dopaminergic treatment. We hypothesize that these divergent cognitive and limbic network connectivity changes could represent a potential biomarker and an additional risk factor for the emergence of impulse control disorders. © 2017 International Parkinson and Movement Disorder Society. © 2017 International Parkinson and Movement Disorder Society.

NIBBS-search for fast and accurate prediction of phenotype-biased metabolic systems.

PubMed

Schmidt, Matthew C; Rocha, Andrea M; Padmanabhan, Kanchana; Shpanskaya, Yekaterina; Banfield, Jill; Scott, Kathleen; Mihelcic, James R; Samatova, Nagiza F

2012-01-01

Understanding of genotype-phenotype associations is important not only for furthering our knowledge on internal cellular processes, but also essential for providing the foundation necessary for genetic engineering of microorganisms for industrial use (e.g., production of bioenergy or biofuels). However, genotype-phenotype associations alone do not provide enough information to alter an organism's genome to either suppress or exhibit a phenotype. It is important to look at the phenotype-related genes in the context of the genome-scale network to understand how the genes interact with other genes in the organism. Identification of metabolic subsystems involved in the expression of the phenotype is one way of placing the phenotype-related genes in the context of the entire network. A metabolic system refers to a metabolic network subgraph; nodes are compounds and edges labels are the enzymes that catalyze the reaction. The metabolic subsystem could be part of a single metabolic pathway or span parts of multiple pathways. Arguably, comparative genome-scale metabolic network analysis is a promising strategy to identify these phenotype-related metabolic subsystems. Network Instance-Based Biased Subgraph Search (NIBBS) is a graph-theoretic method for genome-scale metabolic network comparative analysis that can identify metabolic systems that are statistically biased toward phenotype-expressing organismal networks. We set up experiments with target phenotypes like hydrogen production, TCA expression, and acid-tolerance. We show via extensive literature search that some of the resulting metabolic subsystems are indeed phenotype-related and formulate hypotheses for other systems in terms of their role in phenotype expression. NIBBS is also orders of magnitude faster than MULE, one of the most efficient maximal frequent subgraph mining algorithms that could be adjusted for this problem. Also, the set of phenotype-biased metabolic systems output by NIBBS comes very close to the set of phenotype-biased subgraphs output by an exact maximally-biased subgraph enumeration algorithm ( MBS-Enum ). The code (NIBBS and the module to visualize the identified subsystems) is available at http://freescience.org/cs/NIBBS.

NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems

PubMed Central

Padmanabhan, Kanchana; Shpanskaya, Yekaterina; Banfield, Jill; Scott, Kathleen; Mihelcic, James R.; Samatova, Nagiza F.

2012-01-01

Understanding of genotype-phenotype associations is important not only for furthering our knowledge on internal cellular processes, but also essential for providing the foundation necessary for genetic engineering of microorganisms for industrial use (e.g., production of bioenergy or biofuels). However, genotype-phenotype associations alone do not provide enough information to alter an organism's genome to either suppress or exhibit a phenotype. It is important to look at the phenotype-related genes in the context of the genome-scale network to understand how the genes interact with other genes in the organism. Identification of metabolic subsystems involved in the expression of the phenotype is one way of placing the phenotype-related genes in the context of the entire network. A metabolic system refers to a metabolic network subgraph; nodes are compounds and edges labels are the enzymes that catalyze the reaction. The metabolic subsystem could be part of a single metabolic pathway or span parts of multiple pathways. Arguably, comparative genome-scale metabolic network analysis is a promising strategy to identify these phenotype-related metabolic subsystems. Network Instance-Based Biased Subgraph Search (NIBBS) is a graph-theoretic method for genome-scale metabolic network comparative analysis that can identify metabolic systems that are statistically biased toward phenotype-expressing organismal networks. We set up experiments with target phenotypes like hydrogen production, TCA expression, and acid-tolerance. We show via extensive literature search that some of the resulting metabolic subsystems are indeed phenotype-related and formulate hypotheses for other systems in terms of their role in phenotype expression. NIBBS is also orders of magnitude faster than MULE, one of the most efficient maximal frequent subgraph mining algorithms that could be adjusted for this problem. Also, the set of phenotype-biased metabolic systems output by NIBBS comes very close to the set of phenotype-biased subgraphs output by an exact maximally-biased subgraph enumeration algorithm ( MBS-Enum ). The code (NIBBS and the module to visualize the identified subsystems) is available at http://freescience.org/cs/NIBBS. PMID:22589706

Abelian Higgs cosmic strings: Small-scale structure and loops

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

Hindmarsh, Mark; Stuckey, Stephanie; Bevis, Neil

2009-06-15

Classical lattice simulations of the Abelian Higgs model are used to investigate small-scale structure and loop distributions in cosmic string networks. Use of the field theory ensures that the small-scale physics is captured correctly. The results confirm analytic predictions of Polchinski and Rocha 29 for the two-point correlation function of the string tangent vector, with a power law from length scales of order the string core width up to horizon scale. An analysis of the size distribution of string loops gives a very low number density, of order 1 per horizon volume, in contrast with Nambu-Goto simulations. Further, our loopmore » distribution function does not support the detailed analytic predictions for loop production derived by Dubath et al. 30. Better agreement to our data is found with a model based on loop fragmentation 32, coupled with a constant rate of energy loss into massive radiation. Our results show a strong energy-loss mechanism, which allows the string network to scale without gravitational radiation, but which is not due to the production of string width loops. From evidence of small-scale structure we argue a partial explanation for the scale separation problem of how energy in the very low frequency modes of the string network is transformed into the very high frequency modes of gauge and Higgs radiation. We propose a picture of string network evolution, which reconciles the apparent differences between Nambu-Goto and field theory simulations.« less

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks

PubMed Central

Yu, Haiyang; Wu, Zhihai; Wang, Shuqin; Wang, Yunpeng; Ma, Xiaolei

2017-01-01

Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction. PMID:28672867

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks.

PubMed

Yu, Haiyang; Wu, Zhihai; Wang, Shuqin; Wang, Yunpeng; Ma, Xiaolei

2017-06-26

Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

Image object recognition based on the Zernike moment and neural networks

NASA Astrophysics Data System (ADS)

Wan, Jianwei; Wang, Ling; Huang, Fukan; Zhou, Liangzhu

1998-03-01

This paper first give a comprehensive discussion about the concept of artificial neural network its research methods and the relations with information processing. On the basis of such a discussion, we expound the mathematical similarity of artificial neural network and information processing. Then, the paper presents a new method of image recognition based on invariant features and neural network by using image Zernike transform. The method not only has the invariant properties for rotation, shift and scale of image object, but also has good fault tolerance and robustness. Meanwhile, it is also compared with statistical classifier and invariant moments recognition method.

Cluster-modified function projective synchronisation of complex networks with asymmetric coupling

NASA Astrophysics Data System (ADS)

Wang, Shuguo

2018-02-01

This paper investigates the cluster-modified function projective synchronisation (CMFPS) of a generalised linearly coupled network with asymmetric coupling and nonidentical dynamical nodes. A novel synchronisation scheme is proposed to achieve CMFPS in community networks. We use adaptive control method to derive CMFPS criteria based on Lyapunov stability theory. Each cluster of networks is synchronised with target system by state transformation with scaling function matrix. Numerical simulation results are presented finally to illustrate the effectiveness of this method.

Community Detection on the GPU

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

Naim, Md; Manne, Fredrik; Halappanavar, Mahantesh

We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune the load balance when processing networks with nodes of highly varying degrees. This is achieved by scaling the number of threads assigned to each node according to its degree. Extensive experiments show that we obtain speedups up to a factor of 270 compared to the sequential algorithm. The algorithm consistently outperforms other recent shared memory implementations and is only one order ofmore » magnitude slower than the current fastest parallel Louvain method running on a Blue Gene/Q supercomputer using more than 500K threads.« less

Evaluating North American Electric Grid Reliability Using the Barabasi-Albert Network Model

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

Chassin, David P.; Posse, Christian

2005-09-15

The reliability of electric transmission systems is examined using a scale-free model of network topology and failure propagation. The topologies of the North American eastern and western electric grids are analyzed to estimate their reliability based on the Barabási-Albert network model. A commonly used power system reliability index is computed using a simple failure propagation model. The results are compared to the values of power system reliability indices previously obtained using other methods and they suggest that scale-free network models are usable to estimate aggregate electric grid reliability.

Evaluating North American Electric Grid Reliability Using the Barabasi-Albert Network Model

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

Chassin, David P.; Posse, Christian

2005-09-15

The reliability of electric transmission systems is examined using a scale-free model of network topology and failure propagation. The topologies of the North American eastern and western electric grids are analyzed to estimate their reliability based on the Barabasi-Albert network model. A commonly used power system reliability index is computed using a simple failure propagation model. The results are compared to the values of power system reliability indices previously obtained using standard power engineering methods, and they suggest that scale-free network models are usable to estimate aggregate electric grid reliability.

Trapping in scale-free networks with hierarchical organization of modularity.

PubMed

Zhang, Zhongzhi; Lin, Yuan; Gao, Shuyang; Zhou, Shuigeng; Guan, Jihong; Li, Mo

2009-11-01

A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking place on such networks. In this paper, we investigate a simple stochastic process--trapping problem, a random walk with a perfect trap fixed at a given location, performed on a family of hierarchical networks that exhibit simultaneously striking scale-free and modular structure. We focus on a particular case with the immobile trap positioned at the hub node having the largest degree. Using a method based on generating functions, we determine explicitly the mean first-passage time (MFPT) for the trapping problem, which is the mean of the node-to-trap first-passage time over the entire network. The exact expression for the MFPT is calculated through the recurrence relations derived from the special construction of the hierarchical networks. The obtained rigorous formula corroborated by extensive direct numerical calculations exhibits that the MFPT grows algebraically with the network order. Concretely, the MFPT increases as a power-law function of the number of nodes with the exponent much less than 1. We demonstrate that the hierarchical networks under consideration have more efficient structure for transport by diffusion in contrast with other analytically soluble media including some previously studied scale-free networks. We argue that the scale-free and modular topologies are responsible for the high efficiency of the trapping process on the hierarchical networks.

Multi-temporal monitoring of a regional riparian buffer network (>12,000 km) with LiDAR and photogrammetric point clouds.

PubMed

Michez, Adrien; Piégay, Hervé; Lejeune, Philippe; Claessens, Hugues

2017-11-01

Riparian buffers are of major concern for land and water resource managers despite their relatively low spatial coverage. In Europe, this concern has been acknowledged by different environmental directives which recommend multi-scale monitoring (from local to regional scales). Remote sensing methods could be a cost-effective alternative to field-based monitoring, to build replicable "wall-to-wall" monitoring strategies of large river networks and associated riparian buffers. The main goal of our study is to extract and analyze various parameters of the riparian buffers of up to 12,000 km of river in southern Belgium (Wallonia) from three-dimensional (3D) point clouds based on LiDAR and photogrammetric surveys to i) map riparian buffers parameters on different scales, ii) interpret the regional patterns of the riparian buffers and iii) propose new riparian buffer management indicators. We propose different strategies to synthesize and visualize relevant information at different spatial scales ranging from local (<10 km) to regional scale (>12,000 km). Our results showed that the selected parameters had a clear regional pattern. The reaches of Ardenne ecoregion have channels with the highest flow widths and shallowest depths. In contrast, the reaches of the Loam ecoregion have the narrowest and deepest flow channels. Regional variability in channel width and depth is used to locate management units potentially affected by human impact. Riparian forest of the Loam ecoregion is characterized by the lowest longitudinal continuity and mean tree height, underlining significant human disturbance. As the availability of 3D point clouds at the regional scale is constantly growing, our study proposes reproducible methods which can be integrated into regional monitoring by land managers. With LiDAR still being relatively expensive to acquire, the use of photogrammetric point clouds combined with LiDAR data is a cost-effective means to update the characterization of the riparian forest conditions. Copyright © 2017 Elsevier Ltd. All rights reserved.

Efficient Power Network Analysis with Modeling of Inductive Effects

NASA Astrophysics Data System (ADS)

Zeng, Shan; Yu, Wenjian; Hong, Xianlong; Cheng, Chung-Kuan

In this paper, an efficient method is proposed to accurately analyze large-scale power/ground (P/G) networks, where inductive parasitics are modeled with the partial reluctance. The method is based on frequency-domain circuit analysis and the technique of vector fitting [14], and obtains the time-domain voltage response at given P/G nodes. The frequency-domain circuit equation including partial reluctances is derived, and then solved with the GMRES algorithm with rescaling, preconditioning and recycling techniques. With the merit of sparsified reluctance matrix and iterative solving techniques for the frequency-domain circuit equations, the proposed method is able to handle large-scale P/G networks with complete inductive modeling. Numerical results show that the proposed method is orders of magnitude faster than HSPICE, several times faster than INDUCTWISE [4], and capable of handling the inductive P/G structures with more than 100, 000 wire segments.

Survey on large scale system control methods

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1987-01-01

The problem inherent to large scale systems such as power network, communication network and economic or ecological systems were studied. The increase in size and flexibility of future spacecraft has put those dynamical systems into the category of large scale systems, and tools specific to the class of large systems are being sought to design control systems that can guarantee more stability and better performance. Among several survey papers, reference was found to a thorough investigation on decentralized control methods. Especially helpful was the classification made of the different existing approaches to deal with large scale systems. A very similar classification is used, even though the papers surveyed are somehow different from the ones reviewed in other papers. Special attention is brought to the applicability of the existing methods to controlling large mechanical systems like large space structures. Some recent developments are added to this survey.

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming.

PubMed

Song, Hyun-Seob; Goldberg, Noam; Mahajan, Ashutosh; Ramkrishna, Doraiswami

2017-08-01

Elementary (flux) modes (EMs) have served as a valuable tool for investigating structural and functional properties of metabolic networks. Identification of the full set of EMs in genome-scale networks remains challenging due to combinatorial explosion of EMs in complex networks. It is often, however, that only a small subset of relevant EMs needs to be known, for which optimization-based sequential computation is a useful alternative. Most of the currently available methods along this line are based on the iterative use of mixed integer linear programming (MILP), the effectiveness of which significantly deteriorates as the number of iterations builds up. To alleviate the computational burden associated with the MILP implementation, we here present a novel optimization algorithm termed alternate integer linear programming (AILP). Our algorithm was designed to iteratively solve a pair of integer programming (IP) and linear programming (LP) to compute EMs in a sequential manner. In each step, the IP identifies a minimal subset of reactions, the deletion of which disables all previously identified EMs. Thus, a subsequent LP solution subject to this reaction deletion constraint becomes a distinct EM. In cases where no feasible LP solution is available, IP-derived reaction deletion sets represent minimal cut sets (MCSs). Despite the additional computation of MCSs, AILP achieved significant time reduction in computing EMs by orders of magnitude. The proposed AILP algorithm not only offers a computational advantage in the EM analysis of genome-scale networks, but also improves the understanding of the linkage between EMs and MCSs. The software is implemented in Matlab, and is provided as supplementary information . hyunseob.song@pnnl.gov. Supplementary data are available at Bioinformatics online. Published by Oxford University Press 2017. This work is written by US Government employees and are in the public domain in the US.

Methods for High-Order Multi-Scale and Stochastic Problems Analysis, Algorithms, and Applications

DTIC Science & Technology

2016-10-17

finite volume schemes, discontinuous Galerkin finite element method, and related methods, for solving computational fluid dynamics (CFD) problems and...approximation for finite element methods. (3) The development of methods of simulation and analysis for the study of large scale stochastic systems of...laws, finite element method, Bernstein-Bezier finite elements , weakly interacting particle systems, accelerated Monte Carlo, stochastic networks 16

Establishing and Scaling-Up Clinical Social Franchise Networks: Lessons Learned From Marie Stopes International and Population Services International

PubMed Central

Thurston, Sarah; Chakraborty, Nirali M; Hayes, Brendan; Mackay, Anna; Moon, Pierre

2015-01-01

In many low- and middle-income countries, a majority of people seek health care from the private sector. However, fragmentation, poor economies of scale, inadequate financing, political opposition, a bias toward curative services, and weak regulatory and quality control systems pose serious challenges for the private sector. Social franchising addresses a number of these challenges by organizing small, independent health care businesses into quality-assured networks. Global franchisors Marie Stopes International (MSI) and Population Services International (PSI) have rapidly scaled their family planning social franchising programs in recent years, jointly delivering over 10.8 million couple-years of protection (CYPs) in 2014—up 26% from 8.6 million CYPs just 1 year prior. Drawing on experience across MSI’s 17 and PSI’s 25 social franchise networks across Africa, Asia, and Latin America and the Caribbean, this article documents the organizations’ operational approaches, challenges faced, and solutions implemented. The organizations provide intensive capacity building and support for private-sector providers, including clinical training, branding, monitoring quality of franchised services, and commodity support. In addition, franchising programs engage providers and clients through behavior change communication (BCC) and demand generation activities to raise awareness and to attract clients, and they implement initiatives to ensure services are affordable for the lowest-income clients. Social franchise programs offer the private sector a collective platform to better engage government in health policy advocacy and for integrating into new public health care financing and procurement mechanisms. The future of social franchising will require developing approaches to scale-up and sustain the model cost-effectively, selectively integrating other health services into the franchise package, and being responsive to evolving health care financing approaches with the potential to contribute to universal health coverage. PMID:26085017

Recent progress in invariant pattern recognition

NASA Astrophysics Data System (ADS)

Arsenault, Henri H.; Chang, S.; Gagne, Philippe; Gualdron Gonzalez, Oscar

1996-12-01

We present some recent results in invariant pattern recognition, including methods that are invariant under two or more distortions of position, orientation and scale. There are now a few methods that yield good results under changes of both rotation and scale. Some new methods are introduced. These include locally adaptive nonlinear matched filters, scale-adapted wavelet transforms and invariant filters for disjoint noise. Methods using neural networks will also be discussed, including an optical method that allows simultaneous classification of multiple targets.

Synaptic dynamics contribute to long-term single neuron response fluctuations.

PubMed

Reinartz, Sebastian; Biro, Istvan; Gal, Asaf; Giugliano, Michele; Marom, Shimon

2014-01-01

Firing rate variability at the single neuron level is characterized by long-memory processes and complex statistics over a wide range of time scales (from milliseconds up to several hours). Here, we focus on the contribution of non-stationary efficacy of the ensemble of synapses-activated in response to a given stimulus-on single neuron response variability. We present and validate a method tailored for controlled and specific long-term activation of a single cortical neuron in vitro via synaptic or antidromic stimulation, enabling a clear separation between two determinants of neuronal response variability: membrane excitability dynamics vs. synaptic dynamics. Applying this method we show that, within the range of physiological activation frequencies, the synaptic ensemble of a given neuron is a key contributor to the neuronal response variability, long-memory processes and complex statistics observed over extended time scales. Synaptic transmission dynamics impact on response variability in stimulation rates that are substantially lower compared to stimulation rates that drive excitability resources to fluctuate. Implications to network embedded neurons are discussed.

The signaling petri net-based simulator: a non-parametric strategy for characterizing the dynamics of cell-specific signaling networks.

PubMed

Ruths, Derek; Muller, Melissa; Tseng, Jen-Te; Nakhleh, Luay; Ram, Prahlad T

2008-02-29

Reconstructing cellular signaling networks and understanding how they work are major endeavors in cell biology. The scale and complexity of these networks, however, render their analysis using experimental biology approaches alone very challenging. As a result, computational methods have been developed and combined with experimental biology approaches, producing powerful tools for the analysis of these networks. These computational methods mostly fall on either end of a spectrum of model parameterization. On one end is a class of structural network analysis methods; these typically use the network connectivity alone to generate hypotheses about global properties. On the other end is a class of dynamic network analysis methods; these use, in addition to the connectivity, kinetic parameters of the biochemical reactions to predict the network's dynamic behavior. These predictions provide detailed insights into the properties that determine aspects of the network's structure and behavior. However, the difficulty of obtaining numerical values of kinetic parameters is widely recognized to limit the applicability of this latter class of methods. Several researchers have observed that the connectivity of a network alone can provide significant insights into its dynamics. Motivated by this fundamental observation, we present the signaling Petri net, a non-parametric model of cellular signaling networks, and the signaling Petri net-based simulator, a Petri net execution strategy for characterizing the dynamics of signal flow through a signaling network using token distribution and sampling. The result is a very fast method, which can analyze large-scale networks, and provide insights into the trends of molecules' activity-levels in response to an external stimulus, based solely on the network's connectivity. We have implemented the signaling Petri net-based simulator in the PathwayOracle toolkit, which is publicly available at http://bioinfo.cs.rice.edu/pathwayoracle. Using this method, we studied a MAPK1,2 and AKT signaling network downstream from EGFR in two breast tumor cell lines. We analyzed, both experimentally and computationally, the activity level of several molecules in response to a targeted manipulation of TSC2 and mTOR-Raptor. The results from our method agreed with experimental results in greater than 90% of the cases considered, and in those where they did not agree, our approach provided valuable insights into discrepancies between known network connectivities and experimental observations.

The Signaling Petri Net-Based Simulator: A Non-Parametric Strategy for Characterizing the Dynamics of Cell-Specific Signaling Networks

PubMed Central

Ruths, Derek; Muller, Melissa; Tseng, Jen-Te; Nakhleh, Luay; Ram, Prahlad T.

2008-01-01

Reconstructing cellular signaling networks and understanding how they work are major endeavors in cell biology. The scale and complexity of these networks, however, render their analysis using experimental biology approaches alone very challenging. As a result, computational methods have been developed and combined with experimental biology approaches, producing powerful tools for the analysis of these networks. These computational methods mostly fall on either end of a spectrum of model parameterization. On one end is a class of structural network analysis methods; these typically use the network connectivity alone to generate hypotheses about global properties. On the other end is a class of dynamic network analysis methods; these use, in addition to the connectivity, kinetic parameters of the biochemical reactions to predict the network's dynamic behavior. These predictions provide detailed insights into the properties that determine aspects of the network's structure and behavior. However, the difficulty of obtaining numerical values of kinetic parameters is widely recognized to limit the applicability of this latter class of methods. Several researchers have observed that the connectivity of a network alone can provide significant insights into its dynamics. Motivated by this fundamental observation, we present the signaling Petri net, a non-parametric model of cellular signaling networks, and the signaling Petri net-based simulator, a Petri net execution strategy for characterizing the dynamics of signal flow through a signaling network using token distribution and sampling. The result is a very fast method, which can analyze large-scale networks, and provide insights into the trends of molecules' activity-levels in response to an external stimulus, based solely on the network's connectivity. We have implemented the signaling Petri net-based simulator in the PathwayOracle toolkit, which is publicly available at http://bioinfo.cs.rice.edu/pathwayoracle. Using this method, we studied a MAPK1,2 and AKT signaling network downstream from EGFR in two breast tumor cell lines. We analyzed, both experimentally and computationally, the activity level of several molecules in response to a targeted manipulation of TSC2 and mTOR-Raptor. The results from our method agreed with experimental results in greater than 90% of the cases considered, and in those where they did not agree, our approach provided valuable insights into discrepancies between known network connectivities and experimental observations. PMID:18463702

Toward cost-efficient sampling methods

NASA Astrophysics Data System (ADS)

Luo, Peng; Li, Yongli; Wu, Chong; Zhang, Guijie

2015-09-01

The sampling method has been paid much attention in the field of complex network in general and statistical physics in particular. This paper proposes two new sampling methods based on the idea that a small part of vertices with high node degree could possess the most structure information of a complex network. The two proposed sampling methods are efficient in sampling high degree nodes so that they would be useful even if the sampling rate is low, which means cost-efficient. The first new sampling method is developed on the basis of the widely used stratified random sampling (SRS) method and the second one improves the famous snowball sampling (SBS) method. In order to demonstrate the validity and accuracy of two new sampling methods, we compare them with the existing sampling methods in three commonly used simulation networks that are scale-free network, random network, small-world network, and also in two real networks. The experimental results illustrate that the two proposed sampling methods perform much better than the existing sampling methods in terms of achieving the true network structure characteristics reflected by clustering coefficient, Bonacich centrality and average path length, especially when the sampling rate is low.

A study on efficient detection of network-based IP spoofing DDoS and malware-infected Systems.

PubMed

Seo, Jung Woo; Lee, Sang Jin

2016-01-01

Large-scale network environments require effective detection and response methods against DDoS attacks. Depending on the advancement of IT infrastructure such as the server or network equipment, DDoS attack traffic arising from a few malware-infected systems capable of crippling the organization's internal network has become a significant threat. This study calculates the frequency of network-based packet attributes and analyzes the anomalies of the attributes in order to detect IP-spoofed DDoS attacks. Also, a method is proposed for the effective detection of malware infection systems triggering IP-spoofed DDoS attacks on an edge network. Detection accuracy and performance of the collected real-time traffic on a core network is analyzed thru the use of the proposed algorithm, and a prototype was developed to evaluate the performance of the algorithm. As a result, DDoS attacks on the internal network were detected in real-time and whether or not IP addresses were spoofed was confirmed. Detecting hosts infected by malware in real-time allowed the execution of intrusion responses before stoppage of the internal network caused by large-scale attack traffic.

DistributedFBA.jl: High-level, high-performance flux balance analysis in Julia

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

Heirendt, Laurent; Thiele, Ines; Fleming, Ronan M. T.

Flux balance analysis and its variants are widely used methods for predicting steady-state reaction rates in biochemical reaction networks. The exploration of high dimensional networks with such methods is currently hampered by software performance limitations. DistributedFBA.jl is a high-level, high-performance, open-source implementation of flux balance analysis in Julia. It is tailored to solve multiple flux balance analyses on a subset or all the reactions of large and huge-scale networks, on any number of threads or nodes. DistributedFBA.jl is a high-level, high-performance, open-source implementation of flux balance analysis in Julia. It is tailored to solve multiple flux balance analyses on amore » subset or all the reactions of large and huge-scale networks, on any number of threads or nodes.« less

DistributedFBA.jl: High-level, high-performance flux balance analysis in Julia

DOE PAGES

Heirendt, Laurent; Thiele, Ines; Fleming, Ronan M. T.

2017-01-16

Flux balance analysis and its variants are widely used methods for predicting steady-state reaction rates in biochemical reaction networks. The exploration of high dimensional networks with such methods is currently hampered by software performance limitations. DistributedFBA.jl is a high-level, high-performance, open-source implementation of flux balance analysis in Julia. It is tailored to solve multiple flux balance analyses on a subset or all the reactions of large and huge-scale networks, on any number of threads or nodes. DistributedFBA.jl is a high-level, high-performance, open-source implementation of flux balance analysis in Julia. It is tailored to solve multiple flux balance analyses on amore » subset or all the reactions of large and huge-scale networks, on any number of threads or nodes.« less

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.

Effects of Medical Interventions on Gender Dysphoria and Body Image: A Follow-Up Study

PubMed Central

van de Grift, Tim C.; Elaut, Els; Cerwenka, Susanne C.; Cohen-Kettenis, Peggy T.; De Cuypere, Griet; Richter-Appelt, Hertha; Kreukels, Baudewijntje P.C.

2017-01-01

ABSTRACT Objective The aim of this study from the European Network for the Investigation of Gender Incongruence is to investigate the status of all individuals who had applied for gender confirming interventions from 2007 to 2009, irrespective of whether they received treatment. The current article describes the study protocol, the effect of medical treatment on gender dysphoria and body image, and the predictive value of (pre)treatment factors on posttreatment outcomes. Methods Data were collected on medical interventions, transition status, gender dysphoria (Utrecht Gender Dysphoria Scale), and body image (Body Image Scale for transsexuals). In total, 201 people participated in the study (37% of the original cohort). Results At follow-up, 29 participants (14%) did not receive medical interventions, 36 hormones only (18%), and 136 hormones and surgery (68%). Most transwomen had undergone genital surgery, and most transmen chest surgery. Overall, the levels of gender dysphoria and body dissatisfaction were significantly lower at follow-up compared with clinical entry. Satisfaction with therapy responsive and unresponsive body characteristics both improved. High dissatisfaction at admission and lower psychological functioning at follow-up were associated with persistent body dissatisfaction. Conclusions Hormone-based interventions and surgery were followed by improvements in body satisfaction. The level of psychological symptoms and the degree of body satisfaction at baseline were significantly associated with body satisfaction at follow-up. PMID:28319558

Network design and analysis for multi-enzyme biocatalysis.

PubMed

Blaß, Lisa Katharina; Weyler, Christian; Heinzle, Elmar

2017-08-10

As more and more biological reaction data become available, the full exploration of the enzymatic potential for the synthesis of valuable products opens up exciting new opportunities but is becoming increasingly complex. The manual design of multi-step biosynthesis routes involving enzymes from different organisms is very challenging. To harness the full enzymatic potential, we developed a computational tool for the directed design of biosynthetic production pathways for multi-step catalysis with in vitro enzyme cascades, cell hydrolysates and permeabilized cells. We present a method which encompasses the reconstruction of a genome-scale pan-organism metabolic network, path-finding and the ranking of the resulting pathway candidates for proposing suitable synthesis pathways. The network is based on reaction and reaction pair data from the Kyoto Encyclopedia of Genes and Genomes (KEGG) and the thermodynamics calculator eQuilibrator. The pan-organism network is especially useful for finding the most suitable pathway to a target metabolite from a thermodynamic or economic standpoint. However, our method can be used with any network reconstruction, e.g. for a specific organism. We implemented a path-finding algorithm based on a mixed-integer linear program (MILP) which takes into account both topology and stoichiometry of the underlying network. Unlike other methods we do not specify a single starting metabolite, but our algorithm searches for pathways starting from arbitrary start metabolites to a target product of interest. Using a set of biochemical ranking criteria including pathway length, thermodynamics and other biological characteristics such as number of heterologous enzymes or cofactor requirement, it is possible to obtain well-designed meaningful pathway alternatives. In addition, a thermodynamic profile, the overall reactant balance and potential side reactions as well as an SBML file for visualization are generated for each pathway alternative. We present an in silico tool for the design of multi-enzyme biosynthetic production pathways starting from a pan-organism network. The method is highly customizable and each module can be adapted to the focus of the project at hand. This method is directly applicable for (i) in vitro enzyme cascades, (ii) cell hydrolysates and (iii) permeabilized cells.

Who Should Join the Environmental Response Laboratory Network

EPA Pesticide Factsheets

Laboratories that analyze biological samples, chemical warfare agents, radiological, or toxic industrial chemical samples can join the ERLN. Members make up a critical infrastructure that delivers data necessary for responses to large scale emergencies.

Lessons Learnt from Applying Action Research to Support Strategy Formation Processes in Long-Term Care Networks

ERIC Educational Resources Information Center

Cramer, Hendrik; Dewulf, Geert; Voordijk, Hans

2015-01-01

This study demonstrates how action research (AR) that is aimed at scaling-up experiments can be applied to support a strategy formation process (SFP) in a subsidized long-term care network. Previous research has developed numerous AR frameworks to support experiments in various domains, but has failed to explain how to apply AR and action learning…

Fault detection on a sewer network by a combination of a Kalman filter and a binary sequential probability ratio test

NASA Astrophysics Data System (ADS)

Piatyszek, E.; Voignier, P.; Graillot, D.

2000-05-01

One of the aims of sewer networks is the protection of population against floods and the reduction of pollution rejected to the receiving water during rainy events. To meet these goals, managers have to equip the sewer networks with and to set up real-time control systems. Unfortunately, a component fault (leading to intolerable behaviour of the system) or sensor fault (deteriorating the process view and disturbing the local automatism) makes the sewer network supervision delicate. In order to ensure an adequate flow management during rainy events it is essential to set up procedures capable of detecting and diagnosing these anomalies. This article introduces a real-time fault detection method, applicable to sewer networks, for the follow-up of rainy events. This method consists in comparing the sensor response with a forecast of this response. This forecast is provided by a model and more precisely by a state estimator: a Kalman filter. This Kalman filter provides not only a flow estimate but also an entity called 'innovation'. In order to detect abnormal operations within the network, this innovation is analysed with the binary sequential probability ratio test of Wald. Moreover, by crossing available information on several nodes of the network, a diagnosis of the detected anomalies is carried out. This method provided encouraging results during the analysis of several rains, on the sewer network of Seine-Saint-Denis County, France.

The impact of different aperture distribution models and critical stress criteria on equivalent permeability in fractured rocks

NASA Astrophysics Data System (ADS)

Bisdom, Kevin; Bertotti, Giovanni; Nick, Hamidreza M.

2016-05-01

Predicting equivalent permeability in fractured reservoirs requires an understanding of the fracture network geometry and apertures. There are different methods for defining aperture, based on outcrop observations (power law scaling), fundamental mechanics (sublinear length-aperture scaling), and experiments (Barton-Bandis conductive shearing). Each method predicts heterogeneous apertures, even along single fractures (i.e., intrafracture variations), but most fractured reservoir models imply constant apertures for single fractures. We compare the relative differences in aperture and permeability predicted by three aperture methods, where permeability is modeled in explicit fracture networks with coupled fracture-matrix flow. Aperture varies along single fractures, and geomechanical relations are used to identify which fractures are critically stressed. The aperture models are applied to real-world large-scale fracture networks. (Sub)linear length scaling predicts the largest average aperture and equivalent permeability. Barton-Bandis aperture is smaller, predicting on average a sixfold increase compared to matrix permeability. Application of critical stress criteria results in a decrease in the fraction of open fractures. For the applied stress conditions, Coulomb predicts that 50% of the network is critically stressed, compared to 80% for Barton-Bandis peak shear. The impact of the fracture network on equivalent permeability depends on the matrix hydraulic properties, as in a low-permeable matrix, intrafracture connectivity, i.e., the opening along a single fracture, controls equivalent permeability, whereas for a more permeable matrix, absolute apertures have a larger impact. Quantification of fracture flow regimes using only the ratio of fracture versus matrix permeability is insufficient, as these regimes also depend on aperture variations within fractures.

Similarity from Multi-Dimensional Scaling: Solving the Accuracy and Diversity Dilemma in Information Filtering

PubMed Central

Zeng, Wei; Zeng, An; Liu, Hao; Shang, Ming-Sheng; Zhang, Yi-Cheng

2014-01-01

Recommender systems are designed to assist individual users to navigate through the rapidly growing amount of information. One of the most successful recommendation techniques is the collaborative filtering, which has been extensively investigated and has already found wide applications in e-commerce. One of challenges in this algorithm is how to accurately quantify the similarities of user pairs and item pairs. In this paper, we employ the multidimensional scaling (MDS) method to measure the similarities between nodes in user-item bipartite networks. The MDS method can extract the essential similarity information from the networks by smoothing out noise, which provides a graphical display of the structure of the networks. With the similarity measured from MDS, we find that the item-based collaborative filtering algorithm can outperform the diffusion-based recommendation algorithms. Moreover, we show that this method tends to recommend unpopular items and increase the global diversification of the networks in long term. PMID:25343243

Solving large scale traveling salesman problems by chaotic neurodynamics.

PubMed

Hasegawa, Mikio; Ikeguch, Tohru; Aihara, Kazuyuki

2002-03-01

We propose a novel approach for solving large scale traveling salesman problems (TSPs) by chaotic dynamics. First, we realize the tabu search on a neural network, by utilizing the refractory effects as the tabu effects. Then, we extend it to a chaotic neural network version. We propose two types of chaotic searching methods, which are based on two different tabu searches. While the first one requires neurons of the order of n2 for an n-city TSP, the second one requires only n neurons. Moreover, an automatic parameter tuning method of our chaotic neural network is presented for easy application to various problems. Last, we show that our method with n neurons is applicable to large TSPs such as an 85,900-city problem and exhibits better performance than the conventional stochastic searches and the tabu searches.

Self-Healing Networks: Redundancy and Structure

PubMed Central

Quattrociocchi, Walter; Caldarelli, Guido; Scala, Antonio

2014-01-01

We introduce the concept of self-healing in the field of complex networks modelling; in particular, self-healing capabilities are implemented through distributed communication protocols that exploit redundant links to recover the connectivity of the system. We then analyze the effect of the level of redundancy on the resilience to multiple failures; in particular, we measure the fraction of nodes still served for increasing levels of network damages. Finally, we study the effects of redundancy under different connectivity patterns—from planar grids, to small-world, up to scale-free networks—on healing performances. Small-world topologies show that introducing some long-range connections in planar grids greatly enhances the resilience to multiple failures with performances comparable to the case of the most resilient (and least realistic) scale-free structures. Obvious applications of self-healing are in the important field of infrastructural networks like gas, power, water, oil distribution systems. PMID:24533065

A method of reconstructing the spatial measurement network by mobile measurement transmitter for shipbuilding

NASA Astrophysics Data System (ADS)

Guo, Siyang; Lin, Jiarui; Yang, Linghui; Ren, Yongjie; Guo, Yin

2017-07-01

The workshop Measurement Position System (wMPS) is a distributed measurement system which is suitable for the large-scale metrology. However, there are some inevitable measurement problems in the shipbuilding industry, such as the restriction by obstacles and limited measurement range. To deal with these factors, this paper presents a method of reconstructing the spatial measurement network by mobile transmitter. A high-precision coordinate control network with more than six target points is established. The mobile measuring transmitter can be added into the measurement network using this coordinate control network with the spatial resection method. This method reconstructs the measurement network and broadens the measurement scope efficiently. To verify this method, two comparison experiments are designed with the laser tracker as the reference. The results demonstrate that the accuracy of point-to-point length is better than 0.4mm and the accuracy of coordinate measurement is better than 0.6mm.

Network science of biological systems at different scales: A review

NASA Astrophysics Data System (ADS)

Gosak, Marko; Markovič, Rene; Dolenšek, Jurij; Slak Rupnik, Marjan; Marhl, Marko; Stožer, Andraž; Perc, Matjaž

2018-03-01

Network science is today established as a backbone for description of structure and function of various physical, chemical, biological, technological, and social systems. Here we review recent advances in the study of complex biological systems that were inspired and enabled by methods of network science. First, we present

Communication Network Analysis Methods.

ERIC Educational Resources Information Center

Farace, Richard V.; Mabee, Timothy

This paper reviews a variety of analytic procedures that can be applied to network data, discussing the assumptions and usefulness of each procedure when applied to the complexity of human communication. Special attention is paid to the network properties measured or implied by each procedure. Factor analysis and multidimensional scaling are among…

Networked high-speed auroral observations combined with radar measurements for multi-scale insights

NASA Astrophysics Data System (ADS)

Hirsch, M.; Semeter, J. L.

2015-12-01

Networks of ground-based instruments to study terrestrial aurora for the purpose of analyzing particle precipitation characteristics driving the aurora have been established. Additional funding is pouring into future ground-based auroral observation networks consisting of combinations of tossable, portable, and fixed installation ground-based legacy equipment. Our approach to this problem using the High Speed Tomography (HiST) system combines tightly-synchronized filtered auroral optical observations capturing temporal features of order 10 ms with supporting measurements from incoherent scatter radar (ISR). ISR provides a broader spatial context up to order 100 km laterally on one minute time scales, while our camera field of view (FOV) is chosen to be order 10 km at auroral altitudes in order to capture 100 m scale lateral auroral features. The dual-scale observations of ISR and HiST fine-scale optical observations may be coupled through a physical model using linear basis functions to estimate important ionospheric quantities such as electron number density in 3-D (time, perpendicular and parallel to the geomagnetic field).Field measurements and analysis using HiST and PFISR are presented from experiments conducted at the Poker Flat Research Range in central Alaska. Other multiscale configuration candidates include supplementing networks of all-sky cameras such as THEMIS with co-locations of HiST-like instruments to fuse wide FOV measurements with the fine-scale HiST precipitation characteristic estimates. Candidate models for this coupling include GLOW and TRANSCAR. Future extensions of this work may include incorporating line of sight total electron count estimates from ground-based networks of GPS receivers in a sensor fusion problem.

Evolving bipartite authentication graph partitions

DOE PAGES

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

2017-01-16

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

Evolving bipartite authentication graph partitions

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

Pope, Aaron Scott; Tauritz, Daniel Remy; Kent, Alexander D.

As large scale enterprise computer networks become more ubiquitous, finding the appropriate balance between user convenience and user access control is an increasingly challenging proposition. Suboptimal partitioning of users’ access and available services contributes to the vulnerability of enterprise networks. Previous edge-cut partitioning methods unduly restrict users’ access to network resources. This paper introduces a novel method of network partitioning superior to the current state-of-the-art which minimizes user impact by providing alternate avenues for access that reduce vulnerability. Networks are modeled as bipartite authentication access graphs and a multi-objective evolutionary algorithm is used to simultaneously minimize the size of largemore » connected components while minimizing overall restrictions on network users. Lastly, results are presented on a real world data set that demonstrate the effectiveness of the introduced method compared to previous naive methods.« less

FCDECOMP: decomposition of metabolic networks based on flux coupling relations.

PubMed

Rezvan, Abolfazl; Marashi, Sayed-Amir; Eslahchi, Changiz

2014-10-01

A metabolic network model provides a computational framework to study the metabolism of a cell at the system level. Due to their large sizes and complexity, rational decomposition of these networks into subsystems is a strategy to obtain better insight into the metabolic functions. Additionally, decomposing metabolic networks paves the way to use computational methods that will be otherwise very slow when run on the original genome-scale network. In the present study, we propose FCDECOMP decomposition method based on flux coupling relations (FCRs) between pairs of reaction fluxes. This approach utilizes a genetic algorithm (GA) to obtain subsystems that can be analyzed in isolation, i.e. without considering the reactions of the original network in the analysis. Therefore, we propose that our method is useful for discovering biologically meaningful modules in metabolic networks. As a case study, we show that when this method is applied to the metabolic networks of barley seeds and yeast, the modules are in good agreement with the biological compartments of these networks.

Airplane detection based on fusion framework by combining saliency model with Deep Convolutional Neural Networks

NASA Astrophysics Data System (ADS)

Dou, Hao; Sun, Xiao; Li, Bin; Deng, Qianqian; Yang, Xubo; Liu, Di; Tian, Jinwen

2018-03-01

Aircraft detection from very high resolution remote sensing images, has gained more increasing interest in recent years due to the successful civil and military applications. However, several problems still exist: 1) how to extract the high-level features of aircraft; 2) locating objects within such a large image is difficult and time consuming; 3) A common problem of multiple resolutions of satellite images still exists. In this paper, inspirited by biological visual mechanism, the fusion detection framework is proposed, which fusing the top-down visual mechanism (deep CNN model) and bottom-up visual mechanism (GBVS) to detect aircraft. Besides, we use multi-scale training method for deep CNN model to solve the problem of multiple resolutions. Experimental results demonstrate that our method can achieve a better detection result than the other methods.

ATM encryption testing

NASA Astrophysics Data System (ADS)

Capell, Joyce; Deeth, David

1996-01-01

This paper describes why encryption was selected by Lockheed Martin Missiles & Space as the means for securing ATM networks. The ATM encryption testing program is part of an ATM network trial provided by Pacific Bell under the California Research Education Network (CalREN). The problem being addressed is the threat to data security which results when changing from a packet switched network infrastructure to a circuit switched ATM network backbone. As organizations move to high speed cell-based networks, there is a break down in the traditional security model which is designed to protect packet switched data networks from external attacks. This is due to the fact that most data security firewalls filter IP packets, restricting inbound and outbound protocols, e.g. ftp. ATM networks, based on cell-switching over virtual circuits, does not support this method for restricting access since the protocol information is not carried by each cell. ATM switches set up multiple virtual connections, thus there is no longer a single point of entry into the internal network. The problem is further complicated by the fact that ATM networks support high speed multi-media applications, including real time video and video teleconferencing which are incompatible with packet switched networks. The ability to restrict access to Lockheed Martin networks in support of both unclassified and classified communications is required before ATM network technology can be fully deployed. The Lockheed Martin CalREN ATM testbed provides the opportunity to test ATM encryption prototypes with actual applications to assess the viability of ATM encryption methodologies prior to installing large scale ATM networks. Two prototype ATM encryptors are being tested: (1) `MILKBUSH' a prototype encryptor developed by NSA for transmission of government classified data over ATM networks, and (2) a prototype ATM encryptor developed by Sandia National Labs in New Mexico, for the encryption of proprietary data.

A trust-based recommendation method using network diffusion processes

NASA Astrophysics Data System (ADS)

Chen, Ling-Jiao; Gao, Jian

2018-09-01

A variety of rating-based recommendation methods have been extensively studied including the well-known collaborative filtering approaches and some network diffusion-based methods, however, social trust relations are not sufficiently considered when making recommendations. In this paper, we contribute to the literature by proposing a trust-based recommendation method, named CosRA+T, after integrating the information of trust relations into the resource-redistribution process. Specifically, a tunable parameter is used to scale the resources received by trusted users before the redistribution back to the objects. Interestingly, we find an optimal scaling parameter for the proposed CosRA+T method to achieve its best recommendation accuracy, and the optimal value seems to be universal under several evaluation metrics across different datasets. Moreover, results of extensive experiments on the two real-world rating datasets with trust relations, Epinions and FriendFeed, suggest that CosRA+T has a remarkable improvement in overall accuracy, diversity and novelty. Our work takes a step towards designing better recommendation algorithms by employing multiple resources of social network information.

Social Network, Social Support, and Risk of Incident Stroke: The Atherosclerosis Risk in Communities Study

PubMed Central

Nagayoshi, Mako; Everson-Rose, Susan A.; Iso, Hiroyasu; Mosley, Thomas H.; Rose, Kathryn M.; Lutsey, Pamela L.

2014-01-01

Background and Purpose Having a small social network and lack of social support have been associated with incident coronary heart disease, however epidemiologic evidence for incident stroke is limited. We assessed the longitudinal association of a small social network and lack of social support with risk of incident stroke, and evaluated whether the association was partly mediated by vital exhaustion and inflammation. Methods The Atherosclerosis Risk in Communities (ARIC) Study measured social network and social support in 13,686 men and women (mean, 57±5.7 years, 56% female, 24% black; 76% white) without a history of stroke. Social network was assessed by the 10-item Lubben Social Network Scale, and social support by a 16-item Interpersonal Support Evaluation List-Short Form (ISEL-SF). Results Over a median follow-up of 18.6-years, 905 incident strokes occurred. Relative to participants with a large social network, those with a small social network had a higher risk of stroke [HR (95% CI): 1.44 (1.02–2.04)] after adjustment for demographics, socioeconomic variables and marital status, behavioral risk factors and major stroke risk factors. Vital exhaustion, but not inflammation, partly mediated the association between a small social network and incident stroke. Social support was unrelated to incident stroke. Conclusions In this sample of US community-dwelling men and women, having a small social network was associated with excess risk of incident stroke. As with other cardiovascular conditions, having a small social network may be associated with a modestly increased risk of incident stroke. PMID:25139878

Time-oriented hierarchical method for computation of principal components using subspace learning algorithm.

PubMed

Jankovic, Marko; Ogawa, Hidemitsu

2004-10-01

Principal Component Analysis (PCA) and Principal Subspace Analysis (PSA) are classic techniques in statistical data analysis, feature extraction and data compression. Given a set of multivariate measurements, PCA and PSA provide a smaller set of "basis vectors" with less redundancy, and a subspace spanned by them, respectively. Artificial neurons and neural networks have been shown to perform PSA and PCA when gradient ascent (descent) learning rules are used, which is related to the constrained maximization (minimization) of statistical objective functions. Due to their low complexity, such algorithms and their implementation in neural networks are potentially useful in cases of tracking slow changes of correlations in the input data or in updating eigenvectors with new samples. In this paper we propose PCA learning algorithm that is fully homogeneous with respect to neurons. The algorithm is obtained by modification of one of the most famous PSA learning algorithms--Subspace Learning Algorithm (SLA). Modification of the algorithm is based on Time-Oriented Hierarchical Method (TOHM). The method uses two distinct time scales. On a faster time scale PSA algorithm is responsible for the "behavior" of all output neurons. On a slower scale, output neurons will compete for fulfillment of their "own interests". On this scale, basis vectors in the principal subspace are rotated toward the principal eigenvectors. At the end of the paper it will be briefly analyzed how (or why) time-oriented hierarchical method can be used for transformation of any of the existing neural network PSA method, into PCA method.

Multi-tissue analysis of co-expression networks by higher-order generalized singular value decomposition identifies functionally coherent transcriptional modules.

PubMed

Xiao, Xiaolin; Moreno-Moral, Aida; Rotival, Maxime; Bottolo, Leonardo; Petretto, Enrico

2014-01-01

Recent high-throughput efforts such as ENCODE have generated a large body of genome-scale transcriptional data in multiple conditions (e.g., cell-types and disease states). Leveraging these data is especially important for network-based approaches to human disease, for instance to identify coherent transcriptional modules (subnetworks) that can inform functional disease mechanisms and pathological pathways. Yet, genome-scale network analysis across conditions is significantly hampered by the paucity of robust and computationally-efficient methods. Building on the Higher-Order Generalized Singular Value Decomposition, we introduce a new algorithmic approach for efficient, parameter-free and reproducible identification of network-modules simultaneously across multiple conditions. Our method can accommodate weighted (and unweighted) networks of any size and can similarly use co-expression or raw gene expression input data, without hinging upon the definition and stability of the correlation used to assess gene co-expression. In simulation studies, we demonstrated distinctive advantages of our method over existing methods, which was able to recover accurately both common and condition-specific network-modules without entailing ad-hoc input parameters as required by other approaches. We applied our method to genome-scale and multi-tissue transcriptomic datasets from rats (microarray-based) and humans (mRNA-sequencing-based) and identified several common and tissue-specific subnetworks with functional significance, which were not detected by other methods. In humans we recapitulated the crosstalk between cell-cycle progression and cell-extracellular matrix interactions processes in ventricular zones during neocortex expansion and further, we uncovered pathways related to development of later cognitive functions in the cortical plate of the developing brain which were previously unappreciated. Analyses of seven rat tissues identified a multi-tissue subnetwork of co-expressed heat shock protein (Hsp) and cardiomyopathy genes (Bag3, Cryab, Kras, Emd, Plec), which was significantly replicated using separate failing heart and liver gene expression datasets in humans, thus revealing a conserved functional role for Hsp genes in cardiovascular disease.

An integrated network of Arabidopsis growth regulators and its use for gene prioritization.

PubMed

Sabaghian, Ehsan; Drebert, Zuzanna; Inzé, Dirk; Saeys, Yvan

2015-12-01

Elucidating the molecular mechanisms that govern plant growth has been an important topic in plant research, and current advances in large-scale data generation call for computational tools that efficiently combine these different data sources to generate novel hypotheses. In this work, we present a novel, integrated network that combines multiple large-scale data sources to characterize growth regulatory genes in Arabidopsis, one of the main plant model organisms. The contributions of this work are twofold: first, we characterized a set of carefully selected growth regulators with respect to their connectivity patterns in the integrated network, and, subsequently, we explored to which extent these connectivity patterns can be used to suggest new growth regulators. Using a large-scale comparative study, we designed new supervised machine learning methods to prioritize growth regulators. Our results show that these methods significantly improve current state-of-the-art prioritization techniques, and are able to suggest meaningful new growth regulators. In addition, the integrated network is made available to the scientific community, providing a rich data source that will be useful for many biological processes, not necessarily restricted to plant growth.

Loosening the shackles of scientific disciplines with network science. Reply to comments on "Network science of biological systems at different scales: A review"

NASA Astrophysics Data System (ADS)

Gosak, Marko; Markovič, Rene; Dolenšek, Jurij; Rupnik, Marjan Slak; Marhl, Marko; Stožer, Andraž; Perc, Matjaž

2018-03-01

We would like to thank all the experts for their insightful and very interesting comments that have been submitted in response to our review "Network science of biological systems at different scales" [1]. We are delighted with the number of comments that have been written, and even more so with the positive opinions that these comments communicate to the wider audience [2-9]. Although methods of network science have long proven their value in relevantly addressing various challenges in the biological sciences, such interdisciplinary research often still struggles for funding and recognition at many academic levels.

Application of a flexible lattice Boltzmann method based simulation tool for modelling physico-chemical processes at different scales

NASA Astrophysics Data System (ADS)

Patel, Ravi A.; Perko, Janez; Jacques, Diederik

2017-04-01

Often, especially in the disciplines related to natural porous media, such as for example vadoze zone or aquifer hydrology or contaminant transport, the relevant spatial and temporal scales on which we need to provide information is larger than the scale where the processes actually occur. Usual techniques used to deal with these problems assume the existence of a REV. However, in order to understand the behavior on larger scales it is important to downscale the problem onto the relevant scale of the processes. Due to the limitations of resources (time, memory) the downscaling can only be made up to the certain lower scale. At this lower scale still several scales may co-exist - the scale which can be explicitly described and a scale which needs to be conceptualized by effective properties. Hence, models which are supposed to provide effective properties on relevant scales should therefor be flexible enough to represent complex pore-structure by explicit geometry on one side, and differently defined processes (e.g. by the effective properties) which emerge on lower scale. In this work we present the state-of-the-art lattice Boltzmann method based simulation tool applicable to advection-diffusion equation coupled to geochemical processes. The lattice Boltzmann transport solver can be coupled with an external geochemical solver which allows to account for a wide range of geochemical reaction networks through thermodynamic databases. The applicability to multiphase systems is ongoing. We provide several examples related to the calculation of an effective diffusion properties, permeability and effective reaction rate based on a continuum scale based on the pore scale geometry.

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

The role of social networks in the governance of health systems: the case of eye care systems in Ghana.

PubMed

Blanchet, Karl; James, Philip

2013-03-01

Efforts have been increasingly invested to improve local health systems' capacities in developing countries. We describe the application of innovative methods based on a social network analysis approach. The findings presented refer to a study carried out between July 2008 and January 2010 in the Brong Ahafo region of Ghana. Social network analysis methods were applied in five different districts using the software package Ucinet to calculate the various properties of the social network of eye care providers. The study focused on the managerial decisions made by Ghanaian district hospital managers about the governance of the health system. The study showed that the health system in the Brong Ahafo region experienced significant changes specifically after a key shock, the departure of an international organization. Several other actors at different levels of the network disappeared, the positions of nurses and hospital managers changed, creating new relationships and power balances that resulted in a change in the general structure of the network. The system shifted from a centralized and dense hierarchical network towards an enclaved network composed of five sub-networks. The new structure was less able to respond to shocks, circulate information and knowledge across scales and implement multi-scale solutions than that which it replaced. Although the network became less resilient, it responded better to the management needs of the hospital managers who now had better access to information, even if this information was partial. The change of the network over time also showed the influence of the international organization on generating links and creating connections between actors from different levels. The findings of the study reveal the importance of creating international health connections between actors working in different spatial scales of the health system.

Detecting communities in large networks

NASA Astrophysics Data System (ADS)

Capocci, A.; Servedio, V. D. P.; Caldarelli, G.; Colaiori, F.

2005-07-01

We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and link orientation. Since the method detects efficiently clustered nodes in large networks even when these are not sharply partitioned, it turns to be specially suitable for the analysis of social and information networks. We test the algorithm on a large-scale data-set from a psychological experiment of word association. In this case, it proves to be successful both in clustering words, and in uncovering mental association patterns.

Bioinspired principles for large-scale networked sensor systems: an overview.

PubMed

Jacobsen, Rune Hylsberg; Zhang, Qi; Toftegaard, Thomas Skjødeberg

2011-01-01

Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy.

Information loss method to measure node similarity in networks

NASA Astrophysics Data System (ADS)

Li, Yongli; Luo, Peng; Wu, Chong

2014-09-01

Similarity measurement for the network node has been paid increasing attention in the field of statistical physics. In this paper, we propose an entropy-based information loss method to measure the node similarity. The whole model is established based on this idea that less information loss is caused by seeing two more similar nodes as the same. The proposed new method has relatively low algorithm complexity, making it less time-consuming and more efficient to deal with the large scale real-world network. In order to clarify its availability and accuracy, this new approach was compared with some other selected approaches on two artificial examples and synthetic networks. Furthermore, the proposed method is also successfully applied to predict the network evolution and predict the unknown nodes' attributions in the two application examples.

Sampling from complex networks using distributed learning automata

NASA Astrophysics Data System (ADS)

Rezvanian, Alireza; Rahmati, Mohammad; Meybodi, Mohammad Reza

2014-02-01

A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly social networks. Recently, major studies are reported for the characterization of social networks due to a growing trend in analysis of online social networks as dynamic complex large-scale graphs. Due to the large scale and limited access of real networks, the network model is characterized using an appropriate part of a network by sampling approaches. In this paper, a new sampling algorithm based on distributed learning automata has been proposed for sampling from complex networks. In the proposed algorithm, a set of distributed learning automata cooperate with each other in order to take appropriate samples from the given network. To investigate the performance of the proposed algorithm, several simulation experiments are conducted on well-known complex networks. Experimental results are compared with several sampling methods in terms of different measures. The experimental results demonstrate the superiority of the proposed algorithm over the others.

Signal Sampling for Efficient Sparse Representation of Resting State FMRI Data

PubMed Central

Ge, Bao; Makkie, Milad; Wang, Jin; Zhao, Shijie; Jiang, Xi; Li, Xiang; Lv, Jinglei; Zhang, Shu; Zhang, Wei; Han, Junwei; Guo, Lei; Liu, Tianming

2015-01-01

As the size of brain imaging data such as fMRI grows explosively, it provides us with unprecedented and abundant information about the brain. How to reduce the size of fMRI data but not lose much information becomes a more and more pressing issue. Recent literature studies tried to deal with it by dictionary learning and sparse representation methods, however, their computation complexities are still high, which hampers the wider application of sparse representation method to large scale fMRI datasets. To effectively address this problem, this work proposes to represent resting state fMRI (rs-fMRI) signals of a whole brain via a statistical sampling based sparse representation. First we sampled the whole brain’s signals via different sampling methods, then the sampled signals were aggregate into an input data matrix to learn a dictionary, finally this dictionary was used to sparsely represent the whole brain’s signals and identify the resting state networks. Comparative experiments demonstrate that the proposed signal sampling framework can speed-up by ten times in reconstructing concurrent brain networks without losing much information. The experiments on the 1000 Functional Connectomes Project further demonstrate its effectiveness and superiority. PMID:26646924

A fully convolutional network for weed mapping of unmanned aerial vehicle (UAV) imagery.

PubMed

Huang, Huasheng; Deng, Jizhong; Lan, Yubin; Yang, Aqing; Deng, Xiaoling; Zhang, Lei

2018-01-01

Appropriate Site Specific Weed Management (SSWM) is crucial to ensure the crop yields. Within SSWM of large-scale area, remote sensing is a key technology to provide accurate weed distribution information. Compared with satellite and piloted aircraft remote sensing, unmanned aerial vehicle (UAV) is capable of capturing high spatial resolution imagery, which will provide more detailed information for weed mapping. The objective of this paper is to generate an accurate weed cover map based on UAV imagery. The UAV RGB imagery was collected in 2017 October over the rice field located in South China. The Fully Convolutional Network (FCN) method was proposed for weed mapping of the collected imagery. Transfer learning was used to improve generalization capability, and skip architecture was applied to increase the prediction accuracy. After that, the performance of FCN architecture was compared with Patch_based CNN algorithm and Pixel_based CNN method. Experimental results showed that our FCN method outperformed others, both in terms of accuracy and efficiency. The overall accuracy of the FCN approach was up to 0.935 and the accuracy for weed recognition was 0.883, which means that this algorithm is capable of generating accurate weed cover maps for the evaluated UAV imagery.

Locally excitatory, globally inhibitory oscillator networks: theory and application to scene segmentation

NASA Astrophysics Data System (ADS)

Wang, DeLiang; Terman, David

1995-01-01

A novel class of locally excitatory, globally inhibitory oscillator networks (LEGION) is proposed and investigated analytically and by computer simulation. The model of each oscillator corresponds to a standard relaxation oscillator with two time scales. The network exhibits a mechanism of selective gating, whereby an oscillator jumping up to its active phase rapidly recruits the oscillators stimulated by the same pattern, while preventing other oscillators from jumping up. We show analytically that with the selective gating mechanism the network rapidly achieves both synchronization within blocks of oscillators that are stimulated by connected regions and desynchronization between different blocks. Computer simulations demonstrate LEGION's promising ability for segmenting multiple input patterns in real time. This model lays a physical foundation for the oscillatory correlation theory of feature binding, and may provide an effective computational framework for scene segmentation and figure/ground segregation.

Data Imputation in Epistatic MAPs by Network-Guided Matrix Completion

PubMed Central

Žitnik, Marinka; Zupan, Blaž

2015-01-01

Abstract Epistatic miniarray profile (E-MAP) is a popular large-scale genetic interaction discovery platform. E-MAPs benefit from quantitative output, which makes it possible to detect subtle interactions with greater precision. However, due to the limits of biotechnology, E-MAP studies fail to measure genetic interactions for up to 40% of gene pairs in an assay. Missing measurements can be recovered by computational techniques for data imputation, in this way completing the interaction profiles and enabling downstream analysis algorithms that could otherwise be sensitive to missing data values. We introduce a new interaction data imputation method called network-guided matrix completion (NG-MC). The core part of NG-MC is low-rank probabilistic matrix completion that incorporates prior knowledge presented as a collection of gene networks. NG-MC assumes that interactions are transitive, such that latent gene interaction profiles inferred by NG-MC depend on the profiles of their direct neighbors in gene networks. As the NG-MC inference algorithm progresses, it propagates latent interaction profiles through each of the networks and updates gene network weights toward improved prediction. In a study with four different E-MAP data assays and considered protein–protein interaction and gene ontology similarity networks, NG-MC significantly surpassed existing alternative techniques. Inclusion of information from gene networks also allowed NG-MC to predict interactions for genes that were not included in original E-MAP assays, a task that could not be considered by current imputation approaches. PMID:25658751

Equipment characterization to mitigate risks during transfers of cell culture manufacturing processes.

PubMed

Sieblist, Christian; Jenzsch, Marco; Pohlscheidt, Michael

2016-08-01

The production of monoclonal antibodies by mammalian cell culture in bioreactors up to 25,000 L is state of the art technology in the biotech industry. During the lifecycle of a product, several scale up activities and technology transfers are typically executed to enable the supply chain strategy of a global pharmaceutical company. Given the sensitivity of mammalian cells to physicochemical culture conditions, process and equipment knowledge are critical to avoid impacts on timelines, product quantity and quality. Especially, the fluid dynamics of large scale bioreactors versus small scale models need to be described, and similarity demonstrated, in light of the Quality by Design approach promoted by the FDA. This approach comprises an associated design space which is established during process characterization and validation in bench scale bioreactors. Therefore the establishment of predictive models and simulation tools for major operating conditions of stirred vessels (mixing, mass transfer, and shear force.), based on fundamental engineering principles, have experienced a renaissance in the recent years. This work illustrates the systematic characterization of a large variety of bioreactor designs deployed in a global manufacturing network ranging from small bench scale equipment to large scale production equipment (25,000 L). Several traditional methods to determine power input, mixing, mass transfer and shear force have been used to create a data base and identify differences for various impeller types and configurations in operating ranges typically applied in cell culture processes at manufacturing scale. In addition, extrapolation of different empirical models, e.g. Cooke et al. (Paper presented at the proceedings of the 2nd international conference of bioreactor fluid dynamics, Cranfield, UK, 1988), have been assessed for their validity in these operational ranges. Results for selected designs are shown and serve as examples of structured characterization to enable fast and agile process transfers, scale up and troubleshooting.

'Scaling-up is a craft not a science': Catalysing scale-up of health innovations in Ethiopia, India and Nigeria.

PubMed

Spicer, Neil; Bhattacharya, Dipankar; Dimka, Ritgak; Fanta, Feleke; Mangham-Jefferies, Lindsay; Schellenberg, Joanna; Tamire-Woldemariam, Addis; Walt, Gill; Wickremasinghe, Deepthi

2014-11-01

Donors and other development partners commonly introduce innovative practices and technologies to improve health in low and middle income countries. Yet many innovations that are effective in improving health and survival are slow to be translated into policy and implemented at scale. Understanding the factors influencing scale-up is important. We conducted a qualitative study involving 150 semi-structured interviews with government, development partners, civil society organisations and externally funded implementers, professional associations and academic institutions in 2012/13 to explore scale-up of innovative interventions targeting mothers and newborns in Ethiopia, the Indian state of Uttar Pradesh and the six states of northeast Nigeria, which are settings with high burdens of maternal and neonatal mortality. Interviews were analysed using a common analytic framework developed for cross-country comparison and themes were coded using Nvivo. We found that programme implementers across the three settings require multiple steps to catalyse scale-up. Advocating for government to adopt and finance health innovations requires: designing scalable innovations; embedding scale-up in programme design and allocating time and resources; building implementer capacity to catalyse scale-up; adopting effective approaches to advocacy; presenting strong evidence to support government decision making; involving government in programme design; invoking policy champions and networks; strengthening harmonisation among external programmes; aligning innovations with health systems and priorities. Other steps include: supporting government to develop policies and programmes and strengthening health systems and staff; promoting community uptake by involving media, community leaders, mobilisation teams and role models. We conclude that scale-up has no magic bullet solution - implementers must embrace multiple activities, and require substantial support from donors and governments in doing so. Copyright © 2014 The Authors. Published by Elsevier Ltd.. All rights reserved.

The model of microblog message diffusion based on complex social network

NASA Astrophysics Data System (ADS)

Zhang, Wei; Bai, Shu-Ying; Jin, Rui

2014-05-01

Microblog is a micromessage communication network in which users are the nodes and the followship between users are the edges. Sina Weibo is a typical case of these microblog service websites. As the enormous scale of nodes and complex links in the network, we choose a sample network crawled in Sina Weibo as the base of empirical analysis. The study starts with the analysis of its topological features, and brings in epidemiological SEIR model to explore the mode of message spreading throughout the microblog network. It is found that the network is obvious small-world and scale-free, which made it succeed in transferring messages and failed in resisting negative influence. In addition, the paper focuses on the rich nodes as they constitute a typical feature of Sina Weibo. It is also found that whether the message starts with a rich node will not account for its final coverage. Actually, the rich nodes always play the role of pivotal intermediaries who speed up the spreading and make the message known by much more people.

Network-assisted target identification for haploinsufficiency and homozygous profiling screens

PubMed Central

Wang, Sheng

2017-01-01

Chemical genomic screens have recently emerged as a systematic approach to drug discovery on a genome-wide scale. Drug target identification and elucidation of the mechanism of action (MoA) of hits from these noisy high-throughput screens remain difficult. Here, we present GIT (Genetic Interaction Network-Assisted Target Identification), a network analysis method for drug target identification in haploinsufficiency profiling (HIP) and homozygous profiling (HOP) screens. With the drug-induced phenotypic fitness defect of the deletion of a gene, GIT also incorporates the fitness defects of the gene’s neighbors in the genetic interaction network. On three genome-scale yeast chemical genomic screens, GIT substantially outperforms previous scoring methods on target identification on HIP and HOP assays, respectively. Finally, we showed that by combining HIP and HOP assays, GIT further boosts target identification and reveals potential drug’s mechanism of action. PMID:28574983

Passenger flow analysis of Beijing urban rail transit network using fractal approach

NASA Astrophysics Data System (ADS)

Li, Xiaohong; Chen, Peiwen; Chen, Feng; Wang, Zijia

2018-04-01

To quantify the spatiotemporal distribution of passenger flow and the characteristics of an urban rail transit network, we introduce four radius fractal dimensions and two branch fractal dimensions by combining a fractal approach with passenger flow assignment model. These fractal dimensions can numerically describe the complexity of passenger flow in the urban rail transit network and its change characteristics. Based on it, we establish a fractal quantification method to measure the fractal characteristics of passenger follow in the rail transit network. Finally, we validate the reasonability of our proposed method by using the actual data of Beijing subway network. It has been shown that our proposed method can effectively measure the scale-free range of the urban rail transit network, network development and the fractal characteristics of time-varying passenger flow, which further provides a reference for network planning and analysis of passenger flow.

Scaling deep learning on GPU and knights landing clusters

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

You, Yang; Buluc, Aydin; Demmel, James

Training neural networks has become a big bottleneck. For example, training ImageNet dataset on one Nvidia K20 GPU needs 21 days. To speed up the training process, the current deep learning systems heavily rely on the hardware accelerators. However, these accelerators have limited on-chip memory compared with CPUs. We use both self-host Intel Knights Landing (KNL) clusters and multi-GPU clusters as our target platforms. From the algorithm aspect, we focus on Elastic Averaging SGD (EASGD) to design algorithms for HPC clusters. We redesign four efficient algorithms for HPC systems to improve EASGD's poor scaling on clusters. Async EASGD, Async MEASGD,more » and Hogwild EASGD are faster than existing counter-part methods (Async SGD, Async MSGD, and Hogwild SGD) in all comparisons. Sync EASGD achieves 5.3X speedup over original EASGD on the same platform. We achieve 91.5% weak scaling efficiency on 4253 KNL cores, which is higher than the state-of-the-art implementation.« less

Recent Developments in VSD Imaging of Small Neuronal Networks

ERIC Educational Resources Information Center

Hill, Evan S.; Bruno, Angela M.; Frost, William N.

2014-01-01

Voltage-sensitive dye (VSD) imaging is a powerful technique that can provide, in single experiments, a large-scale view of network activity unobtainable with traditional sharp electrode recording methods. Here we review recent work using VSDs to study small networks and highlight several results from this approach. Topics covered include circuit…

Challenges in coupling LTER with environmental assessments: An insight from potential and reality of the Chinese Ecological Research Network in servicing environment assessments.

PubMed

Xia, Shaoxia; Liu, Yu; Yu, Xiubo; Fu, Bojie

2018-08-15

Environmental assessments estimate, evaluate and predict the consequences of natural processes and human activities on the environment. Long-term ecosystem observation and research networks (LTERs) are potentially valuable infrastructure to support environmental assessments. However, very few environmental assessments have successfully incorporated them. In this study, we try to reveal the current status of coupling LTERs with environmental assessments and look at the challenges involved in improving this coupling through exploring the role that Chinese Ecological Research Network (CERN), the LTER of China, currently plays in regional environment assessments. A review of official protocols and standards, regional assessments and CERN researches related to ecosystems and environment shows that there is great potential for coupling CERN with environment assessments. However in practice, CERN does not currently play the expected role. Remote sensing and irregular inventory data are still the main data sources currently used in regional assessments. Several causes led to the present situation: (1) insufficient cross-site research and failure to scale up site-level variables to the regional scale; (2) data barriers resulting from incompatible protocols and low data usability due to lack of data assimilation and scaling; and (3) absence of indicators relevant to human activities in existing monitoring protocols. For these reasons, enhancing cross-site monitoring and research, data assimilation and scaling up are critical steps required to improve coupling of LTER with environmental assessments. Site-focused long-term monitoring should be combined with wide-scale ground surveys and remote sensing to establish an effective connection between different environmental monitoring platforms for regional assessments. It is also necessary to revise the current monitoring protocols to include human activities and their impacts on the ecosystem, or change the LTERs into Long-Term Socio-Ecological Research (LTSER) networks. Copyright © 2018 Elsevier B.V. All rights reserved.

Network topology analysis approach on China's QFII stock investment behavior

NASA Astrophysics Data System (ADS)

Zhang, Yongjie; Cao, Xing; He, Feng; Zhang, Wei

2017-05-01

In this paper, the investment behavior of QFII in China stock market from 2004 to 2015 is studied with the network topology method. Based on the nodes topological characteristics, stock holding fluctuations correlation is studied from the micro network level. We conclude that the QFII mutual stock holding network have both scale free and small world properties, which presented mainly small world characteristics from 2005 to 2011, and scale free characteristics from 2012 to 2015. Moreover, fluctuations correlation is different with different nodes topological characteristics. In different economic periods, QFII represented different connection patterns and they reacted to the market crash spontaneously. Thus, this paper provides the first evidence of complex network research on QFII' investment behavior in China as an emerging market.

Dirichlet Process Gaussian-mixture model: An application to localizing coalescing binary neutron stars with gravitational-wave observations

NASA Astrophysics Data System (ADS)

Del Pozzo, W.; Berry, C. P. L.; Ghosh, A.; Haines, T. S. F.; Singer, L. P.; Vecchio, A.

2018-06-01

We reconstruct posterior distributions for the position (sky area and distance) of a simulated set of binary neutron-star gravitational-waves signals observed with Advanced LIGO and Advanced Virgo. We use a Dirichlet Process Gaussian-mixture model, a fully Bayesian non-parametric method that can be used to estimate probability density functions with a flexible set of assumptions. The ability to reliably reconstruct the source position is important for multimessenger astronomy, as recently demonstrated with GW170817. We show that for detector networks comparable to the early operation of Advanced LIGO and Advanced Virgo, typical localization volumes are ˜104-105 Mpc3 corresponding to ˜102-103 potential host galaxies. The localization volume is a strong function of the network signal-to-noise ratio, scaling roughly ∝ϱnet-6. Fractional localizations improve with the addition of further detectors to the network. Our Dirichlet Process Gaussian-mixture model can be adopted for localizing events detected during future gravitational-wave observing runs, and used to facilitate prompt multimessenger follow-up.

A neural network approach to lung nodule segmentation

NASA Astrophysics Data System (ADS)

Hu, Yaoxiu; Menon, Prahlad G.

2016-03-01

Computed tomography (CT) imaging is a sensitive and specific lung cancer screening tool for the high-risk population and shown to be promising for detection of lung cancer. This study proposes an automatic methodology for detecting and segmenting lung nodules from CT images. The proposed methods begin with thorax segmentation, lung extraction and reconstruction of the original shape of the parenchyma using morphology operations. Next, a multi-scale hessian-based vesselness filter is applied to extract lung vasculature in lung. The lung vasculature mask is subtracted from the lung region segmentation mask to extract 3D regions representing candidate pulmonary nodules. Finally, the remaining structures are classified as nodules through shape and intensity features which are together used to train an artificial neural network. Up to 75% sensitivity and 98% specificity was achieved for detection of lung nodules in our testing dataset, with an overall accuracy of 97.62%+/-0.72% using 11 selected features as input to the neural network classifier, based on 4-fold cross-validation studies. Receiver operator characteristics for identifying nodules revealed an area under curve of 0.9476.

Comparisons of topological properties in autism for the brain network construction methods

NASA Astrophysics Data System (ADS)

Lee, Min-Hee; Kim, Dong Youn; Lee, Sang Hyeon; Kim, Jin Uk; Chung, Moo K.

2015-03-01

Structural brain networks can be constructed from the white matter fiber tractography of diffusion tensor imaging (DTI), and the structural characteristics of the brain can be analyzed from its networks. When brain networks are constructed by the parcellation method, their network structures change according to the parcellation scale selection and arbitrary thresholding. To overcome these issues, we modified the Ɛ -neighbor construction method proposed by Chung et al. (2011). The purpose of this study was to construct brain networks for 14 control subjects and 16 subjects with autism using both the parcellation and the Ɛ-neighbor construction method and to compare their topological properties between two methods. As the number of nodes increased, connectedness decreased in the parcellation method. However in the Ɛ-neighbor construction method, connectedness remained at a high level even with the rising number of nodes. In addition, statistical analysis for the parcellation method showed significant difference only in the path length. However, statistical analysis for the Ɛ-neighbor construction method showed significant difference with the path length, the degree and the density.

Testing Foundations of Biological Scaling Theory Using Automated Measurements of Vascular Networks

PubMed Central

Newberry, Mitchell G; Ennis, Daniel B; Savage, Van M

2015-01-01

Scientists have long sought to understand how vascular networks supply blood and oxygen to cells throughout the body. Recent work focuses on principles that constrain how vessel size changes through branching generations from the aorta to capillaries and uses scaling exponents to quantify these changes. Prominent scaling theories predict that combinations of these exponents explain how metabolic, growth, and other biological rates vary with body size. Nevertheless, direct measurements of individual vessel segments have been limited because existing techniques for measuring vasculature are invasive, time consuming, and technically difficult. We developed software that extracts the length, radius, and connectivity of in vivo vessels from contrast-enhanced 3D Magnetic Resonance Angiography. Using data from 20 human subjects, we calculated scaling exponents by four methods—two derived from local properties of branching junctions and two from whole-network properties. Although these methods are often used interchangeably in the literature, we do not find general agreement between these methods, particularly for vessel lengths. Measurements for length of vessels also diverge from theoretical values, but those for radius show stronger agreement. Our results demonstrate that vascular network models cannot ignore certain complexities of real vascular systems and indicate the need to discover new principles regarding vessel lengths. PMID:26317654

Estimating the Size of a Large Network and its Communities from a Random Sample

PubMed Central

Chen, Lin; Karbasi, Amin; Crawford, Forrest W.

2017-01-01

Most real-world networks are too large to be measured or studied directly and there is substantial interest in estimating global network properties from smaller sub-samples. One of the most important global properties is the number of vertices/nodes in the network. Estimating the number of vertices in a large network is a major challenge in computer science, epidemiology, demography, and intelligence analysis. In this paper we consider a population random graph G = (V, E) from the stochastic block model (SBM) with K communities/blocks. A sample is obtained by randomly choosing a subset W ⊆ V and letting G(W) be the induced subgraph in G of the vertices in W. In addition to G(W), we observe the total degree of each sampled vertex and its block membership. Given this partial information, we propose an efficient PopULation Size Estimation algorithm, called PULSE, that accurately estimates the size of the whole population as well as the size of each community. To support our theoretical analysis, we perform an exhaustive set of experiments to study the effects of sample size, K, and SBM model parameters on the accuracy of the estimates. The experimental results also demonstrate that PULSE significantly outperforms a widely-used method called the network scale-up estimator in a wide variety of scenarios. PMID:28867924

Estimating the Size of a Large Network and its Communities from a Random Sample.

PubMed

Chen, Lin; Karbasi, Amin; Crawford, Forrest W

2016-01-01

Most real-world networks are too large to be measured or studied directly and there is substantial interest in estimating global network properties from smaller sub-samples. One of the most important global properties is the number of vertices/nodes in the network. Estimating the number of vertices in a large network is a major challenge in computer science, epidemiology, demography, and intelligence analysis. In this paper we consider a population random graph G = ( V, E ) from the stochastic block model (SBM) with K communities/blocks. A sample is obtained by randomly choosing a subset W ⊆ V and letting G ( W ) be the induced subgraph in G of the vertices in W . In addition to G ( W ), we observe the total degree of each sampled vertex and its block membership. Given this partial information, we propose an efficient PopULation Size Estimation algorithm, called PULSE, that accurately estimates the size of the whole population as well as the size of each community. To support our theoretical analysis, we perform an exhaustive set of experiments to study the effects of sample size, K , and SBM model parameters on the accuracy of the estimates. The experimental results also demonstrate that PULSE significantly outperforms a widely-used method called the network scale-up estimator in a wide variety of scenarios.

Reduced linear noise approximation for biochemical reaction networks with time-scale separation: The stochastic tQSSA+

NASA Astrophysics Data System (ADS)

Herath, Narmada; Del Vecchio, Domitilla

2018-03-01

Biochemical reaction networks often involve reactions that take place on different time scales, giving rise to "slow" and "fast" system variables. This property is widely used in the analysis of systems to obtain dynamical models with reduced dimensions. In this paper, we consider stochastic dynamics of biochemical reaction networks modeled using the Linear Noise Approximation (LNA). Under time-scale separation conditions, we obtain a reduced-order LNA that approximates both the slow and fast variables in the system. We mathematically prove that the first and second moments of this reduced-order model converge to those of the full system as the time-scale separation becomes large. These mathematical results, in particular, provide a rigorous justification to the accuracy of LNA models derived using the stochastic total quasi-steady state approximation (tQSSA). Since, in contrast to the stochastic tQSSA, our reduced-order model also provides approximations for the fast variable stochastic properties, we term our method the "stochastic tQSSA+". Finally, we demonstrate the application of our approach on two biochemical network motifs found in gene-regulatory and signal transduction networks.

NetMiner-an ensemble pipeline for building genome-wide and high-quality gene co-expression network using massive-scale RNA-seq samples.

PubMed

Yu, Hua; Jiao, Bingke; Lu, Lu; Wang, Pengfei; Chen, Shuangcheng; Liang, Chengzhi; Liu, Wei

2018-01-01

Accurately reconstructing gene co-expression network is of great importance for uncovering the genetic architecture underlying complex and various phenotypes. The recent availability of high-throughput RNA-seq sequencing has made genome-wide detecting and quantifying of the novel, rare and low-abundance transcripts practical. However, its potential merits in reconstructing gene co-expression network have still not been well explored. Using massive-scale RNA-seq samples, we have designed an ensemble pipeline, called NetMiner, for building genome-scale and high-quality Gene Co-expression Network (GCN) by integrating three frequently used inference algorithms. We constructed a RNA-seq-based GCN in one species of monocot rice. The quality of network obtained by our method was verified and evaluated by the curated gene functional association data sets, which obviously outperformed each single method. In addition, the powerful capability of network for associating genes with functions and agronomic traits was shown by enrichment analysis and case studies. In particular, we demonstrated the potential value of our proposed method to predict the biological roles of unknown protein-coding genes, long non-coding RNA (lncRNA) genes and circular RNA (circRNA) genes. Our results provided a valuable and highly reliable data source to select key candidate genes for subsequent experimental validation. To facilitate identification of novel genes regulating important biological processes and phenotypes in other plants or animals, we have published the source code of NetMiner, making it freely available at https://github.com/czllab/NetMiner.

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.

Scaling up strategies of the chronic respiratory disease programme of the European Innovation Partnership on Active and Healthy Ageing (Action Plan B3: Area 5).

PubMed

Bousquet, J; Farrell, J; Crooks, G; Hellings, P; Bel, E H; Bewick, M; Chavannes, N H; de Sousa, J Correia; Cruz, A A; Haahtela, T; Joos, G; Khaltaev, N; Malva, J; Muraro, A; Nogues, M; Palkonen, S; Pedersen, S; Robalo-Cordeiro, C; Samolinski, B; Strandberg, T; Valiulis, A; Yorgancioglu, A; Zuberbier, T; Bedbrook, A; Aberer, W; Adachi, M; Agusti, A; Akdis, C A; Akdis, M; Ankri, J; Alonso, A; Annesi-Maesano, I; Ansotegui, I J; Anto, J M; Arnavielhe, S; Arshad, H; Bai, C; Baiardini, I; Bachert, C; Baigenzhin, A K; Barbara, C; Bateman, E D; Beghé, B; Kheder, A Ben; Bennoor, K S; Benson, M; Bergmann, K C; Bieber, T; Bindslev-Jensen, C; Bjermer, L; Blain, H; Blasi, F; Boner, A L; Bonini, M; Bonini, S; Bosnic-Anticevitch, S; Boulet, L P; Bourret, R; Bousquet, P J; Braido, F; Briggs, A H; Brightling, C E; Brozek, J; Buhl, R; Burney, P G; Bush, A; Caballero-Fonseca, F; Caimmi, D; Calderon, M A; Calverley, P M; Camargos, P A M; Canonica, G W; Camuzat, T; Carlsen, K H; Carr, W; Carriazo, A; Casale, T; Cepeda Sarabia, A M; Chatzi, L; Chen, Y Z; Chiron, R; Chkhartishvili, E; Chuchalin, A G; Chung, K F; Ciprandi, G; Cirule, I; Cox, L; Costa, D J; Custovic, A; Dahl, R; Dahlen, S E; Darsow, U; De Carlo, G; De Blay, F; Dedeu, T; Deleanu, D; De Manuel Keenoy, E; Demoly, P; Denburg, J A; Devillier, P; Didier, A; Dinh-Xuan, A T; Djukanovic, R; Dokic, D; Douagui, H; Dray, G; Dubakiene, R; Durham, S R; Dykewicz, M S; El-Gamal, Y; Emuzyte, R; Fabbri, L M; Fletcher, M; Fiocchi, A; Fink Wagner, A; Fonseca, J; Fokkens, W J; Forastiere, F; Frith, P; Gaga, M; Gamkrelidze, A; Garces, J; Garcia-Aymerich, J; Gemicioğlu, B; Gereda, J E; González Diaz, S; Gotua, M; Grisle, I; Grouse, L; Gutter, Z; Guzmán, M A; Heaney, L G; Hellquist-Dahl, B; Henderson, D; Hendry, A; Heinrich, J; Heve, D; Horak, F; Hourihane, J O' B; Howarth, P; Humbert, M; Hyland, M E; Illario, M; Ivancevich, J C; Jardim, J R; Jares, E J; Jeandel, C; Jenkins, C; Johnston, S L; Jonquet, O; Julge, K; Jung, K S; Just, J; Kaidashev, I; Kaitov, M R; Kalayci, O; Kalyoncu, A F; Keil, T; Keith, P K; Klimek, L; Koffi N'Goran, B; Kolek, V; Koppelman, G H; Kowalski, M L; Kull, I; Kuna, P; Kvedariene, V; Lambrecht, B; Lau, S; Larenas-Linnemann, D; Laune, D; Le, L T T; Lieberman, P; Lipworth, B; Li, J; Lodrup Carlsen, K; Louis, R; MacNee, W; Magard, Y; Magnan, A; Mahboub, B; Mair, A; Majer, I; Makela, M J; Manning, P; Mara, S; Marshall, G D; Masjedi, M R; Matignon, P; Maurer, M; Mavale-Manuel, S; Melén, E; Melo-Gomes, E; Meltzer, E O; Menzies-Gow, A; Merk, H; Michel, J P; Miculinic, N; Mihaltan, F; Milenkovic, B; Mohammad, G M Y; Molimard, M; Momas, I; Montilla-Santana, A; Morais-Almeida, M; Morgan, M; Mösges, R; Mullol, J; Nafti, S; Namazova-Baranova, L; Naclerio, R; Neou, A; Neffen, H; Nekam, K; Niggemann, B; Ninot, G; Nyembue, T D; O'Hehir, R E; Ohta, K; Okamoto, Y; Okubo, K; Ouedraogo, S; Paggiaro, P; Pali-Schöll, I; Panzner, P; Papadopoulos, N; Papi, A; Park, H S; Passalacqua, G; Pavord, I; Pawankar, R; Pengelly, R; Pfaar, O; Picard, R; Pigearias, B; Pin, I; Plavec, D; Poethig, D; Pohl, W; Popov, T A; Portejoie, F; Potter, P; Postma, D; Price, D; Rabe, K F; Raciborski, F; Radier Pontal, F; Repka-Ramirez, S; Reitamo, S; Rennard, S; Rodenas, F; Roberts, J; Roca, J; Rodriguez Mañas, L; Rolland, C; Roman Rodriguez, M; Romano, A; Rosado-Pinto, J; Rosario, N; Rosenwasser, L; Rottem, M; Ryan, D; Sanchez-Borges, M; Scadding, G K; Schunemann, H J; Serrano, E; Schmid-Grendelmeier, P; Schulz, H; Sheikh, A; Shields, M; Siafakas, N; Sibille, Y; Similowski, T; Simons, F E R; Sisul, J C; Skrindo, I; Smit, H A; Solé, D; Sooronbaev, T; Spranger, O; Stelmach, R; Sterk, P J; Sunyer, J; Thijs, C; To, T; Todo-Bom, A; Triggiani, M; Valenta, R; Valero, A L; Valia, E; Valovirta, E; Van Ganse, E; van Hage, M; Vandenplas, O; Vasankari, T; Vellas, B; Vestbo, J; Vezzani, G; Vichyanond, P; Viegi, G; Vogelmeier, C; Vontetsianos, T; Wagenmann, M; Wallaert, B; Walker, S; Wang, D Y; Wahn, U; Wickman, M; Williams, D M; Williams, S; Wright, J; Yawn, B P; Yiallouros, P K; Yusuf, O M; Zaidi, A; Zar, H J; Zernotti, M E; Zhang, L; Zhong, N; Zidarn, M; Mercier, J

2016-01-01

Action Plan B3 of the European Innovation Partnership on Active and Healthy Ageing (EIP on AHA) focuses on the integrated care of chronic diseases. Area 5 (Care Pathways) was initiated using chronic respiratory diseases as a model. The chronic respiratory disease action plan includes (1) AIRWAYS integrated care pathways (ICPs), (2) the joint initiative between the Reference site MACVIA-LR (Contre les MAladies Chroniques pour un VIeillissement Actif) and ARIA (Allergic Rhinitis and its Impact on Asthma), (3) Commitments for Action to the European Innovation Partnership on Active and Healthy Ageing and the AIRWAYS ICPs network. It is deployed in collaboration with the World Health Organization Global Alliance against Chronic Respiratory Diseases (GARD). The European Innovation Partnership on Active and Healthy Ageing has proposed a 5-step framework for developing an individual scaling up strategy: (1) what to scale up: (1-a) databases of good practices, (1-b) assessment of viability of the scaling up of good practices, (1-c) classification of good practices for local replication and (2) how to scale up: (2-a) facilitating partnerships for scaling up, (2-b) implementation of key success factors and lessons learnt, including emerging technologies for individualised and predictive medicine. This strategy has already been applied to the chronic respiratory disease action plan of the European Innovation Partnership on Active and Healthy Ageing.

Multiple network alignment via multiMAGNA+.

PubMed

Vijayan, Vipin; Milenkovic, Tijana

2017-08-21

Network alignment (NA) aims to find a node mapping that identifies topologically or functionally similar network regions between molecular networks of different species. Analogous to genomic sequence alignment, NA can be used to transfer biological knowledge from well- to poorly-studied species between aligned network regions. Pairwise NA (PNA) finds similar regions between two networks while multiple NA (MNA) can align more than two networks. We focus on MNA. Existing MNA methods aim to maximize total similarity over all aligned nodes (node conservation). Then, they evaluate alignment quality by measuring the amount of conserved edges, but only after the alignment is constructed. Directly optimizing edge conservation during alignment construction in addition to node conservation may result in superior alignments. Thus, we present a novel MNA method called multiMAGNA++ that can achieve this. Indeed, multiMAGNA++ outperforms or is on par with existing MNA methods, while often completing faster than existing methods. That is, multiMAGNA++ scales well to larger network data and can be parallelized effectively. During method evaluation, we also introduce new MNA quality measures to allow for more fair MNA method comparison compared to the existing alignment quality measures. MultiMAGNA++ code is available on the method's web page at http://nd.edu/~cone/multiMAGNA++/.

Estimating standard errors in feature network models.

PubMed

Frank, Laurence E; Heiser, Willem J

2007-05-01

Feature network models are graphical structures that represent proximity data in a discrete space while using the same formalism that is the basis of least squares methods employed in multidimensional scaling. Existing methods to derive a network model from empirical data only give the best-fitting network and yield no standard errors for the parameter estimates. The additivity properties of networks make it possible to consider the model as a univariate (multiple) linear regression problem with positivity restrictions on the parameters. In the present study, both theoretical and empirical standard errors are obtained for the constrained regression parameters of a network model with known features. The performance of both types of standard error is evaluated using Monte Carlo techniques.

A study of the temporal robustness of the growing global container-shipping network

PubMed Central

Wang, Nuo; Wu, Nuan; Dong, Ling-ling; Yan, Hua-kun; Wu, Di

2016-01-01

Whether they thrive as they grow must be determined for all constantly expanding networks. However, few studies have focused on this important network feature or the development of quantitative analytical methods. Given the formation and growth of the global container-shipping network, we proposed the concept of network temporal robustness and quantitative method. As an example, we collected container liner companies’ data at two time points (2004 and 2014) and built a shipping network with ports as nodes and routes as links. We thus obtained a quantitative value of the temporal robustness. The temporal robustness is a significant network property because, for the first time, we can clearly recognize that the shipping network has become more vulnerable to damage over the last decade: When the node failure scale reached 50% of the entire network, the temporal robustness was approximately −0.51% for random errors and −12.63% for intentional attacks. The proposed concept and analytical method described in this paper are significant for other network studies. PMID:27713549

Construction of large scale switch matrix by interconnecting integrated optical switch chips with EDFAs

NASA Astrophysics Data System (ADS)

Liao, Mingle; Wu, Baojian; Hou, Jianhong; Qiu, Kun

2018-03-01

Large scale optical switches are essential components in optical communication network. We aim to build up a large scale optical switch matrix by the interconnection of silicon-based optical switch chips using 3-stage CLOS structure, where EDFAs are needed to compensate for the insertion loss of the chips. The optical signal-to-noise ratio (OSNR) performance of the resulting large scale optical switch matrix is investigated for TE-mode light and the experimental results are in agreement with the theoretical analysis. We build up a 64 ×64 switch matrix by use of 16 ×16 optical switch chips and the OSNR and receiver sensibility can respectively be improved by 0.6 dB and 0.2 dB by optimizing the gain configuration of the EDFAs.

Mathematical defense method of networked servers with controlled remote backups

NASA Astrophysics Data System (ADS)

Kim, Song-Kyoo

2006-05-01

The networked server defense model is focused on reliability and availability in security respects. The (remote) backup servers are hooked up by VPN (Virtual Private Network) with high-speed optical network and replace broken main severs immediately. The networked server can be represent as "machines" and then the system deals with main unreliable, spare, and auxiliary spare machine. During vacation periods, when the system performs a mandatory routine maintenance, auxiliary machines are being used for back-ups; the information on the system is naturally delayed. Analog of the N-policy to restrict the usage of auxiliary machines to some reasonable quantity. The results are demonstrated in the network architecture by using the stochastic optimization techniques.

Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Wang, Yi; Dong, Liang; Liang, Taotao; Yang, Xinyu; Zhang, Deyun

Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.

A stream temperature model for the Peace-Athabasca River basin

NASA Astrophysics Data System (ADS)

Morales-Marin, L. A.; Rokaya, P.; Wheater, H. S.; Lindenschmidt, K. E.

2017-12-01

Water temperature plays a fundamental role in water ecosystem functioning. Because it regulates flow energy and metabolic rates in organism productivity over a broad spectrum of space and time scales, water temperature constitutes an important indicator of aquatic ecosystems health. In cold region basins, stream water temperature modelling is also fundamental to predict ice freeze-up and break-up events in order to improve flood management. Multiple model approaches such as linear and multivariable regression methods, neural network and thermal energy budged models have been developed and implemented to simulate stream water temperature. Most of these models have been applied to specific stream reaches and trained using observed data, but very little has been done to simulate water temperature in large catchment river networks. We present the coupling of RBM model, a semi-Lagrangian water temperature model for advection-dominated river system, and MESH, a semi-distributed hydrological model, to simulate stream water temperature in river catchments. The coupled models are implemented in the Peace-Athabasca River basin in order to analyze the variation in stream temperature regimes under changing hydrological and meteorological conditions. Uncertainty of stream temperature simulations is also assessed in order to determine the degree of reliability of the estimates.

Quantifying Stream-Aquifer Exchanges Over Scales: the Concept of Nested Interfaces

NASA Astrophysics Data System (ADS)

Flipo, N.; Mouhri, A.; Labarthe, B.; Saleh, F. S.

2013-12-01

Recent developments in hydrological modelling are based on a view of the interface being a single continuum through which water flows. These coupled hydrological-hydrogeological models, emphasizing the importance of the stream-aquifer interface (SAI), are more and more used in hydrological sciences for pluri-disciplinary studies aiming at questioning environmental issues. This notion of a single continuum comes from the historical modelling of hydrosystems based on the hypothesis of a homogeneous media that led to the Darcy law. Nowadays, there is a need to first bridge the gap between hydrological and eco-hydrological views of the SAIs, and, second, to rationalize the modelling of SAI within a consistent framework that fully takes into account the multi-dimensionality of the SAIs. We first define the concept of nested SAIs as a key transitional component of continental hydrosystem. We then demonstrate the usefulness of the concept for the multi-dimensional study of the SAI, with a special emphasis on the stream network which is identified as the key component for scaling hydrological processes occurring at the interface. Finally we focus on SAI modelling at various scales with up-to-date methodologies and give some guidance for the multi-dimensional modelling of the interface using the innovative methodology MIM (Measurements-Interpolation-Modelling), which is graphically developed. MIM scales in space three pools of methods needed to fully understand SAIs. The outcome of MIM is the localization in space of the type of SAI that can be studied by a given approach. The efficiency of the method is illustrated from the local (approx. 1m) to the regional scale (> 10 000 km2) with two examples from the Paris basin (France). The first one consists in the implementation of a sampling system of stream-aquifer exchanges, which is coupled with local 2D thermo-hydro models and a pseudo 3D hydro(geo)logical model at the watershed scale (40 km2). The quantification of monthly stream-aquifer exchanges over 14 000 km of river network in the Paris basin (74 000 km2) corresponds to a unique regional scale example.

deepNF: Deep network fusion for protein function prediction.

PubMed

Gligorijevic, Vladimir; Barot, Meet; Bonneau, Richard

2018-06-01

The prevalence of high-throughput experimental methods has resulted in an abundance of large-scale molecular and functional interaction networks. The connectivity of these networks provides a rich source of information for inferring functional annotations for genes and proteins. An important challenge has been to develop methods for combining these heterogeneous networks to extract useful protein feature representations for function prediction. Most of the existing approaches for network integration use shallow models that encounter difficulty in capturing complex and highly-nonlinear network structures. Thus, we propose deepNF, a network fusion method based on Multimodal Deep Autoencoders to extract high-level features of proteins from multiple heterogeneous interaction networks. We apply this method to combine STRING networks to construct a common low-dimensional representation containing high-level protein features. We use separate layers for different network types in the early stages of the multimodal autoencoder, later connecting all the layers into a single bottleneck layer from which we extract features to predict protein function. We compare the cross-validation and temporal holdout predictive performance of our method with state-of-the-art methods, including the recently proposed method Mashup. Our results show that our method outperforms previous methods for both human and yeast STRING networks. We also show substantial improvement in the performance of our method in predicting GO terms of varying type and specificity. deepNF is freely available at: https://github.com/VGligorijevic/deepNF. vgligorijevic@flatironinstitute.org, rb133@nyu.edu. Supplementary data are available at Bioinformatics online.

Topology of the conceptual network of language

NASA Astrophysics Data System (ADS)

Motter, Adilson E.; de Moura, Alessandro P.; Lai, Ying-Cheng; Dasgupta, Partha

2002-06-01

We define two words in a language to be connected if they express similar concepts. The network of connections among the many thousands of words that make up a language is important not only for the study of the structure and evolution of languages, but also for cognitive science. We study this issue quantitatively, by mapping out the conceptual network of the English language, with the connections being defined by the entries in a Thesaurus dictionary. We find that this network presents a small-world structure, with an amazingly small average shortest path, and appears to exhibit an asymptotic scale-free feature with algebraic connectivity distribution.

Networking: the view from HEP

NASA Astrophysics Data System (ADS)

McKee, Shawn

2017-10-01

Networks have played a critical role in high-energy physics (HEP), enabling us to access and effectively utilize globally distributed resources to meet the needs of our physicists. National and global-scale collaborations that characterize HEP would not be feasible without ubiquitous capable networks. Because of their importance in enabling our grid computing infrastructure many physicists have taken leading roles in research and education (R&E) networking, participating in, and even convening, network related meetings and research programs with the broader networking community worldwide. This has led to HEP benefiting from excellent global networking capabilities for little to no direct cost. However, as other science domains ramp-up their need for similar networking it becomes less clear that this situation will continue unchanged. This paper will briefly discuss the history of networking in HEP, the current activities and challenges we are facing, and try to provide some understanding of where networking may be going in the next 5 to 10 years.

Tabu Search enhances network robustness under targeted attacks

NASA Astrophysics Data System (ADS)

Sun, Shi-wen; Ma, Yi-lin; Li, Rui-qi; Wang, Li; Xia, Cheng-yi

2016-03-01

We focus on the optimization of network robustness with respect to intentional attacks on high-degree nodes. Given an existing network, this problem can be considered as a typical single-objective combinatorial optimization problem. Based on the heuristic Tabu Search optimization algorithm, a link-rewiring method is applied to reconstruct the network while keeping the degree of every node unchanged. Through numerical simulations, BA scale-free network and two real-world networks are investigated to verify the effectiveness of the proposed optimization method. Meanwhile, we analyze how the optimization affects other topological properties of the networks, including natural connectivity, clustering coefficient and degree-degree correlation. The current results can help to improve the robustness of existing complex real-world systems, as well as to provide some insights into the design of robust networks.

Effective Solar Indices for Ionospheric Modeling: A Review and a Proposal for a Real-Time Regional IRI

NASA Astrophysics Data System (ADS)

Pignalberi, A.; Pezzopane, M.; Rizzi, R.; Galkin, I.

2018-01-01

The first part of this paper reviews methods using effective solar indices to update a background ionospheric model focusing on those employing the Kriging method to perform the spatial interpolation. Then, it proposes a method to update the International Reference Ionosphere (IRI) model through the assimilation of data collected by a European ionosonde network. The method, called International Reference Ionosphere UPdate (IRI UP), that can potentially operate in real time, is mathematically described and validated for the period 9-25 March 2015 (a time window including the well-known St. Patrick storm occurred on 17 March), using IRI and IRI Real Time Assimilative Model (IRTAM) models as the reference. It relies on foF2 and M(3000)F2 ionospheric characteristics, recorded routinely by a network of 12 European ionosonde stations, which are used to calculate for each station effective values of IRI indices IG_{12} and R_{12} (identified as IG_{{12{eff}}} and R_{{12{eff}}}); then, starting from this discrete dataset of values, two-dimensional (2D) maps of IG_{{12{eff}}} and R_{{12{eff}}} are generated through the universal Kriging method. Five variogram models are proposed and tested statistically to select the best performer for each effective index. Then, computed maps of IG_{{12{eff}}} and R_{{12{eff}}} are used in the IRI model to synthesize updated values of foF2 and hmF2. To evaluate the ability of the proposed method to reproduce rapid local changes that are common under disturbed conditions, quality metrics are calculated for two test stations whose measurements were not assimilated in IRI UP, Fairford (51.7°N, 1.5°W) and San Vito (40.6°N, 17.8°E), for IRI, IRI UP, and IRTAM models. The proposed method turns out to be very effective under highly disturbed conditions, with significant improvements of the foF2 representation and noticeable improvements of the hmF2 one. Important improvements have been verified also for quiet and moderately disturbed conditions. A visual analysis of foF2 and hmF2 maps highlights the ability of the IRI UP method to catch small-scale changes occurring under disturbed conditions which are not seen by IRI.

The Conundrum of Functional Brain Networks: Small-World Efficiency or Fractal Modularity

PubMed Central

Gallos, Lazaros K.; Sigman, Mariano; Makse, Hernán A.

2012-01-01

The human brain has been studied at multiple scales, from neurons, circuits, areas with well-defined anatomical and functional boundaries, to large-scale functional networks which mediate coherent cognition. In a recent work, we addressed the problem of the hierarchical organization in the brain through network analysis. Our analysis identified functional brain modules of fractal structure that were inter-connected in a small-world topology. Here, we provide more details on the use of network science tools to elaborate on this behavior. We indicate the importance of using percolation theory to highlight the modular character of the functional brain network. These modules present a fractal, self-similar topology, identified through fractal network methods. When we lower the threshold of correlations to include weaker ties, the network as a whole assumes a small-world character. These weak ties are organized precisely as predicted by theory maximizing information transfer with minimal wiring costs. PMID:22586406

Exhaustive identification of steady state cycles in large stoichiometric networks

PubMed Central

Wright, Jeremiah; Wagner, Andreas

2008-01-01

Background Identifying cyclic pathways in chemical reaction networks is important, because such cycles may indicate in silico violation of energy conservation, or the existence of feedback in vivo. Unfortunately, our ability to identify cycles in stoichiometric networks, such as signal transduction and genome-scale metabolic networks, has been hampered by the computational complexity of the methods currently used. Results We describe a new algorithm for the identification of cycles in stoichiometric networks, and we compare its performance to two others by exhaustively identifying the cycles contained in the genome-scale metabolic networks of H. pylori, M. barkeri, E. coli, and S. cerevisiae. Our algorithm can substantially decrease both the execution time and maximum memory usage in comparison to the two previous algorithms. Conclusion The algorithm we describe improves our ability to study large, real-world, biochemical reaction networks, although additional methodological improvements are desirable. PMID:18616835

Performance analysis of PPP ambiguity resolution with UPD products estimated from different scales of reference station networks

NASA Astrophysics Data System (ADS)

Wang, Siyao; Li, Bofeng; Li, Xingxing; Zang, Nan

2018-01-01

Integer ambiguity fixing with uncalibrated phase delay (UPD) products can significantly shorten the initialization time and improve the accuracy of precise point positioning (PPP). Since the tracking arcs of satellites and the behavior of atmospheric biases can be very different for the reference networks with different scales, the qualities of corresponding UPD products may be also various. The purpose of this paper is to comparatively investigate the influence of different scales of reference station networks on UPD estimation and user ambiguity resolution. Three reference station networks with global, wide-area and local scales are used to compute the UPD products and analyze their impact on the PPP-AR. The time-to-first-fix, the unfix rate and the incorrect fix rate of PPP-AR are analyzed. Moreover, in order to further shorten the convergence time for obtaining precise positioning, a modified partial ambiguity resolution (PAR) and corresponding validation strategy are presented. In this PAR method, the ambiguity subset is determined by removing the ambiguity one by one in the order of ascending elevations. Besides, for static positioning mode, a coordinate validation strategy is employed to enhance the reliability of the fixed coordinate. The experiment results show that UPD products computed by smaller station network are more accurate and lead to a better coordinate solution; the PAR method used in this paper can shorten the convergence time and the coordinate validation strategy can improve the availability of high precision positioning.

Association between suicidal symptoms and repeat suicidal behaviour within a sample of hospital-treated suicide attempters.

PubMed

de Beurs, Derek P; van Borkulo, Claudia D; O'Connor, Rory C

2017-05-01

Suicidal behaviour is the end result of the complex relation between many factors which are biological, psychological and environmental in nature. Network analysis is a novel method that may help us better understand the complex association between different factors. To examine the relationship between suicidal symptoms as assessed by the Beck Scale for Suicide Ideation and future suicidal behaviour in patients admitted to hospital following a suicide attempt, using network analysis. Secondary analysis was conducted on previously collected data from a sample of 366 patients who were admitted to a Scottish hospital following a suicide attempt. Network models were estimated to visualise and test the association between baseline symptom network structure and suicidal behaviour at 15-month follow-up. Network analysis showed that the desire for an active attempt was found to be the most central, strongly related suicide symptom. Of the 19 suicide symptoms that were assessed at baseline, 10 symptoms were directly related to repeat suicidal behaviour. When comparing baseline network structure of repeaters ( n =94) with the network of non-repeaters ( n =272), no significant differences were found. Network analysis can help us better understand suicidal behaviour by visualising the complex relation between relevant symptoms and by indicating which symptoms are most central within the network. These insights have theoretical implications as well as informing the assessment and treatment of suicidal behaviour. None. © The Royal College of Psychiatrists 2017. This is an open access article distributed under the terms of the Creative Commons Non-Commercial, No Derivatives (CC BY-NC-ND) license.

Scale-Free Distribution of Avian Influenza Outbreaks

NASA Astrophysics Data System (ADS)

Small, Michael; Walker, David M.; Tse, Chi Kong

2007-11-01

Using global case data for the period from 25 November 2003 to 10 March 2007, we construct a network of plausible transmission pathways for the spread of avian influenza among domestic and wild birds. The network structure we obtain is complex and exhibits scale-free (although not necessarily small-world) properties. Communities within this network are connected with a distribution of links with infinite variance. Hence, the disease transmission model does not exhibit a threshold and so the infection will continue to propagate even with very low transmissibility. Consequentially, eradication with methods applicable to locally homogeneous populations is not possible. Any control measure needs to focus explicitly on the hubs within this network structure.

Networks as Renormalized Models for Emergent Behavior in Physical Systems

NASA Astrophysics Data System (ADS)

Paczuski, Maya

2005-09-01

Networks are paradigms for describing complex biological, social and technological systems. Here I argue that networks provide a coherent framework to construct coarsegrained models for many different physical systems. To elucidate these ideas, I discuss two long-standing problems. The first concerns the structure and dynamics of magnetic fields in the solar corona, as exemplified by sunspots that startled Galileo almost 400 years ago. We discovered that the magnetic structure of the corona embodies a scale free network, with spots at all scales. A network model representing the three-dimensional geometry of magnetic fields, where links rewire and nodes merge when they collide in space, gives quantitative agreement with available data, and suggests new measurements. Seismicity is addressed in terms of relations between events without imposing space-time windows. A metric estimates the correlation between any two earthquakes. Linking strongly correlated pairs, and ignoring pairs with weak correlation organizes the spatio-temporal process into a sparse, directed, weighted network. New scaling laws for seismicity are found. For instance, the aftershock decay rate decreases as ~ 1/t in time up to a correlation time, tomori. An estimate from the data gives tomori to be about one year for small magnitude 3 earthquakes, about 1400 years for the Landers event, and roughly 26,000 years for the earthquake causing the 2004 Asian tsunami. Our results confirm Kagan's conjecture that aftershocks can rumble on for centuries.

Network Learning for Educational Change. Professional Learning

ERIC Educational Resources Information Center

Veugelers, Wiel, Ed.; O'Hair, Mary John, Ed.

2005-01-01

School-university networks are becoming an important method to enhance educational renewal and student achievement. Networks go beyond tensions of top-down versus bottom-up, school development and professional development of individuals, theory and practice, and formal and informal organizational structures. The theoretical base of networking…

Neuron splitting in compute-bound parallel network simulations enables runtime scaling with twice as many processors.

PubMed

Hines, Michael L; Eichner, Hubert; Schürmann, Felix

2008-08-01

Neuron tree topology equations can be split into two subtrees and solved on different processors with no change in accuracy, stability, or computational effort; communication costs involve only sending and receiving two double precision values by each subtree at each time step. Splitting cells is useful in attaining load balance in neural network simulations, especially when there is a wide range of cell sizes and the number of cells is about the same as the number of processors. For compute-bound simulations load balance results in almost ideal runtime scaling. Application of the cell splitting method to two published network models exhibits good runtime scaling on twice as many processors as could be effectively used with whole-cell balancing.

Invariant 2D object recognition using the wavelet transform and structured neural networks

NASA Astrophysics Data System (ADS)

Khalil, Mahmoud I.; Bayoumi, Mohamed M.

1999-03-01

This paper applies the dyadic wavelet transform and the structured neural networks approach to recognize 2D objects under translation, rotation, and scale transformation. Experimental results are presented and compared with traditional methods. The experimental results showed that this refined technique successfully classified the objects and outperformed some traditional methods especially in the presence of noise.

Large-scale, high-density (up to 512 channels) recording of local circuits in behaving animals

PubMed Central

Berényi, Antal; Somogyvári, Zoltán; Nagy, Anett J.; Roux, Lisa; Long, John D.; Fujisawa, Shigeyoshi; Stark, Eran; Leonardo, Anthony; Harris, Timothy D.

2013-01-01

Monitoring representative fractions of neurons from multiple brain circuits in behaving animals is necessary for understanding neuronal computation. Here, we describe a system that allows high-channel-count recordings from a small volume of neuronal tissue using a lightweight signal multiplexing headstage that permits free behavior of small rodents. The system integrates multishank, high-density recording silicon probes, ultraflexible interconnects, and a miniaturized microdrive. These improvements allowed for simultaneous recordings of local field potentials and unit activity from hundreds of sites without confining free movements of the animal. The advantages of large-scale recordings are illustrated by determining the electroanatomic boundaries of layers and regions in the hippocampus and neocortex and constructing a circuit diagram of functional connections among neurons in real anatomic space. These methods will allow the investigation of circuit operations and behavior-dependent interregional interactions for testing hypotheses of neural networks and brain function. PMID:24353300

Functional Connectivity in Multiple Cortical Networks Is Associated with Performance Across Cognitive Domains in Older Adults.

PubMed

Shaw, Emily E; Schultz, Aaron P; Sperling, Reisa A; Hedden, Trey

2015-10-01

Intrinsic functional connectivity MRI has become a widely used tool for measuring integrity in large-scale cortical networks. This study examined multiple cortical networks using Template-Based Rotation (TBR), a method that applies a priori network and nuisance component templates defined from an independent dataset to test datasets of interest. A priori templates were applied to a test dataset of 276 older adults (ages 65-90) from the Harvard Aging Brain Study to examine the relationship between multiple large-scale cortical networks and cognition. Factor scores derived from neuropsychological tests represented processing speed, executive function, and episodic memory. Resting-state BOLD data were acquired in two 6-min acquisitions on a 3-Tesla scanner and processed with TBR to extract individual-level metrics of network connectivity in multiple cortical networks. All results controlled for data quality metrics, including motion. Connectivity in multiple large-scale cortical networks was positively related to all cognitive domains, with a composite measure of general connectivity positively associated with general cognitive performance. Controlling for the correlations between networks, the frontoparietal control network (FPCN) and executive function demonstrated the only significant association, suggesting specificity in this relationship. Further analyses found that the FPCN mediated the relationships of the other networks with cognition, suggesting that this network may play a central role in understanding individual variation in cognition during aging.

A Large Scale Dynamical System Immune Network Modelwith Finite Connectivity

NASA Astrophysics Data System (ADS)

Uezu, T.; Kadono, C.; Hatchett, J.; Coolen, A. C. C.

We study a model of an idiotypic immune network which was introduced by N. K. Jerne. It is known that in immune systems there generally exist several kinds of immune cells which can recognize any particular antigen. Taking this fact into account and assuming that each cell interacts with only a finite number of other cells, we analyze a large scale immune network via both numerical simulations and statistical mechanical methods, and show that the distribution of the concentrations of antibodies becomes non-trivial for a range of values of the strength of the interaction and the connectivity.

Large-scale Granger causality analysis on resting-state functional MRI

NASA Astrophysics Data System (ADS)

D'Souza, Adora M.; Abidin, Anas Zainul; Leistritz, Lutz; Wismüller, Axel

2016-03-01

We demonstrate an approach to measure the information flow between each pair of time series in resting-state functional MRI (fMRI) data of the human brain and subsequently recover its underlying network structure. By integrating dimensionality reduction into predictive time series modeling, large-scale Granger Causality (lsGC) analysis method can reveal directed information flow suggestive of causal influence at an individual voxel level, unlike other multivariate approaches. This method quantifies the influence each voxel time series has on every other voxel time series in a multivariate sense and hence contains information about the underlying dynamics of the whole system, which can be used to reveal functionally connected networks within the brain. To identify such networks, we perform non-metric network clustering, such as accomplished by the Louvain method. We demonstrate the effectiveness of our approach to recover the motor and visual cortex from resting state human brain fMRI data and compare it with the network recovered from a visuomotor stimulation experiment, where the similarity is measured by the Dice Coefficient (DC). The best DC obtained was 0.59 implying a strong agreement between the two networks. In addition, we thoroughly study the effect of dimensionality reduction in lsGC analysis on network recovery. We conclude that our approach is capable of detecting causal influence between time series in a multivariate sense, which can be used to segment functionally connected networks in the resting-state fMRI.

Bioinspired Principles for Large-Scale Networked Sensor Systems: An Overview

PubMed Central

Jacobsen, Rune Hylsberg; Zhang, Qi; Toftegaard, Thomas Skjødeberg

2011-01-01

Biology has often been used as a source of inspiration in computer science and engineering. Bioinspired principles have found their way into network node design and research due to the appealing analogies between biological systems and large networks of small sensors. This paper provides an overview of bioinspired principles and methods such as swarm intelligence, natural time synchronization, artificial immune system and intercellular information exchange applicable for sensor network design. Bioinspired principles and methods are discussed in the context of routing, clustering, time synchronization, optimal node deployment, localization and security and privacy. PMID:22163841

NON-POTENTIAL FIELDS IN THE QUIET SUN NETWORK: EXTREME-ULTRAVIOLET AND MAGNETIC FOOTPOINT OBSERVATIONS

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

Chesny, D. L.; Oluseyi, H. M.; Orange, N. B.

The quiet Sun (QS) magnetic network is known to contain dynamics which are indicative of non-potential fields. Non-potential magnetic fields forming ''S-shaped'' loop arcades can lead to the breakdown of static activity and have only been observed in high temperature X-ray coronal structures—some of which show eruptive behavior. Thus, analysis of this type of atmospheric structuring has been restricted to large-scale coronal fields. Here we provide the first identification of non-potential loop arcades exclusive to the QS supergranulation network. High-resolution Atmospheric Imaging Assembly data from the Solar Dynamics Observatory have allowed for the first observations of fine-scale ''S-shaped'' loop arcadesmore » spanning the network. We have investigated the magnetic footpoint flux evolution of these arcades from Heliospheric and Magnetic Imager data and find evidence of evolving footpoint flux imbalances accompanying the formation of these non-potential fields. The existence of such non-potentiality confirms that magnetic field dynamics leading to the build up of helicity exist at small scales. QS non-potentiality also suggests a self-similar formation process between the QS network and high temperature corona and the existence of self-organized criticality (SOC) in the form of loop-pair reconnection and helicity dissipation. We argue that this type of behavior could lead to eruptive forms of SOC as seen in active region (AR) and X-ray sigmoids if sufficient free magnetic energy is available. QS magnetic network dynamics may be considered as a coronal proxy at supergranular scales, and events confined to the network can even mimic those in coronal ARs.« less

Network geometry with flavor: From complexity to quantum geometry

NASA Astrophysics Data System (ADS)

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d -dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s =-1 ,0 ,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d . In d =1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d >1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t . Interestingly the NGF remains fully classical but its statistical properties reveal the relation to its quantum mechanical description. In fact the δ -dimensional faces of the NGF have generalized degrees that follow either the Fermi-Dirac, Boltzmann, or Bose-Einstein statistics depending on the flavor s and the dimensions d and δ .

Network geometry with flavor: From complexity to quantum geometry.

PubMed

Bianconi, Ginestra; Rahmede, Christoph

2016-03-01

Network geometry is attracting increasing attention because it has a wide range of applications, ranging from data mining to routing protocols in the Internet. At the same time advances in the understanding of the geometrical properties of networks are essential for further progress in quantum gravity. In network geometry, simplicial complexes describing the interaction between two or more nodes play a special role. In fact these structures can be used to discretize a geometrical d-dimensional space, and for this reason they have already been widely used in quantum gravity. Here we introduce the network geometry with flavor s=-1,0,1 (NGF) describing simplicial complexes defined in arbitrary dimension d and evolving by a nonequilibrium dynamics. The NGF can generate discrete geometries of different natures, ranging from chains and higher-dimensional manifolds to scale-free networks with small-world properties, scale-free degree distribution, and nontrivial community structure. The NGF admits as limiting cases both the Bianconi-Barabási models for complex networks, the stochastic Apollonian network, and the recently introduced model for complex quantum network manifolds. The thermodynamic properties of NGF reveal that NGF obeys a generalized area law opening a new scenario for formulating its coarse-grained limit. The structure of NGF is strongly dependent on the dimensionality d. In d=1 NGFs grow complex networks for which the preferential attachment mechanism is necessary in order to obtain a scale-free degree distribution. Instead, for NGF with dimension d>1 it is not necessary to have an explicit preferential attachment rule to generate scale-free topologies. We also show that NGF admits a quantum mechanical description in terms of associated quantum network states. Quantum network states evolve by a Markovian dynamics and a quantum network state at time t encodes all possible NGF evolutions up to time t. Interestingly the NGF remains fully classical but its statistical properties reveal the relation to its quantum mechanical description. In fact the δ-dimensional faces of the NGF have generalized degrees that follow either the Fermi-Dirac, Boltzmann, or Bose-Einstein statistics depending on the flavor s and the dimensions d and δ.

Integrated Regulatory and Metabolic Networks of the Marine Diatom Phaeodactylum tricornutum Predict the Response to Rising CO 2 Levels

DOE PAGES

Levering, Jennifer; Dupont, Christopher L.; Allen, Andrew E.; ...

2017-02-14

Diatoms are eukaryotic microalgae that are responsible for up to 40% of the ocean’s primary productivity. How diatoms respond to environmental perturbations such as elevated carbon concentrations in the atmosphere is currently poorly understood. We developed a transcriptional regulatory network based on various transcriptome sequencing expression libraries for different environmental responses to gain insight into the marine diatom’s metabolic and regulatory interactions and provide a comprehensive framework of responses to increasing atmospheric carbon levels. This transcriptional regulatory network was integrated with a recently published genome-scale metabolic model of Phaeodactylum tricornutum to explore the connectivity of the regulatory network and sharedmore » metabolites. The integrated regulatory and metabolic model revealed highly connected modules within carbon and nitrogen metabolism. P. tricornutum’s response to rising carbon levels was analyzed by using the recent genome-scale metabolic model with cross comparison to experimental manipulations of carbon dioxide. Using a systems biology approach, we studied the response of the marine diatom Phaeodactylum tricornutum to changing atmospheric carbon concentrations on an ocean-wide scale. By integrating an available genome-scale metabolic model and a newly developed transcriptional regulatory network inferred from transcriptome sequencing expression data, we demonstrate that carbon metabolism and nitrogen metabolism are strongly connected and the genes involved are coregulated in this model diatom. These tight regulatory constraints could play a major role during the adaptation of P. tricornutum to increasing carbon levels. The transcriptional regulatory network developed can be further used to study the effects of different environmental perturbations on P. tricornutum’s metabolism.« less

Integrated Regulatory and Metabolic Networks of the Marine Diatom Phaeodactylum tricornutum Predict the Response to Rising CO 2 Levels

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

Levering, Jennifer; Dupont, Christopher L.; Allen, Andrew E.

Diatoms are eukaryotic microalgae that are responsible for up to 40% of the ocean’s primary productivity. How diatoms respond to environmental perturbations such as elevated carbon concentrations in the atmosphere is currently poorly understood. We developed a transcriptional regulatory network based on various transcriptome sequencing expression libraries for different environmental responses to gain insight into the marine diatom’s metabolic and regulatory interactions and provide a comprehensive framework of responses to increasing atmospheric carbon levels. This transcriptional regulatory network was integrated with a recently published genome-scale metabolic model of Phaeodactylum tricornutum to explore the connectivity of the regulatory network and sharedmore » metabolites. The integrated regulatory and metabolic model revealed highly connected modules within carbon and nitrogen metabolism. P. tricornutum’s response to rising carbon levels was analyzed by using the recent genome-scale metabolic model with cross comparison to experimental manipulations of carbon dioxide. Using a systems biology approach, we studied the response of the marine diatom Phaeodactylum tricornutum to changing atmospheric carbon concentrations on an ocean-wide scale. By integrating an available genome-scale metabolic model and a newly developed transcriptional regulatory network inferred from transcriptome sequencing expression data, we demonstrate that carbon metabolism and nitrogen metabolism are strongly connected and the genes involved are coregulated in this model diatom. These tight regulatory constraints could play a major role during the adaptation of P. tricornutum to increasing carbon levels. The transcriptional regulatory network developed can be further used to study the effects of different environmental perturbations on P. tricornutum’s metabolism.« less

Collective network routing

DOEpatents

Hoenicke, Dirk

2014-12-02

Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

ORNL Pre-test Analyses of A Large-scale Experiment in STYLE

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

Williams, Paul T; Yin, Shengjun; Klasky, Hilda B

Oak Ridge National Laboratory (ORNL) is conducting a series of numerical analyses to simulate a large scale mock-up experiment planned within the European Network for Structural Integrity for Lifetime Management non-RPV Components (STYLE). STYLE is a European cooperative effort to assess the structural integrity of (non-reactor pressure vessel) reactor coolant pressure boundary components relevant to ageing and life-time management and to integrate the knowledge created in the project into mainstream nuclear industry assessment codes. ORNL contributes work-in-kind support to STYLE Work Package 2 (Numerical Analysis/Advanced Tools) and Work Package 3 (Engineering Assessment Methods/LBB Analyses). This paper summarizes the current statusmore » of ORNL analyses of the STYLE Mock-Up3 large-scale experiment to simulate and evaluate crack growth in a cladded ferritic pipe. The analyses are being performed in two parts. In the first part, advanced fracture mechanics models are being developed and performed to evaluate several experiment designs taking into account the capabilities of the test facility while satisfying the test objectives. Then these advanced fracture mechanics models will be utilized to simulate the crack growth in the large scale mock-up test. For the second part, the recently developed ORNL SIAM-PFM open-source, cross-platform, probabilistic computational tool will be used to generate an alternative assessment for comparison with the advanced fracture mechanics model results. The SIAM-PFM probabilistic analysis of the Mock-Up3 experiment will utilize fracture modules that are installed into a general probabilistic framework. The probabilistic results of the Mock-Up3 experiment obtained from SIAM-PFM will be compared to those results generated using the deterministic 3D nonlinear finite-element modeling approach. The objective of the probabilistic analysis is to provide uncertainty bounds that will assist in assessing the more detailed 3D finite-element solutions and to also assess the level of confidence that can be placed in the best-estimate finiteelement solutions.« less

Scaling of flow distance in random self-similar channel networks

USGS Publications Warehouse

Troutman, B.M.

2005-01-01

Natural river channel networks have been shown in empirical studies to exhibit power-law scaling behavior characteristic of self-similar and self-affine structures. Of particular interest is to describe how the distribution of distance to the outlet changes as a function of network size. In this paper, networks are modeled as random self-similar rooted tree graphs and scaling of distance to the root is studied using methods in stochastic branching theory. In particular, the asymptotic expectation of the width function (number of nodes as a function of distance to the outlet) is derived under conditions on the replacement generators. It is demonstrated further that the branching number describing rate of growth of node distance to the outlet is identical to the length ratio under a Horton-Strahler ordering scheme as order gets large, again under certain restrictions on the generators. These results are discussed in relation to drainage basin allometry and an application to an actual drainage network is presented. ?? World Scientific Publishing Company.

Significant Scales in Community Structure

NASA Astrophysics Data System (ADS)

Traag, V. A.; Krings, G.; van Dooren, P.

2013-10-01

Many complex networks show signs of modular structure, uncovered by community detection. Although many methods succeed in revealing various partitions, it remains difficult to detect at what scale some partition is significant. This problem shows foremost in multi-resolution methods. We here introduce an efficient method for scanning for resolutions in one such method. Additionally, we introduce the notion of ``significance'' of a partition, based on subgraph probabilities. Significance is independent of the exact method used, so could also be applied in other methods, and can be interpreted as the gain in encoding a graph by making use of a partition. Using significance, we can determine ``good'' resolution parameters, which we demonstrate on benchmark networks. Moreover, optimizing significance itself also shows excellent performance. We demonstrate our method on voting data from the European Parliament. Our analysis suggests the European Parliament has become increasingly ideologically divided and that nationality plays no role.

S-curve networks and an approximate method for estimating degree distributions of complex networks

NASA Astrophysics Data System (ADS)

Guo, Jin-Li

2010-12-01

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási-Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási-Albert method commonly used in current network research.

Construction of regulatory networks using expression time-series data of a genotyped population.

PubMed

Yeung, Ka Yee; Dombek, Kenneth M; Lo, Kenneth; Mittler, John E; Zhu, Jun; Schadt, Eric E; Bumgarner, Roger E; Raftery, Adrian E

2011-11-29

The inference of regulatory and biochemical networks from large-scale genomics data is a basic problem in molecular biology. The goal is to generate testable hypotheses of gene-to-gene influences and subsequently to design bench experiments to confirm these network predictions. Coexpression of genes in large-scale gene-expression data implies coregulation and potential gene-gene interactions, but provide little information about the direction of influences. Here, we use both time-series data and genetics data to infer directionality of edges in regulatory networks: time-series data contain information about the chronological order of regulatory events and genetics data allow us to map DNA variations to variations at the RNA level. We generate microarray data measuring time-dependent gene-expression levels in 95 genotyped yeast segregants subjected to a drug perturbation. We develop a Bayesian model averaging regression algorithm that incorporates external information from diverse data types to infer regulatory networks from the time-series and genetics data. Our algorithm is capable of generating feedback loops. We show that our inferred network recovers existing and novel regulatory relationships. Following network construction, we generate independent microarray data on selected deletion mutants to prospectively test network predictions. We demonstrate the potential of our network to discover de novo transcription-factor binding sites. Applying our construction method to previously published data demonstrates that our method is competitive with leading network construction algorithms in the literature.

Alignment and political will: upscaling an Australian respectful relationships program.

PubMed

Joyce, Andrew; Green, Celia; Kearney, Sarah; Leung, Loksee; Ollis, Debbie

2018-05-29

Many small scale efficacious programs and interventions need to be 'scaled-up' in order to reach a larger population. Although it has been argued that interventions deemed suitable for upscaling need to have demonstrated effectiveness, be able to be implemented cost-effectively and be accepted by intended recipients, these factors alone are insufficient in explaining which programs are adopted more broadly. Upscaling research often identifies political will as a key factor in explaining whether programs are supported and up-scaled, but this research lacks any depth into how political will is formed and has not applied policy theories to understanding the upscaling process. This article uses a political science lens to examine the key factors in the upscaling process of a Respectful Relationships in Schools Program. Focus groups and interviews were conducted with project staff, managers and community organizations involved in the program. The results reveal how a key focusing event related to a highly profiled personal tragedy propelled family violence into the national spotlight. At the same time, the organization leading the respectful relationships program leveraged their networks to position the program within the education department which enabled the government to quickly respond to the issue. The study highlights that political will is not a stand-alone factor as depicted by up-scaling models, but rather is the end point of a complex process that involves many elements including the establishment of networks and aligned programs that can capitalize when opportunities arise.

GASNet-EX Performance Improvements Due to Specialization for the Cray Aries Network

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

Hargrove, Paul H.; Bonachea, Dan

This document is a deliverable for milestone STPM17-6 of the Exascale Computing Project, delivered by WBS 2.3.1.14. It reports on the improvements in performance observed on Cray XC-series systems due to enhancements made to the GASNet-EX software. These enhancements, known as “specializations”, primarily consist of replacing network-independent implementations of several recently added features with implementations tailored to the Cray Aries network. Performance gains from specialization include (1) Negotiated-Payload Active Messages improve bandwidth of a ping-pong test by up to 14%, (2) Immediate Operations reduce running time of a synthetic benchmark by up to 93%, (3) non-bulk RMA Put bandwidth ismore » increased by up to 32%, (4) Remote Atomic performance is 70% faster than the reference on a point-to-point test and allows a hot-spot test to scale robustly, and (5) non-contiguous RMA interfaces see up to 8.6x speedups for an intra-node benchmark and 26% for inter-node. These improvements are available in the GASNet-EX 2018.3.0 release.« less

Lost in the city: revisiting Milgram's experiment in the age of social networks.

PubMed

Szüle, János; Kondor, Dániel; Dobos, László; Csabai, István; Vattay, Gábor

2014-01-01

As more and more users access social network services from smart devices with GPS receivers, the available amount of geo-tagged information makes repeating classical experiments possible on global scales and with unprecedented precision. Inspired by the original experiments of Milgram, we simulated message routing within a representative sub-graph of the network of Twitter users with about 6 million geo-located nodes and 122 million edges. We picked pairs of users from two distant metropolitan areas and tried to find a route between them using local geographic information only; our method was to forward messages to a friend living closest to the target. We found that the examined network is navigable on large scales, but navigability breaks down at the city scale and the network becomes unnavigable on intra-city distances. This means that messages usually arrived to the close proximity of the target in only 3-6 steps, but only in about 20% of the cases was it possible to find a route all the way to the recipient, in spite of the network being connected. This phenomenon is supported by the distribution of link lengths; on larger scales the distribution behaves approximately as P(d) ≈ 1/d, which was found earlier by Kleinberg to allow efficient navigation, while on smaller scales, a fractal structure becomes apparent. The intra-city correlation dimension of the network was found to be D2 = 1.25, less than the dimension D2 = 1.78 of the distribution of the population.

Common Dimensional Reward Deficits Across Mood and Psychotic Disorders: A Connectome-Wide Association Study.

PubMed

Sharma, Anup; Wolf, Daniel H; Ciric, Rastko; Kable, Joseph W; Moore, Tyler M; Vandekar, Simon N; Katchmar, Natalie; Daldal, Aylin; Ruparel, Kosha; Davatzikos, Christos; Elliott, Mark A; Calkins, Monica E; Shinohara, Russell T; Bassett, Danielle S; Satterthwaite, Theodore D

2017-07-01

Anhedonia is central to multiple psychiatric disorders and causes substantial disability. A dimensional conceptualization posits that anhedonia severity is related to a transdiagnostic continuum of reward deficits in specific neural networks. Previous functional connectivity studies related to anhedonia have focused on case-control comparisons in specific disorders, using region-specific seed-based analyses. Here, the authors explore the entire functional connectome in relation to reward responsivity across a population of adults with heterogeneous psychopathology. In a sample of 225 adults from five diagnostic groups (major depressive disorder, N=32; bipolar disorder, N=50; schizophrenia, N=51; psychosis risk, N=39; and healthy control subjects, N=53), the authors conducted a connectome-wide analysis examining the relationship between a dimensional measure of reward responsivity (the reward sensitivity subscale of the Behavioral Activation Scale) and resting-state functional connectivity using multivariate distance-based matrix regression. The authors identified foci of dysconnectivity associated with reward responsivity in the nucleus accumbens, the default mode network, and the cingulo-opercular network. Follow-up analyses revealed dysconnectivity among specific large-scale functional networks and their connectivity with the nucleus accumbens. Reward deficits were associated with decreased connectivity between the nucleus accumbens and the default mode network and increased connectivity between the nucleus accumbens and the cingulo-opercular network. In addition, impaired reward responsivity was associated with default mode network hyperconnectivity and diminished connectivity between the default mode network and the cingulo-opercular network. These results emphasize the centrality of the nucleus accumbens in the pathophysiology of reward deficits and suggest that dissociable patterns of connectivity among large-scale networks are critical to the neurobiology of reward dysfunction across clinical diagnostic categories.

Validation of the Social Networking Activity Intensity Scale among Junior Middle School Students in China.

PubMed

Li, Jibin; Lau, Joseph T F; Mo, Phoenix K H; Su, Xuefen; Wu, Anise M S; Tang, Jie; Qin, Zuguo

2016-01-01

Online social networking use has been integrated into adolescents' daily life and the intensity of online social networking use may have important consequences on adolescents' well-being. However, there are few validated instruments to measure social networking use intensity. The present study aims to develop the Social Networking Activity Intensity Scale (SNAIS) and validate it among junior middle school students in China. A total of 910 students who were social networking users were recruited from two junior middle schools in Guangzhou, and 114 students were retested after two weeks to examine the test-retest reliability. The psychometrics of the SNAIS were estimated using appropriate statistical methods. Two factors, Social Function Use Intensity (SFUI) and Entertainment Function Use Intensity (EFUI), were clearly identified by both exploratory and confirmatory factor analyses. No ceiling or floor effects were observed for the SNAIS and its two subscales. The SNAIS and its two subscales exhibited acceptable reliability (Cronbach's alpha = 0.89, 0.90 and 0.60, and test-retest Intra-class Correlation Coefficient = 0.85, 0.87 and 0.67 for Overall scale, SFUI and EFUI subscale, respectively, p<0.001). As expected, the SNAIS and its subscale scores were correlated significantly with emotional connection to social networking, social networking addiction, Internet addiction, and characteristics related to social networking use. The SNAIS is an easily self-administered scale with good psychometric properties. It would facilitate more research in this field worldwide and specifically in the Chinese population.

Hot spots, hot moments and time-span of changes in drivers and their responses on carbon cycling in Europe

NASA Astrophysics Data System (ADS)

Tomelleri, E.; Forkel, M.; Fuchs, R.; Jung, M.; Mahecha, M. D.; Reichstein, M.; Weber, U.

2012-12-01

The objective of this study is to provide a complete quantitative assessment of the annual to decadal variability, hotspots of changes and the temporal magnitude of regional trends and variability for the main drivers of carbon cycle like climate and land use and their responses for Europe. For this purpose we used an harmonized climatic data set (ERA Interim and WATCH) and an historical land-use change reconstruction (HILDAv1, Fuchs in prep.). Both the data sets cover the period 1900-2010 and have a 0.25 deg spatial resolution. As driver response we used two different empirically up-scaled GPP fields: the first (MTE) obtained by the application of model trees (Jung et al. 2009) and a second (LUE) based on a light use efficiency model (Tomelleri in prep.). Both the approaches are based on the up-scaling of Fluxnet observations. The response fields have monthly temporal resolution and are limited to the period 1982-2011. We estimated break-points in time series of driver and response variables based on the method of Bai and Perron (2003) to identify changes in trends. This method was implemented in Verbesselt et al. 2010 and applied by deJong et al. 2011 to detect phenological and abrupt changes and trends in vegetation activity based on satellite-derived vegetation index time series. The analysis of drivers and responses allowed to identify the dominant factors driving the biosphere-atmosphere carbon exchange. The synchronous analysis of climatic drivers and land use change allowed us to explain most of the temporal and spatial variability showing that in the regions and time period where the most land use change occurred the climatic drivers are not sufficient to explain trends and oscillation in carbon cycling. The comparison of our analysis for the up-scaling methods shows some agreement: we found inconsistency in the spatial and temporal patterns in regions where the Fluxnet network is less dense. This can be explained by the conceptual difference in the up-scaling methods: while one is on pixel basis (MTE) the other (LUE) is up-scaling model parameters by bioclimatic regions. Our study shows the value of up-scaling methods for understanding the spatial-temporal variability of carbon cycling and how these are a valuable tool for spatial and temporal analysis. Furthermore, the use of climatic drivers and land-use change demonstrated the need of taking natural and anthropogenic drivers into consideration for explaining trends and oscillations. Possibly a further analysis including detailed management practices for forestry and agriculture would help in explaining the remaining variance. References: Bai, J., Perron, P.: Computation and analysis of multiple structural change models. Journal of Applied Econometrics, 18(1), 2003. Jung, M., Reichstein, M., and Bondeau, A.: Towards global empirical upscaling of FLUXNET eddy covariance observations: validation of a model tree ensemble approach using a biosphere model. Biogeosciences, 6, 2009. Verbesselt, J., Hyndman, R., Newnham, G., Culvenor, D.: Detecting trend and seasonal changes in satellite image time series. Remote Sensing of Environment,114(1), 2010. de Jong, R., Verbesselt, J., Schaepman, M.E., Bruin, S.: Trend changes in global greening and browning: contribution of short-term trends to longer-term change. Global Change Biology, 18, 2011.

CoryneRegNet 4.0 – A reference database for corynebacterial gene regulatory networks

PubMed Central

Baumbach, Jan

2007-01-01

Background Detailed information on DNA-binding transcription factors (the key players in the regulation of gene expression) and on transcriptional regulatory interactions of microorganisms deduced from literature-derived knowledge, computer predictions and global DNA microarray hybridization experiments, has opened the way for the genome-wide analysis of transcriptional regulatory networks. The large-scale reconstruction of these networks allows the in silico analysis of cell behavior in response to changing environmental conditions. We previously published CoryneRegNet, an ontology-based data warehouse of corynebacterial transcription factors and regulatory networks. Initially, it was designed to provide methods for the analysis and visualization of the gene regulatory network of Corynebacterium glutamicum. Results Now we introduce CoryneRegNet release 4.0, which integrates data on the gene regulatory networks of 4 corynebacteria, 2 mycobacteria and the model organism Escherichia coli K12. As the previous versions, CoryneRegNet provides a web-based user interface to access the database content, to allow various queries, and to support the reconstruction, analysis and visualization of regulatory networks at different hierarchical levels. In this article, we present the further improved database content of CoryneRegNet along with novel analysis features. The network visualization feature GraphVis now allows the inter-species comparisons of reconstructed gene regulatory networks and the projection of gene expression levels onto that networks. Therefore, we added stimulon data directly into the database, but also provide Web Service access to the DNA microarray analysis platform EMMA. Additionally, CoryneRegNet now provides a SOAP based Web Service server, which can easily be consumed by other bioinformatics software systems. Stimulons (imported from the database, or uploaded by the user) can be analyzed in the context of known transcriptional regulatory networks to predict putative contradictions or further gene regulatory interactions. Furthermore, it integrates protein clusters by means of heuristically solving the weighted graph cluster editing problem. In addition, it provides Web Service based access to up to date gene annotation data from GenDB. Conclusion The release 4.0 of CoryneRegNet is a comprehensive system for the integrated analysis of procaryotic gene regulatory networks. It is a versatile systems biology platform to support the efficient and large-scale analysis of transcriptional regulation of gene expression in microorganisms. It is publicly available at . PMID:17986320

Differentially Private Distributed Sensing

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

Fink, Glenn A.

The growth of the Internet of Things (IoT) creates the possibility of decentralized systems of sensing and actuation, potentially on a global scale. IoT devices connected to cloud networks can offer Sensing and Actuation as a Service (SAaaS) enabling networks of sensors to grow to a global scale. But extremely large sensor networks can violate privacy, especially in the case where IoT devices are mobile and connected directly to the behaviors of people. The thesis of this paper is that by adapting differential privacy (adding statistically appropriate noise to query results) to groups of geographically distributed sensors privacy could bemore » maintained without ever sending all values up to a central curator and without compromising the overall accuracy of the data collected. This paper outlines such a scheme and performs an analysis of differential privacy techniques adapted to edge computing in a simulated sensor network where ground truth is known. The positive and negative outcomes of employing differential privacy in distributed networks of devices are discussed and a brief research agenda is presented.« less

Patterns of preference and practice: bridging actors in wildfire response networks in the American Northwest.

PubMed

Faas, A J; Velez, Anne-Lise K; FitzGerald, Clare; Nowell, Branda L; Steelman, Toddi A

2017-07-01

The roles of bridging actors in emergency response networks can be important to disaster response outcomes. This paper is based on an evaluation of wildfire preparedness and response networks in 21 large-scale wildfire events in the wildland-urban interface near national forests in the American Northwest. The study investigated how key individuals in responder networks anticipated seeking out specific people in perceived bridging roles prior to the occurrence of wildfires, and then captured who in fact assumed these roles during actual large-scale events. It examines two plausible, but contradictory, bodies of theory-similarity and dissimilarity-that suggest who people might seek out as bridgers and who they would really go to during a disaster. Roughly one-half of all pre-fire nominations were consistent with similarity. Yet, while similarity is a reliable indicator of how people expect to organise, it does not hold up for how they organise during the real incident. © 2017 The Author(s). Disasters © Overseas Development Institute, 2017.

A biological network-based regularized artificial neural network model for robust phenotype prediction from gene expression data.

PubMed

Kang, Tianyu; Ding, Wei; Zhang, Luoyan; Ziemek, Daniel; Zarringhalam, Kourosh

2017-12-19

Stratification of patient subpopulations that respond favorably to treatment or experience and adverse reaction is an essential step toward development of new personalized therapies and diagnostics. It is currently feasible to generate omic-scale biological measurements for all patients in a study, providing an opportunity for machine learning models to identify molecular markers for disease diagnosis and progression. However, the high variability of genetic background in human populations hampers the reproducibility of omic-scale markers. In this paper, we develop a biological network-based regularized artificial neural network model for prediction of phenotype from transcriptomic measurements in clinical trials. To improve model sparsity and the overall reproducibility of the model, we incorporate regularization for simultaneous shrinkage of gene sets based on active upstream regulatory mechanisms into the model. We benchmark our method against various regression, support vector machines and artificial neural network models and demonstrate the ability of our method in predicting the clinical outcomes using clinical trial data on acute rejection in kidney transplantation and response to Infliximab in ulcerative colitis. We show that integration of prior biological knowledge into the classification as developed in this paper, significantly improves the robustness and generalizability of predictions to independent datasets. We provide a Java code of our algorithm along with a parsed version of the STRING DB database. In summary, we present a method for prediction of clinical phenotypes using baseline genome-wide expression data that makes use of prior biological knowledge on gene-regulatory interactions in order to increase robustness and reproducibility of omic-scale markers. The integrated group-wise regularization methods increases the interpretability of biological signatures and gives stable performance estimates across independent test sets.

Scaling up functional traits for ecosystem services with remote sensing: concepts and methods.

PubMed

Abelleira Martínez, Oscar J; Fremier, Alexander K; Günter, Sven; Ramos Bendaña, Zayra; Vierling, Lee; Galbraith, Sara M; Bosque-Pérez, Nilsa A; Ordoñez, Jenny C

2016-07-01

Ecosystem service-based management requires an accurate understanding of how human modification influences ecosystem processes and these relationships are most accurate when based on functional traits. Although trait variation is typically sampled at local scales, remote sensing methods can facilitate scaling up trait variation to regional scales needed for ecosystem service management. We review concepts and methods for scaling up plant and animal functional traits from local to regional spatial scales with the goal of assessing impacts of human modification on ecosystem processes and services. We focus our objectives on considerations and approaches for (1) conducting local plot-level sampling of trait variation and (2) scaling up trait variation to regional spatial scales using remotely sensed data. We show that sampling methods for scaling up traits need to account for the modification of trait variation due to land cover change and species introductions. Sampling intraspecific variation, stratification by land cover type or landscape context, or inference of traits from published sources may be necessary depending on the traits of interest. Passive and active remote sensing are useful for mapping plant phenological, chemical, and structural traits. Combining these methods can significantly improve their capacity for mapping plant trait variation. These methods can also be used to map landscape and vegetation structure in order to infer animal trait variation. Due to high context dependency, relationships between trait variation and remotely sensed data are not directly transferable across regions. We end our review with a brief synthesis of issues to consider and outlook for the development of these approaches. Research that relates typical functional trait metrics, such as the community-weighted mean, with remote sensing data and that relates variation in traits that cannot be remotely sensed to other proxies is needed. Our review narrows the gap between functional trait and remote sensing methods for ecosystem service management.

Ultrascalable petaflop parallel supercomputer

DOEpatents

Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY

2010-07-20

A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.

Large-scale modeling of rain fields from a rain cell deterministic model

NASA Astrophysics Data System (ADS)

FéRal, Laurent; Sauvageot, Henri; Castanet, Laurent; Lemorton, JoëL.; Cornet, FréDéRic; Leconte, Katia

2006-04-01

A methodology to simulate two-dimensional rain rate fields at large scale (1000 × 1000 km2, the scale of a satellite telecommunication beam or a terrestrial fixed broadband wireless access network) is proposed. It relies on a rain rate field cellular decomposition. At small scale (˜20 × 20 km2), the rain field is split up into its macroscopic components, the rain cells, described by the Hybrid Cell (HYCELL) cellular model. At midscale (˜150 × 150 km2), the rain field results from the conglomeration of rain cells modeled by HYCELL. To account for the rain cell spatial distribution at midscale, the latter is modeled by a doubly aggregative isotropic random walk, the optimal parameterization of which is derived from radar observations at midscale. The extension of the simulation area from the midscale to the large scale (1000 × 1000 km2) requires the modeling of the weather frontal area. The latter is first modeled by a Gaussian field with anisotropic covariance function. The Gaussian field is then turned into a binary field, giving the large-scale locations over which it is raining. This transformation requires the definition of the rain occupation rate over large-scale areas. Its probability distribution is determined from observations by the French operational radar network ARAMIS. The coupling with the rain field modeling at midscale is immediate whenever the large-scale field is split up into midscale subareas. The rain field thus generated accounts for the local CDF at each point, defining a structure spatially correlated at small scale, midscale, and large scale. It is then suggested that this approach be used by system designers to evaluate diversity gain, terrestrial path attenuation, or slant path attenuation for different azimuth and elevation angle directions.

DeepSkeleton: Learning Multi-Task Scale-Associated Deep Side Outputs for Object Skeleton Extraction in Natural Images

NASA Astrophysics Data System (ADS)

Shen, Wei; Zhao, Kai; Jiang, Yuan; Wang, Yan; Bai, Xiang; Yuille, Alan

2017-11-01

Object skeletons are useful for object representation and object detection. They are complementary to the object contour, and provide extra information, such as how object scale (thickness) varies among object parts. But object skeleton extraction from natural images is very challenging, because it requires the extractor to be able to capture both local and non-local image context in order to determine the scale of each skeleton pixel. In this paper, we present a novel fully convolutional network with multiple scale-associated side outputs to address this problem. By observing the relationship between the receptive field sizes of the different layers in the network and the skeleton scales they can capture, we introduce two scale-associated side outputs to each stage of the network. The network is trained by multi-task learning, where one task is skeleton localization to classify whether a pixel is a skeleton pixel or not, and the other is skeleton scale prediction to regress the scale of each skeleton pixel. Supervision is imposed at different stages by guiding the scale-associated side outputs toward the groundtruth skeletons at the appropriate scales. The responses of the multiple scale-associated side outputs are then fused in a scale-specific way to detect skeleton pixels using multiple scales effectively. Our method achieves promising results on two skeleton extraction datasets, and significantly outperforms other competitors. Additionally, the usefulness of the obtained skeletons and scales (thickness) are verified on two object detection applications: Foreground object segmentation and object proposal detection.

A simplified method of performance indicators development for epidemiological surveillance networks--application to the RESAPATH surveillance network.

PubMed

Sorbe, A; Chazel, M; Gay, E; Haenni, M; Madec, J-Y; Hendrikx, P

2011-06-01

Develop and calculate performance indicators allows to continuously follow the operation of an epidemiological surveillance network. This is an internal evaluation method, implemented by the coordinators in collaboration with all the actors of the network. Its purpose is to detect weak points in order to optimize management. A method for the development of performance indicators of epidemiological surveillance networks was developed in 2004 and was applied to several networks. Its implementation requires a thorough description of the network environment and all its activities to define priority indicators. Since this method is considered to be complex, our objective consisted in developing a simplified approach and applying it to an epidemiological surveillance network. We applied the initial method to a theoretical network model to obtain a list of generic indicators that can be adapted to any surveillance network. We obtained a list of 25 generic performance indicators, intended to be reformulated and described according to the specificities of each network. It was used to develop performance indicators for RESAPATH, an epidemiological surveillance network of antimicrobial resistance in pathogenic bacteria of animal origin in France. This application allowed us to validate the simplified method, its value in terms of practical implementation, and its level of user acceptance. Its ease of use and speed of application compared to the initial method argue in favor of its use on broader scale. Copyright © 2011 Elsevier Masson SAS. All rights reserved.

A level set method for determining critical curvatures for drainage and imbibition.

PubMed

Prodanović, Masa; Bryant, Steven L

2006-12-15

An accurate description of the mechanics of pore level displacement of immiscible fluids could significantly improve the predictions from pore network models of capillary pressure-saturation curves, interfacial areas and relative permeability in real porous media. If we assume quasi-static displacement, at constant pressure and surface tension, pore scale interfaces are modeled as constant mean curvature surfaces, which are not easy to calculate. Moreover, the extremely irregular geometry of natural porous media makes it difficult to evaluate surface curvature values and corresponding geometric configurations of two fluids. Finally, accounting for the topological changes of the interface, such as splitting or merging, is nontrivial. We apply the level set method for tracking and propagating interfaces in order to robustly handle topological changes and to obtain geometrically correct interfaces. We describe a simple but robust model for determining critical curvatures for throat drainage and pore imbibition. The model is set up for quasi-static displacements but it nevertheless captures both reversible and irreversible behavior (Haines jump, pore body imbibition). The pore scale grain boundary conditions are extracted from model porous media and from imaged geometries in real rocks. The method gives quantitative agreement with measurements and with other theories and computational approaches.

Extracting surface waves, hum and normal modes: time-scale phase-weighted stack and beyond

NASA Astrophysics Data System (ADS)

Ventosa, Sergi; Schimmel, Martin; Stutzmann, Eleonore

2017-10-01

Stacks of ambient noise correlations are routinely used to extract empirical Green's functions (EGFs) between station pairs. The time-frequency phase-weighted stack (tf-PWS) is a physically intuitive nonlinear denoising method that uses the phase coherence to improve EGF convergence when the performance of conventional linear averaging methods is not sufficient. The high computational cost of a continuous approach to the time-frequency transformation is currently a main limitation in ambient noise studies. We introduce the time-scale phase-weighted stack (ts-PWS) as an alternative extension of the phase-weighted stack that uses complex frames of wavelets to build a time-frequency representation that is much more efficient and fast to compute and that preserve the performance and flexibility of the tf-PWS. In addition, we propose two strategies: the unbiased phase coherence and the two-stage ts-PWS methods to further improve noise attenuation, quality of the extracted signals and convergence speed. We demonstrate that these approaches enable to extract minor- and major-arc Rayleigh waves (up to the sixth Rayleigh wave train) from many years of data from the GEOSCOPE global network. Finally we also show that fundamental spheroidal modes can be extracted from these EGF.

Multilayer Brain Networks

NASA Astrophysics Data System (ADS)

Vaiana, Michael; Muldoon, Sarah Feldt

2018-01-01

The field of neuroscience is facing an unprecedented expanse in the volume and diversity of available data. Traditionally, network models have provided key insights into the structure and function of the brain. With the advent of big data in neuroscience, both more sophisticated models capable of characterizing the increasing complexity of the data and novel methods of quantitative analysis are needed. Recently, multilayer networks, a mathematical extension of traditional networks, have gained increasing popularity in neuroscience due to their ability to capture the full information of multi-model, multi-scale, spatiotemporal data sets. Here, we review multilayer networks and their applications in neuroscience, showing how incorporating the multilayer framework into network neuroscience analysis has uncovered previously hidden features of brain networks. We specifically highlight the use of multilayer networks to model disease, structure-function relationships, network evolution, and link multi-scale data. Finally, we close with a discussion of promising new directions of multilayer network neuroscience research and propose a modified definition of multilayer networks designed to unite and clarify the use of the multilayer formalism in describing real-world systems.

A multi-scale hybrid neural network retrieval model for dust storm detection, a study in Asia

NASA Astrophysics Data System (ADS)

Wong, Man Sing; Xiao, Fei; Nichol, Janet; Fung, Jimmy; Kim, Jhoon; Campbell, James; Chan, P. W.

2015-05-01

Dust storms are known to have adverse effects on human health and significant impact on weather, air quality, hydrological cycle, and ecosystem. Atmospheric dust loading is also one of the large uncertainties in global climate modeling, due to its significant impact on the radiation budget and atmospheric stability. Observations of dust storms in humid tropical south China (e.g. Hong Kong), are challenging due to high industrial pollution from the nearby Pearl River Delta region. This study develops a method for dust storm detection by combining ground station observations (PM10 concentration, AERONET data), geostationary satellite images (MTSAT), and numerical weather and climatic forecasting products (WRF/Chem). The method is based on a hybrid neural network (NN) retrieval model for two scales: (i) a NN model for near real-time detection of dust storms at broader regional scale; (ii) a NN model for detailed dust storm mapping for Hong Kong and Taiwan. A feed-forward multilayer perceptron (MLP) NN, trained using back propagation (BP) algorithm, was developed and validated by the k-fold cross validation approach. The accuracy of the near real-time detection MLP-BP network is 96.6%, and the accuracies for the detailed MLP-BP neural network for Hong Kong and Taiwan is 74.8%. This newly automated multi-scale hybrid method can be used to give advance near real-time mapping of dust storms for environmental authorities and the public. It is also beneficial for identifying spatial locations of adverse air quality conditions, and estimates of low visibility associated with dust events for port and airport authorities.

Nano-soldering of magnetically aligned three-dimensional nanowire networks.

PubMed

Gao, Fan; Gu, Zhiyong

2010-03-19

It is extremely challenging to fabricate 3D integrated nanostructures and hybrid nanoelectronic devices. In this paper, we report a simple and efficient method to simultaneously assemble and solder nanowires into ordered 3D and electrically conductive nanowire networks. Nano-solders such as tin were fabricated onto both ends of multi-segmented nanowires by a template-assisted electrodeposition method. These nanowires were then self-assembled and soldered into large-scale 3D network structures by magnetic field assisted assembly in a liquid medium with a high boiling point. The formation of junctions/interconnects between the nanowires and the scale of the assembly were dependent on the solder reflow temperature and the strength of the magnetic field. The size of the assembled nanowire networks ranged from tens of microns to millimeters. The electrical characteristics of the 3D nanowire networks were measured by regular current-voltage (I-V) measurements using a probe station with micropositioners. Nano-solders, when combined with assembling techniques, can be used to efficiently connect and join nanowires with low contact resistance, which are very well suited for sensor integration as well as nanoelectronic device fabrication.

Real-time object detection and semantic segmentation for autonomous driving

NASA Astrophysics Data System (ADS)

Li, Baojun; Liu, Shun; Xu, Weichao; Qiu, Wei

2018-02-01

In this paper, we proposed a Highly Coupled Network (HCNet) for joint objection detection and semantic segmentation. It follows that our method is faster and performs better than the previous approaches whose decoder networks of different tasks are independent. Besides, we present multi-scale loss architecture to learn better representation for different scale objects, but without extra time in the inference phase. Experiment results show that our method achieves state-of-the-art results on the KITTI datasets. Moreover, it can run at 35 FPS on a GPU and thus is a practical solution to object detection and semantic segmentation for autonomous driving.

Complex Networks, Fractals and Topology Trends for Oxidative Activity of DNA in Cells for Populations of Fluorescing Neutrophils in Medical Diagnostics

NASA Astrophysics Data System (ADS)

Galich, N. E.

A novel nonlinear statistical method of immunofluorescence data analysis is presented. The data of DNA fluorescence due to oxidative activity in neutrophils nuclei of peripheral blood is analyzed. Histograms of photon counts statistics are generated using flow cytometry method. The histograms represent the distributions of fluorescence flash frequency as functions of intensity for large populations∼104-105 of fluorescing cells. We have shown that these experiments present 3D-correlations of oxidative activity of DNA for full chromosomes set in cells with spatial resolution of measurements is about few nanometers in the flow direction the jet of blood. Detailed analysis showed that large-scale correlations in oxidative activity of DNA in cells are described as networks of small- worlds (complex systems with logarithmic scaling) with self own small-world networks for given donor at given time for all states of health. We observed changes in fractal networks of oxidative activity of DNA in neutrophils in vivo and during medical treatments for classification and diagnostics of pathologies for wide spectra of diseases. Our approach based on analysis of changes topology of networks (fractal dimension) at variation the scales of networks. We produce the general estimation of health status of a given donor in a form of yes/no of answers (healthy/sick) in the dependence on the sign of plus/minus in the trends change of fractal dimensions due to decreasing the scale of nets. We had noted the increasing biodiversity of neutrophils and stochastic (Brownian) character of intercellular correlations of different neutrophils in the blood of healthy donor. In the blood of sick people we observed the deterministic cell-cell correlations of neutrophils and decreasing their biodiversity.

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

Multi-Timescale Analysis of the Spatial Representativeness of In Situ Soil Moisture Data within Satellite Footprints

NASA Astrophysics Data System (ADS)

Molero, B.; Leroux, D. J.; Richaume, P.; Kerr, Y. H.; Merlin, O.; Cosh, M. H.; Bindlish, R.

2018-01-01

We conduct a novel comprehensive investigation that seeks to prove the connection between spatial scales and timescales in surface soil moisture (SM) within the satellite footprint ( 50 km). Modeled and measured point series at Yanco and Little Washita in situ networks are first decomposed into anomalies at timescales ranging from 0.5 to 128 days, using wavelet transforms. Then, their degree of spatial representativeness is evaluated on a per-timescale basis by comparison to large spatial scale data sets (the in situ spatial average, SMOS, AMSR2, and ECMWF). Four methods are used for this: temporal stability analysis (TStab), triple collocation (TC), percentage of correlated areas (CArea), and a new proposed approach that uses wavelet-based correlations (WCor). We found that the mean of the spatial representativeness values tends to increase with the timescale but so does their dispersion. Locations exhibit poor spatial representativeness at scales below 4 days, while either very good or poor representativeness at seasonal scales. Regarding the methods, TStab cannot be applied to the anomaly series due to their multiple zero-crossings, and TC is suitable for week and month scales but not for other scales where data set cross-correlations are found low. In contrast, WCor and CArea give consistent results at all timescales. WCor is less sensitive to the spatial sampling density, so it is a robust method that can be applied to sparse networks (one station per footprint). These results are promising to improve the validation and downscaling of satellite SM series and the optimization of SM networks.

Spatiotemporal Patterns, Monitoring Network Design, and Environmental Justice of Air Pollution in the Phoenix Metropolitan Region: A Landscape Approach

NASA Astrophysics Data System (ADS)

Pope, Ronald L.

Air pollution is a serious problem in most urban areas around the world, which has a number of negative ecological and human health impacts. As a result, it's vitally important to detect and characterize air pollutants to protect the health of the urban environment and our citizens. An important early step in this process is ensuring that the air pollution monitoring network is properly designed to capture the patterns of pollution and that all social demographics in the urban population are represented. An important aspect in characterizing air pollution patterns is scale in space and time which, along with pattern and process relationships, is a key subject in the field of landscape ecology. Thus, using multiple landscape ecological methods, this dissertation research begins by characterizing and quantifying the multi-scalar patterns of ozone (O3) and particulate matter (PM10) in the Phoenix, Arizona, metropolitan region. Results showed that pollution patterns are scale-dependent, O3 is a regionally-scaled pollutant at longer temporal scales, and PM10 is a locally-scaled pollutant with patterns sensitive to season. Next, this dissertation examines the monitoring network within Maricopa County. Using a novel multiscale indicator-based approach, the adequacy of the network was quantified by integrating inputs from various academic and government stakeholders. Furthermore, deficiencies were spatially defined and recommendations were made on how to strengthen the design of the network. A sustainability ranking system also provided new insight into the strengths and weaknesses of the network. Lastly, the study addresses the question of whether distinct social groups were experiencing inequitable exposure to pollutants - a key issue of distributive environmental injustice. A novel interdisciplinary method using multi-scalar ambient pollution data and hierarchical multiple regression models revealed environmental inequities between air pollutants and race, ethnicity, age, and socioeconomic classes. The results indicate that changing the scale of the analysis can change the equitable relationship between pollution and demographics. The scientific findings of the scale-dependent relationships among air pollution patterns, network design, and population demographics, brought to light through this study, can help policymakers make informed decisions for protecting the human health and the urban environment in the Phoenix metropolitan region and beyond.

Scaling Properties of Dimensionality Reduction for Neural Populations and Network Models

PubMed Central

Cowley, Benjamin R.; Doiron, Brent; Kohn, Adam

2016-01-01

Recent studies have applied dimensionality reduction methods to understand how the multi-dimensional structure of neural population activity gives rise to brain function. It is unclear, however, how the results obtained from dimensionality reduction generalize to recordings with larger numbers of neurons and trials or how these results relate to the underlying network structure. We address these questions by applying factor analysis to recordings in the visual cortex of non-human primates and to spiking network models that self-generate irregular activity through a balance of excitation and inhibition. We compared the scaling trends of two key outputs of dimensionality reduction—shared dimensionality and percent shared variance—with neuron and trial count. We found that the scaling properties of networks with non-clustered and clustered connectivity differed, and that the in vivo recordings were more consistent with the clustered network. Furthermore, recordings from tens of neurons were sufficient to identify the dominant modes of shared variability that generalize to larger portions of the network. These findings can help guide the interpretation of dimensionality reduction outputs in regimes of limited neuron and trial sampling and help relate these outputs to the underlying network structure. PMID:27926936

Determining geometric error model parameters of a terrestrial laser scanner through Two-face, Length-consistency, and Network methods

PubMed Central

Wang, Ling; Muralikrishnan, Bala; Rachakonda, Prem; Sawyer, Daniel

2017-01-01

Terrestrial laser scanners (TLS) are increasingly used in large-scale manufacturing and assembly where required measurement uncertainties are on the order of few tenths of a millimeter or smaller. In order to meet these stringent requirements, systematic errors within a TLS are compensated in-situ through self-calibration. In the Network method of self-calibration, numerous targets distributed in the work-volume are measured from multiple locations with the TLS to determine parameters of the TLS error model. In this paper, we propose two new self-calibration methods, the Two-face method and the Length-consistency method. The Length-consistency method is proposed as a more efficient way of realizing the Network method where the length between any pair of targets from multiple TLS positions are compared to determine TLS model parameters. The Two-face method is a two-step process. In the first step, many model parameters are determined directly from the difference between front-face and back-face measurements of targets distributed in the work volume. In the second step, all remaining model parameters are determined through the Length-consistency method. We compare the Two-face method, the Length-consistency method, and the Network method in terms of the uncertainties in the model parameters, and demonstrate the validity of our techniques using a calibrated scale bar and front-face back-face target measurements. The clear advantage of these self-calibration methods is that a reference instrument or calibrated artifacts are not required, thus significantly lowering the cost involved in the calibration process. PMID:28890607

Dynamic Pore-Scale Imaging of Reactive Transport in Heterogeneous Carbonates at Reservior Conditions

NASA Astrophysics Data System (ADS)

Menke, Hannah; Bijeljic, Branko; Andrew, Matthew; Blunt, Martin

2014-05-01

Sequestering carbon in deep geologic formations is one way of reducing anthropogenic CO2 emissions. Carbon capture, Utilization, and Storage (CCUS) in carbonate reservoirs has the added benefit of mobilizing more oil for extraction, increasing oil reservoir yield, and generating revenue while also mitigating climate change. The magnitude, speed, and type of dissolution are dependent the intrinsic properties of the rock. Understanding how small changes in the pore structure affect dissolution is paramount for successful predictive modelling both on the pore-scale and for up-scaled reservoir simulations. We propose an experimental method whereby both 'Pink Beam' synchrotron radiation and a Micro-CT lab source are used in dynamic X-ray microtomography to investigate the pore structure changes in carbonate rocks of varying heterogeneity at high temperatures and pressures. Four carbonate rock types were studied, two relatively homogeneous carbonates, Ketton and Mt. Gambier, and two very heterogeneous carbonates, Estalliades and Portland Basebed. Each rock type was imaged under the same reservoir and flow conditions to gain insight into the impact of heterogeneity. A 4-mm carbonate core was injected with CO2-saturated brine at 10 MPa and 50oC for 2 hours. Depending on sample heterogeneity and X-ray source, tomographic images were taken at between 30-second and 20-minute time-resolutions and a 4-micron spatial resolution during injection. Changes in porosity, permeability, and structure were obtained by first binning and filtering the images, then binarizing them with watershed segmentation, and finally extracting a pore/throat network. Furthermore, pore-scale flow modelling was performed directly on the binarized image and used to track velocity distributions as the pore network evolved. Significant differences in dissolution type and magnitude were found for each rock type. The most homogeneous carbonate, Ketton, was seen to have predominately uniform dissolution with minor dissolution rate differences between the pores and pore throats. This was not true for the heterogeneous carbonates, Estalliades and Portland Basebed, which formed wormholes. Pore-scale modelling of flow directly on the voxels showed the differences in the evolution of complex flow fields with changes in dissolution regime. The PDFs of normalized velocity for uniform dissolution showed that the maximum pore velocity within the system decreased as dissolution occurred. This is due to dissolution enlarging pores and pore throats. However, in the wormholing regime, there was a large increase in maximum velocity once the wormhole broke through the length of the core and a preferential flow path was created. Additionally, this study serves as a unique benchmark for pore-scale reactive transport modelling directly on the binarized Micro-CT images. This dynamic pore-scale imaging method offers advantages in helping fully explain the dominant physical and chemical processes at the pore scale so that they may be up-scaled to the reservoir scale for increased accuracy in model prediction.

The Use of Weighted Graphs for Large-Scale Genome Analysis

PubMed Central

Zhou, Fang; Toivonen, Hannu; King, Ross D.

2014-01-01

There is an acute need for better tools to extract knowledge from the growing flood of sequence data. For example, thousands of complete genomes have been sequenced, and their metabolic networks inferred. Such data should enable a better understanding of evolution. However, most existing network analysis methods are based on pair-wise comparisons, and these do not scale to thousands of genomes. Here we propose the use of weighted graphs as a data structure to enable large-scale phylogenetic analysis of networks. We have developed three types of weighted graph for enzymes: taxonomic (these summarize phylogenetic importance), isoenzymatic (these summarize enzymatic variety/redundancy), and sequence-similarity (these summarize sequence conservation); and we applied these types of weighted graph to survey prokaryotic metabolism. To demonstrate the utility of this approach we have compared and contrasted the large-scale evolution of metabolism in Archaea and Eubacteria. Our results provide evidence for limits to the contingency of evolution. PMID:24619061

Investigation of Social Studies Teachers' Intended Uses of Social Networks in Terms of Various Variables

ERIC Educational Resources Information Center

Akgün, Ismail Hakan

2016-01-01

The aim of this research is to determine Social Studies teacher candidates' intended uses of social networks in terms of various variables. The research was carried out by using screening model of quantitative research methods. In the study, "The Social Network Intended Use Scale" was used as a data collection tool. As a result of the…

Insights and Challenges to Integrating Data from Diverse Ecological Networks

NASA Astrophysics Data System (ADS)

Peters, D. P. C.

2014-12-01

Many of the most dramatic and surprising effects of global change occur across large spatial extents, from regions to continents, that impact multiple ecosystem types across a range of interacting spatial and temporal scales. The ability of ecologists and inter-disciplinary scientists to understand and predict these dynamics depend, in large part, on existing site-based research infrastructures that developed in response to historic events. Integrating these diverse sources of data is critical to addressing these broad-scale questions. A conceptual approach is presented to synthesize and integrate diverse sources and types of data from different networks of research sites. This approach focuses on developing derived data products through spatial and temporal aggregation that allow datasets collected with different methods to be compared. The approach is illustrated through the integration, analysis, and comparison of hundreds of long-term datasets from 50 ecological sites in the US that represent ecosystem types commonly found globally. New insights were found by comparing multiple sites using common derived data. In addition to "bringing to light" many dark data in a standardized, open access, easy-to-use format, a suite of lessons were learned that can be applied to up and coming research networks in the US and internationally. These lessons will be described along with the challenges, including cyber-infrastructure, cultural, and behavioral constraints associated with the use of big and little data, that may keep ecologists and inter-disciplinary scientists from taking full advantage of the vast amounts of existing and yet-to-be exposed data.

A multidisciplinary approach to the development of low-cost high-performance lightwave networks

NASA Technical Reports Server (NTRS)

Maitan, Jacek; Harwit, Alex

1991-01-01

Our research focuses on high-speed distributed systems. We anticipate that our results will allow the fabrication of low-cost networks employing multi-gigabit-per-second data links for space and military applications. The recent development of high-speed low-cost photonic components and new generations of microprocessors creates an opportunity to develop advanced large-scale distributed information systems. These systems currently involve hundreds of thousands of nodes and are made up of components and communications links that may fail during operation. In order to realize these systems, research is needed into technologies that foster adaptability and scaleability. Self-organizing mechanisms are needed to integrate a working fabric of large-scale distributed systems. The challenge is to fuse theory, technology, and development methodologies to construct a cost-effective, efficient, large-scale system.

Analysis of the structure of complex networks at different resolution levels

NASA Astrophysics Data System (ADS)

Arenas, A.; Fernández, A.; Gómez, S.

2008-05-01

Modular structure is ubiquitous in real-world complex networks, and its detection is important because it gives insights into the structure-functionality relationship. The standard approach is based on the optimization of a quality function, modularity, which is a relative quality measure for the partition of a network into modules. Recently, some authors (Fortunato and Barthélemy 2007 Proc. Natl Acad. Sci. USA 104 36 and Kumpula et al 2007 Eur. Phys. J. B 56 41) have pointed out that the optimization of modularity has a fundamental drawback: the existence of a resolution limit beyond which no modular structure can be detected even though these modules might have their own entity. The reason is that several topological descriptions of the network coexist at different scales, which is, in general, a fingerprint of complex systems. Here, we propose a method that allows for multiple resolution screening of the modular structure. The method has been validated using synthetic networks, discovering the predefined structures at all scales. Its application to two real social networks allows us to find the exact splits reported in the literature, as well as the substructure beyond the actual split.

An efficient graph theory based method to identify every minimal reaction set in a metabolic network

PubMed Central

2014-01-01

Background Development of cells with minimal metabolic functionality is gaining importance due to their efficiency in producing chemicals and fuels. Existing computational methods to identify minimal reaction sets in metabolic networks are computationally expensive. Further, they identify only one of the several possible minimal reaction sets. Results In this paper, we propose an efficient graph theory based recursive optimization approach to identify all minimal reaction sets. Graph theoretical insights offer systematic methods to not only reduce the number of variables in math programming and increase its computational efficiency, but also provide efficient ways to find multiple optimal solutions. The efficacy of the proposed approach is demonstrated using case studies from Escherichia coli and Saccharomyces cerevisiae. In case study 1, the proposed method identified three minimal reaction sets each containing 38 reactions in Escherichia coli central metabolic network with 77 reactions. Analysis of these three minimal reaction sets revealed that one of them is more suitable for developing minimal metabolism cell compared to other two due to practically achievable internal flux distribution. In case study 2, the proposed method identified 256 minimal reaction sets from the Saccharomyces cerevisiae genome scale metabolic network with 620 reactions. The proposed method required only 4.5 hours to identify all the 256 minimal reaction sets and has shown a significant reduction (approximately 80%) in the solution time when compared to the existing methods for finding minimal reaction set. Conclusions Identification of all minimal reactions sets in metabolic networks is essential since different minimal reaction sets have different properties that effect the bioprocess development. The proposed method correctly identified all minimal reaction sets in a both the case studies. The proposed method is computationally efficient compared to other methods for finding minimal reaction sets and useful to employ with genome-scale metabolic networks. PMID:24594118

Development of methods for the decrease in instability of recycling water of conjugated closed-circuit cooling system of HPP

NASA Astrophysics Data System (ADS)

Chichirov, A. A.; Chichirova, N. D.; Vlasov, S. M.; Lyapin, A. I.; Misbakhov, R. Sh.; Silov, I. Yu.; Murtazin, A. I.

2016-10-01

On Russian HPPs, conjugated closed-circuit cooling systems, where purge water is used as initial for water-treatment facilities, are widespread. For this reason, it is impossible to use general methods for the stabilization treatment of recycling water in order to prevent scale formation in the units of a system, namely, turbine condensers and cooling towers. In this paper, the methods for the decrease in the instability of recycling water using the methods of chemical engineering, such as stabilization and synchronization of flows and organization of recycles, are suggested. The results of an industrial experiment on the implementation of stabilization treatment of recycling water by the organization of recycle are given. The experiment was carried out on Kazan CHPP-3. The flow scheme involved the recycle of chemically purified water (CPW) for the heat network make-up to the closed-circuit cooling system. The experiment was carried out at three stages with the gradual change of the consumption of the recycle, namely, 0, 50, and 100 t/h. According to the results of experiments, the reliable decrease in the rate of the sedimentation was recorded on the units of the system, namely, turbine condenser and chimney-type cooling tower. This is caused by two reasons. Firstly, this is periodic excessive concentration of recycling water due to the nonstationary character of inlet and outlet flows. Secondly, this is seasonal (particularly, in the summer period) exceeding of the evaporation coefficient. As a result of stabilization and synchronization of flows and organization of recycles, the quality of clarified and chemically purified water for the heat network make-up increases and the corrosion of iron- and copper-containing structural materials decreases. A natural decrease in temperature drop on the operating turbine condensers is mentioned.

Consensus between Pipelines in Structural Brain Networks

PubMed Central

Parker, Christopher S.; Deligianni, Fani; Cardoso, M. Jorge; Daga, Pankaj; Modat, Marc; Dayan, Michael; Clark, Chris A.

2014-01-01

Structural brain networks may be reconstructed from diffusion MRI tractography data and have great potential to further our understanding of the topological organisation of brain structure in health and disease. Network reconstruction is complex and involves a series of processesing methods including anatomical parcellation, registration, fiber orientation estimation and whole-brain fiber tractography. Methodological choices at each stage can affect the anatomical accuracy and graph theoretical properties of the reconstructed networks, meaning applying different combinations in a network reconstruction pipeline may produce substantially different networks. Furthermore, the choice of which connections are considered important is unclear. In this study, we assessed the similarity between structural networks obtained using two independent state-of-the-art reconstruction pipelines. We aimed to quantify network similarity and identify the core connections emerging most robustly in both pipelines. Similarity of network connections was compared between pipelines employing different atlases by merging parcels to a common and equivalent node scale. We found a high agreement between the networks across a range of fiber density thresholds. In addition, we identified a robust core of highly connected regions coinciding with a peak in similarity across network density thresholds, and replicated these results with atlases at different node scales. The binary network properties of these core connections were similar between pipelines but showed some differences in atlases across node scales. This study demonstrates the utility of applying multiple structural network reconstrution pipelines to diffusion data in order to identify the most important connections for further study. PMID:25356977

The Multi-Scale Network Landscape of Collaboration.

PubMed

Bae, Arram; Park, Doheum; Ahn, Yong-Yeol; Park, Juyong

2016-01-01

Propelled by the increasing availability of large-scale high-quality data, advanced data modeling and analysis techniques are enabling many novel and significant scientific understanding of a wide range of complex social, natural, and technological systems. These developments also provide opportunities for studying cultural systems and phenomena--which can be said to refer to all products of human creativity and way of life. An important characteristic of a cultural product is that it does not exist in isolation from others, but forms an intricate web of connections on many levels. In the creation and dissemination of cultural products and artworks in particular, collaboration and communication of ideas play an essential role, which can be captured in the heterogeneous network of the creators and practitioners of art. In this paper we propose novel methods to analyze and uncover meaningful patterns from such a network using the network of western classical musicians constructed from a large-scale comprehensive Compact Disc recordings data. We characterize the complex patterns in the network landscape of collaboration between musicians across multiple scales ranging from the macroscopic to the mesoscopic and microscopic that represent the diversity of cultural styles and the individuality of the artists.

The Multi-Scale Network Landscape of Collaboration

PubMed Central

Ahn, Yong-Yeol; Park, Juyong

2016-01-01

Propelled by the increasing availability of large-scale high-quality data, advanced data modeling and analysis techniques are enabling many novel and significant scientific understanding of a wide range of complex social, natural, and technological systems. These developments also provide opportunities for studying cultural systems and phenomena—which can be said to refer to all products of human creativity and way of life. An important characteristic of a cultural product is that it does not exist in isolation from others, but forms an intricate web of connections on many levels. In the creation and dissemination of cultural products and artworks in particular, collaboration and communication of ideas play an essential role, which can be captured in the heterogeneous network of the creators and practitioners of art. In this paper we propose novel methods to analyze and uncover meaningful patterns from such a network using the network of western classical musicians constructed from a large-scale comprehensive Compact Disc recordings data. We characterize the complex patterns in the network landscape of collaboration between musicians across multiple scales ranging from the macroscopic to the mesoscopic and microscopic that represent the diversity of cultural styles and the individuality of the artists. PMID:26990088

Extraction of drainage networks from large terrain datasets using high throughput computing

NASA Astrophysics Data System (ADS)

Gong, Jianya; Xie, Jibo

2009-02-01

Advanced digital photogrammetry and remote sensing technology produces large terrain datasets (LTD). How to process and use these LTD has become a big challenge for GIS users. Extracting drainage networks, which are basic for hydrological applications, from LTD is one of the typical applications of digital terrain analysis (DTA) in geographical information applications. Existing serial drainage algorithms cannot deal with large data volumes in a timely fashion, and few GIS platforms can process LTD beyond the GB size. High throughput computing (HTC), a distributed parallel computing mode, is proposed to improve the efficiency of drainage networks extraction from LTD. Drainage network extraction using HTC involves two key issues: (1) how to decompose the large DEM datasets into independent computing units and (2) how to merge the separate outputs into a final result. A new decomposition method is presented in which the large datasets are partitioned into independent computing units using natural watershed boundaries instead of using regular 1-dimensional (strip-wise) and 2-dimensional (block-wise) decomposition. Because the distribution of drainage networks is strongly related to watershed boundaries, the new decomposition method is more effective and natural. The method to extract natural watershed boundaries was improved by using multi-scale DEMs instead of single-scale DEMs. A HTC environment is employed to test the proposed methods with real datasets.

Extraction of Built-Up Areas Using Convolutional Neural Networks and Transfer Learning from SENTINEL-2 Satellite Images

NASA Astrophysics Data System (ADS)

Bramhe, V. S.; Ghosh, S. K.; Garg, P. K.

2018-04-01

With rapid globalization, the extent of built-up areas is continuously increasing. Extraction of features for classifying built-up areas that are more robust and abstract is a leading research topic from past many years. Although, various studies have been carried out where spatial information along with spectral features has been utilized to enhance the accuracy of classification. Still, these feature extraction techniques require a large number of user-specific parameters and generally application specific. On the other hand, recently introduced Deep Learning (DL) techniques requires less number of parameters to represent more abstract aspects of the data without any manual effort. Since, it is difficult to acquire high-resolution datasets for applications that require large scale monitoring of areas. Therefore, in this study Sentinel-2 image has been used for built-up areas extraction. In this work, pre-trained Convolutional Neural Networks (ConvNets) i.e. Inception v3 and VGGNet are employed for transfer learning. Since these networks are trained on generic images of ImageNet dataset which are having very different characteristics from satellite images. Therefore, weights of networks are fine-tuned using data derived from Sentinel-2 images. To compare the accuracies with existing shallow networks, two state of art classifiers i.e. Gaussian Support Vector Machine (SVM) and Back-Propagation Neural Network (BP-NN) are also implemented. Both SVM and BP-NN gives 84.31 % and 82.86 % overall accuracies respectively. Inception-v3 and VGGNet gives 89.43 % of overall accuracy using fine-tuned VGGNet and 92.10 % when using Inception-v3. The results indicate high accuracy of proposed fine-tuned ConvNets on a 4-channel Sentinel-2 dataset for built-up area extraction.

A small-scale, rolled-membrane microfluidic artificial lung designed towards future large area manufacturing.

PubMed

Thompson, A J; Marks, L H; Goudie, M J; Rojas-Pena, A; Handa, H; Potkay, J A

2017-03-01

Artificial lungs have been used in the clinic for multiple decades to supplement patient pulmonary function. Recently, small-scale microfluidic artificial lungs (μAL) have been demonstrated with large surface area to blood volume ratios, biomimetic blood flow paths, and pressure drops compatible with pumpless operation. Initial small-scale microfluidic devices with blood flow rates in the μ l/min to ml/min range have exhibited excellent gas transfer efficiencies; however, current manufacturing techniques may not be suitable for scaling up to human applications. Here, we present a new manufacturing technology for a microfluidic artificial lung in which the structure is assembled via a continuous "rolling" and bonding procedure from a single, patterned layer of polydimethyl siloxane (PDMS). This method is demonstrated in a small-scale four-layer device, but is expected to easily scale to larger area devices. The presented devices have a biomimetic branching blood flow network, 10  μ m tall artificial capillaries, and a 66  μ m thick gas transfer membrane. Gas transfer efficiency in blood was evaluated over a range of blood flow rates (0.1-1.25 ml/min) for two different sweep gases (pure O 2 , atmospheric air). The achieved gas transfer data closely follow predicted theoretical values for oxygenation and CO 2 removal, while pressure drop is marginally higher than predicted. This work is the first step in developing a scalable method for creating large area microfluidic artificial lungs. Although designed for microfluidic artificial lungs, the presented technique is expected to result in the first manufacturing method capable of simply and easily creating large area microfluidic devices from PDMS.

The missing link: leadership, identity, and the social brain.

PubMed

van Vugt, Mark

2012-05-01

How the cohesion of a social network is being maintained in spite of having different layers of social interaction is an important question. I argue that the evolution of both (political) hierarchy and social identity play a crucial role in scaling up and bonding social networks. Together they are missing links in the social brain hypothesis, and further research is needed to understand the functions of leadership and social identity. ©2011 The British Psychological Society.

The complexity of classical music networks

NASA Astrophysics Data System (ADS)

Rolla, Vitor; Kestenberg, Juliano; Velho, Luiz

2018-02-01

Previous works suggest that musical networks often present the scale-free and the small-world properties. From a musician's perspective, the most important aspect missing in those studies was harmony. In addition to that, the previous works made use of outdated statistical methods. Traditionally, least-squares linear regression is utilised to fit a power law to a given data set. However, according to Clauset et al. such a traditional method can produce inaccurate estimates for the power law exponent. In this paper, we present an analysis of musical networks which considers the existence of chords (an essential element of harmony). Here we show that only 52.5% of music in our database presents the scale-free property, while 62.5% of those pieces present the small-world property. Previous works argue that music is highly scale-free; consequently, it sounds appealing and coherent. In contrast, our results show that not all pieces of music present the scale-free and the small-world properties. In summary, this research is focused on the relationship between musical notes (Do, Re, Mi, Fa, Sol, La, Si, and their sharps) and accompaniment in classical music compositions. More information about this research project is available at https://eden.dei.uc.pt/~vitorgr/MS.html.

A method for validating Rent's rule for technological and biological networks.

PubMed

Alcalde Cuesta, Fernando; González Sequeiros, Pablo; Lozano Rojo, Álvaro

2017-07-14

Rent's rule is empirical power law introduced in an effort to describe and optimize the wiring complexity of computer logic graphs. It is known that brain and neuronal networks also obey Rent's rule, which is consistent with the idea that wiring costs play a fundamental role in brain evolution and development. Here we propose a method to validate this power law for a certain range of network partitions. This method is based on the bifurcation phenomenon that appears when the network is subjected to random alterations preserving its degree distribution. It has been tested on a set of VLSI circuits and real networks, including biological and technological ones. We also analyzed the effect of different types of random alterations on the Rentian scaling in order to test the influence of the degree distribution. There are network architectures quite sensitive to these randomization procedures with significant increases in the values of the Rent exponents.

Finding elementary flux modes in metabolic networks based on flux balance analysis and flux coupling analysis: application to the analysis of Escherichia coli metabolism.

PubMed

Tabe-Bordbar, Shayan; Marashi, Sayed-Amir

2013-12-01

Elementary modes (EMs) are steady-state metabolic flux vectors with minimal set of active reactions. Each EM corresponds to a metabolic pathway. Therefore, studying EMs is helpful for analyzing the production of biotechnologically important metabolites. However, memory requirements for computing EMs may hamper their applicability as, in most genome-scale metabolic models, no EM can be computed due to running out of memory. In this study, we present a method for computing randomly sampled EMs. In this approach, a network reduction algorithm is used for EM computation, which is based on flux balance-based methods. We show that this approach can be used to recover the EMs in the medium- and genome-scale metabolic network models, while the EMs are sampled in an unbiased way. The applicability of such results is shown by computing “estimated” control-effective flux values in Escherichia coli metabolic network.

ACCURATE CHEMICAL MASTER EQUATION SOLUTION USING MULTI-FINITE BUFFERS

PubMed Central

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-01-01

The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multi-scale nature of many networks where reaction rates have large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the Accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multi-finite buffers for reducing the state space by O(n!), exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes, and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be pre-computed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multi-scale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks. PMID:27761104

Taxonomy and clustering in collaborative systems: The case of the on-line encyclopedia Wikipedia

NASA Astrophysics Data System (ADS)

Capocci, A.; Rao, F.; Caldarelli, G.

2008-01-01

In this paper we investigate the nature and structure of the relation between imposed classifications and real clustering in a particular case of a scale-free network given by the on-line encyclopedia Wikipedia. We find a statistical similarity in the distributions of community sizes both by using the top-down approach of the categories division present in the archive and in the bottom-up procedure of community detection given by an algorithm based on the spectral properties of the graph. Regardless of the statistically similar behaviour, the two methods provide a rather different division of the articles, thereby signaling that the nature and presence of power laws is a general feature for these systems and cannot be used as a benchmark to evaluate the suitability of a clustering method.

Learning about memory from (very) large scale hippocampal networks

NASA Astrophysics Data System (ADS)

Meshulam, Leenoy; Gauthier, Jeffrey; Brody, Carlos; Tank, David; Bialek, William

Recent technological progress has dramatically increased our access to the neural activity underlying memory-related tasks. These complex high-dimensional data call for theories that allow us to identify signatures of collective activity in the networks that are crucial for the emergence of cognitive functions. As an example, we study the neural activity in dorsal hippocampus as a mouse runs along a virtual linear track. One of the dominant features of this data is the activity of place cells, which fire when the animal visits particular locations. During the first stage of our work we used a maximum entropy framework to characterize the probability distribution of the joint activity patterns observed across ensembles of up to 100 cells. These models, which are equivalent to Ising models with competing interactions, make surprisingly accurate predictions for the activity of individual neurons given the state of the rest of the network, and this is true both for place cells and for non-place cells. Additionally, the model captures the high-order structure in the data, which cannot be explained by place-related activity alone. For the second stage of our work we study networks of 2000 neurons. To address this much larger system, we are exploring different methods of coarse graining, in the spirit of the renormalization group, searching for simplified models.

Conceptualizing and Advancing Research Networking Systems

PubMed Central

SCHLEYER, TITUS; BUTLER, BRIAN S.; SONG, MEI; SPALLEK, HEIKO

2013-01-01

Science in general, and biomedical research in particular, is becoming more collaborative. As a result, collaboration with the right individuals, teams, and institutions is increasingly crucial for scientific progress. We propose Research Networking Systems (RNS) as a new type of system designed to help scientists identify and choose collaborators, and suggest a corresponding research agenda. The research agenda covers four areas: foundations, presentation, architecture, and evaluation. Foundations includes project-, institution- and discipline-specific motivational factors; the role of social networks; and impression formation based on information beyond expertise and interests. Presentation addresses representing expertise in a comprehensive and up-to-date manner; the role of controlled vocabularies and folksonomies; the tension between seekers’ need for comprehensive information and potential collaborators’ desire to control how they are seen by others; and the need to support serendipitous discovery of collaborative opportunities. Architecture considers aggregation and synthesis of information from multiple sources, social system interoperability, and integration with the user’s primary work context. Lastly, evaluation focuses on assessment of collaboration decisions, measurement of user-specific costs and benefits, and how the large-scale impact of RNS could be evaluated with longitudinal and naturalistic methods. We hope that this article stimulates the human-computer interaction, computer-supported cooperative work, and related communities to pursue a broad and comprehensive agenda for developing research networking systems. PMID:24376309

Conceptualizing and Advancing Research Networking Systems.

PubMed

Schleyer, Titus; Butler, Brian S; Song, Mei; Spallek, Heiko

2012-03-01

Science in general, and biomedical research in particular, is becoming more collaborative. As a result, collaboration with the right individuals, teams, and institutions is increasingly crucial for scientific progress. We propose Research Networking Systems (RNS) as a new type of system designed to help scientists identify and choose collaborators, and suggest a corresponding research agenda. The research agenda covers four areas: foundations, presentation, architecture , and evaluation . Foundations includes project-, institution- and discipline-specific motivational factors; the role of social networks; and impression formation based on information beyond expertise and interests. Presentation addresses representing expertise in a comprehensive and up-to-date manner; the role of controlled vocabularies and folksonomies; the tension between seekers' need for comprehensive information and potential collaborators' desire to control how they are seen by others; and the need to support serendipitous discovery of collaborative opportunities. Architecture considers aggregation and synthesis of information from multiple sources, social system interoperability, and integration with the user's primary work context. Lastly, evaluation focuses on assessment of collaboration decisions, measurement of user-specific costs and benefits, and how the large-scale impact of RNS could be evaluated with longitudinal and naturalistic methods. We hope that this article stimulates the human-computer interaction, computer-supported cooperative work, and related communities to pursue a broad and comprehensive agenda for developing research networking systems.

Discriminative graph embedding for label propagation.

PubMed

Nguyen, Canh Hao; Mamitsuka, Hiroshi

2011-09-01

In many applications, the available information is encoded in graph structures. This is a common problem in biological networks, social networks, web communities and document citations. We investigate the problem of classifying nodes' labels on a similarity graph given only a graph structure on the nodes. Conventional machine learning methods usually require data to reside in some Euclidean spaces or to have a kernel representation. Applying these methods to nodes on graphs would require embedding the graphs into these spaces. By embedding and then learning the nodes on graphs, most methods are either flexible with different learning objectives or efficient enough for large scale applications. We propose a method to embed a graph into a feature space for a discriminative purpose. Our idea is to include label information into the embedding process, making the space representation tailored to the task. We design embedding objective functions that the following learning formulations become spectral transforms. We then reformulate these spectral transforms into multiple kernel learning problems. Our method, while being tailored to the discriminative tasks, is efficient and can scale to massive data sets. We show the need of discriminative embedding on some simulations. Applying to biological network problems, our method is shown to outperform baselines.

Scale-Up Method for the Shock Compaction of Powders

NASA Astrophysics Data System (ADS)

Carton, E. P.; Stuivinga, M.

2004-07-01

Shock wave compaction in the cylindrical configuration lends itself to be scaled-up for small-scale industrial applications. While scaling up in the axial direction is easy, scaling up in the lateral direction is less straightforward and may lead to cracks in the center. A different scale up method is presented here; aluminum tubes are filled with the powder to be compacted and placed in a circle inside a large metal tube, with a metal shock wave reflector in the center. The space in between is filled with an inert powder medium: alumina, salt or sand. It is found that salt is the best medium for the integrity of the aluminum tube and for the ease of removal of the aluminum tube out of the (densified) powder medium. Experimental results of (slightly ellipsoidal) shock compacted tubes that are produced this way are shown as an example. In the case of B4C, after infiltration with the aluminum of the tube, fully dense cermet compacts without any cracks are thus produced, batch by batch.

Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition.

PubMed

Hébert-Dufresne, Laurent; Grochow, Joshua A; Allard, Antoine

2016-08-18

We introduce a network statistic that measures structural properties at the micro-, meso-, and macroscopic scales, while still being easy to compute and interpretable at a glance. Our statistic, the onion spectrum, is based on the onion decomposition, which refines the k-core decomposition, a standard network fingerprinting method. The onion spectrum is exactly as easy to compute as the k-cores: It is based on the stages at which each vertex gets removed from a graph in the standard algorithm for computing the k-cores. Yet, the onion spectrum reveals much more information about a network, and at multiple scales; for example, it can be used to quantify node heterogeneity, degree correlations, centrality, and tree- or lattice-likeness. Furthermore, unlike the k-core decomposition, the combined degree-onion spectrum immediately gives a clear local picture of the network around each node which allows the detection of interesting subgraphs whose topological structure differs from the global network organization. This local description can also be leveraged to easily generate samples from the ensemble of networks with a given joint degree-onion distribution. We demonstrate the utility of the onion spectrum for understanding both static and dynamic properties on several standard graph models and on many real-world networks.

Reverse engineering and analysis of large genome-scale gene networks

PubMed Central

Aluru, Maneesha; Zola, Jaroslaw; Nettleton, Dan; Aluru, Srinivas

2013-01-01

Reverse engineering the whole-genome networks of complex multicellular organisms continues to remain a challenge. While simpler models easily scale to large number of genes and gene expression datasets, more accurate models are compute intensive limiting their scale of applicability. To enable fast and accurate reconstruction of large networks, we developed Tool for Inferring Network of Genes (TINGe), a parallel mutual information (MI)-based program. The novel features of our approach include: (i) B-spline-based formulation for linear-time computation of MI, (ii) a novel algorithm for direct permutation testing and (iii) development of parallel algorithms to reduce run-time and facilitate construction of large networks. We assess the quality of our method by comparison with ARACNe (Algorithm for the Reconstruction of Accurate Cellular Networks) and GeneNet and demonstrate its unique capability by reverse engineering the whole-genome network of Arabidopsis thaliana from 3137 Affymetrix ATH1 GeneChips in just 9 min on a 1024-core cluster. We further report on the development of a new software Gene Network Analyzer (GeNA) for extracting context-specific subnetworks from a given set of seed genes. Using TINGe and GeNA, we performed analysis of 241 Arabidopsis AraCyc 8.0 pathways, and the results are made available through the web. PMID:23042249

Performance optimization of internet firewalls

NASA Astrophysics Data System (ADS)

Chiueh, Tzi-cker; Ballman, Allen

1997-01-01

Internet firewalls control the data traffic in and out of an enterprise network by checking network packets against a set of rules that embodies an organization's security policy. Because rule checking is computationally more expensive than routing-table look-up, it could become a potential bottleneck for scaling up the performance of IP routers, which typically implement firewall functions in software. in this paper, we analyzed the performance problems associated with firewalls, particularly packet filters, propose a good connection cache to amortize the costly security check over the packets in a connection, and report the preliminary performance results of a trace-driven simulation that show the average packet check time can be reduced by a factor of 2.5 at the least.

A Scalable Approach to Probabilistic Latent Space Inference of Large-Scale Networks

PubMed Central

Yin, Junming; Ho, Qirong; Xing, Eric P.

2014-01-01

We propose a scalable approach for making inference about latent spaces of large networks. With a succinct representation of networks as a bag of triangular motifs, a parsimonious statistical model, and an efficient stochastic variational inference algorithm, we are able to analyze real networks with over a million vertices and hundreds of latent roles on a single machine in a matter of hours, a setting that is out of reach for many existing methods. When compared to the state-of-the-art probabilistic approaches, our method is several orders of magnitude faster, with competitive or improved accuracy for latent space recovery and link prediction. PMID:25400487

Pedestrian simulation and distribution in urban space based on visibility analysis and agent simulation

NASA Astrophysics Data System (ADS)

Ying, Shen; Li, Lin; Gao, Yurong

2009-10-01

Spatial visibility analysis is the important direction of pedestrian behaviors because our visual conception in space is the straight method to get environment information and navigate your actions. Based on the agent modeling and up-tobottom method, the paper develop the framework about the analysis of the pedestrian flow depended on visibility. We use viewshed in visibility analysis and impose the parameters on agent simulation to direct their motion in urban space. We analyze the pedestrian behaviors in micro-scale and macro-scale of urban open space. The individual agent use visual affordance to determine his direction of motion in micro-scale urban street on district. And we compare the distribution of pedestrian flow with configuration in macro-scale urban environment, and mine the relationship between the pedestrian flow and distribution of urban facilities and urban function. The paper first computes the visibility situations at the vantage point in urban open space, such as street network, quantify the visibility parameters. The multiple agents use visibility parameters to decide their direction of motion, and finally pedestrian flow reach to a stable state in urban environment through the simulation of multiple agent system. The paper compare the morphology of visibility parameters and pedestrian distribution with urban function and facilities layout to confirm the consistence between them, which can be used to make decision support in urban design.

Engineering a Blood Vessel Network Module for Body-on-a-Chip Applications.

PubMed

Ryu, Hyunryul; Oh, Soojung; Lee, Hyun Jae; Lee, Jin Young; Lee, Hae Kwang; Jeon, Noo Li

2015-06-01

The blood circulatory system links all organs from one to another to support and maintain each organ's functions consistently. Therefore, blood vessels have been considered as a vital unit. Engineering perfusable functional blood vessels in vitro has been challenging due to difficulties in designing the connection between rigid macroscale tubes and fragile microscale ones. Here, we propose a generalizable method to engineer a "long" perfusable blood vessel network. To form millimeter-scale vessels, fibroblasts were co-cultured with human umbilical vein endothelial cells (HUVECs) in close proximity. In contrast to previous works, in which all cells were permanently placed within the device, we developed a novel method to culture paracrine factor secreting fibroblasts on an O-ring-shaped guide that can be transferred in and out. This approach affords flexibility in co-culture, where the effects of secreted factors can be decoupled. Using this, blood vessels with length up to 2 mm were successfully produced in a reproducible manner (>90%). Because the vessels form a perfusable network within the channel, simple links to inlets and outlets of the device allowed connections to the outside world. The robust and reproducible formation of in vitro engineered vessels can be used as a module to link various organ components as parts of future body-on-a-chip applications. © 2014 Society for Laboratory Automation and Screening.

Design of physical and logical topologies with fault-tolerant ability in wavelength-routed optical network

NASA Astrophysics Data System (ADS)

Chen, Chunfeng; Liu, Hua; Fan, Ge

2005-02-01

In this paper we consider the problem of designing a network of optical cross-connects(OXCs) to provide end-to-end lightpath services to label switched routers (LSRs). Like some previous work, we select the number of OXCs as our objective. Compared with the previous studies, we take into account the fault-tolerant characteristic of logical topology. First of all, using a Prufer number randomly generated, we generate a tree. By adding some edges to the tree, we can obtain a physical topology which consists of a certain number of OXCs and fiber links connecting OXCs. It is notable that we for the first time limit the number of layers of the tree produced according to the method mentioned above. Then we design the logical topologies based on the physical topologies mentioned above. In principle, we will select the shortest path in addition to some consideration on the load balancing of links and the limitation owing to the SRLG. Notably, we implement the routing algorithm for the nodes in increasing order of the degree of the nodes. With regarding to the problem of the wavelength assignment, we adopt the heuristic algorithm of the graph coloring commonly used. It is clear our problem is computationally intractable especially when the scale of the network is large. We adopt the taboo search algorithm to find the near optimal solution to our objective. We present numerical results for up to 1000 LSRs and for a wide range of system parameters such as the number of wavelengths supported by each fiber link and traffic. The results indicate that it is possible to build large-scale optical networks with rich connectivity in a cost-effective manner, using relatively few but properly dimensioned OXCs.

In-Memory Graph Databases for Web-Scale Data

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

Castellana, Vito G.; Morari, Alessandro; Weaver, Jesse R.

RDF databases have emerged as one of the most relevant way for organizing, integrating, and managing expo- nentially growing, often heterogeneous, and not rigidly structured data for a variety of scientific and commercial fields. In this paper we discuss the solutions integrated in GEMS (Graph database Engine for Multithreaded Systems), a software framework for implementing RDF databases on commodity, distributed-memory high-performance clusters. Unlike the majority of current RDF databases, GEMS has been designed from the ground up to primarily employ graph-based methods. This is reflected in all the layers of its stack. The GEMS framework is composed of: a SPARQL-to-C++more » compiler, a library of data structures and related methods to access and modify them, and a custom runtime providing lightweight software multithreading, network messages aggregation and a partitioned global address space. We provide an overview of the framework, detailing its component and how they have been closely designed and customized to address issues of graph methods applied to large-scale datasets on clusters. We discuss in details the principles that enable automatic translation of the queries (expressed in SPARQL, the query language of choice for RDF databases) to graph methods, and identify differences with respect to other RDF databases.« less

Scale-Limited Lagrange Stability and Finite-Time Synchronization for Memristive Recurrent Neural Networks on Time Scales.

PubMed

Xiao, Qiang; Zeng, Zhigang

2017-10-01

The existed results of Lagrange stability and finite-time synchronization for memristive recurrent neural networks (MRNNs) are scale-free on time evolvement, and some restrictions appear naturally. In this paper, two novel scale-limited comparison principles are established by means of inequality techniques and induction principle on time scales. Then the results concerning Lagrange stability and global finite-time synchronization of MRNNs on time scales are obtained. Scaled-limited Lagrange stability criteria are derived, in detail, via nonsmooth analysis and theory of time scales. Moreover, novel criteria for achieving the global finite-time synchronization are acquired. In addition, the derived method can also be used to study global finite-time stabilization. The proposed results extend or improve the existed ones in the literatures. Two numerical examples are chosen to show the effectiveness of the obtained results.

New design for interfacing computers to the Octopus network

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

Sloan, L.J.

1977-03-14

The Lawrence Livermore Laboratory has several large-scale computers which are connected to the Octopus network. Several difficulties arise in providing adequate resources along with reliable performance. To alleviate some of these problems a new method of bringing large computers into the Octopus environment is proposed.

EXAMINATION OF THE ROLE OF PHYSICAL RESOLUTION AND SCALE ON SEDIMENT AND NUTRIENT YIELDS

EPA Science Inventory

Currently, watershed delineation and extraction of stream networks are accomplished with GIS databases of digital elevation maps (DEMs). The most common method for extracting channel networks requires the a-priori specification of a critical source area that is required for chann...

A local immunization strategy for networks with overlapping community structure

NASA Astrophysics Data System (ADS)

Taghavian, Fatemeh; Salehi, Mostafa; Teimouri, Mehdi

2017-02-01

Since full coverage treatment is not feasible due to limited resources, we need to utilize an immunization strategy to effectively distribute the available vaccines. On the other hand, the structure of contact network among people has a significant impact on epidemics of infectious diseases (such as SARS and influenza) in a population. Therefore, network-based immunization strategies aim to reduce the spreading rate by removing the vaccinated nodes from contact network. Such strategies try to identify more important nodes in epidemics spreading over a network. In this paper, we address the effect of overlapping nodes among communities on epidemics spreading. The proposed strategy is an optimized random-walk based selection of these nodes. The whole process is local, i.e. it requires contact network information in the level of nodes. Thus, it is applicable to large-scale and unknown networks in which the global methods usually are unrealizable. Our simulation results on different synthetic and real networks show that the proposed method outperforms the existing local methods in most cases. In particular, for networks with strong community structures, high overlapping membership of nodes or small size communities, the proposed method shows better performance.

Fast Updating National Geo-Spatial Databases with High Resolution Imagery: China's Methodology and Experience

NASA Astrophysics Data System (ADS)

Chen, J.; Wang, D.; Zhao, R. L.; Zhang, H.; Liao, A.; Jiu, J.

2014-04-01

Geospatial databases are irreplaceable national treasure of immense importance. Their up-to-dateness referring to its consistency with respect to the real world plays a critical role in its value and applications. The continuous updating of map databases at 1:50,000 scales is a massive and difficult task for larger countries of the size of more than several million's kilometer squares. This paper presents the research and technological development to support the national map updating at 1:50,000 scales in China, including the development of updating models and methods, production tools and systems for large-scale and rapid updating, as well as the design and implementation of the continuous updating workflow. The use of many data sources and the integration of these data to form a high accuracy, quality checked product were required. It had in turn required up to date techniques of image matching, semantic integration, generalization, data base management and conflict resolution. Design and develop specific software tools and packages to support the large-scale updating production with high resolution imagery and large-scale data generalization, such as map generalization, GIS-supported change interpretation from imagery, DEM interpolation, image matching-based orthophoto generation, data control at different levels. A national 1:50,000 databases updating strategy and its production workflow were designed, including a full coverage updating pattern characterized by all element topographic data modeling, change detection in all related areas, and whole process data quality controlling, a series of technical production specifications, and a network of updating production units in different geographic places in the country.

Cost-effective and monitoring-active technique for TDM-passive optical networks

NASA Astrophysics Data System (ADS)

Chi, Chang-Chia; Lin, Hong-Mao; Tarn, Chen-Wen; Lin, Huang-Liang

2014-08-01

A reliable, detection-active and cost-effective method which employs the hello and heartbeat signals for branched node distinguishing to monitor fiber fault in any branch of distribution fibers of a time division multiplexing passive optical network (TDM-PON) is proposed. With this method, the material cost of building an optical network monitor system for a TDM-PON with 168 ONUs and the time of identifying a multiple branch faults is significantly reduced in a TDM-PON system of any scale. A fault location in a 1 × 32 TDM-PON system using this method to identify the fault branch is demonstrated.

Large-Scale Simulations of Plastic Neural Networks on Neuromorphic Hardware

PubMed Central

Knight, James C.; Tully, Philip J.; Kaplan, Bernhard A.; Lansner, Anders; Furber, Steve B.

2016-01-01

SpiNNaker is a digital, neuromorphic architecture designed for simulating large-scale spiking neural networks at speeds close to biological real-time. Rather than using bespoke analog or digital hardware, the basic computational unit of a SpiNNaker system is a general-purpose ARM processor, allowing it to be programmed to simulate a wide variety of neuron and synapse models. This flexibility is particularly valuable in the study of biological plasticity phenomena. A recently proposed learning rule based on the Bayesian Confidence Propagation Neural Network (BCPNN) paradigm offers a generic framework for modeling the interaction of different plasticity mechanisms using spiking neurons. However, it can be computationally expensive to simulate large networks with BCPNN learning since it requires multiple state variables for each synapse, each of which needs to be updated every simulation time-step. We discuss the trade-offs in efficiency and accuracy involved in developing an event-based BCPNN implementation for SpiNNaker based on an analytical solution to the BCPNN equations, and detail the steps taken to fit this within the limited computational and memory resources of the SpiNNaker architecture. We demonstrate this learning rule by learning temporal sequences of neural activity within a recurrent attractor network which we simulate at scales of up to 2.0 × 104 neurons and 5.1 × 107 plastic synapses: the largest plastic neural network ever to be simulated on neuromorphic hardware. We also run a comparable simulation on a Cray XC-30 supercomputer system and find that, if it is to match the run-time of our SpiNNaker simulation, the super computer system uses approximately 45× more power. This suggests that cheaper, more power efficient neuromorphic systems are becoming useful discovery tools in the study of plasticity in large-scale brain models. PMID:27092061

Solving gap metabolites and blocked reactions in genome-scale models: application to the metabolic network of Blattabacterium cuenoti.

PubMed

Ponce-de-León, Miguel; Montero, Francisco; Peretó, Juli

2013-10-31

Metabolic reconstruction is the computational-based process that aims to elucidate the network of metabolites interconnected through reactions catalyzed by activities assigned to one or more genes. Reconstructed models may contain inconsistencies that appear as gap metabolites and blocked reactions. Although automatic methods for solving this problem have been previously developed, there are many situations where manual curation is still needed. We introduce a general definition of gap metabolite that allows its detection in a straightforward manner. Moreover, a method for the detection of Unconnected Modules, defined as isolated sets of blocked reactions connected through gap metabolites, is proposed. The method has been successfully applied to the curation of iCG238, the genome-scale metabolic model for the bacterium Blattabacterium cuenoti, obligate endosymbiont of cockroaches. We found the proposed approach to be a valuable tool for the curation of genome-scale metabolic models. The outcome of its application to the genome-scale model B. cuenoti iCG238 is a more accurate model version named as B. cuenoti iMP240.

Quantification of sewer system infiltration using delta(18)O hydrograph separation.

PubMed

Prigiobbe, V; Giulianelli, M

2009-01-01

The infiltration of parasitical water into two sewer systems in Rome (Italy) was quantified during a dry weather period. Infiltration was estimated using the hydrograph separation method with two water components and delta(18)O as a conservative tracer. The two water components were groundwater, the possible source of parasitical water within the sewer, and drinking water discharged into the sewer system. This method was applied at an urban catchment scale in order to test the effective water-tightness of two different sewer networks. The sampling strategy was based on an uncertainty analysis and the errors have been propagated using Monte Carlo random sampling. Our field applications showed that the method can be applied easily and quickly, but the error in the estimated infiltration rate can be up to 20%. The estimated infiltration into the recent sewer in Torraccia is 14% and can be considered negligible given the precision of the method, while the old sewer in Infernetto has an estimated infiltration of 50%.

Metabolic reconstruction, constraint-based analysis and game theory to probe genome-scale metabolic networks.

PubMed

Ruppin, Eytan; Papin, Jason A; de Figueiredo, Luis F; Schuster, Stefan

2010-08-01

With the advent of modern omics technologies, it has become feasible to reconstruct (quasi-) whole-cell metabolic networks and characterize them in more and more detail. Computer simulations of the dynamic behavior of such networks are difficult due to a lack of kinetic data and to computational limitations. In contrast, network analysis based on appropriate constraints such as the steady-state condition (constraint-based analysis) is feasible and allows one to derive conclusions about the system's metabolic capabilities. Here, we review methods for the reconstruction of metabolic networks, modeling techniques such as flux balance analysis and elementary flux modes and current progress in their development and applications. Game-theoretical methods for studying metabolic networks are discussed as well. Copyright © 2010 Elsevier Ltd. All rights reserved.

A generalised significance test for individual communities in networks.

PubMed

Kojaku, Sadamori; Masuda, Naoki

2018-05-09

Many empirical networks have community structure, in which nodes are densely interconnected within each community (i.e., a group of nodes) and sparsely across different communities. Like other local and meso-scale structure of networks, communities are generally heterogeneous in various aspects such as the size, density of edges, connectivity to other communities and significance. In the present study, we propose a method to statistically test the significance of individual communities in a given network. Compared to the previous methods, the present algorithm is unique in that it accepts different community-detection algorithms and the corresponding quality function for single communities. The present method requires that a quality of each community can be quantified and that community detection is performed as optimisation of such a quality function summed over the communities. Various community detection algorithms including modularity maximisation and graph partitioning meet this criterion. Our method estimates a distribution of the quality function for randomised networks to calculate a likelihood of each community in the given network. We illustrate our algorithm by synthetic and empirical networks.

Filtering Gene Ontology semantic similarity for identifying protein complexes in large protein interaction networks.

PubMed

Wang, Jian; Xie, Dong; Lin, Hongfei; Yang, Zhihao; Zhang, Yijia

2012-06-21

Many biological processes recognize in particular the importance of protein complexes, and various computational approaches have been developed to identify complexes from protein-protein interaction (PPI) networks. However, high false-positive rate of PPIs leads to challenging identification. A protein semantic similarity measure is proposed in this study, based on the ontology structure of Gene Ontology (GO) terms and GO annotations to estimate the reliability of interactions in PPI networks. Interaction pairs with low GO semantic similarity are removed from the network as unreliable interactions. Then, a cluster-expanding algorithm is used to detect complexes with core-attachment structure on filtered network. Our method is applied to three different yeast PPI networks. The effectiveness of our method is examined on two benchmark complex datasets. Experimental results show that our method performed better than other state-of-the-art approaches in most evaluation metrics. The method detects protein complexes from large scale PPI networks by filtering GO semantic similarity. Removing interactions with low GO similarity significantly improves the performance of complex identification. The expanding strategy is also effective to identify attachment proteins of complexes.

The emotional cost of distance: Geographic social network dispersion and post-traumatic stress among survivors of Hurricane Katrina.

PubMed

Morris, Katherine Ann; Deterding, Nicole M

2016-09-01

Social networks offer important emotional and instrumental support following natural disasters. However, displacement may geographically disperse network members, making it difficult to provide and receive support necessary for psychological recovery after trauma. We examine the association between distance to network members and post-traumatic stress using survey data, and identify potential mechanisms underlying this association using in-depth qualitative interviews. We use longitudinal, mixed-methods data from the Resilience in Survivors of Katrina (RISK) Project to capture the long-term effects of Hurricane Katrina on low-income mothers from New Orleans. Baseline surveys occurred approximately one year before the storm and follow-up surveys and in-depth interviews were conducted five years later. We use a sequential explanatory analytic design. With logistic regression, we estimate the association of geographic network dispersion with the likelihood of post-traumatic stress. With linear regressions, we estimate the association of network dispersion with the three post-traumatic stress sub-scales. Using maximal variation sampling, we use qualitative interview data to elaborate identified statistical associations. We find network dispersion is positively associated with the likelihood of post-traumatic stress, controlling for individual-level socio-demographic characteristics, exposure to hurricane-related trauma, perceived social support, and New Orleans residency. We identify two social-psychological mechanisms present in qualitative data: respondents with distant network members report a lack of deep belonging and a lack of mattering as they are unable to fulfill obligations to important distant ties. Results indicate the importance of physical proximity to emotionally-intimate network ties for long-term psychological recovery. Copyright © 2016 Elsevier Ltd. All rights reserved.

A system of networks and continuing education for physical therapists in rheumatology: a feasibility study

PubMed Central

Verhoef, J.; Oosterveld, F.G.J.; Hoekman, R.; Munneke, M.; Boonman, D.C.G.; Bakker, M.; Otten, W.; Rasker, J.J.; de Vries-vander Zwan, H.M.; Vliet Vlieland, T.P.M.

2004-01-01

Abstract Purpose To evaluate the feasibility of regional physical therapy networks including continuing education in rheumatology. The aim of these networks was to improve care provided by primary care physical therapists by improving specific knowledge, technical and communicative skills and the collaboration with rheumatologists. Methods In two regions in The Netherlands continuing education (CE) programmes, consisting of a 5-day postgraduate training course followed by bimonthly workshops and teaching practices, were organised simultaneously. Network activities included consultations, newsletters and the development of a communication guideline. Endpoint measures included the participation rate, compliance, quality of the CE programme, teaching practices, knowledge, network activities, communication, number of patients treated and patient satisfaction. Results Sixty-three physical therapists out of 193 practices (33%) participated in the project. They all completed the education programmes and were formally registered. All evaluations of the education programmes showed positive scores. Knowledge scores increased significantly directly after the training course and at 18 months. A draft guideline on communication between physical therapists and rheumatologists was developed, and 4 newsletters were distributed. A substantial proportion of physical therapists and rheumatologists reported improved communication at 18 months. The mean number of patients treated by physical therapists participating in the networks increased significantly. Patients' satisfaction scores within the networks were significantly higher than those from outside the networks at 18 months. Conclusions Setting up a system of networks for continuing education for physical therapists regarding the treatment of patients with rheumatic diseases is feasible. Further research will focus on the effectiveness of the system and its implementation on a larger scale. PMID:16773150

Biological mechanisms beyond network analysis via mathematical modeling. Comment on "Network science of biological systems at different scales: A review" by Marko Gosak et al.

NASA Astrophysics Data System (ADS)

Pedersen, Morten Gram

2018-03-01

Methods from network theory are increasingly used in research spanning from engineering and computer science to psychology and the social sciences. In this issue, Gosak et al. [1] provide a thorough review of network science applications to biological systems ranging from the subcellular world via neuroscience to ecosystems, with special attention to the insulin-secreting beta-cells in pancreatic islets.

ICA model order selection of task co-activation networks.

PubMed

Ray, Kimberly L; McKay, D Reese; Fox, Peter M; Riedel, Michael C; Uecker, Angela M; Beckmann, Christian F; Smith, Stephen M; Fox, Peter T; Laird, Angela R

2013-01-01

Independent component analysis (ICA) has become a widely used method for extracting functional networks in the brain during rest and task. Historically, preferred ICA dimensionality has widely varied within the neuroimaging community, but typically varies between 20 and 100 components. This can be problematic when comparing results across multiple studies because of the impact ICA dimensionality has on the topology of its resultant components. Recent studies have demonstrated that ICA can be applied to peak activation coordinates archived in a large neuroimaging database (i.e., BrainMap Database) to yield whole-brain task-based co-activation networks. A strength of applying ICA to BrainMap data is that the vast amount of metadata in BrainMap can be used to quantitatively assess tasks and cognitive processes contributing to each component. In this study, we investigated the effect of model order on the distribution of functional properties across networks as a method for identifying the most informative decompositions of BrainMap-based ICA components. Our findings suggest dimensionality of 20 for low model order ICA to examine large-scale brain networks, and dimensionality of 70 to provide insight into how large-scale networks fractionate into sub-networks. We also provide a functional and organizational assessment of visual, motor, emotion, and interoceptive task co-activation networks as they fractionate from low to high model-orders.

ICA model order selection of task co-activation networks

PubMed Central

Ray, Kimberly L.; McKay, D. Reese; Fox, Peter M.; Riedel, Michael C.; Uecker, Angela M.; Beckmann, Christian F.; Smith, Stephen M.; Fox, Peter T.; Laird, Angela R.

2013-01-01

Independent component analysis (ICA) has become a widely used method for extracting functional networks in the brain during rest and task. Historically, preferred ICA dimensionality has widely varied within the neuroimaging community, but typically varies between 20 and 100 components. This can be problematic when comparing results across multiple studies because of the impact ICA dimensionality has on the topology of its resultant components. Recent studies have demonstrated that ICA can be applied to peak activation coordinates archived in a large neuroimaging database (i.e., BrainMap Database) to yield whole-brain task-based co-activation networks. A strength of applying ICA to BrainMap data is that the vast amount of metadata in BrainMap can be used to quantitatively assess tasks and cognitive processes contributing to each component. In this study, we investigated the effect of model order on the distribution of functional properties across networks as a method for identifying the most informative decompositions of BrainMap-based ICA components. Our findings suggest dimensionality of 20 for low model order ICA to examine large-scale brain networks, and dimensionality of 70 to provide insight into how large-scale networks fractionate into sub-networks. We also provide a functional and organizational assessment of visual, motor, emotion, and interoceptive task co-activation networks as they fractionate from low to high model-orders. PMID:24339802

Face recognition via Gabor and convolutional neural network

NASA Astrophysics Data System (ADS)

Lu, Tongwei; Wu, Menglu; Lu, Tao

2018-04-01

In recent years, the powerful feature learning and classification ability of convolutional neural network have attracted widely attention. Compared with the deep learning, the traditional machine learning algorithm has a good explanatory which deep learning does not have. Thus, In this paper, we propose a method to extract the feature of the traditional algorithm as the input of convolution neural network. In order to reduce the complexity of the network, the kernel function of Gabor wavelet is used to extract the feature from different position, frequency and direction of target image. It is sensitive to edge of image which can provide good direction and scale selection. The extraction of the image from eight directions on a scale are as the input of network that we proposed. The network have the advantage of weight sharing and local connection and texture feature of the input image can reduce the influence of facial expression, gesture and illumination. At the same time, we introduced a layer which combined the results of the pooling and convolution can extract deeper features. The training network used the open source caffe framework which is beneficial to feature extraction. The experiment results of the proposed method proved that the network structure effectively overcame the barrier of illumination and had a good robustness as well as more accurate and rapid than the traditional algorithm.

A quasi steady state method for solving transient Darcy flow in complex 3D fractured networks accounting for matrix to fracture flow

NASA Astrophysics Data System (ADS)

Nœtinger, B.

2015-02-01

Modeling natural Discrete Fracture Networks (DFN) receives more and more attention in applied geosciences, from oil and gas industry, to geothermal recovery and aquifer management. The fractures may be either natural, or artificial in case of well stimulation. Accounting for the flow inside the fracture network, and accounting for the transfers between the matrix and the fractures, with the same level of accuracy is an important issue for calibrating the well architecture and for setting up optimal resources recovery strategies. Recently, we proposed an original method allowing to model transient pressure diffusion in the fracture network only [1]. The matrix was assumed to be impervious. A systematic approximation scheme was built, allowing to model the initial DFN by a set of N unknowns located at each identified intersection between fractures. The higher N, the higher the accuracy of the model. The main assumption was using a quasi steady state hypothesis, that states that the characteristic diffusion time over one single fracture is negligible compared with the characteristic time of the macroscopic problem, e.g. change of boundary conditions. In that context, the lowest order approximation N = 1 has the form of solving a transient problem in a resistor/capacitor network, a so-called pipe network. Its topology is the same as the network of geometrical intersections between fractures. In this paper, we generalize this approach in order to account for fluxes from matrix to fractures. The quasi steady state hypothesis at the fracture level is still kept. Then, we show that in the case of well separated time scales between matrix and fractures, the preceding model needs only to be slightly modified in order to incorporate these fluxes. The additional knowledge of the so-called matrix to fracture transfer function allows to modify the mass matrix that becomes a time convolution operator. This is reminiscent of existing space averaged transient dual porosity models.

Performance Comparison of the Digital Neuromorphic Hardware SpiNNaker and the Neural Network Simulation Software NEST for a Full-Scale Cortical Microcircuit Model

PubMed Central

van Albada, Sacha J.; Rowley, Andrew G.; Senk, Johanna; Hopkins, Michael; Schmidt, Maximilian; Stokes, Alan B.; Lester, David R.; Diesmann, Markus; Furber, Steve B.

2018-01-01

The digital neuromorphic hardware SpiNNaker has been developed with the aim of enabling large-scale neural network simulations in real time and with low power consumption. Real-time performance is achieved with 1 ms integration time steps, and thus applies to neural networks for which faster time scales of the dynamics can be neglected. By slowing down the simulation, shorter integration time steps and hence faster time scales, which are often biologically relevant, can be incorporated. We here describe the first full-scale simulations of a cortical microcircuit with biological time scales on SpiNNaker. Since about half the synapses onto the neurons arise within the microcircuit, larger cortical circuits have only moderately more synapses per neuron. Therefore, the full-scale microcircuit paves the way for simulating cortical circuits of arbitrary size. With approximately 80, 000 neurons and 0.3 billion synapses, this model is the largest simulated on SpiNNaker to date. The scale-up is enabled by recent developments in the SpiNNaker software stack that allow simulations to be spread across multiple boards. Comparison with simulations using the NEST software on a high-performance cluster shows that both simulators can reach a similar accuracy, despite the fixed-point arithmetic of SpiNNaker, demonstrating the usability of SpiNNaker for computational neuroscience applications with biological time scales and large network size. The runtime and power consumption are also assessed for both simulators on the example of the cortical microcircuit model. To obtain an accuracy similar to that of NEST with 0.1 ms time steps, SpiNNaker requires a slowdown factor of around 20 compared to real time. The runtime for NEST saturates around 3 times real time using hybrid parallelization with MPI and multi-threading. However, achieving this runtime comes at the cost of increased power and energy consumption. The lowest total energy consumption for NEST is reached at around 144 parallel threads and 4.6 times slowdown. At this setting, NEST and SpiNNaker have a comparable energy consumption per synaptic event. Our results widen the application domain of SpiNNaker and help guide its development, showing that further optimizations such as synapse-centric network representation are necessary to enable real-time simulation of large biological neural networks. PMID:29875620

An investigation of the digital discrimination of neutrons and γ rays with organic scintillation detectors using an artificial neural network

NASA Astrophysics Data System (ADS)

Liu, G.; Aspinall, M. D.; Ma, X.; Joyce, M. J.

2009-08-01

The discrimination of neutron and γ-ray events in an organic scintillator has been investigated by using a method based on an artificial neural network (ANN). Voltage pulses arising from an EJ-301 organic liquid scintillation detector in a mixed radiation field have been recorded with a fast digital sampling oscilloscope. Piled-up events have been disentangled using a pile-up management unit based on a fitting method. Each individual pulse has subsequently been sent to a discrimination unit which discriminates neutron and γ-ray events with a method based on an artificial neural network. This discrimination technique has been verified by the corresponding mixed-field data assessed by time of flight (TOF). It is shown that the characterization of the neutrons and photons achieved by the discrimination method based on the ANN is consistent with that afforded by TOF. This approach enables events that are often as a result of scattering or pile-up to be identified and returned to the data set and affords digital discrimination of mixed radiation fields in a broad range of environments on the basis of training obtained with a single TOF dataset.

Capturing the essence of a metabolic network: a flux balance analysis approach.

PubMed

Murabito, Ettore; Simeonidis, Evangelos; Smallbone, Kieran; Swinton, Jonathan

2009-10-07

As genome-scale metabolic reconstructions emerge, tools to manage their size and complexity will be increasingly important. Flux balance analysis (FBA) is a constraint-based approach widely used to study the metabolic capabilities of cellular or subcellular systems. FBA problems are highly underdetermined and many different phenotypes can satisfy any set of constraints through which the metabolic system is represented. Two of the main concerns in FBA are exploring the space of solutions for a given metabolic network and finding a specific phenotype which is representative for a given task such as maximal growth rate. Here, we introduce a recursive algorithm suitable for overcoming both of these concerns. The method proposed is able to find the alternate optimal patterns of active reactions of an FBA problem and identify the minimal subnetwork able to perform a specific task as optimally as the whole. Our method represents an alternative to and an extension of other approaches conceived for exploring the space of solutions of an FBA problem. It may also be particularly helpful in defining a scaffold of reactions upon which to build up a dynamic model, when the important pathways of the system have not yet been well-defined.

A Dictionary Learning Approach for Signal Sampling in Task-Based fMRI for Reduction of Big Data

PubMed Central

Ge, Bao; Li, Xiang; Jiang, Xi; Sun, Yifei; Liu, Tianming

2018-01-01

The exponential growth of fMRI big data offers researchers an unprecedented opportunity to explore functional brain networks. However, this opportunity has not been fully explored yet due to the lack of effective and efficient tools for handling such fMRI big data. One major challenge is that computing capabilities still lag behind the growth of large-scale fMRI databases, e.g., it takes many days to perform dictionary learning and sparse coding of whole-brain fMRI data for an fMRI database of average size. Therefore, how to reduce the data size but without losing important information becomes a more and more pressing issue. To address this problem, we propose a signal sampling approach for significant fMRI data reduction before performing structurally-guided dictionary learning and sparse coding of whole brain's fMRI data. We compared the proposed structurally guided sampling method with no sampling, random sampling and uniform sampling schemes, and experiments on the Human Connectome Project (HCP) task fMRI data demonstrated that the proposed method can achieve more than 15 times speed-up without sacrificing the accuracy in identifying task-evoked functional brain networks. PMID:29706880

A Dictionary Learning Approach for Signal Sampling in Task-Based fMRI for Reduction of Big Data.

PubMed

Ge, Bao; Li, Xiang; Jiang, Xi; Sun, Yifei; Liu, Tianming

2018-01-01

The exponential growth of fMRI big data offers researchers an unprecedented opportunity to explore functional brain networks. However, this opportunity has not been fully explored yet due to the lack of effective and efficient tools for handling such fMRI big data. One major challenge is that computing capabilities still lag behind the growth of large-scale fMRI databases, e.g., it takes many days to perform dictionary learning and sparse coding of whole-brain fMRI data for an fMRI database of average size. Therefore, how to reduce the data size but without losing important information becomes a more and more pressing issue. To address this problem, we propose a signal sampling approach for significant fMRI data reduction before performing structurally-guided dictionary learning and sparse coding of whole brain's fMRI data. We compared the proposed structurally guided sampling method with no sampling, random sampling and uniform sampling schemes, and experiments on the Human Connectome Project (HCP) task fMRI data demonstrated that the proposed method can achieve more than 15 times speed-up without sacrificing the accuracy in identifying task-evoked functional brain networks.

All-printed thin-film transistors from networks of liquid-exfoliated nanosheets

NASA Astrophysics Data System (ADS)

Kelly, Adam G.; Hallam, Toby; Backes, Claudia; Harvey, Andrew; Esmaeily, Amir Sajad; Godwin, Ian; Coelho, João; Nicolosi, Valeria; Lauth, Jannika; Kulkarni, Aditya; Kinge, Sachin; Siebbeles, Laurens D. A.; Duesberg, Georg S.; Coleman, Jonathan N.

2017-04-01

All-printed transistors consisting of interconnected networks of various types of two-dimensional nanosheets are an important goal in nanoscience. Using electrolytic gating, we demonstrate all-printed, vertically stacked transistors with graphene source, drain, and gate electrodes, a transition metal dichalcogenide channel, and a boron nitride (BN) separator, all formed from nanosheet networks. The BN network contains an ionic liquid within its porous interior that allows electrolytic gating in a solid-like structure. Nanosheet network channels display on:off ratios of up to 600, transconductances exceeding 5 millisiemens, and mobilities of >0.1 square centimeters per volt per second. Unusually, the on-currents scaled with network thickness and volumetric capacitance. In contrast to other devices with comparable mobility, large capacitances, while hindering switching speeds, allow these devices to carry higher currents at relatively low drive voltages.

Comparison of up-scaling methods in poroelasticity and its generalizations

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

Berryman, J G

2003-12-13

Four methods of up-scaling coupled equations at the microscale to equations valid at the mesoscale and/or macroscale for fluid-saturated and partially saturated porous media will be discussed, compared, and contrasted. The four methods are: (1) effective medium theory, (2) mixture theory, (3) two-scale and multiscale homogenization, and (4) volume averaging. All these methods have advantages for some applications and disadvantages for others. For example, effective medium theory, mixture theory, and homogenization methods can all give formulas for coefficients in the up-scaled equations, whereas volume averaging methods give the form of the up-scaled equations but generally must be supplemented with physicalmore » arguments and/or data in order to determine the coefficients. Homogenization theory requires a great deal of mathematical insight from the user in order to choose appropriate scalings for use in the resulting power-law expansions, while volume averaging requires more physical insight to motivate the steps needed to find coefficients. Homogenization often is performed on periodic models, while volume averaging does not require any assumption of periodicity and can therefore be related very directly to laboratory and/or field measurements. Validity of the homogenization process is often limited to specific ranges of frequency - in order to justify the scaling hypotheses that must be made - and therefore cannot be used easily over wide ranges of frequency. However, volume averaging methods can quite easily be used for wide band data analysis. So, we learn from these comparisons that a researcher in the theory of poroelasticity and its generalizations needs to be conversant with two or more of these methods to solve problems generally.« less

Network inference and network response identification: moving genome-scale data to the next level of biological discovery

PubMed Central

Veiga, Diogo F. T.; Dutta, Bhaskar; Balaźsi, Gábor

2011-01-01

The escalating amount of genome-scale data demands a pragmatic stance from the research community. How can we utilize this deluge of information to better understand biology, cure diseases, or engage cells in bioremediation or biomaterial production for various purposes? A research pipeline moving new sequence, expression and binding data towards practical end goals seems to be necessary. While most individual researchers are not motivated by such well-articulated pragmatic end goals, the scientific community has already self-organized itself to successfully convert genomic data into fundamentally new biological knowledge and practical applications. Here we review two important steps in this workflow: network inference and network response identification, applied to transcriptional regulatory networks. Among network inference methods, we concentrate on relevance networks due to their conceptual simplicity. We classify and discuss network response identification approaches as either data-centric or network-centric. Finally, we conclude with an outlook on what is still missing from these approaches and what may be ahead on the road to biological discovery. PMID:20174676

Toward multiscale modelings of grain-fluid systems

NASA Astrophysics Data System (ADS)

Chareyre, Bruno; Yuan, Chao; Montella, Eduard P.; Salager, Simon

2017-06-01

Computationally efficient methods have been developed for simulating partially saturated granular materials in the pendular regime. In contrast, one hardly avoid expensive direct resolutions of 2-phase fluid dynamics problem for mixed pendular-funicular situations or even saturated regimes. Following previous developments for single-phase flow, a pore-network approach of the coupling problems is described. The geometry and movements of phases and interfaces are described on the basis of a tetrahedrization of the pore space, introducing elementary objects such as bridge, meniscus, pore body and pore throat, together with local rules of evolution. As firmly established local rules are still missing on some aspects (entry capillary pressure and pore-scale pressure-saturation relations, forces on the grains, or kinetics of transfers in mixed situations) a multi-scale numerical framework is introduced, enhancing the pore-network approach with the help of direct simulations. Small subsets of a granular system are extracted, in which multiphase scenario are solved using the Lattice-Boltzman method (LBM). In turns, a global problem is assembled and solved at the network scale, as illustrated by a simulated primary drainage.

Detection of Protein Complexes Based on Penalized Matrix Decomposition in a Sparse Protein⁻Protein Interaction Network.

PubMed

Cao, Buwen; Deng, Shuguang; Qin, Hua; Ding, Pingjian; Chen, Shaopeng; Li, Guanghui

2018-06-15

High-throughput technology has generated large-scale protein interaction data, which is crucial in our understanding of biological organisms. Many complex identification algorithms have been developed to determine protein complexes. However, these methods are only suitable for dense protein interaction networks, because their capabilities decrease rapidly when applied to sparse protein⁻protein interaction (PPI) networks. In this study, based on penalized matrix decomposition ( PMD ), a novel method of penalized matrix decomposition for the identification of protein complexes (i.e., PMD pc ) was developed to detect protein complexes in the human protein interaction network. This method mainly consists of three steps. First, the adjacent matrix of the protein interaction network is normalized. Second, the normalized matrix is decomposed into three factor matrices. The PMD pc method can detect protein complexes in sparse PPI networks by imposing appropriate constraints on factor matrices. Finally, the results of our method are compared with those of other methods in human PPI network. Experimental results show that our method can not only outperform classical algorithms, such as CFinder, ClusterONE, RRW, HC-PIN, and PCE-FR, but can also achieve an ideal overall performance in terms of a composite score consisting of F-measure, accuracy (ACC), and the maximum matching ratio (MMR).

An improved global dynamic routing strategy for scale-free network with tunable clustering

NASA Astrophysics Data System (ADS)

Sun, Lina; Huang, Ning; Zhang, Yue; Bai, Yannan

2016-08-01

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

Thinking outside the channel: Modeling nitrogen cycling in networked river ecosystems

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

Helton, Ashley; Poole, Geoffrey C.; Meyer, Judy

2011-01-01

Agricultural and urban development alters nitrogen and other biogeochemical cycles in rivers worldwide. Because such biogeochemical processes cannot be measured empirically across whole river networks, simulation models are critical tools for understanding river-network biogeochemistry. However, limitations inherent in current models restrict our ability to simulate biogeochemical dynamics among diverse river networks. We illustrate these limitations using a river-network model to scale up in situ measures of nitrogen cycling in eight catchments spanning various geophysical and land-use conditions. Our model results provide evidence that catchment characteristics typically excluded from models may control river-network biogeochemistry. Based on our findings, we identify importantmore » components of a revised strategy for simulating biogeochemical dynamics in river networks, including approaches to modeling terrestrial-aquatic linkages, hydrologic exchanges between the channel, floodplain/riparian complex, and subsurface waters, and interactions between coupled biogeochemical cycles.« less

Task-Related Edge Density (TED)—A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain

PubMed Central

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach “Task-related Edge Density” (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function. PMID:27341204

Task-Related Edge Density (TED)-A New Method for Revealing Dynamic Network Formation in fMRI Data of the Human Brain.

PubMed

Lohmann, Gabriele; Stelzer, Johannes; Zuber, Verena; Buschmann, Tilo; Margulies, Daniel; Bartels, Andreas; Scheffler, Klaus

2016-01-01

The formation of transient networks in response to external stimuli or as a reflection of internal cognitive processes is a hallmark of human brain function. However, its identification in fMRI data of the human brain is notoriously difficult. Here we propose a new method of fMRI data analysis that tackles this problem by considering large-scale, task-related synchronisation networks. Networks consist of nodes and edges connecting them, where nodes correspond to voxels in fMRI data, and the weight of an edge is determined via task-related changes in dynamic synchronisation between their respective times series. Based on these definitions, we developed a new data analysis algorithm that identifies edges that show differing levels of synchrony between two distinct task conditions and that occur in dense packs with similar characteristics. Hence, we call this approach "Task-related Edge Density" (TED). TED proved to be a very strong marker for dynamic network formation that easily lends itself to statistical analysis using large scale statistical inference. A major advantage of TED compared to other methods is that it does not depend on any specific hemodynamic response model, and it also does not require a presegmentation of the data for dimensionality reduction as it can handle large networks consisting of tens of thousands of voxels. We applied TED to fMRI data of a fingertapping and an emotion processing task provided by the Human Connectome Project. TED revealed network-based involvement of a large number of brain areas that evaded detection using traditional GLM-based analysis. We show that our proposed method provides an entirely new window into the immense complexity of human brain function.

Graph Representations of Flow and Transport in Fracture Networks using Machine Learning

NASA Astrophysics Data System (ADS)

Srinivasan, G.; Viswanathan, H. S.; Karra, S.; O'Malley, D.; Godinez, H. C.; Hagberg, A.; Osthus, D.; Mohd-Yusof, J.

2017-12-01

Flow and transport of fluids through fractured systems is governed by the properties and interactions at the micro-scale. Retaining information about the micro-structure such as fracture length, orientation, aperture and connectivity in mesh-based computational models results in solving for millions to billions of degrees of freedom and quickly renders the problem computationally intractable. Our approach depicts fracture networks graphically, by mapping fractures to nodes and intersections to edges, thereby greatly reducing computational burden. Additionally, we use machine learning techniques to build simulators on the graph representation, trained on data from the mesh-based high fidelity simulations to speed up computation by orders of magnitude. We demonstrate our methodology on ensembles of discrete fracture networks, dividing up the data into training and validation sets. Our machine learned graph-based solvers result in over 3 orders of magnitude speedup without any significant sacrifice in accuracy.

A concise synthesis of benzimidazoles via the microwave-assisted one-pot batch reaction of amino acids up to a 10-g scale.

PubMed

Peng, Pai; Xiong, Jin-Feng; Mo, Guang-Zhen; Zheng, Jia-Li; Chen, Ren-Hong; Chen, Xiao-Yun; Wang, Zhao-Yang

2014-10-01

An efficient method for the synthesis of aminomethyl benzimidazoles is developed by using a one-pot batch reaction between amino acids and o-phenylenediamines. This reaction proceeds smoothly in an unmodified household microwave oven, even though scale-up is to 10 g. A desirable method for the quick synthesis of benzimidazoles, which are used as a kind of important intermediates in drug synthesis, is provided by the scale-up utilization of amino acid resource.

Energy Spectral Behaviors of Communication Networks of Open-Source Communities

PubMed Central

Yang, Jianmei; Yang, Huijie; Liao, Hao; Wang, Jiangtao; Zeng, Jinqun

2015-01-01

Large-scale online collaborative production activities in open-source communities must be accompanied by large-scale communication activities. Nowadays, the production activities of open-source communities, especially their communication activities, have been more and more concerned. Take CodePlex C # community for example, this paper constructs the complex network models of 12 periods of communication structures of the community based on real data; then discusses the basic concepts of quantum mapping of complex networks, and points out that the purpose of the mapping is to study the structures of complex networks according to the idea of quantum mechanism in studying the structures of large molecules; finally, according to this idea, analyzes and compares the fractal features of the spectra in different quantum mappings of the networks, and concludes that there are multiple self-similarity and criticality in the communication structures of the community. In addition, this paper discusses the insights and application conditions of different quantum mappings in revealing the characteristics of the structures. The proposed quantum mapping method can also be applied to the structural studies of other large-scale organizations. PMID:26047331

Large-scale imaging of cortical network activity with calcium indicators.

PubMed

Ikegaya, Yuji; Le Bon-Jego, Morgane; Yuste, Rafael

2005-06-01

Bulk loading of calcium indicators has provided a unique opportunity to reconstruct the activity of cortical networks with single-cell resolution. Here we describe the detailed methods of bulk loading of AM dyes we developed and have been improving for imaging with a spinning disk confocal microscope.

Observations of brine drainage networks and microstructure of first-year sea ice

NASA Astrophysics Data System (ADS)

Cole, D. M.; Shapiro, L. H.

1998-09-01

Brine drainage networks and the microstructure of first-year sea ice have been examined at two locations near Barrow, northern Alaska. A method for obtaining full-depth sections of ice sheets up to 1.8 m thick is presented and shown to provide information on the spatial distribution and geometry of brine drainage networks on a scale of meters. A number of such sections from the two test sites are presented which reveal a greater variety of main channel and side branch configurations than is typically observed in ice grown in the laboratory. Vertical and horizontal micrographs and thin section photographs were obtained in November 1993, and March and May 1994 at a test site in the relatively protected Elson Lagoon. The resulting time series of photographic records provide detailed information on the size, shape, and spatial distribution of the brine- and gas-filled inclusions and a means to quantify their size and shape changes with time. An example of the changes with time in inclusion sizes and aspect ratios in the vertical and horizontal directions for a depth of 0.2 m, with a given thermal history is also presented.

The significance of small streams

NASA Astrophysics Data System (ADS)

Wohl, Ellen

2017-09-01

Headwaters, defined here as first- and secondorder streams, make up 70%‒80% of the total channel length of river networks. These small streams exert a critical influence on downstream portions of the river network by: retaining or transmitting sediment and nutrients; providing habitat and refuge for diverse aquatic and riparian organisms; creating migration corridors; and governing connectivity at the watershed-scale. The upstream-most extent of the channel network and the longitudinal continuity and lateral extent of headwaters can be difficult to delineate, however, and people are less likely to recognize the importance of headwaters relative to other portions of a river network. Consequently, headwaters commonly lack the legal protections accorded to other portions of a river network and are more likely to be significantly altered or completely obliterated by land use.

Prediction of near-surface soil moisture at large scale by digital terrain modeling and neural networks.

PubMed

Lavado Contador, J F; Maneta, M; Schnabel, S

2006-10-01

The capability of Artificial Neural Network models to forecast near-surface soil moisture at fine spatial scale resolution has been tested for a 99.5 ha watershed located in SW Spain using several easy to achieve digital models of topographic and land cover variables as inputs and a series of soil moisture measurements as training data set. The study methods were designed in order to determining the potentials of the neural network model as a tool to gain insight into soil moisture distribution factors and also in order to optimize the data sampling scheme finding the optimum size of the training data set. Results suggest the efficiency of the methods in forecasting soil moisture, as a tool to assess the optimum number of field samples, and the importance of the variables selected in explaining the final map obtained.

Identification of the connections in biologically inspired neural networks

NASA Technical Reports Server (NTRS)

Demuth, H.; Leung, K.; Beale, M.; Hicklin, J.

1990-01-01

We developed an identification method to find the strength of the connections between neurons from their behavior in small biologically-inspired artificial neural networks. That is, given the network external inputs and the temporal firing pattern of the neurons, we can calculate a solution for the strengths of the connections between neurons and the initial neuron activations if a solution exists. The method determines directly if there is a solution to a particular neural network problem. No training of the network is required. It should be noted that this is a first pass at the solution of a difficult problem. The neuron and network models chosen are related to biology but do not contain all of its complexities, some of which we hope to add to the model in future work. A variety of new results have been obtained. First, the method has been tailored to produce connection weight matrix solutions for networks with important features of biological neural (bioneural) networks. Second, a computationally efficient method of finding a robust central solution has been developed. This later method also enables us to find the most consistent solution in the presence of noisy data. Prospects of applying our method to identify bioneural network connections are exciting because such connections are almost impossible to measure in the laboratory. Knowledge of such connections would facilitate an understanding of bioneural networks and would allow the construction of the electronic counterparts of bioneural networks on very large scale integrated (VLSI) circuits.