Search results for "algorithm"
showing 10 items of 4887 documents
Decentralized unscented Kalman filter based on a consensus algorithm for multi-area dynamic state estimation in power systems
2015
Abstract A decentralized unscented Kalman filter (UKF) method based on a consensus algorithm for multi-area power system dynamic state estimation is presented in this paper. The overall system is split into a certain number of non-overlapping areas. Firstly, each area executes its own dynamic state estimation based on local measurements by using the UKF. Next, the consensus algorithm is required to perform only local communications between neighboring areas to diffuse local state information. Finally, according to the global state information obtained by the consensus algorithm, the UKF is run again for each area. Its performance is compared with the distributed UKF without consensus algori…
A greedy perturbation approach to accelerating consensus algorithms and reducing its power consumption
2011
The average consensus is part of a family of algorithms that are able to compute global statistics by only using local data. This capability makes these algorithms interesting for applications in which these distributed philosophy is necessary. However, its iterative nature usually leads to a large power consumption due to the repetitive communications among the iterations. This drawback highlights the necessity of minimizing the power consumption until consensus is reached. In this work, we propose a greedy approach to perturbing the connectivity graph, in order to improve the convergence time of the consensus algorithm while keeping bounded the power consumption per iteration step. These …
On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection
2013
We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…
An updated algorithm recommendation for the management of knee osteoarthritis from the European Society for Clinical and Economic Aspects of Osteopor…
2019
Objectives: The European Society for Clinical and Economic Aspects of Osteoporosis, Osteoarthritis and Musculoskeletal Diseases (ESCEO) sought to revisit the 2014 algorithm recommendations for knee osteoarthritis (OA), in light of recent efficacy and safety evidence, in order to develop an updated stepwise algorithm that provides practical guidance for the prescribing physician that is applicable in Europe and internationally. Methods: Using the Grading of Recommendations Assessment, Development and Evaluation (GRADE) process, a summary of evidence document for each intervention in OA was provided to all members of an ESCEO working group, who were required to evaluate and vote on the streng…
Kinematic splitting algorithm for fluid–structure interaction in hemodynamics
2013
Abstract In this paper we study a kinematic splitting algorithm for fluid–structure interaction problems. This algorithm belongs to the class of loosely-coupled fluid–structure interaction schemes. We will present stability analysis for a coupled problem of non-Newtonian shear-dependent fluids in moving domains with viscoelastic boundaries. Fluid flow is described by the conservation laws with nonlinearities in convective and diffusive terms. For simplicity of presentation the structure is modelled by the generalized string equation, but the results presented in the paper may be generalized to more complex structure models. The arbitrary Lagrangian–Eulerian approach is used in order to take…
Adaptive mesh refinement techniques for high-order shock capturing schemes for multi-dimensional hydrodynamic simulations
2006
The numerical simulation of physical phenomena represented by non-linear hyperbolic systems of conservation laws presents specific difficulties mainly due to the presence of discontinuities in the solution. State of the art methods for the solution of such equations involve high resolution shock capturing schemes, which are able to produce sharp profiles at the discontinuities and high accuracy in smooth regions, together with some kind of grid adaption, which reduces the computational cost by using finer grids near the discontinuities and coarser grids in smooth regions. The combination of both techniques presents intrinsic numerical and programming difficulties. In this work we present a …
Applications of Harten’s Framework for Multiresolution: From Conservation Laws to Image Compression
2002
We briefly review Harten’s framework for multiresolution decompositions and describe two situations in which two different instances of the general framework have been used with success.
Energy saving in WWTP: Daily benchmarking under uncertainty and data availability limitations
2016
Efficient management of Waste Water Treatment Plants (WWTPs) can produce significant environmental and economic benefits. Energy benchmarking can be used to compare WWTPs, identify targets and use these to improve their performance. Different authors have performed benchmark analysis on monthly or yearly basis but their approaches suffer from a time lag between an event, its detection, interpretation and potential actions. The availability of on-line measurement data on many WWTPs should theoretically enable the decrease of the management response time by daily benchmarking. Unfortunately this approach is often impossible because of limited data availability. This paper proposes a methodolo…
Unitary Space–Time Constellation Design Based on the Chernoff Bound of the Pairwise Error Probability
2008
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations of any dimension. The Chernoff bound of the pairwise error probability is used directly as a design criterion. The constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability. The comp…
Using the Theory of Regular Functions to Formally Prove the ε-Optimality of Discretized Pursuit Learning Algorithms
2014
Learning Automata LA can be reckoned to be the founding algorithms on which the field of Reinforcement Learning has been built. Among the families of LA, Estimator Algorithms EAs are certainly the fastest, and of these, the family of Pursuit Algorithms PAs are the pioneering work. It has recently been reported that the previous proofs for e-optimality for all the reported algorithms in the family of PAs have been flawed. We applaud the researchers who discovered this flaw, and who further proceeded to rectify the proof for the Continuous Pursuit Algorithm CPA. The latter proof, though requires the learning parameter to be continuously changing, is, to the best of our knowledge, the current …