Results 241 to 250 of about 542,389 (286)
Some of the next articles are maybe not open access.
Primary Care: Clinics in Office Practice, 2022
Asynchronous telehealth provides a viable option for improving access in a convenient and timely manner to patients seeking care as well as for physicians seeking subspecialty consultation. Access to technology, clear guidelines, standards, and expectations is required for this innovation to function well.
Jennifer, Stephens, Grant M, Greenberg
openaire +2 more sources
Asynchronous telehealth provides a viable option for improving access in a convenient and timely manner to patients seeking care as well as for physicians seeking subspecialty consultation. Access to technology, clear guidelines, standards, and expectations is required for this innovation to function well.
Jennifer, Stephens, Grant M, Greenberg
openaire +2 more sources
[1992] Proceedings of the Second Great Lakes Symposium on VLSI, 2003
This paper discusses the design and performance of an 8-bit asynchronous multiplier. Self-timed adders with carry completion signals were implemented to create the asynchronous function of the multiplier. The technique of using bi-directional adders is incorporated in the design.
Brenda Luderman, Alexander Albicki
openaire +1 more source
This paper discusses the design and performance of an 8-bit asynchronous multiplier. Self-timed adders with carry completion signals were implemented to create the asynchronous function of the multiplier. The technique of using bi-directional adders is incorporated in the design.
Brenda Luderman, Alexander Albicki
openaire +1 more source
The concept of asynchronization
ACM SIGOPS Operating Systems Review, 1980Communication between parallel processes may take place in synchronous or asynchronous form. The former has widely been used in various concepts. In contrast, means for asynchronous process relations exist only in a few systems in rudimentary form. In this paper the concept of asynchronization is developed systematically. The underlying data structures
Horst D. Wettstein, Günter Merbeth
openaire +1 more source
Probabilistic asynchronous automata
Mathematical Systems Theory, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jesi S. +2 more
openaire +2 more sources
Asynchronous Reorder Buffer for Asynchronous On-Chip Bus
IEICE Transactions on Electronics, 2005In this letter, a new asynchronous Re-Order Buffer (ROB) with fully distributed control is proposed for an asynchronous on-chip bus. Due to the fully distributed control by each dedicated controller, the proposed ROB has high modularity and scalability.
Eun-Gu Jung, Dong-Soo Har
openaire +1 more source
2010
Asynchronous PCR (aPCR) is a new PCR method that directs an ordered and sequential amplification of the + and - strands of DNA amplicons. There are several unique characteristics of aPCR that generate new application opportunities. The melting temperature (Tm) of the forward and reverse aPCR primers differ by at least 15°C.
Caifu, Chen, David, Ruff, Jason, Halsey
openaire +2 more sources
Asynchronous PCR (aPCR) is a new PCR method that directs an ordered and sequential amplification of the + and - strands of DNA amplicons. There are several unique characteristics of aPCR that generate new application opportunities. The melting temperature (Tm) of the forward and reverse aPCR primers differ by at least 15°C.
Caifu, Chen, David, Ruff, Jason, Halsey
openaire +2 more sources
IEEE Design & Test of Computers, 2011
The one problem yet to be adequately solved in the growing asynchronous community is the synchronous design industry momentum, which has proven hard to redirect to include asynchronous options. This column examines some of the reasons why.
openaire +1 more source
The one problem yet to be adequately solved in the growing asynchronous community is the synchronous design industry momentum, which has proven hard to redirect to include asynchronous options. This column examines some of the reasons why.
openaire +1 more source
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017
In this work we address the question whether a simple shared channel could be efficiently utilized, that is, with a constant throughput and linear packet latency. A shared channel (also called a multiple access channel), introduced nearly 50 years ago in the context of the Ethernet [36], is among the most popular and widely studied models of ...
Gianluca De Marco, Grzegorz Stachowiak
openaire +2 more sources
In this work we address the question whether a simple shared channel could be efficiently utilized, that is, with a constant throughput and linear packet latency. A shared channel (also called a multiple access channel), introduced nearly 50 years ago in the context of the Ethernet [36], is among the most popular and widely studied models of ...
Gianluca De Marco, Grzegorz Stachowiak
openaire +2 more sources
IEEE Transactions on Computers, 1972
When two or more processors attempt to simultaneously use a functional unit (memory, multiplier, etc.), an arbiter module must be employed to insure that processor requests are honored in sequence. The design of asynchronous arbiters is complicated because multiple input changes are allowed, and because inputs may change even if the circuit is not in a
openaire +1 more source
When two or more processors attempt to simultaneously use a functional unit (memory, multiplier, etc.), an arbiter module must be employed to insure that processor requests are honored in sequence. The design of asynchronous arbiters is complicated because multiple input changes are allowed, and because inputs may change even if the circuit is not in a
openaire +1 more source
ON ASYNCHRONOUS CELLULAR AUTOMATA
Advances in Complex Systems, 2005We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions [1]. These systems can be considered as sequential dynamical systems (SDS) over words, a class of dynamical systems that consists of (a) a finite, labeled graph Y with vertex set {v1,…,vn} and where each vertex vi has a state xvi in a finite field K, (b) a sequence of
Anders Å. Hansson +2 more
openaire +2 more sources