TL;DR: In this article, a transaction execution system has a multiple account data base and a plurality of transaction terminals in communication with the host, each of which includes a keyboard, a display, document handlng subsystems, a hardware control subsystem, a communication subsystem and a programmable control subsystem supervising the other subsystems.
Abstract: A transaction execution system having a multiple account data base and a plurality of transaction terminals in communication with the host. The terminals each include a keyboard, a display, document handlng 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 one of the terminals. The issuer identification number is read from the card, and used to search a table 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 through the keyboard. Verification data located on the card by format data from the table is encrypted in response to the key data from the table for comparison 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, which accesses a master table 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.
TL;DR: In this paper, a digital signature machine provides a simplified method of forming and verifying a signature that is appended to a digital message, where a sender transmits a signature with the usual signature keys and with validation table entries that correspond to the unsent keys with the compressed encoding of the next validation table.
Abstract: A digital signature machine provides a simplified method of forming and verifying a signature that is appended to a digital message. A sender transmits a signature with the usual signature keys and with validation table entries that correspond to the unsent keys and with the compressed encoding of the next validation table. The receiver uses the compressed encoding of the next validation table to form validation table entries from the signature keys so that the receiver has a full validation table. This validation table is compressed and compared with the compressed encoding which was received from the sender in a preceding message.
TL;DR: In this article, a pre-translation table is provided where the address to be translated is compared with two address translation candidates sequentially and the results of the precompare generate an address bit which together with the other address bits select the candidate from the translation table which is more likely to compare with a larger group of address bits from the virtual address register.
Abstract: Address translation apparatus is provided where the address to be translated is compared with two address translation candidates sequentially. The virtual address to be translated is contained in a virtual address register. A field of bits within the virtual address are presented simultaneously as an address to a translation table and a pre-translation table where the pre-translation table has two entries per row and each entry contains some of the virtual address bits of corresponding candidates in the translation table. The pre-translation table is quite narrow compared to the translation table and is preferably, but not necessarily, implemented in latches or as a very fast array compared to the translation table. The selected entries from the pre-translation table are compared with corresponding bits from the virtual address register and the results of the precompare generate an address bit which together with the other address bits select the candidate from the translation table which is more likely to compare with a larger group of address bits from the virtual address register. In the event both entries from the pre-translation table compare with the corresponding bits from the virtual address register and the selected candidate from the translation table does not compare with the larger group of address bits from the virtual address register, the address bit from the precompare is forced to an opposite state whereby the other candidate is selected.
TL;DR: In this article, the structure of the Newton-Pade table has been characterized using the concept of minimal solutions, and the results obtained exhibit some remarkable differences from the Pade table.
TL;DR: A table selectively adjustable to two heights on L-shaped leg members which are pivoted to the table top at corresponding distal ends of the leg members is described in this paper.
Abstract: A table selectively adjustable to two heights on L-shaped leg members which are pivoted to the table top at corresponding distal ends of the leg members.
TL;DR: In this paper, a method of loading bales of refuse from a horizontally acting baling press on to a transport vehicle without the use of a separate loading machine such as a fork-lift truck is described.
Abstract: A method of loading bales of refuse from a horizontally acting baling press on to a transport vehicle without the use of a separate loading machine such as a fork-lift truck comprises aligning the transport vehicle with a discharge from the press; moving each bale as it is discharged from the press on to a transverse table; moving some of the bales laterally so that the bales are formed into two or more rows side by side aligned with the transport vehicle and moving the two rows of bales progressively forward as successive bales are discharged from the press so that the rows are moved from the transverse table on to the vehicle and the rows are built up on the vehicle until the vehicle is fully loaded. The apparatus for carrying out this method comprises a discharge table arranged at the outlet of the press, a transverse table aligned with the discharge table and on the side of the discharge table remote from the press, the transverse table having a drive by which it is horizontally displaceable across the direction of discharge of the bales from the press and a longitudinally movable hauling tongs which is arranged to move single bales forward from the discharge table on to the transverse table and then to move the two or more rows of bales which are assembled from the transverse table forward on to the transport vehicle.
TL;DR: A characterisation of modelling andFragments of programming languages and table look-up codings show the importance of priori knowledge in the development of models for programming languages.
Abstract: 1. Introduction.- 2. Survey of related work.- 3. A characterisation of modelling.- 4. Incorporation of a priori knowledge.- 5. Fragments of programming languages.- 6 ? - Comparability.- 7. Table look-up codings.- 8 Discussion and conclusion.
TL;DR: The application of the information formatting programs to a small set of pediatric discharge summaries for hospitalizations due to sickle cell disease is described and the potential use of such tables in continuing medical education and other applications in the hospital setting are discussed.
Abstract: At New York University, computer programs have been developed that convert natural language medical records into a structured data base, i.e. into a table containing the same information as the stored documents. In this form specific information can be quickly retrieved, and summaries of the different kinds of information in the documents can be automatically generated. The automatic conversion of the information from its free-text form to a tabular form is called information formatting. This paper describes the application of the information formatting programs to a small set of pediatric discharge summaries for hospitalizations due to sickle cell disease. The programs created a table of approximately 50 columns in which each different type of information in the documents appeared under a separate heading. From this, a retrieval program extracted instances where symptoms of possible infection preceded symptoms of painful crisis, as suggested by the literature on sickle cell disease. In answer to more detailed queries the program checked the time-order of findings within one document. The potential use of such tables in continuing medical education and other applications in the hospital setting are discussed.
TL;DR: In this paper, a simplified program, improved quality and easily discriminative expression by using the generation or extinction of a table for the address calcuration or the discrimination of the before and behind relation of the data generation entirely corresponding to the time.
Abstract: PURPOSE:To obtain the simplified program, improved quality and easily-discriminative expression by using the generation or extinction of a table for the address calcuration or the discrimination of the before-and-behind relation of the data generation entirely corresponding to the time.
TL;DR: A program for optimizing most of the significant traffic engineering quantities while allowing for the fact that drivers can and do change their routes and modes of travel is proposed.
Abstract: A program for optimizing most of the significant traffic engineering quantities while allowing for the fact that drivers can and do change their routes and modes of travel is proposed. The program requires the person origin-destination table as input and gives the best traffic-signal settings, reserved-lane assignments, and ramp-metering rates as outputs. The optimization can be for minimum person time, for minimum fuel consumption, or for a combination of both. The optimization was coded by using arbitrary but reasonable models for the components and run for a hypothetical network. Sample results are given. The example problems described required from 2.5 min (system optimizing) to 3 min (user optimizing) central processing unit time per complete iteration. /Authors/
TL;DR: A table game set has two player's boards with vertical and horizontal lines thereon to form squares and playing pieces of types having a straight line, a T-shaped line or crossed lines drawn on different pieces as discussed by the authors.
Abstract: A table game set has two player's boards with vertical and horizontal lines thereon to form squares and playing pieces of types having a straight line, a T-shaped line, an L-shaped line or crossed lines drawn on different pieces. Two players sit face-to-face with the set between them and compete to form lines from the start line to the goal line on their respective boards to earn points by arranging pieces in turn. The boards are separated by a surface integral with the boards on which the playing pieces yet to be used may be placed to be selected by the players. A plurality of adjacent bars are slideably held beneath the surface between the boards, with the ends of the bars extending outwardly to designate an award of points when a line from a starting line to a goal line is completed.
TL;DR: In this article, a rotary table with electro-inductive material, forming rotor electrode inside of periphery of the rotating table and allowing creeping discharge to occur along the electroinductive body.
Abstract: PURPOSE:To improve noisy wave eliminating effect by integral construction of a rotary table with electro-inductive material, forming rotor electrode inside of periphery of the rotating table and allowing creeping discharge to occur along the electro-inductive body.
TL;DR: In this article, the 1st and 2nd memory methods are provided in which foreign language pattern and foreign language codes are stored respectively, so that when foreignlanguage codes are given from respective subscribers, the desired foreign-language patterns can be sent back repeatedly after the table conversion.
Abstract: PURPOSE:The 1st and 2nd memory methods are provided in which foreign-language pattern and foreign-language codes are stored respectively, so that when foreignlanguage codes are given from respective subscribers, the desired foreign-language patterns can be sent back repeatedly after the table conversion.
TL;DR: In this article, a vertically movable table which adheres the plate form object through vacuum suction and three spherial seat heads on the circumference of said table is used to measure warpage without scoring or damaging plate form objects.
Abstract: PURPOSE:To measure warpage without scoring or damaging plate form objects by providing a vertically movable table which adheres the plate form object through vacuum suction and three vertically movable spherial seat heads on the circumference of said table.
TL;DR: A rotary mounting for supporting a workpiece for rotation has a number of support members which are small in relation to the workpiece and each of which forms an aerostatic bearing with a flat surface of a table.
Abstract: A rotary mounting for supporting a workpiece for rotation has a number of support members which are small in relation to the workpiece and each of which forms an aerostatic bearing with a flat surface of a table. The support members are connected by respective links to a radial bearing connected to the table and supporting the mounting for rotation.
TL;DR: In this article, an object positioning appts. includes a positioning table (11) rotatably mounted in an inclined plane, which has a number of pockets (31, 70, 90) for receiving objects which during rotation of the table have a predetermined position.
Abstract: The object positioning appts. includes a positioning table (11) rotatably mounted in an inclined plane. The table has a number of pockets (31, 70, 90) for receiving objects which during rotation of the table (11), have a predetermined position. Also mounted on the table (11) are further pockets (40, 80, 100) which receive the objects from the first pockets (31, 70, 90) and support them in one predetermined position. Manipulators are provided for transporting the objects from each first pocket to a corresponding second pocket and for removing the objects from each second pocket during rotation of the table. The objects are held in a container which transfers them to each first pocket during rotation of the table.
TL;DR: In this paper, an inverted memory table was used for the data processing system equipping a translation look-aside table TLB to increase the use efficiency of TLB as well as to increase index processing speed.
Abstract: PURPOSE:To increase the use efficiency of TLB as well as to increase the index processing speed by using an inverted memory table for the data processing system equipping a translation look-aside table TLB
TL;DR: In this article, the authors propose to simultaneously process those of a shape of a complementary relation by combining a main processing table with an auxiliary processing table, where the auxiliary table can be used for auxiliary processing.
Abstract: PURPOSE:To simultaneously process those of a shape of a complementary relation by combining a main processing table with an auxiliary processing table.
TL;DR: In this paper, an automatic microfish registering system was used to eliminate the production of a layout table and to realize an easy and high-speed automatic search, by securing a microfish registry.
Abstract: PURPOSE:To eliminate the production of a layout table and to realize an easy and high-speed automatic search, by securing an automatic microfish registering
TL;DR: The method of Manly (1977) for determining key factors in the life cycle of animal populations is illustrated on several sets of published data.
Abstract: The method of Manly (1977) for determining key factors in the life cycle of animal populations is illustrated on several sets of published data.