Thematische Bibliographien / Asynchronous dynamic

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Asynchronous dynamic“

Autor: Grafiati
Veröffentlicht am 9. November 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Asynchronous dynamic" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Asynchronous dynamic"

1

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

Der volle Inhalt der Quelle
Annotation:
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 und andere Zitierweisen
2

Daggitt, Matthew L., und Timothy G. Griffin. „Dynamic asynchronous iterations“. Journal of Parallel and Distributed Computing 164 (Juni 2022): 168–77. http://dx.doi.org/10.1016/j.jpdc.2022.03.013.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Natanzon, Assaf, und Eitan Bachmat. „Dynamic Synchronous/Asynchronous Replication“. ACM Transactions on Storage 9, Nr. 3 (01.08.2013): 1–19. http://dx.doi.org/10.1145/2501620.2508011.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lin, Yu-Yu, und Kwang-Cheng Chen. „Asynchronous Dynamic Spectrum Access“. IEEE Transactions on Vehicular Technology 61, Nr. 1 (Januar 2012): 222–36. http://dx.doi.org/10.1109/tvt.2011.2176763.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Natanzon, Assaf, und Eitan Bachmat. „Dynamic Synchronous/Asynchronous Replication“. ACM Transactions on Storage 9, Nr. 3 (August 2013): 1–19. http://dx.doi.org/10.1145/2508011.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Obridko, I., und R. Ginosar. „Minimal Energy Asynchronous Dynamic Adders“. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 14, Nr. 9 (September 2006): 1043–47. http://dx.doi.org/10.1109/tvlsi.2006.884056.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Balbiani, Philippe, Hans van Ditmarsch und Saúl Fernández González. „Asynchronous Announcements“. ACM Transactions on Computational Logic 23, Nr. 2 (30.04.2022): 1–38. http://dx.doi.org/10.1145/3481806.

Der volle Inhalt der Quelle
Annotation:
We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the logic contains dynamic modalities for making announcements and for receiving them. What an agent believes is a function of her initial uncertainty and of the announcements she has received. Beliefs need not be truthful, because announcements already made may not yet have been received. As announcements are true when sent, certain message sequences can be ruled out, just like inconsistent cuts in distributed computing. We provide a complete axiomatization for this asynchronous announcement logic ( AA ). It is a reduction system that also demonstrates that any formula in AA is equivalent to one without dynamic modalities, just as for public announcement logic. A detailed example modelling message exchanging processes in distributed computing in AA closes our investigation.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Lewandowski, Gary, Anne Condon und Eric Bach. „Asynchronous analysis of parallel dynamic programming“. ACM SIGMETRICS Performance Evaluation Review 21, Nr. 1 (Juni 1993): 268–69. http://dx.doi.org/10.1145/166962.167035.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Martinez, J., C. Dortolina, H. Villamediana, W. Pena und J. Beuses. „Asynchronous motor protection against dynamic instabilities“. IEEE Transactions on Industry Applications 36, Nr. 4 (2000): 978–85. http://dx.doi.org/10.1109/28.855950.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Zaliatov, Artem, Roman Zakiria, Olena Berezshna und Svetlana Malyhina. „Mathematical modeling of the vector control sys-tem of the asynchronous drive of the bridge crane with a fuzzy-controller for the purpose of increasing energy-efficiency“. Bulletin of Kharkov National Automobile and Highway University 1, Nr. 104 (09.04.2024): 22. http://dx.doi.org/10.30977/bul.2219-5548.2024.104.1.22.

Der volle Inhalt der Quelle
Annotation:
The article solves the current scientific and technical problem of increasing the energy efficiency of the control system for asynchronous electric drives of lifting and transport equipment of enterprises in the engineering industry, in particular overhead cranes, characterized by a high level of dynamic load both in terms of mechanical and electromagnetic indicators. In order to compare the efficiency of control systems, computer modeling of vector control of an asynchronous electric drive was carried out using proportional-integral controllers and neuroregulators based on fuzzy logic. The results of the simulation are presented and the advantages of using a vector control system with a fuzzy neuroregulator in relation to an asynchronous electric drive of an overhead crane are shown, namely, increasing the energy efficiency of operation and reducing dynamic loads during sudden changes in the control signal, ensuring high accuracy of the control process. Goal. Study of the dynamics of an electric drive with a fuzzy controller to achieve improved energy efficiency indicators of material handling equipment. Methodology. An algorithm has been developed for the operation of a vector control system for an asynchronous electric drive of an overhead crane with a fuzzy controller. Computer models of electric drive vector control and vector control subsystems have been developed. A neuroregulator for a vector control system for an asynchronous drive of an overhead crane was synthesized. Results. Mathematical modeling of an electric drive with vector control and the use of proportional-integral and Fuzzy controllers in the electric drive speed loop showed the difference in dynamic modes. A system with a fuzzy controller shows better energy efficiency in transient processes. Power decrease is 15-20%. Conclusions. The simulation results indicate an increase in energy efficiency in transient processes when operating lifting and transport equipment with an asynchronous electric drive. In addition, the use of a fuzzy neuroregulator operating on the basis of Fuzzy logic in the control system makes it possible to create a high-precision asynchronous electric drive with smooth transient processes.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Asynchronous dynamic"

1

Ahmed, Jamil. „Asynchronous design in dynamic CMOS“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0011/MQ34126.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Kocak, Umut, Karljohan Palmerius und Matthew Cooper. „Dynamic Deformation Using Adaptable, Linked Asynchronous FEM Regions“. Linköpings universitet, Visuell informationsteknologi och applikationer, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18053.

Der volle Inhalt der Quelle
Annotation:
In order to simulate both physically and visually realistic soft tissuedeformations, the Finite Element Method (FEM) is the mostpopular choice in the literature. However it is non-trivial to modelcomplex behaviour of soft tissue with sufficient refresh rates, especiallyfor haptic force feedback which requires an update rate ofthe order of 1 kHz. In this study the use of asynchronous regions isproposed to speed up the solution of FEM equations in real-time. Inthis way it is possible to solve the local neighborhood of the contactwith high refresh rates, while evaluating the more distant regions atlower frequencies, saving computational power to model complexbehaviour within the contact area. Solution of the different regionsusing different methods is also possible. To attain maximum efficiencythe size of the regions can be changed, in real-time, in responseto the size of the deformation.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Kadirire, James. „Dynamic multicast routing in the asynchronous transfer mode environment“. Thesis, University College London (University of London), 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318069.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Mullins, Robert D. „Dynamic instruction scheduling and data forwarding in asynchronous superscalar processors“. Thesis, University of Edinburgh, 2001. http://hdl.handle.net/1842/12701.

Der volle Inhalt der Quelle
Annotation:
Improvements in semiconductor technology have supported an exponential growth in microprocessor performance for many years. The ability to continue on this trend throughout the current decade poses serious challenges as feature sizes enter the deep sub-micron range. The problems due to increasing power consumption, clock distribution and the growing complexity of both design and verification, may soon limit the extent to which the underlying technological advances may be exploited. One approach which may ease these problems is the adoption of an asynchronous design style - one in which the global clock signal is omitted. Commonly-cited advantages include: the ability to exploit local variations in processing speed, the absence of a clock signal and its distribution network, and the ease of reuse and composability provided through the use of delay-insensitive module interfaces. While the techniques to design such circuits have matured over the past decade, studies of the impact of asynchrony of processor architecture have been less common. One challenge in particular is to develop multiple-issue architectures that are able to fully exploit asynchronous operation. Multiple-issue architectures have traditionally exploited the determinism and predictability ensured by synchronous operation. Unfortunately, this limits the effectiveness of the architecture when the clock is removed. The work presented in this dissertation describes in detail the problems of exploiting asynchrony in the design of superscalar processors. A number of techniques are presented for implementing both data forwarding and dynamic scheduling mechanisms, techniques that are central to exploiting instruction-level parallelism and achieving high-performance. A technique called instruction compounding is introduced, which appends dependency information to instructions during compilation, which can be exploited at run-time. This simplifies the implementation of both the dynamic scheduling and data-forwarding mechanisms.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Mabry, Ryan. „Gate Level Dynamic Energy Estimation In Asynchronous Circuits Using Petri Nets“. Scholar Commons, 2007. http://scholarcommons.usf.edu/etd/3826.

Der volle Inhalt der Quelle
Annotation:
This thesis introduces a new methodology for energy estimation in asynchronous circuits. Unlike existing probabilistic methods, this is the first simulative work for energy estimation in all types of asynchronous circuits. The new simulative methodology is based on Petri net modeling. A real delay model is incorporated to capture both gate delays and interconnect delays. The switching activity at each gate is captured to measure the average dynamic energy consumed per request/acknowledge handshaking pair. The new type of Petri net is called Hierarchical Colored Asynchronous Hardware Petri net (HCAHPN). The HCAHPN is able to capture the temporal and spatial correlations of signals within a circuit, while preserving gate logic behavior and timing information. While Petri nets have been previously used for simulating combinational and sequential circuits, this is the first work that uses Petri nets for simulating asynchronous circuits. While different asynchronous design styles make various assumptions on the gate and wire delays present with the circuit, the physical implementations of these circuits always have gate and interconnect delays. Unlike previous methods, the proposed methodology is independent of the asynchronous design style used and it can be adapted for all types of asynchronous circuits that use handshaking communication.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Pham, The Anh. „Efficient state-space exploration for asynchronous distributed programs ˸ Adapting unfolding-based dynamic partial order reduction to MPI programs“. Thesis, Rennes, École normale supérieure, 2019. http://www.theses.fr/2019ENSR0020/document.

Der volle Inhalt der Quelle
Annotation:
Les applications de transmission de messages distribués font partie du courant dominant des technologies de l'information car elles exploitent la puissance des systèmes informatiques parallèles pour produire des performances plus élevées. La conception de programmes distribués reste difficile car les développeurs doivent raisonner sur la concurrence, le non-déterminisme, la distribution de données… qui sont les principales caractéristiques des programmes distribués. En outre, il est pratiquement impossible de garantir l'exactitude de tels programmes via des approches de test classiques, car il est possible que l'on n'atteigne jamais avec succès l'exécution qui conduit à des comportements indésirables dans les programmes. Il existe donc un besoin de techniques de vérification plus puissantes. La vérification des modèles est l'une des méthodes formelles qui permet de vérifier automatiquement et efficacement certaines propriétés des modèles de systèmes informatiques en explorant tous les comportements possibles (états et transitions) du modèle de système. Cependant, les espaces d'état augmentent de façon exponentielle avec le nombre de processus simultanés, conduisant à une «explosion de l'espace d'état» .La réduction dynamique de l'ordre partiel basée sur le dépliage (UDPOR) est une technique récente mélangeant la réduction dynamique de l'ordre partiel (DPOR) avec des concepts de théorie de la concurrence tels que dépliages pour atténuer efficacement l'explosion de l'espace d'états lors de la vérification des modèles de programmes simultanés. Il est optimal dans le sens où chaque trace de Mazurkiewicz, c'est-à-dire une classe d'entrelacements équivalents en commutant des actions indépendantes adjacentes, est explorée exactement une fois. Et elle s'applique aux programmes en cours d'exécution, pas seulement aux modèles de programmes.La thèse vise à adapter UDPOR pour vérifier les programmes distribués asynchrones (par exemple les programmes MPI) dans le cadre du simulateur SIMGRID d'applications distribuées. Pour ce faire, un modèle de programmation abstrait de programmes distribués asynchrones est défini et formalisé en langage TLA +, permettant de définir avec précision une relation d'indépendance, ingrédient principal de la sémantique concurrentielle. Ensuite, l'adaptation de l'UDPOR, impliquant la construction d'un dépliage, est rendue efficace par une analyse précise des dépendances dans le modèle de programmation, permettant des calculs efficaces d'opérations habituellement coûteuses. Un prototype d'implémentation d'UDPOR adapté aux programmes asynchrones distribués a été développé, donnant des résultats expérimentaux prometteurs sur un ensemble significatif de références
Distributed message passing applications are in the mainstream of information technology since they exploit the power of parallel computer systems to produce higher performance. Designing distributed programs remains challenging because developers have to reason about concurrency, non-determinism, data distribution… that are main characteristics of distributed programs. Besides, it is virtually impossible to ensure the correctness of such programs via classical testing approaches since one may never successfully reach the execution that leads to unwanted behaviors in the programs. There is thus a need for more powerful verification techniques. Model-checking is one of the formal methods that allows to verify automatically and effectively some properties on models of computer systems by exploring all possible behaviors (states and transitions) of the system model. However, state spaces increase exponentially with the number of concurrent processes, leading to “state space explosion”.Unfolding-based Dynamic Partial Order Reduction (UDPOR) is a recent technique mixing Dynamic Partial Order Reduction (DPOR) with concepts of concurrency theory such as unfoldings to efficiently mitigate state space explosion in model-checking of concurrent programs. It is optimal in the sense that each Mazurkiewicz trace, i.e. a class of interleavings equivalent by commuting adjacent independent actions, is explored exactly once. And it is applicable to running programs, not only models of programs.The thesis aims at adapting UDPOR to verify asynchronous distributed programs (e.g. MPI programs) in the setting of the SIMGRID simulator of distributed applications. To do so, an abstract programming model of asynchronous distributed programs is defined and formalized in the TLA+ language, allowing to precisely define an independence relation, a main ingredient of the concurrency semantics. Then, the adaptation of UDPOR, involving the construction of an unfolding, is made efficient by a precise analysis of dependencies in the programming model, allowing efficient computations of usually costly operation. A prototype implementation of UDPOR adapted to distributed asynchronous programs has been developed, giving promising experimental results on a significant set of benchmarks
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Fischer, Frank. „Dynamic Graph Generation and an Asynchronous Parallel Bundle Method Motivated by Train Timetabling“. Doctoral thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-118358.

Der volle Inhalt der Quelle
Annotation:
Lagrangian relaxation is a successful solution approach for many combinatorial optimisation problems, one of them being the train timetabling problem (TTP). We model this problem using time expanded networks for the single train schedules and coupling constraints to enforce restrictions like station capacities and headway times. Lagrangian relaxation of these coupling constraints leads to shortest path subproblems in the time expanded networks and is solved using a proximal bundle method. However, large instances of our practical partner Deutsche Bahn lead to computationally intractable models. In this thesis we develop two new algorithmic techniques to improve the solution process for this kind of optimisation problems. The first new technique, Dynamic Graph Generation (DGG), aims at improving the computation of the shortest path subproblems in large time expanded networks. Without sacrificing any accuracy, DGG allows to store only small parts of the networks and to dynamically extend them whenever the stored part proves to be too small. This is possible by exploiting the properties of the objective function in many scheduling applications to prefer early paths or due times, respectively. We prove that DGG can be implemented very efficiently and its running time and the size of nodes that have to be stored additionally does not depend on the size of the time expanded network but only on the length of the train routes. The second technique is an asynchronous and parallel bundle method (APBM). Traditional bundle methods require one solution of each subproblem in each iteration. However, many practical applications, e.g. the TTP, consist of rather loosely coupled subproblems. The APBM chooses only small subspaces corresponding to the Lagrange multipliers of strongly violated coupling constraints and optimises only these variables while keeping all other variables fixed. Several subspaces of disjoint variables may be chosen simultaneously and are optimised in parallel. The solutions of the subspace problem are incorporated into the global data as soon as it is available without any synchronisation mechanism. However, in order to guarantee convergence, the algorithm detects automatically dependencies between different subspaces and respects these dependencies in future subspace selections. We prove the convergence of the APBM under reasonable assumptions for both, the dual and associated primal aggregate data. The APBM is then further extended to problems with unknown dependencies between subproblems and constraints in the Lagrangian relaxation problem. The algorithm automatically detects these dependencies and respects them in future iterations. Again we prove the convergence of this algorithm under reasonable assumptions. Finally we test our solution approach for the TTP on some real world instances of Deutsche Bahn. Using an iterative rounding heuristic based on the approximate fractional solutions obtained by the Lagrangian relaxation we are able to compute feasible schedules for all trains in a subnetwork of about 10% of the whole German network in about 12 hours. In these timetables 99% of all passenger trains could be scheduled with no significant delay and the travel time of the freight trains could be reduced by about one hour on average.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Hadjimichael, Sotiris. „Dynamic simulation of a wind-driven asynchronous generator connected to a D.C. link“. Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.261742.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Grimsman, David R. „The Asynchronous t-Step Approximation for Scheduling Batch Flow Systems“. BYU ScholarsArchive, 2016. https://scholarsarchive.byu.edu/etd/5957.

Der volle Inhalt der Quelle
Annotation:
Heap models in the max-plus algebra are interesting dynamical systems that can be used to model a variety of tetris-like systems, such as batch flow shops for manufacturing models. Each heap in the model can be identified with a single product to manufacture. The objective is to manufacture a group of products in such an order so as to minimize the total manufacturing time. Because this scheduling problem reduces to a variation of the Traveling Salesman Problem (known to be NP-complete), the optimal solution is computationally infeasible for many real-world systems. Thus, a feasible approximation method is needed. This work builds on and expands the existing heap model in order to more effectively solve the scheduling problems. Specifically, this work:1. Further characterizes the admissible products to these systems.2. Further characterizes sets of admissible products. 3. Presents a novel algorithm, the asynchronous $t$-step approximation, to approximate these systems.4. Proves error bounds for the system approximation, and show why these error bounds are better than the existing approximation.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Devarakonda, SaiPrasanth. „Particle Swarm Optimization“. University of Dayton / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1335827032.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Asynchronous dynamic"

1

Ahmed, Jamil. Asynchronous design in dynamic CMOS. Ottawa: National Library of Canada, 1998.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Center, Ames Research, Hrsg. Dynamic modelling and estimation of the error due to asynchronism in a redundant asynchronous multiprocessor system. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1986.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Center, Langley Research, Hrsg. Asynchronous communication of TLNS3DMB boundary exchange. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1997.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Marshall, P. N. A prototype multimedia interface for displaying aspects of group dynamics in an asynchronous distributed CSCW meeting. Manchester: UMIST, 1993.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Dynamic Relevance Filtering in Asynchronous Transfer Mode-Based Distributed Interactive Simulation Exercises. Storming Media, 1996.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Shapiro, Arthur G. Contrast Asynchronies. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199794607.003.0112.

Der volle Inhalt der Quelle
Annotation:
Contrast asynchronies juxtapose color and color contrast information. The basic configuration of a contrast asynchrony consists of two identical disks whose luminance levels change in time from light to dark and back again; one disk is surrounded by a bright field and the other by a dark field; at 1Hz, observers report seeing the disks modulating in antiphase, yet also becoming light and dark at the same time. While such a configuration may look like a dynamic brightness illusion, the actual effect occurs because the visual system separates the in-phase luminance information from the antiphase contrast information. Variations of the contrast asynchrony paradigm can isolate different types of visual responses information.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Asynchronous dynamic"

1

Yeung, David W. K., und Leon A. Petrosyan. „Asynchronous Horizons Durable-Strategies Dynamic Games“. In Theory and Decision Library C, 215–58. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-92742-4_8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Sanders, Peter. „Asynchronous Random Polling Dynamic Load Balancing“. In Algorithms and Computation, 37–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46632-0_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Zivan, Roie, und Amnon Meisels. „Dynamic Ordering for Asynchronous Backtracking on DisCSPs“. In Principles and Practice of Constraint Programming - CP 2005, 32–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11564751_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Kundu, Anirban. „Dynamic Web Prediction Using Asynchronous Mouse Activity“. In Computational Social Networks, 257–80. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4048-1_10.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Ramsey, David M. „A Large Population Parental Care Game with Asynchronous Moves“. In Advances in Dynamic Games, 149–71. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-02690-9_8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Nather, Rüdiger, und Claudia Fohry. „Futures for Dynamic Dependencies – Parallelizing the $$\mathcal {H}$$-LU Factorization“. In Asynchronous Many-Task Systems and Applications, 9–21. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-61763-8_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Furmento, Nathalie, Abdou Guermouche, Gwenolé Lucas, Thomas Morin, Samuel Thibault und Pierre-André Wacrenier. „Optimizing Parallel System Efficiency: Dynamic Task Graph Adaptation with Recursive Tasks“. In Asynchronous Many-Task Systems and Applications, 166–72. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-61763-8_16.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Chandrasekar, Kavitha, und Laxmikant V. Kale. „Dynamic Tuning of Core Counts to Maximize Performance in Object-Based Runtime Systems“. In Asynchronous Many-Task Systems and Applications, 92–104. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-61763-8_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Guidec, Frédéric, und Hervé Roussain. „Asynchronous Document Dissemination in Dynamic Ad Hoc Networks“. In Parallel and Distributed Processing and Applications, 44–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30566-8_8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Salhiene, Mohammed Es, Laurent Fesquet und Marc Renaudin. „Dynamic Voltage Scheduling for Real Time Asynchronous Systems“. In Lecture Notes in Computer Science, 390–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45716-x_39.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Asynchronous dynamic"

1

Abdelrahim, Mahmoud, und Dhafer Almakhles. „Dynamic Event-Triggered Control for LTI Systems with Asynchronous Input/Output Transmissions“. In 2024 American Control Conference (ACC), 4681–86. IEEE, 2024. http://dx.doi.org/10.23919/acc60939.2024.10644371.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Kral, Martin, und Radomir Gono. „Dynamic model of asynchronous machine“. In 2017 18th International Scientific Conference on Electric Power Engineering (EPE). IEEE, 2017. http://dx.doi.org/10.1109/epe.2017.7967320.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Joshi, R. V., W. Huang und C. T. Chuang. „SOI for asynchronous dynamic circuits“. In the 11th Great Lakes Symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/368122.368734.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lewandowski, Gary, Anne Condon und Eric Bach. „Asynchronous analysis of parallel dynamic programming“. In the 1993 ACM SIGMETRICS conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/166955.167035.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Papp, Albert L., und Meera M. Blattner. „Dynamic presentation of asynchronous auditory output“. In the fourth ACM international conference. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/244130.244154.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Lee, Kooktae. „A Stabilizing Control Algorithm for Asynchronous Parallel Quadratic Programming via Dual Decomposition“. In ASME 2019 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/dscc2019-9047.

Der volle Inhalt der Quelle
Annotation:
Abstract Publisher’s Note: This paper was selected for publication in ASME Letters in Dynamic Systems and Control. https://www.asmedigitalcollection.asme.org/lettersdynsys/article/doi/10.1115/1.4046365/1074564/A-Stabilizing-Control-Algorithm-for-Asynchronous
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Ruiz, Rafael O., Marcelo H. Di Liscia, Luis Medina und Sergio Di´az. „Asynchronous Dynamic Coefficients of a Three Lobe Air Bearing“. In ASME Turbo Expo 2007: Power for Land, Sea, and Air. ASMEDC, 2007. http://dx.doi.org/10.1115/gt2007-27919.

Der volle Inhalt der Quelle
Annotation:
The study of dynamic whirl behavior of air bearings is fundamental for an adequate rotordynamic analysis and future validation of numerical predictions. This work shows the dynamic response of the air film on a three lobe bearing under non-synchronous whirl motion. One-dimensional multifrequency orbits are used to characterize the bearing rotordynamic coefficients. The test rig uses two magnetic bearing actuators to impose any given orbits to the journal. The dynamic forces are measured on the test bearing housing by three load cells. Journal whirling excitation is independent of the rotating speed, thus allowing asynchronous excitations. The multi frequency excitation is applied at each rotating speed up to 11000rpm allowing the non-synchronous characterization of the air film. The experimental procedure requires two linearly independent excitation sets. Thus, vertical and horizontal one-dimensional multi-frequency orbits are applied as perturbations. Results show the synchronous and asynchronous dynamic coefficients of the air bearing. Asynchronous experimental results are compared to numerical estimation of the bearing force coefficients through solution of the isotropic ideal gas journal bearing Reynolds equation. Numerical dynamic coefficients are obtained as the effective coefficient values of the bearing when subject to a given orbit. A full characterization of the non-synchronous rotordynamics coefficients of the bearing is presented in three dimensional maps.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Omelchenko, Evgeniy, Timur Khramshin, Vasiliy Tanich und Igor Kozhevnikov. „Dynamic Computer Model of Traction Asynchronous Motor“. In 2019 IEEE Russian Workshop on Power Engineering and Automation of Metallurgy Industry: Research & Practice (PEAMI). IEEE, 2019. http://dx.doi.org/10.1109/peami.2019.8915408.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Belayadi, Djahida, und Walid Hidouci. „Dynamic Range Partitioning with Asynchronous Data Balancing“. In 2016 Intl IEEE Conferences on Ubiquitous Intelligence & Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People, and Smart World Congress (UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld). IEEE, 2016. http://dx.doi.org/10.1109/uic-atc-scalcom-cbdcom-iop-smartworld.2016.0185.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Bertsekas, Dimitri P., und Huizhen Yu. „Distributed asynchronous policy iteration in dynamic programming“. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2010. http://dx.doi.org/10.1109/allerton.2010.5707073.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Asynchronous dynamic"

1

Kumar, Akshat, John Hector Solis und Benjamin Matschke. Dynamic analysis methods for detecting anomalies in asynchronously interacting systems. Office of Scientific and Technical Information (OSTI), Januar 2014. http://dx.doi.org/10.2172/1204104.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Asynchronous dynamic" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie