Abstract: A system and method that manages scene graphs by data staging is contemplated. Data staging entails selectively loading only the portions of the scene graph that are currently needed or likely to be needed in the near future. Other objects in the scene graph that are not currently needed or likely to be needed may be replaced by pointers. The pointers may point to the location from which the objects may be accessed if necessary for a future frame. The replaced portions of the scene graph may be compressed and/or cached to a local memory device (e.g., a local array of read-write optical drives) capable of storing large amounts of data, with the pointers indicating where the objects are stored.

Abstract: A style identifier is associated with each of a plurality of media clips stored in a database, based on a subjective evaluation of various characteristics of each media clip by an expert. The style represented by the style identifier corresponds to an impression on the expert regarding various qualities of the media clip and is not constrained by the subject of the media clip. Media clips with which style identifiers are associated can be any form of digital media, such as clip art files, sound files, photographs, animation files, fonts, etc. Also associated with each media clip in the database is an absolute ranking value for each of a plurality of different attributes based on a subjective evaluation of each media clip by an expert. A user can search the database for media clips associated with a specific style identifier and can sort the media clips that were identified by a search, based upon the absolute ranking value for a selected attribute.

Abstract: A method for a bank to obtain an electronically-stored financial document is disclosed. The financial document includes a specific document parameter, such as a record date. The bank maintains the financial document in an off-site storage system when the record date is later than a pre-selected date and in an on-site storage system when the record date is earlier than or equal to the pre-selected date. The off-site storage system is remotely-located from the on-site storage system. The bank receives and inputs a request for the financial document from a client and compares the record date to the pre-selected date to determine if the record date is later than, earlier than, or equal to the pre-selected date. In processing the request, the bank utilizes a computer terminal, connected to the off-site and on-site storage systems through a processing unit, to access one of the storage systems in response to the comparison of the record date to the pre-selected date.

Abstract: A method of automatically generating and decommissioning mirrors of data contained in physical storage volumes in computer system is disclosed. Physical storage volumes and portions of volumes are monitored to collect usage statistics. Those usage statistics are then used to determine whether to mirror the volume or volume portion for greater efficiency. Likewise, the usage statistics are used to determine when mirrors already generated should be decommissioned due to lack of usage.

Abstract: The described arrangements and procedures dynamically generate a data polyarchy from information received from a data store (e.g., a directory or database). The data polyarchy represents multiple hierarchies of inter-object relationships based on values of attributes of the objects. These multiple hierarchies are generated and represented in a manner that is independent of object naming and predetermined hierarchical data structures.

Abstract: The described arrangements and procedures provide a directory schema with object classes that have flexible attributes. This means that attributes can be extended independent of modifications to the directory schema. Specifically, an object instance of a content class described in the directory schema is instantiated. The content class includes a flexible attribute having a data type. A property is assigned to the attribute. The property is any combination of an operational and data providing property. The property is independent of the attribute's data type. Thus, without modifying the directory schema, multiple instances of the same object class can have attributes that provide completely different data types and completely different data operations.

Abstract: The described arrangements and procedures provide for interfacing (e.g., managing, presenting, etc.) with complex and often elastic inter-object relationships between objects in a data polyarchy. Specifically, a schema is dynamically generated by a server to represent multiple hierarchies of inter-object relationships between objects in a data polyarchy. The schema indicates or lists each attribute or element of interest in the data polyarchy. The schema further indicates any of one or more dimensions of inter-object relationships within which objects that comprise at least a subset of the listed the elements of interest participate. Thus, the schema indicates how to interface with the data polyarchy, which represents multiple hierarchies of inter-object relationships based on the values of attributes of the represented objects.

Abstract: A web browser is configured to categorise book marked web pages. The browser runs a process that provides markers (CM1, 2, 3), which generate marker signals corresponding to individual categories for the content of the web pages. A user interface (21) is operable to allow the user to collocate a selection of the plurality of marker signals with network address data for the web page to be book marked, and also to allow the user to retrieve book marked web pages on the basis of the marker signals collocated to them.

Abstract: The present invention is a law retrieval apparatus composed of: data storage means including a constitution and statute database and a judicial case database, and including at least one database out of a meta-keyword database, a verb and object database, and an aid flow database; and a law retrieval server including, in correspondence with each database accumulated in the data storage means, at least one retrieval processing means out of meta-keyword retrieval processing means for reading a retrieval keyword associated with a non-retrieval keyword received from the meta-keyword database to perform retrieval processing, verb and object retrieval processing means for reading a retrieval keyword associated with a combination of the received verb and object from the verb and object database to perform retrieval processing, and aid flow retrieval processing means, when a retrieval pattern matches a pattern of an aid flowchart, for requesting additional information in accordance with the flowchart.

Abstract: A method and a system for downloading data from an auto-storage database are proposed, allowing a server to perform one-time data retrieval for transmitting data to terminal devices that request for data downloading. Upon receiving a connection request from a terminal device, the server stores an IP address of the terminal device into an IP address temporary storage area. Then, the server starts timing, and performs one-time data retrieval for retrieving data from a database if counted time reaches a preset time value pre-stored in the server. The retrieved data is transmitted by the server to the terminal device whose IP address is stored in the IP address temporary storage area, and then the terminal device requests for terminating the connection to the server for stopping data transmission. The foregoing method and system are advantageous of not to occupy too much network bandwidth even in operation of many terminal devices.

Abstract: A method and system are disclosed for processing data from a computer network to determine an occurrence of and characterize a particular activity associated with the computer network. In accordance with exemplary embodiments of the present invention, a collection of data is managed that corresponds to events associated with the computer network. At least one model is established to correlate an occurrence of a predetermined set of events. At least one hypothesis is formed, using the at least one model, that characterizes the particular activity associated with the computer network. The at least one hypothesis is evaluated using the at least one model. The steps of forming and evaluating are performed interactively with the step of managing to iteratively update the collection of data.

Abstract: A method and system for accessing and display of data records from large data sets. The method includes defining a plurality of boundaries to logically partition the large data set into a plurality of buckets in accordance with a predefined sort order. The sort order is based on data stored in at least two columns of a database table in which at least a base portion of each data record is stored. In response to a request to retrieve a data record or group of related records, such as all contacts having a given first and last name, a determination is made to which bucket the data record or at least a portion of group of related records are stored in. A query is then formulated to retrieve a subset of the large set of records from the database corresponding to data records contained in the bucket.

Abstract: The present in invention is directed to a checkpointing filesystem of a distributed-memory parallel supercomputer comprising a node that accesses user data on the filesystem, the filesystem comprising an interface that is associated with a disk for storing the user data. The checkpointing filesystem provides for taking and checkpoint of the filesystem and rolling back to a previously taken checkpoint, as well as for writing user data to and deleting user data from the checkpointing filesystem.

Abstract: A method of purging cached open files from a client-side delayed close list on a remote file system. The remote file system stores a unique file identifier for each cached open file which is independent of the cached file's namespace. In response to a delete or rename command of a remote target file, the remote file system obtains a target file identifier from the target file's server. The remote file system then compares the target file identifier with each of the cached file's unique file identifier. If a cached file's unique file identifier matches the target file identifier, the cached file is purged from the delayed close list.

Abstract: A system for processing a data file which includes versioned records of a fixed length, each record having one or more data fields and a reserve area for accommodating a change in the record format by creating a further field using a portion of the reserve area such that the length of the record is not changed. Additional records may be added to the record set to accommodate new or expanded data fields that exceed the fixed length of the records. Each record of the data file has a version number. The system includes an input vertical stack processor for transitioning previous versions of the records into a current version of the record for processing by an application processor. An output vertical stack processor creates outbound versioned records including the current version and all previous versions for each record of the data file.

Abstract: The invention disclosed herein enables a collection of computers and associated communications infrastructure to offer a new communications process which allows a requestor to receive configuration information of a computational device from a responder. The requester first sends query documents that contain queries for configuration information of a computational device to the responder; the responder automatically collects the answers for the queries and sends a response document that contains the configuration information of the computational device to the requestor. The queries are written in a formal descriptive language which is transparent, safe for network evaluation, and extensible, and the configuration reader of the responder can parse the queries and automatically invoke a set of standard inspectors to obtain the corresponding configuration information.

Abstract: A method includes receiving a dedication from a first user via a network and applying the dedication to a play list of a second user.

Abstract: Method and class tables and an algorithm are provided for use in determining if a called method in a message should be retrieved and executed or a method search should initiated. The method table includes method name, method identifier, method overwrite data, class overwrite data and method memory storage location associated with the method related to the overwrite data. The algorithm sets a plurality of variables to an entry in the class table and at least one method and class data referenced in a message, searches the method table and sets search variables to the class and method overwrite data and determines if a predetermined relationship exists between the method and class identifier associated with the class and method data in the message as well as data in one of method entries. The method memory storage location is read out once a method entry with the predetermined relationship is found.

Abstract: A method for selectively indexing a database (32) includes selecting a set of fields (156) in the database (32). The selected fields (156) are located in one column (152) of a table (150) in the database (32). The method also includes determining the total time required for reading data from the fields (156) during a selected time period if the fields (156) are indexed and determining the total time required for reading data from the fields (156) during the selected time period if the fields (156) are not indexed. The method further includes determining the total time required for writing data to the fields (156) during the selected time period if the fields (156) are indexed and determining the total time required for writing data to the fields (156) during the selected time period if the fields (156) are not indexed. In addition, the method includes evaluating the total times required for reading and writing data to the fields to determine whether the fields (156) should be indexed.

Abstract: A dispatch and notification system that can adjust resources to meet and accommodate real time changes in demand or load is disclosed. The system provides an automated assembly that includes provisions that provide an effective and low cost arrangement that notifies technicians of real time changes in their scheduled work. The system can determine if a real time intervention in a technician's schedule is necessary and can notify the technician in near real time of changes in assigned tasks.