Results 41 to 50 of about 119,472 (328)
Dynamic minimum spanning tree construction and maintenance for Wireless Sensor Networks
Revista Facultad de Ingeniería Universidad de Antioquia, 2019 In a Wireless Sensor Network (WSN), finding the optimal route from each node to the sink is not a straightforward task because of the distributed and dynamic characteristics of the network.
Sergio Diaz, Diego Mendez
doaj +1 more source
Analysis of the clonality of Candida tropicalis strains from a general hospital in Beijing using multilocus sequence typing. [PDF]
PLoS ONE, 2012 Multilocus sequence typing (MLST) based on six loci was used to analyze the relationship of 58 Candida tropicalis isolates from individual patients in a general hospital in Beijing, China. A total of 52 diploid sequence types (DSTs) were generated by the
Yuan Wu +9 more
doaj +1 more source
Online distributed waveform-synchronization for acoustic sensor networks with dynamic topology
EURASIP Journal on Audio, Speech, and Music Processing, 2023 Acoustic sensing by multiple devices connected in a wireless acoustic sensor network (WASN) creates new opportunities for multichannel signal processing. However, the autonomy of agents in such a network still necessitates the alignment of sensor signals
Aleksej Chinaev +2 more
doaj +1 more source
The Multicast Policy and Its Relationship to Replicated Data Placement [PDF]
, 1989 In this paper we consider the communication complexity of maintaining the replicas of a logical data-item, in a database distributed over a computer network.
Milo, Amir, Wolfson, Ouri
core +2 more sources
FedDNA: Federated learning using dynamic node alignment.
PLoS ONE, 2023 Federated Learning (FL), as a new computing framework, has received significant attentions recently due to its advantageous in preserving data privacy in training models with superb performance.
Shuwen Wang, Xingquan Zhu
doaj +1 more source
On the value of a random minimum spanning tree problem [PDF]
, 1985 Suppose we are given a complete graph on n vertices in which the lenghts of the edges are independent identically distributed non-negative random variables.
Frieze, A.M.
core +2 more sources
Random clustering analysis in deterministic DG-based distribution planning
Energy Reports, 2023 New feeders’ allocation, new lines connecting the substations to new feeders and other feeders to tie-line routes, should be defined for minimizing the costs of new facilities’ installation with some limitations as voltage loss, capacity of current ...
Younes Gharedaghi +2 more
doaj
A Superstabilizing $\log(n)$-Approximation Algorithm for Dynamic Steiner Trees [PDF]
, 2009 In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subset of nodes of a network (referred as Steiner members or Steiner group ...
A.M. Kermarrec +11 more
core +7 more sources
The Communication Complexity of Atomic Commitment and of Gossiping [PDF]
, 1989 We consider the problem of atomic commitment of a transaction in a distributed database. This is a variant of the famous gossiping problem (see [HHL] for a survey).
Segall, Adrian, Wolfson, Ouri
core +2 more sources
Frontiers in Neuroscience, 2021 Face processing is a spatiotemporal dynamic process involving widely distributed and closely connected brain regions. Although previous studies have examined the topological differences in brain networks between face and non-face processing, the time ...
Zhongliang Yin +7 more
doaj +1 more source