Abstract: A method includes obtaining an incident report and assigning an incident type to the incident report. The method also includes determining that the incident type has not been assigned to any prior incident reports and generating a prompt associated with the incident type based on determining that the incident type has not been assigned to any prior incident reports. The method also includes generating a response to the incident report based on the prompt using a large language model (LLM).

Abstract: Apparatuses, systems, and methods are provided for managing events in a Geographic Information System (GIS). A first event may be detected which is associated with a change made via a mapping interface of the GIS. Information associated with the first event may be cached in a memory of a computing device. A second event associated with committing of the change in a database of the GIS may be detected, and in response to detecting the second event, a new event that is a transformation of the first event stored in the memory, the second event or both may be generated.

Abstract: A system, by a processing entity (PE), determines records stored in a memory shared by other processing entities. A respective record comprises a key and a corresponding index indicating a physical location in the shared memory. The PE stores, in a DRAM partition, burst tree data obtained by performing a burst sort on a portion of the records. The PE moves data stored in the DRAM partition to a partition of the shared memory in response to a size of the stored data exceeding a predetermined threshold. The PE obtains sorted keys and corresponding indices for the records by sorting the burst tree data stored in shared memory partitions. The PE facilitates a sorted retrieval of the records in the shared memory while leaving the records in the respective physical location in the shared memory by writing the sorted keys and indices to the shared memory.

Abstract: A method for enabling users to conversationally interact with a data table comprises receiving by a virtual assistant server from a user device, a natural language query targeted at a data table. The virtual assistant server determines one or more table intents or one or more table sub-intents of the natural language query. The virtual assistant server determines one or more table operations to execute on the data table based on the determined table intents or table sub-intents. The virtual assistant server iteratively executes each of the determined table operations on the data table, where a final version of the data table results after completion of one or more of the iteratively executed determined table operations. Subsequently, the virtual assistant server determines a response to the natural language query based on the final version of the data table and outputs the determined response to the natural language query to the user device.

Abstract: Methods for paginating search results retrieved from a database that supports cursor-based pagination are disclosed. The method includes executing a first search on a first database. The first search is executed using a first search query and execution of the first search returns a first set of search results from the first database and a first opaque cursor. The method further includes processing at least a first subset of the first set of search results, selecting at least a second subset of the at least first subset of search results, and generating a first cursor object. The first cursor object including a Subitem value in accordance with all search results from the first set of search results being unprocessed. The Subitem value based on a number of results from the first set of search results processed in the at least first subset of search results.

Abstract: An approach and corresponding computer system adapted for combining relational and non-relational data storage and indexing techniques is proposed. The approach utilizes graph data structures that are specifically configured for supporting performance improvements in relational querying while maintaining the advantages from a non-relational database. The graph data structures can be used for graph traversals and graph operations, among others, which can improve an overall computational complexity level associated with various operations at the cost of storage.

Abstract: Systems and methods for automatically generating preliminary hashtag(s) for a video asset uploaded to an online platform and sampling them with related videos on the online platform are disclosed. Upon the upload of the video asset, the system automatically analyzes the metadata associated with the video asset to generate preliminary hashtags. The preliminary hashtags are used to find and sample related videos that include one or more hashtags that are related to the preliminary hashtag. Based on the sampling analysis, a determination is made whether to retain or delete the preliminary hashtag and whether to adopt the one or more hashtags from the related videos. The video asset may be tagged with the preliminary hashtag and/or the adopted hashtag if the hashtag is approved by the user and complies with the platform policy. The tagged hashtag may be updated to keep it current and periodically sampled with related video assets.

Abstract: A computer-implemented method of partitioning a blockchain network into shards is disclosed. The method comprises the steps of identifying a transaction id of a blockchain transaction and allocating the transaction to a shard based on the transaction id.

Abstract: A method for technical issue resolution. The method includes: receiving, from a user, a text query concerning a technical issue; obtaining query-related context relevant to the text query; and processing, through a large language model (LLM), the text query and the query-related context to produce a multimodal query response used by the user to address the technical issue. More specifically, embodiments described herein utilize text topic and zero shot classification models to translate multimodal technical documentation (e.g., including text and images) into topic relevant metadata; and process queries, pertaining to technical issues, using a multimodal LLM provided with query-related text and image context derived from said topic relevant metadata.

Abstract: Example solutions for optimizing an initial query execution plan for a federated database includes identifying a group of operations in the initial query execution plan that conform to a recognized pattern including fetching data from a data store. Based on detection of the pattern and of the presence of a condition, an optimized query execution plan is created from the initial query execution plan by replacing the group of operations with a first execution branch and a second execution branch, wherein the optimized query execution plan executes at least one of the first and second execution branches. The first execution branch includes first operations for fetching the data from a first data store and the second execution branch comprise second operations for fetching at least a subset of the data from a second data store.

Abstract: Systems and methods for textual replacement can include the determination of a visual intent, which can trigger an interface for selecting an image to replace visual descriptors. The visually descriptive terms can be identified, and an indicator can be provided to indicate the text replacement option may be initiated. An image can then be selected by a user to replace the visually descriptive terms.

Abstract: Methods and systems for tensor network contraction are provided. A method implemented by a computing host comprises obtaining a contraction tree associated with a tensor network, wherein a plurality of vertices and edges of the contraction tree correspond to a set of tensor nodes and indices of the tensor network, respectively; iteratively performing operations until a termination condition is satisfied, the operations including selecting a sub-graph of the contraction tree; replacing the sub-graph with a local optimal sub-graph; and obtaining an optimized contraction tree including the local optimal sub-graph; and outputting the optimized contraction tree.

Abstract: A method including receiving an input including a number of texts from a source of text and a number of images from a source of images. The texts are separate from the images. The input is embedded into a first data structure that defines first relationships among the images from the source of images and the texts from the source of text. The first data structure is compared to an index including a second data structure that defines second relationships among a number of pre-determined texts and a number of pre-determined images. The pre-determined texts have known relationships to the pre-determined images. Each pre-determined image in the pre-determined images is related to one or more instances of the pre-determined texts. A subset of images, those images in the pre-determined images for which matches exist between the first relationships and the second relationships, is returned from the pre-determined images.

Abstract: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to a process for providing an explanation result for an analytical model. A system can comprise a memory that stores computer executable components, and a processor that executes the computer executable components stored in the memory, wherein the computer executable components can comprise an uncertainty component that determines an uncertainty score for a distribution of samples that neighbor a selected input to an analytical model, a sampling component that identifies a subset of the distribution of samples based on the uncertainty score, and an explanation component that generates an explanation of an output of the analytical model, corresponding to the selected input, based on use of a sample from the subset of the distribution of samples.

Abstract: A validation system enables concurrent visual validation of multiple electronic documents. A processor generates a custom user interface (UI) framework comprising two sections. The first section displays document previews, while the second holds extracted data, including identifiers for document and page IDs, along with entity positions and associated values across the documents. Upon user input on a specific document entity in the second section, the validation system concurrently loads document previews in the first section, displaying corresponding data values from the multiple documents. The updated visualization allows for validation and review operations across the documents, utilizing the received user input and loaded information.

Abstract: Image data captured at vehicles is transmitted and stored remotely from vehicles. To prevent redundant transmission and storage of image data, a reference metadata database is implemented, where metadata is stored corresponding to image data. Before transmitting image data from a vehicle and storing the image data remotely, metadata corresponding to the image data is evaluated against the reference metadata database to determine whether the image data is already stored remotely from the vehicle. Where the metadata corresponding to the image data is already in the reference metadata database, the image data is not re-transmitted or stored in duplicate. Where the metadata corresponding to the image data is not already in the reference metadata database, the image data is transmitted from the vehicle and stored in the image data database.

Abstract: A method of encoding a query graph having m root nodes and n leaf nodes includes receiving m×n path queries representing the query graph, where each path query starts with a root node and ends with a leaf node, and where the query graph includes one or more missing nodes or edges between nodes. Positions of each node and edge within each path query are encoded independently, where the encoded positions include a positional order, and positional counter values that are reset at a start position of each path query. The missing nodes or edges are masked to produce a masked query that is fed to a transformer encoder. The method can be used for, but is not limited to, medical uses, such as for predicting protein-drug interactions or medical conditions, as well as other applications, to support decision making or optimizing processes or predictions.

Abstract: Aspects described herein may relate to methods, systems, and apparatuses that partitions searchable content and distributes the segments across a plurality of processing nodes, which in turn further sub-partitions the partitions for processing by local search actor in order to increase the speed with which a search request from a user is processed. Processing nodes available to receive partitioned searchable content are registered with an external storage device. The external storage device also maintains a global results collector that compiles results from the partitions of searchable content. Respective local collector actors receive compiled results from local search actors for a processing node and the compiled results are sent to the global results collector for compiling for the plurality of processing nodes. Results of the user search request are then provided to the user.

Abstract: Methods for paginating search results retrieved from multiple databases are disclosed. Method includes receiving a search request; executing, based on the search request, a first search on a first database to return a first result set and a second search on a second database to return a second result set. The method also includes selecting a first subset from the first result set, generating a first cursor object based on a number of search results selected in the first subset, selecting a second subset from the second result set, and generating a second cursor object based on a number of search results selected in the second subset. Further, the method combines the first and second subsets into a first page of search results, combines the first and second cursor objects into a combined cursor object; and returns the first page of search results and combined cursor object to the client application.

Abstract: A memory for storing data for access by an application program includes an encoded sequential query representing m×n path queries of a query graph having elements including m root nodes and n leaf nodes, and a missing element, wherein m and n are integer values. Each of the path queries includes a root node as a start position and a leaf node as an end position, wherein positional encodings of the elements include a positional order within each path query, wherein the positional encodings of the elements include counter values that are reset at a start position of each of the path queries, and wherein the missing element is masked. The memory can be used for, but is not limited to, medical uses, such as for predicting protein-drug interactions or medical conditions, as well as other applications, to support decision making or optimizing processes or predictions.