Abstract: Property modifiers stored on a computer-readable medium for formatting information associated with a computer file, such as an electronic document. Each property modifier includes a size field having information indicating the size of its property modifier argument and an index field having an index into a property information array. A program module can traverse a group of property modifiers by utilizing the information in the size field of the current property modifier to determine the location of the next property modifier. Formatting is applied to information of the computer file by using the index of each property modifier to access formatting information maintained in the property information array. Each property modifier can store encoded information corresponding to the type of object to receive formatting, the size of the property modifier's argument, and an index into the property information array associated with an executable computer program.

Abstract: A homogeneous execution environment operates within a heterogeneous client-server network. A client selects a server and transmits a procedure call with parameters. In response, the system dynamically and securely downloads code to a compute server; invokes a generic compute method; executes the code on the compute server; and returns the results to the calling client method, preserving the result on the compute server if requested. This technique is efficient in that it does not require multiple copies of code to be downloaded or compiled since server byte-codes can be executed on each of the different systems. The code can be compiled once and downloaded as needed to the various servers as byte-codes and then executed.

Abstract: A method and apparatus for determining an approximated solution to the partitioning of a two or greater dimensional array in an amount of time on the order of O(1). Given a desired maximum weight or a maximum number of partitions, an array of data is partitioned by determining a temporary division of the array of blocks such that each block has a weight of at least two times the desired maximum weight. Within each block, rectangles are determined which contain array elements greater than or equal to an arbitrary value corresponding to a guess at a maximum weight. From among these rectangles, a largest set of independent rectangles is determined, and partitions are defined based on the sides of the largest set of independent rectangles determined for each block. Select ones of the partitions may be deleted until a total number of defined partitions is equal to or less than a desired maximum number of partitions.

Abstract: A cleaner task for a computer system having a plurality of tasks for performing computing functions on objects is disclosed. References between objects form directed graphs. The cleaner task discovers all objects and starting points in the system. Each of the tasks in the system is adapted to indicate to the cleaner task the identity of any handle which has been displaced. The cleaner task defines a set of unused objects comprising initially all objects in the system. The cleaner task traverses the directed graphs commencing at the respective initial starting points of the graphs and removes from the set of unused objects the handle of each object encountered during traverse. The cleaner task then traverses all graphs for which the starting point is any handle which has been identified as displaced and, during traverse, removes the handle of each object encountered during traverse from the set of unused objects.

Abstract: A method of compressing a block of time series data involves sorting the data by variable name, separating the series of time values from the series of variable values, and performing data extraction and/or compression independently on the series of time values and on the series of variable values. The reduced volume of data is then written to a database. In a preferred embodiment, the time series of data represents data generated from a computer simulation of an integrated circuit. In order to efficiently compress the time series data, individual blocks of time series data representing a particular time range are sorted by variable name, with each variable name having associated time values and variable values. The time values and variable values are separated into two distinct data sets, and data compression is performed separately on the two distinct data sets. The compressed information related to each individual variable is then stored in individual variable blocks.

Abstract: A method and apparatus for processing user-submitted search information to permit a database to be searched regardless of the format and language of the user-submitted information. The user-submitted information is first categorized into one or more categories, where each category is a type of information such as a date, a proper name or a place. For each category pertaining to the user-submitted information, the search is refined by comparing the user-submitted information to a feature table containing specific data types corresponding to each category. From the results of any affirmative comparison with the feature table, a starting location within a corresponding search table is retrieved. The search is further refined by comparing the user-submitted information to the entries of the search table beginning at the starting location. From the results of any affirmative comparison with the search table entries a database address is obtained which is used to obtain a database entry sought after by the user.

Abstract: A computer-implemented method for eliminating synchronization between sweep and allocate in respect of a newly created object in a concurrent garbage collector for a heap implemented in shared memory having mark and sweep phases. In a first collection cycle, a first attribute is associated with objects believed to be reachable and a second attribute is associated with objects believed to be unreachable, whilst for each successive collection cycle, the roles of the first and second attributes are exchanged. In accordance with conventional mark-sweep garbage collectors, the attribute is a color: usually Black and White for objects which are believed to be reachable and unreachable, respectively. Exchanging the colors for each collection cycle eliminates the overhead in synchronizing the color marking of a new object depending on whether it is located in an area of the heap that has already been swept or has yet to be swept.

Abstract: Recording transactions using a chronological list superimposed on an indexed list. A transaction log of transaction entries is maintained as a data structure logically organized as a chronological list superimposed on an indexed list. In one aspect of the invention, the transaction log is implemented in an element of a telecommunications network. In another aspect of the invention, the transaction log is implemented in a computer system. Preferably, each transaction entry includes a transaction identifier field, a time stamp field, a chronological list pointer field and an indexed list pointer field. A first chronological list pointer points to the oldest transaction entry in the transaction log and a last chronological list pointer points to the latest transaction entry in the transaction log. The chronological list pointer field of a transaction entry points to the next oldest transaction entry. The indexed list includes a number of indexed list entry pointers.

Abstract: A method and system are disclosed for efficiently storing and viewing data in a database. Data is stored in a nested data model which includes a plurality of nodes. A plurality of edges connect the plurality of nodes. Each edge has a unique edge name. A plurality of instances of data objects are associated with the nested data model. Each instance is associated with one of the edges such that the instance is also associated with that edge's name. An instance ordinal is associated with each instance which represents the number of times the edge associated with each instance is encountered during a traversal of the nested data model. The data stored utilizing the nested data model is accessed utilizing the instance ordinal and edge name associated with each of the plurality of instances, such that the data is accessed as being flat without flattening the nested data model.

Abstract: A system and method for interfacing index based and iterator based file management routines. In general, the disclosed system maintains an iterator cache having multiple iterators. Each active iterator is associated with a most recently used directory entry. Upon receiving an index based request, the iterator closest to the index based request is identified. If the index based request is closer to the top of the directory than it is to the closest active iterator, the directory entries are sequentially examined beginning at the top of the directory with the first entry. Otherwise, the system determines whether the index based request is located above or below the closest iterator. If the index based request is above the closest iterator, the system steps backward beginning with the directory entry associated with the closest iterator until the directory entry associated with the index based request is located.

Abstract: Methods, systems and computer program products are provided for managing shared data elements among a plurality of different client processes in a network environment. Shared data elements are associated with a Flow. A Flow is a logical stream of data that is only transmitted to a client process that explicitly subscribes for updates from the Flow. Update requests for the shared data elements are transmitted from client processes along the Flow so as to request the receipt of update notifications along the Flow. Update notifications are also transmitted about the shared data elements to the client processes along the Flow which have requested update notifications. Content of the shared data elements is, thereby, delivered to applications executing within said at least one client process which have requested updates of the shared data elements.

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: An ultrasound image information archiving system is provided for storing a reference copy of ultrasound image information. The system comprises a primary storage device, a secondary storage device, and control means for retrieving ultrasound image information, creating a reference copy of the ultrasound image information, and storing the reference copy in the secondary storage device. The system can be used in a method for storing a reference copy of ultrasound image information in which ultrasound image information is retrieved from a primary storage device and a reference copy of ultrasound image information is created and then stored in a secondary storage device. The system can also be used with a more general ultrasound image information archiving method.

Abstract: A method for processing a search query uses the results of a search performed on a high quality, controlled database to assess the relevance of documents retrieved from a search of an uncontrolled public database having documents of highly variable quality. The method includes the steps of parsing the search query and then searching the authoritative database to generate authoritative database results. The search query is also used to search the public database, thereby generating public database results. The quality or relevance of the public database results are then quantified on the basis of the authoritative database results, thereby generating a quality index. The results from both the authoritative and the public databases are then ranked on the basis of this quality index.

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: The present application discloses a system of software distribution in computer manufacturing which manages and distributes software from release by a software engineering group to installation at a remote manufacturing site or testing facility. The distribution system disclosed seeks to overcome the deficiencies of present software distribution systems. In overcoming these deficiencies, the distribution system disclosed contains several innovative features.

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: 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 retrieval apparatus is capable of simultaneously executing keyword retrieval and semantic retrieval of information.

Abstract: A computer system is used for managing product knowledge related to products offered for sale by a selling entity. The computer system includes a memory arrangement with at least one processing unit being coupled to the memory arrangement. The computing system defines a data model to describe relationships between data categories. A data instance is input to the computer system that corresponds to one or more of the data categories. The data instance represents at least part of the product knowledge. The computer system can also create a user-defined relationship item for the data instance and present the product knowledge to a user of the system in a manner established by the data model and the user-defined relationship. The product knowledge that is presented by the computing system includes information that corresponds to the data instance.