Abstract: Medical device kits for use in placing, maintaining, altering, and/or removing medical devices in, on, and/or from the body of a patient are disclosed. Such medical device kits can include one or more wrap assemblies for use in the placement/maintenance procedure. In accordance with present embodiments, the one or more wrap assemblies of the medical device kit can include various features to assist the clinician performing the particular procedure. In one embodiment, a medical wrap assembly is disclosed, comprising a foldable wrap body that includes a front surface, wherein the front surface is configured to define a sterile field. A plurality of pockets is included on the front surface of the wrap body. The pockets are configured to contain therein a plurality of medical components. The medical components are arranged in the pockets in a predetermined order of use for the medical procedure.

Abstract: A method executed by a computer system for providing a visual interface Nor specifying relationships and correspondences between two graphically displayed database schemas in object oriented form. After displaying two schemas, selecting an object one from each and displaying their attributes. After selecting a pair of attributes if they are key attributes, comparing their domains and recording same and checking to determine if there is a mis-match as to data types. If either attribute is not a key attribute, checking to see if there is a mis- match of data types. If in either case there is no mismatch, then select a name for the combined attribute and deleting the attributes so combined from the list of attributes for each object. Repeating until all attributes of all objects of the two schemas have been combined, then generating a file containing all correspondences and a list of all assertions of correspondences.

Abstract: A method practiced by a computer system for generating SQL commands to create an integrated global schema. The input is two relational schemas in object-oriented form and a list of correspondences between components, object classes, objects and attributes. Based on correspondences object classes within one schema are folded into one object class, or relation, and likewise, based on correspondences one relation from each input schema is merged into a single relation of the integrated schema. This process is continued until no more object classes can be folded together and no more can be merged. SQL commands are generated based on specified correspondences between attributes depending upon whether a relation of the integrated relational schema was derived from only one relation of one of the input schemas, or is the result of the merger of two relations each from a different input schema. In the latter case, correspondences are based on the attributes of merged relations.

Abstract: A method for integrating the schemas of a plurality of independent and heterogeneous database management systems of a distributed database management system (DDBMS). The DDBMS includes a computer system in which the DDBMS resides and one or more subservient computer systems. The schemas of two of the independent database systems are fetched from the subservient computer systems. The schemas are converted from a relational database form to an object-oriented form. The schemas are then normalized and displayed graphically. Equivalencies are identified and the two schemas are integrated. These steps are repeated until the schemas of all data bases to be integrated have been integrated into a single integrated, or global schema.

Abstract: A method executed by a computer system for converting a database schema in relational form to a schema in object-oriented (00) form. The input is the schema of a database in relational form including all relations of the schema and the primary keys, reference keys, and attributes of each relation. A special data structure (SDS) is created for each primary key based on the number of attributes of the key. Each SDS becomes the basis of an object of the 00 schema produced. Attribute functions and cross-reference functions are created based on the SDSs and reference keys. SQL commands to map the relational input schema to the 00 output schema are identified.

Abstract: A method for graphically displaying an object-oriented schema on the screen of a computer system. The input is an object-oriented schema of a database in textual form. The input is parsed to identify the components of the schema. A connectivity matrix is developed in order to determine the number of interrelationships of objects. The screen is partitioned into cells, with each cell designed to hold an object and its attributes, with the object that has the maximum number of relationships with other objects being placed in the center cell of the grid, and related objects in adjacent (surrounding) cells. Relationships between objects and their attributes are identified by lines, arcs, labels, and arrows drawn on the screens of the display device of the computer system. The user can interface with the system by clicking on the graphical objects appearing on the computer screen.

Abstract: U2G is a software tool that runs on the GCOS-8 operating system and enables it recognize and process the commonly used commands of the UNIX operating system. U2G is a UNIX-GCOS-8 translator that enables the GCOS-8 to recognize, accept and execute UNIX commands. Thus, it enables the UNIX users to work with the GCOS-8 system without prior training. U2G can translate the most commonly used UNIX commands along with their respective options into equivalent GCOS-8 Time Sharing System (TSS) commands. U2G can be used with a "Verbose" mode option which serves to provide descriptive information about the commands and the translation process. U2G has on-line help screens and "explain" pages for all of the important concepts and equivalences. U2G enhances the capabilities of GCOS-8 by supporting the important UNIX concept of "aliasing" and the use of shell variables. Another enhancement to GCOS-8 is support for I/O redirection and simple command procedures.

Abstract: U2G is a software tool that runs on the GCOS-8 operating system and enables it recognize and process the commonly used commands of the UNIX operating system. U2G is a UNIX-GCOS-8 translator that enables the GCOS-8 to recognize, accept and execute UNIX commands. Thus, it enables the UNIX users to work with the GCOS-8 system without prior training. U2G can translate the most commonly used UNIX commands along with their respective options into equivalent GCOS-8 Time Sharing System (TSS) commands. U2G can be used with a "verbose" mode option which serves to provide descriptive information about the commands and the translation process. The verbose mode is disabled by a "terse" command.

Abstract: U2G is a software tool that runs on the GCOS-8 operating system and enables it recognize and process the commonly used commands of the UNIX operating system. U2G is a UNIX-GCOS-8 translator that enables the GCOS-8 to recognize, accept and execute UNIX commands. Thus, it enables the UNIX users to work with the GCOS-8 system without prior training. U2G can translate the most commonly used UNIX commands along with their respective options into equivalent GCOS-8 Time Sharing System (TSS) commands. U2G can be used with a "Verbose" mode option which serves to provide descriptive information about the commands and the translation process. U2G has on-line help screens and "explain" pages for all of the important concepts and equivalences. U2G enhances the capabilities of GCOS-8 by supporting the important UNIX concept of "aliasing" and the use of shell variables.

Abstract: U2G is a software tool that runs on the GCOS-8 operating system and enables it recognize and process the commonly used commands of the UNIX operating system. U2G is a UNIX-GCOS-8 translator that enables the GCOS-8 to recognize, accept and execute UNIX commands. Thus, it enables the UNIX users to work with the GCOS-8 system without prior training. U2G can translate the most commonly used UNIX commands along with their respective options into equivalent GCOS-8 Time Sharing System (TSS) commands. U2G can be used with a "Verbose" mode option which serves to provide descriptive information about the commands and the translation process. U2G has on-line help screens and "explain" pages for all of the important concepts and equivalences. U2G enhances the capabilities of GCOS-8 by supporting the important UNIX concept of "aliasing" and the use of shell variables. Further, the UNIX "piping" feature is made available to GCOS-8.

Abstract: A diagnostic expert system incorporating a cause-effect graph is disclosed in which "yes", "no" and "unknown" are valid possible responses to a query. Each node in the graph is assigned a local decision factor (LDF) based on a given node's desirability for selection during best-first search and a collapsed decision factor (CDF) based on the average values of the LDFs for all its daughter nodes. For a current node being processed, a list of all its daughter nodes is obtained and examined to remove all daughter nodes that have been visited before in the current transition and all daughter nodes which have prerequisites that are not met. Then, the daughter node with the largest LDF is selected and its test function is executed. If the user response is "yes", the daughter node is made the current node, and a list of its daughter nodes is obtained to continue the process.

Abstract: A multiple processor computer system features a store-into cache arrangement wherein each processor unit of the system has its own unique cache memory unit. Data operated upon by any one of the processor units is stored in the cache memory associated with that processor unit. When a thus modified block of data is required by another one of the processor units, the requested data is transferred directly to the requesting processor unit without having to first transfer the data to a shared main memory. Provision is also made for transferring data, under prescribed conditions from a cache to the main memory, but not as a precondition for transfer to a requesting processor.

Abstract: A bit-string address or a multi-bit character count is converted to a real word memory address by division by a constant value. The division is accomplished without reference to an arithmetic logic unit. Division is accomplished by means of a look-up table stored in a ROM with the quotient and remainder values being stored in the ROM. The provided address, or dividend, values are used to address the ROM to determine the quotient and remainder values corresponding thereto. When the dividend values are of a dimension larger than can be divided by a single pass at the ROM, the division is accomplished by several successive passes through the ROM to provide a succession of partial quotient values. The resulting quotient and remainder values define the proper address for the computer memory.

Abstract: Method and apparatus for producing the residue of the product of a multiplier and a multiplicand where the multiplier, multiplicand and product are residues with respect to a check base m, and where m=(2.sup.b -1) and b is the number of bits in a residue. An addressable memory device has at least 2 2(b-1) memory locations with each memory location having an address of 2 (b-1) bits. The address of each memory location can be considered as having two components each of (b-1) bits. The residue stored at each addressable location of the device is the residue of the product of the two components of its address. In response to each address being applied to the memory device, the residue of the product of the two components stored at the addressed memory location is read out of the device. The lower order (b-1) bits of the multiplier is applied to the device if the most significant bit of the multiplier is a logical zero.

Abstract: In an information handling system in which a cyclic code is utilized to both detect and correct errors and a cyclical redundancy code is used for supplementary detection of errors, the cyclical redundancy code (CRC) polynomial is chosen to be a factor of the generator polynomial, g(x), of the error detection and correction (EDAC) code. In this way, the same check bits in the code word used for error detection and correction may be further utilized for a CRC check to supplement the error detection capabilities of the system. The risk of miscorrection of data is reduced to de minimus levels by the partitioning of data and count fields in the course of the development of the error detection and correction codes. Practice of the teachings herein disclosed provides a more efficient error detection and correction system with greatly reduced risk of miscorrection. An embodiment of the invention is disclosed following the methodology taught herein.

Abstract: A system and apparatus for accurate measurement of a rocket's attitude that includes a laser source placed downrange and pointed towards the rocket with a diverging beam. The beam will be intercepted by a mirror on the rocket's ogive, and the reflected beam will then be presented on a vertical target. A detector assembly positioned behind the vertical target plane detects the centroid of the reflected energy and provides an analog output signal.

Abstract: An automatic balancing concept including two annular containers used to dmically balance a rocket during flight. The containers are partially filled with a high density fluid and are installed forward and aft of the longitudinal CG of the rocket. When spin is induced in the rocket the radial CG will shift to the spin axis and the fluid will couple itself to the outside diameter of the ring.

Abstract: The invention comprises circuitry for systematically multiplying two arbitrary field elements in a Galois field GF(2.sup.m). Each element is represented by an m-bit binary number. The multiplicand field element is passed serially through a plurality of m-1 modulo multipliers. The multiplicand and the product from each of the m-1 modulo multipliers are passed through networks which are gated by bits of the multiplier field element forming partial products. The partial products are summed to form the bit representations of the final product.

Abstract: Apparatus for directly decoding and correcting double-bit random errors per word and for detecting triple-bit errors per word is disclosed. Said apparatus comprises a syndrome calculator which operates upon codewords received from memory and generates syndromes. The syndromes are operated upon and translated by a mapping device which generates pointers identifying the bits which are in error. The pointers are then passed through decoding means to generate error words which are summed with the received word from memory to provide a corrected codeword. The syndrome calculator may further provide a parity check signal to determine if a three-bit error is present, in which case the decoding means are not enabled and a signal is generated indicating that a triple-bit error has been detected which is not correctable.