Abstract: An interactive restaurant communication system (10) provides integrated food and entertainment processing which enables restaurant patrons to accomplish both food selection and select and receive entertainment on a common video monitor (56) at their table. The patrons can obtain menus for individual food selection on the video monitor (56) at their tables and individually enter their orders into a table station "intelligent" terminal (12, 14, 16, 18, 20) at their tables. In addition they can select from and interactively play a variety of remotely retrievable interactive entertainment activities using the video monitor (56) while waiting for the food to arrive, and if desired, where applicable, have the food and entertainment charges automatically added to a composite bill which may be printed at the table station terminal (12, 14, 16, 18, 20) or at a remote central location. The food and entertainment functions of the terminal (12, 14, 16, 18, 20) are down-line loaded from a central data base (22, 32) in response to terminal requests therefor.

Abstract: A method and apparatus for transforming data transmitted from a remote information processing system which operates in a first internal code format to the internal code format of a second receiving information processing system. The method includes a control program for operating the receiving information processing system in an interactive mode with the operator. The control program displays prompts and command options to the operator which enables the operator to construct a transform table of conversion characters for the communication session. The conversion table is also useable by the control program routines to reverse the data transmission operation by converting the internal code format of the second information processing system to the internal code format of the first information processing system for data transmission in the opposite direction.

Abstract: A summary table is one of the useful data structures used in statistical databases. For an algebraic summary table manipulation language, we first extend relational algebra for nested relations and aggregate functions, then propose a summary table manipulation language based on the extended algebra. A new operator, called aggregation-by-template is introduced, and other operators of the relational algebra are modified to apply nested relations. A special case of summary tables, called primitive summary table, is distinquished since it can be directly represented by a nested relation. Primitive summary tables are viewed as building blocks of summary tables. Operators for constructing and manipulating summary tables, and their properties are also discussed.

Abstract: PURPOSE:To automate the service to rationalize it, by storing the penalty rate/ amount in a memory part in accordance with the number of days from the data of reservation cancellation to the date of reservation and subtracting the penalty from the advance payment to adjust the difference in case of reservation cancellation CONSTITUTION:On an operation panel 3 of a register, an ordinary mode switching key 4, numerical keys 6, departmental keys 7, and function keys 5 are provided, and a function concerning the advance payment is given to functions keys 5 besides ordinary functions An RAM which is not shown in a figure is provided with a check number table TBC, where reservation numbers, reservation dates, and advance payments are stored, and a penalty rate table TBK, and the penalty rate/amount is stored in accordance with the number of days of the date of cancellation to the date of reservation When the reservation date and the check number are inputted through keys 3 in case of the proposal of reservation cancellation, a CPU retrieves the table TBC and calculates the penalty on the basis of the table TBK and subtracts the penalty from the advance payment, and the result is printed out to adjust the difference Thus, the adjustment is automatized to rationalize the service

Abstract: An address translation system is provided which has a real storage, a virtual storage having a "V═R" segment (first segment), second segments to be subjected to two-level paging, and page table segments (third segments) to be used as a page table corresponding to the second segments, a segment table, a first page table which corresponds to the second segments, a second page table which corresponds to the page table segments, and a memory control unit having a virtual address register and a microprocessor for translating the virtual address in the virtual address register into a real address. By means of microprogram control, the microprocessor has a first address translation function for obtaining a real address from the page number and the displacement data of the virtual address if the segment number of the virtual address represents the first segment, a segment table referring function for referring to the segment table based on the segment number if the segment number does not represent the first segment, and a second address translation function for referring to the second page table based on the reference result from the segment table and the several most significant bits of the page number, for referring to the first page table based on the reference result of the second page table and on the remaining bits of the page number, and for obtaining the real address from the reference result of the first page table and the displacement data.

Abstract: Two studies were performed to evaluate learning and use of Query by Example (QBE) and Structured Query Language (SQL) for two user groups - college Business Administration students and secretaries. Test participants were taught each query language using a program controlled training package, and all database queries were performed online. Data on task times and detailed tracking of user performance were collected by an independent computer. Subjective responses were collected on a post-test questionnaire. Overall, both groups learned SQL faster than QBE. The additional learning time for QBE can be attributed to teaching how to manipulate table skeletons on a display screen and explaining the concepts necessary to perform queries involving aggregation, built-in functions, output tables and the QBE Condition Box. Both languages were learned equally well for the lessons on simple queries and queries involving comparisons and logic. Business students learned to write queries using more than one table faster o...

Abstract: The chunk manager provides simple transaction management, concurrency control and allocates, administers and retrieves apparently contiguous chunks of data of arbitrary and varying size on disc. This system is designed to permit students and research workers to rapidly assemble and test their own DBMS, supporting any data model. Currently it is being used to support PS-Algol, an implementation of DAPLEX, a relational system and student database exercises. A chunk is similar to the common meaning of ‘record’ except that there is no implication of internal structure or consistent and static size. An efficient table processing capability is also provided. Locking and access control are implemented at the bag level to prevent conflicting use of data without excessive operating cost. The problems associated with concurrent access of shared bags have been studied and the currently implemented and future proposed solutions are discussed.

Abstract: This disclosure relates to a knock-down table formed by a pair of frames each constructed from a plurality of pivotally interconnected rods with each frame being foldable from a collapsed inoperative condition to an erected operative condition in generally spaced upstanding adjacent relationship to each other, the frames being self-locking and having upper pairs of corners at which rings are pivotally connected to selected ones of the rods, a pair of rails spanning the frames and including male connectors for insertion in innermost adjacent ones of the rings to thereby connect the frames and lend stability thereto, at least one additional rail spanning outer corners of each frame for further stability, and a planar supporting sheet supported generally atop and in spanning relationship to the rails to provide a table top for supporting articles thereupon.

Abstract: A new stability testing table is presented for discrete linear system. The table is similar to the Routh table in size, amount of computation as well as other features. The new table requires for a discrete system polynomials about half the number of entries and arithmetic operations that is needed in the previous Jury-Marden criterion in tabular form.

Abstract: A method is given to classify rows and columns into subgroups so that additivity holds within each of the subtables made of the grouped rows or the grouped columns. The least squares estimators of the cell means are easily obtained for the resulting linear model together with their variances. An estimator of the error varianceσ2 is given when there is only one observation per cell. A treatment of an ordered table is also given.

Abstract: For a Prolog processor, a plurality of table entries are formed in a predetermined number of formats for storage in a program memory (21). Each table entry has a preselected number of fields which are related to the fields of at least one other table entry so that the table entries represent a Prolog program. A plurality of registers (26-28) are for storing, from time to time, various fields of the table entry read out of the program memory. Responsive to the fields of the read-out table entry, a control unit (25) controls a selector (22) for selecting one of the registers at a time to make the field stored in the selected register access the program memory for read out of another of the table entries.

Abstract: An electronic cash register includes a first memory storing a table of upper and lower limits of money amounts defining allowable input ranges of amounts of money during various transactions. A second memory stores codes for defining the upper and lower limits of money amounts for the various transactions by reference to the table of amounts of money stored in the first memory.

Abstract: PURPOSE:To quickly and precisely correct programs relative to a corrected source program by setting up a means for controlling the reference and relations between programs and a table to be referred. CONSTITUTION:When a copy library and a source program are to be corrected, information for the correction is inputted from a correction processing receiving part 11. On the basis of the correcting information, a source program correcting part 12 fetches a source program as a program to be translated by using the reference between programs and a table 16 to be referred and inputted to a translating circuit 13. The translating circuit 13 translates the fetched source program and prepares a relative type program consisting of machine languages. A correcting object executing type program selecting part 14 selects a correcting object executing type program by using the reference between the programs and the table 16 to be referred. A correction executing type program preparating and processing part 15 prepares an execution type program on the basis of the selected information to complete the correcting operation.

Abstract: PURPOSE:To attain efficient, speedy access to a file by permitting a file generation, request to contain logical medium indication information, and allowing a data control system to decide on a physical medium and generate a file on the basis of the information. CONSTITUTION:In response to three instructions ALLOCATE of a user program 1, a data control system OS2 decides on a corresponding physical medium and then operates on converntional automatic file generation schedule when there is medium indication iformation included, or operates immediately on the conventional automatic file generation schedule when not. When the physical medium is determined, the OS2 sets a comparison table 3 for a logical medium and the physical medium. Thus, files W1 and W3 are set on the physical mediumI, and a file W2 is set on the physical medium II.

Abstract: PURPOSE: To process order data by providing numbers of dish name key parts, an order data input card which stores and displays order data, a detector which reads and stores data from the input card and further prints out the data, and a cash register. CONSTITUTION: A waitress at a restaurant inputs a customer's order on the input cards 10 with keys beside a customer table and then loads the input card 10 in a recessed part 21 of the detector 20 on a counter in front of a kitchen. Then, the order data in the RAM in the card 10 is read in an RAM of the detection part 20 through an optical plug part 104 and an optical socket 205. This order data is outputted on an order slip 22 through a printer 206. Two slips 22 are issued in this case; and one is used for a cooking indication to the kitchen, and the other is sent to the customer seat for confirmation. When the charge is paid, the customer number of the slip 22 that the customer carries is inputted on the keyboard of the register 30. and then the corresponding order data is read out of the RAM of the detector 20 to calculate the charge according to a unit price list; and the results are output on the printer for payment. COPYRIGHT: (C)1985,JPO&Japio

Abstract: PURPOSE:To improve the reliability of data conversion, by grouping all files in similar format having the same data attribute, and applying the same conversion parameter. CONSTITUTION:A parameter attribute table generation part 5 takes only attributes out of a data conversion parameter input file to generate a parameter attribute table 6. An identical attribute confirmation processing part 7 generate an identical attribute information file by grouping files having the same attribute parameter among all files. A source attribute table generation part 10, on the other hand, generates a source attribute table 11 from a source copy library 9. A parameter attribute checking part 12 makes a check by comparing the source attribute table with attribute patterns and outputs the check results to a parameter correction processing part 13. This processing part 13 analyzes the check results to make corrections. Thus, a data conversion processing part 14 applies the same conversion system to files having the same attribute for processing.

Abstract: PURPOSE:To quickly perform area management, by installing an area managing table whose storage area is divided into cells having a corresponding entry to each cell, and setting assigned information and information regarding the number of continuous vacant cells in the table, and performing the assignment and release of the storage area in referring to and updating the table. CONSTITUTION:A storage area for assignment 1 as a common area on a memory 11 is managed after it is divided into cells 2-1-n of a prescribed size. An area managing table 16 is installed separately from the storage area 1 and the table 16 has entries corresponding to the cells 2-1-n of a number equal to the number of the cells 2-1-n. One type, for example, is assigned to each entry and assigned information or information regarding the number of continuous cells of each corresponding cell is plated in each entry. In this way, the assignment and releasing processing of the area are performed simply and quickly.