Abstract: A computer-implemented method for recovering from continuous-data-protection blackouts may include identifying a continuous data protection system configured to copy each change made to a set of data. The computer-implemented method may also include identifying a set of changes made to the set of data but missed by the continuous data protection system. The computer-implemented method may further include identifying an alternate change-tracking system that tracks changes made to the set of data. The computer-implemented method may additionally include updating the continuous data protection system with the missed set of changes as tracked by the alternate change-tracking system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A system and method for comparing a query object and one or more of a set of database objects are provided. The method includes providing quantized representations of database objects. The database objects have each been transformed with a quantized embedding function which is the composition of a real-valued embedding function and a quantization function. The query object is transformed to a representation of the query object in a real-valued embedding space using the real-valued embedding function. Query-dependent estimated distance values are computed for the query object, based on the transformed query object and stored. A comparison (e.g., distance or similarity) measure between the query object and each of the quantized database object representations is computed based on the stored query-dependent estimated distance values. Data is output based on the comparison computation.

Abstract: A data set on a physical storage device is associated with an active bitmap and a persistent point-in-time image (PPI) exclusion bitmap, where each bit in the bitmaps is associated with a data block in the data set. The active bitmap and the PPI exclusion bitmap are used to determine which of the data blocks in the data set are to be included in a PPI of the data set.

Abstract: A method for hashing executable files may include identifying an executable file comprising non-variable executable content that contributes to the functionality of the executable file and does not vary among instances of the executable file. The method may also include identifying, within the executable file, non-executable content that does not contribute to the functionality of the executable file. The method may further include creating a normalized executable file by normalizing at least a portion of the non-executable content of the executable file without normalizing the non-variable executable content of the executable file. The method may include calculating a hash value that represents the normalized executable file. Various other methods, systems, and computer-readable media are also disclosed herein.

Abstract: A CMDB (configuration information management database) stores a CI (configuration item) and know-how separately. A CMDB data update management unit associates with each set of “property:value” stored in the CI with related know-how in the CMDB. The know-how stores a set of “property:value” common to a number of associated CIs.

Abstract: A covariance matrix associated for a set of spatial and/or temporal sub-portions of a media object is populated based on a lookup table of relative displacements and sums of covariance values generated from pairs of data elements in the media object. The lookup table is generated in linear time, providing an efficient method of generating the covariance matrix.

Abstract: A system for increasing search ranking of a community Website includes a link code application module residing on and executable from a digital medium, a link verification module residing on and executable from the digital medium, and a member feedback module residing on and executable from the digital medium for providing feedback about link quality and for distributing rewards to persons using the system.

Abstract: A computer readable medium having software instructions that, when executed, perform a method for preserving data stored in a file system with a plurality of files. The method involves determining whether storage capacity of the file system has reached a threshold level, wherein the threshold level is stored in at least one of a plurality of size-reducing policies, obtaining a criterion from the at least one size-reducing policy, identifying a subset of the plurality of files that match the criterion, accessing metadata of each of the identified subset of files, wherein the metadata of each of the identified subset of files comprises at least one option for reducing a size of the file, and performing a size-reducing action to reduce a size of each of the identified subset of files based on the option for reducing the size of each of the identified subset of files and the criterion.

Abstract: A system and method enabling the search for a three-dimensional virtual world object across the universe of virtual worlds by utilizing a two-step search process to first identify the object and second, to actively locate and generate a URI to all presently manifest instances of that object.

Abstract: A computer system for generating data structures for information retrieval of documents stored in a database. The computer system includes: a neighborhood patch generation system for defining patch of nodes having predetermined similarities in a hierarchy structure. The neighborhood patch generation subsystem includes a hierarchy generation subsystem for generating a hierarchy structure upon the document-keyword vectors and a patch definition subsystem. The computer system also comprises a cluster estimation subsystem for generating cluster data of the document-keyword vectors using the similarities of the patches.

Abstract: According to one embodiment of the present invention, a system, method and computer program product or the administration of client side property settings in a distributed and heterogeneous environment is provided. According to one embodiment of the present invention, a method comprises establishing communication between a plurality of property agents and a property service, and looking up an identifier in a property repository for each property agent. A property setting in an updated client application associated with a selected one of the property agents is then modified by a database administrator. Changed property settings from the selected one of the property agents are then sent to the property service. Property settings associated with the updated client application are updated in the property repository. The updated property settings are sent from the property service to a plurality of property agents. The property agents may then merge the updated property settings into an associated application.

Abstract: An improved method for information retrieval in web query and recommendation systems, where items that are likely unfamiliar to the users of the system, but potentially relevant, are recommended. In a recommendation system having ratings by a plurality of users for a plurality of items, items are assigned to one or more data regions based on item attributes or user activity. Source regions are identified for each of the data regions. For a given user, data regions with which both the user and the user's social network are unfamiliar are identified. Within a given data region, the relevance of items to the user within such regions is evaluated using ratings provided by other users who have entered ratings similar to the user in source regions for the data region. Items receiving the highest relevance score are recommended to the user.

Abstract: A system and computer implemented method comprises: (a) receiving, via a computing device, configuration data comprising unique settings and areas to clone from a site cloning page of a base site; (b) pulling all content to be cloned that is located from at least one database based on the configuration data; (c) creating a new site having a framework, the framework comprising site structure and being initially empty; and (d) copying the content from the at least one database into the framework of the new site to create a site clone of the base site customized with the configuration data.

Abstract: A method is provided to associate reviews that have unknown correspondences to tangible entities to structured objects that have known correspondences to tangible entities comprising: transforming a respective review and text from a respective structured object to a collection of words that intersect the respective review and text from the respective structured object; determining a measure of a likelihood of a match as a function of respective probabilities of occurrences of respective words of such intersecting collection within generic review text and respective probabilities of occurrences of respective words of such intersecting collection within structured object text.

Abstract: A technique to quiesce a database without causing after-arriving access requests to abnormally terminate interrogates database management system control structures associated with the database. Specified modifications to these control structures can be made so that subsequent access requests to the database (i.e., during quiesce operations) are not abnormally terminated. Once quiesced, regular or special purpose maintenance or testing operations, the starting or stopping of log keeping operations or similar operations may be made to the database. Once these are complete, the database control structures may be updated again to permit pending/scheduled access requests to proceed.

Abstract: A thread ranking system includes: a thread collector for collecting a thread from a bulletin board website, a thread information storage for storing the collected thread, an event extractor for extracting the event from respective threads by using the event knowledge stored in the event knowledge storage, a related expression extractor for extracting a related expression characterizing the thread from expressions contained in the thread every thread, an input/output controller for presenting information that calls upon the user to input an evaluation of a predetermined thread to the user and inputting an evaluation of the user, a related expression importance calculator for calculating importance based on the input evaluation of the user every related expression, and a thread ranking unit 8 for deciding ranks of respective threads based on the extracted event and the calculated importance every related expression.

Abstract: Systems and methodologies for improved query classification and processing are provided herein. As described herein, a query prediction model can be constructed from a set of training data (e.g., diagnostic data obtained from an automatic diagnostic system and/or other suitable data) using a machine learning-based technique. Subsequently upon receiving a query, a set of features corresponding to the query, such as the length and/or frequency of the query, unigram probabilities of respective words and/or groups of words in the query, presence of pre-designated words or phrases in the query, or the like, can be generated. The generated features can then be analyzed in combination with the query prediction model to classify the query by predicting whether the query is aimed at a head Uniform Resource Locator (URL) or a tail URL. Based on this prediction, an appropriate index or combination of indexes can be assigned to answer the query.

Abstract: Methods and systems for rapid automatic keyword extraction for information retrieval and analysis. Embodiments can include parsing words in an individual document by delimiters, stop words, or both in order to identify candidate keywords. Word scores for each word within the candidate keywords are then calculated based on a function of co-occurrence degree, co-occurrence frequency, or both. Based on a function of the word scores for words within the candidate keyword, a keyword score is calculated for each of the candidate keywords. A portion of the candidate keywords are then extracted as keywords based, at least in part, on the candidate keywords having the highest keyword scores.

Abstract: A method and system is provided for computing an approximation of the number of distinct results of a query over a relational data source. The approximation uses information about dependencies between fields of relations, in particular the number of distinct values of a field for each possible value of another field. This information can be obtained by analysis of the data stored in the relational data source, or may be specified as annotations to a database schema. An approximation of the number of results is and the dependencies between fields of each part of the query are computed. The approximation can be used to reorder parts of a query, by using the estimated size of parts to guide reordering. The approximation can further be used to determine which parts of a query are relevant to the evaluation of a subquery, which can be used to guide the magic sets transformation.

Abstract: A system for process control comprises a server digital data processor and a client digital data processor that are coupled by a network, such as the Internet or an Intranet. The server digital data processor, which is additionally coupled to a control/sensing device and any associated interface equipment (collectively, referred to as “process control apparatus”), includes a command processor that transfers information between the network and the process control apparatus. The client digital data processor includes an information client (e.g., a so-called Internet web browser) capable of requesting and receiving an applet from the server digital data processor. The information client, further, defines a hardware-independent and operating system-independent virtual machine environment within the client digital data processor.