Abstract: A context schema characterizing a context associated with an application is received by a processing device. The context schema specifies one or more context attributes. Each context attribute identifies a respective context element of the context associated with the application. A context item comprising one or more values is received. Each value corresponds to a respective context attribute of the one or more context attributes. The context item is validated against the context schema. Responsive to determining that the context item conforms to the context schema, the context item is stored in a context store.

Abstract: A method for classifying records by relevance to nodes of a hierarchical structure representative of a classification scheme for different classification options. The method includes receiving an input record having a plurality of record content features, and a contextual attribute indicative of a context of the receipt of the input record, retrieving relational data indicative of one or more nodes of the hierarchical structure that are associated with the contextual at-tribute of the received input record, and determining a relevance score for one or more of the nodes of the hierarchical structure to classify the input record. The relevance score of each node is determined in dependence on a comparison of the plurality of record content features of the input record relative to the classification option represented by said node, and further wherein the relevance score of each node depends on the retrieved relational data.

Abstract: A data processing method includes: acquiring a data sorting request for a data sequence to be sorted, and invoking C data bitonic sorting components in response to the data sorting request, C being a positive integer greater than 1; initiating B data bitonic sorting tasks according to the data sequence and the C data bitonic sorting components, B being a positive integer greater than 1, the B data bitonic sorting tasks being respectively associated with different data subsequences of B data subsequences, and the B data subsequences being generated based on the to-be-sorted data sequence; operating the C data bitonic sorting components in parallel according to the B data bitonic sorting tasks to obtain B data sorting subresults; and combining the B data sorting subresults based on the C data bitonic sorting components to obtain a data sorting result for the data sequence.

Abstract: Industrial automation system with a system for embedding a web application to be embedded in a surrounding web application and method for embedding a web application into a surrounding web application, wherein the web application to be embedded is provided to run in a separate execution and display region of the surrounding web application, the web application to be embedded is provided by at least two web servers so as to increase redundancy, monitoring capability and operability and therefore fault tolerance, to reduce complexity, to reduce communication traffic and to obtain improved options for access restriction for personnel, particularly in large industrial automation systems, such as process control systems.

Abstract: Query language statements are generated from natural language statements using a knowledge graph representing one or more databases. The knowledge graph is obtained by creating nodes representing tables and operations referenced by queries to the databases. The data of the databases is evaluated to identify entities and dimensions of entities from among the nodes. The entities are assigned human-understandable labels by an LLM. A natural language statement is converted to a knowledge graph language (KGL) statement and references in the KGL statement are replaced with references to entities in the knowledge graph. The KGL statement is then programmatically converted to a database language statement.

Abstract: Techniques for preparing datasets for geo experiments and improving accuracy of geo experiments are presented herein. The system can access a dataset of a plurality of geographic pairs. Additionally, the system can calculate a first outcome estimate based on a difference in response data and a difference in input data for a first geographic pair. Moreover, the system can calculate a plurality of experimental uncertainty estimates associated with the plurality of geographic pairs during an experimental time interval. The system can access historical data associated with the plurality of geographic pairs. Furthermore, the system can determine a beta value and a trim rate that reduces a sum of the plurality estimates. Subsequently, the system can remove, based on the first outcome estimate and the beta value, the first geographic pair from the plurality of geographic pairs to generate the first subset of geographic pairs.

Abstract: Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query that includes a bounded recursive pattern query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries that include bounded recursive patterns on top of the relational engine by avoiding any change in the existing SQL engine.

Abstract: A method of database operations includes receiving a user query, generating a query vector embedding representative of the user query, querying a vector database using the query vector embedding, retrieving a first database vector of the plurality of database vectors based on the query and representative of a first data file corresponding to a first time and belonging to a first time-series data set, receiving a first plurality of delta encodings describing differences between vector representations of temporally-adjacent data files of the first time-series data set, identifying a second data file of the first time-series data set having a second vector representation that differs from the first database vector and corresponds to a second time, and retrieving the second data file from a database.

Abstract: A coupling table search device 530 includes: input means 531 that receives an input of a coupling index from a coupling index storage unit 520; search plan generation means 532 that calculates, for each coupling index, the number of results that is the number of couplable record pairs estimated in a case where a record in a target column is found using the coupling index for each similarity function, and generates a search plan that defines a use order of the coupling index in descending order of the calculated number of results; and record search means 533 that searches for a record in the target column by using the coupling index in the order defined in the search plan, and specifies the external table in which records whose number is equal to or larger than a predetermined threshold have been found as a coupling table.

Abstract: Systems and techniques for optimizing hub resources and maximizing hub throughput based on dual-stream resource optimization (DSRO). In embodiments, a first flow of units arriving to the hub from customers to be loaded into departing trains is represented as a consolidation stream, and a second flow of units arriving to the hub via arriving trains to be unloaded and delivered customers is represented as a deconsolidation stream. A time-space network is generated for each of the consolidation and deconsolidation streams, and included in a DSRO model. Each stage of the streams is represented as a node of the corresponding time-space network in the DSRO model, which also models resource interdependence between the streams. An operating schedule based on the DSRO model optimizes the resources over a planning horizon to ensure they are allocated to both streams fairly so as to maximize the unit flow during operations.

Abstract: A document architecture system includes an intelligent document processing engine that can receive raw data streamed from external data source(s), analyze the raw data to identify triggering events, apply rules to the triggering events identified, break down the raw data accordingly, and generating messages in an internal format to represent the pieces of data without any formatting or layout information. The messages can be augmented with custom metadata and stored as fragments that reference, but that do not physically incorporate, the messages. The stored fragments can be used by the document process engine to intelligently render documents and versions thereof. Some embodiments store only unique fragments, resulting in a significant reduction in storage requirements and an extremely efficient way of processing huge amounts of data (e.g., millions of documents) for document production. The messages and fragments are in internal formats under control of the document architecture system.

Abstract: Resegmenting chunks of data for load balancing is disclosed. A plurality of first chunks of data is received. The plurality of first chunks of data includes one or more entries that include raw data produced by a component of an information technology environment and that reflects activity in the information technology environment. The plurality of first chunks of data is resegmented into a plurality of second chunks of data based on a source type of the plurality of first chunks. A first subset of the plurality of second chunks of data is distributed to a first indexer of a set of indexers. An occurrence of a trigger event is determined, and in response to the trigger event, a second subset of the plurality of second chunks of data is distributed to a second indexer of the set of indexers.

Abstract: A versioning group cache system uses cache keys which each include, amongst other things, version information and a group key. When a cache key is first updated to include these, the cache system determines the group key and adds version information thereto to produce the cache key, which is mapped to cached data. When the cache key is later updated, the version information is updated to produce an updated cache key which is mapped to the cached data. The cache key updating is in response to a change request received at the cache system. The change request includes a command processable at the cache system in connection with cached data and/or cache keys. For example, the change request may be a request for a batch deletion of cache keys. The versioning group cache system fulfills the change requests with efficient use of system resources.

Abstract: Embodiments of the present disclosure provide techniques for efficiently and accurately performing propagation of search-head specific configuration customizations across multiple individual configuration files of search heads of a cluster for a consistent user experience. The cluster of search heads may be synchronized such that the search heads operate to receive the configuration or knowledge object customizations from one or more clients from a central or lead search head. To reduce the amount of data that is transferred during propagation, the list of configuration or knowledge object customizations maintained in each search head is filtered from the list of the lead search head until a divergence point is determined. Once determined and communicated to the lead search head, the lead search head sends the configuration and knowledge object customization data that is absent from the internal list of the member search head.

Abstract: In a computer-implemented method for storing data in a network of linked computing units (10, 20, 30, 40, 50, 60) using a distributed transaction database (GDB), a distributed transaction database (GDB) in the form of a distributed graph database formed using nodes is used, and data is stored in at least one node (N) of the graph database, wherein the node (N) is stored using a real sub-quantity of the computing units (10, 20, 30, 40, 50, 60) of the network. The computer program product can be loaded directly into a storage device of an electronic computing unit (10, 20, 30, 40, 50, 60) and has program means in order to early out the steps of the method when the program is ran in a computing unit. The network of linked computing units (10, 20, 30, 40, 50, 60) stores a distributed transaction database (GDB) in the form of a distributed graph database comprising nodes (N) in which data is stored according to such a method.

Abstract: Methods and systems are described for providing content, such as a movie, with dialogue including a quotation that was input. For example, using a voice search a viewer may input a quotation famous from a movie to find the original fil and related content. The methods and systems use a quotation engine in a digital device to receive an input including the quotation and access a plurality of content items that include dialogue. The quotation engine identifies a subset of content items that include dialogue similar to the input quotation. The quotation engine accesses metadata of each of the subset of content, ranks the subset based on predetermined criteria and the metadata, and provides the ranked subset of the plurality of content items for consumption. The quotation engine may use a graphical user interface to identify the earliest release, trending content, or the program best known for the quote.

Abstract: Systems and methods include determination of a plurality of features, determination, for each of the plurality of features, of a feature vector based on a taxonomy of logical entities, combination of the determined feature vectors into a composite feature vector, determination of an operator based on the composite feature vector, and determination of a new feature based on the operator.

Abstract: An example file server manager updates a selected share of a destination distributed file server based on a snapshot of at least a portion of a selected share of a source distributed file server. The selected share of the destination distributed file server is updated while the source distributed file server serves client requests for storage items of the selected share of the source distributed file server. The file server manager receives a request to failover from the source distributed file server to the destination distributed file server and configures the destination distributed file server to service read and write requests for storage items of the selected share of the destination distributed file server. The file server manager further redirects client requests for storage items of the selected share of the source distributed file server to the destination distributed file server by updating active directory information.

Abstract: A system is disclosed to build and store a data model and queries for a graph database. In various embodiments, data defining one or more aspects of a data model associated with a graph database is received. A set of data that represents the data model is stored as a graph that includes one or more nodes to represent each of the following: data model metadata, one or more node labels comprising the graph database, one or more relationship types of the graph database, and one or more property definitions each associated with a property of at least one of a node label and a relationship type of the graph database.

Abstract: At least one processor configured to perform operations including receiving data from a plurality of disparate data sources; distilling the data into a plurality of indexes to convert the data into the plurality of indexes to be usable by a single data structure; retrieving a first set of data elements from the plurality of indexes associated with a first plurality of entities; retrieving a second set of data elements from the plurality of indexes associated with a second plurality of entities; generating a predicted duration of time that the first plurality of entities will remain in a first position using the second set of data elements associated with the second plurality of entities; assigning a first velocity index to each of the first plurality of entities to obtain a plurality of first velocity indexes; assigning a second velocity index to each of the second plurality of entities to obtain a plurality of second velocity indexes; comparing each of the first velocity indexes to other first velocity index

Abstract: Various embodiments of the present disclosure relate to a computer-implemented method of receiving a header associated with an object, where the header includes a limit value that specifies a quantity of times the object is to be served from a cache device before revalidation, and a current count value that specifies a number of times that the object has been served since a most-recent revalidation or load, receiving a request for the object from a requesting device, and upon determining that the current count value is below the limit value, serving the object to the requesting device from the cache device, or upon determining that the current count value matches the limit value, transmitting a request for revalidating the object.

Abstract: Systems, methods, and storage media for selective graph-based disclosure of a computer data structure are disclosed. Exemplary implementations may: generate a plurality of nodes from the computer data structure; generate at least one first subcomponent indicating at least one identifier for each of the plurality of nodes; generate at least one fourth subcomponent for each property possessed by each of the plurality of nodes; cryptographically sign the plurality of subcomponents with a cryptographic private key held by at least one user; assign a common identifier for the computer data structure to each of the plurality of subcomponents; and disclose at least one of the subcomponents by presenting the subcomponent along with a cryptographic signature of the subcomponent by the at least one user.

Abstract: Systems and methods for generating tables are provided. The systems and methods perform operations comprising accessing a text document comprising a plurality of strings; processing the text document by a machine learning model to generate a table comprising a plurality of entries that organizes the plurality of strings into rows and columns over a plurality of iterations; and at each of the plurality of iterations, estimating by the machine learning model a first value of a first entry of the plurality of entries based on a second value of a second entry of the plurality of entries that has been determined in a prior iteration.

Abstract: There is provided a data interworking method between a oneM2M system and an NGSI-LD system. The data interworking method according to an embodiment of the present disclosure includes: retrieving, by an IPE, resources in the oneM2M system that perform data interworking with the NGSI-LD system; retrieving labels of the retrieved resources; acquiring a mapping-rule from the retrieved labels; and storing the acquired mapping-rule. Accordingly, data interworking between data platforms using different standards is performed more easily, so that technology may go one step further to the goal of interconnecting and servicing all things in a global environment as IoT ultimately pursues.

Abstract: Systems and techniques are provided for processing streaming data. For example, a process can include obtaining, by an edge device, a plurality of data streams corresponding to objects, activities, or events registered in an edge environment associated with the edge device. One or more machine learning networks implemented on the edge device can generate a plurality of features and/or embeddings corresponding to each respective data stream of the plurality of data streams. The edge device can determine a subset of salient content from the plurality of data streams, based on analyzing the plurality of features and/or embeddings generated for each respective data stream. The edge device can generate index information corresponding to the determined subset of salient content. The subset of salient content and the generated index information can be stored locally at the edge device for search and retrieval based on local queries received at the edge device.

Abstract: One or more embodiments of the invention provides a system for extracting combinations of arbitrary numbers of media, included in a possessed medium group and having high frequencies of occurrence, in a game that proceeds as a user selects media from the possessed medium group and places the media in a game field, the individual media included in the possessed medium group being individually selected from a medium set preset in the game, the system including: a plurality of computing devices that each store possessed medium group information concerning possessed medium groups that are used by a plurality of predetermined users; and a control device that stores the possessed medium group information and that controls parallel processing of the operations of the individual computing devices, the control device allocating and sending sets constituted of a plurality of extracted media to the individual computing devices.

Abstract: Various embodiments relate generally to data science and data analysis, computer software and systems, and network communications to interface among repositories of disparate datasets and computing machine-based entities configured to access datasets, and, more specifically, to a computing and data storage platform configured to provide one or more computerized tools to deploy predictive data models based on in-situ auxiliary query commands implemented in a query, and configured to facilitate development and management of data projects by providing an interactive, project-centric workspace interface coupled to collaborative computing devices and user accounts.

Abstract: Systems and methods are disclosed for online distribution of content based on a user sentiment index. The method may include receiving, over a network and from a user device, one or more user generated inputs and calculating the user sentiment index based on the one or more user generated inputs. The method may also include receiving, over the network, from a content or advertising provider, instructions on publishing content or advertising to a webpage based on the calculated user sentiment index, and publishing content for display on user devices over the network based on a comparison of the calculated user sentiment index and the received instructions.

Abstract: An encoding method for a key Trie includes generating a plurality of meta data by applying encoding to a portion of non-leaf nodes of the key Trie, and storing an encoding result of the key Trie into a storage device, wherein the encoding result includes the plurality of meta data corresponding to the portion of non-leaf nodes, respectively.

Abstract: Aspects of the subject disclosure may include, for example, receiving, over a communication network, a first message utilizing a first messaging application from a first communication device associated with a first user and identifying a recipient of the first message as a second user associated with a second communication device. Further embodiments can include determining that the second user utilizes a second message application to exchange a first group of messages via the second communication device resulting in a first determination, and transmitting, over the communication network, the first message to the second communication device utilizing the second messaging application based on the first determination. Other embodiments are disclosed.

Abstract: A plant water need computing system and method for forecasting water need to optimize irrigation efficiency while ensuring that a plant grows at optimal water availability. The plant water need computing system and method use a computational input and output balance model (CIOB model) implemented on a server to calculate irrigation need (IR) predictively. The CIOB model is implemented as a service through a representational state transfer application program interface (REST API). Registered clients get access to the API through a client application. Field identifier is passed by the client application to the CIOB model in an API request. The CIOB model sends an API response to the client application. The API response comprises irrigation need (IR). The CIOB model uses a computational module to calculate the IR and uses machine learning to optimize the plant water need.

Abstract: Embodiments of the present disclosure are directed to systems and methods for managing a database. In one or more examples, the system obtains input data comprising one or more data entries, where each data entry comprises one or more data items, and each data item comprises a field name and a field value. The system can generate a key-value set for each data item to obtain a plurality of key-value sets. Each key-value set includes at least a first key element comprising the field name of the respective data item and a second key element comprising the field value of the respective data item. The system can sort and store the plurality of key-value sets in the database. The system can further receive a query indicative of a field name or a field value, and generate, for display, an output based on retrieved key elements sets based on the query.

Abstract: Techniques are described herein for translating source code using sparse-self attention. In various implementations, a source code snippet in a first programming language may be processed to obtain graph(s) representing snippet tokens, and relationships therebetween. Based on the graph(s), a subset of snippet token pairs may be identified from a superset of all possible token pairs in the source code snippet. Each token pair of the subset may include snippet tokens that are represented by nodes connected by one or more edges of the one or more graphs. A self-attention network of a translation machine learning model may be adapted to sparsely attend across the identified subset of token pairs. The source code snippet may then be processed based on the adapted translation machine learning model to generate a translation of the source code snippet in the second programming language.

Abstract: Systems, methods, and data structures for providing a file system with object versioning support are provided. Rather than adding object records for each version of an object to a chapter record, in one example, the chapter record may be limited to a single object record for the object including: (i) an object name of the object; (ii) an object file handle identifying an index of a file containing data of a current version of the multiple versions of the object; and (iii) a version table file handle identifying an index of a file containing a version table. In this manner, enumeration of objects associated with a given chapter may be performed more efficiently and prior versions of objects may be maintained within the version table without disproportionate growth of chapter records and without increasing the search depth with objects that are not referenced by the search at issue.

Abstract: A system that synchronizes waveforms received over a network from one or more devices, such as medical devices. Because of network delays or losses, waveforms can arrive at varying rates and times. Precise post-synchronization of the received data, to within a few milliseconds, is needed for accurate analysis. Applications include automatic classification of waveforms, such as detection of myocardial infraction from heart monitor waveforms. Synchronization uses sequence numbers assigned by each device, but must also account for sequence number wraparounds. Waveforms may also be synchronized across devices, by calculating the bias between within-device synchronized times and a common time source or common disturbance. Waveform data may also be stored data in a database or data warehouse; embodiments may index the data using a key with a date-time prefix and a hash code suffix, to support distributed indexing while reducing the chance of hash collisions to a very small probability.

Abstract: A system, method, and computer-readable medium are disclosed for performing a data schema mapping operation. The data schema mapping operation includes receiving product information comprising a first document corresponding to a first data schema, the first data schema comprising an unspecified JavaScript Object Notation (JSON) schema; identifying a plurality of components within the first document corresponding to the first data schema, the plurality of components comprising JSON data elements; identifying a second plurality of components corresponding to a second data schema, the second data schema being associated with a data center services provider, at least some of the second plurality of components being associated with a relational database; mapping a component of the document corresponding to the first data schema to a component corresponding to the second data schema, the mapping providing a second document; and, accessing the second document via a data access application program interface.

Abstract: Methods, systems, and computer storage media for providing a unified multilayer-based index for a contextual geoanalytics engine in a data analytics system. The contextual geoanalytics engine is configured to aggregate point-of-interest geographical data from multiple data sources into an aggregate or composite dataset. The contextual geoanalytics engine then transforms and maps the data into a homogenous dataset—i.e., a location embedding record that is homogenous representation of an aggregated dataset—comparable across global geographical regions. The homogenous dataset is accessible via the unified multilayer-based index that is a single geographical index, where the homogenous dataset is a composite of different datasets. The data includes different data types, where the data types are stored in different layers while sharing a common index (i.e., unified multilayer-based index).

Abstract: One or more identifiers respectively corresponding to a one or more logical blocks in an electronic file system volume is selected. One or more logical blocks respectively corresponding to the selected one or more identifiers is analyzed according to one or more criteria. A value is assigned to one or more indicators associated with each of the one or more logical blocks and corresponding to the one or more criteria, in response to the analyses of the corresponding one or more logical blocks. A representation of the one or more indicators, and their respective assigned values, associated with each of the one or more logical blocks that was analyzed according to the one or more criteria, is generated. In some embodiments, an action to be performed on or with an electronic file mapped to the logical blocks is controlled based on one or more of the values assigned to the one or more indicators associated with the one or more logical blocks.

Abstract: Systems and methods for processing qualitative responses from a plurality of user devices whereby a selection of a next thought object, to deliver to a first user device, may be based on a plurality of qualitative responses received from a plurality of user devices. In a preferred embodiment, a thought object selection computer may compute the selection by determining a filtered set of thought objects by custom selection. In some embodiments, if the quantity of the filtered set of thought objects is greater than a pre-configured amount the selection may be computed by randomly selecting a subset of the filtered set of thought objects. Further filtering the filtered set of thought objects by determining one or more least seen thought objects, and selecting a most diverse thought object, updating the filtered set of thought objects and sending the filtered set of thought objects to the first user device.

Abstract: Systems and techniques are provided for processing streaming data. For example, a process can include obtaining, by an edge device, a plurality of data streams corresponding to objects, activities, or events registered in an edge environment associated with the edge device. One or more machine learning networks implemented on the edge device can generate a plurality of features and/or embeddings corresponding to each respective data stream of the plurality of data streams. The edge device can determine a subset of salient content from the plurality of data streams, based on analyzing the plurality of features and/or embeddings generated for each respective data stream. The edge device can generate index information corresponding to the determined subset of salient content. The subset of salient content and the generated index information can be stored locally at the edge device for search and retrieval based on local queries received at the edge device.

Abstract: A search system as disclosed analyzes a file name to identify any potential tokens or words that might be relevant, and creates supplementary information for the file name. The supplementary information is indexed and searchable, thereby significantly improving the ability of a search engine to discover and return successful search hits.

Abstract: Methods are provided, such as a method of interacting with a large language model (LLM), including the step of a processing system using a structured, machine-readable representation of data that conforms to a machine-readable language, such as a universal language, to provide new context data for the LLM, in order to improve the output, such as continuation text output, generated by the LLM in response to a prompt; and such as a method of interacting with a LLM, including the step of providing continuation data generated by the LLM to a processing system that uses a structured, machine-readable representation of data that conforms to a machine-readable language, such as a universal language, in which the processing system is configured to analyse the continuation output generated by the LLM in response to a prompt to enable an improved version of that continuation output to be provided to a user. Related computer systems are provided.

Abstract: Embodiments are directed to techniques for interacting with a hierarchical video segmentation using a metadata panel with a composite list of video metadata. The composite list is segmented into selectable metadata segments at locations corresponding to boundaries of video segments defined by a hierarchical segmentation. In some embodiments, the finest level of a hierarchical segmentation identifies the smallest interaction unit of a video—semantically defined video segments of unequal duration called clip atoms, and higher levels cluster the clip atoms into coarser sets of video segments. One or more metadata segments can be selected in various ways, such as by clicking or tapping on a metadata segment or by performing a metadata search. When a metadata segment is selected, a corresponding video segment is emphasized on the video timeline, a playback cursor is moved to the first video frame of the video segment, and the first video frame is presented.

Abstract: A mechanism is provided in a data processing system for displaying cyber threat data in a narrative format. The mechanism receives a cyber threat information file that comprises cyber threat data in a serialized format. The mechanism generates a tree data structure representing relationships between objects in the cyber threat data and generates a user interface presenting the cyber threat data in a narrative format based on the tree data structure. The mechanism presents the user interface to an analyst.

Abstract: Concepts for creating a metatype tree for metatype introspection are presented. One example comprises decoding a parent metatype from a synthetic dataset by decoding one or more child metatypes of the parent metatype. The method then comprises creating a metatype tree comprising a parent node and one or more child nodes of the parent node. The parent node comprises the decoded parent metatype and the one or more child nodes of the parent node comprise the one or more decoded child metatypes.

Abstract: Disclosed is a method of predicting a block vector in a multi-view image, the method including allowing an encoder to determine a reference block of a reference image for a specific block of a depth image or a specific-view image among multi-view images, allowing the encoder to determine block vector information for intra block copy (IBC) of the specific block on the basis of a block vector of the reference block when the reference block is encoded using the IBC, and allowing the encoder to encode the block vector information of the specific block. The reference image of the specific view is an image of another view, and the reference image of the depth image is a texture image corresponding to the depth image.

Abstract: Disclosed are systems, methods, and devices for presenting customer insights in association with an electronic customer relationship management tool. A graphical user interface (GUI) is presented to a user. The GUI has a first region having GUI elements of the customer relationship management tool, and a second region having GUI elements for presenting at least one customer insight, the second region displayed when the first region is displayed and proximate to the first region. Upon receiving an identifier identifying a particular customer, at least one machine-learning derived insight relevant to the identified customer is displaying to the user in the second region when receiving user input signals via the GUI elements of the first region.

Abstract: Described herein is a technique to facilitate filtering during candidate retrieval stage performed by an information retrieval system that utilizes embedding models. An aNN indexing structure is created for each end-user, and in some instances, each activity type. This allows a single request for candidate content items to invoke a single process to obtain content items that satisfy the filtering criteria (e.g., in this case, the in-network requirement) from the separate per-end-user indexes.

Abstract: Techniques are disclosed relating to performing a join operation with bitmap indexes of virtual data sources (VDSs). A distributed compute cluster having a set of compute nodes may maintain a plurality of VDSs based on a set of corresponding origins. A given VDS of the plurality of VDSs may include a bitmap index representative of a portion of data stored at the set of origins. The distributed compute cluster may receive a request for data stored across at least first and second bitmap indexes of the plurality of VDSs. The distributed compute cluster may perform a join operation to generate a join result having data from the first and second bitmap indexes. The distributed compute cluster may return a response that includes the join result.

Abstract: A digital advertising system includes at least one processor configured to execute a plurality of functional modules including an analytics module to receive and analyze client attributes associated with a website visitor and a requested website to define an analytics event. The analytics module ingests and enriches data within the analytics event and provides it to a machine learning module that generates prediction models for potential bids. A management platform receives the bidding prediction and generates candidate configs. An optimization module receives the candidate configs and applies weights and additional features to select a config and generate an optimized script for the selected config. A deployment module receives the optimized script and delivers the script to the website visitor.