Abstract: A technique, system, and computer program for quickly and efficiently navigating through a comparison of different versions of a file. An abstract representation of the detected differences is provided in a separate navigation window or pane. This abstract representation is shown as one or more bars, which are formatted using one color for segments that are the same and a different color for those segments that are different. This allows the user to see, at a high level, the relative size of differences, the relative position of the differences, and how the differences are distributed throughout the files. The user can navigate through the differences using navigation controls that are synchronized between the navigation window (or pane) and a file comparison window. A novel use of hover help is defined. The navigation window and controls can be used with comparisons of any type of ordered data, such as text, audio, video, etc., and with comparisons of any number of versions of a file.

Abstract: A framework for answering Lightweight Directory Access Protocol (LDAP) queries from previously cached queries includes a proxy server configured to receive client directory queries. The proxy server maintains a cache of data (entries) and semantic information associated with a query. In response to a query received from client, the proxy invokes a query containment procedure which uses the semantics of the incoming and stored queries to determine whether the query can be answered from cached queries. The proxy answers queries from the local cache when possible, and for other queries it sends the request to a directory server. The semantics of the new query and the resulting data (entries) are added to the cache. The method and apparatus can be used for positive conjunctive queries for answering equality, range and substring queries.

Abstract: Improved method, data structure and computer readable medium for searching for digital information files. Files referenced by URLs may be quickly located by finding a minimum unique prefix for the desired URL, breaking the prefix into substrings, and traversing a trie data structure to find indices to another trie data structure that will yield the physical location of the stored digital information file. A node data structure may be used to construct the trie data structures, and may be compressed to allow the tries to occupy less memory, thus allowing the tries to be maintained in memory and less access to storage devices. The result is faster retrieval times for digital information files.

Abstract: A data processing system is provided for storing and managing multiple data entries. The data processing system employs a data structure which allows the storage and management of a vast number of interrelated data entries the interrelations of which change over time. The data structure reflects such changing interrelations over time and allows the querying and extracting of data entries on the basis of their interrelations as they were or are defined at any desired point in time.

Abstract: A computer implemented method for updating alt attribute values in a data set. The application includes a file server for storing one or more file sets. The server is communicatively coupled to an attribute engine. The attribute engine is also communicatively coupled to an attribute database, wherein image data from the file sets are stored. The attribute database is communicatively coupled to a browser via an attribute portal, wherein an editor can edit alt attribute text values. The attribute engine updates the image data contained in the attribute database, based upon data of images in the file set. The attribute engine also updates the file set based upon the alt attribute values in the attribute database. Thus an editor can add or change alt attribute values in the file set via a browser.

Abstract: In a distributed peer-to-peer data processing system, consistency and access to a global resource maintained on one of the nodes is provided through the use of global incarnation numbers, local incarnation numbers, and proposed incarnation numbers. Internode traffic is kept to a minimum while still maintaining consistency. The system and method of the present invention are particularly useful at start-up and data change processing points in time.

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: Data is stored in a persistent, user-defined, shareable in-memory database table. When a search request specifying a number of results to be retrieved from a desired starting point is received, the data is located in an in-memory database table and the specified number of results from the desired starting point are returned. Stored descriptors corresponding to search terms in the search request are retrieved and mapped to location information in a header area of the in-memory database table. Using the location information, data is retrieved either from a data area of the in-memory database table or from a relational data store. The data that is accessed via the in-memory database table is updated upon receiving an update request and may either be data in a data area of the in-memory database table or may be relational data.

Abstract: In an authorization system, access is defined by rules, roles and active rules. These definitions are preprocessed to form a bit array for each of a plurality of roles representing the rules that apply to that role. Once a bit array is calculated or generated for a given user based on that user's roles, the user bit array can be cached so that it need not be regenerated for each time the user requests access to resources. The rules used can either be role-based rules or active rules.

Abstract: A computer system for updating graphic-oriented project management scheduling charts (GOPMSCs) includes an Update Module for linking chart data elements in the GOPMSCs to multiple data elements in one or more data sources, selecting one of the multiple data elements for each chart data element for use in generating updated versions of the GOPMSCs, and generating updated versions of the GOPMSCs using the selected data elements. The chart data elements are linked to the multiple data elements using maps containing information linking the chart data elements to the multiple data elements and information identifying one of the multiple data elements to be used when generating updated versions of the GOPMSCs. The computer system generates updated versions of the GOPMSCs by reading the maps, selecting one of the multiple data elements linked to each chart data element, and generating updated versions of the GOPMSCs using the selected data elements.

Abstract: Data processing is performed by multiple “plug-in” processing modules controlled by an execution management framework. The framework includes an order determining mechanism that controls the plug-in processing modules to execute in series, or in parallel, to speed processing by the plug-ins while accommodating computational dependencies. In one embodiment, the order determining mechanism can include a dependency counter associated with each plug-in processing module for determining an operational sequence position of the associated plug-in processing module, and means for conditioning the count value (e.g., decrementing or incrementing the count value) in response to operation of another of the plug-in processing modules on whose output the associated plug-in processing module depends, so that the associated plug-in processing module will commence operation in the proper order when the count value reaches a predetermined value.

Abstract: A search engine system is provided for a portal site on the internet. The search engine system employs a regular search engine to make one-shot or demand searches for information entities which provide at least threshold matches to user queries. The search engine system also employs a collaborative/content-based filter to make continuing searches for information entities which match existing wire queries and are ranked and stored over time in user-accessible, system wires corresponding to the respective queries. A user feedback system provides collaborative feedback data for integration with content profile data in the operation of the collaborative/content-based filter. A query processor determines whether a demand search or a wire search is made for an input query.

Abstract: In accordance with methods and systems consistent with the present invention, a lease manager is provided for managing leases between clients and other network services. To use the lease manager, a client enters into a management lease with the lease manager, specifying an amount of time during which the lease manager can manage preexisting leases between the client and network services on behalf of the client. This management includes renewing the preexisting leases with the other network services. Further, the lease manager notifies the client when a lease between the lease manager and the client is near expiration. The lease manager also notifies the client of failed attempts to renew the preexisting leases, as well as the management lease, either with a network service or with the lease manager.

Abstract: A method of automatically identifying and setting the level of management access privilege that is given to any one network management system in a multiple management system environment, where network bandwidth and service types are provided by one or more service level agreements (SLAs) by monitoring multiple components of the network so as to identify the current status of multiple service level agreements; by determining the current scale and scope of the network; and by automatically adjusting a service level agreement based on the current scale and scope of the network in view of the status of the multiple service level agreements.

Abstract: A method and system for leasing storage locations in a distributed processing system is provided. Consistent with this method and system, a client requests access to storage locations for a period of time (lease period) from a server, such as the file system manager. Responsive to this request, the server invokes a lease period algorithm, which considers various factors to determine a lease period during which time the client may access the storage locations. After a lease is granted, the server sends an object to the client that advises the client of the lease period and that provides the client with behavior to modify the lease, like canceling the lease or renewing the lease. The server supports concurrent leases, exact leases, and leases for various types of access. After all leases to a storage location expire, the server reclaims the storage location.

Abstract: A method and computer program product for comparing documents includes segmenting a judgment matrix into a plurality of information sub-matrices where each submatrix has a plurality of classifications and a plurality of terms relevant to each classification; evaluating a relevance of each term of the plurality of terms with respect to each classification of each information submatrix of the information submatrices; calculating an information spectrum for a first document based upon at least some of the plurality of terms; calculating an information spectrum for a second document based upon at least some of the plurality of terms; and identifying the second document as relevant to the first document based upon a comparison of the calculated information spectrums.

Abstract: Updates made to a central database (3) or to another partially replicated database (23-1) are selectively propagated to a partially replicated database (23-2) if the owner of the partially replicated database (23-2) is deemed to have visibility to the data being updated. Visibility is determined by use of predetermined rules stored in a rules database. Stored rules are assessed against data content of various tables that make up a logical entity, known as a docking object that is being updated. The stored rules are assessed against data content of various tables that make up a docking object, not necessarily being the docking object that is being updated. The visibility rules of these related docking objects are recursively determined. Changes in visibility are determined to enable the central computer to direct the nodes to insert the docking object into its partially replicated database.

Abstract: A multimedia kiosk authoring system for use in developing and maintaining user interface screens for multimedia kiosk systems. The authoring system enables the user interface for each individual kiosk to be customized quickly and easily within wide limits of variation, yet subject to constraints adhering the resulting interface to good standards of aesthetics and user friendliness. The system may be used to provide custom interfaces expeditiously even for hundreds of kiosks presenting information from numerous independent information sources. The authoring system uses the methods of object oriented programming to define specialized object classes for instantiation on individual kiosk interface screens subject to pre-defined limitations on variability. Links are provided to an appropriate database for multimedia presentations on an interface screen of content bearing information from the information providers.

Abstract: A method and apparatus for providing plug-in media decoders. Embodiments provide a “plug-in” decoder architecture that allows software decoders to be transparently downloaded, along with media data. User applications are able to support new media types as long as the corresponding plug-in decoder is available with the media data. Persistent storage requirements are decreased because the downloaded decoder is transient, existing in application memory for the duration of execution of the user application. The architecture also supports use of plug-in decoders already installed in the user computer. One embodiment is implemented with object-based class files executed in a virtual machine to form a media application. A media data type is determined from incoming media data, and used to generate a class name for a corresponding codec (coder-decoder) object.

Abstract: The present invention is directed, in a general aspect, to a method of updating an addressee database in an incoming mail sorting apparatus comprising the steps of: a) providing the addressee database stored in memory associated with the mail sorting apparatus; b) providing a mailpiece to be read and sorted by the mail sorting apparatus; c) reading the mailpiece to determine whether the mailpiece is an update form; d) reading update information from the mailpiece if the mailpiece is an update form; e) updating addressee information as required by the update information on the update form. The method can be initiated by each individual employee using a readily available form and providing information manually or by using a software program resident on the employee's personal computer to generate the update form information. The method provides an easily accessible method of updating an addressee database that reduces database maintenance costs.