Abstract: A three-tier system is built up as: one or more client applications, one or more server applications, and one or more database systems. The server application provides a service that can be shared among multiple client applications. Server applications store their data in a database system. A client transparency mechanism and a server transparency mechanism are added. A database system on a clustered node is used for the database management. Server applications implement transactional behavior and the server side of the protocol so that the client applications may recover from server application and database system failures. The cluster application programming interface is used to determine whether, when, and if to retry. Information is stored in the database system so that the outcome of the transaction can be determined.

Abstract: A portable computer system manages data conveniently for a user. The system has a processor, a program storage device coupled to the processor, an input recognizer adapted to receive non-cursive handwritings from the user and to convert the handwriting to data, and a computer readable code embodied in the program storage device for storing and processing the data.

Abstract: A method for creating archives on removable mass storage media, comprising steps of: digitizing data to be archived into digitized archives; extracting record information representing details about the archives; storing the record information in archive directory files; and storing the digitized archives and archive directory files onto the removable mass storage media. Also described is a digital archive server for loading archives created by the method of the invention. The server reads the archive directory files and loads them into the database of the digital library.

Abstract: Managing a log stream of a computer system. An entry of a log stream, desired to be removed from the log stream, but not eligible for removal, is logically deleted. Logical deletion keeps the entry on the log stream and indicates that the entry can be removed from the log stream when it is eligible. When the entry is eligible, it is removed. If a desired entry remains at the tail of the log stream for a given period of time, thus not allowing the removal of one or more undesired entries, the desired entry is rewritten to the head of the log stream and deleted from the tail. Thereafter, other logically deleted entries eligible for deletion are removed from the log stream.

Abstract: Formatting information in a program module, particularly useful for word processing and similar text processing programs. A property information array stored in association with an executable program module contains formatting for applying to information in a document comprising a data structure and a property modifier structure. The data structure stores data elements corresponding to the information in the document to be formatted, e.g., a text file. The property modifier structure stores groups of data formatting property modifiers and their arguments that represent the appearance of the data elements, e.g., a character property, a paragraph property, a section property, etc. Each property modifier contains encoded format-related information and comprises an argument size field having information indicating the size of the property modifier argument and a unique identification field, i.e., an index into the property information array. A selected data element may be displayed, printed, etc.

Abstract: A computer system and method for storing and managing a database that has lambda-definable functions as its foundation. The database is a collection of nodes that are connected by a set of links, and further it is a directed acyclic graph constructed from the nodes and the links. There are two types of links. By ignoring one type of the links, the database can be viewed as a set of trees; and by ignoring another type of the links, the database can be viewed as another set of trees. The directed acyclic graph and the two sets of trees illustrate the dependent relationships among the data and provide means in manipulating the database. A node has a name for the purpose of identification; and a value that carries an unit of meanings of the database application. The value of a node is selected from a regular data type, user-defined data type, and lambda-definable functions. Managing lambda-definable functions allows a database to support infinite data with finite storage.

Abstract: A method for creating a table object made up of one or more columns, where the table object can be used as a programming interface or wrapper for an underlying table component is described. The table is made up of one or more column objects that can be used in other tables with minor alterations. The column objects are created to hold data of one type. This type can be a basic data type or a specialized graphical user interface type, allowing for great flexibility in creating table data structures for holding data of a wide variety. The table object is used to facilitate the use of an underlying table component, which may contain its own search engine. The table object acts as a wrapper for the table component allowing the application developer to use columns from other tables for use with a particular underlying table component without having to recreate or rewrite computer code for that particular underlying table component.

Abstract: A computer network (10) is provided that includes a server (14) with a database (28) and an object definition generator (33). The database (28) stores a plurality of objects. The object definition generator (33) receives user input identifying a selected one of the objects and generates output code (37) including an object definition for the selected object. A client (12) includes a first application (26) operable to utilize the database (28). A second application (32) utilizes the output code (37) to access the database (28). The object definition generator (33) provides an automated method for enabling the second application (32) to utilize objects stored in the database (28).

Abstract: In a distributed database system, at least one of the databases operates as a transaction manager and provides transparent commit coordination between an application program and other connected databases. The transaction manager incorporates a commit alteration procedure which enables selection of either a single phase commit protocol or a two phase commit protocol with respect to each database, during operation of the distributed system. The transaction manager establishes a commit protocol for each connected database; responds to a command from an application program by overriding a commit protocol previously established for a selected database and establishes another commit protocol for the selected database; performs a transaction and utilizes the another commit protocol in connection with the transaction; and upon completion of the transaction as evidenced by a successful commit action, enables establishment of another commit protocol.

Abstract: A method of packaging service logic programs for dissemination in a telecommunications network includes receiving a request to package a service logic program having a plurality of service independent blocks associated with a plurality of parameters. The service logic program is copied and parsed to automatically identify the parameters associated with the service logic program. The service independent blocks of the service logic program are stored in a packaging file in a specified sequence. The associated parameters are copied and then stored in the packaging file.

Abstract: A Web-based authentication system and method, the system comprising at least one Web client station, at least one Web server station and an authentication center. The Web client station is linked to a Web cloud, and provides selected biometric data of an individual who is using the Web client station. The Web server station is also linked to the Web cloud. The authentication center is linked to at least one of the Web client and Web server stations so as to receive the biometric data. The authentication center, having records of one or more enrolled individuals, provides for comparison of the provided data with selected records.

Abstract: A system and method for efficient document categorization are disclosed. In one embodiment, word length distribution information is used as a basis for categorization. Greater than 90% accuracy in classification may be achieved in, e.g., distinguishing newspaper articles from scientific journal articles. Word length distribution information may be developed without optical character recognition (OCR), permitting use of degraded document images.

Abstract: A device and method for accumulating, storing, and accessing information collectively held by a corporation of people is disclosed. The information is categorized into core subjects having many linked secondary topics having many linked tertiary details. The information also includes pointers and links to information stored elsewhere, for example the Internet. The information is stored as objects containing an answer to an inquiry, the associated links, and actions to be taken. The objects acts as navigational aids to the user without dictating the user's navigation through the information. The invention includes a feedback system that encourages users to provide their reactions to information on the system. Thus, over time, the system will accumulate the best information available to a corporation in the collective knowledge of its employees.

Abstract: In an object oriented computer system, a root set of object references includes object references stored in the computer system's registers, as well as object references stored in activation records in the program stack. Whenever a method is invoked, a corresponding activation record is stored on the program stack. The activation record includes the invocation address for the method called as well as parameters passed to the called method. A class loader, which loads object classes into memory, determines the locations of the object references in the activation records associated with each method in a loaded object class. A list of offset values for each method activation record is stored by the class loader in a hash table data structure at a location in the hash table data structure determined by hashing the unique invocation address assigned to the method.

Abstract: A portable computer terminal device. The terminal device includes data input means which is psychologically acceptable to physicians, lawyers and other professionals and includes a carrying case of unusually lightweight and compact construction. Data stored in the terminal device can be printed on multiple sheet business forms. The data can also be displayed by projecting a CRT light beam on a collapsible, high resolution screen carried in the terminal device.

Abstract: A microcomputer device contains a CPU with an arithmetic/logic unit and data/address registers on a single semiconductor integrated circuit having on-chip macrocode and microcode storage. A macrocode word is fetched from an on-chip ROM and stored in an instruction register in the CPU, then a sequence of microcode words is fetched from the microcode store based on this macrocode word. A check-code based on some function of all macrocode bits is stored in on-chip ROM upon manufacture. To test a device after fabrication is complete, a test program (resident in ROM or downloaded into on-chip RAM) is executed to address all bytes of macrocode and perform some cummulative function on it via the ALU to see if the same check-code is produced. If so, an output indicates a good unit.

Abstract: Digital processing of speech signals for compression/expansion pitch change is provided by writing and reading a ROM at different rates and controlling the discard/repeat segments of memory to be approximately integral multiples of the pitch period with means to track the pitch period as it is changing and modify the discard/repeat segments accordingly.

Abstract: A unique timing system is provided which allows for a user to program timing events with variable periods and edges from a fixed frequency clock, and having resolution greater than that of the fixed reference frequency. Delay elements, which are inherently expensive, inaccurate, and require repeated calibration, are minimized.

Abstract: A translating apparatus comprising a synonym display device for displaying synonyms related to a certain translated term in a translated sentence, and a replacing arrangement for replacing the certain translated term with an appropriate synonym selected among the synonyms displayed by the display device, whereby a more suitable translated term or terms can be selected through consultation of a dictionary contained in the apparatus.

Abstract: A method is described for simulating additional processors in a SIMD computer by dividing the memory associated with each processor into a plurality of sub-memories and then operating on each sub-memory in succession as if it were associated with a separate processor. Thus, a first instruction or set of instructions is applied to all the processors of the array to cause at least some processors to process data stored at a first location or locations in the first sub-memory. Thereafter, the same first instruction or set of instructions is applied to all the processors of the array to cause at least some processors to process data stored at the same first location in a second sub-memory. And so forth for each of the sub-memories. By operating a SIMD computer in this fashion, it is possible in effect to vary the number of processors in the array so as to provide the number of processors required for a problem.