Abstract: A computer aided logic design system for instantaneously compiling circuit component entries into a schematic model which provides immediate simulation of each entry or deletion into the electronic circuit schematic. The system includes software for processing logic designs which produces a signal table for storing all inputs and outputs of chips stored in a specification table. The processor also produces a call table that lists all chips from the chips specification table from which chip models can be retreived and executed. Additionally, a software routine produces a netlist transfer table that specifies the transfer of signals within the signal table produced by software processing, which correspond to the signal distribution in the circuit being designed. After production of the signal table, specification table, call table and netlist transfer table, a software processing routine executes sequential values retrieved from the call table and netlist transfer table to create a second signal table which is compared with the first signal table. The software processing routine continuous to execute values retrieved from the call table and netlist transfer table and compare the first and second signal tables until both the second signal table being created is identical with the first signal table stored in memory. The software processing means also includes a delay which delays sequential processing until the comparing step for comparing the second signal table with the first signal table reaches a stable state.

Abstract: Basic data obtained by thinning-out data to be written in a look-up table are previously operated by a computer and stored in a basic memory table. Coefficient data required for linearly interpolating the basic data are stored in a coefficient memory table. The basic data and the coefficient data are read in accordance with address designation by an address generator while being related with each other and subjected to interpolation operation by an interpolation computer element, and data thus obtained are sequentially written in the look-up table.

Abstract: A method and apparatus for controlling access to data blocks stored by addresses in a memory and concurrently accessible by a plurality of transactions is provided. The method includes the steps of receiving an address of a data block to be accessed by a first transaction, deriving from the address an access table entry corresponding to the data block where the entry includes lock data that governs access to the data block, and providing the access if permitted by the lock data, or providing the access, if not permitted by the lock data, and recording the occurrence of the access in the lock data.

Abstract: The XY-positioning table of the present invention includes a base, an X-axis-movable table and a Y-axis-movable table, as well as, X-axis, and Y-axis driving means, attached to said base: where the X-axis-movable table is provided with an X-axis nut to engage with a threaded shaft driven by said X-axis driving means; while in the interior cavity or space of the X-axis-movable table is provided a Y-axis nut capable of engaging with another threaded shaft driven by the Y-axis driving means with auxiliary bearings being provided between the Y-axis nut box and the Y-axis table for effecting X-axis rectilinear-motion, thus realizing a smooth and accurate relative X-Y directional movement between the X-axis and Y-axis movable tables and the bed. Further advantages of the present XY-positioning table are: since the Y-axis driving-mechanism is accomodated almost within the interior space or cavity of the X-axis table, the present XY-positioning table can be made smaller in size, while as the weight of the Y-axis driving-mechanism is not provided on the X-axis-movable table, the inertial force taking place upon the movement of the table can be minimized and, accordingly, the present XY-positioning table can insure highly accurate indexing or positioning of working tools relative to workpieces. Further, the provision of bearing means for effecting rectilinear motion between the X-axis-movable table and the Y-axis-movable table, in association with X-axis and Y-axis driving-mechanisms gives rise to, in the present XY-positioning table, not only a greater load resisting capacity but an accurate and stable indexing or positioning performance for an extended long period of operating time.

Abstract: The tea-leaf reader CRC algorithms are error-detection algorithms that use a look-ahead table to increase execution speed.

Abstract: A lithotripsy work station for disintegrating a calculus in a patient has a patient support table on which the patient is disposed, a drive unit for selectively positioning the table, a shock wave generator, an x-ray system for generating a three dimensional visual representation of at least the region of the patient in which the calculus is disposed The location of the focus of the shock wave generator is known with respect to the x-ray representation A mark generator generates at least one mark superimposed on the x-ray representation, and also generates a signal which is supplied to the drive unit which causes the drive unit to position the table based on the position of the mark on the x-ray representation with respect to the position of the focus A mark positioner is also provided for manually positioning the mark on the x-ray representation in coincidence with the calculus, so that the table is moved to a position with the patient thereon such that the focus coincides with the calculus for effective disintegration or shattering thereof

Abstract: A machine vision process and apparatus for reading a plurality of separated figures, such as the hole-position diagram of a printed-circuit board; the apparatus comprises an X-Y table to be moved on a plane and to be positioned at a given position, two photographing devies such as camaras being mounted over the X-Y table, and an image processing unit. The X-Y table is used for placing a diagram or the like so as to facilitate a first camera to photograph a large area and to facilitate a second camera to photograph a small and detailed separated figure. The image signal obtained will be transmitted to the image processing unit to find out the center coordinates of every separated figure, and the size and shape of every separated figure classified so as to find out the control data of size, position and the moving path in the real production process.

Abstract: To perform a binder through retrieval on binders which are set out on an optical disk and have different title structures, those binders containing the same key attribute data as a designated retrieval key are retrieved. When binders to be linked are selected from the retrieved binders, only those keys containing the same attribute data as the designated key are extracted from the selected binders. The extracted keys are sequentially arranged in the extracted order, thereby creating a title table for a link binder on a magnetic disk. This title table is retrieved to provide desired image imformation. Alternatively, a binder number/key correlation table is created on the magnetic disk, in accordance with the selection of the binders to be linked. This binder number/key correlation table includes the quantity of linked binders, the number of retrieval keys, the number of each binder and information relating to linked keys for each one of the linked binders. The title table of a binder associated with the designated key or keys, which is indicated by the binder number/key correlation table, is retrieved to provide the desired image information.

Abstract: A compatible categorical data base can be viewed as a single (contingency) table by taking the maximum-entropy extension of the component tables. Such a view, here called universal table model, is needed to answer a user who wishes “cross-classified” categorical data, that is, categorical data resulting from the combination of the information contents of two or more base tables. In order to implement a universal table interface we make use of a query-optimization procedure, which is able to generate an appropriate answer both in the case that the asked data are present in the data base and in the case that they are not and, then, have to be estimated

Abstract: This dissertation presents one of the first top-down demand-driven strategies for the evaluation of recursive queries in logic programs, along with proofs of soundness and completeness. A performance evaluation shows that the strategy performs well in comparison to related methods. The ET* algorithm for evaluating pure logic programs is described. The algorithm uses an extension table to save the results of computations for selected predicates. The ET* algorithm repeatedly evaluates a given query using the extension table until it completes an entire iteration without finding any new answers. A clear and straightforward implementation of the ET* algorithm is developed in Prolog. The dissertation investigates optimizations that may lead to a more efficient evaluation of a logic program using extension tables. These optimizations are supported by performance comparisons. One particular optimization, called the ET algorithm, can be used if a single pass of the ET* algorithm finds all the answers for a given query. In addition to evaluating recursive queries, the ET algorithm is a caching mechanism that can be used to improve the performance of a logic program, when saving and retrieving the results of certain predicates is less expensive than recomputing these answers. In particular, the ET algorithm can be effectively applied to predicates that retrieve tuples from an external relational database management system. This dissertation compares the performance of the top-down demand-driven strategies for recursive query evaluation, including Earley Deduction, Tamaki and Sato's Multistage Depth-first, Vieille's Query/Subquery and Extension Tables. This study shows that the extension table algorithms are, in general, more efficient than the other strategies. The ET* algorithm, which eagerly evaluates a program using all of the answers stored in the extension table, outperforms its iterative recursive counterparts, such as Multistage Depth-first (MSDF) and Query/Subquery (QSQR/SLD), which do not use answers computed on the current iteration. When the ET algorithm finds all the answers for a query, the comparisons indicate that, for such cases, its performance is superior to all its rivals.

Abstract: An improved method and apparatus for classifying triangles. A description of a triangle in the form of the coordinates of its vertices is supplied to calculation logic. The calculation logic calculates a plurality or parameters of the triangle from these coordinates. These parameters are then provided to a look-up table. The look-up table has previously been programmed to include at each address the proper triangle classification for that address, with each address being a different combination of the parameters. The addresses for the look-up table cover all possible combinations of the parameters, and thus all possible triangles.

Abstract: A print format changing system of the present invention comprises a printer, a device for inputting print format-related information and, a memory containing an edit table region for storing the print format-related information input by the input device, thereby rewriting the print format-related information stored in the edit table region of the memory so as to change the format of data printed out by the printer.

Abstract: A combination woodworking machine for attachment to an electric plunge router, which may be configured as a horizontal boring and slot mortising machine, an overarm router and a router table. An x-y-z table is mounted on a column supported by feet, and a plunge router with its base removed is mounted in various orientations on the column by sliding it onto steel dowels mounted on the column. An electronic speed control reduces the router speed for boring, and an electronic digital readout provides accurate measurement of horizontal movement of the table.

Abstract: A non-linear analog-to-digital converter(30) in which an output of a non-linear analog-to-digital conversion circuit(30) is applied to a look-up table memory(40). The contents of the look up table(40) are adjusted to compensate for variance in the conversion circuit or to provide a different conversion.

Abstract: A document processor receives a document prepared by a different type of device, recognizes and registers a table in the document. It composes and outputs a document with the original form of the table being maintained.

Abstract: In the case of a table, in particular a conference table, which can be composed of a plurality of table elements, provision is made for each table element to be equipped with at least one magnetic holder and a magnetic holder counterpart, which are arranged at the same height and in the horizontal direction at a distance corresponding to a modular dimension.

Abstract: The data processing device according to the present invention comprises memory means, input means, display means and various kinds of means for processing various kinds of statistic data of table form and has the faculty of executing various kinds of statistic calculations easily.

Abstract: PURPOSE:To easily form a table by expanding and displaying a specified frame on a part of a tablet display part unitedly formed by a tablet and a display unit. CONSTITUTION:The tablet display part 111 is unitedly formed by the tablet 101 and the display unit 102. A table forming means 90 forms a table 113 consisting of plural frames 112. A frame specifying means 91 specifies one frame 112 forming the table 113. A frame enlarging/displaying means 92 enlarges and displays the frame 112 specified by the means 91 on a partial area 114 of the display part 111. Characters or codes are inputted to the enlarged frame 114, and after recognizing the input, the recognized characters or codes are displayed on the unenlarged frame 112. Since the characters or the like are inputted in the enlarged area, the input operation can be easily executed. Thereby, a table can be easily formed.

Abstract: Due to the fact that in an item of furniture having four legs, in particular a table, two legs (5, 5') are provided at the bottom with communicating units (1, 2 and 1', 2' respectively) which produce a pressure compensation between the forces (P, P') acting on the legs (5, 5') in that the loaded unit (1, 2) moves in the direction of the loaded table leg (5) whereas the other unit (1', 2') moves in the opposite direction away from the table leg (5') towards the floor (6'), the furniture can be set up with all its four legs securely and without wobbling even on an uneven floor.

Abstract: PURPOSE:To attain the simultaneous update of a data base by plural transactions, by obtaining the bit of update history information of a page table at a history file, and updating the page table at a check point time. CONSTITUTION:To a CPU/memory 10, a data base accumulating medium 50, a storage medium 100 which stores a bit of data base control information, and a history file 70, are connected. A data base area 60 in the accumulating medium 50 is divided into blocks having fixed lengths called as slots. Meanwhile, an area to which the transaction refers is divided into fixed blocks called as pages. The slot stores the content of the page, and each slot can refer and update a data with one time of input operation. A backup version page table 80 is updated at the check point time, and on the table, the number of the slot where the most updated data is stored, is set.

Abstract: PURPOSE:To reduce the capacity of a memory which is required for a code conversion table, by using separate conversion tables for the code conversion about codes which are common to the kind of connection controlling procedures, etc., and those which are not common. CONSTITUTION:At the time of code converting operations, an operating system OS grasps the position of a transmission or reception code conversion table TCT from a code conversion table starting address in a circuit control table LCTi corresponding to a relevant circuit number and control table LCTi corresponding to a relevant circuit number and extracts code converting information from an area point corresponding to the content of a transmission or reception code. The extracted code converting information is discriminated whether or not it is common to procedures by means of a flag bit in the information and, when it is common information, a control and conversion of data are performed. When it is not common information, a relevant code conversion index table CIT is fetched by using the address of the table CIT stored in the information part and the control and conversion are performed.

Abstract: A table plate of an expandable table is provided with a plurality of leaves which are slidable into and from compartments formed under the table plate and are mounting-free. Each leaf includes a plate and a disk-shaped holding element which are alternatingly insertable into the compartments.