Results 71 to 80 of about 7,855,956 (309)

An optimisation for a two‐round good‐case latency protocol

open access: yesIET Information Security, 2023
Byzantine broadcast is a fundamental primitive in distributed computing. A highly efficient Byzantine broadcast protocol, motivated by the real‐world performance of practical state machine replication protocols, is increasingly needed.
Kexin Hu   +5 more
doaj   +1 more source

Structural insights into an engineered feruloyl esterase with improved MHET degrading properties

open access: yesFEBS Letters, EarlyView.
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa   +5 more
wiley   +1 more source

HPIM‐DM: A fast and reliable dense‐mode multicast routing protocol

open access: yesIET Networks, 2023
The Hard‐state Protocol Independent Multicast—Dense Mode (HPIM‐DM) multicast routing protocol is proposed. HPIM‐DM is a hard‐state version of PIM‐DM that overcomes its poor convergence times and lack of resilience to replay attacks.
Pedro Oliveira   +2 more
doaj   +1 more source

Composition Algorithms for Conditional Distributions

open access: yes, 2022
This chapter is about two recently published algorithms that can be used to sample from conditional distributions. We show how the efficiency of the algorithms can be improved when a sample is required from many conditional distributions. Using real-data examples from educational measurement, we show how the algorithms can be used to sample from ...
Maarten Marsman   +2 more
openaire   +4 more sources

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

Optimizing electricity demand scheduling in microgrids using deep reinforcement learning for cost‐efficiency

open access: yesIET Generation, Transmission & Distribution, 2023
Renewable energy sources (RES) are increasingly being developed and used to address the energy crisis and protect the environment. However, the large‐scale integration of wind and solar energy into the power grid is still challenging and limits the ...
Baoyin Xiong   +5 more
doaj   +1 more source

The distributed breakout algorithms

open access: yesArtificial Intelligence, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsutoshi Hirayama, Makoto Yokoo
openaire   +1 more source

Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics

open access: yesFEBS Letters, EarlyView.
Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt   +8 more
wiley   +1 more source

Attack‐resilient event‐triggered distributed control strategy of microgrid based on multi‐objective optimization

open access: yesIET Generation, Transmission & Distribution, 2023
As an important form of renewable energy utilization, microgrid (MG) is considered to be the main bearing form of distributed generation in the future. One of the most concerning issues in the operation of MG is how to realize its economic dispatch (ED).
Jinglu Liu   +3 more
doaj   +1 more source

Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut

open access: yesACM-SIAM Symposium on Discrete Algorithms, 2016
This paper introduces the concept of low-congestion shortcuts for (near-)planar networks, and demonstrates their power by using them to obtain near-optimal distributed algorithms for problems such as Minimum Spanning Tree (MST) or Minimum Cut, in planar ...
M. Ghaffari, Bernhard Haeupler
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy