Results 231 to 240 of about 2,992,959 (303)
Some of the next articles are maybe not open access.
A Continuous-Time Asynchronous Boltzmann Machine
Neural Networks, 1997We propose an asynchronous neural network model having the same structure as the binary Hopfield model. Each neuron operates with continuous time and randomly changes its state according only to its membrane potential. The proposed model settles in a steady-state fluctuation, in which the probability distribution of the global state is identical to ...
Kazuo Yamanaka +2 more
openaire +2 more sources
State Assignments for Asynchronous Sequential Machines
IEEE Transactions on Computers, 1971In this paper, a heuristic state assignment algorithm for asynchronous sequential machines is presented. Machines realized by this assignment scheme will result in circuits having a small amount of gate inputs and operating in single transition time. It is also shown that for a flow table having m 1 input columns, m input variables, and d stable states,
openaire +1 more source
Robust Controllability of Switched Asynchronous Sequential Machines
IEEE Transactions on Automatic Control, 2018This paper investigates robust controllability of switched asynchronous sequential machines (ASMs) with permanent faults. A switched ASM can change its mode through a number of submachines in an asynchronous mechanism.
Jung‐Min Yang
semanticscholar +1 more source
RESEARCH OF A SYNCHRONIZED ASYNCHRONOUS MACHINE
2023Recently, interest in synchronized asynchronous machines has been growing more and more. A synchronized asynchronous machine is a conventional wound-rotor induction machine, two or three phase windings of which are supplied with direct current. The article presents a diagram of a synchronized asynchronous machine.
Mammadov, N.S., Nasibov, Q.A.
openaire +1 more source
Asynchronous Sequential Machines Designed for Fault Detection
IEEE Transactions on Computers, 1974A design procedure is presented which allows for detection of faults in asynchronous sequential machines in a real time environment. Faults affecting both the output states and the internal operation of the machine are detected. The class of faults initially considered are single stuck-at-1 and stuck-at-0 faults.
Dwight H. Sawin III, Gary K. Maki
openaire +1 more source
Asynchronous Reconfiguration for Paxos State Machines
2014This paper addresses reconfiguration of a Replicated State Machine RSM in an asynchronous system. It is well known that consensus cannot be solved in an asynchronous system. Therefore an RSM providing strong consistency, cannot guarantee progress in an asynchronous system. However, we show that reconfiguring the RSM is possible in a purely asynchronous
Leander Jehl, Hein Meling
openaire +1 more source
Modelling and identification of the asynchronous machine
First International Symposium on Control, Communications and Signal Processing, 2004., 2004In order to identify an asynchronous machine by a fuzzy controller while using the method of STREJC, it is necessary to mention that the establishment of a mathematical model of asynchronous machine which the complexity and the no linearity have been reduced in return for a certain number of simplifying hypotheses and while applying the transformation ...
M. Khemliche, S. Latreche, A. Khellaf
openaire +1 more source
Emptiness Is Decidable for Asynchronous Cellular Machines
2000We resume the investigation of asynchronous cellular automata. Originally, these devices were considered in the context of Mazurkiewicz traces, and later generalized to run on arbitrary pomsets without autoconcurrency by Droste and Gastin [3]. While the universality of the accepted language is known to be undecidable [11], we show here that the ...
openaire +1 more source
Next-State Equations of Asynchronous Sequential Machines
IEEE Transactions on Computers, 1972A theorem and two applications are given here to solve the problem of selecting state assignments of asynchronous machines. The assignment has to produce a set of simple next-state equations. The proofs use the algebraic structures defined by Hartmanis.
openaire +1 more source
Asynchronous Consensus without Trusted Setup or Public-Key Cryptography
IACR Cryptology ePrint ArchiveByzantine consensus is a fundamental building block in distributed cryptographic problems. Despite decades of research, most existing asynchronous consensus protocols require a strong trusted setup and expensive public-key cryptography. In this paper, we
Sourav Das +5 more
semanticscholar +1 more source