Filters








5,473 Hits in 6.7 sec

Announcements

2007 Journal of Language Contact  
to develop an epistemological reflection on the elaboration of knowledge in the domain of languages and Language.  ...  "Representation of the phenomena and the role of descriptors: a perspective to be established" In connection with the double requirement of theoretical reflection and empirical underpinning, the aim is  ...  consensual.  ... 
doi:10.1163/000000007792548279 fatcat:y4a6czjscfep3os56x3iulyjxy

NURSING NEWS AND ANNOUNCEMENTS

1923 The American Journal of Nursing  
Fol- lowing the trend of the newer ideas of pre- ventive medicine, model equipment for a well- baby clinic was shown.  ...  There was quite a difference of opinion as to whether a Wasser- man and vaginal smear should be made in each clinic case. The consensus of opinion was that it was advisable to do so.  ... 
doi:10.1097/00000446-192312000-00033 fatcat:yzovpo53fbe5ppppz5orx5ft3e

On the Nature of Progress [chapter]

Maurice Herlihy, Nir Shavit
2011 Lecture Notes in Computer Science  
It also explains why the wait-free property is a natural basis for the consensus hierarchy: a theory of shared-memory computation requires an independent progress condition, not one that makes demands  ...  of the operating system scheduler.  ...  The maximal-progress universal construction (a variation of the wait-free construction in [9] ) does the same, except that it provides the maximal form of the consensus objects' progress guarantee: it  ... 
doi:10.1007/978-3-642-25873-2_22 fatcat:ymy4y473hffzvbjmcaoikvnkgi

A brief history of the classification of the finite simple groups

Ronald Solomon
2001 Bulletin of the American Mathematical Society  
In particular G is not a simple group. There is an equivalent theorem in the context of abstract groups. If H is a subgroup of G, we let H g = g −1 Hg. Theorem.  ...  Suppose that no nonidentity permutation in G fixes more than one point. Then G = KG x , where K is a regular normal subgroup of G and G x is the stabilizer of the point x.  ...  Suzuki's place in the saga has grown considerably thanks to conversations with Harada and a fascinating article of his to appear shortly [Hr2] .  ... 
doi:10.1090/s0273-0979-01-00909-0 fatcat:axm7nckxtvfz5bh5quohkhtfui

A pleasant stroll through the land of infinitely many creatures

Marcos K. Aguilera
2004 ACM SIGACT News  
The reason for simplicity is to better expose some of the algorithmic techniques for dealing with infinitely many processes. A brief summary of existing work in the subject is also provided.  ...  This issue consists of the paper "A Pleasant Stroll through the Land of Infinitely Many Creatures" by Marcos Aguilera. Many thanks to him for contributing to this issue.  ...  Intuitively, the source of infinitely is the passage of time. This is the infinite arrival model or the unbounded concurrency model.  ... 
doi:10.1145/992287.992298 fatcat:gnfkqw3nirfvbaulbtmlrg2ivy

Distributed Computing Column 60

Jennifer L. Welch
2015 ACM SIGACT News  
The community also discussed about PODC reviewing model and the format of brief announcements.  ...  The general case of the problem remains open. The next session was devoted to brief announcements, several of which were also about anonymous consensus.  ... 
doi:10.1145/2852040.2852055 fatcat:hlayo67wurfjhexvgbejt4cwdm

ACM SIGACT news distributed computing column 32

Idit Keidar
2008 ACM SIGACT News  
And the brief announcements were split into eight sessions, and some of them were presented in parallel in two different session rooms.  ...  and 40 regular papers and 44 brief announcements were selected by the program committee.  ... 
doi:10.1145/1466390.1466402 fatcat:ygqihi4p5vfnfnmzufwi2fnyk4

Distributed Computing with Permissioned Blockchains and Databases (Dagstuhl Seminar 19261)

C. Moha, Beng Chin Ooi, Gottfried Vossen, Michael Wagner
2019 Dagstuhl Reports  
Mohan, Beng Chin Ooi, and Gottfried Vossen The topic of blockchains, and in particular that of permissioned blockchains, has rapidly gained interest in both the industrial and the research communities  ...  As a consequence, a number of players in the IT industry work on a development of the technology, and several consortia have been formed to advance the technology across industries, among them Hyperledger  ...  Acknowledgements We want to thank the Dagstuhl staff for providing an environment that truly encourages scientific exchange and discussions and that cares for the guests in an unmatched way.  ... 
doi:10.4230/dagrep.9.6.69 dblp:journals/dagstuhl-reports/0001OV19 fatcat:vwtnp5r6cjejtj2m7bnsio5mai

Notes on Theory of Distributed Systems [article]

James Aspnes
2021 arXiv   pre-print
Notes for the Yale course CPSC 465/565 Theory of Distributed Systems.  ...  Universality of consensus Universality of consensus says that any type that can implement nprocess consensus can, together with atomic registers, give a wait-free implementation of any object in a system  ...  Classification by consensus number Here we show the position of various types in the wait-free hierarchy.  ... 
arXiv:2001.04235v2 fatcat:viv5nl6qyvdnhjb73vm64gxj5u

From strangeness enhancement to quark–gluon plasma discovery

Peter Koch, Berndt Müller, Johann Rafelski
2017 International Journal of Modern Physics A  
This is a short survey of signatures and characteristics of the quark-gluon plasma in the light of experimental results that have been obtained over the past three decades.  ...  In particular, we present an in-depth discussion of the strangeness observable, including a chronology of the experimental effort to detect QGP at CERN-SPS, BNL-RHIC, and CERN-LHC.  ...  had in fact occurred at the time of that conference, (a) was not recognized as valid by one of the discovering experimental groups; (b) needed to wait nine more years to be announced by the CERN Laboratory  ... 
doi:10.1142/s0217751x17300241 fatcat:72kkh7lso5h5xbtf3j5rohzin4

Highly concurrent logically synchronous multicast [chapter]

Kenneth J. Goldman
1989 Lecture Notes in Computer Science  
The protocol's correctness is shown using a remarkably simple problem specification stated in the I/O automaton modeL We also show that implementing a waitfree solution to the logically synchronous multicast  ...  In this problem, a computation proceeds by a sequence of rnulticasts, in which a process sends a message to some arbitrary subset of the processes, including itselL A logically synchronous rnu1tcast protocol  ...  Acknowledg ements I would Like to thank ilagit Attiya and Jennifer Welch for suggesting the impossibility result, and Nancy Lynch and Mark Tuttle for their he!oful comments on earier drafts.  ... 
doi:10.1007/3-540-51687-5_35 fatcat:3xfmocwtd5fhtl26terzh6ukuq

Highly concurrent logically synchronous multicast

Kenneth J. Goldman
1991 Distributed computing  
The protocol's correctness is shown using a remarkably simple problem specification stated in the I/O automaton modeL We also show that implementing a waitfree solution to the logically synchronous multicast  ...  In this problem, a computation proceeds by a sequence of rnulticasts, in which a process sends a message to some arbitrary subset of the processes, including itselL A logically synchronous rnu1tcast protocol  ...  Acknowledg ements I would Like to thank ilagit Attiya and Jennifer Welch for suggesting the impossibility result, and Nancy Lynch and Mark Tuttle for their he!oful comments on earier drafts.  ... 
doi:10.1007/bf01784720 fatcat:mcvlrcpv25c35aqqgnpiju2skm

Tales From A Nonstandard Career In Operations Research

Michael H. Rothkopf
2001 INFOR. Information systems and operational research  
In other words, I anticipated trouble knowing all of the relevant technical details and in representing the problem in a useful optimization model.  ...  At Pomona, I had discovered the Introduction to Operations Research by Churchman, Ackoff and Arnoff (1957). Its chapter on waiting line models had particularly fascinated me.  ...  In the model, the tank cars are the servers and the loads of chemicals needing to be shipped are the arrivals that wait for service.  ... 
doi:10.1080/03155986.2001.11732449 fatcat:423baagrnvfmreh35iwgfmgwgq

QuickSilver: A Modeling and Parameterized Verification Framework for Systems with Distributed Agreement (Extended Version) [article]

Nouraldin Jaber
2021 arXiv   pre-print
The last decade has sparked several valiant efforts in deductive verification of distributed agreement protocols such as consensus and leader election.  ...  We demonstrate the potential of QuickSilver by modeling and efficiently verifying a series of tricky case studies, adapted from real-world applications, such as a data store, a lock service, a surveillance  ...  Any opinions, findings, and conclusions in this paper are those of the authors only and do not necessarily reflect the views of our sponsors.  ... 
arXiv:2004.04613v3 fatcat:i7gnsgkldjhmjl2e7n3nyvjdcm

Network Protocols

Andrew S. Tanenbaum
1981 ACM Computing Surveys  
This paper is a tutorial about such network hierarchies, using the Reference Model of Open Systems Interconnectmn developed by the International Organization for Standardization as a grade.  ...  Chmf among these principles is the notion of structuring a network as a hmrarchy of layers, each one built upon the previous one.  ...  However, in the past few years, a consensus has begun to develop among network designers, a consensus embodied in the International Organization for Standardization's Reference Model of Open Systems Interconnection  ... 
doi:10.1145/356859.356864 fatcat:ahux5nnv5ffblmudxaacvzre5u
« Previous Showing results 1 — 15 out of 5,473 results