Abstract: : Prefix tables provide a mechanism for locating files in a system whose storage is distributed among many servers. The result is a single file system hierarchy visible uniformly and transparently to all clients. Each client of the filesystem maintains a local prefix table that identifies the server for a file based on the initial part of the file name. Prefix tables are built and modified using a simple broadcast protocol that is flexible enough to allow dynamic server reconfiguration and a simple form of replication.

Abstract: A patient handling system for an NMR imaging system includes a portable patient table having a bottom portion and a top portion The table is docked adjacent to the magnet of an NMR system The top portion may be elevated to align the top portion with the magnet bore A patient pallet, located on the top portion of the table, is then moved into and out of the magnet bore The pallet includes a number of modules upon which the patient reclines At least one module includes a radio frequency coil for NMR imaging The other modules are dummy modules which do not contain rf coils and support other parts of the patients's body

Abstract: A method and system for patient monitoring wherein data acquired by parameter measuring modules is downloaded to an information processing and display station. Table data structures resident within the modules are downloaded to the display station during initialization of the module on the link. The tables completely define the number, functionality and visual attributes of all control keys associated with each channel of the module. The tables include: text and parse tables which define the number, size, attributes and text for each key; a process table which contains a plurality of control programs which are executed by an interpreter portion of the display software in response to activations of a control key; and a channel control table which modifies the operating conditions of the channel in response to preselected control keys. A module header table is provided which defines display memory requirements of the tables for the module's channels, and an active-module table provided by the display station maintains a list of modules active on the link and the location of the module header tables once they are downloaded.

Abstract: We describe an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs concurrently with the normal transaction processing (on-the-fly), and locks the en-tities in the database one by one (incremental). We prove the algorithm produces consistent pictures of the database. We also show that the algorithm aborts a minimal number of updates in the class of on-the-fly, incremental, consistent algorithms. On-the-fly, incremental algorithms to read entire data- bases consistently can improve system availability and reli- ability. Most existing systems either require the transaction processing to stop, or produce potentially inconsistent re- sults. Our algorithm does not change the database physical design, so it can be adapted to existing systems by expand- ing their lock table. Finally, we extend the algorithm in a straightforward way to read entire distributed databases.

Abstract: Apparatus and method for monitoring transactions on a high speed interfaceus and for selectively storing information about such transactions together with the time of such transaction and the state of the automaton. The apparatus comprises two parallel memories for respectively storing a regular table and a default table, and a memory selector for choosing between the table data of the two memories. A bus trap stores data information obtained from the bus and compares the stored information with a stored data template. A transition detector receives control signals from the bus and generates clock signals used by other system elements upon the detection of a transition. A hash coder utilizes a hash key together with state information to generate an address for entering the regular table memory. A state latch stores an address provided by the memory selector for the default table. A sample collector and sample queue component stores the state information together with the data and control information obtained from the monitored bus and a time stamp provided by a time stamp generator. A DMA output control provides the sample information to a display computer. The method monitors the interface bus interactions and selectively stores the monitored data and control signals when an analysis of those signals indicate that a transition has occurred. Two parallel, distinct look-up tables store state information and default information and are substantially entered at the same time to provide separate sets of table data. One set of table data is chosen depending upon predetermined criteria.

Abstract: A POS system is made up of a central computer and a plurality of POS terminals. The central computer includes a price look-up (PLU) table and informs the POS terminals of the article data in response to a PLU table inquiry demand from a POS terminal. The content of the PLU table is capable of being updated by an update demand from the POS terminals.

Abstract: PURPOSE:To provide a washing-machine controller, which can not only fuzzy- control a washing operation according to dirt and cloth quantity but also can select a fuzzy control, which a user likes, by the operation of a key, in a full automatic washing machine for washing home wear. CONSTITUTION:The controller is composed of a light transmission-factor detection circuit 11 for detecting the transmission factor of a washing liquid by a photosensor, a cloth-quantity detection circuit 12 for detecting a cloth quantity, a water-level detection circuit 13 for detecting the water level of a washing tub, an operation display circuit 14 where a user can set a large or small quantity of washing operation, and a control circuit 15 for controlling the washing operation according to the output signal of each detection circuit and the signal from the operation detection circuit 14. Further, the control circuit 15 fuzzy- controls the washing operation according to each detection circuit signal and can select a rule table out of a plurality of fuzzy-inference consequent part rule tables, according as the user likes, and can set a long or short washing operation, according as the user likes.

Abstract: An inverse assembly method for converting binary executable microprocessor code into corresponding assembly language mnemonics provides for the storage of all the possible binary codes and corresponding assembly language mnemonics in a plurality of tables set up in a decision tree form which corresponds to the format of a user document provided by the manufacturer of a target microprocessor. The instructions and data information contained within the executable code acquired from the taret microprocessor are distinguishably tagged prior to being stored in an acquisition memory. The code from the acquisition memory, in binary or hex form, indexes a primary table which contains a plurality of entries containing a binary value which may have a mask portion, each entry containing a plurality of actions having an optional string to be displayed, optional parameter masks and an optional table to call. The unmasked portion of the binary value is compared with the code from the acquisition memory and, if a match occurs, this entry is used for further processing, otherwise the comparison process moves on to the next entry in the table. Once a match is found a character string is displayed, parameter bits are picked off to be passed to another table, and another table is called within the decision tree. This continues until all actions are completed, including calls to additional tables which are similarly processed. After the processing of each called, or current, table is completed, a return to the calling table is made, and if there is no calling table then disassembly for the current code from the acquisition memory is completed. In like manner all the acquired executable code is processed to obtain the corresponding assembly language mnemonic.

Abstract: An I/O prescription table (1/0 PTBL) (20-1, 21) is associated with a processing program module (10-2, 11) that is executed by a conventional sequential execution type processor (10-1, 51). Each processing program module fetches the input data according to its associated 1/0 PTBL and stores the output data in the same table. An execution control program (30-2, 31) makes reference to the I/O PTBL associated with the processing program module of which the execution is finished, updates the designated I/O PTBL so as to indicate that the corresponding input data is prepared, and starts the processing program module associated with the I/O PTBL which is furnished with all of the necessary input data.

Abstract: An automatic die exchanger for an injection molding machine is provided, having a rotational table and a travel member capable of approaching and separating from a die mounting section of the injection molding machine. A convey means provided on the travel member is engaged with and disengaged from one of the dies on a plurality of die placing sections of the rotational table. When the travel member is moved, the convey means feeds the die engaged therewith to the die mounting section or removes a die therefrom.

Abstract: PURPOSE:To reduce the manhour necessary for the input of working condition by installing a means for editing the standard working condition data and a means for obtaining the total sum of the correction-coefficient numerical-values on the basis of a series of key data and for obtaining the working condition data by multiplying the above-described total sum by the above-described data. CONSTITUTION:Each processing program for automatic automatic preparation of working condition, standard data editing, correction-coefficient numerical- value table editing, and data transfer processing is registered into the ROM16 of a controller 12 for controlling the working machine such as cylindrical grinder 1, etc. The total sum of the correction-coefficient numerical-values obtained corresponding to arbitrary key data input from an operating panel 11 is obtained, and N pieces of the working condition data are automatically prepared by multiplying said obtained value by the standard data corresponding to the grinding cycle number and written into an RAM17. Then, the working condition data written into the RAM17 is read-out through the execution instruction supplied form the operation panel 11, and the movement operation of the cylindrical grinder 1 is controlled.

Abstract: A folding table has a flexible table top provided with openings. Attached to the table top and extending below it is a rigid panel with receptacles aligned with the openings. The receptacles are designed to accommodate beverage consumption articles such as bottles, an ice bucket, and the like, for the purpose of use when the table is open, and for the purposes of transportation or storage when the table is closed. The table top is formed as a one piece construction and is attached by fasteners to the rigid panel.

Abstract: PURPOSE:To start automatically a processing program and to process immediately a document by designating only the document to be corrected or printed. CONSTITUTION:A starting device is provided with a program storing device 14 which stores various programs, a table 12 containing the correspondence between documents and their programs, a selection part 11 which retrieves the contents coincident with the discrimination information on the document received through the table 12 and transfers them to a starting part 13, and said part 13 which loads the program sent from the device 14 to a memory and then starts said program according to the retrieved and selected start information. As shown in the figure, the table 12 contains the identification information and its corresponding start information. The identification information is delivered and a document is designated so that a document processing program processes a desired document. Thus a document processing program is automatically started.

Abstract: PURPOSE:To set addresses fully automatically when terminals are newly added or removed by producing a tentative address by a newly added terminal itself to said terminal by means of random numbers and discriminating this terminal from existing terminals and other newly added terminals. CONSTITUTION:In case a new terminal 3n is connected to a bus 2 with no normal address, the terminal 3n receives frames #500-#900 of a tentative address from a center 1. Then a random number #719, for example, is produced by a random number transmission means 3n1. This random number is sent to the center 1 from the terminal 3n via the bus 2 in the form of a tentative address. Then the center 1 decides a new normal address by a normal address generating means and registers #103, for example, to a table 9. At the same time, the center 1 gives information to another new terminal 3x by means of a random number address. Hereafter the communication is possible between the terminal 3n and the center 1 by a normal address.

Abstract: PURPOSE:To perform insertion printing of table data without forming table data having character rows to be insertion-printed which correspond to insertion printing designating codes, by a method wherein the contents of insertion printing data are designated by using a row number and/or a column number of table data. CONSTITUTION:A document constituted of character rows 81, 82, 83 and the character rows 86, 87 to be insertion-printed is printed on the basis of a document data constituted of table data designated as an object of insertion printing, the character rows 81, 82, 83 and the insertion printing designating codes 84, 85. The codes 84, 85 are constituted of insertion printing marks 84a, 85a indicative of insertion printing and the column numbers and/or row numbers 84b, 85b of the table data as keywords for retrieving the data to be insertion-printed from the table data.

Abstract: @ A branch target table (10) is used as an instruction memory which is referenced by the addresses of instructions which are targets of branches. The branch target table consists of a target address table (12), a next fetch address table (14), a valid entries table (16) and an instruction table (18). Whenever a branch is taken, some of the bits in the untranslated part of the address of the target instruction, i.e. the instruction being branched to, are used to address a line of the branch target table (10). In parallel with address translation, all entries of the branch target table line are accessed, and the translated address is compared to the target address table (12) entry on that line. If the target address table entry matches the target address, the instruction prefetch unit (32) fetches the instruction addressed by the next fetch address table (14) entry for the given line and the line of instructions associated with the branch address table entry is read into an instruction queue (38) having a length set by the valid entry table (16) entry which indicates how many of these instructions are valid. Otherwise, the instruction prefetch unit (32) fetches the target and subsequent instructions as it would if there were no branch target table, and the target address table entry is set to the real address of the target instruction. The next fetch address table (14) is updated so that it always contains the address of the instruction which follows the last valid instruction in the line, and the valid entries table (16) is updated so that it always counts the number of valid instructions in the line.

Abstract: A box indexing table delivers a group of empty boxes from a main conveyor to a box loading machine. The loaded boxes are pushed onto a full box conveyor. Both the main conveyor and the full box conveyor extend completely across the table. The capacity of the loading equipment can be expanded in modular fashion by adding modular tables.

Abstract: Let us first discuss why systems may be very complex. First of all, quite a number of systems contain very many elements. Examples are provided by the following table: Table 1 brain 1011 1012 neurons world 1010 people laser 1018 atoms fluid 1023 molecules/cm3

Abstract: An image forming apparatus including a document table for holding a document placed thereon, an optical scanner movably provided along the document table to optically scan the document placed on the table, first and second indicators or scales provided at respective ends of the document table to indicate the allowable copy ranges, a designating device for designating a scanning area provided by placing the document on the document table in accordance with at least one of the first and second indicators, and a controller for controlling the movement of the optical scanner to scan the scanning area designated by the designating device. Two full-sized documents on the document table can be scanned during one scanning operation by the optical scanner, and a precise setting of the documents on the document table can be easily performed.

Abstract: In forming a sharpness emphasis signal, accidental errors produced in digital processing of the image data of pixels in a matrix are cancelled by using look-up table memories to suppress the appearance of corresponding noises onto reproduction images. The invention further provides for use of a reduced number of bits in processing the data and particularly in processing sums of products used in the process, by providing for products to have substantially the same number of bits as the factors of the product.

Abstract: PURPOSE:To optimize distribution of loads by preparing a periodical table dynamically while referring to and renewing a starting program number control table and a program identification information control table and starting a periodical program. CONSTITUTION:The number of starting programs in each unit period of a periodical table A is stored in the starting program number control table T1, and the corresponding program identification information of each bit corresponding to program of the table A is stored in the program identification information control table T2, and the table A is prepared dynamically by a periodic program registration deletion function module M while referring to and renewing the two tables T1, T2. At this time, starting is made in each unit period by a periodic start control program B when normal operation, and if module M is called from the periodic program etc., the table A is prepared to make the number of starting programs in each unit period uniform and processed.

Abstract: A method for generating new device drivers for use in a full GKS implementation is presented. The method is based on conditional compiling techniques making use of the Workstation Description Table, and it has been used in a full GKS to develop several device drivers, which took about 1 week for a novice.

Abstract: PURPOSE: To improve the operability with a help guidance system by giving the definite explanation to the contents requested by a user. CONSTITUTION: A guidance request code supplied from an input part 1 is applied to an internal storage part 3 and the guide information is displayed at an output part 2 after the guide information and a correspondence table are read out of an external storage part 4. If an indefinite part is included in each word of the explanation, a user points out the area where the guidance is needed. Thus the position information is delivered to a guide control function part. Then the guidance position is detected on a picture and the corresponding item is detected by means of the correspondence table. Thus the guidance explanation is displayed. COPYRIGHT: (C)1987,JPO&Japio