Abstract: Method, system, and programs for analyzing user agent string are disclosed. In one example, a user agent string is received. A list of predefined keywords is obtained. Each of the predefined keywords is associated with a type of user agent information. One or more candidate keywords are extracted from the user agent string based on the list of predefined keywords. An extraction pattern is obtained for each of the one or more candidate keywords. A keyword is determined with a version from the one or more candidate keywords based, at least in part, on the extraction patterns for the one or more candidate keywords. The determined keyword with the version represents the type of user agent information in the received use agent string.

Abstract: Techniques are disclosed herein for predicting and presenting to a user images corresponding to visual depictions of materials for a room or building that are pleasant to the user.

Abstract: Systems and methods for searching datasets and classifying datasets are disclosed. For example, a system may include one or more memory units storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving a test dataset from a client device and generating a test data model output using a data model, based on the test dataset. The operations may include processing test data model output by implementing an encoding method, a factorizing method, and/or a vectorizing method. The operations may include retrieving a reference data model output from a dataset index, based on a reference dataset. The operations may include generating a similarity metric based on the reference data model output and the test data model output. The operations may include classifying the test dataset based on the similarity metric and transmitting, to the client device, information comprising the classification.

Abstract: Methods, apparatus and computer program products for improving network database functionalities are discussed herein, such as a computer-implemented method including receiving a network database search query associated with one or more network databases; in response to receiving the network database search query, querying the one or more network databases to identify a plurality of datasets; determining a plurality of taxonomy attributes, each of the plurality of taxonomy attributes being associated with at least one dataset of the plurality of datasets; calculating a taxonomy entropy based on the plurality of taxonomy attributes; comparing the taxonomy entropy to an entropy threshold; in response to the taxonomy entropy satisfying the entropy threshold, generating a dataset ranking based on relevance scores associated with the plurality of datasets; determining one or more taxonomy refinements based on the dataset ranking; and outputting the plurality of datasets and the one or more taxonomy refinements.

Abstract: Methods, systems, and computer program products for accessing a database element are described. A local schema comprising a table link is created and the table link is used to access a database table via a persistency interface.

Abstract: In one embodiment, a method includes sending, by a client device, a request to a computer server system for a target structured document. In a first response phase, a first response portion from the computer server system is sent in response to the request. The first response portion includes a first resource associated with the target structured document, wherein a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold. Further in a second response phase, a second response portion from the computer server system is sent in response to the request. The second response portion includes a second resource associated with the target structured document, wherein a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold.

Abstract: Example implementations described herein are directed to systems and methods for managing a relationship between real-time analysis processes and applications, where each of the applications are configured to utilize output from one or more of the corresponding real-time analysis processes. In an example implementation, resource adjustment is applied to the real-time analysis process based on a determined priority.

Abstract: Aspects of the subject matter described herein relate to searching files. In aspects, a search engine is able to search not only the current files but also is able to search for deleted and previous versions of files that satisfy queries. The search engine may maintain an index that facilitates searches. In addition, the search engine may also determine not only that a file satisfies a query but what version(s) of the file satisfies the query.

Abstract: A method includes obtaining first and second data sets to be reconciled and, using matching rules, identifying discrepancies between the data sets. The matching rules include at least one permutation key, where each permutation key identifies a subset of data to be grouped together in one of the data sets. Identifying the discrepancies includes attempting to match one or more first characteristics associated with the grouped subset of data in one of the data sets to one or more second characteristics associated with another of the data sets. The matching rules could involve multiple matching characteristics, and the matching rules could be generated using a metric to select the matching characteristics of the matching rules. The metric could be based on a combination of a number of matched data items and a number of matched groups of data items.

Abstract: Systems and methods are disclosed for generating messages in a cloud platform. One method comprises storing a collection of audio files and destination information identifying location information corresponding to plurality of different geographic locations where a plurality of edge devices are located and grammar information including language-specific rules, receiving messages from one or more of a plurality of requesting devices, the messages including a first type of message and a second type of message, generating an action list, determining an available time slot at a first geographic location of a first edge device when the first edge device is available to render an announcement, retrieving, using the grammar information associated with the second type of destination information included in the action list, an audio file from the collection of audio files stored; and transmitting the audio file and the action list to the first edge device to render an announcement.

Abstract: Systems and methods for obtaining access to database files in a computing system. A method may include receiving a first call from a database management system requesting access to a database file. The method may further include transmitting a second call to an operating system interface requesting that a memory-mapped data expanse file be created. The method may also include receiving a first address representing the database file in response to successful mapping of the database file to the memory-mapped data expanse file located at the operating system interface.

Abstract: A technique for providing search results may include determining a first entity type, a second entity type, and a relationship type based on a compositional query. The technique may also include identifying nodes of a knowledge graph corresponding to entity references of the first entity type and entity references of the second entity type. The technique may also include determining from the knowledge graph an attribute value corresponding to the relationship type for each entity reference of the first entity type and for each entity reference of the second entity type. The technique may also include comparing the attribute value of each entity reference of the first entity type with the attribute value of each entity reference of the second entity type. The technique may also include determining one or more resultant entity references from the entity references of the first entity type based on the comparing.

Abstract: Techniques are described for use in database and data management systems to enable a database transaction to read uncommitted data from another database transaction on a selective (e.g., transaction-specific) basis, without requiring a change in the isolation level of either transaction (or related transactions). Accordingly, transaction speeds may be increased, and operations to audit or debug ongoing database transactions are also facilitated.

Abstract: This application is related to a data recovery system. The data recovery system includes processing circuitry which receives a restore request. The restore request includes a restore target time. When backup data corresponding to the restore target time is determined to be available, the processing circuitry creates a temporary database service instance and determines information of the temporary database service instance. The processing circuitry further obtains the backup data corresponding to the restore target time and writes the backup data into the temporary database service instance according to the information of the temporary database service instance. The processing circuitry executes a formal restoration operation on the temporary database service instance, in which the backup data is written, according to a received processing request.

Abstract: One or more processors divide an OLAP cube into one or more cubelets. One or more processors determine a weight corresponding to each node present within each of the one or more cubelets. One or more processors determine a total cost corresponding to each of the one or more cubelets. One or more processors assign execution of a portion of a workload corresponding to each of the one or more cubelets to a data processing element. The assignment of the execution of the portion of the workload corresponding to a cubelet to a data processing element is based on the determined total cost corresponding to the cubelet.

Abstract: A system and method for searching using a user device associated with a display includes a controller displaying a plurality of search screens on the display device, each of the plurality of search screens perform a content search. The user device also includes a search module generating respective search results from each of the plurality of search screens and a search retention module storing the respective search results in a memory of the user device and retrieving saved search results from the memory corresponding to the previously accessed search screen when a previously accessed search screen is displayed. The controller displays the saved search results.

Abstract: Methods, systems, and machine-readable media for identifying synthetic media file examples to train a supervised machine learned ranking algorithm to rank relevance of media files to a search query are provided. In one aspect, a method includes identifying a search query for a search engine for a collection of media files from previously received search queries, and selecting at least one training media file from the collection as a synthetic negative example for the search query. The method also includes providing a training set to a supervised machine learned ranking algorithm. The training set includes an identification of the search query, a copy of the training media file, and a first indicator that the training media file is a synthetic negative example for the search query. The method further includes providing, to the algorithm, the search query and the collection, and receiving, from the algorithm, a ranking of the collection.

Abstract: Various implementations disclosed herein provide a search engine that receives a search request from a sensor gateway, and provides search results in return. In various implementations, the search request includes a first set of measurements captured by a first sensor, a first measurement from the first set of measurements is outside a defined range. In various implementations, the search engine determines a first feature vector based on the first set of measurements, and identifies a second feature vector that indicates a second set of measurements within a degree of similarity to the first set of measurements. In some implementations, the second set of measurements are captured by a second sensor. In various implementations, the search engine determines a search result based on the second feature vector, and transmits the search result. In some implementations, the search result indicates one or more instructions executable by the first sensor.

Abstract: A method for distributed pod-editing may be performed by an enhanced pod editor, and may include the following steps: receiving a framework for a pod, wherein the framework identifies one or more content items already assigned to one or more slots in the pod by one or more pod editors; determining attributes of the content items already assigned to the pod in a native taxonomy of the enhanced pod editor; determining restrictions on the pod's slots based on the attributes of the content items already assigned to the pod and on the pod's editorial constraints; rejecting content items already assigned to the pod that violate the restrictions on the pod's slots (if any); identifying candidate content items that comply with the restrictions on the pod's unfilled slots (if any), and selecting candidate content items and assigning the selected content items to the pod's unfilled slots.

Abstract: Various techniques are disclosed herein for storing and managing master data in hierarchical data systems. Several related concepts, embodiments, and examples are disclosed, including techniques for incremental rationalization in a hierarchical data model, techniques for implementing governance pools in a hierarchical data model, techniques for application materialization in a hierarchical data model, techniques for data intersection mastering in a hierarchical data model, techniques for change request visualization in a hierarchical data model, and techniques for hierarchy preparation in a hierarchical data model.