Abstract: A class of models is proposed for the analysis of association in a contingency table with ordered rows and ordered columns. Association is measured in terms of the odds-ratios in 2 × 2 subtables formed from adjacent rows and adjacent columns. This class includes the null association model, the uniform association model, and models that describe the possible effects of the rows and/or columns on the association. With these models, the association in the table can be analyzed in a manner analogous to the usual two-way analysis of variance, and parsimonious descriptions of this association can be obtained often. Applications are discussed here, some well-known sets of data are reanalyzed, and new insights into these data are obtained.

Abstract: Data management by structuring data tables is one of the methods used by data analysts in many fields of science to describe the group structure in given tables. It involves rearrangements of the rows and the columns of the table to concentrate the non-zero values, as much as possible, in distinct blocks. Table 1 is a typical example. This table is structured and it has 18 blocks.

Abstract: A device for releasably connecting a furniture leg with a piece of furniture wherein the leg has displaceable portions which are displaceable from and against each other under the influence of a locking member which is adapted to displace the displaceable portions of the leg from a position where connection means on the displaceable portions do not or only incompletely engage connection means on the furniture, to a locked position wherein the connection means on the leg and furniture are in complete engagement with each other and the furniture leg is connected with the piece of furniture.

Abstract: A medical examination table which has a pair of foot stirrups that are supported and moved by a pair of limb support bars. These limb support bars are longitudinally slidable within independent swivel collars within the table. A swivel lock means is disclosed for locking the limb support bars in a particular angular position, and there is also lock means disclosed for holding each bar at a particular length adjustment.

Abstract: This invention relates to a transaction execution system. An embodiment of the invention provides a plurality of transaction terminals (1) in communication with a host data processing system (11). The terminals each include a keyboard (3), a display, document handling subsystems, a hardware control subsystem, a communication subsystem and a programmable control subsystem supervising the other subsystems. A user initiates a transaction request by inserting a card, which may have been issued by any of a plurality of cooperating card issuers or banks, into a card reader (2) of the terminals. The issuer identification number (9) is read from the card, and used to search a table (8) of card format and encryption key data. If the corresponding format and key data is located in the table, the terminal requests entry of a preassigned personal ID number (7) through the keyboard. Verification data located on the card by format data from the table is encrypted (5) in response to the key data from the table for comparison (6) with the keyboard entered ID number. If the corresponding format and key data is not located in the table, the card data is sent to the host (11), which accesses a master table (10) with the issuer identification number, and communicates back to the terminal the corresponding format and key data located in the master table. Once the terminal has checked for correspondence between encrypted verification data and the ID number, in response to format and key data from its own table or communicated from the host, additional transaction data is obtained via the keyboard. Upon command from the host, the host supplied format and key data is purged by the terminal at completion of the transaction, or else retained for future reference.

Abstract: EUFID is a natural language frontend for data management systems. It is modular and table driven so that it can be interfaced to different applications and data management systems. It allows a user to query his data base in natural English, including sloppy syntax and misspellings. The tables contain a data management system view of the data base, a semantic/syntactic view of the application, and a mapping from the second to the first.

Abstract: This paper lists and describes a FORTRAN computer program to calculate increment-decrement (multistate) life tables. It has been adapted from the program for multiregional life table analysis, published in Willekens and Rogers (1978). The use of the program is illustrated for a four-state marital-status life table for Belgium and a two-state working life table for Denmark.

Abstract: A cyclic redundancy check (CRC) is one of the most useful error detecting techniques employed in digital communications. It uses a very small amount of the message space, detects a great many types of errors, and is fairly easy to compute. Let us start with a short overview of what a CRC is. Cyclic redundancy checking is based on the Idea of describing a message In terms of a polynomial. The symbols that make up the message are taken as the coefficients of a polynomial in the Indetermlnant X. This polynomial represents the message in the sense that there Is a one-to-one correspondence between messages and polynomials. For example, the binary message 1100101 Csymbol set = {0,1)) could be represented by the polynomial: 6 5 4 3 2 iX + 1X + OX + OX + 1X + OX + 1 or as it is usually written: 6 5 2 X +X +X +1 The rest of this paper will consider messages which use only the binary symbols 0 and I. From the study of algebra, we know that the set of polynomials in the Indetermlnant X over a gJven field (Z/2* in the present case) forms a Euclidean domain. The most important property of a Euclidean domain that is used in CRC computations is the Euclidean Division Algorithm. Euclidean Division Algorithm: Given two polynomials N(X) and G(X), there exist unique polynomials QCX) and RCX) such that (1) M(X) = GCX)0CX) ÷ RCX) and (2) R(X) = 0 or degree(R(X)) < degree(G(X)). We recall that the degree of a polynomial Is the highest power of m~Qt~wmDt~wmtm * Z/2 Is the flnlte field with only two elements: (0,1}.

Abstract: There is disclosed a new and improved envelope processing machine. The machine includes an envelope hopper for storing a quantity of envelopes to be processed, an envelope processing station, spaced from the hopper, a table top surface adjacent the processing station providing a work surface for an operator, and incrementing conveyor means extending beside the table top surface and from the hopper past the processing station. The conveyor means is arranged for incrementally conveying the envelopes a predetermined distance in immediate succession from the hopper to the processing station through at least one intermediate stop position between the hopper and the processing station. As a result, sufficient spacing between the hopper and the processing station is provided to permit the table top surface to be dimensioned for providing a sufficient work surface area for an operator while still maintaining an efficient processing rate.

Abstract: An organized approach is considered for determining the best functional (usually polynomial) form of a mathematical model for a complex system using the minimum ofa priori information. It is necessary to know only the list of the variables that may possibly take part in the model, the corresponding table of data, and the general criterion that the model is to satisfy (e.g., “the prediction is to be accurate” or “the model is to be unbiassed”). The computer, with the help of a special organized sifting of models, uses the self-organization principle to find a unique model of optimal complexity.

Abstract: PURPOSE:To simultaneously and easily process into similar figures works placed on primary and secondary processing tables while driving the secondary processing table relative to the primary processing table at an arbitrary shift amount

Abstract: A device for feeding containers to a magazine table equipped with shelving and pertaining to a container delivery of processing and wrapping machines, especially of bottle cleaning machines. The device includes an endless conveyor belt passing by the shelving of the magazine table, and also includes devices, e.g. guiding plates, for exerting a lateral guiding pressure upon the containers accumulated in front of the shelving, the guiding pressure being directed toward the entrances to the shelving. The conveyor belt is so arranged with regard to the direction of introduction of the containers into the shelving of the magazine table that the feeding direction of the conveyor belt forms an obtuse angle with the direction of introduction of the containers into the shelving of the magazine table.

Abstract: PURPOSE:To store input data in a main memory unit according to desired sorting by equipping a data switching input equipment with an address conversion table. CONSTITUTION:Address signals 31 to 3N, data signals 41 to 4N, and ready signals 51 to 5N transmitted from cyclic digital transfer devices (CTD) 11 to 1N are inputted to data switching input equipment 6. Here, they are processed by microprocessor 7 to read out address of corresponding address conversion tables 81 to 8N. This address is transmitted as address signal 9 of main memory unit 21 to computer 2 together with data signal 10 and on the basis of this address signal 9, data signal 10 is stored in main memory unit 21. Therefore, input data can be sorted by kinds and stored in the memory unit by operating the address of the address conversion table.

Abstract: PURPOSE:To simplify switching with making the best use of the existent processing system by indexing the input/output device management table and setting address information corresponding to an auxiliary input/output device when fault has occurred in a current input/output device. CONSTITUTION:Correspondingly to each file stored in input/output devices 4 and 5, file control table 11 stores required file control information and device control table 10 stores device control information to have access to devices 4 and 5. Then, address information corresponding to input/output devices are classified for the current input/output device and the auxiliary input/output device and stored in input/output device management table 12 beforehand, and table 12 is indexed to set address information corresponding to the auxiliary input/output device when fault has occurred in the current input/output device. As a result, the switching can be simplified with making the best use of the existent processing system.

Abstract: PURPOSE: To provide an address converting function that an address conversion table can not be accessed direct through software, by modifying an equipment having converting function for an existing channel relatively simply. CONSTITUTION: Virtual storage key table 23, counters 26 and 29, and queues 30 and 31 are located in area 32 made of hardware, and at a request of a special instruction from software, the hardware is accessed. Further, segment table 5 and page table 6 are located in a hardware-using area and direct access to logical addresses through software is disabled. Furthermore, storage key and page bits is accessed through the hardware by special instructions. Consequently, the space that the software is recognized is limited to the virtual storage space including a program area and data area. COPYRIGHT: (C)1981,JPO&Japio

Abstract: The authors describe the direct and life table methods used to estimate survival rates and provide some practical examples of calculations and recommendations for graphical display (SUMMARY IN ENG) (ANNOTATION)

Abstract: PURPOSE:To secure a decision in a short time whether the renewal is possible or not by providing the function which memorizes the alteration information of the logic time given from other computers. CONSTITUTION:Table control unit 1 receives through terminal 2 the information for alteration of the logic time of other computers, alters the contents of logic time table 3 and starts logic time control unit 4. Table 3 consists of counters of the same number as the computers and memorizes the logic time of each computer. Unit 4 checks the contents of table 3, advances the logic time of the corresponding computer by one when the fact that the logic time of all other computers advance more than the corresponding computer is confirmed, and also informs the alteration of the logic time to other computers through terminal 5.