Constructing an Intelligent Patent Network Analysis Method
Chao-Chan Wu; Ching-Bang Yao
2012-01-01
Patent network analysis, an advanced method of patent analysis, is a useful tool for technology management. This method visually displays all the relationships among the patents and enables the analysts to intuitively comprehend the overview of a set of patents in the field of the technology being studied. Although patent network analysis possesses relative advantages different from traditional methods of patent analysis, it is subject to several crucial limitations. To overcome the drawbacks...
Constructing an Intelligent Patent Network Analysis Method
Directory of Open Access Journals (Sweden)
Chao-Chan Wu
2012-11-01
Full Text Available Patent network analysis, an advanced method of patent analysis, is a useful tool for technology management. This method visually displays all the relationships among the patents and enables the analysts to intuitively comprehend the overview of a set of patents in the field of the technology being studied. Although patent network analysis possesses relative advantages different from traditional methods of patent analysis, it is subject to several crucial limitations. To overcome the drawbacks of the current method, this study proposes a novel patent analysis method, called the intelligent patent network analysis method, to make a visual network with great precision. Based on artificial intelligence techniques, the proposed method provides an automated procedure for searching patent documents, extracting patent keywords, and determining the weight of each patent keyword in order to generate a sophisticated visualization of the patent network. This study proposes a detailed procedure for generating an intelligent patent network that is helpful for improving the efficiency and quality of patent analysis. Furthermore, patents in the field of Carbon Nanotube Backlight Unit (CNT-BLU were analyzed to verify the utility of the proposed method.
Computer methods in electric network analysis
Energy Technology Data Exchange (ETDEWEB)
Saver, P.; Hajj, I.; Pai, M.; Trick, T.
1983-06-01
The computational algorithms utilized in power system analysis have more than just a minor overlap with those used in electronic circuit computer aided design. This paper describes the computer methods that are common to both areas and highlights the differences in application through brief examples. Recognizing this commonality has stimulated the exchange of useful techniques in both areas and has the potential of fostering new approaches to electric network analysis through the interchange of ideas.
Spectral Analysis Methods of Social Networks
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2017-01-01
Full Text Available Online social networks (such as Facebook, Twitter, VKontakte, etc. being an important channel for disseminating information are often used to arrange an impact on the social consciousness for various purposes - from advertising products or services to the full-scale information war thereby making them to be a very relevant object of research. The paper reviewed the analysis methods of social networks (primarily, online, based on the spectral theory of graphs. Such methods use the spectrum of the social graph, i.e. a set of eigenvalues of its adjacency matrix, and also the eigenvectors of the adjacency matrix.Described measures of centrality (in particular, centrality based on the eigenvector and PageRank, which reflect a degree of impact one or another user of the social network has. A very popular PageRank measure uses, as a measure of centrality, the graph vertices, the final probabilities of the Markov chain, whose matrix of transition probabilities is calculated on the basis of the adjacency matrix of the social graph. The vector of final probabilities is an eigenvector of the matrix of transition probabilities.Presented a method of dividing the graph vertices into two groups. It is based on maximizing the network modularity by computing the eigenvector of the modularity matrix.Considered a method for detecting bots based on the non-randomness measure of a graph to be computed using the spectral coordinates of vertices - sets of eigenvector components of the adjacency matrix of a social graph.In general, there are a number of algorithms to analyse social networks based on the spectral theory of graphs. These algorithms show very good results, but their disadvantage is the relatively high (albeit polynomial computational complexity for large graphs.At the same time it is obvious that the practical application capacity of the spectral graph theory methods is still underestimated, and it may be used as a basis to develop new methods.The work
Exploration Knowledge Sharing Networks Using Social Network Analysis Methods
Directory of Open Access Journals (Sweden)
Győző Attila Szilágyi
2017-10-01
Full Text Available Knowledge sharing within organization is one of the key factor for success. The organization, where knowledge sharing takes place faster and more efficiently, is able to adapt to changes in the market environment more successfully, and as a result, it may obtain a competitive advantage. Knowledge sharing in an organization is carried out through formal and informal human communication contacts during work. This forms a multi-level complex network whose quantitative and topological characteristics largely determine how quickly and to what extent the knowledge travels within organization. The study presents how different networks of knowledge sharing in the organization can be explored by means of network analysis methods through a case study, and which role play the properties of these networks in fast and sufficient spread of knowledge in organizations. The study also demonstrates the practical applications of our research results. Namely, on the basis of knowledge sharing educational strategies can be developed in an organization, and further, competitiveness of an organization may increase due to those strategies’ application.
Method and tool for network vulnerability analysis
Swiler, Laura Painton [Albuquerque, NM; Phillips, Cynthia A [Albuquerque, NM
2006-03-14
A computer system analysis tool and method that will allow for qualitative and quantitative assessment of security attributes and vulnerabilities in systems including computer networks. The invention is based on generation of attack graphs wherein each node represents a possible attack state and each edge represents a change in state caused by a single action taken by an attacker or unwitting assistant. Edges are weighted using metrics such as attacker effort, likelihood of attack success, or time to succeed. Generation of an attack graph is accomplished by matching information about attack requirements (specified in "attack templates") to information about computer system configuration (contained in a configuration file that can be updated to reflect system changes occurring during the course of an attack) and assumed attacker capabilities (reflected in "attacker profiles"). High risk attack paths, which correspond to those considered suited to application of attack countermeasures given limited resources for applying countermeasures, are identified by finding "epsilon optimal paths."
Mixed Methods Analysis of Enterprise Social Networks
DEFF Research Database (Denmark)
Behrendt, Sebastian; Richter, Alexander; Trier, Matthias
2014-01-01
The increasing use of enterprise social networks (ESN) generates vast amounts of data, giving researchers and managerial decision makers unprecedented opportunities for analysis. However, more transparency about the available data dimensions and how these can be combined is needed to yield accurate...
Sensor Network Information Analytical Methods: Analysis of Similarities and Differences
Directory of Open Access Journals (Sweden)
Chen Jian
2014-04-01
Full Text Available In the Sensor Network information engineering literature, few references focus on the definition and design of Sensor Network information analytical methods. Among those that do are Munson, et al. and the ISO standards on functional size analysis. To avoid inconsistent vocabulary and potentially incorrect interpretation of data, Sensor Network information analytical methods must be better designed, including definitions, analysis principles, analysis rules, and base units. This paper analyzes the similarities and differences across three different views of analytical methods, and uses a process proposed for the design of Sensor Network information analytical methods to analyze two examples of such methods selected from the literature.
Comparative analysis of quantitative efficiency evaluation methods for transportation networks.
He, Yuxin; Qin, Jin; Hong, Jian
2017-01-01
An effective evaluation of transportation network efficiency could offer guidance for the optimal control of urban traffic. Based on the introduction and related mathematical analysis of three quantitative evaluation methods for transportation network efficiency, this paper compares the information measured by them, including network structure, traffic demand, travel choice behavior and other factors which affect network efficiency. Accordingly, the applicability of various evaluation methods is discussed. Through analyzing different transportation network examples it is obtained that Q-H method could reflect the influence of network structure, traffic demand and user route choice behavior on transportation network efficiency well. In addition, the transportation network efficiency measured by this method and Braess's Paradox can be explained with each other, which indicates a better evaluation of the real operation condition of transportation network. Through the analysis of the network efficiency calculated by Q-H method, it can also be drawn that a specific appropriate demand is existed to a given transportation network. Meanwhile, under the fixed demand, both the critical network structure that guarantees the stability and the basic operation of the network and a specific network structure contributing to the largest value of the transportation network efficiency can be identified.
Quantitative methods for ecological network analysis.
Ulanowicz, Robert E
2004-12-01
The analysis of networks of ecological trophic transfers is a useful complement to simulation modeling in the quest for understanding whole-ecosystem dynamics. Trophic networks can be studied in quantitative and systematic fashion at several levels. Indirect relationships between any two individual taxa in an ecosystem, which often differ in either nature or magnitude from their direct influences, can be assayed using techniques from linear algebra. The same mathematics can also be employed to ascertain where along the trophic continuum any individual taxon is operating, or to map the web of connections into a virtual linear chain that summarizes trophodynamic performance by the system. Backtracking algorithms with pruning have been written which identify pathways for the recycle of materials and energy within the system. The pattern of such cycling often reveals modes of control or types of functions exhibited by various groups of taxa. The performance of the system as a whole at processing material and energy can be quantified using information theory. In particular, the complexity of process interactions can be parsed into separate terms that distinguish organized, efficient performance from the capacity for further development and recovery from disturbance. Finally, the sensitivities of the information-theoretic system indices appear to identify the dynamical bottlenecks in ecosystem functioning.
Dynamic analysis of biochemical network using complex network method
Directory of Open Access Journals (Sweden)
Wang Shuqiang
2015-01-01
Full Text Available In this study, the stochastic biochemical reaction model is proposed based on the law of mass action and complex network theory. The dynamics of biochemical reaction system is presented as a set of non-linear differential equations and analyzed at the molecular-scale. Given the initial state and the evolution rules of the biochemical reaction system, the system can achieve homeostasis. Compared with random graph, the biochemical reaction network has larger information capacity and is more efficient in information transmission. This is consistent with theory of evolution.
Utilization of Selected Data Mining Methods for Communication Network Analysis
Directory of Open Access Journals (Sweden)
V. Ondryhal
2011-06-01
Full Text Available The aim of the project was to analyze the behavior of military communication networks based on work with real data collected continuously since 2005. With regard to the nature and amount of the data, data mining methods were selected for the purpose of analyses and experiments. The quality of real data is often insufficient for an immediate analysis. The article presents the data cleaning operations which have been carried out with the aim to improve the input data sample to obtain reliable models. Gradually, by means of properly chosen SW, network models were developed to verify generally valid patterns of network behavior as a bulk service. Furthermore, unlike the commercially available communication networks simulators, the models designed allowed us to capture nonstandard models of network behavior under an increased load, verify the correct sizing of the network to the increased load, and thus test its reliability. Finally, based on previous experience, the models enabled us to predict emergency situations with a reasonable accuracy.
Noniterative convex optimization methods for network component analysis.
Jacklin, Neil; Ding, Zhi; Chen, Wei; Chang, Chunqi
2012-01-01
This work studies the reconstruction of gene regulatory networks by the means of network component analysis (NCA). We will expound a family of convex optimization-based methods for estimating the transcription factor control strengths and the transcription factor activities (TFAs). The approach taken in this work is to decompose the problem into a network connectivity strength estimation phase and a transcription factor activity estimation phase. In the control strength estimation phase, we formulate a new subspace-based method incorporating a choice of multiple error metrics. For the source estimation phase we propose a total least squares (TLS) formulation that generalizes many existing methods. Both estimation procedures are noniterative and yield the optimal estimates according to various proposed error metrics. We test the performance of the proposed algorithms on simulated data and experimental gene expression data for the yeast Saccharomyces cerevisiae and demonstrate that the proposed algorithms have superior effectiveness in comparison with both Bayesian Decomposition (BD) and our previous FastNCA approach, while the computational complexity is still orders of magnitude less than BD.
Decomposition method for analysis of closed queuing networks
Directory of Open Access Journals (Sweden)
Yu. G. Nesterov
2014-01-01
Full Text Available This article deals with the method to estimate the average residence time in nodes of closed queuing networks with priorities and a wide range of conservative disciplines to be served. The method is based on a decomposition of entire closed queuing network into a set of simple basic queuing systems such as M|GI|m|N for each node. The unknown average residence times in the network nodes are interrelated through a system of nonlinear equations. The fact that there is a solution of this system has been proved. An iterative procedure based on Newton-Kantorovich method is proposed for finding the solution of such system. This procedure provides fast convergence to solution. Today possibilities of proposed method are limited by known analytical solutions for simple basic queuing systems of M|GI|m|N type.
Spatial Analysis Along Networks Statistical and Computational Methods
Okabe, Atsuyuki
2012-01-01
In the real world, there are numerous and various events that occur on and alongside networks, including the occurrence of traffic accidents on highways, the location of stores alongside roads, the incidence of crime on streets and the contamination along rivers. In order to carry out analyses of those events, the researcher needs to be familiar with a range of specific techniques. Spatial Analysis Along Networks provides a practical guide to the necessary statistical techniques and their computational implementation. Each chapter illustrates a specific technique, from Stochastic Point Process
Thermal Analysis of AC Contactor Using Thermal Network Finite Difference Analysis Method
Niu, Chunping; Chen, Degui; Li, Xingwen; Geng, Yingsan
To predict the thermal behavior of switchgear quickly, the Thermal Network Finite Difference Analysis method (TNFDA) is adopted in thermal analysis of AC contactor in the paper. The thermal network model is built with nodes, thermal resistors and heat generators, and it is solved using finite difference method (FDM). The main circuit and the control system are connected by thermal resistors network, which solves the problem of multi-sources interaction in the application of TNFDA. The temperature of conducting wires is calculated according to the heat transfer process and the fundamental equations of thermal conduction. It provides a method to solve the problem of boundary conditions in applying the TNFDA. The comparison between the results of TNFDA and measurements shows the feasibility and practicability of the method.
Capturing complexity: Mixing methods in the analysis of a European tobacco control policy network.
Weishaar, Heide; Amos, Amanda; Collin, Jeff
Social network analysis (SNA), a method which can be used to explore networks in various contexts, has received increasing attention. Drawing on the development of European smoke-free policy, this paper explores how a mixed method approach to SNA can be utilised to investigate a complex policy network. Textual data from public documents, consultation submissions and websites were extracted, converted and analysed using plagiarism detection software and quantitative network analysis, and qualitative data from public documents and 35 interviews were thematically analysed. While the quantitative analysis enabled understanding of the network's structure and components, the qualitative analysis provided in-depth information about specific actors' positions, relationships and interactions. The paper establishes that SNA is suited to empirically testing and analysing networks in EU policymaking. It contributes to methodological debates about the antagonism between qualitative and quantitative approaches and demonstrates that qualitative and quantitative network analysis can offer a powerful tool for policy analysis.
Motif-Synchronization: A new method for analysis of dynamic brain networks with EEG
Rosário, R. S.; Cardoso, P. T.; Muñoz, M. A.; Montoya, P.; Miranda, J. G. V.
2015-12-01
The major aim of this work was to propose a new association method known as Motif-Synchronization. This method was developed to provide information about the synchronization degree and direction between two nodes of a network by counting the number of occurrences of some patterns between any two time series. The second objective of this work was to present a new methodology for the analysis of dynamic brain networks, by combining the Time-Varying Graph (TVG) method with a directional association method. We further applied the new algorithms to a set of human electroencephalogram (EEG) signals to perform a dynamic analysis of the brain functional networks (BFN).
Liu, Jianxiao; Tian, Zonglin
2017-01-01
Mining the genes related to maize carotenoid components is important to improve the carotenoid content and the quality of maize. On the basis of using the entropy estimation method with Gaussian kernel probability density estimator, we use the three-phase dependency analysis (TPDA) Bayesian network structure learning method to construct the network of maize gene and carotenoid components traits. In the case of using two discretization methods and setting different discretization values, we compare the learning effect and efficiency of 10 kinds of Bayesian network structure learning methods. The method is verified and analyzed on the maize dataset of global germplasm collection with 527 elite inbred lines. The result confirmed the effectiveness of the TPDA method, which outperforms significantly another 9 kinds of Bayesian network learning methods. It is an efficient method of mining genes for maize carotenoid components traits. The parameters obtained by experiments will help carry out practical gene mining effectively in the future.
Curtis David
2007-01-01
Abstract Background Debate remains as to the optimal method for utilising genotype data obtained from multiple markers in case-control association studies. I and colleagues have previously described a method of association analysis using artificial neural networks (ANNs), whose performance compared favourably to single-marker methods. Here, the perfomance of ANN analysis is compared with other multi-marker methods, comprising different haplotype-based analyses and locus-based analyses. Result...
The QAP weighted network analysis method and its application in international services trade
Xu, Helian; Cheng, Long
2016-04-01
Based on QAP (Quadratic Assignment Procedure) correlation and complex network theory, this paper puts forward a new method named QAP Weighted Network Analysis Method. The core idea of the method is to analyze influences among relations in a social or economic group by building a QAP weighted network of networks of relations. In the QAP weighted network, a node depicts a relation and an undirect edge exists between any pair of nodes if there is significant correlation between relations. As an application of the QAP weighted network, we study international services trade by using the QAP weighted network, in which nodes depict 10 kinds of services trade relations. After the analysis of international services trade by QAP weighted network, and by using distance indicators, hierarchy tree and minimum spanning tree, the conclusion shows that: Firstly, significant correlation exists in all services trade, and the development of any one service trade will stimulate the other nine. Secondly, as the economic globalization goes deeper, correlations in all services trade have been strengthened continually, and clustering effects exist in those services trade. Thirdly, transportation services trade, computer and information services trade and communication services trade have the most influence and are at the core in all services trade.
Mixed methods analysis of urban environmental stewardship networks
James J.T. Connolly; Erika S. Svendsen; Dana R. Fisher; Lindsay K. Campbell
2015-01-01
While mixed methods approaches to research have been accepted practice within the social sciences for several decades (Tashakkori and Teddlie 2003), the rising demand for cross-disciplinary analyses of socio-environmental processes has necessitated a renewed examination of this approach within environmental studies. Urban environmental stewardship is one area where it...
Contextualized Network Analysis: Theory and Methods for Networks with Node Covariates
Binkiewicz, Norbert M.
Biological and social systems consist of myriad interacting units. The interactions can be intuitively represented in the form of a graph or network. Measurements of these graphs can reveal the underlying structure of these interactions, which provides insight into the systems that generated the graphs. Moreover, in applications such as neuroconnectomics, social networks, and genomics, graph data is accompanied by contextualizing measures on each node. We leverage these node covariates to help uncover latent communities, using a modification of spectral clustering. Statistical guarantees are provided under a joint mixture model called the node contextualized stochastic blockmodel, including a bound on the mis-clustering rate. For most simulated conditions, covariate assisted spectral clustering yields superior results relative to both regularized spectral clustering without node covariates and an adaptation of canonical correlation analysis. We apply covariate assisted spectral clustering to large brain graphs derived from diffusion MRI, using the node locations or neurological regions as covariates. In both cases, covariate assisted spectral clustering yields clusters that are easier to interpret neurologically. A low rank update algorithm is developed to reduce the computational cost of determining the tuning parameter for covariate assisted spectral clustering. As simulations demonstrate, the low rank update algorithm increases the speed of covariate assisted spectral clustering up to ten-fold, while practically matching the clustering performance of the standard algorithm. Graphs with node attributes are sometimes accompanied by ground truth labels that align closely with the latent communities in the graph. We consider the example of a mouse retina neuron network accompanied by the neuron spatial location and neuronal cell types. In this example, the neuronal cell type is considered a ground truth label. Current approaches for defining neuronal cell type vary
Directory of Open Access Journals (Sweden)
Joshi Anagha
2009-05-01
Full Text Available Abstract Background A myriad of methods to reverse-engineer transcriptional regulatory networks have been developed in recent years. Direct methods directly reconstruct a network of pairwise regulatory interactions while module-based methods predict a set of regulators for modules of coexpressed genes treated as a single unit. To date, there has been no systematic comparison of the relative strengths and weaknesses of both types of methods. Results We have compared a recently developed module-based algorithm, LeMoNe (Learning Module Networks, to a mutual information based direct algorithm, CLR (Context Likelihood of Relatedness, using benchmark expression data and databases of known transcriptional regulatory interactions for Escherichia coli and Saccharomyces cerevisiae. A global comparison using recall versus precision curves hides the topologically distinct nature of the inferred networks and is not informative about the specific subtasks for which each method is most suited. Analysis of the degree distributions and a regulator specific comparison show that CLR is 'regulator-centric', making true predictions for a higher number of regulators, while LeMoNe is 'target-centric', recovering a higher number of known targets for fewer regulators, with limited overlap in the predicted interactions between both methods. Detailed biological examples in E. coli and S. cerevisiae are used to illustrate these differences and to prove that each method is able to infer parts of the network where the other fails. Biological validation of the inferred networks cautions against over-interpreting recall and precision values computed using incomplete reference networks. Conclusion Our results indicate that module-based and direct methods retrieve largely distinct parts of the underlying transcriptional regulatory networks. The choice of algorithm should therefore be based on the particular biological problem of interest and not on global metrics which cannot be
Directory of Open Access Journals (Sweden)
Pengyu Gao
2016-03-01
Full Text Available It is difficult to forecast the well productivity because of the complexity of vertical and horizontal developments in fluvial facies reservoir. This paper proposes a method based on Principal Component Analysis and Artificial Neural Network to predict well productivity of fluvial facies reservoir. The method summarizes the statistical reservoir factors and engineering factors that affect the well productivity, extracts information by applying the principal component analysis method and approximates arbitrary functions of the neural network to realize an accurate and efficient prediction on the fluvial facies reservoir well productivity. This method provides an effective way for forecasting the productivity of fluvial facies reservoir which is affected by multi-factors and complex mechanism. The study result shows that this method is a practical, effective, accurate and indirect productivity forecast method and is suitable for field application.
The Global Oscillation Network Group site survey. 1: Data collection and analysis methods
Hill, Frank; Fischer, George; Grier, Jennifer; Leibacher, John W.; Jones, Harrison B.; Jones, Patricia P.; Kupke, Renate; Stebbins, Robin T.
1994-01-01
The Global Oscillation Network Group (GONG) Project is planning to place a set of instruments around the world to observe solar oscillations as continuously as possible for at least three years. The Project has now chosen the sites that will comprise the network. This paper describes the methods of data collection and analysis that were used to make this decision. Solar irradiance data were collected with a one-minute cadence at fifteen sites around the world and analyzed to produce statistics of cloud cover, atmospheric extinction, and transparency power spectra at the individual sites. Nearly 200 reasonable six-site networks were assembled from the individual stations, and a set of statistical measures of the performance of the networks was analyzed using a principal component analysis. An accompanying paper presents the results of the survey.
A method for under-sampled ecological network data analysis: plant-pollination as case study
Directory of Open Access Journals (Sweden)
Peter B. Sorensen
2012-01-01
Full Text Available In this paper, we develop a method, termed the Interaction Distribution (ID method, for analysis of quantitative ecological network data. In many cases, quantitative network data sets are under-sampled, i.e. many interactions are poorly sampled or remain unobserved. Hence, the output of statistical analyses may fail to differentiate between patterns that are statistical artefacts and those which are real characteristics of ecological networks. The ID method can support assessment and inference of under-sampled ecological network data. In the current paper, we illustrate and discuss the ID method based on the properties of plant-animal pollination data sets of flower visitation frequencies. However, the ID method may be applied to other types of ecological networks. The method can supplement existing network analyses based on two definitions of the underlying probabilities for each combination of pollinator and plant species: (1, pi,j: the probability for a visit made by the i’th pollinator species to take place on the j’th plant species; (2, qi,j: the probability for a visit received by the j’th plant species to be made by the i’th pollinator. The method applies the Dirichlet distribution to estimate these two probabilities, based on a given empirical data set. The estimated mean values for pi,j and qi,j reflect the relative differences between recorded numbers of visits for different pollinator and plant species, and the estimated uncertainty of pi,j and qi,j decreases with higher numbers of recorded visits.
Arnaud, Nicolas; Barsuglia, Matteo; Bizouard, Marie-Anne; Brisson, Violette; Cavalier, Fabien; Davier, Michel; Hello, Patrice; Kreckelbergh, Stephane; Porter, Edward K.
2003-11-01
Network data analysis methods are the only way to properly separate real gravitational wave (GW) transient events from detector noise. They can be divided into two generic classes: the coincidence method and the coherent analysis. The former uses lists of selected events provided by each interferometer belonging to the network and tries to correlate them in time to identify a physical signal. Instead of this binary treatment of detector outputs (signal present or absent), the latter method involves first the merging of the interferometer data and looks for a common pattern, consistent with an assumed GW waveform and a given source location in the sky. The thresholds are only applied later, to validate or not the hypothesis made. As coherent algorithms use more complete information than coincidence methods, they are expected to provide better detection performances, but at a higher computational cost. An efficient filter must yield a good compromise between a low false alarm rate (hence triggering on data at a manageable rate) and a high detection efficiency. Therefore, the comparison of the two approaches is achieved using so-called receiving operating characteristics (ROC), giving the relationship between the false alarm rate and the detection efficiency for a given method. This paper investigates this question via Monte Carlo simulations, using the network model developed in a previous article. Its main conclusions are the following. First, a three-interferometer network such as Virgo-LIGO is found to be too small to reach good detection efficiencies at low false alarm rates: larger configurations are suitable to reach a confidence level high enough to validate as true GW a detected event. In addition, an efficient network must contain interferometers with comparable sensitivities: studying the three-interferometer LIGO network shows that the 2-km interferometer with half sensitivity leads to a strong reduction of performances as compared to a network of three
Wang, Ting; Plecháč, Petr
2017-12-01
Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.
Karahalios, Amalia Emily; Salanti, Georgia; Turner, Simon L; Herbison, G Peter; White, Ian R; Veroniki, Areti Angeliki; Nikolakopoulou, Adriani; Mckenzie, Joanne E
2017-06-24
Network meta-analysis, a method to synthesise evidence from multiple treatments, has increased in popularity in the past decade. Two broad approaches are available to synthesise data across networks, namely, arm- and contrast-synthesis models, with a range of models that can be fitted within each. There has been recent debate about the validity of the arm-synthesis models, but to date, there has been limited empirical evaluation comparing results using the methods applied to a large number of networks. We aim to address this gap through the re-analysis of a large cohort of published networks of interventions using a range of network meta-analysis methods. We will include a subset of networks from a database of network meta-analyses of randomised trials that have been identified and curated from the published literature. The subset of networks will include those where the primary outcome is binary, the number of events and participants are reported for each direct comparison, and there is no evidence of inconsistency in the network. We will re-analyse the networks using three contrast-synthesis methods and two arm-synthesis methods. We will compare the estimated treatment effects, their standard errors, treatment hierarchy based on the surface under the cumulative ranking (SUCRA) curve, the SUCRA value, and the between-trial heterogeneity variance across the network meta-analysis methods. We will investigate whether differences in the results are affected by network characteristics and baseline risk. The results of this study will inform whether, in practice, the choice of network meta-analysis method matters, and if it does, in what situations differences in the results between methods might arise. The results from this research might also inform future simulation studies.
[Social network analysis: a method to improve safety in healthcare organizations].
Marqués Sánchez, Pilar; González Pérez, Marta Eva; Agra Varela, Yolanda; Vega Núñez, Jorge; Pinto Carral, Arrate; Quiroga Sánchez, Enedina
2013-01-01
Patient safety depends on the culture of the healthcare organization involving relationships between professionals. This article proposes that the study of these relations should be conducted from a network perspective and using a methodology called Social Network Analysis (SNA). This methodology includes a set of mathematical constructs grounded in Graph Theory. With the SNA we can know aspects of the individual's position in the network (centrality) or cohesion among team members. Thus, the SNA allows to know aspects related to security such as the kind of links that can increase commitment among professionals, how to build those links, which nodes have more prestige in the team in generating confidence or collaborative network, which professionals serve as intermediaries between the subgroups of a team to transmit information or smooth conflicts, etc. Useful aspects in stablishing a safety culture. The SNA would analyze the relations among professionals, their level of communication to communicate errors and spontaneously seek help and coordination between departments to participate in projects that enhance safety. Thus, they related through a network, using the same language, a fact that helps to build a culture. In summary, we propose an approach to safety culture from a SNA perspective that would complement other commonly used methods.
Curtis, David
2007-07-18
Debate remains as to the optimal method for utilising genotype data obtained from multiple markers in case-control association studies. I and colleagues have previously described a method of association analysis using artificial neural networks (ANNs), whose performance compared favourably to single-marker methods. Here, the performance of ANN analysis is compared with other multi-marker methods, comprising different haplotype-based analyses and locus-based analyses. Of several methods studied and applied to simulated SNP datasets, heterogeneity testing of estimated haplotype frequencies using asymptotic p values rather than permutation testing had the lowest power of the methods studied and ANN analysis had the highest power. The difference in power to detect association between these two methods was statistically significant (p = 0.001) but other comparisons between methods were not significant. The raw t statistic obtained from ANN analysis correlated highly with the empirical statistical significance obtained from permutation testing of the ANN results and with the p value obtained from the heterogeneity test. Although ANN analysis was more powerful than the standard haplotype-based test it is unlikely to be taken up widely. The permutation testing necessary to obtain a valid p value makes it slow to perform and it is not underpinned by a theoretical model relating marker genotypes to disease phenotype. Nevertheless, the superior performance of this method does imply that the widely-used haplotype-based methods for detecting association with multiple markers are not optimal and efforts could be made to improve upon them. The fact that the t statistic obtained from ANN analysis is highly correlated with the statistical significance does suggest a possibility to use ANN analysis in situations where large numbers of markers have been genotyped, since the t value could be used as a proxy for the p value in preliminary analyses.
Directory of Open Access Journals (Sweden)
Curtis David
2007-07-01
Full Text Available Abstract Background Debate remains as to the optimal method for utilising genotype data obtained from multiple markers in case-control association studies. I and colleagues have previously described a method of association analysis using artificial neural networks (ANNs, whose performance compared favourably to single-marker methods. Here, the perfomance of ANN analysis is compared with other multi-marker methods, comprising different haplotype-based analyses and locus-based analyses. Results Of several methods studied and applied to simulated SNP datasets, heterogeneity testing of estimated haplotype frequencies using asymptotic p values rather than permutation testing had the lowest power of the methods studied and ANN analysis had the highest power. The difference in power to detect association between these two methods was statistically significant (p = 0.001 but other comparisons between methods were not significant. The raw t statistic obtained from ANN analysis correlated highly with the empirical statistical significance obtained from permutation testing of the ANN results and with the p value obtained from the heterogeneity test. Conclusion Although ANN analysis was more powerful than the standard haplotype-based test it is unlikely to be taken up widely. The permutation testing necessary to obtain a valid p value makes it slow to perform and it is not underpinned by a theoretical model relating marker genotypes to disease phenotype. Nevertheless, the superior performance of this method does imply that the widely-used haplotype-based methods for detecting association with multiple markers are not optimal and efforts could be made to improve upon them. The fact that the t statistic obtained from ANN analysis is highly correlated with the statistical significance does suggest a possibility to use ANN analysis in situations where large numbers of markers have been genotyped, since the t value could be used as a proxy for the p value in
Prediction of MicroRNA-Disease Associations Based on Social Network Analysis Methods
Directory of Open Access Journals (Sweden)
Quan Zou
2015-01-01
Full Text Available MicroRNAs constitute an important class of noncoding, single-stranded, ~22 nucleotide long RNA molecules encoded by endogenous genes. They play an important role in regulating gene transcription and the regulation of normal development. MicroRNAs can be associated with disease; however, only a few microRNA-disease associations have been confirmed by traditional experimental approaches. We introduce two methods to predict microRNA-disease association. The first method, KATZ, focuses on integrating the social network analysis method with machine learning and is based on networks derived from known microRNA-disease associations, disease-disease associations, and microRNA-microRNA associations. The other method, CATAPULT, is a supervised machine learning method. We applied the two methods to 242 known microRNA-disease associations and evaluated their performance using leave-one-out cross-validation and 3-fold cross-validation. Experiments proved that our methods outperformed the state-of-the-art methods.
A moment-convergence method for stochastic analysis of biochemical reaction networks.
Zhang, Jiajun; Nie, Qing; Zhou, Tianshou
2016-05-21
Traditional moment-closure methods need to assume that high-order cumulants of a probability distribution approximate to zero. However, this strong assumption is not satisfied for many biochemical reaction networks. Here, we introduce convergent moments (defined in mathematics as the coefficients in the Taylor expansion of the probability-generating function at some point) to overcome this drawback of the moment-closure methods. As such, we develop a new analysis method for stochastic chemical kinetics. This method provides an accurate approximation for the master probability equation (MPE). In particular, the connection between low-order convergent moments and rate constants can be more easily derived in terms of explicit and analytical forms, allowing insights that would be difficult to obtain through direct simulation or manipulation of the MPE. In addition, it provides an accurate and efficient way to compute steady-state or transient probability distribution, avoiding the algorithmic difficulty associated with stiffness of the MPE due to large differences in sizes of rate constants. Applications of the method to several systems reveal nontrivial stochastic mechanisms of gene expression dynamics, e.g., intrinsic fluctuations can induce transient bimodality and amplify transient signals, and slow switching between promoter states can increase fluctuations in spatially heterogeneous signals. The overall approach has broad applications in modeling, analysis, and computation of complex biochemical networks with intrinsic noise.
A moment-convergence method for stochastic analysis of biochemical reaction networks
Zhang, Jiajun; Nie, Qing; Zhou, Tianshou
2016-05-01
Traditional moment-closure methods need to assume that high-order cumulants of a probability distribution approximate to zero. However, this strong assumption is not satisfied for many biochemical reaction networks. Here, we introduce convergent moments (defined in mathematics as the coefficients in the Taylor expansion of the probability-generating function at some point) to overcome this drawback of the moment-closure methods. As such, we develop a new analysis method for stochastic chemical kinetics. This method provides an accurate approximation for the master probability equation (MPE). In particular, the connection between low-order convergent moments and rate constants can be more easily derived in terms of explicit and analytical forms, allowing insights that would be difficult to obtain through direct simulation or manipulation of the MPE. In addition, it provides an accurate and efficient way to compute steady-state or transient probability distribution, avoiding the algorithmic difficulty associated with stiffness of the MPE due to large differences in sizes of rate constants. Applications of the method to several systems reveal nontrivial stochastic mechanisms of gene expression dynamics, e.g., intrinsic fluctuations can induce transient bimodality and amplify transient signals, and slow switching between promoter states can increase fluctuations in spatially heterogeneous signals. The overall approach has broad applications in modeling, analysis, and computation of complex biochemical networks with intrinsic noise.
Ghosh, Jaideep; Kshitij, Avinash
2017-01-01
This article introduces a number of methods that can be useful for examining the emergence of large-scale structures in collaboration networks. The study contributes to sociological research by investigating how clusters of research collaborators evolve and sometimes percolate in a collaboration network. Typically, we find that in our networks,…
Abramenko, Oleksii
2017-01-01
The current research focuses on the perturbations within the electrical network of the LHC and its subsystems by analyzing measurements collected from oscilloscopes installed across different CERN sites, and alarms by electrical equipments. We analyze amplitude and duration of the glitches and, together with other relevant variables, correlate them with beam stopping events. The work also tries to identify assets affected by such perturbations using data mining and, in particular, frequent pattern mining methods. On the practical side we summarize results of our work by putting forward a prototype of a software tool enabling online monitoring of the alarms coming from the electrical network and facilitating glitch detection and analysis by a technical operator.
Sotirov, Sotir; Atanassova, Vassia; Sotirova, Evdokia; Doukovska, Lyubka; Bureva, Veselina; Mavrov, Deyan; Tomov, Jivko
2017-01-01
The approach of InterCriteria Analysis (ICA) was applied for the aim of reducing the set of variables on the input of a neural network, taking into account the fact that their large number increases the number of neurons in the network, thus making them unusable for hardware implementation. Here, for the first time, with the help of the ICA method, correlations between triples of the input parameters for training of the neural networks were obtained. In this case, we use the approach of ICA for data preprocessing, which may yield reduction of the total time for training the neural networks, hence, the time for the network's processing of data and images.
A neural network construction method for surrogate modeling of physics-based analysis
Sung, Woong Je
In this thesis existing methodologies related to the developmental methods of neural networks have been surveyed and their approaches to network sizing and structuring are carefully observed. This literature review covers the constructive methods, the pruning methods, and the evolutionary methods and questions about the basic assumption intrinsic to the conventional neural network learning paradigm, which is primarily devoted to optimization of connection weights (or synaptic strengths) for the pre-determined connection structure of the network. The main research hypothesis governing this thesis is that, without breaking a prevailing dichotomy between weights and connectivity of the network during learning phase, the efficient design of a task-specific neural network is hard to achieve because, as long as connectivity and weights are searched by separate means, a structural optimization of the neural network requires either repetitive re-training procedures or computationally expensive topological meta-search cycles. The main contribution of this thesis is designing and testing a novel learning mechanism which efficiently learns not only weight parameters but also connection structure from a given training data set, and positioning this learning mechanism within the surrogate modeling practice. In this work, a simple and straightforward extension to the conventional error Back-Propagation (BP) algorithm has been formulated to enable a simultaneous learning for both connectivity and weights of the Generalized Multilayer Perceptron (GMLP) in supervised learning tasks. A particular objective is to achieve a task-specific network having reasonable generalization performance with a minimal training time. The dichotomy between architectural design and weight optimization is reconciled by a mechanism establishing a new connection for a neuron pair which has potentially higher error-gradient than one of the existing connections. Interpreting an instance of the absence of
Network analysis: a novel method for mapping neonatal acute transport patterns in California.
Kunz, S N; Zupancic, J A F; Rigdon, J; Phibbs, C S; Lee, H C; Gould, J B; Leskovec, J; Profit, J
2017-06-01
The objectives of this study are to use network analysis to describe the pattern of neonatal transfers in California, to compare empirical sub-networks with established referral regions and to determine factors associated with transport outside the originating sub-network. This cross-sectional database study included 6546 infants graph representing acute transfers between hospitals (n=6696), we used community detection techniques to identify more tightly connected sub-networks. These empirically derived sub-networks were compared with state-defined regional referral networks. Reasons for transfer between empirical sub-networks were assessed using logistic regression. Empirical sub-networks showed significant overlap with regulatory regions (P<0.001). Transfer outside the empirical sub-network was associated with major congenital anomalies (P<0.001), need for surgery (P=0.01) and insurance as the reason for transfer (P<0.001). Network analysis accurately reflected empirical neonatal transfer patterns, potentially facilitating quantitative, rather than qualitative, analysis of regionalized health care delivery systems.
Network Analysis: A Novel Method for Mapping Neonatal Acute Transport Patterns in California
Kunz, Sarah N.; Zupancic, John A. F.; Rigdon, Joseph; Phibbs, Ciaran S.; Lee, Henry C.; Gould, Jeffrey B.; Leskovec, Jure; Profit, Jochen
2017-01-01
Objective To use network analysis to describe the pattern of neonatal transfers in California, to compare empirical sub-networks with established referral regions, and to determine factors associated with transport outside the originating sub-network. Study Design This cross-sectional database study included 6546 infants <28 days old transported within California in 2012. After generating a graph representing acute transfers between hospitals (n=6696), we used community detection techniques to identify more tightly connected sub-networks. These empirically-derived sub-networks were compared to state-defined regional referral networks. Reasons for transfer between empirical sub-networks were assessed using logistic regression. Results Empirical sub-networks showed significant overlap with regulatory regions (p <0.001). Transfer outside the empirical sub-network was associated with major congenital anomalies (p<0.001), need for surgery (p=0.01), and insurance as the reason for transfer (p<0.001). Conclusion Network analysis accurately reflected empirical neonatal transfer patterns, potentially facilitating quantitative, rather than qualitative, analysis of regionalized health care delivery systems. PMID:28333155
New Power Quality Analysis Method Based on Chaos Synchronization and Extension Neural Network
Directory of Open Access Journals (Sweden)
Meng-Hui Wang
2014-10-01
Full Text Available A hybrid method comprising a chaos synchronization (CS-based detection scheme and an Extension Neural Network (ENN classification algorithm is proposed for power quality monitoring and analysis. The new method can detect minor changes in signals of the power systems. Likewise, prominent characteristics of system signal disturbance can be extracted by this technique. In the proposed approach, the CS-based detection method is used to extract three fundamental characteristics of the power system signal and an ENN-based clustering scheme is then applied to detect the state of the signal, i.e., normal, voltage sag, voltage swell, interruption or harmonics. The validity of the proposed method is demonstrated by means of simulations given the use of three different chaotic systems, namely Lorenz, New Lorenz and Sprott. The simulation results show that the proposed method achieves a high detection accuracy irrespective of the chaotic system used or the presence of noise. The proposed method not only achieves higher detection accuracy than existing methods, but also has low computational cost, an improved robustness toward noise, and improved scalability. As a result, it provides an ideal solution for the future development of hand-held power quality analyzers and real-time detection devices.
A comparative analysis on computational methods for fitting an ERGM to biological network data
Directory of Open Access Journals (Sweden)
Sudipta Saha
2015-03-01
Full Text Available Exponential random graph models (ERGM based on graph theory are useful in studying global biological network structure using its local properties. However, computational methods for fitting such models are sensitive to the type, structure and the number of the local features of a network under study. In this paper, we compared computational methods for fitting an ERGM with local features of different types and structures. Two commonly used methods, such as the Markov Chain Monte Carlo Maximum Likelihood Estimation and the Maximum Pseudo Likelihood Estimation are considered for estimating the coefficients of network attributes. We compared the estimates of observed network to our random simulated network using both methods under ERGM. The motivation was to ascertain the extent to which an observed network would deviate from a randomly simulated network if the physical numbers of attributes were approximately same. Cut-off points of some common attributes of interest for different order of nodes were determined through simulations. We implemented our method to a known regulatory network database of Escherichia coli (E. coli.
Artificial neural network and classical least-squares methods for neurotransmitter mixture analysis.
Schulze, H G; Greek, L S; Gorzalka, B B; Bree, A V; Blades, M W; Turner, R F
1995-02-01
Identification of individual components in biological mixtures can be a difficult problem regardless of the analytical method employed. In this work, Raman spectroscopy was chosen as a prototype analytical method due to its inherent versatility and applicability to aqueous media, making it useful for the study of biological samples. Artificial neural networks (ANNs) and the classical least-squares (CLS) method were used to identify and quantify the Raman spectra of the small-molecule neurotransmitters and mixtures of such molecules. The transfer functions used by a network, as well as the architecture of a network, played an important role in the ability of the network to identify the Raman spectra of individual neurotransmitters and the Raman spectra of neurotransmitter mixtures. Specifically, networks using sigmoid and hyperbolic tangent transfer functions generalized better from the mixtures in the training data set to those in the testing data sets than networks using sine functions. Networks with connections that permit the local processing of inputs generally performed better than other networks on all the testing data sets. and better than the CLS method of curve fitting, on novel spectra of some neurotransmitters. The CLS method was found to perform well on noisy, shifted, and difference spectra.
Communities and beyond: Mesoscopic analysis of a large social network with complementary methods
Tibély, Gergely; Kovanen, Lauri; Karsai, Márton; Kaski, Kimmo; Kertész, János; Saramäki, Jari
2011-05-01
Community detection methods have so far been tested mostly on small empirical networks and on synthetic benchmarks. Much less is known about their performance on large real-world networks, which nonetheless are a significant target for application. We analyze the performance of three state-of-the-art community detection methods by using them to identify communities in a large social network constructed from mobile phone call records. We find that all methods detect communities that are meaningful in some respects but fall short in others, and that there often is a hierarchical relationship between communities detected by different methods. Our results suggest that community detection methods could be useful in studying the general mesoscale structure of networks, as opposed to only trying to identify dense structures.
Karahalios, A. E.; Salanti, G.; Turner, S. L.; Herbison, G. P.; White, I. R.; Veroniki, A. A.; Nikolakopoulou, A.; Mckenzie, J. E.
2017-01-01
BACKGROUND: Network meta-analysis, a method to synthesise evidence from multiple treatments, has increased in popularity in the past decade. Two broad approaches are available to synthesise data across networks, namely, arm- and contrast-synthesis models, with a range of models that can be fitted within each. There has been recent debate about the validity of the arm-synthesis models, but to date, there has been limited empirical evaluation comparing results using the methods applied to a lar...
Karahalios, Amalia (Emily); Salanti, Georgia; Turner, Simon L.; Herbison, G. Peter; White, Ian R.; Veroniki, Areti Angeliki; Nikolakopoulou, Adriani; Mckenzie, Joanne E.
2017-01-01
BACKGROUND Network meta-analysis, a method to synthesise evidence from multiple treatments, has increased in popularity in the past decade. Two broad approaches are available to synthesise data across networks, namely, arm- and contrast-synthesis models, with a range of models that can be fitted within each. There has been recent debate about the validity of the arm-synthesis models, but to date, there has been limited empirical evaluation comparing results using the methods applied to a ...
A Method of DTM Construction Based on Quadrangular Irregular Networks and Related Error Analysis.
Kang, Mengjun; Wang, Mingjun; Du, Qingyun
2015-01-01
A new method of DTM construction based on quadrangular irregular networks (QINs) that considers all the original data points and has a topological matrix is presented. A numerical test and a real-world example are used to comparatively analyse the accuracy of QINs against classical interpolation methods and other DTM representation methods, including SPLINE, KRIGING and triangulated irregular networks (TINs). The numerical test finds that the QIN method is the second-most accurate of the four methods. In the real-world example, DTMs are constructed using QINs and the three classical interpolation methods. The results indicate that the QIN method is the most accurate method tested. The difference in accuracy rank seems to be caused by the locations of the data points sampled. Although the QIN method has drawbacks, it is an alternative method for DTM construction.
A Method of DTM Construction Based on Quadrangular Irregular Networks and Related Error Analysis.
Directory of Open Access Journals (Sweden)
Mengjun Kang
Full Text Available A new method of DTM construction based on quadrangular irregular networks (QINs that considers all the original data points and has a topological matrix is presented. A numerical test and a real-world example are used to comparatively analyse the accuracy of QINs against classical interpolation methods and other DTM representation methods, including SPLINE, KRIGING and triangulated irregular networks (TINs. The numerical test finds that the QIN method is the second-most accurate of the four methods. In the real-world example, DTMs are constructed using QINs and the three classical interpolation methods. The results indicate that the QIN method is the most accurate method tested. The difference in accuracy rank seems to be caused by the locations of the data points sampled. Although the QIN method has drawbacks, it is an alternative method for DTM construction.
Yucel, Abdulkadir C.
2015-05-05
An efficient method for statistically characterizing multiconductor transmission line (MTL) networks subject to a large number of manufacturing uncertainties is presented. The proposed method achieves its efficiency by leveraging a high-dimensional model representation (HDMR) technique that approximates observables (quantities of interest in MTL networks, such as voltages/currents on mission-critical circuits) in terms of iteratively constructed component functions of only the most significant random variables (parameters that characterize the uncertainties in MTL networks, such as conductor locations and widths, and lumped element values). The efficiency of the proposed scheme is further increased using a multielement probabilistic collocation (ME-PC) method to compute the component functions of the HDMR. The ME-PC method makes use of generalized polynomial chaos (gPC) expansions to approximate the component functions, where the expansion coefficients are expressed in terms of integrals of the observable over the random domain. These integrals are numerically evaluated and the observable values at the quadrature/collocation points are computed using a fast deterministic simulator. The proposed method is capable of producing accurate statistical information pertinent to an observable that is rapidly varying across a high-dimensional random domain at a computational cost that is significantly lower than that of gPC or Monte Carlo methods. The applicability, efficiency, and accuracy of the method are demonstrated via statistical characterization of frequency-domain voltages in parallel wire, interconnect, and antenna corporate feed networks.
A Timing Estimation Method Based-on Skewness Analysis in Vehicular Wireless Networks.
Cui, Xuerong; Li, Juan; Wu, Chunlei; Liu, Jian-Hang
2015-11-13
Vehicle positioning technology has drawn more and more attention in vehicular wireless networks to reduce transportation time and traffic accidents. Nowadays, global navigation satellite systems (GNSS) are widely used in land vehicle positioning, but most of them are lack precision and reliability in situations where their signals are blocked. Positioning systems base-on short range wireless communication are another effective way that can be used in vehicle positioning or vehicle ranging. IEEE 802.11p is a new real-time short range wireless communication standard for vehicles, so a new method is proposed to estimate the time delay or ranges between vehicles based on the IEEE 802.11p standard which includes three main steps: cross-correlation between the received signal and the short preamble, summing up the correlated results in groups, and finding the maximum peak using a dynamic threshold based on the skewness analysis. With the range between each vehicle or road-side infrastructure, the position of neighboring vehicles can be estimated correctly. Simulation results were presented in the International Telecommunications Union (ITU) vehicular multipath channel, which show that the proposed method provides better precision than some well-known timing estimation techniques, especially in low signal to noise ratio (SNR) environments.
A Timing Estimation Method Based-on Skewness Analysis in Vehicular Wireless Networks
Directory of Open Access Journals (Sweden)
Xuerong Cui
2015-11-01
Full Text Available Vehicle positioning technology has drawn more and more attention in vehicular wireless networks to reduce transportation time and traffic accidents. Nowadays, global navigation satellite systems (GNSS are widely used in land vehicle positioning, but most of them are lack precision and reliability in situations where their signals are blocked. Positioning systems base-on short range wireless communication are another effective way that can be used in vehicle positioning or vehicle ranging. IEEE 802.11p is a new real-time short range wireless communication standard for vehicles, so a new method is proposed to estimate the time delay or ranges between vehicles based on the IEEE 802.11p standard which includes three main steps: cross-correlation between the received signal and the short preamble, summing up the correlated results in groups, and finding the maximum peak using a dynamic threshold based on the skewness analysis. With the range between each vehicle or road-side infrastructure, the position of neighboring vehicles can be estimated correctly. Simulation results were presented in the International Telecommunications Union (ITU vehicular multipath channel, which show that the proposed method provides better precision than some well-known timing estimation techniques, especially in low signal to noise ratio (SNR environments.
Network Slicing in Industry 4.0 Applications: Abstraction Methods and End-to-End Analysis
DEFF Research Database (Denmark)
Nielsen, Jimmy Jessen; Popovski, Petar; Kalør, Anders Ellersgaard
2018-01-01
Industry 4.0 refers to the fourth industrial revolution, and introduces modern communication and computation technologies such as 5G, cloud computing and Internet of Things to industrial manufacturing systems. As a result, many devices, machines and applications will rely on connectivity, while...... having different requirements from the network, ranging from high reliability and low latency to high data rates. Furthermore, these industrial networks will be highly heterogeneous as they will feature a number of diverse communication technologies. In this article, we propose network slicing...... as a mechanism to handle the diverse set of requirements to the network. We present methods for slicing deterministic and packet-switched industrial communication protocols at an abstraction level which is decoupled from the specific implementation of the underlying technologies, and hence simplifies the slicing...
Hong, Changki; Hwang, Jeewon; Cho, Kwang-Hyun; Shin, Insik
2015-01-01
Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The
Noma, Hisashi; Nagashima, Kengo; Maruo, Kazushi; Gosho, Masahiko; Furukawa, Toshi A
2017-12-18
In network meta-analyses that synthesize direct and indirect comparison evidence concerning multiple treatments, multivariate random effects models have been routinely used for addressing between-studies heterogeneities. Although their standard inference methods depend on large sample approximations (eg, restricted maximum likelihood estimation) for the number of trials synthesized, the numbers of trials are often moderate or small. In these situations, standard estimators cannot be expected to behave in accordance with asymptotic theory; in particular, confidence intervals cannot be assumed to exhibit their nominal coverage probabilities (also, the type I error probabilities of the corresponding tests cannot be retained). The invalidity issue may seriously influence the overall conclusions of network meta-analyses. In this article, we develop several improved inference methods for network meta-analyses to resolve these problems. We first introduce 2 efficient likelihood-based inference methods, the likelihood ratio test-based and efficient score test-based methods, in a general framework of network meta-analysis. Then, to improve the small-sample inferences, we developed improved higher-order asymptotic methods using Bartlett-type corrections and bootstrap adjustment methods. The proposed methods adopt Monte Carlo approaches using parametric bootstraps to effectively circumvent complicated analytical calculations of case-by-case analyses and to permit flexible application to various statistical models network meta-analyses. These methods can also be straightforwardly applied to multivariate meta-regression analyses and to tests for the evaluation of inconsistency. In numerical evaluations via simulations, the proposed methods generally performed well compared with the ordinary restricted maximum likelihood-based inference method. Applications to 2 network meta-analysis datasets are provided. Copyright © 2017 John Wiley & Sons, Ltd.
Meyer-Bäse, Anke; Roberts, Rodney G; Illan, Ignacio A; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja
2017-01-01
Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary
Directory of Open Access Journals (Sweden)
Anke Meyer-Bäse
2017-10-01
Full Text Available Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and
Transient Analysis of Lumped Circuit Networks Loaded Thin Wires By DGTD Method
Li, Ping
2016-03-31
With the purpose of avoiding very fine mesh cells in the proximity of a thin wire, the modified telegrapher’s equations (MTEs) are employed to describe the thin wire voltage and current distributions, which consequently results in reduced number of unknowns and augmented Courant-Friedrichs-Lewy (CFL) number. As hyperbolic systems, both the MTEs and the Maxwell’s equations are solved by the discontinuous Galerkin time-domain (DGTD) method. In realistic situations, the thin wires could be either driven or loaded by circuit networks. The thin wire-circuit interface performs as a boundary condition for the thin wire solver, where the thin wire voltage and current used for the incoming flux evaluation involved in the DGTD analyzed MTEs are not available. To obtain this voltage and current, an auxiliary current flowing through the thin wire-circuit interface is introduced at each interface. Corresponding auxiliary equations derived from the invariable property of characteristic variable for hyperbolic systems are developed and solved together with the circuit equations established by the modified nodal analysis (MNA) modality. Furthermore, in order to characterize the field and thin wire interactions, a weighted electric field and a volume current density are added into the MTEs and Maxwell-Ampere’s law equation, respectively. To validate the proposed algorithm, three representative examples are presented.
Comparative Analysis of Neural Network Training Methods in Real-time Radiotherapy
Directory of Open Access Journals (Sweden)
Nouri S.
2017-03-01
Full Text Available Background: The motions of body and tumor in some regions such as chest during radiotherapy treatments are one of the major concerns protecting normal tissues against high doses. By using real-time radiotherapy technique, it is possible to increase the accuracy of delivered dose to the tumor region by means of tracing markers on the body of patients. Objective: This study evaluates the accuracy of some artificial intelligence methods including neural network and those of combination with genetic algorithm as well as particle swarm optimization (PSO estimating tumor positions in real-time radiotherapy. Method: One hundred recorded signals of three external markers were used as input data. The signals from 3 markers thorough 10 breathing cycles of a patient treated via a cyber-knife for a lung tumor were used as data input. Then, neural network method and its combination with genetic or PSO algorithms were applied determining the tumor locations using MATLAB© software program. Results: The accuracies were obtained 0.8%, 12% and 14% in neural network, genetic and particle swarm optimization algorithms, respectively. Conclusion: The internal target volume (ITV should be determined based on the applied neural network algorithm on training steps.
Directory of Open Access Journals (Sweden)
Patricia Rice Doran
2011-12-01
Full Text Available Social network analysis software such as NodeXL has been used to describe participation and interaction in numerous social networks, but it has not yet been widely used to examine dynamics in online classes, where participation is frequently required rather than optional and participation patterns may be impacted by the requirements of the class, the instructor’s activities, or participants’ intrinsic engagement with the subject matter. Such social network analysis, which examines the dynamics and interactions among groups of participants in a social network or learning group, can be valuable in programs focused on teaching collaborative and communicative skills, including teacher preparation programs. Applied to these programs, social network analysis can provide information about instructional practices likely to facilitate student interaction and collaboration across diverse student populations. This exploratory study used NodeXL to visualize students’ participation in an online course, with the goal of identifying (1 ways in which NodeXL could be used to describe patterns in participant interaction within an instructional setting and (2 identifying specific patterns in participant interaction among students in this particular course. In this sample, general education teachers demonstrated higher measures of connection and interaction with other participants than did those from specialist (ESOL or special education backgrounds, and tended to interact more frequently with all participants than the majority of participants from specialist backgrounds. We recommend further research to delineate specific applications of NodeXL within an instructional context, particularly to identify potential patterns in student participation based on variables such as gender, background, cultural and linguistic heritage, prior training and education, and prior experience so that instructors can ensure their practice helps to facilitate student interaction
Comparative Analysis of Neural Network Training Methods in Real-time Radiotherapy.
Nouri, S; Hosseini Pooya, S M; Soltani Nabipour, J
2017-03-01
The motions of body and tumor in some regions such as chest during radiotherapy treatments are one of the major concerns protecting normal tissues against high doses. By using real-time radiotherapy technique, it is possible to increase the accuracy of delivered dose to the tumor region by means of tracing markers on the body of patients. This study evaluates the accuracy of some artificial intelligence methods including neural network and those of combination with genetic algorithm as well as particle swarm optimization (PSO) estimating tumor positions in real-time radiotherapy. One hundred recorded signals of three external markers were used as input data. The signals from 3 markers thorough 10 breathing cycles of a patient treated via a cyber-knife for a lung tumor were used as data input. Then, neural network method and its combination with genetic or PSO algorithms were applied determining the tumor locations using MATLAB© software program. The accuracies were obtained 0.8%, 12% and 14% in neural network, genetic and particle swarm optimization algorithms, respectively. The internal target volume (ITV) should be determined based on the applied neural network algorithm on training steps.
Dudar, O. I.; Dudar, E. S.
2017-11-01
The features of application of the 1D dimensional finite element method (FEM) in combination with the laminar solutions method (LSM) for the calculation of underground ventilating networks are considered. In this case the processes of heat and mass transfer change the properties of a fluid (binary vapour-air mix). Under the action of gravitational forces it leads to such phenomena as natural draft, local circulation, etc. The FEM relations considering the action of gravity, the mass conservation law, the dependence of vapour-air mix properties on the thermodynamic parameters are derived so that it allows one to model the mentioned phenomena. The analogy of the elastic and plastic rod deformation processes to the processes of laminar and turbulent flow in a pipe is described. Owing to this analogy, the guaranteed convergence of the elastic solutions method for the materials of plastic type means the guaranteed convergence of the LSM for any regime of a turbulent flow in a rough pipe. By means of numerical experiments the convergence rate of the FEM - LSM is investigated. This convergence rate appeared much higher than the convergence rate of the Cross – Andriyashev method. Data of other authors on the convergence rate comparison for the finite element method, the Newton method and the method of gradient are provided. These data allow one to conclude that the FEM in combination with the LSM is one of the most effective methods of calculation of hydraulic and ventilating networks. The FEM - LSM has been used for creation of the research application programme package “MineClimate” allowing to calculate the microclimate parameters in the underground ventilating networks.
Directory of Open Access Journals (Sweden)
Sotir Sotirov
2017-01-01
Full Text Available The approach of InterCriteria Analysis (ICA was applied for the aim of reducing the set of variables on the input of a neural network, taking into account the fact that their large number increases the number of neurons in the network, thus making them unusable for hardware implementation. Here, for the first time, with the help of the ICA method, correlations between triples of the input parameters for training of the neural networks were obtained. In this case, we use the approach of ICA for data preprocessing, which may yield reduction of the total time for training the neural networks, hence, the time for the network’s processing of data and images.
Comparative analysis of methods for extracting vessel network on breast MRI images
Gaizer, Bence T.; Vassiou, Katerina G.; Lavdas, Eleftherios; Arvanitis, Dimitrios L.; Fezoulidis, Ioannis V.; Glotsos, Dimitris T.
2017-11-01
Digital processing of MRI images aims to provide an automatized diagnostic evaluation of regular health screenings. Cancerous lesions are proven to cause an alteration in the vessel structure of the diseased organ. Currently there are several methods used for extraction of the vessel network in order to quantify its properties. In this work MRI images (Signa HDx 3.0T, GE Healthcare, courtesy of University Hospital of Larissa) of 30 female breasts were subjected to three different vessel extraction algorithms to determine the location of their vascular network. The first method is an experiment to build a graph over known points of the vessel network; the second algorithm aims to determine the direction and diameter of vessels at these points; the third approach is a seed growing algorithm, spreading selection to neighbors of the known vessel pixels. The possibilities shown by the different methods were analyzed, and quantitative measurements were performed. The data provided by these measurements showed no clear correlation with the presence or malignancy of tumors, based on the radiological diagnosis of skilled physicians.
Bonald, Thomas
2013-01-01
The book presents some key mathematical tools for the performance analysis of communication networks and computer systems.Communication networks and computer systems have become extremely complex. The statistical resource sharing induced by the random behavior of users and the underlying protocols and algorithms may affect Quality of Service.This book introduces the main results of queuing theory that are useful for analyzing the performance of these systems. These mathematical tools are key to the development of robust dimensioning rules and engineering methods. A number of examples i
Performance analysis of Wald-statistic based network detection methods for radiation sources
Energy Technology Data Exchange (ETDEWEB)
Sen, Satyabrata [ORNL; Rao, Nageswara S [ORNL; Wu, Qishi [University of Memphis; Barry, M. L.. [New Jersey Institute of Technology; Grieme, M. [New Jersey Institute of Technology; Brooks, Richard R [ORNL; Cordone, G. [Clemson University
2016-01-01
There have been increasingly large deployments of radiation detection networks that require computationally fast algorithms to produce prompt results over ad-hoc sub-networks of mobile devices, such as smart-phones. These algorithms are in sharp contrast to complex network algorithms that necessitate all measurements to be sent to powerful central servers. In this work, at individual sensors, we employ Wald-statistic based detection algorithms which are computationally very fast, and are implemented as one of three Z-tests and four chi-square tests. At fusion center, we apply the K-out-of-N fusion to combine the sensors hard decisions. We characterize the performance of detection methods by deriving analytical expressions for the distributions of underlying test statistics, and by analyzing the fusion performances in terms of K, N, and the false-alarm rates of individual detectors. We experimentally validate our methods using measurements from indoor and outdoor characterization tests of the Intelligence Radiation Sensors Systems (IRSS) program. In particular, utilizing the outdoor measurements, we construct two important real-life scenarios, boundary surveillance and portal monitoring, and present the results of our algorithms.
Wang, Jiang; Yang, Chen; Wang, Ruofan; Yu, Haitao; Cao, Yibin; Liu, Jing
2016-10-01
In this paper, EEG series are applied to construct functional connections with the correlation between different regions in order to investigate the nonlinear characteristic and the cognitive function of the brain with Alzheimer's disease (AD). First, limited penetrable visibility graph (LPVG) and phase space method map single EEG series into networks, and investigate the underlying chaotic system dynamics of AD brain. Topological properties of the networks are extracted, such as average path length and clustering coefficient. It is found that the network topology of AD in several local brain regions are different from that of the control group with no statistically significant difference existing all over the brain. Furthermore, in order to detect the abnormality of AD brain as a whole, functional connections among different brain regions are reconstructed based on similarity of clustering coefficient sequence (CCSS) of EEG series in the four frequency bands (delta, theta, alpha, and beta), which exhibit obvious small-world properties. Graph analysis demonstrates that for both methodologies, the functional connections between regions of AD brain decrease, particularly in the alpha frequency band. AD causes the graph index complexity of the functional network decreased, the small-world properties weakened, and the vulnerability increased. The obtained results show that the brain functional network constructed by LPVG and phase space method might be more effective to distinguish AD from the normal control than the analysis of single series, which is helpful for revealing the underlying pathological mechanism of the disease.
Directory of Open Access Journals (Sweden)
Milewski Robert
2016-12-01
Full Text Available There are high hopes for using the artificial neural networks (ANN technique to predict results of infertility treatment using the in vitro fertilization (IVF method. Some reports show superiority of the ANN approach over conventional methods. However, fully satisfactory results have not yet been achieved. Hence, there is a need to continue searching for new data describing the treatment process, as well as for new methods of extracting information from these data. There are also some reports that the use of principal component analysis (PCA before the process of training the neural network can further improve the efficiency of generated models. The aim of the study herein presented was to verify the thesis that the use of PCA increases the effectiveness of the prediction by ANN for the analysis of results of IVF treatment. Results for the PCA-ANN approach proved to be slightly better than the ANN approach, however the obtained differences were not statistically significant.
Performance Analysis of Classification Methods for Indoor Localization in Vlc Networks
Sánchez-Rodríguez, D.; Alonso-González, I.; Sánchez-Medina, J.; Ley-Bosch, C.; Díaz-Vilariño, L.
2017-09-01
Indoor localization has gained considerable attention over the past decade because of the emergence of numerous location-aware services. Research works have been proposed on solving this problem by using wireless networks. Nevertheless, there is still much room for improvement in the quality of the proposed classification models. In the last years, the emergence of Visible Light Communication (VLC) brings a brand new approach to high quality indoor positioning. Among its advantages, this new technology is immune to electromagnetic interference and has the advantage of having a smaller variance of received signal power compared to RF based technologies. In this paper, a performance analysis of seventeen machine leaning classifiers for indoor localization in VLC networks is carried out. The analysis is accomplished in terms of accuracy, average distance error, computational cost, training size, precision and recall measurements. Results show that most of classifiers harvest an accuracy above 90 %. The best tested classifier yielded a 99.0 % accuracy, with an average error distance of 0.3 centimetres.
PERFORMANCE ANALYSIS OF CLASSIFICATION METHODS FOR INDOOR LOCALIZATION IN VLC NETWORKS
Directory of Open Access Journals (Sweden)
D. Sánchez-Rodríguez
2017-09-01
Full Text Available Indoor localization has gained considerable attention over the past decade because of the emergence of numerous location-aware services. Research works have been proposed on solving this problem by using wireless networks. Nevertheless, there is still much room for improvement in the quality of the proposed classification models. In the last years, the emergence of Visible Light Communication (VLC brings a brand new approach to high quality indoor positioning. Among its advantages, this new technology is immune to electromagnetic interference and has the advantage of having a smaller variance of received signal power compared to RF based technologies. In this paper, a performance analysis of seventeen machine leaning classifiers for indoor localization in VLC networks is carried out. The analysis is accomplished in terms of accuracy, average distance error, computational cost, training size, precision and recall measurements. Results show that most of classifiers harvest an accuracy above 90 %. The best tested classifier yielded a 99.0 % accuracy, with an average error distance of 0.3 centimetres.
NEAT : an efficient network enrichment analysis test
Signorelli, Mirko; Vinciotti, Veronica; Wit, Ernst C
2016-01-01
BACKGROUND: Network enrichment analysis is a powerful method, which allows to integrate gene enrichment analysis with the information on relationships between genes that is provided by gene networks. Existing tests for network enrichment analysis deal only with undirected networks, they can be
Experimental and computational methods for the analysis and modeling of signaling networks.
Gherardini, Pier Federico; Helmer-Citterich, Manuela
2013-03-25
External cues are processed and integrated by signal transduction networks that drive appropriate cellular responses. Characterizing these programs, as well as how their deregulation leads to disease, is crucial for our understanding of cell biology. The past ten years have witnessed a gradual increase in the number of molecular parameters that can be simultaneously measured in a sample. Moreover our capacity to handle multiple samples in parallel has expanded, thus allowing a deeper profiling of cellular states under diverse experimental conditions. These technological advances have been complemented by the development of computational methods aimed at mining, analyzing and modeling these data. In this review we give a general overview of the most important experimental and computational techniques used in the field and describe several interesting application of these methodologies. We conclude by highlighting the issues that we think will keep researchers in the field busy in the next few years. Copyright © 2012 Elsevier B.V. All rights reserved.
Analysis of Road Traffic Network Cascade Failures with Coupled Map Lattice Method
Directory of Open Access Journals (Sweden)
Yanan Zhang
2015-01-01
Full Text Available In recent years, there is growing literature concerning the cascading failure of network characteristics. The object of this paper is to investigate the cascade failures on road traffic network, considering the aeolotropism of road traffic network topology and road congestion dissipation in traffic flow. An improved coupled map lattice (CML model is proposed. Furthermore, in order to match the congestion dissipation, a recovery mechanism is put forward in this paper. With a real urban road traffic network in Beijing, the cascading failures are tested using different attack strategies, coupling strengths, external perturbations, and attacked road segment numbers. The impacts of different aspects on road traffic network are evaluated based on the simulation results. The findings confirmed the important roles that these characteristics played in the cascading failure propagation and dissipation on road traffic network. We hope these findings are helpful to find out the optimal road network topology and avoid cascading failure on road network.
Hindhede, Anette Lykke; Aagaard-Hansen, Jens
2017-03-01
This article provides an example of the application of social network analysis method to assess community participation thereby strengthening planning and implementation of health promotion programming. Community health promotion often takes the form of services that reach out to or are located within communities. The concept of community reflects the idea that people's behavior and well-being are influenced by interaction with others, and here, health promotion requires participation and local leadership to facilitate transmission and uptake of interventions for the overall community to achieve social change. However, considerable uncertainty exists over exact levels of participation in these interventions. The article draws on a mixed methods research within a community development project in a vulnerable neighborhood of a town in Denmark. It presents a detailed analysis of the way in which social network analysis can be used as a tool to display participation and nonparticipation in community development and health promotion activities, to help identify capacities and assets, mobilize resources, and finally to evaluate the achievements. The article concludes that identification of interpersonal ties among people who know one another well as well as more tenuous relationships in networks can be used by community development workers to foster greater cohesion and cooperation within an area.
The minimum spanning tree : An unbiased method for brain network analysis
Tewarie, P.; van Dellen, E.; Hillebrand, A.; Stam, C. J.
2015-01-01
The brain is increasingly studied with graph theoretical approaches, which can be used to characterize network topology. However, studies on brain networks have reported contradictory findings, and do not easily converge to a clear concept of the structural and functional network organization of the
The minimum spanning tree: An unbiased method for brain network analysis
Tewarie, P.; van Dellen, E.; Hillebrand, A.; Stam, C.J.
2015-01-01
The brain is increasingly studied with graph theoretical approaches, which can be used to characterize network topology. However, studies on brain networks have reported contradictory findings, and do not easily converge to a clear concept of the structural and functional network organization of the
Implementing eigenvector methods/probabilistic neural networks for analysis of EEG signals.
Ubeyli, Elif Derya
2008-11-01
A new approach based on the implementation of probabilistic neural network (PNN) is presented for classification of electroencephalogram (EEG) signals. In practical applications of pattern recognition, there are often diverse features extracted from raw data which needs recognizing. Because of the importance of making the right decision, the present work is carried out for searching better classification procedures for the EEG signals. Decision making was performed in two stages: feature extraction by eigenvector methods and classification using the classifiers trained on the extracted features. The aim of the study is classification of the EEG signals by the combination of eigenvector methods and the PNN. The purpose is to determine an optimum classification scheme for this problem and also to infer clues about the extracted features. The present research demonstrated that the power levels of the power spectral density (PSD) estimates obtained by the eigenvector methods are the features which well represent the EEG signals and the PNN trained on these features achieved high classification accuracies.
Zahedi, Javad; Rounaghi, Mohammad Mahdi
2015-11-01
Stock price changes are receiving the increasing attention of investors, especially those who have long-term aims. The present study intends to assess the predictability of prices on Tehran Stock Exchange through the application of artificial neural network models and principal component analysis method and using 20 accounting variables. Finally, goodness of fit for principal component analysis has been determined through real values, and the effective factors in Tehran Stock Exchange prices have been accurately predicted and modeled in the form of a new pattern consisting of all variables.
Mbakwe, Anthony C; Saka, Anthony A; Choi, Keechoo; Lee, Young-Jae
2016-08-01
Highway traffic accidents all over the world result in more than 1.3 million fatalities annually. An alarming number of these fatalities occurs in developing countries. There are many risk factors that are associated with frequent accidents, heavy loss of lives, and property damage in developing countries. Unfortunately, poor record keeping practices are very difficult obstacle to overcome in striving to obtain a near accurate casualty and safety data. In light of the fact that there are numerous accident causes, any attempts to curb the escalating death and injury rates in developing countries must include the identification of the primary accident causes. This paper, therefore, seeks to show that the Delphi Technique is a suitable alternative method that can be exploited in generating highway traffic accident data through which the major accident causes can be identified. In order to authenticate the technique used, Korea, a country that underwent similar problems when it was in its early stages of development in addition to the availability of excellent highway safety records in its database, is chosen and utilized for this purpose. Validation of the methodology confirms the technique is suitable for application in developing countries. Furthermore, the Delphi Technique, in combination with the Bayesian Network Model, is utilized in modeling highway traffic accidents and forecasting accident rates in the countries of research. Copyright © 2016 Elsevier Ltd. All rights reserved.
DEFF Research Database (Denmark)
Hindhede, Anette Lykke; Aagaard-Hansen, Jens
2017-01-01
within communities. The concept of community reflects the idea that people’s behavior and well-being are influenced by interaction with others, and here, health promotion requires participation and local leadership to facilitate transmission and uptake of interventions for the overall community......This paper provides an example of the application of Social Network Analysis (SNA) method to assess community participation thereby strengthening planning and implementation of health promotion programming. Community health promotion often takes the form of services that reach out to or are located...... to achieve social change. However, considerable uncertainty exists over exact levels of participation in these interventions. The paper draws on a mixed methods research within a community development project in a vulnerable neighborhood of a town in Denmark. It presents a detailed analysis of the way...
Matrix method for analysis of network accuracy based on the beam dynamic theory
Energy Technology Data Exchange (ETDEWEB)
Pupkov, Y.A.; Levashov, Y.I. [AN SSSR, Novosibirsk (Russian Federation). Inst. Yadernoj Fiziki
1996-01-01
Starting the development of the alignment system, surveyors have faced several questions in respect to the degree of accuracy, the length of the region of relative accuracy, the optimal smoothing curve not resulting in the orbit distortion, and the scheme of measurements and appropriate instruments. Aiming to give answers to these questions, matrix method was practically applied for VEPP-4 alignment system. By the analysis of elements of the matrix A, the particular elements to be aligned with higher accuracy and the places where special attention should be paid to the positioning of the vacuum chamber and other equipment were able to be determined. The matrix of the orbit distortion A enabled to perform an analysis of the sensitivity of the magnet system to certain Fourier frequencies in a distribution of the quad displacements. The spectral sensitivity of magnet system for harmonics was much reduced when the matrix A was replaced by A-I. It was found that the surveyor can determine the orbit distortion and reduce the number of elements requiring alignment by applying the matrix method in the realignment process. (M.N.)
Directory of Open Access Journals (Sweden)
Amin Moori Roozali
2014-08-01
Full Text Available Correct estimation of water inflow into underground excavations can decrease safety risks and associated costs. Researchers have proposed different methods to asses this value. It has been proved that water transmissivity of a rock joint is a function of factors, such as normal stress, joint roughness and its size and water pressure therefore, a laboratory setup was proposed to quantitatively measure the flow as a function of mentioned parameters. Among these, normal stress has proved to be the most influential parameter. With increasing joint roughness and rock sample size, water flow has decreased while increasing water pressure has a direct increasing effect on the flow. To simulate the complex interaction of these parameters, neural networks and Fuzzy method together with regression analysis have been utilized. Correlation factors between laboratory results and obtained numerical ones show good agreement which proves usefulness of these methods for assessment of water inflow.
Statistical analysis of network data with R
Kolaczyk, Eric D
2014-01-01
Networks have permeated everyday life through everyday realities like the Internet, social networks, and viral marketing. As such, network analysis is an important growth area in the quantitative sciences, with roots in social network analysis going back to the 1930s and graph theory going back centuries. Measurement and analysis are integral components of network research. As a result, statistical methods play a critical role in network analysis. This book is the first of its kind in network research. It can be used as a stand-alone resource in which multiple R packages are used to illustrate how to conduct a wide range of network analyses, from basic manipulation and visualization, to summary and characterization, to modeling of network data. The central package is igraph, which provides extensive capabilities for studying network graphs in R. This text builds on Eric D. Kolaczyk’s book Statistical Analysis of Network Data (Springer, 2009).
Performance analysis of classification methods for indoor localization in VLC networks
Sánchez-Rodríguez, D.; Alonso-González, I.; Sánchez-Medina, J.; Ley-Bosch, C.; Díaz-Vilariño, L.
2017-01-01
Indoor localization has gained considerable attention over the past decade because of the emergence of numerous location-aware services. Research works have been proposed on solving this problem by using wireless networks. Nevertheless, there is still much room for improvement in the quality of
Ge, Long; Tian, Jin-hui; Li, Lun; Wang, Quan; Yang, Ke-hu
2015-11-19
Randomised clinical trials (RCTs) have been used to compare and evaluate different types of mesh fixation usually employed to repair open inguinal hernia. However, there is no consensus among surgeons on the best type of mesh fixation method to obtain optimal results. The choice often depends on surgeons' personal preference. This study aims to compare different types of mesh fixation methods to repair open inguinal hernias and their role in the incidences of chronic groin pain, risk of hernia recurrence, complications, operative time, length of hospital stay and postoperative pain, using Bayesian network meta-analysis and trial sequential analysis of RCTs. A systematic search will be performed using PubMed, EMBASE, the Cochrane Central Register of Controlled Trials (CENTRAL), Chinese Biomedical Literature Database (CBM) and Chinese Journal Full-text Database, to include RCTs of different mesh fixation methods (or fixation vs no fixation) during open inguinal hernia repair. The risk of bias in included RCTs will be evaluated according to the Cochrane Handbook V.5.1.0. Standard pairwise meta-analysis, trial sequential analysis and Bayesian network meta-analysis will be performed to compare the efficacy of different mesh fixation methods. Ethical approval and patient consent are not required since this study is a meta-analysis based on published studies. The results of this network meta-analysis and trial sequential analysis will be submitted to a peer-reviewed journal for publication. PROSPERO CRD42015023758. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/
Network analysis applications in hydrology
Price, Katie
2017-04-01
Applied network theory has seen pronounced expansion in recent years, in fields such as epidemiology, computer science, and sociology. Concurrent development of analytical methods and frameworks has increased possibilities and tools available to researchers seeking to apply network theory to a variety of problems. While water and nutrient fluxes through stream systems clearly demonstrate a directional network structure, the hydrological applications of network theory remain underexplored. This presentation covers a review of network applications in hydrology, followed by an overview of promising network analytical tools that potentially offer new insights into conceptual modeling of hydrologic systems, identifying behavioral transition zones in stream networks and thresholds of dynamical system response. Network applications were tested along an urbanization gradient in Atlanta, Georgia, USA. Peachtree Creek and Proctor Creek. Peachtree Creek contains a nest of five longterm USGS streamflow and water quality gages, allowing network application of longterm flow statistics. The watershed spans a range of suburban and heavily urbanized conditions. Summary flow statistics and water quality metrics were analyzed using a suite of network analysis techniques, to test the conceptual modeling and predictive potential of the methodologies. Storm events and low flow dynamics during Summer 2016 were analyzed using multiple network approaches, with an emphasis on tomogravity methods. Results indicate that network theory approaches offer novel perspectives for understanding long term and eventbased hydrological data. Key future directions for network applications include 1) optimizing data collection, 2) identifying "hotspots" of contaminant and overland flow influx to stream systems, 3) defining process domains, and 4) analyzing dynamic connectivity of various system components, including groundwatersurface water interactions.
Methods for analysis of passenger trip performance in a complex networked transportation system
Wang, Danyi
2007-12-01
The purpose of the Air Transportation System (ATS) is to provide safe and efficient transportation service of passengers and cargo. The on-time performance of a passenger's trip is a critical performance measurement of the Quality of Service (QOS) provided by any Air Transportation System. QOS has been correlated with airline profitability, productivity, customer loyalty and customer satisfaction (Heskett et al. 1994). Btatu and Barnhart have shown that official government and airline on-time performance metrics (i.e. flight-centric measures of air transportation) fail to accurately reflect the passenger experience (Btatu and Barnhart, 2005). Flight-based metrics do not include the trip delays accrued by passengers who were re-booked due to cancelled flights or missed connections. Also, flight-based metrics do not quantify the magnitude of the delay (only the likelihood) and thus fails to provide the consumer with a useful assessment of the impact of a delay. Passenger-centric metrics have not been developed because of the unavailability of airline proprietary data, which is also protected by anti-trust collusion concerns and civil liberty privacy restrictions. Moveover, the growth of the ATS is trending out of the historical range. The objectives of this research were to (1) estimate ATS-wide passenger trip delay using publicly accessible flight data, and (2) investigate passenger trip dynamics out of the range of historical data by building a passenger flow simulation model to predict impact on passenger trip time given anticipated changes in the future. The first objective enables researchers to conduct historical analysis on passenger on-time performance without proprietary itinerary data, and the second objective enables researchers to conduct experiments outside the range of historic data. The estimated passenger trip delay was for 1,030 routes between the 35 busiest airports in the United States in 2006. The major findings of this research are listed as
Spectral Analysis of Rich Network Topology in Social Networks
Wu, Leting
2013-01-01
Social networks have received much attention these days. Researchers have developed different methods to study the structure and characteristics of the network topology. Our focus is on spectral analysis of the adjacency matrix of the underlying network. Recent work showed good properties in the adjacency spectral space but there are few…
Saramago, Pedro; Woods, Beth; Weatherly, Helen; Manca, Andrea; Sculpher, Mark; Khan, Kamran; Vickers, Andrew J; MacPherson, Hugh
2016-10-06
Network meta-analysis methods, which are an extension of the standard pair-wise synthesis framework, allow for the simultaneous comparison of multiple interventions and consideration of the entire body of evidence in a single statistical model. There are well-established advantages to using individual patient data to perform network meta-analysis and methods for network meta-analysis of individual patient data have already been developed for dichotomous and time-to-event data. This paper describes appropriate methods for the network meta-analysis of individual patient data on continuous outcomes. This paper introduces and describes network meta-analysis of individual patient data models for continuous outcomes using the analysis of covariance framework. Comparisons are made between this approach and change score and final score only approaches, which are frequently used and have been proposed in the methodological literature. A motivating example on the effectiveness of acupuncture for chronic pain is used to demonstrate the methods. Individual patient data on 28 randomised controlled trials were synthesised. Consistency of endpoints across the evidence base was obtained through standardisation and mapping exercises. Individual patient data availability avoided the use of non-baseline-adjusted models, allowing instead for analysis of covariance models to be applied and thus improving the precision of treatment effect estimates while adjusting for baseline imbalance. The network meta-analysis of individual patient data using the analysis of covariance approach is advocated to be the most appropriate modelling approach for network meta-analysis of continuous outcomes, particularly in the presence of baseline imbalance. Further methods developments are required to address the challenge of analysing aggregate level data in the presence of baseline imbalance.
Advanced fault diagnosis methods in molecular networks.
Habibi, Iman; Emamian, Effat S; Abdi, Ali
2014-01-01
Analysis of the failure of cell signaling networks is an important topic in systems biology and has applications in target discovery and drug development. In this paper, some advanced methods for fault diagnosis in signaling networks are developed and then applied to a caspase network and an SHP2 network. The goal is to understand how, and to what extent, the dysfunction of molecules in a network contributes to the failure of the entire network. Network dysfunction (failure) is defined as failure to produce the expected outputs in response to the input signals. Vulnerability level of a molecule is defined as the probability of the network failure, when the molecule is dysfunctional. In this study, a method to calculate the vulnerability level of single molecules for different combinations of input signals is developed. Furthermore, a more complex yet biologically meaningful method for calculating the multi-fault vulnerability levels is suggested, in which two or more molecules are simultaneously dysfunctional. Finally, a method is developed for fault diagnosis of networks based on a ternary logic model, which considers three activity levels for a molecule instead of the previously published binary logic model, and provides equations for the vulnerabilities of molecules in a ternary framework. Multi-fault analysis shows that the pairs of molecules with high vulnerability typically include a highly vulnerable molecule identified by the single fault analysis. The ternary fault analysis for the caspase network shows that predictions obtained using the more complex ternary model are about the same as the predictions of the simpler binary approach. This study suggests that by increasing the number of activity levels the complexity of the model grows; however, the predictive power of the ternary model does not appear to be increased proportionally.
Improving Nonlethal Targeting: A Social Network Analysis Method for Military Planners
2012-12-01
memorandum (January 25, 2011). 14 Cox, “Information Operations,” 3. 15 For instance, Latimer argues that “in battle it is not sufficient for a...commander to avoid error; he needs actively to cause his enemy to make mistakes.” Jon Latimer , Deception in War (Woodstock, NY: Overlook Press, 2001), 1...Cambridge: Cambridge University Press, 2012), 36–37. 21 Everton, Disrupting Dark Networks, 37. 22 FM 3.0: Operations, 6–108. 23 Latimer , Deception, 60
Binary Classification Method of Social Network Users
Directory of Open Access Journals (Sweden)
I. A. Poryadin
2017-01-01
Full Text Available The subject of research is a binary classification method of social network users based on the data analysis they have placed. Relevance of the task to gain information about a person by examining the content of his/her pages in social networks is exemplified. The most common approach to its solution is a visual browsing. The order of the regional authority in our country illustrates that its using in school education is needed. The article shows restrictions on the visual browsing of pupil’s pages in social networks as a tool for the teacher and the school psychologist and justifies that a process of social network users’ data analysis should be automated. Explores publications, which describe such data acquisition, processing, and analysis methods and considers their advantages and disadvantages. The article also gives arguments to support a proposal to study the classification method of social network users. One such method is credit scoring, which is used in banks and credit institutions to assess the solvency of clients. Based on the high efficiency of the method there is a proposal for significant expansion of its using in other areas of society. The possibility to use logistic regression as the mathematical apparatus of the proposed method of binary classification has been justified. Such an approach enables taking into account the different types of data extracted from social networks. Among them: the personal user data, information about hobbies, friends, graphic and text information, behaviour characteristics. The article describes a number of existing methods of data transformation that can be applied to solve the problem. An experiment of binary gender-based classification of social network users is described. A logistic model obtained for this example includes multiple logical variables obtained by transforming the user surnames. This experiment confirms the feasibility of the proposed method. Further work is to define a system
Topological analysis of telecommunications networks
Directory of Open Access Journals (Sweden)
Milojko V. Jevtović
2011-01-01
Full Text Available A topological analysis of the structure of telecommunications networks is a very interesting topic in the network research, but also a key issue in their design and planning. Satisfying multiple criteria in terms of locations of switching nodes as well as their connectivity with respect to the requests for capacity, transmission speed, reliability, availability and cost are the main research objectives. There are three ways of presenting the topology of telecommunications networks: table, matrix or graph method. The table method is suitable for a network of a relatively small number of nodes in relation to the number of links. The matrix method involves the formation of a connection matrix in which its columns present source traffic nodes and its rows are the switching systems that belong to the destination. The method of the topology graph means that the network nodes are connected via directional or unidirectional links. We can thus easily analyze the structural parameters of telecommunications networks. This paper presents the mathematical analysis of the star-, ring-, fully connected loop- and grid (matrix-shaped topology as well as the topology based on the shortest path tree. For each of these topologies, the expressions for determining the number of branches, the middle level of reliability, the medium length and the average length of the link are given in tables. For the fully connected loop network with five nodes the values of all topological parameters are calculated. Based on the topological parameters, the relationships that represent integral and distributed indicators of reliability are given in this work as well as the values of the particular network. The main objectives of the topology optimization of telecommunications networks are: achieving the minimum complexity, maximum capacity, the shortest path message transfer, the maximum speed of communication and maximum economy. The performance of telecommunications networks is
Network analysis literacy a practical approach to the analysis of networks
Zweig, Katharina A
2014-01-01
Network Analysis Literacy focuses on design principles for network analytics projects. The text enables readers to: pose a defined network analytic question; build a network to answer the question; choose or design the right network analytic methods for a particular purpose, and more.
Social network analysis in medical education
Isba, Rachel; Woolf, Katherine; Hanneman, Robert
2016-01-01
Content\\ud Humans are fundamentally social beings. The social systems within which we live our lives (families, schools, workplaces, professions, friendship groups) have a significant influence on our health, success and well-being. These groups can be characterised as networks and analysed using social network analysis.\\ud \\ud Social Network Analysis\\ud Social network analysis is a mainly quantitative method for analysing how relationships between individuals form and affect those individual...
Interrogation Methods and Terror Networks
Baccara, Mariagiovanna; Bar-Isaac, Heski
We examine how the structure of terror networks varies with legal limits on interrogation and the ability of authorities to extract information from detainees. We assume that terrorist networks are designed to respond optimally to a tradeoff caused by information exchange: Diffusing information widely leads to greater internal efficiency, but it leaves the organization more vulnerable to law enforcement. The extent of this vulnerability depends on the law enforcement authority’s resources, strategy and interrogation methods. Recognizing that the structure of a terrorist network responds to the policies of law enforcement authorities allows us to begin to explore the most effective policies from the authorities’ point of view.
Statistical network analysis for analyzing policy networks
DEFF Research Database (Denmark)
Robins, Garry; Lewis, Jenny; Wang, Peng
2012-01-01
To analyze social network data using standard statistical approaches is to risk incorrect inference. The dependencies among observations implied in a network conceptualization undermine standard assumptions of the usual general linear models. One of the most quickly expanding areas of social...... and policy network methodology is the development of statistical modeling approaches that can accommodate such dependent data. In this article, we review three network statistical methods commonly used in the current literature: quadratic assignment procedures, exponential random graph models (ERGMs...
Multiple network interface core apparatus and method
Underwood, Keith D [Albuquerque, NM; Hemmert, Karl Scott [Albuquerque, NM
2011-04-26
A network interface controller and network interface control method comprising providing a single integrated circuit as a network interface controller and employing a plurality of network interface cores on the single integrated circuit.
Google matrix analysis of directed networks
Ermann, Leonardo; Frahm, Klaus M.; Shepelyansky, Dima L.
2015-10-01
In the past decade modern societies have developed enormous communication and social networks. Their classification and information retrieval processing has become a formidable task for the society. Because of the rapid growth of the World Wide Web, and social and communication networks, new mathematical methods have been invented to characterize the properties of these networks in a more detailed and precise way. Various search engines extensively use such methods. It is highly important to develop new tools to classify and rank a massive amount of network information in a way that is adapted to internal network structures and characteristics. This review describes the Google matrix analysis of directed complex networks demonstrating its efficiency using various examples including the World Wide Web, Wikipedia, software architectures, world trade, social and citation networks, brain neural networks, DNA sequences, and Ulam networks. The analytical and numerical matrix methods used in this analysis originate from the fields of Markov chains, quantum chaos, and random matrix theory.
Directory of Open Access Journals (Sweden)
Dewei Tang
2017-03-01
Full Text Available The main task of the third Chinese lunar exploration project is to obtain soil samples that are greater than two meters in length and to acquire bedding information from the surface of the moon. The driving component is the power output unit of the drilling system in the lander; it provides drilling power for core drilling tools. High temperatures can cause the sensors, permanent magnet, gears, and bearings to suffer irreversible damage. In this paper, a thermal analysis model for this driving component, based on the thermal network method (TNM was established and the model was solved using the quasi-Newton method. A vacuum test platform was built and an experimental verification method (EVM was applied to measure the surface temperature of the driving component. Then, the TNM was optimized, based on the principle of heat distribution. Through comparative analyses, the reasonableness of the TNM is validated. Finally, the static temperature field of the driving component was predicted and the “safe working times” of every mode are given.
Energy Technology Data Exchange (ETDEWEB)
Han, Sang Min; Kim, Ar Ryum; Seong, Poong Hyun [KAIST, Daejeon (Korea, Republic of)
2016-05-15
In this study, team safety culture competency of a team was estimated through SNA, as a team safety culture index. To overcome the limit of existing safety culture evaluation methods, the concept of competency and SNA were adopted. To estimate team safety culture competency, we defined the definition, range and goal of team safety culture competencies. Derivation of core team safety culture competencies is performed and its behavioral characteristics were derived for each safety culture competency, from the procedures used in NPPs and existing criteria to assess safety culture. Then observation was chosen as a method to provide the input data for the SNA matrix of team members versus insufficient team safety culture competencies. Then through matrix operation, the matrix was converted into the two meaningful values, which are density of team members and degree centralities of each team safety culture competency. Density of tem members and degree centrality of each team safety culture competency represent the team safety culture index and the priority of team safety culture competency to be improved.
de Nooy, W.; Crothers, C.
2009-01-01
Social network analysis (SNA) focuses on the structure of ties within a set of social actors, e.g., persons, groups, organizations, and nations, or the products of human activity or cognition such as web sites, semantic concepts, and so on. It is linked to structuralism in sociology stressing the
Heinrich, Steffen; Uribe, Franziska Laporte; Wübbeler, Markus; Hoffmann, Wolfgang; Roes, Martina
2016-01-01
In general, most people with dementia living in the community are served by family caregivers at home. A similar situation is found in Germany. One primary goal of dementia care networks is to provide information on support services available to these caregiving relatives of people with dementia via knowledge management. The evaluation of knowledge management tools and processes for dementia care networks is relevant to their performance in successfully achieving information goals. One goal of this paper was the analysis of knowledge evaluation in dementia care networks, including potential barriers and facilitators, across Germany within the DemNet-D study. Additionally, the impact of highly formalized and less formalized knowledge management performed in dementia care networks was analyzed relative to family caregivers' feelings of being informed about dementia support services. Qualitative data were collected through interviews with and semi-standardized questionnaires administered to key persons from 13 dementia care networks between 2013 and 2014. Quantitative data were collected using standardized questionnaires. A structured content analysis and a mixed-methods analysis were conducted. The analyses indicated that the development of knowledge goals is important for a systematic knowledge evaluation process. Feedback from family caregivers was found to be beneficial for the target-oriented evaluation of dementia care network services. Surveys and special conferences, such as quality circles, were used in certain networks to solicit this feedback. Limited resources can hinder the development of formalized knowledge evaluation processes. More formalized knowledge management processes in dementia care networks can lead to a higher level of knowledge among family caregivers. The studied tools, processes and potential barriers related to knowledge evaluation contribute to the development and optimization of knowledge evaluation strategies for use in dementia care
Network systems security analysis
Yilmaz, Ä.°smail
2015-05-01
Network Systems Security Analysis has utmost importance in today's world. Many companies, like banks which give priority to data management, test their own data security systems with "Penetration Tests" by time to time. In this context, companies must also test their own network/server systems and take precautions, as the data security draws attention. Based on this idea, the study cyber-attacks are researched throughoutly and Penetration Test technics are examined. With these information on, classification is made for the cyber-attacks and later network systems' security is tested systematically. After the testing period, all data is reported and filed for future reference. Consequently, it is found out that human beings are the weakest circle of the chain and simple mistakes may unintentionally cause huge problems. Thus, it is clear that some precautions must be taken to avoid such threats like updating the security software.
Arcos-García, Álvaro; Álvarez-García, Juan A; Soria-Morillo, Luis M
2018-01-31
This paper presents a Deep Learning approach for traffic sign recognition systems. Several classification experiments are conducted over publicly available traffic sign datasets from Germany and Belgium using a Deep Neural Network which comprises Convolutional layers and Spatial Transformer Networks. Such trials are built to measure the impact of diverse factors with the end goal of designing a Convolutional Neural Network that can improve the state-of-the-art of traffic sign classification task. First, different adaptive and non-adaptive stochastic gradient descent optimisation algorithms such as SGD, SGD-Nesterov, RMSprop and Adam are evaluated. Subsequently, multiple combinations of Spatial Transformer Networks placed at distinct positions within the main neural network are analysed. The recognition rate of the proposed Convolutional Neural Network reports an accuracy of 99.71% in the German Traffic Sign Recognition Benchmark, outperforming previous state-of-the-art methods and also being more efficient in terms of memory requirements. Copyright © 2018 Elsevier Ltd. All rights reserved.
Methods and applications for detecting structure in complex networks
Leicht, Elizabeth A.
The use of networks to represent systems of interacting components is now common in many fields including the biological, physical, and social sciences. Network models are widely applicable due to their relatively simple framework of vertices and edges. Network structure, patterns of connection between vertices, impacts both the functioning of networks and processes occurring on networks. However, many aspects of network structure are still poorly understood. This dissertation presents a set of network analysis methods and applications to real-world as well as simulated networks. The methods are divided into two main types: linear algebra formulations and probabilistic mixture model techniques. Network models lend themselves to compact mathematical representation as matrices, making linear algebra techniques useful probes of network structure. We present methods for the detection of two distinct, but related, network structural forms. First, we derive a measure of vertex similarity based upon network structure. The method builds on existing ideas concerning calculation of vertex similarity, but generalizes and extends the scope to large networks. Second, we address the detection of communities or modules in a specific class of networks, directed networks. We propose a method for detecting community structure in directed networks, which is an extension of a community detection method previously only known for undirected networks. Moving away from linear algebra formulations, we propose two methods for network structure detection based on probabilistic techniques. In the first method, we use the machinery of the expectation-maximization (EM) algorithm to probe patterns of connection among vertices in static networks. The technique allows for the detection of a broad range of types of structure in networks. The second method focuses on time evolving networks. We propose an application of the EM algorithm to evolving networks that can reveal significant structural
Review Essay: Does Qualitative Network Analysis Exist?
Directory of Open Access Journals (Sweden)
Rainer Diaz-Bone
2007-01-01
Full Text Available Social network analysis was formed and established in the 1970s as a way of analyzing systems of social relations. In this review the theoretical-methodological standpoint of social network analysis ("structural analysis" is introduced and the different forms of social network analysis are presented. Structural analysis argues that social actors and social relations are embedded in social networks, meaning that action and perception of actors as well as the performance of social relations are influenced by the network structure. Since the 1990s structural analysis has integrated concepts such as agency, discourse and symbolic orientation and in this way structural analysis has opened itself. Since then there has been increasing use of qualitative methods in network analysis. They are used to include the perspective of the analyzed actors, to explore networks, and to understand network dynamics. In the reviewed book, edited by Betina HOLLSTEIN and Florian STRAUS, the twenty predominantly empirically orientated contributions demonstrate the possibilities of combining quantitative and qualitative methods in network analyses in different research fields. In this review we examine how the contributions succeed in applying and developing the structural analysis perspective, and the self-positioning of "qualitative network analysis" is evaluated. URN: urn:nbn:de:0114-fqs0701287
Understanding complex interactions using social network analysis.
Pow, Janette; Gayen, Kaberi; Elliott, Lawrie; Raeside, Robert
2012-10-01
The aim of this paper is to raise the awareness of social network analysis as a method to facilitate research in nursing research. The application of social network analysis in assessing network properties has allowed greater insight to be gained in many areas including sociology, politics, business organisation and health care. However, the use of social networks in nursing has not received sufficient attention. Review of literature and illustration of the application of the method of social network analysis using research examples. First, the value of social networks will be discussed. Then by using illustrative examples, the value of social network analysis to nursing will be demonstrated. The method of social network analysis is found to give greater insights into social situations involving interactions between individuals and has particular application to the study of interactions between nurses and between nurses and patients and other actors. Social networks are systems in which people interact. Two quantitative techniques help our understanding of these networks. The first is visualisation of the network. The second is centrality. Individuals with high centrality are key communicators in a network. Applying social network analysis to nursing provides a simple method that helps gain an understanding of human interaction and how this might influence various health outcomes. It allows influential individuals (actors) to be identified. Their influence on the formation of social norms and communication can determine the extent to which new interventions or ways of thinking are accepted by a group. Thus, working with key individuals in a network could be critical to the success and sustainability of an intervention. Social network analysis can also help to assess the effectiveness of such interventions for the recipient and the service provider. © 2012 Blackwell Publishing Ltd.
Gebali, Fayez
2015-01-01
This textbook presents the mathematical theory and techniques necessary for analyzing and modeling high-performance global networks, such as the Internet. The three main building blocks of high-performance networks are links, switching equipment connecting the links together, and software employed at the end nodes and intermediate switches. This book provides the basic techniques for modeling and analyzing these last two components. Topics covered include, but are not limited to: Markov chains and queuing analysis, traffic modeling, interconnection networks and switch architectures and buffering strategies. · Provides techniques for modeling and analysis of network software and switching equipment; · Discusses design options used to build efficient switching equipment; · Includes many worked examples of the application of discrete-time Markov chains to communication systems; · Covers the mathematical theory and techniques necessary for ana...
Datta, Sumona; Shah, Lena; Gilman, Robert H; Evans, Carlton A
2017-08-01
The performance of laboratory tests to diagnose pulmonary tuberculosis is dependent on the quality of the sputum sample tested. The relative merits of sputum collection methods to improve tuberculosis diagnosis are poorly characterised. We therefore aimed to investigate the effects of sputum collection methods on tuberculosis diagnosis. We did a systematic review and meta-analysis to investigate whether non-invasive sputum collection methods in people aged at least 12 years improve the diagnostic performance of laboratory testing for pulmonary tuberculosis. We searched PubMed, Google Scholar, ProQuest, Web of Science, CINAHL, and Embase up to April 14, 2017, to identify relevant experimental, case-control, or cohort studies. We analysed data by pairwise meta-analyses with a random-effects model and by network meta-analysis. All diagnostic performance data were calculated at the sputum-sample level, except where authors only reported data at the individual patient-level. Heterogeneity was assessed, with potential causes identified by logistic meta-regression. We identified 23 eligible studies published between 1959 and 2017, involving 8967 participants who provided 19 252 sputum samples. Brief, on-demand spot sputum collection was the main reference standard. Pooled sputum collection increased tuberculosis diagnosis by microscopy (odds ratio [OR] 1·6, 95% CI 1·3-1·9, p<0·0001) or culture (1·7, 1·2-2·4, p=0·01). Providing instructions to the patient before sputum collection, during observed collection, or together with physiotherapy assistance increased diagnostic performance by microscopy (OR 1·6, 95% CI 1·3-2·0, p<0·0001). Collecting early morning sputum did not significantly increase diagnostic performance of microscopy (OR 1·5, 95% CI 0·9-2·6, p=0·2) or culture (1·4, 0·9-2·4, p=0·2). Network meta-analysis confirmed these findings, and revealed that both pooled and instructed spot sputum collections were similarly effective techniques for
Measuring Road Network Vulnerability with Sensitivity Analysis
Jun-qiang, Leng; Long-hai, Yang; Liu, Wei-yi; Zhao, Lin
2017-01-01
This paper focuses on the development of a method for road network vulnerability analysis, from the perspective of capacity degradation, which seeks to identify the critical infrastructures in the road network and the operational performance of the whole traffic system. This research involves defining the traffic utility index and modeling vulnerability of road segment, route, OD (Origin Destination) pair and road network. Meanwhile, sensitivity analysis method is utilized to calculate the change of traffic utility index due to capacity degradation. This method, compared to traditional traffic assignment, can improve calculation efficiency and make the application of vulnerability analysis to large actual road network possible. Finally, all the above models and calculation method is applied to actual road network evaluation to verify its efficiency and utility. This approach can be used as a decision-supporting tool for evaluating the performance of road network and identifying critical infrastructures in transportation planning and management, especially in the resource allocation for mitigation and recovery. PMID:28125706
Methods for Analyzing Pipe Networks
DEFF Research Database (Denmark)
Nielsen, Hans Bruun
1989-01-01
The governing equations for a general network are first set up and then reformulated in terms of matrices. This is developed to show that the choice of model for the flow equations is essential for the behavior of the iterative method used to solve the problem. It is shown that it is better to fo...... demonstrated that this method offers good starting values for a Newton-Raphson iteration.......The governing equations for a general network are first set up and then reformulated in terms of matrices. This is developed to show that the choice of model for the flow equations is essential for the behavior of the iterative method used to solve the problem. It is shown that it is better...... to formulate the flow equations in terms of pipe discharges than in terms of energy heads. The behavior of some iterative methods is compared in the initial phase with large errors. It is explained why the linear theory method oscillates when the iteration gets close to the solution, and it is further...
Social network analysis and dual rover communications
Litaker, Harry L.; Howard, Robert L.
2013-10-01
Social network analysis (SNA) refers to the collection of techniques, tools, and methods used in sociometry aiming at the analysis of social networks to investigate decision making, group communication, and the distribution of information. Human factors engineers at the National Aeronautics and Space Administration (NASA) conducted a social network analysis on communication data collected during a 14-day field study operating a dual rover exploration mission to better understand the relationships between certain network groups such as ground control, flight teams, and planetary science. The analysis identified two communication network structures for the continuous communication and Twice-a-Day Communication scenarios as a split network and negotiated network respectfully. The major nodes or groups for the networks' architecture, transmittal status, and information were identified using graphical network mapping, quantitative analysis of subjective impressions, and quantified statistical analysis using Sociometric Statue and Centrality. Post-questionnaire analysis along with interviews revealed advantages and disadvantages of each network structure with team members identifying the need for a more stable continuous communication network, improved robustness of voice loops, and better systems training/capabilities for scientific imagery data and operational data during Twice-a-Day Communications.
Sato, Yuta; Murakami, Yota; Takahashi, Masayuki
2017-07-08
A variety of biochemical fractionation methods are available for the quantification of cytoskeletal components. However, each method is designed to target only one cytoskeletal network, either the microtubule (MT) or actin cytoskeleton, and non-targeted cytoskeletal networks are ignored. Considering the importance of MT-actin crosstalk, the organization of both the targeted and non-targeted cytoskeletal networks must be retained intact during fractionation for the accurate analysis of cytoskeletal organization. In this study, we reveal that existing fractionation methods, represented by the MT-sedimentation-method for MTs and the Triton X-100 solubility assay-method for actin cytoskeletons, disrupt the organizations of the non-targeted cytoskeletons. We demonstrate a novel fractionation method for the accurate analysis of the cytoskeletal organizations using a taxol-containing PEM-based permeabilization buffer, which we name "semi-retentive cytoskeletal fractionation (SERCYF)-method". The organizations of both MTs and actin cytoskeletons were retained intact even after permeabilization with this buffer. By using the SERCYF-method, we analyzed the effects of nocodazole on the cytoskeletal organizations biochemically and showed promotion of the actin cytoskeletal organization by MT depolymerization. Copyright © 2017 Elsevier Inc. All rights reserved.
Network meta-analysis, electrical networks and graph theory.
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.
A Systematic, Automated Network Planning Method
DEFF Research Database (Denmark)
Holm, Jens Åge; Pedersen, Jens Myrup
2006-01-01
This paper describes a case study conducted to evaluate the viability of a systematic, automated network planning method. The motivation for developing the network planning method was that many data networks are planned in an adhoc manner with no assurance of quality of the solution with respect...... to consistency and long-term characteristics. The developed method gives significant improvements on these parameters. The case study was conducted as a comparison between an existing network where the traffic was known and a proposed network designed by the developed method. It turned out that the proposed...... network performed better than the existing network with regard to the performance measurements used which reflected how well the traffic was routed in the networks and the cost of establishing the networks. Challenges that need to be solved before the developed method can be used to design network...
Santoni, Daniele; Swiercz, Aleksandra; Zmieńko, Agnieszka; Kasprzak, Marta; Blazewicz, Marek; Bertolazzi, Paola; Felici, Giovanni
2014-02-01
Experimental co-expression data and protein-protein interaction networks are frequently used to analyze the interactions among genes or proteins. Recent studies have investigated methods to integrate these two sources of information. We propose a new method to integrate co-expression data obtained through DNA microarray analysis (MA) and protein-protein interaction (PPI) network data, and apply it to Arabidopsis thaliana. The proposed method identifies small subsets of highly interacting proteins. Based on the analysis of the basis of co-localization and mRNA developmental expression, we show that these groups provide important biological insights; additionally, these subsets are significantly enriched with respect to KEGG Pathways and can be used to predict successfully whether proteins belong to known pathways. Thus, the method is able to provide relevant biological information and support the functional identification of complex genetic traits of economic value in plant agrigenomics research. The method has been implemented in a prototype software tool named CLAIM (CLuster Analysis Integration Method) and can be downloaded from http://bio.cs.put.poznan.pl/research_fields . CLAIM is based on the separate clustering of MA and PPI data; the clusters are merged in a special graph; cliques of this graph are subsets of strongly connected proteins. The proposed method was successfully compared with existing methods. CLAIM appears to be a useful semi-automated tool for protein functional analysis and warrants further evaluation in agrigenomics research.
Multidimensional Analysis of Linguistic Networks
Araújo, Tanya; Banisch, Sven
Network-based approaches play an increasingly important role in the analysis of data even in systems in which a network representation is not immediately apparent. This is particularly true for linguistic networks, which use to be induced from a linguistic data set for which a network perspective is only one out of several options for representation. Here we introduce a multidimensional framework for network construction and analysis with special focus on linguistic networks. Such a framework is used to show that the higher is the abstraction level of network induction, the harder is the interpretation of the topological indicators used in network analysis. Several examples are provided allowing for the comparison of different linguistic networks as well as to networks in other fields of application of network theory. The computation and the intelligibility of some statistical indicators frequently used in linguistic networks are discussed. It suggests that the field of linguistic networks, by applying statistical tools inspired by network studies in other domains, may, in its current state, have only a limited contribution to the development of linguistic theory.
Satellite image analysis using neural networks
Sheldon, Roger A.
1990-01-01
The tremendous backlog of unanalyzed satellite data necessitates the development of improved methods for data cataloging and analysis. Ford Aerospace has developed an image analysis system, SIANN (Satellite Image Analysis using Neural Networks) that integrates the technologies necessary to satisfy NASA's science data analysis requirements for the next generation of satellites. SIANN will enable scientists to train a neural network to recognize image data containing scenes of interest and then rapidly search data archives for all such images. The approach combines conventional image processing technology with recent advances in neural networks to provide improved classification capabilities. SIANN allows users to proceed through a four step process of image classification: filtering and enhancement, creation of neural network training data via application of feature extraction algorithms, configuring and training a neural network model, and classification of images by application of the trained neural network. A prototype experimentation testbed was completed and applied to climatological data.
Social network analysis in medical education.
Isba, Rachel; Woolf, Katherine; Hanneman, Robert
2017-01-01
Humans are fundamentally social beings. The social systems within which we live our lives (families, schools, workplaces, professions, friendship groups) have a significant influence on our health, success and well-being. These groups can be characterised as networks and analysed using social network analysis. Social network analysis is a mainly quantitative method for analysing how relationships between individuals form and affect those individuals, but also how individual relationships build up into wider social structures that influence outcomes at a group level. Recent increases in computational power have increased the accessibility of social network analysis methods for application to medical education research. Social network analysis has been used to explore team-working, social influences on attitudes and behaviours, the influence of social position on individual success, and the relationship between social cohesion and power. This makes social network analysis theories and methods relevant to understanding the social processes underlying academic performance, workplace learning and policy-making and implementation in medical education contexts. Social network analysis is underused in medical education, yet it is a method that could yield significant insights that would improve experiences and outcomes for medical trainees and educators, and ultimately for patients. © 2016 John Wiley & Sons Ltd and The Association for the Study of Medical Education.
Network Analysis, Architecture, and Design
McCabe, James D
2007-01-01
Traditionally, networking has had little or no basis in analysis or architectural development, with designers relying on technologies they are most familiar with or being influenced by vendors or consultants. However, the landscape of networking has changed so that network services have now become one of the most important factors to the success of many third generation networks. It has become an important feature of the designer's job to define the problems that exist in his network, choose and analyze several optimization parameters during the analysis process, and then prioritize and evalua
NEAT: an efficient network enrichment analysis test.
Signorelli, Mirko; Vinciotti, Veronica; Wit, Ernst C
2016-09-05
Network enrichment analysis is a powerful method, which allows to integrate gene enrichment analysis with the information on relationships between genes that is provided by gene networks. Existing tests for network enrichment analysis deal only with undirected networks, they can be computationally slow and are based on normality assumptions. We propose NEAT, a test for network enrichment analysis. The test is based on the hypergeometric distribution, which naturally arises as the null distribution in this context. NEAT can be applied not only to undirected, but to directed and partially directed networks as well. Our simulations indicate that NEAT is considerably faster than alternative resampling-based methods, and that its capacity to detect enrichments is at least as good as the one of alternative tests. We discuss applications of NEAT to network analyses in yeast by testing for enrichment of the Environmental Stress Response target gene set with GO Slim and KEGG functional gene sets, and also by inspecting associations between functional sets themselves. NEAT is a flexible and efficient test for network enrichment analysis that aims to overcome some limitations of existing resampling-based tests. The method is implemented in the R package neat, which can be freely downloaded from CRAN ( https://cran.r-project.org/package=neat ).
Sensor Network Data Fusion Methods
Directory of Open Access Journals (Sweden)
Martynas Vervečka
2011-03-01
Full Text Available Sensor network data fusion is widely used in warfare, in areas such as automatic target recognition, battlefield surveillance, automatic vehicle control, multiple target surveillance, etc. Non-military use example are: medical equipment status monitoring, intelligent home. The paper describes sensor networks topologies, sensor network advantages against the isolated sensors, most common network topologies, their advantages and disadvantages.Article in Lithuanian
Energy Technology Data Exchange (ETDEWEB)
Kalb, Jeffrey L.; Lee, David S.
2008-01-01
Emerging high-bandwidth, low-latency network technology has made network-based architectures both feasible and potentially desirable for use in satellite payload architectures. The selection of network topology is a critical component when developing these multi-node or multi-point architectures. This study examines network topologies and their effect on overall network performance. Numerous topologies were reviewed against a number of performance, reliability, and cost metrics. This document identifies a handful of good network topologies for satellite applications and the metrics used to justify them as such. Since often multiple topologies will meet the requirements of the satellite payload architecture under development, the choice of network topology is not easy, and in the end the choice of topology is influenced by both the design characteristics and requirements of the overall system and the experience of the developer.
Structural Analysis of Complex Networks
Dehmer, Matthias
2011-01-01
Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Applications to biology, chemistry, linguistics, and data analysis are emphasized. The book is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science,
Models of network reliability analysis, combinatorics, and Monte Carlo
Gertsbakh, Ilya B
2009-01-01
Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unreliable edges and/or nodes, network lifetime distribution in the process of its destruction, network stationary behavior for renewable components, importance measures of network elements, reliability gradient, and network optimal reliability synthesis
Directory of Open Access Journals (Sweden)
Yuyang Gao
2016-09-01
Full Text Available With increasing importance being attached to big data mining, analysis, and forecasting in the field of wind energy, how to select an optimization model to improve the forecasting accuracy of the wind speed time series is not only an extremely challenging problem, but also a problem of concern for economic forecasting. The artificial intelligence model is widely used in forecasting and data processing, but the individual back-propagation artificial neural network cannot always satisfy the time series forecasting needs. Thus, a hybrid forecasting approach has been proposed in this study, which consists of data preprocessing, parameter optimization and a neural network for advancing the accuracy of short-term wind speed forecasting. According to the case study, in which the data are collected from Peng Lai, a city located in China, the simulation results indicate that the hybrid forecasting method yields better predictions compared to the individual BP, which indicates that the hybrid method exhibits stronger forecasting ability.
Zhang, Ai-hua; Sun, Hui; Han, Ying; Yan, Guang-li; Yuan, Ye; Song, Gao-chen; Yuan, Xiao-xia; Xie, Ning; Wang, Xi-jun
2013-08-06
Metabolomics is the study of metabolic changes in biological systems and provides the small molecule fingerprints related to the disease. Extracting biomedical information from large metabolomics data sets by multivariate data analysis is of considerable complexity. Therefore, more efficient and optimizing metabolomics data processing technologies are needed to improve mass spectrometry applications in biomarker discovery. Here, we report the findings of urine metabolomic investigation of hepatitis C virus (HCV) patients by high-throughput ultraperformance liquid chromatography-mass spectrometry (UPLC-MS) coupled with pattern recognition methods (principal component analysis, partial least-squares, and OPLS-DA) and network pharmacology. A total of 20 urinary differential metabolites (13 upregulated and 7 downregulated) were identified and contributed to HCV progress, involve several key metabolic pathways such as taurine and hypotaurine metabolism, glycine, serine and threonine metabolism, histidine metabolism, arginine and proline metabolism, and so forth. Metabolites identified through metabolic profiling may facilitate the development of more accurate marker algorithms to better monitor disease progression. Network analysis validated close contact between these metabolites and implied the importance of the metabolic pathways. Mapping altered metabolites to KEGG pathways identified alterations in a variety of biological processes mediated through complex networks. These findings may be promising to yield a valuable and noninvasive tool that insights into the pathophysiology of HCV and to advance the early diagnosis and monitor the progression of disease. Overall, this investigation illustrates the power of the UPLC-MS platform combined with the pattern recognition and network analysis methods that can engender new insights into HCV pathobiology.
Lu, Junfeng; Zhang, Han; Hameed, N U Farrukh; Zhang, Jie; Yuan, Shiwen; Qiu, Tianming; Shen, Dinggang; Wu, Jinsong
2017-10-23
As a noninvasive and "task-free" technique, resting-state functional magnetic resonance imaging (rs-fMRI) has been gradually applied to pre-surgical functional mapping. Independent component analysis (ICA)-based mapping has shown advantage, as no a priori information is required. We developed an automated method for identifying language network in brain tumor subjects using ICA on rs-fMRI. In addition to standard processing strategies, we applied a discriminability-index-based component identification algorithm to identify language networks in three different groups. The results from the training group were validated in an independent group of healthy human subjects. For the testing group, ICA and seed-based correlation were separately computed and the detected language networks were assessed by intra-operative stimulation mapping to verify reliability of application in the clinical setting. Individualized language network mapping could be automatically achieved for all subjects from the two healthy groups except one (19/20, success rate = 95.0%). In the testing group (brain tumor patients), the sensitivity of the language mapping result was 60.9%, which increased to 87.0% (superior to that of conventional seed-based correlation [47.8%]) after extending to a radius of 1 cm. We established an automatic and practical component identification method for rs-fMRI-based pre-surgical mapping and successfully applied it to brain tumor patients.
Industrial entrepreneurial network: Structural and functional analysis
Medvedeva, M. A.; Davletbaev, R. H.; Berg, D. B.; Nazarova, J. J.; Parusheva, S. S.
2016-12-01
Structure and functioning of two model industrial entrepreneurial networks are investigated in the present paper. One of these networks is forming when implementing an integrated project and consists of eight agents, which interact with each other and external environment. The other one is obtained from the municipal economy and is based on the set of the 12 real business entities. Analysis of the networks is carried out on the basis of the matrix of mutual payments aggregated over the certain time period. The matrix is created by the methods of experimental economics. Social Network Analysis (SNA) methods and instruments were used in the present research. The set of basic structural characteristics was investigated: set of quantitative parameters such as density, diameter, clustering coefficient, different kinds of centrality, and etc. They were compared with the random Bernoulli graphs of the corresponding size and density. Discovered variations of random and entrepreneurial networks structure are explained by the peculiarities of agents functioning in production network. Separately, were identified the closed exchange circuits (cyclically closed contours of graph) forming an autopoietic (self-replicating) network pattern. The purpose of the functional analysis was to identify the contribution of the autopoietic network pattern in its gross product. It was found that the magnitude of this contribution is more than 20%. Such value allows using of the complementary currency in order to stimulate economic activity of network agents.
An effective method for network module extraction from microarray data
Directory of Open Access Journals (Sweden)
Mahanta Priyakshi
2012-08-01
Full Text Available Abstract Background The development of high-throughput Microarray technologies has provided various opportunities to systematically characterize diverse types of computational biological networks. Co-expression network have become popular in the analysis of microarray data, such as for detecting functional gene modules. Results This paper presents a method to build a co-expression network (CEN and to detect network modules from the built network. We use an effective gene expression similarity measure called NMRS (Normalized mean residue similarity to construct the CEN. We have tested our method on five publicly available benchmark microarray datasets. The network modules extracted by our algorithm have been biologically validated in terms of Q value and p value. Conclusions Our results show that the technique is capable of detecting biologically significant network modules from the co-expression network. Biologist can use this technique to find groups of genes with similar functionality based on their expression information.
Tourism Destinations Network Analysis, Social Network Analysis Approach
Directory of Open Access Journals (Sweden)
2015-09-01
Full Text Available The tourism industry is becoming one of the world's largest economical sources, and is expected to become the world's first industry by 2020. Previous studies have focused on several aspects of this industry including sociology, geography, tourism management and development, but have paid less attention to analytical and quantitative approaches. This study introduces some network analysis techniques and measures aiming at studying the structural characteristics of tourism networks. More specifically, it presents a methodology to analyze tourism destinations network. We apply the methodology to analyze mazandaran’s Tourism destination network, one of the most famous tourism areas of Iran.
Introduction to Social Network Analysis
Zaphiris, Panayiotis; Ang, Chee Siang
Social Network analysis focuses on patterns of relations between and among people, organizations, states, etc. It aims to describe networks of relations as fully as possible, identify prominent patterns in such networks, trace the flow of information through them, and discover what effects these relations and networks have on people and organizations. Social network analysis offers a very promising potential for analyzing human-human interactions in online communities (discussion boards, newsgroups, virtual organizations). This Tutorial provides an overview of this analytic technique and demonstrates how it can be used in Human Computer Interaction (HCI) research and practice, focusing especially on Computer Mediated Communication (CMC). This topic acquires particular importance these days, with the increasing popularity of social networking websites (e.g., youtube, myspace, MMORPGs etc.) and the research interest in studying them.
Tumor Diagnosis Using Backpropagation Neural Network Method
Ma, Lixing; Looney, Carl; Sukuta, Sydney; Bruch, Reinhard; Afanasyeva, Natalia
1998-05-01
For characterization of skin cancer, an artificial neural network (ANN) method has been developed to diagnose normal tissue, benign tumor and melanoma. The pattern recognition is based on a three-layer neural network fuzzy learning system. In this study, the input neuron data set is the Fourier Transform infrared (FT-IR)spectrum obtained by a new Fiberoptic Evanescent Wave Fourier Transform Infrared (FEW-FTIR) spectroscopy method in the range of 1480 to 1850 cm-1. Ten input features are extracted from the absorbency values in this region. A single hidden layer of neural nodes with sigmoids activation functions clusters the feature space into small subclasses and the output nodes are separated in different nonconvex classes to permit nonlinear discrimination of disease states. The output is classified as three classes: normal tissue, benign tumor and melanoma. The results obtained from the neural network pattern recognition are shown to be consistent with traditional medical diagnosis. Input features have also been extracted from the absorbency spectra using chemical factor analysis. These abstract features or factors are also used in the classification.
The Application of Social Network Analysis to Team Sports
Lusher, Dean; Robins, Garry; Kremer, Peter
2010-01-01
This article reviews how current social network analysis might be used to investigate individual and group behavior in sporting teams. Social network analysis methods permit researchers to explore social relations between team members and their individual-level qualities simultaneously. As such, social network analysis can be seen as augmenting…
Predictive structural dynamic network analysis.
Chen, Rong; Herskovits, Edward H
2015-04-30
Classifying individuals based on magnetic resonance data is an important task in neuroscience. Existing brain network-based methods to classify subjects analyze data from a cross-sectional study and these methods cannot classify subjects based on longitudinal data. We propose a network-based predictive modeling method to classify subjects based on longitudinal magnetic resonance data. Our method generates a dynamic Bayesian network model for each group which represents complex spatiotemporal interactions among brain regions, and then calculates a score representing that subject's deviation from expected network patterns. This network-derived score, along with other candidate predictors, are used to construct predictive models. We validated the proposed method based on simulated data and the Alzheimer's Disease Neuroimaging Initiative study. For the Alzheimer's Disease Neuroimaging Initiative study, we built a predictive model based on the baseline biomarker characterizing the baseline state and the network-based score which was constructed based on the state transition probability matrix. We found that this combined model achieved 0.86 accuracy, 0.85 sensitivity, and 0.87 specificity. For the Alzheimer's Disease Neuroimaging Initiative study, the model based on the baseline biomarkers achieved 0.77 accuracy. The accuracy of our model is significantly better than the model based on the baseline biomarkers (p-value=0.002). We have presented a method to classify subjects based on structural dynamic network model based scores. This method is of great importance to distinguish subjects based on structural network dynamics and the understanding of the network architecture of brain processes and disorders. Copyright © 2015 Elsevier B.V. All rights reserved.
Social Network Analysis with sna
Directory of Open Access Journals (Sweden)
Carter T. Butts
2007-12-01
Full Text Available Modern social network analysis---the analysis of relational data arising from social systems---is a computationally intensive area of research. Here, we provide an overview of a software package which provides support for a range of network analytic functionality within the R statistical computing environment. General categories of currently supported functionality are described, and brief examples of package syntax and usage are shown.
Advantages of Social Network Analysis in Educational Research
Ushakov, K. M.; Kukso, K. N.
2015-01-01
Currently one of the main tools for the large scale studies of schools is statistical analysis. Although it is the most common method and it offers greatest opportunities for analysis, there are other quantitative methods for studying schools, such as network analysis. We discuss the potential advantages that network analysis has for educational…
Combining morphological analysis and Bayesian networks for ...
African Journals Online (AJOL)
Morphological analysis (MA) and Bayesian networks (BN) are two closely related modelling methods, each of which has its advantages and disadvantages for strategic decision support modelling. MA is a method for defining, linking and evaluating problem spaces. BNs are graphical models which consist of a qualitative ...
Computational Social Network Analysis
Hassanien, Aboul-Ella
2010-01-01
Presents insight into the social behaviour of animals (including the study of animal tracks and learning by members of the same species). This book provides web-based evidence of social interaction, perceptual learning, information granulation and the behaviour of humans and affinities between web-based social networks
Baker-Doyle, Kira J.
2015-01-01
Social network research on teachers and schools has risen exponentially in recent years as an innovative method to reveal the role of social networks in education. However, scholars are still exploring ways to incorporate traditional quantitative methods of Social Network Analysis (SNA) with qualitative approaches to social network research. This…
Social network analysis applied to team sports analysis
Clemente, Filipe Manuel; Mendes, Rui Sousa
2016-01-01
Explaining how graph theory and social network analysis can be applied to team sports analysis, This book presents useful approaches, models and methods that can be used to characterise the overall properties of team networks and identify the prominence of each team player. Exploring the different possible network metrics that can be utilised in sports analysis, their possible applications and variances from situation to situation, the respective chapters present an array of illustrative case studies. Identifying the general concepts of social network analysis and network centrality metrics, readers are shown how to generate a methodological protocol for data collection. As such, the book provides a valuable resource for students of the sport sciences, sports engineering, applied computation and the social sciences.
Liu, Gang; Neelamegham, Sriram
2008-04-15
We present In silico Biochemical Reaction Network Analysis (IBRENA), a software package which facilitates multiple functions including cellular reaction network simulation and sensitivity analysis (both forward and adjoint methods), coupled with principal component analysis, singular-value decomposition and model reduction. The software features a graphical user interface that aids simulation and plotting of in silico results. While the primary focus is to aid formulation, testing and reduction of theoretical biochemical reaction networks, the program can also be used for analysis of high-throughput genomic and proteomic data. The software package, manual and examples are available at http://www.eng.buffalo.edu/~neel/ibrena
van Leersum, B.J.A.M.; Timens, R.B.; Buesink, Frederik Johannes Karel; Leferink, Frank Bernardus Johannes
2014-01-01
Conducted spurious phenomena cause interference in the power supply network of complex installations. The time dependent behaviour of these phenomena calls for dedicated measurement techniques in time domain. Quantities to measure are defined for DM as well as CM. Various measurement sensors are
Sampling of temporal networks: Methods and biases
Rocha, Luis E. C.; Masuda, Naoki; Holme, Petter
2017-11-01
Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example, human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is that they are sampled within temporal and spatial frames. Furthermore, one might wish to subsample networks to reduce their size for better visualization or to perform computationally intensive simulations. The sampling method may affect the network structure and thus caution is necessary to generalize results based on samples. In this paper, we study four sampling strategies applied to a variety of real-life temporal networks. We quantify the biases generated by each sampling strategy on a number of relevant statistics such as link activity, temporal paths and epidemic spread. We find that some biases are common in a variety of networks and statistics, but one strategy, uniform sampling of nodes, shows improved performance in most scenarios. Given the particularities of temporal network data and the variety of network structures, we recommend that the choice of sampling methods be problem oriented to minimize the potential biases for the specific research questions on hand. Our results help researchers to better design network data collection protocols and to understand the limitations of sampled temporal network data.
Improved security monitoring method for network bordary
Gao, Liting; Wang, Lixia; Wang, Zhenyan; Qi, Aihua
2013-03-01
This paper proposes a network bordary security monitoring system based on PKI. The design uses multiple safe technologies, analysis deeply the association between network data flow and system log, it can detect the intrusion activities and position invasion source accurately in time. The experiment result shows that it can reduce the rate of false alarm or missing alarm of the security incident effectively.
Heiden, Uwe
1980-01-01
The purpose of this work is a unified and general treatment of activity in neural networks from a mathematical pOint of view. Possible applications of the theory presented are indica ted throughout the text. However, they are not explored in de tail for two reasons : first, the universal character of n- ral activity in nearly all animals requires some type of a general approach~ secondly, the mathematical perspicuity would suffer if too many experimental details and empirical peculiarities were interspersed among the mathematical investigation. A guide to many applications is supplied by the references concerning a variety of specific issues. Of course the theory does not aim at covering all individual problems. Moreover there are other approaches to neural network theory (see e.g. Poggio-Torre, 1978) based on the different lev els at which the nervous system may be viewed. The theory is a deterministic one reflecting the average be havior of neurons or neuron pools. In this respect the essay is writt...
Multifractal analysis of mobile social networks
Zheng, Wei; Zhang, Zifeng; Deng, Yufan
2017-09-01
As Wireless Fidelity (Wi-Fi)-enabled handheld devices have been widely used, the mobile social networks (MSNs) has been attracting extensive attention. Fractal approaches have also been widely applied to characterierize natural networks as useful tools to depict their spatial distribution and scaling properties. Moreover, when the complexity of the spatial distribution of MSNs cannot be properly charaterized by single fractal dimension, multifractal analysis is required. For further research, we introduced a multifractal analysis method based on box-covering algorithm to describe the structure of MSNs. Using this method, we find that the networks are multifractal at different time interval. The simulation results demonstrate that the proposed method is efficient for analyzing the multifractal characteristic of MSNs, which provides a distribution of singularities adequately describing both the heterogeneity of fractal patterns and the statistics of measurements across spatial scales in MSNs.
Classification and Analysis of Computer Network Traffic
DEFF Research Database (Denmark)
Bujlow, Tomasz
2014-01-01
for traffic classification, which can be used for nearly real-time processing of big amounts of data using affordable CPU and memory resources. Other questions are related to methods for real-time estimation of the application Quality of Service (QoS) level based on the results obtained by the traffic......Traffic monitoring and analysis can be done for multiple different reasons: to investigate the usage of network resources, assess the performance of network applications, adjust Quality of Service (QoS) policies in the network, log the traffic to comply with the law, or create realistic models...... classifier. This thesis is focused on topics connected with traffic classification and analysis, while the work on methods for QoS assessment is limited to defining the connections with the traffic classification and proposing a general algorithm. We introduced the already known methods for traffic...
The research on user behavior evaluation method for network state
Zhang, Chengyuan; Xu, Haishui
2017-08-01
Based on the correlation between user behavior and network running state, this paper proposes a method of user behavior evaluation based on network state. Based on the analysis and evaluation methods in other fields of study, we introduce the theory and tools of data mining. Based on the network status information provided by the trusted network view, the user behavior data and the network state data are analysed. Finally, we construct the user behavior evaluation index and weight, and on this basis, we can accurately quantify the influence degree of the specific behavior of different users on the change of network running state, so as to provide the basis for user behavior control decision.
Complex networks principles, methods and applications
Latora, Vito; Russo, Giovanni
2017-01-01
Networks constitute the backbone of complex systems, from the human brain to computer communications, transport infrastructures to online social systems and metabolic reactions to financial markets. Characterising their structure improves our understanding of the physical, biological, economic and social phenomena that shape our world. Rigorous and thorough, this textbook presents a detailed overview of the new theory and methods of network science. Covering algorithms for graph exploration, node ranking and network generation, among the others, the book allows students to experiment with network models and real-world data sets, providing them with a deep understanding of the basics of network theory and its practical applications. Systems of growing complexity are examined in detail, challenging students to increase their level of skill. An engaging presentation of the important principles of network science makes this the perfect reference for researchers and undergraduate and graduate students in physics, ...
Phylodynamic analysis of a viral infection network
Directory of Open Access Journals (Sweden)
Teiichiro eShiino
2012-07-01
Full Text Available Viral infections by sexual and droplet transmission routes typically spread through a complex host-to-host contact network. Clarifying the transmission network and epidemiological parameters affecting the variations and dynamics of a specific pathogen is a major issue in the control of infectious diseases. However, conventional methods such as interview and/or classical phylogenetic analysis of viral gene sequences have inherent limitations and often fail to detect infectious clusters and transmission connections. Recent improvements in computational environments now permit the analysis of large datasets. In addition, novel analytical methods have been developed that serve to infer the evolutionary dynamics of virus genetic diversity using sample date information and sequence data. This type of framework, termed phylodynamics, helps connect some of the missing links on viral transmission networks, which are often hard to detect by conventional methods of epidemiology. With sufficient number of sequences available, one can use this new inference method to estimate theoretical epidemiological parameters such as temporal distributions of the primary infection, fluctuation of the pathogen population size, basic reproductive number, and the mean time span of disease infectiousness. Transmission networks estimated by this framework often have the properties of a scale-free network, which are characteristic of infectious and social communication processes. Network analysis based on phylodynamics has alluded to various suggestions concerning the infection dynamics associated with a given community and/or risk behavior. In this review, I will summarize the current methods available for identifying the transmission network using phylogeny, and present an argument on the possibilities of applying the scale-free properties to these existing frameworks.
A new method for constructing networks from binary data
van Borkulo, Claudia D.; Borsboom, Denny; Epskamp, Sacha; Blanken, Tessa F.; Boschloo, Lynn; Schoevers, Robert A.; Waldorp, Lourens J.
2014-08-01
Network analysis is entering fields where network structures are unknown, such as psychology and the educational sciences. A crucial step in the application of network models lies in the assessment of network structure. Current methods either have serious drawbacks or are only suitable for Gaussian data. In the present paper, we present a method for assessing network structures from binary data. Although models for binary data are infamous for their computational intractability, we present a computationally efficient model for estimating network structures. The approach, which is based on Ising models as used in physics, combines logistic regression with model selection based on a Goodness-of-Fit measure to identify relevant relationships between variables that define connections in a network. A validation study shows that this method succeeds in revealing the most relevant features of a network for realistic sample sizes. We apply our proposed method to estimate the network of depression and anxiety symptoms from symptom scores of 1108 subjects. Possible extensions of the model are discussed.
Kinetic analysis of complex metabolic networks
Energy Technology Data Exchange (ETDEWEB)
Stephanopoulos, G. [MIT, Cambridge, MA (United States)
1996-12-31
A new methodology is presented for the analysis of complex metabolic networks with the goal of metabolite overproduction. The objective is to locate a small number of reaction steps in a network that have maximum impact on network flux amplification and whose rate can also be increased without functional network derangement. This method extends the concepts of Metabolic Control Analysis to groups of reactions and offers the means for calculating group control coefficients as measures of the control exercised by groups of reactions on the overall network fluxes and intracellular metabolite pools. It is further demonstrated that the optimal strategy for the effective increase of network fluxes, while maintaining an uninterrupted supply of intermediate metabolites, is through the coordinated amplification of multiple (as opposed to a single) reaction steps. Satisfying this requirement invokes the concept of the concentration control to coefficient, which emerges as a critical parameter in the identification of feasible enzymatic modifications with maximal impact on the network flux. A case study of aromatic aminoacid production is provided to illustrate these concepts.
Visualization and Analysis of Complex Covert Networks
DEFF Research Database (Denmark)
Memon, Bisharat
This report discusses and summarize the results of my work so far in relation to my Ph.D. project entitled "Visualization and Analysis of Complex Covert Networks". The focus of my research is primarily on development of methods and supporting tools for visualization and analysis of networked...... systems that are covert and hence inherently complex. My Ph.D. is positioned within the wider framework of CrimeFighter project. The framework envisions a number of key knowledge management processes that are involved in the workflow, and the toolbox provides supporting tools to assist human end...
Mathematical Analysis of Urban Spatial Networks
Blanchard, Philippe
2009-01-01
Cities can be considered to be among the largest and most complex artificial networks created by human beings. Due to the numerous and diverse human-driven activities, urban network topology and dynamics can differ quite substantially from that of natural networks and so call for an alternative method of analysis. The intent of the present monograph is to lay down the theoretical foundations for studying the topology of compact urban patterns, using methods from spectral graph theory and statistical physics. These methods are demonstrated as tools to investigate the structure of a number of real cities with widely differing properties: medieval German cities, the webs of city canals in Amsterdam and Venice, and a modern urban structure such as found in Manhattan. Last but not least, the book concludes by providing a brief overview of possible applications that will eventually lead to a useful body of knowledge for architects, urban planners and civil engineers.
Decision support systems and methods for complex networks
Huang, Zhenyu [Richland, WA; Wong, Pak Chung [Richland, WA; Ma, Jian [Richland, WA; Mackey, Patrick S [Richland, WA; Chen, Yousu [Richland, WA; Schneider, Kevin P [Seattle, WA
2012-02-28
Methods and systems for automated decision support in analyzing operation data from a complex network. Embodiments of the present invention utilize these algorithms and techniques not only to characterize the past and present condition of a complex network, but also to predict future conditions to help operators anticipate deteriorating and/or problem situations. In particular, embodiments of the present invention characterize network conditions from operation data using a state estimator. Contingency scenarios can then be generated based on those network conditions. For at least a portion of all of the contingency scenarios, risk indices are determined that describe the potential impact of each of those scenarios. Contingency scenarios with risk indices are presented visually as graphical representations in the context of a visual representation of the complex network. Analysis of the historical risk indices based on the graphical representations can then provide trends that allow for prediction of future network conditions.
Analysis of Layered Social Networks
2006-09-01
xiii List of Abbreviations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xv I. Introduction ...Islamiya JP Joint Publication JTC Joint Targeting Cycle KPP Key Player Problem MCDM Multi-Criteria Decision Making MP Mathematical Programming MST...ANALYSIS OF LAYERED SOCIAL NETWORKS I. Introduction “To know them means to eliminate them” - Colonel Mathieu in the movie, Battle of Algiers
Yousefi Nooraie, Reza; Lohfeld, Lynne; Marin, Alexandra; Hanneman, Robert; Dobbins, Maureen
2017-02-08
Workforce development is an important aspect of evidence-informed decision making (EIDM) interventions. The structure of formal and informal social networks can influence, and be influenced, by the implementation of EIDM interventions. In a mixed methods study we assessed the outcomes of a targeted training intervention to promote EIDM among the staff in three public health units in Ontario, Canada. This report focuses on the qualitative phase of the study in which key staff were interviewed about the process of engagement in the intervention, communications during the intervention, and social consequences. Senior managers identified staff to take part in the intervention. Engagement was a top-down process determined by the way organizational leaders promoted EIDM and the relevance of staff's jobs to EIDM. Communication among staff participating in the workshops and ongoing progress meetings was influential in overcoming personal and normative barriers to implementing EIDM, and promoted the formation of long-lasting social connections among staff. Organization-wide presentations and meetings facilitated the recognition of expertise that the trained staff gained, including their reputation as experts according to their peers in different divisions. Selective training and capacity development interventions can result in forming an elite versus ordinary pattern that facilitates the recognition of in-house qualified experts while also strengthening social status inequality. The role of leadership in public health units is pivotal in championing and overseeing the implementation process. Network analysis can guide and inform the design, process, and evaluation of the EIDM training interventions.
Artificial neural network intelligent method for prediction
Trifonov, Roumen; Yoshinov, Radoslav; Pavlova, Galya; Tsochev, Georgi
2017-09-01
Accounting and financial classification and prediction problems are high challenge and researchers use different methods to solve them. Methods and instruments for short time prediction of financial operations using artificial neural network are considered. The methods, used for prediction of financial data as well as the developed forecasting system with neural network are described in the paper. The architecture of a neural network used four different technical indicators, which are based on the raw data and the current day of the week is presented. The network developed is used for forecasting movement of stock prices one day ahead and consists of an input layer, one hidden layer and an output layer. The training method is algorithm with back propagation of the error. The main advantage of the developed system is self-determination of the optimal topology of neural network, due to which it becomes flexible and more precise The proposed system with neural network is universal and can be applied to various financial instruments using only basic technical indicators as input data.
Functional stoichiometric analysis of metabolic networks.
Urbanczik, R; Wagner, C
2005-11-15
An important tool in Systems Biology is the stoichiometric modeling of metabolic networks, where the stationary states of the network are described by a high-dimensional polyhedral cone, the so-called flux cone. Exhaustive descriptions of the metabolism can be obtained by computing the elementary vectors of this cone but, owing to a combinatorial explosion of the number of elementary vectors, this approach becomes computationally intractable for genome scale networks. Hence, we propose to instead focus on the conversion cone, a projection of the flux cone, which describes the interaction of the metabolism with its external chemical environment. We present a direct method for calculating the elementary vectors of this cone and, by studying the metabolism of Saccharomyces cerevisiae, we demonstrate that such an analysis is computationally feasible even for genome scale networks.
A statistical analysis of UK financial networks
Chu, J.; Nadarajah, S.
2017-04-01
In recent years, with a growing interest in big or large datasets, there has been a rise in the application of large graphs and networks to financial big data. Much of this research has focused on the construction and analysis of the network structure of stock markets, based on the relationships between stock prices. Motivated by Boginski et al. (2005), who studied the characteristics of a network structure of the US stock market, we construct network graphs of the UK stock market using same method. We fit four distributions to the degree density of the vertices from these graphs, the Pareto I, Fréchet, lognormal, and generalised Pareto distributions, and assess the goodness of fit. Our results show that the degree density of the complements of the market graphs, constructed using a negative threshold value close to zero, can be fitted well with the Fréchet and lognormal distributions.
Control and estimation methods over communication networks
Mahmoud, Magdi S
2014-01-01
This book provides a rigorous framework in which to study problems in the analysis, stability and design of networked control systems. Four dominant sources of difficulty are considered: packet dropouts, communication bandwidth constraints, parametric uncertainty, and time delays. Past methods and results are reviewed from a contemporary perspective, present trends are examined, and future possibilities proposed. Emphasis is placed on robust and reliable design methods. New control strategies for improving the efficiency of sensor data processing and reducing associated time delay are presented. The coverage provided features: · an overall assessment of recent and current fault-tolerant control algorithms; · treatment of several issues arising at the junction of control and communications; · key concepts followed by their proofs and efficient computational methods for their implementation; and · simulation examples (including TrueTime simulations) to...
NETWORK ECONOMY INNOVATIVE POTENTIAL EVALUATION METHOD
Directory of Open Access Journals (Sweden)
E. V. Loguinova
2011-01-01
Full Text Available Existing methodological approaches to assessment of the innovation potential having been analyzed, a network system innovative potential identification and characterization method is proposed that makes it possible to assess the potential’s qualitative and quantitative components and to determine their consistency with national innovative system formation and development objectives. Four stages are recommended and determined to assess the network economy innovative potential. Main structural elements of the network economy innovative potential are the resource, institutional, infrastructural and resulting factor totalities.
Homotopy methods for counting reaction network equilibria
Craciun, Gheorghe; Helton, J. William; Williams, Ruth J
2007-01-01
Dynamical system models of complex biochemical reaction networks are usually high-dimensional, nonlinear, and contain many unknown parameters. In some cases the reaction network structure dictates that positive equilibria must be unique for all values of the parameters in the model. In other cases multiple equilibria exist if and only if special relationships between these parameters are satisfied. We describe methods based on homotopy invariance of degree which allow us to determine the numb...
2012-07-01
counted. Next, a predictor was built using REPTree as implemented in the WEKA (28) data-mining toolset. The test method used was 10 fold cross...Reutemann, Peter; Witten, Ian H. The WEKA Data Mining Software: An Update. SIGKDD Explorations 2009, 11 (1), 11. 26 List of Symbols
Criado, Regino; García, Esther; Pedroche, Francisco; Romance, Miguel
2013-12-01
In this paper, we show a new technique to analyze families of rankings. In particular, we focus on sports rankings and, more precisely, on soccer leagues. We consider that two teams compete when they change their relative positions in consecutive rankings. This allows to define a graph by linking teams that compete. We show how to use some structural properties of this competitivity graph to measure to what extend the teams in a league compete. These structural properties are the mean degree, the mean strength, and the clustering coefficient. We give a generalization of the Kendall's correlation coefficient to more than two rankings. We also show how to make a dynamic analysis of a league and how to compare different leagues. We apply this technique to analyze the four major European soccer leagues: Bundesliga, Italian Lega, Spanish Liga, and Premier League. We compare our results with the classical analysis of sport ranking based on measures of competitive balance.
Transmission analysis in WDM networks
DEFF Research Database (Denmark)
Rasmussen, Christian Jørgen
1999-01-01
This thesis describes the development of a computer-based simulator for transmission analysis in optical wavelength division multiplexing networks. A great part of the work concerns fundamental optical network simulator issues. Among these issues are identification of the versatility and user......-friendliness demands which such a simulator must meet, development of the "spectral window representation" for representation of the optical signals and finding an effective way of handling the optical signals in the computer memory. One important issue more is the rules for the determination of the order in which...... the different component models are invoked during the simulation of a system. A simple set of rules which makes it possible to simulate any network architectures is laid down. The modelling of the nonlinear fibre and the optical receiver is also treated. The work on the fibre concerns the numerical solution...
DEFF Research Database (Denmark)
Baker, J J; Öberg, S; Andresen, K
2018-01-01
review included studies with human adults with a ventral hernia repaired with an intraperitoneal onlay mesh. The outcome was recurrence at least 6 months after operation. Cohort studies with 50 or more participants and all RCTs were included. PubMed, Embase and the Cochrane Library were searched on 22......BACKGROUND: Ventral hernia repairs are common and have high recurrence rates. They are usually repaired laparoscopically with an intraperitoneal mesh, which can be fixed in various ways. The aim was to evaluate the recurrence rates for the different fixation techniques. METHODS: This systematic...
Principal component analysis networks and algorithms
Kong, Xiangyu; Duan, Zhansheng
2017-01-01
This book not only provides a comprehensive introduction to neural-based PCA methods in control science, but also presents many novel PCA algorithms and their extensions and generalizations, e.g., dual purpose, coupled PCA, GED, neural based SVD algorithms, etc. It also discusses in detail various analysis methods for the convergence, stabilizing, self-stabilizing property of algorithms, and introduces the deterministic discrete-time systems method to analyze the convergence of PCA/MCA algorithms. Readers should be familiar with numerical analysis and the fundamentals of statistics, such as the basics of least squares and stochastic algorithms. Although it focuses on neural networks, the book only presents their learning law, which is simply an iterative algorithm. Therefore, no a priori knowledge of neural networks is required. This book will be of interest and serve as a reference source to researchers and students in applied mathematics, statistics, engineering, and other related fields.
Social network analysis to cluster sociobibliometric information
Directory of Open Access Journals (Sweden)
Jorge Ricardo Vivas
Full Text Available This paper examines the benefits of using Social Network Analysis in the field of sociobibliometric exploration. There are considered practical and conceptual limits and reaches. The proposal is illustrated through a study about a journals network of behavior modification by Peiró and Carpintero (1981. In this context it is shown the utility of using reticular properties of Density, Centrality, Betweenness, Power and Clusterig as indicators that allow obtaining novel and complementary information to the one extracted by the classic methods of bibliometric exploration.
Trimming of mammalian transcriptional networks using network component analysis
Directory of Open Access Journals (Sweden)
Liao James C
2010-10-01
Full Text Available Abstract Background Network Component Analysis (NCA has been used to deduce the activities of transcription factors (TFs from gene expression data and the TF-gene binding relationship. However, the TF-gene interaction varies in different environmental conditions and tissues, but such information is rarely available and cannot be predicted simply by motif analysis. Thus, it is beneficial to identify key TF-gene interactions under the experimental condition based on transcriptome data. Such information would be useful in identifying key regulatory pathways and gene markers of TFs in further studies. Results We developed an algorithm to trim network connectivity such that the important regulatory interactions between the TFs and the genes were retained and the regulatory signals were deduced. Theoretical studies demonstrated that the regulatory signals were accurately reconstructed even in the case where only three independent transcriptome datasets were available. At least 80% of the main target genes were correctly predicted in the extreme condition of high noise level and small number of datasets. Our algorithm was tested with transcriptome data taken from mice under rapamycin treatment. The initial network topology from the literature contains 70 TFs, 778 genes, and 1423 edges between the TFs and genes. Our method retained 1074 edges (i.e. 75% of the original edge number and identified 17 TFs as being significantly perturbed under the experimental condition. Twelve of these TFs are involved in MAPK signaling or myeloid leukemia pathways defined in the KEGG database, or are known to physically interact with each other. Additionally, four of these TFs, which are Hif1a, Cebpb, Nfkb1, and Atf1, are known targets of rapamycin. Furthermore, the trimmed network was able to predict Eno1 as an important target of Hif1a; this key interaction could not be detected without trimming the regulatory network. Conclusions The advantage of our new algorithm
Analysis of Semantic Networks using Complex Networks Concepts
DEFF Research Database (Denmark)
Ortiz-Arroyo, Daniel
2013-01-01
In this paper we perform a preliminary analysis of semantic networks to determine the most important terms that could be used to optimize a summarization task. In our experiments, we measure how the properties of a semantic network change, when the terms in the network are removed. Our preliminar...... results indicate that this approach provides good results on the semantic network analyzed in this paper....
Sie, Rory
2012-01-01
Sie, R. L. L. (2012). COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks (Unpublished doctoral dissertation). September, 28, 2012, Open Universiteit in the Netherlands (CELSTEC), Heerlen, The Netherlands.
Zhang, Yan; Zheng, Hongmei; Chen, Bin; Yang, Naijin
2013-06-01
An important and practical pattern of industrial symbiosis is rapidly developing: eco-industrial parks. In this study, we used social network analysis to study the network connectedness (i.e., the proportion of the theoretical number of connections that had been achieved) and related attributes of these hybrid ecological and industrial symbiotic systems. This approach provided insights into details of the network's interior and analyzed the overall degree of connectedness and the relationships among the nodes within the network. We then characterized the structural attributes of the network and subnetwork nodes at two levels (core and periphery), thereby providing insights into the operational problems within each eco-industrial park. We chose ten typical ecoindustrial parks in China and around the world and compared the degree of network connectedness of these systems that resulted from exchanges of products, byproducts, and wastes. By analyzing the density and nodal degree, we determined the relative power and status of the nodes in these networks, as well as other structural attributes such as the core-periphery structure and the degree of sub-network connectedness. The results reveal the operational problems created by the structure of the industrial networks and provide a basis for improving the degree of completeness, thereby increasing their potential for sustainable development and enriching the methods available for the study of industrial symbiosis.
Networks and network analysis for defence and security
Masys, Anthony J
2014-01-01
Networks and Network Analysis for Defence and Security discusses relevant theoretical frameworks and applications of network analysis in support of the defence and security domains. This book details real world applications of network analysis to support defence and security. Shocks to regional, national and global systems stemming from natural hazards, acts of armed violence, terrorism and serious and organized crime have significant defence and security implications. Today, nations face an uncertain and complex security landscape in which threats impact/target the physical, social, economic
An Entropy-Based Network Anomaly Detection Method
Directory of Open Access Journals (Sweden)
Przemysław Bereziński
2015-04-01
Full Text Available Data mining is an interdisciplinary subfield of computer science involving methods at the intersection of artificial intelligence, machine learning and statistics. One of the data mining tasks is anomaly detection which is the analysis of large quantities of data to identify items, events or observations which do not conform to an expected pattern. Anomaly detection is applicable in a variety of domains, e.g., fraud detection, fault detection, system health monitoring but this article focuses on application of anomaly detection in the field of network intrusion detection.The main goal of the article is to prove that an entropy-based approach is suitable to detect modern botnet-like malware based on anomalous patterns in network. This aim is achieved by realization of the following points: (i preparation of a concept of original entropy-based network anomaly detection method, (ii implementation of the method, (iii preparation of original dataset, (iv evaluation of the method.
A network analysis of Sibiu County, Romania
Grama, Cristina-Nicol
2013-01-01
Network science methods have proved to be able to provide useful insights from both a theoretical and a practical point of view in that they can better inform governance policies in complex dynamic environments. The tourism research community has provided an increasing number of works that analyse destinations from a network science perspective. However, most of the studies refer to relatively small samples of actors and linkages. With this note we provide a full network study, although at a preliminary stage, that reports a complete analysis of a Romanian destination (Sibiu). Our intention is to increase the set of similar studies with the aim of supporting the investigations in structural and dynamical characteristics of tourism destinations.
Unraveling protein networks with power graph analysis.
Royer, Loïc; Reimann, Matthias; Andreopoulos, Bill; Schroeder, Michael
2008-07-11
Networks play a crucial role in computational biology, yet their analysis and representation is still an open problem. Power Graph Analysis is a lossless transformation of biological networks into a compact, less redundant representation, exploiting the abundance of cliques and bicliques as elementary topological motifs. We demonstrate with five examples the advantages of Power Graph Analysis. Investigating protein-protein interaction networks, we show how the catalytic subunits of the casein kinase II complex are distinguishable from the regulatory subunits, how interaction profiles and sequence phylogeny of SH3 domains correlate, and how false positive interactions among high-throughput interactions are spotted. Additionally, we demonstrate the generality of Power Graph Analysis by applying it to two other types of networks. We show how power graphs induce a clustering of both transcription factors and target genes in bipartite transcription networks, and how the erosion of a phosphatase domain in type 22 non-receptor tyrosine phosphatases is detected. We apply Power Graph Analysis to high-throughput protein interaction networks and show that up to 85% (56% on average) of the information is redundant. Experimental networks are more compressible than rewired ones of same degree distribution, indicating that experimental networks are rich in cliques and bicliques. Power Graphs are a novel representation of networks, which reduces network complexity by explicitly representing re-occurring network motifs. Power Graphs compress up to 85% of the edges in protein interaction networks and are applicable to all types of networks such as protein interactions, regulatory networks, or homology networks.
Deep Learning Neural Networks and Bayesian Neural Networks in Data Analysis
Chernoded, Andrey; Dudko, Lev; Myagkov, Igor; Volkov, Petr
2017-10-01
Most of the modern analyses in high energy physics use signal-versus-background classification techniques of machine learning methods and neural networks in particular. Deep learning neural network is the most promising modern technique to separate signal and background and now days can be widely and successfully implemented as a part of physical analysis. In this article we compare Deep learning and Bayesian neural networks application as a classifiers in an instance of top quark analysis.
Deep Learning Neural Networks and Bayesian Neural Networks in Data Analysis
Directory of Open Access Journals (Sweden)
Chernoded Andrey
2017-01-01
Full Text Available Most of the modern analyses in high energy physics use signal-versus-background classification techniques of machine learning methods and neural networks in particular. Deep learning neural network is the most promising modern technique to separate signal and background and now days can be widely and successfully implemented as a part of physical analysis. In this article we compare Deep learning and Bayesian neural networks application as a classifiers in an instance of top quark analysis.
Signed Link Analysis in Social Media Networks
Beigi, Ghazaleh; Tang, Jiliang; Liu, Huan
2016-01-01
Numerous real-world relations can be represented by signed networks with positive links (e.g., trust) and negative links (e.g., distrust). Link analysis plays a crucial role in understanding the link formation and can advance various tasks in social network analysis such as link prediction. The majority of existing works on link analysis have focused on unsigned social networks. The existence of negative links determines that properties and principles of signed networks are substantially dist...
Water Pipeline Network Analysis Using Simultaneous Loop Flow ...
African Journals Online (AJOL)
2013-03-01
Mar 1, 2013 ... solving for the unknown in water network analysis. It is based on a loop iterative computation. Newton-Raphson method is a better technique for solving the network problems; however, the method adopted here computes simultaneous flow corrections for all loops, hence, the best since the computational.
A Network Reconfiguration Method Considering Data Uncertainties in Smart Distribution Networks
Directory of Open Access Journals (Sweden)
Ke-yan Liu
2017-05-01
Full Text Available This work presents a method for distribution network reconfiguration with the simultaneous consideration of distributed generation (DG allocation. The uncertainties of load fluctuation before the network reconfiguration are also considered. Three optimal objectives, including minimal line loss cost, minimum Expected Energy Not Supplied, and minimum switch operation cost, are investigated. The multi-objective optimization problem is further transformed into a single-objective optimization problem by utilizing weighting factors. The proposed network reconfiguration method includes two periods. The first period is to create a feasible topology network by using binary particle swarm optimization (BPSO. Then the DG allocation problem is solved by utilizing sensitivity analysis and a Harmony Search algorithm (HSA. In the meanwhile, interval analysis is applied to deal with the uncertainties of load and devices parameters. Test cases are studied using the standard IEEE 33-bus and PG&E 69-bus systems. Different scenarios and comparisons are analyzed in the experiments. The results show the applicability of the proposed method. The performance analysis of the proposed method is also investigated. The computational results indicate that the proposed network reconfiguration algorithm is feasible.
Neural networks analysis on SSME vibration simulation data
Lo, Ching F.; Wu, Kewei
1993-01-01
The neural networks method is applied to investigate the feasibility in detecting anomalies in turbopump vibration of SSME to supplement the statistical method utilized in the prototype system. The investigation of neural networks analysis is conducted using SSME vibration data from a NASA developed numerical simulator. The limited application of neural networks to the HPFTP has also shown the effectiveness in diagnosing the anomalies of turbopump vibrations.
Centrality measures in temporal networks with time series analysis
Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Wang, Xiaojie; Yi, Dongyun
2017-05-01
The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.
Time series analysis of temporal networks
Sikdar, Sandipan; Ganguly, Niloy; Mukherjee, Animesh
2016-01-01
A common but an important feature of all real-world networks is that they are temporal in nature, i.e., the network structure changes over time. Due to this dynamic nature, it becomes difficult to propose suitable growth models that can explain the various important characteristic properties of these networks. In fact, in many application oriented studies only knowing these properties is sufficient. For instance, if one wishes to launch a targeted attack on a network, this can be done even without the knowledge of the full network structure; rather an estimate of some of the properties is sufficient enough to launch the attack. We, in this paper show that even if the network structure at a future time point is not available one can still manage to estimate its properties. We propose a novel method to map a temporal network to a set of time series instances, analyze them and using a standard forecast model of time series, try to predict the properties of a temporal network at a later time instance. To our aim, we consider eight properties such as number of active nodes, average degree, clustering coefficient etc. and apply our prediction framework on them. We mainly focus on the temporal network of human face-to-face contacts and observe that it represents a stochastic process with memory that can be modeled as Auto-Regressive-Integrated-Moving-Average (ARIMA). We use cross validation techniques to find the percentage accuracy of our predictions. An important observation is that the frequency domain properties of the time series obtained from spectrogram analysis could be used to refine the prediction framework by identifying beforehand the cases where the error in prediction is likely to be high. This leads to an improvement of 7.96% (for error level ≤20%) in prediction accuracy on an average across all datasets. As an application we show how such prediction scheme can be used to launch targeted attacks on temporal networks. Contribution to the Topical Issue
Advanced functional network analysis in the geosciences: The pyunicorn package
Donges, Jonathan F.; Heitzig, Jobst; Runge, Jakob; Schultz, Hanna C. H.; Wiedermann, Marc; Zech, Alraune; Feldhoff, Jan; Rheinwalt, Aljoscha; Kutza, Hannes; Radebach, Alexander; Marwan, Norbert; Kurths, Jürgen
2013-04-01
Functional networks are a powerful tool for analyzing large geoscientific datasets such as global fields of climate time series originating from observations or model simulations. pyunicorn (pythonic unified complex network and recurrence analysis toolbox) is an open-source, fully object-oriented and easily parallelizable package written in the language Python. It allows for constructing functional networks (aka climate networks) representing the structure of statistical interrelationships in large datasets and, subsequently, investigating this structure using advanced methods of complex network theory such as measures for networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn allows to study the complex dynamics of geoscientific systems as recorded by time series by means of recurrence networks and visibility graphs. The range of possible applications of the package is outlined drawing on several examples from climatology.
Methods of Multivariate Analysis
Rencher, Alvin C
2012-01-01
Praise for the Second Edition "This book is a systematic, well-written, well-organized text on multivariate analysis packed with intuition and insight . . . There is much practical wisdom in this book that is hard to find elsewhere."-IIE Transactions Filled with new and timely content, Methods of Multivariate Analysis, Third Edition provides examples and exercises based on more than sixty real data sets from a wide variety of scientific fields. It takes a "methods" approach to the subject, placing an emphasis on how students and practitioners can employ multivariate analysis in real-life sit
Activity Recognition Using Complex Network Analysis.
Jalloul, Nahed; Poree, Fabienne; Viardot, Geoffrey; L'Hostis, Phillipe; Carrault, Guy
2017-10-12
In this paper, we perform complex network analysis on a connectivity dataset retrieved from a monitoring system in order to classify simple daily activities. The monitoring system is composed of a set of wearable sensing modules positioned on the subject's body and the connectivity data consists of the correlation between each pair of modules. A number of network measures are then computed followed by the application of statistical significance and feature selection methods. These methods were implemented for the purpose of reducing the total number of modules in the monitoring system required to provide accurate activity classification. The obtained results show that an overall accuracy of 84.6% for activity classification is achieved, using a Random Forest (RF) classifier, and when considering a monitoring system composed of only two modules positioned at the Neck and Thigh of the subject's body.
Topological Analysis of Wireless Networks (TAWN)
2016-05-31
19b. TELEPHONE NUMBER (Include area code) 31-05-2016 FINAL REPORT 12-02-2015 -- 31-05-2016 Topological Analysis of Wireless Networks (TAWN) Robinson...mathematical literature on sheaves that describes how to draw global ( network -wide) inferences from them. Wireless network , local homology, sheaf...topology U U U UU 32 Michael Robinson 202-885-3681 Final Report: May 2016 Topological Analysis of Wireless Networks Principal Investigator: Prof. Michael
Modular analysis of gene networks by linear temporal logic.
Ito, Sohei; Ichinose, Takuma; Shimakawa, Masaya; Izumi, Naoko; Hagihara, Shigeki; Yonezaki, Naoki
2013-03-25
Despite a lot of advances in biology and genomics, it is still difficult to utilise such valuable knowledge and information to understand and analyse large biological systems due to high computational complexity. In this paper we propose a modular method with which from several small network analyses we analyse a large network by integrating them. This method is based on the qualitative framework proposed by authors in which an analysis of gene networks is reduced to checking satisfiability of linear temporal logic formulae. The problem of linear temporal logic satisfiability checking needs exponential time in the size of a formula. Thus it is difficult to analyse large networks directly in this method since the size of a formula grows linearly to the size of a network. The modular method alleviates this computational difficulty. We show some experimental results and see how we benefit from the modular analysis method.
Social network analysis community detection and evolution
Missaoui, Rokia
2015-01-01
This book is devoted to recent progress in social network analysis with a high focus on community detection and evolution. The eleven chapters cover the identification of cohesive groups, core components and key players either in static or dynamic networks of different kinds and levels of heterogeneity. Other important topics in social network analysis such as influential detection and maximization, information propagation, user behavior analysis, as well as network modeling and visualization are also presented. Many studies are validated through real social networks such as Twitter. This edit
Applications of Social Network Analysis
Thilagam, P. Santhi
A social network [2] is a description of the social structure between actors, mostly persons, groups or organizations. It indicates the ways in which they are connected with each other by some relationship such as friendship, kinship, finance exchange etc. In a nutshell, when the person uses already known/unknown people to create new contacts, it forms social networking. The social network is not a new concept rather it can be formed when similar people interact with each other directly or indirectly to perform particular task. Examples of social networks include a friendship networks, collaboration networks, co-authorship networks, and co-employees networks which depict the direct interaction among the people. There are also other forms of social networks, such as entertainment networks, business Networks, citation networks, and hyperlink networks, in which interaction among the people is indirect. Generally, social networks operate on many levels, from families up to the level of nations and assists in improving interactive knowledge sharing, interoperability and collaboration.
Reliability Analysis of Wireless Sensor Networks Using Markovian Model
Directory of Open Access Journals (Sweden)
Jin Zhu
2012-01-01
Full Text Available This paper investigates reliability analysis of wireless sensor networks whose topology is switching among possible connections which are governed by a Markovian chain. We give the quantized relations between network topology, data acquisition rate, nodes' calculation ability, and network reliability. By applying Lyapunov method, sufficient conditions of network reliability are proposed for such topology switching networks with constant or varying data acquisition rate. With the conditions satisfied, the quantity of data transported over wireless network node will not exceed node capacity such that reliability is ensured. Our theoretical work helps to provide a deeper understanding of real-world wireless sensor networks, which may find its application in the fields of network design and topology control.
Directory of Open Access Journals (Sweden)
Andreas Hepp
2016-06-01
Full Text Available This article introduces the approach of contextualised communication network analysis as a qualitative procedure for researching communicative relationships realised through the media. It combines qualitative interviews on media appropriation, egocentric network maps, and media diaries. Through the triangulation of these methods of data collection, it is possible to gain a differentiated insight into the specific meanings, structures and processes of communication networks across a variety of media. The approach is illustrated using a recent study dealing with the mediatisation of community building among young people. In this context, the qualitative communication network analysis has been applied to distinguish “localists” from “centrists”, “multilocalists”, and “pluralists”. These different “horizons of mediatised communitisation” are connected to distinct communication networks. Since this involves today a variety of different media, the contextual analysis of communication networks necessarily has to imply a cross-media perspective.
DEFF Research Database (Denmark)
Olivarius, Signe
of the transcriptome, 5’ end capture of RNA is combined with next-generation sequencing for high-throughput quantitative assessment of transcription start sites by two different methods. The methods presented here allow for functional investigation of coding as well as noncoding RNA and contribute to future...... RNAs rely on interactions with proteins, the establishment of protein-binding profiles is essential for the characterization of RNAs. Aiming to facilitate RNA analysis, this thesis introduces proteomics- as well as transcriptomics-based methods for the functional characterization of RNA. First, RNA...
Service network analysis for agricultural mental health
Directory of Open Access Journals (Sweden)
Fuller Jeffrey D
2009-05-01
Full Text Available Abstract Background Farmers represent a subgroup of rural and remote communities at higher risk of suicide attributed to insecure economic futures, self-reliant cultures and poor access to health services. Early intervention models are required that tap into existing farming networks. This study describes service networks in rural shires that relate to the mental health needs of farming families. This serves as a baseline to inform service network improvements. Methods A network survey of mental health related links between agricultural support, health and other human services in four drought declared shires in comparable districts in rural New South Wales, Australia. Mental health links covered information exchange, referral recommendations and program development. Results 87 agencies from 111 (78% completed a survey. 79% indicated that two thirds of their clients needed assistance for mental health related problems. The highest mean number of interagency links concerned information exchange and the frequency of these links between sectors was monthly to three monthly. The effectiveness of agricultural support and health sector links were rated as less effective by the agricultural support sector than by the health sector (p Conclusion Aligning with agricultural agencies is important to build effective mental health service pathways to address the needs of farming populations. Work is required to ensure that these agricultural support agencies have operational and effective links to primary mental health care services. Network analysis provides a baseline to inform this work. With interventions such as local mental health training and joint service planning to promote network development we would expect to see over time an increase in the mean number of links, the frequency in which these links are used and the rated effectiveness of these links.
Isaacson, Eugene
1994-01-01
This excellent text for advanced undergraduates and graduate students covers norms, numerical solution of linear systems and matrix factoring, iterative solutions of nonlinear equations, eigenvalues and eigenvectors, polynomial approximation, and other topics. It offers a careful analysis and stresses techniques for developing new methods, plus many examples and problems. 1966 edition.
Statistical Analysis of Bus Networks in India
Chatterjee, Atanu; Ramadurai, Gitakrishnan
2015-01-01
Through the past decade the field of network science has established itself as a common ground for the cross-fertilization of exciting inter-disciplinary studies which has motivated researchers to model almost every physical system as an interacting network consisting of nodes and links. Although public transport networks such as airline and railway networks have been extensively studied, the status of bus networks still remains in obscurity. In developing countries like India, where bus networks play an important role in day-to-day commutation, it is of significant interest to analyze its topological structure and answer some of the basic questions on its evolution, growth, robustness and resiliency. In this paper, we model the bus networks of major Indian cities as graphs in \\textit{L}-space, and evaluate their various statistical properties using concepts from network science. Our analysis reveals a wide spectrum of network topology with the common underlying feature of small-world property. We observe tha...
6th International Conference on Network Analysis
Nikolaev, Alexey; Pardalos, Panos; Prokopyev, Oleg
2017-01-01
This valuable source for graduate students and researchers provides a comprehensive introduction to current theories and applications in optimization methods and network models. Contributions to this book are focused on new efficient algorithms and rigorous mathematical theories, which can be used to optimize and analyze mathematical graph structures with massive size and high density induced by natural or artificial complex networks. Applications to social networks, power transmission grids, telecommunication networks, stock market networks, and human brain networks are presented. Chapters in this book cover the following topics: Linear max min fairness Heuristic approaches for high-quality solutions Efficient approaches for complex multi-criteria optimization problems Comparison of heuristic algorithms New heuristic iterative local search Power in network structures Clustering nodes in random graphs Power transmission grid structure Network decomposition problems Homogeneity hypothesis testing Network analy...
A Robust Method for Inferring Network Structures.
Yang, Yang; Luo, Tingjin; Li, Zhoujun; Zhang, Xiaoming; Yu, Philip S
2017-07-12
Inferring the network structure from limited observable data is significant in molecular biology, communication and many other areas. It is challenging, primarily because the observable data are sparse, finite and noisy. The development of machine learning and network structure study provides a great chance to solve the problem. In this paper, we propose an iterative smoothing algorithm with structure sparsity (ISSS) method. The elastic penalty in the model is introduced for the sparse solution, identifying group features and avoiding over-fitting, and the total variation (TV) penalty in the model can effectively utilize the structure information to identify the neighborhood of the vertices. Due to the non-smoothness of the elastic and structural TV penalties, an efficient algorithm with the Nesterov's smoothing optimization technique is proposed to solve the non-smooth problem. The experimental results on both synthetic and real-world networks show that the proposed model is robust against insufficient data and high noise. In addition, we investigate many factors that play important roles in identifying the performance of ISSS.
PAN network analysis program: its development and use
Energy Technology Data Exchange (ETDEWEB)
Goldwater, M.H.; Rogers, K.; Turnbull, D.K.
1976-01-01
British Gas Corp.'s London Research Station describes a comprehensive, efficient, and flexible computer simulation of pressure and flows in gas networks known as PAN - Program to Analyze Networks. The program is used extensively throughout the BGC system for both design and control of gas transmission grids. Its powerful method of analysis solves network problems quickly and handles complex configurations of compressors and regulators easily.
Egocentric social network analysis of pathological gambling.
Meisel, Matthew K; Clifton, Allan D; Mackillop, James; Miller, Joshua D; Campbell, W Keith; Goodie, Adam S
2013-03-01
To apply social network analysis (SNA) to investigate whether frequency and severity of gambling problems were associated with different network characteristics among friends, family and co-workers is an innovative way to look at relationships among individuals; the current study was the first, to our knowledge, to apply SNA to gambling behaviors. Egocentric social network analysis was used to characterize formally the relationships between social network characteristics and gambling pathology. Laboratory-based questionnaire and interview administration. Forty frequent gamblers (22 non-pathological gamblers, 18 pathological gamblers) were recruited from the community. The SNA revealed significant social network compositional differences between the two groups: pathological gamblers (PGs) had more gamblers, smokers and drinkers in their social networks than did non-pathological gamblers (NPGs). PGs had more individuals in their network with whom they personally gambled, smoked and drank than those with who were NPG. Network ties were closer to individuals in their networks who gambled, smoked and drank more frequently. Associations between gambling severity and structural network characteristics were not significant. Pathological gambling is associated with compositional but not structural differences in social networks. Pathological gamblers differ from non-pathological gamblers in the number of gamblers, smokers and drinkers in their social networks. Homophily within the networks also indicates that gamblers tend to be closer with other gamblers. This homophily may serve to reinforce addictive behaviors, and may suggest avenues for future study or intervention. © 2012 The Authors, Addiction © 2012 Society for the Study of Addiction.
Social sciences via network analysis and computation
Kanduc, Tadej
2015-01-01
In recent years information and communication technologies have gained significant importance in the social sciences. Because there is such rapid growth of knowledge, methods and computer infrastructure, research can now seamlessly connect interdisciplinary fields such as business process management, data processing and mathematics. This study presents some of the latest results, practices and state-of-the-art approaches in network analysis, machine learning, data mining, data clustering and classifications in the contents of social sciences. It also covers various real-life examples such as t
Hearing health network: a spatial analysis
Directory of Open Access Journals (Sweden)
Camila Ferreira de Rezende
2015-06-01
Full Text Available INTRODUCTION: In order to meet the demands of the patient population with hearing impairment, the Hearing Health Care Network was created, consisting of primary care actions of medium and high complexity. Spatial analysis through geoprocessing is a way to understand the organization of such services. OBJECTIVE: To analyze the organization of the Hearing Health Care Network of the State of Minas Gerais. METHODS: Cross-sectional analytical study using geoprocessing techniques. The absolute frequency and the frequency per 1000 inhabitants of the following variables were analyzed: assessment and diagnosis, selection and adaptation of hearing aids, follow-up, and speech therapy. The spatial analysis unit was the health micro-region. RESULTS: The assessment and diagnosis, selection, and adaptation of hearing aids and follow-up had a higher absolute number in the micro-regions with hearing health services. The follow-up procedure showed the lowest occurrence. Speech therapy showed higher occurrence in the state, both in absolute numbers, as well as per population. CONCLUSION: The use of geoprocessing techniques allowed the identification of the care flow as a function of the procedure performance frequency, population concentration, and territory distribution. All procedures offered by the Hearing Health Care Network are performed for users of all micro-regions of the state.
Social Network Analysis and informal trade
DEFF Research Database (Denmark)
Walther, Olivier
networks can be applied to better understand informal trade in developing countries, with a particular focus on Africa. The paper starts by discussing some of the fundamental concepts developed by social network analysis. Through a number of case studies, we show how social network analysis can...... illuminate the relevant causes of social patterns, the impact of social ties on economic performance, the diffusion of resources and information, and the exercise of power. The paper then examines some of the methodological challenges of social network analysis and how it can be combined with other...
Social network analysis and supply chain management
Directory of Open Access Journals (Sweden)
Raúl Rodríguez Rodríguez
2016-01-01
Full Text Available This paper deals with social network analysis and how it could be integrated within supply chain management from a decision-making point of view. Even though the benefits of using social analysis have are widely accepted at both academic and industry/services context, there is still a lack of solid frameworks that allow decision-makers to connect the usage and obtained results of social network analysis – mainly both information and knowledge flows and derived results- with supply chain management objectives and goals. This paper gives an overview of social network analysis, the main social network analysis metrics, supply chain performance and, finally, it identifies how future frameworks could close the gap and link the results of social network analysis with the supply chain management decision-making processes.
4th International Conference in Network Analysis
Koldanov, Petr; Pardalos, Panos
2016-01-01
The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher School of Economics, Nizhny Novgorod in May 2014, initiated joint research between scientists, engineers and researchers from academia, industry and government; the major results of conference participants have been reviewed and collected in this Work. Researchers and students in mathematics, economics, statistics, computer science and engineering will find this collection a valuable resource filled with the latest research in network analysis.
S-curve networks and a new method for estimating degree distributions of complex networks
Guo, Jin-Li
2010-01-01
In the study of complex networks almost all theoretical models are infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 addresses, we propose a forecasting model by using S curve (Logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference value for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, we propose a finite network model with the bulk growth. The model is called S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barab\\'asi-Albert method) is not suitable for the network. We develop a new method to predict the growth dynamics of the individual nodes, and use this to calculate analytically the connectivity distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-...
METHODOLOGY OF MATHEMATICAL ANALYSIS IN POWER NETWORK
Jerzy Szkutnik; Mariusz Kawecki
2008-01-01
Power distribution network analysis is taken into account. Based on correlation coefficient authors establish methodology of mathematical analysis useful in finding substations bear responsibility for power stoppage. Also methodology of risk assessment will be carried out.
Network analysis of unstructured EHR data for clinical research.
Bauer-Mehren, Anna; Lependu, Paea; Iyer, Srinivasan V; Harpaz, Rave; Leeper, Nicholas J; Shah, Nigam H
2013-01-01
In biomedical research, network analysis provides a conceptual framework for interpreting data from high-throughput experiments. For example, protein-protein interaction networks have been successfully used to identify candidate disease genes. Recently, advances in clinical text processing and the increasing availability of clinical data have enabled analogous analyses on data from electronic medical records. We constructed networks of diseases, drugs, medical devices and procedures using concepts recognized in clinical notes from the Stanford clinical data warehouse. We demonstrate the use of the resulting networks for clinical research informatics in two ways-cohort construction and outcomes analysis-by examining the safety of cilostazol in peripheral artery disease patients as a use case. We show that the network-based approaches can be used for constructing patient cohorts as well as for analyzing differences in outcomes by comparing with standard methods, and discuss the advantages offered by network-based approaches.
Mental health network governance: comparative analysis across Canadian regions
Wiktorowicz, Mary E; Fleury, Marie-Josée; Adair, Carol E; Lesage, Alain; Goldner, Elliot; Peters, Suzanne
2010-01-01
Objective Modes of governance were compared in ten local mental health networks in diverse contexts (rural/urban and regionalized/non-regionalized) to clarify the governance processes that foster inter-organizational collaboration and the conditions that support them. Methods Case studies of ten local mental health networks were developed using qualitative methods of document review, semi-structured interviews and focus groups that incorporated provincial policy, network and organizational levels of analysis. Results Mental health networks adopted either a corporate structure, mutual adjustment or an alliance governance model. A corporate structure supported by regionalization offered the most direct means for local governance to attain inter-organizational collaboration. The likelihood that networks with an alliance model developed coordination processes depended on the presence of the following conditions: a moderate number of organizations, goal consensus and trust among the organizations, and network-level competencies. In the small and mid-sized urban networks where these conditions were met their alliance realized the inter-organizational collaboration sought. In the large urban and rural networks where these conditions were not met, externally brokered forms of network governance were required to support alliance based models. Discussion In metropolitan and rural networks with such shared forms of network governance as an alliance or voluntary mutual adjustment, external mediation by a regional or provincial authority was an important lever to foster inter-organizational collaboration. PMID:21289999
Network-based analysis of proteomic profiles
Wong, Limsoon
2016-01-26
Mass spectrometry (MS)-based proteomics is a widely used and powerful tool for profiling systems-wide protein expression changes. It can be applied for various purposes, e.g. biomarker discovery in diseases and study of drug responses. Although RNA-based high-throughput methods have been useful in providing glimpses into the underlying molecular processes, the evidences they provide are indirect. Furthermore, RNA and corresponding protein levels have been known to have poor correlation. On the other hand, MS-based proteomics tend to have consistency issues (poor reproducibility and inter-sample agreement) and coverage issues (inability to detect the entire proteome) that need to be urgently addressed. In this talk, I will discuss how these issues can be addressed by proteomic profile analysis techniques that use biological networks (especially protein complexes) as the biological context. In particular, I will describe several techniques that we have been developing for network-based analysis of proteomics profile. And I will present evidence that these techniques are useful in identifying proteomics-profile analysis results that are more consistent, more reproducible, and more biologically coherent, and that these techniques allow expansion of the detected proteome to uncover and/or discover novel proteins.
Weighted Complex Network Analysis of Pakistan Highways
Directory of Open Access Journals (Sweden)
Yasir Tariq Mohmand
2013-01-01
Full Text Available The structure and properties of public transportation networks have great implications in urban planning, public policies, and infectious disease control. This study contributes a weighted complex network analysis of travel routes on the national highway network of Pakistan. The network is responsible for handling 75 percent of the road traffic yet is largely inadequate, poor, and unreliable. The highway network displays small world properties and is assortative in nature. Based on the betweenness centrality of the nodes, the most important cities are identified as this could help in identifying the potential congestion points in the network. Keeping in view the strategic location of Pakistan, such a study is of practical importance and could provide opportunities for policy makers to improve the performance of the highway network.
DEFF Research Database (Denmark)
Sindbæk, Søren Michael
2015-01-01
Long-distance communication has emerged as a particular focus for archaeologicalexploration using network theory, analysis, and modelling. The promise is apparentlyobvious: communication in the past doubtlessly had properties of complex, dynamicnetworks, and archaeological datasets almost certainly...... preserve patterns of thisinteraction. Formal network analysis and modelling holds the potential to identify anddemonstrate such patterns, where traditional methods often prove inadequate. Thearchaeological study of communication networks in the past, however, calls for radically different analytical......,and use patterns. This point is demonstrated with reference to a study of Viking-period communication in the North Sea region...
Reaction network analysis in biochemical signaling pathways
Martinez-Forero, I. (Iván); Pelaez, A. (Antonio); Villoslada, P. (Pablo)
2010-01-01
The aim of this thesis is to improve the understanding of signaling pathways through a theoretical study of chemical reaction networks. The equilibirum solution to the equations derived from chemical networks will be analytically resolved using tools from algebraic geometry. The chapters are organized as follows: 1. An introduction to chemical dynamics in biological systems with a special emphasis on steady state analysis 2. Complete description of the chemical reaction network theor...
MBVCNN: Joint convolutional neural networks method for image recognition
Tong, Tong; Mu, Xiaodong; Zhang, Li; Yi, Zhaoxiang; Hu, Pei
2017-05-01
Aiming at the problem of objects in image recognition rectangle, but objects which are input into convolutional neural networks square, the object recognition model was put forward which was based on BING method to realize object estimate, used vectorization of convolutional neural networks to realize input square image in convolutional networks, therefore, built joint convolution neural networks, which achieve multiple size image input. Verified by experiments, the accuracy of multi-object image recognition was improved by 6.70% compared with single vectorization of convolutional neural networks. Therefore, image recognition method of joint convolutional neural networks can enhance the accuracy in image recognition, especially for target in rectangular shape.
An improved method for network congestion control
Qiao, Xiaolin
2013-03-01
The rapid progress of the wireless network technology has great convenience on the people's life and work. However, because of its openness, the mobility of the terminal and the changing topology, the wireless network is more susceptible to security attacks. Authentication and key agreement is the base of the network security. The authentication and key agreement mechanism can prevent the unauthorized user from accessing the network, resist malicious network to deceive the lawful user, encrypt the session data by using the exchange key and provide the identification of the data origination. Based on characteristics of the wireless network, this paper proposed a key agreement protocol for wireless network. The authentication of protocol is based on Elliptic Curve Cryptosystems and Diffie-Hellman.
3rd International Conference on Network Analysis
Kalyagin, Valery; Pardalos, Panos
2014-01-01
This volume compiles the major results of conference participants from the "Third International Conference in Network Analysis" held at the Higher School of Economics, Nizhny Novgorod in May 2013, with the aim to initiate further joint research among different groups. The contributions in this book cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology, and applications. Network analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network has brought together researchers, practitioners from numerous fields such as operations research, computer science, transportation, energy, biomedicine, computational neuroscience and social sciences. In addition, new approaches and computer environments such as parallel computing, grid computing, cloud computing, and quantum computing have helped to solve large scale...
Mercken, Liesbeth; Snijders, Tom A. B.; Steglich, Christian; Vertiainen, Erkki; Vartiainen, E.; De Vries, H.
Aims The main goal of this study was to examine differences between adolescent male and female friendship networks regarding smoking-based selection and influence processes using newly developed social network analysis methods that allow the current state of continuously changing friendship networks
Gene network analysis: from heart development to cardiac therapy.
Ferrazzi, Fulvia; Bellazzi, Riccardo; Engel, Felix B
2015-03-01
Networks offer a flexible framework to represent and analyse the complex interactions between components of cellular systems. In particular gene networks inferred from expression data can support the identification of novel hypotheses on regulatory processes. In this review we focus on the use of gene network analysis in the study of heart development. Understanding heart development will promote the elucidation of the aetiology of congenital heart disease and thus possibly improve diagnostics. Moreover, it will help to establish cardiac therapies. For example, understanding cardiac differentiation during development will help to guide stem cell differentiation required for cardiac tissue engineering or to enhance endogenous repair mechanisms. We introduce different methodological frameworks to infer networks from expression data such as Boolean and Bayesian networks. Then we present currently available temporal expression data in heart development and discuss the use of network-based approaches in published studies. Collectively, our literature-based analysis indicates that gene network analysis constitutes a promising opportunity to infer therapy-relevant regulatory processes in heart development. However, the use of network-based approaches has so far been limited by the small amount of samples in available datasets. Thus, we propose to acquire high-resolution temporal expression data to improve the mathematical descriptions of regulatory processes obtained with gene network inference methodologies. Especially probabilistic methods that accommodate the intrinsic variability of biological systems have the potential to contribute to a deeper understanding of heart development.
Analysis of complex networks using aggressive abstraction.
Energy Technology Data Exchange (ETDEWEB)
Colbaugh, Richard; Glass, Kristin.; Willard, Gerald
2008-10-01
This paper presents a new methodology for analyzing complex networks in which the network of interest is first abstracted to a much simpler (but equivalent) representation, the required analysis is performed using the abstraction, and analytic conclusions are then mapped back to the original network and interpreted there. We begin by identifying a broad and important class of complex networks which admit abstractions that are simultaneously dramatically simplifying and property preserving we call these aggressive abstractions -- and which can therefore be analyzed using the proposed approach. We then introduce and develop two forms of aggressive abstraction: 1.) finite state abstraction, in which dynamical networks with uncountable state spaces are modeled using finite state systems, and 2.) onedimensional abstraction, whereby high dimensional network dynamics are captured in a meaningful way using a single scalar variable. In each case, the property preserving nature of the abstraction process is rigorously established and efficient algorithms are presented for computing the abstraction. The considerable potential of the proposed approach to complex networks analysis is illustrated through case studies involving vulnerability analysis of technological networks and predictive analysis for social processes.
Social Network Analysis and Critical Realism
DEFF Research Database (Denmark)
Buch-Hansen, Hubert
2014-01-01
Social network analysis ( SNA) is an increasingly popular approach that provides researchers with highly developed tools to map and analyze complexes of social relations. Although a number of network scholars have explicated the assumptions that underpin SNA, the approach has yet to be discussed ...
Detecting Distributed Network Traffic Anomaly with Network-Wide Correlation Analysis
Zonglin, Li; Guangmin, Hu; Xingmiao, Yao; Dan, Yang
2008-12-01
Distributed network traffic anomaly refers to a traffic abnormal behavior involving many links of a network and caused by the same source (e.g., DDoS attack, worm propagation). The anomaly transiting in a single link might be unnoticeable and hard to detect, while the anomalous aggregation from many links can be prevailing, and does more harm to the networks. Aiming at the similar features of distributed traffic anomaly on many links, this paper proposes a network-wide detection method by performing anomalous correlation analysis of traffic signals' instantaneous parameters. In our method, traffic signals' instantaneous parameters are firstly computed, and their network-wide anomalous space is then extracted via traffic prediction. Finally, an anomaly is detected by a global correlation coefficient of anomalous space. Our evaluation using Abilene traffic traces demonstrates the excellent performance of this approach for distributed traffic anomaly detection.
Detecting Distributed Network Traffic Anomaly with Network-Wide Correlation Analysis
Directory of Open Access Journals (Sweden)
Yang Dan
2008-12-01
Full Text Available Distributed network traffic anomaly refers to a traffic abnormal behavior involving many links of a network and caused by the same source (e.g., DDoS attack, worm propagation. The anomaly transiting in a single link might be unnoticeable and hard to detect, while the anomalous aggregation from many links can be prevailing, and does more harm to the networks. Aiming at the similar features of distributed traffic anomaly on many links, this paper proposes a network-wide detection method by performing anomalous correlation analysis of traffic signals' instantaneous parameters. In our method, traffic signals' instantaneous parameters are firstly computed, and their network-wide anomalous space is then extracted via traffic prediction. Finally, an anomaly is detected by a global correlation coefficient of anomalous space. Our evaluation using Abilene traffic traces demonstrates the excellent performance of this approach for distributed traffic anomaly detection.
Ni, Jianhua; Qian, Tianlu; Xi, Changbai; Rui, Yikang; Wang, Jiechen
2016-08-18
The spatial distribution of urban service facilities is largely constrained by the road network. In this study, network point pattern analysis and correlation analysis were used to analyze the relationship between road network and healthcare facility distribution. The weighted network kernel density estimation method proposed in this study identifies significant differences between the outside and inside areas of the Ming city wall. The results of network K-function analysis show that private hospitals are more evenly distributed than public hospitals, and pharmacy stores tend to cluster around hospitals along the road network. After computing the correlation analysis between different categorized hospitals and street centrality, we find that the distribution of these hospitals correlates highly with the street centralities, and that the correlations are higher with private and small hospitals than with public and large hospitals. The comprehensive analysis results could help examine the reasonability of existing urban healthcare facility distribution and optimize the location of new healthcare facilities.
Throughput Analysis of Large Wireless Networks with Regular Topologies
Directory of Open Access Journals (Sweden)
Kezhu Hong
2007-04-01
Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.
Throughput Analysis of Large Wireless Networks with Regular Topologies
Directory of Open Access Journals (Sweden)
Hong Kezhu
2007-01-01
Full Text Available The throughput of large wireless networks with regular topologies is analyzed under two medium-access control schemes: synchronous array method (SAM and slotted ALOHA. The regular topologies considered are square, hexagon, and triangle. Both nonfading channels and Rayleigh fading channels are examined. Furthermore, both omnidirectional antennas and directional antennas are considered. Our analysis shows that the SAM leads to a much higher network throughput than the slotted ALOHA. The network throughput in this paper is measured in either bits-hops per second per Hertz per node or bits-meters per second per Hertz per node. The exact connection between the two measures is shown for each topology. With these two fundamental units, the network throughput shown in this paper can serve as a reliable benchmark for future works on network throughput of large networks.
Zhang, Bai; Li, Huai; Riggins, Rebecca B; Zhan, Ming; Xuan, Jianhua; Zhang, Zhen; Hoffman, Eric P; Clarke, Robert; Wang, Yue
2009-02-15
Significant efforts have been made to acquire data under different conditions and to construct static networks that can explain various gene regulation mechanisms. However, gene regulatory networks are dynamic and condition-specific; under different conditions, networks exhibit different regulation patterns accompanied by different transcriptional network topologies. Thus, an investigation on the topological changes in transcriptional networks can facilitate the understanding of cell development or provide novel insights into the pathophysiology of certain diseases, and help identify the key genetic players that could serve as biomarkers or drug targets. Here, we report a differential dependency network (DDN) analysis to detect statistically significant topological changes in the transcriptional networks between two biological conditions. We propose a local dependency model to represent the local structures of a network by a set of conditional probabilities. We develop an efficient learning algorithm to learn the local dependency model using the Lasso technique. A permutation test is subsequently performed to estimate the statistical significance of each learned local structure. In testing on a simulation dataset, the proposed algorithm accurately detected all the genes with network topological changes. The method was then applied to the estrogen-dependent T-47D estrogen receptor-positive (ER+) breast cancer cell line datasets and human and mouse embryonic stem cell datasets. In both experiments using real microarray datasets, the proposed method produced biologically meaningful results. We expect DDN to emerge as an important bioinformatics tool in transcriptional network analyses. While we focus specifically on transcriptional networks, the DDN method we introduce here is generally applicable to other biological networks with similar characteristics. The DDN MATLAB toolbox and experiment data are available at http://www.cbil.ece.vt.edu/software.htm.
Spectrum-Based and Collaborative Network Topology Analysis and Visualization
Hu, Xianlin
2013-01-01
Networks are of significant importance in many application domains, such as World Wide Web and social networks, which often embed rich topological information. Since network topology captures the organization of network nodes and links, studying network topology is very important to network analysis. In this dissertation, we study networks by…
Robust flux balance analysis of multiscale biochemical reaction networks.
Sun, Yuekai; Fleming, Ronan M T; Thiele, Ines; Saunders, Michael A
2013-07-30
Biological processes such as metabolism, signaling, and macromolecular synthesis can be modeled as large networks of biochemical reactions. Large and comprehensive networks, like integrated networks that represent metabolism and macromolecular synthesis, are inherently multiscale because reaction rates can vary over many orders of magnitude. They require special methods for accurate analysis because naive use of standard optimization systems can produce inaccurate or erroneously infeasible results. We describe techniques enabling off-the-shelf optimization software to compute accurate solutions to the poorly scaled optimization problems arising from flux balance analysis of multiscale biochemical reaction networks. We implement lifting techniques for flux balance analysis within the openCOBRA toolbox and demonstrate our techniques using the first integrated reconstruction of metabolism and macromolecular synthesis for E. coli. Our techniques enable accurate flux balance analysis of multiscale networks using off-the-shelf optimization software. Although we describe lifting techniques in the context of flux balance analysis, our methods can be used to handle a variety of optimization problems arising from analysis of multiscale network reconstructions.
Complex Network Analysis of Guangzhou Metro
Directory of Open Access Journals (Sweden)
Yasir Tariq Mohmand
2015-11-01
Full Text Available The structure and properties of public transportation networks can provide suggestions for urban planning and public policies. This study contributes a complex network analysis of the Guangzhou metro. The metro network has 236 kilometers of track and is the 6th busiest metro system of the world. In this paper topological properties of the network are explored. We observed that the network displays small world properties and is assortative in nature. The network possesses a high average degree of 17.5 with a small diameter of 5. Furthermore, we also identified the most important metro stations based on betweenness and closeness centralities. These could help in identifying the probable congestion points in the metro system and provide policy makers with an opportunity to improve the performance of the metro system.
Extending Stochastic Network Calculus to Loss Analysis
Directory of Open Access Journals (Sweden)
Chao Luo
2013-01-01
Full Text Available Loss is an important parameter of Quality of Service (QoS. Though stochastic network calculus is a very useful tool for performance evaluation of computer networks, existing studies on stochastic service guarantees mainly focused on the delay and backlog. Some efforts have been made to analyse loss by deterministic network calculus, but there are few results to extend stochastic network calculus for loss analysis. In this paper, we introduce a new parameter named loss factor into stochastic network calculus and then derive the loss bound through the existing arrival curve and service curve via this parameter. We then prove that our result is suitable for the networks with multiple input flows. Simulations show the impact of buffer size, arrival traffic, and service on the loss factor.
Statistical Analysis of Bus Networks in India.
Chatterjee, Atanu; Manohar, Manju; Ramadurai, Gitakrishnan
2016-01-01
In this paper, we model the bus networks of six major Indian cities as graphs in L-space, and evaluate their various statistical properties. While airline and railway networks have been extensively studied, a comprehensive study on the structure and growth of bus networks is lacking. In India, where bus transport plays an important role in day-to-day commutation, it is of significant interest to analyze its topological structure and answer basic questions on its evolution, growth, robustness and resiliency. Although the common feature of small-world property is observed, our analysis reveals a wide spectrum of network topologies arising due to significant variation in the degree-distribution patterns in the networks. We also observe that these networks although, robust and resilient to random attacks are particularly degree-sensitive. Unlike real-world networks, such as Internet, WWW and airline, that are virtual, bus networks are physically constrained. Our findings therefore, throw light on the evolution of such geographically and constrained networks that will help us in designing more efficient bus networks in the future.
Algorithmic and analytical methods in network biology
Koyutürk, Mehmet
2010-01-01
During genomic revolution, algorithmic and analytical methods for organizing, integrating, analyzing, and querying biological sequence data proved invaluable. Today, increasing availability of high-throughput data pertaining functional states of biomolecules, as well as their interactions, enables genome-scale studies of the cell from a systems perspective. The past decade witnessed significant efforts on the development of computational infrastructure for large-scale modeling and analysis of...
Steward, David R.
2015-11-01
Groundwater and surface water contain interfaces across which hydrologic functions are discontinuous. Thin elements with high hydraulic conductivity in a porous media focus groundwater, which flows through such inhomogeneities and causes an abrupt change in stream function across their interfaces, and elements with low conductivity retard flow with discontinuous head. Base flow interactions at the interface between groundwater and surface water transport water between these stores and generate a discontinuous normal component of flow. Thin objects in surface water with Kutta condition generate circulation by the discontinuous tangential component of flow across their interface. These discontinuities across hydrologic interfaces are quantified and visualized using the Analytic Element Method, where slit elements are formulated using the Joukowsky transformation with Laurent series and new influence functions to represent sinks and circulation, and methods are developed for these applications expressing discontinuities as Fourier series. The specific geometries illustrate solutions for a randomly generated heterogeneous porous media with nonintersecting inhomogeneities, for groundwater/surface water interaction in a synthetic river network, and for a slender body with geometry similar to the wings of the Wright Brothers. The mathematical details are reduced to series solutions and matrix multiplications, which are easily extensible to other geometries and applications.
Social network analysis for program implementation.
Valente, Thomas W; Palinkas, Lawrence A; Czaja, Sara; Chu, Kar-Hai; Brown, C Hendricks
2015-01-01
This paper introduces the use of social network analysis theory and tools for implementation research. The social network perspective is useful for understanding, monitoring, influencing, or evaluating the implementation process when programs, policies, practices, or principles are designed and scaled up or adapted to different settings. We briefly describe common barriers to implementation success and relate them to the social networks of implementation stakeholders. We introduce a few simple measures commonly used in social network analysis and discuss how these measures can be used in program implementation. Using the four stage model of program implementation (exploration, adoption, implementation, and sustainment) proposed by Aarons and colleagues [1] and our experience in developing multi-sector partnerships involving community leaders, organizations, practitioners, and researchers, we show how network measures can be used at each stage to monitor, intervene, and improve the implementation process. Examples are provided to illustrate these concepts. We conclude with expected benefits and challenges associated with this approach.
Modern Community Detection Methods in Social Networks
Directory of Open Access Journals (Sweden)
V. O. Chesnokov
2017-01-01
Full Text Available Social network structure is not homogeneous. Groups of vertices which have a lot of links between them are called communities. A survey of algorithms discovering such groups is presented in the article.A popular approach to community detection is to use an graph clustering algorithm. Methods based on inner metric optimization are common. 5 groups of algorithms are listed: based on optimization, joining vertices into clusters by some closeness measure, special subgraphs discovery, partitioning graph by deleting edges, and based on a dynamic process or generative model.Overlapping community detection algorithms are usually just modified graph clustering algorithms. Other approaches do exist, e.g. ones based on edges clustering or constructing communities around randomly chosen vertices. Methods based on nonnegative matrix factorization are also used, but they have high computational complexity. Algorithms based on label propagation lack this disadvantage. Methods based on affiliation model are perspective. This model claims that communities define the structure of a graph.Algorithms which use node attributes are considered: ones based on latent Dirichlet allocation, initially used for text clustering, and CODICIL, where edges of node content relevance are added to the original edge set. 6 classes are listed for algorithms for graphs with node attributes: changing egdes’ weights, changing vertex distance function, building augmented graph with nodes and attributes, based on stochastic models, partitioning attribute space and others.Overlapping community detection algorithms which effectively use node attributes are just started to appear. Methods based on partitioning attribute space, latent Dirichlet allocation, stochastic models and nonnegative matrix factorization are considered. The most effective algorithm on real datasets is CESNA. It is based on affiliation model. However, it gives results which are far from ground truth
Haraldsdóttir, Hulda S.; Fleming, Ronan M. T.
2016-01-01
Conserved moieties are groups of atoms that remain intact in all reactions of a metabolic network. Identification of conserved moieties gives insight into the structure and function of metabolic networks and facilitates metabolic modelling. All moiety conservation relations can be represented as nonnegative integer vectors in the left null space of the stoichiometric matrix corresponding to a biochemical network. Algorithms exist to compute such vectors based only on reaction stoichiometry but their computational complexity has limited their application to relatively small metabolic networks. Moreover, the vectors returned by existing algorithms do not, in general, represent conservation of a specific moiety with a defined atomic structure. Here, we show that identification of conserved moieties requires data on reaction atom mappings in addition to stoichiometry. We present a novel method to identify conserved moieties in metabolic networks by graph theoretical analysis of their underlying atom transition networks. Our method returns the exact group of atoms belonging to each conserved moiety as well as the corresponding vector in the left null space of the stoichiometric matrix. It can be implemented as a pipeline of polynomial time algorithms. Our implementation completes in under five minutes on a metabolic network with more than 4,000 mass balanced reactions. The scalability of the method enables extension of existing applications for moiety conservation relations to genome-scale metabolic networks. We also give examples of new applications made possible by elucidating the atomic structure of conserved moieties. PMID:27870845
Multilayer motif analysis of brain networks
Battiston, Federico; Nicosia, Vincenzo; Chavez, Mario; Latora, Vito
2017-04-01
In the last decade, network science has shed new light both on the structural (anatomical) and on the functional (correlations in the activity) connectivity among the different areas of the human brain. The analysis of brain networks has made possible to detect the central areas of a neural system and to identify its building blocks by looking at overabundant small subgraphs, known as motifs. However, network analysis of the brain has so far mainly focused on anatomical and functional networks as separate entities. The recently developed mathematical framework of multi-layer networks allows us to perform an analysis of the human brain where the structural and functional layers are considered together. In this work, we describe how to classify the subgraphs of a multiplex network, and we extend the motif analysis to networks with an arbitrary number of layers. We then extract multi-layer motifs in brain networks of healthy subjects by considering networks with two layers, anatomical and functional, respectively, obtained from diffusion and functional magnetic resonance imaging. Results indicate that subgraphs in which the presence of a physical connection between brain areas (links at the structural layer) coexists with a non-trivial positive correlation in their activities are statistically overabundant. Finally, we investigate the existence of a reinforcement mechanism between the two layers by looking at how the probability to find a link in one layer depends on the intensity of the connection in the other one. Showing that functional connectivity is non-trivially constrained by the underlying anatomical network, our work contributes to a better understanding of the interplay between the structure and function in the human brain.
Hydraulic Analysis of Water Distribution Network Using Shuffled Complex Evolution
Directory of Open Access Journals (Sweden)
Naser Moosavian
2014-01-01
Full Text Available Hydraulic analysis of water distribution networks is an important problem in civil engineering. A widely used approach in steady-state analysis of water distribution networks is the global gradient algorithm (GGA. However, when the GGA is applied to solve these networks, zero flows cause a computation failure. On the other hand, there are different mathematical formulations for hydraulic analysis under pressure-driven demand and leakage simulation. This paper introduces an optimization model for the hydraulic analysis of water distribution networks using a metaheuristic method called shuffled complex evolution (SCE algorithm. In this method, applying if-then rules in the optimization model is a simple way in handling pressure-driven demand and leakage simulation, and there is no need for an initial solution vector which must be chosen carefully in many other procedures if numerical convergence is to be achieved. The overall results indicate that the proposed method has the capability of handling various pipe networks problems without changing in model or mathematical formulation. Application of SCE in optimization model can lead to accurate solutions in pipes with zero flows. Finally, it can be concluded that the proposed method is a suitable alternative optimizer challenging other methods especially in terms of accuracy.
Thorn, Graeme J; King, John R
2016-01-01
The Gram-positive bacterium Clostridium acetobutylicum is an anaerobic endospore-forming species which produces acetone, butanol and ethanol via the acetone-butanol (AB) fermentation process, leading to biofuels including butanol. In previous work we looked to estimate the parameters in an ordinary differential equation model of the glucose metabolism network using data from pH-controlled continuous culture experiments. Here we combine two approaches, namely the approximate Bayesian computation via an existing sequential Monte Carlo (ABC-SMC) method (to compute credible intervals for the parameters), and the profile likelihood estimation (PLE) (to improve the calculation of confidence intervals for the same parameters), the parameters in both cases being derived from experimental data from forward shift experiments. We also apply the ABC-SMC method to investigate which of the models introduced previously (one non-sporulation and four sporulation models) have the greatest strength of evidence. We find that the joint approximate posterior distribution of the parameters determines the same parameters as previously, including all of the basal and increased enzyme production rates and enzyme reaction activity parameters, as well as the Michaelis-Menten kinetic parameters for glucose ingestion, while other parameters are not as well-determined, particularly those connected with the internal metabolites acetyl-CoA, acetoacetyl-CoA and butyryl-CoA. We also find that the approximate posterior is strongly non-Gaussian, indicating that our previous assumption of elliptical contours of the distribution is not valid, which has the effect of reducing the numbers of pairs of parameters that are (linearly) correlated with each other. Calculations of confidence intervals using the PLE method back this up. Finally, we find that all five of our models are equally likely, given the data available at present. Copyright © 2015 Elsevier Inc. All rights reserved.
Social network analysis of public health programs to measure partnership.
Schoen, Martin W; Moreland-Russell, Sarah; Prewitt, Kim; Carothers, Bobbi J
2014-12-01
In order to prevent chronic diseases, community-based programs are encouraged to take an ecological approach to public health promotion and involve many diverse partners. Little is known about measuring partnership in implementing public health strategies. We collected data from 23 Missouri communities in early 2012 that received funding from three separate programs to prevent obesity and/or reduce tobacco use. While all of these funding programs encourage partnership, only the Social Innovation for Missouri (SIM) program included a focus on building community capacity and enhancing collaboration. Social network analysis techniques were used to understand contact and collaboration networks in community organizations. Measurements of average degree, density, degree centralization, and betweenness centralization were calculated for each network. Because of the various sizes of the networks, we conducted comparative analyses with and without adjustment for network size. SIM programs had increased measurements of average degree for partner collaboration and larger networks. When controlling for network size, SIM groups had higher measures of network density and lower measures of degree centralization and betweenness centralization. SIM collaboration networks were more dense and less centralized, indicating increased partnership. The methods described in this paper can be used to compare partnership in community networks of various sizes. Further research is necessary to define causal mechanisms of partnership development and their relationship to public health outcomes. Copyright © 2014 Elsevier Ltd. All rights reserved.
A Method for Upper Bounding on Network Access Speed
DEFF Research Database (Denmark)
Knudsen, Thomas Phillip; Patel, A.; Pedersen, Jens Myrup
2004-01-01
This paper presents a method for calculating an upper bound on network access speed growth and gives guidelines for further research experiments and simulations. The method is aimed at providing a basis for simulation of long term network development and resource management.......This paper presents a method for calculating an upper bound on network access speed growth and gives guidelines for further research experiments and simulations. The method is aimed at providing a basis for simulation of long term network development and resource management....
1st International Conference on Network Analysis
Kalyagin, Valery; Pardalos, Panos
2013-01-01
This volume contains a selection of contributions from the "First International Conference in Network Analysis," held at the University of Florida, Gainesville, on December 14-16, 2011. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The purpose of this volume is to overcome this difficulty by collecting the major results found by the participants and combining them in one easily accessible compilation. Network analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network is bringing together researchers, practitioners and other scientific communities from numerous fields such as Operations Research, Computer Science, Transportation, Energy, Social Sciences, and more. The contributions not only come from different fields, but also cover a broad range of topics relevant to the...
A novel community detection method in bipartite networks
Zhou, Cangqi; Feng, Liang; Zhao, Qianchuan
2018-02-01
Community structure is a common and important feature in many complex networks, including bipartite networks, which are used as a standard model for many empirical networks comprised of two types of nodes. In this paper, we propose a two-stage method for detecting community structure in bipartite networks. Firstly, we extend the widely-used Louvain algorithm to bipartite networks. The effectiveness and efficiency of the Louvain algorithm have been proved by many applications. However, there lacks a Louvain-like algorithm specially modified for bipartite networks. Based on bipartite modularity, a measure that extends unipartite modularity and that quantifies the strength of partitions in bipartite networks, we fill the gap by developing the Bi-Louvain algorithm that iteratively groups the nodes in each part by turns. This algorithm in bipartite networks often produces a balanced network structure with equal numbers of two types of nodes. Secondly, for the balanced network yielded by the first algorithm, we use an agglomerative clustering method to further cluster the network. We demonstrate that the calculation of the gain of modularity of each aggregation, and the operation of joining two communities can be compactly calculated by matrix operations for all pairs of communities simultaneously. At last, a complete hierarchical community structure is unfolded. We apply our method to two benchmark data sets and a large-scale data set from an e-commerce company, showing that it effectively identifies community structure in bipartite networks.
Analysis and monitoring design for networks
Energy Technology Data Exchange (ETDEWEB)
Fedorov, V.; Flanagan, D.; Rowan, T.; Batsell, S.
1998-06-01
The idea of applying experimental design methodologies to develop monitoring systems for computer networks is relatively novel even though it was applied in other areas such as meteorology, seismology, and transportation. One objective of a monitoring system should always be to collect as little data as necessary to be able to monitor specific parameters of the system with respect to assigned targets and objectives. This implies a purposeful monitoring where each piece of data has a reason to be collected and stored for future use. When a computer network system as large and complex as the Internet is the monitoring subject, providing an optimal and parsimonious observing system becomes even more important. Many data collection decisions must be made by the developers of a monitoring system. These decisions include but are not limited to the following: (1) The type data collection hardware and software instruments to be used; (2) How to minimize interruption of regular network activities during data collection; (3) Quantification of the objectives and the formulation of optimality criteria; (4) The placement of data collection hardware and software devices; (5) The amount of data to be collected in a given time period, how large a subset of the available data to collect during the period, the length of the period, and the frequency of data collection; (6) The determination of the data to be collected (for instance, selection of response and explanatory variables); (7) Which data will be retained and how long (i.e., data storage and retention issues); and (8) The cost analysis of experiments. Mathematical statistics, and, in particular, optimal experimental design methods, may be used to address the majority of problems generated by 3--7. In this study, the authors focus their efforts on topics 3--5.
Donges, Jonathan F; Beronov, Boyan; Wiedermann, Marc; Runge, Jakob; Feng, Qing Yi; Tupikina, Liubov; Stolbova, Veronika; Donner, Reik V; Marwan, Norbert; Dijkstra, Henk A; Kurths, Jürgen
2015-01-01
We introduce the pyunicorn (Pythonic unified complex network and recurrence analysis toolbox) open source software package for applying and combining modern methods of data analysis and modeling from complex network theory and nonlinear time series analysis. pyunicorn is a fully object-oriented and easily parallelizable package written in the language Python. It allows for the construction of functional networks such as climate networks in climatology or functional brain networks in neuroscience representing the structure of statistical interrelationships in large data sets of time series and, subsequently, investigating this structure using advanced methods of complex network theory such as measures and models for spatial networks, networks of interacting networks, node-weighted statistics or network surrogates. Additionally, pyunicorn provides insights into the nonlinear dynamics of complex systems as recorded in uni- and multivariate time series from a non-traditional perspective by means of recurrence qua...
Analysis of Network Topologies Underlying Ethylene Growth Response Kinetics
Directory of Open Access Journals (Sweden)
Aaron M. Prescott
2016-08-01
Full Text Available Most models for ethylene signaling involve a linear pathway. However, measurements of seedling growth kinetics when ethylene is applied and removed have resulted in more complex network models that include coherent feedforward, negative feedback, and positive feedback motifs. However, the dynamical responses of the proposed networks have not been explored in a quantitative manner. Here, we explore (i whether any of the proposed models are capable of producing growth-response behaviors consistent with experimental observations and (ii what mechanistic roles various parts of the network topologies play in ethylene signaling. To address this, we used computational methods to explore two general network topologies: The first contains a coherent feedforward loop that inhibits growth and a negative feedback from growth onto itself (CFF/NFB. In the second, ethylene promotes the cleavage of EIN2, with the product of the cleavage inhibiting growth and promoting the production of EIN2 through a positive feedback loop (PFB. Since few network parameters for ethylene signaling are known in detail, we used an evolutionary algorithm to explore sets of parameters that produce behaviors similar to experimental growth response kinetics of both wildtype and mutant seedlings. We generated a library of parameter sets by independently running the evolutionary algorithm many times. Both network topologies produce behavior consistent with experimental observations and analysis of the parameter sets allows us to identify important network interactions and parameter constraints. We additionally screened these parameter sets for growth recovery in the presence of sub-saturating ethylene doses, which is an experimentally-observed property that emerges in some of the evolved parameter sets. Finally, we probed simplified networks maintaining key features of the CFF/NFB and PFB topologies. From this, we verified observations drawn from the larger networks about mechanisms
Tumor diagnosis using the backpropagation neural network method
Ma, Lixing; Sukuta, Sydney; Bruch, Reinhard F.; Afanasyeva, Natalia I.; Looney, Carl G.
1998-04-01
For characterization of skin cancer, an artificial neural network method has been developed to diagnose normal tissue, benign tumor and melanoma. The pattern recognition is based on a three-layer neural network fuzzy learning system. In this study, the input neuron data set is the Fourier transform IR spectrum obtained by a new fiberoptic evanescent wave Fourier transform IR spectroscopy method in the range of 1480 to 1850 cm-1. Ten input features are extracted from the absorbency values in this region. A single hidden layer of neural nodes with sigmoids activation functions clusters the feature space into small subclasses and the output nodes are separated in different nonconvex classes to permit nonlinear discrimination of disease states. The output is classified as three classes: normal tissue, benign tumor and melanoma. The results obtained from the neural network pattern recognition are shown to be consistent with traditional medical diagnosis. Input features have also been extracted from the absorbency spectra using chemical factor analysis. These abstract features or factors are also used in the classification.
Network Anomaly Detection Based on Wavelet Analysis
Directory of Open Access Journals (Sweden)
Ali A. Ghorbani
2008-11-01
Full Text Available Signal processing techniques have been applied recently for analyzing and detecting network anomalies due to their potential to find novel or unknown intrusions. In this paper, we propose a new network signal modelling technique for detecting network anomalies, combining the wavelet approximation and system identification theory. In order to characterize network traffic behaviors, we present fifteen features and use them as the input signals in our system. We then evaluate our approach with the 1999 DARPA intrusion detection dataset and conduct a comprehensive analysis of the intrusions in the dataset. Evaluation results show that the approach achieves high-detection rates in terms of both attack instances and attack types. Furthermore, we conduct a full day's evaluation in a real large-scale WiFi ISP network where five attack types are successfully detected from over 30 millions flows.
Fuzzy Entropy Method for Quantifying Supply Chain Networks Complexity
Zhang, Jihui; Xu, Junqin
Supply chain is a special kind of complex network. Its complexity and uncertainty makes it very difficult to control and manage. Supply chains are faced with a rising complexity of products, structures, and processes. Because of the strong link between a supply chain’s complexity and its efficiency the supply chain complexity management becomes a major challenge of today’s business management. The aim of this paper is to quantify the complexity and organization level of an industrial network working towards the development of a ‘Supply Chain Network Analysis’ (SCNA). By measuring flows of goods and interaction costs between different sectors of activity within the supply chain borders, a network of flows is built and successively investigated by network analysis. The result of this study shows that our approach can provide an interesting conceptual perspective in which the modern supply network can be framed, and that network analysis can handle these issues in practice.
Efficient Optimization Methods for Communication Network Planning and Assessment
Kiese, Moritz
2010-01-01
In this work, we develop efficient mathematical planning methods to design communication networks. First, we examine future technologies for optical backbone networks. As new, more intelligent nodes cause higher dynamics in the transport networks, fast planning methods are required. To this end, we develop a heuristic planning algorithm. The evaluation of the cost-efficiency of new, adapative transmission techniques comprises the second topic of this section. In the second part of this work, ...
Network graph analysis of category fluency testing.
Lerner, Alan J; Ogrocki, Paula K; Thomas, Peter J
2009-03-01
Category fluency is impaired early in Alzheimer disease (AD). Graph theory is a technique to analyze complex relationships in networks. Features of interest in network analysis include the number of nodes and edges, and variables related to their interconnectedness. Other properties important in network analysis are "small world properties" and "scale-free" properties. The small world property (popularized as the so-called "6 degrees of separation") arises when the majority of connections are local, but a number of connections are to distant nodes. Scale-free networks are characterized by the presence of a few nodes with many connections, and many more nodes with fewer connections. To determine if category fluency data can be analyzed using graph theory. To compare normal elderly, mild cognitive impairment (MCI) and AD network graphs, and characterize changes seen with increasing cognitive impairment. Category fluency results ("animals" recorded over 60 s) from normals (n=38), MCI (n=33), and AD (n=40) completing uniform data set evaluations were converted to network graphs of all unique cooccurring neighbors, and compared for network variables. For Normal, MCI and AD, mean clustering coefficients were 0.21, 0.22, 0.30; characteristic path lengths were 3.27, 3.17, and 2.65; small world properties decreased with increasing cognitive impairment, and all graphs showed scale-free properties. Rank correlations of the 25 commonest items ranged from 0.75 to 0.83. Filtering of low-degree nodes in normal and MCI graphs resulted in properties similar to the AD network graph. Network graph analysis is a promising technique for analyzing changes in category fluency. Our technique results in nonrandom graphs consistent with well-characterized properties for these types of graphs.
Method for stitching microbial images using a neural network
Semenishchev, E. A.; Voronin, V. V.; Marchuk, V. I.; Tolstova, I. V.
2017-05-01
Currently an analog microscope has a wide distribution in the following fields: medicine, animal husbandry, monitoring technological objects, oceanography, agriculture and others. Automatic method is preferred because it will greatly reduce the work involved. Stepper motors are used to move the microscope slide and allow to adjust the focus in semi-automatic or automatic mode view with transfer images of microbiological objects from the eyepiece of the microscope to the computer screen. Scene analysis allows to locate regions with pronounced abnormalities for focusing specialist attention. This paper considers the method for stitching microbial images, obtained of semi-automatic microscope. The method allows to keep the boundaries of objects located in the area of capturing optical systems. Objects searching are based on the analysis of the data located in the area of the camera view. We propose to use a neural network for the boundaries searching. The stitching image boundary is held of the analysis borders of the objects. To auto focus, we use the criterion of the minimum thickness of the line boundaries of object. Analysis produced the object located in the focal axis of the camera. We use method of recovery of objects borders and projective transform for the boundary of objects which are based on shifted relative to the focal axis. Several examples considered in this paper show the effectiveness of the proposed approach on several test images.
A survey of spectrum prediction methods in cognitive radio networks
Wu, Jianwei; Li, Yanling
2017-04-01
Spectrum prediction technology is an effective way to solve the problems of processing latency, spectrum access, spectrum collision and energy consumption in cognitive radio networks. Spectral prediction technology is divided into three categories according to its nature, namely, spectral prediction method based on regression analysis, spectrum prediction method based on Markov model and spectrum prediction method based on machine learning. By analyzing and comparing the three kinds of prediction models, the author hopes to provide some reference for the later researchers. In this paper, the development situation, practical application and existent problems of three kinds of forecasting models are analyzed and summarized. On this basis, this paper discusses the development trend of the next step.
Performance Analysis of 3G Communication Network
Directory of Open Access Journals (Sweden)
Toni Anwar
2013-09-01
Full Text Available In this project, third generation (3G technologies research had been carried out to design and optimization conditions for 3G network. The 3G wireless mobile communication networks are growing at an ever faster rate, and this is likely to continue in the foreseeable future. Some services such as e-mail, web browsing etc allow the transition of the network from circuit switched to packet switched operation, resulting in increased overall network performance. Higher reliability, better coverage and services, higher capacity, mobility management, and wireless multimedia are all parts of the network performance. Throughput and spectral efficiency are fundamental parameters in capacity planning for 3G cellular network deployments. This project investigates also the downlink (DL and uplink (UL throughput and spectral efficiency performance of the standard Universal Mobile Telecommunications system (UMTS system for different scenarios of user and different technologies. Power consumption comparison for different mobile technology is also discussed. The analysis can significantly help system engineers to obtain crucial performance characteristics of 3G network. At the end of the paper, coverage area of 3G from one of the mobile network in Malaysia is presented.
Medical image analysis with artificial neural networks.
Jiang, J; Trundle, P; Ren, J
2010-12-01
Given that neural networks have been widely reported in the research community of medical imaging, we provide a focused literature survey on recent neural network developments in computer-aided diagnosis, medical image segmentation and edge detection towards visual content analysis, and medical image registration for its pre-processing and post-processing, with the aims of increasing awareness of how neural networks can be applied to these areas and to provide a foundation for further research and practical development. Representative techniques and algorithms are explained in detail to provide inspiring examples illustrating: (i) how a known neural network with fixed structure and training procedure could be applied to resolve a medical imaging problem; (ii) how medical images could be analysed, processed, and characterised by neural networks; and (iii) how neural networks could be expanded further to resolve problems relevant to medical imaging. In the concluding section, a highlight of comparisons among many neural network applications is included to provide a global view on computational intelligence with neural networks in medical imaging. Copyright © 2010 Elsevier Ltd. All rights reserved.
Fast network centrality analysis using GPUs
Directory of Open Access Journals (Sweden)
Shi Zhiao
2011-05-01
Full Text Available Abstract Background With the exploding volume of data generated by continuously evolving high-throughput technologies, biological network analysis problems are growing larger in scale and craving for more computational power. General Purpose computation on Graphics Processing Units (GPGPU provides a cost-effective technology for the study of large-scale biological networks. Designing algorithms that maximize data parallelism is the key in leveraging the power of GPUs. Results We proposed an efficient data parallel formulation of the All-Pairs Shortest Path problem, which is the key component for shortest path-based centrality computation. A betweenness centrality algorithm built upon this formulation was developed and benchmarked against the most recent GPU-based algorithm. Speedup between 11 to 19% was observed in various simulated scale-free networks. We further designed three algorithms based on this core component to compute closeness centrality, eccentricity centrality and stress centrality. To make all these algorithms available to the research community, we developed a software package gpu-fan (GPU-based Fast Analysis of Networks for CUDA enabled GPUs. Speedup of 10-50× compared with CPU implementations was observed for simulated scale-free networks and real world biological networks. Conclusions gpu-fan provides a significant performance improvement for centrality computation in large-scale networks. Source code is available under the GNU Public License (GPL at http://bioinfo.vanderbilt.edu/gpu-fan/.
Multilevel method for modeling large-scale networks.
Energy Technology Data Exchange (ETDEWEB)
Safro, I. M. (Mathematics and Computer Science)
2012-02-24
Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from
A Method for Automated Planning of FTTH Access Network Infrastructures
DEFF Research Database (Denmark)
Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun
2005-01-01
In this paper a method for automated planning of Fiber to the Home (FTTH) access networks is proposed. We introduced a systematic approach for planning access network infrastructure. The GIS data and a set of algorithms were employed to make the planning process more automatic. The method explains...
DETECTING NETWORK ATTACKS IN COMPUTER NETWORKS BY USING DATA MINING METHODS
Platonov, V. V.; Semenov, P. O.
2016-01-01
The article describes an approach to the development of an intrusion detection system for computer networks. It is shown that the usage of several data mining methods and tools can improve the efficiency of protection computer networks against network at-tacks due to the combination of the benefits of signature detection and anomalies detection and the opportunity of adaptation the sys-tem for hardware and software structure of the computer network.
Using Granular-Evidence-Based Adaptive Networks for Sensitivity Analysis
Vališevskis, A.
2002-01-01
This paper considers the possibility of using adaptive networks for sensitivity analysis. Adaptive network that processes fuzzy granules is described. The adaptive network training algorithm can be used for sensitivity analysis of decision making models. Furthermore, a case study concerning sensitivity analysis is described, which shows in what way the adaptive network can be used for sensitivity analysis.
Anomaly-based Network Intrusion Detection Methods
Directory of Open Access Journals (Sweden)
Pavel Nevlud
2013-01-01
Full Text Available The article deals with detection of network anomalies. Network anomalies include everything that is quite different from the normal operation. For detection of anomalies were used machine learning systems. Machine learning can be considered as a support or a limited type of artificial intelligence. A machine learning system usually starts with some knowledge and a corresponding knowledge organization so that it can interpret, analyse, and test the knowledge acquired. There are several machine learning techniques available. We tested Decision tree learning and Bayesian networks. The open source data-mining framework WEKA was the tool we used for testing the classify, cluster, association algorithms and for visualization of our results. The WEKA is a collection of machine learning algorithms for data mining tasks.
Mean field methods for cortical network dynamics
DEFF Research Database (Denmark)
Hertz, J.; Lerchner, Alexander; Ahmadi, M.
2004-01-01
We review the use of mean field theory for describing the dynamics of dense, randomly connected cortical circuits. For a simple network of excitatory and inhibitory leaky integrate- and-fire neurons, we can show how the firing irregularity, as measured by the Fano factor, increases...... with the strength of the synapses in the network and with the value to which the membrane potential is reset after a spike. Generalizing the model to include conductance-based synapses gives insight into the connection between the firing statistics and the high- conductance state observed experimentally in visual...
Analysis of the experimental positron lifetime spectra by neural networks
Directory of Open Access Journals (Sweden)
Avdić Senada
2003-01-01
Full Text Available This paper deals with the analysis of experimental positron lifetime spectra in polymer materials by using various algorithms of neural networks. A method based on the use of artificial neural networks for unfolding the mean lifetime and intensity of the spectral components of simulated positron lifetime spectra was previously suggested and tested on simulated data [Pžzsitetal, Applied Surface Science, 149 (1998, 97]. In this work, the applicability of the method to the analysis of experimental positron spectra has been verified in the case of spectra from polymer materials with three components. It has been demonstrated that the backpropagation neural network can determine the spectral parameters with a high accuracy and perform the decomposi-tion of lifetimes which differ by 10% or more. The backpropagation network has not been suitable for the identification of both the parameters and the number of spectral components. Therefore, a separate artificial neural network module has been designed to solve the classification problem. Module types based on self-organizing map and learning vector quantization algorithms have been tested. The learning vector quantization algorithm was found to have better performance and reliability. A complete artificial neural network analysis tool of positron lifetime spectra has been constructed to include a spectra classification module and parameter evaluation modules for spectra with a different number of components. In this way, both flexibility and high resolution can be achieved.
On the Optimality of Trust Network Analysis with Subjective Logic
Directory of Open Access Journals (Sweden)
PARK, Y.
2014-08-01
Full Text Available Building and measuring trust is one of crucial aspects in e-commerce, social networking and computer security. Trust networks are widely used to formalize trust relationships and to conduct formal reasoning of trust values. Diverse trust network analysis methods have been developed so far and one of the most widely used schemes is TNA-SL (Trust Network Analysis with Subjective Logic. Recent papers claimed that TNA-SL always finds the optimal solution by producing the least uncertainty. In this paper, we present some counter-examples, which imply that TNA-SL is not an optimal algorithm. Furthermore, we present a probabilistic algorithm in edge splitting to minimize uncertainty.
Using analytic network process for evaluating mobile text entry methods.
Ocampo, Lanndon A; Seva, Rosemary R
2016-01-01
This paper highlights a preference evaluation methodology for text entry methods in a touch keyboard smartphone using analytic network process (ANP). Evaluation of text entry methods in literature mainly considers speed and accuracy. This study presents an alternative means for selecting text entry method that considers user preference. A case study was carried out with a group of experts who were asked to develop a selection decision model of five text entry methods. The decision problem is flexible enough to reflect interdependencies of decision elements that are necessary in describing real-life conditions. Results showed that QWERTY method is more preferred than other text entry methods while arrangement of keys is the most preferred criterion in characterizing a sound method. Sensitivity analysis using simulation of normally distributed random numbers under fairly large perturbation reported the foregoing results reliable enough to reflect robust judgment. The main contribution of this paper is the introduction of a multi-criteria decision approach in the preference evaluation of text entry methods. Copyright © 2015 Elsevier Ltd and The Ergonomics Society. All rights reserved.
Usage of Modified Holt-Winters Method in the Anomaly Detection of Network Traffic: Case Studies
Directory of Open Access Journals (Sweden)
Maciej Szmit
2012-01-01
Full Text Available The traditional Holt-Winters method is used, among others, in behavioural analysis of network traffic for development of adaptive models for various types of traffic in sample computer networks. This paper is devoted to the application of extended versions of these models for development of predicted templates and intruder detection.
Usage of Modified Holt-Winters Method in the Anomaly Detection of Network Traffic: Case Studies
Maciej Szmit; Anna Szmit
2012-01-01
The traditional Holt-Winters method is used, among others, in behavioural analysis of network traffic for development of adaptive models for various types of traffic in sample computer networks. This paper is devoted to the application of extended versions of these models for development of predicted templates and intruder detection.
Heuristic urban transportation network design method, a multilayer coevolution approach
Ding, Rui; Ujang, Norsidah; Hamid, Hussain bin; Manan, Mohd Shahrudin Abd; Li, Rong; Wu, Jianjun
2017-08-01
The design of urban transportation networks plays a key role in the urban planning process, and the coevolution of urban networks has recently garnered significant attention in literature. However, most of these recent articles are based on networks that are essentially planar. In this research, we propose a heuristic multilayer urban network coevolution model with lower layer network and upper layer network that are associated with growth and stimulate one another. We first use the relative neighbourhood graph and the Gabriel graph to simulate the structure of rail and road networks, respectively. With simulation we find that when a specific number of nodes are added, the total travel cost ratio between an expanded network and the initial lower layer network has the lowest value. The cooperation strength Λ and the changeable parameter average operation speed ratio Θ show that transit users' route choices change dramatically through the coevolution process and that their decisions, in turn, affect the multilayer network structure. We also note that the simulated relation between the Gini coefficient of the betweenness centrality, Θ and Λ have an optimal point for network design. This research could inspire the analysis of urban network topology features and the assessment of urban growth trends.
Directory of Open Access Journals (Sweden)
Ji Wei
2010-10-01
Full Text Available Abstract Background Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are used to discretize microarray data. Selection of the discretization method is often arbitrary and no systematic comparison of different discretization has been conducted, in the context of gene regulatory network inference from time series gene expression data. Results In this study, we propose a new discretization method "bikmeans", and compare its performance with four other widely-used discretization methods using different datasets, modeling algorithms and number of intervals. Sensitivities, specificities and total accuracies were calculated and statistical analysis was carried out. Bikmeans method always gave high total accuracies. Conclusions Our results indicate that proper discretization methods can consistently improve gene regulatory network inference independent of network modeling algorithms and datasets. Our new method, bikmeans, resulted in significant better total accuracies than other methods.
An image segmentation method based on network clustering model
Jiao, Yang; Wu, Jianshe; Jiao, Licheng
2018-01-01
Network clustering phenomena are ubiquitous in nature and human society. In this paper, a method involving a network clustering model is proposed for mass segmentation in mammograms. First, the watershed transform is used to divide an image into regions, and features of the image are computed. Then a graph is constructed from the obtained regions and features. The network clustering model is applied to realize clustering of nodes in the graph. Compared with two classic methods, the algorithm based on the network clustering model performs more effectively in experiments.
Maroco, João; Silva, Dina; Rodrigues, Ana; Guerreiro, Manuela; Santana, Isabel; de Mendonça, Alexandre
2011-08-17
Dementia and cognitive impairment associated with aging are a major medical and social concern. Neuropsychological testing is a key element in the diagnostic procedures of Mild Cognitive Impairment (MCI), but has presently a limited value in the prediction of progression to dementia. We advance the hypothesis that newer statistical classification methods derived from data mining and machine learning methods like Neural Networks, Support Vector Machines and Random Forests can improve accuracy, sensitivity and specificity of predictions obtained from neuropsychological testing. Seven non parametric classifiers derived from data mining methods (Multilayer Perceptrons Neural Networks, Radial Basis Function Neural Networks, Support Vector Machines, CART, CHAID and QUEST Classification Trees and Random Forests) were compared to three traditional classifiers (Linear Discriminant Analysis, Quadratic Discriminant Analysis and Logistic Regression) in terms of overall classification accuracy, specificity, sensitivity, Area under the ROC curve and Press'Q. Model predictors were 10 neuropsychological tests currently used in the diagnosis of dementia. Statistical distributions of classification parameters obtained from a 5-fold cross-validation were compared using the Friedman's nonparametric test. Press' Q test showed that all classifiers performed better than chance alone (p classification accuracy (Median (Me) = 0.76) an area under the ROC (Me = 0.90). However this method showed high specificity (Me = 1.0) but low sensitivity (Me = 0.3). Random Forest ranked second in overall accuracy (Me = 0.73) with high area under the ROC (Me = 0.73) specificity (Me = 0.73) and sensitivity (Me = 0.64). Linear Discriminant Analysis also showed acceptable overall accuracy (Me = 0.66), with acceptable area under the ROC (Me = 0.72) specificity (Me = 0.66) and sensitivity (Me = 0.64). The remaining classifiers showed overall classification accuracy above a median value of 0.63, but for most
Directory of Open Access Journals (Sweden)
De-Xin Yu
2013-01-01
Full Text Available Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.
AN IMPROVEMENT ON GEOMETRY-BASED METHODS FOR GENERATION OF NETWORK PATHS FROM POINTS
Directory of Open Access Journals (Sweden)
Z. Akbari
2014-10-01
Full Text Available Determining network path is important for different purposes such as determination of road traffic, the average speed of vehicles, and other network analysis. One of the required input data is information about network path. Nevertheless, the data collected by the positioning systems often lead to the discrete points. Conversion of these points to the network path have become one of the challenges which different researchers, presents many ways for solving it. This study aims at investigating geometry-based methods to estimate the network paths from the obtained points and improve an existing point to curve method. To this end, some geometry-based methods have been studied and an improved method has been proposed by applying conditions on the best method after describing and illustrating weaknesses of them.
Social network analysis of study environment
Directory of Open Access Journals (Sweden)
Blaženka Divjak
2010-06-01
Full Text Available Student working environment influences student learning and achievement level. In this respect social aspects of students’ formal and non-formal learning play special role in learning environment. The main research problem of this paper is to find out if students' academic performance influences their position in different students' social networks. Further, there is a need to identify other predictors of this position. In the process of problem solving we use the Social Network Analysis (SNA that is based on the data we collected from the students at the Faculty of Organization and Informatics, University of Zagreb. There are two data samples: in the basic sample N=27 and in the extended sample N=52. We collected data on social-demographic position, academic performance, learning and motivation styles, student status (full-time/part-time, attitudes towards individual and teamwork as well as informal cooperation. Afterwards five different networks (exchange of learning materials, teamwork, informal communication, basic and aggregated social network were constructed. These networks were analyzed with different metrics and the most important were betweenness, closeness and degree centrality. The main result is, firstly, that the position in a social network cannot be forecast only by academic success and, secondly, that part-time students tend to form separate groups that are poorly connected with full-time students. In general, position of a student in social networks in study environment can influence student learning as well as her/his future employability and therefore it is worthwhile to be investigated.
Directory of Open Access Journals (Sweden)
Firoozeh Zare-Farashbandi
2014-01-01
Full Text Available Background: Co-authorship is one of the most tangible forms of research collaboration. A co-authorship network is a social network in which the authors through participation in one or more publication through an indirect path have linked to each other. The present research using the social network analysis studied co-authorship network of 681 articles published in Journal of Research in Medical Sciences (JRMS during 2008-2012. Materials and Methods: The study was carried out with the scientometrics approach and using co-authorship network analysis of authors. The topology of the co-authorship network of 681 published articles in JRMS between 2008 and 2012 was analyzed using macro-level metrics indicators of network analysis such as density, clustering coefficient, components and mean distance. In addition, in order to evaluate the performance of each authors and countries in the network, the micro-level indicators such as degree centrality, closeness centrality and betweenness centrality as well as productivity index were used. The UCINET and NetDraw softwares were used to draw and analyze the co-authorship network of the papers. Results: The assessment of the authors productivity in this journal showed that the first ranks were belonged to only five authors, respectively. Furthermore, analysis of the co-authorship of the authors in the network demonstrated that in the betweenness centrality index, three authors of them had the good position in the network. They can be considered as the network leaders able to control the flow of information in the network compared with the other members based on the shortest paths. On the other hand, the key role of the network according to the productivity and centrality indexes was belonged to Iran, Malaysia and United States of America. Conclusion: Co-authorship network of JRMS has the characteristics of a small world network. In addition, the theory of 6° separation is valid in this network was also true.
Dynamic baseline detection method for power data network service
Chen, Wei
2017-08-01
This paper proposes a dynamic baseline Traffic detection Method which is based on the historical traffic data for the Power data network. The method uses Cisco's NetFlow acquisition tool to collect the original historical traffic data from network element at fixed intervals. This method uses three dimensions information including the communication port, time, traffic (number of bytes or number of packets) t. By filtering, removing the deviation value, calculating the dynamic baseline value, comparing the actual value with the baseline value, the method can detect whether the current network traffic is abnormal.
Tensor Fusion Network for Multimodal Sentiment Analysis
Zadeh, Amir; Chen, Minghai; Poria, Soujanya; Cambria, Erik; Morency, Louis-Philippe
2017-01-01
Multimodal sentiment analysis is an increasingly popular research area, which extends the conventional language-based definition of sentiment analysis to a multimodal setup where other relevant modalities accompany language. In this paper, we pose the problem of multimodal sentiment analysis as modeling intra-modality and inter-modality dynamics. We introduce a novel model, termed Tensor Fusion Network, which learns both such dynamics end-to-end. The proposed approach is tailored for the vola...
Network analysis of eight industrial symbiosis systems
Zhang, Yan; Zheng, Hongmei; Shi, Han; Yu, Xiangyi; Liu, Gengyuan; Su, Meirong; Li, Yating; Chai, Yingying
2016-06-01
Industrial symbiosis is the quintessential characteristic of an eco-industrial park. To divide parks into different types, previous studies mostly focused on qualitative judgments, and failed to use metrics to conduct quantitative research on the internal structural or functional characteristics of a park. To analyze a park's structural attributes, a range of metrics from network analysis have been applied, but few researchers have compared two or more symbioses using multiple metrics. In this study, we used two metrics (density and network degree centralization) to compare the degrees of completeness and dependence of eight diverse but representative industrial symbiosis networks. Through the combination of the two metrics, we divided the networks into three types: weak completeness, and two forms of strong completeness, namely "anchor tenant" mutualism and "equality-oriented" mutualism. The results showed that the networks with a weak degree of completeness were sparse and had few connections among nodes; for "anchor tenant" mutualism, the degree of completeness was relatively high, but the affiliated members were too dependent on core members; and the members in "equality-oriented" mutualism had equal roles, with diverse and flexible symbiotic paths. These results revealed some of the systems' internal structure and how different structures influenced the exchanges of materials, energy, and knowledge among members of a system, thereby providing insights into threats that may destabilize the network. Based on this analysis, we provide examples of the advantages and effectiveness of recent improvement projects in a typical Chinese eco-industrial park (Shandong Lubei).
Disclosing Sexual Assault Within Social Networks: A Mixed-Method Investigation.
Dworkin, Emily R; Pittenger, Samantha L; Allen, Nicole E
2016-03-01
Most survivors of sexual assault disclose their experiences within their social networks, and these disclosure decisions can have important implications for their entry into formal systems and well-being, but no research has directly examined these networks as a strategy to understand disclosure decisions. Using a mixed-method approach that combined survey data, social network analysis, and interview data, we investigate whom, among potential informal responders in the social networks of college students who have experienced sexual assault, survivors contact regarding their assault, and how survivors narrate the role of networks in their decisions about whom to contact. Quantitative results suggest that characteristics of survivors, their social networks, and members of these networks are associated with disclosure decisions. Using data from social network analysis, we identified that survivors tended to disclose to a smaller proportion of their network when many network members had relationships with each other or when the network had more subgroups. Our qualitative analysis helps to contextualize these findings. © Society for Community Research and Action 2016.
Automated Analysis of Security in Networking Systems
DEFF Research Database (Denmark)
Buchholtz, Mikael
2004-01-01
It has for a long time been a challenge to built secure networking systems. One way to counter this problem is to provide developers of software applications for networking systems with easy-to-use tools that can check security properties before the applications ever reach the marked. These tools...... will both help raise the general level of awareness of the problems and prevent the most basic flaws from occurring. This thesis contributes to the development of such tools. Networking systems typically try to attain secure communication by applying standard cryptographic techniques. In this thesis...... attacks, and attacks launched by insiders. Finally, the perspectives for the application of the analysis techniques are discussed, thereby, coming a small step closer to providing developers with easy- to-use tools for validating the security of networking applications....
Methods in algorithmic analysis
Dobrushkin, Vladimir A
2009-01-01
…helpful to any mathematics student who wishes to acquire a background in classical probability and analysis … This is a remarkably beautiful book that would be a pleasure for a student to read, or for a teacher to make into a year's course.-Harvey Cohn, Computing Reviews, May 2010
Complementing Gender Analysis Methods.
Kumar, Anant
2016-01-01
The existing gender analysis frameworks start with a premise that men and women are equal and should be treated equally. These frameworks give emphasis on equal distribution of resources between men and women and believe that this will bring equality which is not always true. Despite equal distribution of resources, women tend to suffer and experience discrimination in many areas of their lives such as the power to control resources within social relationships, and the need for emotional security and reproductive rights within interpersonal relationships. These frameworks believe that patriarchy as an institution plays an important role in women's oppression, exploitation, and it is a barrier in their empowerment and rights. Thus, some think that by ensuring equal distribution of resources and empowering women economically, institutions like patriarchy can be challenged. These frameworks are based on proposed equality principle which puts men and women in competing roles. Thus, the real equality will never be achieved. Contrary to the existing gender analysis frameworks, the Complementing Gender Analysis framework proposed by the author provides a new approach toward gender analysis which not only recognizes the role of economic empowerment and equal distribution of resources but suggests to incorporate the concept and role of social capital, equity, and doing gender in gender analysis which is based on perceived equity principle, putting men and women in complementing roles that may lead to equality. In this article the author reviews the mainstream gender theories in development from the viewpoint of the complementary roles of gender. This alternative view is argued based on existing literature and an anecdote of observations made by the author. While criticizing the equality theory, the author offers equity theory in resolving the gender conflict by using the concept of social and psychological capital.
Improving Family Forest Knowledge Transfer through Social Network Analysis
Gorczyca, Erika L.; Lyons, Patrick W.; Leahy, Jessica E.; Johnson, Teresa R.; Straub, Crista L.
2012-01-01
To better engage Maine's family forest landowners our study used social network analysis: a computational social science method for identifying stakeholders, evaluating models of engagement, and targeting areas for enhanced partnerships. Interviews with researchers associated with a research center were conducted to identify how social network…
Characterizing naval team readiness through social network analysis
Schraagen, J.M.C.; Post, W.M.
2014-01-01
Characterizing a team’s level of readiness in an efficient and objective way is important for organizations such as the military. Current methods to characterize real-time team interaction know limitations that may be addressed by social network analysis techniques. The purpose of the current field
Evolutionary method for finding communities in bipartite networks
Zhan, Weihua; Zhang, Zhongzhi; Guan, Jihong; Zhou, Shuigeng
2011-06-01
An important step in unveiling the relation between network structure and dynamics defined on networks is to detect communities, and numerous methods have been developed separately to identify community structure in different classes of networks, such as unipartite networks, bipartite networks, and directed networks. Here, we show that the finding of communities in such networks can be unified in a general framework—detection of community structure in bipartite networks. Moreover, we propose an evolutionary method for efficiently identifying communities in bipartite networks. To this end, we show that both unipartite and directed networks can be represented as bipartite networks, and their modularity is completely consistent with that for bipartite networks, the detection of modular structure on which can be reformulated as modularity maximization. To optimize the bipartite modularity, we develop a modified adaptive genetic algorithm (MAGA), which is shown to be especially efficient for community structure detection. The high efficiency of the MAGA is based on the following three improvements we make. First, we introduce a different measure for the informativeness of a locus instead of the standard deviation, which can exactly determine which loci mutate. This measure is the bias between the distribution of a locus over the current population and the uniform distribution of the locus, i.e., the Kullback-Leibler divergence between them. Second, we develop a reassignment technique for differentiating the informative state a locus has attained from the random state in the initial phase. Third, we present a modified mutation rule which by incorporating related operations can guarantee the convergence of the MAGA to the global optimum and can speed up the convergence process. Experimental results show that the MAGA outperforms existing methods in terms of modularity for both bipartite and unipartite networks.
2010-10-01
Organizational network analysis (ONA) consists of gathering data on information sharing and : connectivity in a group, calculating network measures, creating network maps, and using this : information to analyze and improve the functionality of the g...
Reduction Method for Active Distribution Networks
DEFF Research Database (Denmark)
Raboni, Pietro; Chen, Zhe
2013-01-01
On-line security assessment is traditionally performed by Transmission System Operators at the transmission level, ignoring the effective response of distributed generators and small loads. On the other hand the required computation time and amount of real time data for including Distribution Net...... by comparing the results obtained in PSCAD® with the detailed network model and with the reduced one. Moreover the control schemes of a wind turbine and a photovoltaic plant included in the detailed network model are described.......On-line security assessment is traditionally performed by Transmission System Operators at the transmission level, ignoring the effective response of distributed generators and small loads. On the other hand the required computation time and amount of real time data for including Distribution...
Developing an intelligence analysis process through social network analysis
Waskiewicz, Todd; LaMonica, Peter
2008-04-01
Intelligence analysts are tasked with making sense of enormous amounts of data and gaining an awareness of a situation that can be acted upon. This process can be extremely difficult and time consuming. Trying to differentiate between important pieces of information and extraneous data only complicates the problem. When dealing with data containing entities and relationships, social network analysis (SNA) techniques can be employed to make this job easier. Applying network measures to social network graphs can identify the most significant nodes (entities) and edges (relationships) and help the analyst further focus on key areas of concern. Strange developed a model that identifies high value targets such as centers of gravity and critical vulnerabilities. SNA lends itself to the discovery of these high value targets and the Air Force Research Laboratory (AFRL) has investigated several network measures such as centrality, betweenness, and grouping to identify centers of gravity and critical vulnerabilities. Using these network measures, a process for the intelligence analyst has been developed to aid analysts in identifying points of tactical emphasis. Organizational Risk Analyzer (ORA) and Terrorist Modus Operandi Discovery System (TMODS) are the two applications used to compute the network measures and identify the points to be acted upon. Therefore, the result of leveraging social network analysis techniques and applications will provide the analyst and the intelligence community with more focused and concentrated analysis results allowing them to more easily exploit key attributes of a network, thus saving time, money, and manpower.
Classification Method in Integrated Information Network Using Vector Image Comparison
Directory of Open Access Journals (Sweden)
Zhou Yuan
2014-05-01
Full Text Available Wireless Integrated Information Network (WMN consists of integrated information that can get data from its surrounding, such as image, voice. To transmit information, large resource is required which decreases the service time of the network. In this paper we present a Classification Approach based on Vector Image Comparison (VIC for WMN that improve the service time of the network. The available methods for sub-region selection and conversion are also proposed.
Directory of Open Access Journals (Sweden)
WenJun Zhang
2016-06-01
Full Text Available Some networks, including biological networks, consist of hierarchical sub-networks / modules. Based on my previous study, in present study a method for both identifying hierarchical sub-networks / modules and weighting network links is proposed. It is based on the cluster analysis in which between-node similarity in sets of adjacency nodes is used. Two matrices, linkWeightMat and linkClusterIDs, are achieved by using the algorithm. Two links with both the same weight in linkWeightMat and the same cluster ID in linkClusterIDs belong to the same sub-network / module. Two links with the same weight in linkWeightMat but different cluster IDs in linkClusterIDs belong to two sub-networks / modules at the same hirarchical level. However, a link with an unique cluster ID in linkClusterIDs does not belong to any sub-networks / modules. A sub-network / module of the greater weight is the more connected sub-network / modules. Matlab codes of the algorithm are presented.
Spectral Methods for Immunization of Large Networks
Directory of Open Access Journals (Sweden)
Muhammad Ahmad
2017-11-01
Full Text Available Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a node which in turn infects its neighbour nodes and this may trigger an epidemic in the whole graph. The goal thus is to select the best k nodes (budget constraint that are immunized (vaccinated, screened, filtered so as the remaining graph is less prone to the epidemic. It is known that the problem is, in all practical models, computationally intractable even for moderate sized graphs. In this paper we employ ideas from spectral graph theory to define relevance and importance of nodes. Using novel graph theoretic techniques, we then design an efficient approximation algorithm to immunize the graph. Theoretical guarantees on the running time of our algorithm show that it is more efficient than any other known solution in the literature. We test the performance of our algorithm on several real world graphs. Experiments show that our algorithm scales well for large graphs and outperforms state of the art algorithms both in quality (containment of epidemic and efficiency (runtime and space complexity.
Semigroup methods for evolution equations on networks
Mugnolo, Delio
2014-01-01
This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations. Yet the topic of differential equations on graphs, ramified spaces, and more general network-like objects has recently gained significant momentum and, well beyond the confines of mathematics, there is a lively interdisciplinary discourse on all aspects of so-called complex networks. Such network-like structures can be found in virtually all branches of science, engineering and the humanities, and future research thus calls for solid theoretical foundations. This book is specifically devoted to the study of evolution equations – i.e., of time-dependent differential equations such as the heat equation, the wave equation, or the Schrödinger equation (quantum graphs) – bearing in mind that the majority of the literature in the last ten years on the subject of differential equations of graphs has been devoted to ellip...
Methods for extracting social network data from chatroom logs
Osesina, O. Isaac; McIntire, John P.; Havig, Paul R.; Geiselman, Eric E.; Bartley, Cecilia; Tudoreanu, M. Eduard
2012-06-01
Identifying social network (SN) links within computer-mediated communication platforms without explicit relations among users poses challenges to researchers. Our research aims to extract SN links in internet chat with multiple users engaging in synchronous overlapping conversations all displayed in a single stream. We approached this problem using three methods which build on previous research. Response-time analysis builds on temporal proximity of chat messages; word context usage builds on keywords analysis and direct addressing which infers links by identifying the intended message recipient from the screen name (nickname) referenced in the message [1]. Our analysis of word usage within the chat stream also provides contexts for the extracted SN links. To test the capability of our methods, we used publicly available data from Internet Relay Chat (IRC), a real-time computer-mediated communication (CMC) tool used by millions of people around the world. The extraction performances of individual methods and their hybrids were assessed relative to a ground truth (determined a priori via manual scoring).
Bandwidth Analysis of Smart Meter Network Infrastructure
DEFF Research Database (Denmark)
Balachandran, Kardi; Olsen, Rasmus Løvenstein; Pedersen, Jens Myrup
2014-01-01
Advanced Metering Infrastructure (AMI) is a net-work infrastructure in Smart Grid, which links the electricity customers to the utility company. This network enables smart services by making it possible for the utility company to get an overview of their customers power consumption and also control...... to utilize smart meters and which existing broadband network technologies can facilitate this smart meter service. Initially, scenarios for smart meter infrastructure are identified. The paper defines abstraction models which cover the AMI scenarios. When the scenario has been identified a general overview...... of the bandwidth requirements are analysed. For this analysis the assumptions and limitations are defined. The results obtained by the analysis show, that the amount of data collected and transferred by a smart meter is very low compared to the available bandwidth of most internet connections. The results show...
Protocol design and analysis for cooperative wireless networks
Song, Wei; Jin, A-Long
2017-01-01
This book focuses on the design and analysis of protocols for cooperative wireless networks, especially at the medium access control (MAC) layer and for crosslayer design between the MAC layer and the physical layer. It highlights two main points that are often neglected in other books: energy-efficiency and spatial random distribution of wireless devices. Effective methods in stochastic geometry for the design and analysis of wireless networks are also explored. After providing a comprehensive review of existing studies in the literature, the authors point out the challenges that are worth further investigation. Then, they introduce several novel solutions for cooperative wireless network protocols that reduce energy consumption and address spatial random distribution of wireless nodes. For each solution, the book offers a clear system model and problem formulation, details of the proposed cooperative schemes, comprehensive performance analysis, and extensive numerical and simulation results that validate th...
Diagrammatic perturbation methods in networks and sports ranking combinatorics
Park, Juyong
2010-04-01
Analytic and computational tools developed in statistical physics are being increasingly applied to the study of complex networks. Here we present recent developments in the diagrammatic perturbation methods for the exponential random graph models, and apply them to the combinatoric problem of determining the ranking of nodes in directed networks that represent pairwise competitions.
Diversity Performance Analysis on Multiple HAP Networks
Directory of Open Access Journals (Sweden)
Feihong Dong
2015-06-01
Full Text Available One of the main design challenges in wireless sensor networks (WSNs is achieving a high-data-rate transmission for individual sensor devices. The high altitude platform (HAP is an important communication relay platform for WSNs and next-generation wireless networks. Multiple-input multiple-output (MIMO techniques provide the diversity and multiplexing gain, which can improve the network performance effectively. In this paper, a virtual MIMO (V-MIMO model is proposed by networking multiple HAPs with the concept of multiple assets in view (MAV. In a shadowed Rician fading channel, the diversity performance is investigated. The probability density function (PDF and cumulative distribution function (CDF of the received signal-to-noise ratio (SNR are derived. In addition, the average symbol error rate (ASER with BPSK and QPSK is given for the V-MIMO model. The system capacity is studied for both perfect channel state information (CSI and unknown CSI individually. The ergodic capacity with various SNR and Rician factors for different network configurations is also analyzed. The simulation results validate the effectiveness of the performance analysis. It is shown that the performance of the HAPs network in WSNs can be significantly improved by utilizing the MAV to achieve overlapping coverage, with the help of the V-MIMO techniques.
Nonlinear Time Series Analysis via Neural Networks
Volná, Eva; Janošek, Michal; Kocian, Václav; Kotyrba, Martin
This article deals with a time series analysis based on neural networks in order to make an effective forex market [Moore and Roche, J. Int. Econ. 58, 387-411 (2002)] pattern recognition. Our goal is to find and recognize important patterns which repeatedly appear in the market history to adapt our trading system behaviour based on them.
Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.
Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing
2017-01-01
Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.
Protocol vulnerability detection based on network traffic analysis and binary reverse engineering.
Directory of Open Access Journals (Sweden)
Shameng Wen
Full Text Available Network protocol vulnerability detection plays an important role in many domains, including protocol security analysis, application security, and network intrusion detection. In this study, by analyzing the general fuzzing method of network protocols, we propose a novel approach that combines network traffic analysis with the binary reverse engineering method. For network traffic analysis, the block-based protocol description language is introduced to construct test scripts, while the binary reverse engineering method employs the genetic algorithm with a fitness function designed to focus on code coverage. This combination leads to a substantial improvement in fuzz testing for network protocols. We build a prototype system and use it to test several real-world network protocol implementations. The experimental results show that the proposed approach detects vulnerabilities more efficiently and effectively than general fuzzing methods such as SPIKE.
Reconstructing networks of pathways via significance analysis of their intersections
Directory of Open Access Journals (Sweden)
Francesconi Mirko
2008-04-01
Full Text Available Abstract Background Significance analysis at single gene level may suffer from the limited number of samples and experimental noise that can severely limit the power of the chosen statistical test. This problem is typically approached by applying post hoc corrections to control the false discovery rate, without taking into account prior biological knowledge. Pathway or gene ontology analysis can provide an alternative way to relax the significance threshold applied to single genes and may lead to a better biological interpretation. Results Here we propose a new analysis method based on the study of networks of pathways. These networks are reconstructed considering both the significance of single pathways (network nodes and the intersection between them (links. We apply this method for the reconstruction of networks of pathways to two gene expression datasets: the first one obtained from a c-Myc rat fibroblast cell line expressing a conditional Myc-estrogen receptor oncoprotein; the second one obtained from the comparison of Acute Myeloid Leukemia and Acute Lymphoblastic Leukemia derived from bone marrow samples. Conclusion Our method extends statistical models that have been recently adopted for the significance analysis of functional groups of genes to infer links between these groups. We show that groups of genes at the interface between different pathways can be considered as relevant even if the pathways they belong to are not significant by themselves.
2014-01-01
Background Networks are increasingly regarded as essential in health research aimed at influencing practice and policies. Less research has focused on the role networking can play in researchers’ careers and its broader impacts on capacity strengthening in health research. We used the Canadian Coalition for Global Health Research (CCGHR) annual Summer Institute for New Global Health Researchers (SIs) as an opportunity to explore networking among new global health researchers. Methods A mixed-methods exploratory study was conducted among SI alumni and facilitators who had participated in at least one SI between 2004 and 2010. Alumni and facilitators completed an online short questionnaire, and a subset participated in an in-depth interview. Thematic analysis of the qualitative data was triangulated with quantitative results and CCGHR reports on SIs. Synthesis occurred through the development of a process model relevant to networking through the SIs. Results Through networking at the SIs, participants experienced decreased isolation and strengthened working relationships. Participants accessed new knowledge, opportunities, and resources through networking during the SI. Post-SI, participants reported ongoing contact and collaboration, although most participants desired more opportunities for interaction. They made suggestions for structural supports to networking among new global health researchers. Conclusions Networking at the SI contributed positively to opportunities for individuals, and contributed to the formation of a network of global health researchers. Intentional inclusion of networking in health research capacity strengthening initiatives, with supportive resources and infrastructure could create dynamic, sustainable networks accessible to global health researchers around the world. PMID:24460819
A systemic method for evaluating the potential impacts of floods on network infrastructures
Directory of Open Access Journals (Sweden)
J. Eleutério
2013-04-01
Full Text Available Understanding network infrastructures and their operation under exceptional circumstances is fundamental for dealing with flood risks and improving the resilience of a territory. This work presents a method for evaluating potential network infrastructure dysfunctions and damage in cases of flooding. In contrast to existing approaches, this method analyses network infrastructures on an elementary scale, by considering networks as a group of elements with specific functions and individual vulnerabilities. Our analysis places assets at the centre of the evaluation process, resulting in the construction of damage-dysfunction matrices based on expert interviews. These matrices permit summarising the different vulnerabilities of network infrastructures, describing how the different components are linked to each other and how they can disrupt the operation of the network. They also identify the actions and resources needed to restore the system to operational status following damage and dysfunctions, an essential point when dealing with the question of resilience. The method promotes multi-network analyses and is illustrated by a French case study. Sixty network experts were interviewed during the analysis of the following networks: drinking water supply, waste water, public lighting, gas distribution and electricity supply.
Experimental method to predict avalanches based on neural networks
Directory of Open Access Journals (Sweden)
V. V. Zhdanov
2016-01-01
Full Text Available The article presents results of experimental use of currently available statistical methods to classify the avalanche‑dangerous precipitations and snowfalls in the Kishi Almaty river basin. The avalanche service of Kazakhstan uses graphical methods for prediction of avalanches developed by I.V. Kondrashov and E.I. Kolesnikov. The main objective of this work was to develop a modern model that could be used directly at the avalanche stations. Classification of winter precipitations into dangerous snowfalls and non‑dangerous ones was performed by two following ways: the linear discriminant function (canonical analysis and artificial neural networks. Observational data on weather and avalanches in the gorge Kishi Almaty in the gorge Kishi Almaty were used as a training sample. Coefficients for the canonical variables were calculated by the software «Statistica» (Russian version 6.0, and then the necessary formula had been constructed. The accuracy of the above classification was 96%. Simulator by the authors L.N. Yasnitsky and F.М. Cherepanov was used to learn the neural networks. The trained neural network demonstrated 98% accuracy of the classification. Prepared statistical models are recommended to be tested at the snow‑avalanche stations. Results of the tests will be used for estimation of the model quality and its readiness for the operational work. In future, we plan to apply these models for classification of the avalanche danger by the five‑point international scale.
Large-Scale Road Network Vulnerability Analysis
Jenelius, Erik
2010-01-01
Disruptions in the transport system can have severe impacts for affected individuals, businesses and the society as a whole. In this research, vulnerability is seen as the risk of unplanned system disruptions, with a focus on large, rare events. Vulnerability analysis aims to provide decision support regarding preventive and restorative actions, ideally as an integrated part of the planning process.The thesis specifically develops the methodology for vulnerability analysis of road networks an...
Center of attention: A network text analysis of American Sniper
Directory of Open Access Journals (Sweden)
Starling Hunter
2016-06-01
Full Text Available Network Text Analysis (NTA is a term used to describe a variety of software - supported methods for modeling texts as networks of concepts. In this study we apply NTA to the screenplay of American Sniper, an Academy Award nominee for Best Adapted Screenplay in 2014. Specifically, we est ablish prior expectations as to the key themes associated with war films. We then empirically test whether words associated with the most influentially - positioned nodes in the network signify themes common to the war - film genre. As predicted, we find tha t words and concepts associated with the least constrained nodes in the text network were significantly more likely to be associated with the war genre and significantly less likely to be associated with genres to which the film did not belong.
Stochastic approach to observability analysis in water networks
Directory of Open Access Journals (Sweden)
S. Díaz
2016-07-01
Full Text Available This work presents an alternative technique to the existing methods for observability analysis (OA in water networks, which is a prior essential step for the implementation of state estimation (SE techniques within such systems. The methodology presented here starts from a known hydraulic state and assumes random gaussian distributions for the uncertainty of some hydraulic variables, which is then propagated to the rest of the system. This process is repeated again to analyze the change in the network uncertainty when metering devices considered as error-free are included, based on which the network observability can be evaluated. The method’s potential is presented in an illustrative example, which shows the additional information that this methodology provides with respect to traditional OA approaches. This proposal allows a better understanding of the network and constitutes a practical tool to prioritize the location of additional meters, thus enhancing the transformation of large urban areas into actual smart cities.
Network Forensics Method Based on Evidence Graph and Vulnerability Reasoning
Directory of Open Access Journals (Sweden)
Jingsha He
2016-11-01
Full Text Available As the Internet becomes larger in scale, more complex in structure and more diversified in traffic, the number of crimes that utilize computer technologies is also increasing at a phenomenal rate. To react to the increasing number of computer crimes, the field of computer and network forensics has emerged. The general purpose of network forensics is to find malicious users or activities by gathering and dissecting firm evidences about computer crimes, e.g., hacking. However, due to the large volume of Internet traffic, not all the traffic captured and analyzed is valuable for investigation or confirmation. After analyzing some existing network forensics methods to identify common shortcomings, we propose in this paper a new network forensics method that uses a combination of network vulnerability and network evidence graph. In our proposed method, we use vulnerability evidence and reasoning algorithm to reconstruct attack scenarios and then backtrack the network packets to find the original evidences. Our proposed method can reconstruct attack scenarios effectively and then identify multi-staged attacks through evidential reasoning. Results of experiments show that the evidence graph constructed using our method is more complete and credible while possessing the reasoning capability.
Semantic Security Methods for Software-Defined Networks
Directory of Open Access Journals (Sweden)
Ekaterina Ju. Antoshina
2017-01-01
Full Text Available Software-defined networking is a promising technology for constructing communication networks where the network management is the software that configures network devices. This contrasts with the traditional point of view where the network behaviour is updated by manual configuration uploading to devices under control. The software controller allows dynamic routing configuration inside the net depending on the quality of service. However, there must be a proof that ensures that every network flow is secure, for example, we can define security policy as follows: confidential nodes can not send data to the public segment of the network. The paper shows how this problem can be solved by using a semantic security model. We propose a method that allows us to construct semantics that captures necessary security properties the network must follow. This involves the specification that states allowed and forbidden network flows. The specification is then modeled as a decision tree that may be reduced. We use the decision tree for semantic construction that captures security requirements. The semantic can be implemented as a module of the controller software so the correctness of the control plane of the network can be ensured on-the-fly.
Bank-firm credit network in Japan: an analysis of a bipartite network.
Marotta, Luca; Miccichè, Salvatore; Fujiwara, Yoshi; Iyetomi, Hiroshi; Aoyama, Hideaki; Gallegati, Mauro; Mantegna, Rosario N
2015-01-01
We investigate the networked nature of the Japanese credit market. Our investigation is performed with tools of network science. In our investigation we perform community detection with an algorithm which is identifying communities composed of both banks and firms. We show that the communities obtained by directly working on the bipartite network carry information about the networked nature of the Japanese credit market. Our analysis is performed for each calendar year during the time period from 1980 to 2011. To investigate the time evolution of the networked structure of the credit market we introduce a new statistical method to track the time evolution of detected communities. We then characterize the time evolution of communities by detecting for each time evolving set of communities the over-expression of attributes of firms and banks. Specifically, we consider as attributes the economic sector and the geographical location of firms and the type of banks. In our 32-year-long analysis we detect a persistence of the over-expression of attributes of communities of banks and firms together with a slow dynamic of changes from some specific attributes to new ones. Our empirical observations show that the credit market in Japan is a networked market where the type of banks, geographical location of firms and banks, and economic sector of the firm play a role in shaping the credit relationships between banks and firms.
CHAI, Lian En; LAW, Chow Kuan; MOHAMAD, Mohd Saberi; CHONG, Chuii Khim; CHOON, Yee Wen; DERIS, Safaai; ILLIAS, Rosli Md
2014-01-01
Background: Gene expression data often contain missing expression values. Therefore, several imputation methods have been applied to solve the missing values, which include k-nearest neighbour (kNN), local least squares (LLS), and Bayesian principal component analysis (BPCA). However, the effects of these imputation methods on the modelling of gene regulatory networks from gene expression data have rarely been investigated and analysed using a dynamic Bayesian network (DBN). Methods: In the present study, we separately imputed datasets of the Escherichia coli S.O.S. DNA repair pathway and the Saccharomyces cerevisiae cell cycle pathway with kNN, LLS, and BPCA, and subsequently used these to generate gene regulatory networks (GRNs) using a discrete DBN. We made comparisons on the basis of previous studies in order to select the gene network with the least error. Results: We found that BPCA and LLS performed better on larger networks (based on the S. cerevisiae dataset), whereas kNN performed better on smaller networks (based on the E. coli dataset). Conclusion: The results suggest that the performance of each imputation method is dependent on the size of the dataset, and this subsequently affects the modelling of the resultant GRNs using a DBN. In addition, on the basis of these results, a DBN has the capacity to discover potential edges, as well as display interactions, between genes. PMID:24876803
Capacity analysis of vehicular communication networks
Lu, Ning
2013-01-01
This SpringerBrief focuses on the network capacity analysis of VANETs, a key topic as fundamental guidance on design and deployment of VANETs is very limited. Moreover, unique characteristics of VANETs impose distinguished challenges on such an investigation. This SpringerBrief first introduces capacity scaling laws for wireless networks and briefly reviews the prior arts in deriving the capacity of VANETs. It then studies the unicast capacity considering the socialized mobility model of VANETs. With vehicles communicating based on a two-hop relaying scheme, the unicast capacity bound is deriv
Historical Network Analysis of the Web
DEFF Research Database (Denmark)
Brügger, Niels
2013-01-01
of the online web has for a number of years gained currency within Internet studies. However, the combination of these two phenomena—historical network analysis of material in web archives—can at best be characterized as an emerging new area of study. Most of the methodological challenges within this new area...... at the Danish parliamentary elections in 2011, 2007, and 2001. As the Internet grows older historical studies of networks on the web will probably become more widespread and therefore it may be about time to begin debating the methodological challenges within this emerging field....
A model reduction method for biochemical reaction networks
National Research Council Canada - National Science Library
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara; Jayawardhana, Bayu
2014-01-01
Background: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics...
Approximate Subgradient Methods for Lagrangian Relaxations on Networks
Mijangos, Eugenio
Nonlinear network flow problems with linear/nonlinear side con- straints can be solved by means of Lagrangian relaxations. The dual problem is the maximization of a dual function whose value is estimated by minimizing approximately a Lagrangian function on the set defined by the network constraints. We study alternative stepsizes in the approximate subgradient methods to solve the dual problem. Some basic convergence results are put forward. Moreover, we compare the quality of the computed solutions and the efficiency of these methods.
A Selection Method for Pipe Network Boosting Plans
Qiu, Weiwei; Li, Mengyao; Weng, Haoyang
2017-12-01
Based on the fuzzy mathematics theory, a multi-objective fuzzy comprehensive evaluation method used for selection of pipe network boosting plans was proposed by computing relative membership matrix and weight vector for indexes. The example results show that the multi-objective fuzzy comprehensive evaluation method combining the indexes and the fuzzy relationship between them is suited to realities and can provide reference for decision of pipe network boosting plan.
The Analysis of Duocentric Social Networks: A Primer.
Kennedy, David P; Jackson, Grace L; Green, Harold D; Bradbury, Thomas N; Karney, Benjamin R
2015-02-01
Marriages and other intimate partnerships are facilitated or constrained by the social networks within which they are embedded. To date, methods used to assess the social networks of couples have been limited to global ratings of social network characteristics or network data collected from each partner separately. In the current article, the authors offer new tools for expanding on the existing literature by describing methods of collecting and analyzing duocentric social networks, that is, the combined social networks of couples. They provide an overview of the key considerations for measuring duocentric networks, such as how and why to combine separate network interviews with partners into one shared duocentric network, the number of network members to assess, and the implications of different network operationalizations. They illustrate these considerations with analyses of social network data collected from 57 low-income married couples, presenting visualizations and quantitative measures of network composition and structure.
GEOMORPHOLOGIC ANALYSIS OF DRAINAGE NETWORKS ON MARS
Directory of Open Access Journals (Sweden)
KERESZTURI ÁKOS
2012-06-01
Full Text Available Altogether 327 valleys and their 314 cross-sectional profiles were analyzed on Mars, including width, depth, length, eroded volume, drainage and spatial density, as well as the network structure.According to this systematic analysis, five possible drainage network types were identified such as (a small valleys, (b integrated small valleys, (c individual, medium-sized valleys, (d unconfined,anastomosing outflow valleys, and (e confined outflow valleys. Measuring their various morphometric parameters, these five networks differ from each other in terms of parameters of the eroded volume, drainage density and depth values. This classification is more detailed than those described in the literature previously and correlated to several numerical parameters for the first time.These different types were probably formed during different periods of the evolution of Mars, and sprung from differently localized water sources, and they could be correlated to similar fluvialnetwork types from the Earth.
Intentional risk management through complex networks analysis
Chapela, Victor; Moral, Santiago; Romance, Miguel
2015-01-01
This book combines game theory and complex networks to examine intentional technological risk through modeling. As information security risks are in constant evolution, the methodologies and tools to manage them must evolve to an ever-changing environment. A formal global methodology is explained in this book, which is able to analyze risks in cyber security based on complex network models and ideas extracted from the Nash equilibrium. A risk management methodology for IT critical infrastructures is introduced which provides guidance and analysis on decision making models and real situations. This model manages the risk of succumbing to a digital attack and assesses an attack from the following three variables: income obtained, expense needed to carry out an attack, and the potential consequences for an attack. Graduate students and researchers interested in cyber security, complex network applications and intentional risk will find this book useful as it is filled with a number of models, methodologies a...
The Method of Leader’s Overthrow in Networks
Belik, Ivan; Jörnsten, Kurt
2016-01-01
Methods for leader’s detection and overthrow in networks are useful tools for decision-making in many real-life cases, such as criminal networks with hidden patterns or money laundering networks. In the given research, we represent the algorithms that detect and overthrow the most influential node to the weaker positions following the greedy method in terms of structural modifications. We employed the concept of Shapley value from the area of cooperative games to measure a node’s leadership a...
Systems and methods for modeling and analyzing networks
Hill, Colin C; Church, Bruce W; McDonagh, Paul D; Khalil, Iya G; Neyarapally, Thomas A; Pitluk, Zachary W
2013-10-29
The systems and methods described herein utilize a probabilistic modeling framework for reverse engineering an ensemble of causal models, from data and then forward simulating the ensemble of models to analyze and predict the behavior of the network. In certain embodiments, the systems and methods described herein include data-driven techniques for developing causal models for biological networks. Causal network models include computational representations of the causal relationships between independent variables such as a compound of interest and dependent variables such as measured DNA alterations, changes in mRNA, protein, and metabolites to phenotypic readouts of efficacy and toxicity.
Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui
2017-10-06
Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli, and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.
Hybrid modeling and empirical analysis of automobile supply chain network
Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying
2017-05-01
Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.
Simulated, Emulated, and Physical Investigative Analysis (SEPIA) of networked systems.
Energy Technology Data Exchange (ETDEWEB)
Burton, David P.; Van Leeuwen, Brian P.; McDonald, Michael James; Onunkwo, Uzoma A.; Tarman, Thomas David; Urias, Vincent E.
2009-09-01
This report describes recent progress made in developing and utilizing hybrid Simulated, Emulated, and Physical Investigative Analysis (SEPIA) environments. Many organizations require advanced tools to analyze their information system's security, reliability, and resilience against cyber attack. Today's security analysis utilize real systems such as computers, network routers and other network equipment, computer emulations (e.g., virtual machines) and simulation models separately to analyze interplay between threats and safeguards. In contrast, this work developed new methods to combine these three approaches to provide integrated hybrid SEPIA environments. Our SEPIA environments enable an analyst to rapidly configure hybrid environments to pass network traffic and perform, from the outside, like real networks. This provides higher fidelity representations of key network nodes while still leveraging the scalability and cost advantages of simulation tools. The result is to rapidly produce large yet relatively low-cost multi-fidelity SEPIA networks of computers and routers that let analysts quickly investigate threats and test protection approaches.
Micro-macro analysis of complex networks.
Marchiori, Massimo; Possamai, Lino
2015-01-01
Complex systems have attracted considerable interest because of their wide range of applications, and are often studied via a "classic" approach: study a specific system, find a complex network behind it, and analyze the corresponding properties. This simple methodology has produced a great deal of interesting results, but relies on an often implicit underlying assumption: the level of detail on which the system is observed. However, in many situations, physical or abstract, the level of detail can be one out of many, and might also depend on intrinsic limitations in viewing the data with a different level of abstraction or precision. So, a fundamental question arises: do properties of a network depend on its level of observability, or are they invariant? If there is a dependence, then an apparently correct network modeling could in fact just be a bad approximation of the true behavior of a complex system. In order to answer this question, we propose a novel micro-macro analysis of complex systems that quantitatively describes how the structure of complex networks varies as a function of the detail level. To this extent, we have developed a new telescopic algorithm that abstracts from the local properties of a system and reconstructs the original structure according to a fuzziness level. This way we can study what happens when passing from a fine level of detail ("micro") to a different scale level ("macro"), and analyze the corresponding behavior in this transition, obtaining a deeper spectrum analysis. The obtained results show that many important properties are not universally invariant with respect to the level of detail, but instead strongly depend on the specific level on which a network is observed. Therefore, caution should be taken in every situation where a complex network is considered, if its context allows for different levels of observability.
Analysis of cascading failure in gene networks
Directory of Open Access Journals (Sweden)
Shudong eWang
2012-12-01
Full Text Available It is an important subject to research the functional mechanism of cancer-related genes make in formation and development of cancers. The modern methodology of data analysis plays a very important role for deducing the relationship between cancers and cancer-related genes and analyzing functional mechanism of genome. In this research, we construct mutual information networks using gene expression profiles of glioblast and renal in normal condition and cancer conditions. We investigate the relationship between structure and robustness in gene networks of the two tissues using a cascading failure model based on betweenness centrality. Define some important parameters such as the percentage of failure nodes of the network, the average size-ratio of cascading failure and the cumulative probability of size-ratio of cascading failure to measure the robustness of the networks. By comparing control group and experiment groups, we find that the networks of experiment groups are more robust than that of control group. The gene that can cause large scale failure is called structural key gene (SKG. Some of them have been confirmed to be closely related to the formation and development of glioma and renal cancer respectively. Most of them are predicted to play important roles during the formation of glioma and renal cancer, maybe the oncogenes, suppressor genes, and other cancer candidate genes in the glioma and renal cancer cells. However, these studies provide little information about the detailed roles of identified cancer genes.
Xing, Linlin; Guo, Maozu; Liu, Xiaoyan; Wang, Chunyu; Wang, Lei; Zhang, Yin
2017-11-17
The reconstruction of gene regulatory network (GRN) from gene expression data can discover regulatory relationships among genes and gain deep insights into the complicated regulation mechanism of life. However, it is still a great challenge in systems biology and bioinformatics. During the past years, numerous computational approaches have been developed for this goal, and Bayesian network (BN) methods draw most of attention among these methods because of its inherent probability characteristics. However, Bayesian network methods are time consuming and cannot handle large-scale networks due to their high computational complexity, while the mutual information-based methods are highly effective but directionless and have a high false-positive rate. To solve these problems, we propose a Candidate Auto Selection algorithm (CAS) based on mutual information and breakpoint detection to restrict the search space in order to accelerate the learning process of Bayesian network. First, the proposed CAS algorithm automatically selects the neighbor candidates of each node before searching the best structure of GRN. Then based on CAS algorithm, we propose a globally optimal greedy search method (CAS + G), which focuses on finding the highest rated network structure, and a local learning method (CAS + L), which focuses on faster learning the structure with little loss of quality. Results show that the proposed CAS algorithm can effectively reduce the search space of Bayesian networks through identifying the neighbor candidates of each node. In our experiments, the CAS + G method outperforms the state-of-the-art method on simulation data for inferring GRNs, and the CAS + L method is significantly faster than the state-of-the-art method with little loss of accuracy. Hence, the CAS based methods effectively decrease the computational complexity of Bayesian network and are more suitable for GRN inference.
Epileptic neuronal networks: methods of identification and clinical relevance.
Stefan, Hermann; Lopes da Silva, Fernando H
2013-01-01
The main objective of this paper is to examine evidence for the concept that epileptic activity should be envisaged in terms of functional connectivity and dynamics of neuronal networks. Basic concepts regarding structure and dynamics of neuronal networks are briefly described. Particular attention is given to approaches that are derived, or related, to the concept of causality, as formulated by Granger. Linear and non-linear methodologies aiming at characterizing the dynamics of neuronal networks applied to EEG/MEG and combined EEG/fMRI signals in epilepsy are critically reviewed. The relevance of functional dynamical analysis of neuronal networks with respect to clinical queries in focal cortical dysplasias, temporal lobe epilepsies, and "generalized" epilepsies is emphasized. In the light of the concepts of epileptic neuronal networks, and recent experimental findings, the dichotomic classification in focal and generalized epilepsy is re-evaluated. It is proposed that so-called "generalized epilepsies," such as absence seizures, are actually fast spreading epilepsies, the onset of which can be tracked down to particular neuronal networks using appropriate network analysis. Finally new approaches to delineate epileptogenic networks are discussed.
Protocol independent transmission method in software defined optical network
Liu, Yuze; Li, Hui; Hou, Yanfang; Qiu, Yajun; Ji, Yuefeng
2016-10-01
With the development of big data and cloud computing technology, the traditional software-defined network is facing new challenges (e.i., ubiquitous accessibility, higher bandwidth, more flexible management and greater security). Using a proprietary protocol or encoding format is a way to improve information security. However, the flow, which carried by proprietary protocol or code, cannot go through the traditional IP network. In addition, ultra- high-definition video transmission service once again become a hot spot. Traditionally, in the IP network, the Serial Digital Interface (SDI) signal must be compressed. This approach offers additional advantages but also bring some disadvantages such as signal degradation and high latency. To some extent, HD-SDI can also be regard as a proprietary protocol, which need transparent transmission such as optical channel. However, traditional optical networks cannot support flexible traffics . In response to aforementioned challenges for future network, one immediate solution would be to use NFV technology to abstract the network infrastructure and provide an all-optical switching topology graph for the SDN control plane. This paper proposes a new service-based software defined optical network architecture, including an infrastructure layer, a virtualization layer, a service abstract layer and an application layer. We then dwell on the corresponding service providing method in order to implement the protocol-independent transport. Finally, we experimentally evaluate that proposed service providing method can be applied to transmit the HD-SDI signal in the software-defined optical network.
Electromagnetic field computation by network methods
Felsen, Leopold B; Russer, Peter
2009-01-01
This monograph proposes a systematic and rigorous treatment of electromagnetic field representations in complex structures. The book presents new strong models by combining important computational methods. This is the last book of the late Leopold Felsen.
Adaptation Methods in Mobile Communication Networks
National Research Council Canada - National Science Library
Vladimir Wieser
2003-01-01
Adaptation methods are the main tool for transmission rate maximization through the mobile channel and today the great attention is directed to them not only in theoretical domain but in standardization process, too...
Adaptation Methods in Mobile Communication Networks
National Research Council Canada - National Science Library
Vladimir Wieser
2003-01-01
Adaptation methods are the main tool for transmission rate maximization through the mobile channel and today the great attention is directed to them not only in theoretical domain but in standardization process, too...
Automated analysis of Physarum network structure and dynamics
Fricker, Mark D.; Akita, Dai; Heaton, Luke LM; Jones, Nick; Obara, Boguslaw; Nakagaki, Toshiyuki
2017-06-01
We evaluate different ridge-enhancement and segmentation methods to automatically extract the network architecture from time-series of Physarum plasmodia withdrawing from an arena via a single exit. Whilst all methods gave reasonable results, judged by precision-recall analysis against a ground-truth skeleton, the mean phase angle (Feature Type) from intensity-independent, phase-congruency edge enhancement and watershed segmentation was the most robust to variation in threshold parameters. The resultant single pixel-wide segmented skeleton was converted to a graph representation as a set of weighted adjacency matrices containing the physical dimensions of each vein, and the inter-vein regions. We encapsulate the complete image processing and network analysis pipeline in a downloadable software package, and provide an extensive set of metrics that characterise the network structure, including hierarchical loop decomposition to analyse the nested structure of the developing network. In addition, the change in volume for each vein and intervening plasmodial sheet was used to predict the net flow across the network. The scaling relationships between predicted current, speed and shear force with vein radius were consistent with predictions from Murray’s law. This work was presented at PhysNet 2015.
Static Voltage Stability Analysis by Using SVM and Neural Network
Directory of Open Access Journals (Sweden)
Mehdi Hajian
2013-01-01
Full Text Available Voltage stability is an important problem in power system networks. In this paper, in terms of static voltage stability, and application of Neural Networks (NN and Supported Vector Machine (SVM for estimating of voltage stability margin (VSM and predicting of voltage collapse has been investigated. This paper considers voltage stability in power system in two parts. The first part calculates static voltage stability margin by Radial Basis Function Neural Network (RBFNN. The advantage of the used method is high accuracy in online detecting the VSM. Whereas the second one, voltage collapse analysis of power system is performed by Probabilistic Neural Network (PNN and SVM. The obtained results in this paper indicate, that time and number of training samples of SVM, are less than NN. In this paper, a new model of training samples for detection system, using the normal distribution load curve at each load feeder, has been used. Voltage stability analysis is estimated by well-know L and VSM indexes. To demonstrate the validity of the proposed methods, IEEE 14 bus grid and the actual network of Yazd Province are used.
An algebra-based method for inferring gene regulatory networks.
Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard
2014-03-26
The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the
Graph methods for the investigation of metabolic networks in parasitology.
Cottret, Ludovic; Jourdan, Fabien
2010-08-01
Recently, a way was opened with the development of many mathematical methods to model and analyze genome-scale metabolic networks. Among them, methods based on graph models enable to us quickly perform large-scale analyses on large metabolic networks. However, it could be difficult for parasitologists to select the graph model and methods adapted to their biological questions. In this review, after briefly addressing the problem of the metabolic network reconstruction, we propose an overview of the graph-based approaches used in whole metabolic network analyses. Applications highlight the usefulness of this kind of approach in the field of parasitology, especially by suggesting metabolic targets for new drugs. Their development still represents a major challenge to fight against the numerous diseases caused by parasites.
Timescale analysis of rule-based biochemical reaction networks.
Klinke, David J; Finley, Stacey D
2012-01-01
The flow of information within a cell is governed by a series of protein-protein interactions that can be described as a reaction network. Mathematical models of biochemical reaction networks can be constructed by repetitively applying specific rules that define how reactants interact and what new species are formed on reaction. To aid in understanding the underlying biochemistry, timescale analysis is one method developed to prune the size of the reaction network. In this work, we extend the methods associated with timescale analysis to reaction rules instead of the species contained within the network. To illustrate this approach, we applied timescale analysis to a simple receptor-ligand binding model and a rule-based model of interleukin-12 (IL-12) signaling in naïve CD4+ T cells. The IL-12 signaling pathway includes multiple protein-protein interactions that collectively transmit information; however, the level of mechanistic detail sufficient to capture the observed dynamics has not been justified based on the available data. The analysis correctly predicted that reactions associated with Janus Kinase 2 and Tyrosine Kinase 2 binding to their corresponding receptor exist at a pseudo-equilibrium. By contrast, reactions associated with ligand binding and receptor turnover regulate cellular response to IL-12. An empirical Bayesian approach was used to estimate the uncertainty in the timescales. This approach complements existing rank- and flux-based methods that can be used to interrogate complex reaction networks. Ultimately, timescale analysis of rule-based models is a computational tool that can be used to reveal the biochemical steps that regulate signaling dynamics. Copyright © 2011 American Institute of Chemical Engineers (AIChE).
Directory of Open Access Journals (Sweden)
Milton Crispim dos Santos
2016-11-01
Full Text Available The objective of this study is to apply MASP in the logistics area of a supermarket belonging to a Large Retail Network, initially identifying existing problems in the company’s logistics and then solving the most severe problems according to the above mentioned tool. The research was a qualitative and exploratory case study. The data collection tool used was a questionnaire with 10 open-ended and closed-ended questions, which was distributed to 31 research subjects, composed of employees who occupy positions of management and leadership in 16 sectors of the supermarket. The results of the research identified 11 problems in logistics , with the most relevant being excess stock, which was addressed by the MASP tool through the implementation of 8 steps, aided by other quality tools already established in the literature.
Maximum entropy methods for extracting the learned features of deep neural networks.
Finnegan, Alex; Song, Jun S
2017-10-01
New architectures of multilayer artificial neural networks and new methods for training them are rapidly revolutionizing the application of machine learning in diverse fields, including business, social science, physical sciences, and biology. Interpreting deep neural networks, however, currently remains elusive, and a critical challenge lies in understanding which meaningful features a network is actually learning. We present a general method for interpreting deep neural networks and extracting network-learned features from input data. We describe our algorithm in the context of biological sequence analysis. Our approach, based on ideas from statistical physics, samples from the maximum entropy distribution over possible sequences, anchored at an input sequence and subject to constraints implied by the empirical function learned by a network. Using our framework, we demonstrate that local transcription factor binding motifs can be identified from a network trained on ChIP-seq data and that nucleosome positioning signals are indeed learned by a network trained on chemical cleavage nucleosome maps. Imposing a further constraint on the maximum entropy distribution also allows us to probe whether a network is learning global sequence features, such as the high GC content in nucleosome-rich regions. This work thus provides valuable mathematical tools for interpreting and extracting learned features from feed-forward neural networks.
Lenters, Lindsey M; Cole, Donald C; Godoy-Ruiz, Paula
2014-01-25
Networks are increasingly regarded as essential in health research aimed at influencing practice and policies. Less research has focused on the role networking can play in researchers' careers and its broader impacts on capacity strengthening in health research. We used the Canadian Coalition for Global Health Research (CCGHR) annual Summer Institute for New Global Health Researchers (SIs) as an opportunity to explore networking among new global health researchers. A mixed-methods exploratory study was conducted among SI alumni and facilitators who had participated in at least one SI between 2004 and 2010. Alumni and facilitators completed an online short questionnaire, and a subset participated in an in-depth interview. Thematic analysis of the qualitative data was triangulated with quantitative results and CCGHR reports on SIs. Synthesis occurred through the development of a process model relevant to networking through the SIs. Through networking at the SIs, participants experienced decreased isolation and strengthened working relationships. Participants accessed new knowledge, opportunities, and resources through networking during the SI. Post-SI, participants reported ongoing contact and collaboration, although most participants desired more opportunities for interaction. They made suggestions for structural supports to networking among new global health researchers. Networking at the SI contributed positively to opportunities for individuals, and contributed to the formation of a network of global health researchers. Intentional inclusion of networking in health research capacity strengthening initiatives, with supportive resources and infrastructure could create dynamic, sustainable networks accessible to global health researchers around the world.
Directory of Open Access Journals (Sweden)
Luke J Matthews
Full Text Available Studies of social networks, mapped using self-reported contacts, have demonstrated the strong influence of social connections on the propensity for individuals to adopt or maintain healthy behaviors and on their likelihood to adopt health risks such as obesity. Social network analysis may prove useful for businesses and organizations that wish to improve the health of their populations by identifying key network positions. Health traits have been shown to correlate across friendship ties, but evaluating network effects in large coworker populations presents the challenge of obtaining sufficiently comprehensive network data. The purpose of this study was to evaluate methods for using online communication data to generate comprehensive network maps that reproduce the health-associated properties of an offline social network. In this study, we examined three techniques for inferring social relationships from email traffic data in an employee population using thresholds based on: (1 the absolute number of emails exchanged, (2 logistic regression probability of an offline relationship, and (3 the highest ranked email exchange partners. As a model of the offline social network in the same population, a network map was created using social ties reported in a survey instrument. The email networks were evaluated based on the proportion of survey ties captured, comparisons of common network metrics, and autocorrelation of body mass index (BMI across social ties. Results demonstrated that logistic regression predicted the greatest proportion of offline social ties, thresholding on number of emails exchanged produced the best match to offline network metrics, and ranked email partners demonstrated the strongest autocorrelation of BMI. Since each method had unique strengths, researchers should choose a method based on the aspects of offline behavior of interest. Ranked email partners may be particularly useful for purposes related to health traits in a
Matthews, Luke J.; DeWan, Peter; Rula, Elizabeth Y.
2013-01-01
Studies of social networks, mapped using self-reported contacts, have demonstrated the strong influence of social connections on the propensity for individuals to adopt or maintain healthy behaviors and on their likelihood to adopt health risks such as obesity. Social network analysis may prove useful for businesses and organizations that wish to improve the health of their populations by identifying key network positions. Health traits have been shown to correlate across friendship ties, but evaluating network effects in large coworker populations presents the challenge of obtaining sufficiently comprehensive network data. The purpose of this study was to evaluate methods for using online communication data to generate comprehensive network maps that reproduce the health-associated properties of an offline social network. In this study, we examined three techniques for inferring social relationships from email traffic data in an employee population using thresholds based on: (1) the absolute number of emails exchanged, (2) logistic regression probability of an offline relationship, and (3) the highest ranked email exchange partners. As a model of the offline social network in the same population, a network map was created using social ties reported in a survey instrument. The email networks were evaluated based on the proportion of survey ties captured, comparisons of common network metrics, and autocorrelation of body mass index (BMI) across social ties. Results demonstrated that logistic regression predicted the greatest proportion of offline social ties, thresholding on number of emails exchanged produced the best match to offline network metrics, and ranked email partners demonstrated the strongest autocorrelation of BMI. Since each method had unique strengths, researchers should choose a method based on the aspects of offline behavior of interest. Ranked email partners may be particularly useful for purposes related to health traits in a social network. PMID
Matthews, Luke J; DeWan, Peter; Rula, Elizabeth Y
2013-01-01
Studies of social networks, mapped using self-reported contacts, have demonstrated the strong influence of social connections on the propensity for individuals to adopt or maintain healthy behaviors and on their likelihood to adopt health risks such as obesity. Social network analysis may prove useful for businesses and organizations that wish to improve the health of their populations by identifying key network positions. Health traits have been shown to correlate across friendship ties, but evaluating network effects in large coworker populations presents the challenge of obtaining sufficiently comprehensive network data. The purpose of this study was to evaluate methods for using online communication data to generate comprehensive network maps that reproduce the health-associated properties of an offline social network. In this study, we examined three techniques for inferring social relationships from email traffic data in an employee population using thresholds based on: (1) the absolute number of emails exchanged, (2) logistic regression probability of an offline relationship, and (3) the highest ranked email exchange partners. As a model of the offline social network in the same population, a network map was created using social ties reported in a survey instrument. The email networks were evaluated based on the proportion of survey ties captured, comparisons of common network metrics, and autocorrelation of body mass index (BMI) across social ties. Results demonstrated that logistic regression predicted the greatest proportion of offline social ties, thresholding on number of emails exchanged produced the best match to offline network metrics, and ranked email partners demonstrated the strongest autocorrelation of BMI. Since each method had unique strengths, researchers should choose a method based on the aspects of offline behavior of interest. Ranked email partners may be particularly useful for purposes related to health traits in a social network.
A graph-based network-vulnerability analysis system
Energy Technology Data Exchange (ETDEWEB)
Swiler, L.P.; Phillips, C. [Sandia National Labs., Albuquerque, NM (United States); Gaylor, T. [3M, Austin, TX (United States). Visual Systems Div.
1998-01-01
This report presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.
A graph-based system for network-vulnerability analysis
Energy Technology Data Exchange (ETDEWEB)
Swiler, L.P.; Phillips, C.
1998-06-01
This paper presents a graph-based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The graph-based tool can identify the set of attack paths that have a high probability of success (or a low effort cost) for the attacker. The system could be used to test the effectiveness of making configuration changes, implementing an intrusion detection system, etc. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level-of-effort for the attacker, various graph algorithms such as shortest-path algorithms can identify the attack paths with the highest probability of success.
A graph-based network-vulnerability analysis system
Energy Technology Data Exchange (ETDEWEB)
Swiler, L.P.; Phillips, C.; Gaylor, T.
1998-05-03
This paper presents a graph based approach to network vulnerability analysis. The method is flexible, allowing analysis of attacks from both outside and inside the network. It can analyze risks to a specific network asset, or examine the universe of possible consequences following a successful attack. The analysis system requires as input a database of common attacks, broken into atomic steps, specific network configuration and topology information, and an attacker profile. The attack information is matched with the network configuration information and an attacker profile to create a superset attack graph. Nodes identify a stage of attack, for example the class of machines the attacker has accessed and the user privilege level he or she has compromised. The arcs in the attack graph represent attacks or stages of attacks. By assigning probabilities of success on the arcs or costs representing level of effort for the attacker, various graph algorithms such as shortest path algorithms can identify the attack paths with the highest probability of success.
The Application of Social Network Analysis to Accounting and Auditing
DEFF Research Database (Denmark)
Kacanski, Slobodan; Lusher, Dean
2017-01-01
This article aims to extend methodological possibilities for conducting research in accounting and auditing by providing an overview of how current developments in social network analysis (SNA) could serve as a powerful set of theoretical and methodological tools for this purpose. SNA focuses...... for different analyses. The example of a one-mode network between audit partners is presented, to which a number of previously outlined concepts are applied and discussed. Finally, we describe the potential of a cutting-edge statistical method for SNA, exponential random graph model (ERGM), which act...
Directory of Open Access Journals (Sweden)
Qiang Zhu
2015-01-01
Full Text Available The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.
Network analysis of time-lapse microscopy recordings.
Smedler, Erik; Malmersjö, Seth; Uhlén, Per
2014-01-01
Multicellular organisms rely on intercellular communication to regulate important cellular processes critical to life. To further our understanding of those processes there is a need to scrutinize dynamical signaling events and their functions in both cells and organisms. Here, we report a method and provide MATLAB code that analyzes time-lapse microscopy recordings to identify and characterize network structures within large cell populations, such as interconnected neurons. The approach is demonstrated using intracellular calcium (Ca(2+)) recordings in neural progenitors and cardiac myocytes, but could be applied to a wide variety of biosensors employed in diverse cell types and organisms. In this method, network structures are analyzed by applying cross-correlation signal processing and graph theory to single-cell recordings. The goal of the analysis is to determine if the single cell activity constitutes a network of interconnected cells and to decipher the properties of this network. The method can be applied in many fields of biology in which biosensors are used to monitor signaling events in living cells. Analyzing intercellular communication in cell ensembles can reveal essential network structures that provide important biological insights.
Network Analysis of Time-Lapse Microscopy Recordings
Directory of Open Access Journals (Sweden)
Erik eSmedler
2014-09-01
Full Text Available Multicellular organisms rely on intercellular communication to regulate important cellular processes critical to life. To further our understanding of those processes there is a need to scrutinize dynamical signaling events and their functions in both cells and organisms. Here, we report a method and provide MATLAB code that analyzes time-lapse microscopy recordings to identify and characterize network structures within large cell populations, such as interconnected neurons. The approach is demonstrated using intracellular calcium (Ca2+ recordings in neural progenitors and cardiac myocytes, but could be applied to a wide variety of biosensors employed in diverse cell types and organisms. In this method, network structures are analyzed by applying cross-correlation signal processing and graph theory to single-cell recordings. The goal of the analysis is to determine if the single cell activity constitutes a network of interconnected cells and to decipher the properties of this network. The method can be applied in many fields of biology in which biosensors are used to monitor signaling events in living cells. Analyzing intercellular communication in cell ensembles can reveal essential network structures that provide important biological insights.
A statistical framework for differential network analysis from microarray data
Directory of Open Access Journals (Sweden)
Datta Somnath
2010-02-01
Full Text Available Abstract Background It has been long well known that genes do not act alone; rather groups of genes act in consort during a biological process. Consequently, the expression levels of genes are dependent on each other. Experimental techniques to detect such interacting pairs of genes have been in place for quite some time. With the advent of microarray technology, newer computational techniques to detect such interaction or association between gene expressions are being proposed which lead to an association network. While most microarray analyses look for genes that are differentially expressed, it is of potentially greater significance to identify how entire association network structures change between two or more biological settings, say normal versus diseased cell types. Results We provide a recipe for conducting a differential analysis of networks constructed from microarray data under two experimental settings. At the core of our approach lies a connectivity score that represents the strength of genetic association or interaction between two genes. We use this score to propose formal statistical tests for each of following queries: (i whether the overall modular structures of the two networks are different, (ii whether the connectivity of a particular set of "interesting genes" has changed between the two networks, and (iii whether the connectivity of a given single gene has changed between the two networks. A number of examples of this score is provided. We carried out our method on two types of simulated data: Gaussian networks and networks based on differential equations. We show that, for appropriate choices of the connectivity scores and tuning parameters, our method works well on simulated data. We also analyze a real data set involving normal versus heavy mice and identify an interesting set of genes that may play key roles in obesity. Conclusions Examining changes in network structure can provide valuable information about the
Green pathways: Metabolic network analysis of plant systems.
Dersch, Lisa Maria; Beckers, Veronique; Wittmann, Christoph
2016-03-01
Metabolic engineering of plants with enhanced crop yield and value-added compositional traits is particularly challenging as they probably exhibit the highest metabolic network complexity of all living organisms. Therefore, approaches of plant metabolic network analysis, which can provide systems-level understanding of plant physiology, appear valuable as guidance for plant metabolic engineers. Strongly supported by the sequencing of plant genomes, a number of different experimental and computational methods have emerged in recent years to study plant systems at various levels: from heterotrophic cell cultures to autotrophic entire plants. The present review presents a state-of-the-art toolbox for plant metabolic network analysis. Among the described approaches are different in silico modeling techniques, including flux balance analysis, elementary flux mode analysis and kinetic flux profiling, as well as different variants of experiments with plant systems which use radioactive and stable isotopes to determine in vivo plant metabolic fluxes. The fundamental principles of these techniques, the required data input and the obtained flux information are enriched by technical advices, specific to plants. In addition, pioneering and high-impacting findings of plant metabolic network analysis highlight the potential of the field. Copyright © 2015 International Metabolic Engineering Society. Published by Elsevier Inc. All rights reserved.
Using Network Analysis to Understand Knowledge Mobilization in a Community-based Organization
Gainforth, Heather L.; Latimer-Cheung, Amy E.; Moore, Spencer; Athanasopoulos, Peter; Martin Ginis, Kathleen A.
2014-01-01
Background Knowledge mobilization (KM) has been described as putting research in the hands of research users. Network analysis is an empirical approach that has potential for examining the complex process of knowledge mobilization within community-based organizations (CBOs). Yet, conducting a network analysis in a CBO presents challenges. Purpose The purpose of this paper is to demonstrate the value and feasibility of using network analysis as a method for understanding knowledge mob...
Analysis of Precision of Activation Analysis Method
DEFF Research Database (Denmark)
Heydorn, Kaj; Nørgaard, K.
1973-01-01
The precision of an activation-analysis method prescribes the estimation of the precision of a single analytical result. The adequacy of these estimates to account for the observed variation between duplicate results from the analysis of different samples and materials, is tested by the statistic T...
Introduction to stream network habitat analysis
Bartholow, John M.; Waddle, Terry J.
1986-01-01
Increasing demands on stream resources by a variety of users have resulted in an increased emphasis on studies that evaluate the cumulative effects of basinwide water management programs. Network habitat analysis refers to the evaluation of an entire river basin (or network) by predicting its habitat response to alternative management regimes. The analysis principally focuses on the biological and hydrological components of the riv er basin, which include both micro- and macrohabitat. (The terms micro- and macrohabitat are further defined and discussed later in this document.) Both conceptual and analytic models are frequently used for simplifying and integrating the various components of the basin. The model predictions can be used in developing management recommendations to preserve, restore, or enhance instream fish habitat. A network habitat analysis should begin with a clear and concise statement of the study objectives and a thorough understanding of the institutional setting in which the study results will be applied. This includes the legal, social, and political considerations inherent in any water management setting. The institutional environment may dictate the focus and level of detail required of the study to a far greater extent than the technical considerations. After the study objectives, including species on interest, and institutional setting are collectively defined, the technical aspects should be scoped to determine the spatial and temporal requirements of the analysis. A macro level approach should be taken first to identify critical biological elements and requirements. Next, habitat availability is quantified much as in a "standard" river segment analysis, with the likely incorporation of some macrohabitat components, such as stream temperature. Individual river segments may be aggregated to represent the networkwide habitat response of alternative water management schemes. Things learned about problems caused or opportunities generated may
Using Network Analysis to Understand Knowledge Mobilization in a Community-based Organization.
Gainforth, Heather L; Latimer-Cheung, Amy E; Moore, Spencer; Athanasopoulos, Peter; Martin Ginis, Kathleen A
2015-06-01
Knowledge mobilization (KM) has been described as putting research in the hands of research users. Network analysis is an empirical approach that has potential for examining the complex process of knowledge mobilization within community-based organizations (CBOs). Yet, conducting a network analysis in a CBO presents challenges. The purpose of this paper is to demonstrate the value and feasibility of using network analysis as a method for understanding knowledge mobilization within a CBO by (1) presenting challenges and solutions to conducting a network analysis in a CBO, (2) examining the feasibility of our methodology, and (3) demonstrating the utility of this methodology through an example of a network analysis conducted in a CBO engaging in knowledge mobilization activities. The final method used by the partnership team to conduct our network analysis of a CBO is described. An example of network analysis results of a CBO engaging in knowledge mobilization is presented. In total, 81 participants completed the network survey. All of the feasibility benchmarks set by the CBO were met. Results of the network analysis are highlighted and discussed as a means of identifying (1) prominent and influential individuals in the knowledge mobilization process and (2) areas for improvement in future knowledge mobilization initiatives. Findings demonstrate that network analysis can be feasibly used to provide a rich description of a CBO engaging in knowledge mobilization activities.
Network Analysis and Modeling in Systems Biology
Bosque Chacón, Gabriel
2017-01-01
This thesis is dedicated to the study and comprehension of biological networks at the molecular level. The objectives were to analyse their topology, integrate it in a genotype-phenotype analysis, develop richer mathematical descriptions for them, study their community structure and compare different methodologies for estimating their internal fluxes. The work presented in this document moves around three main axes. The first one is the biological. Which organisms were studied in this ...
Chemical methods of rock analysis
National Research Council Canada - National Science Library
Jeffery, P. G; Hutchison, D
1981-01-01
A practical guide to the methods in general use for the complete analysis of silicate rock material and for the determination of all those elements present in major, minor or trace amounts in silicate...
Nonlinear programming analysis and methods
Avriel, Mordecai
2012-01-01
This text provides an excellent bridge between principal theories and concepts and their practical implementation. Topics include convex programming, duality, generalized convexity, analysis of selected nonlinear programs, techniques for numerical solutions, and unconstrained optimization methods.
An algebraic topological method for multimodal brain networks comparison
Directory of Open Access Journals (Sweden)
Tiago eSimas
2015-07-01
Full Text Available Understanding brain connectivity is one of the most important issues in neuroscience. Nonetheless, connectivity data can reflect either functional relationships of brain activities or anatomical connections between brain areas. Although both representations should be related, this relationship is not straightforward. We have devised a powerful method that allows different operations between networks that share the same set of nodes, by embedding them in a common metric space, enforcing transitivity to the graph topology. Here, we apply this method to construct an aggregated network from a set of functional graphs, each one from a different subject. Once this aggregated functional network is constructed, we use again our method to compare it with the structural connectivity to identify particular brain regions that differ in both modalities (anatomical and functional. Remarkably, these brain regions include functional areas that form part of the classical resting state networks. We conclude that our method -based on the comparison of the aggregated functional network- reveals some emerging features that could not be observed when the comparison is performed with the classical averaged functional network.
A user’s guide to network analysis in R
Luke, Douglas
2015-01-01
Presenting a comprehensive resource for the mastery of network analysis in R, the goal of Network Analysis with R is to introduce modern network analysis techniques in R to social, physical, and health scientists. The mathematical foundations of network analysis are emphasized in an accessible way and readers are guided through the basic steps of network studies: network conceptualization, data collection and management, network description, visualization, and building and testing statistical models of networks. As with all of the books in the Use R! series, each chapter contains extensive R code and detailed visualizations of datasets. Appendices will describe the R network packages and the datasets used in the book. An R package developed specifically for the book, available to readers on GitHub, contains relevant code and real-world network datasets as well.
Buttles, John W
2013-04-23
Wireless communication devices include a software-defined radio coupled to processing circuitry. The system controller is configured to execute computer programming code. Storage media is coupled to the system controller and includes computer programming code configured to cause the system controller to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.
The Network's Data Security Risk Analysis
Directory of Open Access Journals (Sweden)
Emil BURTESCU
2008-01-01
Full Text Available Establishing the networks security risk can be a very difficult operation especially for the small companies which, from financial reasons can't appeal at specialist in this domain, or for the medium or large companies that don't have experience. The following method proposes not to use complex financial calculus to determine the loss level and the value of impact making the determination of risk level a lot easier.
Combination methods for identifying influential nodes in networks
Gao, Chao; Zhong, Lu; Li, Xianghua; Zhang, Zili; Shi, Ning
2015-11-01
Identifying influential nodes is of theoretical significance in many domains. Although lots of methods have been proposed to solve this problem, their evaluations are under single-source attack in scale-free networks. Meanwhile, some researches have speculated that the combinations of some methods may achieve more optimal results. In order to evaluate this speculation and design a universal strategy suitable for different types of networks under the consideration of multi-source attacks, this paper proposes an attribute fusion method with two independent strategies to reveal the correlation of existing ranking methods and indicators. One is based on feature union (FU) and the other is based on feature ranking (FR). Two different propagation models in the fields of recommendation system and network immunization are used to simulate the efficiency of our proposed method. Experimental results show that our method can enlarge information spreading and restrain virus propagation in the application of recommendation system and network immunization in different types of networks under the condition of multi-source attacks.
An Efficient Synchronization Method for Wireless Networks
2013-06-01
group-wise synchronization which is more e cient than rsync, is possible. This paper describes Dandelion , an algorithm that builds on the ideas of the...which is more efficient than rsync, is possible. This paper describes Dandelion , an algorithm that builds on the ideas of the rsync algorithm to...methods analyzed in this paper are compared using this metric. To meet this goal, this paper defines an epidemic-like algorithm called Dandelion that is
Network value and optimum analysis on the mode of networked marketing in TV media
Directory of Open Access Journals (Sweden)
Xiao Dongpo
2012-12-01
Full Text Available Purpose: With the development of the networked marketing in TV media, it is important to do the research on network value and optimum analysis in this field.Design/methodology/approach: According to the research on the mode of networked marketing in TV media and Correlation theory, the essence of media marketing is creating, spreading and transferring values. The Participants of marketing value activities are in network, and value activities proceed in networked form. Network capability is important to TV media marketing activities.Findings: This article raises the direction of research of analysis and optimization about network based on the mode of networked marketing in TV media by studying TV media marketing Development Mechanism , network analysis and network value structure.
Methods of graph network reconstruction in personalized medicine.
Danilov, A; Ivanov, Yu; Pryamonosov, R; Vassilevski, Yu
2016-08-01
The paper addresses methods for generation of individualized computational domains on the basis of medical imaging dataset. The computational domains will be used in one-dimensional (1D) and three-dimensional (3D)-1D coupled hemodynamic models. A 1D hemodynamic model employs a 1D network of a patient-specific vascular network with large number of vessels. The 1D network is the graph with nodes in the 3D space which bears additional geometric data such as length and radius of vessels. A 3D hemodynamic model requires a detailed 3D reconstruction of local parts of the vascular network. We propose algorithms which extend the automated segmentation of vascular and tubular structures, generation of centerlines, 1D network reconstruction, correction, and local adaptation. We consider two modes of centerline representation: (i) skeletal segments or sets of connected voxels and (ii) curved paths with corresponding radii. Individualized reconstruction of 1D networks depends on the mode of centerline representation. Efficiency of the proposed algorithms is demonstrated on several examples of 1D network reconstruction. The networks can be used in modeling of blood flows as well as other physiological processes in tubular structures. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.
Analysis and visualization of citation networks
Zhao, Dangzhi
2015-01-01
Citation analysis-the exploration of reference patterns in the scholarly and scientific literature-has long been applied in a number of social sciences to study research impact, knowledge flows, and knowledge networks. It has important information science applications as well, particularly in knowledge representation and in information retrieval.Recent years have seen a burgeoning interest in citation analysis to help address research, management, or information service issues such as university rankings, research evaluation, or knowledge domain visualization. This renewed and growing interest
A model reduction method for biochemical reaction networks.
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara M; Jayawardhana, Bayu
2014-05-03
In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model. We apply our method to a yeast glycolysis model and a rat liver fatty acid beta-oxidation model. When the number of state variables in the yeast model is reduced from 12 to 7, the difference between metabolite concentrations in the reduced and the full model, averaged over time and species, is only 8%. Likewise, when the number of state variables in the rat-liver beta-oxidation model is reduced from 42 to 29, the difference between the reduced model and the full model is 7.5%. The method has improved our understanding of the dynamics of the two networks. We found that, contrary to the general disposition, the first few metabolites which were deleted from the network during our stepwise reduction approach, are not those with the shortest convergence times. It shows that our reduction approach performs differently from other approaches that are based on time-scale separation. The method can be used to facilitate fitting of the parameters or to embed a detailed model of interest in a more coarse
Kumari, Sapna; Nie, Jeff; Chen, Huann-Sheng; Ma, Hao; Stewart, Ron; Li, Xiang; Lu, Meng-Zhu; Taylor, William M; Wei, Hairong
2012-01-01
Constructing coexpression networks and performing network analysis using large-scale gene expression data sets is an effective way to uncover new biological knowledge; however, the methods used for gene association in constructing these coexpression networks have not been thoroughly evaluated. Since different methods lead to structurally different coexpression networks and provide different information, selecting the optimal gene association method is critical. In this study, we compared eight gene association methods - Spearman rank correlation, Weighted Rank Correlation, Kendall, Hoeffding's D measure, Theil-Sen, Rank Theil-Sen, Distance Covariance, and Pearson - and focused on their true knowledge discovery rates in associating pathway genes and construction coordination networks of regulatory genes. We also examined the behaviors of different methods to microarray data with different properties, and whether the biological processes affect the efficiency of different methods. We found that the Spearman, Hoeffding and Kendall methods are effective in identifying coexpressed pathway genes, whereas the Theil-sen, Rank Theil-Sen, Spearman, and Weighted Rank methods perform well in identifying coordinated transcription factors that control the same biological processes and traits. Surprisingly, the widely used Pearson method is generally less efficient, and so is the Distance Covariance method that can find gene pairs of multiple relationships. Some analyses we did clearly show Pearson and Distance Covariance methods have distinct behaviors as compared to all other six methods. The efficiencies of different methods vary with the data properties to some degree and are largely contingent upon the biological processes, which necessitates the pre-analysis to identify the best performing method for gene association and coexpression network construction.
A model reduction method for biochemical reaction networks
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara; Jayawardhana, Bayu
2014-01-01
Background: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of
Comparisons of topological properties in autism for the brain network construction methods
Lee, Min-Hee; Kim, Dong Youn; Lee, Sang Hyeon; Kim, Jin Uk; Chung, Moo K.
2015-03-01
Structural brain networks can be constructed from the white matter fiber tractography of diffusion tensor imaging (DTI), and the structural characteristics of the brain can be analyzed from its networks. When brain networks are constructed by the parcellation method, their network structures change according to the parcellation scale selection and arbitrary thresholding. To overcome these issues, we modified the Ɛ -neighbor construction method proposed by Chung et al. (2011). The purpose of this study was to construct brain networks for 14 control subjects and 16 subjects with autism using both the parcellation and the Ɛ-neighbor construction method and to compare their topological properties between two methods. As the number of nodes increased, connectedness decreased in the parcellation method. However in the Ɛ-neighbor construction method, connectedness remained at a high level even with the rising number of nodes. In addition, statistical analysis for the parcellation method showed significant difference only in the path length. However, statistical analysis for the Ɛ-neighbor construction method showed significant difference with the path length, the degree and the density.
Network 'small-world-ness': a quantitative method for determining canonical network equivalence.
Directory of Open Access Journals (Sweden)
Mark D Humphries
Full Text Available BACKGROUND: Many technological, biological, social, and information networks fall into the broad class of 'small-world' networks: they have tightly interconnected clusters of nodes, and a shortest mean path length that is similar to a matched random graph (same number of nodes and edges. This semi-quantitative definition leads to a categorical distinction ('small/not-small' rather than a quantitative, continuous grading of networks, and can lead to uncertainty about a network's small-world status. Moreover, systems described by small-world networks are often studied using an equivalent canonical network model--the Watts-Strogatz (WS model. However, the process of establishing an equivalent WS model is imprecise and there is a pressing need to discover ways in which this equivalence may be quantified. METHODOLOGY/PRINCIPAL FINDINGS: We defined a precise measure of 'small-world-ness' S based on the trade off between high local clustering and short path length. A network is now deemed a 'small-world' if S>1--an assertion which may be tested statistically. We then examined the behavior of S on a large data-set of real-world systems. We found that all these systems were linked by a linear relationship between their S values and the network size n. Moreover, we show a method for assigning a unique Watts-Strogatz (WS model to any real-world network, and show analytically that the WS models associated with our sample of networks also show linearity between S and n. Linearity between S and n is not, however, inevitable, and neither is S maximal for an arbitrary network of given size. Linearity may, however, be explained by a common limiting growth process. CONCLUSIONS/SIGNIFICANCE: We have shown how the notion of a small-world network may be quantified. Several key properties of the metric are described and the use of WS canonical models is placed on a more secure footing.
A Newly Developed Method for Computing Reliability Measures in a Water Supply Network
Directory of Open Access Journals (Sweden)
Jacek Malinowski
2016-01-01
Full Text Available A reliability model of a water supply network has beens examined. Its main features are: a topology that can be decomposed by the so-called state factorization into a (relativelysmall number of derivative networks, each having a series-parallel structure (1, binary-state components (either operative or failed with given flow capacities (2, a multi-state character of the whole network and its sub-networks - a network state is defined as the maximal flow between a source (sources and a sink (sinks (3, all capacities (component, network, and sub-network have integer values (4. As the network operates, its state changes due to component failures, repairs, and replacements. A newly developed method of computing the inter-state transition intensities has been presented. It is based on the so-called state factorization and series-parallel aggregation. The analysis of these intensities shows that the failure-repair process of the considered system is an asymptotically homogenous Markov process. It is also demonstrated how certain reliability parameters useful for the network maintenance planning can be determined on the basis of the asymptotic intensities. For better understanding of the presented method, an illustrative example is given. (original abstract
Complex network analysis of extreme precipitation over the Indian subcontinent.
Stolbova, Veronika; Kurths, Jürgen
2013-04-01
The Indian monsoon is a large scale pattern in the climate system of the Earth. The motivation of our work was to reveal spatial structures in strong precipitation over the Indian subcontinent, and their evolution during the year, because it is crucial as for understanding of monsoon regularities as well for India's agriculture and economy. We present an analysis of extreme rainfall over the Indian peninsula and Sri Lanka. Using the method of event synchronization we constructed networks of extreme rainfall events(heavier than the 90-th percentile) for three time periods: during the Indian summer monsoon (ISM, June-September), the Northeast monsoon (NEM, October - December, so called winter monsoon) and period before the summer monsoon (January - May). Obtained networks show how extreme rainfall for specific areas in India is synchronized with extreme rainfall for other areas in India. Analysis of degree centrality of the networks reveals clusters of extreme rainfall events in India which are strongly connected to maximal number of other areas with extreme rainfall events, e.g., North Pakistan and the Eastern Ghats. Additionally, betweenness centrality shows areas that are important in the sense of water transport in the networks (e.g. the Himalayas, Western Ghats, Eastern Ghats etc.). By comparison of networks before the summer monsoon, during summer and winter monsoon season we determined how spatial patterns of rainfalls synchronization change during the year. These changes play a crucial role in the organization of the rainfall all over the Indian subcontinent.
Ensemble approach to the analysis of weighted networks
Ahnert, S. E.; Garlaschelli, D.; Fink, T. M. A.; Caldarelli, G.
2007-07-01
We present an approach to the analysis of weighted networks, by providing a straightforward generalization of any network measure defined on unweighted networks, such as the average degree of the nearest neighbors, the clustering coefficient, the “betweenness,” the distance between two nodes, and the diameter of a network. All these measures are well established for unweighted networks but have hitherto proven difficult to define for weighted networks. Our approach is based on the translation of a weighted network into an ensemble of edges. Further introducing this approach we demonstrate its advantages by applying the clustering coefficient constructed in this way to two real-world weighted networks.
Design Criteria For Networked Image Analysis System
Reader, Cliff; Nitteberg, Alan
1982-01-01
Image systems design is currently undergoing a metamorphosis from the conventional computing systems of the past into a new generation of special purpose designs. This change is motivated by several factors, notably among which is the increased opportunity for high performance with low cost offered by advances in semiconductor technology. Another key issue is a maturing in understanding of problems and the applicability of digital processing techniques. These factors allow the design of cost-effective systems that are functionally dedicated to specific applications and used in a utilitarian fashion. Following an overview of the above stated issues, the paper presents a top-down approach to the design of networked image analysis systems. The requirements for such a system are presented, with orientation toward the hospital environment. The three main areas are image data base management, viewing of image data and image data processing. This is followed by a survey of the current state of the art, covering image display systems, data base techniques, communications networks and software systems control. The paper concludes with a description of the functional subystems and architectural framework for networked image analysis in a production environment.
Capacity analysis of wireless mesh networks | Gumel | Nigerian ...
African Journals Online (AJOL)
The next generation wireless· netWorks experienced agreat development with emergence of wireless mesh networks (WMNs), which can be regarded as a realistic solution that provides wireless broadband access. The limited available bandwidth makes capacity analysis of the network very essential. While the network ...
Temperature-based Instanton Analysis: Identifying Vulnerability in Transmission Networks
Energy Technology Data Exchange (ETDEWEB)
Kersulis, Jonas [Univ. of Michigan, Ann Arbor, MI (United States); Hiskens, Ian [Univ. of Michigan, Ann Arbor, MI (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Backhaus, Scott N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Bienstock, Daniel [Columbia Univ., New York, NY (United States)
2015-04-08
A time-coupled instanton method for characterizing transmission network vulnerability to wind generation fluctuation is presented. To extend prior instanton work to multiple-time-step analysis, line constraints are specified in terms of temperature rather than current. An optimization formulation is developed to express the minimum wind forecast deviation such that at least one line is driven to its thermal limit. Results are shown for an IEEE RTS-96 system with several wind-farms.
Characterizing naval team readiness through social network analysis
Schraagen, J.M.C.; Post, W.M.
2014-01-01
Characterizing a team’s level of readiness in an efficient and objective way is important for organizations such as the military. Current methods to characterize real-time team interaction know limitations that may be addressed by social network analysis techniques. The purpose of the current field study was to investigate the usefulness of these techniques by applying them to two naval teams, one more experienced than the other. We observed how these teams responded during an actual training...
Computational tools for large-scale biological network analysis
Pinto, José Pedro Basto Gouveia Pereira
2012-01-01
Tese de doutoramento em Informática The surge of the field of Bioinformatics, among other contributions, provided biological researchers with powerful computational methods for processing and analysing the large amount of data coming from recent biological experimental techniques such as genome sequencing and other omics. Naturally, this led to the opening of new avenues of biological research among which is included the analysis of large-scale biological networks. The an...
Structure analysis of growing network based on partial differential equations
Directory of Open Access Journals (Sweden)
Junbo JIA
2016-04-01
Full Text Available The topological structure is one of the most important contents in the complex network research. Therein the node degree and the degree distribution are the most basic characteristic quantities to describe topological structure. In order to calculate the degree distribution, first of all, the node degree is considered as a continuous variable. Then, according to the Markov Property of growing network, the cumulative distribution function's evolution equation with time can be obtained. Finally, the partial differential equation (PDE model can be established through distortion processing. Taking the growing network with preferential and random attachment mechanism as an example, the PDE model is obtained. The analytic expression of degree distribution is obtained when this model is solved. Besides, the degree function over time is the same as the characteristic line of PDE. At last, the model is simulated. This PDE method of changing the degree distribution calculation into problem of solving PDE makes the structure analysis more accurate.
Structural parameter identifiability analysis for dynamic reaction networks
DEFF Research Database (Denmark)
Davidescu, Florin Paul; Jørgensen, Sten Bay
2008-01-01
where for a given set of measured variables it is desirable to investigate which parameters may be estimated prior to spending computational effort on the actual estimation. This contribution addresses the structural parameter identifiability problem for the typical case of reaction network models....... The proposed analysis is performed in two phases. The first phase determines the structurally identifiable reaction rates based on reaction network stoichiometry. The second phase assesses the structural parameter identifiability of the specific kinetic rate expressions using a generating series expansion...... method based on Lie derivatives. The proposed systematic two phase methodology is illustrated on a mass action based model for an enzymatically catalyzed reaction pathway network where only a limited set of variables is measured. The methodology clearly pinpoints the structurally identifiable parameters...
Analysis of feeder bus network design and scheduling problems.
Almasi, Mohammad Hadi; Mirzapour Mounes, Sina; Koting, Suhana; Karim, Mohamed Rehan
2014-01-01
A growing concern for public transit is its inability to shift passenger's mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews.
Integrated Adaptive Analysis and Visualization of Satellite Network Data Project
National Aeronautics and Space Administration — We propose to develop a system that enables integrated and adaptive analysis and visualization of satellite network management data. Integrated analysis and...
Dynamical modeling and analysis of large cellular regulatory networks
Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.
2013-06-01
The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.
Dynamical modeling and analysis of large cellular regulatory networks.
Bérenguier, D; Chaouiya, C; Monteiro, P T; Naldi, A; Remy, E; Thieffry, D; Tichit, L
2013-06-01
The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.
Epileptic neuronal networks: methods of identification andclinical relevance.
Directory of Open Access Journals (Sweden)
Hermann eStefan
2013-03-01
Full Text Available The main objective of this paper is to examine evidence for the concept that epileptic activityshould be envisaged in terms of functional connectivity and dynamics of neuronal networks,Basic concepts regarding structure and dynamics of neuronal networks are briefly described.Particular attention is given to approaches that are derived, or related, to the concept ofcausality, as formulated by Granger. Linear and non linear methodologies aiming atcharacterizing the dynamics of neuronal networks applied to EEG/MEG and combined EEG/fMRI signals in epilepsy are critically reviewed. The relevance of functional dynamicalanalysis of neuronal networks with respect to clinical queries in focal cortical dysplasias,temporal lobe epilepsies and "generalized epilepsies is emphasized. In the light of theconcepts of epileptic neuronal networks, and recent experimental findings, the dichotomicclassification in focal and generalized epilepsy is re-evaluated. It is proposed that so-called"generalized epilepsies", such as absence seizures, are actually fast spreading epilepsies, theonset of which can be tracked down to particular neuronal networks using appropriatenetwork analysis. Finally new approaches to delineate epileptogenic networks are discussed.
Decomposition method for zonal resource allocation problems in telecommunication networks
Konnov, I. V.; Kashuba, A. Yu
2016-11-01
We consider problems of optimal resource allocation in telecommunication networks. We first give an optimization formulation for the case where the network manager aims to distribute some homogeneous resource (bandwidth) among users of one region with quadratic charge and fee functions and present simple and efficient solution methods. Next, we consider a more general problem for a provider of a wireless communication network divided into zones (clusters) with common capacity constraints. We obtain a convex quadratic optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we suggest to reduce the initial problem to a single-dimensional optimization problem, but calculation of the cost function value leads to independent solution of zonal problems, which coincide with the above single region problem. Some results of computational experiments confirm the applicability of the new methods.
Analysis of Ego Network Structure in Online Social Networks
Arnaboldi, Valerio; Conti, Marco; Passarella, Andrea; Pezzoni, Fabio
2012-01-01
Results about offline social networks demonstrated that the social relationships that an individual (ego) maintains with other people (alters) can be organised into different groups according to the ego network model. In this model the ego can be seen as the centre of a series of layers of increasing size. Social relationships between ego and alters in layers close to ego are stronger than those belonging to more external layers. Online Social Networks are becoming a fundamental medium for hu...
Analysis and Reduction of Complex Networks Under Uncertainty
Energy Technology Data Exchange (ETDEWEB)
Knio, Omar M
2014-04-09
This is a collaborative proposal that aims at developing new methods for the analysis and reduction of complex multiscale networks under uncertainty. The approach is based on combining methods of computational singular perturbation (CSP) and probabilistic uncertainty quantification. In deterministic settings, CSP yields asymptotic approximations of reduced-dimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing uncertainty raises fundamentally new issues, particularly concerning its impact on the topology of slow manifolds, and means to represent and quantify associated variability. To address these challenges, this project uses polynomial chaos (PC) methods to reformulate uncertain network models, and to analyze them using CSP in probabilistic terms. Specific objectives include (1) developing effective algorithms that can be used to illuminate fundamental and unexplored connections among model reduction, multiscale behavior, and uncertainty, and (2) demonstrating the performance of these algorithms through applications to model problems.
Exploring function prediction in protein interaction networks via clustering methods.
Trivodaliev, Kire; Bogojeska, Aleksandra; Kocarev, Ljupco
2014-01-01
Complex networks have recently become the focus of research in many fields. Their structure reveals crucial information for the nodes, how they connect and share information. In our work we analyze protein interaction networks as complex networks for their functional modular structure and later use that information in the functional annotation of proteins within the network. We propose several graph representations for the protein interaction network, each having different level of complexity and inclusion of the annotation information within the graph. We aim to explore what the benefits and the drawbacks of these proposed graphs are, when they are used in the function prediction process via clustering methods. For making this cluster based prediction, we adopt well established approaches for cluster detection in complex networks using most recent representative algorithms that have been proven as efficient in the task at hand. The experiments are performed using a purified and reliable Saccharomyces cerevisiae protein interaction network, which is then used to generate the different graph representations. Each of the graph representations is later analysed in combination with each of the clustering algorithms, which have been possibly modified and implemented to fit the specific graph. We evaluate results in regards of biological validity and function prediction performance. Our results indicate that the novel ways of presenting the complex graph improve the prediction process, although the computational complexity should be taken into account when deciding on a particular approach.
Exploring function prediction in protein interaction networks via clustering methods.
Directory of Open Access Journals (Sweden)
Kire Trivodaliev
Full Text Available Complex networks have recently become the focus of research in many fields. Their structure reveals crucial information for the nodes, how they connect and share information. In our work we analyze protein interaction networks as complex networks for their functional modular structure and later use that information in the functional annotation of proteins within the network. We propose several graph representations for the protein interaction network, each having different level of complexity and inclusion of the annotation information within the graph. We aim to explore what the benefits and the drawbacks of these proposed graphs are, when they are used in the function prediction process via clustering methods. For making this cluster based prediction, we adopt well established approaches for cluster detection in complex networks using most recent representative algorithms that have been proven as efficient in the task at hand. The experiments are performed using a purified and reliable Saccharomyces cerevisiae protein interaction network, which is then used to generate the different graph representations. Each of the graph representations is later analysed in combination with each of the clustering algorithms, which have been possibly modified and implemented to fit the specific graph. We evaluate results in regards of biological validity and function prediction performance. Our results indicate that the novel ways of presenting the complex graph improve the prediction process, although the computational complexity should be taken into account when deciding on a particular approach.
Modified network simulation model with token method of bus access
Directory of Open Access Journals (Sweden)
L.V. Stribulevich
2013-08-01
Full Text Available Purpose. To study the characteristics of the local network with the marker method of access to the bus its modified simulation model was developed. Methodology. Defining characteristics of the network is carried out on the developed simulation model, which is based on the state diagram-layer network station with the mechanism of processing priorities, both in steady state and in the performance of control procedures: the initiation of a logical ring, the entrance and exit of the station network with a logical ring. Findings. A simulation model, on the basis of which can be obtained the dependencies of the application the maximum waiting time in the queue for different classes of access, and the reaction time usable bandwidth on the data rate, the number of network stations, the generation rate applications, the number of frames transmitted per token holding time, frame length was developed. Originality. The technique of network simulation reflecting its work in the steady condition and during the control procedures, the mechanism of priority ranking and handling was proposed. Practical value. Defining network characteristics in the real-time systems on railway transport based on the developed simulation model.
Understanding resilience in industrial symbiosis networks: insights from network analysis.
Chopra, Shauhrat S; Khanna, Vikas
2014-08-01
Industrial symbiotic networks are based on the principles of ecological systems where waste equals food, to develop synergistic networks. For example, industrial symbiosis (IS) at Kalundborg, Denmark, creates an exchange network of waste, water, and energy among companies based on contractual dependency. Since most of the industrial symbiotic networks are based on ad-hoc opportunities rather than strategic planning, gaining insight into disruptive scenarios is pivotal for understanding the balance of resilience and sustainability and developing heuristics for designing resilient IS networks. The present work focuses on understanding resilience as an emergent property of an IS network via a network-based approach with application to the Kalundborg Industrial Symbiosis (KIS). Results from network metrics and simulated disruptive scenarios reveal Asnaes power plant as the most critical node in the system. We also observe a decrease in the vulnerability of nodes and reduction in single points of failure in the system, suggesting an increase in the overall resilience of the KIS system from 1960 to 2010. Based on our findings, we recommend design strategies, such as increasing diversity, redundancy, and multi-functionality to ensure flexibility and plasticity, to develop resilient and sustainable industrial symbiotic networks. Copyright © 2014 Elsevier Ltd. All rights reserved.
Using structural equation modeling for network meta-analysis.
Tu, Yu-Kang; Wu, Yun-Chun
2017-07-14
Network meta-analysis overcomes the limitations of traditional pair-wise meta-analysis by incorporating all available evidence into a general statistical framework for simultaneous comparisons of several treatments. Currently, network meta-analyses are undertaken either within the Bayesian hierarchical linear models or frequentist generalized linear mixed models. Structural equation modeling (SEM) is a statistical method originally developed for modeling causal relations among observed and latent variables. As random effect is explicitly modeled as a latent variable in SEM, it is very flexible for analysts to specify complex random effect structure and to make linear and nonlinear constraints on parameters. The aim of this article is to show how to undertake a network meta-analysis within the statistical framework of SEM. We used an example dataset to demonstrate the standard fixed and random effect network meta-analysis models can be easily implemented in SEM. It contains results of 26 studies that directly compared three treatment groups A, B and C for prevention of first bleeding in patients with liver cirrhosis. We also showed that a new approach to network meta-analysis based on the technique of unrestricted weighted least squares (UWLS) method can also be undertaken using SEM. For both the fixed and random effect network meta-analysis, SEM yielded similar coefficients and confidence intervals to those reported in the previous literature. The point estimates of two UWLS models were identical to those in the fixed effect model but the confidence intervals were greater. This is consistent with results from the traditional pairwise meta-analyses. Comparing to UWLS model with common variance adjusted factor, UWLS model with unique variance adjusted factor has greater confidence intervals when the heterogeneity was larger in the pairwise comparison. The UWLS model with unique variance adjusted factor reflects the difference in heterogeneity within each comparison
The Global Research Collaboration of Network Meta-Analysis: A Social Network Analysis.
Li, Lun; Catalá-López, Ferrán; Alonso-Arroyo, Adolfo; Tian, Jinhui; Aleixandre-Benavent, Rafael; Pieper, Dawid; Ge, Long; Yao, Liang; Wang, Quan; Yang, Kehu
Research collaborations in biomedical research have evolved over time. No studies have addressed research collaboration in network meta-analysis (NMA). In this study, we used social network analysis methods to characterize global collaboration patterns of published NMAs over the past decades. PubMed, EMBASE, Web of Science and the Cochrane Library were searched (at 9th July, 2015) to include systematic reviews incorporating NMA. Two reviewers independently selected studies and cross-checked the standardized data. Data was analyzed using Ucinet 6.0 and SPSS 17.0. NetDraw software was used to draw social networks. 771 NMAs published in 336 journals from 3459 authors and 1258 institutions in 49 countries through the period 1997-2015 were included. More than three-quarters (n = 625; 81.06%) of the NMAs were published in the last 5-years. The BMJ (4.93%), Current Medical Research and Opinion (4.67%) and PLOS One (4.02%) were the journals that published the greatest number of NMAs. The UK and the USA (followed by Canada, China, the Netherlands, Italy and Germany) headed the absolute global productivity ranking in number of NMAs. The top 20 authors and institutions with the highest publication rates were identified. Overall, 43 clusters of authors (four major groups: one with 37 members, one with 12 members, one with 11 members and one with 10 members) and 21 clusters of institutions (two major groups: one with 62 members and one with 20 members) were identified. The most prolific authors were affiliated with academic institutions and private consulting firms. 181 consulting firms and pharmaceutical industries (14.39% of institutions) were involved in 199 NMAs (25.81% of total publications). Although there were increases in international and inter-institution collaborations, the research collaboration by authors, institutions and countries were still weak and most collaboration groups were small sizes. Scientific production on NMA is increasing worldwide with research
Synchronization analysis of coloured delayed networks under ...
Indian Academy of Sciences (India)
Up to now, many network models on synchronization have been put forward, such as, the small-world network, directed network, neural network etc. Previous efforts were mainly to study the outer relationship between the nodes. But, the inner interaction is always overlooked. Afterwards, the coloured network model has ...
Hybrid methods for cybersecurity analysis :
Energy Technology Data Exchange (ETDEWEB)
Davis, Warren Leon,; Dunlavy, Daniel M.
2014-01-01
Early 2010 saw a signi cant change in adversarial techniques aimed at network intrusion: a shift from malware delivered via email attachments toward the use of hidden, embedded hyperlinks to initiate sequences of downloads and interactions with web sites and network servers containing malicious software. Enterprise security groups were well poised and experienced in defending the former attacks, but the new types of attacks were larger in number, more challenging to detect, dynamic in nature, and required the development of new technologies and analytic capabilities. The Hybrid LDRD project was aimed at delivering new capabilities in large-scale data modeling and analysis to enterprise security operators and analysts and understanding the challenges of detection and prevention of emerging cybersecurity threats. Leveraging previous LDRD research e orts and capabilities in large-scale relational data analysis, large-scale discrete data analysis and visualization, and streaming data analysis, new modeling and analysis capabilities were quickly brought to bear on the problems in email phishing and spear phishing attacks in the Sandia enterprise security operational groups at the onset of the Hybrid project. As part of this project, a software development and deployment framework was created within the security analyst work ow tool sets to facilitate the delivery and testing of new capabilities as they became available, and machine learning algorithms were developed to address the challenge of dynamic threats. Furthermore, researchers from the Hybrid project were embedded in the security analyst groups for almost a full year, engaged in daily operational activities and routines, creating an atmosphere of trust and collaboration between the researchers and security personnel. The Hybrid project has altered the way that research ideas can be incorporated into the production environments of Sandias enterprise security groups, reducing time to deployment from months and
A graph clustering method for community detection in complex networks
Zhou, HongFang; Li, Jin; Li, JunHuai; Zhang, FaCun; Cui, YingAn
2017-03-01
Information mining from complex networks by identifying communities is an important problem in a number of research fields, including the social sciences, biology, physics and medicine. First, two concepts are introduced, Attracting Degree and Recommending Degree. Second, a graph clustering method, referred to as AR-Cluster, is presented for detecting community structures in complex networks. Third, a novel collaborative similarity measure is adopted to calculate node similarities. In the AR-Cluster method, vertices are grouped together based on calculated similarity under a K-Medoids framework. Extensive experimental results on two real datasets show the effectiveness of AR-Cluster.
Gene Expression Network Reconstruction by LEP Method Using Microarray Data
Directory of Open Access Journals (Sweden)
Na You
2012-01-01
Full Text Available Gene expression network reconstruction using microarray data is widely studied aiming to investigate the behavior of a gene cluster simultaneously. Under the Gaussian assumption, the conditional dependence between genes in the network is fully described by the partial correlation coefficient matrix. Due to the high dimensionality and sparsity, we utilize the LEP method to estimate it in this paper. Compared to the existing methods, the LEP reaches the highest PPV with the sensitivity controlled at the satisfactory level. A set of gene expression data from the HapMap project is analyzed for illustration.
Network meta-analysis: an introduction for clinicians.
Rouse, Benjamin; Chaimani, Anna; Li, Tianjing
2017-02-01
Network meta-analysis is a technique for comparing multiple treatments simultaneously in a single analysis by combining direct and indirect evidence within a network of randomized controlled trials. Network meta-analysis may assist assessing the comparative effectiveness of different treatments regularly used in clinical practice and, therefore, has become attractive among clinicians. However, if proper caution is not taken in conducting and interpreting network meta-analysis, inferences might be biased. The aim of this paper is to illustrate the process of network meta-analysis with the aid of a working example on first-line medical treatment for primary open-angle glaucoma. We discuss the key assumption of network meta-analysis, as well as the unique considerations for developing appropriate research questions, conducting the literature search, abstracting data, performing qualitative and quantitative synthesis, presenting results, drawing conclusions, and reporting the findings in a network meta-analysis.
Differential Regulatory Analysis Based on Coexpression Network in Cancer Research
Directory of Open Access Journals (Sweden)
Junyi Li
2016-01-01
Full Text Available With rapid development of high-throughput techniques and accumulation of big transcriptomic data, plenty of computational methods and algorithms such as differential analysis and network analysis have been proposed to explore genome-wide gene expression characteristics. These efforts are aiming to transform underlying genomic information into valuable knowledges in biological and medical research fields. Recently, tremendous integrative research methods are dedicated to interpret the development and progress of neoplastic diseases, whereas differential regulatory analysis (DRA based on gene coexpression network (GCN increasingly plays a robust complement to regular differential expression analysis in revealing regulatory functions of cancer related genes such as evading growth suppressors and resisting cell death. Differential regulatory analysis based on GCN is prospective and shows its essential role in discovering the system properties of carcinogenesis features. Here we briefly review the paradigm of differential regulatory analysis based on GCN. We also focus on the applications of differential regulatory analysis based on GCN in cancer research and point out that DRA is necessary and extraordinary to reveal underlying molecular mechanism in large-scale carcinogenesis studies.
Applications of social media and social network analysis
Kazienko, Przemyslaw
2015-01-01
This collection of contributed chapters demonstrates a wide range of applications within two overlapping research domains: social media analysis and social network analysis. Various methodologies were utilized in the twelve individual chapters including static, dynamic and real-time approaches to graph, textual and multimedia data analysis. The topics apply to reputation computation, emotion detection, topic evolution, rumor propagation, evaluation of textual opinions, friend ranking, analysis of public transportation networks, diffusion in dynamic networks, analysis of contributors to commun
A Design Tool Utilizing Stoichiometric Structure for the Analysis of Biochemical Reaction Networks
1990-05-20
for the Analysis of Biochemical Reaction Networks 12.PERSONAL AUTHOR(S) Captain Stephen E. Kelly 13a.TYPE OF REPORT I 13b.TIME COVERED I14.DATE OF...necessary’apd identify by bldck numbe&)"War A method is proposed for the analysis of possible distributions of pro’ cts in biochemical reaction networks using...consistency and closure in fermentation material balanc-. -iSeveral biochemical reaction networks were examined. A proposed pathway for the biosynthetic
Syphilis Networks in Louisiana: An Analysis of Network Configuration and Disease Transmission
Desmarais, Catherine Theresa
Background: In 2009, Louisiana had the highest rate of primary and secondary syphilis in the country. Recent partner notification approaches have been insufficient in addressing Louisiana's deeply entrenched areas of syphilis infection. Prior researchers have suggested that surveillance systems may benefit from utilizing social and spatial network analysis in syphilis control efforts. Objective: To expand the understanding of the spread of syphilis in Louisiana, and to add new tools to the state's case finding resources through the description of the characteristics of cases of early syphilis and their partners in Louisiana, the socio-sexual networks of these cases, and the geospatial clustering of cases and partners. Methods: Utilizing state surveillance data, all cases of primary, secondary, and early latent syphilis that were diagnosed in 2009 and data on their sexual or needle sharing partners were analyzed using a combination of descriptive, network, and geospatial measures. Results: In 2009, Louisiana experienced a high rate of heterosexual syphilis transmission. Within syphilis transmission networks, 50.8% of all cases were female and 84.2% of all cases were black. The average and median ages of males with reactive syphilis tests were higher than that of females in Louisiana, and in 88.9% of regions, older individuals were more likely to have a syphilis test than no test. A greater proportion of males (11.4%) refused to discuss partners than females (7.4%) and a greater proportion of males (5.5%) refused testing and prophylactic treatment than females (2.8%). No distinct patterns were seen in disease prevalence between regions based upon demographic data. Classic summary network measures such as density, degree, centrality, and betweenness provided little information on similarities and differences between the different regions in Louisiana. All measures indicated low density and extreme fragmentation of networks in Louisiana. The majority of network
Stochastic analysis of complex reaction networks using binomial moment equations
Barzel, Baruch; Biham, Ofer
2012-09-01
The stochastic analysis of complex reaction networks is a difficult problem because the number of microscopic states in such systems increases exponentially with the number of reactive species. Direct integration of the master equation is thus infeasible and is most often replaced by Monte Carlo simulations. While Monte Carlo simulations are a highly effective tool, equation-based formulations are more amenable to analytical treatment and may provide deeper insight into the dynamics of the network. Here, we present a highly efficient equation-based method for the analysis of stochastic reaction networks. The method is based on the recently introduced binomial moment equations [Barzel and Biham, Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.106.150602 106, 150602 (2011)]. The binomial moments are linear combinations of the ordinary moments of the probability distribution function of the population sizes of the interacting species. They capture the essential combinatorics of the reaction processes reflecting their stoichiometric structure. This leads to a simple and transparent form of the equations, and allows a highly efficient and surprisingly simple truncation scheme. Unlike ordinary moment equations, in which the inclusion of high order moments is prohibitively complicated, the binomial moment equations can be easily constructed up to any desired order. The result is a set of equations that enables the stochastic analysis of complex reaction networks under a broad range of conditions. The number of equations is dramatically reduced from the exponential proliferation of the master equation to a polynomial (and often quadratic) dependence on the number of reactive species in the binomial moment equations. The aim of this paper is twofold: to present a complete derivation of the binomial moment equations; to demonstrate the applicability of the moment equations for a representative set of example networks, in which stochastic effects play an important role.
Stochastic analysis of complex reaction networks using binomial moment equations.
Barzel, Baruch; Biham, Ofer
2012-09-01
The stochastic analysis of complex reaction networks is a difficult problem because the number of microscopic states in such systems increases exponentially with the number of reactive species. Direct integration of the master equation is thus infeasible and is most often replaced by Monte Carlo simulations. While Monte Carlo simulations are a highly effective tool, equation-based formulations are more amenable to analytical treatment and may provide deeper insight into the dynamics of the network. Here, we present a highly efficient equation-based method for the analysis of stochastic reaction networks. The method is based on the recently introduced binomial moment equations [Barzel and Biham, Phys. Rev. Lett. 106, 150602 (2011)]. The binomial moments are linear combinations of the ordinary moments of the probability distribution function of the population sizes of the interacting species. They capture the essential combinatorics of the reaction processes reflecting their stoichiometric structure. This leads to a simple and transparent form of the equations, and allows a highly efficient and surprisingly simple truncation scheme. Unlike ordinary moment equations, in which the inclusion of high order moments is prohibitively complicated, the binomial moment equations can be easily constructed up to any desired order. The result is a set of equations that enables the stochastic analysis of complex reaction networks under a broad range of conditions. The number of equations is dramatically reduced from the exponential proliferation of the master equation to a polynomial (and often quadratic) dependence on the number of reactive species in the binomial moment equations. The aim of this paper is twofold: to present a complete derivation of the binomial moment equations; to demonstrate the applicability of the moment equations for a representative set of example networks, in which stochastic effects play an important role.
National Research Council Canada - National Science Library
Rhiannon Edge; Joseph Heath; Barry Rowlingson; Thomas J Keegan; Rachel Isba
2015-01-01
.... Methods We used a social network analysis approach to look at vaccination distribution within the network of the Lancaster Medical School students and combined these data with the students' beliefs...
Outlier Detection Method Use for the Network Flow Anomaly Detection
Directory of Open Access Journals (Sweden)
Rimas Ciplinskas
2016-06-01
Full Text Available New and existing methods of cyber-attack detection are constantly being developed and improved because there is a great number of attacks and the demand to protect from them. In prac-tice, current methods of attack detection operates like antivirus programs, i. e. known attacks signatures are created and attacks are detected by using them. These methods have a drawback – they cannot detect new attacks. As a solution, anomaly detection methods are used. They allow to detect deviations from normal network behaviour that may show a new type of attack. This article introduces a new method that allows to detect network flow anomalies by using local outlier factor algorithm. Accom-plished research allowed to identify groups of features which showed the best results of anomaly flow detection according the highest values of precision, recall and F-measure.
Cluster Analysis Based on Bipartite Network
Directory of Open Access Journals (Sweden)
Dawei Zhang
2014-01-01
Full Text Available Clustering data has a wide range of applications and has attracted considerable attention in data mining and artificial intelligence. However it is difficult to find a set of clusters that best fits natural partitions without any class information. In this paper, a method for detecting the optimal cluster number is proposed. The optimal cluster number can be obtained by the proposal, while partitioning the data into clusters by FCM (Fuzzy c-means algorithm. It overcomes the drawback of FCM algorithm which needs to define the cluster number c in advance. The method works by converting the fuzzy cluster result into a weighted bipartite network and then the optimal cluster number can be detected by the improved bipartite modularity. The experimental results on artificial and real data sets show the validity of the proposed method.
Echo state network prediction method and its application in flue gas turbine condition prediction
Wang, Shaohong; Chen, Tao; Xu, Xiaoli
2010-12-01
On the background of the complex production process of fluid catalytic cracking energy recovery system in large-scale petrochemical refineries, this paper introduced an improved echo state network (ESN) model prediction method which is used to address the condition trend prediction problem of the key power equipment--flue gas turbine. Singular value decomposition method was used to obtain the ESN output weight. Through selecting the appropriate parameters and discarding small singular value, this method overcame the defective solution problem in the prediction by using the linear regression algorithm, improved the prediction performance of echo state network, and gave the network prediction process. In order to solve the problem of noise contained in production data, the translation-invariant wavelet transform analysis method is combined to denoise the noisy time series before prediction. Condition trend prediction results show the effectiveness of the proposed method.
Zachariadis, Markos; Oborn, Eivor; Barrett, Michael; Zollinger-Read, Paul
2013-01-01
Objective To explore the relational challenges for general practitioner (GP) leaders setting up new network-centric commissioning organisations in the recent health policy reform in England, we use innovation network theory to identify key network leadership practices that facilitate healthcare innovation. Design Mixed-method, multisite and case study research. Setting Six clinical commissioning groups and local clusters in the East of England area, covering in total 208 GPs and 1 662 000 population. Methods Semistructured interviews with 56 lead GPs, practice managers and staff from the local health authorities (primary care trusts, PCT) as well as various healthcare professionals; 21 observations of clinical commissioning group (CCG) board and executive meetings; electronic survey of 58 CCG board members (these included GPs, practice managers, PCT employees, nurses and patient representatives) and subsequent social network analysis. Main outcome measures Collaborative relationships between CCG board members and stakeholders from their healthcare network; clarifying the role of GPs as network leaders; strengths and areas for development of CCGs. Results Drawing upon innovation network theory provides unique insights of the CCG leaders’ activities in establishing best practices and introducing new clinical pathways. In this context we identified three network leadership roles: managing knowledge flows, managing network coherence and managing network stability. Knowledge sharing and effective collaboration among GPs enable network stability and the alignment of CCG objectives with those of the wider health system (network coherence). Even though activities varied between commissioning groups, collaborative initiatives were common. However, there was significant variation among CCGs around the level of engagement with providers, patients and local authorities. Locality (sub) groups played an important role because they linked commissioning decisions with
Reverse Engineering Cellular Networks with Information Theoretic Methods
Directory of Open Access Journals (Sweden)
Julio R. Banga
2013-05-01
Full Text Available Building mathematical models of cellular networks lies at the core of systems biology. It involves, among other tasks, the reconstruction of the structure of interactions between molecular components, which is known as network inference or reverse engineering. Information theory can help in the goal of extracting as much information as possible from the available data. A large number of methods founded on these concepts have been proposed in the literature, not only in biology journals, but in a wide range of areas. Their critical comparison is difficult due to the different focuses and the adoption of different terminologies. Here we attempt to review some of the existing information theoretic methodologies for network inference, and clarify their differences. While some of these methods have achieved notable success, many challenges remain, among which we can mention dealing with incomplete measurements, noisy data, counterintuitive behaviour emerging from nonlinear relations or feedback loops, and computational burden of dealing with large data sets.
Approximation methods for efficient learning of Bayesian networks
Riggelsen, C
2008-01-01
This publication offers and investigates efficient Monte Carlo simulation methods in order to realize a Bayesian approach to approximate learning of Bayesian networks from both complete and incomplete data. For large amounts of incomplete data when Monte Carlo methods are inefficient, approximations are implemented, such that learning remains feasible, albeit non-Bayesian. The topics discussed are: basic concepts about probabilities, graph theory and conditional independence; Bayesian network learning from data; Monte Carlo simulation techniques; and, the concept of incomplete data. In order to provide a coherent treatment of matters, thereby helping the reader to gain a thorough understanding of the whole concept of learning Bayesian networks from (in)complete data, this publication combines in a clarifying way all the issues presented in the papers with previously unpublished work.
Models as Tools of Analysis of a Network Organisation
Directory of Open Access Journals (Sweden)
Wojciech Pająk
2013-06-01
Full Text Available The paper presents models which may be applied as tools of analysis of a network organisation. The starting point of the discussion is defining the following terms: supply chain and network organisation. Further parts of the paper present basic assumptions analysis of a network organisation. Then the study characterises the best known models utilised in analysis of a network organisation. The purpose of the article is to define the notion and the essence of network organizations and to present the models used for their analysis.
Core and peripheral connectivity based cluster analysis over PPI network.
Ahmed, Hasin A; Bhattacharyya, Dhruba K; Kalita, Jugal K
2015-12-01
A number of methods have been proposed in the literature of protein-protein interaction (PPI) network analysis for detection of clusters in the network. Clusters are identified by these methods using various graph theoretic criteria. Most of these methods have been found time consuming due to involvement of preprocessing and post processing tasks. In addition, they do not achieve high precision and recall consistently and simultaneously. Moreover, the existing methods do not employ the idea of core-periphery structural pattern of protein complexes effectively to extract clusters. In this paper, we introduce a clustering method named CPCA based on a recent observation by researchers that a protein complex in a PPI network is arranged as a relatively dense core region and additional proteins weakly connected to the core. CPCA uses two connectivity criterion functions to identify core and peripheral regions of the cluster. To locate initial node of a cluster we introduce a measure called DNQ (Degree based Neighborhood Qualification) index that evaluates tendency of the node to be part of a cluster. CPCA performs well when compared with well-known counterparts. Along with protein complex gold standards, a co-localization dataset has also been used for validation of the results. Copyright © 2015 Elsevier Ltd. All rights reserved.
Analysis and application of intelligence network based on FTTH
Feng, Xiancheng; Yun, Xiang
2008-12-01
With the continued rapid growth of Internet, new network service emerges in endless stream, especially the increase of network game, meeting TV, video on demand, etc. The bandwidth requirement increase continuously. Network technique, optical device technical development is swift and violent. FTTH supports all present and future service with enormous bandwidth, including traditional telecommunication service, traditional data service and traditional TV service, and the future digital TV and VOD. With huge bandwidth of FTTH, it wins the final solution of broadband network, becomes the final goal of development of optical access network. Firstly, it introduces the main service which FTTH supports, main analysis key technology such as FTTH system composition way, topological structure, multiplexing, optical cable and device. It focus two kinds of realization methods - PON, P2P technology. Then it proposed that the solution of FTTH can support comprehensive access (service such as broadband data, voice, video and narrowband private line). Finally, it shows the engineering application for FTTH in the district and building. It brings enormous economic benefits and social benefit.
Assessing Partnership Alternatives in an IT Network Employing Analytical Methods
Directory of Open Access Journals (Sweden)
Vahid Reza Salamat
2016-01-01
Full Text Available One of the main critical success factors for the companies is their ability to build and maintain an effective collaborative network. This is more critical in the IT industry where the development of sustainable competitive advantage requires an integration of various resources, platforms, and capabilities provided by various actors. Employing such a collaborative network will dramatically change the operations management and promote flexibility and agility. Despite its importance, there is a lack of an analytical tool on collaborative network building process. In this paper, we propose an optimization model employing AHP and multiobjective programming for collaborative network building process based on two interorganizational relationships’ theories, namely, (i transaction cost theory and (ii resource-based view, which are representative of short-term and long-term considerations. The five different methods were employed to solve the formulation and their performances were compared. The model is implemented in an IT company who was in process of developing a large-scale enterprise resource planning (ERP system. The results show that the collaborative network formed through this selection process was more efficient in terms of cost, time, and development speed. The framework offers novel theoretical underpinning and analytical solutions and can be used as an effective tool in selecting network alternatives.
Quantitative Method for Network Security Situation Based on Attack Prediction
Directory of Open Access Journals (Sweden)
Hao Hu
2017-01-01
Full Text Available Multistep attack prediction and security situation awareness are two big challenges for network administrators because future is generally unknown. In recent years, many investigations have been made. However, they are not sufficient. To improve the comprehensiveness of prediction, in this paper, we quantitatively convert attack threat into security situation. Actually, two algorithms are proposed, namely, attack prediction algorithm using dynamic Bayesian attack graph and security situation quantification algorithm based on attack prediction. The first algorithm aims to provide more abundant information of future attack behaviors by simulating incremental network penetration. Through timely evaluating the attack capacity of intruder and defense strategies of defender, the likely attack goal, path, and probability and time-cost are predicted dynamically along with the ongoing security events. Furthermore, in combination with the common vulnerability scoring system (CVSS metric and network assets information, the second algorithm quantifies the concealed attack threat into the surfaced security risk from two levels: host and network. Examples show that our method is feasible and flexible for the attack-defense adversarial network environment, which benefits the administrator to infer the security situation in advance and prerepair the critical compromised hosts to maintain normal network communication.
A Method for Group Extraction in Complex Social Networks
Bródka, Piotr; Musial, Katarzyna; Kazienko, Przemysław
The extraction of social groups from social networks existing among employees in the company, its customers or users of various computer systems became one of the research areas of growing importance. Once we have discovered the groups, we can utilise them, in different kinds of recommender systems or in the analysis of the team structure and communication within a given population.
Analysis of regulatory networks constructed based on gene ...
Indian Academy of Sciences (India)
Gene coexpression patterns can reveal gene collections with functional consistency. This study systematically constructs regulatory networks for pituitary tumours by integrating gene coexpression, transcriptional and posttranscriptional regulation. Through network analysis, we elaborate the incidence mechanism of pituitary ...
Analysis of regulatory networks constructed based on gene ...
Indian Academy of Sciences (India)
2013-12-09
Dec 9, 2013 ... Abstract. Gene coexpression patterns can reveal gene collections with functional consistency. This study systematically constructs regulatory networks for pituitary tumours by integrating gene coexpression, transcriptional and posttranscriptional regulation. Through network analysis, we elaborate the ...
Directory of Open Access Journals (Sweden)
Yong Jeong
2017-05-01
Full Text Available Brain function is often characterized by the connections and interactions between highly interconnected brain regions. Pathological disruptions in these networks often result in brain dysfunction, which manifests as brain disease. Typical analysis investigates disruptions in network connectivity based correlations between large brain regions. To obtain a more detailed description of disruptions in network connectivity, we propose a new method where functional nodes are identified in each region based on their maximum connectivity to another brain region in a given network. Since this method provides a unique approach to identifying functionally relevant nodes in a given network, we can provide a more detailed map of brain connectivity and determine new measures of network connectivity. We applied this method to resting state fMRI of Alzheimer's disease patients to validate our method and found decreased connectivity within the default mode network. In addition, new measure of network connectivity revealed a more detailed description of how the network connections deteriorate with disease progression. This suggests that analysis using key relative network hub regions based on regional correlation can be used to detect detailed changes in resting state network connectivity.
Robustness Analysis of Real Network Topologies Under Multiple Failure Scenarios
DEFF Research Database (Denmark)
Manzano, M.; Marzo, J. L.; Calle, E.
2012-01-01
on topological characteristics. Recently approaches also consider the services supported by such networks. In this paper we carry out a robustness analysis of five real backbone telecommunication networks under defined multiple failure scenarios, taking into account the consequences of the loss of established......Nowadays the ubiquity of telecommunication networks, which underpin and fulfill key aspects of modern day living, is taken for granted. Significant large-scale failures have occurred in the last years affecting telecommunication networks. Traditionally, network robustness analysis has been focused...... connections. Results show which networks are more robust in response to a specific type of failure....
An efficient neural network based method for medical image segmentation.
Torbati, Nima; Ayatollahi, Ahmad; Kermani, Ali
2014-01-01
The aim of this research is to propose a new neural network based method for medical image segmentation. Firstly, a modified self-organizing map (SOM) network, named moving average SOM (MA-SOM), is utilized to segment medical images. After the initial segmentation stage, a merging process is designed to connect the objects of a joint cluster together. A two-dimensional (2D) discrete wavelet transform (DWT) is used to build the input feature space of the network. The experimental results show that MA-SOM is robust to noise and it determines the input image pattern properly. The segmentation results of breast ultrasound images (BUS) demonstrate that there is a significant correlation between the tumor region selected by a physician and the tumor region segmented by our proposed method. In addition, the proposed method segments X-ray computerized tomography (CT) and magnetic resonance (MR) head images much better than the incremental supervised neural network (ISNN) and SOM-based methods. © 2013 Published by Elsevier Ltd.
A hierarchical network modeling method for railway tunnels safety assessment
Zhou, Jin; Xu, Weixiang; Guo, Xin; Liu, Xumin
2017-02-01
Using network theory to model risk-related knowledge on accidents is regarded as potential very helpful in risk management. A large amount of defects detection data for railway tunnels is collected in autumn every year in China. It is extremely important to discover the regularities knowledge in database. In this paper, based on network theories and by using data mining techniques, a new method is proposed for mining risk-related regularities to support risk management in railway tunnel projects. A hierarchical network (HN) model which takes into account the tunnel structures, tunnel defects, potential failures and accidents is established. An improved Apriori algorithm is designed to rapidly and effectively mine correlations between tunnel structures and tunnel defects. Then an algorithm is presented in order to mine the risk-related regularities table (RRT) from the frequent patterns. At last, a safety assessment method is proposed by consideration of actual defects and possible risks of defects gained from the RRT. This method cannot only generate the quantitative risk results but also reveal the key defects and critical risks of defects. This paper is further development on accident causation network modeling methods which can provide guidance for specific maintenance measure.
Logical Modeling and Dynamical Analysis of Cellular Networks.
Abou-Jaoudé, Wassim; Traynard, Pauline; Monteiro, Pedro T; Saez-Rodriguez, Julio; Helikar, Tomáš; Thieffry, Denis; Chaouiya, Claudine
2016-01-01
The logical (or logic) formalism is increasingly used to model regulatory and signaling networks. Complementing these applications, several groups contributed various methods and tools to support the definition and analysis of logical models. After an introduction to the logical modeling framework and to several of its variants, we review here a number of recent methodological advances to ease the analysis of large and intricate networks. In particular, we survey approaches to determine model attractors and their reachability properties, to assess the dynamical impact of variations of external signals, and to consistently reduce large models. To illustrate these developments, we further consider several published logical models for two important biological processes, namely the differentiation of T helper cells and the control of mammalian cell cycle.
Identifying changes in the support networks of end-of-life carers using social network analysis.
Leonard, Rosemary; Horsfall, Debbie; Noonan, Kerrie
2015-06-01
End-of-life caring is often associated with reduced social networks for both the dying person and for the carer. However, those adopting a community participation and development approach, see the potential for the expansion and strengthening of networks. This paper uses Knox, Savage and Harvey's definitions of three generations social network analysis to analyse the caring networks of people with a terminal illness who are being cared for at home and identifies changes in these caring networks that occurred over the period of caring. Participatory network mapping of initial and current networks was used in nine focus groups. The analysis used key concepts from social network analysis (size, density, transitivity, betweenness and local clustering) together with qualitative analyses of the group's reflections on the maps. The results showed an increase in the size of the networks and that ties between the original members of the network strengthened. The qualitative data revealed the importance between core and peripheral network members and the diverse contributions of the network members. The research supports the value of third generation social network analysis and the potential for end-of-life caring to build social capital. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.
Network worlds : from link analysis to virtual places.
Energy Technology Data Exchange (ETDEWEB)
Joslyn, C. (Cliff)
2002-01-01
Significant progress is being made in knowledge systems through recent advances in the science of very large networks. Attention is now turning in many quarters to the potential impact on counter-terrorism methods. After reviewing some of these advances, we will discuss the difference between such 'network analytic' approaches, which focus on large, homogeneous graph strucures, and what we are calling 'link analytic' approaches, which focus on somewhat smaller graphs with heterogeneous link types. We use this venue to begin the process of rigorously defining link analysis methods, especially the concept of chaining of views of multidimensional databases. We conclude with some speculation on potential connections to virtual world architectures.
Positive and negative forms of replicability in gene network analysis.
Verleyen, W; Ballouz, S; Gillis, J
2016-04-01
Gene networks have become a central tool in the analysis of genomic data but are widely regarded as hard to interpret. This has motivated a great deal of comparative evaluation and research into best practices. We explore the possibility that this may lead to overfitting in the field as a whole. We construct a model of 'research communities' sampling from real gene network data and machine learning methods to characterize performance trends. Our analysis reveals an important principle limiting the value of replication, namely that targeting it directly causes 'easy' or uninformative replication to dominate analyses. We find that when sampling across network data and algorithms with similar variability, the relationship between replicability and accuracy is positive (Spearman's correlation, rs ∼0.33) but where no such constraint is imposed, the relationship becomes negative for a given gene function (rs ∼ -0.13). We predict factors driving replicability in some prior analyses of gene networks and show that they are unconnected with the correctness of the original result, instead reflecting replicable biases. Without these biases, the original results also vanish replicably. We show these effects can occur quite far upstream in network data and that there is a strong tendency within protein-protein interaction data for highly replicable interactions to be associated with poor quality control. Algorithms, network data and a guide to the code available at: https://github.com/wimverleyen/AggregateGeneFunctionPrediction jgillis@cshl.edu Supplementary data are available at Bioinformatics online. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Zhong, Suyu; He, Yong; Gong, Gaolang
2015-05-01
Using diffusion MRI, a number of studies have investigated the properties of whole-brain white matter (WM) networks with differing network construction methods (node/edge definition). However, how the construction methods affect individual differences of WM networks and, particularly, if distinct methods can provide convergent or divergent patterns of individual differences remain largely unknown. Here, we applied 10 frequently used methods to construct whole-brain WM networks in a healthy young adult population (57 subjects), which involves two node definitions (low-resolution and high-resolution) and five edge definitions (binary, FA weighted, fiber-density weighted, length-corrected fiber-density weighted, and connectivity-probability weighted). For these WM networks, individual differences were systematically analyzed in three network aspects: (1) a spatial pattern of WM connections, (2) a spatial pattern of nodal efficiency, and (3) network global and local efficiencies. Intriguingly, we found that some of the network construction methods converged in terms of individual difference patterns, but diverged with other methods. Furthermore, the convergence/divergence between methods differed among network properties that were adopted to assess individual differences. Particularly, high-resolution WM networks with differing edge definitions showed convergent individual differences in the spatial pattern of both WM connections and nodal efficiency. For the network global and local efficiencies, low-resolution and high-resolution WM networks for most edge definitions consistently exhibited a highly convergent pattern in individual differences. Finally, the test-retest analysis revealed a decent temporal reproducibility for the patterns of between-method convergence/divergence. Together, the results of the present study demonstrated a measure-dependent effect of network construction methods on the individual difference of WM network properties. © 2015 Wiley
SWOT ANALYSIS ON SAMPLING METHOD
Directory of Open Access Journals (Sweden)
CHIS ANCA OANA
2014-07-01
Full Text Available Audit sampling involves the application of audit procedures to less than 100% of items within an account balance or class of transactions. Our article aims to study audit sampling in audit of financial statements. As an audit technique largely used, in both its statistical and nonstatistical form, the method is very important for auditors. It should be applied correctly for a fair view of financial statements, to satisfy the needs of all financial users. In order to be applied correctly the method must be understood by all its users and mainly by auditors. Otherwise the risk of not applying it correctly would cause loose of reputation and discredit, litigations and even prison. Since there is not a unitary practice and methodology for applying the technique, the risk of incorrectly applying it is pretty high. The SWOT analysis is a technique used that shows the advantages, disadvantages, threats and opportunities. We applied SWOT analysis in studying the sampling method, from the perspective of three players: the audit company, the audited entity and users of financial statements. The study shows that by applying the sampling method the audit company and the audited entity both save time, effort and money. The disadvantages of the method are difficulty in applying and understanding its insight. Being largely used as an audit method and being a factor of a correct audit opinion, the sampling method’s advantages, disadvantages, threats and opportunities must be understood by auditors.
First-Use Analysis of Communication in a Social Network
Itaya, Satoko; Yoshinaga, Naoki; Davis, Peter; Tanaka, Rie; Konishi, Taku; Doi, Shinich; Yamada, Keiji
The study of communication activity in social networks is aimed at understanding and promoting communications in groups, organizations and communities. In this paper, we propose a method for the analysis of communication records to extract content-based network activity, with a focus on first-use. Links between people in a social network are defined based on content and temporal relation of messages sent and received. We introduce the notion of first-use, first-use paths, and classes of users based on first-usage. First-use is defined with respect to a specific time period and specific communication content. It refers to the sending of messages containing the specified contents for the first time before being receiving them from any other user in the specified time period. First-use paths are defined as sequences of first-use events in communication networks, and m-ary classes of users are defined recursively as users who receive for the first time from (m-1)-ary users. We present an example of application of the analysis to the email records of a large company.
A Dynamic Linear Hashing Method for Redundancy Management in Train Ethernet Consist Network
Directory of Open Access Journals (Sweden)
Xiaobo Nie
2016-01-01
Full Text Available Massive transportation systems like trains are considered critical systems because they use the communication network to control essential subsystems on board. Critical system requires zero recovery time when a failure occurs in a communication network. The newly published IEC62439-3 defines the high-availability seamless redundancy protocol, which fulfills this requirement and ensures no frame loss in the presence of an error. This paper adopts these for train Ethernet consist network. The challenge is management of the circulating frames, capable of dealing with real-time processing requirements, fast switching times, high throughout, and deterministic behavior. The main contribution of this paper is the in-depth analysis it makes of network parameters imposed by the application of the protocols to train control and monitoring system (TCMS and the redundant circulating frames discarding method based on a dynamic linear hashing, using the fastest method in order to resolve all the issues that are dealt with.
Dynamic Subsidy Method for Congestion Management in Distribution Networks
Huang, Shaojun; Wu, Qiuwei
2016-01-01
Dynamic subsidy (DS) is a locational price paid by the distribution system operator (DSO) to its customers in order to shift energy consumption to designated hours and nodes. It is promising for demand side management and congestion management. This paper proposes a new DS method for congestion management in distribution networks, including the market mechanism, the mathematical formulation through a two-level optimization, and the method solving the optimization by tightening the constraints...
CEO emotional bias and investment decision, Bayesian network method
Directory of Open Access Journals (Sweden)
Jarboui Anis
2012-08-01
Full Text Available This research examines the determinants of firms’ investment introducing a behavioral perspective that has received little attention in corporate finance literature. The following central hypothesis emerges from a set of recently developed theories: Investment decisions are influenced not only by their fundamentals but also depend on some other factors. One factor is the biasness of any CEO to their investment, biasness depends on the cognition and emotions, because some leaders use them as heuristic for the investment decision instead of fundamentals. This paper shows how CEO emotional bias (optimism, loss aversion and overconfidence affects the investment decisions. The proposed model of this paper uses Bayesian Network Method to examine this relationship. Emotional bias has been measured by means of a questionnaire comprising several items. As for the selected sample, it has been composed of some 100 Tunisian executives. Our results have revealed that the behavioral analysis of investment decision implies leader affected by behavioral biases (optimism, loss aversion, and overconfidence adjusts its investment choices based on their ability to assess alternatives (optimism and overconfidence and risk perception (loss aversion to create of shareholder value and ensure its place at the head of the management team.
Cohesion network analysis of CSCL participation.
Dascalu, Mihai; McNamara, Danielle S; Trausan-Matu, Stefan; Allen, Laura K
2017-04-13
The broad use of computer-supported collaborative-learning (CSCL) environments (e.g., instant messenger-chats, forums, blogs in online communities, and massive open online courses) calls for automated tools to support tutors in the time-consuming process of analyzing collaborative conversations. In this article, the authors propose and validate the cohesion network analysis (CNA) model, housed within the ReaderBench platform. CNA, grounded in theories of cohesion, dialogism, and polyphony, is similar to social network analysis (SNA), but it also considers text content and discourse structure and, uniquely, uses automated cohesion indices to generate the underlying discourse representation. Thus, CNA enhances the power of SNA by explicitly considering semantic cohesion while modeling interactions between participants. The primary purpose of this article is to describe CNA analysis and to provide a proof of concept, by using ten chat conversations in which multiple participants debated the advantages of CSCL technologies. Each participant's contributions were human-scored on the basis of their relevance in terms of covering the central concepts of the conversation. SNA metrics, applied to the CNA sociogram, were then used to assess the quality of each member's degree of participation. The results revealed that the CNA indices were strongly correlated to the human evaluations of the conversations. Furthermore, a stepwise regression analysis indicated that the CNA indices collectively predicted 54% of the variance in the human ratings of participation. The results provide promising support for the use of automated computational assessments of collaborative participation and of individuals' degrees of active involvement in CSCL environments.
Directory of Open Access Journals (Sweden)
TIMCHENKO, L.
2012-11-01
Full Text Available Propositions necessary for development of parallel-hierarchical (PH network training methods are discussed in this article. Unlike already known structures of the artificial neural network, where non-normalized (absolute similarity criteria are used for comparison, the suggested structure uses a normalized criterion. Based on the analysis of training rules, a conclusion is made that application of two training methods with a teacher is optimal for PH network training: error correction-based training and memory-based training. Mathematical models of training and a combined method of PH network training for recognition of static and dynamic patterns are developed.
Gene network analysis in plant development by genomic technologies.
Wellmer, Frank; Riechmann, José Luis
2005-01-01
The analysis of the gene regulatory networks underlying development is of central importance for a better understanding of the mechanisms that control the formation of the different cell-types, tissues or organs of an organism. The recent invention of genomic technologies has opened the possibility of studying these networks at a global level. In this paper, we summarize some of the recent advances that have been made in the understanding of plant development by the application of genomic technologies. We focus on a few specific processes, namely flower and root development and the control of the cell cycle, but we also highlight landmark studies in other areas that opened new avenues of experimentation or analysis. We describe the methods and the strategies that are currently used for the analysis of plant development by genomic technologies, as well as some of the problems and limitations that hamper their application. Since many genomic technologies and concepts were first developed and tested in organisms other than plants, we make reference to work in non-plant species and compare the current state of network analysis in plants to that in other multicellular organisms.
A Latent Variable Clustering Method for Wireless Sensor Networks
DEFF Research Database (Denmark)
Vasilev, Vladislav; Iliev, Georgi; Poulkov, Vladimir
2016-01-01
In this paper we derive a clustering method based on the Hidden Conditional Random Field (HCRF) model in order to maximizes the performance of a wireless sensor. Our novel approach to clustering in this paper is in the application of an index invariant graph that we defined in a previous work...... obtain by running simulations of a time dynamic sensor network. The performance of the proposed method outperforms the existing clustering methods, such as the Girvan-Newmans algorithm, the Kargers algorithm and the Spectral Clustering method, in terms of packet acceptance probability and delay....
A Network Centrality Method for the Rating Problem
2015-01-01
We propose a new method for aggregating the information of multiple users rating multiple items. Our approach is based on the network relations induced between items by the rating activity of the users. Our method correlates better than the simple average with respect to the original rankings of the users, and besides, it is computationally more efficient than other methods proposed in the literature. Moreover, our method is able to discount the information that would be obtained adding to the system additional users with a systematically biased rating activity. PMID:25830502
Xia, Jianguo; Benner, Maia J; Hancock, Robert E W
2014-07-01
Biological network analysis is a powerful approach to gain systems-level understanding of patterns of gene expression in different cell types, disease states and other biological/experimental conditions. Three consecutive steps are required--identification of genes or proteins of interest, network construction and network analysis and visualization. To date, researchers have to learn to use a combination of several tools to accomplish this task. In addition, interactive visualization of large networks has been primarily restricted to locally installed programs. To address these challenges, we have developed NetworkAnalyst, taking advantage of state-of-the-art web technologies, to enable high performance network analysis with rich user experience. NetworkAnalyst integrates all three steps and presents the results via a powerful online network visualization framework. Users can upload gene or protein lists, single or multiple gene expression datasets to perform comprehensive gene annotation and differential expression analysis. Significant genes are mapped to our manually curated protein-protein interaction database to construct relevant networks. The results are presented through standard web browsers for network analysis and interactive exploration. NetworkAnalyst supports common functions for network topology and module analyses. Users can easily search, zoom and highlight nodes or modules, as well as perform functional enrichment analysis on these selections. The networks can be customized with different layouts, colors or node sizes, and exported as PNG, PDF or GraphML files. Comprehensive FAQs, tutorials and context-based tips and instructions are provided. NetworkAnalyst currently supports protein-protein interaction network analysis for human and mouse and is freely available at http://www.networkanalyst.ca. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.
Statistical methods for bioimpedance analysis
Directory of Open Access Journals (Sweden)
Christian Tronstad
2014-04-01
Full Text Available This paper gives a basic overview of relevant statistical methods for the analysis of bioimpedance measurements, with an aim to answer questions such as: How do I begin with planning an experiment? How many measurements do I need to take? How do I deal with large amounts of frequency sweep data? Which statistical test should I use, and how do I validate my results? Beginning with the hypothesis and the research design, the methodological framework for making inferences based on measurements and statistical analysis is explained. This is followed by a brief discussion on correlated measurements and data reduction before an overview is given of statistical methods for comparison of groups, factor analysis, association, regression and prediction, explained in the context of bioimpedance research. The last chapter is dedicated to the validation of a new method by different measures of performance. A flowchart is presented for selection of statistical method, and a table is given for an overview of the most important terms of performance when evaluating new measurement technology.
Co-occurrence network analysis of Chinese and English poems
Liang, Wei; Wang, Yanli; Shi, Yuming; Chen, Guanrong
2015-02-01
A total of 572 co-occurrence networks of Chinese characters and words as well as English words are constructed from both Chinese and English poems. It is found that most of the networks have small-world features; more Chinese networks have scale-free properties and hierarchical structures as compared with the English networks; all the networks are disassortative, and the disassortativeness of the Chinese word networks is more prominent than those of the English networks; the spectral densities of the Chinese word networks and English networks are similar, but they are different from those of the ER, BA, and WS networks. For the above observed phenomena, analysis is provided with interpretation from a linguistic perspective.
Zachariadis, Markos; Oborn, Eivor; Barrett, Michael; Zollinger-Read, Paul
2013-01-01
To explore the relational challenges for general practitioner (GP) leaders setting up new network-centric commissioning organisations in the recent health policy reform in England, we use innovation network theory to identify key network leadership practices that facilitate healthcare innovation. Mixed-method, multisite and case study research. Six clinical commissioning groups and local clusters in the East of England area, covering in total 208 GPs and 1 662 000 population. Semistructured interviews with 56 lead GPs, practice managers and staff from the local health authorities (primary care trusts, PCT) as well as various healthcare professionals; 21 observations of clinical commissioning group (CCG) board and executive meetings; electronic survey of 58 CCG board members (these included GPs, practice managers, PCT employees, nurses and patient representatives) and subsequent social network analysis. Collaborative relationships between CCG board members and stakeholders from their healthcare network; clarifying the role of GPs as network leaders; strengths and areas for development of CCGs. Drawing upon innovation network theory provides unique insights of the CCG leaders' activities in establishing best practices and introducing new clinical pathways. In this context we identified three network leadership roles: managing knowledge flows, managing network coherence and managing network stability. Knowledge sharing and effective collaboration among GPs enable network stability and the alignment of CCG objectives with those of the wider health system (network coherence). Even though activities varied between commissioning groups, collaborative initiatives were common. However, there was significant variation among CCGs around the level of engagement with providers, patients and local authorities. Locality (sub) groups played an important role because they linked commissioning decisions with patient needs and brought the leaders closer to frontline stakeholders
A novel word spotting method based on recurrent neural networks.
Frinken, Volkmar; Fischer, Andreas; Manmatha, R; Bunke, Horst
2012-02-01
Keyword spotting refers to the process of retrieving all instances of a given keyword from a document. In the present paper, a novel keyword spotting method for handwritten documents is described. It is derived from a neural network-based system for unconstrained handwriting recognition. As such it performs template-free spotting, i.e., it is not necessary for a keyword to appear in the training set. The keyword spotting is done using a modification of the CTC Token Passing algorithm in conjunction with a recurrent neural network. We demonstrate that the proposed systems outperform not only a classical dynamic time warping-based approach but also a modern keyword spotting system, based on hidden Markov models. Furthermore, we analyze the performance of the underlying neural networks when using them in a recognition task followed by keyword spotting on the produced transcription. We point out the advantages of keyword spotting when compared to classic text line recognition.
de Andrade, Ricardo Lopes; Rêgo, Leandro Chaves
2018-02-01
The social network analysis (SNA) studies the interactions among actors in a network formed through some relationship (friendship, cooperation, trade, among others). The SNA is constantly approached from a binary point of view, i.e., it is only observed if a link between two actors is present or not regardless of the strength of this link. It is known that different information can be obtained in weighted and unweighted networks and that the information extracted from weighted networks is more accurate and detailed. Another rarely discussed approach in the SNA is related to the individual attributes of the actors (nodes), because such analysis is usually focused on the topological structure of networks. Features of the nodes are not incorporated in the SNA what implies that there is some loss or misperception of information in those analyze. This paper aims at exploring more precisely the complexities of a social network, initially developing a method that inserts the individual attributes in the topological structure of the network and then analyzing the network in four different ways: unweighted, edge-weighted and two methods for using both edge-weights and nodes' attributes. The international trade network was chosen in the application of this approach, where the nodes represent the countries, the links represent the cash flow in the trade transactions and countries' GDP were chosen as nodes' attributes. As a result, it is possible to observe which countries are most connected in the world economy and with higher cash flows, to point out the countries that are central to the intermediation of the wealth flow and those that are most benefited from being included in this network. We also made a principal component analysis to study which metrics are more influential in describing the data variability, which turn out to be mostly the weighted metrics which include the nodes' attributes.
Digital image analysis to quantify carbide networks in ultrahigh carbon steels
Energy Technology Data Exchange (ETDEWEB)
Hecht, Matthew D.; Webler, Bryan A.; Picard, Yoosuf N., E-mail: ypicard@cmu.edu
2016-07-15
A method has been developed and demonstrated to quantify the degree of carbide network connectivity in ultrahigh carbon steels through digital image processing and analysis of experimental micrographs. It was shown that the network connectivity and carbon content can be correlated to toughness for various ultrahigh carbon steel specimens. The image analysis approach first involved segmenting the carbide network and pearlite matrix into binary contrast representations via a grayscale intensity thresholding operation. Next, the carbide network pixels were skeletonized and parceled into braches and nodes, allowing the determination of a connectivity index for the carbide network. Intermediate image processing steps to remove noise and fill voids in the network are also detailed. The connectivity indexes of scanning electron micrographs were consistent in both secondary and backscattered electron imaging modes, as well as across two different (50 × and 100 ×) magnifications. Results from ultrahigh carbon steels reported here along with other results from the literature generally showed lower connectivity indexes correlated with higher Charpy impact energy (toughness). A deviation from this trend was observed at higher connectivity indexes, consistent with a percolation threshold for crack propagation across the carbide network. - Highlights: • A method for carbide network analysis in steels is proposed and demonstrated. • ImageJ method extracts a network connectivity index from micrographs. • Connectivity index consistent in different imaging conditions and magnifications. • Impact energy may plateau when a critical network connectivity is exceeded.
Li, Hong; Ding, Xue
2017-03-01
This paper combines wavelet analysis and wavelet transform theory with artificial neural network, through the pretreatment on point feature attributes before in intrusion detection, to make them suitable for improvement of wavelet neural network. The whole intrusion classification model gets the better adaptability, self-learning ability, greatly enhances the wavelet neural network for solving the problem of field detection invasion, reduces storage space, contributes to improve the performance of the constructed neural network, and reduces the training time. Finally the results of the KDDCup99 data set simulation experiment shows that, this method reduces the complexity of constructing wavelet neural network, but also ensures the accuracy of the intrusion classification.
National Research Council Canada - National Science Library
Kelman, Ilan; Luthe, Tobias; Wyss, Romano; Tørnblad, Silje H; Evers, Yvette; Curran, Marina Martin; Williams, Richard J; Berlow, Eric L
2016-01-01
This study integrates quantitative social network analysis (SNA) and qualitative interviews for understanding tourism business links in isolated communities through analysing spatial characteristics...
Neural node network and model, and method of teaching same
Parlos, A.G.; Atiya, A.F.; Fernandez, B.; Tsai, W.K.; Chong, K.T.
1995-12-26
The present invention is a fully connected feed forward network that includes at least one hidden layer. The hidden layer includes nodes in which the output of the node is fed back to that node as an input with a unit delay produced by a delay device occurring in the feedback path (local feedback). Each node within each layer also receives a delayed output (crosstalk) produced by a delay unit from all the other nodes within the same layer. The node performs a transfer function operation based on the inputs from the previous layer and the delayed outputs. The network can be implemented as analog or digital or within a general purpose processor. Two teaching methods can be used: (1) back propagation of weight calculation that includes the local feedback and the crosstalk or (2) more preferably a feed forward gradient decent which immediately follows the output computations and which also includes the local feedback and the crosstalk. Subsequent to the gradient propagation, the weights can be normalized, thereby preventing convergence to a local optimum. Education of the network can be incremental both on and off-line. An educated network is suitable for modeling and controlling dynamic nonlinear systems and time series systems and predicting the outputs as well as hidden states and parameters. The educated network can also be further educated during on-line processing. 21 figs.
Clustering Financial Time Series by Network Community Analysis
Piccardi, Carlo; Calatroni, Lisa; Bertoni, Fabio
In this paper, we describe a method for clustering financial time series which is based on community analysis, a recently developed approach for partitioning the nodes of a network (graph). A network with N nodes is associated to the set of N time series. The weight of the link (i, j), which quantifies the similarity between the two corresponding time series, is defined according to a metric based on symbolic time series analysis, which has recently proved effective in the context of financial time series. Then, searching for network communities allows one to identify groups of nodes (and then time series) with strong similarity. A quantitative assessment of the significance of the obtained partition is also provided. The method is applied to two distinct case-studies concerning the US and Italy Stock Exchange, respectively. In the US case, the stability of the partitions over time is also thoroughly investigated. The results favorably compare with those obtained with the standard tools typically used for clustering financial time series, such as the minimal spanning tree and the hierarchical tree.
Dependency Network Analysis (DEPNA) Reveals Context Related Influence of Brain Network Nodes.
Jacob, Yael; Winetraub, Yonatan; Raz, Gal; Ben-Simon, Eti; Okon-Singer, Hadas; Rosenberg-Katz, Keren; Hendler, Talma; Ben-Jacob, Eshel
2016-06-07
Communication between and within brain regions is essential for information processing within functional networks. The current methods to determine the influence of one region on another are either based on temporal resolution, or require a predefined model for the connectivity direction. However these requirements are not always achieved, especially in fMRI studies, which have poor temporal resolution. We thus propose a new graph theory approach that focuses on the correlation influence between selected brain regions, entitled Dependency Network Analysis (DEPNA). Partial correlations are used to quantify the level of influence of each node during task performance. As a proof of concept, we conducted the DEPNA on simulated datasets and on two empirical motor and working memory fMRI tasks. The simulations revealed that the DEPNA correctly captures the network's hierarchy of influence. Applying DEPNA to the functional tasks reveals the dynamics between specific nodes as would be expected from prior knowledge. To conclude, we demonstrate that DEPNA can capture the most influencing nodes in the network, as they emerge during specific cognitive processes. This ability opens a new horizon for example in delineating critical nodes for specific clinical interventions.
Multivariate analysis methods for spectroscopic blood analysis
Wood, Michael F. G.; Rohani, Arash; Ghazalah, Rashid; Vitkin, I. Alex; Pawluczyk, Romuald
2012-01-01
Blood tests are an essential tool in clinical medicine with the ability diagnosis or monitor various diseases and conditions; however, the complexities of these measurements currently restrict them to a laboratory setting. P&P Optica has developed and currently produces patented high performance spectrometers and is developing a spectrometer-based system for rapid reagent-free blood analysis. An important aspect of this analysis is the need to extract the analyte specific information from the measured signal such that the analyte concentrations can be determined. To this end, advanced chemometric methods are currently being investigated and have been tested using simulated spectra. A blood plasma model was used to generate Raman, near infrared, and optical rotatory dispersion spectra with glucose as the target analyte. The potential of combined chemometric techniques, where multiple spectroscopy modalities are used in a single regression model to improve the prediction ability was investigated using unfold partial least squares and multiblock partial least squares. Results show improvement in the predictions of glucose levels using the combined methods and demonstrate potential for multiblock chemometrics in spectroscopic blood analysis.
Network-analysis-guided synthesis of weisaconitine D and liljestrandinine
Marth, C. J.; Gallego, G. M.; Lee, J. C.; Lebold, T. P.; Kulyk, S.; Kou, K. G. M.; Qin, J.; Lilien, R.; Sarpong, R.
2015-12-01
General strategies for the chemical synthesis of organic compounds, especially of architecturally complex natural products, are not easily identified. Here we present a method to establish a strategy for such syntheses, which uses network analysis. This approach has led to the identification of a versatile synthetic intermediate that facilitated syntheses of the diterpenoid alkaloids weisaconitine D and liljestrandinine, and the core of gomandonine. We also developed a web-based graphing program that allows network analysis to be easily performed on molecules with complex frameworks. The diterpenoid alkaloids comprise some of the most architecturally complex and functional-group-dense secondary metabolites isolated. Consequently, they present a substantial challenge for chemical synthesis. The synthesis approach described here is a notable departure from other single-target-focused strategies adopted for the syntheses of related structures. Specifically, it affords not only the targeted natural products, but also intermediates and derivatives in the three subfamilies of diterpenoid alkaloids (C-18, C-19 and C-20), and so provides a unified synthetic strategy for these natural products. This work validates the utility of network analysis as a starting point for identifying strategies for the syntheses of architecturally complex secondary metabolites.
Automatic analysis of attack data from distributed honeypot network
Safarik, Jakub; Voznak, MIroslav; Rezac, Filip; Partila, Pavol; Tomala, Karel
2013-05-01
There are many ways of getting real data about malicious activity in a network. One of them relies on masquerading monitoring servers as a production one. These servers are called honeypots and data about attacks on them brings us valuable information about actual attacks and techniques used by hackers. The article describes distributed topology of honeypots, which was developed with a strong orientation on monitoring of IP telephony traffic. IP telephony servers can be easily exposed to various types of attacks, and without protection, this situation can lead to loss of money and other unpleasant consequences. Using a distributed topology with honeypots placed in different geological locations and networks provides more valuable and independent results. With automatic system of gathering information from all honeypots, it is possible to work with all information on one centralized point. Communication between honeypots and centralized data store use secure SSH tunnels and server communicates only with authorized honeypots. The centralized server also automatically analyses data from each honeypot. Results of this analysis and also other statistical data about malicious activity are simply accessible through a built-in web server. All statistical and analysis reports serve as information basis for an algorithm which classifies different types of used VoIP attacks. The web interface then brings a tool for quick comparison and evaluation of actual attacks in all monitored networks. The article describes both, the honeypots nodes in distributed architecture, which monitor suspicious activity, and also methods and algorithms used on the server side for analysis of gathered data.
Castet, Jean-Francois; Saleh, Joseph H
2013-01-01
This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs) allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats) of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also examined, and the
Directory of Open Access Journals (Sweden)
Jean-Francois Castet
Full Text Available This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also
Dynamic Subsidy Method for Congestion Management in Distribution Networks
DEFF Research Database (Denmark)
Huang, Shaojun; Wu, Qiuwei
2016-01-01
Dynamic subsidy (DS) is a locational price paid by the distribution system operator (DSO) to its customers in order to shift energy consumption to designated hours and nodes. It is promising for demand side management and congestion management. This paper proposes a new DS method for congestion...... of the Roy Billinton Test System (RBTS) with high penetration of electric vehicles (EVs) and heat pumps (HPs). The case studies demonstrate the efficacy of the DS method for congestion management in distribution networks. Studies in this paper show that the DS method offers the customers a fair opportunity...
He, Jieyue; Li, Chaojun; Ye, Baoliu; Zhong, Wei
2012-06-25
Most computational algorithms mainly focus on detecting highly connected subgraphs in PPI networks as protein complexes but ignore their inherent organization. Furthermore, many of these algorithms are computationally expensive. However, recent analysis indicates that experimentally detected protein complexes generally contain Core/attachment structures. In this paper, a Greedy Search Method based on Core-Attachment structure (GSM-CA) is proposed. The GSM-CA method detects densely connected regions in large protein-protein interaction networks based on the edge weight and two criteria for determining core nodes and attachment nodes. The GSM-CA method improves the prediction accuracy compared to other similar module detection approaches, however it is computationally expensive. Many module detection approaches are based on the traditional hierarchical methods, which is also computationally inefficient because the hierarchical tree structure produced by these approaches cannot provide adequate information to identify whether a network belongs to a module structure or not. In order to speed up the computational process, the Greedy Search Method based on Fast Clustering (GSM-FC) is proposed in this work. The edge weight based GSM-FC method uses a greedy procedure to traverse all edges just once to separate the network into the suitable set of modules. The proposed methods are applied to the protein interaction network of S. cerevisiae. Experimental results indicate that many significant functional modules are detected, most of which match the known complexes. Results also demonstrate that the GSM-FC algorithm is faster and more accurate as compared to other competing algorithms. Based on the new edge weight definition, the proposed algorithm takes advantages of the greedy search procedure to separate the network into the suitable set of modules. Experimental analysis shows that the identified modules are statistically significant. The algorithm can reduce the
Multicriteria benefit-risk assessment using network meta-analysis.
van Valkenhoef, Gert; Tervonen, Tommi; Zhao, Jing; de Brock, Bert; Hillege, Hans L; Postmus, Douwe
2012-04-01
To enable multicriteria benefit-risk (BR) assessment of any number of alternative treatments using all available evidence from a network of clinical trials. We design a general method for multicriteria decision aiding with criteria measurements from Mixed Treatment Comparison (MTC) analyses. To evaluate the method, we apply it to BR assessment of four second-generation antidepressants and placebo in the setting of a published peer-reviewed systematic review. The analysis without preference information shows that placebo is supported by a wide range of possible preferences. Preference information provided by a clinical expert showed that although treatment with antidepressants is warranted for severely depressed patients, for mildly depressed patients placebo is likely to be the best option. It is difficult to choose between the four antidepressants, and the results of the model indicate a high degree of uncertainty. The designed method enables quantitative BR analysis of alternative treatments using all available evidence from a network of clinical trials. The preference-free analysis can be useful in presenting the results of an MTC considering multiple outcomes. Copyright Â© 2012 Elsevier Inc. All rights reserved.
Network analysis of intrinsic functional brain connectivity in Alzheimer's disease.
Directory of Open Access Journals (Sweden)
Kaustubh Supekar
2008-06-01
Full Text Available Functional brain networks detected in task-free ("resting-state" functional magnetic resonance imaging (fMRI have a small-world architecture that reflects a robust functional organization of the brain. Here, we examined whether this functional organization is disrupted in Alzheimer's disease (AD. Task-free fMRI data from 21 AD subjects and 18 age-matched controls were obtained. Wavelet analysis was applied to the fMRI data to compute frequency-dependent correlation matrices. Correlation matrices were thresholded to create 90-node undirected-graphs of functional brain networks. Small-world metrics (characteristic path length and clustering coefficient were computed using graph analytical methods. In the low frequency interval 0.01 to 0.05 Hz, functional brain networks in controls showed small-world organization of brain activity, characterized by a high clustering coefficient and a low characteristic path length. In contrast, functional brain networks in AD showed loss of small-world properties, characterized by a significantly lower clustering coefficient (p<0.01, indicative of disrupted local connectivity. Clustering coefficients for the left and right hippocampus were significantly lower (p<0.01 in the AD group compared to the control group. Furthermore, the clustering coefficient distinguished AD participants from the controls with a sensitivity of 72% and specificity of 78%. Our study provides new evidence that there is disrupted organization of functional brain networks in AD. Small-world metrics can characterize the functional organization of the brain in AD, and our findings further suggest that these network measures may be useful as an imaging-based biomarker to distinguish AD from healthy aging.
Analysis of Computer Network Information Based on "Big Data"
Li, Tianli
2017-11-01
With the development of the current era, computer network and large data gradually become part of the people's life, people use the computer to provide convenience for their own life, but at the same time there are many network information problems has to pay attention. This paper analyzes the information security of computer network based on "big data" analysis, and puts forward some solutions.
Road Transport Network Analysis In Port-Harcourt Metropolics ...
African Journals Online (AJOL)
Road transport network contributes to the economy of an area as it connects points of origin to destinations. The thrust of this article therefore, is on the analysis of the road networks in Port – Harcourt metropolis with the aim of determining the connectivity of the road networks and the most accessible node. Consequently ...
Neural network analysis of varying trends in real exchange rates
J.F. Kaashoek (Johan); H.K. van Dijk (Herman)
1999-01-01
textabstractIn this paper neural networks are fitted to the real exchange rates of seven industrialized countries. The size and topology of the used networks is found by reducing the size of the network through the use of multiple correlation coefficients, principal component analysis of residuals
Co-occurrence network analysis of modern Chinese poems
Liang, Wei; Wang, Yanli; Shi, Yuming; Chen, Guanrong
2015-02-01
A total of 606 co-occurrence networks of Chinese characters and words are constructed from rhymes, free verses, and prose poems. It is found that 98.5 % of networks have scale-free properties, while 19.8 % of networks do not have small-world features, especially the clustering coefficients in 5.6 % of networks are zero. In addition, 61.4 % of networks have significant hierarchical structures, and 98 % of networks are disassortative. For the above observed phenomena, analysis is provided with interpretation from a linguistic perspective.
A rapid protection switching method in carrier ethernet ring networks
Yuan, Liang; Ji, Meng
2008-11-01
Abstract: Ethernet is the most important Local Area Network (LAN) technology since more than 90% data traffic in access layer is carried on Ethernet. From 10M to 10G, the improving Ethernet technology can be not only used in LAN, but also a good choice for MAN even WAN. MAN are always constructed in ring topology because the ring network could provide resilient path protection by using less resource (fibre or cable) than other network topologies. In layer 2 data networks, spanning tree protocol (STP) is always used to protect transmit link and preventing the formation of logic loop in networks. However, STP cannot guarantee the efficiency of service convergence when link fault happened. In fact, convergent time of networks with STP is about several minutes. Though Rapid Spanning Tree Protocol (RSTP) and Multi-Spanning Tree Protocol (MSTP) improve the STP technology, they still need a couple of seconds to achieve convergence, and can not provide sub-50ms protection switching. This paper presents a novel rapid ring protection method (RRPM) for carrier Ethernet. Unlike other link-fault detection method, it adopts distributed algorithm to detect link fault rapidly (sub-50ms). When networks restore from link fault, it can revert to the original working state. RRPM can provide single ring protection and interconnected ring protection without the formation of super loop. In normal operation, the master node blocks the secondary port for all non-RRPM Ethernet frames belonging to the given RRPM Ring, thereby avoiding a loop in the ring. When link fault happens, the node on which the failure happens moves from the "ring normal" state to the "ring fault" state. It also sends "link down" frame immediately to other nodes and blocks broken port and flushes its forwarding database. Those who receive "link down" frame will flush forwarding database and master node should unblock its secondary port. When the failure restores, the whole ring will revert to the normal state. That is
Analysis of social networks among physicians employed at a medical school.
Yuce, Yilmaz Kemal; Zayim, Nese; Oguz, Basak; Bozkurt, Selen; Isleyen, Filiz; Gulkesen, K Hakan
2014-01-01
Social network analysis is a well-known method for discovering the social complexities of relationships. In this paper, we present the results of its application in a healthcare environment, i.e. a state university hospital. The sociometric method was adopted to collect social network data. The analysis was performed using Pajek. The medical practice/academic and technological networks among physicians of a state university hospital were explored. Monomorphic and polymorphic opinion leaders (OLs) within the networks were identified using the in-degree measure. Cohesiveness were investigated based on network density and average degree. In addition, it was checked if the mentor system may present impact on the formation of social networks among physicians.
Differential network analysis with multiply imputed lipidomic data.
Directory of Open Access Journals (Sweden)
Maiju Kujala
Full Text Available The importance of lipids for cell function and health has been widely recognized, e.g., a disorder in the lipid composition of cells has been related to atherosclerosis caused cardiovascular disease (CVD. Lipidomics analyses are characterized by large yet not a huge number of mutually correlated variables measured and their associations to outcomes are potentially of a complex nature. Differential network analysis provides a formal statistical method capable of inferential analysis to examine differences in network structures of the lipids under two biological conditions. It also guides us to identify potential relationships requiring further biological investigation. We provide a recipe to conduct permutation test on association scores resulted from partial least square regression with multiple imputed lipidomic data from the LUdwigshafen RIsk and Cardiovascular Health (LURIC study, particularly paying attention to the left-censored missing values typical for a wide range of data sets in life sciences. Left-censored missing values are low-level concentrations that are known to exist somewhere between zero and a lower limit of quantification. To make full use of the LURIC data with the missing values, we utilize state of the art multiple imputation techniques and propose solutions to the challenges that incomplete data sets bring to differential network analysis. The customized network analysis helps us to understand the complexities of the underlying biological processes by identifying lipids and lipid classes that interact with each other, and by recognizing the most important differentially expressed lipids between two subgroups of coronary artery disease (CAD patients, the patients that had a fatal CVD event and the ones who remained stable during two year follow-up.
Complex Network Analysis of Brazilian Power Grid
Martins, Gabriela C; Ribeiro, Fabiano L; Forgerini, Fabricio L
2016-01-01
Power Grids and other delivery networks has been attracted some attention by the network literature last decades. Despite the Power Grids dynamics has been controlled by computer systems and human operators, the static features of this type of network can be studied and analyzed. The topology of the Brazilian Power Grid (BPG) was studied in this work. We obtained the spatial structure of the BPG from the ONS (electric systems national operator), consisting of high-voltage transmission lines, generating stations and substations. The local low-voltage substations and local power delivery as well the dynamic features of the network were neglected. We analyze the complex network of the BPG and identify the main topological information, such as the mean degree, the degree distribution, the network size and the clustering coefficient to caracterize the complex network. We also detected the critical locations on the network and, therefore, the more susceptible points to lead to a cascading failure and even to a blac...
A Novel Brain Network Construction Method for Exploring Age-Related Functional Reorganization.
Li, Wei; Wang, Miao; Li, Yapeng; Huang, Yue; Chen, Xi
2016-01-01
The human brain undergoes complex reorganization and changes during aging. Using graph theory, scientists can find differences in topological properties of functional brain networks between young and elderly adults. However, these differences are sometimes significant and sometimes not. Several studies have even identified disparate differences in topological properties during normal aging or in age-related diseases. One possible reason for this issue is that existing brain network construction methods cannot fully extract the "intrinsic edges" to prevent useful signals from being buried into noises. This paper proposes a new subnetwork voting (SNV) method with sliding window to construct functional brain networks for young and elderly adults. Differences in the topological properties of brain networks constructed from the classic and SNV methods were consistent. Statistical analysis showed that the SNV method can identify much more statistically significant differences between groups than the classic method. Moreover, support vector machine was utilized to classify young and elderly adults; its accuracy, based on the SNV method, reached 89.3%, significantly higher than that with classic method. Therefore, the SNV method can improve consistency within a group and highlight differences between groups, which can be valuable for the exploration and auxiliary diagnosis of aging and age-related diseases.
A Novel Brain Network Construction Method for Exploring Age-Related Functional Reorganization
Directory of Open Access Journals (Sweden)
Wei Li
2016-01-01
Full Text Available The human brain undergoes complex reorganization and changes during aging. Using graph theory, scientists can find differences in topological properties of functional brain networks between young and elderly adults. However, these differences are sometimes significant and sometimes not. Several studies have even identified disparate differences in topological properties during normal aging or in age-related diseases. One possible reason for this issue is that existing brain network construction methods cannot fully extract the “intrinsic edges” to prevent useful signals from being buried into noises. This paper proposes a new subnetwork voting (SNV method with sliding window to construct functional brain networks for young and elderly adults. Differences in the topological properties of brain networks constructed from the classic and SNV methods were consistent. Statistical analysis showed that the SNV method can identify much more statistically significant differences between groups than the classic method. Moreover, support vector machine was utilized to classify young and elderly adults; its accuracy, based on the SNV method, reached 89.3%, significantly higher than that with classic method. Therefore, the SNV method can improve consistency within a group and highlight differences between groups, which can be valuable for the exploration and auxiliary diagnosis of aging and age-related diseases.
Regional frequency analysis using Growing Neural Gas network
Abdi, Amin; Hassanzadeh, Yousef; Ouarda, Taha B. M. J.
2017-07-01
The delineation of hydrologically homogeneous regions is an important issue in regional hydrological frequency analysis. In the present study, an application of the Growing Neural Gas (GNG) network for hydrological data clustering is presented. The GNG is an incremental and unsupervised neural network, which is able to adapt its structure during the training procedure without using a prior knowledge of the size and shape of the network. In the GNG algorithm, the Minimum Description Length (MDL) measure as the cluster validity index is utilized for determining the optimal number of clusters (sub-regions). The capability of the proposed algorithm is illustrated by regionalizing drought severities for 40 synoptic weather stations in Iran. To fulfill this aim, first a clustering method is applied to form the sub-regions and then a heterogeneity measure is used to test the degree of heterogeneity of the delineated sub-regions. According to the MDL measure and considering two different indices namely CS and Davies-Bouldin (DB) in the GNG network, the entire study area is subdivided in two sub-regions located in the eastern and western sides of Iran. In order to evaluate the performance of the GNG algorithm, a number of other commonly used clustering methods, like K-means, fuzzy C-means, self-organizing map and Ward method are utilized in this study. The results of the heterogeneity measure based on the L-moments approach reveal that only the GNG algorithm successfully yields homogeneous sub-regions in comparison to the other methods.
The network researchers' network: A social network analysis of the IMP Group 1985-2006
DEFF Research Database (Denmark)
Henneberg, Stephan C. M.; Ziang, Zhizhong; Naudé, Peter
). In this paper, based upon the papers presented at the 22 conferences held to date, we undertake a Social Network Analysis in order to examine the degree of co-publishing that has taken place between this group of researchers. We identify the different components in this database, and examine the large main...... components in some detail. The egonets of three of the original 'founding fathers' are examined in detail, and we draw comparisons as to how their publishing strategies vary. Finally, the paper draws some more general conclusions as to the insights that SNA can bring to those working within business...
Correlation and network analysis of global financial indices.
Kumar, Sunil; Deo, Nivedita
2012-08-01
Random matrix theory (RMT) and network methods are applied to investigate the correlation and network properties of 20 financial indices. The results are compared before and during the financial crisis of 2008. In the RMT method, the components of eigenvectors corresponding to the second largest eigenvalue form two clusters of indices in the positive and negative directions. The components of these two clusters switch in opposite directions during the crisis. The network analysis uses the Fruchterman-Reingold layout to find clusters in the network of indices at different thresholds. At a threshold of 0.6, before the crisis, financial indices corresponding to the Americas, Europe, and Asia-Pacific form separate clusters. On the other hand, during the crisis at the same threshold, the American and European indices combine together to form a strongly linked cluster while the Asia-Pacific indices form a separate weakly linked cluster. If the value of the threshold is further increased to 0.9 then the European indices (France, Germany, and the United Kingdom) are found to be the most tightly linked indices. The structure of the minimum spanning tree of financial indices is more starlike before the crisis and it changes to become more chainlike during the crisis. The average linkage hierarchical clustering algorithm is used to find a clearer cluster structure in the network of financial indices. The cophenetic correlation coefficients are calculated and found to increase significantly, which indicates that the hierarchy increases during the financial crisis. These results show that there is substantial change in the structure of the organization of financial indices during a financial crisis.
Topological and Geometric Tools for the Analysis fo Complex Networks
2013-10-01
faster than the current subgradient techniques for network optimization. Below, we will highlight some of the major advances. Some highlights are...Maximization Most existing work uses dual decomposition and subgradient methods to solve network optimization problems in a distributed manner, which...neighborhood. Simulation results illustrate the significant multiple order of magnitude performance gains of this method relative to subgradient methods
Ching, Wai-Ki; Zhang, Shuqin; Ng, Michael K; Akutsu, Tatsuya
2007-06-15
Probabilistic Boolean networks (PBNs) have been proposed to model genetic regulatory interactions. The steady-state probability distribution of a PBN gives important information about the captured genetic network. The computation of the steady-state probability distribution usually includes construction of the transition probability matrix and computation of the steady-state probability distribution. The size of the transition probability matrix is 2(n)-by-2(n) where n is the number of genes in the genetic network. Therefore, the computational costs of these two steps are very expensive and it is essential to develop a fast approximation method. In this article, we propose an approximation method for computing the steady-state probability distribution of a PBN based on neglecting some Boolean networks (BNs) with very small probabilities during the construction of the transition probability matrix. An error analysis of this approximation method is given and theoretical result on the distribution of BNs in a PBN with at most two Boolean functions for one gene is also presented. These give a foundation and support for the approximation method. Numerical experiments based on a genetic network are given to demonstrate the efficiency of the proposed method.
Sediment Analysis Network for Decision Support (SANDS)
Hardin, D. M.; Keiser, K.; Graves, S. J.; Conover, H.; Ebersole, S.
2009-12-01
Since the year 2000, Eastern Louisiana, coastal Mississippi, Alabama, and the western Florida panhandle have been affected by 28 tropical storms, seven of which were hurricanes. These tropical cyclones have significantly altered normal coastal processes and characteristics in the Gulf region through sediment disturbance. Although tides, seasonality, and agricultural development influence suspended sediment and sediment deposition over periods of time, tropical storm activity has the capability of moving the largest sediment loads in the shortest periods of time for coastal areas. The importance of sediments upon water quality, coastal erosion, habitats and nutrients has made their study and monitoring vital to decision makers in the region. Currently agencies such as United States Army Corps of Engineers (USACE), NASA, and Geological Survey of Alabama (GSA) are employing a variety of in-situ and airborne based measurements to assess and monitor sediment loading and deposition. These methods provide highly accurate information but are limited in geographic range, are not continuous over a region and, in the case of airborne LIDAR are expensive and do not recur on a regular basis. Multi-temporal and multi-spectral satellite imagery that shows tropical-storm-induced suspended sediment and storm-surge sediment deposits can provide decision makers with immediate and long-term information about the impacts of tropical storms and hurricanes. It can also be valuable for those conducting research and for projects related to coastal issues such as recovery, planning, management, and mitigation. The recently awarded Sediment Analysis Network for Decision Support will generate decision support products using NASA satellite observations from MODIS, Landsat and SeaWiFS instruments to support resource management, planning, and decision making activities in the Gulf of Mexico. Specifically, SANDS will generate decision support products that address the impacts of tropical storms
Analysis of neural networks through base functions
van der Zwaag, B.J.; Slump, Cornelis H.; Spaanenburg, L.
Problem statement. Despite their success-story, neural networks have one major disadvantage compared to other techniques: the inability to explain comprehensively how a trained neural network reaches its output; neural networks are not only (incorrectly) seen as a "magic tool" but possibly even more
Synchronization analysis of coloured delayed networks under ...
Indian Academy of Sciences (India)
This paper investigates synchronization of coloured delayed networks under decentralized pinning intermittent control. To begin with, the time delays are taken into account in the coloured networks. In addition, we propose a decentralized pinning intermittent control for coloured delayed networks, which is different from that ...
Spectral Modelling for Spatial Network Analysis
Nourian, P.; Rezvani, S.; Sariyildiz, I.S.; van der Hoeven, F.D.; Attar, Ramtin; Chronis, Angelos; Hanna, Sean; Turrin, Michela
2016-01-01
Spatial Networks represent the connectivity structure between units of space as a weighted graph whose links are weighted as to the strength of connections. In case of urban spatial networks, the units of space correspond closely to streets and in architectural spatial networks the units correspond
Network biology methods integrating biological data for translational science
Bebek, Gurkan; Koyutürk, Mehmet; Price, Nathan D.; Chance, Mark R.
2012-01-01
The explosion of biomedical data, both on the genomic and proteomic side as well as clinical data, will require complex integration and analysis to provide new molecular variables to better understand the molecular basis of phenotype. Currently, much data exist in silos and is not analyzed in frameworks where all data are brought to bear in the development of biomarkers and novel functional targets. This is beginning to change. Network biology approaches, which emphasize the interactions betw...
Firdausiah Mansur, Andi Besse; Yusof, Norazah
2013-01-01
Clustering on Social Learning Network still not explored widely, especially when the network focuses on e-learning system. Any conventional methods are not really suitable for the e-learning data. SNA requires content analysis, which involves human intervention and need to be carried out manually. Some of the previous clustering techniques need…
Final Report. Analysis and Reduction of Complex Networks Under Uncertainty
Energy Technology Data Exchange (ETDEWEB)
Marzouk, Youssef M. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States); Coles, T. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States); Spantini, A. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States); Tosatto, L. [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)
2013-09-30
The project was a collaborative effort among MIT, Sandia National Laboratories (local PI Dr. Habib Najm), the University of Southern California (local PI Prof. Roger Ghanem), and The Johns Hopkins University (local PI Prof. Omar Knio, now at Duke University). Our focus was the analysis and reduction of large-scale dynamical systems emerging from networks of interacting components. Such networks underlie myriad natural and engineered systems. Examples important to DOE include chemical models of energy conversion processes, and elements of national infrastructure—e.g., electric power grids. Time scales in chemical systems span orders of magnitude, while infrastructure networks feature both local and long-distance connectivity, with associated clusters of time scales. These systems also blend continuous and discrete behavior; examples include saturation phenomena in surface chemistry and catalysis, and switching in electrical networks. Reducing size and stiffness is essential to tractable and predictive simulation of these systems. Computational singular perturbation (CSP) has been effectively used to identify and decouple dynamics at disparate time scales in chemical systems, allowing reduction of model complexity and stiffness. In realistic settings, however, model reduction must contend with uncertainties, which are often greatest in large-scale systems most in need of reduction. Uncertainty is not limited to parameters; one must also address structural uncertainties—e.g., whether a link is present in a network—and the impact of random perturbations, e.g., fluctuating loads or sources. Research under this project developed new methods for the analysis and reduction of complex multiscale networks under uncertainty, by combining computational singular perturbation (CSP) with probabilistic uncertainty quantification. CSP yields asymptotic approximations of reduceddimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing
The analysis of VERITAS muon images using convolutional neural networks
Feng, Qi; Lin, Tony T. Y.; VERITAS Collaboration
2017-06-01
Imaging atmospheric Cherenkov telescopes (IACTs) are sensitive to rare gamma-ray photons, buried in the background of charged cosmic-ray (CR) particles, the flux of which is several orders of magnitude greater. The ability to separate gamma rays from CR particles is important, as it is directly related to the sensitivity of the instrument. This gamma-ray/CR-particle classification problem in IACT data analysis can be treated with the rapidly-advancing machine learning algorithms, which have the potential to outperform the traditional box-cut methods on image parameters. We present preliminary results of a precise classification of a small set of muon events using a convolutional neural networks model with the raw images as input features. We also show the possibility of using the convolutional neural networks model for regression problems, such as the radius and brightness measurement of muon events, which can be used to calibrate the throughput efficiency of IACTs.
Comparative analysis of weighted gene co-expression networks in human and mouse.
Eidsaa, Marius; Stubbs, Lisa; Almaas, Eivind
2017-01-01
The application of complex network modeling to analyze large co-expression data sets has gained traction during the last decade. In particular, the use of the weighted gene co-expression network analysis framework has allowed an unbiased and systems-level investigation of genotype-phenotype relationships in a wide range of systems. Since mouse is an important model organism for biomedical research on human disease, it is of great interest to identify similarities and differences in the functional roles of human and mouse orthologous genes. Here, we develop a novel network comparison approach which we demonstrate by comparing two gene-expression data sets from a large number of human and mouse tissues. The method uses weighted topological overlap alongside the recently developed network-decomposition method of s-core analysis, which is suitable for making gene-centrality rankings for weighted networks. The aim is to identify globally central genes separately in the human and mouse networks. By comparing the ranked gene lists, we identify genes that display conserved or diverged centrality-characteristics across the networks. This framework only assumes a single threshold value that is chosen from a statistical analysis, and it may be applied to arbitrary network structures and edge-weight distributions, also outside the context of biology. When conducting the comparative network analysis, both within and across the two species, we find a clear pattern of enrichment of transcription factors, for the homeobox domain in particular, among the globally central genes. We also perform gene-ontology term enrichment analysis and look at disease-related genes for the separate networks as well as the network comparisons. We find that gene ontology terms related to regulation and development are generally enriched across the networks. In particular, the genes FOXE3, RHO, RUNX2, ALX3 and RARA, which are disease genes in either human or mouse, are on the top-10 list of globally
Data Farming Process and Initial Network Analysis Capabilities
Directory of Open Access Journals (Sweden)
Gary Horne
2016-01-01
Full Text Available Data Farming, network applications and approaches to integrate network analysis and processes to the data farming paradigm are presented as approaches to address complex system questions. Data Farming is a quantified approach that examines questions in large possibility spaces using modeling and simulation. It evaluates whole landscapes of outcomes to draw insights from outcome distributions and outliers. Social network analysis and graph theory are widely used techniques for the evaluation of social systems. Incorporation of these techniques into the data farming process provides analysts examining complex systems with a powerful new suite of tools for more fully exploring and understanding the effect of interactions in complex systems. The integration of network analysis with data farming techniques provides modelers with the capability to gain insight into the effect of network attributes, whether the network is explicitly defined or emergent, on the breadth of the model outcome space and the effect of model inputs on the resultant network statistics.
Samarasinghe, S; Ling, H
parameters and protein concentrations similar to the original RNN system. Results thus demonstrated the reliability of the proposed RNN method for modelling relatively large networks by modularisation for practical settings. Advantages of the method are its ability to represent accurate continuous system dynamics and ease of: parameter estimation through training with data from a practical setting, model analysis (40% faster than ODE), fine tuning parameters when more data are available, sub-model extension when new elements and/or interactions come to light and model expansion with addition of sub-models. Copyright © 2017 Elsevier B.V. All rights reserved.
Privacy Breach Analysis in Social Networks
Nagle, Frank
This chapter addresses various aspects of analyzing privacy breaches in social networks. We first review literature that defines three types of privacy breaches in social networks: interactive, active, and passive. We then survey the various network anonymization schemes that have been constructed to address these privacy breaches. After exploring these breaches and anonymization schemes, we evaluate a measure for determining the level of anonymity inherent in a network graph based on its topological structure. Finally, we close by emphasizing the difficulty of anonymizing social network data while maintaining usability for research purposes and offering areas for future work.
Subgraph "backbone" analysis of dynamic brain networks during consciousness and anesthesia.
Shin, Jeongkyu; Mashour, George A; Ku, Seungwoo; Kim, Seunghwan; Lee, Uncheol
2013-01-01
General anesthesia significantly alters brain network connectivity. Graph-theoretical analysis has been used extensively to study static brain networks but may be limited in the study of rapidly changing brain connectivity during induction of or recovery from general anesthesia. Here we introduce a novel method to study the temporal evolution of network modules in the brain. We recorded multichannel electroencephalograms (EEG) from 18 surgical patients who underwent general anesthesia with either propofol (n = 9) or sevoflurane (n = 9). Time series data were used to reconstruct networks; each electroencephalographic channel was defined as a node and correlated activity between the channels was defined as a link. We analyzed the frequency of subgraphs in the network with a defined number of links; subgraphs with a high probability of occurrence were deemed network "backbones." We analyzed the behavior of network backbones across consciousness, anesthetic induction, anesthetic maintenance, and two points of recovery. Constitutive, variable and state-specific backbones were identified across anesthetic state transitions. Brain networks derived from neurophysiologic data can be deconstructed into network backbones that change rapidly across states of consciousness. This technique enabled a granular description of network evolution over time. The concept of network backbones may facilitate graph-theoretical analysis of dynamically changing networks.
Thermodynamics-based Metabolite Sensitivity Analysis in metabolic networks.
Kiparissides, A; Hatzimanikatis, V
2017-01-01
The increasing availability of large metabolomics datasets enhances the need for computational methodologies that can organize the data in a way that can lead to the inference of meaningful relationships. Knowledge of the metabolic state of a cell and how it responds to various stimuli and extracellular conditions can offer significant insight in the regulatory functions and how to manipulate them. Constraint based methods, such as Flux Balance Analysis (FBA) and Thermodynamics-based flux analysis (TFA), are commonly used to estimate the flow of metabolites through genome-wide metabolic networks, making it possible to identify the ranges of flux values that are consistent with the studied physiological and thermodynamic conditions. However, unless key intracellular fluxes and metabolite concentrations are known, constraint-based models lead to underdetermined problem formulations. This lack of information propagates as uncertainty in the estimation of fluxes and basic reaction properties such as the determination of reaction directionalities. Therefore, knowledge of which metabolites, if measured, would contribute the most to reducing this uncertainty can significantly improve our ability to define the internal state of the cell. In the present work we combine constraint based modeling, Design of Experiments (DoE) and Global Sensitivity Analysis (GSA) into the Thermodynamics-based Metabolite Sensitivity Analysis (TMSA) method. TMSA ranks metabolites comprising a metabolic network based on their ability to constrain the gamut of possible solutions to a limited, thermodynamically consistent set of internal states. TMSA is modular and can be applied to a single reaction, a metabolic pathway or an entire metabolic network. This is, to our knowledge, the first attempt to use metabolic modeling in order to provide a significance ranking of metabolites to guide experimental measurements. Copyright © 2016 International Metabolic Engineering Society. Published by Elsevier
Urban Traffic Signal System Control Structural Optimization Based on Network Analysis
Directory of Open Access Journals (Sweden)
Li Wang
2013-01-01
Full Text Available Advanced urban traffic signal control systems such as SCOOT and SCATS normally coordinate traffic network using multilevel hierarchical control mechanism. In this mechanism, several key intersections will be selected from traffic signal network and the network will be divided into different control subareas. Traditionally, key intersection selection and control subareas division are executed according to dynamic traffic counts and link length between intersections, which largely rely on traffic engineers’ experience. However, it omits important inherent characteristics of traffic network topology. In this paper, we will apply network analysis approach into these two aspects for traffic system control structure optimization. Firstly, the modified C-means clustering algorithm will be proposed to assess the importance of intersections in traffic network and furthermore determine the key intersections based on three indexes instead of merely on traffic counts in traditional methods. Secondly, the improved network community discovery method will be used to give more reasonable evidence in traffic control subarea division. Finally, to test the effectiveness of network analysis approach, a hardware-in-loop simulation environment composed of regional traffic control system, microsimulation software and signal controller hardware, will be built. Both traditional method and proposed approach will be implemented on simulation test bed to evaluate traffic operation performance indexes, for example, travel time, stop times, delay and average vehicle speed. Simulation results show that the proposed network analysis approach can improve the traffic control system operation performance effectively.
Jun Won Kim; Bung-Nyun Kim; Johanna Inhyang Kim; Young Sik Lee; Kyung Joon Min; Hyun-Jin Kim; Jaewon Lee
2015-01-01
Introduction Social network analysis has emerged as a promising tool in modern social psychology. This method can be used to examine friend-based social relationships in terms of network theory, with nodes representing individual students and ties representing relationships between students (e.g., friendships and kinships). Using social network analysis, we investigated whether greater severity of ADHD symptoms is correlated with weaker peer relationships among elementary school students. Met...
Analysis of clusterization and networking processes in developing intermodal transportation
Directory of Open Access Journals (Sweden)
Sinkevičius Gintaras
2016-06-01
Full Text Available Analysis of the processes of clusterization and networking draws attention to the necessity of integration of railway transport into the intermodal or multimodal transport chain. One of the most widespread methods of combined transport is interoperability of railway and road transport. The objective is to create an uninterrupted transport chain in combining several modes of transport. The aim of this is to save energy resources, to form an effective, competitive, attractive to the client and safe and environmentally friendly transport system.