Abstract: Described are a method, system, and computer program product for deduplicating a storage object. A hash of a window of data of a storage object is determined and a determination is made as to whether the window of data of the storage object corresponds to a chunk boundary. A determination is made as to whether the hash of the object matches one pseudo fingerprints in a list of at least one pseudo fingerprint. A storage object chunk boundary based on the window of data is stored in response to the window of data corresponding to the chunk boundary or in response to determining that the hash of the object matches one of the pseudo fingerprints. A determination is made of a new window of data in the storage object following the window of data when the window of data is not an end of data of the storage object.

Abstract: A system and method for performing an image level restore of data is described. In some examples, the system receives a request to restore a file and transmits the request to an intermediate component. The intermediate component may then retrieve a directory file from an image of a secondary copy of a data set, identify a location of the file from the directory file, and provide the location to the requestor.

Abstract: In an example, the present invention provides a meta data processing apparatus for processing sensor inputs and providing feedback to a user for an on-line course.

Abstract: Example embodiments of the present invention relate to a method, a system, and a computer program product for verifying the integrity of replicated virtual machine data. The method includes reading data from a production volume at a production site. A representation of the data may be stored at a replica site with the integrity of the data stored in the replica volume being verified according to the representation of the data.

Abstract: A method, a system, and an article are provided for managing a file cache for a client application. An example computer-implemented method can include: storing a plurality of files in a memory on a client device for a client application; identifying a first portion of the files in the memory as having been used during a previous run of the client application; receiving, from at least one server, one or more lists of files to be used during a current run of the client application; identifying a second portion of the files in the memory as not being included in at least one of the first portion and the one or more lists of files from the at least one server; and removing, from the memory, at least a subset of the second portion of the files during the current run of the client application.

Abstract: A method is provided for producing a record clustering with estimated accuracy metrics with confidence intervals. These metrics can be used to determine whether a clustering should be accepted as the output of the system, and whether model training is necessary to meet desired clustering accuracy. A collection of test records is used in the process, wherein each test record is a member of a collection of input records.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: Disclosed is a system for comparing a plurality of documents, wherein each of the plurality of documents comprise one or more sentences the system comprises a lexicon ontology represented into multi-dimensional hierarchical space communicably coupled with a server arrangement. The server arrangement is configured to obtain the documents, tokenize, using a tokenizer module, the sentences in each of the documents to obtain a plurality of tokens for each of the documents, determine token coordinates of each of the tokens in the multi-dimensional hierarchical space representing the lexicon ontology, determine sentence coordinates for each of the sentences in the documents using a transmutation module, generate similarity scores for each of the sentences in the documents using a comparison module, and determine a measure of similarity between the documents based on the similarity scores of the sentences in the documents.

Abstract: Methods and devices for simplifying data collected from assets are provided. An example method involves obtaining raw data from a data source at an asset, determining whether a data logging trigger is satisfied, and, when satisfied, performing a dataset simplification algorithm on the raw data to generate a simplified set of data in which interpolation error is limited by an upper bound that is fixed across the simplified set of data.

Abstract: A set of first results from a first query are received. Using a natural language processing technique, a set of second results using a second query having at least a portion of the first query and at least a portion of set of first results are generated, wherein the natural language processing technique comprises a machine learning model configured to analyze the set of first results. The set of second results are scored based upon a semantic comparison of the set of first results, the second query, and the set of second results. Using the scored set of the second results, a set of processed results are generated.

Abstract: The present disclosure relates to processing support requests, or support queries, in a software application including automated and human interaction-based support systems. An example method generally includes receiving a support request from a client device. A query processor parses the support request to identify one or more characteristics of the support request and identifies a support system to process the support request based at least in part on the identified one or more characteristics of the support request. The query processor instantiates a support session with the identified support system to process the support request.

Abstract: Automated determination of web page rendering performance techniques and systems are described. In one example, a web page including multiple user-interactive elements that can be selected or navigated via user input is received. A frame rendering system is employed to automatically identify the user-interactive elements and generate scripts to simulate user input at the user-interactive elements. The generated scripts are then used to simulate user input at the user-interactive elements. The scripts may be generated to simulate user interaction via a variety of different device types, and under a variety of different network conditions. During the simulation, a rendering performance score for the web page is generated by monitoring rendering performance relative to a threshold rendering rate.

Abstract: Multi-tenant access to respective isolated data sets organized using different application schemas is disclosed. Multiple tenants store respective data sets in separate datastores. The datastores are organized using different application schemas, each derived from a same base schema. However, the tenants share access to a same application. The application receives a first request from a first tenant and a second request from a second tenant. The application serves the first request by accessing a first data set organized using a first application schema. The application serves the second request by accessing a second data set using a second application schema.

Abstract: An e-commerce search ranking system is provided and generally includes a server (e.g., application server), a database, and a customer computing device. The server can obtain user search query listings associated with a search term of users' search sessions to determine user engagement of the items. The server also determines that the items, and any items appearing before the items in each user search query listing, were examined. The server can then aggregate the information in the database. The server can also determine additional search terms related to the search term of the users' search session, and obtain user search query listings for the additional search terms. The server can determine user engagement for items appearing in those user search query listings, and can aggregate that information in the database as well. The aggregated information can be used to determine a final item ranking for a search request inquiry.

Abstract: A method for compressing semi-structured data is discussed. The method includes accessing semi-structured data, the semi-structured data comprising a plurality of elements. The method includes determining a plurality of unique elements of the plurality of elements, each of the plurality of unique elements associated with a respective unique index of a plurality of unique indexes. Each of the unique index can indicate a position in one of a plurality of data stores. The method includes generating a sequence of encoded representations corresponding to the plurality of elements, the generating based on the plurality of unique indexes.

Abstract: The present invention provides a method, computer program product, and system of generating predicted reactions of a user. In some embodiments, the method, computer program product, and system include receiving an intelligence data store, receiving a current data object with a current query and at least one knowledge graph, identifying one or more patterns in the at least one knowledge graph, comparing using a deep neural net, the previous queries and associated one or more patterns with the current query and identified one or more patterns of the current data object, classifying the plurality data objects from the intelligence data store based on a closeness of the current query and identified one or more patterns with each of the previous queries and associated one or more patterns in the intelligence data store, and identifying, by the classification engine, potential dispositions based on the classification of the plurality of data objects.

Abstract: Method of retrieving event information is presented. Memento objects can be recognized by an archive engine. Based on the recognition, the archive engine obtains information related to the memento object, possibly one or more recognizable features, and uses the information to search for events associated with a timeline that have corresponding tags. The archive engine can then return the event information as a result set to a user.

Abstract: Systems and methods are disclosed for associating summarizations of visualizations of a data set based on affinities between the summarizations. For a data set, a number of summarizations may be created that summarizes the data set in different ways. The summarizations may be linked, such that selecting a data element of a first summarization causes display of a second summarization. To assist in linking of summarizations, suggested linkings between summarizations can be determined based on affinities of the two summarizations. Affinities can reflect similarities in the data content of the two summarizations, such as an output of a first summarization being a valid input to the second summarization.

Abstract: A dependency graph is generated for database files. An unvisited node of the dependency graph is selected and a breadth-first-search performed starting from the selected unvisited node. Results of the breadth-first-search is defined as a group. A group assignment for the database files is returned.

Abstract: Embodiments of the present disclosure provide solutions for determining an elected search head captain is unqualified for the position, identifying a more qualified search head, and transferring the captain position to the more qualified search head. A method is provided that includes referencing qualification parameters in an elected search head captain, determining whether the newly elected search head captain is qualified for the position based on the parameters, identifying a more qualified search head to be the search head captain if the newly elected search head captain is determined to be unqualified for the position, and transferring the position of captain to the more qualified search head. The qualification parameters may include, for example, a pre-determined static flag set by an administrator of the search environment, and configuration replication status that corresponds to the most recent configuration state of the search head as recorded by the previous search head captain.