Abstract: A device (800) and method (900) are included for providing a high-rate queueing discipline in an information network system having a plurality of traffic classes. The high-rate queueing discipline is based on a scan table-based dequeueing scheme having a scan table that is precomputed and stored in memory, thus facilitating rapid processing of different traffic class information. The device and method are particularly useful in a fast packet system.

Abstract: Power consumption in an electrical system, particularly a battery powered computer system, may be reduced by a method in which the performance of the system's power consuming assets (e.g., I/O devices, memory, processors, etc.) is monitored during the operation of application programs. The performance metrics (e.g., time on, processing assets, instruction density, etc.) for each of the application programs is stored in a look-up table below the application program software level that is accessible to the basic input/output system and/or disk operating system. The look-up table may be dynamically updated each time an application program is run. The data in the look-up table are used to remove all or part of the power from those assets that require no or less power during operation of a particular application program. The method is transparent to the application programs and may use a terminate and stay resident programs.

Abstract: In a computer database system, a method and system are provided for interactively and iteratively constructing a query using a table metaphor displayed on a user display. Alterations are made directly to the table metaphor by the database user. The alterations relate to adding, deleting, or combining columns of attributes and limiting ranges of attribute values. The alterations are registered and the table metaphor updated to reflect the registered alterations. The table metaphor can be repeatedly used to further register additional alterations. The query corresponding to the table metaphor in its final form is run against the full database to generate a report in the format indicated by the table metaphor.

Abstract: A last-stage steam turbine bucket having a profile according to Charts II-XIII, XV-XXVII and XXIX of Table I.

Abstract: A method for communicating a transform definition to a destination device. The transform definition outputs image parameter data based on input image data and has a channel corresponding to each output image parameter. Each channel has at least one input table, an output table and a grid table representing an input/output relation of an image transformation. The destination device is provided with: identification data identifying the communication as that of a transform definition; version data for distinguishing the transform definition from other versions of the transform definition; size data specifying a size of one of the grid table's dimensions for each channel's grid table; with input table, output table, and grid table data of any input, output, and grid table which is shared by a plurality of channels; and with input table, output table and grid table data of any private input, output, and grid tables.

Abstract: A development system having methods for maintaining data integrity of information stored as a data record in a database table with information displayed on a screen device is described. An exemplary method for maintaining data integrity, without continuous exclusive locking of a shared data record, includes the following steps. First, the system reads at least one field value from a database table, while the table is available to others (i.e., accessed with share access). This field value is displayed on screen to the user, whereupon the user may enter new information (i.e., new field value). In the event that the user has entered new information, the method performs the step of re-reading the field value from the database table. Accordingly, the method can determine whether the just-entered value differs from that stored in the database. In the event that the two differ, the method can update the database with the just-entered information displayed on screen or, alternatively, refresh the information displayed on screen with that which is now stored in the database table.

Abstract: An in use table manager in a computer system uses an in use table to track the use of files, or objects. The in use table is used to determine which objects may need recovery in the event of a system failure. Object addresses are hashed by the in use manager to identify a preferred slot in the table. The slots contain information identifying the object, and indicating the extent of use of the object. The in use manager assigns alternate slots, and dynamically changes the size of the in use table to reduce contention for slots. Several atomic operations on the table ensure integrity of the table, while permitting concurrent use. Portions of the table are bundled into single I/O operations to enhance system performance by minimizing I/O.

Abstract: Here's how to calculate contribution margins for the three meal periods, for different menu categories, and for individual menu items—as well as for the operation as a whole. The procedure is a useful method for analyzing menu items and builds on the portfolio analysis inherent in other menu-analysis methods

Abstract: Tables are important components of technical documents. This paper addresses the following problems: (i) identifying a tabular component in a scanned image of a compound document containing text, drawings, diagrams, etc.; (ii) understanding the content of the table in order to convert the table into electronic format. As far as the authors are aware, the problems addressed are new. An algorithm for performing both the above tasks has been studied and implemented. Preliminary experimental results indicate satisfactory performance for many table lay-out styles. >

Abstract: Ｔｅｃｈｎｉｃａｌ Ｎｏｔｅｓ ｏｎ ｔｈｅ ２００５ Ａｓｉａｎ Ｉｎｔｅｒｎａｔｉｏｎａｌ Ｉｎｐｕｔ‐Ｏｕｔｐｕｔ Ｔａｂｌｅ Ｓｔａｔｉｓｔｉｃａｌ Ｔａｂｌｅｓ Ｃｏｍｐｉｌａｔｉｏｎ ｏｆ ｔｈｅ Ａｓｉａｎ Ｉｎｔｅｒｎａｔｉｏｎａｌ Ｉｎｐｕｔ‐Ｏｕｔｐｕｔ Ｔａｂｌｅ Ｃｏｍｐｉｌａｔｉｏｎ ｏｆ Ｎａｔｉｏｎａｌ Ｉｎｐｕｔ‐Ｏｕｔｐｕｔ Ｔａｂｌｅｓ

Abstract: A programmable controller having a loading feature for changing such control information as control programs. The controller comprises a load execution unit and an allocation unit. The load execution unit checks, upon receipt of new control information, the execution state of the program to be changed based on management information stored in a management table. The load execution unit loads the new control information into an area indicated by addresses held in a management table if the program is in non-executing or non-executable state. The load execution unit loads the new control information into a reserved area indicated by addresses held in a reserved table if the program is in executing or executable state. The allocation unit replaces the content of the addresses held in the management table with the content of the addresses held in the reserved table after the load execution unit has loaded the new control information into the reserved area.

Abstract: An address management system which is integrally compatible to an plurality of communication services and a plurality of communication application programs, and a communication terminal which utilizes such an address management system are disclosed. The address management system comprises type of communication service table and address management table which stores a number of identification information of communication destinations and types of communication services available to the communication destinations and associated communication addresses, a request acceptance unit for accepting a communication address inquiry request command, a type of communication service discrimination unit which discriminates a type of communication service which the communication application program of the communication address inquiry requestor uses, a communication address retrieval unit which searches the address management table to retrieve a communication address in accordance with identification information of the communication address inquiry request and the discriminated type of communication service, and a response unit which sends the retrieved communication address back to the communication address inquiry requestor. A proper communication address can be obtained by merely designating the terminal name of the destination terminal by the communication application program without identifying the type of communication service.

Abstract: Abstract Here's how to calculate contribution margins for the three meal periods, for different menu categories, and for individual menu items—as well as for the operation as a whole. The procedure is a useful method for analyzing menu items and builds on the portfolio analysis inherent in other menu-analysis methods

Abstract: The present invention provides a method and system for providing communication between a number of applications and a number of devices disposed in various relative locations in a data processing system through an interface that is capable of accessing only a single device at a prespecified relative location The applications are concurrently executing within the data processing system A device table is established for each of the applications, wherein each device table includes device parameter information and device address information for each of the devices in the data processing system A particular device is specified for use with a selected application Device parameter information and device address information for the prespecified relative location within the device table established for the application are overwritten with device parameter information and device address information for the particular device specified Data is then directed from a particular application to a selected device utilizing the device parameter information and device address information stored within the device table for the particular application

Abstract: An interactive graphical display of object relationships and instances is implemented by means of a table driven process. The user can select one or more object occurrences and then select an action to be performed on the selected object occurrences using a dynamic menu of actions. Changes are made to the tables without modifying the processes. The process can be used in managing a distributed database system to provide a user with increasingly detailed levels of information about object types and occurrences in the database systems.

Abstract: A distributed computer system and method for integrating call management to the retrieval of documents in response to user inquiries includes distributed computers, a processor connected to an incident table register, a user table register and an acyclic graph data base. The incident table register records and stores information related to the user inquiry, the user table stores information related to the user's identity and the acyclic graph data base stores a plurality of documents useful in addressing user inquiries. Within a top level of the acyclic graph data base are indices for importing and exporting documents to remote inquiry systems for the purpose of escalating inquiry problems to other systems having more specialized knowledge.

Abstract: A method of help-information control for displaying help information on a display unit of an information processing system executing a plurality of application programs. A status management table for storing the executing status of application programs is provided as common to these programs. During execution of a given application program, the contents of the status information table are updated successively in accordance with the executing status. Whenever an operator makes a help request, the contents of the status management table in effect at that point in time are referenced. The table is searched for the help information corresponding to the request. When found and retrieved, the information is displayed. The search is performed using a program identifier, a message identifier, and a help message searching table that includes the position information containing the corresponding help data. Each application program is equipped with a control data part that makes it possible to reference help data of other application programs.

Abstract: A method of defining the operation of switching system peripherals is comprised of storing a software program for operating the peripherals in a switching system; storing at least one table of data for access by the program for defining operating parameters of a corresponding at least one peripheral; modelling a prototype of the peripheral in a remote host system by creating a human-machine-interface simulating the peripheral; storing a control table of data corresponding to the modelled prototype in a memory for the host system; and downloading the control table into the one table, whereby operation of the peripheral is controlled by the operating software programs and the data in the at least one table.

Abstract: The ET* algorithm is a complete evaluation strategy for Datalog programs, which are logic programs without function symbols. The ET* algorithm uses extension tables and depth-first iterative deepening to provide the evaluation of pure function-free logic programs as declarative specifications. Extension tables are a memo facility that the algorithm uses both to cut infinite derivation paths for complete evaluation and to optimise the evaluation of logic programs. The original implementation of the ET* algorithm incorporated extension tables as part of the Prolog database using the built-in predicates assert and retract. The advantage of implementing the extension table using the Prolog database is the portability of the ET* algorithm. There are several disadvantages, however, with this approach. One disadvantage is the cost associated with the built-in predicates assert and retract, which are known to be expensive operations in most current Prolog systems. Another disadvantage is the differences across implementations in the semantics that these built-ins provide for dynamic predicates. This paper presents an efficient implementation of extension tables as a global data structure in Prolog, which includes a set of built-in primitives for manipulating the extension table. The ET* algorithm is updated to reflect the utilisation of the global extension table data structure. The implementations of the ET* algorithm are compared using time and space performance on a variety of benchmark programs.

Abstract: PURPOSE:To quickly couple tables, to reduce the capacity of a memory, and to improve the convenience of relational data bases by eliminating unnecessary data transfer. CONSTITUTION:First and second tables T1 and T2 belonging to relational data bases DB1 and DB2 managed by data processing systems SC and SS respectively are coupled correspondingly to each other by common data items. One data processing system SC extracts data of columns corresponding to common data items from the table T1 and transfers a data aggregate DA consisting of extracted data to the other data processing system SS, and the other data processing system SS extracts only data of rows corresponding to the data aggregate DA from a data group T2a of columns as the coupling object in the table T2 to generate a temporary table TY and transfers this table TY to one data processing system SC, and thereafter, tables T1 and the temporary table TY are coupled in one data processing system SC.

Abstract: A table, particularly an orienting and welding table comprises a table plate having a surface provided with uniformly distributed cylindrical throughgoing openings arranged in a grid with a uniform distance therebetween.

Abstract: A useful feature of data base systems is to allow the user to change the order in which fields appear in the columns of a table. The purpose of this study was to compare the usability of seven different user interfaces for performing this task in the Microsoft Windows environment. The fields to be reordered were file name, file number, size, and creation date. The seven approaches studied covered a range of interaction styles, including dragging and dropping, menu selection, text entry, and button pressing. Fifteen Windows users completed a set of two practice trials using each approach, followed by a set of twelve main trials. For each trial, the user was shown the current order of the fields and a target order to change to. The completion times showed significant differences according to the approach used. Overall, a data-selection technique using radio buttons and a data-entry technique using a single entry area were significantly faster than all of the others. Another data-entry technique, involving m...

Abstract: Abstract In many respects Canada and Australia possessed similar financial systems. But in many ways the systems were very different. Our survey treats not only the commercial banks but also the “near-banks” and “semi-banks” that shared the field with the more conventional banking institutions; we also discuss the financial context, both domestic and international, in which these institutions worked. Summary financial data appear in Table 9-1.

Abstract: Summary Intraocular pressure ( iop ) was measured in 114 eyes of 57 clinically normal dogs with 2 applanation tonometers (Tono-Pen and Mackay-Marg) and the Schiotz indentation tonometer, using the 5.5- and 7.5-g weights. Significant differences were not detected between measurements obtained with the Tono-Pen and Mackay-Marg tonometers the Mackay-Marg and Schiotz tonometers using either weight and conversion with the human calibration table, or the Tono-Pen and Schiotz tonometers using the 7.5-g weight and the human calibration table. Values obtained by use of the Tono-Pen tonometer were significantly less ( P < 0.005) than values obtained with the Schiotz tonometer when a 5.5-g weight and the human calibration table were used, but the amount was clinically unimportant. Estimates of iop using the Schiotz tonometer and the canine calibration table, and either the 5.5− or 7.5-g weight were clinically and significantly much higher ( P < 0.0001) than estimates obtained with the Tono-Pen, Mackay-Marg, or Schiotz tonometers, using the human calibration table and either weight. Sixty to 70% of clinically normal dogs had an iop ≥ 30 mm of Hg when Schiotz scale measurements were converted with the canine conversion table. For clinically normal dogs, the human calibration table was the most clinically useful table for converting Schiotz tonometer measurements to mm of Hg. Normal mean (± sd ) canine readings with the Schiotz tonometer and the 5.5-g weight was 4.9 ± 1.5 tonometerscale units (range, 2 to 11; 95% confidence interval, 1.9 to 7.9). Converted means (± sd ) for clinically normal dogs with the 5.5-g weight were 18.0 ± 4.1 mm of Hg (range, 6 to 29; 95% confidence interval, 9.8 to 26.2) with the human calibration table, and 30.9 ± 4.7 mm of Hg (range, 17 to 43; 95% confidence interval, 21.5 to 40.3) with the canine conversion table.

Abstract: PURPOSE:To automatically detect table from documents by detecting a table start line, intermediate line, and end line, based on the code of the table defined by a table code definition. CONSTITUTION:The table start line, table intermediate line, and table end line are successively and automatically detected 8 by a table attribute rule 2 based on the code defined by a table code definition 1 about an inputted document 4, by using the table code definition 1 and the table attribute rule 2 defined arbitrarily as needed by a user, so that a table candidate can be extracted. Moreover, a property of a rectangle is checked, and the table is decided when it is OK. Thus, the table can be automatically detected from among the document 4 according to the table code definition 1 and the table attribute rule 2 defined aribitrarily as needed by the user.