Abstract: A computer system with self-describing feature table, accessible by device drivers. Thus a simple process can access these feature tables to fully customize the device drivers at installation, or at boot; or the device driver can branch on the data in the feature table. Thus, a new degree of flexibility is achieved without degrading performance.

Abstract: Routing tables for communication networks can be designed using many different approaches, including table lookup, content-addressable memory (CAM), hashing, and tries. The authors compare these approaches in the context of custom VLSI implementation. For tables with a small number of entries and a large address space, CAMs can be very cost effective. If only RAM is available, it is shown that tries, of which simple table lookup is a special case, provide a useful architecture. Also considered is a new variation, table partitioning, which constitutes a useful compromise between the conventional CAM and a trie. >

Abstract: A database management system for use in designing integrated circuit chips. A large number of designers and users are given concurrent access to design data stored in a Master Table by providing each designer with a private copy of the Master Table called the designer's Virtual Table. Each designer can independently alter data displayed from the designer's Virtual Table without interfering with other designers. Whenever a designer alters the displayed data, the displayed row containing the altered data is written to the Master Table and the designer's Virtual Table, provided that the Master Table row's time-date stamp matches the corresponding Virtual Table row's time-date stamp. If the time-date stamps do not match, then the Master Table row is copied into the Virtual Table, the designer receives an error message, and the designer is allowed to update the corrected row.

Abstract: A selective call receiver, such as a pager, stores an incoming message without interrupting the operation of the receiver. One set of data items displayed on a display of the receiver is updated independent of another set of data items. The updating function allows for the display of display formats such as forms and tables, wherein only the information needed to fill in the table is transmitted, the header information being retained from one update to the next.

Abstract: PURPOSE:To efficiently execute the information processing by positioning the data whose use frequency by a user is high in the vicinity of the head of many candidates so that the reference is facilitated. CONSTITUTION:In a RAM 16 of an application card 2, for instance, fifth stored data in a priority storage means is read out of a master table storage means, and when this fifth data is written out to a transaction file storage means together with accompanied incidental information, as for fifth data, its priority is changed to first priority and it is stored in the priority storage means. Accordingly, the data used this time can be referred to in first priority in the next time, and as the number of times of use increases, the data whose use frequency by a user is high comes to be positioned in the vicinity of the head of many candidates. In such a way, it does not take time for the information processing.

Abstract: An improved apparatus and method for sorting of information in a computerized spreadsheet or the like. The improved system provides for display of a graphical indication in the form of an icon indicative of the sort type, either by rows or by columns, which the data will be sorted in when a sort operation is performed.

Abstract: A table top image based document processing machine and methods of using it. The machine is used in conjunction with a host computer like a PC. The machine includes a document track, a programmable transport mechanism for moving the document bi-directionally within the track, front and back imagers for imaging the front and rear of the document, front and back printers for endorsing data on the front and the back of the document, a magnetic card reader module, an encryption module and a MICR printer for encoding MICR data on the front of the document, for example. The machine in conjunction with the PC can be used for generating Logos, creating checks, performing remittance processing, imaging and reading checks, truncation processing, lockbox operations, and the usual bank teller operations.

Abstract: A method of and apparatus for constructing a control system and a control system created thereby which is based on a finite state machine with constant code (FSMcc). An input preprocessor module normalizes input signals as required by the FSMcc logical processing unit. An output postprocessor module changes the normalized finite state machine outputs to real signals required by the controlled process or apparatus. The input preprocessor allows for a different finite state machine required for an application to be executed by the same constant code contained in the FSMcc microcode storage. An application logic table for the FSMcc is constructed using a specific organization of data representing application logic conditions. This organization allows the entire application logic to be expressed in a table of a technically feasible size. The size of the FSMcc application logic table memory is greatly reduced. The symbolic application logic table is build in a simplified form using implied AND and OR logical operators. This symbolic application table is directly converted into the FSMcc application logic table.

Abstract: An object-oriented data base management system connected to a plurality of data bases includes a class definition unit, a static inheritance processing unit included within the class definition unit, a message processing unit, a dynamic inheritance processing unit included within the message processing unit, and an object management unit. The object-oriented data base management system is of the type that defines the inheritance relationship between a plurality of classes and an arbitrary class and the inheritance priority order, the class being a basic unit of programming, and executes the data processing by solving the inheritance relationship between classes in accordance with the priority order. There is prepared, for each class, updatable inheritance solution status information which the static inheritance processing unit causes to be stored in a table. The inheritance solution status information includes status information and time information. The status information is representative of whether or not inheritance between the class and the superclasses can be completely solved, and the time information is representative of a time when the status is established. When a message processing is requested for an object of a class, the dynamic inheritance processing unit searches the method designated by the message while referring to the inheritance solution status information regarding the class and the superclass stored in the table.

Abstract: A method is provided for activating a rating capability in a microprocessor-based parcel manifest system. The method includes storing in the system's memory a number of rate tables, each containing data for calculating parcel shipment charges, and disabling access to one or more of the rate table. A rate activation request, which includes information that identifies the system and the rate table to be activated, is transmitted to a data center. In response to the request, an activation code is received from the data center. Access to the rate table is activated by entering the received code into the system. Activation of a rate table may be temporary and subject to a time deadline.

Abstract: A first table status control unit, which may be a master or maitre d' table status control unit, includes a first plurality of visual indicators, each visual indicator corresponding to an associated table for visually indicating the status of that table. A second table status control unit, which may be a waiter or busboy table status control unit, includes a second plurality of visual indicators, each visual indicator corresponding to an associated table in the first group of tables. A status entry device is provided for the first and second table status control units for entering status information for the tables. The possible table status include reserved, occupied, vacant, or closed (unavailable) and the keypad may be used to enter a time at which the table is to have a reserved status. Any number of reservation times may be entered for each table. If desired, an average seating time may be entered through the keypad or calculated by the processor so that, if the maitre d' wishes to seat a party at a table that is reserved at a later time, then seating will be allowed if the average seating time is less than the time remaining until the reservation time, or prohibited if the average seating time is greater than the time remaining until the reservation time. When a party is seated at a table that is reserved for a future time, then the system alerts the maitre d' if the reservation time is approaching and the table is still occupied. The average seating time also may be used to alert the maitre d' if a table has been occupied longer than the average seating time.

Abstract: An apparatus for manipulating a relational data base includes a unit for describing input data in a table format, a unit for describing all the operational manipulation with respect to the input data in a non-text format, and a unit for outputting data by referring to the relational data base based on the described input data and operational manipulation. The input data of a table format includes an input table and an output table. The input table includes an operational description region and the output table includes a region wherein a map relation between the respective items of the input and output table is described. The manipulation contents are described in the operation manipulation description region and the map relation description region. The operation flow is described and defined by a connection line with directiveness. The apparatus enables description of all the operational manipulation in a graphical manner in a non-text format, providing a user with data base manipulation environment with excellent understandability and operability.

Abstract: An apparatus for storing and retrieving data acts as an interface between modules such as data collection devices and data analysis tools. The apparatus provides the capability of maintaining a data standard so the number of translation tools needed to transfer data from one module to another is reduced. The apparatus maintains the data standard by means for storing a configuration data structure having table data structures. The configuration data structure and the table data structure define a data model. The data model is editable. Complex, as well as simple, items may be stored in the table data structure.

Abstract: Summary- I Database Design- 1 Relational Databases- 2 Choice of Database Management System- 3 Design of the Global Paleomagnetic Database- 31 ORACLE Design- 32 Compact Database - ABASE- 4 Aspects of Data Entry- II Oracle Hardware and Software- 1 Sytem Hardware and Software Recommendation for ORACLE- 11 For a Fully IBM Compatible Personal Computer (PC)- 12 For an Apple Macintosh PC- 13 Recommendations- 2 ORACLE RDBMS Software Used By the GPMDB- 21 A Brief Description of the ORACLE RDBMS- 22 SQL*Plus under MS-DOS- 23 SQL*Forms under MS-DOS- 24 SQL*Menu under MS-DOS- 25 TheCRT File- III Database Installation and Maintenance- 1 The Role of the Database Administrator- 2 Preparing Your PC for the Installation of ORACLE RDBMS- 21 ORACLE RDBMS for MS-DOS and Extended Memory- 22 Setting up MS-DOS for ORACLE- 3 Installing the ORACLE RDBMS- 31 ORACLE Directory Structure- 32 Installing the ORACLE RDBMS for MS-DOS- 33 Step by Step ORACLE RDBMS Installation Instructions- 4 System Preparation and Loading the Global Paleomagnetic Database- 41 System Preparation- 42 Installing the Global Paleomagnetic Database- 43 Loading the Custombuilt Files- 5 Database Administrative Tasks- 51 Starting the ORACLE RDBMS- 52 Stopping the ORACLE RDBMS- 53 Changing the System Default Passwords- 54 Setting up UserIDs and Passwords- 55 Setting up User Access to SQL*Menu- 56 Checking Database Storage- 57 Expanding the Database- 6 Backing Up and Restoring Your Database- 61 The Export Utility- 62 The Import Utility- 7 Factors Affecting ORACLE Performance- 71 PC System- 72 Fragmentation- 73 Protected Versus Real Mode ORACLE Performance- 74 ORACLE Performance Tuning- IV Database Queries with SQL*Menu and SQL*Forms- 1 SQL*Menu with the Global Paleomagnetic Database- 11 Starting SQL*Menu- 12 The Main Menu for the GPMDB- 2 Running SQL*Forms (RUNFORM)- 21 Elements of a Form- 22 Custombuilt Form - PALEOMAG- 3 SQL*Forms Designer (SQLFORMS)- 4 ORACLE for Macintosh with HyperCard- V Database Queries With SQL*Plus- 1 The ORACLE Database System- 11 Starting ORACLE- 12 Stopping ORACLE- 13 ORACLE Userid and Password- 2 Introduction to SQL*Plus- 21 Logging Into and Out Of SQL*Plus- 22 Entering SQL Commands- 23 Selecting Data from a Table - The Select Statement- 24 Selecting Specific Rows - The Where Clause- 25 The SQL Buffer- 26 The SQL*Plus Line Editor- 27 Ordering the Rows from a Query - The Order By Clause- 28 Selecting Unique Rows - The Distinct Operator- 29 Views- 3 Developing More Complex SQL Commands- 31 The Data Dictionary- 32 Determining Table Definitions - The Describe Command- 33 Selecting Data from More than One Table - Table Joins- 34 Abbreviating a Table Name - Table Aliases- 35 Using More than One Selection Criterion - The And Operator- 36 Substitution Variables - & Variablename- 37 Warning - Beware of Traps for the Unwary- 4 SQL*Plus Commands- 41 Entering SQL*Plus Commands- 42 SQL*Plus Command Summary- 43 SQL*Plus Command Files- 5 More Advanced SQL Queries- 51 Multiple Table Joins- 52 Group Functions- 53 Summarising Several Groups of Rows- 54 Subqueries - The In Clause- 55 The Outer Join- 56 Join Versus Subquery- 57 Optimising SQL Queries- 6 Using SQL*Plus Commands to Operate on Your Own Data- 61 Creating, Dropping and Altering Tables- 62 Changing Data in Your Tables- 63 Creating and Dropping Views- 64 Tables versus Views- 65 Renaming Tables and Views- 66 Creating and Dropping Synonyms- 67 Granting and Revoking Privileges- References- Acknowledgements- Appendices- Appendix 1 - Table and View Descripions- 11 List of Tables and Views in the GPMDB- 12 Description of Tables in the GPMDB- 13 List of the Views in the GPMDB- 14 Description of Tables in the Compact Database - ABASE- Appendix 2 - View Code- 1 SQL Statements Used to Create the GPMDB Views- 11 View ALLCAGE- 12 View PRICAGE- 13 View RSLTALL- 14 View RSLTPRI- Appendix 3 - Custombuilt SQL Command File Code

Abstract: Many of the application systems being designed today, variously known as marketing information, decision support, and management reporting systems, aim to exploit the strategic value of operational data of a commercial enterprise. These applications depart from the row-at-a-time update transaction model of the DebitCredit [1] and TPC benchmarks, and are almost wholly dependent for their performance on what we name "set queries", queries which need to refer to data from a potentially large set of table rows for an answer. The Set Query benchmark chooses a list of "basic" set queries from a review of three major types of strategic data applications: document search, direct marketing, and decision support. In Section 1 of what follows, the data and queries used in the Set Query benchmark are explained and motivated. In Section 2, benchmark results are presented for two leading database products used in large scale operations: IBM's DB2 and Computer Corporation of America's (CCA's) MODEL 204. Surprisingly large performance differences, factors of ten or more for some queries, are observed with respect to I/O, CPU and elapsed time, emphasizing the critical value of benchmarks in this area. In Section 3, a detailed explanation is given of how to generate the data and run the benchmark on an independent platform.

Abstract: A program replacing method is provided for an uninterruptible online computer system. The computer system includes an auxiliary storage unit for storing a program currently running in the computer system and another program to replace the current running program and a replacement request managing table for storing replacement requests and program IDs of such replacing programs. These programs include checkpoints pre-programmed at selected locations therein. At an optional checkpoint, the replacement request managing table is retrieved for checking whether or not the replacement is requested. If a replacement is requested, the new program is started according to the program ID and the current program is terminated.

Abstract: The invention relates to laboratory apparatus for performing repetive tasks, such a inoculating multiple bacterial cultures into petri dishes. First and second bearing ways are located below a table in a frame, the bearing ways supporting for independ-ent movement therealong, respectively, first and second carriages. An independently operable transfer mechanism can transfer objects between the table and a selected one of the carriages or between the carriages themselves. A mechanism is provided to per-form the task on an object positioned on the table or a carriage. The movement of he carriages, the transfer of objects, and the performance of the tasks are all coordinated in accordance with the respective tasks to be performed.

Abstract: This handbook presents the main body of mathematical knowledge and demonstrates how that knowledge can be applied to solving problems in engineering. The book will serve two important functions: to provide the reader with a reference source in reviewing mathematical principles and definitions; and to enable the reader to sharpen and maintain skills in creative problem solving. It is a "quick reference source" allowing the reader to locate a definition of a term easily and includes a "table of derivatives" for quick reference.

Abstract: A protection system design algorithm that encompasses all possible circuit configurations of a radial distribution system is presented. A predetermined set of coordination rules is incorporated to develop a relational database type managed coordination table. The algorithm performs both computerized placement and selection of devices which coordinate. Automated placement rules determine the location of any new devices required for circuit protection. Automated selection rules work with the coordination table in selecting groups of protection devices which mutually coordinate for the chosen circuit design. A design example is presented depicting a radial distribution system composed of three individual circuits. >

Abstract: A database management system for use in designing integrated circuit chips. A large number of designers and users are given concurrent access to design data stored in a Master Table by providing each designer with a private copy of the Master Table called the designer's Virtual Table. Each designer can independently alter data displayed from the designer's Virtual Tably without interfering with other designers. Whenever a designer alters the displayed data, the displayed row containing the altered data is written to the Master Table and the designer's Virtual Table, provided that the Master Table row's time-date stamp matches the corresponding Virtual Table row's time-date stamp. If the time-date stamps do not match, then the Master Table row is copied into the Virtual Table, the designer receives an error message, and the designer is allowed to update the corrected row.

Abstract: A mechanism allows for programming the order of cells for an operator to enter data in a spreadsheet. Each cell of the spreadsheet may be provided with a "next cell" attribute, and these attributes as well as other attributes for the cells are stored in a table. The "next cell" attribute may be a constant, such as the name of the next cell, or it may be a logic expression so that the next cell to be edited can be different depending on some condition. When the operator presses the NEXT CELL key, the "next cell" attribute is searched by accessing the attribute table, and if a "next cell" attribute is found, it is evaluated to determine the next cell to be edited.

Abstract: A facsimile apparatus stores image data transmitted from another facsimile apparatus to the facsimile apparatus in a corresponding image file table in a memory. The image data is correlated with the other facsimile apparatus in the image file table so that an image corresponding to the image data can be conveniently searched, permanently preserved, arranged, and erased. The image file table is automatically made every time the facsimile apparatus receives the image data from another facsimile apparatus.

Abstract: A method for generating a new configuration of a program containing a plurality of modules and stored in a data processing system. A first table built in response to data entered by a user at a workstation contains the correspondence between each program function and an assigned user. A second table built in response to requests for creating or modifying specified functions indicates for each request, a request number, a description of the requested work, and the function assignee retrieved from the first table. Then, a message is sent to a function assignee that contains the request number and description of the requested work. A third table built in response to users starting the work requested contains for each request number, a status for the requested work. By reading the third table, a report of the status of the requests is prepared which helps the program administrator to prepare a new configuration of the program.

Abstract: The preparation of a list of objects to be removed in quantities from the compartments (24) of a set of compartments (22) at each of the loading stations (2) distributed along a conveyor (11) of containers (4) uses a plate, (small table) (6) which is movable along the conveyor. The plate (small table) is equipped with a container weighing device, with readers (63L, 63O) of codes carried by the objects and with interactive screen/keyboard means (62C, 62E) controlled by a list data processing unit which assists a preparation device (PR) in making up the list. For each designated compartment, the plate (small table) is moved close to the compartment or the relevant column (24) of the set of compartments, the code, if there are removed objects, is read and verified, and, after the objects have been placed in a container, the weight of the removed objects is verified by comparison with a previously stored corresponding weight of objects. The invention remedies errors in reading a list of objects and in identification of the objects, and contributes to increasing the productivity of the preparation device.