Abstract: The present invention discloses a join operation processing system in a relational model where a data base processing mechanism provides at least maximum/minimum calculation execution means, reduction sort execution means and the join operation execution means. During the join operation for generating a new table linking tuples of a plurality of pertinent tables based on a common field or plurality of common fields, a minimum extraction range for determining the tuples to be processed is determined with respect to the join field or the plurality of join fields for each table which is considered as the object of the join. The operation rate is thereby improved by omitting the processing referring to unwanted data.

Abstract: A three-dimensional table look-up MOSFET modeling technique is described. The table, which is able to deal with future submicron devices, is constructed with a few thousand work memory capacity requirement by suppressing data redundancy. Sufficiently high accuracy, with less than point several percent error, is achieved by using a special interpolation, which is called curve shape fitting technique. Computational time to perform the interpolation from the table is much less than that for the analytical model.

Abstract: A precision parallel translation system including a pair of tables or upper and lower tables movable parallel to and in directions perpendicular to each other, and a pair of drive means for rough movement each detachably connected to one of the tables to drive the respective table for movement a relatively long distance. Each table supports drive means for fine movement detachably connected to a base (which is the lower table in the case of the upper table) supporting the respective table. The table is moved a relatively long distance by the drive means for rough movement when rough movement is effected, to effect rough positioning of the table. Then the drive means for fine movement is secured to the base while detaching the drive means for rough movement from the table, to drive the table for fine movement to effect precision positioning of the table.

Abstract: An improved method for storing and accessing relation­ al data bases in information processing systems. The data base records (44) are synthesized into a summary sorted list (45) of unique data elements. The data elements are related by virtue of their positions in the sorted list to pointers stored in an index table (43) which is an isomorphic mapping of the data base records from which the summary sorted list was derived. The index table captures the record content and juxtaposition of the record fields in a relational manner and yields the effect of a totally inverted data base file. The index table pointers facilitate high speed relational query proces­ sing with a minimum allocation of memory.

Abstract: A characterization theorem is given for the classes of functions which are representable by signature table systems. The usefulness of the theorem is demonstrated in the analysis and synthesis of such systems. The limitations on the power of these systems come from the restrictions on the table alphabet sizes, and a technique is given for evaluating these limitations. A practical learning system is proposed and analyzed in terms of the theoretical model of this paper. Then an improved method is described and results are presented from a series of experiments.

Abstract: Various probabilities of accidental linearities occurring in a random, reversible substitution lookup table (S-box) with m address and m contents bits are calculated. These probabilities decrease very dramatically with Increasing m. It is conjectured that good S-boxes may be built by choosing a random, reversible table of sufficient size.

Abstract: An electronic score-keeper for table tennis or Ping-Pong having a digital read-out for display of the score and having lamps which are energized to indicate responsibility for the serve Each player presses a button at the side of the table to register his points Proper serve indication is given throughout the course of the game, as prescribed by the international rules of table tennis

Abstract: This paper presents a method of structured-information extraction from patent-claim sentences. A patent-claim sentence is converted to the internal form of a case structure by a semi-automatic parsing. The internal form is normalized and the specified information is efficiently extracted by referring to a specification table given every special branch. The specification table consists of several subframes which specify the items to be extracted in a standard case structure. The extracted information is stored in relational tables for relational retrieval and some precision-oriented retrieval using role-indicators. The feasibility and the effectiveness of this method are examined by a computer simulation.

Abstract: Dynamic replication of data under distributed system control to control the utilization of resources in a multiprocessing, distributed data base system avoiding a central node maintained control, or synchronization by immediately conforming all copies of an updated data file, is achieved by a distributed access control of peer elements by which, requests for access to data of a specified currency are permitted and conformation of updated data is selectively deferred by use of a control procedure implemented at each node (10, 12, 14) and utilizing a status and control table (in SAC 60, 62, 64) at each node which describes that node's view of the status for shared data items at other nodes. Access, including copying and deletion permission, is granted, when a search of the local table discloses no conflict. If conflict is disclosed, messages are exchanged with all involved nodes until the local table discloses no conflict.

Abstract: We investigate the complexity of seaching by comparisons a table of n elements on a synchronous, shared memory parallel computer with p processors. We show that O(lgn) steps are required if concurrent access to the same memory cell is not allowed, whereas only O(lgn/lgp) steps are required if simultaneous reads are allowed. We next show that it is possible to search in O(lg(n)/p) steps if more general operations are used.

Abstract: An operating system processor (3001) for managing resources concentrically, job processors (3002, ....., 300n) for executing processes input/output processors (4001,4002, ...., 400n) for executing input/output processes, a file processor for executing input/output processing to a file system, and a main memory (200) are connected together by a common bus (100). The operating system processor (3001) receives a resource request from the job processors (3002, ....., 300n) so as to manage the allotment of resources to the job processors by referring to a resource management table (211, 212, ....., 21n), a processor management table (221, 222, ....., 22n), and waiting tables (231, 232, ....., 23n, 241, 242, ....., 24n).

Abstract: A copying apparatus has a document feeder designed to automatically feeding a document onto a document table. When, during the continuous copying operation, a copy jams occurs in the carrying path of the copy and the continuous copying operation is halted, the document feeder automatically discharges the document from the document table.

Abstract: The idea set forth is for all the information that allows for a highly accurate prediction of branches to be kept in a generalized table.

Abstract: PURPOSE:To realize the arrangement and retrieval of many document files with easy operation in efficient way, by executing the designation with attribute table formed in hierarchy and retrieval processing with tree structure retrieval file. CONSTITUTION:Document managing data comprising an attribute managing table and attribute data stored on a recording medium is transferred to a system control section 3 so as to organize the retrieval data file of the tree structure by each document attribute and the file is registered in a retrieval data file section 6. A check item A1 is designated by looking into a document attribute display A of list form of the highest rank from an operation display section 4, the item is retrieved by using the tree structure file of the retrieval file section 6 and the document attribute B of the list form of the next ranking is displayed.

Abstract: The machine assembles nails, or performs other operations on timber planks and wall sections etc. clamped on a table. It comprises a portal (1), or gantry, travelling over the table, on which are mounted various tools (19,20) such as a saw, a drill, milling cutter, or nailing machine. These tools are adjustable for height and/or angle and/or movable sideways, or can be slewed or tilted. They can be accommodated on a slide (9) travelling along a transverse top rail (10), which in turn slews on a vertical axis on the portal head (11). They can also be arranged to slew on the slide.

Abstract: PURPOSE: To perform the high-speed OPEN processing with small capacity of a control table, by limiting the capacity of a control table of a main storage for the OPEN processing of a file. CONSTITUTION: The information on the file attribute which is produced by an OPEN macroinstruction program is left at a control table 15 even after its use for the second application. If no empty case is available, a case containing the attribute information of a file is used with the overcoating. A flag inhibiting the overcoating is set on the table 15 for a file which especially requires the high-speed OPEN processing. Thus the overcoating is inhibited while said flag is set. COPYRIGHT: (C)1984,JPO&Japio

Abstract: The process web for the photocopier is mounted on a subframe (102) hinged between upper (101) and lower (100) subframes with the upper and lower subframe supporting the copy feed and processing and scanning systems. For max. access to the web the upper section is hinged fully up and the web section lifted partially. The hinged sections provide a compact copier for table top use with no damage caused when changing the web. The hinged sections also provide a simple access to copy sheets if the feed jams.

Abstract: PURPOSE:To achieve file processing on real time, by a total management through the provision of a file index table registrating all file information at each central processor, in a de-centralized file system. CONSTITUTION:A method which torally manages files de-centralized into a pluraity of central processors 2 with a file index table provided at each central processor 2 is used. Thus, by referencing the file index table, file transfer is requested to the central processor 2 connected with a desired file, and in case of erase of a file or new registration of the file, since the erase or registration of the table entry relating to the file is instructed to all other central processors 2, the user can process the file without notching physical de-centralization of the file.

Abstract: A diagnostic table which stores possible causes of certain abnormal conditions is accessed by corresponding push buttons for sequential vocalization by a sewing machine system, thereby helping the operator check the machine.

Abstract: PURPOSE:To execute an automatic continuous test, by collating a processing system constitution table consisting of attribute data on respective devices constituting a system with a test program table while executing IPL. CONSTITUTION:A test program control part 5 reads held attribute data out of devices 4-11-4-mr to a main storage device 2 on the initial program loading (IPL) of the system to constitute the processing system constitution table 7. Then, data is read out of the device 4-11 to a test program TP table 8, from which a TP and its attribute data are read out to reading the processing system constitution table 7 repeatedly, retrieving a device which can be tested. The TP having a corresponding device is read out of the device 4-12 to a TP9, attribute data on the device is transferred from the TP table 8 to the TP9, and the control is passed to a test program execution part 6.

Abstract: The table (6) supporting the patient is transferable between a fixed base (1) and a transport trolley. The fixed base has a central locking block (10) solid to a lifting device (5). The block has two bolts spring engaging into two opposed strike plates (18,18a) of a receptor block solid to the patient supporting table. The bolts are operated by two sets of self locking cams mounted on the transport trolley, are housed in two coaxial bores symmetrical on both sides of a vertical axis, and have conical ends to match conical strike plate housings.