2,926 Hits in 6.5 sec

Dynamic Laplace: Efficient Centrality Measure for Weighted or Unweighted Evolving Networks [article]

Mário Cordeiro, Pavel Brazdil Doctoral Program in Informatics Engineering - Faculty of Engineering at University of Porto, INESC TEC - Institute for Systems and Computer Engineering Technology and Science)
2018 arXiv   pre-print
Results have shown that our incremental versions of the algorithm can calculate node centralities in large networks, faster and efficiently than the corresponding batch version in both incremental and  ...  Incremental and dynamic versions of centrality measures are starting to emerge (betweenness, closeness, etc).  ...  Rui Portocarrero Sarmento also gratefully acknowledges funding from FCT (Portuguese Foundation for Science and Technology) through a PhD grant (SFRH/BD/119108/2016)  ... 
arXiv:1808.02960v1 fatcat:ln4iygshbffivcphm5ki7qc6bu

Evolving Networks and Social Network Analysis Methods and Techniques [chapter]

Mário Cordeiro, Rui P. Sarmento, Pavel Brazdil, João Gama
2018 Social Media and Journalism - Trends, Connections, Implications  
dynamic versions that allow the efficient analysis of evolving networks.  ...  The challenges suggest that significant further research is required in evolving social networks, i.e., existent methods, techniques, and algorithms must be rethought and designed toward incremental and  ...  The authors also want to thank the reviewers for the constructive reviews provided in the development of this publication.  ... 
doi:10.5772/intechopen.79041 fatcat:x4m2g5borjfijknqck54ierppq

The Algorithms of Distributed Learning and Distributed Estimation about Intelligent Wireless Sensor Network

Fuxiao Tan
2020 Sensors  
First, based on algebraic graph, three basic theoretical frameworks for distributed learning and distributed parameter estimation of cooperative strategy are surveyed: increment strategy, consensus strategy  ...  Therefore, three basic intelligent network topologies of centralized, non-cooperative, and cooperative are intensively investigated in this paper.  ...  Algorithm 1 : 1 Increment strategy for distributed learning. 1: for each time i ≥ 0 do 2: Algorithm 2 : 2 Consensus strategy for distributed learning. 1: for each time i ≥ 0 do 2: Figure 5 . 5 The  ... 
doi:10.3390/s20051302 pmid:32121025 pmcid:PMC7085642 fatcat:wthw2dib5beufl5djyev3fdzva

The incremental subgradient methods on distributed estimations in-network

Hui Feng, ZiDong Jiang, Bo Hu, JianQiu Zhang
2014 Science China Information Sciences  
A unified framework on distributed estimations in-network using incremental subgradient (IS) methods is introduced.  ...  Analytical and simulation results show that the IS framework can solve general nonlinear estimation problems in-network, and achieve comparable performances as the centralized estimators.  ...  Traditional in-network signal processing methods are fulfilled on a fusion center, where centralized algorithms handle all the data or measurements from nodes and then export the results to the network  ... 
doi:10.1007/s11432-013-4944-0 fatcat:skvdjrap6ffvhgphj6q3rpcgvm

A Gillespie algorithm for non-Markovian stochastic processes [article]

Naoki Masuda, Luis E. C. Rocha
2016 arXiv   pre-print
In the present study, we propose an innovative Gillespie algorithm for renewal processes on the basis of the Laplace transform.  ...  The Gillespie algorithm provides statistically exact methods for simulating stochastic dynamics modelled as interacting sequences of discrete events including systems of biochemical reactions or earthquake  ...  There exists a Gillespie algorithm to run dynamical processes on such empirical temporal networks [3] .  ... 
arXiv:1601.01490v2 fatcat:fkibfxqkvffblhrhbzfvhit5ey

A Gillespie Algorithm for Non-Markovian Stochastic Processes

Naoki Masuda, Luis E. C. Rocha
2018 SIAM Review  
The Gillespie algorithm is an efficient and statistically exact algorithm for multivariate Poisson processes [21, 22, 39] .  ...  In the present study, we propose an innovative Gillespie algorithm for renewal processes on the basis of the Laplace transform.  ...  There exists a Gillespie algorithm to run dynamical processes on such empirical temporal networks [70] .  ... 
doi:10.1137/16m1055876 fatcat:whc2synxbrdtnfmpnvpytr5huy

An Optimized Strategy Coverage Control Algorithm for WSN

Zeyu Sun, Weiguo Wu, Huanzhao Wang, Heng Chen, Wei Wei
2014 International Journal of Distributed Sensor Networks  
For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed.  ...  Secondly, OSCC makes efficient analysis of the calculating results figure out the least number of sensor nodes to cover specific monitoring area.  ...  Coverage control plays a vital role in coverage efficiency of wireless sensor network.  ... 
doi:10.1155/2014/976307 fatcat:camumw7jmrdmjkdxfgihppiale

Evaluating Methods for Efficient Community Detection in Social Networks

Andreas Kanavos, Yorghos Voutos, Foteini Grivokostopoulou, Phivos Mylonas
2022 Information  
This paper presents the evaluation of six established community-discovery algorithms, namely Breadth-First Search, CNM, Louvain, MaxToMin, Newman–Girvan and Propinquity Dynamics, in terms of four widely  ...  The process of discovering common features between groups of users, entitled "community detection", is a fundamental feature for social network analysis, wherein the vertices represent the users and the  ...  Network Indices In principle, the Laplace matrix sets out the fundamental elements for understanding the proposed framework for defining network indices L = D − A ( 5 ) where L is the Laplace matrix, D  ... 
doi:10.3390/info13050209 fatcat:y7r3xxoctzg37fxbbyvnibtkwm

An Incremental Learning Method Based on Dynamic Ensemble RVM for Intrusion Detection

Zhijun Wu, Pan Gao, Lei Cui, Jiusheng Chen
2021 IEEE Transactions on Network and Service Management  
Therefore, we propose an intrusion detection method of dynamic ensemble incremental learning (DEIL-RVM), and realize a dynamically adjusted ensemble intrusion detection model.  ...  Due to the dynamic changes of network data over time, static intrusion detection systems cannot adapt well to the behavioral characteristics of the input network data, resulting in reduced detection accuracy  ...  the Central Universities of China (ZXH2012P004, 3122021026).  ... 
doi:10.1109/tnsm.2021.3102388 fatcat:t42lk6cyvvbjverj72kietduqy

Distributed cooperative control for economic operation of multiple plug-in electric vehicle parking decks

Shengyao Xu, Hajir Pourbabak, Wencong Su
2017 International Transactions on Electrical Energy Systems  
In this paper, we proposes a consensus-based distributed cooperative control algorithm to determine the best operation strategy for the operator/owner of multiple parking decks.  ...  The proposed distributed control approach completely eliminates the reliance on a central controller to make an optimal decision while still satisfying a variety of global and local constraints.  ...  [21] developed a cooperative distributed algorithm for PEV charging control based on KKT conditions and consensus network theorem. Miranda et al.  ... 
doi:10.1002/etep.2348 fatcat:ni2lsu7mbjecho3kse3qwfjxpm

Distributed Secondary Control of Islanded Microgrids for Fast Convergence Considering Arbitrary Sampling

Yinqiu Hong, Jihua Xie, Fang Fang
2021 Processes  
Then, the execution process of the fast convergence algorithm is described for weighted average state estimation, with the illustration of corresponding features and the application in cooperative control  ...  This paper proposes a novel distributed secondary control of MGs for fast convergence considering asynchronous sampling.  ...  The large-signal dynamic model for the system is first established, which consists of an inverter, network and loads.  ... 
doi:10.3390/pr9060971 fatcat:msroowpqebdyzdw5jic3trnyie

A Dynamic Privacy Protection Mechanism for Spatiotemporal Crowdsourcing

Tianen Liu, Yingjie Wang, Zhipeng Cai, Xiangrong Tong, Qingxian Pan, Jindong Zhao
2020 Security and Communication Networks  
In addition, this paper designs the dynamic k-anonymity algorithm based on the previous anonymous results.  ...  Therefore, this paper proposes a spatiotemporal privacy protection (STPP) method based on dynamic clustering methods to solve the privacy protection problem for crowd participants in spatiotemporal crowdsourcing  ...  For example, in [19] , Chen et al. studied the energy-efficient task offloading in mobile edge computing (MEC).  ... 
doi:10.1155/2020/8892954 fatcat:g4hypqfz2jgr3nzjdlbp2z3kom

Hybrid Optical and Electrical Network Flows Scheduling in Cloud Data Centres

Ibrahim Kabiru Musa, Stuart Walker
2013 International Journal of Computer Science & Information Technology (IJCSIT)  
Here, we propose an efficient strategy for flow selection and placement suitable for hybrid Intra-cloud data centre networks.  ...  We further present techniques for investigating bottlenecks in a packet networks and for the selection of flows to switch in circuit network.  ...  The pseudo-code (Algorithm 1) includes the following steps: • Network nodes send traffic flow statistics updates to centralized controller. • A traffic manager then generates a traffic matrix with source  ... 
doi:10.5121/ijcsit.2013.5201 fatcat:n5bspzy6prdknbazuthqx7gj5m

Operation Cost Minimization of Droop-Controlled AC Microgrids Using Multiagent-Based Distributed Control

Chendan Li, Mehdi Savaghebi, Josep Guerrero, Ernane Coelho, Juan Vasquez
2016 Energies  
to improve the efficiency of the whole system.  ...  An optimal power command is obtained through carefully designed consensus algorithm by using sparse communication links only among neighbouring agents.  ...  Then the proposed incremental cost consensus algorithm is explained, with its convergence analysis and convergence dynamic analysis.  ... 
doi:10.3390/en9090717 fatcat:jovpomfbsfd6jpk4vq6ibwex5e

Distributed Autonomous Economic Control Strategy for Microgrid Considering Event Triggering Mechanism [chapter]

Yulong Xiong, Shihong Miao, Weichen Yang, Zhiwei Liu
2021 Frontiers in Artificial Intelligence and Applications  
Aiming at the coordination and efficient regulation of distributed resources in microgrid, this paper proposes a distributed autonomous economic control strategy for microgrid considering event triggering  ...  First, a distributed autonomous economic control architecture is built to provide a distributed operation architecture for optimal regulation of the microgrid.  ...  Olati-Saber [8] proposed a basic theoretical framework for the analysis of consensus algorithms in multi-converter networks, which lays an algorithm foundation for the research of consensus control in  ... 
doi:10.3233/faia210396 fatcat:5kzkpoxeuzf6vfznls7z4hlwc4
« Previous Showing results 1 — 15 out of 2,926 results