Abstract: Apparatus for generating a putative ontology from a data structure associated with a data store, the apparatus including an electronic processing device that generates a putative ontology by determining at least one concept table in the data structure, determining at least one validated attribute within the at least one concept table, determining at least one selected attribute value from the at least one validated attribute and generating at least one ontology class using the at least one attribute value.

Abstract: The present disclosure provides a method, system, and device for file replication. To illustrate, based on target replication information corresponding to a version of a file at a target device, a source device may determine one or more portions of a different version of the file at the source device to be provided to the target device. One or more other aspects of the present disclosure further provide sending, to the target device, the one or more portions and replication information corresponding to the version of the file at the source device. Based on the version of the file at the target device, the one or more portions, and the replication information corresponding to the version of the file at the source device, the target device may assemble and store a file that corresponds to the version of the file at the source device.

Abstract: A method, system and computer program product for join graph generation based upon a log of previously executed database queries includes method for generating a join graph for relational database queries. The method includes loading into memory of a computer, a log of a set of database queries previously executed against data in a database and sequentially parsing each of the queries in the log to identify different semantically characterizable components of each of the queries. The method further includes generating a join graph for each of the queries from corresponding ones of the components. Finally, the method includes selectively adding each of the generated join graphs to a set of join graphs in a data model for the data in the database.

Abstract: Computer-implemented systems and methods for water asset management are disclosed. The systems include water data services components having computer implemented modules for generating a prompt for a user to input a water asset identification number, retrieving and returning water asset metadata in response to input of a valid water asset identification number, generating a prompt for user validation of the returned water asset metadata, storing validated water asset metadata; communicating the stored and validated water asset metadata to an interplanetary file system (IPFS) for generation of a water asset metadata hash value, and storage of the water asset metadata hash value in a cloud table. The systems also include a cloud big table component comprising modules for storing and updating the cloud table.

Abstract: Methods and systems for data are disclosed. A system implementation includes a data module for storing data received from an external source. The data module includes a file system for unstructured data, a database for structured data, a transform for operating upon unstructured or structured data, a data broker for receiving data having a first format and providing the data in a second format, a data network for communications within the data module, and a processing module for performing operations upon data. The processing module further includes a process broker and a process container. The process container is for providing one or more instances of processes during a runtime operation. The system further includes an inter-process network for communications within the processing module and an internal gateway for the data module to communicate with the processing module.

Abstract: Techniques are disclosed for tuning external invocations utilizing weight-based parameter resampling. In one example, a computer system determines a plurality of samples, each sample being associated with a parameter value of a plurality of potential parameter values of a particular parameter. The computer system assigns weights to each of the parameter values, and then selects a first sample for processing via a first external invocation based on a weight of the parameter value of the first sample. The computer system then determines feedback data associated with a level of performance of the first external invocation. The computer system adjusts the weights of the parameter values of the particular parameter based on the feedback data. The computer system then selects a second sample of the plurality of samples to be processed via execution of a second external invocation based on the adjustment of weights of the parameter values.

Abstract: One example method includes scanning, at a cloud storage site, metadata associated with an object stored at the cloud storage site, fetching, from the metadata, an object creation time for the object, and determining whether the object is out of a minimum storage duration. When the object is out of the minimum storage duration, it is copy-forwarded and then marked for deletion, and when the object is not out of the minimum storage duration, the object is deselected from a list of objects to be copied forward.

Abstract: In one embodiment, present disclosure discloses a method for partitioning a temporal graph is described. Embodiments of the method comprises creating a plurality of storage blocks for each type of the different types of graph elements based on predefined label groups, each of the plurality of storage blocks configured to store the telemetry information generated in a corresponding predefined time-range, recreating each of the plurality of storage blocks upon expiry of a configurable rollover time, and sharding each of the plurality of storage blocks into a plurality of shards based on a configurable sharding count.

Abstract: Techniques for formulating queries and retrieving relevant results for 3D components in a virtual or augmented reality system. In an aspect, a user works with a 3D component using a workflow, and views the 3D component from one or more selected perspective views. Data associated with the workflow and the selected perspective views are transmitted to an online engine. The online engine may include a query formulation module for automatically forming a query based on the received workflow data and selected perspective views. The formulated query may be supplied to a search engine to retrieve online results based on relevance to the formulated queries. One or more most relevant online results may be seamlessly served to the user as part of the workflow.

Abstract: An adaptive method of cleaning structural health monitoring (SHM) data based on local outlier factor is provided, including following steps: step 1: dividing SHM data to be analyzed into a series of data segments by using adaptive sliding window (ASW) technology; step 2: extracting time-domain statistical factors and frequency-domain statistical factors of each of the data segments to refine data information, thereby forming objects for study; step 3: calculating an outlier degree of each of the objects by using a weighted multiscale local outlier factor (WMLOF) based on feature factors; and step 4: detecting anomalies in SHM data by comparing a WMLOF value with a threshold value. The adaptive method can improve data quality effectively.

Abstract: A database system may associate functions with a database table. A request to associate a function with a table in a database system may be received. An association between the table and the function may be created. The function may include parameters that are determined from values within the table which are then invoked by a request to perform the function. The associated function may cause the collection of the values prior to performance of the function.

Abstract: A method and apparatus for compression units in an index block is provided. A particular leaf block of a database index for a table is generated. The particular leaf block corresponds to a particular range of key values. A compression scheme is determined for a plurality of index entries with key values within the particular range. A compression unit that includes a plurality of compressed index entries is generated by applying the compression scheme to the plurality of index entries. Compression metadata describing the compression scheme is generated. The compression unit and the compression metadata is stored in the particular leaf block. In response to a request, at least a portion of the compression unit is decompressed to access one or more index entries.

Abstract: Methods and systems for graph-based discovery of geometry of clinical data are provided. An example method includes receiving vectors of outcomes of trial subjects, generating, based on the vectors of outcomes, a plurality of metric graphs, each of the metric graphs including a set of nodes corresponding to the vectors of outcomes and a set of edges, performing an automatic search to identify communities of nodes in the optimal graph, displaying a graphical representation of the optimal graph and highlighting nodes in the graphical representation, the nodes corresponding to the community of nodes. Generating the set of edges includes selecting metrics and projection rules to obtain projections of the vectors of outcomes, and selectively connecting nodes based on determination that projections of corresponding vectors of outcomes belong to the same domain of a set of overlapping domains and a certain cluster within the domain.

Abstract: The technology implements diversity sampling for a technology-assisted review of documents. An apparatus obtains an unlabeled set of documents and constructs a first batch of documents. The apparatus obtains labels for the documents and constructs a classification model using the labeled documents. The apparatus logs a found rate of a subsequent batch of documents from the unlabeled set of documents, the subsequent batch of documents being selected based on a comparison to the classification model. The apparatus determines that the classification model requires further training based on the found rate of the subsequent batch of documents and constructs a second batch of documents that includes an amount of diversity, which may be based on the found rate. The apparatus obtains labels for the second batch of documents and updates the model using the labeled second batch of documents. The method may be repeated to continue to refine the classification model.

Abstract: Methods, systems, devices, and tangible non-transitory computer readable media for saliency visualization are provided. The disclosed technology can include receiving a data input including a plurality of features. The data input can be segmented into regions. At least one of the regions can include two or more of the features. Attribution scores can be respectively generated for features of the data input. The attribution scores for each feature can be indicative of a respective saliency of such feature. A respective gain value for each region can be determined over one or more iterations based on the respective attribution scores associated with the features included in the region. Further, at each iteration one or more of the regions with the greatest gain values can be added to a saliency mask. Furthermore, at each iteration a saliency visualization can be produced based on the saliency mask.

Abstract: A computer-implemented method includes accessing data from distinct data domains corresponding to different data sources, and determining a core dimension of the accessed data common to first and second distinct data domains. The method further includes generating a data set from the data sources using a columnar data generation engine, and deriving, from the data set via stateless processing, a first guided page including actionable elements depicting data derived from the first distinct data domain. The method further includes responsive to a user interaction with one of the actionable elements, providing, dependent on the common core dimension, direct navigation from the first to the second distinct data domain, and predicting, from the data set based on machine learning and prior to the user interaction, a second guided page that depicts data derived from the second distinct data domain and is presented responsive to the direct navigation.

Abstract: A system is provided for electronic data compression by automated time-dependent compression algorithm. In particular, the system may track instances in which a particular dataset is used, copied, or accessed over time. For certain datasets (e.g., datasets that have not been accessed for a threshold amount of time), the system may use a time-based compression algorithm that progressively removes the least significant bits of such datasets as time passes. The compression of the datasets may continue until the system detects that further compression would cause the dataset to be unreadable or unrecoverable. In this way, the system may minimize the computing resources allocated to storing datasets that are not frequently accessed.

Abstract: A method and related apparatus adaptively control snapshot replication of a plurality of server snapshots in a multi-tenant public cloud using snapshot service. A plurality of snapshot requests are received from a plurality of clients in the multi-tenant public cloud and are each associated with a service level agreement (SLA). The SLA includes a corresponding completion deadline and a slippage penalty. A probabilistic model calculates, for active snapshot flows, a completion time for each of the snapshot requests. If any of the predicted completion times exceed their corresponding completion deadlines, a possible MISS event is produced for an associated first snapshot. The snapshot controller component, in response to producing the possible MISS event, minimizes a probability of breaching fulfillment times for the multi-tenant cloud. The slippage penalty is calculated for each of the plurality of snapshot requests. A second snapshot is identified from among the plurality of snapshot requests.

Abstract: Aspects of the disclosure relate to management of databases in different server environments. In particular, various aspects of this disclosure relate to correction, synchronization, and/or migration of databases between different database servers. A feed file that is rejected from loading in a database associated with a source server may prioritized in a destination server. A feed file hierarchy of the rejected feed file may be determined and the destination server may process loading of the rejected feed file to a database based on the determine feed file hierarchy. Any corrections applied at the destination server may also be applied at the source server.

Abstract: The data storage system according to certain aspects can implement table level database restore. Table level database restore may refer to restoring a database table and its related data without restoring the entire database. The data storage system may use table metadata index to implement table level restore. A table metadata index may be created for each table, e.g., during a backup of the database. The table metadata index for a table can include any type of information for restoring the table and its related data. Some examples of the type of information included in the table metadata index include the following: container for the table, table backup location, system data, table index, table relationships, etc. Table metadata index can make the restoring of tables fast and efficient by packaging information that can be used to restore a table and its related data in an easily accessible manner.