Results 61 to 70 of about 8,315,593 (358)

A Fully Distributed Power Flow Algorithm with Exponentially Fast Convergence

open access: yesZhongguo dianli, 2019
In order to meet the data privacy requirements for interconnected power system power flow calculations, a fully distributed power flow algorithm is proposed. The method is composed of outer iteration and inner iteration.
Changzheng GAO   +4 more
doaj   +1 more source

Uniform distribution and algorithmic randomness [PDF]

open access: yesThe Journal of Symbolic Logic, 2013
AbstractA seminal theorem due to Weyl [14] states that if (an) is any sequence of distinct integers, then, for almost everyx∈ ℝ, the sequence (anx) is uniformly distributed modulo one. In particular, for almost everyxin the unit interval, the sequence (anx) is uniformly distributed modulo one for everycomputablesequence (an) of distinct integers.
openaire   +4 more sources

Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm

open access: yesTheoretical Computer Science, 2006
AbstractThe development of distributed algorithms and, more generally, distributed systems, is a complex, delicate and challenging process. Refinement techniques of (system) models improve the process by using a proof assistant, and by applying a design methodology aimed at starting from the most abstract model and leading, in an incremental way, to ...
Cansell, Dominique, Méry, Dominique
openaire   +3 more sources

Finite-Time Weighted Average Consensus and Generalized Consensus Over a Subset

open access: yesIEEE Access, 2016
In this paper, the finite-time consensus for arbitrary undirected graphs is discussed. We develop a parametric distributed algorithm as a function of a linear operator defined on the underlying graph and provide a necessary and sufficient condition ...
Yilun Shang
doaj   +1 more source

In vivo evidence for glycyl radical insertion into a catalytically inactive variant of pyruvate formate‐lyase

open access: yesFEBS Letters, EarlyView.
Dimeric pyruvate formate‐lyase cleaves pyruvate using a radical‐based mechanism. G734 serves as a radical storage location, and the radical is transferred to the catalytic C419 residue. Mutation of the C418‐C419 pair causes loss of enzyme activity, but does not impede radical introduction onto G734. Therefore, cis‐ but not trans‐radical transfer occurs
Michelle Kammel   +2 more
wiley   +1 more source

4-DMWM Approach for Caching Based Optimal D2D Pairing and Channel Allocation: Centralized and Distributed Algorithm Design

open access: yesIEEE Access, 2016
Caching popular contents at mobile devices can potentially improve the quality of service for mobile users and relieve traffic burden of base station in cellular networks.
Lu Miao, Bo Bai, Wei Chen
doaj   +1 more source

An algorithm for distributive unification [PDF]

open access: yes, 1996
The purpose of this paper is to describe a decision algorithm for unifiability of equations w.r.t. the equational theory of two distributive axioms: x*(y+z)=x*y+x*z and (x+y)*z=x*z + y*z. The algorithm is described as a set of non-deterministic transformation rules.
openaire   +3 more sources

Unlocking the potential of tumor‐derived DNA in urine for cancer detection: methodological challenges and opportunities

open access: yesMolecular Oncology, EarlyView.
Urine is a rich source of biomarkers for cancer detection. Tumor‐derived material is released into the bloodstream and transported to the urine. Urine can easily be collected from individuals, allowing non‐invasive cancer detection. This review discusses the rationale behind urine‐based cancer detection and its potential for cancer diagnostics ...
Birgit M. M. Wever   +1 more
wiley   +1 more source

Location-Aided Fast Distributed Consensus in Wireless Networks

open access: yes, 2009
Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms.
Dai, Huaiyu, Li, Wenjun, Zhang, Yanbing
core   +2 more sources

A distributed spanning tree algorithm

open access: yesDAIMI Report Series, 1987
We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two-way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well as communication is asynchronous.
Johansen, Karl Erik   +4 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy