Abstract: Systems and methods are provided for designing business process controls utilizing a contextual mapping engine. A set of statements relating to business process controls are received and stored in a repository. The contextual mapping engine compares the statements to determine matching scores between statements. Statements with matching scores greater than a predetermined threshold are removed from the repository.

Abstract: Techniques include: identifying one or more first entities who have connections to more than a threshold number of other entities; identifying first content in the search index that is authored by the first entities; and associating author restricts with the first content, where the author restricts include data identifying entities who authored corresponding content. The techniques may also include: identifying one or more second entities who have social connections to one or more entities who authored second content, where the one or more second entities have connections to less than the threshold number other entities; associating searcher restricts with the second content; and providing the search index updated with searcher and author restricts.

Abstract: A computer-automated method and system of providing a searchable knowledge base with decision-relevant attributes (including some subjective or sentiment-based attributes) for a plurality of individual items within a choice set are described. First, information (including texts) relevant to the plurality of individual items in the choice set is harvested from Internet sources. Next, normalized representations of statements are extracted from excerpts of the harvested texts that pertain to attributes of interest for the choice set, and corresponding scores for the attributes are derived from each of the normalized representations. The scores derived from the various harvested sources are aggregated for each attribute of each item. Finally, the knowledge base of the plurality of individual topics is generated.

Abstract: A storage system according to certain embodiments includes a client-side repository (CSR). The CSR may communicate with a client at a higher data transfer rate than the rate used for communication between the client and secondary storage. During copy operations, for instance, some or all of the data being backed up or otherwise copied to secondary storage is stored in the CSR. During restore operations, copies of the data stored in the CSR is accessed from the CSR instead of from secondary storage, improving performance. Remaining data blocks not stored in the CSR can be restored from secondary storage.

Abstract: A computer-implemented method comprises storing a plurality of construction project specification documents in a data storage system. The method further comprises, for each of the plurality of construction project specification documents, extracting a plurality of blocks of text from the document, extracting formatting information for the document based on the extracted text blocks, generating a location descriptor for each of the text blocks based on the formatting information, the location descriptor indicating the location of the text block within the document, determining the type of text contained in each of the text blocks, and storing the location descriptor and the type of text contained in the text block for each of the text blocks.

Abstract: A computer software product for allowing simultaneous multi-level collaboration, including in real time between an author and a group of reviewers invited by the author to comment on a document stored in a computer file. The computer software enables each reviewer to view the document and make changes thereto which are stored in a secondary data file without modifying the contents of the original document. The author receives and views the secondary data files from the reviewers and selectively incorporates the changes into the document. Each reviewer may invite an unlimited number of sub-reviewers to review the document, the comments of each sub-reviewer similarly being stored in a secondary data file wherein only the author may edit the document directly.

Abstract: A storage system according to certain embodiments includes a client-side repository (CSR). The CSR may communicate with a client at a higher data transfer rate than the rate used for communication between the client and secondary storage. During copy operations, for instance, some or all of the data being backed up or otherwise copied to secondary storage is stored in the CSR. During restore operations, copies of the data stored in the CSR is accessed from the CSR instead of from secondary storage, improving performance. Remaining data blocks not stored in the CSR can be restored from secondary storage.

Abstract: A computer implemented method for forming an accelerated compliance plan with a plurality of graphic visualization indicators, markers, and displays. The method includes forming client files comprising at least one client profile and at least one dynamic editable field. An updateable database of regulatory compliance information is maintained and used to rapidly generate and customize a plan for records retention that can be verified for compliance with regulations.

Abstract: A search server includes an extracting unit that extracts a search target matching a search condition based on profile data, and a transmitting unit that transmits the search target to a user terminal. The search condition includes a first frequency of appearance for each of one or more specified topics specified by a user in a first specified period and a second frequency of appearance for each of the specified topics in a second specified period being later than the first specified period. The extracting unit extracts the search target where the frequency of appearance for each of the specified topics in a first search target period and a second search target period being later than the first search target period are identical or similar to the first frequency of appearance and the second frequency of appearance, respectively.

Abstract: A computer implemented system for forming an accelerated compliance plan with a plurality of graphic visualization indicators, markers, and displays. The system uses a database of regulatory compliance information relative to records retention which can be updated as regulations change to generate a plan that can be verified for compliance with regulations and has visual markers that show the updates quickly and easily.

Abstract: A method for dynamic event detection based on content from a set of social networking systems including receiving content from the set of social networking systems, identifying a plurality of content associated with a geofence, the content that was generated within a predetermined time period, determining feature values from the plurality of content for each of a set of features, determining an event probability for the geofence based on the feature values, and detecting an event within the geofence in response to the event probability exceeding a threshold event probability.

Abstract: A method and apparatus for a data analysis system for analyzing data object collections is provided. The data analysis system includes one or more graphical user interfaces comprising various interface elements that enable users to create visual queries. A visual query is constructed as a graph representing a pattern of interest in a collection of data objects. A visual query may include one or more graph elements and property information associated with the specified graph elements. After a user has constructed a visual query, the system may transform the visual query into a query template. A query engine may then execute the query template to search a data object collection for data object results corresponding to the specified pattern. The search for instances of a specified pattern in a collection of data objects is referred herein to as a “search around.

Abstract: A method includes accessing text, identifying a plurality of terms from the text, determining a plurality of term vectors associated with the identified plurality of terms, and clustering the determined plurality of term vectors into a plurality of clusters, the plurality of clusters comprising a first and a second cluster, the first and second clusters each comprising two or more of the determined term vectors. The method further includes creating a first pseudo-document according to the first cluster, creating a second pseudo-document according to the second cluster, identifying a first set of terms associated with the first cluster using latent semantic analysis (LSA) of the first pseudo-document, identifying a second set of terms associated with the second cluster using LSA of the second pseudo-document, and combining the first and second sets of terms into a list of output terms.

Abstract: Embodiments are directed towards employing a plurality of object relationships to dynamically generate a hierarchical structure of dependent object relationships (“HSDOR”). Each object relationship may include a plurality of information, including, but not limited to, a consumer object, a provider object, a one or more direct values, a quantity of units consumed by the consumer object, or the like. Dependencies between the plurality of object relationships may be utilized to dynamically generate an HSDOR. In some embodiments, the HSDOR may be modified by resolving detected circularity relationships within the HSDOR and/or dynamically modifying object relationship dependencies affected by a new and/or modified object relationship. In some embodiments, the HSDOR may be utilized to iteratively determine a total value of an object as a function of total loaded values of object relationships from which the object depends.

Abstract: A distributed, deduplicated storage system according to certain embodiments is arranged in a parallel configuration including multiple deduplication nodes. Deduplicated data is distributed across the deduplication nodes. The deduplication nodes can be networked together and communicate with one another according using a light-weight, customized communication scheme (e.g., a scheme based on FTP or HTTP). In some cases, deduplication management information including deduplication signatures and/or other metadata is stored separately from the deduplicated data in deduplication management nodes, improving performance and scalability.

Abstract: A method includes accessing text, identifying a plurality of terms from the text, determining a plurality of term vectors associated with the identified plurality of terms, and clustering the determined plurality of term vectors into a plurality of clusters, the plurality of clusters comprising a first and a second cluster, the first and second clusters each comprising two or more of the determined term vectors. The method further includes creating a first pseudo-document according to the first cluster, creating a second pseudo-document according to the second cluster, identifying a first set of terms associated with the first cluster using latent semantic analysis (LSA) of the first pseudo-document, identifying a second set of terms associated with the second cluster using LSA of the second pseudo-document, and combining the first and second sets of terms into a list of output terms.

Abstract: A binary data file embodies an inline tree data structure storing fields of a hierarchical dataset. The inline tree comprises first-level binary string segments, each comprising substantially contiguous second-level binary string segments, corresponding to subranges of first and second subsets of data fields. Size is reduced by substituting: binary string indices for alphanumeric strings; a data clump index for a set of correlated/anticorrelated strings; field masks for unoccupied data fields. A dedicated conversion program generates the inline tree from conventional database formats, which is read entirely into RAM to be searched/filtered by a dedicated search/filter program. Small size (<2 bytes/field/record) and contiguous arrangement enables searching/filtering of >106 records (>100 data fields) in <500 nanoseconds/record/core. Recursive subdivision of selection field ranges can guide searches that include those selection fields.

Abstract: A data structure comprises a clump header table and an inline tree data structure. The inline tree, representing filterable data fields of hierarchically organized data records, comprises an alternating sequence of first-level binary string segments, each followed by one or more corresponding second-level binary string segments. Each clump header record includes an indicator of a location in the inline tree of corresponding binary string segments. A dedicated, specifically adapted conversion program generates the clump header file and the inline tree for storage on any computer-readable medium, and the inline tree can be read entirely into RAM to be searched or filtered. A dedicated, specifically adapted search and filter program is employed to list or enumerate retrieved data records. Run-time computer code generation can reduce time required for searching and filtering. One example includes spatial searching and filtering of data records that include spatial coordinates as data fields.

Abstract: A storage system according to certain embodiments includes a client-side repository (CSR). The CSR may communicate with a client at a higher data transfer rate than the rate used for communication between the client and secondary storage. During copy operations, for instance, some or all of the data being backed up or otherwise copied to secondary storage is stored in the CSR. During restore operations, copies of the data stored in the CSR is accessed from the CSR instead of from secondary storage, improving performance. Remaining data blocks not stored in the CSR can be restored from secondary storage.

Abstract: Method and system for using a clone of a replicated copy of a data structure as an independent data object is provided. The replicated copy and the clone share data blocks, when the clone is generated. The clone is assigned new data blocks to replace the shared data blocks. A profile for the clone is generated where the clone does not share any data blocks with the replicated copy. The profile includes an option to delete the clone profile and any associated data blocks thereof.