Abstract: At least one case from a set of cases is identified in response to a query relating to at least one category. An indication is received regarding whether the at least one case belongs to the category. A categorizer is trained based on the received indication. A quantification measure associated with cases in the category is computed based on output from the categorizer.

Abstract: The present disclosure provides a computer-implemented method of processing a Uniform Resource Locator (URL). The method includes generating a plurality of lattice nodes based on a URL, wherein each of the plurality of lattice nodes includes a host component corresponding to a portion of the URL and a path component corresponding to a portion of the URL. The method also includes identifying one of the plurality of lattice nodes as a search node. The method also includes searching a pattern table database using the search node to find a matching pattern table entry, the pattern table database comprising a plurality of pattern table entries corresponding to known lattice nodes associated with previously encountered URLs. The method also includes processing the URL based on whether the matching pattern table entry was found in the pattern table database.

Abstract: The present disclosure provides a computer-implemented method of processing a group of resource identifiers. The method includes generating a node candidate based on a resource identifier, wherein the node candidate includes a component corresponding to a portion of the resource identifier according to a dimension of specificity. The method also includes adding the lattice node candidate to a corpus lattice based on whether a matching corpus node corresponding to the node candidate is already included in the corpus lattice. The corpus lattice includes corpus nodes corresponding to a plurality of resource identifiers. The method also includes generating a pruned corpus lattice by a process that includes determining that a child node in the corpus lattice is compatible with a parent node of the child node and removing the child node from the corpus lattice. The method also includes generating an output file corresponding to the pruned URL lattice.

Abstract: A categorizer produces a first measure regarding cases associated with an issue. Information regarding additional cases associated with the issue is received after one or more events have occurred with respect to the issue. Based on further output from the categorizer, a second measure is produced regarding the additional cases associated with the issue.

Abstract: Provided are, among other things, systems, methods and techniques for determining applicability of a policy defined by reference to a source document. A first sketch that was generated based on content of the source document is obtained, and a matching criterion is defined based on the first sketch. Also obtained is a second sketch that was generated based on content of a potential target document. A determination is made as to whether the policy applies to the potential target document based on whether the second sketch satisfies the matching criterion and, if the policy applies, a notification regarding applicability of the policy automatically is provided and/or an action automatically is blocked so as to prevent a violation of the policy.

Abstract: Provided are, among other things, systems, methods and techniques for managing associations between keys and values within a computer processing system. In one exemplary implementation, requests to store associations between keys and data values corresponding to the keys are input, and the associations are stored in entry nodes within a data structure represented as a hash-based directed acyclic graph (HDAG). Upon receipt of a data value request and accompanying request key, together with satisfaction of any additional access criterion, a return data value corresponding to the request key automatically is provided, the return data value having been generated based on at least one of the associations that involve the request key.

Abstract: Methods, systems, and computer program products are provided for performing data backup of a file system. A monitoring process is configured to include a file system representation (FSR) representing the file system, the FSR comprising a plurality of nodes, each node corresponding to a respective one of a plurality of elements of the file system. A monitoring process includes a file system representation (FSR) of a file system. The FSR comprises a plurality of nodes corresponding to a respective one of a plurality of elements of the file system. The monitoring process receives a notification of a change to a first element of the file system, caches information associated with a second element of the file system to provide cached information, and processes the FSR in response to the change.

Abstract: A method and an apparatus for matching elements within sets of trajectories, locations or other attributes without revealing the entire sets. The elements are partitioned into segments. A rotating selection is made among the sets and one segment of each potentially matching element is newly disclosed from the selected set. Optionally, the sets are cryptographically hashed, using, for example, a MD5 hash or a SHA-1 hash. Optionally, the sets are represented as tries, and successively lower levels within the tries are newly disclosed from potentially matching elements as the disclosing set rotates. Optionally, the sets are encoded, using: a grid of longitude and latitude; a spatial temporal grid; a overlapping spatial grid; a temporal grid; a set of cities; a set of countries; a set of names of places; or a set of attributes. Optionally, the matching process is repeated while refining the encoding. Optionally, negotiations determine what encoding or cryptographic hash is used.

Abstract: Systems, methods and machine readable medium including machine readable code for splitting a Chinese character sequence into word segments are disclosed. A synchronization list including a plurality of Chinese words is provided. An input data string including a Chinese character sequence is received and one of the plurality of Chinese words from the synchronization list is identified in the Chinese character sequence. The identified Chinese word is defined as a word segment in the Chinese character sequence. An undefined character sequence is identified in the Chinese character sequence. The undefined character sequence is segmented into at least one word segment.

Abstract: To provide a data store, nodes representing respective chunks of files are stored in a predefined structure that defines relationships among the nodes, where the files are divided into the chunks. The nodes are collected into plural groups stored in persistent storage, where some of the nodes are collected into a particular one of the groups according to a locality relationship of the some of the nodes.

Abstract: A storage system efficiently allocates storage space for data backup. An illustrative storage system comprises a storage and backup logic that manages data backup in the storage and converts a file to a hash-based directed acyclic graph (HDAG) so that a hierarchy of nodes of the HDAGs contain a hash of child nodes. The backup logic creates multiple HDAGs for one or more of a plurality of retention policies and represents directories by a first node containing a payload of metadata and weak references to roots of child nodes, and a second node containing references to the first node and to any HDAGs corresponding to files and/or directories governed by an active policy of the plurality of retention policies.

Abstract: A computer executable method includes receiving word senses associated with respective definitions, and providing a position-based dictionary that assigns the word senses to respective semantic positions in a semantic space.

Abstract: Systems, methods, and computer-readable and executable instructions are provided for constructing an analysis of a document. Constructing an analysis of a document can include determining a plurality of features based on the document, wherein each of the plurality of features is associated with a subset of a set of concepts. Constructing an analysis of a document can also include constructing a set of concept candidates based on the plurality of features, wherein each concept candidate is associated with at least one concept in the set of concepts. Furthermore, constructing an analysis of a document can include choosing a subset of the set of concept candidates as winning concept candidates and constructing an analysis that includes at least one concept in the set of concepts associated with at least one of the winning concept candidates.

Abstract: For users in a set of users, corresponding measures of inferred interest in an item are determined. For a particular user, a particular measure of inferred interest in the item is determined. The particular measure of inferred interest and the measures of inferred interest corresponding to the users in the set of users are used to determine an estimate of the particular user's interest in the item.

Abstract: Embodiments of the present invention include a computational forecasting system that includes an identity of a dependent variable of interest and identities of a plurality of candidate indicators along with historical data or stored references to historical data, forecast-problem parameters stored in an electronic memory of the one or more electronic computers, an independent-variable selection component that generates correlations to the dependent variable of interest and lag times for the candidate indicators, and uses the generated correlations and lag times to select a number of the candidate indicators as a set of independent variables, and a model-generation component that, using a regression method, generates forecast models for the dependent variable of interest until a model that meets an acceptance criterion or criteria is obtained.

Abstract: A computer executable method includes determining semantic positions in a semantic space of portions of a text. Once the semantic positions of portions of the text have been determined, an action is performed with respect to the text based on the determined semantic positions.

Abstract: An exemplary embodiment of the present invention provides a computer implemented method of developing a classifier. The method includes receiving input for a case, the case comprising a plurality of instances and an example, the example comprising a plurality of data fields each corresponding to one of the plurality of instances, wherein the input indicates which, if any, of the instances includes a data field belonging to a target class. The method also includes training the classifier based, at least in part, on the input from the trainer.

Abstract: Methods, systems, and computer program products are provided for personalizing web sites. A model based on mining web usage data is accessed. The model defines associations between web sites. Interest associations extracted from web interactions are stored. The interest associations comprise interest indications and web sites associated with the interest indications. An interest indication from the interest associations is selected. The interest indication is associated with an associated web site. The associated web site has an association with a target web site as defined by the model. The interest indication is sent to the target web site.

Abstract: An exemplary embodiment of the present invention provides a computer implemented method of developing a classifier. The method includes obtaining a set of training data comprising labeled cases. The method also includes training a classifier based, at least in part, on the training data. The method also includes applying the classifier to a plurality of unlabeled cases to generate classification scores for each of the unlabeled cases, wherein each classification score corresponds with an instance of a corresponding case. Furthermore, the classification score corresponding to a first instance in a case is computed based, at least in part, on a value of a case-centric feature corresponding to the first instance, wherein the value of the case-centric feature is based, at least in part, on characteristics of the first instance and a second instance in the case.

Abstract: An exemplary embodiment of the present invention provides a method of processing an electronic text document. The method includes obtaining a character from the document. The method also includes obtaining a hash input code from a character map, the hash input code corresponding to the character. The method also includes modifying a hash value based on the hash input code if the hash input code indicates that the character is part of a token, or asserting the hash value if the hash input code indicates that character is not part of a token.