Abstract: Various embodiments illustrated and described herein include systems, methods, and computer program products to protect NTFS deduplicated volumes. Some embodiments select a data protection mode from various modes to protect deduplicated volumes. Some data protection modes retrieve the deduplicated files and associated data chunks without rehydrating the files and send them to a replica. Some data protection modes rehydrate deduplicated files as they are retrieved, send the rehydrated files to the replica, and turn on deduplication at the replica so the files can be deduplicated on the replica. Deduplication settings can also be transferred to the replica so that deduplication on the replica mimics deduplication on the source. Some data protection modes replicate the deduplicated files to the replica.

Abstract: Embodiments of a system for searching text indices for suffixes are disclosed. Embodiments may include a suffix searching module at a computer configured to receive a query and identify the query as a suffix query, extract a suffix from an identified suffix query and reverse an order of characters in the suffix, and search a secondary index for terms corresponding to the reverse-ordered suffix, the secondary index comprising one or more lists of reverse-ordered terms from a primary index; a search reconfiguration module operably coupled to the suffix searching module and configured to receive from the suffix searching module found terms corresponding to the reverse-ordered suffix and reverse an order of the characters of the found terms; and a search module configured to implement a search of a primary index using reverse-ordered found terms received from the search reconfiguration module.

Abstract: In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, receiving from a user an unstructured text query, generating a set of structured queries based on the text query, calculating a quality score based on the text query and the structured query for each structured query in the set, and filtering the set to remove each structured query having a quality score less than a threshold score.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Abstract: A computer-implemented method for generating user stories for a software product, includes collecting, by a processor, a plurality of requirements, creating, by the processor, a plurality of content space specification files that includes the plurality of requirements, processing, by the processor, the plurality of content space specification files to generate the user stories, defining, by the processor, a content space, and embedding, by the processor, the content space in the software product.

Abstract: A processing device executing a transaction manager sends prepare messages to a plurality of participants of a two-phase commit distributed transaction. Responsive to receiving commit responses from each of the plurality of participants, the processing device commits the two-phase commit distributed transaction. The processing device then ends the two-phase commit distributed transaction without first sending commit messages to the plurality of participants.

Abstract: The present application discloses improved capabilities for aggregating user behavioral data across multiple wireless operators and delivering content to a mobile communication facility based on that aggregation, among other factors.

Abstract: Methods, systems, and computer program products for determining frequently occurring data items are disclosed. These include, counting distinct categories of a plurality of data items using an ordered set of counters, wherein each of the counters is associated with one of the distinct categories and represents a quantity of the data items in the associated one of the distinct categories, and wherein the counting includes updating counters in the ordered set and a global decrement counter when one of the data items fails to match at least one of the distinct categories associated with the counters of the ordered set and when the ordered set is full. These further include, reporting, for each of the counters in the ordered set, a lower bound for the associated one of the distinct categories, wherein the lower bound is based upon a value of the counter and the global decrement counter.

Abstract: A system for evolutionary analytics supports three dimensions (analytical workflows, the users, and the data) by rewriting workflows to be more efficient by using answers materialized as part of previous workflow execution runs in the system.

Abstract: A system and computer-implemented method for associating images with semantic entities and providing search results using the semantic entities. An image database contains one or more source images associated with one or more images labels. A computer may generate one or more documents containing the labels associated with each image. Analysis may be performed on the one or more documents to associate the source images with semantic entities. The semantic entities may be used to provide search results. In response to receiving a target image as a search query, the target image may be compared with the source images to identify similar images. The semantic entities associated with the similar images may be used to determine a semantic entity for the target image. The semantic entity for the target image may be used to provide search results in response to the search initiated by the target image.

Abstract: A method is provided in one example embodiment and includes establishing a pool of potential matches for a user in a computer-implemented matching system, in which each of the potential matches meet at least one criteria of the user; determining a messaging score for each of the potential matches of the pool, the messaging score indicating a messaging aptitude of the potential match; and ranking the potential matches, where each of the potential matches is ranked based on a similarity of the messaging score of the potential match to a messaging score of the user. In one embodiment, the method may further include presenting to the user results of the ranking.

Abstract: Disclosed is an object arrangement apparatus which arranges a plurality of objects approximately uniformly to a plurality of arrangement destinations by a comparatively easy processing configuration. This object arrangement apparatus includes an arrangement destination determination means. The arrangement destination determination means refers to sequence information generated based on unique information for objects and refers to corresponding information between arrangement destination identifiers identifying arrangement destinations of the objects and second numbers associated with the arrangement destination identifiers. The arrangement destination determination means generates first numbers by using the sequence information, the first numbers not having a correlation therebetween when the first numbers are generated with different sequence information, and repeats generating a new first number until the first number matches the second number contained in the corresponding information.

Abstract: Access by a user to a database layer, is governed by modeled authorization checking implemented with authorization objects present in an overlying application layer. At design time, the authorization checking is modeled as part of an existing user interface (UI) model, which may conform to a Model, View, and Control (MVC) design pattern. Authorization objects created during design time, are stored in a meta data repository. At runtime, an authorization engine references the authorization objects and the operations supported by those authorization objects. The authorization check is thus implemented centrally in the UI framework itself using this modeled information. Embodiments avoid complexity, potential lack of internal consistency, and low visibility of conventional de-centralized authorization checking schemes that rely upon a plurality of enforcement points hard-coded at multiple locations within application logic.

Abstract: The present subject matter relates to systems and methods for determining quality of data. In one implementation, the method comprises identifying at least one column of the data repository based on an importance index associated with the at least one column, wherein the importance index is indicative of the criticality of the data stored in the at least one column; and retrieving at least one data quality analysis rule associated with the at least one column. The method further comprises assigning a rule weightage parameter to each of the at least one data quality analysis rule and a column weightage parameter to each of the identified columns and analyzing the data stored in the identified columns based on the at least one data quality analysis rule. Based in part on the analysis a data quality score, indicative of the quality of data stored in the data repository is computed.

Abstract: A ticket entry system and method includes a program management system that receives contact information and a search criteria for a locate request. The program management system transmits the search criteria to a spatial management system that geocodes the search criteria and retrieves map data from a data management system corresponding to the search criteria geocode. The spatial management system transmits the map data to the program management system, which transmits the map data to a user interface. The user interface receives an indication of a site location where the operation is to be performed. The program management system transmits the site location indication to the spatial management system. The spatial management system geocodes the site location indication and transmits the site location geocode to the program management system. The program management system creates a locate ticket, which comprises the site location geocode and the contact information.

Abstract: In a network environment between a group of endpoint computing devices, where content is shared between the group of endpoint computing devices via a social network platform, techniques are described herein for receiving a social activity feed associated with the social network platform, the social activity feed including activities occurring within the social network platform. An algorithm is applied to a social graph of a user at an endpoint computing device of the group to determine a prioritization of nodes within the user's social graph, activities within the social activity feed are associated with nodes of the user's social graph, and recommendations are provided to the user of activities within the social activity feed that correspond with prioritized nodes of the user's social graph.

Abstract: Database operation records are sequentially read from two or more log files. If the transaction identifier is new and the record is not an end-of-transaction record, an open transactions list entry is created. If the transaction identifier is new and the record is an end-of-transaction record, a transaction type list entry is created or updated. If the transaction identifier is not new and is not an end-of-transaction record, an open transactions list entry is updated. If the transaction identifier is not new and the record is an end-of-transaction record, a transaction type list entry is created or updated. When all log file records are read, analytical comparison between the information associated with two or more of the log files in data fields in the transaction type list entries is performed.

Abstract: Directories in a file system are defined with a dummy cluster in a file allocation table as the initial entry. Subsequent clusters in a directory's definition may define any data for the directory that can be changed in a transaction-safe mode. A directory may be modified in a transaction-safe mode by modifying any of the subsequent clusters while tracking changes in a second file allocation table. When the changes have been made to the directory, a pointer to the second file allocation table may be switched to indicate that the second file allocation table is now last known good. The first file allocation table may then be synchronized with the second.

Abstract: A named entity input is received and a target sense for which the named entity input is to be extracted from a set of documents is identified. An extraction complexity feature is generated based on the named entity input, the target sense, and the set of documents. The extraction complexity feature indicates how difficult or complex it is deemed to be to identify the named entity input for the target sense in the set of documents.

Abstract: A computerized docketing system for legal matters, comprising a database operatively arranged to store information related to the legal matters, including actions to be taken with respect to the legal matters, and due dates associated with the actions to be taken, an arithmetic logic unit operatively arranged to scan the database, compare each of the due dates with a reference date, and classify the due dates according to proximity of each of the due dates to the reference date, and, means for displaying different classifications of the due dates in different colors for the purpose of alerting a user of the system of matters requiring attention. A computerized method and apparatus for comparing two dates and alerting user of impending due date by changing color of one of the two dates.