Abstract: A computer-implemented method is provided for searching for files on the Internet. In one embodiment, the method may provide an application crawler that assembles and dynamically instantiates all components of a web page. The instantiated web application may then be analyzed to locate desired components on the web page. This may involve finding and analyzing all clickable items in the application, driving the web application by injecting events, and extracting information from the application and writing it to a file or database.

Abstract: A system for scoring a concept is provided. The system includes a data store, a graphical user interface, and a scoring component. The data store maintains values for categories, sub-area weighting factors, and area weighting factors. The graphical user interface allows a user to score a concept based on a plurality of categories of the concept. At least some of the categories are associated with one of a plurality of sub-areas, and at least one of the sub-areas is associated with one of a plurality of areas. The scoring component is operable based on the categories selected by the user to calculate a concept score using the values for the categories selected by the user. The scoring component also calculates the concept score using the sub-area weighting factors to weight the associated sub-areas, and also uses the area weighting factors to weight the associated areas.

Abstract: Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space.

Abstract: In order to improve the efficiency of execution of a program by prefetching data necessary to execute the program, a system is provided that causes a computer to execute a recursive query prior to a program being subjected to prefetching. This system detects from iterative processing in the program a query to generate a resultant table by selecting a record that satisfies a selection condition from a target table. The system generates an initial query to generate an initial table that includes values of variables that are set prior to starting the iterative processing in the program.

Abstract: The present invention provides techniques by which updates may be incorporated in database indexes without causing deadlocks of user transactions. In deferred-incorporate update, the updates are propagated to the index only at transaction commit time. A method of handling transactions including updates in a database management system comprises the steps of receiving an update to a database maintained by the database management system, the update operable to cause an index of the database to be modified, recording the update in a log, and receiving an indication that the transaction is to be committed and in response, incorporating the update from the log into an index of the database. The update may comprise an insert operation and/or a delete operation.

Abstract: An aid server (AS) comprises a processing module (PM) which stores a user identifier (UID) and an identifier (SID) of a stage of an application of the virtual office type, said identifiers being retrieved from a request sent by the terminal and designating an action need by the user. The request (REQt) is sent to a respective application implemented in at least one server (VOSi) which executes the needed action and develops an answer sent to the aid server. A suggestion module (AM) analyzes lists of previously needed user actions to suggest a list of actions which are associated with stage identifiers. A graphics module (GM) incorporates an aid including the suggested actions list into the answer (ANSt) which is sent to the user terminal in order that the user shall select another action from the list of suggested actions.

Abstract: A calculating unit of an integration server calculates an optimal processing sharing ratio for image format conversion processing between the integration server and each of a plurality of video accumulation servers. A processing unit of the integration server and each of the video accumulation servers perform image format conversion processing in a distributed manner based on the processing sharing ratio. An integrating unit of the integration server integrates the multimedia data subjected to the conversion processing by each of the video accumulation servers and the multimedia data subjected to the conversion processing by the processing unit.

Abstract: A system and method for maintaining checkpoints of a keyed data structure using a sequential log are provided. The system and method are built upon the idea of writing all updates to a keyed data structure in a physically sequential location. The system and method make use of a two-stage operation. In a first stage, various values of the same key are combined such that only the latest value in a given checkpoint interval is maintained for writing to persistent storage. In a second stage of the operation, a periodic write operation is performed to actually store the latest values for the key-value pairs to a persistent storage. All such updates to key-value pairs are written to the end of a sequential log. This minimizes the physical storage input/output (I/O) overhead for the write operations. Data structures are provided for identifying the most current entries in the sequential log for each key-value pair.

Abstract: A method for providing processed data definition documents (DDDs) or processed document object models (DOMs) for object oriented programming. The use of these processed data definitions simplifies the data structures and streamlines programming to access the data. A standard DDD/DOM has a hierarchical branched structure having a number of levels each with elements/nodes and attributes. The DDD is written in a platform independent markup language. An element/node is selected and its attributes are identified. All ‘children’ of the selected element/node are identified. The attributes of the selected element/node (parent) are then copied to each child for all children in the DDD/DOM. This is repeated for all elements/nodes in the DDD/DOM to result in a processed DDD/processed DOM which is now structured to allow program access to data in a more direct manner.

Abstract: A first embodiment of the invention provides a system that automatically classifies documents in a collection into clusters based on the similarities between documents, that automatically classifies new documents into the right clusters, and that may change the number or parameters of clusters under various circumstances. A second embodiment of the invention provides a technique for comparing two documents, in which a fingerprint or sketch of each document is computed. In particular, this embodiment of the invention uses a specific algorithm to compute the document's fingerprint, One embodiment uses a sentence in the document as a logical delimiter or window from which significant words are extracted and, thereafter, a hash is computed of all pair-wise permutations. Words are extracted based on their weight in the document, which can be computed using measures such as term frequency and the inverse document frequency.

Abstract: A method for transferring a copy of data stored at a source to a remote location. The method includes storing at the source sequence of sets of changes in the data stored at the source. The method transfers to a first one of a pair of storage volumes at the remote location the most recent pair of the stored sets of changes in the sequence of data stored at the source at a time prior to such transfer. The method subsequently transferring to a second one of the pair of storage volumes at the remote location the most recent pair of the stored sets of changes in the in the sequence of data stored at the source at a time prior to such subsequent transfer.