Results 31 to 40 of about 232,761 (262)
Semi-Markov Graph Dynamics [PDF]
PLoS ONE, 2011 In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process.
RABERTO, MARCO +2 more
openaire +10 more sources
SELF-ADAPTIVE SOFTWARE DESIGN BASED ON THE COMPUTING PROCESS’S TRACE TECHNOLOGY
Известия высших учебных заведений. Поволжский регион:Технические науки, 2020 Background. The problem of creating a universal technology for the development of self-adaptive software (SW) has become more and more urgent in recent years, due to the breadth of application of complex software systems and high requirements for ...
A. S. Bozhday +2 more
doaj +1 more source
Journal of King Saud University: Computer and Information Sciences, 2023 We propose a novel hierarchical graph-based text classification framework that leverages the power of contextual node embedding and BERT-based dynamic fusion to capture the complex relationships between the nodes in the hierarchical graph and generate a ...
Aytuğ Onan
doaj +1 more source
Dynamic Balanced Graph Partitioning [PDF]
SIAM Journal on Discrete Mathematics, 2020 This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between $n$ nodes, with patterns that may change over time, the objective is to service these requests efficiently by partitioning the nodes into $\ell$ clusters, each of size $k ...
Chen Avin +4 more
openaire +3 more sources
HcRPC: Highly Compact Reachability Preserving Graph Compression With Corrections
IEEE Access, 2019 Graphs are used in numerous applications to model real-world systems and phenomena. The ever increasing size of graphs makes them difficult to query and analyze.
Rui Bing +4 more
doaj +1 more source
Information spreading in dynamic graphs [PDF]
Proceedings of the 2012 ACM symposium on Principles of distributed computing, 2012 We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian dynamic graph process, that is, processes in which the topology of the graph at time $t$ depends only on its topology ...
Andrea Clementi +2 more
openaire +5 more sources
EntropyBitcoin transaction anomaly detection is essential for maintaining financial market stability. A significant challenge is capturing the dynamically evolving transaction patterns within transaction networks.
Bo Xiao, Wei Yin
doaj +1 more source
Applied SciencesVarious types of anomalies can arise in cyber–physical production systems, caused by either faulty devices or incorrect processes. Anomalies within individual devices can often be detected by applying machine learning techniques to the respective ...
Christian Goetz, Bernhard G. Humm
doaj +1 more source
Hybrid Graph Models for Traffic Prediction
Applied Sciences, 2023 Obtaining accurate road conditions is crucial for traffic management, dynamic route planning, and intelligent guidance services. The complex spatial correlation and nonlinear temporal dependence pose great challenges to obtaining accurate road conditions.
Renyi Chen, Huaxiong Yao
doaj +1 more source