Abstract: Methods, apparatus, and programming recorded in machine readable memory are provided for the index, search and retrieval of objects on a global network. This inventive system embeds a distributed index in a routing layer to enable fast search. The method provides dynamic insertion, lookup, retrieval, and deletion of participating nodes, objects and associated metadata in a completely decentralized fashion. Nodes can dynamically join and leave the network. This infrastructure can be applied to content networks for publishing, searching, downloading, and streaming.

Abstract: A system and method in accordance with the present invention provides for replication in a content management system. Replication is provided by utilizing the library server to track the objects to be replicated within the system. The replication is accomplished by adding two tables to the library server, a copies table and replicate table. The copies tables includes three new parts flags. A first flag identifies an ending as a copied part. A second flag identifies that other copies of this part exist. Finally a third flag identifies that a part is not yet available.

Abstract: A method and apparatus for storing, updating, adding, deleting, and locating file system objects on a WORM storage medium, wherein information can be written to, but not erased from, the storage medium. The WORM storage medium has a writeable area that includes a system area and a data area. The system area includes system information regarding the file system objects on the storage medium. A system sector is written starting at one end of the system area, while the content of the file system objects is written in the data area starting at another end of the writeable area. When a change is made to the file system objects in the writeable area, an updated system sector is generated that replaces the previous file system information for those modified file system objects. Since the previous system sector is not erasable, the updated system sector is written in a location in the system area where it will be read before any previous system sectors.

Abstract: The present invention is directed to an intelligent media router (IMR) for processing media that has been either natively created as data or has been digitized from another source. The IMR comprises a plurality of modules or engines that are interconnected in a trusted manner. The IMR can be utilized by an end-to-end system having an encoder, a system server, and a plurality of end clients. In addition, an IMR can be developed to be utilized with an integrated system to allow third party imaging systems and software to interface with the IMR. In addition, the IMR modules are designed to be able to communicate with other IMR modules in a trusted relationship. This trusted communication between the IMR modules shares digitized (data) media and routes, rights, and profiles within the IMR. The IMR looks at digitized (data) media at the digital media object (DMO) level and can perform route functions on a set of, or all DMOs that are sourced to or within the IMR.

Abstract: A system and method for managing a manufacturing processing operation by integrating one or more data retrieval systems with a user station. Data stored on one or more data retrieval systems is communicatively interfaced with the user station. The user stations controls one or more manufacturing processing operation in a manufacturing environment. The interfaced data is displayed on the user station to assist an operator that monitors or controls the user station in making changes in the manufacturing processing operation.

Abstract: A computer-based method for compressing varying-length columns of a non-leaf page high key generated during splitting of an index tree leaf page from a key pair including a last key of a splitting leaf page and a first key of a corresponding new leaf page. The method performs a logical comparison of the key pair by comparing each key pair corresponding columns' data with padding considered as insignificant. In a logically equal key pair with equal-length columns, the high key field will have the entire column data, and for unequal-length columns it will have column data of the shorter column length +1 byte and will have all remaining varying-length columns without trailing padding data. In a logically unequal key pair, the high key will have all columns up to and including a first differing byte, wherein the stored varying-length columns are stored without trailing padding data.

Abstract: A method, system and program product for populating a user profile based on existing user profiles is provided. Specifically, under the present invention, base characteristics are designated for a new user profile. Based on the designated characteristics, the new user profile is associated with a particular Vornoi cluster region of existing user profiles. Once associated, the new user profile is populated with defined characteristics from the existing user profiles within the particular cluster region. After population, viewing recommendations can be made.

Abstract: A digest or summary is generated from an athletic footage containing a predetermined set of metadata. The metadata includes information on time, score and event types. Scenes are selected from the athletic footage based upon the metadata, and the scenes are significant in a flow of the game or the athletic competition. Some scenes are also selected based upon the assumption that a certain failed scoring attempt is succeeded. The above described selection scheme allows the extraction of scenes that are meaningful and significant in summarizing an athletic footage.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to access an existing proprietary data base management system having a dialog-based request format. The user request is received by a web server from the world wide web and converted into one or more sequenced data base management commands. These data base management commands are sequentially presented to the data base management system and the intermediate products stored. After all of the sequenced data base management commands have been executed, the web server combines the intermediate products to form a complete response to the initial user request. The response is transferred to the user over the world wide web. A number of reports are automatically generated by said data base management system in response to a signal, such as a change of date or a particular time. The automatically generated reports may be spooled by the repository for future electronic delivery to the appropriate user terminals.

Abstract: A system and method for monitoring unauthorized changes to a database and providing a notification to a user according to preferences set by the user. The user can select one or more data entries within a database to be monitored. When these data entries are changed, a notification is sent to the user.

Abstract: According to the present invention, techniques for performing security functions in computer storage subsystems in order to prevent illegal access by the host computers according to logical unit (LU) identity are provided. In representative embodiments management tables can be used to disclose the Logical Unit in the storage subsystem to the host computers in accordance with the users operational needs. In a specific embodiment, accessibility to a storage subsystem resource can be decided when an Inquiry Command is received, providing systems and apparatus wherein there is no further need to repeatedly determine accessibility for subsequent accesses to the Logical Unit. Many such embodiments can maintain relatively high performance, while providing robust security for each LU.

Abstract: A visualization system and method for visualization of network data, which is data that represents elements and links between elements. The network data is converted into a data structure, which represents a grid arrangement of the elements, where each element is placed on an individual grid position of a lattice. The data structure is suitable for use by a graphics display. The visualization tool comprises a processing unit that generates an initial data structure which represents an initial grid arrangement of the elements. It then assigns a global value to this initial grid arrangement and employs a gradient method for converting the initial grid arrangement into another grid arrangement which has a decreased or an increased global value.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to access an existing proprietary data base management system having a dialog-based request format. The create empty data set user request is received by a web server from the world wide web. The security profile is validated to establish permission for honoring the service request. The Cool ICE engine is called to implement the create data set method. An appropriate area within the repository is located and the new empty data set is created in accordance with the parameters received.

Abstract: Methods and systems for enhancing the security of data during input and output on a client computer system are provided to prevent attempts by unauthorized code to access, intercept, and/or modify data. Example embodiments provide a plurality of obfuscation techniques and security enhanced drivers that use these obfuscation techniques to prohibit unauthorized viewing/receiving of valid data. When the drivers are used together with the various obfuscation techniques, the security enhanced drivers provide mechanisms for “scheduling” the content of the storage areas used to store the data so that valid data is not available to unauthorized recipients. When unauthorized recipients attempt to access the “data,” they perceive or receive obfuscated data. The obfuscation techniques described include “copy-in,” “replace and restore,” and “in-place replacement” de-obfuscation/re-obfuscation techniques.

Abstract: A method is disclosed for removing redundancies from a list of data structures. A list of data structures is sorted by first attribute into sub-lists having a common first attribute. Each of these sub-lists is sorted by second attribute into sub-lists having a common first attribute and a common second attribute. Each of these sub-lists is combined into a single combined data structure that includes a third attribute set. Each third attribute set includes third attributes of the data structures in the sub-list from which the combined data structure including that set was formed.

Abstract: A database contains an application program operative with data stored in a records data set (RDS) and a categories data set (CDS). The RDS contains an arbitrarily organized series of RDS entries, each having at least one data field configured for representing data. The CDS contains CDS entries configured for defining the schematic data types and data relationships of the RDS entries. Data is thus isolated from its definition, thereby permitting the underlying schematic form of the database to be changed based on modifications in the CDS, without requiring any actual changes to the schematic structure of the RDS or the underlying database. By virtue of this same isolation, it is also possible to reduce data redundancy with varying levels of granularity and create an object-oriented data model.

Abstract: A method of thematically classifying documents, in particular for making up or updating thematic databases (42) for a search engine, includes the steps of selecting documents representative of each theme, identifying within the selected documents, elements that are characteristic of each theme, allocating a coefficient (R) to each identified element, said coefficient being representative of the relevance of said element relative to the corresponding theme, and for each document (50) for classification, identifying said elements characteristic of each theme contained in the document and, for each theme corresponding thereto, using the coefficients allocated to said elements to calculate the value of a characteristic representative of the relevance of the theme for the document (50), in order to decide whether or not the document relates to the theme.

Abstract: An information gathering facility is provided which includes a dictionary file data structure having a plurality of inquiries for ascertaining state information on a computer system. The plurality of inquiries are organized into at least one subject group having multiple records of inquiry. These multiple records of inquiry are processed such that if a condition of one record is satisfied then processing terminates for the group, otherwise processing proceeds to a next record and continues until a condition of one of the records of the group is satisfied or until all records have been processed. One or more of the plurality of inquiries comprise instructions which output a result when a condition of the instruction is satisfied. Thus, the state information to be output is defined by the results contained within the instructions of the dictionary file itself.

Abstract: In a computer system that uses a generational garbage collector in which objects are promoted from a “young” generation to an “old” generation, a compiler output designates certain dynamic-allocation instructions as being ones whose resultant allocated objects will be considered “pinned.” The compiler associates with such allocation instructions respective segments of the code following the instructions and objects allocated within one of those segments are considered to remain pinned until program execution passes beyond that segment. The garbage collector refrains from promoting any pinned object, and as a consequence, an instruction that writes a reference into an object field while that object is pinned does not need to be accompanied by a write barrier.

Abstract: A method and system for performing real-time database update transactions with disconnected database clients includes a disconnected client server (DCS) and disconnected client extensions (DCE). The DCS formats the database cell, its key, any associated database cells, and a timestamp and sends them to a disconnected database client by email. The timestamp indicates the last time the database cell or associated database cells was changed. The disconnected database client sends a reply email with the update of the database cell and the timestamp. Upon receipt of the reply email, the DCS compares the received timestamp to a current timestamp for the database cell. If they match, then the database cell is updated according to the received update. If they do not match, then the update is based on outdated information and is rejected. In this manner, reliable real-time update transactions are provided between a disconnected database client and the database.