Relevant bibliographies by topics / Asynchronous

Academic literature on the topic 'Asynchronous'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Asynchronous.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Asynchronous"

1

Klassen, Stephen A., M. Erin Moir, Jacqueline K. Limberg, Sarah E. Baker, Wayne T. Nicholson, Timothy B. Curry, Michael J. Joyner, and J. Kevin Shoemaker. "Asynchronous action potential discharge in human muscle sympathetic nerve activity." American Journal of Physiology-Heart and Circulatory Physiology 317, no. 4 (October 1, 2019): H754—H764. http://dx.doi.org/10.1152/ajpheart.00258.2019.

Full text
Abstract:
What strategies are employed by the sympathetic system to communicate with the circulation? Muscle sympathetic nerve activity (MSNA) occurs in bursts of synchronous action potential (AP) discharge, yet whether between-burst asynchronous AP firing exists remains unknown. Using multiunit microneurography and a continuous wavelet transform to isolate APs, we studied AP synchronicity within human MSNA. Asynchronous APs were defined as those which occurred between bursts. Experiment 1 quantified AP synchronicity in eight individuals at baseline (BSL), −10 mmHg lower body negative pressure (LBNP), −40 mmHg LBNP, and end-expiratory apnea (APN). At BSL, 33 ± 12% of total AP activity was asynchronous. Asynchronous discharge was unchanged from BSL (67 ± 37 AP/min) to −10 mmHg LBNP (69 ± 33 AP/min), −40 mmHg LBNP (83 ± 68 AP/min), or APN (62 ± 39 AP/min). Across all conditions, asynchronous AP probability and frequency decreased with increasing AP size. Experiment 2 examined the impact of the ganglia on AP synchronicity by using nicotinic blockade (trimethaphan). The largest asynchronous APs were derecruited from BSL (11 ± 4 asynchronous AP clusters) to the last minute of the trimethaphan infusion with visible bursts (7 ± 2 asynchronous AP clusters). However, the 6 ± 2 smallest asynchronous AP clusters could not be blocked by trimethaphan and persisted to fire 100 ± 0% asynchronously without forming bursts. Nonnicotinic ganglionic mechanisms affect some, but not all, asynchronous activity. The fundamental behavior of human MSNA contains between-burst asynchronous AP discharge, which accounts for a considerable amount of BSL activity. NEW & NOTEWORTHY Historically, sympathetic nerve activity destined for the blood vessels supplying skeletal muscle (MSNA) has been characterized by spontaneous bursts formed by synchronous action potential (AP) discharge. However, this study found a considerable amount (~30% during baseline) of sympathetic AP discharge to fire asynchronously between bursts of human MSNA. Trimethaphan infusion revealed that nonnicotinic ganglionic mechanisms contribute to some, but not all, asynchronous discharge. Asynchronous sympathetic AP discharge represents a fundamental behavior of MSNA.
APA, Harvard, Vancouver, ISO, and other styles
2

Fu, Mingzhu, Xude Wang, Yuhan Fan, Mengxiang Lu, Kaixin Li, and Suwen Li. "Real-time observation of soliton pulsation and explosion in an Yb-doped fiber laser." Laser Physics 34, no. 5 (April 4, 2024): 055102. http://dx.doi.org/10.1088/1555-6611/ad38b0.

Full text
Abstract:
Abstract Nonlinear dissipative systems support pulsating solutions and exhibit many interesting dynamic behaviors. Here, we report various soliton pulsations and explosions in an all-normal dispersion ytterbium-doped fiber laser by utilizing the dispersive Fourier transform technique. By the different soliton dynamics, these phenomena can be classified into single-soliton pulsation and explosion, dual-soliton synchronous and asynchronous pulsation, as well as dual-soliton asynchronous explosion. Solitons exhibit identical periodic fluctuations in the synchronous pulsation while showing the anti-phase behavior in asynchronous pulsation. The dual-soliton asynchronous pulsation might be related to the periodic modulation of the polarization state of solitons. As for the dual-soliton asynchronous explosion, it can be regarded as the asynchronously triggered transient solitons containing periodic explosion through the gain-mediated soliton interactions. These findings may provide new insights into complex dynamics in the field of ultrafast lasers.
APA, Harvard, Vancouver, ISO, and other styles
3

Gunji, Yukio-Pegio, and Daisuke Uragami. "Computational Power of Asynchronously Tuned Automata Enhancing the Unfolded Edge of Chaos." Entropy 23, no. 11 (October 20, 2021): 1376. http://dx.doi.org/10.3390/e23111376.

Full text
Abstract:
Asynchronously tuned elementary cellular automata (AT-ECA) are described with respect to the relationship between active and passive updating, and that spells out the relationship between synchronous and asynchronous updating. Mutual tuning between synchronous and asynchronous updating can be interpreted as the model for dissipative structure, and that can reveal the critical property in the phase transition from order to chaos. Since asynchronous tuning easily makes behavior at the edge of chaos, the property of AT-ECA is called the unfolded edge of chaos. The computational power of AT-ECA is evaluated by the quantitative measure of computational universality and efficiency. It shows that the computational efficiency of AT-ECA is much higher than that of synchronous ECA and asynchronous ECA.
APA, Harvard, Vancouver, ISO, and other styles
4

MUSCALAGIU, IONEL, JOSE M. VIDAL, VLADIMIR CRETU, HORIA EMIL POPA, and MANUELA PANOIU. "EXPERIMENTAL ANALYSIS OF THE EFFECTS OF AGENT SYNCHRONIZATION IN ASYNCHRONOUS SEARCH ALGORITHMS." International Journal of Software Engineering and Knowledge Engineering 18, no. 05 (August 2008): 619–36. http://dx.doi.org/10.1142/s0218194008003799.

Full text
Abstract:
The asynchronous searching techniques are characterized by the fact that each agent instantiates its variables in a concurrent way. Then, it sends the values of its variables to other agents directly connected to it by using messages. These asynchronous techniques have different behaviors in the case of delays in sending messages. This article presents the opportunity for synchronizing the execution of agents in the case of asynchronous techniques. It investigates and compares the behaviors of several asynchronous techniques in two cases: agents process the received messages asynchronously (the real situation) and the synchronous case, when a synchronization of the execution of agents is done, i.e. the agents perform a computing cycle in which they process a message from a message queue. After that, the synchronization is done by waiting for the other agents to finalize the processing of their messages. The experiments show that the synchronization of the agents execution leads to lower costs in searching for solutions. A solution for synchronizing the agents execution is suggested for the analyzed asynchronous techniques.
APA, Harvard, Vancouver, ISO, and other styles
5

Ab. Aziz, Nor Azlina, Nor Hidayati Abd Aziz, Tasiransurini Ab Rahman, Norrima Mokhtar, and Marizan Mubin. "Random Synchronous Asynchronous PSO – A Particle Swarm Optimization Algorithm with a New Iteration Strategy." Mekatronika 1, no. 2 (July 15, 2019): 81–92. http://dx.doi.org/10.15282/mekatronika.v1i2.4989.

Full text
Abstract:
Particle swarm optimisation (PSO) is a population-based stochastic optimisation algorithm. Traditionally the particles update sequence for PSO can be categorized into two groups, synchronous (S-PSO) or asynchronous (A-PSO) update. In S-PSO, the particles’ performances are evaluated before their velocity and position are updated, while in A-PSO, each particle’s velocity and position is updated immediately after individual performance is evaluated. In another study, a random asynchronous PSO (RA-PSO) has been proposed. In RA-PSO, particles are randomly chosen to be updated asynchronously, the randomness improves swarm’s exploration. RA-PSO belongs to the asynchronous group. In this paper, a new category; hybrid update sequence is proposed. The new update sequence exploits the advantages of synchronous, asynchronous, and random update methods. The proposed sequence is termed as, random synchronous-asynchronous PSO (RSA-PSO). RSA-PSO divides the particles into groups. The groups are subjected to random asynchronous update, while the particles within a chosen group are updated synchronously. The performance of RSA-PSO is compared with the existing S-PSO, A-PSO, and RA-PSO using CEC2014’s benchmark functions. The results show that RSA-PSO is superior to both A-PSO and RA-PSO, and as good as S-PSO
APA, Harvard, Vancouver, ISO, and other styles
6

Hébert, Percy N., and Raymond McNeil. "Hatching asynchrony and food stress in Ring-billed Gulls: an experimental study." Canadian Journal of Zoology 77, no. 4 (September 15, 1999): 515–23. http://dx.doi.org/10.1139/z99-012.

Full text
Abstract:
We examined predictions derived from three hypotheses (hurry-up, peak-load reduction, and brood reduction) regarding the adaptive significance of hatching asynchrony. The study was conducted, in 1991 and 1992, in a colony of Ring-billed Gulls (Larus delawarensis) on l'île de la Couvée, Montréal, Québec, Canada. The hypotheses were examined by comparing the mass and size of 18- to 20-day-old chicks from broods that hatched asynchronously (unmanipulated) and synchronously (manipulated). We also compared feeding rates and fledging success between asynchronous and synchronous broods. Also, in 1992, a sample of asynchronous and synchronous broods was experimentally food stressed by providing them with an additional chick when the oldest resident chick was 4 or 5 days old. Consistent with the hurry-up hypothesis, hatch spreads were significantly shorter in 1991 when the mean clutch initiation date was significantly earlier compared with 1992. Also consistent with the hypothesis, hatch spreads increased significantly through the breeding season. In agreement with the peak-load-reduction hypothesis, feeding rates were significantly lower in asynchronous broods compared with synchronous broods. Contrary to the hypothesis, however, the feeding rate was similar for food-stressed asynchronous and food-stressed synchronous broods. As predicted by the brood-reduction hypothesis, survivorship was higher for first-hatched chicks in asynchronous broods compared with chicks in synchronous broods. Total brood loss as a result of starvation tended to occur less often in asynchronous broods compared with synchronous broods. Likewise, fledging success was higher in asynchronous broods compared with synchronous broods. However, contrary to the brood-reduction hypothesis, survival rate of first-hatched chicks, total brood loss, and fledging success were similar in food-stressed asynchronous and synchronous broods. The above results indicate that several benefits accure to Ring-billed Gulls from hatching asynchrony.
APA, Harvard, Vancouver, ISO, and other styles
7

Pighizzini, Giovanni. "Asynchronous automata versus asynchronous cellular automata." Theoretical Computer Science 132, no. 1-2 (September 1994): 179–207. http://dx.doi.org/10.1016/0304-3975(94)90232-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cori, R., Y. Metivier, and W. Zielonka. "Asynchronous Mappings and Asynchronous Cellular Automata." Information and Computation 106, no. 2 (October 1993): 159–202. http://dx.doi.org/10.1006/inco.1993.1052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mercado, Emily M. "Preservice Music Educators’ Perceptions of In-Person and Asynchronous Online Fieldwork Experiences." Journal of Music Teacher Education 31, no. 2 (December 9, 2021): 41–54. http://dx.doi.org/10.1177/10570837211061291.

Full text
Abstract:
The purpose of this instrumental case study was to examine preservice music educators’ (PMEs) perceptions of a semester-long fieldwork experience first delivered in person and then asynchronously online. Using the community of inquiry (CoI) framework, I analyzed the PMEs’ perceptions of their teaching presence in both fieldwork experiences. Participants cited benefits and challenges with lesson plan organization, in-person and asynchronous instruction, and building consensus about effective teaching. Notably, the asynchronous fieldwork provided a non-reactive environment where the script and delivery of content took precedent over a rehearsal mindset, which was more responsive and occurred during the in-person fieldwork. Based on these findings, music teacher educators might consider asynchronous fieldwork when in-person fieldwork is unavailable or as a stepping stone to prepare PMEs for in-person fieldwork experiences.
APA, Harvard, Vancouver, ISO, and other styles
10

Rahman, Tasiransurini Ab, Nor Azlina Ab. Aziz, and Zuwairie Ibrahim. "A Performance of AFIRO among Asynchronous Iteration Strategy Metaheuristic Algorithms." ECTI Transactions on Computer and Information Technology (ECTI-CIT) 17, no. 3 (July 22, 2023): 319–29. http://dx.doi.org/10.37936/ecti-cit.2023173.251829.

Full text
Abstract:
Asynchronous Finite Impulse Response Optimizer (AFIRO) is a metaheuristic algorithm that has been developed as a population-based solution with an asynchronous update mechanism. AFIRO is inspired by the Ultimate Unbiased Finite Impulse Response filter framework. AFIRO works with a group of agents where each agent performs the iteration update asynchronously. In the original paper, AFIRO was compared with the Particle Swarm Optimisation algorithm, Genetic Algorithm, and Grey Wolf Optimizer. Although AFIRO shows a better performance, the comparison seems unfair since the iteration strategy of AFIRO is different from those compared algorithms. Hence, this article further investigates the potential of AFIRO against three existent metaheuristic algorithms with the same iteration strategy, namely Asynchronous PSO (A-PSO), Asynchronous Gravitational Search Algorithm (A-GSA), and Asynchronous Simulated Kalman Filter (A-SKF). The CEC2014 test suite was applied to evaluate the performance, where the results revealed that AFIRO leads 18 out of 30 functions. The Holm post hoc showed that AFIRO performs significantly better than A-SKF and A-GSA while having the same performance as A- PSO. Moreover, the Friedman test disclosed that AFIRO has the highest ranking than A-PSO, A-SKF, and A-GSA. Therefore, it can be concluded that AFIRO performs well in the same iteration strategy category.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Asynchronous"

1

Manbo, Olof. "Asynchronous Wrapper for Globally Asynchronous Locally Synchronous Systems." Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1214.

Full text
Abstract:

This thesis is investigating the new globally asynchronous locally synchronous (GALS) technology for integrated circuits. Different types of asynchronous wrappers are tested and a new wrapper design is presented. It also investigates the possibility to use VHDL for asynchronous simulation and synthesis. The conclusions are that the GALS technology is possible to use but that it needs new synthesis tools, because todays tools are designed for synchronous technology.

APA, Harvard, Vancouver, ISO, and other styles
2

Gajland, Phillip. "On Asynchronous Group Key Agreement : Tripartite Asynchronous Ratchet Trees." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281322.

Full text
Abstract:
The subject of secure messaging has gained notable attention lately in the cryptographic community. For communications between two parties, paradigms such as the double ratchet, used in the Signal protocol, provide provably strong security guarantees such as forward secrecy and post-compromise security. Variations of the Signal protocol have enjoyed widespread adoption and are embedded in several well known messaging services, including Signal, WhatsApp and Facebook Secret Conversations. However, providing equally strong guarantees that scale well in group settings remains somewhat less well studied and is often neglected in practice. This motivated the need for the IETF Messaging Layer Security (MLS) working group. The first continuous group key agreement (CGKA) protocol to be proposed was Asynchronous Ratcheting Trees (ART) [Cohn-Gordon et al., 2018] and formed the basis of TreeKEM [Barnes et al., 2019], the CGKA protocol currently suggested for MLS. In this thesis we propose a new asynchronous group key agreement protocol based on a one-round Tripartite Diffie-Hellman [Joux, 2000]. Furthermore, we show that our protocol can be generalised for an n-ary asynchronous ratchet tree, assuming the existence of a one-round (n + 1)-way Diffie-Hellman key exchange, based on a n-multilinear map [Boneh and Silverberg, 2003]. We analyse ART, TreeKEM, and our proposals from a complexity theoretic perspective and show that our proposals improve the cost of update operations. Finally we present some discussion and improvements to the IETF MLS standard.
Ämnet om säkra meddelanden har på senare tid skapat uppmärksamhet inom kryptografiska samfundet. För kommunikationer mellan två parter ger paradigmer såsom Double Ratchet, som används i Signal-protokollet, starka bevisbara säkerhetsgarantier som forward secrecy och post-compromise security. Variationer av Signal-protokollet används mycket i praktiken och är inbäddade i flera välkända meddelandetjänster såsom Signal, WhatsApp och Facebook Secret Conversations. Däremot är protokoll som erbjuder lika starka garantier och som skalar väl i gruppsituationer något mindre studerade och ofta eftersatta i praktiken. Detta motiverade behovet av arbetsgruppen IETF Messaging Layer Security (MLS). Det första kontinuerliga gruppnyckelprotokollet (CGKA) som föreslogs var Asynchronous Ratcheting Trees (ART) [Cohn-Gordon et al., 2018] och lade grunden för TreeKEM [Barnes et al., 2019], det CGKA-protokoll som för närvarande föreslagits för MLS. I detta examensarbete föreslår vi ett nytt asynkront gruppnyckelprotokoll baserat på en en-rundad Tripartite Diffie{Hellman [Joux, 2000]. Vidare visar vi att vårt protokoll kan generaliseras för n-ary träd med hjälp av ett en-rundat (n + 1)-väg Diffie-Hellman nyckelutbyte, baserat på en multilinjär mappning [Boneh and Silverberg, 2003]. Vi analyserar ART, TreeKEM och våra förslag ur ett teoretiskt perspektiv samt visar att våra förslag förbättrar kostnaden för uppdateringsoperationer. Slutligen presenterar vi några diskussioner och förbättringar av IETF MLS-standarden.
APA, Harvard, Vancouver, ISO, and other styles
3

Prosser, Patrick. "Distributed asynchronous scheduling." Thesis, University of Strathclyde, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296921.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dalrymple, David Allen. "Asynchronous logic automata." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44914.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2008.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 89-92).
Numerous applications, from high-performance scientific computing to large, high-resolution multi-touch interfaces to strong artificial intelligence, push the practical physical limits of modern computers. Typical computers attempt to hide the physics as much as possible, running software composed of a series of instructions drawn from an arbitrary set to be executed upon data that can be accessed uniformly. However, we submit that by exposing, rather than hiding, the density and velocity of information and the spatially concurrent, asynchronous nature of logic, scaling down in size and up in complexity becomes significantly easier. In particular, we introduce "asynchronous logic automata", which are a specialization of both asynchronous cellular automata and Petri nets, and include Boolean logic primitives in each cell. We also show some example algorithms, means to create circuits, potential hardware implementations, and comparisons to similar models in past practice.
by David Allen Dalrymple.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
5

Chatterjee, Sandeep. "Asynchronous event handing." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/28177.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lieber, Thomas (Thomas Alan). "Understanding asynchronous code." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82411.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 61-64).
JavaScript on the web is difficult to debug due to its asynchronous and dynamic nature. Traditional debuggers are often little help because the language's idioms rely heavily on non-linear control flow via function pointers. The aim of this work is to create a debugging interface that helps users understand complicated control flow in languages like JavaScript. This thesis presents a programming editor extension called Theseus that uses program tracing to provide real-time in-editor feedback so that programmers can answer questions quickly as they write new code and interact with their application. Theseus augments the call graph with semantic edges that allow users to make intuitive leaps through program traces, such as from the start of an asynchronous network request to its response. Participants in lab and classroom studies found Theseus to be a usable replacement for traditional breakpoint and logging tools, though no significant difference was found in their ability to complete programming tasks.
by Thomas Lieber.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Nedelchev, Ivailo Marinov. "Asynchronous VLSI design." Thesis, University of Surrey, 1995. http://epubs.surrey.ac.uk/844150/.

Full text
Abstract:
This thesis describes the background and implementation of a novel silicon compiler from a high-level programming language, OCCAM(async), to asynchronous CMOS circuits. The compilation scheme is based on a process algebra description of a concurrent system. This Algebra is called Delay-Insensitive Algebra and is based on CSP but allows the user more freedom in communication protocols. The thesis reviews and compares various, existing, design styles and their practical aspects for asynchronous design are also discussed. The syntax and the operational semantics of OCCAM(async) are defined and, on this basis, the new compilation technique is described with its underlying CMOS circuitry. The implementations of various, novel, library cells are also discussed. The compilation technique is illustrated throughout the thesis with practical examples. It is also compared to an existing synthesis tool, Tangram, which has been developed at Phillips Research Laboratories. The thesis concludes with the place and the role of OCCAM(async) in the contemporary CMOS design, and the future aspects in continuing this research into the full, design-process automation.
APA, Harvard, Vancouver, ISO, and other styles
8

Jones, Philip William Carleton University Dissertation Engineering Electrical. "Asynchronous sampling wattmeter." Ottawa, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Heath, Michael Adam. "Asynchronous Database Drivers." BYU ScholarsArchive, 2010. https://scholarsarchive.byu.edu/etd/2387.

Full text
Abstract:
Existing database drivers use blocking socket I/O to exchange data with relational database management systems (RDBMS). To concurrently send multiple requests to a RDBMS with blocking database drivers, a separate thread must be used for each request. This approach has been used successfully for many years. However, we propose that using non-blocking socket I/O is faster and scales better under load. In this paper we introduce the Asynchronous Database Connectivity in Java (ADBCJ) framework. ADBCJ provides a common API for asynchronous RDBMS interaction. Various implementations of the ADBCJ API are used to show how utilizing non-blocking socket I/O is faster and scales better than using conventional database drivers and multiple threads for concurrency. Our experiments show a significant performance increase when using non- blocking socket I/O for asynchronous RDBMS access while using a minimal number of OS threads. Non-blocking socket I/O enables the ability to pipeline RDBMS requests which can improve performance significantly, especially over high latency networks. We also show the benefits of asynchronous database drivers on different web server architectures.
APA, Harvard, Vancouver, ISO, and other styles
10

Kwan, Terry Tai-Wing. "Corridor asynchronous delta modulation." Thesis, University of Ottawa (Canada), 1989. http://hdl.handle.net/10393/5932.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Asynchronous"

1

Asanbayev, Valentin. Asynchronous Machines. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92284-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brzozowski, Janusz A., and Carl-Johan H. Seger. Asynchronous Circuits. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brzozowski, Janusz A. Asynchronous circuits. New York: Springer-Verlag, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brzozowski, Janusz A. Asynchronous Circuits. New York, NY: Springer New York, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tucker, Benjamin R. T. Asynchronous Lego. Manchester: University of Manchester, Department of Computer Science, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Myers, Chris J. Asynchronous circuit design. New York: J. Wiley & Sons, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

J, Martin Alain, ed. Asynchronous pulse logic. Boston: Kluwer Academic Publishers, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

1946-, Birtwistle G. M., Davis A. 1946-, and British Computer Society, eds. Asynchronous digital circuit design. London: Springer-Verlag, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Birtwistle, Graham, and Alan Davis, eds. Asynchronous Digital Circuit Design. London: Springer London, 1995. http://dx.doi.org/10.1007/978-1-4471-3575-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Viniotis, Yannis, and Raif O. Onvural, eds. Asynchronous Transfer Mode Networks. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-2844-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Asynchronous"

1

Weik, Martin H. "asynchronous." In Computer Science and Communications Dictionary, 69. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Introductory Examples." In Asynchronous Circuits, 1–21. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Regular Languages and Finite Automata." In Asynchronous Circuits, 187–212. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Behaviors and Realizations." In Asynchronous Circuits, 213–40. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Types of Behaviors." In Asynchronous Circuits, 241–54. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Limitations of Up-Bounded Delay Models." In Asynchronous Circuits, 255–73. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Symbolic Analysis." In Asynchronous Circuits, 275–311. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brzozowski, Janusz A., Scott Hauck, and Carl-Johan H. Seger. "Design of Asynchronous Circuits." In Asynchronous Circuits, 313–66. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Mathematical Background." In Asynchronous Circuits, 23–33. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brzozowski, Janusz A., and Carl-Johan H. Seger. "Delay Models." In Asynchronous Circuits, 35–43. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4612-4210-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Asynchronous"

1

De Sa, Christopher, Kunle Olukotun, and Christopher Ré. "Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/672.

Full text
Abstract:
Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. While empirical results suggest that many models can be efficiently sampled asynchronously, traditional Markov chain analysis does not apply to the asynchronous case, and thus asynchronous Gibbs sampling is poorly understood. In this paper, we derive a better understanding of the two main challenges of asynchronous Gibbs: bias and mixing time. We show experimentally that our theoretical results match practical outcomes.
APA, Harvard, Vancouver, ISO, and other styles
2

Chen, Ying-Chieh, Chun-Fa Chang, and Wan-Chun Ma. "Asynchronous rendering." In the 2010 ACM SIGGRAPH symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1730804.1730988.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Aftandilian, Edward E., Samuel Z. Guyer, Martin Vechev, and Eran Yahav. "Asynchronous assertions." In the 2011 ACM international conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2048066.2048090.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wojtowicz, Jerzy, Pegor Papazian, Josep Fargas, James Davidson, and Nancy Yen-wen Cheng. "Asynchronous Architecture." In ACADIA 1993: Education and Practice: The Critical Interface. ACADIA, 1993. http://dx.doi.org/10.52842/conf.acadia.1993.107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wojtowicz, Jerzy, Pegor Papazian, Josep Fargas, James Davidson, and Nancy Yen-wen Cheng. "Asynchronous Architecture." In ACADIA 1993: Education and Practice: The Critical Interface. ACADIA, 1993. http://dx.doi.org/10.52842/conf.acadia.1993.107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Worthington, Tom. "Synchronizing asynchronous learning - Combining synchronous and asynchronous techniques." In 2013 8th International Conference on Computer Science & Education (ICCSE). IEEE, 2013. http://dx.doi.org/10.1109/iccse.2013.6553983.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Harmon, David, Etienne Vouga, Breannan Smith, Rasmus Tamstorf, and Eitan Grinspun. "Asynchronous contact mechanics." In ACM SIGGRAPH 2009 papers. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1576246.1531393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ben-Or, Michael, Ran Canetti, and Oded Goldreich. "Asynchronous secure computation." In the twenty-fifth annual ACM symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/167088.167109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chlebus, Bogdan S., and Dariusz R. Kowalski. "Asynchronous exclusive selection." In the twenty-seventh ACM symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1400751.1400801.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fekete, A. D. "Asynchronous approximate agreement." In the sixth annual ACM Symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/41840.41846.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Asynchronous"

1

Sanders, G., and R. Pearce. FINAL REPORT: Asynchronous Graphs. Office of Scientific and Technical Information (OSTI), October 2019. http://dx.doi.org/10.2172/1573144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Martin, Alain J. Asynchronous Systems Architecture Project. Fort Belvoir, VA: Defense Technical Information Center, September 2000. http://dx.doi.org/10.21236/ada384432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tamara Gilbson Kolda. Understanding Asynchronous Parallel Pattern Search. Office of Scientific and Technical Information (OSTI), February 2001. http://dx.doi.org/10.2172/793725.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Martin, Alain J., Steven M. Burns, T. K. Lee, Drazen Borkovic, and Pieter J. Hazewindus. The Design of an Asynchronous Microprocessor. Fort Belvoir, VA: Defense Technical Information Center, January 1989. http://dx.doi.org/10.21236/ada447727.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Luby, M., J. Gemmell, L. Vicisano, L. Rizzo, and J. Crowcroft. Asynchronous Layered Coding (ALC) Protocol Instantiation. RFC Editor, December 2002. http://dx.doi.org/10.17487/rfc3450.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Luby, M., M. Watson, and L. Vicisano. Asynchronous Layered Coding (ALC) Protocol Instantiation. RFC Editor, April 2010. http://dx.doi.org/10.17487/rfc5775.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ippen, Erich P. Asynchronous Mode Locking of Fiber Lasers. Fort Belvoir, VA: Defense Technical Information Center, March 2000. http://dx.doi.org/10.21236/ada375829.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Trump, William. Asynchronous ASCII Event Count Status Code. Fort Belvoir, VA: Defense Technical Information Center, March 2012. http://dx.doi.org/10.21236/ada628275.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ricciardi, Aleta M., and Kenneth P. Birman. Process of Membership in Asynchronous Environments. Fort Belvoir, VA: Defense Technical Information Center, February 1993. http://dx.doi.org/10.21236/ada264399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Meng, Teresa H. Y. Asynchronous Design for Parallel Processing Architectures. Fort Belvoir, VA: Defense Technical Information Center, June 1993. http://dx.doi.org/10.21236/ada266523.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Asynchronous' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography