Filters








17,978 Hits in 4.0 sec

Developing and refining an adaptive token-passing strategy

B. Englert, L. Rudolph, A. Shvartsman
Proceedings 21st International Conference on Distributed Computing Systems  
Token rotation algorithms play an important role in distributed computing, to support such activities as mutual exclusion, round-robin scheduling, group membership and group communication protocols.  ...  The algorithmic development is done using term rewriting systems where our parameterized protocol is developed in a series of safetypreserving refinements of a basic specification. £  ...  Acknowledgments: We thank Greg Malewicz for several valuable observations and comments.  ... 
doi:10.1109/icdsc.2001.918990 dblp:conf/icdcs/EnglertRS01 fatcat:yndcwjew55gyzeetutkmw4kj6i

Actor-Oriented Design of Scientific Workflows [chapter]

Shawn Bowers, Bertram Ludäscher
2005 Lecture Notes in Computer Science  
We first develop a formal model for scientific workflows based on an actor-oriented modeling and design approach, originally developed for studying models of complex concurrent systems.  ...  In our approach, semantic and structural mismatches can be handled independently or simultaneously, and via different types of adapters, giving rise to new methods of scientific workflow design.  ...  Actors communicate by passing data tokens between their ports. Ports.  ... 
doi:10.1007/11568322_24 fatcat:3tnd5abmdzdodn6533huwbpc4q

Automated Encapsulation of UML Activities for Incremental Development and Verification [chapter]

Frank Alexander Kraemer, Peter Herrmann
2009 Lecture Notes in Computer Science  
Further, we develop an algorithm to construct these state machines automatically for an activity based on model checking.  ...  functions can be contributed by self-contained activities as building blocks: Using streaming parameters, activities can be composed together in a quite powerful manner, since streaming parameters may also pass  ...  In particular, two styles are enabled by the previously introduced strategies of encapsulation and refinement: -The strategy of encapsulation supports a bottom-up development style, depicted in Fig. 6  ... 
doi:10.1007/978-3-642-04425-0_44 fatcat:6ylcquzzwnhjfjuzzhc5ixaoc4

HMMs and Related Speech Recognition Technologies [chapter]

Steve Young
2008 Springer Handbook of Speech Processing  
, and in adapting the models for specific applications and environments.  ...  The aim of this chapter is to review the core architecture of a HMM-based CSR system and then outline the major areas of refinement incorporated into modernday systems.  ...  Essentially, tokens are passed from node to node and at each transition the token score is updated.  ... 
doi:10.1007/978-3-540-49127-9_27 fatcat:nfsf7symrreeno6qylvckoqc3i

Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting

Koko Muroya, Dan R. Ghica
2018 Electronic Proceedings in Theoretical Computer Science  
We contributed to the study of this trade-off by the introduction of an abstract machine for call-by-need, inspired by Girard's Geometry of Interaction, a machine combining token passing and graph rewriting  ...  This work presents an extension of the machine, to additionally accommodate left-to-right and right-to-left call-by-value strategies.  ...  The GoI-style token passing itself has been adapted to implement the call-by-value evaluation strategy.  ... 
doi:10.4204/eptcs.265.5 fatcat:22psmjrwcjhqlpwkjlbdu375de

Sources of variability in human communicative skills

Inge Volman, Matthijs L. Noordzij, Ivan Toni
2012 Frontiers in Human Neuroscience  
Dyadic similarities and individual traits modulate the type of communicative strategy chosen.  ...  Cognitive traits were assessed with psychometric scores quantifying cooperative attitudes and fluid intelligence.  ...  The sender had 5 s to move his token within the game board (#5, 6). A yellow bar under the receiver's token indicated that the 5 s had passed and the receiver could start to move (#7).  ... 
doi:10.3389/fnhum.2012.00310 pmid:23189048 pmcid:PMC3504324 fatcat:jakbjvlhffbdrmhey35jeklwfq

Remedy of Mixed Initiative Conflicts in Model-based System Engineering

Fenglin Han, Peter Herrmann
2012 Electronic Communications of the EASST  
In this paper, we go a step further andintroduce a technique that refines the fault detection and, in addition, offers a highlyautomatic mechanism to remedy the errors.  ...  We exemplify the approach by envisaging the detection and remedyof mixed initiatives, a quite common cause for faulty behavior in event-drivensystems that often is overlooked in system development.  ...  Figure 5 : 5 Pattern of a system to be adapted with building block Mixed Initiative 2 Figure 6 : 6 The building block Button Game after the transformation cuted when a token passes.  ... 
doi:10.14279/tuj.eceasst.47.717 dblp:journals/eceasst/HanH12 fatcat:3k5skjy7ufbp3dejvkzvqlk4di

Maximizing Efficiency of Language Model Pre-training for Learning Representation [article]

Junmo Kang, Suwon Shin, Jeonghwan Kim, Jaeyoung Jo, Sung-Hyon Myaeng
2021 arXiv   pre-print
Our work proposes adaptive early exit strategy to maximize the efficiency of the pre-training process by relieving the model's subsequent layers of the need to process latent features by leveraging earlier  ...  Pre-trained language models in the past years have shown exponential growth in model parameters and compute time.  ...  This halting-in-the-middle strategy improves the compute efficiency by reducing the number of FLOPs required to propagate an instance.  ... 
arXiv:2110.06620v1 fatcat:khtczdofn5ablazyhff6vlytra

Effective Domain-Specific Formal Verification Techniques

Ákos Hajdu, Zoltán Micskei
2020 Zenodo  
We propose various efficient strategies for both abstraction and refinement. For abstraction, we extend the [...]  ...  We study an existing algorithm that uses an efficient structural over-approximation.  ...  For refinement, we develop a backward-search based interpolation strategy and an approach that uses multiple counterexamples for a faster convergence to the appropriate level of abstraction.  ... 
doi:10.5281/zenodo.3892347 fatcat:56hta7rkh5dinlehzrcfapumme

An approach to verification and validation of a reliable multicasting protocol

John R. Callahan, Todd L. Montgomery
1996 Proceedings of the 1996 international symposium on Software testing and analysis - ISSTA '96  
Reformation is the process by which an RMP token ring adapts to network partitions and site failures.  ...  The initial token site is site B who then acknowledges both data packets and passes the token to site A.  ... 
doi:10.1145/229000.226316 dblp:conf/issta/CallahanM96 fatcat:xr4i7jkmsndqdk7ninlzsfcc5q

Towards an ESL design framework for adaptive and fault-tolerant MPSoCs: MADNESS or not?

Emanuele Cannella, Lorenzo Di Gregorio, Leandro Fiorin, Menno Lindwer, Paolo Melonr, Olaf Neugebauer, Andy Pimentel
2011 2011 9th IEEE Symposium on Embedded Systems for Real-Time Multimedia  
Support for fault resilience and efficient adaptive runtime management is introduced at hardware and middleware level, and considered by the system-level synthesis as one of the optimization factors to  ...  The main goal of the project is to provide a framework able to guide designers and researchers to the optimal composition of embedded MPSoC architectures, according to the requirements and the features  ...  Hardware-middleware strategies providing support for fault tolerance and adaptive runtime management of the architecture resources have been developed and successfully tested.  ... 
doi:10.1109/estimedia.2011.6088518 dblp:conf/estimedia/CannellaGFLMNP11 fatcat:dbnxmmh6azac3f5ol6rwsnwwhu

An approach to verification and validation of a reliable multicasting protocol

John R. Callahan, Todd L. Montgomery
1996 Software engineering notes  
Reformation is the process by which an RMP token ring adapts to network partitions and site failures.  ...  The initial token site is site B who then acknowledges both data packets and passes the token to site A.  ... 
doi:10.1145/226295.226316 fatcat:ggqxhvrbzrenreeri4iq5bz5yy

Towards a colored reflective Petri-net approach to model self-evolving service-oriented architectures

Ying Liu, Walter Cazzola, Bin Zhang
2012 Proceedings of the 27th Annual ACM Symposium on Applied Computing - SAC '12  
Reflective Petri nets separate the system from its evolution by describing it and how it can evolve.  ...  In this paper, we extend the reflective Petri nets approach to overcome such limits and show that on a case study.  ...  Patterns help us in identifying the differences and develop adapters based on the template of adaptation logic that resolves the captured mismatch.  ... 
doi:10.1145/2245276.2232081 dblp:conf/sac/LiuCZ12 fatcat:usixfc535fdxrjre42jkkctw5i

Token-passing Nets for Functional Languages

José Bacelar Almeida, Jorge Sousa Pinto, Miguel Vilaça
2008 Electronical Notes in Theoretical Computer Science  
Token-passing nets were proposed by Sinot as a simple mechanism for encoding evaluation strategies for the λ-calculus in interaction nets.  ...  This work extends token-passing nets to cover a typed functional language equipped with structured types and unrestricted recursion.  ...  More refined evaluation strategies such as call-by-need require additional efforts.  ... 
doi:10.1016/j.entcs.2008.03.061 fatcat:dgqhczqu6nckraqp7qelzi4lzu

A Generalized Framework of Sequence Generation with Application to Undirected Sequence Models [article]

Elman Mansimov, Alex Wang, Sean Welleck, Kyunghyun Cho
2020 arXiv   pre-print
semi-autoregressive, and refinement-based non-autoregressive models.  ...  This unification enables us to adapt decoding algorithms originally developed for directed sequence models to undirected sequence models.  ...  process and not getting an opportunity to refine them, as is done in easy-first scenario.  ... 
arXiv:1905.12790v2 fatcat:ylw7vl44bfc4ndb3secgd2zudy
« Previous Showing results 1 — 15 out of 17,978 results