Implementing atomic actions in Ada 95

Atomic actions are an important dynamic structuring technique that aid the construction of fault-tolerant concurrent systems. Although they were developed some years ago, none of the well-known commercially-available programming languages directly support their use. This paper summarizes software fault tolerance techniques for concurrent systems, evaluates the Ada 95 programming language from the perspective of its support for software fault tolerance, and shows how Ada 95 can be used to implement software fault tolerance techniques. In particular, it shows how packages, protected objects, requeue, exceptions, asynchronous transfer of control, tagged types, and controlled types can be used as building blocks from which to construct atomic actions with forward and backward error recovery, which are resilient to deserter tasks and task abortion

Resilient Wide-Area Damping Control Using GrHDP to Tolerate Communication Failures

This paper proposes a goal representation heuristic dynamic programming (GrHDP)-based resilient wide-area damping controller (WADC) for voltage source converter high voltage direct current (VSC-HVDC) employing redundant wide-area signals as input signals to tolerate communication failure. A supervisory fuzzy logic module is proposed and added in the resilient WADC to adjust the learning rate of GrHDP online when encountering communication failure. Moreover, the resilient WADC does not need the accurate model of the power system and has the adaptability to the variation of operation conditions and communication failures. Case studies are conducted in a 10-machine 39-bus system with one VSC-HVDC transmission line. Simulation results show that the resilient WADC can counteract the negative impact of communication failures on control performance under a wide range of system operating conditions

Center-based Clustering under Perturbation Stability

Clustering under most popular objective functions is NP-hard, even to approximate well, and so unlikely to be efficiently solvable in the worst case. Recently, Bilu and Linial \cite{Bilu09} suggested an approach aimed at bypassing this computational barrier by using properties of instances one might hope to hold in practice. In particular, they argue that instances in practice should be stable to small perturbations in the metric space and give an efficient algorithm for clustering instances of the Max-Cut problem that are stable to perturbations of size $O(n^{1/2})$. In addition, they conjecture that instances stable to as little as O(1) perturbations should be solvable in polynomial time. In this paper we prove that this conjecture is true for any center-based clustering objective (such as $k$-median, $k$-means, and $k$-center). Specifically, we show we can efficiently find the optimal clustering assuming only stability to factor-3 perturbations of the underlying metric in spaces without Steiner points, and stability to factor $2+\sqrt{3}$ perturbations for general metrics. In particular, we show for such instances that the popular Single-Linkage algorithm combined with dynamic programming will find the optimal clustering. We also present NP-hardness results under a weaker but related condition

On Resilient Behaviors in Computational Systems and Environments

The present article introduces a reference framework for discussing resilience of computational systems. Rather than a property that may or may not be exhibited by a system, resilience is interpreted here as the emerging result of a dynamic process. Said process represents the dynamic interplay between the behaviors exercised by a system and those of the environment it is set to operate in. As a result of this interpretation, coherent definitions of several aspects of resilience can be derived and proposed, including elasticity, change tolerance, and antifragility. Definitions are also provided for measures of the risk of unresilience as well as for the optimal match of a given resilient design with respect to the current environmental conditions. Finally, a resilience strategy based on our model is exemplified through a simple scenario.Comment: The final publication is available at Springer via http://dx.doi.org/10.1007/s40860-015-0002-6 The paper considerably extends the results of two conference papers that are available at http://ow.ly/KWfkj and http://ow.ly/KWfgO. Text and formalism in those papers has been used or adapted in the herewith submitted pape