The method of state machine replication, adopting a single strong Leader, has been widely used in the modern cluster-based database systems. In practical applications, the recovery speed has a significant impact on the availability of the systems. However, in order to guarantee the data consistency, the existing Follower recovery protocols in Paxos replication (e.g., Raft) need multiple network...

Current synthesis methodologies based on hardwaredescription languages focus mainly on two distinct levels: behavior and register-transfer levels. In many practical cases, however, the initial specification lies between a pure behavioral description and a completely structural one. This paper presents a method and algorithms for exploring the design space between the register-transfer and behav...

problem of generating a model to recognize any string is how to generate one that is generalized enough to accept strings with similar patterns and, at the same time, is specific enough to reject the non-target strings. This research focus on generating a model in the form of a state machine to recognize strings derived from the direction information of character's images. The state machine ind...

The Database State Machine (DBSM) is a replication mechanism for clusters of database servers. Read-only and update transactions are executed locally, but during commit, update transactions execution outcome is broadcast to all the servers for certification. The main DBSM’s weakness lies in its dependency on transaction readsets, needed for certification. This paper presents a technique to bypa...

Implementation of complex computer circuits assembled from the bottom up and integrated on the nanometer scale has long been a goal of electronics research. It requires a design and fabrication strategy that can address individual nanometer-scale electronic devices, while enabling large-scale assembly of those devices into highly organized, integrated computational circuits. We describe how suc...

This paper investigates the use of partial replication in the Database State Machine approach introduced earlier for fully replicated databases. It builds on the order and atomicity properties of group communication primitives to achieve strong consistency and proposes two new abstractions: Resilient Atomic Commit and Fast Atomic Broadcast. Even with atomic broadcast, partial replication requir...

This paper proposes a recognition structure designed for handling continuous speech in a natural and computationally efficient way. without the need for a higher Ievel algorithm (like. e.g .• Ievel building). This structure is based on a probabilistic state machine (PSM). but unlike Hidden Markov Models. the transition probabilities at each time frame depend on the observation made on the input...

T term reactive system describes a system that needs to continuously react to inputs coming from the environment. Finite state machines are a widely used concept for specifying the behavior of such systems. Since finite state machines allow the rigorous capture of functional aspects of system behavior, they offer several advantages over informal specifications. For example, they provide the abi...

The state machine approach is a general method for achieving fault tolerance and implementing decentralized control in distributed systems. This paper reviews the approach and identifies abstractions needed for coordinating ensembles of state machines. Implementations of these abstractions for two different failure models Byzantine and fail-stolr--are discussed. The state machine approach is il...

In a paper entitled The State of Machine Translation in 1951 [1], Yehoshua Bar-Hillel made it clear that in the absence of methods for resolving " semantical ambiguities " , fully automatic general-purpose MT could only be achieved at the cost of inaccuracy for the " foreseeable future ". Forty-five years later, we are forced to admit that his pessimism has proven entirely justified. Progress i...