High-performance mesoscopic traffic simulation with GPU for large scale networks

Author(s):  
Vinh An Vu ◽  
Gary Tan
2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Vinícius da Fonseca Vieira ◽  
Carolina Ribeiro Xavier ◽  
Nelson Francisco Favilla Ebecken ◽  
Alexandre Gonçalves Evsukoff

Community structure detection is one of the major research areas of network science and it is particularly useful for large real networks applications. This work presents a deep study of the most discussed algorithms for community detection based on modularity measure: Newman’s spectral method using a fine-tuning stage and the method of Clauset, Newman, and Moore (CNM) with its variants. The computational complexity of the algorithms is analysed for the development of a high performance code to accelerate the execution of these algorithms without compromising the quality of the results, according to the modularity measure. The implemented code allows the generation of partitions with modularity values consistent with the literature and it overcomes 1 million nodes with Newman’s spectral method. The code was applied to a wide range of real networks and the performances of the algorithms are evaluated.


2021 ◽  
Author(s):  
Eleonora De Filippi ◽  
Anira Escrichs ◽  
Matthieu Gilson ◽  
Marti Sanchez-Fibla ◽  
Estela Camara ◽  
...  

In the past decades, there has been a growing scientific interest in characterizing neural correlates of meditation training. Nonetheless, the mechanisms underlying meditation remain elusive. In the present work, we investigated meditation-related changes in structural and functional connectivities (SC and FC, respectively). For this purpose, we scanned experienced meditators and control (naive) subjects using magnetic resonance imaging (MRI) to acquire structural and functional data during two conditions, resting-state and meditation (focused attention on breathing). In this way, we aimed to characterize and distinguish both short-term and long-term modifications in the brain's structure and function. First, we performed a network-based analysis of anatomical connectivity. Then, to analyze the fMRI data, we calculated whole-brain effective connectivity (EC) estimates, relying on a dynamical network model to replicate BOLD signals' spatio-temporal structure, akin to FC with lagged correlations. We compared the estimated EC, FC, and SC links as features to train classifiers to predict behavioral conditions and group identity. The whole-brain SC analysis revealed strengthened anatomical connectivity across large-scale networks for meditators compared to controls. We found that differences in SC were reflected in the functional domain as well. We demonstrated through a machine-learning approach that EC features were more informative than FC and SC solely. Using EC features we reached high performance for the condition-based classification within each group and moderately high accuracies when comparing the two groups in each condition. Moreover, we showed that the most informative EC links that discriminated between meditators and controls involved the same large-scale networks previously found to have increased anatomical connectivity. Overall, the results of our whole-brain model-based approach revealed a mechanism underlying meditation by providing causal relationships at the structure-function level.


2014 ◽  
Vol 721 ◽  
pp. 693-698
Author(s):  
Bin Xie ◽  
Xuan Liu ◽  
Yu Chang Mo

During the reliability analysis of infrastructure networks based on Binary Decision Diagram (BDD), we studied the high performance start node for edge ordering. We use node’s betweenness to divide the network into several partitions, and show the relation between high performance start nodes and network partitions. We summarized the distribution patterns of the high performance start nodes. The experiment results on selected aviation network shows that we can select high performance ordering start nodes for large-scale networks by using these patterns and network partitions. Thus, we can enhance the performance of network reliability analysis algorithm.


2021 ◽  
Author(s):  
Andrew Kamal

CloutContracts is a smart contracts layer on top of and complimentary to BitClout, as well as potentially other social media platforms in the future as well. As a smart contracts layer, many creators onboarded to CloutContracts can create high performance DAPPs w/ an emphasis on low gas fees, customization, speed and various social aspects as well. This will eventually allow creators to build large scale networks, tokenization usecases, and bring blockchain adaptability to their fanbases. Unlike traditional rollup networks or DAPP tools, the emphasis is on the creator, adaptability, and expanded functionalities such as modular tools or microservices. CloutContracts aims to have creators feel like they aren't needing to choose between expanded functionality from running their own blockchain or accessibility from running on top of a network. This creates a new class of blockchain developers, in which ease of access is aimed towards both the most basic level to running complex lightweight apps on JavaScript or Solidity.


Author(s):  
D Y Polukarov ◽  
A P Bogdan

Modelling large-scale networks requires significant computational resources on a computer that produces a simulation. Moreover, the complexity of the calculations increases nonlinearly with increasing volume of the simulated network. On the other hand, cluster computing has gained considerable popularity recently. The idea of using cluster computing structures for modelling computer networks arises naturally. This paper describes the creation of software which combines an interactive mode of operation, including a graphical user interface for the OMNeT++ environment, with a batch mode of operation more natural to the high-performance cluster, "Sergey Korolev". The architecture of such a solution is developed. An example of using this approach is also given.


2007 ◽  
Vol 19 (5) ◽  
pp. 1422-1435 ◽  
Author(s):  
Takahumi Oohori ◽  
Hidenori Naganuma ◽  
Kazuhisa Watanabe

We propose a digital version of the backpropagation algorithm (DBP) for three-layered neural networks with nondifferentiable binary units. This approach feeds teacher signals to both the middle and output layers, whereas with a simple perceptron, they are given only to the output layer. The additional teacher signals enable the DBP to update the coupling weights not only between the middle and output layers but also between the input and middle layers. A neural network based on DBP learning is fast and easy to implement in hardware. Simulation results for several linearly nonseparable problems such as XOR demonstrate that the DBP performs favorably when compared to the conventional approaches. Furthermore, in large-scale networks, simulation results indicate that the DBP provides high performance.


2018 ◽  
Vol 46 (6) ◽  
pp. e33-e33 ◽  
Author(s):  
Ariful Azad ◽  
Georgios A Pavlopoulos ◽  
Christos A Ouzounis ◽  
Nikos C Kyrpides ◽  
Aydin Buluç

Sign in / Sign up

Export Citation Format

Share Document