EEG‐based spatiotemporal dynamics of fast ripple networks and hubs in infantile epileptic spasms
Abstract Objective Infantile epileptic spasms (IS) are epileptic seizures that are associated with increased risk for developmental impairments, adult epilepsies, and mortality. Here, we investigated coherence‐based network dynamics in scalp EEG of infants with IS to identify frequency‐dependent networks associated with spasms.
Ioana M. A. Samfira +5 more
wiley +1 more source
Impact of brain parcellation on prediction performance in models of cognition and demographics
This study investigated how five different brain parcellation schemes impact predictive regression models and global graph theory measures. No single parcellation scheme showed a superior predictive performance of cognition and demographics. Global graph theory measures significantly differed across parcellations but did not account for differences in ...
Marta Czime Litwińczuk +3 more
wiley +1 more source
Learning Generative Models across Incomparable Spaces
Generative Adversarial Networks have shown remarkable success in learning a distribution that faithfully recovers a reference distribution in its entirety.
Alvarez-Melis, David +3 more
core +1 more source
Floyd-warshall algorithm to determine the shortest path based on android
The development of technology has made all areas of life easier now, one of which is the ease of obtaining geographic information. The use of geographic information may vary according to need, for example, the digital map learning, navigation systems, observations area, and much more. With the support of adequate infrastructure, almost no one will ever
null Ramadiani +3 more
openaire +1 more source
Exploring the Advantages of Layout Procedure with Fully‐Connected Quantum Computing Technologies
This article presents a layout synthesis library supporting superconducting transmon qubits, quantum dots, nuclear magnetic resonance (NMR), and trapped ions. It includes promising algorithms in the literature adapted to the various technologies and new algorithms for evaluating the potential benefits of a routing stage in the case of fully connected ...
Andrea Russo +4 more
wiley +1 more source
Perancangan Peta Evakuasi Menggunakan Algoritma Floyd- Warshall untuk Penentuan Lintasan Terpendek: Studi Kasus [PDF]
Abstrak Peta evakuasi sangat penting bagi suatu rumah sakit. Hal ini dikarenakan untuk mengurangi resiko saat terjadi bencana (gempa bumi) dan sebagai syarat akreditasi untuk memperoleh akreditasi suatu rumah sakit.
Iftadi, Irwan +2 more
core
Formation of generalized parallel schemes for Floyd-Warshall’s algorithm
Виконано формалізацію алгоритму Флойда-Уоршала з використанням математичного апарату модифікованих систем алгоритмічних алгебр. Покроково створено низку схем, розглянуто їх особливості і можливі проблеми експериментальної реалізації. Створено узагальнену паралельну регулярну схему алгоритму, що враховує особливості як систем зі спільною пам’яттю, так ...
Pohorilyi, S. D. +3 more
openaire +1 more source
Despite there are significant advancements in modern power systems, blackouts remain a potential risk, necessitating efficient restoration strategies. This paper introduces an innovative concept for power system restoration, focusing on balancing active and reactive power while ensuring voltage stability.
Srijan Khadka +7 more
wiley +1 more source
New blocked all-pairs shortest paths algorithms operating on blocks of unequal sizes
In real-world networks, many problems imply finding the All-Pairs Shortest Paths (APSP) and their distances in a graph. Solving the large-scale APSP problem on modern multi-processor (multi-core) systems is the key for various application domains.
A. A. Prihozhy, O. N. Karasik
doaj +1 more source
NEW IDEAS TO SPEED-UP FLOYD-WARSHALL SHORTEST PATHS ALGORITHM
Floyd and Warshall’s algorithm for the all-pairs shortest path problem is a Θ(n3) procedure which revisits n times all the cells of an n×n distance matrix. At each pass, all the cells are checked but only some of them get updated. In this paper, we report some preliminary results on a new version of the algorithm, designed to avoid checking cells which
LANCIA giuseppe, RINALDI franca
openaire +1 more source

