Results 261 to 270 of about 2,328,760 (311)
Some of the next articles are maybe not open access.
Computer Communications, 1987
Abstract Users of a network that operates over a slow and error-prone medium and spans only a limited geographical area may wish to replace that medium with a local area network, but to take advantage of the potential high speed, lightweight communications support is required.
Synnove Vassiliades +2 more
openaire +1 more source
Abstract Users of a network that operates over a slow and error-prone medium and spans only a limited geographical area may wish to replace that medium with a local area network, but to take advantage of the potential high speed, lightweight communications support is required.
Synnove Vassiliades +2 more
openaire +1 more source
Proceedings of the sixth symposium on Data communications - SIGCOMM '79, 1979
The notion of protocol multiplexing usually means the ability of a protocol to accommodate several instances of higher level protocols at the same time.In this paper we propose to extend this notion to allow sharing of messages, and packets, among several simultaneous communicating processes, which will increase the communication efficiency by reducing
Danny Cohen, Jonathan B. Postel
openaire +1 more source
The notion of protocol multiplexing usually means the ability of a protocol to accommodate several instances of higher level protocols at the same time.In this paper we propose to extend this notion to allow sharing of messages, and packets, among several simultaneous communicating processes, which will increase the communication efficiency by reducing
Danny Cohen, Jonathan B. Postel
openaire +1 more source
Protocol interactions and the chosen protocol attack
1998There are many cases in the literature in which reuse of the same key material for different functions can open up security holes. In this paper, we discuss such interactions between protocols, and present a new attack, called the chosen protocol attack, in which an attacker may write a new protocol using the same key material as a target protocol ...
John Kelsey +2 more
openaire +1 more source
IEEE Journal on Selected Areas in Communications, 1998
This paper describes a new methodology for protocol design, using incremental construction of the protocol from elements called "protocol boosters" on an as-needed basis. Protocol boosters allow: (1) dynamic protocol customization to heterogeneous environments and (2) rapid protocol evolution.
David C. Feldmeier +5 more
openaire +1 more source
This paper describes a new methodology for protocol design, using incremental construction of the protocol from elements called "protocol boosters" on an as-needed basis. Protocol boosters allow: (1) dynamic protocol customization to heterogeneous environments and (2) rapid protocol evolution.
David C. Feldmeier +5 more
openaire +1 more source
Software: Practice and Experience, 1984
AbstractThe paper presents a simple single layer protocol covering the functions of X25 levels 2 and 3. It can be used on synchronous or asynchronous lines, such as employed for normal computer terminals. It requires no special hardware, and can use the standard device driver software supplied by manufacturers.
Michael Purser, Chris Horn, John Sheehan
openaire +1 more source
AbstractThe paper presents a simple single layer protocol covering the functions of X25 levels 2 and 3. It can be used on synchronous or asynchronous lines, such as employed for normal computer terminals. It requires no special hardware, and can use the standard device driver software supplied by manufacturers.
Michael Purser, Chris Horn, John Sheehan
openaire +1 more source
2016
Treating interaction as an explicit first-class concept, complete with its own composition operators, leads to a model of concurrency that allows direct specification and manipulation of protocols as proper mathematical objects. Reoi?ź[2, 5, 6, 8] serves as a premier example of such an interaction-centric model of concurrency.
openaire +1 more source
Treating interaction as an explicit first-class concept, complete with its own composition operators, leads to a model of concurrency that allows direct specification and manipulation of protocols as proper mathematical objects. Reoi?ź[2, 5, 6, 8] serves as a premier example of such an interaction-centric model of concurrency.
openaire +1 more source
Emergency Nurse, 2007
The control of hospital acquired infection is an important issue in all areas of practice, including emergency care, and NHS trusts are expected to enforce guidelines on this issue.
openaire +2 more sources
The control of hospital acquired infection is an important issue in all areas of practice, including emergency care, and NHS trusts are expected to enforce guidelines on this issue.
openaire +2 more sources
International Journal of Health Care Quality Assurance, 1993
Details the introduction by Northallerton Health Services NHS Trust of critical paths and care profiles as tools within its Co‐ordinated Care Programme. Aims to use these tools as means to assess and improve on the care which patients receive, and to monitor clinical performance.
L, Simpson, J, Brown
openaire +2 more sources
Details the introduction by Northallerton Health Services NHS Trust of critical paths and care profiles as tools within its Co‐ordinated Care Programme. Aims to use these tools as means to assess and improve on the care which patients receive, and to monitor clinical performance.
L, Simpson, J, Brown
openaire +2 more sources
Statistical Standards for Protocols and Protocol Deviations
1988Any pharmaceutical company involved in drug research in a major way is likely to develop internal standards for its clinical trial work. This is particularly so as the number of staff increases because of the need to control standards and to maintain consistent approaches.
openaire +2 more sources
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982
A cryptographic transformation is a mapping f from a set of cleartext messages, M, to a set of ciphertext messages. Since for m e M, f(m) should hide the contents of m from an enemy, f-1 should, in a certain technical sense, be difficult to infer from f(m) and public knowledge about f.
Richard A. DeMillo +2 more
openaire +1 more source
A cryptographic transformation is a mapping f from a set of cleartext messages, M, to a set of ciphertext messages. Since for m e M, f(m) should hide the contents of m from an enemy, f-1 should, in a certain technical sense, be difficult to infer from f(m) and public knowledge about f.
Richard A. DeMillo +2 more
openaire +1 more source