Results 71 to 80 of about 249,976 (301)
A Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems [PDF]
, 2013 In this thesis we address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private convex cost and subject to communication constraints ...
Filippo Zanella, Zanella, Filippo
core
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
FEBS Open Bio, EarlyView.In this study, we developed a deep learning method for mitotic figure counting in H&E‐stained whole‐slide images and evaluated its prognostic impact in 13 external validation cohorts from seven different cancer types. Patients with more mitotic figures per mm2 had significantly worse patient outcome in all the studied cancer types except colorectal ...
Joakim Kalsnes +32 more
wiley +1 more source
A self-organizing algorithm for community structure analysis in complex networks [PDF]
, 2016 Community structure analysis is a critical task for complex network analysis. It helps us to understand the properties of the system that a complex network represents, and has significance to a wide range of real applications.
Sugang Ma +11 more
core +1 more source
FEBS Open Bio, EarlyView.This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
Double‐layer Byzantine fault‐tolerant grouping consensus algorithm based on raft
IET BlockchainAddressing the scalability issues, excessive communication overhead, and challenges in adapting to large‐scale network node environments faced by the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm currently employed in consortium ...
Haotian Yuan +3 more
doaj +1 more source
Improved PBFT algorithm for high-frequency trading scenarios of alliance blockchain
Scientific Reports, 2022 With the continuous development of blockchain technology, the application scenarios of alliance blockchain are also increasing. The consensus algorithm can achieve distributed consensus among nodes in the network.
Song Tang +4 more
doaj +1 more source
The Istanbul BFT Consensus Algorithm
CoRR, 2020 This paper presents IBFT, a simple and elegant Byzantine fault-tolerant consensus algorithm that is used to implement state machine replication in the \emph{Quorum} blockchain. IBFT assumes a partially synchronous communication model, where safety does not depend on any timing assumptions and only liveness depends on periods of synchrony. The algorithm
openaire +2 more sources
Efficient Algorithms for the Consensus Decision Problem [PDF]
SIAM Journal on Control and Optimization, 2015 Small modifications after comments from ...
Pierre-Yves Chevalier +2 more
openaire +3 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Super‐Refractory Status Epilepticus (SRSE) is a rare, life‐threatening neurological emergency with unclear etiology in many cases. Mitochondrial dysfunction, often due to disease‐causing genetic variants, is increasingly recognized as a cause, with each gene producing distinct pathophysiological mechanisms.
Pouria Mohammadi +2 more
wiley +1 more source