Results 251 to 260 of about 32,367 (309)

THE PERSONAL COMPUTER AS A TSS TERMINAL

open access: yesKodo Keiryogaku (The Japanese Journal of Behaviormetrics), 1983
openaire   +2 more sources

Computer-based documentation and bedside terminals [PDF]

open access: yesJournal of Nursing Management, 1995
Rising health care costs and the need for enhancing the quality of clinical care are concerns of hospitals throughout the world. Documentation consumes excessive amounts of nursing time and directly influences the quality of clinical practice, research, administration and education.
MERKOURIS, A.V., Merkouris, Anastasios
openaire   +4 more sources

Increasing Capabilities in Interactive Computer Graphics Terminals

Computer, 1972
The earliest interactive computer graphics terminals were closely coupled to their central computers and placed heavy loads upon them for resource allocation. Two marked trends in the evolution of terminals have been a reduction of central computer load and exploitation of the increasing performance/cost ratio for terminal equipment.
exaly   +2 more sources

Computing terminal reliability of computer network

Reliability Engineering, 1986
Abstract This paper discusses a technique for determination of the computer network reliability. The method utilizes the concepts of Boolean algebra and graph theory. It starts with the system success determinant obtained from the connection matrix and expands it using the simple rules defined in the text.
Suresh Rai, Arun Kumar, E.V. Prasad
openaire   +1 more source

A computer terminal for a quadriplegic

ACM SIGCAPH Computers and the Physically Handicapped, 1978
A computer terminal has been modified for use by a quadriplegic with no limb control; all operations are done with a mouth stick. A new keyboard was built and logic circuits were added to permit using the "shift" and "control" functions with only one "finger".
David Hagelbarger   +2 more
openaire   +1 more source

On the Computational Content of Termination Proofs

2015
Given that a program has been shown to terminate using a particular proof, it is natural to ask what we can infer about its complexity. In this paper we outline a new approach to tackling this question in the context of term rewrite systems and recursive path orders.
Georg Moser, Thomas Powell 0001
openaire   +1 more source

Home - About - Disclaimer - Privacy