Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, that is, during both the strategic planning phase and the operational phase. Although the model represents a significant improvement, it has the following drawback: we are typically not facing only one disruption, but many of t...

Recovery from failures can be achieved through asyn-chronous checkpointing and optimistic message logging. These schemes have low overheads during failure-free operations. Central to these protocols is the determination of a maximal consistent global state, which is recoverable. Message semantics is not exploited in most existing recovery protocols to determine the recoverable state. We propose...

Resources or devices on the network might be unavailable due to serious network partitioning. To provide a robust network connectivity, this paper presents an autonomous and dependable recovery scheme using teamwork in UPnP network settings. For our scheme, we introduce a team of recoverable control points and corresponding recovery device, and, in case of network failures among devices, the re...

An embedding is I-step recoverable ifany single fault occurs, the embedding can be reconfigured in one reconfiguration step to maintain the structure of the embedded graph. In this paper we present an efJicient scheme to construct this type of I -step recoverable ring embeddings in the hypercube. Our scheme will guarantee finding a I-step recoverable embedding of a length-k (even) ring in a d-c...

In a distributed system using message logging and checkpointing to provide fault tolerance there is always a unique maximum recoverable system state regardless of the message logging protocol used The proof of this relies on the observation that the set of system states that have occurred during any single execution of a system forms a lattice with the sets of consistent and recoverable system ...

This paper investigates time-invariant linear systems subject to input and state constraints. It is shown that the recoverable region (which is the largest domain of attraction that is theoretically achievable) can be semiglobally stabilized by continuous nonlinear feedbacks while satisfying the constraints. Moreover, a reduction technique is presented which shows, when trying to compute the re...

-In connection with loop transfer recovery of nonminimum phase systems, the purpose of this paper is two-fold: (1) to study the set of recoverable target loops and to establish necessary or/and sufficient conditions for a given plant to have at least one recoverable target loop, and (2) to show that the compensator structure developed earlier in Chen, Saberi and Sannuti [(1991) Automatica, 27, ...

Event-related brain potentials (ERPs) were recorded to fragmented pictures of objects that were named correctly or were not to investigate the time course of visual object identification. The first ERP difference distinguishing identified from unidentified pictures estimates the upper limit of the time by which human brain regions have begun to activate long-term memory (LTM) representations sp...

A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vlăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.

is the Maxwell relaxation time [24]. This relaxation time is a convenient approximation to the timescale of deformation where the transition from purely viscous behavior to purely elastic behavior occurs. The purely viscous response of a silicate melt is termed “liquid” behavior whereas the purely elastic response is termed “glassy” behavior. The term silicate melt is used to describe molten si...