𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient method for generation, storage and retrieval of data for the coordination of directional relays

✍ Scribed by N.A. Laway; H.O. Gupta


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
402 KB
Volume
29
Category
Article
ISSN
0378-7796

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A computer program for the storage and r
✍ Dr. Jeffrey R. Woodside; F. Max Morris πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 307 KB

## Abstract The computer is idcally suited for storing and retrieving a large volume of medical data. Described herein is a computer program written for the managemenr of data from patients who have had urodynamic evaluation. The program is highly user‐oriented and requires only minimal training of

General and efficient method for the syn
✍ Seiji Suga; Keiko Miyamoto; Mitsuru Watanabe; Jun-ichi Yoshida πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 69 KB πŸ‘ 2 views

Although alkoxymethylsilanes serve as useful building blocks, various efforts to synthesize them by substitution reaction with an alkoxide ion at the carbon adjacent to the silicon failed. To solve this synthetic problem a new route which is very simple to perform was developed. Bromination of (meth

Quantitative evaluation of vascular stat
✍ Margaret C. Conrad; Harold D. Green; James D. Yopp Jr. πŸ“‚ Article πŸ“… 1968 πŸ› Elsevier Science 🌐 English βš– 752 KB

A patient evaluation and data retrieval system for peripheral vascular disease has been designed to insure accurate, consistent, quantitative recording of information at each patient visit and to permit ready retrieval and processing of such data. Duplicating NCR forms have been prepared in such man

An Efficient Method for Version Control
✍ ESTHER JINEE CHOI; YONG RAE KWON πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 255 KB πŸ‘ 1 views

A new method for version controlling of a tree structure is presented. The key feature of the method is that the latest state of a tree is retained and other versions are constructed from it on request, and information on the change history of a node is maintaind in its parent node. Several algorith