Abstract: Data cataloging has become a necessity for empowering organizations with analytical ability. Conventional cataloging systems may fail to provide proper visualization of data to the different stakeholders of an organization. The present disclosure provides a hierarchical dynamic cataloging system so that visualization of data at different levels would be possible for different stake holders. In the present disclosure, a hierarchical structure of algorithms and multiple stake holders along with relevant metadata is generated. Further, a catalog is generated by performing a mapping across components comprised in the hierarchical structure and identifying relationship across the components based on mapping. The catalog gets dynamically updated and provides a dynamic view of the algorithms and associated metadata to the multiple stakeholders of an organization.

Abstract: In one aspect, a fault intercepting computing device is provided. The fault intercepting computing devices receives a request message including an outdated key value from a client computing device, retrieves an updated key value from a key mapping database, generates a remapped request based on the request message by replacing the outdated key value with the updated key value in the request message, and transmits the remapped request to a host computing device. The fault intercepting computing device further receives an initial response from the host computing device including the updated key value, generates a surrogate response based on the initial response by replacing the updated key value with the outdated key value, appends a key remapped flag to the surrogate response, transmits the surrogate response, including the outdated key value to the client computing device.

Abstract: Garbage collection processing in a distributed shared log system includes a client identifying obsoleted log entries for a shared data object. The client sends information associated with the identified obsoleted log entries to a shared log server. The shared log server receives information associated with obsoleted log entries from all clients in the distributed shared log system and uses the information to delete the obsoleted log entries. The shared log server can update a snapshot mark to indicate the earliest time that a snapshot of the shared log can be taken. The snapshot mark can be updated based on the information associated with obsoleted log entries.

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: Techniques are disclosed relating to determining whether a set of database schemas are different. A computer system may receive a request to create a snapshot for a set of data stored in a database having a first database schema. In response to receiving the request, the computer system may create the snapshot for the set of data. As part of the creating, the computer system may generate, based on the first database schema, a first hierarchy of hash values that includes a first root hash value for the first database schema. The first hierarchy of hash values may be usable to determine whether the first database schema is different from a second database schema. The computer system may include the first hierarchy of hash values with the snapshot.

Abstract: A flexible, scalable, and fast query system for a distributed execution environment is provided. An example method includes receiving a plurality of processor summaries, each including a list of job digests, each job digest including a job identifier for a job running on a job processor and a payload portion. The method can also include, for each job digest, determining a location in a probabilistic payload data structure for the job digest and storing the payload portion and a fingerprint portion generated from a portion of a hash of the job identifier in an entry at the location as a job summary and responding to queries using the probabilistic payload data structure. Responding to a particular query may include identifying job properties corresponding to parameters of the particular query, updating job property statistics, and using the job property statistics to change the job properties represented in the payload portion.

Abstract: Disclosed herein is a data structure that reduces computational load on a database in querying and visualizing historical values of slowly changing dimensions. The slowly changing dimensions have one or more values associated with them (e.g., a monthly average accounts receivable is a single value, and a set of contact information for an individual may have multiple values). On a periodic basis, database images, also known as “snapshots” are generated of a current status of a given database. The snapshots are used to build a historical data table that is computationally efficient to reference.

Abstract: A processor may filter data to generate a subset of the data less than an entire set of the data. The subset may include at least one string and at least one numeric value. The processor may match the at least one string and the at least one numeric value to one of a plurality of archetypes by applying a clustering algorithm. Each archetype may include a subset of archetype data less than an entire set of archetype data. The processor may compare the entire set of data to the entire set of archetype data to identify at least one difference between the entire set of data and the entire set of archetype data. The processor may apply at least one optimization to address the at least one difference.

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.