Abstract: It is now recognized that binary search trees are structures which can be used efficiently for the organization of files and directories. The ease of insertion and deletion of nodes makes trees very appealing for directories which are often modified. By comparison with a sequential table organization, some additional memory is required for the links between nodes. From a cost-effective viewpoint, this is generally more than compensated for by the savings in searching (for a linear table) and inserting (for an ordered table).

Abstract: A portable, readily storable patient treatment table includes a headrest section having an aperture contained therein which accepts and retains a patient's head in proper position within said aperture in a steadfast manner without the use of auxiliary retaining means

Abstract: A table comprises a table frame with a work surface supported thereby, two opposite sides of the work surface being provided with hinge means which enable the work surface to be selectively raised relative to the table frame about one of the two hinge means.

Abstract: Given a table of n rows and p columns, with only some of the cells occupied, how may the rows and columns be interchanged so that the maximum number of occupied cells are adjacent? This problem arises in correlation studies such as host-parasite relationships.

Abstract: PURPOSE:To simplify a structure by carrying out index work of a table with the use of a table feed mechanism.

Abstract: The ACI 318-71 reinforced concrete building code is seen as a complex logical system with requirements that may be expressed more precisely by reformatting the code using decision logic tables The decision logic table version is complete, containing all requirements, definitions, etc, found in the traditional form of the code The decision logic table form was done with the objective of being amenable to direct use by engineers A representative portion of the ACI 318-71 code in decision logic table format is presented Advances in the methods for predicting the maximum number of valid condition entry vectors related to dependent conditions are presented, as well as algorithms for formulating condition vectors and condition entry vectors Two methods of reducing table size are presented, as well as a method of combining tables

Abstract: The excitation table of a general P-valued JK-type multistable is developed. This table does not depend on the number of levels of the logic to be used.

Abstract: PURPOSE: Not only to make it possible to transfer a plate like body to a loading table smoothly and safely, but also to prevent damage in transfer. COPYRIGHT: (C)1977,JPO&Japio

Abstract: Spinning can changing device is provided for each set of four cans. Device is used in rotor yarn spinning machines. Operators are relieved of holding the cans during changing and tearing, stretching, twisting or snagging of fibre tows is prevented.

Abstract: PURPOSE: To improve the operational characteristics and universality of the data input device by reading the conversion table which corresponds to the key mat from the external memory. COPYRIGHT: (C)1977,JPO&Japio

Abstract: A recent revival of interest in measuring program execution behaviour has led to a number of distinct approaches. Arguments are given for a fairly simple method of modifying FORTRAN source code to collect frequency counts. No symbol table is necessary and only a single reserved name is introduced into the source.

Abstract: A multiple purpose unitary work table for student study having inclinable surface portions for efficiently accommodating a plurality of individuals or alternatively providing a relatively large and substantially smooth work surface. Each of the surface portions may provide a horizontal study table or, alternatively, an inclined table surface for drawing or other laboratory purposes according to the desire of the user.

Abstract: The support frame comprises individual legs and cross bars wherein each leg is in at least two parts which are both straight and fit together by turning one relative to the other. The leg members can be connected to a similar part of another leg by the cross bar which can be welded on to the legs or be fitted on by lugs. Intermediate connecting members can be used to connect the legs together and the legs and cross bars are preferably tubular. Various constructions can be formed to support table tops of any size by combining any number of units together in any formation.

Abstract: The portal milling machine has a fixed table and a movable portal, whose columns are each supported on a column foot guided on guide tracks on both sides of the table and driven by a feed device each. The feed devices of the two column feet are synchronously controlled by monitoring devices. One of the two columns is connected to its support face at the column foot by two stop bolts which are oppositely arranged in the direction of the longitudinal axis and can be released by a switching device controlled by the monitoring device, when there is disruption in the regular movement of the column feet. The bolts can be under control of a pressure medium and the switching device acts upon actuating cylinders.

Abstract: 1. One may use a microscope to en­ large the details of the transparency or radiograph. This is not always satisfactory. Microscopes are ex­ pensive, only one person can usually view the speci­ men at any time and worse still rather than being clari­ fied, detail is often obscured. What happens is that the microscope enlarges the film grain over a very small area of the specimen which usually results in an inabi­ lity to identify the original landmark.

Abstract: The Stanton-Mullin classification of BIBDs into (v,k) families has been extended by Collens to produce BIBSYS, an automatic system for storage, retrieval, and generation of BIBDs. The resulting tables show quite a few gaps in our knowledge concerning existence of early entries in the table. This paper describes an algorithm which has been successfully used to generate initial difference blocks which produce various designs by modular addition.

Abstract: Families of languages generated by classes of context sensitive Lindenmayer systems with tables using nonterminals are classified in the Chomsky hierarchy. It is shown that the family of languages generated by deterministic λ -free left context sensitive L systems with two tables using nonterminals coincides with the context sensitive languages. Combined with the fact that the family of languages generated by deterministic λ -free context sensitive L systems (with one table) using nonterminals is equal to the DLBA languages this shows the classic LBA problem to be equivalent to whether or not a trade-off is possible between one-sided context with two tables and two-sided context with one table for deterministic λ -free L systems using nonterminals. Without the restriction to λ -freeness such a trade-off is possible since the recursively enumerable languages are generated in both cases. By stating the results in their strongest form, a complete classification of the considered language families is obtained since the hierarchies induced by the involved parameters ( λ -freeness, determinism, number of tables, amount of context, closure under various types of homomorphisms) basically collapse to the recursively enumerable languages, context sensitive languages, and DLBA languages.