Data fusion in data scarce areas using a back-propagation artificial neural network model: a case study of the South China Sea

NASA Astrophysics Data System (ADS)

Wang, Zheng; Mao, Zhihua; Xia, Junshi; Du, Peijun; Shi, Liangliang; Huang, Haiqing; Wang, Tianyu; Gong, Fang; Zhu, Qiankun

2018-06-01

The cloud cover for the South China Sea and its coastal area is relatively large throughout the year, which limits the potential application of optical remote sensing. A HJ-charge-coupled device (HJ-CCD) has the advantages of wide field, high temporal resolution, and short repeat cycle. However, this instrument suffers from its use of only four relatively low-quality bands which can't adequately resolve the features of long wavelengths. The Landsat Enhanced Thematic Mapper-plus (ETM+) provides high-quality data, however, the Scan Line Corrector (SLC) stopped working and caused striping of remote sensed images, which dramatically reduced the coverage of the ETM+ data. In order to combine the advantages of the HJ-CCD and Landsat ETM+ data, we adopted a back-propagation artificial neural network (BP-ANN) to fuse these two data types for this study. The results showed that the fused output data not only have the advantage of data intactness for the HJ-CCD, but also have the advantages of the multi-spectral and high radiometric resolution of the ETM+ data. Moreover, the fused data were analyzed qualitatively, quantitatively and from a practical application point of view. Experimental studies indicated that the fused data have a full spatial distribution, multi-spectral bands, high radiometric resolution, a small difference between the observed and fused output data, and a high correlation between the observed and fused data. The excellent performance in its practical application is a further demonstration that the fused data are of high quality.

Fused smart sensor network for multi-axis forward kinematics estimation in industrial robots.

PubMed

Rodriguez-Donate, Carlos; Osornio-Rios, Roque Alfredo; Rivera-Guillen, Jesus Rooney; Romero-Troncoso, Rene de Jesus

2011-01-01

Flexible manipulator robots have a wide industrial application. Robot performance requires sensing its position and orientation adequately, known as forward kinematics. Commercially available, motion controllers use high-resolution optical encoders to sense the position of each joint which cannot detect some mechanical deformations that decrease the accuracy of the robot position and orientation. To overcome those problems, several sensor fusion methods have been proposed but at expenses of high-computational load, which avoids the online measurement of the joint's angular position and the online forward kinematics estimation. The contribution of this work is to propose a fused smart sensor network to estimate the forward kinematics of an industrial robot. The developed smart processor uses Kalman filters to filter and to fuse the information of the sensor network. Two primary sensors are used: an optical encoder, and a 3-axis accelerometer. In order to obtain the position and orientation of each joint online a field-programmable gate array (FPGA) is used in the hardware implementation taking advantage of the parallel computation capabilities and reconfigurability of this device. With the aim of evaluating the smart sensor network performance, three real-operation-oriented paths are executed and monitored in a 6-degree of freedom robot.

Discriminant analysis of fused positive and negative ion mobility spectra using multivariate self-modeling mixture analysis and neural networks.

PubMed

Chen, Ping; Harrington, Peter B

2008-02-01

A new method coupling multivariate self-modeling mixture analysis and pattern recognition has been developed to identify toxic industrial chemicals using fused positive and negative ion mobility spectra (dual scan spectra). A Smiths lightweight chemical detector (LCD), which can measure positive and negative ion mobility spectra simultaneously, was used to acquire the data. Simple-to-use interactive self-modeling mixture analysis (SIMPLISMA) was used to separate the analytical peaks in the ion mobility spectra from the background reactant ion peaks (RIP). The SIMPLSIMA analytical components of the positive and negative ion peaks were combined together in a butterfly representation (i.e., negative spectra are reported with negative drift times and reflected with respect to the ordinate and juxtaposed with the positive ion mobility spectra). Temperature constrained cascade-correlation neural network (TCCCN) models were built to classify the toxic industrial chemicals. Seven common toxic industrial chemicals were used in this project to evaluate the performance of the algorithm. Ten bootstrapped Latin partitions demonstrated that the classification of neural networks using the SIMPLISMA components was statistically better than neural network models trained with fused ion mobility spectra (IMS).

Multi-dimension feature fusion for action recognition

NASA Astrophysics Data System (ADS)

Dong, Pei; Li, Jie; Dong, Junyu; Qi, Lin

2018-04-01

Typical human actions last several seconds and exhibit characteristic spatio-temporal structure. The challenge for action recognition is to capture and fuse the multi-dimension information in video data. In order to take into account these characteristics simultaneously, we present a novel method that fuses multiple dimensional features, such as chromatic images, depth and optical flow fields. We built our model based on the multi-stream deep convolutional networks with the help of temporal segment networks and extract discriminative spatial and temporal features by fusing ConvNets towers multi-dimension, in which different feature weights are assigned in order to take full advantage of this multi-dimension information. Our architecture is trained and evaluated on the currently largest and most challenging benchmark NTU RGB-D dataset. The experiments demonstrate that the performance of our method outperforms the state-of-the-art methods.

Similarity network fusion for aggregating data types on a genomic scale.

PubMed

Wang, Bo; Mezlini, Aziz M; Demir, Feyyaz; Fiume, Marc; Tu, Zhuowen; Brudno, Michael; Haibe-Kains, Benjamin; Goldenberg, Anna

2014-03-01

Recent technologies have made it cost-effective to collect diverse types of genome-wide data. Computational methods are needed to combine these data to create a comprehensive view of a given disease or a biological process. Similarity network fusion (SNF) solves this problem by constructing networks of samples (e.g., patients) for each available data type and then efficiently fusing these into one network that represents the full spectrum of underlying data. For example, to create a comprehensive view of a disease given a cohort of patients, SNF computes and fuses patient similarity networks obtained from each of their data types separately, taking advantage of the complementarity in the data. We used SNF to combine mRNA expression, DNA methylation and microRNA (miRNA) expression data for five cancer data sets. SNF substantially outperforms single data type analysis and established integrative approaches when identifying cancer subtypes and is effective for predicting survival.

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks

PubMed Central

Lam, William H. K.; Li, Qingquan

2017-01-01

Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks. PMID:29210978

Heterogeneous Data Fusion Method to Estimate Travel Time Distributions in Congested Road Networks.

PubMed

Shi, Chaoyang; Chen, Bi Yu; Lam, William H K; Li, Qingquan

2017-12-06

Travel times in congested urban road networks are highly stochastic. Provision of travel time distribution information, including both mean and variance, can be very useful for travelers to make reliable path choice decisions to ensure higher probability of on-time arrival. To this end, a heterogeneous data fusion method is proposed to estimate travel time distributions by fusing heterogeneous data from point and interval detectors. In the proposed method, link travel time distributions are first estimated from point detector observations. The travel time distributions of links without point detectors are imputed based on their spatial correlations with links that have point detectors. The estimated link travel time distributions are then fused with path travel time distributions obtained from the interval detectors using Dempster-Shafer evidence theory. Based on fused path travel time distribution, an optimization technique is further introduced to update link travel time distributions and their spatial correlations. A case study was performed using real-world data from Hong Kong and showed that the proposed method obtained accurate and robust estimations of link and path travel time distributions in congested road networks.

Wireless sensor placement for structural monitoring using information-fusing firefly algorithm

NASA Astrophysics Data System (ADS)

Zhou, Guang-Dong; Yi, Ting-Hua; Xie, Mei-Xi; Li, Hong-Nan

2017-10-01

Wireless sensor networks (WSNs) are promising technology in structural health monitoring (SHM) applications for their low cost and high efficiency. The limited wireless sensors and restricted power resources in WSNs highlight the significance of optimal wireless sensor placement (OWSP) during designing SHM systems to enable the most useful information to be captured and to achieve the longest network lifetime. This paper presents a holistic approach, including an optimization criterion and a solution algorithm, for optimally deploying self-organizing multi-hop WSNs on large-scale structures. The combination of information effectiveness represented by the modal independence and the network performance specified by the network connectivity and network lifetime is first formulated to evaluate the performance of wireless sensor configurations. Then, an information-fusing firefly algorithm (IFFA) is developed to solve the OWSP problem. The step sizes drawn from a Lévy distribution are adopted to drive fireflies toward brighter individuals. Following the movement with Lévy flights, information about the contributions of wireless sensors to the objective function as carried by the fireflies is fused and applied to move inferior wireless sensors to better locations. The reliability of the proposed approach is verified via a numerical example on a long-span suspension bridge. The results demonstrate that the evaluation criterion provides a good performance metric of wireless sensor configurations, and the IFFA outperforms the simple discrete firefly algorithm.

Diverse Supramolecular Nanofiber Networks Assembled by Functional Low-Complexity Domains.

PubMed

An, Bolin; Wang, Xinyu; Cui, Mengkui; Gui, Xinrui; Mao, Xiuhai; Liu, Yan; Li, Ke; Chu, Cenfeng; Pu, Jiahua; Ren, Susu; Wang, Yanyi; Zhong, Guisheng; Lu, Timothy K; Liu, Cong; Zhong, Chao

2017-07-25

Self-assembling supramolecular nanofibers, common in the natural world, are of fundamental interest and technical importance to both nanotechnology and materials science. Despite important advances, synthetic nanofibers still lack the structural and functional diversity of biological molecules, and the controlled assembly of one type of molecule into a variety of fibrous structures with wide-ranging functional attributes remains challenging. Here, we harness the low-complexity (LC) sequence domain of fused in sarcoma (FUS) protein, an essential cellular nuclear protein with slow kinetics of amyloid fiber assembly, to construct random copolymer-like, multiblock, and self-sorted supramolecular fibrous networks with distinct structural features and fluorescent functionalities. We demonstrate the utilities of these networks in the templated, spatially controlled assembly of ligand-decorated gold nanoparticles, quantum dots, nanorods, DNA origami, and hybrid structures. Owing to the distinguishable nanoarchitectures of these nanofibers, this assembly is structure-dependent. By coupling a modular genetic strategy with kinetically controlled complex supramolecular self-assembly, we demonstrate that a single type of protein molecule can be used to engineer diverse one-dimensional supramolecular nanostructures with distinct functionalities.

Fused Smart Sensor Network for Multi-Axis Forward Kinematics Estimation in Industrial Robots

PubMed Central

Rodriguez-Donate, Carlos; Osornio-Rios, Roque Alfredo; Rivera-Guillen, Jesus Rooney; de Jesus Romero-Troncoso, Rene

2011-01-01

Flexible manipulator robots have a wide industrial application. Robot performance requires sensing its position and orientation adequately, known as forward kinematics. Commercially available, motion controllers use high-resolution optical encoders to sense the position of each joint which cannot detect some mechanical deformations that decrease the accuracy of the robot position and orientation. To overcome those problems, several sensor fusion methods have been proposed but at expenses of high-computational load, which avoids the online measurement of the joint’s angular position and the online forward kinematics estimation. The contribution of this work is to propose a fused smart sensor network to estimate the forward kinematics of an industrial robot. The developed smart processor uses Kalman filters to filter and to fuse the information of the sensor network. Two primary sensors are used: an optical encoder, and a 3-axis accelerometer. In order to obtain the position and orientation of each joint online a field-programmable gate array (FPGA) is used in the hardware implementation taking advantage of the parallel computation capabilities and reconfigurability of this device. With the aim of evaluating the smart sensor network performance, three real-operation-oriented paths are executed and monitored in a 6-degree of freedom robot. PMID:22163850

Enhanced dielectric standoff and mechanical failure in field-structured composites

NASA Astrophysics Data System (ADS)

Martin, James E.; Tigges, Chris P.; Anderson, Robert A.; Odinek, Judy

1999-09-01

We report dielectric breakdown experiments on electric-field-structured composites of high-dielectric-constant BaTiO3 particles in an epoxy resin. These experiments show a significant increase in the dielectric standoff strength perpendicular to the field structuring direction, relative to control samples consisting of randomly dispersed particles. To understand the relation of this observation to microstructure, we apply a simple resistor-short breakdown model to three-dimensional composite structures generated from a dynamical simulation. In this breakdown model the composite material is assumed to conduct primarily through particle contacts, so the simulated structures are mapped onto a resistor network where the center of mass of each particle is a node that is connected to neighboring nodes by resistors of fixed resistance that irreversibly short to perfect conductors when the current reaches a threshold value. This model gives relative breakdown voltages that are in good agreement with experimental results. Finally, we consider a primitive model of the mechanical strength of a field-structured composite material, which is a current-driven, conductor-insulator fuse model. This model leads to a macroscopic fusing behavior and can be related to mechanical failure of the composite.

[Evaluation of bond strength between low fusing porcelain with goldplated cobalt-chromium alloys].

PubMed

Guo, Jing; Zhu, Jia; Zhu, Hong-shui

2014-02-01

To evaluate the bond strength of Vita OMEGA 900 low fusing porcelain fused with the goldplated Wirobond cobalt-chrome metalt ceramic alloy. Low fusing porcelain was fused with the cobalt-chromium alloy strips(group A) and the goldplated cobalt-chromium alloy strips(group B) respectively according to ISO9693 (A:8,B:10). 8 specimens of each group were submitted to three point bending test. Two more test pieces fused with gold plated cobalt-chromium alloys were made (group B'). One test piece of both group B and group B' were observed under scanning electron microscope (SEM) randomly. The data was analyzed with SPSS 16.0 software package. The bond strength (MPa) of group A and group B was 29.92±4.28 and 28.20±5.21, respectively (P>0.05), both higher than 25 MPa required by ISO9693. SEM showed that Vita OMEGA 900 low fusing porcelain and the goldplated Wirobond cobalt-chrome metalt ceramic alloy combined together closely without cracks. Much gold was fused to the cobalt-chrome alloy surface of breaking porcelain specimen after testing. Vita OMEGA 900 low fusing porcelain can match with the goldplated Wirobond cobalt-chrome metalt ceramic alloy. Supported by Foundation of Education Department of Jiangxi Province (GJJ10367).

Comparative Effectiveness of Houghton Mifflin Harcourt Fuse: Algebra 1--A Report of Randomized Experiments in Four California Districts

ERIC Educational Resources Information Center

Toby, Megan; Ma, Boya; Lai, Garrett; Lin, Li; Jaciw, Andrew

2012-01-01

In spring 2010, Houghton Mifflin Harcourt (HMH) began planning a pilot of an application for the Apple iPad, "HMH Fuse: Algebra 1," which was then in development. The application was to be piloted in four California school districts during the 2010-2011 school year. HMH contracted with Empirical Education Inc. to conduct a one-year…

Effect of Aggregation Operators on Network-Based Disease Gene Prioritization: A Case Study on Blood Disorders.

PubMed

Grewal, Nivit; Singh, Shailendra; Chand, Trilok

2017-01-01

Owing to the innate noise in the biological data sources, a single source or a single measure do not suffice for an effective disease gene prioritization. So, the integration of multiple data sources or aggregation of multiple measures is the need of the hour. The aggregation operators combine multiple related data values to a single value such that the combined value has the effect of all the individual values. In this paper, an attempt has been made for applying the fuzzy aggregation on the network-based disease gene prioritization and investigate its effect under noise conditions. This study has been conducted for a set of 15 blood disorders by fusing four different network measures, computed from the protein interaction network, using a selected set of aggregation operators and ranking the genes on the basis of the aggregated value. The aggregation operator-based rankings have been compared with the "Random walk with restart" gene prioritization method. The impact of noise has also been investigated by adding varying proportions of noise to the seed set. The results reveal that for all the selected blood disorders, the Mean of Maximal operator has relatively outperformed the other aggregation operators for noisy as well as non-noisy data.

Comparative Effectiveness of Houghton Mifflin Harcourt Fuse: Algebra 1--A Report of Randomized Experiments in Four California Districts. Research Summary

ERIC Educational Resources Information Center

Empirical Education Inc., 2012

2012-01-01

In spring 2010, Houghton Mifflin Harcourt (HMH) began planning a pilot of an application for the Apple iPad, "HMH Fuse: Algebra 1," which was then in development. The application was to be piloted in four California school districts during the 2010-2011 school year. HMH contracted with Empirical Education Inc. to conduct a one-year…

Evaluation of the traffic parameters in a metropolitan area by fusing visual perceptions and CNN processing of webcam images.

PubMed

Faro, Alberto; Giordano, Daniela; Spampinato, Concetto

2008-06-01

This paper proposes a traffic monitoring architecture based on a high-speed communication network whose nodes are equipped with fuzzy processors and cellular neural network (CNN) embedded systems. It implements a real-time mobility information system where visual human perceptions sent by people working on the territory and video-sequences of traffic taken from webcams are jointly processed to evaluate the fundamental traffic parameters for every street of a metropolitan area. This paper presents the whole methodology for data collection and analysis and compares the accuracy and the processing time of the proposed soft computing techniques with other existing algorithms. Moreover, this paper discusses when and why it is recommended to fuse the visual perceptions of the traffic with the automated measurements taken from the webcams to compute the maximum traveling time that is likely needed to reach any destination in the traffic network.

Gene regulatory network inference using fused LASSO on multiple data sets

PubMed Central

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

2016-01-01

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

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

Recycling potential for low voltage and high voltage high rupturing capacity fuse links.

PubMed

Psomopoulos, Constantinos S; Barkas, Dimitrios A; Kaminaris, Stavros D; Ioannidis, George C; Karagiannopoulos, Panagiotis

2017-12-01

Low voltage and high voltage high-rupturing-capacity fuse links are used in LV and HV installations respectively, protecting mainly the LV and HV electricity distribution and transportation networks. The Waste Electrical and Electronic Equipment Directive (2002/96/EC) for "Waste of electrical and electronic equipment" is the main related legislation and as it concerns electrical and electronic equipment, it includes electric fuses. Although, the fuse links consist of recyclable materials, only small scale actions have been implemented for their recycling around Europe. This work presents the possibilities for material recovery from this specialized industrial waste for which there are only limited volume data. Furthermore, in order to present the huge possibilities and environmental benefits, it presents the potential for recycling of HRC fuses used by the Public Power Corporation of Greece, which is the major consumer for the country, but one of the smallest ones in Europe and globally, emphasizing in this way in the issue. According to the obtained results, fuse recycling could contribute to the effort for minimize the impacts on the environment through materials recovery and reduction of the wastes' volume disposed of in landfills. Copyright © 2017 Elsevier Ltd. All rights reserved.

Judgment of Nasolabial Esthetics in Cleft Lip and Palate Is Not Influenced by Overall Facial Attractiveness.

PubMed

Kocher, Katharina; Kowalski, Piotr; Kolokitha, Olga-Elpis; Katsaros, Christos; Fudalej, Piotr S

2016-05-01

To determine whether judgment of nasolabial esthetics in cleft lip and palate (CLP) is influenced by overall facial attractiveness. Experimental study. University of Bern, Switzerland. Seventy-two fused images (36 of boys, 36 of girls) were constructed. Each image comprised (1) the nasolabial region of a treated child with complete unilateral CLP (UCLP) and (2) the external facial features, i.e., the face with masked nasolabial region, of a noncleft child. Photographs of the nasolabial region of six boys and six girls with UCLP representing a wide range of esthetic outcomes, i.e., from very good to very poor appearance, were randomly chosen from a sample of 60 consecutively treated patients in whom nasolabial esthetics had been rated in a previous study. Photographs of external facial features of six boys and six girls without UCLP with various esthetics were randomly selected from patients' files. Eight lay raters evaluated the fused images using a 100-mm visual analogue scale. Method reliability was assessed by reevaluation of fused images after >1 month. A regression model was used to analyze which elements of facial esthetics influenced the perception of nasolabial appearance. Method reliability was good. A regression analysis demonstrated that only the appearance of the nasolabial area affected the esthetic scores of fused images (coefficient = -11.44; P < .001; R(2) = 0.464). The appearance of the external facial features did not influence perceptions of fused images. Cropping facial images for assessment of nasolabial appearance in CLP seems unnecessary. Instead, esthetic evaluation can be performed on images of full faces.

[Study on content of nickel in saliva released from the nickel-chromium and the nickel-chromium-titanium porcelain alloy].

PubMed

Wang, Wen-Jie; Zhang, Tai-Qiang; Wei, Hong

2010-02-01

The purpose of the study was to investigate the content of nickel (Ni) ion in patients' saliva after wearing the porcelain-fused-to nickel-chromium (Ni-Cr) crown or the porcelain-fused-to nickel-chromium-titanium(Ni-Cr-Ti) crown. 50 patients who had one molar or premolar needed repairing were selected and divided into two groups randomly. Patients in one group were fabricated with porcelain-fused-to Ni-Cr crown and the patients in the other group were fabricated with porcelain-fused-to Ni-Cr-Ti crown. Collect the patients' saliva before wearing, 1 week, 3 months, and 6 months after wearing. The content of Ni ion in saliva was detected by inductively coupled plasma mass spectrometry (ICP-MS). The content of Ni ion in both groups increased at the first week, and go back after 6 months. There were no significant differences before wearing, 1 week, 3 months, and 6 months after wearing. There were no significant differences between the two groups. Wearing the porcelain-fused-to Ni-Cr crown or the porcelain-fused-to Ni-Cr-Ti crown has no significant influence on the content of Ni ion in saliva.

Holistic Network Defense: Fusing Host and Network Features for Attack Classification

DTIC Science & Technology

2011-03-01

Measures for Anomaly Detection," IEEE Symposium on Security and Privacy, Oakland, CA, (May 2001). 33. Mahoney , Matthew V, and Phillip K. Chan...University of London, August 2005. 44. Newman , Daniel, Kristina M. Manalo, and Ed Tittel. "Intrusion Detection Overview," InformIT, (June 2004). 20 Feb

Evidence reasoning method for constructing conditional probability tables in a Bayesian network of multimorbidity.

PubMed

Du, Yuanwei; Guo, Yubin

2015-01-01

The intrinsic mechanism of multimorbidity is difficult to recognize and prediction and diagnosis are difficult to carry out accordingly. Bayesian networks can help to diagnose multimorbidity in health care, but it is difficult to obtain the conditional probability table (CPT) because of the lack of clinically statistical data. Today, expert knowledge and experience are increasingly used in training Bayesian networks in order to help predict or diagnose diseases, but the CPT in Bayesian networks is usually irrational or ineffective for ignoring realistic constraints especially in multimorbidity. In order to solve these problems, an evidence reasoning (ER) approach is employed to extract and fuse inference data from experts using a belief distribution and recursive ER algorithm, based on which evidence reasoning method for constructing conditional probability tables in Bayesian network of multimorbidity is presented step by step. A multimorbidity numerical example is used to demonstrate the method and prove its feasibility and application. Bayesian network can be determined as long as the inference assessment is inferred by each expert according to his/her knowledge or experience. Our method is more effective than existing methods for extracting expert inference data accurately and is fused effectively for constructing CPTs in a Bayesian network of multimorbidity.

Fully Convolutional Network-Based Multifocus Image Fusion.

PubMed

Guo, Xiaopeng; Nie, Rencan; Cao, Jinde; Zhou, Dongming; Qian, Wenhua

2018-07-01

As the optical lenses for cameras always have limited depth of field, the captured images with the same scene are not all in focus. Multifocus image fusion is an efficient technology that can synthesize an all-in-focus image using several partially focused images. Previous methods have accomplished the fusion task in spatial or transform domains. However, fusion rules are always a problem in most methods. In this letter, from the aspect of focus region detection, we propose a novel multifocus image fusion method based on a fully convolutional network (FCN) learned from synthesized multifocus images. The primary novelty of this method is that the pixel-wise focus regions are detected through a learning FCN, and the entire image, not just the image patches, are exploited to train the FCN. First, we synthesize 4500 pairs of multifocus images by repeatedly using a gaussian filter for each image from PASCAL VOC 2012, to train the FCN. After that, a pair of source images is fed into the trained FCN, and two score maps indicating the focus property are generated. Next, an inversed score map is averaged with another score map to produce an aggregative score map, which take full advantage of focus probabilities in two score maps. We implement the fully connected conditional random field (CRF) on the aggregative score map to accomplish and refine a binary decision map for the fusion task. Finally, we exploit the weighted strategy based on the refined decision map to produce the fused image. To demonstrate the performance of the proposed method, we compare its fused results with several start-of-the-art methods not only on a gray data set but also on a color data set. Experimental results show that the proposed method can achieve superior fusion performance in both human visual quality and objective assessment.

Dual-Tree Complex Wavelet Transform and Image Block Residual-Based Multi-Focus Image Fusion in Visual Sensor Networks

PubMed Central

Yang, Yong; Tong, Song; Huang, Shuying; Lin, Pan

2014-01-01

This paper presents a novel framework for the fusion of multi-focus images explicitly designed for visual sensor network (VSN) environments. Multi-scale based fusion methods can often obtain fused images with good visual effect. However, because of the defects of the fusion rules, it is almost impossible to completely avoid the loss of useful information in the thus obtained fused images. The proposed fusion scheme can be divided into two processes: initial fusion and final fusion. The initial fusion is based on a dual-tree complex wavelet transform (DTCWT). The Sum-Modified-Laplacian (SML)-based visual contrast and SML are employed to fuse the low- and high-frequency coefficients, respectively, and an initial composited image is obtained. In the final fusion process, the image block residuals technique and consistency verification are used to detect the focusing areas and then a decision map is obtained. The map is used to guide how to achieve the final fused image. The performance of the proposed method was extensively tested on a number of multi-focus images, including no-referenced images, referenced images, and images with different noise levels. The experimental results clearly indicate that the proposed method outperformed various state-of-the-art fusion methods, in terms of both subjective and objective evaluations, and is more suitable for VSNs. PMID:25587878

Dual-tree complex wavelet transform and image block residual-based multi-focus image fusion in visual sensor networks.

PubMed

Yang, Yong; Tong, Song; Huang, Shuying; Lin, Pan

2014-11-26

This paper presents a novel framework for the fusion of multi-focus images explicitly designed for visual sensor network (VSN) environments. Multi-scale based fusion methods can often obtain fused images with good visual effect. However, because of the defects of the fusion rules, it is almost impossible to completely avoid the loss of useful information in the thus obtained fused images. The proposed fusion scheme can be divided into two processes: initial fusion and final fusion. The initial fusion is based on a dual-tree complex wavelet transform (DTCWT). The Sum-Modified-Laplacian (SML)-based visual contrast and SML are employed to fuse the low- and high-frequency coefficients, respectively, and an initial composited image is obtained. In the final fusion process, the image block residuals technique and consistency verification are used to detect the focusing areas and then a decision map is obtained. The map is used to guide how to achieve the final fused image. The performance of the proposed method was extensively tested on a number of multi-focus images, including no-referenced images, referenced images, and images with different noise levels. The experimental results clearly indicate that the proposed method outperformed various state-of-the-art fusion methods, in terms of both subjective and objective evaluations, and is more suitable for VSNs.

TANDI: threat assessment of network data and information

NASA Astrophysics Data System (ADS)

Holsopple, Jared; Yang, Shanchieh Jay; Sudit, Moises

2006-04-01

Current practice for combating cyber attacks typically use Intrusion Detection Sensors (IDSs) to passively detect and block multi-stage attacks. This work leverages Level-2 fusion that correlates IDS alerts belonging to the same attacker, and proposes a threat assessment algorithm to predict potential future attacker actions. The algorithm, TANDI, reduces the problem complexity by separating the models of the attacker's capability and opportunity, and fuse the two to determine the attacker's intent. Unlike traditional Bayesian-based approaches, which require assigning a large number of edge probabilities, the proposed Level-3 fusion procedure uses only 4 parameters. TANDI has been implemented and tested with randomly created attack sequences. The results demonstrate that TANDI predicts future attack actions accurately as long as the attack is not part of a coordinated attack and contains no insider threats. In the presence of abnormal attack events, TANDI will alarm the network analyst for further analysis. The attempt to evaluate a threat assessment algorithm via simulation is the first in the literature, and shall open up a new avenue in the area of high level fusion.

A Fusion Architecture for Tracking a Group of People Using a Distributed Sensor Network

DTIC Science & Technology

2013-07-01

Determining the composition of the group is done using several classifiers. The fusion is done at the UGS level to fuse information from all the modalities to...to classification and counting of the targets. Section III also presents the algorithms for fusion of distributed sensor data at the UGS level and...ultrasonic sensors. Determining the composition of the group is done using several classifiers. The fusion is done at the UGS level to fuse

Infrared and visible image fusion based on robust principal component analysis and compressed sensing

NASA Astrophysics Data System (ADS)

Li, Jun; Song, Minghui; Peng, Yuanxi

2018-03-01

Current infrared and visible image fusion methods do not achieve adequate information extraction, i.e., they cannot extract the target information from infrared images while retaining the background information from visible images. Moreover, most of them have high complexity and are time-consuming. This paper proposes an efficient image fusion framework for infrared and visible images on the basis of robust principal component analysis (RPCA) and compressed sensing (CS). The novel framework consists of three phases. First, RPCA decomposition is applied to the infrared and visible images to obtain their sparse and low-rank components, which represent the salient features and background information of the images, respectively. Second, the sparse and low-rank coefficients are fused by different strategies. On the one hand, the measurements of the sparse coefficients are obtained by the random Gaussian matrix, and they are then fused by the standard deviation (SD) based fusion rule. Next, the fused sparse component is obtained by reconstructing the result of the fused measurement using the fast continuous linearized augmented Lagrangian algorithm (FCLALM). On the other hand, the low-rank coefficients are fused using the max-absolute rule. Subsequently, the fused image is superposed by the fused sparse and low-rank components. For comparison, several popular fusion algorithms are tested experimentally. By comparing the fused results subjectively and objectively, we find that the proposed framework can extract the infrared targets while retaining the background information in the visible images. Thus, it exhibits state-of-the-art performance in terms of both fusion effects and timeliness.

Using random forests to diagnose aviation turbulence.

PubMed

Williams, John K

Atmospheric turbulence poses a significant hazard to aviation, with severe encounters costing airlines millions of dollars per year in compensation, aircraft damage, and delays due to required post-event inspections and repairs. Moreover, attempts to avoid turbulent airspace cause flight delays and en route deviations that increase air traffic controller workload, disrupt schedules of air crews and passengers and use extra fuel. For these reasons, the Federal Aviation Administration and the National Aeronautics and Space Administration have funded the development of automated turbulence detection, diagnosis and forecasting products. This paper describes a methodology for fusing data from diverse sources and producing a real-time diagnosis of turbulence associated with thunderstorms, a significant cause of weather delays and turbulence encounters that is not well-addressed by current turbulence forecasts. The data fusion algorithm is trained using a retrospective dataset that includes objective turbulence reports from commercial aircraft and collocated predictor data. It is evaluated on an independent test set using several performance metrics including receiver operating characteristic curves, which are used for FAA turbulence product evaluations prior to their deployment. A prototype implementation fuses data from Doppler radar, geostationary satellites, a lightning detection network and a numerical weather prediction model to produce deterministic and probabilistic turbulence assessments suitable for use by air traffic managers, dispatchers and pilots. The algorithm is scheduled to be operationally implemented at the National Weather Service's Aviation Weather Center in 2014.

A Novel Group-Fused Sparse Partial Correlation Method for Simultaneous Estimation of Functional Networks in Group Comparison Studies.

PubMed

Liang, Xiaoyun; Vaughan, David N; Connelly, Alan; Calamante, Fernando

2018-05-01

The conventional way to estimate functional networks is primarily based on Pearson correlation along with classic Fisher Z test. In general, networks are usually calculated at the individual-level and subsequently aggregated to obtain group-level networks. However, such estimated networks are inevitably affected by the inherent large inter-subject variability. A joint graphical model with Stability Selection (JGMSS) method was recently shown to effectively reduce inter-subject variability, mainly caused by confounding variations, by simultaneously estimating individual-level networks from a group. However, its benefits might be compromised when two groups are being compared, given that JGMSS is blinded to other groups when it is applied to estimate networks from a given group. We propose a novel method for robustly estimating networks from two groups by using group-fused multiple graphical-lasso combined with stability selection, named GMGLASS. Specifically, by simultaneously estimating similar within-group networks and between-group difference, it is possible to address inter-subject variability of estimated individual networks inherently related with existing methods such as Fisher Z test, and issues related to JGMSS ignoring between-group information in group comparisons. To evaluate the performance of GMGLASS in terms of a few key network metrics, as well as to compare with JGMSS and Fisher Z test, they are applied to both simulated and in vivo data. As a method aiming for group comparison studies, our study involves two groups for each case, i.e., normal control and patient groups; for in vivo data, we focus on a group of patients with right mesial temporal lobe epilepsy.

Useful diagnostic biometabolic data obtained by PET/CT and MR fusion imaging using open source software.

PubMed

Antonica, Filippo; Asabella, Artor Niccoli; Ferrari, Cristina; Rubini, Domenico; Notaristefano, Antonio; Nicoletti, Adriano; Altini, Corinna; Merenda, Nunzio; Mossa, Emilio; Guarini, Attilio; Rubini, Giuseppe

2014-01-01

In the last decade numerous attempts were considered to co-register and integrate different imaging data. Like PET/CT the integration of PET to MR showed great interest. PET/MR scanners are recently tested on different distrectual or systemic pathologies. Unfortunately PET/MR scanners are expensive and diagnostic protocols are still under studies and investigations. Nuclear Medicine imaging highlights functional and biometabolic information but has poor anatomic details. The aim of this study is to integrate MR and PET data to produce distrectual or whole body fused images acquired from different scanners even in different days. We propose an offline method to fuse PET with MR data using an open-source software that has to be inexpensive, reproducible and capable to exchange data over the network. We also evaluate global quality, alignment quality, and diagnostic confidence of fused PET-MR images. We selected PET/CT studies performed in our Nuclear Medicine unit, MR studies provided by patients on DICOM CD media or network received. We used Osirix 5.7 open source version. We aligned CT slices with the first MR slice, pointed and marked for co-registration using MR-T1 sequence and CT as reference and fused with PET to produce a PET-MR image. A total of 100 PET/CT studies were fused with the following MR studies: 20 head, 15 thorax, 24 abdomen, 31 pelvis, 10 whole body. An interval of no more than 15 days between PET and MR was the inclusion criteria. PET/CT, MR and fused studies were evaluated by two experienced radiologist and two experienced nuclear medicine physicians. Each one filled a five point based evaluation scoring scheme based on image quality, image artifacts, segmentation errors, fusion misalignment and diagnostic confidence. Our fusion method showed best results for head, thorax and pelvic districts in terms of global quality, alignment quality and diagnostic confidence,while for the abdomen and pelvis alignement quality and global quality resulted poor due to internal organs filling variation and time shifting beetwen examinations. PET/CT images with time of flight reconstruction and real attenuation correction were combined with anatomical detailed MRI images. We used Osirix, an image processing Open Source Software dedicated to DICOM images. No additional costs, to buy and upgrade proprietary software are required for combining data. No high technology or very expensive PET/MR scanner, that requires dedicated shielded room spaces and personnel to be employed or to be trained, are needed. Our method allows to share patient PET/MR fused data with different medical staff using dedicated networks. The proposed method may be applied to every MR sequence (MR-DWI and MR-STIR, magnet enhanced sequences) to characterize soft tissue alterations and improve discrimination diseases. It can be applied not only to PET with MR but virtually to every DICOM study.

LABRADOR: a learning autonomous behavior-based robot for adaptive detection and object retrieval

NASA Astrophysics Data System (ADS)

Yamauchi, Brian; Moseley, Mark; Brookshire, Jonathan

2013-01-01

As part of the TARDEC-funded CANINE (Cooperative Autonomous Navigation in a Networked Environment) Program, iRobot developed LABRADOR (Learning Autonomous Behavior-based Robot for Adaptive Detection and Object Retrieval). LABRADOR was based on the rugged, man-portable, iRobot PackBot unmanned ground vehicle (UGV) equipped with an explosives ordnance disposal (EOD) manipulator arm and a custom gripper. For LABRADOR, we developed a vision-based object learning and recognition system that combined a TLD (track-learn-detect) filter based on object shape features with a color-histogram-based object detector. Our vision system was able to learn in real-time to recognize objects presented to the robot. We also implemented a waypoint navigation system based on fused GPS, IMU (inertial measurement unit), and odometry data. We used this navigation capability to implement autonomous behaviors capable of searching a specified area using a variety of robust coverage strategies - including outward spiral, random bounce, random waypoint, and perimeter following behaviors. While the full system was not integrated in time to compete in the CANINE competition event, we developed useful perception, navigation, and behavior capabilities that may be applied to future autonomous robot systems.

Physarum polycephalum Percolation as a Paradigm for Topological Phase Transitions in Transportation Networks

NASA Astrophysics Data System (ADS)

Fessel, Adrian; Oettmeier, Christina; Bernitt, Erik; Gauthier, Nils C.; Döbereiner, Hans-Günther

2012-08-01

We study the formation of transportation networks of the true slime mold Physarum polycephalum after fragmentation by shear. Small fragments, called microplasmodia, fuse to form macroplasmodia in a percolation transition. At this topological phase transition, one single giant component forms, connecting most of the previously isolated microplasmodia. Employing the configuration model of graph theory for small link degree, we have found analytically an exact solution for the phase transition. It is generally applicable to percolation as seen, e.g., in vascular networks.

Diffuse prior monotonic likelihood ratio test for evaluation of fused image quality measures.

PubMed

Wei, Chuanming; Kaplan, Lance M; Burks, Stephen D; Blum, Rick S

2011-02-01

This paper introduces a novel method to score how well proposed fused image quality measures (FIQMs) indicate the effectiveness of humans to detect targets in fused imagery. The human detection performance is measured via human perception experiments. A good FIQM should relate to perception results in a monotonic fashion. The method computes a new diffuse prior monotonic likelihood ratio (DPMLR) to facilitate the comparison of the H(1) hypothesis that the intrinsic human detection performance is related to the FIQM via a monotonic function against the null hypothesis that the detection and image quality relationship is random. The paper discusses many interesting properties of the DPMLR and demonstrates the effectiveness of the DPMLR test via Monte Carlo simulations. Finally, the DPMLR is used to score FIQMs with test cases considering over 35 scenes and various image fusion algorithms.

A pre-trained convolutional neural network based method for thyroid nodule diagnosis.

PubMed

Ma, Jinlian; Wu, Fa; Zhu, Jiang; Xu, Dong; Kong, Dexing

2017-01-01

In ultrasound images, most thyroid nodules are in heterogeneous appearances with various internal components and also have vague boundaries, so it is difficult for physicians to discriminate malignant thyroid nodules from benign ones. In this study, we propose a hybrid method for thyroid nodule diagnosis, which is a fusion of two pre-trained convolutional neural networks (CNNs) with different convolutional layers and fully-connected layers. Firstly, the two networks pre-trained with ImageNet database are separately trained. Secondly, we fuse feature maps learned by trained convolutional filters, pooling and normalization operations of the two CNNs. Finally, with the fused feature maps, a softmax classifier is used to diagnose thyroid nodules. The proposed method is validated on 15,000 ultrasound images collected from two local hospitals. Experiment results show that the proposed CNN based methods can accurately and effectively diagnose thyroid nodules. In addition, the fusion of the two CNN based models lead to significant performance improvement, with an accuracy of 83.02%±0.72%. These demonstrate the potential clinical applications of this method. Copyright © 2016 Elsevier B.V. All rights reserved.

Automatic classification of retinal three-dimensional optical coherence tomography images using principal component analysis network with composite kernels

NASA Astrophysics Data System (ADS)

Fang, Leyuan; Wang, Chong; Li, Shutao; Yan, Jun; Chen, Xiangdong; Rabbani, Hossein

2017-11-01

We present an automatic method, termed as the principal component analysis network with composite kernel (PCANet-CK), for the classification of three-dimensional (3-D) retinal optical coherence tomography (OCT) images. Specifically, the proposed PCANet-CK method first utilizes the PCANet to automatically learn features from each B-scan of the 3-D retinal OCT images. Then, multiple kernels are separately applied to a set of very important features of the B-scans and these kernels are fused together, which can jointly exploit the correlations among features of the 3-D OCT images. Finally, the fused (composite) kernel is incorporated into an extreme learning machine for the OCT image classification. We tested our proposed algorithm on two real 3-D spectral domain OCT (SD-OCT) datasets (of normal subjects and subjects with the macular edema and age-related macular degeneration), which demonstrated its effectiveness.

A Multi-modal, Discriminative and Spatially Invariant CNN for RGB-D Object Labeling.

PubMed

Asif, Umar; Bennamoun, Mohammed; Sohel, Ferdous

2017-08-30

While deep convolutional neural networks have shown a remarkable success in image classification, the problems of inter-class similarities, intra-class variances, the effective combination of multimodal data, and the spatial variability in images of objects remain to be major challenges. To address these problems, this paper proposes a novel framework to learn a discriminative and spatially invariant classification model for object and indoor scene recognition using multimodal RGB-D imagery. This is achieved through three postulates: 1) spatial invariance - this is achieved by combining a spatial transformer network with a deep convolutional neural network to learn features which are invariant to spatial translations, rotations, and scale changes, 2) high discriminative capability - this is achieved by introducing Fisher encoding within the CNN architecture to learn features which have small inter-class similarities and large intra-class compactness, and 3) multimodal hierarchical fusion - this is achieved through the regularization of semantic segmentation to a multi-modal CNN architecture, where class probabilities are estimated at different hierarchical levels (i.e., imageand pixel-levels), and fused into a Conditional Random Field (CRF)- based inference hypothesis, the optimization of which produces consistent class labels in RGB-D images. Extensive experimental evaluations on RGB-D object and scene datasets, and live video streams (acquired from Kinect) show that our framework produces superior object and scene classification results compared to the state-of-the-art methods.

PET-CT image fusion using random forest and à-trous wavelet transform.

PubMed

Seal, Ayan; Bhattacharjee, Debotosh; Nasipuri, Mita; Rodríguez-Esparragón, Dionisio; Menasalvas, Ernestina; Gonzalo-Martin, Consuelo

2018-03-01

New image fusion rules for multimodal medical images are proposed in this work. Image fusion rules are defined by random forest learning algorithm and a translation-invariant à-trous wavelet transform (AWT). The proposed method is threefold. First, source images are decomposed into approximation and detail coefficients using AWT. Second, random forest is used to choose pixels from the approximation and detail coefficients for forming the approximation and detail coefficients of the fused image. Lastly, inverse AWT is applied to reconstruct fused image. All experiments have been performed on 198 slices of both computed tomography and positron emission tomography images of a patient. A traditional fusion method based on Mallat wavelet transform has also been implemented on these slices. A new image fusion performance measure along with 4 existing measures has been presented, which helps to compare the performance of 2 pixel level fusion methods. The experimental results clearly indicate that the proposed method outperforms the traditional method in terms of visual and quantitative qualities and the new measure is meaningful. Copyright © 2017 John Wiley & Sons, Ltd.

[A comparative study of marginal microleakage using different cements in porcelain-fused-to-metal crown].

PubMed

Jiang, Ming-Xin; Huang, Ke-Qiang; Li, Zhi-Gang; Gao, Xiu-Qiu; Li, Chun-Shan

2011-04-01

To evaluate the marginal microleakage of porcelain-fused-to-metal crown using four different cements. Sixteen porcelain-fused-to-metal crowns were built and randomly divided into 4 group, luted onto standard prepared human forward molars using four different cements (glass ionomer cement, resin-modified glass ionomer cement, PanaviaF, Super-Bond C&B adhesive luting system). After temperature cycling test, all the crowns were then submerged in 2% fuchsin for 24 h. The marginal microleakage at tooth cement interfaces was observed using light stereomicroscopy and evaluated in classification index. The marginal microleakage grade of 4 groups were analyzed by SPSS 13.0. The PanaviaF demonstrated the least marginal microleakage, Super-Bond C&B adhesive luting system, resin-modified glass ionomer cement showed an intermediate level of marginal microleakage, glass ionomer cement was associated with severe marginal microleakage (total, Chi2 = 157.60, P < 0.01; among the different groups, P<0.05). Adhesive resin luting system which is the first selection in clinical is better than glass ionomer cement and is good at porcelain-fused-to-metal crown.

Probability of conductive bond formation in a percolating network of nanowires with fusible tips

NASA Astrophysics Data System (ADS)

Rykaczewski, Konrad; Wang, Robert Y.

2018-03-01

Meeting the heat dissipation demands of microelectronic devices requires development of polymeric composites with high thermal conductivity. This property is drastically improved by percolation networks of metallic filler particles that have their particle-to-particle contact resistances reduced through thermal or electromagnetic fusing. However, composites with fused metallic fillers are electrically conductive, which prevents their application within the chip-board and the inter-chip gaps. Here, we propose that electrically insulating composites for these purposes can be achieved by the application of fusible metallic coatings to the tips of nanowires with thermally conductive but electrically insulating cores. We derive analytical models that relate the ratio of the coated and total nanowire lengths to the fraction of fused, and thus conductive, bonds within percolating networks of these structures. We consider two types of materials for these fusible coatings. First, we consider silver-like coatings, which form only conductive bonds when contacting the silver-like coating of another nanowire. Second, we consider liquid metal-like coatings, which form conductive bonds regardless of whether they contact a coated or an uncoated segment of another nanowire. These models were validated using Monte Carlo simulations, which also revealed that electrical short-circuiting is highly unlikely until most of the wire is coated. Furthermore, we demonstrate that switching the tip coating from silver- to liquid metal-like materials can double the fraction of conductive bonds. Consequently, this work provides motivation to develop scalable methods for fabrication of the hybrid liquid-coated nanowires, whose dispersion in a polymer matrix is predicted to yield highly thermally conductive but electrically insulating composites.

Transforaminal lumbar interbody graft placement using an articulating delivery arm facilitates increased segmental lordosis with superior anterior and midline graft placement.

PubMed

Shau, David N; Parker, Scott L; Mendenhall, Stephen K; Zuckerman, Scott L; Godil, Saniya S; Devin, Clinton J; McGirt, Matthew J

2015-05-01

Transforaminal lumbar interbody fusion (TLIF) is a frequently performed method of lumbar arthrodesis in patients failing medical management of back and leg pain. Accurate placement of the interbody graft and restoration of lordosis has been shown to be crucial when performing lumbar fusion procedures. We performed a single-surgeon, prospective, randomized study to determine whether a novel articulating versus traditional straight graft delivery arm system allows for superior graft placement and increased lordosis for single-level TLIF. Thirty consecutive patients undergoing single-level TLIF were included and prospectively randomized to one of the 2 groups (articulated vs. straight delivery arm system). Three radiographic characteristics were evaluated at 6-week follow-up: (1) degree of segmental lumbar lordosis at the fused level; (2) the percent anterior location of the interbody graft in disk space; and (3) the distance (mm) off midline of the interbody graft placement. Randomization yielded 16 patients in the articulated delivery arm cohort and 14 in the straight delivery arm cohort. The articulating delivery arm system yielded an average of 14.7-degree segmental lordosis at fused level, 35% anterior location, and 3.6 mm off midline. The straight delivery arm system yielded an average of 10.7-degree segmental lordosis at fused level, 46% anterior location, and 7.0 mm off midline. All 3 comparisons were statistically significant (P<0.05). The study suggests that an articulating delivery arm system facilitates superior anterior and midline TLIF graft placement allowing for increased segmental lordosis compared with a traditional straight delivery arm system.

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Preventing Terrorism Using Information Sharing Networks

DTIC Science & Technology

2006-09-01

in fusing information and providing valuable intelligence that thwarted a terrorist attack at Disneyland . A videotape was received that contained a...creditable threat of a Sarin gas attack at Disneyland . The LA TEW conducted the initial analysis of the tape and the initial investigation that

The FUSE Survey of Algol-Type Interacting Binary Systems

NASA Astrophysics Data System (ADS)

Peters, Geraldine J.; Andersson, B.; Ake, T. B.; Sankrit, R.

2006-12-01

A survey of Algol binaries at random phases is currently being carried through with the FUSE spacecraft as part of the FUSE survey and supplemental program. A similar program was undertaken in FUSE Cycle 3. Both programs have produced multiple observations of 12 Algol systems with periods ranging from 1.2 37 d and include direct-impact and disk systems. We report on the status of the program. The absence of O VI absorption in the systems observed to date allows us to place an upper limit on the column density and temperature of the High Temperature Accretion Region, HTAR ( 100,000 K) confirmed in some Algols from earlier IUE data. The HTAR plasma component appears to be distinct from an O VI-emitting polar plasma discovered in FUSE totality observations of RY Per, V356 Sgr, and TT Hya. New observations of the direct-impact system U Cep have provided more information on the geometry and mass flow (including a splash plasma) in the vicinity of a hot spot at phase 0.90 that was discovered earlier. The extent of disk asymmetries in the long period ( 33 d) systems SX Cas and RX Cas is discussed. Models for direct-impact and the disk systems will be presented. The authors appreciate support from NASA grants NAG5-12253, NNG04GL17G, and NAS5-32985.

Community Seismic Network (CSN)

NASA Astrophysics Data System (ADS)

Clayton, R. W.; Heaton, T. H.; Kohler, M. D.; Cheng, M.; Guy, R.; Chandy, M.; Krause, A.; Bunn, J.; Olson, M.; Faulkner, M.; Liu, A.; Strand, L.

2012-12-01

We report on developments in sensor connectivity, architecture, and data fusion algorithms executed in Cloud computing systems in the Community Seismic Network (CSN), a network of low-cost sensors housed in homes and offices by volunteers in the Pasadena, CA area. The network has over 200 sensors continuously reporting anomalies in local acceleration through the Internet to a Cloud computing service (the Google App Engine) that continually fuses sensor data to rapidly detect shaking from earthquakes. The Cloud computing system consists of data centers geographically distributed across the continent and is likely to be resilient even during earthquakes and other local disasters. The region of Southern California is partitioned in a multi-grid style into sets of telescoping cells called geocells. Data streams from sensors within a geocell are fused to detect anomalous shaking across the geocell. Temporal spatial patterns across geocells are used to detect anomalies across regions. The challenge is to detect earthquakes rapidly with an extremely low false positive rate. We report on two data fusion algorithms, one that tessellates the surface so as to fuse data from a large region around Pasadena and the other, which uses a standard tessellation of equal-sized cells. Since September 2011, the network has successfully detected earthquakes of magnitude 2.5 or higher within 40 Km of Pasadena. In addition to the standard USB device, which connects to the host's computer, we have developed a stand-alone sensor that directly connects to the internet via Ethernet or wifi. This bypasses security concerns that some companies have with the USB-connected devices, and allows for 24/7 monitoring at sites that would otherwise shut down their computers after working hours. In buildings we use the sensors to model the behavior of the structures during weak events in order to understand how they will perform during strong events. Visualization models of instrumented buildings ranging between five and 22 stories tall have been constructed using Google SketchUp. Ambient vibration records are used to identify the first set of horizontal vibrational modal frequencies of the buildings. These frequencies are used to compute the response on every floor of the building, given either observed data or scenario ground motion input at the buildings' base.

Illustration of distributed generation effects on protection system coordination

NASA Astrophysics Data System (ADS)

Alawami, Hussain Adnan

Environmental concerns, market forces, and emergence of new technologies have recently resulted in restructuring electric utility from vertically integrated networks to competitive deregulated entities. Distributed generation (DG) is playing a major role in such deregulated markets. When they are installed in small amounts and small sizes, their impacts on the system may be negligible. When their penetration levels increase as well as their sizes, however, they may start affecting the system performance from more than one aspect. Power system protection needs to be re-assessed after the emergence of DG. This thesis attempts to illustrate the impact of DG on the power system protection coordination. It will study the operation of the impedance relays, fuses, reclosers and overcurrent relays when a DG is added to the distribution network. Different DG sizes, distances from the network and locations within the distribution system will be considered. Power system protection coordination is very sensitive to the DG size where it is not for the DG distance. DG location has direct impact on the operation of the protective devices especially when it is inserted in the middle point of the distribution system. Key Words, Distributed Generation, Impedance relay, fuses, reclosers, overcurrent relays, power system protection coordination.

Brain Atlas Fusion from High-Thickness Diagnostic Magnetic Resonance Images by Learning-Based Super-Resolution

PubMed Central

Zhang, Jinpeng; Zhang, Lichi; Xiang, Lei; Shao, Yeqin; Wu, Guorong; Zhou, Xiaodong; Shen, Dinggang; Wang, Qian

2017-01-01

It is fundamentally important to fuse the brain atlas from magnetic resonance (MR) images for many imaging-based studies. Most existing works focus on fusing the atlases from high-quality MR images. However, for low-quality diagnostic images (i.e., with high inter-slice thickness), the problem of atlas fusion has not been addressed yet. In this paper, we intend to fuse the brain atlas from the high-thickness diagnostic MR images that are prevalent for clinical routines. The main idea of our works is to extend the conventional groupwise registration by incorporating a novel super-resolution strategy. The contribution of the proposed super-resolution framework is two-fold. First, each high-thickness subject image is reconstructed to be isotropic by the patch-based sparsity learning. Then, the reconstructed isotropic image is enhanced for better quality through the random-forest-based regression model. In this way, the images obtained by the super-resolution strategy can be fused together by applying the groupwise registration method to construct the required atlas. Our experiments have shown that the proposed framework can effectively solve the problem of atlas fusion from the low-quality brain MR images. PMID:29062159

Brain Atlas Fusion from High-Thickness Diagnostic Magnetic Resonance Images by Learning-Based Super-Resolution.

PubMed

Zhang, Jinpeng; Zhang, Lichi; Xiang, Lei; Shao, Yeqin; Wu, Guorong; Zhou, Xiaodong; Shen, Dinggang; Wang, Qian

2017-03-01

It is fundamentally important to fuse the brain atlas from magnetic resonance (MR) images for many imaging-based studies. Most existing works focus on fusing the atlases from high-quality MR images. However, for low-quality diagnostic images (i.e., with high inter-slice thickness), the problem of atlas fusion has not been addressed yet. In this paper, we intend to fuse the brain atlas from the high-thickness diagnostic MR images that are prevalent for clinical routines. The main idea of our works is to extend the conventional groupwise registration by incorporating a novel super-resolution strategy. The contribution of the proposed super-resolution framework is two-fold. First, each high-thickness subject image is reconstructed to be isotropic by the patch-based sparsity learning. Then, the reconstructed isotropic image is enhanced for better quality through the random-forest-based regression model. In this way, the images obtained by the super-resolution strategy can be fused together by applying the groupwise registration method to construct the required atlas. Our experiments have shown that the proposed framework can effectively solve the problem of atlas fusion from the low-quality brain MR images.

Automatic classification of retinal three-dimensional optical coherence tomography images using principal component analysis network with composite kernels.

PubMed

Fang, Leyuan; Wang, Chong; Li, Shutao; Yan, Jun; Chen, Xiangdong; Rabbani, Hossein

2017-11-01

We present an automatic method, termed as the principal component analysis network with composite kernel (PCANet-CK), for the classification of three-dimensional (3-D) retinal optical coherence tomography (OCT) images. Specifically, the proposed PCANet-CK method first utilizes the PCANet to automatically learn features from each B-scan of the 3-D retinal OCT images. Then, multiple kernels are separately applied to a set of very important features of the B-scans and these kernels are fused together, which can jointly exploit the correlations among features of the 3-D OCT images. Finally, the fused (composite) kernel is incorporated into an extreme learning machine for the OCT image classification. We tested our proposed algorithm on two real 3-D spectral domain OCT (SD-OCT) datasets (of normal subjects and subjects with the macular edema and age-related macular degeneration), which demonstrated its effectiveness. (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE).

The N and C Termini of ZO-1 Are Surrounded by Distinct Proteins and Functional Protein Networks*

PubMed Central

Van Itallie, Christina M.; Aponte, Angel; Tietgens, Amber Jean; Gucek, Marjan; Fredriksson, Karin; Anderson, James Melvin

2013-01-01

The proteins and functional protein networks of the tight junction remain incompletely defined. Among the currently known proteins are barrier-forming proteins like occludin and the claudin family; scaffolding proteins like ZO-1; and some cytoskeletal, signaling, and cell polarity proteins. To define a more complete list of proteins and infer their functional implications, we identified the proteins that are within molecular dimensions of ZO-1 by fusing biotin ligase to either its N or C terminus, expressing these fusion proteins in Madin-Darby canine kidney epithelial cells, and purifying and identifying the resulting biotinylated proteins by mass spectrometry. Of a predicted proteome of ∼9000, we identified more than 400 proteins tagged by biotin ligase fused to ZO-1, with both identical and distinct proteins near the N- and C-terminal ends. Those proximal to the N terminus were enriched in transmembrane tight junction proteins, and those proximal to the C terminus were enriched in cytoskeletal proteins. We also identified many unexpected but easily rationalized proteins and verified partial colocalization of three of these proteins with ZO-1 as examples. In addition, functional networks of interacting proteins were tagged, such as the basolateral but not apical polarity network. These results provide a rich inventory of proteins and potential novel insights into functions and protein networks that should catalyze further understanding of tight junction biology. Unexpectedly, the technique demonstrates high spatial resolution, which could be generally applied to defining other subcellular protein compartmentalization. PMID:23553632

A Qualitative Experiment: Research on Mediated Meaning Construction Using a Hybrid Approach

ERIC Educational Resources Information Center

Robinson, Sue; Mendelson, Andrew L.

2012-01-01

This article presents a hybrid methodological technique that fuses elements of experimental design with qualitative strategies to explore mediated communication. Called the "qualitative experiment," this strategy uses focus groups and in-depth interviews "within" randomized stimulus conditions typically associated with…

Selection of High-Affinity Peptidic Serine Protease Inhibitors with Increased Binding Entropy from a Back-Flip Library of Peptide-Protease Fusions.

PubMed

Sørensen, Hans Peter; Xu, Peng; Jiang, Longguang; Kromann-Hansen, Tobias; Jensen, Knud J; Huang, Mingdong; Andreasen, Peter A

2015-09-25

We have developed a new concept for designing peptidic protein modulators, by recombinantly fusing the peptidic modulator, with randomized residues, directly to the target protein via a linker and screening for internal modulation of the activity of the protein. We tested the feasibility of the concept by fusing a 10-residue-long, disulfide-bond-constrained inhibitory peptide, randomized in selected positions, to the catalytic domain of the serine protease murine urokinase-type plasminogen activator. High-affinity inhibitory peptide variants were identified as those that conferred to the fusion protease the lowest activity for substrate hydrolysis. The usefulness of the strategy was demonstrated by the selection of peptidic inhibitors of murine urokinase-type plasminogen activator with a low nanomolar affinity. The high affinity could not have been predicted by rational considerations, as the high affinity was associated with a loss of polar interactions and an increased binding entropy. Copyright © 2015 Elsevier Ltd. All rights reserved.

D Semantic Labeling of ALS Data Based on Domain Adaption by Transferring and Fusing Random Forest Models

NASA Astrophysics Data System (ADS)

Wu, J.; Yao, W.; Zhang, J.; Li, Y.

2018-04-01

Labeling 3D point cloud data with traditional supervised learning methods requires considerable labelled samples, the collection of which is cost and time expensive. This work focuses on adopting domain adaption concept to transfer existing trained random forest classifiers (based on source domain) to new data scenes (target domain), which aims at reducing the dependence of accurate 3D semantic labeling in point clouds on training samples from the new data scene. Firstly, two random forest classifiers were firstly trained with existing samples previously collected for other data. They were different from each other by using two different decision tree construction algorithms: C4.5 with information gain ratio and CART with Gini index. Secondly, four random forest classifiers adapted to the target domain are derived through transferring each tree in the source random forest models with two types of operations: structure expansion and reduction-SER and structure transfer-STRUT. Finally, points in target domain are labelled by fusing the four newly derived random forest classifiers using weights of evidence based fusion model. To validate our method, experimental analysis was conducted using 3 datasets: one is used as the source domain data (Vaihingen data for 3D Semantic Labelling); another two are used as the target domain data from two cities in China (Jinmen city and Dunhuang city). Overall accuracies of 85.5 % and 83.3 % for 3D labelling were achieved for Jinmen city and Dunhuang city data respectively, with only 1/3 newly labelled samples compared to the cases without domain adaption.

Evaluation of Observation-Fused Regional Air Quality Model Results for Population Air Pollution Exposure Estimation

PubMed Central

Chen, Gang; Li, Jingyi; Ying, Qi; Sherman, Seth; Perkins, Neil; Rajeshwari, Sundaram; Mendola, Pauline

2014-01-01

In this study, Community Multiscale Air Quality (CMAQ) model was applied to predict ambient gaseous and particulate concentrations during 2001 to 2010 in 15 hospital referral regions (HRRs) using a 36-km horizontal resolution domain. An inverse distance weighting based method was applied to produce exposure estimates based on observation-fused regional pollutant concentration fields using the differences between observations and predictions at grid cells where air quality monitors were located. Although the raw CMAQ model is capable of producing satisfying results for O3 and PM2.5 based on EPA guidelines, using the observation data fusing technique to correct CMAQ predictions leads to significant improvement of model performance for all gaseous and particulate pollutants. Regional average concentrations were calculated using five different methods: 1) inverse distance weighting of observation data alone, 2) raw CMAQ results, 3) observation-fused CMAQ results, 4) population-averaged raw CMAQ results and 5) population-averaged fused CMAQ results. It shows that while O3 (as well as NOx) monitoring networks in the HRR regions are dense enough to provide consistent regional average exposure estimation based on monitoring data alone, PM2.5 observation sites (as well as monitors for CO, SO2, PM10 and PM2.5 components) are usually sparse and the difference between the average concentrations estimated by the inverse distance interpolated observations, raw CMAQ and fused CMAQ results can be significantly different. Population-weighted average should be used to account spatial variation in pollutant concentration and population density. Using raw CMAQ results or observations alone might lead to significant biases in health outcome analyses. PMID:24747248

Radioactive source localization in urban environments with sensor networks and the Internet of Things

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

Sullivan, Clair J.

The use of radiation detectors as an element in the so-called “Internet of Things” has recently become viable with the available of low-cost, mobile radiation sensors capable of streaming geo-referenced data. New methods for fusing the data from multiple sensors on such a network is presented. The traditional simple and ordinary Kriging methods present a challenge for such a network since the assumption of a constant mean is not valid in this application. In conclusion, a variety of Kalman filters are introduced in an attempt to solve the problem associated with this variable and unknown mean. Results are presented onmore » a deployed sensor network.« less

Radioactive source localization in urban environments with sensor networks and the Internet of Things

DOE PAGES

Sullivan, Clair J.

2016-01-01

The use of radiation detectors as an element in the so-called “Internet of Things” has recently become viable with the available of low-cost, mobile radiation sensors capable of streaming geo-referenced data. New methods for fusing the data from multiple sensors on such a network is presented. The traditional simple and ordinary Kriging methods present a challenge for such a network since the assumption of a constant mean is not valid in this application. In conclusion, a variety of Kalman filters are introduced in an attempt to solve the problem associated with this variable and unknown mean. Results are presented onmore » a deployed sensor network.« less

Building block extraction and classification by means of aerial images fused with super-resolution reconstructed elevation data

NASA Astrophysics Data System (ADS)

Panagiotopoulou, Antigoni; Bratsolis, Emmanuel; Charou, Eleni; Perantonis, Stavros

2017-10-01

The detailed three-dimensional modeling of buildings utilizing elevation data, such as those provided by light detection and ranging (LiDAR) airborne scanners, is increasingly demanded today. There are certain application requirements and available datasets to which any research effort has to be adapted. Our dataset includes aerial orthophotos, with a spatial resolution 20 cm, and a digital surface model generated from LiDAR, with a spatial resolution 1 m and an elevation resolution 20 cm, from an area of Athens, Greece. The aerial images are fused with LiDAR, and we classify these data with a multilayer feedforward neural network for building block extraction. The innovation of our approach lies in the preprocessing step in which the original LiDAR data are super-resolution (SR) reconstructed by means of a stochastic regularized technique before their fusion with the aerial images takes place. The Lorentzian estimator combined with the bilateral total variation regularization performs the SR reconstruction. We evaluate the performance of our approach against that of fusing unprocessed LiDAR data with aerial images. We present the classified images and the statistical measures confusion matrix, kappa coefficient, and overall accuracy. The results demonstrate that our approach predominates over that of fusing unprocessed LiDAR data with aerial images.

Search for Directed Networks by Different Random Walk Strategies

NASA Astrophysics Data System (ADS)

Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long

2012-03-01

A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.

Control of spectral transmission enhancement properties of random anti-reflecting surface structures fabricated using gold masking

NASA Astrophysics Data System (ADS)

Peltier, Abigail; Sapkota, Gopal; Potter, Matthew; Busse, Lynda E.; Frantz, Jesse A.; Shaw, L. Brandon; Sanghera, Jasbinder S.; Aggarwal, Ishwar D.; Poutous, Menelaos K.

2017-02-01

Random anti-reflecting subwavelength surface structures (rARSS) have been shown to suppress Fresnel reflection and scatter from optical surfaces. The structures effectively function as a gradient-refractive-index at the substrate boundary, and the spectral transmission properties of the boundary have been shown to depend on the structure's statistical properties (diameter, height, and density.) We fabricated rARSS on fused silica substrates using gold masking. A thin layer of gold was deposited on the surface of the substrate and then subjected to a rapid thermal annealing (RTA) process at various temperatures. This RTA process resulted in the formation of gold "islands" on the surface of the substrate, which then acted as a mask while the substrate was dry etched in a reactive ion etching (RIE) process. The plasma etch yielded a fused silica surface covered with randomly arranged "rods" that act as the anti-reflective layer. We present data relating the physical characteristics of the gold "island" statistical populations, and the resulting rARSS "rod" population, as well as, optical scattering losses and spectral transmission properties of the final surfaces. We focus on comparing results between samples processed at different RTA temperatures, as well as samples fabricated without undergoing RTA, to relate fabrication process statistics to transmission enhancement values.

An integrated approach for fusion of environmental and human health data for disease surveillance.

PubMed

Burkom, Howard S; Ramac-Thomas, Liane; Babin, Steven; Holtry, Rekha; Mnatsakanyan, Zaruhi; Yund, Cynthia

2011-02-28

This paper describes the problem of public health monitoring for waterborne disease outbreaks using disparate evidence from health surveillance data streams and environmental sensors. We present a combined monitoring approach along with examples from a recent project at the Johns Hopkins University Applied Physics Laboratory in collaboration with the U.S. Environmental Protection Agency. The project objective was to build a module for the Electronic Surveillance System for the Early Notification of Community-based Epidemics (ESSENCE) to include water quality data with health indicator data for the early detection of waterborne disease outbreaks. The basic question in the fused surveillance application is 'What is the likelihood of the public health threat of interest given recent information from available sources of evidence?' For a scientific perspective, we formulate this question in terms of the estimation of positive predictive value customary in classical epidemiology, and we present a solution framework using Bayesian Networks (BN). An overview of the BN approach presents advantages, disadvantages, and required adaptations needed for a fused surveillance capability that is scalable and robust relative to the practical data environment. In the BN project, we built a top-level health/water-quality fusion BN informed by separate waterborne-disease-related networks for the detection of water contamination and human health effects. Elements of the art of developing networks appropriate to this environment are discussed with examples. Results of applying these networks to a simulated contamination scenario are presented. Copyright © 2011 John Wiley & Sons, Ltd.

A FUSE Survey of Algol-Type Interacting Binary Systems

NASA Astrophysics Data System (ADS)

Peters, C.

We propose a survey of Algol-type interacting binaries with FUSE. The observing list contains 15 systems with deltage40o for which systemic parameters are known. The program stars span the range from early-type contact systems that will eventually become conventional Algols to wide binaries in an advanced evolutionary state with prominent accretion disks. Some physical parameters that can be obtained include the ionization temperature and density in the accretion disk, domain of infall (gas stream), high temperature plasma on the trailing side of the system, and in certain systems the splash zone. We will look for the presence of ionO6 absorption and assess the phase interval over which it is observed. Emission from this ion has already been found in FUSE observations of three Algols (V356Sgr, TTHya, and RYPer) during total eclipse and confirms the presence of a sim300,000K plasma abovebelow the orbital plane. In accordance with the policy on the FUSE Survey and Supplementary Program, the observations will be obtained at random phases, but we request 5 visits of each target in order to secure good phase coverage and maximize the probability of obtaining data at interesting phases, such as the interval containing the mass outflow in the splash region where a tangentially-impacting gas stream is deflected off of the mass gainers photosphere. The physical parameters that are obtained in this project will constrain future 3-D hydrodynamical simulations of mass flow in Algols. This project will build upon the successful one (Z902) carried through in FUSE Cycle3.

Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion.

PubMed

Wang, Yang; Zhang, Wenjie; Wu, Lin; Lin, Xuemin; Zhao, Xiang

2017-01-01

Learning an ideal metric is crucial to many tasks in computer vision. Diverse feature representations may combat this problem from different aspects; as visual data objects described by multiple features can be decomposed into multiple views, thus often provide complementary information. In this paper, we propose a cross-view fusion algorithm that leads to a similarity metric for multiview data by systematically fusing multiple similarity measures. Unlike existing paradigms, we focus on learning distance measure by exploiting a graph structure of data samples, where an input similarity matrix can be improved through a propagation of graph random walk. In particular, we construct multiple graphs with each one corresponding to an individual view, and a cross-view fusion approach based on graph random walk is presented to derive an optimal distance measure by fusing multiple metrics. Our method is scalable to a large amount of data by enforcing sparsity through an anchor graph representation. To adaptively control the effects of different views, we dynamically learn view-specific coefficients, which are leveraged into graph random walk to balance multiviews. However, such a strategy may lead to an over-smooth similarity metric where affinities between dissimilar samples may be enlarged by excessively conducting cross-view fusion. Thus, we figure out a heuristic approach to controlling the iteration number in the fusion process in order to avoid over smoothness. Extensive experiments conducted on real-world data sets validate the effectiveness and efficiency of our approach.

Convolutional neural network approach for enhanced capture of breast parenchymal complexity patterns associated with breast cancer risk

NASA Astrophysics Data System (ADS)

Oustimov, Andrew; Gastounioti, Aimilia; Hsieh, Meng-Kang; Pantalone, Lauren; Conant, Emily F.; Kontos, Despina

2017-03-01

We assess the feasibility of a parenchymal texture feature fusion approach, utilizing a convolutional neural network (ConvNet) architecture, to benefit breast cancer risk assessment. Hypothesizing that by capturing sparse, subtle interactions between localized motifs present in two-dimensional texture feature maps derived from mammographic images, a multitude of texture feature descriptors can be optimally reduced to five meta-features capable of serving as a basis on which a linear classifier, such as logistic regression, can efficiently assess breast cancer risk. We combine this methodology with our previously validated lattice-based strategy for parenchymal texture analysis and we evaluate the feasibility of this approach in a case-control study with 424 digital mammograms. In a randomized split-sample setting, we optimize our framework in training/validation sets (N=300) and evaluate its descriminatory performance in an independent test set (N=124). The discriminatory capacity is assessed in terms of the the area under the curve (AUC) of the receiver operator characteristic (ROC). The resulting meta-features exhibited strong classification capability in the test dataset (AUC = 0.90), outperforming conventional, non-fused, texture analysis which previously resulted in an AUC=0.85 on the same case-control dataset. Our results suggest that informative interactions between localized motifs exist and can be extracted and summarized via a fairly simple ConvNet architecture.

Case retrieval in medical databases by fusing heterogeneous information.

PubMed

Quellec, Gwénolé; Lamard, Mathieu; Cazuguel, Guy; Roux, Christian; Cochener, Béatrice

2011-01-01

A novel content-based heterogeneous information retrieval framework, particularly well suited to browse medical databases and support new generation computer aided diagnosis (CADx) systems, is presented in this paper. It was designed to retrieve possibly incomplete documents, consisting of several images and semantic information, from a database; more complex data types such as videos can also be included in the framework. The proposed retrieval method relies on image processing, in order to characterize each individual image in a document by their digital content, and information fusion. Once the available images in a query document are characterized, a degree of match, between the query document and each reference document stored in the database, is defined for each attribute (an image feature or a metadata). A Bayesian network is used to recover missing information if need be. Finally, two novel information fusion methods are proposed to combine these degrees of match, in order to rank the reference documents by decreasing relevance for the query. In the first method, the degrees of match are fused by the Bayesian network itself. In the second method, they are fused by the Dezert-Smarandache theory: the second approach lets us model our confidence in each source of information (i.e., each attribute) and take it into account in the fusion process for a better retrieval performance. The proposed methods were applied to two heterogeneous medical databases, a diabetic retinopathy database and a mammography screening database, for computer aided diagnosis. Precisions at five of 0.809 ± 0.158 and 0.821 ± 0.177, respectively, were obtained for these two databases, which is very promising.

Fusion of ECG and ABP signals based on wavelet transform for cardiac arrhythmias classification.

PubMed

Arvanaghi, Roghayyeh; Daneshvar, Sabalan; Seyedarabi, Hadi; Goshvarpour, Atefeh

2017-11-01

Each of Electrocardiogram (ECG) and Atrial Blood Pressure (ABP) signals contain information of cardiac status. This information can be used for diagnosis and monitoring of diseases. The majority of previously proposed methods rely only on ECG signal to classify heart rhythms. In this paper, ECG and ABP were used to classify five different types of heart rhythms. To this end, two mentioned signals (ECG and ABP) have been fused. These physiological signals have been used from MINIC physioNet database. ECG and ABP signals have been fused together on the basis of the proposed Discrete Wavelet Transformation fusion technique. Then, some frequency features were extracted from the fused signal. To classify the different types of cardiac arrhythmias, these features were given to a multi-layer perceptron neural network. In this study, the best results for the proposed fusion algorithm were obtained. In this case, the accuracy rates of 96.6%, 96.9%, 95.6% and 93.9% were achieved for two, three, four and five classes, respectively. However, the maximum classification rate of 89% was obtained for two classes on the basis of ECG features. It has been found that the higher accuracy rates were acquired by using the proposed fusion technique. The results confirmed the importance of fusing features from different physiological signals to gain more accurate assessments. Copyright © 2017 Elsevier B.V. All rights reserved.

Percolation of localized attack on isolated and interdependent random networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2014-03-01

Percolation properties of isolated and interdependent random networks have been investigated extensively. The focus of these studies has been on random attacks where each node in network is attacked with the same probability or targeted attack where each node is attacked with a probability being a function of its centrality, such as degree. Here we discuss a new type of realistic attacks which we call a localized attack where a group of neighboring nodes in the networks are attacked. We attack a randomly chosen node, its neighbors, and its neighbor of neighbors and so on, until removing a fraction (1 - p) of the network. This type of attack reflects damages due to localized disasters, such as earthquakes, floods and war zones in real-world networks. We study, both analytically and by simulations the impact of localized attack on percolation properties of random networks with arbitrary degree distributions and discuss in detail random regular (RR) networks, Erdős-Rényi (ER) networks and scale-free (SF) networks. We extend and generalize our theoretical and simulation results of single isolated networks to networks formed of interdependent networks.

Structured Tracking for Safety, Security, and Privacy: Algorithms for Fusing Noisy Estimates from Sensor, Robot, and Camera Networks

DTIC Science & Technology

2009-07-23

negative log of the probability at each edge. 135 7.4 Simulation experiments All simulation experiments were implemented in Matlab and executed on PCs...Sensitivity . . . . 71 4.5 Experimental Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 4.5.1 Simulation Results...113 6.6.2 Estimator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 6.7 Simulation Results

Fusing Technology into the School Design Process for Today and Tomorrow

ERIC Educational Resources Information Center

Strube, Marilyn K.; Thompson, Ann L.

2012-01-01

Students are creating content in a variety of ways and using numerous technologies to share that content that did not exist when their teachers were students. Students are interacting with the new technologies they see on TV, at the movies and through their social networks. They are creating and sharing websites, posting self made videos and…

Quantifying randomness in real networks

NASA Astrophysics Data System (ADS)

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

2015-10-01

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

Synchronization in Random Pulse Oscillator Networks

NASA Astrophysics Data System (ADS)

Brown, Kevin; Hermundstad, Ann

Motivated by synchronization phenomena in neural systems, we study synchronization of random networks of coupled pulse oscillators. We begin by considering binomial random networks whose nodes have intrinsic linear dynamics. We quantify order in the network spiking dynamics using a new measure: the normalized Lev-Zimpel complexity (LZC) of the nodes' spike trains. Starting from a globally-synchronized state, we see two broad classes of behaviors. In one (''temporally random''), the LZC is high and nodes spike independently with no coherent pattern. In another (''temporally regular''), the network does not globally synchronize but instead forms coherent, repeating population firing patterns with low LZC. No topological feature of the network reliably predicts whether an individual network will show temporally random or regular behavior; however, we find evidence that degree heterogeneity in binomial networks has a strong effect on the resulting state. To confirm these findings, we generate random networks with independently-adjustable degree mean and variance. We find that the likelihood of temporally-random behavior increases as degree variance increases. Our results indicate the subtle and complex relationship between network structure and dynamics.

Feature detection in satellite images using neural network technology

NASA Technical Reports Server (NTRS)

Augusteijn, Marijke F.; Dimalanta, Arturo S.

1992-01-01

A feasibility study of automated classification of satellite images is described. Satellite images were characterized by the textures they contain. In particular, the detection of cloud textures was investigated. The method of second-order gray level statistics, using co-occurrence matrices, was applied to extract feature vectors from image segments. Neural network technology was employed to classify these feature vectors. The cascade-correlation architecture was successfully used as a classifier. The use of a Kohonen network was also investigated but this architecture could not reliably classify the feature vectors due to the complicated structure of the classification problem. The best results were obtained when data from different spectral bands were fused.

Plant Species Identification by Bi-channel Deep Convolutional Networks

NASA Astrophysics Data System (ADS)

He, Guiqing; Xia, Zhaoqiang; Zhang, Qiqi; Zhang, Haixi; Fan, Jianping

2018-04-01

Plant species identification achieves much attention recently as it has potential application in the environmental protection and human life. Although deep learning techniques can be directly applied for plant species identification, it still needs to be designed for this specific task to obtain the state-of-art performance. In this paper, a bi-channel deep learning framework is developed for identifying plant species. In the framework, two different sub-networks are fine-tuned over their pretrained models respectively. And then a stacking layer is used to fuse the output of two different sub-networks. We construct a plant dataset of Orchidaceae family for algorithm evaluation. Our experimental results have demonstrated that our bi-channel deep network can achieve very competitive performance on accuracy rates compared to the existing deep learning algorithm.

LocFuse: human protein-protein interaction prediction via classifier fusion using protein localization information.

PubMed

Zahiri, Javad; Mohammad-Noori, Morteza; Ebrahimpour, Reza; Saadat, Samaneh; Bozorgmehr, Joseph H; Goldberg, Tatyana; Masoudi-Nejad, Ali

2014-12-01

Protein-protein interaction (PPI) detection is one of the central goals of functional genomics and systems biology. Knowledge about the nature of PPIs can help fill the widening gap between sequence information and functional annotations. Although experimental methods have produced valuable PPI data, they also suffer from significant limitations. Computational PPI prediction methods have attracted tremendous attentions. Despite considerable efforts, PPI prediction is still in its infancy in complex multicellular organisms such as humans. Here, we propose a novel ensemble learning method, LocFuse, which is useful in human PPI prediction. This method uses eight different genomic and proteomic features along with four types of different classifiers. The prediction performance of this classifier selection method was found to be considerably better than methods employed hitherto. This confirms the complex nature of the PPI prediction problem and also the necessity of using biological information for classifier fusion. The LocFuse is available at: http://lbb.ut.ac.ir/Download/LBBsoft/LocFuse. The results revealed that if we divide proteome space according to the cellular localization of proteins, then the utility of some classifiers in PPI prediction can be improved. Therefore, to predict the interaction for any given protein pair, we can select the most accurate classifier with regard to the cellular localization information. Based on the results, we can say that the importance of different features for PPI prediction varies between differently localized proteins; however in general, our novel features, which were extracted from position-specific scoring matrices (PSSMs), are the most important ones and the Random Forest (RF) classifier performs best in most cases. LocFuse was developed with a user-friendly graphic interface and it is freely available for Linux, Mac OSX and MS Windows operating systems. Copyright © 2014 Elsevier Inc. All rights reserved.

Cross over of recurrence networks to random graphs and random geometric graphs

NASA Astrophysics Data System (ADS)

Jacob, Rinku; Harikrishnan, K. P.; Misra, R.; Ambika, G.

2017-02-01

Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability density variations of the representative attractor from which it is constructed. Here we numerically investigate the properties of recurrence networks from standard low-dimensional chaotic attractors using some basic network measures and show how the recurrence networks are different from random and scale-free networks. In particular, we show that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to the time series and into the classical random graphs by increasing the range of interaction to the system size. We also highlight the effectiveness of a combined plot of characteristic path length and clustering coefficient in capturing the small changes in the network characteristics.

Testing the structure of earthquake networks from multivariate time series of successive main shocks in Greece

NASA Astrophysics Data System (ADS)

Chorozoglou, D.; Kugiumtzis, D.; Papadimitriou, E.

2018-06-01

The seismic hazard assessment in the area of Greece is attempted by studying the earthquake network structure, such as small-world and random. In this network, a node represents a seismic zone in the study area and a connection between two nodes is given by the correlation of the seismic activity of two zones. To investigate the network structure, and particularly the small-world property, the earthquake correlation network is compared with randomized ones. Simulations on multivariate time series of different length and number of variables show that for the construction of randomized networks the method randomizing the time series performs better than methods randomizing directly the original network connections. Based on the appropriate randomization method, the network approach is applied to time series of earthquakes that occurred between main shocks in the territory of Greece spanning the period 1999-2015. The characterization of networks on sliding time windows revealed that small-world structure emerges in the last time interval, shortly before the main shock.

A random spatial network model based on elementary postulates

USGS Publications Warehouse

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

Estimating Ground-Level PM2.5 by Fusing Satellite and Station Observations: A Geo-Intelligent Deep Learning Approach

NASA Astrophysics Data System (ADS)

Li, Tongwen; Shen, Huanfeng; Yuan, Qiangqiang; Zhang, Xuechen; Zhang, Liangpei

2017-12-01

Fusing satellite observations and station measurements to estimate ground-level PM2.5 is promising for monitoring PM2.5 pollution. A geo-intelligent approach, which incorporates geographical correlation into an intelligent deep learning architecture, is developed to estimate PM2.5. Specifically, it considers geographical distance and spatiotemporally correlated PM2.5 in a deep belief network (denoted as Geoi-DBN). Geoi-DBN can capture the essential features associated with PM2.5 from latent factors. It was trained and tested with data from China in 2015. The results show that Geoi-DBN performs significantly better than the traditional neural network. The out-of-sample cross-validation R2 increases from 0.42 to 0.88, and RMSE decreases from 29.96 to 13.03 μg/m3. On the basis of the derived PM2.5 distribution, it is predicted that over 80% of the Chinese population live in areas with an annual mean PM2.5 of greater than 35 μg/m3. This study provides a new perspective for air pollution monitoring in large geographic regions.

Randomizing Genome-Scale Metabolic Networks

PubMed Central

Samal, Areejit; Martin, Olivier C.

2011-01-01

Networks coming from protein-protein interactions, transcriptional regulation, signaling, or metabolism may appear to have “unusual” properties. To quantify this, it is appropriate to randomize the network and test the hypothesis that the network is not statistically different from expected in a motivated ensemble. However, when dealing with metabolic networks, the randomization of the network using edge exchange generates fictitious reactions that are biochemically meaningless. Here we provide several natural ensembles of randomized metabolic networks. A first constraint is to use valid biochemical reactions. Further constraints correspond to imposing appropriate functional constraints. We explain how to perform these randomizations with the help of Markov Chain Monte Carlo (MCMC) and show that they allow one to approach the properties of biological metabolic networks. The implication of the present work is that the observed global structural properties of real metabolic networks are likely to be the consequence of simple biochemical and functional constraints. PMID:21779409

Generalized information fusion and visualization using spatial voting and data modeling

NASA Astrophysics Data System (ADS)

Jaenisch, Holger M.; Handley, James W.

2013-05-01

We present a novel and innovative information fusion and visualization framework for multi-source intelligence (multiINT) data using Spatial Voting (SV) and Data Modeling. We describe how different sources of information can be converted into numerical form for further processing downstream, followed by a short description of how this information can be fused using the SV grid. As an illustrative example, we show the modeling of cyberspace as cyber layers for the purpose of tracking cyber personas. Finally we describe a path ahead for creating interactive agile networks through defender customized Cyber-cubes for network configuration and attack visualization.

Impact of a hands-on component on learning in the Fundamental Use of Surgical Energy™ (FUSE) curriculum: a randomized-controlled trial in surgical trainees.

PubMed

Madani, Amin; Watanabe, Yusuke; Vassiliou, Melina C; Fuchshuber, Pascal; Jones, Daniel B; Schwaitzberg, Steven D; Fried, Gerald M; Feldman, Liane S

2014-10-01

While energy devices are ubiquitous in the operating room, they remain poorly understood and can result in significant complications. The purpose of this study was to estimate the extent to which adding a novel bench-top component improves learning of SAGES' Fundamental Use of Surgical Energy™ (FUSE) electrosurgery curriculum among surgical trainees. Surgical residents participated in a 1-h didactic electrosurgery (ES) course, based on the FUSE curriculum. They were then randomized to one of two groups: an unstructured hands-on session where trainees used ES devices (control group) or a goal-directed hands-on training session (Sim group). Pre- and post-curriculum (immediate and at 3 months) assessments included knowledge of ES (multiple-choice examination), self-perceived competence for each of the 35 course objectives (questionnaire), and self-perceived comfort with performance of seven tasks related to safe use of ES. Data expressed as median[interquartile range], *p < 0.05. 56 (29 control; 27 Sim) surgical trainees completed the curriculum and assessments. Baseline characteristics, including pre-curriculum exam and questionnaire scores, were similar. Total score on the exam improved from 46%[40;54] to 84%[77;91]* for the entire cohort, with higher immediate post-curriculum scores in the Sim group compared to controls (89%[83;94] vs. 83%[71;86]*). At 3 months, performance on the exam declined in both groups, but remained higher in the Sim group (77%[69;90] vs 60%[51;80]*). Participants in both groups reported feeling greater comfort and competence post-curriculum (immediate and at 3 months) compared to baseline. This improvement was greater in the Sim group with a higher proportion feeling "Very Comfortable" or "Fully Competent" (Sim: 3/7 tasks and 28/35 objectives; control: 0/7 tasks and 10/35 objectives). A FUSE-based curriculum improved surgical trainees' knowledge and comfort in the safe use of electrosurgical devices. The addition of a structured interactive bench-top simulation component further improved learning and retention at 3 months.

Robust-yet-fragile nature of interdependent networks

NASA Astrophysics Data System (ADS)

Tan, Fei; Xia, Yongxiang; Wei, Zhi

2015-05-01

Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et al. [Europhys. Lett. 92, 68002 (2010), 10.1209/0295-5075/92/68002] further indicated that the more intersimilar networks are, the more robust they are to random failures. When traffic load is considered, how do the coupling patterns impact cascading failures in interdependent networks? This question has been largely unexplored until now. In this paper, we address this question by investigating the robustness of interdependent Erdös-Rényi random graphs and Barabási-Albert scale-free networks under either random failures or intentional attacks. It is found that interdependent Erdös-Rényi random graphs are robust yet fragile under either random failures or intentional attacks. Interdependent Barabási-Albert scale-free networks, however, are only robust yet fragile under random failures but fragile under intentional attacks. We further analyze the interdependent communication network and power grid and achieve similar results. These results advance our understanding of how interdependency shapes network robustness.

Source Localization in Wireless Sensor Networks with Randomly Distributed Elements under Multipath Propagation Conditions

DTIC Science & Technology

2009-03-01

IN WIRELESS SENSOR NETWORKS WITH RANDOMLY DISTRIBUTED ELEMENTS UNDER MULTIPATH PROPAGATION CONDITIONS by Georgios Tsivgoulis March 2009...COVERED Engineer’s Thesis 4. TITLE Source Localization in Wireless Sensor Networks with Randomly Distributed Elements under Multipath Propagation...the non-line-of-sight information. 15. NUMBER OF PAGES 111 14. SUBJECT TERMS Wireless Sensor Network , Direction of Arrival, DOA, Random

Bridges in complex networks

NASA Astrophysics Data System (ADS)

Wu, Ang-Kun; Tian, Liang; Liu, Yang-Yu

2018-01-01

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but they have a fraction of bridges that is very similar to their degree-preserving randomizations. We define an edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have a very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction and the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.

Percolation and epidemics in random clustered networks

NASA Astrophysics Data System (ADS)

Miller, Joel C.

2009-08-01

The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree nodes. We introduce a class of random clustered networks and a class of random unclustered networks with the same preferential mixing. Percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.

Random walks and diffusion on networks

NASA Astrophysics Data System (ADS)

Masuda, Naoki; Porter, Mason A.; Lambiotte, Renaud

2017-11-01

Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including diffusion, interactions, and opinions among humans and animals; and can be used to extract information about important entities or dense groups of entities in a network. Random walks have been studied for many decades on both regular lattices and (especially in the last couple of decades) on networks with a variety of structures. In the present article, we survey the theory and applications of random walks on networks, restricting ourselves to simple cases of single and non-adaptive random walkers. We distinguish three main types of random walks: discrete-time random walks, node-centric continuous-time random walks, and edge-centric continuous-time random walks. We first briefly survey random walks on a line, and then we consider random walks on various types of networks. We extensively discuss applications of random walks, including ranking of nodes (e.g., PageRank), community detection, respondent-driven sampling, and opinion models such as voter models.

Multiple-algorithm parallel fusion of infrared polarization and intensity images based on algorithmic complementarity and synergy

NASA Astrophysics Data System (ADS)

Zhang, Lei; Yang, Fengbao; Ji, Linna; Lv, Sheng

2018-01-01

Diverse image fusion methods perform differently. Each method has advantages and disadvantages compared with others. One notion is that the advantages of different image methods can be effectively combined. A multiple-algorithm parallel fusion method based on algorithmic complementarity and synergy is proposed. First, in view of the characteristics of the different algorithms and difference-features among images, an index vector-based feature-similarity is proposed to define the degree of complementarity and synergy. This proposed index vector is a reliable evidence indicator for algorithm selection. Second, the algorithms with a high degree of complementarity and synergy are selected. Then, the different degrees of various features and infrared intensity images are used as the initial weights for the nonnegative matrix factorization (NMF). This avoids randomness of the NMF initialization parameter. Finally, the fused images of different algorithms are integrated using the NMF because of its excellent data fusing performance on independent features. Experimental results demonstrate that the visual effect and objective evaluation index of the fused images obtained using the proposed method are better than those obtained using traditional methods. The proposed method retains all the advantages that individual fusion algorithms have.

Monolignol radical-radical coupling networks in western red cedar and Arabidopsis and their evolutionary implications

NASA Technical Reports Server (NTRS)

Kim, Myoung K.; Jeon, Jae-Heung; Davin, Laurence B.; Lewis, Norman G.

2002-01-01

The discovery of a nine-member multigene dirigent family involved in control of monolignol radical-radical coupling in the ancient gymnosperm, western red cedar, suggested that a complex multidimensional network had evolved to regulate such processes in vascular plants. Accordingly, in this study, the corresponding promoter regions for each dirigent multigene member were obtained by genome-walking, with Arabidopsis being subsequently transformed to express each promoter fused to the beta-glucuronidase (GUS) reporter gene. It was found that each component gene of the proposed network is apparently differentially expressed in individual tissues, organs and cells at all stages of plant growth and development. The data so obtained thus further support the hypothesis that a sophisticated monolignol radical-radical coupling network exists in plants which has been highly conserved throughout vascular plant evolution.

Wavelet decomposition and radial basis function networks for system monitoring

NASA Astrophysics Data System (ADS)

Ikonomopoulos, A.; Endou, A.

1998-10-01

Two approaches are coupled to develop a novel collection of black box models for monitoring operational parameters in a complex system. The idea springs from the intention of obtaining multiple predictions for each system variable and fusing them before they are used to validate the actual measurement. The proposed architecture pairs the analytical abilities of the discrete wavelet decomposition with the computational power of radial basis function networks. Members of a wavelet family are constructed in a systematic way and chosen through a statistical selection criterion that optimizes the structure of the network. Network parameters are further optimized through a quasi-Newton algorithm. The methodology is demonstrated utilizing data obtained during two transients of the Monju fast breeder reactor. The models developed are benchmarked with respect to similar regressors based on Gaussian basis functions.

Dynamic defense and network randomization for computer systems

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

Chavez, Adrian R.; Stout, William M. S.; Hamlet, Jason R.

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissancemore » stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.« less

A Remote Sensing Image Fusion Method based on adaptive dictionary learning

NASA Astrophysics Data System (ADS)

He, Tongdi; Che, Zongxi

2018-01-01

This paper discusses using a remote sensing fusion method, based on' adaptive sparse representation (ASP)', to provide improved spectral information, reduce data redundancy and decrease system complexity. First, the training sample set is formed by taking random blocks from the images to be fused, the dictionary is then constructed using the training samples, and the remaining terms are clustered to obtain the complete dictionary by iterated processing at each step. Second, the self-adaptive weighted coefficient rule of regional energy is used to select the feature fusion coefficients and complete the reconstruction of the image blocks. Finally, the reconstructed image blocks are rearranged and an average is taken to obtain the final fused images. Experimental results show that the proposed method is superior to other traditional remote sensing image fusion methods in both spectral information preservation and spatial resolution.

Giant Pulse Phenomena in a High Gain Erbium Doped Fiber Amplifier

NASA Technical Reports Server (NTRS)

Li, Stephen X.; Merritt, Scott; Krainak, Michael A.; Yu, Anthony

2018-01-01

High gain Erbium Doped Fiber Amplifiers (EDFAs), while revolutionizing optical communications, remain vulnerable to optical damage when unseeded, e.g. due to nonlinear effects that produce random pulses with high peak power, i.e. giant pulses. Giant pulses can damage the components in a high gain EDFA or external components and systems coupled to the EDFA. We explore the conditions under which a reflective, polarization-maintaining (PM), core-pumped high gain EDFA generates giant pulses, provide details on conditions under which normal pulses evolve into giant pulses, and provide results on the transient effects of giant pulses on amplifier's fused-fiber couplers, an effect which we call Fiber Overload Induced Leakage (FOIL). While FOIL's effect on fused-fiber couplers is temporary, its damage to forward pump lasers in a high gain EDFA can be permanent.

Giant Pulse Phenomena in a High Gain Erbium Doped Fiber Amplifier

NASA Technical Reports Server (NTRS)

Li, Stephen X.; Merritt, Scott; Krainak, Michael A.; Yu, Anthony

2018-01-01

High gain Erbium Doped Fiber Amplifiers (EDFAs) are vulnerable to optical damage when unseeded, e.g. due to nonlinear effects that produce random, spontaneous Q-switched (SQS) pulses with high peak power, i.e. giant pulses. Giant pulses can damage either the components within a high gain EDFA or external components and systems coupled to the EDFA. We explore the conditions under which a reflective, polarization-maintaining (PM), core-pumped high gain EDFA generates giant pulses, provide details on the evolution of normal pulses into giant pulses, and provide results on the transient effects of giant pulses on an amplifier's fused-fiber couplers, an effect which we call Fiber Overload Induced Leakage (FOIL). While FOIL's effect on fused-fiber couplers is temporary, its damage to forward pump lasers in a high gain EDFA can be permanent.

Damage spreading in spatial and small-world random Boolean networks

NASA Astrophysics Data System (ADS)

Lu, Qiming; Teuscher, Christof

2014-02-01

The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean networks (RBNs) are commonly used as a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other nonrandom connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance of spatially local networks scales with a power law as the system size N increases, but with a different exponent for local and small-world networks. The scaling arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

Quantifying Performance Bias in Label Fusion

DTIC Science & Technology

2012-08-21

detect ), may provide the end-user with the means to appropriately adjust the performance and optimal thresholds for performance by fusing legacy systems...boolean combination of classification systems in ROC space: An application to anomaly detection with HMMs. Pattern Recognition, 43(8), 2732-2752. 10...Shamsuddin, S. (2009). An overview of neural networks use in anomaly intrusion detection systems. Paper presented at the Research and Development (SCOReD

Volume 3. Information Age Anthology: The Information Age Military

DTIC Science & Technology

2001-03-01

Science Applications International Corporation, 1996 “Information- Based Warfare and the PRC” by M. Ehsan Ahrari, appeared as an earlier version of...GSRT fused sensor data, tapped data bases , activated resources, and passed templated neurally collated information to each person in exactly the format...because IT binds together hitherto disparate social organizations, including the armed forces, into networks based on shared information and situational

Spectrum of walk matrix for Koch network and its application

NASA Astrophysics Data System (ADS)

Xie, Pinchen; Lin, Yuan; Zhang, Zhongzhi

2015-06-01

Various structural and dynamical properties of a network are encoded in the eigenvalues of walk matrix describing random walks on the network. In this paper, we study the spectra of walk matrix of the Koch network, which displays the prominent scale-free and small-world features. Utilizing the particular architecture of the network, we obtain all the eigenvalues and their corresponding multiplicities. Based on the link between the eigenvalues of walk matrix and random target access time defined as the expected time for a walker going from an arbitrary node to another one selected randomly according to the steady-state distribution, we then derive an explicit solution to the random target access time for random walks on the Koch network. Finally, we corroborate our computation for the eigenvalues by enumerating spanning trees in the Koch network, using the connection governing eigenvalues and spanning trees, where a spanning tree of a network is a subgraph of the network, that is, a tree containing all the nodes.

Collective relaxation dynamics of small-world networks

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N , average degree k , and topological randomness q . We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q , including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

Collective relaxation dynamics of small-world networks.

PubMed

Grabow, Carsten; Grosskinsky, Stefan; Kurths, Jürgen; Timme, Marc

2015-05-01

Complex networks exhibit a wide range of collective dynamic phenomena, including synchronization, diffusion, relaxation, and coordination processes. Their asymptotic dynamics is generically characterized by the local Jacobian, graph Laplacian, or a similar linear operator. The structure of networks with regular, small-world, and random connectivities are reasonably well understood, but their collective dynamical properties remain largely unknown. Here we present a two-stage mean-field theory to derive analytic expressions for network spectra. A single formula covers the spectrum from regular via small-world to strongly randomized topologies in Watts-Strogatz networks, explaining the simultaneous dependencies on network size N, average degree k, and topological randomness q. We present simplified analytic predictions for the second-largest and smallest eigenvalue, and numerical checks confirm our theoretical predictions for zero, small, and moderate topological randomness q, including the entire small-world regime. For large q of the order of one, we apply standard random matrix theory, thereby overarching the full range from regular to randomized network topologies. These results may contribute to our analytic and mechanistic understanding of collective relaxation phenomena of network dynamical systems.

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

NASA Astrophysics Data System (ADS)

Hortos, William S.

2010-04-01

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

Theory of Dielectric Breakdown in Randomly Inhomogeneous Materials

NASA Astrophysics Data System (ADS)

Gyure, Mark Franklin

1990-01-01

Two models of dielectric breakdown in disordered metal-insulator composites have been developed in an attempt to explain in detail the greatly reduced breakdown electric field observed in these materials. The first model is a two dimensional model in which the composite is treated as a random array of conducting cylinders embedded in an otherwise uniform dielectric background. The two dimensional samples are generated by the Monte Carlo method and a discretized version of the integral form of Laplace's equation is solved to determine the electric field in each sample. Breakdown is modeled as a quasi-static process by which one breakdown at a time occurs at the point of maximum electric field in the system. A cascade of these local breakdowns leads to complete dielectric failure of the system after which the breakdown field can be determined. A second model is developed that is similar to the first in terms of breakdown dynamics, but uses coupled multipole expansions of the electrostatic potential centered at each particle to obtain a more computationally accurate and faster solution to the problem of determining the electric field at an arbitrary point in a random medium. This new algorithm allows extension of the model to three dimensions and treats conducting spherical inclusions as well as cylinders. Successful implementation of this algorithm relies on the use of analytical forms for off-centered expansions of cylindrical and spherical harmonics. Scaling arguments similar to those used in theories of phase transitions are developed for the breakdown field and these arguments are discussed in context with other theories that have been developed to explain the break-down behavior of random resistor and fuse networks. Finally, one of the scaling arguments is used to predict the breakdown field for some samples of solid fuel rocket propellant tested at the China Lake Naval Weapons Center and is found to compare quite well with the experimentally measured breakdown fields.

Stability and dynamical properties of material flow systems on random networks

NASA Astrophysics Data System (ADS)

Anand, K.; Galla, T.

2009-04-01

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.

Random graph models of social networks.

PubMed

Newman, M E J; Watts, D J; Strogatz, S H

2002-02-19

We describe some new exactly solvable models of the structure of social networks, based on random graphs with arbitrary degree distributions. We give models both for simple unipartite networks, such as acquaintance networks, and bipartite networks, such as affiliation networks. We compare the predictions of our models to data for a number of real-world social networks and find that in some cases, the models are in remarkable agreement with the data, whereas in others the agreement is poorer, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

The investigation of social networks based on multi-component random graphs

NASA Astrophysics Data System (ADS)

Zadorozhnyi, V. N.; Yudin, E. B.

2018-01-01

The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdôs-Rényi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network projects.

Reliability Evaluation for Clustered WSNs under Malware Propagation

PubMed Central

Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C.; Yu, Shui; Cao, Qiying

2016-01-01

We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node’s MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN. PMID:27294934

Reliability Evaluation for Clustered WSNs under Malware Propagation.

PubMed

Shen, Shigen; Huang, Longjun; Liu, Jianhua; Champion, Adam C; Yu, Shui; Cao, Qiying

2016-06-10

We consider a clustered wireless sensor network (WSN) under epidemic-malware propagation conditions and solve the problem of how to evaluate its reliability so as to ensure efficient, continuous, and dependable transmission of sensed data from sensor nodes to the sink. Facing the contradiction between malware intention and continuous-time Markov chain (CTMC) randomness, we introduce a strategic game that can predict malware infection in order to model a successful infection as a CTMC state transition. Next, we devise a novel measure to compute the Mean Time to Failure (MTTF) of a sensor node, which represents the reliability of a sensor node continuously performing tasks such as sensing, transmitting, and fusing data. Since clustered WSNs can be regarded as parallel-serial-parallel systems, the reliability of a clustered WSN can be evaluated via classical reliability theory. Numerical results show the influence of parameters such as the true positive rate and the false positive rate on a sensor node's MTTF. Furthermore, we validate the method of reliability evaluation for a clustered WSN according to the number of sensor nodes in a cluster, the number of clusters in a route, and the number of routes in the WSN.

Using glass-graded zirconia to increase delamination growth resistance in porcelain/zirconia dental structures.

PubMed

Chai, Herzl; Mieleszko, Adam J; Chu, Stephen J; Zhang, Yu

2018-01-01

Porcelain fused to zirconia (PFZ) restorations are widely used in prosthetic dentistry. However, their tendency to delaminate along the P/Z interface remains a practical problem so that assessing and improving the interfacial strength are important design aspects. This work examines the effect of modifying the zirconia veneering surface with an in-house felspathic glass on the interfacial fracture resistance of fused P/Z. Three material systems are studied: porcelain fused to zirconia (control) and porcelain fused to glass-graded zirconia with and without the presence of a glass interlayer. The specimens were loaded in a four-point-bend fixture with the porcelain veneer in tension. The evolution of damage is followed with the aid of a video camera. The interfacial fracture energy G C was determined with the aid of a FEA, taking into account the stress shielding effects due to the presence of adjacent channel cracks. Similarly to a previous study on PFZ specimens, the fracture sequence consisted of unstable growth of channel cracks in the veneer followed by stable cracking along the P/Z interface. However, the value of GC for the graded zirconia was approximately 3 times that of the control zirconia, which is due to the good adhesion between porcelain and the glass network structure on the zirconia surface. Combined with its improved bonding to resin-based cements, increased resistance to surface damage and good esthetic quality, graded zirconia emerges as a viable material concept for dental restorations. Copyright © 2017 The Academy of Dental Materials. Published by Elsevier Ltd. All rights reserved.

Communal Cooperation in Sensor Networks for Situation Management

NASA Technical Reports Server (NTRS)

Jones, Kennie H.; Lodding, Kenneth N.; Olariu, Stephan; Wilson, Larry; Xin,Chunsheng

2006-01-01

Situation management is a rapidly evolving science where managed sources are processed as realtime streams of events and fused in a way that maximizes comprehension, thus enabling better decisions for action. Sensor networks provide a new technology that promises ubiquitous input and action throughout an environment, which can substantially improve information available to the process. Here we describe a NASA program that requires improvements in sensor networks and situation management. We present an approach for massively deployed sensor networks that does not rely on centralized control but is founded in lessons learned from the way biological ecosystems are organized. In this approach, fully distributed data aggregation and integration can be performed in a scalable fashion where individual motes operate based on local information, making local decisions that achieve globally-meaningful results. This exemplifies the robust, fault-tolerant infrastructure required for successful situation management systems.

Estimation and Fusion for Tracking Over Long-Haul Links Using Artificial Neural Networks

DOE PAGES

Liu, Qiang; Brigham, Katharine; Rao, Nageswara S. V.

2017-02-01

In a long-haul sensor network, sensors are remotely deployed over a large geographical area to perform certain tasks, such as tracking and/or monitoring of one or more dynamic targets. A remote fusion center fuses the information provided by these sensors so that a final estimate of certain target characteristics – such as the position – is expected to possess much improved quality. In this paper, we pursue learning-based approaches for estimation and fusion of target states in longhaul sensor networks. In particular, we consider learning based on various implementations of artificial neural networks (ANNs). Finally, the joint effect of (i)more » imperfect communication condition, namely, link-level loss and delay, and (ii) computation constraints, in the form of low-quality sensor estimates, on ANN-based estimation and fusion, is investigated by means of analytical and simulation studies.« less

Information Fusion in Ad hoc Wireless Sensor Networks for Aircraft Health Monitoring

NASA Astrophysics Data System (ADS)

Fragoulis, Nikos; Tsagaris, Vassilis; Anastassopoulos, Vassilis

In this paper the use of an ad hoc wireless sensor network for implementing a structural health monitoring system is discussed. The network is consisted of sensors deployed throughout the aircraft. These sensors being in the form of a microelectronic chip and consisted of sensing, data processing and communicating components could be easily embedded in any mechanical aircraft component. The established sensor network, due to its ad hoc nature is easily scalable, allowing adding or removing any number of sensors. The position of the sensor nodes need not necessarily to be engineered or predetermined, giving this way the ability to be deployed in inaccessible points. Information collected from various sensors of different modalities throughout the aircraft is then fused in order to provide a more comprehensive image of the aircraft structural health. Sensor level fusion along with decision quality information is used, in order to enhance detection performance.

Estimation and Fusion for Tracking Over Long-Haul Links Using Artificial Neural Networks

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

Liu, Qiang; Brigham, Katharine; Rao, Nageswara S. V.

In a long-haul sensor network, sensors are remotely deployed over a large geographical area to perform certain tasks, such as tracking and/or monitoring of one or more dynamic targets. A remote fusion center fuses the information provided by these sensors so that a final estimate of certain target characteristics – such as the position – is expected to possess much improved quality. In this paper, we pursue learning-based approaches for estimation and fusion of target states in longhaul sensor networks. In particular, we consider learning based on various implementations of artificial neural networks (ANNs). Finally, the joint effect of (i)more » imperfect communication condition, namely, link-level loss and delay, and (ii) computation constraints, in the form of low-quality sensor estimates, on ANN-based estimation and fusion, is investigated by means of analytical and simulation studies.« less

Random matrix approach to plasmon resonances in the random impedance network model of disordered nanocomposites

NASA Astrophysics Data System (ADS)

Olekhno, N. A.; Beltukov, Y. M.

2018-05-01

Random impedance networks are widely used as a model to describe plasmon resonances in disordered metal-dielectric and other two-component nanocomposites. In the present work, the spectral properties of resonances in random networks are studied within the framework of the random matrix theory. We have shown that the appropriate ensemble of random matrices for the considered problem is the Jacobi ensemble (the MANOVA ensemble). The obtained analytical expressions for the density of states in such resonant networks show a good agreement with the results of numerical simulations in a wide range of metal filling fractions 0

Prediction of BP reactivity to talking using hybrid soft computing approaches.

PubMed

Kaur, Gurmanik; Arora, Ajat Shatru; Jain, Vijender Kumar

2014-01-01

High blood pressure (BP) is associated with an increased risk of cardiovascular diseases. Therefore, optimal precision in measurement of BP is appropriate in clinical and research studies. In this work, anthropometric characteristics including age, height, weight, body mass index (BMI), and arm circumference (AC) were used as independent predictor variables for the prediction of BP reactivity to talking. Principal component analysis (PCA) was fused with artificial neural network (ANN), adaptive neurofuzzy inference system (ANFIS), and least square-support vector machine (LS-SVM) model to remove the multicollinearity effect among anthropometric predictor variables. The statistical tests in terms of coefficient of determination (R (2)), root mean square error (RMSE), and mean absolute percentage error (MAPE) revealed that PCA based LS-SVM (PCA-LS-SVM) model produced a more efficient prediction of BP reactivity as compared to other models. This assessment presents the importance and advantages posed by PCA fused prediction models for prediction of biological variables.

Enhancement Of Reading Accuracy By Multiple Data Integration

NASA Astrophysics Data System (ADS)

Lee, Kangsuk

1989-07-01

In this paper, a multiple sensor integration technique with neural network learning algorithms is presented which can enhance the reading accuracy of the hand-written numerals. Many document reading applications involve hand-written numerals in a predetermined location on a form, and in many cases, critical data is redundantly described. The amount of a personal check is one such case which is written redundantly in numerals and in alphabetical form. Information from two optical character recognition modules, one specialized for digits and one for words, is combined to yield an enhanced recognition of the amount. The combination can be accomplished by a decision tree with "if-then" rules, but by simply fusing two or more sets of sensor data in a single expanded neural net, the same functionality can be expected with a much reduced system cost. Experimental results of fusing two neural nets to enhance overall recognition performance using a controlled data set are presented.

cadcVOFS: A FUSE Based File System Layer for VOSpace

NASA Astrophysics Data System (ADS)

Kavelaars, J.; Dowler, P.; Jenkins, D.; Hill, N.; Damian, A.

2012-09-01

The CADC is now making extensive use of the VOSpace protocol for user managed storage. The VOSpace standard allows a diverse set of rich data services to be delivered to users via a simple protocol. We have recently developed the cadcVOFS, a FUSE based file-system layer for VOSpace. cadcVOFS provides a filesystem layer on-top of VOSpace so that standard Unix tools (such as ‘find’, ‘emacs’, ‘awk’ etc) can be used directly on the data objects stored in VOSpace. Once mounted the VOSpace appears as a network storage volume inside the operating system. Within the CADC Cloud Computing project (CANFAR) we have used VOSpace as the method for retrieving and storing processing inputs and products. The abstraction of storage is an important component of Cloud Computing and the high use level of our VOSpace service reflects this.

Optimal Sensor Fusion for Structural Health Monitoring of Aircraft Composite Components

DTIC Science & Technology

2011-09-01

sensor networks combine or fuse different types of sensors. Fiber Bragg Grating ( FBG ) sensors can be inserted in layers of composite structures to...consideration. This paper describes an example of optimal sensor fusion, which combines FBG sensors and PZT sensors. Optimal sensor fusion tries to find...Fiber Bragg Grating ( FBG ) sensors can be inserted in layers of composite structures to provide local damage detection, while surface mounted

A Combination Therapy of JO-I and Chemotherapy in Ovarian Cancer Models

DTIC Science & Technology

2013-10-01

which consists of a 3PAR storage backend and is sharing data via a highly available NetApp storage gateway and 2 high throughput commodity storage...Environment is configured as self- service Enterprise cloud and currently hosts more than 700 virtual machines. The network infrastructure consists of...technology infrastructure and information system applications designed to integrate, automate, and standardize operations. These systems fuse state of

Assessing Routing Strategies for Cognitive Radio Sensor Networks

PubMed Central

Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S.; Saleem, Kashif

2013-01-01

Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area. PMID:24077319

Assessment of cortical bone fracture resistance curves by fusing artificial neural networks and linear regression.

PubMed

Vukicevic, Arso M; Jovicic, Gordana R; Jovicic, Milos N; Milicevic, Vladimir L; Filipovic, Nenad D

2018-02-01

Bone injures (BI) represents one of the major health problems, together with cancer and cardiovascular diseases. Assessment of the risks associated with BI is nontrivial since fragility of human cortical bone is varying with age. Due to restrictions for performing experiments on humans, only a limited number of fracture resistance curves (R-curves) for particular ages have been reported in the literature. This study proposes a novel decision support system for the assessment of bone fracture resistance by fusing various artificial intelligence algorithms. The aim was to estimate the R-curve slope, toughness threshold and stress intensity factor using the two input parameters commonly available during a routine clinical examination: patients age and crack length. Using the data from the literature, the evolutionary assembled Artificial Neural Network was developed and used for the derivation of Linear regression (LR) models of R-curves for arbitrary age. Finally, by using the patient (age)-specific LR models and diagnosed crack size one could estimate the risk of bone fracture under given physiological conditions. Compared to the literature, we demonstrated improved performances for estimating nonlinear changes of R-curve slope (R 2 = 0.82 vs. R 2 = 0.76) and Toughness threshold with ageing (R 2 = 0.73 vs. R 2 = 0.66).

Fused cerebral organoids model interactions between brain regions.

PubMed

Bagley, Joshua A; Reumann, Daniel; Bian, Shan; Lévi-Strauss, Julie; Knoblich, Juergen A

2017-07-01

Human brain development involves complex interactions between different regions, including long-distance neuronal migration or formation of major axonal tracts. Different brain regions can be cultured in vitro within 3D cerebral organoids, but the random arrangement of regional identities limits the reliable analysis of complex phenotypes. Here, we describe a coculture method combining brain regions of choice within one organoid tissue. By fusing organoids of dorsal and ventral forebrain identities, we generate a dorsal-ventral axis. Using fluorescent reporters, we demonstrate CXCR4-dependent GABAergic interneuron migration from ventral to dorsal forebrain and describe methodology for time-lapse imaging of human interneuron migration. Our results demonstrate that cerebral organoid fusion cultures can model complex interactions between different brain regions. Combined with reprogramming technology, fusions should offer researchers the possibility to analyze complex neurodevelopmental defects using cells from neurological disease patients and to test potential therapeutic compounds.

New scaling relation for information transfer in biological networks

PubMed Central

Kim, Hyunju; Davies, Paul; Walker, Sara Imari

2015-01-01

We quantify characteristics of the informational architecture of two representative biological networks: the Boolean network model for the cell-cycle regulatory network of the fission yeast Schizosaccharomyces pombe (Davidich et al. 2008 PLoS ONE 3, e1672 (doi:10.1371/journal.pone.0001672)) and that of the budding yeast Saccharomyces cerevisiae (Li et al. 2004 Proc. Natl Acad. Sci. USA 101, 4781–4786 (doi:10.1073/pnas.0305937101)). We compare our results for these biological networks with the same analysis performed on ensembles of two different types of random networks: Erdös–Rényi and scale-free. We show that both biological networks share features in common that are not shared by either random network ensemble. In particular, the biological networks in our study process more information than the random networks on average. Both biological networks also exhibit a scaling relation in information transferred between nodes that distinguishes them from random, where the biological networks stand out as distinct even when compared with random networks that share important topological properties, such as degree distribution, with the biological network. We show that the most biologically distinct regime of this scaling relation is associated with a subset of control nodes that regulate the dynamics and function of each respective biological network. Information processing in biological networks is therefore interpreted as an emergent property of topology (causal structure) and dynamics (function). Our results demonstrate quantitatively how the informational architecture of biologically evolved networks can distinguish them from other classes of network architecture that do not share the same informational properties. PMID:26701883

Hodge Decomposition of Information Flow on Small-World Networks.

PubMed

Haruna, Taichi; Fujiki, Yuuya

2016-01-01

We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

Creating, generating and comparing random network models with NetworkRandomizer.

PubMed

Tosadori, Gabriele; Bestvina, Ivan; Spoto, Fausto; Laudanna, Carlo; Scardoni, Giovanni

2016-01-01

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

Systemic risk on different interbank network topologies

NASA Astrophysics Data System (ADS)

Lenzu, Simone; Tedeschi, Gabriele

2012-09-01

In this paper we develop an interbank market with heterogeneous financial institutions that enter into lending agreements on different network structures. Credit relationships (links) evolve endogenously via a fitness mechanism based on agents' performance. By changing the agent's trust on its neighbor's performance, interbank linkages self-organize themselves into very different network architectures, ranging from random to scale-free topologies. We study which network architecture can make the financial system more resilient to random attacks and how systemic risk spreads over the network. To perturb the system, we generate a random attack via a liquidity shock. The hit bank is not automatically eliminated, but its failure is endogenously driven by its incapacity to raise liquidity in the interbank network. Our analysis shows that a random financial network can be more resilient than a scale free one in case of agents' heterogeneity.

Effects of topology on network evolution

NASA Astrophysics Data System (ADS)

Oikonomou, Panos; Cluzel, Philippe

2006-08-01

The ubiquity of scale-free topology in nature raises the question of whether this particular network design confers an evolutionary advantage. A series of studies has identified key principles controlling the growth and the dynamics of scale-free networks. Here, we use neuron-based networks of boolean components as a framework for modelling a large class of dynamical behaviours in both natural and artificial systems. Applying a training algorithm, we characterize how networks with distinct topologies evolve towards a pre-established target function through a process of random mutations and selection. We find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. Whereas homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously. Remarkably, this latter property is robust to variations of the degree exponent. In contrast, homogeneous random networks require a specific tuning of their connectivity to optimize their ability to evolve. These results highlight an organizing principle that governs the evolution of complex networks and that can improve the design of engineered systems.

Modeling Training Site Vegetation Coverage Probability with a Random Optimizing Procedure: An Artificial Neural Network Approach.

DTIC Science & Technology

1998-05-01

Coverage Probability with a Random Optimization Procedure: An Artificial Neural Network Approach by Biing T. Guan, George Z. Gertner, and Alan B...Modeling Training Site Vegetation Coverage Probability with a Random Optimizing Procedure: An Artificial Neural Network Approach 6. AUTHOR(S) Biing...coverage based on past coverage. Approach A literature survey was conducted to identify artificial neural network analysis techniques applicable for

Distributed Detection with Collisions in a Random, Single-Hop Wireless Sensor Network

DTIC Science & Technology

2013-05-26

public release; distribution is unlimited. Distributed detection with collisions in a random, single-hop wireless sensor network The views, opinions...1274 2 ABSTRACT Distributed detection with collisions in a random, single-hop wireless sensor network Report Title We consider the problem of... WIRELESS SENSOR NETWORK Gene T. Whipps?† Emre Ertin† Randolph L. Moses† ?U.S. Army Research Laboratory, Adelphi, MD 20783 †The Ohio State University

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

PubMed

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

Reactive polymer fused deposition manufacturing

DOEpatents

Kunc, Vlastimil; Rios, Orlando; Love, Lonnie J.; Duty, Chad E.; Johs, Alexander

2017-05-16

Methods and compositions for additive manufacturing that include reactive or thermosetting polymers, such as urethanes and epoxies. The polymers are melted, partially cross-linked prior to the depositing, deposited to form a component object, solidified, and fully cross-linked. These polymers form networks of chemical bonds that span the deposited layers. Application of a directional electromagnetic field can be applied to aromatic polymers after deposition to align the polymers for improved bonding between the deposited layers.

Statistical Analysis of Wireless Networks: Predicting Performance in Multiple Environments

DTIC Science & Technology

2006-06-01

The demonstration planned for May 2006 is an air, ground, and water- based scenario, occurring just north of Chiang Mai , Thailand. The scenario...will be fused, displayed, and distributed in real-time to local ( Chiang Mai ), theater (Bangkok), and global (Alameda, California) command and control...COASTS 2006 TOPOLOGY The 2006 version of the COASTS project occurred just north of Chiang Mai , Thailand, at the Mae Ngat Dam. COTS systems were

The Evolution of Regional Counterterrorism Centers Within a National Counterterrorism Network: Is It Time to Fuse More Than Information?

DTIC Science & Technology

2007-03-01

insufficient. Alternatively , the finished intelligence product may have been useful , but further 10...attributed to him, “honesty is the best policy,” compels me to point out that many researchers now believe that Franklin’s fellow diplomat, Richard...unlimited. Distribution authorized to U.S. Gov’t. agencies and their contractors; Administrative/Operational Use ; MAR 2007. Other requests shall be referred

Design and Analysis of a Data Fusion Scheme in Mobile Wireless Sensor Networks Based on Multi-Protocol Mobile Agents

PubMed Central

Wu, Chunxue; Wu, Wenliang; Wan, Caihua

2017-01-01

Sensors are increasingly used in mobile environments with wireless network connections. Multiple sensor types measure distinct aspects of the same event. Their measurements are then combined to produce integrated, reliable results. As the number of sensors in networks increases, low energy requirements and changing network connections complicate event detection and measurement. We present a data fusion scheme for use in mobile wireless sensor networks with high energy efficiency and low network delays, that still produces reliable results. In the first phase, we used a network simulation where mobile agents dynamically select the next hop migration node based on the stability parameter of the link, and perform the data fusion at the migration node. Agents use the fusion results to decide if it should return the fusion results to the processing center or continue to collect more data. In the second phase. The feasibility of data fusion at the node level is confirmed by an experimental design where fused data from color sensors show near-identical results to actual physical temperatures. These results are potentially important for new large-scale sensor network applications. PMID:29099793

Advanced algorithms for distributed fusion

NASA Astrophysics Data System (ADS)

Gelfand, A.; Smith, C.; Colony, M.; Bowman, C.; Pei, R.; Huynh, T.; Brown, C.

2008-03-01

The US Military has been undergoing a radical transition from a traditional "platform-centric" force to one capable of performing in a "Network-Centric" environment. This transformation will place all of the data needed to efficiently meet tactical and strategic goals at the warfighter's fingertips. With access to this information, the challenge of fusing data from across the batttlespace into an operational picture for real-time Situational Awareness emerges. In such an environment, centralized fusion approaches will have limited application due to the constraints of real-time communications networks and computational resources. To overcome these limitations, we are developing a formalized architecture for fusion and track adjudication that allows the distribution of fusion processes over a dynamically created and managed information network. This network will support the incorporation and utilization of low level tracking information within the Army Distributed Common Ground System (DCGS-A) or Future Combat System (FCS). The framework is based on Bowman's Dual Node Network (DNN) architecture that utilizes a distributed network of interlaced fusion and track adjudication nodes to build and maintain a globally consistent picture across all assets.

Randomization and resilience of brain functional networks as systems-level endophenotypes of schizophrenia.

PubMed

Lo, Chun-Yi Zac; Su, Tsung-Wei; Huang, Chu-Chung; Hung, Chia-Chun; Chen, Wei-Ling; Lan, Tsuo-Hung; Lin, Ching-Po; Bullmore, Edward T

2015-07-21

Schizophrenia is increasingly conceived as a disorder of brain network organization or dysconnectivity syndrome. Functional MRI (fMRI) networks in schizophrenia have been characterized by abnormally random topology. We tested the hypothesis that network randomization is an endophenotype of schizophrenia and therefore evident also in nonpsychotic relatives of patients. Head movement-corrected, resting-state fMRI data were acquired from 25 patients with schizophrenia, 25 first-degree relatives of patients, and 29 healthy volunteers. Graphs were used to model functional connectivity as a set of edges between regional nodes. We estimated the topological efficiency, clustering, degree distribution, resilience, and connection distance (in millimeters) of each functional network. The schizophrenic group demonstrated significant randomization of global network metrics (reduced clustering, greater efficiency), a shift in the degree distribution to a more homogeneous form (fewer hubs), a shift in the distance distribution (proportionally more long-distance edges), and greater resilience to targeted attack on network hubs. The networks of the relatives also demonstrated abnormal randomization and resilience compared with healthy volunteers, but they were typically less topologically abnormal than the patients' networks and did not have abnormal connection distances. We conclude that schizophrenia is associated with replicable and convergent evidence for functional network randomization, and a similar topological profile was evident also in nonpsychotic relatives, suggesting that this is a systems-level endophenotype or marker of familial risk. We speculate that the greater resilience of brain networks may confer some fitness advantages on nonpsychotic relatives that could explain persistence of this endophenotype in the population.

Biological Templating and the Production of Functional Fibers

DTIC Science & Technology

2006-11-01

technique to express designed functional peptides on the virus surface is so-called phage display . It has been widely used to modify the virus surface...and functionality. By using the phage display technique, short peptides containing 2 to 12 random amino acids can be fused into pIII proteins to... M13 filamentous bacteriophage were spun into continuous microfibers. These fibers can be made out of pure phage solution or a blended solution of

An Examination of Application of Artificial Neural Network in Cognitive Radios

NASA Astrophysics Data System (ADS)

Bello Salau, H.; Onwuka, E. N.; Aibinu, A. M.

2013-12-01

Recent advancement in software radio technology has led to the development of smart device known as cognitive radio. This type of radio fuses powerful techniques taken from artificial intelligence, game theory, wideband/multiple antenna techniques, information theory and statistical signal processing to create an outstanding dynamic behavior. This cognitive radio is utilized in achieving diverse set of applications such as spectrum sensing, radio parameter adaptation and signal classification. This paper contributes by reviewing different cognitive radio implementation that uses artificial intelligence such as the hidden markov models, metaheuristic algorithm and artificial neural networks (ANNs). Furthermore, different areas of application of ANNs and their performance metrics based approach are also examined.

Land mine detection using multispectral image fusion

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

Clark, G.A.; Sengupta, S.K.; Aimonetti, W.D.

1995-03-29

Our system fuses information contained in registered images from multiple sensors to reduce the effects of clutter and improve the ability to detect surface and buried land mines. The sensor suite currently consists of a camera that acquires images in six bands (400nm, 500nm, 600nm, 700nm, 800nm and 900nm). Past research has shown that it is extremely difficult to distinguish land mines from background clutter in images obtained from a single sensor. It is hypothesized, however, that information fused from a suite of various sensors is likely to provide better detection reliability, because the suite of sensors detects a varietymore » of physical properties that are more separable in feature space. The materials surrounding the mines can include natural materials (soil, rocks, foliage, water, etc.) and some artifacts. We use a supervised learning pattern recognition approach to detecting the metal and plastic land mines. The overall process consists of four main parts: Preprocessing, feature extraction, feature selection, and classification. These parts are used in a two step process to classify a subimage. We extract features from the images, and use feature selection algorithms to select only the most important features according to their contribution to correct detections. This allows us to save computational complexity and determine which of the spectral bands add value to the detection system. The most important features from the various sensors are fused using a supervised learning pattern classifier (the probabilistic neural network). We present results of experiments to detect land mines from real data collected from an airborne platform, and evaluate the usefulness of fusing feature information from multiple spectral bands.« less

Percolation of localized attack on complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai; Huang, Xuqing; Stanley, H. Eugene; Havlin, Shlomo

2015-02-01

The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks are neither random nor hub-targeted, but localized, where a group of neighboring nodes in a network are attacked and fail. In this paper we develop a percolation framework to analytically and numerically study the robustness of complex networks against such localized attack. In particular, we investigate this robustness in Erdős-Rényi networks, random-regular networks, and scale-free networks. Our results provide insight into how to better protect networks, enhance cybersecurity, and facilitate the design of more robust infrastructures.

The informational architecture of the cell.

PubMed

Walker, Sara Imari; Kim, Hyunju; Davies, Paul C W

2016-03-13

We compare the informational architecture of biological and random networks to identify informational features that may distinguish biological networks from random. The study presented here focuses on the Boolean network model for regulation of the cell cycle of the fission yeast Schizosaccharomyces pombe. We compare calculated values of local and global information measures for the fission yeast cell cycle to the same measures as applied to two different classes of random networks: Erdös-Rényi and scale-free. We report patterns in local information processing and storage that do indeed distinguish biological from random, associated with control nodes that regulate the function of the fission yeast cell-cycle network. Conversely, we find that integrated information, which serves as a global measure of 'emergent' information processing, does not differ from random for the case presented. We discuss implications for our understanding of the informational architecture of the fission yeast cell-cycle network in particular, and more generally for illuminating any distinctive physics that may be operative in life. © 2016 The Author(s).

Simulation of the mechanical behavior of random fiber networks with different microstructure.

PubMed

Hatami-Marbini, H

2018-05-24

Filamentous protein networks are broadly encountered in biological systems such as cytoskeleton and extracellular matrix. Many numerical studies have been conducted to better understand the fundamental mechanisms behind the striking mechanical properties of these networks. In most of these previous numerical models, the Mikado algorithm has been used to represent the network microstructure. Here, a different algorithm is used to create random fiber networks in order to investigate possible roles of architecture on the elastic behavior of filamentous networks. In particular, random fibrous structures are generated from the growth of individual fibers from random nucleation points. We use computer simulations to determine the mechanical behavior of these networks in terms of their model parameters. The findings are presented and discussed along with the response of Mikado fiber networks. We demonstrate that these alternative networks and Mikado networks show a qualitatively similar response. Nevertheless, the overall elasticity of Mikado networks is stiffer compared to that of the networks created using the alternative algorithm. We describe the effective elasticity of both network types as a function of their line density and of the material properties of the filaments. We also characterize the ratio of bending and axial energy and discuss the behavior of these networks in terms of their fiber density distribution and coordination number.

Infectious disease control using contact tracing in random and scale-free networks

PubMed Central

Kiss, Istvan Z; Green, Darren M; Kao, Rowland R

2005-01-01

Contact tracing aims to identify and isolate individuals that have been in contact with infectious individuals. The efficacy of contact tracing and the hierarchy of traced nodes—nodes with higher degree traced first—is investigated and compared on random and scale-free (SF) networks with the same number of nodes N and average connection K. For values of the transmission rate larger than a threshold, the final epidemic size on SF networks is smaller than that on corresponding random networks. While in random networks new infectious and traced nodes from all classes have similar average degrees, in SF networks the average degree of nodes that are in more advanced stages of the disease is higher at any given time. On SF networks tracing removes possible sources of infection with high average degree. However a higher tracing effort is required to control the epidemic than on corresponding random networks due to the high initial velocity of spread towards the highly connected nodes. An increased latency period fails to significantly improve contact tracing efficacy. Contact tracing has a limited effect if the removal rate of susceptible nodes is relatively high, due to the fast local depletion of susceptible nodes. PMID:16849217

Efficient sampling of complex network with modified random walk strategies

NASA Astrophysics Data System (ADS)

Xie, Yunya; Chang, Shuhua; Zhang, Zhipeng; Zhang, Mi; Yang, Lei

2018-02-01

We present two novel random walk strategies, choosing seed node (CSN) random walk and no-retracing (NR) random walk. Different from the classical random walk sampling, the CSN and NR strategies focus on the influences of the seed node choice and path overlap, respectively. Three random walk samplings are applied in the Erdös-Rényi (ER), Barabási-Albert (BA), Watts-Strogatz (WS), and the weighted USAir networks, respectively. Then, the major properties of sampled subnets, such as sampling efficiency, degree distributions, average degree and average clustering coefficient, are studied. The similar conclusions can be reached with these three random walk strategies. Firstly, the networks with small scales and simple structures are conducive to the sampling. Secondly, the average degree and the average clustering coefficient of the sampled subnet tend to the corresponding values of original networks with limited steps. And thirdly, all the degree distributions of the subnets are slightly biased to the high degree side. However, the NR strategy performs better for the average clustering coefficient of the subnet. In the real weighted USAir networks, some obvious characters like the larger clustering coefficient and the fluctuation of degree distribution are reproduced well by these random walk strategies.

Stochastic Models of Emerging Infectious Disease Transmission on Adaptive Random Networks

PubMed Central

Pipatsart, Navavat; Triampo, Wannapong

2017-01-01

We presented adaptive random network models to describe human behavioral change during epidemics and performed stochastic simulations of SIR (susceptible-infectious-recovered) epidemic models on adaptive random networks. The interplay between infectious disease dynamics and network adaptation dynamics was investigated in regard to the disease transmission and the cumulative number of infection cases. We found that the cumulative case was reduced and associated with an increasing network adaptation probability but was increased with an increasing disease transmission probability. It was found that the topological changes of the adaptive random networks were able to reduce the cumulative number of infections and also to delay the epidemic peak. Our results also suggest the existence of a critical value for the ratio of disease transmission and adaptation probabilities below which the epidemic cannot occur. PMID:29075314

Ray tracing method for simulation of laser beam interaction with random packings of powders

NASA Astrophysics Data System (ADS)

Kovalev, O. B.; Kovaleva, I. O.; Belyaev, V. V.

2018-03-01

Selective laser sintering is a technology of rapid manufacturing of a free form that is created as a solid object by selectively fusing successive layers of powder using a laser. The motivation of this study is due to the currently insufficient understanding of the processes and phenomena of selective laser melting of powders whose time scales differ by orders of magnitude. To construct random packings from mono- and polydispersed solid spheres, the algorithm of their generation based on the discrete element method is used. A numerical method of ray tracing is proposed that is used to simulate the interaction of laser radiation with a random bulk packing of spherical particles and to predict the optical properties of the granular layer, the extinction and absorption coefficients, depending on the optical properties of a powder material.

Network meta-analysis of disconnected networks: How dangerous are random baseline treatment effects?

PubMed

Béliveau, Audrey; Goring, Sarah; Platt, Robert W; Gustafson, Paul

2017-12-01

In network meta-analysis, the use of fixed baseline treatment effects (a priori independent) in a contrast-based approach is regularly preferred to the use of random baseline treatment effects (a priori dependent). That is because, often, there is not a need to model baseline treatment effects, which carry the risk of model misspecification. However, in disconnected networks, fixed baseline treatment effects do not work (unless extra assumptions are made), as there is not enough information in the data to update the prior distribution on the contrasts between disconnected treatments. In this paper, we investigate to what extent the use of random baseline treatment effects is dangerous in disconnected networks. We take 2 publicly available datasets of connected networks and disconnect them in multiple ways. We then compare the results of treatment comparisons obtained from a Bayesian contrast-based analysis of each disconnected network using random normally distributed and exchangeable baseline treatment effects to those obtained from a Bayesian contrast-based analysis of their initial connected network using fixed baseline treatment effects. For the 2 datasets considered, we found that the use of random baseline treatment effects in disconnected networks was appropriate. Because those datasets were not cherry-picked, there should be other disconnected networks that would benefit from being analyzed using random baseline treatment effects. However, there is also a risk for the normality and exchangeability assumption to be inappropriate in other datasets even though we have not observed this situation in our case study. We provide code, so other datasets can be investigated. Copyright © 2017 John Wiley & Sons, Ltd.

Quasirandom geometric networks from low-discrepancy sequences

NASA Astrophysics Data System (ADS)

Estrada, Ernesto

2017-08-01

We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d -tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d -dimensional Id unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a connection radius. We investigate computationally 11 network-theoretic properties of two-dimensional quasirandom networks and compare them with analogous random geometric networks. We also study their degree distribution and their spectral density distributions. We conclude from this intensive computational study that in terms of the uniformity of the distribution of the vertices in the unit square, the quasirandom networks look more random than the random geometric networks. We include an analysis of potential strategies for generating higher-dimensional quasirandom networks, where it is know that some of the low-discrepancy sequences are highly correlated. In this respect, we conclude that up to dimension 20, the use of scrambling, skipping and leaping strategies generate quasirandom networks with the desired properties of uniformity. Finally, we consider a diffusive process taking place on the nodes and edges of the quasirandom and random geometric graphs. We show that the diffusion time is shorter in the quasirandom graphs as a consequence of their larger structural homogeneity. In the random geometric graphs the diffusion produces clusters of concentration that make the process more slow. Such clusters are a direct consequence of the heterogeneous and irregular distribution of the nodes in the unit square in which the generation of random geometric graphs is based on.

Noisy scale-free networks

NASA Astrophysics Data System (ADS)

Scholz, Jan; Dejori, Mathäus; Stetter, Martin; Greiner, Martin

2005-05-01

The impact of observational noise on the analysis of scale-free networks is studied. Various noise sources are modeled as random link removal, random link exchange and random link addition. Emphasis is on the resulting modifications for the node-degree distribution and for a functional ranking based on betweenness centrality. The implications for estimated gene-expressed networks for childhood acute lymphoblastic leukemia are discussed.

Entropy of spatial network ensembles

NASA Astrophysics Data System (ADS)

Coon, Justin P.; Dettmann, Carl P.; Georgiou, Orestis

2018-04-01

We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly in space and links formed independently between pairs of nodes with probability given by a specified function (the "pair connection function") of their mutual distance. We consider the general case where randomness arises in node positions as well as pairwise connections (i.e., for a given pair distance, the corresponding edge state is a random variable). Classical random geometric graph and exponential graph models can be recovered in certain limits. We derive a simple bound for the entropy of a spatial network ensemble and calculate the conditional entropy of an ensemble given the node location distribution for hard and soft (probabilistic) pair connection functions. Under this formalism, we derive the connection function that yields maximum entropy under general constraints. Finally, we apply our analytical framework to study two practical examples: ad hoc wireless networks and the US flight network. Through the study of these examples, we illustrate that both exhibit properties that are indicative of nearly maximally entropic ensembles.

Clinical lipidomics: a new way to diagnose human diseases.

PubMed

Lv, Jiapei; Zhang, Linlin; Yan, Furong; Wang, Xiangdong

2018-04-27

Lipidomics is a measurement of a large scale of lipid species to understand roles of their carbon atoms, dual bonds, or isomerism in the lipid molecule. Clinical lipidomics was recently defined "as a new integrative biomedicine to discover the correlation and regulation between a large scale of lipid elements measured and analyzed in liquid biopsies from patients with those patient phenomes and clinical phenotypes". The first step to translate lipidomics into clinical lipidomics is to settle a number of standard operation procedures and protocols of lipidomics performance and measurement. Clinical lipidomics is the part of clinical trans-omics which was coined as a new emerging scientific discipline where clinical phenomes are integrated with molecular multiomics. We believe it is the time to translate lipid science and lipidomics into clinical application and to understand the importance of clinical lipidomics as one of the most helpful approaches during the design and decision-making of therapeutic strategies for individuals. We emphasize here that clinical lipidomics should be merged with clinical phenomes, e.g. patient signs and symptoms, biomedical analyses, pathology, images, and responses to therapies, although it is difficult to integrate and fuse the information of clinical lipidomics with clinical phenomes. It will be a great achievement if we can draw the networks of lipidomic species fused with networks of genes and proteins to describe the molecular mechanisms of the disease in multi-dimensions.

A Cost-Effective Vehicle Localization Solution Using an Interacting Multiple Model−Unscented Kalman Filters (IMM-UKF) Algorithm and Grey Neural Network

PubMed Central

Xu, Qimin; Li, Xu; Chan, Ching-Yao

2017-01-01

In this paper, we propose a cost-effective localization solution for land vehicles, which can simultaneously adapt to the uncertain noise of inertial sensors and bridge Global Positioning System (GPS) outages. First, three Unscented Kalman filters (UKFs) with different noise covariances are introduced into the framework of Interacting Multiple Model (IMM) algorithm to form the proposed IMM-based UKF, termed as IMM-UKF. The IMM algorithm can provide a soft switching among the three UKFs and therefore adapt to different noise characteristics. Further, two IMM-UKFs are executed in parallel when GPS is available. One fuses the information of low-cost GPS, in-vehicle sensors, and micro electromechanical system (MEMS)-based reduced inertial sensor systems (RISS), while the other fuses only in-vehicle sensors and MEMS-RISS. The differences between the state vectors of the two IMM-UKFs are considered as training data of a Grey Neural Network (GNN) module, which is known for its high prediction accuracy with a limited amount of samples. The GNN module can predict and compensate position errors when GPS signals are blocked. To verify the feasibility and effectiveness of the proposed solution, road-test experiments with various driving scenarios were performed. The experimental results indicate that the proposed solution outperforms all the compared methods. PMID:28629165

Multisensor fusion for 3-D defect characterization using wavelet basis function neural networks

NASA Astrophysics Data System (ADS)

Lim, Jaein; Udpa, Satish S.; Udpa, Lalita; Afzal, Muhammad

2001-04-01

The primary objective of multi-sensor data fusion, which offers both quantitative and qualitative benefits, has the ability to draw inferences that may not be feasible with data from a single sensor alone. In this paper, data from two sets of sensors are fused to estimate the defect profile from magnetic flux leakage (MFL) inspection data. The two sensors measure the axial and circumferential components of the MFL. Data is fused at the signal level. If the flux is oriented axially, the samples of the axial signal are measured along a direction parallel to the flaw, while the circumferential signal is measured in a direction that is perpendicular to the flaw. The two signals are combined as the real and imaginary components of a complex valued signal. Signals from an array of sensors are arranged in contiguous rows to obtain a complex valued image. A boundary extraction algorithm is used to extract the defect areas in the image. Signals from the defect regions are then processed to minimize noise and the effects of lift-off. Finally, a wavelet basis function (WBF) neural network is employed to map the complex valued image appropriately to obtain the geometrical profile of the defect. The feasibility of the approach was evaluated using the data obtained from the MFL inspection of natural gas transmission pipelines. Results show the effectiveness of the approach.

Synchronizability of random rectangular graphs

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

Estrada, Ernesto, E-mail: ernesto.estrada@strath.ac.uk; Chen, Guanrong

2015-08-15

Random rectangular graphs (RRGs) represent a generalization of the random geometric graphs in which the nodes are embedded into hyperrectangles instead of on hypercubes. The synchronizability of RRG model is studied. Both upper and lower bounds of the eigenratio of the network Laplacian matrix are determined analytically. It is proven that as the rectangular network is more elongated, the network becomes harder to synchronize. The synchronization processing behavior of a RRG network of chaotic Lorenz system nodes is numerically investigated, showing complete consistence with the theoretical results.

Toward negative Poisson's ratio composites: Investigation of the auxetic behavior of fibrous networks

NASA Astrophysics Data System (ADS)

Tatlier, Mehmet Seha

Random fibrous can be found among natural and synthetic materials. Some of these random fibrous networks possess negative Poisson's ratio and they are extensively called auxetic materials. The governing mechanisms behind this counter intuitive property in random networks are yet to be understood and this kind of auxetic material remains widely under-explored. However, most of synthetic auxetic materials suffer from their low strength. This shortcoming can be rectified by developing high strength auxetic composites. The process of embedding auxetic random fibrous networks in a polymer matrix is an attractive alternate route to the manufacture of auxetic composites, however before such an approach can be developed, a methodology for designing fibrous networks with the desired negative Poisson's ratios must first be established. This requires an understanding of the factors which bring about negative Poisson's ratios in these materials. In this study, a numerical model is presented in order to investigate the auxetic behavior in compressed random fiber networks. Finite element analyses of three-dimensional stochastic fiber networks were performed to gain insight into the effects of parameters such as network anisotropy, network density, and degree of network compression on the out-of-plane Poisson's ratio and Young's modulus. The simulation results suggest that the compression is the critical parameter that gives rise to negative Poisson's ratio while anisotropy significantly promotes the auxetic behavior. This model can be utilized to design fibrous auxetic materials and to evaluate feasibility of developing auxetic composites by using auxetic fibrous networks as the reinforcing layer.

Influence of Choice of Null Network on Small-World Parameters of Structural Correlation Networks

PubMed Central

Hosseini, S. M. Hadi; Kesler, Shelli R.

2013-01-01

In recent years, coordinated variations in brain morphology (e.g., volume, thickness) have been employed as a measure of structural association between brain regions to infer large-scale structural correlation networks. Recent evidence suggests that brain networks constructed in this manner are inherently more clustered than random networks of the same size and degree. Thus, null networks constructed by randomizing topology are not a good choice for benchmarking small-world parameters of these networks. In the present report, we investigated the influence of choice of null networks on small-world parameters of gray matter correlation networks in healthy individuals and survivors of acute lymphoblastic leukemia. Three types of null networks were studied: 1) networks constructed by topology randomization (TOP), 2) networks matched to the distributional properties of the observed covariance matrix (HQS), and 3) networks generated from correlation of randomized input data (COR). The results revealed that the choice of null network not only influences the estimated small-world parameters, it also influences the results of between-group differences in small-world parameters. In addition, at higher network densities, the choice of null network influences the direction of group differences in network measures. Our data suggest that the choice of null network is quite crucial for interpretation of group differences in small-world parameters of structural correlation networks. We argue that none of the available null models is perfect for estimation of small-world parameters for correlation networks and the relative strengths and weaknesses of the selected model should be carefully considered with respect to obtained network measures. PMID:23840672

Immunization of Epidemics in Multiplex Networks

PubMed Central

Zhao, Dawei; Wang, Lianhai; Li, Shudong; Wang, Zhen; Wang, Lin; Gao, Bo

2014-01-01

Up to now, immunization of disease propagation has attracted great attention in both theoretical and experimental researches. However, vast majority of existing achievements are limited to the simple assumption of single layer networked population, which seems obviously inconsistent with recent development of complex network theory: each node could possess multiple roles in different topology connections. Inspired by this fact, we here propose the immunization strategies on multiplex networks, including multiplex node-based random (targeted) immunization and layer node-based random (targeted) immunization. With the theory of generating function, theoretical analysis is developed to calculate the immunization threshold, which is regarded as the most critical index for the effectiveness of addressed immunization strategies. Interestingly, both types of random immunization strategies show more efficiency in controlling disease spreading on multiplex Erdös-Rényi (ER) random networks; while targeted immunization strategies provide better protection on multiplex scale-free (SF) networks. PMID:25401755

Immunization of epidemics in multiplex networks.

PubMed

Zhao, Dawei; Wang, Lianhai; Li, Shudong; Wang, Zhen; Wang, Lin; Gao, Bo

2014-01-01

Up to now, immunization of disease propagation has attracted great attention in both theoretical and experimental researches. However, vast majority of existing achievements are limited to the simple assumption of single layer networked population, which seems obviously inconsistent with recent development of complex network theory: each node could possess multiple roles in different topology connections. Inspired by this fact, we here propose the immunization strategies on multiplex networks, including multiplex node-based random (targeted) immunization and layer node-based random (targeted) immunization. With the theory of generating function, theoretical analysis is developed to calculate the immunization threshold, which is regarded as the most critical index for the effectiveness of addressed immunization strategies. Interestingly, both types of random immunization strategies show more efficiency in controlling disease spreading on multiplex Erdös-Rényi (ER) random networks; while targeted immunization strategies provide better protection on multiplex scale-free (SF) networks.

Human fatigue expression recognition through image-based dynamic multi-information and bimodal deep learning

NASA Astrophysics Data System (ADS)

Zhao, Lei; Wang, Zengcai; Wang, Xiaojin; Qi, Yazhou; Liu, Qing; Zhang, Guoxin

2016-09-01

Human fatigue is an important cause of traffic accidents. To improve the safety of transportation, we propose, in this paper, a framework for fatigue expression recognition using image-based facial dynamic multi-information and a bimodal deep neural network. First, the landmark of face region and the texture of eye region, which complement each other in fatigue expression recognition, are extracted from facial image sequences captured by a single camera. Then, two stacked autoencoder neural networks are trained for landmark and texture, respectively. Finally, the two trained neural networks are combined by learning a joint layer on top of them to construct a bimodal deep neural network. The model can be used to extract a unified representation that fuses landmark and texture modalities together and classify fatigue expressions accurately. The proposed system is tested on a human fatigue dataset obtained from an actual driving environment. The experimental results demonstrate that the proposed method performs stably and robustly, and that the average accuracy achieves 96.2%.

Investigation of Hall Effect Thruster Channel Wall Erosion Mechanisms

DTIC Science & Technology

2016-08-02

pretest height and laser image, c, d) post - test height and laser image. On all the pre-roughened samples, a cell-pattern developed from the random...7.8: Pre and post - test sample microscopy: Fused silica sample SA6 (loaded), 20x, center of exposed surface, a, b) pretest height and laser image, c, d...stress on the surface features developed during plasma erosion. The experiment is also designed specifically to test the SRH. A test fixture is

Tightly Integrating Optical And Inertial Sensors For Navigation Using The UKF

DTIC Science & Technology

2008-03-01

832. September 2004. 3. Brown , Robert Grover and Patrick Y.C. Hwang . Introduction to Random Signals and Applied Kalman Filtering. John Wiley and Sons...effectiveness of fusing imaging and inertial sensors using an Extended Kalman Filter (EKF) algorithm has been shown in previous research efforts. In this...model assumed by the EKF. In order to cope with divergence problem, the Unscented (Sigma-Point) Kalman Filter (UKF) has been proposed in the literature in

Microbeads display of proteins using emulsion PCR and cell-free protein synthesis.

PubMed

Gan, Rui; Yamanaka, Yumiko; Kojima, Takaaki; Nakano, Hideo

2008-01-01

We developed a method for coupling protein to its coding DNA on magnetic microbeads using emulsion PCR and cell-free protein synthesis in emulsion. A PCR mixture containing streptavidin-coated microbeads was compartmentalized by water-in-oil (w/o) emulsion with estimated 0.5 template molecules per droplet. The template molecules were amplified and immobilized on beads via bead-linked reverse primers and biotinylated forward primers. After amplification, the templates were sequentially labeled with streptavidin and biotinylated anti-glutathione S-transferase (GST) antibody. The pool of beads was then subjected to cell-free protein synthesis compartmentalized in another w/o emulsion, in which templates were coupled to their coding proteins. We mixed two types of DNA templates of Histidine6 tag (His6)-fused and FLAG tag-fused GST in a ratio of 1:1,000 (His6: FLAG) for use as a model DNA library. After incubation with fluorescein isothiocyanate (FITC)-labeled anti-His6 (C-term) antibody, the beads with the His6 gene were enriched 917-fold in a single-round screening by using flow cytometry. A library with a theoretical diversity of 10(6) was constructed by randomizing the middle four residues of the His6 tag. After a two-round screening, the randomized sequences were substantially converged to peptide-encoding sequences recognized by the anti-His6 antibody.

A Statistical Method to Distinguish Functional Brain Networks

PubMed Central

Fujita, André; Vidal, Maciel C.; Takahashi, Daniel Y.

2017-01-01

One major problem in neuroscience is the comparison of functional brain networks of different populations, e.g., distinguishing the networks of controls and patients. Traditional algorithms are based on search for isomorphism between networks, assuming that they are deterministic. However, biological networks present randomness that cannot be well modeled by those algorithms. For instance, functional brain networks of distinct subjects of the same population can be different due to individual characteristics. Moreover, networks of subjects from different populations can be generated through the same stochastic process. Thus, a better hypothesis is that networks are generated by random processes. In this case, subjects from the same group are samples from the same random process, whereas subjects from different groups are generated by distinct processes. Using this idea, we developed a statistical test called ANOGVA to test whether two or more populations of graphs are generated by the same random graph model. Our simulations' results demonstrate that we can precisely control the rate of false positives and that the test is powerful to discriminate random graphs generated by different models and parameters. The method also showed to be robust for unbalanced data. As an example, we applied ANOGVA to an fMRI dataset composed of controls and patients diagnosed with autism or Asperger. ANOGVA identified the cerebellar functional sub-network as statistically different between controls and autism (p < 0.001). PMID:28261045

A Statistical Method to Distinguish Functional Brain Networks.

PubMed

Fujita, André; Vidal, Maciel C; Takahashi, Daniel Y

2017-01-01

One major problem in neuroscience is the comparison of functional brain networks of different populations, e.g., distinguishing the networks of controls and patients. Traditional algorithms are based on search for isomorphism between networks, assuming that they are deterministic. However, biological networks present randomness that cannot be well modeled by those algorithms. For instance, functional brain networks of distinct subjects of the same population can be different due to individual characteristics. Moreover, networks of subjects from different populations can be generated through the same stochastic process. Thus, a better hypothesis is that networks are generated by random processes. In this case, subjects from the same group are samples from the same random process, whereas subjects from different groups are generated by distinct processes. Using this idea, we developed a statistical test called ANOGVA to test whether two or more populations of graphs are generated by the same random graph model. Our simulations' results demonstrate that we can precisely control the rate of false positives and that the test is powerful to discriminate random graphs generated by different models and parameters. The method also showed to be robust for unbalanced data. As an example, we applied ANOGVA to an fMRI dataset composed of controls and patients diagnosed with autism or Asperger. ANOGVA identified the cerebellar functional sub-network as statistically different between controls and autism ( p < 0.001).

Autophagy meets fused in sarcoma-positive stress granules.

PubMed

Matus, Soledad; Bosco, Daryl A; Hetz, Claudio

2014-12-01

Mutations in fused in sarcoma and/or translocated in liposarcoma (FUS, TLS or FUS) are linked to familial cases of amyotrophic lateral sclerosis (ALS). Mutant FUS selectively accumulates into discrete cytosolic structures known as stress granules under various stress conditions. In addition, mutant FUS expression can alter the dynamics and morphology of stress granules. Although the link between mutant FUS and stress granules is well established, the mechanisms modulating stress granule formation and disassembly in the context of ALS are poorly understood. In this issue of Neurobiology of Aging, Ryu et al. uncover the impact of autophagy on the potential toxicity of mutant FUS-positive stress granules. The authors provide evidence indicating that enhanced autophagy activity reduces the number of stress granules, which in the case of cells containing mutant FUS-positive stress granules, is neuroprotective. Overall, this study identifies an intersection between the proteostasis network and alterations in RNA metabolism in ALS through the dynamic assembly and disassembly of stress granules. Copyright © 2014 Elsevier Inc. All rights reserved.

Cloud Detection by Fusing Multi-Scale Convolutional Features

NASA Astrophysics Data System (ADS)

Li, Zhiwei; Shen, Huanfeng; Wei, Yancong; Cheng, Qing; Yuan, Qiangqiang

2018-04-01

Clouds detection is an important pre-processing step for accurate application of optical satellite imagery. Recent studies indicate that deep learning achieves best performance in image segmentation tasks. Aiming at boosting the accuracy of cloud detection for multispectral imagery, especially for those that contain only visible and near infrared bands, in this paper, we proposed a deep learning based cloud detection method termed MSCN (multi-scale cloud net), which segments cloud by fusing multi-scale convolutional features. MSCN was trained on a global cloud cover validation collection, and was tested in more than ten types of optical images with different resolution. Experiment results show that MSCN has obvious advantages over the traditional multi-feature combined cloud detection method in accuracy, especially when in snow and other areas covered by bright non-cloud objects. Besides, MSCN produced more detailed cloud masks than the compared deep cloud detection convolution network. The effectiveness of MSCN make it promising for practical application in multiple kinds of optical imagery.

Impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach.

PubMed

Chandrasekar, A; Rakkiyappan, R; Cao, Jinde

2015-10-01

This paper studies the impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach. The array of neural networks are coupled in a random fashion which is governed by Bernoulli random variable. The aim of this paper is to obtain the synchronization criteria, which is suitable for both exactly known and partly unknown transition probabilities such that the coupled neural network is synchronized with mixed time-delay. The considered impulsive effects can be synchronized at partly unknown transition probabilities. Besides, a multiple integral approach is also proposed to strengthen the Markovian jumping randomly coupled neural networks with partly unknown transition probabilities. By making use of Kronecker product and some useful integral inequalities, a novel Lyapunov-Krasovskii functional was designed for handling the coupled neural network with mixed delay and then impulsive synchronization criteria are solvable in a set of linear matrix inequalities. Finally, numerical examples are presented to illustrate the effectiveness and advantages of the theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

A fusion network for semantic segmentation using RGB-D data

NASA Astrophysics Data System (ADS)

Yuan, Jiahui; Zhang, Kun; Xia, Yifan; Qi, Lin; Dong, Junyu

2018-04-01

Semantic scene parsing is considerable in many intelligent field, including perceptual robotics. For the past few years, pixel-wise prediction tasks like semantic segmentation with RGB images has been extensively studied and has reached very remarkable parsing levels, thanks to convolutional neural networks (CNNs) and large scene datasets. With the development of stereo cameras and RGBD sensors, it is expected that additional depth information will help improving accuracy. In this paper, we propose a semantic segmentation framework incorporating RGB and complementary depth information. Motivated by the success of fully convolutional networks (FCN) in semantic segmentation field, we design a fully convolutional networks consists of two branches which extract features from both RGB and depth data simultaneously and fuse them as the network goes deeper. Instead of aggregating multiple model, our goal is to utilize RGB data and depth data more effectively in a single model. We evaluate our approach on the NYU-Depth V2 dataset, which consists of 1449 cluttered indoor scenes, and achieve competitive results with the state-of-the-art methods.

Evidence for novel age-dependent network structures as a putative primo vascular network in the dura mater of the rat brain

PubMed Central

Lee, Ho-Sung; Kang, Dai-In; Yoon, Seung Zhoo; Ryu, Yeon Hee; Lee, Inhyung; Kim, Hoon-Gi; Lee, Byung-Cheon; Lee, Ki Bog

2015-01-01

With chromium-hematoxylin staining, we found evidence for the existence of novel age-dependent network structures in the dura mater of rat brains. Under stereomicroscopy, we noticed that chromium-hematoxylin-stained threadlike structures, which were barely observable in 1-week-old rats, were networked in specific areas of the brain, for example, the lateral lobes and the cerebella, in 4-week-old rats. In 7-week-old rats, those structures were found to have become larger and better networked. With phase contrast microscopy, we found that in 1-week-old rats, chromium-hematoxylin-stained granules were scattered in the same areas of the brain in which the network structures would later be observed in the 4- and 7-week-old rats. Such age-dependent network structures were examined by using optical and transmission electron microscopy, and the following results were obtained. The scattered granules fused into networks with increasing age. Cross-sections of the age-dependent network structures demonstrated heavily-stained basophilic substructures. Transmission electron microscopy revealed the basophilic substructures to be clusters with high electron densities consisting of nanosized particles. We report these data as evidence for the existence of age-dependent network structures in the dura mater, we discuss their putative functions of age-dependent network structures beyond the general concept of the dura mater as a supporting matrix. PMID:26330833

All-optical routing and switching for three-dimensional photonic circuitry

PubMed Central

Keil, Robert; Heinrich, Matthias; Dreisow, Felix; Pertsch, Thomas; Tünnermann, Andreas; Nolte, Stefan; Christodoulides, Demetrios N.; Szameit, Alexander

2011-01-01

The ability to efficiently transmit and rapidly process huge amounts of data has become almost indispensable to our daily lives. It turned out that all-optical networks provide a very promising platform to deal with this task. Within such networks opto-optical switches, where light is directed by light, are a crucial building block for an effective operation. In this article, we present an experimental analysis of the routing and switching behaviour of light in two-dimensional evanescently coupled waveguide arrays of Y- and T-junction geometries directly inscribed into fused silica using ultrashort laser pulses. These systems have the fundamental advantage of supporting three-dimensional network topologies, thereby breaking the limitations on complexity associated with planar structures while maintaining a high dirigibility of the light. Our results show how such arrays can be used to control the flow of optical signals within integrated photonic circuits. PMID:22355612

An Ensemble Deep Convolutional Neural Network Model with Improved D-S Evidence Fusion for Bearing Fault Diagnosis.

PubMed

Li, Shaobo; Liu, Guokai; Tang, Xianghong; Lu, Jianguang; Hu, Jianjun

2017-07-28

Intelligent machine health monitoring and fault diagnosis are becoming increasingly important for modern manufacturing industries. Current fault diagnosis approaches mostly depend on expert-designed features for building prediction models. In this paper, we proposed IDSCNN, a novel bearing fault diagnosis algorithm based on ensemble deep convolutional neural networks and an improved Dempster-Shafer theory based evidence fusion. The convolutional neural networks take the root mean square (RMS) maps from the FFT (Fast Fourier Transformation) features of the vibration signals from two sensors as inputs. The improved D-S evidence theory is implemented via distance matrix from evidences and modified Gini Index. Extensive evaluations of the IDSCNN on the Case Western Reserve Dataset showed that our IDSCNN algorithm can achieve better fault diagnosis performance than existing machine learning methods by fusing complementary or conflicting evidences from different models and sensors and adapting to different load conditions.

Sculpting and fusing biomimetic vesicle networks using optical tweezers.

PubMed

Bolognesi, Guido; Friddin, Mark S; Salehi-Reyhani, Ali; Barlow, Nathan E; Brooks, Nicholas J; Ces, Oscar; Elani, Yuval

2018-05-14

Constructing higher-order vesicle assemblies has discipline-spanning potential from responsive soft-matter materials to artificial cell networks in synthetic biology. This potential is ultimately derived from the ability to compartmentalise and order chemical species in space. To unlock such applications, spatial organisation of vesicles in relation to one another must be controlled, and techniques to deliver cargo to compartments developed. Herein, we use optical tweezers to assemble, reconfigure and dismantle networks of cell-sized vesicles that, in different experimental scenarios, we engineer to exhibit several interesting properties. Vesicles are connected through double-bilayer junctions formed via electrostatically controlled adhesion. Chemically distinct vesicles are linked across length scales, from several nanometres to hundreds of micrometres, by axon-like tethers. In the former regime, patterning membranes with proteins and nanoparticles facilitates material exchange between compartments and enables laser-triggered vesicle merging. This allows us to mix and dilute content, and to initiate protein expression by delivering biomolecular reaction components.

An Ensemble Deep Convolutional Neural Network Model with Improved D-S Evidence Fusion for Bearing Fault Diagnosis

PubMed Central

Li, Shaobo; Liu, Guokai; Tang, Xianghong; Lu, Jianguang

2017-01-01

Intelligent machine health monitoring and fault diagnosis are becoming increasingly important for modern manufacturing industries. Current fault diagnosis approaches mostly depend on expert-designed features for building prediction models. In this paper, we proposed IDSCNN, a novel bearing fault diagnosis algorithm based on ensemble deep convolutional neural networks and an improved Dempster–Shafer theory based evidence fusion. The convolutional neural networks take the root mean square (RMS) maps from the FFT (Fast Fourier Transformation) features of the vibration signals from two sensors as inputs. The improved D-S evidence theory is implemented via distance matrix from evidences and modified Gini Index. Extensive evaluations of the IDSCNN on the Case Western Reserve Dataset showed that our IDSCNN algorithm can achieve better fault diagnosis performance than existing machine learning methods by fusing complementary or conflicting evidences from different models and sensors and adapting to different load conditions. PMID:28788099

Dynamin-Related Protein 1 Translocates from the Cytosol to Mitochondria during UV-Induced Apoptosis

NASA Astrophysics Data System (ADS)

Zhang, Zhenzhen; Wu, Shengnan; Feng, Jie

2011-01-01

Mitochondria are dynamic structures that frequently divide and fuse with one another to form interconnecting network. This network disintegrates into punctiform organelles during apoptosis. However, the mechanisms involved in these processes are still not well characterized. In this study, we investigate the role of dynamin-related protein 1 (Drp1), a large GTPase that mediates outer mitochondrial membrane fission, in mitochondrial dynamics in response to UV irradiation in human lung adenocarcinoma cells (ASTC-α-1) and HeLa cells. Using time-lapse fluorescent imaging, we find that Drp1 primarily distributes in cytosol under physiological conditions. After UV treatment, Drp1 translocates from cytosol to mitochondria, indicating the enhancement of Drp1 mitochondrial accumulation. Our results suggest that Drp1 is involved in the regulation of transition from an interconnecting network to a punctiform mitochondrial phenotype during UV-induced apoptosis.

29 CFR 1910.399 - Definitions applicable to this subpart.

Code of Federal Regulations, 2010 CFR

2010-07-01

... assembly of a fuse support with either a fuseholder, fuse carrier, or disconnecting blade. The fuseholder or fuse carrier may include a conducting element (fuse link), or may act as the disconnecting blade... in which all or part of the fuse support and its fuse link or disconnecting blade are mounted in oil...

29 CFR 1910.399 - Definitions applicable to this subpart.

Code of Federal Regulations, 2013 CFR

2013-07-01

... assembly of a fuse support with either a fuseholder, fuse carrier, or disconnecting blade. The fuseholder or fuse carrier may include a conducting element (fuse link), or may act as the disconnecting blade... in which all or part of the fuse support and its fuse link or disconnecting blade are mounted in oil...

29 CFR 1910.399 - Definitions applicable to this subpart.

Code of Federal Regulations, 2014 CFR

2014-07-01

... assembly of a fuse support with either a fuseholder, fuse carrier, or disconnecting blade. The fuseholder or fuse carrier may include a conducting element (fuse link), or may act as the disconnecting blade... in which all or part of the fuse support and its fuse link or disconnecting blade are mounted in oil...

29 CFR 1910.399 - Definitions applicable to this subpart.

Code of Federal Regulations, 2011 CFR

2011-07-01

... assembly of a fuse support with either a fuseholder, fuse carrier, or disconnecting blade. The fuseholder or fuse carrier may include a conducting element (fuse link), or may act as the disconnecting blade... in which all or part of the fuse support and its fuse link or disconnecting blade are mounted in oil...

29 CFR 1910.399 - Definitions applicable to this subpart.

Code of Federal Regulations, 2012 CFR

2012-07-01

... assembly of a fuse support with either a fuseholder, fuse carrier, or disconnecting blade. The fuseholder or fuse carrier may include a conducting element (fuse link), or may act as the disconnecting blade... in which all or part of the fuse support and its fuse link or disconnecting blade are mounted in oil...

Information fusion methods based on physical laws.

PubMed

Rao, Nageswara S V; Reister, David B; Barhen, Jacob

2005-01-01

We consider systems whose parameters satisfy certain easily computable physical laws. Each parameter is directly measured by a number of sensors, or estimated using measurements, or both. The measurement process may introduce both systematic and random errors which may then propagate into the estimates. Furthermore, the actual parameter values are not known since every parameter is measured or estimated, which makes the existing sample-based fusion methods inapplicable. We propose a fusion method for combining the measurements and estimators based on the least violation of physical laws that relate the parameters. Under fairly general smoothness and nonsmoothness conditions on the physical laws, we show the asymptotic convergence of our method and also derive distribution-free performance bounds based on finite samples. For suitable choices of the fuser classes, we show that for each parameter the fused estimate is probabilistically at least as good as its best measurement as well as best estimate. We illustrate the effectiveness of this method for a practical problem of fusing well-log data in methane hydrate exploration.

Blackmail propagation on small-world networks

NASA Astrophysics Data System (ADS)

Shao, Zhi-Gang; Jian-Ping Sang; Zou, Xian-Wu; Tan, Zhi-Jie; Jin, Zhun-Zhi

2005-06-01

The dynamics of the blackmail propagation model based on small-world networks is investigated. It is found that for a given transmitting probability λ the dynamical behavior of blackmail propagation transits from linear growth type to logistical growth one with the network randomness p increases. The transition takes place at the critical network randomness pc=1/N, where N is the total number of nodes in the network. For a given network randomness p the dynamical behavior of blackmail propagation transits from exponential decrease type to logistical growth one with the transmitting probability λ increases. The transition occurs at the critical transmitting probability λc=1/, where is the average number of the nearest neighbors. The present work will be useful for understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Randomizing bipartite networks: the case of the World Trade Web.

PubMed

Saracco, Fabio; Di Clemente, Riccardo; Gabrielli, Andrea; Squartini, Tiziano

2015-06-01

Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization.

Exploiting Social Media Sensor Networks through Novel Data Fusion Techniques

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

Kouri, Tina

Unprecedented amounts of data are continuously being generated by sensors (“hard” data) and by humans (“soft” data), and this data needs to be exploited to its full potential. The first step in exploiting this data is determine how the hard and soft data are related to each other. In this project we fuse hard and soft data, using the attributes of each (e.g., time and space), to gain more information about interesting events. Next, we attempt to use social networking textual data to predict the present (i.e., predict that an interesting event is occurring and details about the event) usingmore » data mining, machine learning, natural language processing, and text analysis techniques.« less

Epidemic transmission on random mobile network with diverse infection periods

NASA Astrophysics Data System (ADS)

Li, Kezan; Yu, Hong; Zeng, Zhaorong; Ding, Yong; Ma, Zhongjun

2015-05-01

The heterogeneity of individual susceptibility and infectivity and time-varying topological structure are two realistic factors when we study epidemics on complex networks. Current research results have shown that the heterogeneity of individual susceptibility and infectivity can increase the epidemic threshold in a random mobile dynamical network with the same infection period. In this paper, we will focus on random mobile dynamical networks with diverse infection periods due to people's different constitutions and external circumstances. Theoretical results indicate that the epidemic threshold of the random mobile network with diverse infection periods is larger than the counterpart with the same infection period. Moreover, the heterogeneity of individual susceptibility and infectivity can play a significant impact on disease transmission. In particular, the homogeneity of individuals will avail to the spreading of epidemics. Numerical examples verify further our theoretical results very well.

Analytical connection between thresholds and immunization strategies of SIS model in random networks

NASA Astrophysics Data System (ADS)

Zhou, Ming-Yang; Xiong, Wen-Man; Liao, Hao; Wang, Tong; Wei, Zong-Wen; Fu, Zhong-Qian

2018-05-01

Devising effective strategies for hindering the propagation of viruses and protecting the population against epidemics is critical for public security and health. Despite a number of studies based on the susceptible-infected-susceptible (SIS) model devoted to this topic, we still lack a general framework to compare different immunization strategies in completely random networks. Here, we address this problem by suggesting a novel method based on heterogeneous mean-field theory for the SIS model. Our method builds the relationship between the thresholds and different immunization strategies in completely random networks. Besides, we provide an analytical argument that the targeted large-degree strategy achieves the best performance in random networks with arbitrary degree distribution. Moreover, the experimental results demonstrate the effectiveness of the proposed method in both artificial and real-world networks.

N-(1H-Indazol-5-yl)-4-meth-oxy-benzene-sulfonamide.

PubMed

Chicha, Hakima; Rakib, El Mostapha; Bouissane, Latifa; Saadi, Mohamed; El Ammari, Lahcen

2013-10-26

In the title compound, C14H13N3O3S, the fused ring system is almost planar, the largest deviation from the mean plane being 0.023 (2) Å, and makes a dihedral angle of 47.92 (10)° with the benzene ring of the benzene-sulfonamide moiety. In the crystal, mol-ecules are connected through N-H⋯O hydrogen bonds and weak C-H⋯O contacts, forming a two-dimensional network which is parallel to (010).

N-(3-Chloro-1H-indazol-5-yl)-4-meth-oxy-benzene-sulfonamide.

PubMed

Chicha, Hakima; Rakib, El Mostapha; Bouissane, Latifa; Saadi, Mohamed; El Ammari, Lahcen

2013-10-12

In the title compound, C14H12ClN3O3S, the fused five- and six-membered rings are folded slightly along the common edge, forming a dihedral angle of 3.2 (1)°. The mean plane through the indazole system makes a dihedral angle of 30.75 (7)° with the distant benzene ring. In the crystal, N-H⋯O hydrogen bonds link the mol-ecules, forming a two-dimensional network parallel to (001).

Patent citation network in nanotechnology (1976-2004)

NASA Astrophysics Data System (ADS)

Li, Xin; Chen, Hsinchun; Huang, Zan; Roco, Mihail C.

2007-06-01

The patent citation networks are described using critical node, core network, and network topological analysis. The main objective is understanding of the knowledge transfer processes between technical fields, institutions and countries. This includes identifying key influential players and subfields, the knowledge transfer patterns among them, and the overall knowledge transfer efficiency. The proposed framework is applied to the field of nanoscale science and engineering (NSE), including the citation networks of patent documents, submitting institutions, technology fields, and countries. The NSE patents were identified by keywords "full-text" searching of patents at the United States Patent and Trademark Office (USPTO). The analysis shows that the United States is the most important citation center in NSE research. The institution citation network illustrates a more efficient knowledge transfer between institutions than a random network. The country citation network displays a knowledge transfer capability as efficient as a random network. The technology field citation network and the patent document citation network exhibit a␣less efficient knowledge diffusion capability than a random network. All four citation networks show a tendency to form local citation clusters.

The centrality of affective instability and identity in Borderline Personality Disorder: Evidence from network analysis.

PubMed

Richetin, Juliette; Preti, Emanuele; Costantini, Giulio; De Panfilis, Chiara

2017-01-01

We argue that the series of traits characterizing Borderline Personality Disorder samples do not weigh equally. In this regard, we believe that network approaches employed recently in Personality and Psychopathology research to provide information about the differential relationships among symptoms would be useful to test our claim. To our knowledge, this approach has never been applied to personality disorders. We applied network analysis to the nine Borderline Personality Disorder traits to explore their relationships in two samples drawn from university students and clinical populations (N = 1317 and N = 96, respectively). We used the Fused Graphical Lasso, a technique that allows estimating networks from different populations separately while considering their similarities and differences. Moreover, we examined centrality indices to determine the relative importance of each symptom in each network. The general structure of the two networks was very similar in the two samples, although some differences were detected. Results indicate the centrality of mainly affective instability, identity, and effort to avoid abandonment aspects in Borderline Personality Disorder. Results are consistent with the new DSM Alternative Model for Personality Disorders. We discuss them in terms of implications for therapy.

The centrality of affective instability and identity in Borderline Personality Disorder: Evidence from network analysis

PubMed Central

Costantini, Giulio; De Panfilis, Chiara

2017-01-01

We argue that the series of traits characterizing Borderline Personality Disorder samples do not weigh equally. In this regard, we believe that network approaches employed recently in Personality and Psychopathology research to provide information about the differential relationships among symptoms would be useful to test our claim. To our knowledge, this approach has never been applied to personality disorders. We applied network analysis to the nine Borderline Personality Disorder traits to explore their relationships in two samples drawn from university students and clinical populations (N = 1317 and N = 96, respectively). We used the Fused Graphical Lasso, a technique that allows estimating networks from different populations separately while considering their similarities and differences. Moreover, we examined centrality indices to determine the relative importance of each symptom in each network. The general structure of the two networks was very similar in the two samples, although some differences were detected. Results indicate the centrality of mainly affective instability, identity, and effort to avoid abandonment aspects in Borderline Personality Disorder. Results are consistent with the new DSM Alternative Model for Personality Disorders. We discuss them in terms of implications for therapy. PMID:29040324

Application of stochastic processes in random growth and evolutionary dynamics

NASA Astrophysics Data System (ADS)

Oikonomou, Panagiotis

We study the effect of power-law distributed randomness on the dynamical behavior of processes such as stochastic growth patterns and evolution. First, we examine the geometrical properties of random shapes produced by a generalized stochastic Loewner Evolution driven by a superposition of a Brownian motion and a stable Levy process. The situation is defined by the usual stochastic Loewner Evolution parameter, kappa, as well as alpha which defines the power-law tail of the stable Levy distribution. We show that the properties of these patterns change qualitatively and singularly at critical values of kappa and alpha. It is reasonable to call such changes "phase transitions". These transitions occur as kappa passes through four and as alpha passes through one. Numerical simulations are used to explore the global scaling behavior of these patterns in each "phase". We show both analytically and numerically that the growth continues indefinitely in the vertical direction for alpha greater than 1, goes as logarithmically with time for alpha equals to 1, and saturates for alpha smaller than 1. The probability density has two different scales corresponding to directions along and perpendicular to the boundary. Scaling functions for the probability density are given for various limiting cases. Second, we study the effect of the architecture of biological networks on their evolutionary dynamics. In recent years, studies of the architecture of large networks have unveiled a common topology, called scale-free, in which a majority of the elements are poorly connected except for a small fraction of highly connected components. We ask how networks with distinct topologies can evolve towards a pre-established target phenotype through a process of random mutations and selection. We use networks of Boolean components as a framework to model a large class of phenotypes. Within this approach, we find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. While homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously towards the target phenotype. Moreover, we show that scale-free networks always evolve faster than homogeneous random networks; remarkably, this property does not depend on the precise value of the topological parameter. By contrast, homogeneous random networks require a specific tuning of their topological parameter in order to optimize their fitness. This model suggests that the evolutionary paths of biological networks, punctuated or continuous, may solely be determined by the network topology.

Vulnerability of complex networks

NASA Astrophysics Data System (ADS)

Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

2011-01-01

We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.

Random walks with long-range steps generated by functions of Laplacian matrices

NASA Astrophysics Data System (ADS)

Riascos, A. P.; Michelitsch, T. M.; Collet, B. A.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

2018-04-01

In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information in the Laplacian matrix, that describes the connections of a network, to a dynamic determined by functions of this matrix. The resulting processes are non-local allowing transitions of the random walker from one node to nodes beyond its nearest neighbors. We find that only two types of Laplacian functions are admissible with distinct behaviors for long-range steps in the infinite network limit: type (i) functions generate Brownian motions, type (ii) functions Lévy flights. For this asymptotic long-range step behavior only the lowest non-vanishing order of the Laplacian function is relevant, namely first order for type (i), and fractional order for type (ii) functions. In the first part, we discuss spectral properties of the Laplacian matrix and a series of relations that are maintained by a particular type of functions that allow to define random walks on any type of undirected connected networks. Once described general properties, we explore characteristics of random walk strategies that emerge from particular cases with functions defined in terms of exponentials, logarithms and powers of the Laplacian as well as relations of these dynamics with non-local strategies like Lévy flights and fractional transport. Finally, we analyze the global capacity of these random walk strategies to explore networks like lattices and trees and different types of random and complex networks.

Distribution of shortest cycle lengths in random networks

NASA Astrophysics Data System (ADS)

Bonneau, Haggai; Hassid, Aviv; Biham, Ofer; Kühn, Reimer; Katzav, Eytan

2017-12-01

We present analytical results for the distribution of shortest cycle lengths (DSCL) in random networks. The approach is based on the relation between the DSCL and the distribution of shortest path lengths (DSPL). We apply this approach to configuration model networks, for which analytical results for the DSPL were obtained before. We first calculate the fraction of nodes in the network which reside on at least one cycle. Conditioning on being on a cycle, we provide the DSCL over ensembles of configuration model networks with degree distributions which follow a Poisson distribution (Erdős-Rényi network), degenerate distribution (random regular graph), and a power-law distribution (scale-free network). The mean and variance of the DSCL are calculated. The analytical results are found to be in very good agreement with the results of computer simulations.

Listening to the noise: random fluctuations reveal gene network parameters

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

Munsky, Brian; Khammash, Mustafa

2009-01-01

The cellular environment is abuzz with noise. The origin of this noise is attributed to the inherent random motion of reacting molecules that take part in gene expression and post expression interactions. In this noisy environment, clonal populations of cells exhibit cell-to-cell variability that frequently manifests as significant phenotypic differences within the cellular population. The stochastic fluctuations in cellular constituents induced by noise can be measured and their statistics quantified. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich sourcemore » of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. This establishes a potentially powerful approach for the identification of gene networks and offers a new window into the workings of these networks.« less

To cut or not to cut? Assessing the modular structure of brain networks.

PubMed

Chang, Yu-Teng; Pantazis, Dimitrios; Leahy, Richard M

2014-05-01

A wealth of methods has been developed to identify natural divisions of brain networks into groups or modules, with one of the most prominent being modularity. Compared with the popularity of methods to detect community structure, only a few methods exist to statistically control for spurious modules, relying almost exclusively on resampling techniques. It is well known that even random networks can exhibit high modularity because of incidental concentration of edges, even though they have no underlying organizational structure. Consequently, interpretation of community structure is confounded by the lack of principled and computationally tractable approaches to statistically control for spurious modules. In this paper we show that the modularity of random networks follows a transformed version of the Tracy-Widom distribution, providing for the first time a link between module detection and random matrix theory. We compute parametric formulas for the distribution of modularity for random networks as a function of network size and edge variance, and show that we can efficiently control for false positives in brain and other real-world networks. Copyright © 2014 Elsevier Inc. All rights reserved.

Tactical Network Load Balancing in Multi-Gateway Wireless Sensor Networks

DTIC Science & Technology

2013-12-01

writeup scrsz = get( 0 ,’ScreenSize’); %Creation of the random Sensor Network fig = figure(1); set(fig, ’Position’,[1 scrsz( 4 )*.25 scrsz(3)*.7...thesis writeup scrsz = get( 0 ,’ScreenSize’); %Creation of the random Sensor Network fig = figure(1); set(fig, ’Position’,[1 scrsz( 4 )*.25 scrsz(3)*.7...TYPE AND DATES COVERED Master’s Thesis 4 . TITLE AND SUBTITLE TACTICAL NETWORK LOAD BALANCING IN MULTI-GATEWAY WIRELESS SENSOR NETWORKS 5

A New Random Walk for Replica Detection in WSNs.

PubMed

Aalsalem, Mohammed Y; Khan, Wazir Zada; Saad, N M; Hossain, Md Shohrab; Atiquzzaman, Mohammed; Khan, Muhammad Khurram

2016-01-01

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical.

A New Random Walk for Replica Detection in WSNs

PubMed Central

Aalsalem, Mohammed Y.; Saad, N. M.; Hossain, Md. Shohrab; Atiquzzaman, Mohammed; Khan, Muhammad Khurram

2016-01-01

Wireless Sensor Networks (WSNs) are vulnerable to Node Replication attacks or Clone attacks. Among all the existing clone detection protocols in WSNs, RAWL shows the most promising results by employing Simple Random Walk (SRW). More recently, RAND outperforms RAWL by incorporating Network Division with SRW. Both RAND and RAWL have used SRW for random selection of witness nodes which is problematic because of frequently revisiting the previously passed nodes that leads to longer delays, high expenditures of energy with lower probability that witness nodes intersect. To circumvent this problem, we propose to employ a new kind of constrained random walk, namely Single Stage Memory Random Walk and present a distributed technique called SSRWND (Single Stage Memory Random Walk with Network Division). In SSRWND, single stage memory random walk is combined with network division aiming to decrease the communication and memory costs while keeping the detection probability higher. Through intensive simulations it is verified that SSRWND guarantees higher witness node security with moderate communication and memory overheads. SSRWND is expedient for security oriented application fields of WSNs like military and medical. PMID:27409082

Self-healing fuse development

NASA Technical Reports Server (NTRS)

Jones, N. D.; Kinsinger, R. E.; Harris, L. P.

1973-01-01

The mercury-filled self-healing fuses developed for this program afford very good protection from circuit faults with rapid reclosure. Fuse performance and design parameters have been characterized. Life tests indicate a capability of 500 fuse operations. Fuse ratings are 150 v at 5, 15, 25 and 50 circuit A. A series of sample fuses using alumina and beryllia insulation have been furnished to NASA for circuit evaluation.

Network problem threshold

NASA Technical Reports Server (NTRS)

Gejji, Raghvendra, R.

1992-01-01

Network transmission errors such as collisions, CRC errors, misalignment, etc. are statistical in nature. Although errors can vary randomly, a high level of errors does indicate specific network problems, e.g. equipment failure. In this project, we have studied the random nature of collisions theoretically as well as by gathering statistics, and established a numerical threshold above which a network problem is indicated with high probability.

A Simulation Study Comparing Epidemic Dynamics on Exponential Random Graph and Edge-Triangle Configuration Type Contact Network Models

PubMed Central

Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry

2015-01-01

We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701

Self-avoiding walks on scale-free networks

NASA Astrophysics Data System (ADS)

Herrero, Carlos P.

2005-01-01

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAW’s) are expected to be more suitable than unrestricted random walks to explore various kinds of real-life networks. Here we study long-range properties of random SAW’s on scale-free networks, characterized by a degree distribution P (k) ˜ k-γ . In the limit of large networks (system size N→∞ ), the average number sn of SAW’s starting from a generic site increases as μn , with μ= < k2 > / -1 . For finite N , sn is reduced due to the presence of loops in the network, which causes the emergence of attrition of the paths. For kinetic growth walks, the average maximum length increases as a power of the system size: ˜ Nα , with an exponent α increasing as the parameter γ is raised. We discuss the dependence of α on the minimum allowed degree in the network. A similar power-law dependence is found for the mean self-intersection length of nonreversal random walks. Simulation results support our approximate analytical calculations.

Impact of degree heterogeneity on the behavior of trapping in Koch networks

NASA Astrophysics Data System (ADS)

Zhang, Zhongzhi; Gao, Shuyang; Xie, Wenlei

2010-12-01

Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent γ of power-law degree distribution P(k )˜k-γ, which describes the extent of heterogeneity of scale-free network structure. However, extensive empirical research indicates that real networked systems also display ubiquitous degree correlations. In this paper, we address the trapping issue on the Koch networks, which is a special random walk with one trap fixed at a hub node. The Koch networks are power-law with the characteristic exponent γ in the range between 2 and 3, they are either assortative or disassortative. We calculate exactly the MFPT that is the average of first-passage time from all other nodes to the trap. The obtained explicit solution shows that in large networks the MFPT varies lineally with node number N, which is obviously independent of γ and is sharp contrast to the scaling behavior of MFPT observed for uncorrelated random scale-free networks, where γ influences qualitatively the MFPT of trapping problem.

Selective randomized load balancing and mesh networks with changing demands

NASA Astrophysics Data System (ADS)

Shepherd, F. B.; Winzer, P. J.

2006-05-01

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

Global mean first-passage times of random walks on complex networks.

PubMed

Tejedor, V; Bénichou, O; Voituriez, R

2009-12-01

We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position, the so-called global mean first-passage time (GMFPT). This bound is simply expressed in terms of the equilibrium distribution at the target and implies a minimal scaling of the GMFPT with the network size. We show that this minimal scaling, which can be arbitrarily slow, is realized under the simple condition that the random walk is transient at the target site and independently of the small-world, scale-free, or fractal properties of the network. Last, we put forward that the GMFPT to a specific target is not a representative property of the network since the target averaged GMFPT satisfies much more restrictive bounds.

A scaling law for random walks on networks

PubMed Central

Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-01-01

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics. PMID:25311870

A scaling law for random walks on networks

NASA Astrophysics Data System (ADS)

Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-10-01

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

A scaling law for random walks on networks.

PubMed

Perkins, Theodore J; Foxall, Eric; Glass, Leon; Edwards, Roderick

2014-10-14

The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.

Small-World Network Spectra in Mean-Field Theory

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Timme, Marc

2012-05-01

Collective dynamics on small-world networks emerge in a broad range of systems with their spectra characterizing fundamental asymptotic features. Here we derive analytic mean-field predictions for the spectra of small-world models that systematically interpolate between regular and random topologies by varying their randomness. These theoretical predictions agree well with the actual spectra (obtained by numerical diagonalization) for undirected and directed networks and from fully regular to strongly random topologies. These results may provide analytical insights to empirically found features of dynamics on small-world networks from various research fields, including biology, physics, engineering, and social science.

How Fast Can Networks Synchronize? A Random Matrix Theory Approach

NASA Astrophysics Data System (ADS)

Timme, Marc; Wolf, Fred; Geisel, Theo

2004-03-01

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

Multi-modality image fusion based on enhanced fuzzy radial basis function neural networks.

PubMed

Chao, Zhen; Kim, Dohyeon; Kim, Hee-Joung

2018-04-01

In clinical applications, single modality images do not provide sufficient diagnostic information. Therefore, it is necessary to combine the advantages or complementarities of different modalities of images. Recently, neural network technique was applied to medical image fusion by many researchers, but there are still many deficiencies. In this study, we propose a novel fusion method to combine multi-modality medical images based on the enhanced fuzzy radial basis function neural network (Fuzzy-RBFNN), which includes five layers: input, fuzzy partition, front combination, inference, and output. Moreover, we propose a hybrid of the gravitational search algorithm (GSA) and error back propagation algorithm (EBPA) to train the network to update the parameters of the network. Two different patterns of images are used as inputs of the neural network, and the output is the fused image. A comparison with the conventional fusion methods and another neural network method through subjective observation and objective evaluation indexes reveals that the proposed method effectively synthesized the information of input images and achieved better results. Meanwhile, we also trained the network by using the EBPA and GSA, individually. The results reveal that the EBPGSA not only outperformed both EBPA and GSA, but also trained the neural network more accurately by analyzing the same evaluation indexes. Copyright © 2018 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.

Perturbation propagation in random and evolved Boolean networks

NASA Astrophysics Data System (ADS)

Fretter, Christoph; Szejka, Agnes; Drossel, Barbara

2009-03-01

In this paper, we investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and its modifications. We show that even small random Boolean networks agree well with the predictions of the annealed approximation, but nonrandom networks show a very different behaviour. We focus on networks that were evolved for high dynamical robustness. The most important conclusion is that the simple distinction between frozen, critical and chaotic networks is no longer useful, since such evolved networks can display the properties of all three types of networks. Furthermore, we evaluate a simplified empirical network and show how its specific state space properties are reflected in the modified Derrida plots.

Spread of information and infection on finite random networks

NASA Astrophysics Data System (ADS)

Isham, Valerie; Kaczmarska, Joanna; Nekovee, Maziar

2011-04-01

The modeling of epidemic-like processes on random networks has received considerable attention in recent years. While these processes are inherently stochastic, most previous work has been focused on deterministic models that ignore important fluctuations that may persist even in the infinite network size limit. In a previous paper, for a class of epidemic and rumor processes, we derived approximate models for the full probability distribution of the final size of the epidemic, as opposed to only mean values. In this paper we examine via direct simulations the adequacy of the approximate model to describe stochastic epidemics and rumors on several random network topologies: homogeneous networks, Erdös-Rényi (ER) random graphs, Barabasi-Albert scale-free networks, and random geometric graphs. We find that the approximate model is reasonably accurate in predicting the probability of spread. However, the position of the threshold and the conditional mean of the final size for processes near the threshold are not well described by the approximate model even in the case of homogeneous networks. We attribute this failure to the presence of other structural properties beyond degree-degree correlations, and in particular clustering, which are present in any finite network but are not incorporated in the approximate model. In order to test this “hypothesis” we perform additional simulations on a set of ER random graphs where degree-degree correlations and clustering are separately and independently introduced using recently proposed algorithms from the literature. Our results show that even strong degree-degree correlations have only weak effects on the position of the threshold and the conditional mean of the final size. On the other hand, the introduction of clustering greatly affects both the position of the threshold and the conditional mean. Similar analysis for the Barabasi-Albert scale-free network confirms the significance of clustering on the dynamics of rumor spread. For this network, though, with its highly skewed degree distribution, the addition of positive correlation had a much stronger effect on the final size distribution than was found for the simple random graph.

Materials Testing and Cost Modeling for Composite Parts Through Additive Manufacturing

DTIC Science & Technology

2016-04-30

FDM include plastic jet printing (PJP), fused filament modeling ( FFM ), and fused filament fabrication (FFF). FFF was coined by the RepRap project to...additive manufacturing processes? • Fused deposition modeling (FDM) trademarked by Stratasys • Fused filament modeling ( FFM ) and fused filament

Parameters affecting the resilience of scale-free networks to random failures.

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

Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran

2005-09-01

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degreemore » of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.« less

Spreading in online social networks: the role of social reinforcement.

PubMed

Zheng, Muhua; Lü, Linyuan; Zhao, Ming

2013-07-01

Some epidemic spreading models are usually applied to analyze the propagation of opinions or news. However, the dynamics of epidemic spreading and information or behavior spreading are essentially different in many aspects. Centola's experiments [Science 329, 1194 (2010)] on behavior spreading in online social networks showed that the spreading is faster and broader in regular networks than in random networks. This result contradicts with the former understanding that random networks are preferable for spreading than regular networks. To describe the spreading in online social networks, a unknown-known-approved-exhausted four-status model was proposed, which emphasizes the effect of social reinforcement and assumes that the redundant signals can improve the probability of approval (i.e., the spreading rate). Performing the model on regular and random networks, it is found that our model can well explain the results of Centola's experiments on behavior spreading and some former studies on information spreading in different parameter space. The effects of average degree and network size on behavior spreading process are further analyzed. The results again show the importance of social reinforcement and are accordant with Centola's anticipation that increasing the network size or decreasing the average degree will enlarge the difference of the density of final approved nodes between regular and random networks. Our work complements the former studies on spreading dynamics, especially the spreading in online social networks where the information usually requires individuals' confirmations before being transmitted to others.

Routing in Networks with Random Topologies

NASA Technical Reports Server (NTRS)

Bambos, Nicholas

1997-01-01

We examine the problems of routing and server assignment in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of tis input queues, each server (node) is either connected to or disconnected from each of its queues with some probability.

Gossip and Distributed Kalman Filtering: Weak Consensus Under Weak Detectability

NASA Astrophysics Data System (ADS)

Kar, Soummya; Moura, José M. F.

2011-04-01

The paper presents the gossip interactive Kalman filter (GIKF) for distributed Kalman filtering for networked systems and sensor networks, where inter-sensor communication and observations occur at the same time-scale. The communication among sensors is random; each sensor occasionally exchanges its filtering state information with a neighbor depending on the availability of the appropriate network link. We show that under a weak distributed detectability condition: 1. the GIKF error process remains stochastically bounded, irrespective of the instability properties of the random process dynamics; and 2. the network achieves \\emph{weak consensus}, i.e., the conditional estimation error covariance at a (uniformly) randomly selected sensor converges in distribution to a unique invariant measure on the space of positive semi-definite matrices (independent of the initial state.) To prove these results, we interpret the filtered states (estimates and error covariances) at each node in the GIKF as stochastic particles with local interactions. We analyze the asymptotic properties of the error process by studying as a random dynamical system the associated switched (random) Riccati equation, the switching being dictated by a non-stationary Markov chain on the network graph.

Discrete-time systems with random switches: From systems stability to networks synchronization.

PubMed

Guo, Yao; Lin, Wei; Ho, Daniel W C

2016-03-01

In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developed approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks.

Discrete-time systems with random switches: From systems stability to networks synchronization

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

Guo, Yao; Lin, Wei, E-mail: wlin@fudan.edu.cn; Shanghai Key Laboratory of Contemporary Applied Mathematics, LMNS, and Shanghai Center for Mathematical Sciences, Shanghai 200433

2016-03-15

In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developedmore » approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks.« less

Weighted Scaling in Non-growth Random Networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Yang, Xu-Hua; Xu, Xin-Li

2012-09-01

We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in non-growth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its total number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scale-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.

Symmetries and synchronization in multilayer random networks

NASA Astrophysics Data System (ADS)

Saa, Alberto

2018-04-01

In the light of the recently proposed scenario of asymmetry-induced synchronization (AISync), in which dynamical uniformity and consensus in a distributed system would demand certain asymmetries in the underlying network, we investigate here the influence of some regularities in the interlayer connection patterns on the synchronization properties of multilayer random networks. More specifically, by considering a Stuart-Landau model of complex oscillators with random frequencies, we report for multilayer networks a dynamical behavior that could be also classified as a manifestation of AISync. We show, namely, that the presence of certain symmetries in the interlayer connection pattern tends to diminish the synchronization capability of the whole network or, in other words, asymmetries in the interlayer connections would enhance synchronization in such structured networks. Our results might help the understanding not only of the AISync mechanism itself but also its possible role in the determination of the interlayer connection pattern of multilayer and other structured networks with optimal synchronization properties.

JEFX 10 demonstration of Cooperative Hunter Killer UAS and upstream data fusion

NASA Astrophysics Data System (ADS)

Funk, Brian K.; Castelli, Jonathan C.; Watkins, Adam S.; McCubbin, Christopher B.; Marshall, Steven J.; Barton, Jeffrey D.; Newman, Andrew J.; Peterson, Cammy K.; DeSena, Jonathan T.; Dutrow, Daniel A.; Rodriguez, Pedro A.

2011-05-01

The Johns Hopkins University Applied Physics Laboratory deployed and demonstrated a prototype Cooperative Hunter Killer (CHK) Unmanned Aerial System (UAS) capability and a prototype Upstream Data Fusion (UDF) capability as participants in the Joint Expeditionary Force Experiment 2010 in April 2010. The CHK capability was deployed at the Nevada Test and Training Range to prosecute a convoy protection operational thread. It used mission-level autonomy (MLA) software applied to a networked swarm of three Raven hunter UAS and a Procerus Miracle surrogate killer UAS, all equipped with full motion video (FMV). The MLA software provides the capability for the hunter-killer swarm to autonomously search an area or road network, divide the search area, deconflict flight paths, and maintain line of sight communications with mobile ground stations. It also provides an interface for an operator to designate a threat and initiate automatic engagement of the target by the killer UAS. The UDF prototype was deployed at the Maritime Operations Center at Commander Second Fleet, Naval Station Norfolk to provide intelligence analysts and the ISR commander with a common fused track picture from the available FMV sources. It consisted of a video exploitation component that automatically detected moving objects, a multiple hypothesis tracker that fused all of the detection data to produce a common track picture, and a display and user interface component that visualized the common track picture along with appropriate geospatial information such as maps and terrain as well as target coordinates and the source video.

Pulse-coupled neural network sensor fusion

NASA Astrophysics Data System (ADS)

Johnson, John L.; Schamschula, Marius P.; Inguva, Ramarao; Caulfield, H. John

1998-03-01

Perception is assisted by sensed impressions of the outside world but not determined by them. The primary organ of perception is the brain and, in particular, the cortex. With that in mind, we have sought to see how a computer-modeled cortex--the PCNN or Pulse Coupled Neural Network--performs as a sensor fusing element. In essence, the PCNN is comprised of an array of integrate-and-fire neurons with one neuron for each input pixel. In such a system, the neurons corresponding to bright pixels reach firing threshold faster than the neurons corresponding to duller pixels. Thus, firing rate is proportional to brightness. In PCNNs, when a neuron fires it sends some of the resulting signal to its neighbors. This linking can cause a near-threshold neuron to fire earlier than it would have otherwise. This leads to synchronization of the pulses across large regions of the image. We can simplify the 3D PCNN output by integrating out the time dimension. Over a long enough time interval, the resulting 2D (x,y) pattern IS the input image. The PCNN has taken it apart and put it back together again. The shorter- term time integrals are interesting in themselves and will be commented upon in the paper. The main thrust of this paper is the use of multiple PCNNs mutually coupled in various ways to assemble a single 2D pattern or fused image. Results of experiments on PCNN image fusion and an evaluation of its advantages are our primary objectives.

Usefulness of 2D fusion of postmortem CT and antemortem chest radiography studies for human identification.

PubMed

Shinkawa, Norihiro; Hirai, Toshinori; Nishii, Ryuichi; Yukawa, Nobuhiro

2017-06-01

To determine the feasibility of human identification through the two-dimensional (2D) fusion of postmortem computed tomography (PMCT) and antemortem chest radiography. The study population consisted of 15 subjects who had undergone chest radiography studies more than 12 months before death. Fused images in which a chest radiograph was fused with a PMCT image were obtained for those subjects using a workstation, and the minimum distance gaps between corresponding anatomical landmarks (located at soft tissue and bone sites) in the images obtained with the two modalities were calculated. For each fused image, the mean of all these minimum distance gaps was recorded as the mean distance gap (MDG). For each subject, the MDG obtained for the same-subject fused image (i.e., where both of the images that were fused derived from that subject) was compared with the MDGs for different-subject fused images (i.e., where only one of the images that were fused derived from that subject; the other image derived from a different subject) in order to determine whether same-subject fused images can be reliably distinguished from different-subject fused images. The MDGs of the same-subject fused images were found to be significantly smaller than the MDGs of the different-subject fused images (p < 0.01). When bone landmarks were used, the same-subject fused image was found to be the fused image with the lowest MDG for 33.3% of the subjects, the fused image with the lowest or second-lowest MDG for 73.3% of the subjects, and the fused image with the lowest, second-lowest, or third-lowest MDG for 86.7% of the subjects. The application of bone landmarks rather than soft-tissue landmarks made it significantly more likely that, for each subject, the same-subject fused image would have the lowest MDG (or one of the lowest MDGs) of all the fused images compared (p < 0.05). The 2D fusion of antemortem chest radiography and postmortem CT images may assist in human identification.

Sensitivity and network topology in chemical reaction systems

NASA Astrophysics Data System (ADS)

Okada, Takashi; Mochizuki, Atsushi

2017-08-01

In living cells, biochemical reactions are catalyzed by specific enzymes and connect to one another by sharing substrates and products, forming complex networks. In our previous studies, we established a framework determining the responses to enzyme perturbations only from network topology, and then proved a theorem, called the law of localization, explaining response patterns in terms of network topology. In this paper, we generalize these results to reaction networks with conserved concentrations, which allows us to study any reaction system. We also propose network characteristics quantifying robustness. We compare E. coli metabolic network with randomly rewired networks, and find that the robustness of the E. coli network is significantly higher than that of the random networks.

Three-dimensional analysis of alveolar wall destruction in the early stage of pulmonary emphysema.

PubMed

Kobayashi, Yukihiro; Uehara, Takeshi; Kawasaki, Kenji; Sugano, Mitsutoshi; Matsumoto, Takehisa; Matsumoto, Gou; Honda, Takayuki

2015-03-01

The morphological mechanism of alveolar wall destruction during pulmonary emphysema has not been clarified. The aim of this study was to elucidate this process three-dimensionally. Lung specimens from five patients with pulmonary emphysema were used, and five controls with normal alveolar structure were also examined. Sections 150 μm thick were stained with hematoxylin and eosin, elastica, and silver impregnation, and immunostained with selected antibodies. We examined these sections three-dimensionally using a laser confocal microscope and a light microscope. There were only a few Kohn's pores and no fenestrae in the normal alveoli from the controls. In the lungs of the emphysema patients a small rupture appeared in the extremely thin alveolar wall among the alveolar capillaries. This rupture enlarged to form a circle surrounded by the capillaries, which was called an alveolar fenestra. Two neighboring fenestrae fused by breakdown of the collapsed or cord-like capillary between them to form a large fenestra. The large fenestrae fused repeatedly to become larger, and these were bordered by thick elastic fibers constructing an alveolar framework. Alveolar wall destruction during emphysema could start from small ruptures of the alveolar wall that become fenestrae surrounded by capillaries, which fuse repeatedly to become larger fenestrae rimmed with elastic fibers. The alveolar capillary network could initially prevent enlargement of the fenestrae, and the thick elastic fibers constituting the alveolar framework could secondarily prevent destruction of the alveolar wall structure. © 2014 Wiley Periodicals, Inc.

Face recognition accuracy of forensic examiners, superrecognizers, and face recognition algorithms.

PubMed

Phillips, P Jonathon; Yates, Amy N; Hu, Ying; Hahn, Carina A; Noyes, Eilidh; Jackson, Kelsey; Cavazos, Jacqueline G; Jeckeln, Géraldine; Ranjan, Rajeev; Sankaranarayanan, Swami; Chen, Jun-Cheng; Castillo, Carlos D; Chellappa, Rama; White, David; O'Toole, Alice J

2018-06-12

Achieving the upper limits of face identification accuracy in forensic applications can minimize errors that have profound social and personal consequences. Although forensic examiners identify faces in these applications, systematic tests of their accuracy are rare. How can we achieve the most accurate face identification: using people and/or machines working alone or in collaboration? In a comprehensive comparison of face identification by humans and computers, we found that forensic facial examiners, facial reviewers, and superrecognizers were more accurate than fingerprint examiners and students on a challenging face identification test. Individual performance on the test varied widely. On the same test, four deep convolutional neural networks (DCNNs), developed between 2015 and 2017, identified faces within the range of human accuracy. Accuracy of the algorithms increased steadily over time, with the most recent DCNN scoring above the median of the forensic facial examiners. Using crowd-sourcing methods, we fused the judgments of multiple forensic facial examiners by averaging their rating-based identity judgments. Accuracy was substantially better for fused judgments than for individuals working alone. Fusion also served to stabilize performance, boosting the scores of lower-performing individuals and decreasing variability. Single forensic facial examiners fused with the best algorithm were more accurate than the combination of two examiners. Therefore, collaboration among humans and between humans and machines offers tangible benefits to face identification accuracy in important applications. These results offer an evidence-based roadmap for achieving the most accurate face identification possible. Copyright © 2018 the Author(s). Published by PNAS.

Conductivity of Nanowire Arrays under Random and Ordered Orientation Configurations

PubMed Central

Jagota, Milind; Tansu, Nelson

2015-01-01

A computational model was developed to analyze electrical conductivity of random metal nanowire networks. It was demonstrated for the first time through use of this model that a performance gain in random metal nanowire networks can be achieved by slightly restricting nanowire orientation. It was furthermore shown that heavily ordered configurations do not outperform configurations with some degree of randomness; randomness in the case of metal nanowire orientations acts to increase conductivity. PMID:25976936

Weighted networks as randomly reinforced urn processes

NASA Astrophysics Data System (ADS)

Caldarelli, Guido; Chessa, Alessandro; Crimaldi, Irene; Pammolli, Fabio

2013-02-01

We analyze weighted networks as randomly reinforced urn processes, in which the edge-total weights are determined by a reinforcement mechanism. We develop a statistical test and a procedure based on it to study the evolution of networks over time, detecting the “dominance” of some edges with respect to the others and then assessing if a given instance of the network is taken at its steady state or not. Distance from the steady state can be considered as a measure of the relevance of the observed properties of the network. Our results are quite general, in the sense that they are not based on a particular probability distribution or functional form of the random weights. Moreover, the proposed tool can be applied also to dense networks, which have received little attention by the network community so far, since they are often problematic. We apply our procedure in the context of the International Trade Network, determining a core of “dominant edges.”

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

PubMed Central

Ye, Ye; Cheong, Kang Hao; Cen, Yu-wan; Xie, Neng-gang

2016-01-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed. PMID:27845430

Effects of behavioral patterns and network topology structures on Parrondo’s paradox

NASA Astrophysics Data System (ADS)

Ye, Ye; Cheong, Kang Hao; Cen, Yu-Wan; Xie, Neng-Gang

2016-11-01

A multi-agent Parrondo’s model based on complex networks is used in the current study. For Parrondo’s game A, the individual interaction can be categorized into five types of behavioral patterns: the Matthew effect, harmony, cooperation, poor-competition-rich-cooperation and a random mode. The parameter space of Parrondo’s paradox pertaining to each behavioral pattern, and the gradual change of the parameter space from a two-dimensional lattice to a random network and from a random network to a scale-free network was analyzed. The simulation results suggest that the size of the region of the parameter space that elicits Parrondo’s paradox is positively correlated with the heterogeneity of the degree distribution of the network. For two distinct sets of probability parameters, the microcosmic reasons underlying the occurrence of the paradox under the scale-free network are elaborated. Common interaction mechanisms of the asymmetric structure of game B, behavioral patterns and network topology are also revealed.

Educational network comparative analysis of small groups: Short- and long-term communications

NASA Astrophysics Data System (ADS)

Berg, D. B.; Zvereva, O. M.; Nazarova, Yu. Yu.; Chepurov, E. G.; Kokovin, A. V.; Ranyuk, S. V.

2017-11-01

The present study is devoted to the discussion of small group communication network structures. These communications were observed in student groups, where actors were united with a regular educational activity. The comparative analysis was carried out for networks of short-term (1 hour) and long-term (4 weeks) communications, it was based on seven structural parameters, and consisted of two stages. At the first stage, differences between the network graphs were examined, and the random corresponding Bernoulli graphs were built. At the second stage, revealed differences were compared. Calculations were performed using UCINET software framework. It was found out that networks of long-term and short-term communications are quite different: the structure of a short-term communication network is close to a random one, whereas the most of long-term communication network parameters differ from the corresponding random ones by more than 30%. This difference can be explained by strong "noisiness" of a short-term communication network, and the lack of social in it.

An automatic fall detection framework using data fusion of Doppler radar and motion sensor network.

PubMed

Liu, Liang; Popescu, Mihail; Skubic, Marjorie; Rantz, Marilyn

2014-01-01

This paper describes the ongoing work of detecting falls in independent living senior apartments. We have developed a fall detection system with Doppler radar sensor and implemented ceiling radar in real senior apartments. However, the detection accuracy on real world data is affected by false alarms inherent in the real living environment, such as motions from visitors. To solve this issue, this paper proposes an improved framework by fusing the Doppler radar sensor result with a motion sensor network. As a result, performance is significantly improved after the data fusion by discarding the false alarms generated by visitors. The improvement of this new method is tested on one week of continuous data from an actual elderly person who frequently falls while living in her senior home.

Solid-Body Fuse Developed for High- Voltage Space Power Missions

NASA Technical Reports Server (NTRS)

Dolce, James L.; Baez, Anastacio N.

2001-01-01

AEM Incorporated has completed the development, under a NASA Glenn Research Center contract, of a solid-body fuse for high-voltage power systems of satellites and spacecraft systems. High-reliability fuses presently defined by MIL-PRF-23419 do not meet the increased voltage and amperage requirements for the next generation of spacecraft. Solid-body fuses exhibit electrical and mechanical attributes that enable these fuses to perform reliably in the vacuum and high-vibration and -shock environments typically present in spacecraft applications. The construction and screening techniques for solid-body fuses described by MIL-PRF-23419/12 offer an excellent roadmap for the development of high-voltage solid-body fuses.

Modeling of synchronization behavior of bursting neurons at nonlinearly coupled dynamical networks.

PubMed

Çakir, Yüksel

2016-01-01

Synchronization behaviors of bursting neurons coupled through electrical and dynamic chemical synapses are investigated. The Izhikevich model is used with random and small world network of bursting neurons. Various currents which consist of diffusive electrical and time-delayed dynamic chemical synapses are used in the simulations to investigate the influences of synaptic currents and couplings on synchronization behavior of bursting neurons. The effects of parameters, such as time delay, inhibitory synaptic strengths, and decay time on synchronization behavior are investigated. It is observed that in random networks with no delay, bursting synchrony is established with the electrical synapse alone, single spiking synchrony is observed with hybrid coupling. In small world network with no delay, periodic bursting behavior with multiple spikes is observed when only chemical and only electrical synapse exist. Single-spike and multiple-spike bursting are established with hybrid couplings. A decrease in the synchronization measure is observed with zero time delay, as the decay time is increased in random network. For synaptic delays which are above active phase period, synchronization measure increases with an increase in synaptic strength and time delay in small world network. However, in random network, it increases with only an increase in synaptic strength.

A new neural network model for solving random interval linear programming problems.

PubMed

Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

2017-05-01

This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

Exploring activity-driven network with biased walks

NASA Astrophysics Data System (ADS)

Wang, Yan; Wu, Ding Juan; Lv, Fang; Su, Meng Long

We investigate the concurrent dynamics of biased random walks and the activity-driven network, where the preferential transition probability is in terms of the edge-weighting parameter. We also obtain the analytical expressions for stationary distribution and the coverage function in directed and undirected networks, all of which depend on the weight parameter. Appropriately adjusting this parameter, more effective search strategy can be obtained when compared with the unbiased random walk, whether in directed or undirected networks. Since network weights play a significant role in the diffusion process.

Bayesian network meta-analysis for cluster randomized trials with binary outcomes.

PubMed

Uhlmann, Lorenz; Jensen, Katrin; Kieser, Meinhard

2017-06-01

Network meta-analysis is becoming a common approach to combine direct and indirect comparisons of several treatment arms. In recent research, there have been various developments and extensions of the standard methodology. Simultaneously, cluster randomized trials are experiencing an increased popularity, especially in the field of health services research, where, for example, medical practices are the units of randomization but the outcome is measured at the patient level. Combination of the results of cluster randomized trials is challenging. In this tutorial, we examine and compare different approaches for the incorporation of cluster randomized trials in a (network) meta-analysis. Furthermore, we provide practical insight on the implementation of the models. In simulation studies, it is shown that some of the examined approaches lead to unsatisfying results. However, there are alternatives which are suitable to combine cluster randomized trials in a network meta-analysis as they are unbiased and reach accurate coverage rates. In conclusion, the methodology can be extended in such a way that an adequate inclusion of the results obtained in cluster randomized trials becomes feasible. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

Detecting phase transitions in a neural network and its application to classification of syndromes in traditional Chinese medicine

NASA Astrophysics Data System (ADS)

Chen, J.; Xi, G.; Wang, W.

2008-02-01

Detecting phase transitions in neural networks (determined or random) presents a challenging subject for phase transitions play a key role in human brain activity. In this paper, we detect numerically phase transitions in two types of random neural network(RNN) under proper parameters.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

Listening to the Noise: Random Fluctuations Reveal Gene Network Parameters

NASA Astrophysics Data System (ADS)

Munsky, Brian; Trinh, Brooke; Khammash, Mustafa

2010-03-01

The cellular environment is abuzz with noise originating from the inherent random motion of reacting molecules in the living cell. In this noisy environment, clonal cell populations exhibit cell-to-cell variability that can manifest significant prototypical differences. Noise induced stochastic fluctuations in cellular constituents can be measured and their statistics quantified using flow cytometry, single molecule fluorescence in situ hybridization, time lapse fluorescence microscopy and other single cell and single molecule measurement techniques. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich source of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. We use theoretical investigations to establish experimental guidelines for the identification of gene regulatory networks, and we apply these guideline to experimentally identify predictive models for different regulatory mechanisms in bacteria and yeast.

Wild life passer species recognition from a technical passage through data fusion of a wireless sensor network

NASA Astrophysics Data System (ADS)

Gazis, A.; Katsiri, E.

2017-09-01

This paper presents a Wireless Sensor Network (WSN) system which was created as a project about protecting wildlife using sensor networks following the assistance of the department of Electrical and Computer Engineering of the Democritus University of Thrace. An automated process was implemented, regarding the recognition of a passenger (ie human, wolf, bear, etc.) traversing a box-shaped underground passage, such as the ones located along main highways fusing Width, Height and Weight values. These were measured using low-cost distance (beam) and weight (S-type load) micro-sensors and stored in a central repository. Moreover, the information provided by the WSN was analyzed, via a variety of methods including a neural pattern recognition network as well as clustering algorithms, which were able to recognize the kind of passenger, with certainty scores over 90%. The main concern, regarding the future, is the evaluation of these passages in respect to their effectiveness, i.e. whether they are frequently utilized by animals. This information was further analysed by appropriate information systems, in order to provide insights about the effectiveness of such mitigation structures.

Membrane proteins in human erythrocytes during cell fusion induced by oleoylglycerol

PubMed Central

Quirk, Susan J.; Ahkong, Quet Fah; Botham, Gaynor M.; Vos, Jan; Lucy, Jack A.

1978-01-01

1. The fusion of human erythrocytes into multicellular bodies that is induced by microdroplets of oleoylglycerol was investigated by optical and electron microscopy, and by gel electrophoresis of membrane proteins. 2. At the highest concentrations of oleoylglycerol and Ca2+ used, at least 80% of the cells fused after 30min at 37°C and only about 5% of the cells had completely lysed; the shapes of fused multicellular bodies were usually retained in `ghosts' prepared by hypo-osmotic lysis. 3. The rate of cell fusion was related to the concentration of Ca2+, although some cells fused when no exogenous Ca2+ was present. 4. Interactions of microdroplets of oleoylglycerol with the cells led to abnormalities in the structural appearance of the erythrocyte membrane; subsequent membrane fusion occurred, at least in some instances, at the sites of the microdroplets. 5. The intramembranous particles on the P-fracture face of the treated cells were more randomly distributed, but not significantly increased in number by comparison with the control cells. 6. Gel electrophoresis of the proteins of `ghosts' prepared from fused human erythrocytes showed a production of material of very high molecular weight, the development of a new component in the band-3 region, an increased staining of bands 4.3 and 4.5, and a new component moving slightly faster than band 6. 7. Bands 2.1–2.3 were altered, band 3 was decreased and band 4.1 was lost. 8. Most, but not all, of the changes in the membrane proteins appeared to result from the entry of Ca2+ into the cell. 9. 1-Chloro-4-phenyl-3-l-toluene-p-sulphonamidobutan-2-one partially inhibited both cell fusion and the associated decrease in band-3 protein. 10. The possibility that proteolytic degradation of membrane proteins may be involved in cell fusion induced by oleoylglycerol is considered, and some implications of this possibility are discussed. ImagesPLATE 4PLATE 1PLATE 2PLATE 3 PMID:728105

Influence of rhBMP-2 on Guided Bone Regeneration for Placement and Functional Loading of Dental Implants: A Radiographic and Histologic Study in Dogs.

PubMed

Ben Amara, Heithem; Lee, Jung-Won; Kim, Jung-Ju; Kang, Yun-Mi; Kang, Eun-Jung; Koo, Ki-Tae

Evidence on the outcomes of functional loading placed in recombinant human bone morphogenetic protein 2 (rhBMP-2)/acellular collagen sponge (ACS)-induced bone is lacking. The aim of this study was to verify whether guided bone regeneration (GBR) with rhBMP-2/ACS enhances regeneration of missing bone and osseointegration of dental implants subject to functional loading. Two bilateral standardized large saddle-type defects (≈10 × 10 × 6 mm) were surgically created in each mandible of seven beagle dogs 2 months after tooth extraction. Defects were immediately reconstructed randomly using rhBMP-2 (O-BMP or InFuse) soaked in ACS, deproteinized bovine bone mineral (DBBM) granules, or ACS alone as surgical control and subsequently covered with collagen membrane. Screw-type sand-blasted, acid-etched dental implants were placed 3 months later into the reconstructed defects and into adjacent bone. Osseointegration was allowed to progress for 3 months before functional loading of 3 months until sacrifice. Significantly more bone fill was radiographically observed for GBR with rhBMP-2/ACS (O-BMP: 92.5%, InFuse: 79%) in comparison to the DBBM (52%) and ACS alone groups (56.6%). Osseointegration was achieved and maintained in all experimental defects challenged by prostheses-driven functional load. The bone density ranged from 37.49% in the ACS group to 64.9% in the rhBMP-2/ACS (InFuse) group with no significance. The highest mean percentage of BIC was found in rhBMP-2/ACS (InFuse: 52.98%) with no statistical difference. Crestal bone resorption was observed around implants placed in reconstructed areas without any significant difference. GBR with rhBMP-2/ACS provided the greatest bone fill among the three treatment procedures. GBR with rhBMP-2/ACS showed efficacy for placement, osseointegration, and functional loading of titanium implants in alveolar ridge defects.

Multiple supervised residual network for osteosarcoma segmentation in CT images.

PubMed

Zhang, Rui; Huang, Lin; Xia, Wei; Zhang, Bo; Qiu, Bensheng; Gao, Xin

2018-01-01

Automatic and accurate segmentation of osteosarcoma region in CT images can help doctor make a reasonable treatment plan, thus improving cure rate. In this paper, a multiple supervised residual network (MSRN) was proposed for osteosarcoma image segmentation. Three supervised side output modules were added to the residual network. The shallow side output module could extract image shape features, such as edge features and texture features. The deep side output module could extract semantic features. The side output module could compute the loss value between output probability map and ground truth and back-propagate the loss information. Then, the parameters of residual network could be modified by gradient descent method. This could guide the multi-scale feature learning of the network. The final segmentation results were obtained by fusing the results output by the three side output modules. A total of 1900 CT images from 15 osteosarcoma patients were used to train the network and a total of 405 CT images from another 8 osteosarcoma patients were used to test the network. Results indicated that MSRN enabled a dice similarity coefficient (DSC) of 89.22%, a sensitivity of 88.74% and a F1-measure of 0.9305, which were larger than those obtained by fully convolutional network (FCN) and U-net. Thus, MSRN for osteosarcoma segmentation could give more accurate results than FCN and U-Net. Copyright © 2018 Elsevier Ltd. All rights reserved.

The resilient hybrid fiber sensor network with self-healing function

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

Xu, Shibo, E-mail: Shibo-Xu@tju.edu.cn; Liu, Tiegen; Ge, Chunfeng

This paper presents a novel resilient fiber sensor network (FSN) with multi-ring architecture, which could interconnect various kinds of fiber sensors responsible for more than one measurands. We explain how the intelligent control system provides sensors with self-healing function meanwhile sensors are working properly, besides each fiber in FSN is under real-time monitoring. We explain the software process and emergency mechanism to respond failures or other circumstances. To improve the efficiency in the use of limited spectrum resources in some situations, we have two different structures to distribute the light sources rationally. Then, we propose a hybrid sensor working inmore » FSN which is a combination of a distributed sensor and a FBG (Fiber Bragg Grating) array fused in a common fiber sensing temperature and vibrations simultaneously with neglectable crosstalk to each other. By making a failure to a working fiber in experiment, the feasibility and effectiveness of the network with a hybrid sensor has been demonstrated, hybrid sensors could not only work as designed but also survive from destructive failures with the help of resilient network and smart and quick self-healing actions. The network has improved the viability of the fiber sensors and diversity of measurands.« less

Fused-fiber-based 3-dB mode insensitive power splitters for few-mode optical fiber networks

NASA Astrophysics Data System (ADS)

Ren, Fang; Huang, Xiaoshan; Wang, Jianping

2017-11-01

We propose a 3-dB mode insensitive power splitter (MIPS) capable of broadcasting and combining optical signals. It is fabricated with two identical few-mode fibers (FMFs) by a heating and pulling technique. The mode-dependent power transfer characteristic as a function of pulling length is investigated. For exploiting its application, we experimentally demonstrate both FMF-based transmissive and reflective star couplers consisting of multiple 3-dB mode insensitive power splitters, which perform broadcasting and routing signals in few-mode optical fiber networks such as mode-division multiplexing (MDM) local area networks using star topology. For experimental demonstration, optical on-off keying signals at 10 Gb/s carried on three spatial modes are successfully processed with open and clear eye diagrams. Measured bit error ratio results show reasonable power penalties. It is found that a reflective star coupler in MDM networks can reduce half of the total amount of required fibers comparing to that of a transmissive star coupler. This MIPS is more efficient, more reliable, more flexible, and more cost-effective for future expansion and application in few-mode optical fiber networks.

Existence and Optimality Conditions for Risk-Averse PDE-Constrained Optimization

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

Kouri, Drew Philip; Surowiec, Thomas M.

Uncertainty is ubiquitous in virtually all engineering applications, and, for such problems, it is inadequate to simulate the underlying physics without quantifying the uncertainty in unknown or random inputs, boundary and initial conditions, and modeling assumptions. Here in this paper, we introduce a general framework for analyzing risk-averse optimization problems constrained by partial differential equations (PDEs). In particular, we postulate conditions on the random variable objective function as well as the PDE solution that guarantee existence of minimizers. Furthermore, we derive optimality conditions and apply our results to the control of an environmental contaminant. Lastly, we introduce a new riskmore » measure, called the conditional entropic risk, that fuses desirable properties from both the conditional value-at-risk and the entropic risk measures.« less

Existence and Optimality Conditions for Risk-Averse PDE-Constrained Optimization

DOE PAGES

Kouri, Drew Philip; Surowiec, Thomas M.

2018-06-05

Uncertainty is ubiquitous in virtually all engineering applications, and, for such problems, it is inadequate to simulate the underlying physics without quantifying the uncertainty in unknown or random inputs, boundary and initial conditions, and modeling assumptions. Here in this paper, we introduce a general framework for analyzing risk-averse optimization problems constrained by partial differential equations (PDEs). In particular, we postulate conditions on the random variable objective function as well as the PDE solution that guarantee existence of minimizers. Furthermore, we derive optimality conditions and apply our results to the control of an environmental contaminant. Lastly, we introduce a new riskmore » measure, called the conditional entropic risk, that fuses desirable properties from both the conditional value-at-risk and the entropic risk measures.« less

Diffusion in random networks

DOE PAGES

Zhang, Duan Z.; Padrino, Juan C.

2017-06-01

The ensemble averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of pockets connected by tortuous channels. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pocket mass density. The so-called dual-porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem,more » we consider the one-dimensional mass diffusion in a semi-infinite domain. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt $-$1/4 rather than xt $-$1/2 as in the traditional theory. We found this early time similarity can be explained by random walk theory through the network.« less

METHOD OF SEPARATING FISSION PRODUCTS FROM FUSED BISMUTH-CONTAINING URANIUM

DOEpatents

Wiswall, R.H.

1958-06-24

A process is described for removing metal selectively from liquid metal compositions. The method effects separation of flssion product metals selectively from dilute solution in fused bismuth, which contains uraniunn in solution without removal of more than 1% of the uranium. The process comprises contacting the fused bismuth with a fused salt composition consisting of sodium, potassium and lithium chlorides, adding to fused bismuth and molten salt a quantity of bismuth chloride which is stoichiometrically required to convert the flssion product metals to be removed to their chlorides which are more stable in the fused salt than in the molten metal and are, therefore, preferentially taken up in the fused salt phase.

Percolation and Reinforcement on Complex Networks

NASA Astrophysics Data System (ADS)

Yuan, Xin

Complex networks appear in almost every aspect of our daily life and are widely studied in the fields of physics, mathematics, finance, biology and computer science. This work utilizes percolation theory in statistical physics to explore the percolation properties of complex networks and develops a reinforcement scheme on improving network resilience. This dissertation covers two major parts of my Ph.D. research on complex networks: i) probe--in the context of both traditional percolation and k-core percolation--the resilience of complex networks with tunable degree distributions or directed dependency links under random, localized or targeted attacks; ii) develop and propose a reinforcement scheme to eradicate catastrophic collapses that occur very often in interdependent networks. We first use generating function and probabilistic methods to obtain analytical solutions to percolation properties of interest, such as the giant component size and the critical occupation probability. We study uncorrelated random networks with Poisson, bi-Poisson, power-law, and Kronecker-delta degree distributions and construct those networks which are based on the configuration model. The computer simulation results show remarkable agreement with theoretical predictions. We discover an increase of network robustness as the degree distribution broadens and a decrease of network robustness as directed dependency links come into play under random attacks. We also find that targeted attacks exert the biggest damage to the structure of both single and interdependent networks in k-core percolation. To strengthen the resilience of interdependent networks, we develop and propose a reinforcement strategy and obtain the critical amount of reinforced nodes analytically for interdependent Erdḧs-Renyi networks and numerically for scale-free and for random regular networks. Our mechanism leads to improvement of network stability of the West U.S. power grid. This dissertation provides us with a deeper understanding of the effects of structural features on network stability and fresher insights into designing resilient interdependent infrastructure networks.

A Two-Stream Deep Fusion Framework for High-Resolution Aerial Scene Classification

PubMed Central

Liu, Fuxian

2018-01-01

One of the challenging problems in understanding high-resolution remote sensing images is aerial scene classification. A well-designed feature representation method and classifier can improve classification accuracy. In this paper, we construct a new two-stream deep architecture for aerial scene classification. First, we use two pretrained convolutional neural networks (CNNs) as feature extractor to learn deep features from the original aerial image and the processed aerial image through saliency detection, respectively. Second, two feature fusion strategies are adopted to fuse the two different types of deep convolutional features extracted by the original RGB stream and the saliency stream. Finally, we use the extreme learning machine (ELM) classifier for final classification with the fused features. The effectiveness of the proposed architecture is tested on four challenging datasets: UC-Merced dataset with 21 scene categories, WHU-RS dataset with 19 scene categories, AID dataset with 30 scene categories, and NWPU-RESISC45 dataset with 45 challenging scene categories. The experimental results demonstrate that our architecture gets a significant classification accuracy improvement over all state-of-the-art references. PMID:29581722

A Two-Stream Deep Fusion Framework for High-Resolution Aerial Scene Classification.

PubMed

Yu, Yunlong; Liu, Fuxian

2018-01-01

One of the challenging problems in understanding high-resolution remote sensing images is aerial scene classification. A well-designed feature representation method and classifier can improve classification accuracy. In this paper, we construct a new two-stream deep architecture for aerial scene classification. First, we use two pretrained convolutional neural networks (CNNs) as feature extractor to learn deep features from the original aerial image and the processed aerial image through saliency detection, respectively. Second, two feature fusion strategies are adopted to fuse the two different types of deep convolutional features extracted by the original RGB stream and the saliency stream. Finally, we use the extreme learning machine (ELM) classifier for final classification with the fused features. The effectiveness of the proposed architecture is tested on four challenging datasets: UC-Merced dataset with 21 scene categories, WHU-RS dataset with 19 scene categories, AID dataset with 30 scene categories, and NWPU-RESISC45 dataset with 45 challenging scene categories. The experimental results demonstrate that our architecture gets a significant classification accuracy improvement over all state-of-the-art references.

Coupled multiview autoencoders with locality sensitivity for three-dimensional human pose estimation

NASA Astrophysics Data System (ADS)

Yu, Jialin; Sun, Jifeng; Luo, Shasha; Duan, Bichao

2017-09-01

Estimating three-dimensional (3D) human poses from a single camera is usually implemented by searching pose candidates with image descriptors. Existing methods usually suppose that the mapping from feature space to pose space is linear, but in fact, their mapping relationship is highly nonlinear, which heavily degrades the performance of 3D pose estimation. We propose a method to recover 3D pose from a silhouette image. It is based on the multiview feature embedding (MFE) and the locality-sensitive autoencoders (LSAEs). On the one hand, we first depict the manifold regularized sparse low-rank approximation for MFE and then the input image is characterized by a fused feature descriptor. On the other hand, both the fused feature and its corresponding 3D pose are separately encoded by LSAEs. A two-layer back-propagation neural network is trained by parameter fine-tuning and then used to map the encoded 2D features to encoded 3D poses. Our LSAE ensures a good preservation of the local topology of data points. Experimental results demonstrate the effectiveness of our proposed method.

9-(3,4-Dimeth-oxy-phen-yl)-3,4,5,6,7,9-hexa-hydroxanthene-1,8(2H)-dione.

PubMed

Mehdi, Sayed Hasan; Hashim, Rokiah; Ghalib, Raza Murad; Yeap, Chin Sing; Fun, Hoong-Kun

2011-06-01

In the title compound, C(21)H(22)O(5), the mean planes of the pyran and dimeth-oxy-phenyl rings are nearly perpendicular to one another, with the dihedral angle between them being 88.21 (8)°. The pyran ring adopts a boat conformation whereas the two fused cyclo-hexane rings adopt envelope conformations. In the crystal, mol-ecules are linked into a three-dimensional network by inter-molecular C-H⋯O hydrogen bonds.

Protection coordination of the Kennedy Space Center electric distribution network

NASA Technical Reports Server (NTRS)

1976-01-01

A computer technique is described for visualizing the coordination and protection of any existing system of devices and settings by plotting the tripping characteristics of the involved devices on a common basis. The program determines the optimum settings of a given set of protective devices and configuration in the sense of the best expected coordinated operation of these devices. Subroutines are given for simulating time versus current characteristics of the different relays, circuit breakers, and fuses in the system; coordination index computation; protection checks; plotting; and coordination optimation.

Developing Network Situational Awareness through Visualizations of Fused Intrusion Detection System Alerts

DTIC Science & Technology

2008-06-01

Phishing with Plug and Play Exploit. In this attack, the at- tacker sets up a website offering the visitor free “ porn ” if they sign up. The user is allowed... porn alert so its unclear at the moment if 100.20.3.127 is compromised and if so, how it is compromised because there are no other alerts at this time...unauthorized porn website. The investigation would conclude that the attacker at 51.251.22.183 used the information gained from the website to open an

4-Methyl-N-(1-methyl-1H-indazol-5-yl)benzene-sulfonamide.

PubMed

Chicha, Hakima; Oulemda, Bassou; Rakib, El Mostapha; Saadi, Mohamed; El Ammari, Lahcen

2013-01-01

In the title compound, C15H15N3O2S, the fused ring system is close to planar, the largest deviation from the mean plane being 0.030 (2) Å, and makes a dihedral angle of 48.84 (9)° with the benzene ring belonging to the methyl-benzene-sulfonamide moiety. In the crystal, mol-ecules are -connected through N-H⋯N hydrogen bonds and weak C-H⋯O contacts, forming a two-dimensional network parallel to (001).

4-Methyl-N-(1-methyl-1H-indazol-5-yl)benzene­sulfonamide

PubMed Central

Chicha, Hakima; Oulemda, Bassou; Rakib, El Mostapha; Saadi, Mohamed; El Ammari, Lahcen

2013-01-01

In the title compound, C15H15N3O2S, the fused ring system is close to planar, the largest deviation from the mean plane being 0.030 (2) Å, and makes a dihedral angle of 48.84 (9)° with the benzene ring belonging to the methyl­benzene­sulfonamide moiety. In the crystal, mol­ecules are ­connected through N—H⋯N hydrogen bonds and weak C—H⋯O contacts, forming a two-dimensional network parallel to (001). PMID:24427093

N-(3-Chloro-1H-indazol-5-yl)-4-meth­oxy­benzene­sulfonamide

PubMed Central

Chicha, Hakima; Rakib, El Mostapha; Bouissane, Latifa; Saadi, Mohamed; El Ammari, Lahcen

2013-01-01

In the title compound, C14H12ClN3O3S, the fused five- and six-membered rings are folded slightly along the common edge, forming a dihedral angle of 3.2 (1)°. The mean plane through the indazole system makes a dihedral angle of 30.75 (7)° with the distant benzene ring. In the crystal, N—H⋯O hydrogen bonds link the mol­ecules, forming a two-dimensional network parallel to (001). PMID:24454078

N-(1H-Indazol-5-yl)-4-meth­oxy­benzene­sulfonamide

PubMed Central

Chicha, Hakima; Rakib, El Mostapha; Bouissane, Latifa; Saadi, Mohamed; El Ammari, Lahcen

2013-01-01

In the title compound, C14H13N3O3S, the fused ring system is almost planar, the largest deviation from the mean plane being 0.023 (2) Å, and makes a dihedral angle of 47.92 (10)° with the benzene ring of the benzene­sulfonamide moiety. In the crystal, mol­ecules are connected through N—H⋯O hydrogen bonds and weak C—H⋯O contacts, forming a two-dimensional network which is parallel to (010). PMID:24454128

Critical exponents for diluted resistor networks

NASA Astrophysics Data System (ADS)

Stenull, O.; Janssen, H. K.; Oerding, K.

1999-05-01

An approach by Stephen [Phys. Rev. B 17, 4444 (1978)] is used to investigate the critical properties of randomly diluted resistor networks near the percolation threshold by means of renormalized field theory. We reformulate an existing field theory by Harris and Lubensky [Phys. Rev. B 35, 6964 (1987)]. By a decomposition of the principal Feynman diagrams, we obtain diagrams which again can be interpreted as resistor networks. This interpretation provides for an alternative way of evaluating the Feynman diagrams for random resistor networks. We calculate the resistance crossover exponent φ up to second order in ɛ=6-d, where d is the spatial dimension. Our result φ=1+ɛ/42+4ɛ2/3087 verifies a previous calculation by Lubensky and Wang, which itself was based on the Potts-model formulation of the random resistor network.

Toward automatic time-series forecasting using neural networks.

PubMed

Yan, Weizhong

2012-07-01

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

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

PubMed

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

2017-01-01

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

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.

Network Dynamics of Innovation Processes.

PubMed

Iacopini, Iacopo; Milojević, Staša; Latora, Vito

2018-01-26

We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

Network Dynamics of Innovation Processes

NASA Astrophysics Data System (ADS)

Iacopini, Iacopo; Milojević, Staša; Latora, Vito

2018-01-01

We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

Random Bits Forest: a Strong Classifier/Regressor for Big Data

NASA Astrophysics Data System (ADS)

Wang, Yi; Li, Yi; Pu, Weilin; Wen, Kathryn; Shugart, Yin Yao; Xiong, Momiao; Jin, Li

2016-07-01

Efficiency, memory consumption, and robustness are common problems with many popular methods for data analysis. As a solution, we present Random Bits Forest (RBF), a classification and regression algorithm that integrates neural networks (for depth), boosting (for width), and random forests (for prediction accuracy). Through a gradient boosting scheme, it first generates and selects ~10,000 small, 3-layer random neural networks. These networks are then fed into a modified random forest algorithm to obtain predictions. Testing with datasets from the UCI (University of California, Irvine) Machine Learning Repository shows that RBF outperforms other popular methods in both accuracy and robustness, especially with large datasets (N > 1000). The algorithm also performed highly in testing with an independent data set, a real psoriasis genome-wide association study (GWAS).

How well do mean field theories of spiking quadratic-integrate-and-fire networks work in realistic parameter regimes?

PubMed

Grabska-Barwińska, Agnieszka; Latham, Peter E

2014-06-01

We use mean field techniques to compute the distribution of excitatory and inhibitory firing rates in large networks of randomly connected spiking quadratic integrate and fire neurons. These techniques are based on the assumption that activity is asynchronous and Poisson. For most parameter settings these assumptions are strongly violated; nevertheless, so long as the networks are not too synchronous, we find good agreement between mean field prediction and network simulations. Thus, much of the intuition developed for randomly connected networks in the asynchronous regime applies to mildly synchronous networks.

Transparent data service with multiple wireless access

NASA Technical Reports Server (NTRS)

Dean, Richard A.; Levesque, Allen H.

1993-01-01

The rapid introduction of digital wireless networks is an important part of the emerging digital communications scene. The introduction of Digital Cellular, LEO and GEO Satellites, and Personal Communications Services poses both a challenge and an opportunity for the data user. On the one hand wireless access will introduce significant new portable data services such as personal notebooks, paging, E-mail, and fax that will put the information age in the user's pocket. On the other hand the challenge of creating a seamless and transparent environment for the user in multiple access environments and across multiple network connections is formidable. A summary of the issues associated with developing techniques and standards that can support transparent and seamless data services is presented. The introduction of data services into the radio world represents a unique mix of RF channel problems, data protocol issues, and network issues. These problems require that experts from each of these disciplines fuse the individual technologies to support these services.

YoTube: Searching Action Proposal Via Recurrent and Static Regression Networks

NASA Astrophysics Data System (ADS)

Zhu, Hongyuan; Vial, Romain; Lu, Shijian; Peng, Xi; Fu, Huazhu; Tian, Yonghong; Cao, Xianbin

2018-06-01

In this paper, we present YoTube-a novel network fusion framework for searching action proposals in untrimmed videos, where each action proposal corresponds to a spatialtemporal video tube that potentially locates one human action. Our method consists of a recurrent YoTube detector and a static YoTube detector, where the recurrent YoTube explores the regression capability of RNN for candidate bounding boxes predictions using learnt temporal dynamics and the static YoTube produces the bounding boxes using rich appearance cues in a single frame. Both networks are trained using rgb and optical flow in order to fully exploit the rich appearance, motion and temporal context, and their outputs are fused to produce accurate and robust proposal boxes. Action proposals are finally constructed by linking these boxes using dynamic programming with a novel trimming method to handle the untrimmed video effectively and efficiently. Extensive experiments on the challenging UCF-101 and UCF-Sports datasets show that our proposed technique obtains superior performance compared with the state-of-the-art.

Learning-based landmarks detection for osteoporosis analysis

NASA Astrophysics Data System (ADS)

Cheng, Erkang; Zhu, Ling; Yang, Jie; Azhari, Azhari; Sitam, Suhardjo; Liang, Xin; Megalooikonomou, Vasileios; Ling, Haibin

2016-03-01

Osteoporosis is the common cause for a broken bone among senior citizens. Early diagnosis of osteoporosis requires routine examination which may be costly for patients. A potential low cost diagnosis is to identify a senior citizen at high risk of osteoporosis by pre-screening during routine dental examination. Therefore, osteoporosis analysis using dental radiographs severs as a key step in routine dental examination. The aim of this study is to localize landmarks in dental radiographs which are helpful to assess the evidence of osteoporosis. We collect eight landmarks which are critical in osteoporosis analysis. Our goal is to localize these landmarks automatically for a given dental radiographic image. To address the challenges such as large variations of appearances in subjects, in this paper, we formulate the task into a multi-class classification problem. A hybrid feature pool is used to represent these landmarks. For the discriminative classification problem, we use a random forest to fuse the hybrid feature representation. In the experiments, we also evaluate the performances of individual feature component and the hybrid fused feature. Our proposed method achieves average detection error of 2:9mm.

Novel solutions for an old disease: diagnosis of acute appendicitis with random forest, support vector machines, and artificial neural networks.

PubMed

Hsieh, Chung-Ho; Lu, Ruey-Hwa; Lee, Nai-Hsin; Chiu, Wen-Ta; Hsu, Min-Huei; Li, Yu-Chuan Jack

2011-01-01

Diagnosing acute appendicitis clinically is still difficult. We developed random forests, support vector machines, and artificial neural network models to diagnose acute appendicitis. Between January 2006 and December 2008, patients who had a consultation session with surgeons for suspected acute appendicitis were enrolled. Seventy-five percent of the data set was used to construct models including random forest, support vector machines, artificial neural networks, and logistic regression. Twenty-five percent of the data set was withheld to evaluate model performance. The area under the receiver operating characteristic curve (AUC) was used to evaluate performance, which was compared with that of the Alvarado score. Data from a total of 180 patients were collected, 135 used for training and 45 for testing. The mean age of patients was 39.4 years (range, 16-85). Final diagnosis revealed 115 patients with and 65 without appendicitis. The AUC of random forest, support vector machines, artificial neural networks, logistic regression, and Alvarado was 0.98, 0.96, 0.91, 0.87, and 0.77, respectively. The sensitivity, specificity, positive, and negative predictive values of random forest were 94%, 100%, 100%, and 87%, respectively. Random forest performed better than artificial neural networks, logistic regression, and Alvarado. We demonstrated that random forest can predict acute appendicitis with good accuracy and, deployed appropriately, can be an effective tool in clinical decision making. Copyright © 2011 Mosby, Inc. All rights reserved.

Offdiagonal complexity: A computationally quick complexity measure for graphs and networks

NASA Astrophysics Data System (ADS)

Claussen, Jens Christian

2007-02-01

A vast variety of biological, social, and economical networks shows topologies drastically differing from random graphs; yet the quantitative characterization remains unsatisfactory from a conceptual point of view. Motivated from the discussion of small scale-free networks, a biased link distribution entropy is defined, which takes an extremum for a power-law distribution. This approach is extended to the node-node link cross-distribution, whose nondiagonal elements characterize the graph structure beyond link distribution, cluster coefficient and average path length. From here a simple (and computationally cheap) complexity measure can be defined. This offdiagonal complexity (OdC) is proposed as a novel measure to characterize the complexity of an undirected graph, or network. While both for regular lattices and fully connected networks OdC is zero, it takes a moderately low value for a random graph and shows high values for apparently complex structures as scale-free networks and hierarchical trees. The OdC approach is applied to the Helicobacter pylori protein interaction network and randomly rewired surrogates.

Probabilistic generation of random networks taking into account information on motifs occurrence.

PubMed

Bois, Frederic Y; Gayraud, Ghislaine

2015-01-01

Because of the huge number of graphs possible even with a small number of nodes, inference on network structure is known to be a challenging problem. Generating large random directed graphs with prescribed probabilities of occurrences of some meaningful patterns (motifs) is also difficult. We show how to generate such random graphs according to a formal probabilistic representation, using fast Markov chain Monte Carlo methods to sample them. As an illustration, we generate realistic graphs with several hundred nodes mimicking a gene transcription interaction network in Escherichia coli.

Probabilistic Generation of Random Networks Taking into Account Information on Motifs Occurrence

PubMed Central

Bois, Frederic Y.

2015-01-01

Abstract Because of the huge number of graphs possible even with a small number of nodes, inference on network structure is known to be a challenging problem. Generating large random directed graphs with prescribed probabilities of occurrences of some meaningful patterns (motifs) is also difficult. We show how to generate such random graphs according to a formal probabilistic representation, using fast Markov chain Monte Carlo methods to sample them. As an illustration, we generate realistic graphs with several hundred nodes mimicking a gene transcription interaction network in Escherichia coli. PMID:25493547

A Dynamic Bayesian Network Model for the Production and Inventory Control

NASA Astrophysics Data System (ADS)

Shin, Ji-Sun; Takazaki, Noriyuki; Lee, Tae-Hong; Kim, Jin-Il; Lee, Hee-Hyol

In general, the production quantities and delivered goods are changed randomly and then the total stock is also changed randomly. This paper deals with the production and inventory control using the Dynamic Bayesian Network. Bayesian Network is a probabilistic model which represents the qualitative dependence between two or more random variables by the graph structure, and indicates the quantitative relations between individual variables by the conditional probability. The probabilistic distribution of the total stock is calculated through the propagation of the probability on the network. Moreover, an adjusting rule of the production quantities to maintain the probability of a lower limit and a ceiling of the total stock to certain values is shown.

Mass media influence spreading in social networks with community structure

NASA Astrophysics Data System (ADS)

Candia, Julián; Mazzitello, Karina I.

2008-07-01

We study an extension of Axelrod's model for social influence, in which cultural drift is represented as random perturbations, while mass media are introduced by means of an external field. In this scenario, we investigate how the modular structure of social networks affects the propagation of mass media messages across a society. The community structure of social networks is represented by coupled random networks, in which two random graphs are connected by intercommunity links. Considering inhomogeneous mass media fields, we study the conditions for successful message spreading and find a novel phase diagram in the multidimensional parameter space. These findings show that social modularity effects are of paramount importance for designing successful, cost-effective advertising campaigns.

The Role of the MHV Receptor and Related Glycoproteins in Murine Hepatitis Virus Infection of Murine Cell Lines

DTIC Science & Technology

1995-04-13

rhodamine-coupled goat anti -mouse antibody . A rare , fused Cl 1 D giant cell was selected to show (Al, while extensive fusion was common throughout the...mouse anti - MHV-AS9 antiserum. To quantify the lev el of susceptibility of cells to MHV infection , ten randomly selected fields for each sample...named CealO) was discovered and found to be co-expressed with MHVR in the CI 1 D and F40 lines of mouse fibroblasts. A monoclonal anti - MHVR

Cascade phenomenon against subsequent failures in complex networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liu, Zhi-Quan; He, Xuan; Ma, Jian-Feng

2018-06-01

Cascade phenomenon may lead to catastrophic disasters which extremely imperil the network safety or security in various complex systems such as communication networks, power grids, social networks and so on. In some flow-based networks, the load of failed nodes can be redistributed locally to their neighboring nodes to maximally preserve the traffic oscillations or large-scale cascading failures. However, in such local flow redistribution model, a small set of key nodes attacked subsequently can result in network collapse. Then it is a critical problem to effectively find the set of key nodes in the network. To our best knowledge, this work is the first to study this problem comprehensively. We first introduce the extra capacity for every node to put up with flow fluctuations from neighbors, and two extra capacity distributions including degree based distribution and average distribution are employed. Four heuristic key nodes discovering methods including High-Degree-First (HDF), Low-Degree-First (LDF), Random and Greedy Algorithms (GA) are presented. Extensive simulations are realized in both scale-free networks and random networks. The results show that the greedy algorithm can efficiently find the set of key nodes in both scale-free and random networks. Our work studies network robustness against cascading failures from a very novel perspective, and methods and results are very useful for network robustness evaluations and protections.

Dynamics of comb-of-comb-network polymers in random layered flows

NASA Astrophysics Data System (ADS)

Katyal, Divya; Kant, Rama

2016-12-01

We analyze the dynamics of comb-of-comb-network polymers in the presence of external random flows. The dynamics of such structures is evaluated through relevant physical quantities, viz., average square displacement (ASD) and the velocity autocorrelation function (VACF). We focus on comparing the dynamics of the comb-of-comb network with the linear polymer. The present work displays an anomalous diffusive behavior of this flexible network in the random layered flows. The effect of the polymer topology on the dynamics is analyzed by varying the number of generations and branch lengths in these networks. In addition, we investigate the influence of external flow on the dynamics by varying flow parameters, like the flow exponent α and flow strength Wα. Our analysis highlights two anomalous power-law regimes, viz., subdiffusive (intermediate-time polymer stretching and flow-induced diffusion) and superdiffusive (long-time flow-induced diffusion). The anomalous long-time dynamics is governed by the temporal exponent ν of ASD, viz., ν =2 -α /2 . Compared to a linear polymer, the comb-of-comb network shows a shorter crossover time (from the subdiffusive to superdiffusive regime) but a reduced magnitude of ASD. Our theory displays an anomalous VACF in the random layered flows that scales as t-α /2. We show that the network with greater total mass moves faster.

Optimal Quantum Spatial Search on Random Temporal Networks

NASA Astrophysics Data System (ADS)

Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser

2017-12-01

To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.

Sustained Activity in Hierarchical Modular Neural Networks: Self-Organized Criticality and Oscillations

PubMed Central

Wang, Sheng-Jun; Hilgetag, Claus C.; Zhou, Changsong

2010-01-01

Cerebral cortical brain networks possess a number of conspicuous features of structure and dynamics. First, these networks have an intricate, non-random organization. In particular, they are structured in a hierarchical modular fashion, from large-scale regions of the whole brain, via cortical areas and area subcompartments organized as structural and functional maps to cortical columns, and finally circuits made up of individual neurons. Second, the networks display self-organized sustained activity, which is persistent in the absence of external stimuli. At the systems level, such activity is characterized by complex rhythmical oscillations over a broadband background, while at the cellular level, neuronal discharges have been observed to display avalanches, indicating that cortical networks are at the state of self-organized criticality (SOC). We explored the relationship between hierarchical neural network organization and sustained dynamics using large-scale network modeling. Previously, it was shown that sparse random networks with balanced excitation and inhibition can sustain neural activity without external stimulation. We found that a hierarchical modular architecture can generate sustained activity better than random networks. Moreover, the system can simultaneously support rhythmical oscillations and SOC, which are not present in the respective random networks. The mechanism underlying the sustained activity is that each dense module cannot sustain activity on its own, but displays SOC in the presence of weak perturbations. Therefore, the hierarchical modular networks provide the coupling among subsystems with SOC. These results imply that the hierarchical modular architecture of cortical networks plays an important role in shaping the ongoing spontaneous activity of the brain, potentially allowing the system to take advantage of both the sensitivity of critical states and the predictability and timing of oscillations for efficient information processing. PMID:21852971

Failure and recovery in dynamical networks.

PubMed

Böttcher, L; Luković, M; Nagler, J; Havlin, S; Herrmann, H J

2017-02-03

Failure, damage spread and recovery crucially underlie many spatially embedded networked systems ranging from transportation structures to the human body. Here we study the interplay between spontaneous damage, induced failure and recovery in both embedded and non-embedded networks. In our model the network's components follow three realistic processes that capture these features: (i) spontaneous failure of a component independent of the neighborhood (internal failure), (ii) failure induced by failed neighboring nodes (external failure) and (iii) spontaneous recovery of a component. We identify a metastable domain in the global network phase diagram spanned by the model's control parameters where dramatic hysteresis effects and random switching between two coexisting states are observed. This dynamics depends on the characteristic link length of the embedded system. For the Euclidean lattice in particular, hysteresis and switching only occur in an extremely narrow region of the parameter space compared to random networks. We develop a unifying theory which links the dynamics of our model to contact processes. Our unifying framework may help to better understand controllability in spatially embedded and random networks where spontaneous recovery of components can mitigate spontaneous failure and damage spread in dynamical networks.

Group field theory and tensor networks: towards a Ryu–Takayanagi formula in full quantum gravity

NASA Astrophysics Data System (ADS)

Chirco, Goffredo; Oriti, Daniele; Zhang, Mingyi

2018-06-01

We establish a dictionary between group field theory (thus, spin networks and random tensors) states and generalized random tensor networks. Then, we use this dictionary to compute the Rényi entropy of such states and recover the Ryu–Takayanagi formula, in two different cases corresponding to two different truncations/approximations, suggested by the established correspondence.

Random Time Identity Based Firewall In Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Suman, Patel, R. B.; Singh, Parvinder

2010-11-01

A mobile ad hoc network (MANET) is a self-organizing network of mobile routers and associated hosts connected by wireless links. MANETs are highly flexible and adaptable but at the same time are highly prone to security risks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized control. Firewall is an effective means of protecting a local network from network-based security threats and forms a key component in MANET security architecture. This paper presents a review of firewall implementation techniques in MANETs and their relative merits and demerits. A new approach is proposed to select MANET nodes at random for firewall implementation. This approach randomly select a new node as firewall after fixed time and based on critical value of certain parameters like power backup. This approach effectively balances power and resource utilization of entire MANET because responsibility of implementing firewall is equally shared among all the nodes. At the same time it ensures improved security for MANETs from outside attacks as intruder will not be able to find out the entry point in MANET due to the random selection of nodes for firewall implementation.

Bio-inspired UAV routing, source localization, and acoustic signature classification for persistent surveillance

NASA Astrophysics Data System (ADS)

Burman, Jerry; Hespanha, Joao; Madhow, Upamanyu; Pham, Tien

2011-06-01

A team consisting of Teledyne Scientific Company, the University of California at Santa Barbara and the Army Research Laboratory* is developing technologies in support of automated data exfiltration from heterogeneous battlefield sensor networks to enhance situational awareness for dismounts and command echelons. Unmanned aerial vehicles (UAV) provide an effective means to autonomously collect data from a sparse network of unattended ground sensors (UGSs) that cannot communicate with each other. UAVs are used to reduce the system reaction time by generating autonomous collection routes that are data-driven. Bio-inspired techniques for search provide a novel strategy to detect, capture and fuse data. A fast and accurate method has been developed to localize an event by fusing data from a sparse number of UGSs. This technique uses a bio-inspired algorithm based on chemotaxis or the motion of bacteria seeking nutrients in their environment. A unique acoustic event classification algorithm was also developed based on using swarm optimization. Additional studies addressed the problem of routing multiple UAVs, optimally placing sensors in the field and locating the source of gunfire at helicopters. A field test was conducted in November of 2009 at Camp Roberts, CA. The field test results showed that a system controlled by bio-inspired software algorithms can autonomously detect and locate the source of an acoustic event with very high accuracy and visually verify the event. In nine independent test runs of a UAV, the system autonomously located the position of an explosion nine times with an average accuracy of 3 meters. The time required to perform source localization using the UAV was on the order of a few minutes based on UAV flight times. In June 2011, additional field tests of the system will be performed and will include multiple acoustic events, optimal sensor placement based on acoustic phenomenology and the use of the International Technology Alliance (ITA) Sensor Network Fabric (IBM).

Fusion of arkosic sand by intrusive andesite

USGS Publications Warehouse

Bailey, Roy A.

1954-01-01

An andesite dike in the Valles Mountains of northern New Mexico has intruded and partly fused arkosic sediments for a distance of 50 feet from its contacts. The dike is semi-circular in form, has a maximum width of about 100 feet, and is about 500 feet long. Small associated arcuate dikes are arranged in spiral fashion around the main dike, suggesting that they were intruded along shear fractures similar to those described by Burbank (1941). The fused rocks surrounding the andesite dike are of three general types: 1) partly fused arkosic sand, 2) fused clay, and 3) hybrid rocks. The fused arkosic sand consists of relict detrital grains of quartz, orthoclose, and plagioclase, imbedded in colorless glass containing microlites of tridymite, cordierite, and magnetite. The relict quartz grains are corroded and embayed by glass; the orthoclase is sanidinized and partly fused; and the plagioclase is inverted to the high temperature form and is partly fused. The fused clay, which was originally a mixture of montmorillonite and hydromica, consists primarily of cordierite but also contains needle-like crystals of sillimanite (?) or mullite (?). The hybrid rocks originated in part by intermixing of fused arkosic sediments and andesitic liquid and in part by diffusion of mafic constituents through the fused sediments. They are rich in cordierite and magnetite and also contain hypersthene, augite, and plagioclase. The composition of pigeonite in the andesite indicates that the temperature of the andesite at the time of intrusion probably did not exceed 1200?C. Samples of arkosic sand were fused in the presence of water in a Morey bomb at 1050?C. Stability relations of certain minerals in the fused sand suggest that fusion may have taken place at a lower temperature, however, and the fluxing action of volatiles from the andesite are thought to have made this possible.

Pixel-based image fusion with false color mapping

NASA Astrophysics Data System (ADS)

Zhao, Wei; Mao, Shiyi

2003-06-01

In this paper, we propose a pixel-based image fusion algorithm that combines the gray-level image fusion method with the false color mapping. This algorithm integrates two gray-level images presenting different sensor modalities or at different frequencies and produces a fused false-color image. The resulting image has higher information content than each of the original images. The objects in the fused color image are easy to be recognized. This algorithm has three steps: first, obtaining the fused gray-level image of two original images; second, giving the generalized high-boost filtering images between fused gray-level image and two source images respectively; third, generating the fused false-color image. We use the hybrid averaging and selection fusion method to obtain the fused gray-level image. The fused gray-level image will provide better details than two original images and reduce noise at the same time. But the fused gray-level image can't contain all detail information in two source images. At the same time, the details in gray-level image cannot be discerned as easy as in a color image. So a color fused image is necessary. In order to create color variation and enhance details in the final fusion image, we produce three generalized high-boost filtering images. These three images are displayed through red, green and blue channel respectively. A fused color image is produced finally. This method is used to fuse two SAR images acquired on the San Francisco area (California, USA). The result shows that fused false-color image enhances the visibility of certain details. The resolution of the final false-color image is the same as the resolution of the input images.

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.

Decision Fusion with Channel Errors in Distributed Decode-Then-Fuse Sensor Networks

PubMed Central

Yan, Yongsheng; Wang, Haiyan; Shen, Xiaohong; Zhong, Xionghu

2015-01-01

Decision fusion for distributed detection in sensor networks under non-ideal channels is investigated in this paper. Usually, the local decisions are transmitted to the fusion center (FC) and decoded, and a fusion rule is then applied to achieve a global decision. We propose an optimal likelihood ratio test (LRT)-based fusion rule to take the uncertainty of the decoded binary data due to modulation, reception mode and communication channel into account. The average bit error rate (BER) is employed to characterize such an uncertainty. Further, the detection performance is analyzed under both non-identical and identical local detection performance indices. In addition, the performance of the proposed method is compared with the existing optimal and suboptimal LRT fusion rules. The results show that the proposed fusion rule is more robust compared to these existing ones. PMID:26251908

Fiber fuse behavior in kW-level continuous-wave double-clad field laser

NASA Astrophysics Data System (ADS)

Jun-Yi, Sun; Qi-Rong, Xiao; Dan, Li; Xue-Jiao, Wang; Hai-Tao, Zhang; Ma-Li, Gong; Ping, Yan

2016-01-01

In this study, original experimental data for fiber fuse in kW-level continuous-wave (CW) high power double-clad fiber (DCF) laser are reported. The propagating velocity of the fuse is 9.68 m/s in a 3.1-kW Yb-doped DCF laser. Three other cases in Yb-doped DCF are also observed. We think that the ignition of fiber fuse is caused by thermal mechanism, and the formation of bullet-shaped tracks is attributed to the optical discharge and temperature gradient. The inducements of initial fuse and formation of bullet-shaped voids are analyzed. This investigation of fiber fuse helps better understand the fiber fuse behavior, in order to avoid the catastrophic destruction caused by fiber fuse in high power fiber laser. Project supported by the Key Laboratory of Science and Technology on High Energy Laser and China Academy of Engineering Physics (Grant No. 2014HEL02) and the National Natural Science Foundation of China (Grant No. 61307057).

Flexible embedding of networks

NASA Astrophysics Data System (ADS)

Fernandez-Gracia, Juan; Buckee, Caroline; Onnela, Jukka-Pekka

We introduce a model for embedding one network into another, focusing on the case where network A is much bigger than network B. Nodes from network A are assigned to the nodes in network B using an algorithm where we control the extent of localization of node placement in network B using a single parameter. Starting from an unassigned node in network A, called the source node, we first map this node to a randomly chosen node in network B, called the target node. We then assign the neighbors of the source node to the neighborhood of the target node using a random walk based approach. To assign each neighbor of the source node to one of the nodes in network B, we perform a random walk starting from the target node with stopping probability α. We repeat this process until all nodes in network A have been mapped to the nodes of network B. The simplicity of the model allows us to calculate key quantities of interest in closed form. By varying the parameter α, we are able to produce embeddings from very local (α = 1) to very global (α --> 0). We show how our calculations fit the simulated results, and we apply the model to study how social networks are embedded in geography and how the neurons of C. Elegans are embedded in the surrounding volume.

Multiple kernels learning-based biological entity relationship extraction method.

PubMed

Dongliang, Xu; Jingchang, Pan; Bailing, Wang

2017-09-20

Automatic extracting protein entity interaction information from biomedical literature can help to build protein relation network and design new drugs. There are more than 20 million literature abstracts included in MEDLINE, which is the most authoritative textual database in the field of biomedicine, and follow an exponential growth over time. This frantic expansion of the biomedical literature can often be difficult to absorb or manually analyze. Thus efficient and automated search engines are necessary to efficiently explore the biomedical literature using text mining techniques. The P, R, and F value of tag graph method in Aimed corpus are 50.82, 69.76, and 58.61%, respectively. The P, R, and F value of tag graph kernel method in other four evaluation corpuses are 2-5% higher than that of all-paths graph kernel. And The P, R and F value of feature kernel and tag graph kernel fuse methods is 53.43, 71.62 and 61.30%, respectively. The P, R and F value of feature kernel and tag graph kernel fuse methods is 55.47, 70.29 and 60.37%, respectively. It indicated that the performance of the two kinds of kernel fusion methods is better than that of simple kernel. In comparison with the all-paths graph kernel method, the tag graph kernel method is superior in terms of overall performance. Experiments show that the performance of the multi-kernels method is better than that of the three separate single-kernel method and the dual-mutually fused kernel method used hereof in five corpus sets.

Unraveling spurious properties of interaction networks with tailored random networks.

PubMed

Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus

2011-01-01

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures--known for their complex spatial and temporal dynamics--we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis.

Unraveling Spurious Properties of Interaction Networks with Tailored Random Networks

PubMed Central

Bialonski, Stephan; Wendler, Martin; Lehnertz, Klaus

2011-01-01

We investigate interaction networks that we derive from multivariate time series with methods frequently employed in diverse scientific fields such as biology, quantitative finance, physics, earth and climate sciences, and the neurosciences. Mimicking experimental situations, we generate time series with finite length and varying frequency content but from independent stochastic processes. Using the correlation coefficient and the maximum cross-correlation, we estimate interdependencies between these time series. With clustering coefficient and average shortest path length, we observe unweighted interaction networks, derived via thresholding the values of interdependence, to possess non-trivial topologies as compared to Erdös-Rényi networks, which would indicate small-world characteristics. These topologies reflect the mostly unavoidable finiteness of the data, which limits the reliability of typically used estimators of signal interdependence. We propose random networks that are tailored to the way interaction networks are derived from empirical data. Through an exemplary investigation of multichannel electroencephalographic recordings of epileptic seizures – known for their complex spatial and temporal dynamics – we show that such random networks help to distinguish network properties of interdependence structures related to seizure dynamics from those spuriously induced by the applied methods of analysis. PMID:21850239

Will electrical cyber-physical interdependent networks undergo first-order transition under random attacks?

NASA Astrophysics Data System (ADS)

Ji, Xingpei; Wang, Bo; Liu, Dichen; Dong, Zhaoyang; Chen, Guo; Zhu, Zhenshan; Zhu, Xuedong; Wang, Xunting

2016-10-01

Whether the realistic electrical cyber-physical interdependent networks will undergo first-order transition under random failures still remains a question. To reflect the reality of Chinese electrical cyber-physical system, the "partial one-to-one correspondence" interdependent networks model is proposed and the connectivity vulnerabilities of three realistic electrical cyber-physical interdependent networks are analyzed. The simulation results show that due to the service demands of power system the topologies of power grid and its cyber network are highly inter-similar which can effectively avoid the first-order transition. By comparing the vulnerability curves between electrical cyber-physical interdependent networks and its single-layer network, we find that complex network theory is still useful in the vulnerability analysis of electrical cyber-physical interdependent networks.

Macrostructure from Microstructure: Generating Whole Systems from Ego Networks

PubMed Central

Smith, Jeffrey A.

2014-01-01

This paper presents a new simulation method to make global network inference from sampled data. The proposed simulation method takes sampled ego network data and uses Exponential Random Graph Models (ERGM) to reconstruct the features of the true, unknown network. After describing the method, the paper presents two validity checks of the approach: the first uses the 20 largest Add Health networks while the second uses the Sociology Coauthorship network in the 1990's. For each test, I take random ego network samples from the known networks and use my method to make global network inference. I find that my method successfully reproduces the properties of the networks, such as distance and main component size. The results also suggest that simpler, baseline models provide considerably worse estimates for most network properties. I end the paper by discussing the bounds/limitations of ego network sampling. I also discuss possible extensions to the proposed approach. PMID:25339783

The effect of the neural activity on topological properties of growing neural networks.

PubMed

Gafarov, F M; Gafarova, V R

2016-09-01

The connectivity structure in cortical networks defines how information is transmitted and processed, and it is a source of the complex spatiotemporal patterns of network's development, and the process of creation and deletion of connections is continuous in the whole life of the organism. In this paper, we study how neural activity influences the growth process in neural networks. By using a two-dimensional activity-dependent growth model we demonstrated the neural network growth process from disconnected neurons to fully connected networks. For making quantitative investigation of the network's activity influence on its topological properties we compared it with the random growth network not depending on network's activity. By using the random graphs theory methods for the analysis of the network's connections structure it is shown that the growth in neural networks results in the formation of a well-known "small-world" network.

Road Network State Estimation Using Random Forest Ensemble Learning

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

Hou, Yi; Edara, Praveen; Chang, Yohan

Network-scale travel time prediction not only enables traffic management centers (TMC) to proactively implement traffic management strategies, but also allows travelers make informed decisions about route choices between various origins and destinations. In this paper, a random forest estimator was proposed to predict travel time in a network. The estimator was trained using two years of historical travel time data for a case study network in St. Louis, Missouri. Both temporal and spatial effects were considered in the modeling process. The random forest models predicted travel times accurately during both congested and uncongested traffic conditions. The computational times for themore » models were low, thus useful for real-time traffic management and traveler information applications.« less

Finite-time stability of neutral-type neural networks with random time-varying delays

NASA Astrophysics Data System (ADS)

Ali, M. Syed; Saravanan, S.; Zhu, Quanxin

2017-11-01

This paper is devoted to the finite-time stability analysis of neutral-type neural networks with random time-varying delays. The randomly time-varying delays are characterised by Bernoulli stochastic variable. This result can be extended to analysis and design for neutral-type neural networks with random time-varying delays. On the basis of this paper, we constructed suitable Lyapunov-Krasovskii functional together and established a set of sufficient linear matrix inequalities approach to guarantee the finite-time stability of the system concerned. By employing the Jensen's inequality, free-weighting matrix method and Wirtinger's double integral inequality, the proposed conditions are derived and two numerical examples are addressed for the effectiveness of the developed techniques.

More randomized and resilient in the topological properties of functional brain networks in patients with major depressive disorder.

PubMed

Li, Huaizhou; Zhou, Haiyan; Yang, Yang; Wang, Haiyuan; Zhong, Ning

2017-10-01

Previous studies have reported the enhanced randomization of functional brain networks in patients with major depressive disorder (MDD). However, little is known about the changes of key nodal attributes for randomization, the resilience of network, and the clinical significance of the alterations. In this study, we collected the resting-state functional MRI data from 19 MDD patients and 19 healthy control (HC) individuals. Graph theory analysis showed that decreases were found in the small-worldness, clustering coefficient, local efficiency, and characteristic path length (i.e., increase of global efficiency) in the network of MDD group compared with HC group, which was consistent with previous findings and suggested the development toward randomization in the brain network in MDD. In addition, the greater resilience under the targeted attacks was also found in the network of patients with MDD. Furthermore, the abnormal nodal properties were found, including clustering coefficients and nodal efficiencies in the left orbital superior frontal gyrus, bilateral insula, left amygdala, right supramarginal gyrus, left putamen, left posterior cingulate cortex, left angular gyrus. Meanwhile, the correlation analysis showed that most of these abnormal areas were associated with the clinical status. The observed increased randomization and resilience in MDD might be related to the abnormal hub nodes in the brain networks, which were attacked by the disease pathology. Our findings provide new evidence to indicate that the weakening of specialized regions and the enhancement of whole brain integrity could be the potential endophenotype of the depressive pathology. Copyright © 2017 Elsevier Ltd. All rights reserved.

Reconfiguration and Search of Social Networks

PubMed Central

Zhang, Lianming; Peng, Aoyuan

2013-01-01

Social networks tend to exhibit some topological characteristics different from regular networks and random networks, such as shorter average path length and higher clustering coefficient, and the node degree of the majority of social networks obeys exponential distribution. Based on the topological characteristics of the real social networks, a new network model which suits to portray the structure of social networks was proposed, and the characteristic parameters of the model were calculated. To find out the relationship between two people in the social network, and using the local information of the social network and the parallel mechanism, a hybrid search strategy based on k-walker random and a high degree was proposed. Simulation results show that the strategy can significantly reduce the average number of search steps, so as to effectively improve the search speed and efficiency. PMID:24574861

Attack Vulnerability of Network Controllability

PubMed Central

2016-01-01

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability. PMID:27588941

Attack Vulnerability of Network Controllability.

PubMed

Lu, Zhe-Ming; Li, Xin-Feng

2016-01-01

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges. The attack strategies are selected based on degree and betweenness centralities calculated for either the initial network or the current network during the removal, among which random failure is as a comparison. It is found that the node-based strategies are often more harmful to the network controllability than the edge-based ones, and so are the recalculated strategies than their counterparts. The Barabási-Albert scale-free model, which has a highly biased structure, proves to be the most vulnerable of the tested model networks. In contrast, the Erdős-Rényi random model, which lacks structural bias, exhibits much better robustness to both node-based and edge-based attacks. We also survey the control robustness of 25 real-world networks, and the numerical results show that most real networks are control robust to random node failures, which has not been observed in the model networks. And the recalculated betweenness-based strategy is the most efficient way to harm the controllability of real-world networks. Besides, we find that the edge degree is not a good quantity to measure the importance of an edge in terms of network controllability.

Ft1, a novel gene related to ubiquitin-conjugating enzymes, is deleted in the Fused toes mouse mutation.

PubMed

Lesche, R; Peetz, A; van der Hoeven, F; Rüther, U

1997-12-01

The dominant mouse mutation Fused toes is characterized by partial syndactyly of the limbs and thymic hyperplasia. Both morphological abnormalities were shown to be related to impaired regulation of programmed cell death. Ft/Ft embryos die in midgestation showing severe malformations of fore- and midbrain as well as randomized situs. In Ft mice a large chromosomal deletion (about 300 kb) occurred after insertional mutagenesis. In this report we describe the identification of the first gene that has been mutated by Fused toes. The expression of the novel gene Ft1 is reduced in Ft/+ mice and completely absent in Ft/Ft embryos. Analysis of the Ft1 cDNA revealed an open reading frame that could code for a 32-kDa protein with similarities to ubiquitin-conjugating enzymes. Ft1 transcripts with alternative 5' UTR sequences as well as differential usage of polyadenylation sites were found. Interestingly, the 3' parts of the longest Ft1 transcripts are identical to the reverse complement of the 3'-most sequences of the Rb-related p130 gene. Both genes are transcribed in opposite directions and overlap in their 3' UTRs. Despite the close linkage, p130 expression appeared not to be affected by the Ft mutation. In wild type mice, Ft1 expression levels were found to be high in brain, kidney, and testes and detectable in all other adult organs and throughout embryonic development. Finally, we show that Ft1 is conserved among mammals and identify the human homolog.

Binaural pitch fusion: Pitch averaging and dominance in hearing-impaired listeners with broad fusion.

PubMed

Oh, Yonghee; Reiss, Lina A J

2017-08-01

Both bimodal cochlear implant and bilateral hearing aid users can exhibit broad binaural pitch fusion, the fusion of dichotically presented tones over a broad range of pitch differences between ears [Reiss, Ito, Eggleston, and Wozny. (2014). J. Assoc. Res. Otolaryngol. 15(2), 235-248; Reiss, Eggleston, Walker, and Oh. (2016). J. Assoc. Res. Otolaryngol. 17(4), 341-356; Reiss, Shayman, Walker, Bennett, Fowler, Hartling, Glickman, Lasarev, and Oh. (2017). J. Acoust. Soc. Am. 143(3), 1909-1920]. Further, the fused binaural pitch is often a weighted average of the different pitches perceived in the two ears. The current study was designed to systematically measure these pitch averaging phenomena in bilateral hearing aid users with broad fusion. The fused binaural pitch of the reference-pair tone combination was initially measured by pitch-matching to monaural comparison tones presented to the pair tone ear. The averaged results for all subjects showed two distinct trends: (1) The fused binaural pitch was dominated by the lower-pitch component when the pair tone was either 0.14 octaves below or 0.78 octaves above the reference tone; (2) pitch averaging occurred when the pair tone was between the two boundaries above, with the most equal weighting at 0.38 octaves above the reference tone. Findings from two subjects suggest that randomization or alternation of the comparison ear can eliminate this asymmetry in the pitch averaging range. Overall, these pitch averaging phenomena suggest that spectral distortions and thus binaural interference may arise during binaural stimulation in hearing-impaired listeners with broad fusion.

Unanticipated Effect of a Randomized Peer Network Intervention on Depressive Symptoms among Young Methamphetamine Users in Thailand

ERIC Educational Resources Information Center

German, D.; Sutcliffe, C. G.; Sirirojn, B.; Sherman, S. G.; Latkin, C. A.; Aramrattana, A.; Celentano, D. D.

2012-01-01

We examined the effect on depressive symptoms of a peer network-oriented intervention effective in reducing sexual risk behavior and methamphetamine (MA) use. Current Thai MA users aged 18-25 years and their drug and/or sex network members enrolled in a randomized controlled trial with 4 follow-ups over 12 months. A total of 415 index participants…

Theoretical Foundations of Wireless Networks

DTIC Science & Technology

2015-07-22

Optimal transmission over a fading channel with imperfect channel state information,” in Global Telecommun. Conf., pp. 1–5, Houston TX , December 5-9...SECURITY CLASSIFICATION OF: The goal of this project is to develop a formal theory of wireless networks providing a scientific basis to understand...randomness and optimality. Randomness, in the form of fading, is a defining characteristic of wireless networks. Optimality is a suitable design

Contemplating the ultimate sacrifice: identity fusion channels pro-group affect, cognition, and moral decision making.

PubMed

Swann, William B; Gómez, Angel; Buhrmester, Michael D; López-Rodríguez, Lucía; Jiménez, Juan; Vázquez, Alexandra

2014-05-01

Although most people acknowledge the moral virtue in sacrificing oneself to save others, few actually endorse self-sacrifice. Seven experiments explored the cognitive and emotional mechanisms that underlie such endorsements. Participants responded to 1 of 2 moral dilemmas in which they could save 5 members of their country only by sacrificing themselves. Over 90% of participants acknowledged that the moral course of action was to sacrifice oneself to save others (Experiment 1), yet only those who were strongly fused with the group preferentially endorsed self-sacrifice (Experiments 2-7). The presence of a concern with saving group members rather than the absence of a concern with self-preservation motivated strongly fused participants to endorse sacrificing themselves for the group (Experiment 3). Analyses of think aloud protocols suggested that saving others was motivated by emotional engagement with the group among strongly fused participants but by utilitarian concerns among weakly fused participants (Experiment 4). Hurrying participants' responses increased self-sacrifice among strongly fused participants but decreased self-sacrifice among weakly fused participants (Experiment 5). Priming the personal self increased endorsement of self-sacrifice among strongly fused participants but further reduced endorsement of self-sacrifice among weakly fused participants (Experiment 6). Strongly fused participants ignored utilitarian considerations, but weakly fused persons endorsed self-sacrifice more when it would save more people (Experiment 7). Apparently, the emotional engagement with the group experienced by strongly fused persons overrides the desire for self-preservation and compels them to translate their moral beliefs into self-sacrificial behavior.

From Networks to Time Series

NASA Astrophysics Data System (ADS)

Shimada, Yutaka; Ikeguchi, Tohru; Shigehara, Takaomi

2012-10-01

In this Letter, we propose a framework to transform a complex network to a time series. The transformation from complex networks to time series is realized by the classical multidimensional scaling. Applying the transformation method to a model proposed by Watts and Strogatz [Nature (London) 393, 440 (1998)], we show that ring lattices are transformed to periodic time series, small-world networks to noisy periodic time series, and random networks to random time series. We also show that these relationships are analytically held by using the circulant-matrix theory and the perturbation theory of linear operators. The results are generalized to several high-dimensional lattices.

Ground-echo characteristics for a ground-target pulse-Doppler radar fuze of high duty ratio

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

Williams, C.S.

1973-11-21

From Tri-service electronic fuse symposium; Washington, District of Columbia, USA (26 Nov 1973). A pulse-Doppler radar fuze for use against ground targets at high burst heights can operate at low peak power provided a high duty ratio is used. The high duty ratio brings about ambiguous ground return that is prevented from firing the fuze by randomly coding the phase of the transmitted pulses. This causes the ambiguous return to appear as random noise. This paper provides formulas for the calculation of the clutter-noise power density and of the signal power so that the performance of the radar can bemore » determined. The paper also discusses the myth of decorrelation'' that is alleged to destroy the transmittedphase modulation in the echo and so make it useless. (auth)« less

An algorithm of adaptive scale object tracking in occlusion

NASA Astrophysics Data System (ADS)

Zhao, Congmei

2017-05-01

Although the correlation filter-based trackers achieve the competitive results both on accuracy and robustness, there are still some problems in handling scale variations, object occlusion, fast motions and so on. In this paper, a multi-scale kernel correlation filter algorithm based on random fern detector was proposed. The tracking task was decomposed into the target scale estimation and the translation estimation. At the same time, the Color Names features and HOG features were fused in response level to further improve the overall tracking performance of the algorithm. In addition, an online random fern classifier was trained to re-obtain the target after the target was lost. By comparing with some algorithms such as KCF, DSST, TLD, MIL, CT and CSK, experimental results show that the proposed approach could estimate the object state accurately and handle the object occlusion effectively.

Perianth organization and intra-specific floral variability.

PubMed

Herrera, J; Arista, M; Ortiz, P L

2008-11-01

Floral symmetry and fusion of perianth parts are factors that contribute to fine-tune the match between flowers and their animal pollination vectors. In the present study, we investigated whether the possession of a sympetalous (fused) corolla and bilateral symmetry of flowers translate into decreased intra-specific variability as a result of natural stabilizing selection exerted by pollinators. Average size of the corolla and intra-specific variability were determined in two sets of southern Spanish entomophilous plant species. In the first set, taxa were paired by family to control for the effect of phylogeny (phylogenetically independent contrasts), whereas in the second set species were selected at random. Flower size data from a previous study (with different species) were also used to test the hypothesis that petal fusion contributes to decrease intra-specific variability. In the phylogenetically independent contrasts, floral symmetry was a significant correlate of intra-specific variation, with bilaterally symmetrical flowers showing more constancy than radially symmetrical flowers (i.e. unsophisticated from a functional perspective). As regards petal fusion, species with fused petals were on average more constant than choripetalous species, but the difference was not statistically significant. The reanalysis of data from a previous study yielded largely similar results, with a distinct effect of symmetry on variability, but no effect of petal fusion. The randomly-chosen species sample, on the other hand, failed to reveal any significant effect of either symmetry or petal fusion on intra-specific variation. The problem of low-statistical power in this kind of analysis, and the difficulty of testing an evolutionary hypothesis that involves phenotypic traits with a high degree of morphological correlation is discussed.

16 CFR 1507.3 - Fuses.

Code of Federal Regulations, 2010 CFR

2010-01-01

... Practices CONSUMER PRODUCT SAFETY COMMISSION FEDERAL HAZARDOUS SUBSTANCES ACT REGULATIONS FIREWORKS DEVICES § 1507.3 Fuses. (a) Fireworks devices that require a fuse shall: (1) Utilize only a fuse that has been... it will support either the weight of the fireworks device plus 8 ounces of dead weight or double the...

A distributed database view of network tracking systems

NASA Astrophysics Data System (ADS)

Yosinski, Jason; Paffenroth, Randy

2008-04-01

In distributed tracking systems, multiple non-collocated trackers cooperate to fuse local sensor data into a global track picture. Generating this global track picture at a central location is fairly straightforward, but the single point of failure and excessive bandwidth requirements introduced by centralized processing motivate the development of decentralized methods. In many decentralized tracking systems, trackers communicate with their peers via a lossy, bandwidth-limited network in which dropped, delayed, and out of order packets are typical. Oftentimes the decentralized tracking problem is viewed as a local tracking problem with a networking twist; we believe this view can underestimate the network complexities to be overcome. Indeed, a subsequent 'oversight' layer is often introduced to detect and handle track inconsistencies arising from a lack of robustness to network conditions. We instead pose the decentralized tracking problem as a distributed database problem, enabling us to draw inspiration from the vast extant literature on distributed databases. Using the two-phase commit algorithm, a well known technique for resolving transactions across a lossy network, we describe several ways in which one may build a distributed multiple hypothesis tracking system from the ground up to be robust to typical network intricacies. We pay particular attention to the dissimilar challenges presented by network track initiation vs. maintenance and suggest a hybrid system that balances speed and robustness by utilizing two-phase commit for only track initiation transactions. Finally, we present simulation results contrasting the performance of such a system with that of more traditional decentralized tracking implementations.

Visualizing and Integrating AFSCN Utilization into a Common Operational Picture

NASA Astrophysics Data System (ADS)

Hays, B.; Carlile, A.; Mitchell, T.

The Department of Defense (DoD) and the 50th Space Network Operations Group Studies and Analysis branch (50th SCS/SCXI), located at Schriever AFB Colorado, face the unique challenge of forecasting the expected near term and future utilization of the Air Force Satellite Control Network (AFSCN). The forecasting timeframe covers the planned load from the current date to ten years out. The various satellite missions, satellite requirements, orbital regions, and ground architecture dynamics provide the model inputs and constraints that are used in generating the forecasted load. The AFSCN is the largest network the Air Force uses to control satellites worldwide. Each day, network personnel perform over 500 scheduled events-from satellite maneuvers to critical data downloads. The Forecasting Objective is to provide leadership with the insights necessary to manage the network today and tomorrow. For both today's needs and future needs, SCXI develops AFSCN utilization forecasts to optimize the ground system's coverage and capacity to meet user satellite requirements. SCXI also performs satellite program specific studies to determine network support feasibility. STK and STK Scheduler form the core of the tools used by SCXI. To establish this tool suite, we had to evaluate, evolve, and validate both the COTS products and our own developed code and processes. This began with calibrating the network model to emulate the real life scheduling environment of the AFSCN. Multiple STK Scheduler optimizing (de-confliction) algorithms, including Multi-Pass, Sequential, Random, and Neural, were evaluated and adjusted to determine applicability to the model and the accuracy of the prediction. Additionally, the scheduling Figure of Merit (FOM), which permits custom weighting of various parameters, was analyzed and tested to achieve the most accurate real life result. With the inherent capabilities of STK and the ability to wrap and automate output, SCXI is now able to visually communicate satellite loads in a manner never seen before in AFSCN management meetings. Scenarios such as regional antenna load stress, satellite missed opportunities, and the overall network "big picture" can be visually displayed in 3D versus the textual and line graph methods used for many years. This is the first step towards an integrated space awareness picture with an operational focus. SCXI is working on taking the visual forecast concept farther and begin fusing multiple sources of data to build a 50 SW Common Operating Picture (COP). The vision is to integrate more effective orbital determination processes, resource outages, current and forecasted satellite mission requirements, and future architectural changes into a real-time visual status to enable quick and responsive decisions. This COP would be utilized in a Wing Operations Center to provide up to the minute network status on where satellites are, which ground resources are in contact with them, and what resources are down. The ability to quickly absorb and process this data will enhance decision analysis and save valuable time in both day to day operations and wartime scenarios.

Bayesian Analysis for Exponential Random Graph Models Using the Adaptive Exchange Sampler.

PubMed

Jin, Ick Hoon; Yuan, Ying; Liang, Faming

2013-10-01

Exponential random graph models have been widely used in social network analysis. However, these models are extremely difficult to handle from a statistical viewpoint, because of the intractable normalizing constant and model degeneracy. In this paper, we consider a fully Bayesian analysis for exponential random graph models using the adaptive exchange sampler, which solves the intractable normalizing constant and model degeneracy issues encountered in Markov chain Monte Carlo (MCMC) simulations. The adaptive exchange sampler can be viewed as a MCMC extension of the exchange algorithm, and it generates auxiliary networks via an importance sampling procedure from an auxiliary Markov chain running in parallel. The convergence of this algorithm is established under mild conditions. The adaptive exchange sampler is illustrated using a few social networks, including the Florentine business network, molecule synthetic network, and dolphins network. The results indicate that the adaptive exchange algorithm can produce more accurate estimates than approximate exchange algorithms, while maintaining the same computational efficiency.

CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS.

PubMed

Shalizi, Cosma Rohilla; Rinaldo, Alessandro

2013-04-01

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the data consists only of a sampled sub-network. Parameters for the whole network, which is what is of interest, are estimated by applying the model to the sub-network. This assumes that the model is consistent under sampling , or, in terms of the theory of stochastic processes, that it defines a projective family. Focusing on the popular class of exponential random graph models (ERGMs), we show that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM's expressive power. These results are actually special cases of more general results about exponential families of dependent random variables, which we also prove. Using such results, we offer easily checked conditions for the consistency of maximum likelihood estimation in ERGMs, and discuss some possible constructive responses.

CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS

PubMed Central

Shalizi, Cosma Rohilla; Rinaldo, Alessandro

2015-01-01

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the data consists only of a sampled sub-network. Parameters for the whole network, which is what is of interest, are estimated by applying the model to the sub-network. This assumes that the model is consistent under sampling, or, in terms of the theory of stochastic processes, that it defines a projective family. Focusing on the popular class of exponential random graph models (ERGMs), we show that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM’s expressive power. These results are actually special cases of more general results about exponential families of dependent random variables, which we also prove. Using such results, we offer easily checked conditions for the consistency of maximum likelihood estimation in ERGMs, and discuss some possible constructive responses. PMID:26166910

Network sampling coverage II: The effect of non-random missing data on network measurement

PubMed Central

Smith, Jeffrey A.; Moody, James; Morgan, Jonathan

2016-01-01

Missing data is an important, but often ignored, aspect of a network study. Measurement validity is affected by missing data, but the level of bias can be difficult to gauge. Here, we describe the effect of missing data on network measurement across widely different circumstances. In Part I of this study (Smith and Moody, 2013), we explored the effect of measurement bias due to randomly missing nodes. Here, we drop the assumption that data are missing at random: what happens to estimates of key network statistics when central nodes are more/less likely to be missing? We answer this question using a wide range of empirical networks and network measures. We find that bias is worse when more central nodes are missing. With respect to network measures, Bonacich centrality is highly sensitive to the loss of central nodes, while closeness centrality is not; distance and bicomponent size are more affected than triad summary measures and behavioral homophily is more robust than degree-homophily. With respect to types of networks, larger, directed networks tend to be more robust, but the relation is weak. We end the paper with a practical application, showing how researchers can use our results (translated into a publically available java application) to gauge the bias in their own data. PMID:27867254

Network sampling coverage II: The effect of non-random missing data on network measurement.

PubMed

Smith, Jeffrey A; Moody, James; Morgan, Jonathan

2017-01-01

Missing data is an important, but often ignored, aspect of a network study. Measurement validity is affected by missing data, but the level of bias can be difficult to gauge. Here, we describe the effect of missing data on network measurement across widely different circumstances. In Part I of this study (Smith and Moody, 2013), we explored the effect of measurement bias due to randomly missing nodes. Here, we drop the assumption that data are missing at random: what happens to estimates of key network statistics when central nodes are more/less likely to be missing? We answer this question using a wide range of empirical networks and network measures. We find that bias is worse when more central nodes are missing. With respect to network measures, Bonacich centrality is highly sensitive to the loss of central nodes, while closeness centrality is not; distance and bicomponent size are more affected than triad summary measures and behavioral homophily is more robust than degree-homophily. With respect to types of networks, larger, directed networks tend to be more robust, but the relation is weak. We end the paper with a practical application, showing how researchers can use our results (translated into a publically available java application) to gauge the bias in their own data.

Programmable disorder in random DNA tilings

NASA Astrophysics Data System (ADS)

Tikhomirov, Grigory; Petersen, Philip; Qian, Lulu

2017-03-01

Scaling up the complexity and diversity of synthetic molecular structures will require strategies that exploit the inherent stochasticity of molecular systems in a controlled fashion. Here we demonstrate a framework for programming random DNA tilings and show how to control the properties of global patterns through simple, local rules. We constructed three general forms of planar network—random loops, mazes and trees—on the surface of self-assembled DNA origami arrays on the micrometre scale with nanometre resolution. Using simple molecular building blocks and robust experimental conditions, we demonstrate control of a wide range of properties of the random networks, including the branching rules, the growth directions, the proximity between adjacent networks and the size distribution. Much as combinatorial approaches for generating random one-dimensional chains of polymers have been used to revolutionize chemical synthesis and the selection of functional nucleic acids, our strategy extends these principles to random two-dimensional networks of molecules and creates new opportunities for fabricating more complex molecular devices that are organized by DNA nanostructures.

T-cell movement on the reticular network.

PubMed

Donovan, Graham M; Lythe, Grant

2012-02-21

The idea that the apparently random motion of T cells in lymph nodes is a result of movement on a reticular network (RN) has received support from dynamic imaging experiments and theoretical studies. We present a mathematical representation of the RN consisting of edges connecting vertices that are randomly distributed in three-dimensional space, and models of lymphocyte movement on such networks including constant speed motion along edges and Brownian motion, not in three-dimensions, but only along edges. The simplest model, in which a cell moves with a constant speed along edges, is consistent with mean-squared displacement proportional to time over intervals long enough to include several changes of direction. A non-random distribution of turning angles is one consequence of motion on a preformed network. Confining cell movement to a network does not, in itself, increase the frequency of cell-cell encounters. Copyright © 2011 Elsevier Ltd. All rights reserved.

Accountability for Information Flow via Explicit Formal Proof

DTIC Science & Technology

2009-10-01

macrobenchmarks. The first (called OpenSSL in the table below), unpacks the OpenSSL source code, compiles it and deletes it. The other (called Fuse in...penalty for PCFS as compared to Fuse/Null is approximately 10% for OpenSSL , and 2.5% for Fuse. The difference arises because the OpenSSL benchmark depends...Macrobenchmarks Benchmark PCFS Fuse/Null Ext3 OpenSSL 126 114 94 Fuse x 5 79 77 70 15 In summary, assuming a low rate of cache misses, the

Dynamical influence processes on networks: general theory and applications to social contagion.

PubMed

Harris, Kameron Decker; Danforth, Christopher M; Dodds, Peter Sheridan

2013-08-01

We study binary state dynamics on a network where each node acts in response to the average state of its neighborhood. By allowing varying amounts of stochasticity in both the network and node responses, we find different outcomes in random and deterministic versions of the model. In the limit of a large, dense network, however, we show that these dynamics coincide. We construct a general mean-field theory for random networks and show this predicts that the dynamics on the network is a smoothed version of the average response function dynamics. Thus, the behavior of the system can range from steady state to chaotic depending on the response functions, network connectivity, and update synchronicity. As a specific example, we model the competing tendencies of imitation and nonconformity by incorporating an off-threshold into standard threshold models of social contagion. In this way, we attempt to capture important aspects of fashions and societal trends. We compare our theory to extensive simulations of this "limited imitation contagion" model on Poisson random graphs, finding agreement between the mean-field theory and stochastic simulations.

Research on Some Bus Transport Networks with Random Overlapping Clique Structure

NASA Astrophysics Data System (ADS)

Yang, Xu-Hua; Wang, Bo; Wang, Wan-Liang; Sun, You-Xian

2008-11-01

On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs.

Finite plateau in spectral gap of polychromatic constrained random networks

NASA Astrophysics Data System (ADS)

Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

2017-12-01

We consider critical behavior in the ensemble of polychromatic Erdős-Rényi networks and regular random graphs, where network vertices are painted in different colors. The links can be randomly removed and added to the network subject to the condition of the vertex degree conservation. In these constrained graphs we run the Metropolis procedure, which favors the connected unicolor triads of nodes. Changing the chemical potential, μ , of such triads, for some wide region of μ , we find the formation of a finite plateau in the number of intercolor links, which exactly matches the finite plateau in the network algebraic connectivity (the value of the first nonvanishing eigenvalue of the Laplacian matrix, λ2). We claim that at the plateau the spontaneously broken Z2 symmetry is restored by the mechanism of modes collectivization in clusters of different colors. The phenomena of a finite plateau formation holds also for polychromatic networks with M ≥2 colors. The behavior of polychromatic networks is analyzed via the spectral properties of their adjacency and Laplacian matrices.

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual

PubMed Central

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P.; Pringle, Anne

2013-01-01

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual. PMID:23898203

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual.

PubMed

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P; Pringle, Anne

2013-08-13

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual.

Projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random networks.

PubMed

Feng, Cun-Fang; Xu, Xin-Jian; Wang, Sheng-Jun; Wang, Ying-Hai

2008-06-01

We study projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random networks. We relax some limitations of previous work, where projective-anticipating and projective-lag synchronization can be achieved only on two coupled chaotic systems. In this paper, we realize projective-anticipating and projective-lag synchronization on complex dynamical networks composed of a large number of interconnected components. At the same time, although previous work studied projective synchronization on complex dynamical networks, the dynamics of the nodes are coupled partially linear chaotic systems. In this paper, the dynamics of the nodes of the complex networks are time-delayed chaotic systems without the limitation of the partial linearity. Based on the Lyapunov stability theory, we suggest a generic method to achieve the projective-anticipating, projective, and projective-lag synchronization of time-delayed chaotic systems on random dynamical networks, and we find both its existence and sufficient stability conditions. The validity of the proposed method is demonstrated and verified by examining specific examples using Ikeda and Mackey-Glass systems on Erdos-Renyi networks.

Random matrix theory for analyzing the brain functional network in attention deficit hyperactivity disorder

NASA Astrophysics Data System (ADS)

Wang, Rong; Wang, Li; Yang, Yong; Li, Jiajia; Wu, Ying; Lin, Pan

2016-11-01

Attention deficit hyperactivity disorder (ADHD) is the most common childhood neuropsychiatric disorder and affects approximately 6 -7 % of children worldwide. Here, we investigate the statistical properties of undirected and directed brain functional networks in ADHD patients based on random matrix theory (RMT), in which the undirected functional connectivity is constructed based on correlation coefficient and the directed functional connectivity is measured based on cross-correlation coefficient and mutual information. We first analyze the functional connectivity and the eigenvalues of the brain functional network. We find that ADHD patients have increased undirected functional connectivity, reflecting a higher degree of linear dependence between regions, and increased directed functional connectivity, indicating stronger causality and more transmission of information among brain regions. More importantly, we explore the randomness of the undirected and directed functional networks using RMT. We find that for ADHD patients, the undirected functional network is more orderly than that for normal subjects, which indicates an abnormal increase in undirected functional connectivity. In addition, we find that the directed functional networks are more random, which reveals greater disorder in causality and more chaotic information flow among brain regions in ADHD patients. Our results not only further confirm the efficacy of RMT in characterizing the intrinsic properties of brain functional networks but also provide insights into the possibilities RMT offers for improving clinical diagnoses and treatment evaluations for ADHD patients.

Distributed clone detection in static wireless sensor networks: random walk with network division.

PubMed

Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M

2015-01-01

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads.

Social power and opinion formation in complex networks

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2013-02-01

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

NASA Technical Reports Server (NTRS)

Kuhn, D. Richard; Kacker, Raghu; Lei, Yu

2010-01-01

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

Spectra of random networks in the weak clustering regime

NASA Astrophysics Data System (ADS)

Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen; Rodrigues, Francisco A.

2018-03-01

The asymptotic behavior of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of traditional configuration models, networks generated through these models fail to describe many topological features of real-world networks, in particular non-null values of the clustering coefficient. Here we study effects of cycles of order three (triangles) in network spectra. By using recent advances in random matrix theory, we determine the spectral distribution of the network adjacency matrix as a function of the average number of triangles attached to each node for networks without modular structure and degree-degree correlations. Implications to network dynamics are discussed. Our findings can shed light in the study of how particular kinds of subgraphs influence network dynamics.

Spectral statistics of random geometric graphs

NASA Astrophysics Data System (ADS)

Dettmann, C. P.; Georgiou, O.; Knight, G.

2017-04-01

We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short-range correlations in the level spacings of the spectrum via the nearest-neighbour and next-nearest-neighbour spacing distribution and long-range correlations via the spectral rigidity Δ3 statistic. These correlations in the level spacings give information about localisation of eigenvectors, level of community structure and the level of randomness within the networks. We find a parameter-dependent transition between Poisson and Gaussian orthogonal ensemble statistics. That is the spectral statistics of spatial random geometric graphs fits the universality of random matrix theory found in other models such as Erdős-Rényi, Barabási-Albert and Watts-Strogatz random graphs.

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

NASA Astrophysics Data System (ADS)

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

2016-06-01

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

Randomizing growing networks with a time-respecting null model

NASA Astrophysics Data System (ADS)

Ren, Zhuo-Ming; Mariani, Manuel Sebastian; Zhang, Yi-Cheng; Medo, Matúš

2018-05-01

Complex networks are often used to represent systems that are not static but grow with time: People make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology—a time-respecting null model—that preserves both the network's degree sequence and the time evolution of individual nodes' degree values. By preserving the temporal linking patterns of the analyzed system, the proposed model is able to factor out the effect of the system's temporal patterns on its structure. We apply the model to the citation network of Physical Review scholarly papers and the citation network of US movies. The model reveals that the two data sets are strikingly different with respect to their degree-degree correlations, and we discuss the important implications of this finding on the information provided by paradigmatic node centrality metrics such as indegree and Google's PageRank. The randomization methodology proposed here can be used to assess the significance of any structural property in growing networks, which could bring new insights into the problems where null models play a critical role, such as the detection of communities and network motifs.

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

PubMed

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

2016-06-03

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

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

PubMed Central

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

2016-01-01

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

Controllability of social networks and the strategic use of random information.

PubMed

Cremonini, Marco; Casamassima, Francesca

2017-01-01

This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a time-varying adaptive network and considers two well-known strategies for influencing social contexts: One is the selection of few influencers for manipulating their actions in order to drive the whole network to a certain behavior; the other, instead, drives the network behavior acting on the state of a large subset of ordinary, scarcely influencing users. The two approaches have been studied in terms of network and diffusion effects. The network effect is analyzed through the changes induced on network average degree and clustering coefficient, while the diffusion effect is based on two ad hoc metrics which are defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of agent interests. The results, obtained through simulations on synthetic networks, show a rich dynamics and strong effects on the communication structure and on the distribution of knowledge and skills. These findings support our hypothesis that the strategic use of random information could represent a realistic approach to social network controllability, and that with both strategies, in principle, the control effect could be remarkable.

Random Resistor Network Model of Minimal Conductivity in Graphene

NASA Astrophysics Data System (ADS)

Cheianov, Vadim V.; Fal'Ko, Vladimir I.; Altshuler, Boris L.; Aleiner, Igor L.

2007-10-01

Transport in undoped graphene is related to percolating current patterns in the networks of n- and p-type regions reflecting the strong bipolar charge density fluctuations. Finite transparency of the p-n junctions is vital in establishing the macroscopic conductivity. We propose a random resistor network model to analyze scaling dependencies of the conductance on the doping and disorder, the quantum magnetoresistance and the corresponding dephasing rate.

Enhanced Precision Geolocation in 4G Wireless Networks

DTIC Science & Technology

2013-03-01

years has implemented a National Emergency Warning System using text messages delivered to cell phones [5]. The November 1999 FCC E911 regulations...statistical theory of passive geolocation of emitters may be found in [18]. Papers that survey methods of geolocation applied to cell phones include [4...where to put the tower % n: which tower to place %randomTowers(obj,dispersion, seperation ): generates % random towers for the network % obj: the network

Deep Convolutional and LSTM Recurrent Neural Networks for Multimodal Wearable Activity Recognition.

PubMed

Ordóñez, Francisco Javier; Roggen, Daniel

2016-01-18

Human activity recognition (HAR) tasks have traditionally been solved using engineered features obtained by heuristic processes. Current research suggests that deep convolutional neural networks are suited to automate feature extraction from raw sensor inputs. However, human activities are made of complex sequences of motor movements, and capturing this temporal dynamics is fundamental for successful HAR. Based on the recent success of recurrent neural networks for time series domains, we propose a generic deep framework for activity recognition based on convolutional and LSTM recurrent units, which: (i) is suitable for multimodal wearable sensors; (ii) can perform sensor fusion naturally; (iii) does not require expert knowledge in designing features; and (iv) explicitly models the temporal dynamics of feature activations. We evaluate our framework on two datasets, one of which has been used in a public activity recognition challenge. Our results show that our framework outperforms competing deep non-recurrent networks on the challenge dataset by 4% on average; outperforming some of the previous reported results by up to 9%. Our results show that the framework can be applied to homogeneous sensor modalities, but can also fuse multimodal sensors to improve performance. We characterise key architectural hyperparameters' influence on performance to provide insights about their optimisation.

Fundamental Use of Surgical Energy (FUSE) certification: validation and predictors of success.

PubMed

Robinson, Thomas N; Olasky, Jaisa; Young, Patricia; Feldman, Liane S; Fuchshuber, Pascal R; Jones, Stephanie B; Madani, Amin; Brunt, Michael; Mikami, Dean; Jackson, Gretchen P; Mischna, Jessica; Schwaitzberg, Steven; Jones, Daniel B

2016-03-01

The Fundamental Use of Surgical Energy (FUSE) program includes a Web-based didactic curriculum and a high-stakes multiple-choice question examination with the goal to provide certification of knowledge on the safe use of surgical energy-based devices. The purpose of this study was (1) to set a passing score through a psychometrically sound process and (2) to determine what pretest factors predicted passing the FUSE examination. Beta-testing of multiple-choice questions on 62 topics of importance to the safe use of surgical energy-based devices was performed. Eligible test takers were physicians with a minimum of 1 year of surgical training who were recruited by FUSE task force members. A pretest survey collected baseline information. A total of 227 individuals completed the FUSE beta-test, and 208 completed the pretest survey. The passing/cut score for the first test form of the FUSE multiple-choice examination was determined using the modified Angoff methodology and for the second test form was determined using a linear equating methodology. The overall passing rate across the two examination forms was 81.5%. Self-reported time studying the FUSE Web-based curriculum for a minimum of >2 h was associated with a passing examination score (p < 0.001). Performance was not different based on increased years of surgical practice (p = 0.363), self-reported expertise on one or more types of energy-based devices (p = 0.683), participation in the FUSE postgraduate course (p = 0.426), or having reviewed the FUSE manual (p = 0.428). Logistic regression found that studying the FUSE didactics for >2 h predicted a passing score (OR 3.61; 95% CI 1.44-9.05; p = 0.006) independent of the other baseline characteristics recorded. The development of the FUSE examination, including the passing score, followed a psychometrically sound process. Self-reported time studying the FUSE curriculum predicted a passing score independent of other pretest characteristics such as years in practice and self-reported expertise.

The research progress of large-aperture fused silica for high power laser

NASA Astrophysics Data System (ADS)

Shao, Zhufeng; Wang, Yufen; Xiang, Zaikui; Rao, Chuandong

2016-03-01

Because of its excellent optical performance, the fused silica is widely used in laser industry. In addition, the fused silica can withstand high power laser, due to its pure component, and the performance is most outstanding within all types of glasses. So fused silica can be used for optical lens in high power laser field. From the manufacturing process stand point, the fused silica can be categorized to four types: type Ⅰ, type Ⅱ, type Ⅲ, and type Ⅳ. The fused silica of type Ⅰand type Ⅱ is made through melting silica sand in graphite furnace or oxyhydrogen flame. There are many defects in these types of fused silica, for example, the air bubbles, inclusions and metallic impurity. The other two types are made by synthetic reaction of SiCl4 with water in oxyhydrogen or plasma flame. Both type Ⅲ and Ⅳ have excellent performance in transmittance and internal quality. However, type Ⅳof fused silica has disadvantage in small aperture and overall high manufacturing cost. Take the transmittance and internal quality into consideration, the type Ⅲ fused silica is the most suitable for large-aperture lens, and can withstand high power laser. The systemic studies of manufacturing process were done to improve the performance of type Ⅲ fused silica in various areas, for instance, the optical homogeneity, the stress birefringence, the absorption coefficient and the damage threshold. There are four steps in manufacturing process of type Ⅲ fused silica, ingot production, reshaping, annealing and cold-working. The critical factors of ingot production, like the flame of burner and the structure of furnace, were deeply studied in this paper to improve the performance of fused silica. On the basis of the above research, the performance and quality of the fused silica measured up to advanced world levels. For instance, the result of optical homogeneity can be controlled to 2-5 ppm, the stress birefringence is better than 4 nm/cm, the absorption coefficient is about 5.971ppm cm-1 (1ω), the damage threshold is greater than 80, 25 and 23 J/cm2 with the wavelength at 1064, 532 and 351nm respectively, the bandwidth used for measuring is 3ns.The fused silica has already been used in the area of high power laser facilities, aerospace industry, primary lens of interferometer based on its excellent performance.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

DOEpatents

Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

2010-11-23

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

Oscillations and chaos in neural networks: an exactly solvable model.

PubMed Central

Wang, L P; Pichler, E E; Ross, J

1990-01-01

We consider a randomly diluted higher-order network with noise, consisting of McCulloch-Pitts neurons that interact by Hebbian-type connections. For this model, exact dynamical equations are derived and solved for both parallel and random sequential updating algorithms. For parallel dynamics, we find a rich spectrum of different behaviors including static retrieving and oscillatory and chaotic phenomena in different parts of the parameter space. The bifurcation parameters include first- and second-order neuronal interaction coefficients and a rescaled noise level, which represents the combined effects of the random synaptic dilution, interference between stored patterns, and additional background noise. We show that a marked difference in terms of the occurrence of oscillations or chaos exists between neural networks with parallel and random sequential dynamics. Images PMID:2251287

Social patterns revealed through random matrix theory

NASA Astrophysics Data System (ADS)

Sarkar, Camellia; Jalan, Sarika

2014-11-01

Despite the tremendous advancements in the field of network theory, very few studies have taken weights in the interactions into consideration that emerge naturally in all real-world systems. Using random matrix analysis of a weighted social network, we demonstrate the profound impact of weights in interactions on emerging structural properties. The analysis reveals that randomness existing in particular time frame affects the decisions of individuals rendering them more freedom of choice in situations of financial security. While the structural organization of networks remains the same throughout all datasets, random matrix theory provides insight into the interaction pattern of individuals of the society in situations of crisis. It has also been contemplated that individual accountability in terms of weighted interactions remains as a key to success unless segregation of tasks comes into play.

Phthalocyanine based metal containing porous carbon sheet

NASA Astrophysics Data System (ADS)

Honda, Z.; Sakaguchi, Y.; Tashiro, M.; Hagiwara, M.; Kida, T.; Sakai, M.; Fukuda, T.; Kamata, N.

2017-03-01

Highly-ordered fused-ring poly copper phthalocyanine (PCuPc) was prepared using copper octacyanophthalocyanine as a building block, and two-dimensional (2D) square superlattices were directly observed by the transmission electron microscopy. Remarkably, we have found a formation of polymer network that consists of a 2D porous PCuPc sheet in which the centers of phthalocyanine units are alternately occupied by Cu atom and vacancy. Using this "half-filling" PCuPc, it must be possible to create alternating arrangements for transition metal centers, and therefore control the magnetic properties of the 2D carbon sheets.

9-(3,4-Dimeth­oxy­phen­yl)-3,4,5,6,7,9-hexa­hydroxanthene-1,8(2H)-dione

PubMed Central

Mehdi, Sayed Hasan; Hashim, Rokiah; Ghalib, Raza Murad; Yeap, Chin Sing; Fun, Hoong-Kun

2011-01-01

In the title compound, C21H22O5, the mean planes of the pyran and dimeth­oxy­phenyl rings are nearly perpendicular to one another, with the dihedral angle between them being 88.21 (8)°. The pyran ring adopts a boat conformation whereas the two fused cyclo­hexane rings adopt envelope conformations. In the crystal, mol­ecules are linked into a three-dimensional network by inter­molecular C—H⋯O hydrogen bonds. PMID:21754824

An Ultrasensitive Bacterial Motor Revealed by Monitoring Signaling Proteins in Single Cells

NASA Astrophysics Data System (ADS)

Cluzel, Philippe; Surette, Michael; Leibler, Stanislas

2000-03-01

Understanding biology at the single-cell level requires simultaneous measurements of biochemical parameters and behavioral characteristics in individual cells. Here, the output of individual flagellar motors in Escherichia coli was measured as a function of the intracellular concentration of the chemotactic signaling protein. The concentration of this molecule, fused to green fluorescent protein, was monitored with fluorescence correlation spectroscopy. Motors from different bacteria exhibited an identical steep input-output relation, suggesting that they actively contribute to signal amplification in chemotaxis. This experimental approach can be extended to quantitative in vivo studies of other biochemical networks.

Analytic method for calculating properties of random walks on networks

NASA Technical Reports Server (NTRS)

Goldhirsch, I.; Gefen, Y.

1986-01-01

A method for calculating the properties of discrete random walks on networks is presented. The method divides complex networks into simpler units whose contribution to the mean first-passage time is calculated. The simplified network is then further iterated. The method is demonstrated by calculating mean first-passage times on a segment, a segment with a single dangling bond, a segment with many dangling bonds, and a looplike structure. The results are analyzed and related to the applicability of the Einstein relation between conductance and diffusion.

Robustness and structure of complex networks

NASA Astrophysics Data System (ADS)

Shao, Shuai

This dissertation covers the two major parts of my PhD research on statistical physics and complex networks: i) modeling a new type of attack -- localized attack, and investigating robustness of complex networks under this type of attack; ii) discovering the clustering structure in complex networks and its influence on the robustness of coupled networks. Complex networks appear in every aspect of our daily life and are widely studied in Physics, Mathematics, Biology, and Computer Science. One important property of complex networks is their robustness under attacks, which depends crucially on the nature of attacks and the structure of the networks themselves. Previous studies have focused on two types of attack: random attack and targeted attack, which, however, are insufficient to describe many real-world damages. Here we propose a new type of attack -- localized attack, and study the robustness of complex networks under this type of attack, both analytically and via simulation. On the other hand, we also study the clustering structure in the network, and its influence on the robustness of a complex network system. In the first part, we propose a theoretical framework to study the robustness of complex networks under localized attack based on percolation theory and generating function method. We investigate the percolation properties, including the critical threshold of the phase transition pc and the size of the giant component Pinfinity. We compare localized attack with random attack and find that while random regular (RR) networks are more robust against localized attack, Erdoḧs-Renyi (ER) networks are equally robust under both types of attacks. As for scale-free (SF) networks, their robustness depends crucially on the degree exponent lambda. The simulation results show perfect agreement with theoretical predictions. We also test our model on two real-world networks: a peer-to-peer computer network and an airline network, and find that the real-world networks are much more vulnerable to localized attack compared with random attack. In the second part, we extend the tree-like generating function method to incorporating clustering structure in complex networks. We study the robustness of a complex network system, especially a network of networks (NON) with clustering structure in each network. We find that the system becomes less robust as we increase the clustering coefficient of each network. For a partially dependent network system, we also find that the influence of the clustering coefficient on network robustness decreases as we decrease the coupling strength, and the critical coupling strength qc, at which the first-order phase transition changes to second-order, increases as we increase the clustering coefficient.

Robustness analysis of interdependent networks under multiple-attacking strategies

NASA Astrophysics Data System (ADS)

Gao, Yan-Li; Chen, Shi-Ming; Nie, Sen; Ma, Fei; Guan, Jun-Jie

2018-04-01

The robustness of complex networks under attacks largely depends on the structure of a network and the nature of the attacks. Previous research on interdependent networks has focused on two types of initial attack: random attack and degree-based targeted attack. In this paper, a deliberate attack function is proposed, where six kinds of deliberate attacking strategies can be derived by adjusting the tunable parameters. Moreover, the robustness of four types of interdependent networks (BA-BA, ER-ER, BA-ER and ER-BA) with different coupling modes (random, positive and negative correlation) is evaluated under different attacking strategies. Interesting conclusions could be obtained. It can be found that the positive coupling mode can make the vulnerability of the interdependent network to be absolutely dependent on the most vulnerable sub-network under deliberate attacks, whereas random and negative coupling modes make the vulnerability of interdependent network to be mainly dependent on the being attacked sub-network. The robustness of interdependent network will be enhanced with the degree-degree correlation coefficient varying from positive to negative. Therefore, The negative coupling mode is relatively more optimal than others, which can substantially improve the robustness of the ER-ER network and ER-BA network. In terms of the attacking strategies on interdependent networks, the degree information of node is more valuable than the betweenness. In addition, we found a more efficient attacking strategy for each coupled interdependent network and proposed the corresponding protection strategy for suppressing cascading failure. Our results can be very useful for safety design and protection of interdependent networks.

Network meta-analysis, electrical networks and graph theory.

PubMed

Rücker, Gerta

2012-12-01

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

31 CFR 100.12 - Exchange of fused and mixed coins.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 31 Money and Finance: Treasury 1 2014-07-01 2014-07-01 false Exchange of fused and mixed coins... of fused and mixed coins. (a) Definitions. (1) Fused coins are U.S. coins which are melted to the....S. coins. (2) Mixed coins are U.S. coins of several alloy categories which are presented together...

31 CFR 100.12 - Exchange of fused and mixed coins.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 31 Money and Finance: Treasury 1 2011-07-01 2011-07-01 false Exchange of fused and mixed coins... of fused and mixed coins. (a) Definitions. (1) Fused coins are U.S. coins which are melted to the....S. coins. (2) Mixed coins are U.S. coins of several alloy categories which are presented together...

31 CFR 100.12 - Exchange of fused and mixed coins.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 31 Money and Finance: Treasury 1 2012-07-01 2012-07-01 false Exchange of fused and mixed coins... of fused and mixed coins. (a) Definitions. (1) Fused coins are U.S. coins which are melted to the....S. coins. (2) Mixed coins are U.S. coins of several alloy categories which are presented together...

31 CFR 100.12 - Exchange of fused and mixed coins.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 31 Money and Finance: Treasury 1 2013-07-01 2013-07-01 false Exchange of fused and mixed coins... of fused and mixed coins. (a) Definitions. (1) Fused coins are U.S. coins which are melted to the....S. coins. (2) Mixed coins are U.S. coins of several alloy categories which are presented together...

Development of Fuses for Protection of Geiger-Mode Avalanche Photodiode Arrays

NASA Astrophysics Data System (ADS)

Grzesik, Michael; Bailey, Robert; Mahan, Joe; Ampe, Jim

2015-11-01

Current-limiting fuses composed of Ti/Al/Ni were developed for use in Geiger-mode avalanche photodiode arrays for each individual pixel in the array. The fuses were designed to burn out at ˜4.5 × 10-3 A and maintain post-burnout leakage currents less than 10-7 A at 70 V sustained for several minutes. Experimental fuse data are presented and successful incorporation of the fuses into a 256 × 64 pixel InP-based Geiger-mode avalanche photodiode array is reported.

Integrated fuses for OLED lighting device

DOEpatents

Pschenitzka, Florian [San Jose, CA

2007-07-10

An embodiment of the present invention pertains to an electroluminescent lighting device for area illumination. The lighting device is fault tolerant due, in part, to the patterning of one or both of the electrodes into strips, and each of one or more of these strips has a fuse formed on it. The fuses are integrated on the substrate. By using the integrated fuses, the number of external contacts that are used is minimized. The fuse material is deposited using one of the deposition techniques that is used to deposit the thin layers of the electroluminescent lighting device.

On the estimation variance for the specific Euler-Poincaré characteristic of random networks.

PubMed

Tscheschel, A; Stoyan, D

2003-07-01

The specific Euler number is an important topological characteristic in many applications. It is considered here for the case of random networks, which may appear in microscopy either as primary objects of investigation or as secondary objects describing in an approximate way other structures such as, for example, porous media. For random networks there is a simple and natural estimator of the specific Euler number. For its estimation variance, a simple Poisson approximation is given. It is based on the general exact formula for the estimation variance. In two examples of quite different nature and topology application of the formulas is demonstrated.

Relaxation dynamics of maximally clustered networks

NASA Astrophysics Data System (ADS)

Klaise, Janis; Johnson, Samuel

2018-01-01

We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics—the double-edge swap, corresponding to degree-preserving randomization of the configuration model, and single edge replacement, corresponding to full randomization of the Erdős-Rényi random graph. We derive expressions for the time evolution of the degree distribution, edge multiplicity distribution and clustering coefficient. We show that under both dynamics networks undergo a continuous phase transition in which a giant connected component is formed. We calculate the position of the phase transition analytically using the Erdős-Rényi phenomenology.

Ryu-Takayanagi formula for symmetric random tensor networks

NASA Astrophysics Data System (ADS)

Chirco, Goffredo; Oriti, Daniele; Zhang, Mingyi

2018-06-01

We consider the special case of random tensor networks (RTNs) endowed with gauge symmetry constraints on each tensor. We compute the Rényi entropy for such states and recover the Ryu-Takayanagi (RT) formula in the large-bond regime. The result provides first of all an interesting new extension of the existing derivations of the RT formula for RTNs. Moreover, this extension of the RTN formalism brings it in direct relation with (tensorial) group field theories (and spin networks), and thus provides new tools for realizing the tensor network/geometry duality in the context of background-independent quantum gravity, and for importing quantum gravity tools into tensor network research.

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

PubMed

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

2016-10-01

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

Autocatalytic polymerization generates persistent random walk of crawling cells.

PubMed

Sambeth, R; Baumgaertner, A

2001-05-28

The autocatalytic polymerization kinetics of the cytoskeletal actin network provides the basic mechanism for a persistent random walk of a crawling cell. It is shown that network remodeling by branching processes near the cell membrane is essential for the bimodal spatial stability of the network which induces a spontaneous breaking of isotropic cell motion. Details of the phenomena are analyzed using a simple polymerization model studied by analytical and simulation methods.

Recovery of infrastructure networks after localised attacks.

PubMed

Hu, Fuyu; Yeung, Chi Ho; Yang, Saini; Wang, Weiping; Zeng, An

2016-04-14

The stability of infrastructure network is always a critical issue studied by researchers in different fields. A lot of works have been devoted to reveal the robustness of the infrastructure networks against random and malicious attacks. However, real attack scenarios such as earthquakes and typhoons are instead localised attacks which are investigated only recently. Unlike previous studies, we examine in this paper the resilience of infrastructure networks by focusing on the recovery process from localised attacks. We introduce various preferential repair strategies and found that they facilitate and improve network recovery compared to that of random repairs, especially when population size is uneven at different locations. Moreover, our strategic repair methods show similar effectiveness as the greedy repair. The validations are conducted on simulated networks, and on real networks with real disasters. Our method is meaningful in practice as it can largely enhance network resilience and contribute to network risk reduction.

Describing spatial pattern in stream networks: A practical approach

USGS Publications Warehouse

Ganio, L.M.; Torgersen, C.E.; Gresswell, R.E.

2005-01-01

The shape and configuration of branched networks influence ecological patterns and processes. Recent investigations of network influences in riverine ecology stress the need to quantify spatial structure not only in a two-dimensional plane, but also in networks. An initial step in understanding data from stream networks is discerning non-random patterns along the network. On the other hand, data collected in the network may be spatially autocorrelated and thus not suitable for traditional statistical analyses. Here we provide a method that uses commercially available software to construct an empirical variogram to describe spatial pattern in the relative abundance of coastal cutthroat trout in headwater stream networks. We describe the mathematical and practical considerations involved in calculating a variogram using a non-Euclidean distance metric to incorporate the network pathway structure in the analysis of spatial variability, and use a non-parametric technique to ascertain if the pattern in the empirical variogram is non-random.

A geostatistical approach for describing spatial pattern in stream networks

USGS Publications Warehouse

Ganio, L.M.; Torgersen, C.E.; Gresswell, R.E.

2005-01-01

The shape and configuration of branched networks influence ecological patterns and processes. Recent investigations of network influences in riverine ecology stress the need to quantify spatial structure not only in a two-dimensional plane, but also in networks. An initial step in understanding data from stream networks is discerning non-random patterns along the network. On the other hand, data collected in the network may be spatially autocorrelated and thus not suitable for traditional statistical analyses. Here we provide a method that uses commercially available software to construct an empirical variogram to describe spatial pattern in the relative abundance of coastal cutthroat trout in headwater stream networks. We describe the mathematical and practical considerations involved in calculating a variogram using a non-Euclidean distance metric to incorporate the network pathway structure in the analysis of spatial variability, and use a non-parametric technique to ascertain if the pattern in the empirical variogram is non-random.

Recovery of infrastructure networks after localised attacks

PubMed Central

Hu, Fuyu; Yeung, Chi Ho; Yang, Saini; Wang, Weiping; Zeng, An

2016-01-01

The stability of infrastructure network is always a critical issue studied by researchers in different fields. A lot of works have been devoted to reveal the robustness of the infrastructure networks against random and malicious attacks. However, real attack scenarios such as earthquakes and typhoons are instead localised attacks which are investigated only recently. Unlike previous studies, we examine in this paper the resilience of infrastructure networks by focusing on the recovery process from localised attacks. We introduce various preferential repair strategies and found that they facilitate and improve network recovery compared to that of random repairs, especially when population size is uneven at different locations. Moreover, our strategic repair methods show similar effectiveness as the greedy repair. The validations are conducted on simulated networks, and on real networks with real disasters. Our method is meaningful in practice as it can largely enhance network resilience and contribute to network risk reduction. PMID:27075559

The SAGES Fundamental Use of Surgical Energy program (FUSE): history, development, and purpose.

PubMed

Fuchshuber, P; Schwaitzberg, S; Jones, D; Jones, S B; Feldman, L; Munro, M; Robinson, T; Purcell-Jackson, G; Mikami, D; Madani, A; Brunt, M; Dunkin, B; Gugliemi, C; Groah, L; Lim, R; Mischna, J; Voyles, C R

2018-06-01

Adverse events due to energy device use in surgical operating rooms are a daily occurrence. These occur at a rate of approximately 1-2 per 1000 operations. Hundreds of operating room fires occur each year in the United States, some causing severe injury and even mortality. The Society of American Gastrointestinal and Endoscopic Surgeons (SAGES) therefore created the first comprehensive educational curriculum on the safe use of surgical energy devices, called Fundamental Use of Surgical Energy (FUSE). This paper describes the history, development, and purpose of this important training program for all members of the operating room team. The databases of SAGES and the FUSE committee as well as personal photographs and documents of members of the FUSE task force were used to establish a brief history of the FUSE program from its inception to its current status. The authors were able to detail all aspects of the history, development, and national as well as global implementation of the third SAGES Fundamentals Program FUSE. The written documentation of the making of FUSE is an important contribution to the history and mission of SAGES and allows the reader to understand the idea, concept, realization, and implementation of the only free online educational tool for physicians on energy devices available today. FUSE is the culmination of the SAGES efforts to recognize gaps in patient safety and develop state-of-the-art educational programs to address those gaps. It is the goal of the FUSE task force to ensure that general FUSE implementation becomes multinational, involving as many countries as possible.

Convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks

NASA Astrophysics Data System (ADS)

Long, Yin; Zhang, Xiao-Jun; Wang, Kui

2018-05-01

In this paper, convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks (RBDNs) are studied. First, we find and demonstrate that the average degree is convergent in the form of power law. Meanwhile, we discover that the ratios of the back items to front items of convergent reminder are independent of network link number for large network size, and we theoretically prove that the limit of the ratio is a constant. Moreover, since it is difficult to calculate the analytical solution of the average degree for large network sizes, we adopt numerical method to obtain approximate expression of the average degree to approximate its analytical solution. Finally, simulations are presented to verify our theoretical results.

Predicting missing links via correlation between nodes

NASA Astrophysics Data System (ADS)

Liao, Hao; Zeng, An; Zhang, Yi-Cheng

2015-10-01

As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has been intensively investigated recently and many methods have been proposed so far. The essential challenge of link prediction is to estimate the similarity between nodes. Most of the existing methods are based on the common neighbor index and its variants. In this paper, we propose to calculate the similarity between nodes by the Pearson correlation coefficient. This method is found to be very effective when applied to calculate similarity based on high order paths. We finally fuse the correlation-based method with the resource allocation method, and find that the combined method can substantially outperform the existing methods, especially in sparse networks.

Markov logic network based complex event detection under uncertainty

NASA Astrophysics Data System (ADS)

Lu, Jingyang; Jia, Bin; Chen, Genshe; Chen, Hua-mei; Sullivan, Nichole; Pham, Khanh; Blasch, Erik

2018-05-01

In a cognitive reasoning system, the four-stage Observe-Orient-Decision-Act (OODA) reasoning loop is of interest. The OODA loop is essential for the situational awareness especially in heterogeneous data fusion. Cognitive reasoning for making decisions can take advantage of different formats of information such as symbolic observations, various real-world sensor readings, or the relationship between intelligent modalities. Markov Logic Network (MLN) provides mathematically sound technique in presenting and fusing data at multiple levels of abstraction, and across multiple intelligent sensors to conduct complex decision-making tasks. In this paper, a scenario about vehicle interaction is investigated, in which uncertainty is taken into consideration as no systematic approaches can perfectly characterize the complex event scenario. MLNs are applied to the terrestrial domain where the dynamic features and relationships among vehicles are captured through multiple sensors and information sources regarding the data uncertainty.

A Study of an Optical Lunar Surface Communications Network with High Bandwidth Direct to Earth Link

NASA Technical Reports Server (NTRS)

Wilson, K.; Biswas, A.; Schoolcraft, J.

2011-01-01

A lunar surface systems study explores the application of optical communications to support a high bandwidth data link from a lunar relay satellite and from fixed lunar assets. The results show that existing 1-m ground stations could provide more than 99% coverage of the lunar terminal at 100Mb/s data rates from a lunar relay satellite and in excess of 200Mb/s from a fixed terminal on the lunar surface. We have looked at the effects of the lunar regolith and its removal on optical samples. Our results indicate that under repeated dust removal episodes sapphire rather than fused silica would be a more durable material for optical surfaces. Disruption tolerant network protocols can minimize the data loss due to link dropouts. We report on the preliminary results of the DTN protocol implemented over the optical carrier.

Estimation of tool wear during CNC milling using neural network-based sensor fusion

NASA Astrophysics Data System (ADS)

Ghosh, N.; Ravi, Y. B.; Patra, A.; Mukhopadhyay, S.; Paul, S.; Mohanty, A. R.; Chattopadhyay, A. B.

2007-01-01

Cutting tool wear degrades the product quality in manufacturing processes. Monitoring tool wear value online is therefore needed to prevent degradation in machining quality. Unfortunately there is no direct way of measuring the tool wear online. Therefore one has to adopt an indirect method wherein the tool wear is estimated from several sensors measuring related process variables. In this work, a neural network-based sensor fusion model has been developed for tool condition monitoring (TCM). Features extracted from a number of machining zone signals, namely cutting forces, spindle vibration, spindle current, and sound pressure level have been fused to estimate the average flank wear of the main cutting edge. Novel strategies such as, signal level segmentation for temporal registration, feature space filtering, outlier removal, and estimation space filtering have been proposed. The proposed approach has been validated by both laboratory and industrial implementations.

Mapping organelle motion reveals a vesicular conveyor belt spatially replenishing secretory vesicles in stimulated chromaffin cells.

PubMed

Maucort, Guillaume; Kasula, Ravikiran; Papadopulos, Andreas; Nieminen, Timo A; Rubinsztein-Dunlop, Halina; Meunier, Frederic A

2014-01-01

How neurosecretory cells spatially adjust their secretory vesicle pools to replenish those that have fused and released their hormonal content is currently unknown. Here we designed a novel set of image analyses to map the probability of tracked organelles undergoing a specific type of movement (free, caged or directed). We then applied our analysis to time-lapse z-stack confocal imaging of secretory vesicles from bovine Chromaffin cells to map the global changes in vesicle motion and directionality occurring upon secretagogue stimulation. We report a defined region abutting the cortical actin network that actively transports secretory vesicles and is dissipated by actin and microtubule depolymerizing drugs. The directionality of this "conveyor belt" towards the cell surface is activated by stimulation. Actin and microtubule networks therefore cooperatively probe the microenvironment to transport secretory vesicles to the periphery, providing a mechanism whereby cells globally adjust their vesicle pools in response to secretagogue stimulation.

Kcnn4 Is a Regulator of Macrophage Multinucleation in Bone Homeostasis and Inflammatory Disease

PubMed Central

Kang, Heeseog; Kerloc’h, Audrey; Rotival, Maxime; Xu, Xiaoqing; Zhang, Qing; D’Souza, Zelpha; Kim, Michael; Scholz, Jodi Carlson; Ko, Jeong-Hun; Srivastava, Prashant K.; Genzen, Jonathan R.; Cui, Weiguo; Aitman, Timothy J.; Game, Laurence; Melvin, James E.; Hanidu, Adedayo; Dimock, Janice; Zheng, Jie; Souza, Donald; Behera, Aruna K.; Nabozny, Gerald; Cook, H. Terence; Bassett, J.H. Duncan; Williams, Graham R.; Li, Jun; Vignery, Agnès; Petretto, Enrico; Behmoaras, Jacques

2014-01-01

Summary Macrophages can fuse to form osteoclasts in bone or multinucleate giant cells (MGCs) as part of the immune response. We use a systems genetics approach in rat macrophages to unravel their genetic determinants of multinucleation and investigate their role in both bone homeostasis and inflammatory disease. We identify a trans-regulated gene network associated with macrophage multinucleation and Kcnn4 as being the most significantly trans-regulated gene in the network and induced at the onset of fusion. Kcnn4 is required for osteoclast and MGC formation in rodents and humans. Genetic deletion of Kcnn4 reduces macrophage multinucleation through modulation of Ca2+ signaling, increases bone mass, and improves clinical outcome in arthritis. Pharmacological blockade of Kcnn4 reduces experimental glomerulonephritis. Our data implicate Kcnn4 in macrophage multinucleation, identifying it as a potential therapeutic target for inhibition of bone resorption and chronic inflammation. PMID:25131209

Single-channel EEG-based mental fatigue detection based on deep belief network.

PubMed

Pinyi Li; Wenhui Jiang; Fei Su

2016-08-01

Mental fatigue has a pernicious influence on road and work place safety as well as a negative symptom of many acute and chronic illnesses, since the ability of concentrating, responding and judging quickly decreases during the fatigue or drowsiness stage. Electroencephalography (EEG) has been proven to be a robust physiological indicator of human cognitive state over the last few decades. But most existing EEG-based fatigue detection methods have poor performance in accuracy. This paper proposed a single-channel EEG-based mental fatigue detection method based on Deep Belief Network (DBN). The fused nonliear features from specified sub-bands and dynamic analysis, a total of 21 features are extracted as the input of the DBN to discriminate three classes of mental state including alert, slight fatigue and severe fatigue. Experimental results show the good performance of the proposed model comparing with those state-of-art methods.

ANNETTE Project: Contributing to The Nuclearization of Fusion

NASA Astrophysics Data System (ADS)

Ambrosini, W.; Cizelj, L.; Dieguez Porras, P.; Jaspers, R.; Noterdaeme, J.; Scheffer, M.; Schoenfelder, C.

2018-01-01

The ANNETTE Project (Advanced Networking for Nuclear Education and Training and Transfer of Expertise) is well underway, and one of its work packages addresses the design, development and implementation of nuclear fusion training. A systematic approach is used that leads to the development of new training courses, based on identified nuclear competences needs of the work force of (future) fusion reactors and on the current availability of suitable training courses. From interaction with stakeholders involved in the ITER design and construction or the JET D-T campaign, it became clear that the lack of nuclear safety culture awareness already has an impact on current projects. Through the collaboration between the European education networks in fission (ENEN) and fusion (FuseNet) in the ANNETTE project, this project is well positioned to support the development of nuclear competences for ongoing and future fusion projects. Thereby it will make a clear contribution to the realization of fusion energy.

Incorporating biological information in sparse principal component analysis with application to genomic data.

PubMed

Li, Ziyi; Safo, Sandra E; Long, Qi

2017-07-11

Sparse principal component analysis (PCA) is a popular tool for dimensionality reduction, pattern recognition, and visualization of high dimensional data. It has been recognized that complex biological mechanisms occur through concerted relationships of multiple genes working in networks that are often represented by graphs. Recent work has shown that incorporating such biological information improves feature selection and prediction performance in regression analysis, but there has been limited work on extending this approach to PCA. In this article, we propose two new sparse PCA methods called Fused and Grouped sparse PCA that enable incorporation of prior biological information in variable selection. Our simulation studies suggest that, compared to existing sparse PCA methods, the proposed methods achieve higher sensitivity and specificity when the graph structure is correctly specified, and are fairly robust to misspecified graph structures. Application to a glioblastoma gene expression dataset identified pathways that are suggested in the literature to be related with glioblastoma. The proposed sparse PCA methods Fused and Grouped sparse PCA can effectively incorporate prior biological information in variable selection, leading to improved feature selection and more interpretable principal component loadings and potentially providing insights on molecular underpinnings of complex diseases.

Fiber Fabry-Perot Interferometric Sensor for the Measurement of Electric Current Flowing through a Fuse

NASA Astrophysics Data System (ADS)

Park, Jaehee

2007-06-01

A fiber Fabry-Perot inteferometric sensor bonded close to a fusing element has been studied for the measurement of electric current flowing through a fuse. The phase shift of the sensor output signal is proportional to the square of the electric current passing through the fuse and the sensitivity is 0.827°/mA2.

Non-destructive evaluation of UV pulse laser-induced damage performance of fused silica optics.

PubMed

Huang, Jin; Wang, Fengrui; Liu, Hongjie; Geng, Feng; Jiang, Xiaodong; Sun, Laixi; Ye, Xin; Li, Qingzhi; Wu, Weidong; Zheng, Wanguo; Sun, Dunlu

2017-11-24

The surface laser damage performance of fused silica optics is related to the distribution of surface defects. In this study, we used chemical etching assisted by ultrasound and magnetorheological finishing to modify defect distribution in a fused silica surface, resulting in fused silica samples with different laser damage performance. Non-destructive test methods such as UV laser-induced fluorescence imaging and photo-thermal deflection were used to characterize the surface defects that contribute to the absorption of UV laser radiation. Our results indicate that the two methods can quantitatively distinguish differences in the distribution of absorptive defects in fused silica samples subjected to different post-processing steps. The percentage of fluorescence defects and the weak absorption coefficient were strongly related to the damage threshold and damage density of fused silica optics, as confirmed by the correlation curves built from statistical analysis of experimental data. The results show that non-destructive evaluation methods such as laser-induced fluorescence and photo-thermal absorption can be effectively applied to estimate the damage performance of fused silica optics at 351 nm pulse laser radiation. This indirect evaluation method is effective for laser damage performance assessment of fused silica optics prior to utilization.

[Effects of laser welding on bond of porcelain fused cast pure titanium].

PubMed

Zhu, Juan-fang; He, Hui-ming; Gao, Bo; Wang, Zhong-yi

2006-04-01

To investigate the influence of the laser welding on bond of porcelain fused to cast pure titanium. Twenty cast titanium plates were divided into two groups: laser welded group and control group. The low-fusing porcelain was fused to the laser welded cast pure titanium plates at fusion zone. The bond strength of the porcelain to laser welded cast pure titanium was measured by the three-point bending test. The interface of titanium and porcelain was investigated by scanning electron microscopy (SEM) and energy depressive X-ray detector (EDX). The non-welded titanium plates were used as comparison. No significant difference of the bond strength was found between laser-welded samples [(46.85 +/- 0.76) MPa] and the controls [(41.71 +/- 0.55) MPa] (P > 0.05). The SEM displayed the interface presented similar irregularities with a predominance. The titanium diffused to low-fusing porcelain, while silicon and aluminum diffused to titanium basement. Laser welding does not affect low-fusing porcelain fused to pure titanium.

Universal principles governing multiple random searchers on complex networks: The logarithmic growth pattern and the harmonic law

NASA Astrophysics Data System (ADS)

Weng, Tongfeng; Zhang, Jie; Small, Michael; Harandizadeh, Bahareh; Hui, Pan

2018-03-01

We propose a unified framework to evaluate and quantify the search time of multiple random searchers traversing independently and concurrently on complex networks. We find that the intriguing behaviors of multiple random searchers are governed by two basic principles—the logarithmic growth pattern and the harmonic law. Specifically, the logarithmic growth pattern characterizes how the search time increases with the number of targets, while the harmonic law explores how the search time of multiple random searchers varies relative to that needed by individual searchers. Numerical and theoretical results demonstrate these two universal principles established across a broad range of random search processes, including generic random walks, maximal entropy random walks, intermittent strategies, and persistent random walks. Our results reveal two fundamental principles governing the search time of multiple random searchers, which are expected to facilitate investigation of diverse dynamical processes like synchronization and spreading.

Analytical approach to cross-layer protocol optimization in wireless sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2008-04-01

In the distributed operations of route discovery and maintenance, strong interaction occurs across mobile ad hoc network (MANET) protocol layers. Quality of service (QoS) requirements of multimedia service classes must be satisfied by the cross-layer protocol, along with minimization of the distributed power consumption at nodes and along routes to battery-limited energy constraints. In previous work by the author, cross-layer interactions in the MANET protocol are modeled in terms of a set of concatenated design parameters and associated resource levels by multivariate point processes (MVPPs). Determination of the "best" cross-layer design is carried out using the optimal control of martingale representations of the MVPPs. In contrast to the competitive interaction among nodes in a MANET for multimedia services using limited resources, the interaction among the nodes of a wireless sensor network (WSN) is distributed and collaborative, based on the processing of data from a variety of sensors at nodes to satisfy common mission objectives. Sensor data originates at the nodes at the periphery of the WSN, is successively transported to other nodes for aggregation based on information-theoretic measures of correlation and ultimately sent as information to one or more destination (decision) nodes. The "multimedia services" in the MANET model are replaced by multiple types of sensors, e.g., audio, seismic, imaging, thermal, etc., at the nodes; the QoS metrics associated with MANETs become those associated with the quality of fused information flow, i.e., throughput, delay, packet error rate, data correlation, etc. Significantly, the essential analytical approach to MANET cross-layer optimization, now based on the MVPPs for discrete random events occurring in the WSN, can be applied to develop the stochastic characteristics and optimality conditions for cross-layer designs of sensor network protocols. Functional dependencies of WSN performance metrics are described in terms of the concatenated protocol parameters. New source-to-destination routes are sought that optimize cross-layer interdependencies to achieve the "best available" performance in the WSN. The protocol design, modified from a known reactive protocol, adapts the achievable performance to the transient network conditions and resource levels. Control of network behavior is realized through the conditional rates of the MVPPs. Optimal cross-layer protocol parameters are determined by stochastic dynamic programming conditions derived from models of transient packetized sensor data flows. Moreover, the defining conditions for WSN configurations, grouping sensor nodes into clusters and establishing data aggregation at processing nodes within those clusters, lead to computationally tractable solutions to the stochastic differential equations that describe network dynamics. Closed-form solution characteristics provide an alternative to the "directed diffusion" methods for resource-efficient WSN protocols published previously by other researchers. Performance verification of the resulting cross-layer designs is found by embedding the optimality conditions for the protocols in actual WSN scenarios replicated in a wireless network simulation environment. Performance tradeoffs among protocol parameters remain for a sequel to the paper.

Physical layer one-time-pad data encryption through synchronized semiconductor laser networks

NASA Astrophysics Data System (ADS)

Argyris, Apostolos; Pikasis, Evangelos; Syvridis, Dimitris

2016-02-01

Semiconductor lasers (SL) have been proven to be a key device in the generation of ultrafast true random bit streams. Their potential to emit chaotic signals under conditions with desirable statistics, establish them as a low cost solution to cover various needs, from large volume key generation to real-time encrypted communications. Usually, only undemanding post-processing is needed to convert the acquired analog timeseries to digital sequences that pass all established tests of randomness. A novel architecture that can generate and exploit these true random sequences is through a fiber network in which the nodes are semiconductor lasers that are coupled and synchronized to central hub laser. In this work we show experimentally that laser nodes in such a star network topology can synchronize with each other through complex broadband signals that are the seed to true random bit sequences (TRBS) generated at several Gb/s. The potential for each node to access real-time generated and synchronized with the rest of the nodes random bit streams, through the fiber optic network, allows to implement an one-time-pad encryption protocol that mixes the synchronized true random bit sequence with real data at Gb/s rates. Forward-error correction methods are used to reduce the errors in the TRBS and the final error rate at the data decoding level. An appropriate selection in the sampling methodology and properties, as well as in the physical properties of the chaotic seed signal through which network locks in synchronization, allows an error free performance.

Modeling and optimization of Quality of Service routing in Mobile Ad hoc Networks

NASA Astrophysics Data System (ADS)

Rafsanjani, Marjan Kuchaki; Fatemidokht, Hamideh; Balas, Valentina Emilia

2016-01-01

Mobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.

Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network Division

PubMed Central

Khan, Wazir Zada; Aalsalem, Mohammed Y.; Saad, N. M.

2015-01-01

Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads. PMID:25992913

Extreme events and event size fluctuations in biased random walks on networks.

PubMed

Kishore, Vimal; Santhanam, M S; Amritkar, R E

2012-05-01

Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the context of complex networks. This was motivated by the occurrence of rare events such as traffic jams, floods, and power blackouts which take place on networks. In this work, we study extreme events in a generalized random walk model in which the walk is preferentially biased by the network topology. The walkers preferentially choose to hop toward the hubs or small degree nodes. In this setting, we show that extremely large fluctuations in event sizes are possible on small degree nodes when the walkers are biased toward the hubs. In particular, we obtain the distribution of event sizes on the network. Further, the probability for the occurrence of extreme events on any node in the network depends on its "generalized strength," a measure of the ability of a node to attract walkers. The generalized strength is a function of the degree of the node and that of its nearest neighbors. We obtain analytical and simulation results for the probability of occurrence of extreme events on the nodes of a network using a generalized random walk model. The result reveals that the nodes with a larger value of generalized strength, on average, display lower probability for the occurrence of extreme events compared to the nodes with lower values of generalized strength.

The Cognitive Social Network in Dreams: Transitivity, Assortativity, and Giant Component Proportion Are Monotonic.

PubMed

Han, Hye Joo; Schweickert, Richard; Xi, Zhuangzhuang; Viau-Quesnel, Charles

2016-04-01

For five individuals, a social network was constructed from a series of his or her dreams. Three important network measures were calculated for each network: transitivity, assortativity, and giant component proportion. These were monotonically related; over the five networks as transitivity increased, assortativity increased and giant component proportion decreased. The relations indicate that characters appear in dreams systematically. Systematicity likely arises from the dreamer's memory of people and their relations, which is from the dreamer's cognitive social network. But the dream social network is not a copy of the cognitive social network. Waking life social networks tend to have positive assortativity; that is, people tend to be connected to others with similar connectivity. Instead, in our sample of dream social networks assortativity is more often negative or near 0, as in online social networks. We show that if characters appear via a random walk, negative assortativity can result, particularly if the random walk is biased as suggested by remote associations. Copyright © 2015 Cognitive Science Society, Inc.

Changing climates of conflict: A social network experiment in 56 schools.

PubMed

Paluck, Elizabeth Levy; Shepherd, Hana; Aronow, Peter M

2016-01-19

Theories of human behavior suggest that individuals attend to the behavior of certain people in their community to understand what is socially normative and adjust their own behavior in response. An experiment tested these theories by randomizing an anticonflict intervention across 56 schools with 24,191 students. After comprehensively measuring every school's social network, randomly selected seed groups of 20-32 students from randomly selected schools were assigned to an intervention that encouraged their public stance against conflict at school. Compared with control schools, disciplinary reports of student conflict at treatment schools were reduced by 30% over 1 year. The effect was stronger when the seed group contained more "social referent" students who, as network measures reveal, attract more student attention. Network analyses of peer-to-peer influence show that social referents spread perceptions of conflict as less socially normative.

Internal fuse modules for solid tantalum capacitors

NASA Technical Reports Server (NTRS)

Dematos, H. V.

1981-01-01

Miniature fuse modules were designed for and incorporated into two styles of solid tantalum capacitors. One is an epoxy molded, radial leaded, high frequency decoupling capacitor; the other is an hermetically sealed device with axial lead wires. The fusible element for both devices consists of a fine bimetallic wire which reacts exothermically upon reaching a critical temperature and then disintegrates. The desirability of having fused devices is discussed and design constraints, in particular those which minimize inductance and series resistance while optimizing fuse actuation characteristics, are reviewed. Factors affecting the amount of energy required to actuate the fuse and reliability of acuation are identified.

Understanding regulatory networks requires more than computing a multitude of graph statistics. Comment on "Drivers of structural features in gene regulatory networks: From biophysical constraints to biological function" by O.C. Martin et al.

NASA Astrophysics Data System (ADS)

Tkačik, Gašper

2016-07-01

The article by O. Martin and colleagues provides a much needed systematic review of a body of work that relates the topological structure of genetic regulatory networks to evolutionary selection for function. This connection is very important. Using the current wealth of genomic data, statistical features of regulatory networks (e.g., degree distributions, motif composition, etc.) can be quantified rather easily; it is, however, often unclear how to interpret the results. On a graph theoretic level the statistical significance of the results can be evaluated by comparing observed graphs to ;randomized; ones (bravely ignoring the issue of how precisely to randomize!) and comparing the frequency of appearance of a particular network structure relative to a randomized null expectation. While this is a convenient operational test for statistical significance, its biological meaning is questionable. In contrast, an in-silico genotype-to-phenotype model makes explicit the assumptions about the network function, and thus clearly defines the expected network structures that can be compared to the case of no selection for function and, ultimately, to data.

A Bell inequality for a class of multilocal ring networks

NASA Astrophysics Data System (ADS)

Frey, Michael

2017-11-01

Quantum networks with independent sources of entanglement (hidden variables) and nodes that execute joint quantum measurements can create strong quantum correlations spanning the breadth of the network. Understanding of these correlations has to the present been limited to standard Bell experiments with one source of shared randomness, bilocal arrangements having two local sources of shared randomness, and multilocal networks with tree topologies. We introduce here a class of quantum networks with ring topologies comprised of subsystems each with its own internally shared source of randomness. We prove a Bell inequality for these networks, and to demonstrate violations of this inequality, we focus on ring networks with three-qubit subsystems. Three qubits are capable of two non-equivalent types of entanglement, GHZ and W-type. For rings of any number N of three-qubit subsystems, our inequality is violated when the subsystems are each internally GHZ-entangled. This violation is consistently stronger when N is even. This quantitative even-odd difference for GHZ entanglement becomes extreme in the case of W-type entanglement. When the ring size N is even, the presence of W-type entanglement is successfully detected; when N is odd, the inequality consistently fails to detect its presence.

Pre-trained D-CNN models for detecting complex events in unconstrained videos

NASA Astrophysics Data System (ADS)

Robinson, Joseph P.; Fu, Yun

2016-05-01

Rapid event detection faces an emergent need to process large videos collections; whether surveillance videos or unconstrained web videos, the ability to automatically recognize high-level, complex events is a challenging task. Motivated by pre-existing methods being complex, computationally demanding, and often non-replicable, we designed a simple system that is quick, effective and carries minimal overhead in terms of memory and storage. Our system is clearly described, modular in nature, replicable on any Desktop, and demonstrated with extensive experiments, backed by insightful analysis on different Convolutional Neural Networks (CNNs), as stand-alone and fused with others. With a large corpus of unconstrained, real-world video data, we examine the usefulness of different CNN models as features extractors for modeling high-level events, i.e., pre-trained CNNs that differ in architectures, training data, and number of outputs. For each CNN, we use 1-fps from all training exemplar to train one-vs-rest SVMs for each event. To represent videos, frame-level features were fused using a variety of techniques. The best being to max-pool between predetermined shot boundaries, then average-pool to form the final video-level descriptor. Through extensive analysis, several insights were found on using pre-trained CNNs as off-the-shelf feature extractors for the task of event detection. Fusing SVMs of different CNNs revealed some interesting facts, finding some combinations to be complimentary. It was concluded that no single CNN works best for all events, as some events are more object-driven while others are more scene-based. Our top performance resulted from learning event-dependent weights for different CNNs.

Sensor feature fusion for detecting buried objects

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

Clark, G.A.; Sengupta, S.K.; Sherwood, R.J.

1993-04-01

Given multiple registered images of the earth`s surface from dual-band sensors, our system fuses information from the sensors to reduce the effects of clutter and improve the ability to detect buried or surface target sites. The sensor suite currently includes two sensors (5 micron and 10 micron wavelengths) and one ground penetrating radar (GPR) of the wide-band pulsed synthetic aperture type. We use a supervised teaming pattern recognition approach to detect metal and plastic land mines buried in soil. The overall process consists of four main parts: Preprocessing, feature extraction, feature selection, and classification. These parts are used in amore » two step process to classify a subimage. Thee first step, referred to as feature selection, determines the features of sub-images which result in the greatest separability among the classes. The second step, image labeling, uses the selected features and the decisions from a pattern classifier to label the regions in the image which are likely to correspond to buried mines. We extract features from the images, and use feature selection algorithms to select only the most important features according to their contribution to correct detections. This allows us to save computational complexity and determine which of the sensors add value to the detection system. The most important features from the various sensors are fused using supervised teaming pattern classifiers (including neural networks). We present results of experiments to detect buried land mines from real data, and evaluate the usefulness of fusing feature information from multiple sensor types, including dual-band infrared and ground penetrating radar. The novelty of the work lies mostly in the combination of the algorithms and their application to the very important and currently unsolved operational problem of detecting buried land mines from an airborne standoff platform.« less

Optimal Control of a Surge-Mode WEC in Random Waves

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

Chertok, Allan; Ceberio, Olivier; Staby, Bill

2016-08-30

The objective of this project was to develop one or more real-time feedback and feed-forward (MPC) control algorithms for an Oscillating Surge Wave Converter (OSWC) developed by RME called SurgeWEC™ that leverages recent innovations in wave energy converter (WEC) control theory to maximize power production in random wave environments. The control algorithms synthesized innovations in dynamic programming and nonlinear wave dynamics using anticipatory wave sensors and localized sensor measurements; e.g. position and velocity of the WEC Power Take Off (PTO), with predictive wave forecasting data. The result was an advanced control system that uses feedback or feed-forward data from anmore » array of sensor channels comprised of both localized and deployed sensors fused into a single decision process that optimally compensates for uncertainties in the system dynamics, wave forecasts, and sensor measurement errors.« less

Biometrics encryption combining palmprint with two-layer error correction codes

NASA Astrophysics Data System (ADS)

Li, Hengjian; Qiu, Jian; Dong, Jiwen; Feng, Guang

2017-07-01

To bridge the gap between the fuzziness of biometrics and the exactitude of cryptography, based on combining palmprint with two-layer error correction codes, a novel biometrics encryption method is proposed. Firstly, the randomly generated original keys are encoded by convolutional and cyclic two-layer coding. The first layer uses a convolution code to correct burst errors. The second layer uses cyclic code to correct random errors. Then, the palmprint features are extracted from the palmprint images. Next, they are fused together by XORing operation. The information is stored in a smart card. Finally, the original keys extraction process is the information in the smart card XOR the user's palmprint features and then decoded with convolutional and cyclic two-layer code. The experimental results and security analysis show that it can recover the original keys completely. The proposed method is more secure than a single password factor, and has higher accuracy than a single biometric factor.

Theory of rumour spreading in complex social networks

NASA Astrophysics Data System (ADS)

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

2007-01-01

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

Mathematical modelling of complex contagion on clustered networks

NASA Astrophysics Data System (ADS)

O'sullivan, David J.; O'Keeffe, Gary; Fennell, Peter; Gleeson, James

2015-09-01

The spreading of behavior, such as the adoption of a new innovation, is influenced bythe structure of social networks that interconnect the population. In the experiments of Centola (Science, 2010), adoption of new behavior was shown to spread further and faster across clustered-lattice networks than across corresponding random networks. This implies that the “complex contagion” effects of social reinforcement are important in such diffusion, in contrast to “simple” contagion models of disease-spread which predict that epidemics would grow more efficiently on random networks than on clustered networks. To accurately model complex contagion on clustered networks remains a challenge because the usual assumptions (e.g. of mean-field theory) regarding tree-like networks are invalidated by the presence of triangles in the network; the triangles are, however, crucial to the social reinforcement mechanism, which posits an increased probability of a person adopting behavior that has been adopted by two or more neighbors. In this paper we modify the analytical approach that was introduced by Hebert-Dufresne et al. (Phys. Rev. E, 2010), to study disease-spread on clustered networks. We show how the approximation method can be adapted to a complex contagion model, and confirm the accuracy of the method with numerical simulations. The analytical results of the model enable us to quantify the level of social reinforcement that is required to observe—as in Centola’s experiments—faster diffusion on clustered topologies than on random networks.

Interference Drop Scheme: Enhancing QoS Provision in Multi-Hop Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Luo, Chang-Yi; Komuro, Nobuyoshi; Takahashi, Kiyoshi; Kasai, Hiroyuki; Ueda, Hiromi; Tsuboi, Toshinori

Ad hoc networking uses wireless technologies to construct networks with no physical infrastructure and so are expected to provide instant networking in areas such as disaster recovery sites and inter-vehicle communication. Unlike conventional wired networks services, services in ad hoc networks are easily disrupted by the frequent changes in traffic and topology. Therefore, solutions to assure the Quality of Services (QoS) in ad hoc networks are different from the conventional ones used in wired networks. In this paper, we propose a new queue management scheme, Interference Drop Scheme (IDS) for ad hoc networks. In the conventional queue management approaches such as FIFO (First-in First-out) and RED (Random Early Detection), a queue is usually managed by a queue length limit. FIFO discards packets according to the queue limit, and RED discards packets in an early and random fashion. IDS, on the other hand, manages the queue according to wireless interference time, which increases as the number of contentions in the MAC layer increases. When there are many MAC contentions, IDS discards TCP data packets. By observing the interference time and discarding TCP data packets, our simulation results show that IDS improves TCP performance and reduces QoS violations in UDP in ad hoc networks with chain, grid, and random topologies. Our simulation results also demonstrate that wireless interference time is a better metric than queue length limit for queue management in multi-hop ad hoc networks.

Modeling Verdict Outcomes Using Social Network Measures: The Watergate and Caviar Network Cases.

PubMed

Masías, Víctor Hugo; Valle, Mauricio; Morselli, Carlo; Crespo, Fernando; Vargas, Augusto; Laengle, Sigifredo

2016-01-01

Modelling criminal trial verdict outcomes using social network measures is an emerging research area in quantitative criminology. Few studies have yet analyzed which of these measures are the most important for verdict modelling or which data classification techniques perform best for this application. To compare the performance of different techniques in classifying members of a criminal network, this article applies three different machine learning classifiers-Logistic Regression, Naïve Bayes and Random Forest-with a range of social network measures and the necessary databases to model the verdicts in two real-world cases: the U.S. Watergate Conspiracy of the 1970's and the now-defunct Canada-based international drug trafficking ring known as the Caviar Network. In both cases it was found that the Random Forest classifier did better than either Logistic Regression or Naïve Bayes, and its superior performance was statistically significant. This being so, Random Forest was used not only for classification but also to assess the importance of the measures. For the Watergate case, the most important one proved to be betweenness centrality while for the Caviar Network, it was the effective size of the network. These results are significant because they show that an approach combining machine learning with social network analysis not only can generate accurate classification models but also helps quantify the importance social network variables in modelling verdict outcomes. We conclude our analysis with a discussion and some suggestions for future work in verdict modelling using social network measures.

Extracting the field-effect mobilities of random semiconducting single-walled carbon nanotube networks: A critical comparison of methods

NASA Astrophysics Data System (ADS)

Schießl, Stefan P.; Rother, Marcel; Lüttgens, Jan; Zaumseil, Jana

2017-11-01

The field-effect mobility is an important figure of merit for semiconductors such as random networks of single-walled carbon nanotubes (SWNTs). However, owing to their network properties and quantum capacitance, the standard models for field-effect transistors cannot be applied without modifications. Several different methods are used to determine the mobility with often very different results. We fabricated and characterized field-effect transistors with different polymer-sorted, semiconducting SWNT network densities ranging from low (≈6 μm-1) to densely packed quasi-monolayers (≈26 μm-1) with a maximum on-conductance of 0.24 μS μm-1 and compared four different techniques to evaluate the field-effect mobility. We demonstrate the limits and requirements for each method with regard to device layout and carrier accumulation. We find that techniques that take into account the measured capacitance on the active device give the most reliable mobility values. Finally, we compare our experimental results to a random-resistor-network model.

Disrupted topological organization of structural networks revealed by probabilistic diffusion tractography in Tourette syndrome children.

PubMed

Wen, Hongwei; Liu, Yue; Rekik, Islem; Wang, Shengpei; Zhang, Jishui; Zhang, Yue; Peng, Yun; He, Huiguang

2017-08-01

Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. Although previous TS studies revealed structural abnormalities in distinct corticobasal ganglia circuits, the topological alterations of the whole-brain white matter (WM) structural networks remain poorly understood. Here, we used diffusion MRI probabilistic tractography and graph theoretical analysis to investigate the topological organization of WM networks in 44 drug-naive TS children and 41 age- and gender-matched healthy children. The WM networks were constructed by estimating inter-regional connectivity probability and the topological properties were characterized using graph theory. We found that both TS and control groups showed an efficient small-world organization in WM networks. However, compared to controls, TS children exhibited decreased global and local efficiency, increased shortest path length and small worldness, indicating a disrupted balance between local specialization and global integration in structural networks. Although both TS and control groups showed highly similar hub distributions, TS children exhibited significant decreased nodal efficiency, mainly distributed in the default mode, language, visual, and sensorimotor systems. Furthermore, two separate networks showing significantly decreased connectivity in TS group were identified using network-based statistical (NBS) analysis, primarily composed of the parieto-occipital cortex, precuneus, and paracentral lobule. Importantly, we combined support vector machine and multiple kernel learning frameworks to fuse multiple levels of network topological features for classification of individuals, achieving high accuracy of 86.47%. Together, our study revealed the disrupted topological organization of structural networks related to pathophysiology of TS, and the discriminative topological features for classification are potential quantitative neuroimaging biomarkers for clinical TS diagnosis. Hum Brain Mapp 38:3988-4008, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs.

PubMed

Bhuiyan, Hasanuzzaman; Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-06-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors.

Parallel Algorithms for Switching Edges in Heterogeneous Graphs☆

PubMed Central

Khan, Maleq; Chen, Jiangzhuo; Marathe, Madhav

2017-01-01

An edge switch is an operation on a graph (or network) where two edges are selected randomly and one of their end vertices are swapped with each other. Edge switch operations have important applications in graph theory and network analysis, such as in generating random networks with a given degree sequence, modeling and analyzing dynamic networks, and in studying various dynamic phenomena over a network. The recent growth of real-world networks motivates the need for efficient parallel algorithms. The dependencies among successive edge switch operations and the requirement to keep the graph simple (i.e., no self-loops or parallel edges) as the edges are switched lead to significant challenges in designing a parallel algorithm. Addressing these challenges requires complex synchronization and communication among the processors leading to difficulties in achieving a good speedup by parallelization. In this paper, we present distributed memory parallel algorithms for switching edges in massive networks. These algorithms provide good speedup and scale well to a large number of processors. A harmonic mean speedup of 73.25 is achieved on eight different networks with 1024 processors. One of the steps in our edge switch algorithms requires the computation of multinomial random variables in parallel. This paper presents the first non-trivial parallel algorithm for the problem, achieving a speedup of 925 using 1024 processors. PMID:28757680

Multiple Objects Fusion Tracker Using a Matching Network for Adaptively Represented Instance Pairs

PubMed Central

Oh, Sang-Il; Kang, Hang-Bong

2017-01-01

Multiple-object tracking is affected by various sources of distortion, such as occlusion, illumination variations and motion changes. Overcoming these distortions by tracking on RGB frames, such as shifting, has limitations because of material distortions caused by RGB frames. To overcome these distortions, we propose a multiple-object fusion tracker (MOFT), which uses a combination of 3D point clouds and corresponding RGB frames. The MOFT uses a matching function initialized on large-scale external sequences to determine which candidates in the current frame match with the target object in the previous frame. After conducting tracking on a few frames, the initialized matching function is fine-tuned according to the appearance models of target objects. The fine-tuning process of the matching function is constructed as a structured form with diverse matching function branches. In general multiple object tracking situations, scale variations for a scene occur depending on the distance between the target objects and the sensors. If the target objects in various scales are equally represented with the same strategy, information losses will occur for any representation of the target objects. In this paper, the output map of the convolutional layer obtained from a pre-trained convolutional neural network is used to adaptively represent instances without information loss. In addition, MOFT fuses the tracking results obtained from each modality at the decision level to compensate the tracking failures of each modality using basic belief assignment, rather than fusing modalities by selectively using the features of each modality. Experimental results indicate that the proposed tracker provides state-of-the-art performance considering multiple objects tracking (MOT) and KITTIbenchmarks. PMID:28420194

Three-dimensional fusion of spaceborne and ground radar reflectivity data using a neural network-based approach

NASA Astrophysics Data System (ADS)

Kou, Leilei; Wang, Zhuihui; Xu, Fen

2018-03-01

The spaceborne precipitation radar onboard the Tropical Rainfall Measuring Mission satellite (TRMM PR) can provide good measurement of the vertical structure of reflectivity, while ground radar (GR) has a relatively high horizontal resolution and greater sensitivity. Fusion of TRMM PR and GR reflectivity data may maximize the advantages from both instruments. In this paper, TRMM PR and GR reflectivity data are fused using a neural network (NN)-based approach. The main steps included are: quality control of TRMM PR and GR reflectivity data; spatiotemporal matchup; GR calibration bias correction; conversion of TRMM PR data from Ku to S band; fusion of TRMM PR and GR reflectivity data with an NN method; interpolation of reflectivity data that are below PR's sensitivity; blind areas compensation with a distance weighting-based merging approach; combination of three types of data: data with the NN method, data below PR's sensitivity and data within compensated blind areas. During the NN fusion step, the TRMM PR data are taken as targets of the training NNs, and gridded GR data after horizontal downsampling at different heights are used as the input. The trained NNs are then used to obtain 3D high-resolution reflectivity from the original GR gridded data. After 3D fusion of the TRMM PR and GR reflectivity data, a more complete and finer-scale 3D radar reflectivity dataset incorporating characteristics from both the TRMM PR and GR observations can be obtained. The fused reflectivity data are evaluated based on a convective precipitation event through comparison with the high resolution TRMM PR and GR data with an interpolation algorithm.

Efficient randomization of biological networks while preserving functional characterization of individual nodes.

PubMed

Iorio, Francesco; Bernardo-Faura, Marti; Gobbi, Andrea; Cokelaer, Thomas; Jurman, Giuseppe; Saez-Rodriguez, Julio

2016-12-20

Networks are popular and powerful tools to describe and model biological processes. Many computational methods have been developed to infer biological networks from literature, high-throughput experiments, and combinations of both. Additionally, a wide range of tools has been developed to map experimental data onto reference biological networks, in order to extract meaningful modules. Many of these methods assess results' significance against null distributions of randomized networks. However, these standard unconstrained randomizations do not preserve the functional characterization of the nodes in the reference networks (i.e. their degrees and connection signs), hence including potential biases in the assessment. Building on our previous work about rewiring bipartite networks, we propose a method for rewiring any type of unweighted networks. In particular we formally demonstrate that the problem of rewiring a signed and directed network preserving its functional connectivity (F-rewiring) reduces to the problem of rewiring two induced bipartite networks. Additionally, we reformulate the lower bound to the iterations' number of the switching-algorithm to make it suitable for the F-rewiring of networks of any size. Finally, we present BiRewire3, an open-source Bioconductor package enabling the F-rewiring of any type of unweighted network. We illustrate its application to a case study about the identification of modules from gene expression data mapped on protein interaction networks, and a second one focused on building logic models from more complex signed-directed reference signaling networks and phosphoproteomic data. BiRewire3 it is freely available at https://www.bioconductor.org/packages/BiRewire/ , and it should have a broad application as it allows an efficient and analytically derived statistical assessment of results from any network biology tool.

30 CFR 28.2 - Approved fuses.

Code of Federal Regulations, 2010 CFR

2010-07-01

... MINING PRODUCTS FUSES FOR USE WITH DIRECT CURRENT IN PROVIDING SHORT-CIRCUIT PROTECTION FOR TRAILING...-circuit protection for trailing cables in coal mines only where such fuses are: (1) The same in all...

Development of a High Precision Displacement Measurement System by Fusing a Low Cost RTK-GPS Sensor and a Force Feedback Accelerometer for Infrastructure Monitoring.

PubMed

Koo, Gunhee; Kim, Kiyoung; Chung, Jun Yeon; Choi, Jaemook; Kwon, Nam-Yeol; Kang, Doo-Young; Sohn, Hoon

2017-11-28

A displacement measurement system fusing a low cost real-time kinematic global positioning system (RTK-GPS) receiver and a force feedback accelerometer is proposed for infrastructure monitoring. The proposed system is composed of a sensor module, a base module and a computation module. The sensor module consists of a RTK-GPS rover and a force feedback accelerometer, and is installed on a target structure like conventional RTK-GPS sensors. The base module is placed on a rigid ground away from the target structure similar to conventional RTK-GPS bases, and transmits observation messages to the sensor module. Then, the initial acceleration, velocity and displacement responses measured by the sensor module are transmitted to the computation module located at a central monitoring facility. Finally, high precision and high sampling rate displacement, velocity, and acceleration are estimated by fusing the acceleration from the accelerometer, the velocity from the GPS rover, and the displacement from RTK-GPS. Note that the proposed displacement measurement system can measure 3-axis acceleration, velocity as well as displacement in real time. In terms of displacement, the proposed measurement system can estimate dynamic and pseudo-static displacement with a root-mean-square error of 2 mm and a sampling rate of up to 100 Hz. The performance of the proposed system is validated under sinusoidal, random and steady-state vibrations. Field tests were performed on the Yeongjong Grand Bridge and Yi Sun-sin Bridge in Korea, and the Xihoumen Bridge in China to compare the performance of the proposed system with a commercial RTK-GPS sensor and other data fusion techniques.

Co-fuse: a new class discovery analysis tool to identify and prioritize recurrent fusion genes from RNA-sequencing data.

PubMed

Paisitkriangkrai, Sakrapee; Quek, Kelly; Nievergall, Eva; Jabbour, Anissa; Zannettino, Andrew; Kok, Chung Hoow

2018-06-07

Recurrent oncogenic fusion genes play a critical role in the development of various cancers and diseases and provide, in some cases, excellent therapeutic targets. To date, analysis tools that can identify and compare recurrent fusion genes across multiple samples have not been available to researchers. To address this deficiency, we developed Co-occurrence Fusion (Co-fuse), a new and easy to use software tool that enables biologists to merge RNA-seq information, allowing them to identify recurrent fusion genes, without the need for exhaustive data processing. Notably, Co-fuse is based on pattern mining and statistical analysis which enables the identification of hidden patterns of recurrent fusion genes. In this report, we show that Co-fuse can be used to identify 2 distinct groups within a set of 49 leukemic cell lines based on their recurrent fusion genes: a multiple myeloma (MM) samples-enriched cluster and an acute myeloid leukemia (AML) samples-enriched cluster. Our experimental results further demonstrate that Co-fuse can identify known driver fusion genes (e.g., IGH-MYC, IGH-WHSC1) in MM, when compared to AML samples, indicating the potential of Co-fuse to aid the discovery of yet unknown driver fusion genes through cohort comparisons. Additionally, using a 272 primary glioma sample RNA-seq dataset, Co-fuse was able to validate recurrent fusion genes, further demonstrating the power of this analysis tool to identify recurrent fusion genes. Taken together, Co-fuse is a powerful new analysis tool that can be readily applied to large RNA-seq datasets, and may lead to the discovery of new disease subgroups and potentially new driver genes, for which, targeted therapies could be developed. The Co-fuse R source code is publicly available at https://github.com/sakrapee/co-fuse .

Practical comparison of 2.7 microm fused-core silica particles and porous sub-2 microm particles for fast separations in pharmaceutical process development.

PubMed

Abrahim, Ahmed; Al-Sayah, Mohammad; Skrdla, Peter; Bereznitski, Yuri; Chen, Yadan; Wu, Naijun

2010-01-05

Fused-core silica stationary phases represent a key technological advancement in the arena of fast HPLC separations. These phases are made by fusing a 0.5 microm porous silica layer onto 1.7 microm nonporous silica cores. The reduced intra-particle flow path of the fused particles provides superior mass transfer kinetics and better performance at high mobile phase velocities, while the fused-core particles provide lower pressure than sub-2 microm particles. In this work, chromatographic performance of the fused-core particles (Ascentis Express) was investigated and compared to that of sub-2 microm porous particles (1.8 microm Zorbax Eclipse Plus C18 and 1.7 microm Acquity BEH C18). Specifically, retention, selectivity, and loading capacity were systematically compared for these two types of columns. Other chromatographic parameters such as efficiency and pressure drop were also studied. Although the fused-core column was found to provide better analyte shape selectivity, both columns had similar hydrophobic, hydrogen bonding, total ion-exchange, and acidic ion-exchange selectivities. As expected, the retention factors and sample loading capacity on the fused-core particle column were slightly lower than those for the sub-2 microm particle column. However, the most dramatic observation was that similar efficiency separations to the sub-2 microm particles could be achieved using the fused-core particles, without the expense of high column back pressure. The low pressure of the fused-core column allows fast separations to be performed routinely on a conventional LC system without significant loss in efficiency or resolution. Applications to the HPLC impurity profiling of drug substance candidates were performed using both types of columns to validate this last point.

Redundancy Technology With A Focused Ion Beam

NASA Astrophysics Data System (ADS)

Komano, Haruki; Hashimoto, Kazuhiko; Takigawa, Tadahiro

1989-08-01

Fuse cutting with a focused ion beam to activate redundancy circuits is proposed. In order to verify its potential usefulness, experiments have been performed. Fuse-cutting time was evaluated using aluminum fuses with a thin passivation layer, which are difficult to cut by conventional laser-beam technology due to the material's high reflectivity. The fuse width and thickness were 2 and 0.8 μm, respectively. The fuse was cut in 5 seconds with a 30 keV focused ion beam of 0.3 A/cm2 current density. Since the fuses used in DRAMs will be smaller, their cutting time will become shorter by scanning an ion beam on narrower areas. Moreover, it can be shortened by increasing current density. Fuses for redundancy technology in 256 k CMOS SRAMs were cut with a focused ion beam. The operation of the memories was checked with a memory tester. It was confirmed that memories which had failure cells operated normally after focused-ion-beam fuse-cutting. Focused ion beam irradiation effects upon a device have been studied. When a 30 keV gallium focused ion beam was irradiated near the gate of MOSFETs, a threshold voltage shift was not observed at an ion dose of 0.3 C/cm2 which corresponded to the ion dose in cutting a fuse. However, when irradiated on the gate, a threshold voltage shift was observed at ion doses of more than 8 x 10-4 C/cm2. The voltage shift was caused by the charge of ions within the passivation layer. It is necessary at least not to irradiate a focused ion beam on a device in cutting fuses. It is concluded that the focused-ion-beam method will be advantageous for future redundancy technology application.

Characterizing short-term stability for Boolean networks over any distribution of transfer functions

DOE PAGES

Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; ...

2016-07-05

Here we present a characterization of short-term stability of random Boolean networks under arbitrary distributions of transfer functions. Given any distribution of transfer functions for a random Boolean network, we present a formula that decides whether short-term chaos (damage spreading) will happen. We provide a formal proof for this formula, and empirically show that its predictions are accurate. Previous work only works for special cases of balanced families. Finally, it has been observed that these characterizations fail for unbalanced families, yet such families are widespread in real biological networks.

Modeling of contact tracing in social networks

NASA Astrophysics Data System (ADS)

Tsimring, Lev S.; Huerta, Ramón

2003-07-01

Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.

Multi-threshold white matter structural networks fusion for accurate diagnosis of Tourette syndrome children

NASA Astrophysics Data System (ADS)

Wen, Hongwei; Liu, Yue; Wang, Shengpei; Li, Zuoyong; Zhang, Jishui; Peng, Yun; He, Huiguang

2017-03-01

Tourette syndrome (TS) is a childhood-onset neurobehavioral disorder. To date, TS is still misdiagnosed due to its varied presentation and lacking of obvious clinical symptoms. Therefore, studies of objective imaging biomarkers are of great importance for early TS diagnosis. As tic generation has been linked to disturbed structural networks, and many efforts have been made recently to investigate brain functional or structural networks using machine learning methods, for the purpose of disease diagnosis. However, few studies were related to TS and some drawbacks still existed in them. Therefore, we propose a novel classification framework integrating a multi-threshold strategy and a network fusion scheme to address the preexisting drawbacks. Here we used diffusion MRI probabilistic tractography to construct the structural networks of 44 TS children and 48 healthy children. We ameliorated the similarity network fusion algorithm specially to fuse the multi-threshold structural networks. Graph theoretical analysis was then implemented, and nodal degree, nodal efficiency and nodal betweenness centrality were selected as features. Finally, support vector machine recursive feature extraction (SVM-RFE) algorithm was used for feature selection, and then optimal features are fed into SVM to automatically discriminate TS children from controls. We achieved a high accuracy of 89.13% evaluated by a nested cross validation, demonstrated the superior performance of our framework over other comparison methods. The involved discriminative regions for classification primarily located in the basal ganglia and frontal cortico-cortical networks, all highly related to the pathology of TS. Together, our study may provide potential neuroimaging biomarkers for early-stage TS diagnosis.

On the strength of random fiber networks

NASA Astrophysics Data System (ADS)

Deogekar, S.; Picu, R. C.

2018-07-01

Damage accumulation and failure in random fiber networks is of importance in a variety of applications, from design of synthetic materials, such as paper and non-wovens, to accidental tearing of biological tissues. In this work we study these processes using three-dimensional models of athermal fiber networks, focusing attention on the modes of failure and on the relationship between network strength and network structural parameters. We consider network failure at small and large strains associated with the rupture of inter-fiber bonds. It is observed that the strength increases linearly with the network volume fraction and with the bond strength, while the stretch at peak stress is inversely related to these two parameters. A small fraction of the bonds rupture before peak stress and this fraction increases with increasing failure stretch. Rendering the bond strength stochastic causes a reduction of the network strength. However, heterogeneity retards damage localization and increases the stretch at peak stress, therefore promoting ductility.

Network Structure and the Risk for HIV Transmission Among Rural Drug Users

PubMed Central

Young, A. M.; Jonas, A. B.; Mullins, U. L.; Halgin, D. S.

2012-01-01

Research suggests that structural properties of drug users’ social networks can have substantial effects on HIV risk. The purpose of this study was to investigate if the structural properties of Appalachian drug users’ risk networks could lend insight into the potential for HIV transmission in this population. Data from 503 drug users recruited through respondent-driven sampling were used to construct a sociometric risk network. Network ties represented relationships in which partners had engaged in unprotected sex and/or shared injection equipment. Compared to 1,000 randomly generated networks, the observed network was found to have a larger main component and exhibit more cohesiveness and centralization than would be expected at random. Thus, the risk network structure in this sample has many structural characteristics shown to be facilitative of HIV transmission. This underscores the importance of primary prevention in this population and prompts further investigation into the epidemiology of HIV in the region. PMID:23184464

Analysis of complex network performance and heuristic node removal strategies

NASA Astrophysics Data System (ADS)

Jahanpour, Ehsan; Chen, Xin

2013-12-01

Removing important nodes from complex networks is a great challenge in fighting against criminal organizations and preventing disease outbreaks. Six network performance metrics, including four new metrics, are applied to quantify networks' diffusion speed, diffusion scale, homogeneity, and diameter. In order to efficiently identify nodes whose removal maximally destroys a network, i.e., minimizes network performance, ten structured heuristic node removal strategies are designed using different node centrality metrics including degree, betweenness, reciprocal closeness, complement-derived closeness, and eigenvector centrality. These strategies are applied to remove nodes from the September 11, 2001 hijackers' network, and their performance are compared to that of a random strategy, which removes randomly selected nodes, and the locally optimal solution (LOS), which removes nodes to minimize network performance at each step. The computational complexity of the 11 strategies and LOS is also analyzed. Results show that the node removal strategies using degree and betweenness centralities are more efficient than other strategies.

Random walks on activity-driven networks with attractiveness

NASA Astrophysics Data System (ADS)

Alessandretti, Laura; Sun, Kaiyuan; Baronchelli, Andrea; Perra, Nicola

2017-05-01

Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterized by these two features. We study how these properties affect random-walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first-passage time of the process, and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems, such as heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.

Emergence of cooperation in non-scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yichao; Aziz-Alaoui, M. A.; Bertelle, Cyrille; Zhou, Shi; Wang, Wenting

2014-06-01

Evolutionary game theory is one of the key paradigms behind many scientific disciplines from science to engineering. Previous studies proposed a strategy updating mechanism, which successfully demonstrated that the scale-free network can provide a framework for the emergence of cooperation. Instead, individuals in random graphs and small-world networks do not favor cooperation under this updating rule. However, a recent empirical result shows the heterogeneous networks do not promote cooperation when humans play a prisoner’s dilemma. In this paper, we propose a strategy updating rule with payoff memory. We observe that the random graphs and small-world networks can provide even better frameworks for cooperation than the scale-free networks in this scenario. Our observations suggest that the degree heterogeneity may be neither a sufficient condition nor a necessary condition for the widespread cooperation in complex networks. Also, the topological structures are not sufficed to determine the level of cooperation in complex networks.

Quantifying networks complexity from information geometry viewpoint

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

Felice, Domenico, E-mail: domenico.felice@unicam.it; Mancini, Stefano; INFN-Sezione di Perugia, Via A. Pascoli, I-06123 Perugia

We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as weighted edges among vertices. We then associate to the parameter space a statistical manifold endowed with a Riemannian metric structure (that of Fisher-Rao). Going on, in analogy with the microcanonical definition of entropy in Statistical Mechanics, we introduce an entropic measure of networks complexity. We prove that it is invariant under networks isomorphism. Above all, considering networks as simplicial complexes, we evaluate this entropy onmore » simplexes and find that it monotonically increases with their dimension.« less

Why we need more than just randomized controlled trials to establish the effectiveness of online social networks for health behavior change.

PubMed

Vandelanotte, Corneel; Maher, Carol A

2015-01-01

Despite their popularity and potential to promote health in large populations, the effectiveness of online social networks (e.g., Facebook) to improve health behaviors has been somewhat disappointing. Most of the research examining the effectiveness of such interventions has used randomized controlled trials (RCTs). It is asserted that the modest outcomes may be due to characteristics specific to both online social networks and RCTs. The highly controlled nature of RCTs stifles the dynamic nature of online social networks. Alternative and ecologically valid research designs that evaluate online social networks in real-life conditions are needed to advance the science in this area.

KSC-99pp0494

NASA Image and Video Library

1999-05-03

Workers at Hangar AE, Cape Canaveral Air Station, maneuver an overhead crane toward NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite standing between vertical workstands. The crane will lift FUSE to move it onto the Payload Attach Fitting (PAF) in front of it. FUSE is undergoing a functional test of its systems, plus installation of flight batteries and solar arrays. Developed by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md., FUSE will investigate the origin and evolution of the lightest elements in the universe hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. FUSE is scheduled to be launched May 27 aboard a Boeing Delta II rocket at Launch Complex 17

Morphological evaluation of maxillary second molars with fused roots: a micro-CT study.

PubMed

Ordinola-Zapata, R; Martins, J N R; Bramante, C M; Villas-Boas, M H; Duarte, M H; Versiani, M A

2017-12-01

To evaluate the internal and external morphologies of fused-rooted maxillary second molars by means of micro-computed tomography (micro-CT) analysis. A total of 100 fused-rooted maxillary second molars from a Brazilian subpopulation were divided into six groups according to the root morphology. The samples were scanned at a resolution of 19.6 μm and evaluated with regard to the external morphology of the roots, the root canal configuration, the percentage frequency of C-shaped canals and isthmuses, as well as the morphology of the root canal system at 1, 2 and 3 mm from the anatomical apex of the fused roots. The most prevalent root canal fusions were type 1, mesiobuccal root fused with distobuccal root (32%), followed by type 3, DB root fused with P root (27%), and type 4, MB root fused with DB root, and P root fused with MB or DB roots (21%). The prevalence of C-shaped root canal systems were 22%. Depending on the type of root fusion, the percentage frequency of isthmuses in the apical level varied from 9.3% to 42.8%, whilst the presence of apical deltas ranged from 18.5% to 57.1% of teeth. The root canal system of maxillary second molars with fused roots may have a high incidence of merging canals, isthmuses, apical deltas and C-shaped configurations. © 2017 International Endodontic Journal. Published by John Wiley & Sons Ltd.

A Faster, High Resolution, mtPA-GFP-based Mitochondrial Fusion Assay Acquiring Kinetic Data of Multiple Cells in Parallel Using Confocal Microscopy

PubMed Central

Lovy, Alenka; Molina, Anthony J.A.; Cerqueira, Fernanda M.; Trudeau, Kyle; Shirihai, Orian S.

2012-01-01

Mitochondrial fusion plays an essential role in mitochondrial calcium homeostasis, bioenergetics, autophagy and quality control. Fusion is quantified in living cells by photo-conversion of matrix targeted photoactivatable GFP (mtPAGFP) in a subset of mitochondria. The rate at which the photoconverted molecules equilibrate across the entire mitochondrial population is used as a measure of fusion activity. Thus far measurements were performed using a single cell time lapse approach, quantifying the equilibration in one cell over an hour. Here, we scale up and automate a previously published live cell method based on using mtPAGFP and a low concentration of TMRE (15 nm). This method involves photoactivating a small portion of the mitochondrial network, collecting highly resolved stacks of confocal sections every 15 min for 1 hour, and quantifying the change in signal intensity. Depending on several factors such as ease of finding PAGFP expressing cells, and the signal of the photoactivated regions, it is possible to collect around 10 cells within the 15 min intervals. This provides a significant improvement in the time efficiency of this assay while maintaining the highly resolved subcellular quantification as well as the kinetic parameters necessary to capture the detail of mitochondrial behavior in its native cytoarchitectural environment. Mitochondrial dynamics play a role in many cellular processes including respiration, calcium regulation, and apoptosis1,2,3,13. The structure of the mitochondrial network affects the function of mitochondria, and the way they interact with the rest of the cell. Undergoing constant division and fusion, mitochondrial networks attain various shapes ranging from highly fused networks, to being more fragmented. Interestingly, Alzheimer's disease, Parkinson's disease, Charcot Marie Tooth 2A, and dominant optic atrophy have been correlated with altered mitochondrial morphology, namely fragmented networks4,10,13. Often times, upon fragmentation, mitochondria become depolarized, and upon accumulation this leads to impaired cell function18. Mitochondrial fission has been shown to signal a cell to progress toward apoptosis. It can also provide a mechanism by which to separate depolarized and inactive mitochondria to keep the bulk of the network robust14. Fusion of mitochondria, on the other hand, leads to sharing of matrix proteins, solutes, mtDNA and the electrochemical gradient, and also seems to prevent progression to apoptosis9. How fission and fusion of mitochondria affects cell homeostasis and ultimately the functioning of the organism needs further understanding, and therefore the continuous development and optimization of how to gather information on these phenomena is necessary. Existing mitochondrial fusion assays have revealed various insights into mitochondrial physiology, each having its own advantages. The hybrid PEG fusion assay7, mixes two populations of differently labeled cells (mtRFP and mtYFP), and analyzes the amount of mixing and colocalization of fluorophores in fused, multinucleated, cells. Although this method has yielded valuable information, not all cell types can fuse, and the conditions under which fusion is stimulated involves the use of toxic drugs that likely affect the normal fusion process. More recently, a cell free technique has been devised, using isolated mitochondria to observe fusion events based on a luciferase assay1,5. Two human cell lines are targeted with either the amino or a carboxy terminal part of Renilla luciferase along with a leucine zipper to ensure dimerization upon mixing. Mitochondria are isolated from each cell line, and fused. The fusion reaction can occur without the cytosol under physiological conditions in the presence of energy, appropriate temperature and inner mitochondrial membrane potential. Interestingly, the cytosol was found to modulate the extent of fusion, demonstrating that cell signaling regulates the fusion process 4,5. This assay will be very useful for high throughput screening to identify components of the fusion machinery and also pharmacological compounds that may affect mitochondrial dynamics. However, more detailed whole cell mitochondrial assays will be needed to complement this in vitro assay to observe these events within a cellular environment. A technique for monitoring whole-cell mitochondrial dynamics has been in use for some time and is based on a mitochondrially-targeted photoactivatable GFP (mtPAGFP)6,11. Upon expression of the mtPAGFP, a small portion of the mitochondrial network is photoactivated (10-20%), and the spread of the signal to the rest of the mitochondrial network is recorded every 15 minutes for 1 hour using time lapse confocal imaging. Each fusion event leads to a dilution of signal intensity, enabling quantification of the fusion rate. Although fusion and fission are continuously occurring in cells, this technique only monitors fusion as fission does not lead to a dilution of the PAGFP signal6. Co-labeling with low levels of TMRE (7-15 nM in INS1 cells) allows quantification of the membrane potential of mitochondria. When mitochondria are hyperpolarized they uptake more TMRE, and when they depolarize they lose the TMRE dye. Mitochondria that depolarize no longer have a sufficient membrane potential and tend not to fuse as efficiently if at all. Therefore, active fusing mitochondria can be tracked with these low levels of TMRE9,15. Accumulation of depolarized mitochondria that lack a TMRE signal may be a sign of phototoxicity or cell death. Higher concentrations of TMRE render mitochondria very sensitive to laser light, and therefore great care must be taken to avoid overlabeling with TMRE. If the effect of depolarization of mitochondria is the topic of interest, a technique using slightly higher levels of TMRE and more intense laser light can be used to depolarize mitochondria in a controlled fashion (Mitra and Lippincott-Schwartz, 2010). To ensure that toxicity due to TMRE is not an issue, we suggest exposing loaded cells (3-15 nM TMRE) to the imaging parameters that will be used in the assay (perhaps 7 stacks of 6 optical sections in a row), and assessing cell health after 2 hours. If the mitochondria appear too fragmented and cells are dying, other mitochondrial markers, such as dsRED or Mitotracker red could be used instead of TMRE. The mtPAGFP method has revealed details about mitochondrial network behavior that could not be visualized using other methods. For example, we now know that mitochondrial fusion can be full or transient, where matrix content can mix without changing the overall network morphology. Additionally, we know that the probability of fusion is independent of contact duration and organelle dimension, is influenced by organelle motility, membrane potential and history of previous fusion activity8,15,16,17. In this manuscript, we describe a methodology for scaling up the previously published protocol using mtPAGFP and 15nM TMRE8 in order to examine multiple cells at a time and improve the time efficiency of data collection without sacrificing the subcellular resolution. This has been made possible by the use of an automated microscope stage, and programmable image acquisition software. Zen software from Zeiss allows the user to mark and track several designated cells expressing mtPAGFP. Each of these cells can be photoactivated in a particular region of interest, and stacks of confocal slices can be monitored for mtPAGFP signal as well as TMRE at specified intervals. Other confocal systems could be used to perform this protocol provided there is an automated stage that is programmable, an incubator with CO2, and a means by which to photoactivate the PAGFP; either a multiphoton laser, or a 405 nm diode laser. PMID:22847388

A faster, high resolution, mtPA-GFP-based mitochondrial fusion assay acquiring kinetic data of multiple cells in parallel using confocal microscopy.

PubMed

Lovy, Alenka; Molina, Anthony J A; Cerqueira, Fernanda M; Trudeau, Kyle; Shirihai, Orian S

2012-07-20

Mitochondrial fusion plays an essential role in mitochondrial calcium homeostasis, bioenergetics, autophagy and quality control. Fusion is quantified in living cells by photo-conversion of matrix targeted photoactivatable GFP (mtPAGFP) in a subset of mitochondria. The rate at which the photoconverted molecules equilibrate across the entire mitochondrial population is used as a measure of fusion activity. Thus far measurements were performed using a single cell time lapse approach, quantifying the equilibration in one cell over an hour. Here, we scale up and automate a previously published live cell method based on using mtPAGFP and a low concentration of TMRE (15 nm). This method involves photoactivating a small portion of the mitochondrial network, collecting highly resolved stacks of confocal sections every 15 min for 1 hour, and quantifying the change in signal intensity. Depending on several factors such as ease of finding PAGFP expressing cells, and the signal of the photoactivated regions, it is possible to collect around 10 cells within the 15 min intervals. This provides a significant improvement in the time efficiency of this assay while maintaining the highly resolved subcellular quantification as well as the kinetic parameters necessary to capture the detail of mitochondrial behavior in its native cytoarchitectural environment. Mitochondrial dynamics play a role in many cellular processes including respiration, calcium regulation, and apoptosis. The structure of the mitochondrial network affects the function of mitochondria, and the way they interact with the rest of the cell. Undergoing constant division and fusion, mitochondrial networks attain various shapes ranging from highly fused networks, to being more fragmented. Interestingly, Alzheimer's disease, Parkinson's disease, Charcot Marie Tooth 2A, and dominant optic atrophy have been correlated with altered mitochondrial morphology, namely fragmented networks. Often times, upon fragmentation, mitochondria become depolarized, and upon accumulation this leads to impaired cell function. Mitochondrial fission has been shown to signal a cell to progress toward apoptosis. It can also provide a mechanism by which to separate depolarized and inactive mitochondria to keep the bulk of the network robust. Fusion of mitochondria, on the other hand, leads to sharing of matrix proteins, solutes, mtDNA and the electrochemical gradient, and also seems to prevent progression to apoptosis. How fission and fusion of mitochondria affects cell homeostasis and ultimately the functioning of the organism needs further understanding, and therefore the continuous development and optimization of how to gather information on these phenomena is necessary. Existing mitochondrial fusion assays have revealed various insights into mitochondrial physiology, each having its own advantages. The hybrid PEG fusion assay, mixes two populations of differently labeled cells (mtRFP and mtYFP), and analyzes the amount of mixing and colocalization of fluorophores in fused, multinucleated, cells. Although this method has yielded valuable information, not all cell types can fuse, and the conditions under which fusion is stimulated involves the use of toxic drugs that likely affect the normal fusion process. More recently, a cell free technique has been devised, using isolated mitochondria to observe fusion events based on a luciferase assay. Two human cell lines are targeted with either the amino or a carboxy terminal part of Renilla luciferase along with a leucine zipper to ensure dimerization upon mixing. Mitochondria are isolated from each cell line, and fused. The fusion reaction can occur without the cytosol under physiological conditions in the presence of energy, appropriate temperature and inner mitochondrial membrane potential. Interestingly, the cytosol was found to modulate the extent of fusion, demonstrating that cell signaling regulates the fusion process. This assay will be very useful for high throughput screening to identify components of the fusion machinery and also pharmacological compounds that may affect mitochondrial dynamics. However, more detailed whole cell mitochondrial assays will be needed to complement this in vitro assay to observe these events within a cellular environment. A technique for monitoring whole-cell mitochondrial dynamics has been in use for some time and is based on a mitochondrially-targeted photoactivatable GFP (mtPAGFP). Upon expression of the mtPAGFP, a small portion of the mitochondrial network is photoactivated (10-20%), and the spread of the signal to the rest of the mitochondrial network is recorded every 15 minutes for 1 hour using time lapse confocal imaging. Each fusion event leads to a dilution of signal intensity, enabling quantification of the fusion rate. Although fusion and fission are continuously occurring in cells, this technique only monitors fusion as fission does not lead to a dilution of the PAGFP signal. Co-labeling with low levels of TMRE (7-15 nM in INS1 cells) allows quantification of the membrane potential of mitochondria. When mitochondria are hyperpolarized they uptake more TMRE, and when they depolarize they lose the TMRE dye. Mitochondria that depolarize no longer have a sufficient membrane potential and tend not to fuse as efficiently if at all. Therefore, active fusing mitochondria can be tracked with these low levels of TMRE. Accumulation of depolarized mitochondria that lack a TMRE signal may be a sign of phototoxicity or cell death. Higher concentrations of TMRE render mitochondria very sensitive to laser light, and therefore great care must be taken to avoid overlabeling with TMRE. If the effect of depolarization of mitochondria is the topic of interest, a technique using slightly higher levels of TMRE and more intense laser light can be used to depolarize mitochondria in a controlled fashion (Mitra and Lippincott-Schwartz, 2010). To ensure that toxicity due to TMRE is not an issue, we suggest exposing loaded cells (3-15 nM TMRE) to the imaging parameters that will be used in the assay (perhaps 7 stacks of 6 optical sections in a row), and assessing cell health after 2 hours. If the mitochondria appear too fragmented and cells are dying, other mitochondrial markers, such as dsRED or Mitotracker red could be used instead of TMRE. The mtPAGFP method has revealed details about mitochondrial network behavior that could not be visualized using other methods. For example, we now know that mitochondrial fusion can be full or transient, where matrix content can mix without changing the overall network morphology. Additionally, we know that the probability of fusion is independent of contact duration and organelle dimension, is influenced by organelle motility, membrane potential and history of previous fusion activity. In this manuscript, we describe a methodology for scaling up the previously published protocol using mtPAGFP and 15 nM TMRE in order to examine multiple cells at a time and improve the time efficiency of data collection without sacrificing the subcellular resolution. This has been made possible by the use of an automated microscope stage, and programmable image acquisition software. Zen software from Zeiss allows the user to mark and track several designated cells expressing mtPAGFP. Each of these cells can be photoactivated in a particular region of interest, and stacks of confocal slices can be monitored for mtPAGFP signal as well as TMRE at specified intervals. Other confocal systems could be used to perform this protocol provided there is an automated stage that is programmable, an incubator with CO2, and a means by which to photoactivate the PAGFP; either a multiphoton laser, or a 405 nm diode laser.

Immunization of complex networks

NASA Astrophysics Data System (ADS)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2002-03-01

Complex networks such as the sexual partnership web or the Internet often show a high degree of redundancy and heterogeneity in their connectivity properties. This peculiar connectivity provides an ideal environment for the spreading of infective agents. Here we show that the random uniform immunization of individuals does not lead to the eradication of infections in all complex networks. Namely, networks with scale-free properties do not acquire global immunity from major epidemic outbreaks even in the presence of unrealistically high densities of randomly immunized individuals. The absence of any critical immunization threshold is due to the unbounded connectivity fluctuations of scale-free networks. Successful immunization strategies can be developed only by taking into account the inhomogeneous connectivity properties of scale-free networks. In particular, targeted immunization schemes, based on the nodes' connectivity hierarchy, sharply lower the network's vulnerability to epidemic attacks.

Enhanced networked server management with random remote backups

NASA Astrophysics Data System (ADS)

Kim, Song-Kyoo

2003-08-01

In this paper, the model is focused on available server management in network environments. The (remote) backup servers are hooked up by VPN (Virtual Private Network) and replace broken main severs immediately. A virtual private network (VPN) is a way to use a public network infrastructure and hooks up long-distance servers within a single network infrastructure. The servers can be represent as "machines" and then the system deals with main unreliable and random auxiliary spare (remote backup) machines. When the system performs a mandatory routine maintenance, auxiliary machines are being used for backups during idle periods. Unlike other existing models, the availability of auxiliary machines is changed for each activation in this enhanced model. Analytically tractable results are obtained by using several mathematical techniques and the results are demonstrated in the framework of optimized networked server allocation problems.

OSI Network-layer Abstraction: Analysis of Simulation Dynamics and Performance Indicators

NASA Astrophysics Data System (ADS)

Lawniczak, Anna T.; Gerisch, Alf; Di Stefano, Bruno

2005-06-01

The Open Systems Interconnection (OSI) reference model provides a conceptual framework for communication among computers in a data communication network. The Network Layer of this model is responsible for the routing and forwarding of packets of data. We investigate the OSI Network Layer and develop an abstraction suitable for the study of various network performance indicators, e.g. throughput, average packet delay, average packet speed, average packet path-length, etc. We investigate how the network dynamics and the network performance indicators are affected by various routing algorithms and by the addition of randomly generated links into a regular network connection topology of fixed size. We observe that the network dynamics is not simply the sum of effects resulting from adding individual links to the connection topology but rather is governed nonlinearly by the complex interactions caused by the existence of all randomly added and already existing links in the network. Data for our study was gathered using Netzwerk-1, a C++ simulation tool that we developed for our abstraction.

PUFKEY: A High-Security and High-Throughput Hardware True Random Number Generator for Sensor Networks

PubMed Central

Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

2015-01-01

Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks. PMID:26501283

PUFKEY: a high-security and high-throughput hardware true random number generator for sensor networks.

PubMed

Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

2015-10-16

Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.

The Effect of Drycleaning Moisture on Fused Cloth Systems

DTIC Science & Technology

1989-03-01

TECHNICAL REPORT NATICK/TR-89/024 et, THE EFFECT OF DRYCLEANING MOISTURE ON FUSED CLOTH SYSTEMS BY ELIZABETH J. MORELAND International...MOISTUP.E ON FUSED CLOTH SYSTEMS 12. PERSONAL AUTMOR(S) Elizabeth J. MorelanJ 13«. TYPE OF REPORT Final Technical Report 13b. TIME COVERED...This project was initiated to investigate the effect of moisture in drycleaning systems on preselected fused cloth structures. Adverse surface

Gradient-based multiresolution image fusion.

PubMed

Petrović, Valdimir S; Xydeas, Costas S

2004-02-01

A novel approach to multiresolution signal-level image fusion is presented for accurately transferring visual information from any number of input image signals, into a single fused image without loss of information or the introduction of distortion. The proposed system uses a "fuse-then-decompose" technique realized through a novel, fusion/decomposition system architecture. In particular, information fusion is performed on a multiresolution gradient map representation domain of image signal information. At each resolution, input images are represented as gradient maps and combined to produce new, fused gradient maps. Fused gradient map signals are processed, using gradient filters derived from high-pass quadrature mirror filters to yield a fused multiresolution pyramid representation. The fused output image is obtained by applying, on the fused pyramid, a reconstruction process that is analogous to that of conventional discrete wavelet transform. This new gradient fusion significantly reduces the amount of distortion artefacts and the loss of contrast information usually observed in fused images obtained from conventional multiresolution fusion schemes. This is because fusion in the gradient map domain significantly improves the reliability of the feature selection and information fusion processes. Fusion performance is evaluated through informal visual inspection and subjective psychometric preference tests, as well as objective fusion performance measurements. Results clearly demonstrate the superiority of this new approach when compared to conventional fusion systems.

Distributed Synchronization in Networks of Agent Systems With Nonlinearities and Random Switchings.

PubMed

Tang, Yang; Gao, Huijun; Zou, Wei; Kurths, Jürgen

2013-02-01

In this paper, the distributed synchronization problem of networks of agent systems with controllers and nonlinearities subject to Bernoulli switchings is investigated. Controllers and adaptive updating laws injected in each vertex of networks depend on the state information of its neighborhood. Three sets of Bernoulli stochastic variables are introduced to describe the occurrence probabilities of distributed adaptive controllers, updating laws and nonlinearities, respectively. By the Lyapunov functions method, we show that the distributed synchronization of networks composed of agent systems with multiple randomly occurring nonlinearities, multiple randomly occurring controllers, and multiple randomly occurring updating laws can be achieved in mean square under certain criteria. The conditions derived in this paper can be solved by semi-definite programming. Moreover, by mathematical analysis, we find that the coupling strength, the probabilities of the Bernoulli stochastic variables, and the form of nonlinearities have great impacts on the convergence speed and the terminal control strength. The synchronization criteria and the observed phenomena are demonstrated by several numerical simulation examples. In addition, the advantage of distributed adaptive controllers over conventional adaptive controllers is illustrated.

Naming games in two-dimensional and small-world-connected random geometric networks.

PubMed

Lu, Qiming; Korniss, G; Szymanski, B K

2008-01-01

We investigate a prototypical agent-based model, the naming game, on two-dimensional random geometric networks. The naming game [Baronchelli, J. Stat. Mech.: Theory Exp. (2006) P06014] is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the naming games with local broadcasts on random geometric graphs, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially embedded autonomous agents. Among the relevant observables capturing the temporal properties of the agreement process, we investigate the cluster-size distribution and the distribution of the agreement times, both exhibiting dynamic scaling. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a "small-world"-like network and yielding a significantly reduced time to reach global agreement. We construct a finite-size scaling analysis for the agreement times in this case.

Workers at CCAS attach solar panel to FUSE satellite.

NASA Technical Reports Server (NTRS)

1999-01-01

At Hangar AE, Cape Canaveral Air Station (CCAS), workers move a solar panel toward NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite before attaching it. FUSE was developed by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md., to investigate the origin and evolution of the lightest elements in the universe - hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. FUSE is targeted for launch June 23 from Launch Pad 17A, CCAS, aboard a Boeing Delta II rocket.

Workers at CCAS attach solar panel to FUSE satellite.

NASA Technical Reports Server (NTRS)

1999-01-01

At Hangar AE, Cape Canaveral Air Station (CCAS), workers check the installation of a solar panel on NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite. FUSE was developed by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md., to investigate the origin and evolution of the lightest elements in the universe - hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. FUSE is targeted for launch June 23 from Launch Pad 17A, CCAS, aboard a Boeing Delta II rocket.

Workers at CCAS attach solar panel to FUSE satellite.

NASA Technical Reports Server (NTRS)

1999-01-01

At Hangar AE, Cape Canaveral Air Station (CCAS), workers attach a solar panel to NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite. FUSE was developed by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md., to investigate the origin and evolution of the lightest elements in the universe - hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. FUSE is targeted for launch June 23 from Launch Pad 17A, CCAS, aboard a Boeing Delta II rocket.

The canister around the FUSE satellite is removed on the pad at CCAS.

NASA Technical Reports Server (NTRS)

1999-01-01

At Launch Pad 17A, Cape Canaveral Air Station (CCAS), workers begin to remove the canister around the top of the NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite. FUSE is designed to scour the cosmos for the fossil record of the origins of the universe hydrogen and deuterium. Scientists will use FUSE to study hydrogen and deuterium to unlock the secrets of how the primordial chemical elements of which all stars, planets and life evolved, were created and distributed since the birth of the universe. FUSE is scheduled to be launched from CCAS June 23 aboard a Boeing Delta II rocket.

The canister around the FUSE satellite is removed on the pad at CCAS.

NASA Technical Reports Server (NTRS)

1999-01-01

At Launch Pad 17A, Cape Canaveral Air Station (CCAS), workers oversee the removal of the canister from the top of NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite. FUSE is designed to scour the cosmos for the fossil record of the origins of the universe hydrogen and deuterium. Scientists will use FUSE to study hydrogen and deuterium to unlock the secrets of how the primordial chemical elements of which all stars, planets and life evolved, were created and distributed since the birth of the universe. FUSE is scheduled to be launched from CCAS June 23 aboard a Boeing Delta II rocket.

Fast-acting self-healing metallic fuse.

NASA Technical Reports Server (NTRS)

Schwartz, F. C.; Renton, C. A.; Rabinovici, B.

1971-01-01

Description of a fast-acting nonmechanical self-healing mercury fuse capable of protecting a high current circuit or device from overcurrent fault damages. Basically the self-healing fuse consists of two enclosed mercury reservoirs connected by a fine capillary tube filled with mercury that serves as the fusing element. It is pointed out that a better understanding of the energy conversion process involved in the operation of the device could help explore other device configurations (such as a tapering geometry and use of magnetic field to drive the arc into the fuse wall on inductive loads, etc.) and thus extend the range of capabilities for this type of protective device.

Self-healing fuse development.

NASA Technical Reports Server (NTRS)

Jones, N. D.

1972-01-01

The self-healing fuse is a very fast acting current overload protective device which opens and recloses in a few milliseconds. The fuse confines a mercury column in an insulated channel and returns the mercury to the channel after firing. Ratings 5 to 50 A at 600 peak volts are possible with a life of hundreds of cycles. Compared to conventional fuses, much less fault current energy fires the fuse by heating the mercury to boiling temperature. Next an arc discharge develops while explosive forces expel the liquid mercury from the channel. Then the high impedance arc either extinguishes immediately, or operates for a few milliseconds, until a switch opens the circuit.

Sequential defense against random and intentional attacks in complex networks.

PubMed

Chen, Pin-Yu; Cheng, Shin-Ming

2015-02-01

Network robustness against attacks is one of the most fundamental researches in network science as it is closely associated with the reliability and functionality of various networking paradigms. However, despite the study on intrinsic topological vulnerabilities to node removals, little is known on the network robustness when network defense mechanisms are implemented, especially for networked engineering systems equipped with detection capabilities. In this paper, a sequential defense mechanism is first proposed in complex networks for attack inference and vulnerability assessment, where the data fusion center sequentially infers the presence of an attack based on the binary attack status reported from the nodes in the network. The network robustness is evaluated in terms of the ability to identify the attack prior to network disruption under two major attack schemes, i.e., random and intentional attacks. We provide a parametric plug-in model for performance evaluation on the proposed mechanism and validate its effectiveness and reliability via canonical complex network models and real-world large-scale network topology. The results show that the sequential defense mechanism greatly improves the network robustness and mitigates the possibility of network disruption by acquiring limited attack status information from a small subset of nodes in the network.

Hole-assisted fiber based fiber fuse terminator supporting 22 W input

NASA Astrophysics Data System (ADS)

Tsujikawa, Kyozo; Kurokawa, Kenji; Hanzawa, Nobutomo; Nozoe, Saki; Matsui, Takashi; Nakajima, Kazuhide

2018-05-01

We investigated the air hole structure in hole-assisted fiber (HAF) with the aim of terminating fiber fuse propagation. We focused on two structural parameters c/MFD and S1/S2, which are related respectively to the position and area of the air holes, and mapped their appropriate values for terminating fiber fuse propagation. Here, MFD is the mode field diameter, c is the diameter of an inscribed circle linking the air holes, S1 is the total area of the air holes, and S2 is the area of a circumscribed circle linking the air holes. On the basis of these results, we successfully realized a compact fiber fuse terminator consisting of a 1.35 mm-long HAF, which can terminate fiber fuse propagation even with a 22 W input. In addition, we observed fiber fuse termination using a high-speed camera. We additionally confirmed that the HAF-based fiber fuse terminator is effective under various input power conditions. The penetration length of the optical discharge in the HAF was only less than 300 μm when the input power was from 2 to 22 W.

Workshop on Incomplete Network Data Held at Sandia National Labs – Livermore

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

Soundarajan, Sucheta; Wendt, Jeremy D.

2016-06-01

While network analysis is applied in a broad variety of scientific fields (including physics, computer science, biology, and the social sciences), how networks are constructed and the resulting bias and incompleteness have drawn more limited attention. For example, in biology, gene networks are typically developed via experiment -- many actual interactions are likely yet to be discovered. In addition to this incompleteness, the data-collection processes can introduce significant bias into the observed network datasets. For instance, if you observe part of the World Wide Web network through a classic random walk, then high degree nodes are more likely to bemore » found than if you had selected nodes at random. Unfortunately, such incomplete and biasing data collection methods must be often used.« less

An Efficient Distributed Compressed Sensing Algorithm for Decentralized Sensor Network.

PubMed

Liu, Jing; Huang, Kaiyu; Zhang, Guoxian

2017-04-20

We consider the joint sparsity Model 1 (JSM-1) in a decentralized scenario, where a number of sensors are connected through a network and there is no fusion center. A novel algorithm, named distributed compact sensing matrix pursuit (DCSMP), is proposed to exploit the computational and communication capabilities of the sensor nodes. In contrast to the conventional distributed compressed sensing algorithms adopting a random sensing matrix, the proposed algorithm focuses on the deterministic sensing matrices built directly on the real acquisition systems. The proposed DCSMP algorithm can be divided into two independent parts, the common and innovation support set estimation processes. The goal of the common support set estimation process is to obtain an estimated common support set by fusing the candidate support set information from an individual node and its neighboring nodes. In the following innovation support set estimation process, the measurement vector is projected into a subspace that is perpendicular to the subspace spanned by the columns indexed by the estimated common support set, to remove the impact of the estimated common support set. We can then search the innovation support set using an orthogonal matching pursuit (OMP) algorithm based on the projected measurement vector and projected sensing matrix. In the proposed DCSMP algorithm, the process of estimating the common component/support set is decoupled with that of estimating the innovation component/support set. Thus, the inaccurately estimated common support set will have no impact on estimating the innovation support set. It is proven that under the condition the estimated common support set contains the true common support set, the proposed algorithm can find the true innovation set correctly. Moreover, since the innovation support set estimation process is independent of the common support set estimation process, there is no requirement for the cardinality of both sets; thus, the proposed DCSMP algorithm is capable of tackling the unknown sparsity problem successfully.

Changing climates of conflict: A social network experiment in 56 schools

PubMed Central

Paluck, Elizabeth Levy; Shepherd, Hana; Aronow, Peter M.

2016-01-01

Theories of human behavior suggest that individuals attend to the behavior of certain people in their community to understand what is socially normative and adjust their own behavior in response. An experiment tested these theories by randomizing an anticonflict intervention across 56 schools with 24,191 students. After comprehensively measuring every school’s social network, randomly selected seed groups of 20–32 students from randomly selected schools were assigned to an intervention that encouraged their public stance against conflict at school. Compared with control schools, disciplinary reports of student conflict at treatment schools were reduced by 30% over 1 year. The effect was stronger when the seed group contained more “social referent” students who, as network measures reveal, attract more student attention. Network analyses of peer-to-peer influence show that social referents spread perceptions of conflict as less socially normative. PMID:26729884

Discrete gravity on random tensor network and holographic Rényi entropy

NASA Astrophysics Data System (ADS)

Han, Muxin; Huang, Shilin

2017-11-01

In this paper we apply the discrete gravity and Regge calculus to tensor networks and Anti-de Sitter/conformal field theory (AdS/CFT) correspondence. We construct the boundary many-body quantum state |Ψ〉 using random tensor networks as the holographic mapping, applied to the Wheeler-deWitt wave function of bulk Euclidean discrete gravity in 3 dimensions. The entanglement Rényi entropy of |Ψ〉 is shown to holographically relate to the on-shell action of Einstein gravity on a branch cover bulk manifold. The resulting Rényi entropy S n of |Ψ〉 approximates with high precision the Rényi entropy of ground state in 2-dimensional conformal field theory (CFT). In particular it reproduces the correct n dependence. Our results develop the framework of realizing the AdS3/CFT2 correspondence on random tensor networks, and provide a new proposal to approximate the CFT ground state.

Correcting Evaluation Bias of Relational Classifiers with Network Cross Validation

DTIC Science & Technology

2010-01-01

classi- fication algorithms: simple random resampling (RRS), equal-instance random resampling (ERS), and network cross-validation ( NCV ). The first two... NCV procedure that eliminates overlap between test sets altogether. The procedure samples for k disjoint test sets that will be used for evaluation...propLabeled ∗ S) nodes from train Pool in f erenceSet =network − trainSet F = F ∪ < trainSet, test Set, in f erenceSet > end for output: F NCV addresses

Structure of a randomly grown 2-d network.

PubMed

Ajazi, Fioralba; Napolitano, George M; Turova, Tatyana; Zaurbek, Izbassar

2015-10-01

We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons. Copyright © 2015 Elsevier Ireland Ltd. All rights reserved.

Introducing two Random Forest based methods for cloud detection in remote sensing images

NASA Astrophysics Data System (ADS)

Ghasemian, Nafiseh; Akhoondzadeh, Mehdi

2018-07-01

Cloud detection is a necessary phase in satellite images processing to retrieve the atmospheric and lithospheric parameters. Currently, some cloud detection methods based on Random Forest (RF) model have been proposed but they do not consider both spectral and textural characteristics of the image. Furthermore, they have not been tested in the presence of snow/ice. In this paper, we introduce two RF based algorithms, Feature Level Fusion Random Forest (FLFRF) and Decision Level Fusion Random Forest (DLFRF) to incorporate visible, infrared (IR) and thermal spectral and textural features (FLFRF) including Gray Level Co-occurrence Matrix (GLCM) and Robust Extended Local Binary Pattern (RELBP_CI) or visible, IR and thermal classifiers (DLFRF) for highly accurate cloud detection on remote sensing images. FLFRF first fuses visible, IR and thermal features. Thereafter, it uses the RF model to classify pixels to cloud, snow/ice and background or thick cloud, thin cloud and background. DLFRF considers visible, IR and thermal features (both spectral and textural) separately and inserts each set of features to RF model. Then, it holds vote matrix of each run of the model. Finally, it fuses the classifiers using the majority vote method. To demonstrate the effectiveness of the proposed algorithms, 10 Terra MODIS and 15 Landsat 8 OLI/TIRS images with different spatial resolutions are used in this paper. Quantitative analyses are based on manually selected ground truth data. Results show that after adding RELBP_CI to input feature set cloud detection accuracy improves. Also, the average cloud kappa values of FLFRF and DLFRF on MODIS images (1 and 0.99) are higher than other machine learning methods, Linear Discriminate Analysis (LDA), Classification And Regression Tree (CART), K Nearest Neighbor (KNN) and Support Vector Machine (SVM) (0.96). The average snow/ice kappa values of FLFRF and DLFRF on MODIS images (1 and 0.85) are higher than other traditional methods. The quantitative values on Landsat 8 images show similar trend. Consequently, while SVM and K-nearest neighbor show overestimation in predicting cloud and snow/ice pixels, our Random Forest (RF) based models can achieve higher cloud, snow/ice kappa values on MODIS and thin cloud, thick cloud and snow/ice kappa values on Landsat 8 images. Our algorithms predict both thin and thick cloud on Landsat 8 images while the existing cloud detection algorithm, Fmask cannot discriminate them. Compared to the state-of-the-art methods, our algorithms have acquired higher average cloud and snow/ice kappa values for different spatial resolutions.

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.

Greedy Gossip With Eavesdropping

NASA Astrophysics Data System (ADS)

Ustebay, Deniz; Oreshkin, Boris N.; Coates, Mark J.; Rabbat, Michael G.

2010-07-01

This paper presents greedy gossip with eavesdropping (GGE), a novel randomized gossip algorithm for distributed computation of the average consensus problem. In gossip algorithms, nodes in the network randomly communicate with their neighbors and exchange information iteratively. The algorithms are simple and decentralized, making them attractive for wireless network applications. In general, gossip algorithms are robust to unreliable wireless conditions and time varying network topologies. In this paper we introduce GGE and demonstrate that greedy updates lead to rapid convergence. We do not require nodes to have any location information. Instead, greedy updates are made possible by exploiting the broadcast nature of wireless communications. During the operation of GGE, when a node decides to gossip, instead of choosing one of its neighbors at random, it makes a greedy selection, choosing the node which has the value most different from its own. In order to make this selection, nodes need to know their neighbors' values. Therefore, we assume that all transmissions are wireless broadcasts and nodes keep track of their neighbors' values by eavesdropping on their communications. We show that the convergence of GGE is guaranteed for connected network topologies. We also study the rates of convergence and illustrate, through theoretical bounds and numerical simulations, that GGE consistently outperforms randomized gossip and performs comparably to geographic gossip on moderate-sized random geometric graph topologies.

Barrier breaching device

DOEpatents

Honodel, Charles A.

1985-01-01

A barrier breaching device that is designed primarily for opening holes in interior walls of buildings uses detonating fuse for explosive force. The fuse acts as the ribs or spokes of an umbrella-like device that may be opened up to form a cone. The cone is placed against the wall so that detonating fuse that rings the base of the device and which is ignited by the spoke-like fuses serves to cut a circular hole in the wall.

Barrier breaching device

DOEpatents

Honodel, C.A.

1983-06-01

A barrier breaching device that is designed primarily for opening holes in interior walls of buildings uses detonating fuse for explosive force. The fuse acts as the ribs or spokes of an umbrella-like device that may be opened up to form a cone. The cone is placed against the wall so that detonating fuse that rings the base of the device and which is ignited by the spoke-like fuses serves to cut a circular hole in the wall.

Quantification of Residual Stress from Photonic Signatures of Fused Silica

NASA Technical Reports Server (NTRS)

Cramer, K. Elliott; Hayward, Maurice; Yost, William E.

2013-01-01

A commercially available grey-field polariscope (GFP) instrument for photoelastic examination is used to assess impact damage inflicted upon the outer-most pane of Space Shuttle windows made from fused silica. A method and apparatus for calibration of the stress-optic coefficient using four-point bending is discussed. The results are validated on known material (acrylic) and are found to agree with literature values to within 6%. The calibration procedure is then applied to fused-silica specimens and the stress-optic coefficient is determined to be 2.43 +/- 0.54 x 10(exp -12)/Pa. Fused silica specimens containing impacts artificially made at NASA's Hypervelocity Impact Technology Facility (HIT-F), to simulate damage typical during space flight, are examined. The damage sites are cored from fused silica window carcasses and examined with the GFP. The calibrated GFP measurements of residual stress patterns surrounding the damage sites are presented. Keywords: Glass, fused silica, photoelasticity, residual stress

Dibenzo[a,f]perylene bisimide: effects of introducing two fused rings.

PubMed

Chaolumen; Enno, Hiroki; Murata, Michihisa; Wakamiya, Atsushi; Murata, Yasujiro

2014-11-01

Perylene bisimides (PBIs) are fascinating dyes with various potential applications. To study the effects of introducing a dibenzo-fused structure to the perylene moiety, π-extended PBI derivatives with a dibenzo-fused structure at both of the a and f bonds were synthesized. The twisted structure was characterized by X-ray crystal structure analysis. In the cyclic voltammograms, the dibenzo[a,f]-fused PBI showed a reversible oxidation wave at much less positive potential, relative to a dibenzo[a,o]-fused PBI derivative. These data indicated that two ring fusions at both sides of a naphthalene moiety, which construct a tetracene core, effectively raise the HOMO level compared to fusion of one ring at each naphthalene moiety (two anthracene cores). The dibenzo[a,f]-fused PBI derivative showed an absorption band at 735 nm with a shoulder band reaching 900 nm. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

KSC-99pp0380

NASA Image and Video Library

1999-04-05

Workers in Hangar AE, Cape Canaveral Air Station, begin removing the plastic covering from NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite before prelaunch processing. FUSE will undergo a functional test of its systems, followed by installation of the flight batteries and solar arrays. Tests are also scheduled for the communications and data systems linking FUSE with the spacecraft control center at The Johns Hopkins University, Baltimore, Md. FUSE was developed and will be operated by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md. FUSE will investigate the origin and evolution of the lightest elements in the universe hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. The launch aboard a Boeing Delta II rocket is targeted for May 20 at Launch Complex 17

KSC-99pp0382

NASA Image and Video Library

1999-04-05

At Hangar AE, Cape Canaveral Air Station, NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite stands alone after workstands have been removed. As part of prelaunch processing, FUSE will undergo a functional test of its systems, followed by installation of the flight batteries and solar arrays. Tests are also scheduled for the communications and data systems linking FUSE with the spacecraft control center at The Johns Hopkins University, Baltimore, Md. FUSE was developed and will be operated by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md. FUSE will investigate the origin and evolution of the lightest elements in the universe hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. The launch aboard a Boeing Delta II rocket is targeted for May 20 at Launch Complex 17

KSC-99pp0381

NASA Image and Video Library

1999-04-05

At Hangar AE, Cape Canaveral Air Station, NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite is unveiled before prelaunch processing. FUSE will undergo a functional test of its systems, followed by installation of the flight batteries and solar arrays. Tests are also scheduled for the communications and data systems linking FUSE with the spacecraft control center at The Johns Hopkins University, Baltimore, Md. FUSE was developed and will be operated by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md. FUSE will investigate the origin and evolution of the lightest elements in the universe hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. The launch aboard a Boeing Delta II rocket is targeted for May 20 at Launch Complex 17

KSC-99pp0379

NASA Image and Video Library

1999-04-05

Workers in Hangar AE, Cape Canaveral Air Station, get ready to remove the protective shipping cover from NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite for prelaunch processing. FUSE will undergo a functional test of its systems, followed by installation of the flight batteries and solar arrays. Tests are also scheduled for the communications and data systems linking FUSE with the spacecraft control center at The Johns Hopkins University, Baltimore, Md. FUSE was developed and will be operated by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md. FUSE will investigate the origin and evolution of the lightest elements in the universe hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. The launch aboard a Boeing Delta II rocket is targeted for May 20 at Launch Complex 17

Comparing monolithic and fused core HPLC columns for fast chromatographic analysis of fat-soluble vitamins.

PubMed

Kurdi, Said El; Muaileq, Dina Abu; Alhazmi, Hassan A; Bratty, Mohammed Al; Deeb, Sami El

2017-06-27

HPLC stationary phases of monolithic and fused core type can be used to achieve fast chromatographic separation as an alternative to UPLC. In this study, monolithic and fused core stationary phases are compared for fast separation of four fat-soluble vitamins. Three new methods on the first and second generation monolithic silica RP-18e columns and a fused core pentafluoro-phenyl propyl column were developed. Application of three fused core columns offered comparable separations of retinyl palmitate, DL-α-tocopheryl acetate, cholecalciferol and menadione in terms of elution speed and separation efficiency. Separation was achieved in approx. 5 min with good resolution (Rs > 5) and precision (RSD ≤ 0.6 %). Monolithic columns showed, however, a higher number of theoretical plates, better precision and lower column backpressure than the fused core column. The three developed methods were successfully applied to separate and quantitate fat-soluble vitamins in commercial products.

Lignin-based active anode materials synthesized from low-cost renewable resources

DOEpatents

Rios, Orlando; Tenhaeff, Wyatt Evan; Daniel, Claus; Dudney, Nancy Johnston; Johs, Alexander; Nunnery, Grady Alexander; Baker, Frederick Stanley

2016-06-07

A method of making an anode includes the steps of providing fibers from a carbonaceous precursor, the carbon fibers having a glass transition temperature T.sub.g. In one aspect the carbonaceous precursor is lignin. The carbonaceous fibers are placed into a layered fiber mat. The fiber mat is fused by heating the fiber mat in the presence of oxygen to above the T.sub.g but no more than 20% above the T.sub.g to fuse fibers together at fiber to fiber contact points and without melting the bulk fiber mat to create a fused fiber mat through oxidative stabilization. The fused fiber mat is carbonized by heating the fused fiber mat to at least 650.degree. C. under an inert atmosphere to create a carbonized fused fiber mat. A battery anode formed from carbonaceous precursor fibers is also disclosed.

Integration of Network Topological and Connectivity Properties for Neuroimaging Classification

PubMed Central

Jie, Biao; Gao, Wei; Wang, Qian; Wee, Chong-Yaw

2014-01-01

Rapid advances in neuroimaging techniques have provided an efficient and noninvasive way for exploring the structural and functional connectivity of the human brain. Quantitative measurement of abnormality of brain connectivity in patients with neurodegenerative diseases, such as mild cognitive impairment (MCI) and Alzheimer’s disease (AD), have also been widely reported, especially at a group level. Recently, machine learning techniques have been applied to the study of AD and MCI, i.e., to identify the individuals with AD/MCI from the healthy controls (HCs). However, most existing methods focus on using only a single property of a connectivity network, although multiple network properties, such as local connectivity and global topological properties, can potentially be used. In this paper, by employing multikernel based approach, we propose a novel connectivity based framework to integrate multiple properties of connectivity network for improving the classification performance. Specifically, two different types of kernels (i.e., vector-based kernel and graph kernel) are used to quantify two different yet complementary properties of the network, i.e., local connectivity and global topological properties. Then, multikernel learning (MKL) technique is adopted to fuse these heterogeneous kernels for neuroimaging classification. We test the performance of our proposed method on two different data sets. First, we test it on the functional connectivity networks of 12 MCI and 25 HC subjects. The results show that our method achieves significant performance improvement over those using only one type of network property. Specifically, our method achieves a classification accuracy of 91.9%, which is 10.8% better than those by single network-property-based methods. Then, we test our method for gender classification on a large set of functional connectivity networks with 133 infants scanned at birth, 1 year, and 2 years, also demonstrating very promising results. PMID:24108708

DeepMitosis: Mitosis detection via deep detection, verification and segmentation networks.

PubMed

Li, Chao; Wang, Xinggang; Liu, Wenyu; Latecki, Longin Jan

2018-04-01

Mitotic count is a critical predictor of tumor aggressiveness in the breast cancer diagnosis. Nowadays mitosis counting is mainly performed by pathologists manually, which is extremely arduous and time-consuming. In this paper, we propose an accurate method for detecting the mitotic cells from histopathological slides using a novel multi-stage deep learning framework. Our method consists of a deep segmentation network for generating mitosis region when only a weak label is given (i.e., only the centroid pixel of mitosis is annotated), an elaborately designed deep detection network for localizing mitosis by using contextual region information, and a deep verification network for improving detection accuracy by removing false positives. We validate the proposed deep learning method on two widely used Mitosis Detection in Breast Cancer Histological Images (MITOSIS) datasets. Experimental results show that we can achieve the highest F-score on the MITOSIS dataset from ICPR 2012 grand challenge merely using the deep detection network. For the ICPR 2014 MITOSIS dataset that only provides the centroid location of mitosis, we employ the segmentation model to estimate the bounding box annotation for training the deep detection network. We also apply the verification model to eliminate some false positives produced from the detection model. By fusing scores of the detection and verification models, we achieve the state-of-the-art results. Moreover, our method is very fast with GPU computing, which makes it feasible for clinical practice. Copyright © 2018 Elsevier B.V. All rights reserved.

30 CFR 75.601-2 - Short circuit protection; use of fuses; approval by the Secretary.

Code of Federal Regulations, 2010 CFR

2010-07-01

... Trailing Cables § 75.601-2 Short circuit protection; use of fuses; approval by the Secretary. Fuses shall not be employed to provide short circuit protection for trailing cables unless specifically approved...

Blast Off into Space Science with Fuses.

ERIC Educational Resources Information Center

Bombaugh, Ruth

2000-01-01

Introduces an activity in which students build a fuse with steel, wood, light bulbs, copper wire, clay, and batteries. Uses the cross-age instructional approach to teach about the value of instructional time. Contains directions for building a fuse. (YDS)

FET proteins TAF15 and EWS are selective markers that distinguish FTLD with FUS pathology from amyotrophic lateral sclerosis with FUS mutations.

PubMed

Neumann, Manuela; Bentmann, Eva; Dormann, Dorothee; Jawaid, Ali; DeJesus-Hernandez, Mariely; Ansorge, Olaf; Roeber, Sigrun; Kretzschmar, Hans A; Munoz, David G; Kusaka, Hirofumi; Yokota, Osamu; Ang, Lee-Cyn; Bilbao, Juan; Rademakers, Rosa; Haass, Christian; Mackenzie, Ian R A

2011-09-01

Accumulation of the DNA/RNA binding protein fused in sarcoma as cytoplasmic inclusions in neurons and glial cells is the pathological hallmark of all patients with amyotrophic lateral sclerosis with mutations in FUS as well as in several subtypes of frontotemporal lobar degeneration, which are not associated with FUS mutations. The mechanisms leading to inclusion formation and fused in sarcoma-associated neurodegeneration are only poorly understood. Because fused in sarcoma belongs to a family of proteins known as FET, which also includes Ewing's sarcoma and TATA-binding protein-associated factor 15, we investigated the potential involvement of these other FET protein family members in the pathogenesis of fused in sarcoma proteinopathies. Immunohistochemical analysis of FET proteins revealed a striking difference among the various conditions, with pathology in amyotrophic lateral sclerosis with FUS mutations being labelled exclusively for fused in sarcoma, whereas fused in sarcoma-positive inclusions in subtypes of frontotemporal lobar degeneration also consistently immunostained for TATA-binding protein-associated factor 15 and variably for Ewing's sarcoma. Immunoblot analysis of proteins extracted from post-mortem tissue of frontotemporal lobar degeneration with fused in sarcoma pathology demonstrated a relative shift of all FET proteins towards insoluble protein fractions, while genetic analysis of the TATA-binding protein-associated factor 15 and Ewing's sarcoma gene did not identify any pathogenic variants. Cell culture experiments replicated the findings of amyotrophic lateral sclerosis with FUS mutations by confirming the absence of TATA-binding protein-associated factor 15 and Ewing's sarcoma alterations upon expression of mutant fused in sarcoma. In contrast, all endogenous FET proteins were recruited into cytoplasmic stress granules upon general inhibition of Transportin-mediated nuclear import, mimicking the findings in frontotemporal lobar degeneration with fused in sarcoma pathology. These results allow a separation of fused in sarcoma proteinopathies caused by FUS mutations from those without a known genetic cause based on neuropathological features. More importantly, our data imply different pathological processes underlying inclusion formation and cell death between both conditions; the pathogenesis in amyotrophic lateral sclerosis with FUS mutations appears to be more restricted to dysfunction of fused in sarcoma, while a more global and complex dysregulation of all FET proteins is involved in the subtypes of frontotemporal lobar degeneration with fused in sarcoma pathology.

Modeling Verdict Outcomes Using Social Network Measures: The Watergate and Caviar Network Cases

PubMed Central

2016-01-01

Modelling criminal trial verdict outcomes using social network measures is an emerging research area in quantitative criminology. Few studies have yet analyzed which of these measures are the most important for verdict modelling or which data classification techniques perform best for this application. To compare the performance of different techniques in classifying members of a criminal network, this article applies three different machine learning classifiers–Logistic Regression, Naïve Bayes and Random Forest–with a range of social network measures and the necessary databases to model the verdicts in two real–world cases: the U.S. Watergate Conspiracy of the 1970’s and the now–defunct Canada–based international drug trafficking ring known as the Caviar Network. In both cases it was found that the Random Forest classifier did better than either Logistic Regression or Naïve Bayes, and its superior performance was statistically significant. This being so, Random Forest was used not only for classification but also to assess the importance of the measures. For the Watergate case, the most important one proved to be betweenness centrality while for the Caviar Network, it was the effective size of the network. These results are significant because they show that an approach combining machine learning with social network analysis not only can generate accurate classification models but also helps quantify the importance social network variables in modelling verdict outcomes. We conclude our analysis with a discussion and some suggestions for future work in verdict modelling using social network measures. PMID:26824351

Workers at CCAS attach solar panel to FUSE satellite.

NASA Technical Reports Server (NTRS)

1999-01-01

At Hangar AE, Cape Canaveral Air Station (CCAS), workers get ready to move a solar panel to be attached to NASA's Far Ultraviolet Spectroscopic Explorer (FUSE) satellite in the background. FUSE was developed by The Johns Hopkins University under contract to Goddard Space Flight Center, Greenbelt, Md., to investigate the origin and evolution of the lightest elements in the universe - hydrogen and deuterium. In addition, the FUSE satellite will examine the forces and process involved in the evolution of the galaxies, stars and planetary systems by investigating light in the far ultraviolet portion of the electromagnetic spectrum. FUSE is targeted for launch June 23 from Launch Pad 17A, CCAS, aboard a Boeing Delta II rocket.

Measuring In-Situ Mdf Velocity Of Detonation

DOEpatents

Horine, Frank M.; James, Jr., Forrest B.

2005-10-25

A system for determining the velocity of detonation of a mild detonation fuse mounted on the surface of a device includes placing the device in a predetermined position with respect to an apparatus that carries a couple of sensors that sense the passage of a detonation wave at first and second spaced locations along the fuse. The sensors operate a timer and the time and distance between the locations is used to determine the velocity of detonation. The sensors are preferably electrical contacts that are held spaced from but close to the fuse such that expansion of the fuse caused by detonation causes the fuse to touch the contact, causing an electrical signal to actuate the timer.

SINA: A test system for proximity fuses

NASA Astrophysics Data System (ADS)

Ruizenaar, M. G. A.

1989-04-01

SINA, a signal generator that can be used for testing proximity fuses, is described. The circuitry of proximity fuses is presented; the output signal of the RF circuit results from a mixing of the emitted signal and received signal that is Doppler shifted in frequency by the relative motion of the fuse with respect to the reflecting target of surface. With SINA, digitized and stored target and clutter signals (previously measured) can be transformed to Doppler signals, for example during a real flight. SINA can be used for testing fuse circuitry, for example in the verification of results of computer simulations of the low frequency Doppler signal processing. The software of SINA and its use are explained.

Enhanced image fusion using directional contrast rules in fuzzy transform domain.

PubMed

Nandal, Amita; Rosales, Hamurabi Gamboa

2016-01-01

In this paper a novel image fusion algorithm based on directional contrast in fuzzy transform (FTR) domain is proposed. Input images to be fused are first divided into several non-overlapping blocks. The components of these sub-blocks are fused using directional contrast based fuzzy fusion rule in FTR domain. The fused sub-blocks are then transformed into original size blocks using inverse-FTR. Further, these inverse transformed blocks are fused according to select maximum based fusion rule for reconstructing the final fused image. The proposed fusion algorithm is both visually and quantitatively compared with other standard and recent fusion algorithms. Experimental results demonstrate that the proposed method generates better results than the other methods.