A Recoverable Distributed Shared Memory Integrating Coherence and Recoverability 1995

Abstract Markov random processes and general random processes are considered. It is shown that continuous-time, continuous-valued, wide-sense stationary, Markov random processes that have absolutely continuous second order distributions are not bandlimited. It is also shown that when these processes are strictly stationary and continuous almost surely, they cannot be recovered without error from their quantized versions. Further, it is shown that continuous-time, discrete-valued Markov random processes, which are uniformly bounded and satisfy ...

Abstract Markov random processes and general random processes are considered. It is shown that continuous-time, continuous-valued, wide-sense stationary, Markov random processes that have absolutely continuous second order distributions are not bandlimited. It is also shown that when these processes are strictly stationary and continuous almost surely, they cannot be recovered without error from their quantized versions. Further, it is shown that continuous-time, discrete-valued Markov random processes, which are uniformly bounded and satisfy ...

No Abstract Available

No Abstract Available

Abstract It is widely accepted that textureless surfaces cannot be recovered using passive sensing techniques. The problem is approached by viewing image formation as a fully three-dimensional mapping. It is shown that the lens encodes structural information of the scene within a compact three-dimensional space behind it. After analyzing the information content of this space and by using its properties we derive necessary and sufficient conditions for the recovery of textureless scenes. Based on these conditions, a simple procedure for recover...

Abstract It is widely accepted that textureless surfaces cannot be recovered using passive sensing techniques. The problem is approached by viewing image formation as a fully three-dimensional mapping. It is shown that the lens encodes structural information of the scene within a compact three-dimensional space behind it. After analyzing the information content of this space and by using its properties we derive necessary and sufficient conditions for the recovery of textureless scenes. Based on these conditions, a simple procedure for recover...

Many practical application problems?in railway optimization and beyond? require solutions to be feasible for a limited set of scenarios, if a limited recovery in each scenario is allowed. Therefore, we propose a new notion integrating recovery and robustness. This notion of Recoverable Robustness overcomes the difficulties of applying the classical notions of robustness to central railway optimization problems, e.g., delay resistant timetabling. Moreover, it allows to integrate recovery and robust planning into a common framework. We present th...

Abstract Recoverability and untraceability are two obviously conflicting properties. Most previous E-cash work do not include recoverability. Although the E-cash system in Schoenmakers (1997) contains recovery, it is an on-line E-cash system. We introduce a new E-cash protocol which possesses these two properties simultaneously. At the same time, it still remains off-line. Certain tradeoffs are discussed also. Our protocol is motivated by the single-term off-line untraceable E-cash systems in Ferguson (1994), and Brands (1993)

Abstract A design is presented for the storage component of a self-recovering distributed operating system. This component consists of an object manager, which maintains objects on main memory and on the disk, and a recovery layer, which incorporates a collection of highly optimized algorithms based on optimistic recovery. With optimistic recovery it is possible for a machine (or collection of machines) to present a fault-free interface to programs running on it (or them), making all data appear to be persistent. The optimizations presented ma...

No Abstract Available

Recoverable Alerts are non-critical crashes in the Amiga com...