Abstract: Semantic mediation is accomplished by initially constructing a model of domain-specific requirements associated with one or more nodes in a hierarchy of semantically linked nodes representing encoded aspects of a domain. Followed by determining a target node in the hierarchy for application of at least one property characterized in a topical profile of a first entity. And further followed by producing a first-entity, target node-specific application model that reflects impacts of properties and characteristics of the topical profile with the model of domain-specific requirements through informatic convolution of the model of domain-specific requirements with the topical profile of the first entity.

Abstract: A method for data processing is provided. The method may include: preprocessing initial data to obtain preprocessed data; storing the preprocessed data; receiving a data request made through an application, the data request including information relating to a storage path of contents that are requested; in response to the data request, determining, by a nearby proxy of a first proxy cluster in a first region, whether the contents requested in the data request are cached locally; and in response to a determination that the contents are cached locally, providing, by the nearby proxy, the contents to the application; or in response to a determination that the contents are not cached locally, acquiring, by the nearby proxy, the contents based on the information relating to the storage path of the contents; and providing, by the nearby proxy, the contents to the application.

Abstract: A method for processing electronic data includes the steps of transforming the electronic data to a matrix representation including a plurality of matrices; decomposing the matrix representation into a series of matrix approximations; and processing, with an approximation process, the plurality of matrices thereby obtaining a low-rank approximation of the plurality of matrices.

Abstract: Some examples include displaying a user interface that includes attributes and entities that are determined to be related to an input entity identified by a user. Further, some implementations include displaying a structured data table that identifies attribute values associated with the input entity and selected related entities.

Abstract: Disclosed are a system and method for processing HL7 messages. A method includes receiving, an HL7 message; storing the HL7 message in a memory; creating a data structure representation of the stored HL7 message in the memory that stores a start index and an end index of the stored HL7 message, wherein the start index indicates a beginning of the stored HL7 message and the end index indicates an end of the stored HL7 message; hierarchically creating, from the data structure representation of the stored HL7 message, one or more data structure representations in the memory that store at least one start index and at least one end index corresponding to one or more fragments in the stored HL7 message; and, modifying the stored HL7 message according to the at least one start index and a corresponding end index of the fragments in the HL7 message.

Abstract: A variety of real-time information is collected in real time from a plurality of sources/systems. A current real-time context for activity of a consumer is noted. The real-time information is integrated within the current real-time context and activity of the consumer. In an embodiment, the collected real-time information is crowdsourced from a variety of social media platforms. In an embodiment, the real-time information is integrated as a recommendation made to the consumer for a good or service.

Abstract: A method for ranking items may include determining a purchaseability score for each item of a specified type based on a number of impressions of the respective item provided to users during a time period, a quantity of the respective item purchased by the users, and a quantity of the respective item added to shopping carts of the users. The method may further include ranking the items based on the purchaseability scores, generating item feed data indicating an ordering of the items based on the rankings, and providing the item feed data to a user device. The user's device may display a scrollable feed of item panels corresponding to the items, with the item panels ordered according to the ordering of the corresponding items.

Abstract: Systems and methods are disclosed for efficiently indexing stream data to facilitate full-text search of the stream data. A stream comprises large amount of data, only some of which is deemed useful for full-text search indexing. An administrator can specify an indexing specification for a stream. The indexing specification can specify one or more sub-streams within the stream for indexing, and/or specify one or more time intervals of stream data for indexing. A query against the stream can specify the indexing specification to use to index the stream before returning results for the query. The query can alternatively specify an indexing specification to apply to a previously indexed stream. Full-text search indexes generated using an indexing specification can return results that are more relevant to a user because the results are more narrowly focused than an index of, e.g., the entire stream.

Abstract: Analyzing a large number of files to identify malicious software including evaluating a multigraph including determining a graph having a plurality of nodes, including a source node and target nodes from a data set and merging the graph into a multigraph in response to a node score above a threshold level, for each target node; determining one or more specificity indexes for target node and determining a node score for the target node based, at least in part, on a specificity index.

Abstract: Systems and methods are disclosed for enabling any number of users to share data across any number of web site, mobile, and/or desktop applications (Apps), via an autonomous interdependent repositories (AIR) database. An example method includes grouping data in a plurality of Repositories of the AIR database. The plurality of Repositories may be shared with the user and other users. The method also includes maintaining a plurality of Repository records for the plurality of Repositories. Any number of Applications from any number of different publishers use the AIR database by providing schemas to the AIR databases.

Abstract: A computer generates labels for machine learning algorithms by retrieving, from a data storage circuit, multiple label sets that contain labels that each classify data points in a corpus of data. A graph is generated that includes a plurality of edges, each edge between two respective labels from different label sets of the multiple label sets. Weights are determined for the plurality of edges based upon a consistency between data points classified by two labels connected by the edges. An algorithm is applied that groups labels from the multiple label sets based upon the weights for the plurality of edges. Data points are identified from the corpus of data that represent conflicts within the grouped labels. An electronic message is transmitted in order to present the identified data points to entities for further classification. A new label set is generated using the further classification received from the entities.

Abstract: Aspects of the disclosure relate to a system that includes a memory storing a queue for arranging tasks, a plurality of self-driving systems for controlling an autonomous vehicle, and one or more processors. The one or more processors may receive a non-passenger task request with a priority level of the non-passenger task request. When the non-passenger task request is accepted, the one or more processors may insert the task in the queue based on the priority level of the task request. Then, the one or more processors may provide instructions to one or more self-driving systems according to the non-passenger task request. Having received updates of the status of the autonomous vehicle, the one or more processors may determine that the task is completed based on the updates. After determining that the task is completed, the one or more processors may remove the task from the queue.

Abstract: A method and a system for updating a search index divided into a plurality of chunks, each chunk including a portion of a plurality of documents, comprising: receiving a request to update a set of documents including deletion of a first subset of documents, computing for each given chunk of a set of chunks, each given chunk including at least one document of the first subset: an active size of a set of active documents, the set of active documents not including the at least one document, a total size, the total size not including the at least one document and a ratio of the active to the total size, duplicating, based on the ratio, a subset of chunks to obtain a subset of candidate chunks, updating the set of documents in the subset of candidate chunks, replacing the subset of chunks with the subset of candidate chunks.

Abstract: Methods and systems for selecting an image. The systems and methods may receive one or more images as well as a context associated with the received imagery. Based on the context of the received imagery, an appropriate engine may analyze the imagery by executing one or more routines. Based on the results of the analysis, one or more of the images may be selected.

Abstract: The present disclosure relates to systems, methods, and non-transitory computer readable media for utilizing an artificial intelligence framework for generating enhanced digital content and improving digital content campaign design. In particular, the disclosed systems can utilize a metadata neural network, a summarizer neural network, and/or a performance neural network to generate metadata for digital content, predict future performance metrics, generate enhanced digital content, and provide recommended content changes to improve performance upon dissemination to one or more client devices.

Abstract: A search apparatus includes a request acquisition unit that acquires a search request from a user, a search processing unit that executes a search process on a basis of a search target designated in the search request, an information acquisition unit acquires user-related information related to the user, a selection unit, a selection unit, and a providing unit. The selection unit selects, as information expected by the user, a piece of search result information highly relevant to the user-related information if the search processing unit acquires, as search results, multiple pieces of information having mutually different semantic contents and being multiple pieces of search result information from among the multiple pieces of search result information having the different semantic contents. The providing unit provides the user with the information expected by the user selected by the selection unit as a search result responding to the search request.

Abstract: Techniques for keypoint-based multi-label word segmentation and localization are described. A machine learning model identifies bounding regions of text within an image, and then generates multiple channel matrices representing predicted keypoints of the text within the bounding regions. The keypoints can be used to rectify the corresponding graphical content from the image including the text to improve the ability to perform optical character recognition and identify the text. Line and word segmentation and localization can be performed together.

Abstract: A method and an apparatus for storing data are provided. The method includes: acquiring target data, the target data including first key-value pair data, object data or array data, the key-value pair data including key data and value data, the object data including second key-value pair data, and the array data including object data; determining an object data number of the object data included in the target data, an array data number of the array data included in the target data, a first key-value pair data number of the first key-value pair data included in the target data, and a second key-value pair data number of the second key-value pair data included in the target data; determining a storage space based on the determined numbers; and storing the target data into the storage space.

Abstract: Automatic clustering of a database table is disclosed. A method for automatic clustering of a database table includes receiving an indication that a data modification task has been executed on a table and determining whether the table is sufficiently clustered. The method includes, in response to determining the table is not sufficiently clustered, selecting one or more micro-partitions of the table to be reclustered. The method includes assigning each of the one or more micro-partitions to an execution node to be reclustered.

Abstract: Systems and methods for querying a semantic data set are described. The semantic data set is defined by an ontology that represents a graphical relationship among data included in the semantic data set. One method includes receiving one or more keywords associated with a search operation from a user, and identifying a node associated with each of the one or more keywords. The method includes, for each identified node, tracing a path from the identified node to a root represented in the graphical relationship of the ontology, the path including one or more vertices, and identifying a lowest common ancestor of each of the vertices included in the paths for each identified node. The method includes constructing a subgraph connecting each identified node to the lowest common ancestor, and traversing the subgraph to generate a query in the query language executable against the semantic data set.

Abstract: A method of modifying a database architecture to improve database performance is disclosed. A replication database table is generated from an original database table. The original database table is divided into a first plurality of partitions optimized for handling accesses for satisfying a first type of query. The replication database table is divided into a second plurality of partitions optimized for handling accesses for satisfying a second type of database query. Based on receiving the database query of the first type, the query of the first type is routed to one host of a plurality of hosts to satisfy the query, the one host hosting one of the first plurality of partitions; based on receiving the database query of the second type, the query is routed to the same or another host of the plurality of hosts to satisfy the query, the second host hosting one of the second plurality of partitions.

Abstract: Methods and apparatus to associate audience members with over-the-top device media impressions. An example audience measurement apparatus includes an impression monitoring system to monitor and log media impressions based on impression requests received via network communications from over the top devices. A linkage database system is to implement the impression monitoring system. A processor in circuit with the impression monitoring system is to: generate Internet protocol (IP) address-to-cookie mappings; associate household identifiers of households with ones of the IP address-to-cookie mappings; and associate ones of the household identifiers to the logged media impressions based on IP addresses associated with the media impressions and based on the household identifiers associated with the ones of the IP address-to-cookie mappings.

Abstract: A hosted application gateway server node may be communicatively coupled to backend systems, client devices, and database shards associated with database servers. Through the gateway server node, various services may be provided to managed containers running on client devices such that enterprise applications can be centrally managed. A sharding manager may manage relationships of database items across database shards. Each shard stores a copy of a table representing a split of a relationship. A shard ID mask is included in each item's ID. At query time, the shard ID can be extracted and used to query the correct database. This query routing mechanism allows navigation from one shard to another when multiple items are in a relationship (e.g., share the same resource such as a document). As such, embodiments can eliminate the need for APIs to join in data that span multiple shards.

Abstract: A method of training a model, said model being adapted to map a first graphical data structure representation to a second graphical data structure representation, the first graphical data structure representation comprising nodes, with at least one of a plurality of relations between said nodes, the second graphical data structure representation comprising nodes, the mapping comprises using an attention mechanism, wherein said attention mechanism establishes the importance of specific nodes dependent on their neighbourhood and the relations between the nodes, wherein the mapping comprising using a projection kernel to map the nodes of the first graphical structure to nodes of an intermediate representation and using an attention kernel to enact the attention mechanism. The method includes receiving a training data set comprising an output layer and a corresponding input layer. The method also includes training the parameters of the projection kernel and the attention kernel using the training data set.

Abstract: A system for exchanging various forms of information between computer-executable agents. A computing device is configured to determine semantic data associated with each data object (DO) of a plurality of DOs. Each DO is associated with a location, and the semantic data describes the content of the associated DO. The computing device receives, from a first user computing device, a request for DO information and, in response to the request, provides DO information including the locations and the semantic data associated with the retrieved DOs to the user computing device by (a) transmitting the locations and the semantic data to the first user computing device, and/or (b) instructing the first user computing device to request the DO information from a second user computing device to which the locations and the semantic data were previously transmitted.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage medium, for indexing data in information retrieval systems. In one aspect, a system includes computer readable storage media, where the non-transitory computer readable storage media include postings lists for a term, where each posting list includes postings blocks, position blocks, and metadata blocks. Each postings block includes document identifiers and respective indications of frequency of the term in each document. Each position block includes position indications for the term in the documents of a corresponding postings block. Each metadata block includes an indication of the size of the document identifiers in the associated postings block, an indication of the size of the indications of frequency of terms in the associated postings block, an indication of a number of postings in the associated postings block, and an indication of position information for postings in the associated postings block.

Abstract: A method for indexing objects in a computerized system having an index, comprising identifying in the computerized system an at least one indexed object that meets an at least one criterion related to contents of the at least one indexed object, detecting an at least one non-indexed object having a property similar to an at least one property of the at least one indexed object that was identified, and indexing the at least one non-indexed object in the index, wherein the method is performed by the computerized system, and an apparatus for performing the same.

Abstract: Techniques related to group determination based on multi-table dictionary codes are disclosed. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method comprises storing a fact table and a dimension table that share a domain dictionary. The fact table and the dimension table each have a column of encoded join keys that is decodable using the shared domain dictionary. A query may specify one or more row groups for the dimension table. To efficiently process the query, one or more group identifiers are assigned to the one or more row groups. Each row group corresponds to a different group identifier. This enables a code-to-group-identifier mapping to be generated. The code-to-group-identifier mapping correlates the encoded join keys to the one or more group identifiers.

Abstract: Techniques for labeling data files that enable a file management label to persist on a data file. Variations disclosed herein enable a file management label to be embedded within a data file so that the file management label propagates with the data file when the data file is copied and/or moved between systems and/or workloads. In some embodiments, an application may be configured to write the file management label directly into a stream of the data file. For example, an application client that is run locally on a client device may open the data file by accessing its corresponding stream. While the data file is open within the application client such that a user may edit content of the data file, the application client may be caused to associate the file management label with the data file. Ultimately, the application client may write this association directly into the stream.

Abstract: An approach is provided to provide URLs based on a digital subject matter image (DSMI) received from a requestor. The approach identifies a set of classification labels pertaining to the DSMI and matches the set of classification labels against multiple sets of predefined labels with each of the sets of predefined labels corresponding to a URL. The matching results in a selected URL pertaining to the DSMI with this URL being returned to the requestor. In one embodiment, the approach is performed by a domain name system (DNS).

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: An information processing device (100) processes a data structure that represents a set of points included in a multidimensional space, and includes: a search unit (10) that, when a particular multidimensional region is specified as a query region, specifies regions that are expressed as portions shared between regions starting with feature value prefixes and regions starting with coordinate prefixes with respect to respective dimensions, and that are included in the query region, and outputs selected sections that are sections included in a data structure corresponding to the specified regions, the feature value prefixes being prefixes obtained from bit representations of feature values of the points, and the coordinate prefixes being prefixes obtained from bit representations of coordinates of the points with respect to a particular dimension; and an aggregation unit (20) that calculates information regarding a set of points included in the query region, by using the selected sections.

Abstract: In one embodiment, a method defines a plurality of geographic primitives. A geographic primitive is defined by one or more location identifiers. A plurality of distribution areas are generated where a distribution area is defined by one or more of the geographic primitives. The method assigns one of the distribution areas to each of a plurality of pieces of media content. Then, the method stores the assigned one of the plurality of distribution areas for each of the plurality of pieces of media content in a database. One or more of the plurality of pieces of media content are published with the assigned one of the distribution areas. The assigned one of the distribution areas is usable to determine which media content in the one or more of the plurality of pieces of media content is available to users.

Abstract: In one embodiment, a method defines a plurality of geographic primitives that are defined by one or more location identifiers. A plurality of distribution areas are generated where a distribution area is defined by one or more of the geographic primitives. The method assigns one of the plurality of distribution areas to each of a plurality of pieces of media content. A request is received from a client device that is associated with a location identifier. The method performs a reverse lookup query to a database using a geo-mapping service to retrieve a set of distribution areas that include a geographical primitive associated with the location identifier and selects one or more pieces of media content from the plurality of pieces of media content. Information for at least a portion of the one or more pieces of media content is then provided to the client device.

Abstract: A computer-implemented method is provided for processing a set D of conversation logs. The method includes learning, by a processor device, a set R of entity relation mining rules from a set K of known entity utterances uttered by known entities. The method further includes automatically recommending, by the processor device, extended utterances of the known entities from unrecognized ones of the known entities based on the set R.

Abstract: A database command is received from a user for modifying an existing data structure or creating a new data structure. The database command is used to construct a query that is provided to a query optimizer component where the query is transformed into a first query execution plan including operations that persist operation state. Some data specified in the query is received, and some of the new data structure is constructed by executing some of the first query plan. While receiving some of data specified in the query and constructing some of the new data structure, operation state of execution is persisted. When an interruption of execution of the first query plan occurs, an updated query plan is generated using persisted operation state. External updates occur, before or after the interruption, but before executing the updated query plan. The external updates are transactionally validated.

Abstract: Automated query tuning. A database query to be executed against a database is received. The database query is analyzed to determine one or more potential indexes to be evaluated. The one or more potential indexes are evaluated to determine if an optimization utilizing a selected potential index provides improved performance over performing the database query without the selected potential index. The one or more potential indexes are scored based on results of the evaluating. A recommendation of one or more of the potential indexes is provided to a source of the database query.

Abstract: Disclosed embodiments provide for collaborative access to a distributed data structure. The disclosed embodiments include collaboration participant devices or instances that each represent a distributed data structure via a tree data structure. The collaboration participants perform operations on the distributed data structure and communicate these operations to each other via a serialization service. The tree structure maintained by each of the collaboration participants stores unacknowledged operations and also collaboration participant specific length information for collaboration participants. Once a particular operation has been acknowledged by each of the collaboration participants, this is communicated to all of the participants by the serialization service. The collaboration participants may then perform maintenance on a portion of the tree structure represented the acknowledged operation.

Abstract: Systems and methods implementing a path resolver facilitating client access to a distributed file system. An example method may comprise: receiving, by a processing device, file identifier comprising a symbolic link; producing, by a user space process being executed by the processing device, a modified file identifier, by replacing a pre-defined sequence of characters within the file identifier by a path to a mount point of a distributed file system; and identifying, in view of the modified file identifier, a data structure comprising information about a file identified by the file identifier.

Abstract: Methods are described for encoding and decoding blocks of image data using intra block copying (IBC). A source block for intra block copying is selected from a source region of a current image that is closer to the current block than a threshold, wherein the source region does not include a portion of the current image that is further from the current block than the threshold.

Abstract: Systems and methods for browsing, searching, and/or viewing video with associated semantic labels via a user interface are presented herein. Presentation of a user interface may be effectuated. The user interface may be configured to display scenes of one or more videos and/or one or more semantic labels associated with the scenes. A first scene associated with a first video and a first semantic label associated with the first scene may be displayed in the user interface. Playback of the first video in the user interface may cause one or more changes in the display of semantic labels over time, such that responsive to playback of the first video including display of a second scene after the first scene, a second semantic label is displayed and the first semantic label is no longer displayed. The second semantic label may be associated with the second scene.

Abstract: A host device and method for efficient distributed security forensics. The method includes creating, at a first host device configured to run a first virtualization entity, a first event index for the first virtualization entity; encoding at least one event related to the first virtualization entity; updating the first event index based on the encoded at least one event; and sending the first event index to a master console, wherein the master console is configured to receive a plurality of event indices created by a plurality of host devices with respect to a plurality of virtualization entities.

Abstract: A method includes receiving a set of documents related to data discovery issues, wherein at least a first data discovery issue is unrelated to a second data discovery issue. The method further includes generating a map of terms and words for the set of documents that correspond to concepts. The method further includes providing a user interface that includes a search analytics tool to a user associated with the first data discovery issue.

Abstract: A method, system, and computer program product for pricing data according to provenance-based use in a query are provided in the illustrative embodiments. A set of data cubes is identified. A data cube in the set comprises a quantum of data configured for trading in exchange for a payment, the set being identified to participate in answering the query. A first portion of a price for performing the query is computed, which includes a price of a first data cube computed using a first set of provenance attributes and a first provenance-based pricing adjustment from a first pricing definition, the first data cube being included in the set. A confidence level of a result set of the query is computed. The set of data cubes, the first set of provenance attributes, the first portion of the price, and the confidence level are presented in a pricing preview of the query.

Abstract: The software system discretises continuous attributes by initially sorting attribute value pairs. The system creates partitions based on unique attribute index. The computing system adds attribute value records to the partition element until minimum frequency has been reached. The system calculates whether new partition element is mutually insignificant compared with each of partition elements in a bucket. The system adds the mutually insignificant partition element into the bucket; otherwise, the system closes the bucket and creates a new bucket to add the mutually significant partition element to the new bucket. After all the buckets have been created, the system groups buckets of continuous attributes in to a bucket group so that the buckets in a group are mutually insignificant. If bucket is mutually significant, the system creates a new bucket group and adds subsequent mutually significant bucket to said new bucket group.

Abstract: The present disclosure provides a computer-implemented method and system for performing real time supervised detection of televised video ads in a media content of a broadcasted channel. The method includes reception of the media content and selection of a set of frames per second from the media content. The method includes extraction of keypoints from each selected frame and derivation of binary descriptors from extracted keypoints. The method includes assignment of weight value to each binary descriptor and creation of a special pyramid of the binary descriptors. The method includes obtaining a first vocabulary of binary descriptors for each selected frame and accessing a second vocabulary of binary descriptors. The method includes comparison of each binary descriptor in the first vocabulary with binary descriptors in second vocabulary and progressively scoring each selected frame of the media content. The method includes detection of a first ad in the media content.

Abstract: Methods and a system are provided for accelerating an operation in a B+-tree. A method including forming triplets, by a triplet manager. Each of the triplets includes a pointer to a leaf node, a lower bound of a key on the leaf node, and an upper bound of the key on the leaf node. The method further includes performing, by the triplet manager, a lookup operation on the triplets responsive to the operation to avoid traversals of intermediate nodes for the operation. The method also includes executing, by a processor, the operation in the B+-tree while avoiding the traversals of the intermediate nodes for the operation responsive to a result of the lookup operation. The operation is any one of an insertion operation, a deletion operation, and a search operation.

Abstract: A memory stores a first log and a collection of queries. A processor accesses a second log that includes a first, second, third and fourth historical query, determines that the first and second historical queries belong to a first similarity group and the third and fourth historical queries belong to a second similarity group, and ranks the queries within groups based on static and dynamic features. The processor further determines the third historical query is frequently submitted and copies the highest ranked similar queries into the collection. The processor receives a first database query, stores it in both logs, determines it is not similar to queries stored in memory, further determines that it belongs to the first similarity group, copies the highest ranked similar queries to the first log, and returns a report containing the similar queries. The processor further receives and executes a second query selected from the report.

Abstract: A system, method, and user device for executing actions respective of contextual scenarios. The method comprises: determining at least one variable based in part on at least one signal captured by at least one sensor of the user device; generating at least one insight based on the at least one variable; generating a context for the user device based on the at least one insight; determining, based on the context, a user intent, wherein the user intent includes at least one action; and causing execution of the at least one action on the user device.

Abstract: Shareable links can be created to share content items and information pertaining to activity on those shareable links can be monitored and stored in an online content management service. Based on this activity information, predetermined actions can be executed. These actions can include sending notifications regarding link activity, disabling shareable links, and/or updating sharing limitations related to the shareable links. Using the activity information, popular shared content items can be identified and recommendations for sharing unshared content items can be provided to the user. Additionally, advertisements can be tailored to the relative popularity of the shared content items.