Abstract: Abstract This book offers a novel and unconventional approach to Roman culture, through food - or rather, food as it is represented in literature. Food is not generally thought of as the noblest of literary subjects, and this view is a legacy from the Romans, so it is curious that Roman writers chose so persistently to depict their society at the dinner-table. Why this was so, and what effect the inclusion of food had on the status of the literary texts that described it, are among the questions discussed here. The book also addresses problems that arise when a material subject is translated into words, and contains fresh interpretations of Latin texts that have been unjustly undervalued - comedy, satire, epigrams, letters, and iambics. While often regarded as something trivial and gross, food was in fact one of the most suggestive images for Roman civilization.

Abstract: A system includes a relational database management system (RDBMS) having a data modeling component. A "data model" is a graphical representation of the relationship between tables one may use in a design document. "Design documents" allow a user to customize how his or her data are presented, including presenting information in formats which are not tabular and including formats which link together different tables (so that information stored in separate tables appears to the user to come from one place). Methods are described for automatically linking tables to be placed in a data model by comparing unique keys (e.g., primary key or other unique identifier) of one table with indexes (or indexable fields) of another table. Based upon the comparison, the system automatically suggests an appropriate link (if any) for the tables.

Abstract: This paper is primarily a printed listing of the National Highway Traffic Safety Administration’s (NHTSA) Light Vehicle Inertial Parameter Database. This database contains measured vehicle inertial parameters from SAE Paper 930897, “Measured Vehicle Inertial Parameters NHTSA’s Data Through September 1992” (1), as well as parameters obtained by NHTSA since 1992. The proceeding paper contained 414 entries. This paper contains 82 new entries, for a total of 496. The majority of the entries contain complete vehicle inertial parameters, some of the entries contain tilt table results only, and some entries contain both inertia and tilt table results. This paper provides a brief discussion of the accuracy of inertial measurements. Also included are selected graphs of quantities listed in the database for some of the 1998 model year vehicles tested.

Abstract: In a database management system of the present invention, a trigger definition means which defines activation condition an contents of a triggered operation activated upon execution of updating for a table further defines an operation where an exception is generated for an update request against the constraint given to the table, or a triggered operation based on the reference constraint given among a plurality of tables, or a triggered operation based on the relations among the system tables contained in the system directory. The trigger definition means also specifies an operation mode as a condition for execution of the triggered operation. The trigger execution means executes the triggered operation when the trigger operation mode designated by the update request and the operation mode specified in the trigger definition are the same and does not execute any trigger execution when they are not the same.

Abstract: The present invention describes a system and method for maintaining databases. An ordered genealogy table is provided for implying hierarchical relations on an as-needed basis. The invention further provides relational search capabilities to a hierarchical database. The invention also allows a database that is maintained on a computer system in a hierarchical structure to be converted into a database that is maintained in a relational structure, and vice versa. In addition, the invention may be used with currently existing hierarchical and relational databases. The invention provides a plurality of records; a unique identifier for each of the records; a database for maintaining the records; and a table which contains one or more table entries, wherein each table entry contains a genealogy including the unique identifier of a particular record and the unique identifiers of any records that can be considered ancestors of that particular record in a hierarchy, and wherein the table entries are sorted in collating sequence according to their genealogies.

Abstract: Look up tables for use in programmable logic devices are modified to facilitate use of those tables to provide adders (including subtracters) and various types of counters. Each look up table is effectively partitioned into smaller look up tables when an adder or counter is required. One portion of the partitioned table is used to provide a sum out signal, while the other portion of the partitioned table is used to provide a fast carry out signal for application to the next stage of the adder or counter.

Abstract: In many situations a statistical database contains multiple summary tables, which report summary statistics on the same summary variable for the same population of individuals or objects using different classification criteria («homogeneous» summary tables). Existing query languages consider only those queries which may aggregate data stored in a single summary table. When a statistical database contains homogeneous summary tables, such query languages do not allow an integrated view of data, whereas statisticians are inclined to view and query a collection of homogeneous summary tables as if they were actually a single higher-dimensional summary table. This legitimizes the search for a universal-scheme solution to the problem of data integration is such statistical databases

Abstract: A parallel database processing system a global database processing unit, a plurality of local database processing units, and a network interconnecting the global database processing unit and a plurality of local database processing units, wherein one table containing a number of records is partitioned into local tables, each local table being provided in a corresponding one of the local database processing units, secondary key indexes representing correspondence between the values of secondary keys for all records in the table and access information to the records corresponding to the secondary keys, are partitioned on the basis of the values into local secondary key indexes, each set of the local secondary key indexes being provided in a corresponding one of the local database processing units, and an identifying unit is provided in the global database processing unit, the identifying unit responsive to a retrieval request with the secondary key identifying the local database processing unit having the local secondary key index corresponding to the secondary key. At the global database processing unit, the retrieval request with the secondary key is received, the identifying unit identifies the local database processing unit having the local secondary key index corresponding to the secondary key, and the retrieval request with the secondary key is transferred to the identified local database processing unit. At the identified local database processing unit, its own local secondary key indexes are referred to obtain access information corresponding to the transferred retrieval request with the secondary key, and the retrieval request with the secondary key is processed by using the access information so that the local table corresponding to the retrieval request with the secondary key is accessed.

Abstract: A method and system for displaying results of multiple level aggregation queries and providing hierarchical table sets in response to multiple level aggregation queries. In a preferred embodiment, a database engine program receives multiple-level aggregation queries from a database front-end program. A multiple level aggregation query defines two or more data aggregation levels. In response to a multiple-level aggregation query, the engine creates a hierarchical table set, which contains a separate table for each level of aggregation specified by the multiple-level aggregation query. Each table in the hierarchical table set contains the aggregation information for one level of the multiple-level aggregation query. In a preferred embodiment, the front-end uses the tables in the hierarchical table set to generate a hierarchical window display that the user can view. The engine preferably also generates a crosstab table having row and column headers which are derived from the data in the source tables by converting a crosstab query into a multi-level aggregation query, executing the multi-level aggregation query, and then retrieve the data for the crosstab table using the hierarchical table set.

Abstract: An integrated circuit card includes a processing controller, a non-volatile memory having plural files in a hierarchical structure, with each file having an access conditions controller relating to the level number of said hierarchical structure, and a RAM having plural key information fields corresponding to the level numbers. Each access condition controller has an access key box designation table which indicates which keys should be verified and a vertical matching condition settings table which indicates which level keys should be collected for verification.

Abstract: A number of predefined table formats are provided for formatting a table. A user converts a table into the predefined table format by selecting the range of cells for the table and then selecting the predefined table format to be applied to the range of cells of the table. The formatting is performed automatically by a data processing system. Heuristics are used to determine the structure of the table to be formatted. Separate parts of the table are then successively formatted in accordance with the selected predefined table format.

Abstract: Storage locations, such as voice mailboxes are addressed on a plurality of widely distributed host systems, connect via a network, by defining logical domains Bach of which may include storage locations on more than one host system. The domains are defined by address tables which indicate which host systems provide ranges of address locations. Transfer of data between domains is simplified by the use of translation tables. One type of translation table is an alias table which has entries containing a range in the originating domain, a new domain and a starting point for a range in the new domain, thus defining a one-to-one correspondence between the ranges in the two domains. Another translation table is a gateway table which defines a gateway to a new domain when an input address has characteristics matching a prefix, number of digits, or both, of an entry in the gateway table. Upon finding the closest possible match in the gateway table, the portion of the input address after the prefix, if any, is used as the address in the new domain.

Abstract: A fast software encryption algorithm is described. The computation cost is about 20 simple machine code instructions per word, although a key dependent table has to be constructed for each new key. Table construction time is some hundreds of word encryption times. It is a word based algorithm with a running key.

Abstract: A system of the present invention includes a relational database management system (RDBMS). Methods are described for maintaining integrity between "design documents," which may be creating under different operating systems, and one or more information tables of the system. The system provides each field of a table with a unique ID ("field ID") for tracking the field regardless of restructuring changes which may be made to the table by various clients. Corresponding field IDs are stored with the fields of design documents, thereby permitting the system to maintain a link between a design document and its table. Upon a restructure of a table, the dependent design documents may be appropriately updated by their respective clients. Methods are also described for improved storage of free-form or "memo" data. In a preferred embodiment, memo data are stored in a separate file comprised of variable-length storage blocks. Methods are described for allocating storage space in the blocks and sub-allocating storage space within a block. For increased efficiency, the system maintains a sorted "free list" of free storage blocks.

Abstract: Selector table indexing is a simple technique for method lookup in object-oriented languages, which yields good performance, is well suited to multiple inheritance and dynamic typing, but is generally disregarded for its prohibitive memory consumption. The large memory footprint is caused by keeping a table of methods, indexed by a selectorcode, for each class in the system. These tables are sparsely filled. A sparse array implementation is presented, which reduces the memory consumption by an order of magnitude, while performing retrieval in constant time. This implementation is discussed in the context of a real programming environment, and compared to selector coloring, a different memory-optimizing technique. The method is shown to be complementary to dynamic caching techniques such as inline caching.

Abstract: A selective data capture method for software exception conditions in the operation of a data processing system including means for describing the pertinent data to collect before the lose of control of the faulty program. First the program preventively declares in a table all the data to capture in case of error (501). In a second stage, at the key points of the code, the pertinent sets of data in the table are activated (502). On the occurence of an error (503), only the data previously declared and activated are collected (504) by the external code in charge to manage the error reporting to a maintenance subsystem (505). The invention is attached to the global data capture strategy is particularly to the Error Notification and Selective Dump processes. It provides an efficient and very simple data selection method ensuring a high quality and integrity of the information collected with a minimum impact on the performance and the resources of the data processing system. The invention contributes to an efficient and an high quality software development and maintenance.

Abstract: A software developer's tool to help write application programs for an object-oriented operating system includes a storage device holding code. The code includes a clipboard copying utility and a first code section permitting the identification of dialog boxes and event tables associated with dialog boxes, the event tables signifying events capable of taking place during running of the application program to be written. A second code section permits the copying of dialog boxes and their associated event tables by actuation of the clipboard copying utility, and creates a new object identical to the parent object, providing a unique object name for the new object, and generating an event table name for the event table associated with the new object derived from the name of the parent object such that the event table includes controls having names derived from the name of the event table. A third code section permits editing of the child event table without altering the parent event table. Sequential use of the first, second and third code sections creates a parent object and a child object having associated parent and child event tables, the child object having an event table derived from the parent event table and having the capability of running independently of the parent object.

Abstract: A data processing system is programmed for automatically resizing a table to preserve its original appearance. The table is resized when a cell size changes or when an explicit request from the user is received. The resizing seeks to preserve the relative dimensions of cells in the table as much as possible. The resizing occurs automatically without user intervention. The table may be part of a publication in a desktop publishing system.

Abstract: In a data processing system in which data is entered and validated, a method for performing edit procedures, according to which edit procedures are associated with input attributes via a table. The edit procedures are applied in a predetermined, yet modifiable order.

Abstract: A debugger is used in an environment of optimized compiling to track both user-defined and synthesized variables so that the values of these variables at selected programmer counter addresses can be either determined or set. The tracking is primarily accomplished by the generation of various interrelated tables including a Type Scope Table, a Name Space Table, an Expression Table, a Location Range Table and a Variable Table. These tables define the existence of variables at defined program counter ranges and provide the algebraic definitions for the synthesized variables. A programmer can efficiently debug a program produced with optimized compiling through the operations of determining variable values and setting variable values.

Abstract: Information on GDMO managed objects, including class hierarchy and the name binding templates, is compiled into a naming table. This naming table is built from an inheritance table and the name binding template information. The inheritance table indicates the inheritance hierarchy of the managed object classes. The compiler builds the inheritance table as a square matrix with a row and column for each class, and the classes arranged in an ordered list from highest to lowest in hierarchy. The compiler enters a one at each position in the inheritance table to indicate that the managed object class in the row inherits from the managed class in the column. With the inheritance table as a ready reference, the compiler builds the naming table from the name binding templates available as listed in the GDMO source files. The naming table is a square matrix identical to the inheritance table except the entries in the naming table are not ones and zeros. Instead, entries in the naming table are lists of name binding templates that may be used to instantiate a managed object instance in the row class under a managed object instance in the column class.

Abstract: The present invention provides the ability to alter data definitions in a Database Management System (DBMS). The present invention provides the ability to maintain DBMS and application catalogs. Alterations can be made to the an application catalog, and the changes propagated to the DBMS catalog based on the differences between like information in the application and DBMS catalogs as identified by the present invention. The present invention provides the ability to test for data loss. That is, the present invention examines the requested alteration and the data that will be affected by the alteration to determine whether or not the alteration will result in the loss of data. If loss of data is possible, alerts can be generated to determine whether or not to proceed with the alterations. The present invention provides two techniques to perform the alterations depending on the ability of the DBMS to perform an alter on the original table without using an intermediate table (i.e., a native alter), or performing the alterations using an intermediate table for a DBMS with limited native alter capabilities.

Abstract: A shared object is created which is copied to all system nodes requiring access to the object and a used-by table is created identifying the nodes holding a copy of the object. When the object is updated by operations at one of the nodes then the copies identified by the used-by table are also updated.

Abstract: Many researchers have reported that using Boolean decision diagrams (BDDs) greatly increases the size of hardware designs that can be formally verified automatically. Our own experience with automatic verification of high-level aspects of hardware design, such as protocols for cache coherence and communications, contradicts previous results; in fact, BDDs have been substantially inferior to brute-force algorithms that store states explicitly in a table.

Abstract: PURPOSE:To completely and surely protect security by performing the access control of a document file provided in a server node in the unit of a user and the unit of an area in a document. CONSTITUTION:A server node 101 of a host center in a block A is provided with a document file 102 to be managed at the host center. A server node 103 in a block B is also provided with a document file 104. A user managing table and a document managing table are incorporated in the document file 104, and the access right for each of read, update and print is set in the unit of the user and a prescribed area in the document. When document access requests are received from client nodes 105, 106 and 107, the server node 103 judges whether the user requesting the access can access the area in the document requested with the access or not by collating the user managing table and the document managing table. Other server nodes 108 and 113 are similarly operated as well.

Abstract: An image forming apparatus has an image reading and correcting device capable of reading a document including a table, identifying the table (guideline) from the document correcting the table, and then outputting an image with the corrected table. The apparatus can form corrected images in a table included in a document image, change the magnification ratio of the corrected table to the proper size and select the proper paper size for output.

Abstract: Disclosed is a system and method for applying structured query language on user application files not conforming to the definition of a base relation of a relational database management system. A relational database management system has a runtime supervisor and a data manager. For the use of the data manager a plurality of library procedures generalized for manipulation of user application files are provided installed with the database management system. Responsive to user selection, a class for user application files is defined by naming members of a set of the library procedures for use with member application files of the class and by naming the class. Further responsive to user selection, column definitions on an application file within the class are made to create a user defined table. The user defined table corresponds to a specified user application file and to the definition. To create a class of user application files, a class control block is created in which the members of the set of library procedures are named for the class. For the user defined table, a user defined table control block is created in which the column definitions are stored. Both control blocks are accessible to the runtime supervisor for use with an access plan generated from SQL statements. Special structured query language statements are provided for user invocation to define a class of user application files and for providing column definitions, as well as for deleting a class control block and a user defined table control block.

Abstract: A video processing system comprises a processing unit, a VDU, and a look-up table. A user defined profile is displayable on the VDU and can be adjusted interactively by way of a stylus and touch tablet. Data representing the profile is stored in the look-up table. An input video clip is stored in digital form in a disc store and output video clip frames are generated in accordance with the user defined profile data. The system can be used for example to stretch or compress a video clip in time.

Abstract: A method, system and program is provided for reconfiguring a database by the manipulation of table and column icons on a user interactive graphical display interface to the database. In the interactive display, columns are represented by icons and tables are represented by icons which in turn represent combinations of columns. One or more of the table icons are decomposed into the column icons making up the tables. The column icons are displayed in pool areas on the display from which the user may interactively select column icons and combine such column icons to form a new table represented by a table icon.