This paper examines the issues surrounding distributed Digital Library protocols. First, it reviews three prominent digital library protocols: Z39.50, SDLIP, and Dienst, plus Greenstone’s own protocol. Then, we summarise the implementation in the Greenstone Digital Libary of a number of different protocols for distributed digital libraries, and describe sample applications of the same: a digita...

Sensitization of recipients is an increasing problem in children. Some case series in children exist comparing the diverse desensitizing protocols. These protocols include intravenous immunoglobulin, cytomegalovirus immune globulin, plasmapheresis, and some adjunctive therapies such as rituximab. Desensitizing protocols have advantages and disadvantages. Clinical trials are required to determin...

In this poster we present the semantic and NLP layers in the development of our repository for experimental protocols. We have studied existing repositories for experimental protocols as well the experimental protocols themselves. We have identified end-­‐user...

The design of key distribution and authentication protocols has been shown to be error-prone. These protocols constitute the part of more complex protocols used for electronic commerce transactions. Consequently, these new protocols are likely to contain flaws that are even more difficult to find. In this paper, we present a search method for detecting potential security flaws in such protocols...

Flood-search on-demand routing has received considerable interest for its application to mobile ad hoc networks. To alleviate the effects of flooding the network with control packets to discover a route, the concept of an expanding ring search (ERS) has been proposed elsewhere for reducing the packet transmission overhead of the route discovery process. Essentially, ERS consists of incrementall...

We present an approach to reconcile explicit state model checking and heuristic directed search. We provide experimental evidence that the model checking problem for concurrent systems, such as communications protocols, can be solved more eeciently, since nding a state violating a property can be understood as a directed search problem. In our work we combine the expressive power and implementa...

We have recently seen the development of a number of new tools for the analysis of cryptographic protocols. Many of them are based on state exploration, that is, they try to find as many paths through the protocol as possible, in the hope that, if there is an error, it will be discovered. But, since the search space offered by a cryptographic protocol is infinite, this search alone cannot guara...

We present an approach to reconcile explicit state model checking and heuristic directed search and provide experimental evidence that the model checking problem for concurrent systems, such as communications protocols, can be solved more efficiently, since finding a state violating a property can be understood as a directed search problem. In our work we combine the expressive power and implem...

We present an approach to reconcile explicit state model checking and heuristic directed search. We provide experimental evidence that the model checking problem for concurrent systems, such as communications protocols, can be solved more e ciently, since nding a state violating a property can be understood as a directed search problem. In our work we combine the expressive power and implementa...