Abstract: Cartographic data is represented using polynomial splines. To improve representation accuracy and reduce storage requirements, a database storing data points (shape points and nodes) is converted into a database of spline control points. The spline control points are computed by fitting a polynomial spline to the geographic features using a least squares approximation. The control points associated with each geographic feature are stored in a computer-usable database. The geographic features can be displayed by computing the spline functions using the stored control points.

Abstract: In a content management system having a plurality of resource managers storing objects, a replica resource manager stores a replica of an object stored in one of the plurality of resource managers. A library server contains a resource manager table that defines the plurality of resource managers and includes availability information for each of those resource managers. When a client requests an object, the library server identifies a primary resource manager storing the object. The library server also determines a replica resource manager storing a replica of the object and returns information identifying that replica resource manager if the resource manager table indicates that the primary resource manager is unavailable and indicates that the replica resource manager is online and available. The client then retrieves the replica object without incurring a timeout delay waiting for the primary resource manager to respond to an access request.

Abstract: In one embodiment, the present invention is a method of changing information in a first database and a second database. The method includes receiving new information. The method also includes receiving a first record from the first database, the first record corresponding to the new information. The method further includes receiving a second record from the second database, the second record corresponding to the new information. The method also includes merging the new information, the first record, and the second record into a final record.

Abstract: Pursuant to receipt of a data modification command or statement, such as an Update command, it is determined which fields in a data structure, such as a UDT, computed column, indexed view, or index, for example, will be changed as a result of the command. Only those fields that are affected by the command will be changed. Thus, changes are propagated to only to those dependent data structures whose content is being modified. Tree representations are used to facilitate the determination as to whether a subfield in a hierarchy is changed.

Abstract: A web based application having non-file system structures is copied or archived by first initializing a file to store the web based application, including creation of a root directory within the file. Then, data directories are created under the root directory, and a number of storage data objects under the data directories are initialized for all non-file system structures of the web based application. Thereafter, the non-file system structures are copied and stored into the storage data objects. In embodiments where the web based application further includes files that are part of a file system, the files are stored as additional storage data objects under the root directory. Accordingly, database and operating system independence is achieved.

Abstract: Database updates are transmitted from a primary site to a remote site. The technique includes: destaging modified data to a first volume at the primary site for a current database update, performing a first point in time virtual copy of the modified data on the first volume to a second volume at the primary site, synchronizing the second volume with a third volume, at the remote site, by transmitting the modified data of the second volume to the third volume, and performing a second point in time virtual copy of the modified data on the third volume to a fourth volume, at the remote site. Database updates at the primary site are thus decoupled from the transmission of the database updates to the remote site, so the first volume remains accessible to a host at the primary site, and the fourth volume remains accessible to a host at the remote site.

Abstract: A method of allocation a computer to service a request for a data set in a system having a plurality of computers. The method is implemented on a neural network having only an input layer having input nodes and an output layer having output nodes, where each output node is associated with a specific computer. Connecting the input nodes to the output nodes are weights w(j,k). The method includes the steps of receiving a request for data set “I” and inputting to the input layer a vector R(I) dependent upon the number of requests for the requested data over a predetermined period of time and selecting a computer assignment associated with of one of the output nodes to service the data request, where the output node selected is associated with a specific weight selected to minimize a predetermined metric measuring the distance between the vector entry R(I) and the weights(I,k).

Abstract: A method, computer program product and system that enables dynamic determination of device attributes and dynamic configuration of device drivers for storage devices in a heterogeneous storage environment. Attributes of a device are dynamically determined by an application program, and those attributes are used by the application program to configure the device driver. The application program and the storage device being configured remain operational during the reconfiguration process.

Abstract: User's interests can be explicitly determined via keywords that the user specifies, and/or are implicitly constructed from user browsing and reading activity. User interests may be expressed as an interest profile. Conceptual keywords related to user interests are selected by combining spreading activation and word co-occurrence, by latent semantic analysis, or other methods. One embodiment automatically highlights sentences and other information that contain conceptual keywords related to user interests. Highlights can be activated when the user directly performs a keyword search or index search, or the invention can generate information reflecting user interests, apply it to the text, and generate and display highlights. One embodiment includes an algorithm for computing a conceptual keyword vector through an iterative spreading activation process also employing word co-occurrence. A conceptual index of the text may be created and then combined with conceptual highlighting.

Abstract: A computer-implemented method, apparatus, and computer-usable program code to generate unique identifiers for a logically partitioned and/or virtualized data processing system. A number of computing entities supported by the data processing system are identified to form a number of identified entities. A set of unique identifiers is generated based upon the number of identified entities. A unique identifier from the set of unique identifiers is assigned to a logical computing entity during operation of the data processing system.

Abstract: A computer system executing a method for tracking custom computer application development profiles in a data processing system comprising a first, second and third database tool connected to each other; a data bank connected to each database tool; and a security and authorization interface connected to the data processing system. The first database tool, or security and authorization profile change request database, comprises a first set of protocols which create and edit the profiles, and allows requestors an ability to view the documented progress of queries of the profiles. The second database tool, or profile requirement worksheet, comprises a second set of protocols which gather requirements of the profiles and identify the data. The third database tool, or Profile Matrix, comprises a third set of protocols which track modifications of the profiles and allows tracking capability of the tasks required to gather and implement changes to the profiles.

Abstract: Disclosed is a method and apparatus for operating a search system for searching a search space containing domains each representing a collection of related documents. The method includes establishing a domain characterization model (DCM) that includes a DCM index containing keywords and, for each keyword, an identification of a domain where the keyword is found. In response to an original search query, the method forms one or a plurality of enhanced search queries in accordance with the DCM for searching a plurality of domains. Each enhanced search query is formed for searching a particular targeted domain and contains the original search query and at least one keyword associated with the particular domain. The search results are clustered and are displayed so as to be organized by the domains that were searched. The top search results returned in response to each enhanced search query belong to one of the targeted domains.

Abstract: A method, system, computer system and computer program product to synchronize data and a snapshot of the data taken at a given point in time. Persistent data change maps are used to track changes made to data after a snapshot of the data is taken. Changes to the data are tracked using a persistent accumulator map, and changes to the data with respect to a second set of data are tracked using a persistent volume map. The persistent accumulator map is updated with each update of the data. Persistent volume maps are updated when a subsequent snapshot of the data is taken. Only changes to the data made after the snapshot was taken are applied to synchronize the snapshot with the data so that all of the data is not copied. Snapshots can be located in a physically separate location from the data itself.

Abstract: To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence.

Abstract: Methods, apparatus and systems to generate from a set of training documents a set of training data and a set of features for a taxonomy of categories. In this generated taxonomy the degree of feature overlap among categories is minimized in order to optimize use with a machine-based categorizer. However, the categories still make sense to a human because a human makes the decisions regarding category definitions. In an example embodiment, for each category, a plurality of training documents selected using Web search engines is generated, the documents winnowed to produce a more refined set of training documents, and a set of features highly differentiating for that category within a set of categories (a supercategory) extracted. This set of training documents or differentiating features is used as input to a categorizer, which determines for a plurality of test documents the plurality of categories to which they best belong.

Abstract: A data compression apparatus includes a characterizing point extracting part which extracts data expressing characterizing points included in a plurality of data showing a result of carrying out simulation a quantized data generating part which generates quantized data obtained by quantizing data except for data expressing characterizing points, and a file number converting part which converts the same types of quantized data including in the quantized data, into a relating file number. During data compression, data except for the characterizing points is compressed. If the same quantized data is included at the same address location in the previously-compressed file, the quantized data is replaced with the file number of the previous compression file, thereby compressing data at high efficiency.

Abstract: A system for automatically switching a computer to a password protected screen saver mode when a computer user leaves the proximity of the computer. The system includes a proximity sensor that determines whether or not an individual is located proximate the computer. The proximity sensor interfaces with either the computer a bus bridge, a keyboard controller, a keyboard, or some another component of the computer to cause the computer to start executing a screen saver program responsive to an output signal from the proximity sensor. A variety of proximity sensors may be used, including ultrasound, infrared, or electromagnetic proximity sensors. A proximity sensor may also detect the presence of the computer user by detecting the weight of the user at a location proximate the computer.

Abstract: A computer implemented method for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set comprises storing data sets each including one or more attributes in a plurality of binary tree structures (1), each of said binary tree structures (1) with their nodes (2) representing the entity of one of the data attributes of the data sets in a sorted manner, receiving a query for searching and returning data sets according to query conditions in said given number and sorted by a sort attribute, accessing the binary tree structure (1) of said sort attribute, serially traversing the nodes (2) of said binary tree structure (1) according to the sort attribute, at each node (2) checking whether the data set associated to said node meets the query conditions and, if true, returning said data set, terminating said traversing when said given number of data sets is reached.

Abstract: A method embodied in a computer program product for combining first and second attribute sets each comprising at least one attribute and value pair by which a named attribute is assigned a value that comprises one of a end value and a further attribute set involves carrying out a merge operation that combines the attribute and value pairs of the first and second attribute sets according to their levels in respective attribute trees with conflicts arising between attributes having the same path in each tree being resolved, on a top-down basis, according to predetermined rules.

Abstract: A dynamic construct is associated with one or more operational parameters of one or more components of a storage management system, wherein a pointer to the construct is retained in metadata for the storage management system, the values of the construct are stored in a first repository separate from a second repository normally used to store the metadata for the storage management system. The value of the construct in the first repository is allowed to change dynamically at any point of time without affecting the metadata in the second repository. Thereafter, the value of the construct in the first repository is retrieved and used as the operational parameter, instead of a static value in the metadata in the second repository. This provides a level of indirection that allows the construct to be applied dynamically in the storage management system.