Abstract: A system performs delivery of a data pipeline on a cloud platform. The system receives a specification of the data pipeline that is split into smaller specifications of data pipeline units. The system identifies a target cloud platform and generates a deployment package for each data pipeline unit for the target cloud platform. The system creates a connection with the target cloud platform and uses the connection to provision computing infrastructure on the target cloud platform for the data pipeline unit according to the system configuration of the data pipeline unit. The data pipeline may be implemented as a data mesh that is a directed acyclic graph of nodes, each node representing a data pipeline unit. Different portions of the data mesh may be modified independent of each other. Partial results stored in different portions of the data mesh may be recomputed starting from different points in time.

Abstract: Systems and methods are described for improving content classifications and metadata for a plurality of content items. The content items may comprise various forms of media content. A content recommendation processing system may automatically annotate and/or classify content items with a plurality of metadata tag information describing content items. The disclosed system and methods may also determine and/or assign applicability scores indicating a level or degree of suitability for annotating a content item with particular metadata tag information, and may utilize applicability scores to provide content to calibrate metadata information for a plurality of content items, and further to provide content recommendations to users.

Abstract: Generating virtual foreign key relationships includes determining and displaying, in a user interface, a set of candidate foreign keys. It further includes determining and displaying, in the user interface, a set of candidate primary keys. It further includes receiving a request, via the user interface, to generate a virtual foreign key relationship between a selected candidate foreign key and a selected candidate primary key. It further includes in response to receiving the request to generate the virtual foreign key relationship between the selected candidate foreign key and the selected candidate primary key, generating the virtual foreign key relationship at least in part by generating a record for the virtual foreign key relationship. Determining a schema for non-relational data includes receiving a document in a first format. It further includes scanning the document and determining, for a field in the document, a corresponding path of the field and a data type of the field.

Abstract: Technology described herein assigns a reliability score to web content, such as a web site or portion of a website. In one aspect, an output of the technology is a high reliability score and a low reliability score for a web content. The high reliability score represents conformance to high reliability sites, while the low reliability score represents conformance to low reliability sites. The high reliability score may be generated by first identifying high reliability online content within a compressed web graph. In a first iteration, the high reliability score of the seeds is used to score online content that is linked to the seed sites. At a high level, the more links that originate from high reliability sources, the higher the reliability score for the linked content. The low reliability score is similar, but uses outgoing links to low reliability sites instead of incoming links from high reliability sites.

Abstract: A method and a system for initiating a location-based topic are provided. The system includes a serving system that allows a user to initiate the location-based topic within a social media and a graphical user interface initiated in a user device through a software means. The method allows the user to initiate a topic page when browsing digital contents in the social media via the graphical user interface. Besides being able to browse various location-based topics created by other users and the responses, the user himself can also create a location-based topic provided for other users to browse and respond to. Through web and computer technology, the serving system allows the user to browse the various digital contents via the social media and interact with other users through the various location-based topics.

Abstract: In a multi-tenant hierarchical data storage system, tenant nodes are organized into trees and subtrees including virtual shards and with tenant data on single shards. The system is configured to allow scalable parallel access by a plurality of tenant-users.

Abstract: Systems and methods for generating and maintaining data objects may include server(s) for receiving first and second data points associated with entities and root relationships between entities. The first data points may have entity values which are defined according to an entity type and one or more attributes of the entity. The second data points may have relationship values which are defined according to a root relationship type and one or more attributes of the root relationship. The server(s) may generate entity base layer data objects and relationship base layer data objects for the first and second data points. The server(s) may provide access to base layer data objects for identifying contextual relationships between respective base layer data objects. The contextual relationships may be identified by applying conditional rules received from a computing device to data corresponding to the entity values and/or the relationship values.

Abstract: Example systems and methods for automated cover song identification are disclosed. An example apparatus includes at least one memory, machine-readable instructions, and one or more processors to execute the machine-readable instructions to at least execute a constant Q transform on time slices of first audio data to output constant Q transformed time slices, binarize the constant Q transformed time slices to output binarized and constant Q transformed time slices, execute a two-dimensional Fourier transform on time windows within the binarized and constant Q transformed time slices to output two-dimensional Fourier transforms of the time windows, generate a reference data structure based on a sequential order of the two-dimensional Fourier transforms, store the reference data structure in a database, and identify a query data structure associated with query audio data as a cover rendition of the audio data based on a comparison of the query and reference data structures.

Abstract: In an approach to improve integration workflows by automatically generating convergent data mappings for branches in an integration workflow using a computer. A branch schema for each branch is generated, wherein the branch schema represents the union of all the individual node output schemas on the branch. A common output schema for a convergence point is generated, wherein the common output schema represents an intersection of all the branch schemas and generates branch mappings from each branch node to the common output schema.

Abstract: A distributed storage system includes table controllers collectively storing partitions of a logical table having multiple rows. For each of the partitions, a corresponding table controller stores a subset of the rows of the logical table across individual pages. A management controller updates a schema of the logical table from a first to a second schema definition by, for each of the partitions, sending an update command indicating the second schema definition to the corresponding table controller. The first table controller corresponds to a first partition that includes a first subset of the rows. The first table controller, prior to receiving the update command, includes an identifier of the first schema definition within each page of data for the first subset. Subsequent to receiving the update command, the first table controller, when writing each new page of data for the first subset, includes an identifier of the second schema definition.

Abstract: A method of providing a calendar service includes obtaining time-series data, determining whether the time-series data correspond to an outlier, obtaining, based on the determination that the time-series data correspond to an outlier, non-time-series data linked to the time-series data corresponding to the outlier, and displaying at least one of the non-time-series data and the time-series data corresponding to the outlier on a calendar page.

Abstract: A computer-implemented method executed using a first networked computer and comprising: receiving a digitally stored workflow pattern that specifies at least an input data source, a data transformation process, and an output data destination, the workflow pattern comprising a structured plurality of name declarations and value specifications that are human readable and machine readable, the data transformation process specified in the workflow pattern including one or more references to processing logic, a processing logic source outside the workflow pattern at which the processing logic is stored, and one or more available process engines that are capable of processing the processing logic; machine parsing the workflow pattern and dividing the workflow pattern into a plurality of execution units, each execution unit being associated with a particular process engine among the one or more available process engines; accessing the input data source specified in the workflow pattern and loading at least a portion

Abstract: A method includes searching, in response to a received policy query request, a preset policy library for a transmission policy that matches the policy query request, wherein the policy query request comprises hardware information of a transmitting end, hardware information of a receiving end, and data information of to-be-transmitted data in the transmitting end, and wherein the data information comprises a total data volume of the to-be-transmitted data, a data category comprised in the to-be-transmitted data, and a data volume of each data category, and feeding back a query result of the policy query request to the transmitting end.

Abstract: Implementations relate to determining whether and/or how to implement a user request to prevent a particular search result from being provided in response to a search query. Some of those implementations grant or deny the request based on processing of the particular search result, the search query, and/or account information for a user submitting the user request. For example, some implementations process such information utilizing a classifier in determining whether to automatically deny the request, automatically approve the request, or to provide the request for manual review. Some additional or alternative implementations at least selectively automatically expand (or suggest for automatic expansion) an approval of a request to search result(s) and/or to one or more search queries that are not specified in the request.

Abstract: A method may include (i) obtaining first data records structured in accordance with a first schema, (ii) determining, for the first schema, one or more first schema property values for each schema property in a set of pre-defined schema properties, (iii) determining, for a second schema, one of more second schema property values for each schema property in the set of pre-defined schema properties, (iv) providing, to a schema matching engine, first and second schema property values, where the schema matching engine contains schema mapping techniques and rules, where each rule suggests a schema mapping technique based on schema properties from the set of pre-defined schema properties, (v) applying the rules to select a schema mapping technique, (vi) transforming the first data records in accordance with the selected schema mapping technique, and (vii) providing the transformed first data records in a data structure in accordance with the second schema.

Abstract: Various embodiments for an error message replacement system are described herein. An embodiment operates by receiving, at a computing device, a request from a browser to access a website external to a domain of the computing device. The request is provided to a server associated with the website and a response is received. Within the response, an error code indicating that the request was not properly executed by the server is identified. The response includes an identification of a first error page. A second error page corresponding to the error code is identified. The second error page is provide for display, at the browser, in lieu of the first error page responsive to identifying the error code.

Abstract: Disclosed are implementations for ranking a feed in a social network. In one aspect, a method of generating a feed includes identifying a group of users associated with a first user, identify notifications for the first user based on the group of users, determine one or more actions that may result from each of the identified notifications, rank the notifications based on the one or more determined actions; and display the notifications to the first user according to the ranking.

Abstract: A system located in a building. The system including a processing circuit configured to receive tags describing points of a piece of building equipment, the piece of building equipment connected to the system. The processing circuit configured to map the tags to classes of a schema of a graph data structure. The processing circuit configured to perform clustering to generate clusters of the points. The processing circuit configured to identify, based on the clusters, relationships in the schema of the graph data structure between the tags mapped to the classes of the schema of the graph data structure. The processing circuit configured to communicate data to a second system based at least in part on the tags mapped to the classes and the relationships.

Abstract: An activity of interest is modeled by a non-stationary discrete stochastic process, such as a pattern of mutations across a cancer genome. Initially, input genomic data is used to train a model to predict rate parameters and their associated uncertainty estimation for each of a set of process regions. For any arbitrary set of indexed positions of the stochastic process that are identified in an information query, the rate parameters and their associated estimation uncertainties are scaled using the model to obtain a distribution of the events of interest and their associated estimation uncertainties for the set of indexed positions. In one practical application, and in response to a search query associated with one or more base-pairs, a result is then returned. The result, which represents deviations between the estimated and observed mutation rates, is used to identify genomic elements that have more mutations than expected and therefore constitute previously unknown driver mutations.

Abstract: A request is received to create a graph database from one or more relational databases. For each relational database, data objects in the relational database are identified. For each data object, a graph data object corresponding to the data object is created. The graph data object is linked to the data object. A set of associated data objects in the relational database are determined, and for each associated data object, an associated graph data object is created if a graph data object corresponding to the data object does not exist. For each created graph data object, a graph data relation object is created that represents a relationship between the graph data object and the associated graph data object. Created graph data objects, associated graph data objects, and graph data relation objects are stored in the graph database. The graph database is provided to one or more applications.