Abstract: A lightweight drafting table having a full-size drafting board of sandwich-type construction, the underside of which is glued to a yoke having three support arms which are disposed approximately parallel to each other and which are connected to a cross member to form a rigid structure for supporting two drawers. The board provides the cover for the drawers when they are closed. Each drawer has a slot formed in each of two sides thereof; the walls of each slot ride on a key which protrudes laterally from one of the support arms. A slight drag between the key and the slot prevents each drawer from opening under the force of gravity alone when the drafting board and the drawer are tilted at an angle of several degrees to the horizontal and the drawer is fully loaded. The yoke is pinned to a pair of vertical support members attached to a four-legged base and to a pair of braces, each of which is also bolted to one of the support members to form a lightweight structure of exceptional strength. Several bolt holes are provided in each brace so that the angle of the board to the horizontal can be readily adjusted. With casters fitted to the base and the board folded nearly parallel to the vertical support members, the drafting table can be moved readily from one room to another by a single operator or stored in a small space.

Abstract: A digital computer system having a memory system organized into procedure and data objects, each having a unique identifier code and an access control list, for storing items of information and a processor for processing data in response to instructions. The instructions contain operation codes and names representing data. Each name corresponds to a name table entry in a name table which contains information from which the processor determines the location and the format for the data. The name table entry specifies a base address of one of a set thereof which change value only when a call or a return instruction is executed. A name interpretation system fetches a name table entry, calculates the base address and a displacement using the name table entry and the current architectural base address and adds the base address to the displacement to form the address of the data represented by the name.

Abstract: A recording medium feeding device for use in an image formation instrument such as a printer, a copying apparatus or a recording apparatus. The feeding device has a recording medium supporting table, feed apparatus for feeding the recording mediums on the supporting table, and a drive system for vertically driving the supporting table. During supply of recording mediums, the supporting table is gradually lowered from a predetermined upper position as the recording mediums are supplied.

Abstract: This thesis describes a leaf cell design system, REST, Richard's Editor for Sticks. REST is intended to be used for the preparation of the lowest level cells in an integrated circuit design. A stick notation is used in the editing process. Given a structured design methodology any design task can be separated into two parts: 1) leaf cell design and 2) composition cell design. This tool addresses the first of these tasks, although it may also be used for general manipulation of stick diagrams. A table driven compaction algorithm is presented. This graph based algorithm uses a weighted affinity factor to reduce total polysilicon and diffusion wire length. A suite of utilities provide functions such as file interface, physical mapping, annotation, etc. consistent with a set of design rules. The system has been implemented in Simula on a DEC 20 computer, and works in conjunction with a limited functional diagramming system. The design rules, models and stick interpretation are table driven and can be changed for various technologies. Currently REST is being used for NMOS technology. A community of users have used the REST system to prepare a number of designs resulting in a substantial reduction of design time. In addition, the system is currently being used at a major computer manufacturer in conjunction with a VLSI design course.

Abstract: A cloth-cutting machine designed to cut pieces of cloth on a working table by means of a cutting means provided with an automatic cutter and capable of achieving effective cutting operation in any place on the working table without : exerting any unbalanced load on the working table and also capable of certainly absorbing any vibration caused at the time of cutting operation.

Abstract: In a finite-segment p-adic number system one of the difficult problems is concerned with converting Hensel codes back into rational numbers. An algorithm for this conversion is proposed which is based on a sophisticated table look-up procedure.

Abstract: PURPOSE:To eliminate assuredly a misanswer, by displaying a mail arrived at the own terminal along with a list of mails to which the answers are required at each terminal. CONSTITUTION:When a mail is transmitted to a terminal B from a terminal A, a document mail is first produced by making use of a word processing function of the terminal A to store the mail temporarily in a local character file 43. At the same time, the sending address information of a mail including the presence or absence of a request for answer is fed through a keyboard 41. If a request is given for the transmission of the mail under such conditions, the contents of the file 43 is transferred to a document file 2 by a CPU3 and the designating input of the sending address is stored in a mail table 31 of the CPU3. The CPU3 displays a message on a display 42 of the terminal B of the receiving side when a new mail arrives at the table 31 and then displays the contents of the file 2 or the mail list addressed to the terminal B on the display 42 in accordance with the request of the terminal B.

Abstract: The global data for finite element analyses are conveniently stored in matrices and table trees. In order to optimize the use of the available storage capacity, the matrix and table tree data structures are implemented on the basis of a common storage structure. The paper describes the properties and functions of storage, matrix and table tree managements for finite element programs.

Abstract: A machine tool provided with a movable table supported by a stationary table, the movable table being displaceable relative to the stationary table in all directions and being supported by the stationary table by pressurized fluid bearing. The movable table is positioned by at least three actuators pivotally connected at one end to the stationary table and at their other end to the movable table such that the lengths of the actuators, controlled by an appropriate numerical control system, result in a predetermined position of the movable table relative to a reference position.

Abstract: PURPOSE:To exercise a suitable supervision through a plant-state supervisory system by previously preparing a flow chart of plant-abnormality relation of combinations of plant abnormalities with process data and then by making an analysis of the cause of abnormality, etc., by said chart. CONSTITUTION:Receiving alarm signal Ak showing various abnormalities happening in object plant 1, abnormality detector 2 sends abnormality name signal Nl to information processor 4 by abnormality decision process signal Qj. Information processor 4 refers to a plant-abnormality relation chart, showing the causal sequence of the plant abnormality, stored in auxiliary memory 6 in table format so as to display on display unit 5 guidance for an analysis of the cause of abnormality occurrence, a forecast of its influence and the prevention of the influence. The influence of the abnormal state can be prevented by letting an operator know the cause, countermeasure, etc., smoothly in the abnormality occurrence, so that an overall plant-state supervision can be exercised.

Abstract: PURPOSE:To improve the access effeciency at a file access time, by providing the file, which stores records consisting of plural items, correspondingly to each item to store one record into plural files separately. CONSTITUTION:A file is provided for every item, and information of each record is stored into plural files distributively. When an access is requested from terminals T1-Tn, the table (file) name to be accessed, the terminal number, access mode ACM and the record number are output from selecting circuit 3. The table name of the access, ACM and the record number corresponding to each terminal are stored in file access table 4; and at the access time, ACM from circuit 3 and table 4 are led into exclusive classification decision circuit 5. The output of circuit 5 is input to the exclusive control classification decision circuit, and the exclusive control condition corresponding to the request table name is output. At thie time, record numbers from circuit 3 and table 4 are compared in record name information comparator 9, and the propriety of the access is decided.

Abstract: PURPOSE:To secure the assured transmission of the fixed guide to the subscriber by using the voice recognizer, thus simplifying the system constitution. CONSTITUTION:When system controller 1 applies the telophone number of the designated subscriber to automatic call control part 10, the subscriber telephone is called out via automatic calling unit 11 and exchange network 6. With the answer of the subscriber, controller 1 switches the circuit connection toward network controller 5, and then designates the fixed table at voice answer output part 2 to transmit the guide voice to the subscriber via hybrid 4, controller 5 and network 6 each. Then with the answer of the subscriber, the answer in analyzed and detected at voice recognizing part 3. And then the affirmative identification code is reported to controller 1. Controller 1 transmits the guide data to the subscriber in the same procedure as the transmission of the guide voice.

Abstract: PURPOSE:To control the increment of capacity of a cross-reference table and at the same time accelerate the detection process in the state under which no layout is given during the address conversion, by monitoring the state of pagination at two areas by means of the hashing technique. CONSTITUTION:The page part P within the virtual address register 1 is set to the hash conversion table address register 8 via the hash mechanism 6, and the entry contents of the hash conversion table 7 is read out to the hash conversion register 9. The contents of the register 9 is sent to the page font interruption detecting circuit 17, and thus the state of pagination is monitored. And in case the contents is ON, the subsequent actions are discontinued to carry out an interruption immediately. While in case the contents is OFF, a real address conversion is carried out while monitoring the state of pagination via the real page address 11, the real page correspondence table 10 and others. As a result, the increment of capacity can be reduced for the cross-reference table, at the same time accelerating the detecting process in the state under which no layout is not given yet.

Abstract: Data dictionary systems, such as the Table Producing Language (TPL) Descriptive Codebook system, provide a facility for separating the description of a data file from the use of the data. The benefits of this approach are well known. The TPL Associative Codebook system extends the data separation concept to information about the interconnection of files in relational and network database systems. The associative codebook processor uses this information about interconnections to generate call sequences which result in data being delivered to TPL as if it were coming from a sequential hierarchical file. Thus the user of TPL does not have to concern himself with the link paths of network systems or the joins, projectiens, and restrictions of relational systems.

Abstract: PURPOSE:To complete the function as a document data file, by setting the plural attribute values for 1 attribute per tapple in the data file using the relation model. CONSTITUTION:The single value index table 1 is an index table for the attribute with 1 value only per attribute concerning 1 tapple, and multi-value index table 2 is an index table for the attribute with plural values per attribute concerning 1 tapple. For the index table R/W circuit three, the retrieval demand signal, attribute and attribute value are received from the control portion 9, the document number is taken out from the single value index table 1 or multi-value index table 2, are written in the result memory 6, or the write demand signal from the control portion 9, attribute, attribute value and document number are received and they are written in the single value index table 1 or multi-value index table 2. The attribute information memory R/W circuit 4 reads the informaton concerning the attribute for the attribute information memory 5 or writes it.