Abstract: A distributed metadata cache for a distributed object store includes a plurality of cache entries, an active-cache-entry set and an unreferenced-cache-entry set. Each cache entry includes information relating to whether at least one input/output (IO) thread is referencing the cache entry and information relating to whether the cache entry is no longer referenced by at least one IO thread. Each cache entry in the active-cache-entry set includes information that indicates that at least one IO thread is actively referencing the cache entry. Each cache entry in the unreferenced-cache-entry set is eligible for eviction from the distributed metadata cache by including information that indicates that the cache entry is no longer actively referenced by an IO thread.

Abstract: Techniques are described that support automated generation of a digital document from digital videos using machine learning. The digital document includes textual components that describe a sequence of entity and action descriptions from the digital video. These techniques are usable to generate a single digital document based on a plurality of digital videos as well as incorporate user-specified constraints in the generation of the digital document.

Abstract: A first UE can receive a request to communicate from a second UE. The first UE and the second UE can exchange a first cryptographic key and a second cryptographic key associated with the first and the second UE, respectively. The first UE can receive an encrypted unique identifier associated with the second UE, where the unique identifier identifies a second wireless telecommunication network serving the second UE. The first UE can authenticate the second UE by sending the encrypted unique identifier to a first wireless telecommunication network and sending a request to confirm that the unique identifier is valid. The first UE can receive, from the first wireless telecommunication network, a confirmation that the unique identifier is valid. Upon receiving the confirmation, the first UE can engage in a communication with the second UE.

Abstract: Obtaining an approximate unique count for a column from a table from a database includes, generating, for a value from an unevaluated row, a hash value in a defined range of hash values, determining a cardinality of leading zeros in the hash value, identifying a bucket with respect to the hash value from a plurality of buckets corresponding to the defined range of hash values, wherein the buckets from the plurality of buckets correspond with respective non-overlapping portions of the defined range of hash values, such that the hash value is in the portion of the defined range of hash values corresponding to the bucket, and appending to an unsorted sparse representation a bucket identifier for the bucket and the cardinality of the leading zeros, and, in response to a determination that unevaluated rows are unavailable in the table, determining the approximate unique count using the unsorted sparse representation.

Abstract: Various embodiments herein each include at least one of systems, methods, and software for value transfer between disparate systems. One such embodiment includes receiving a transfer request to transfer a value from a first account provider to an account maintained with a second account provider and including data identifying an individual or entity that initiated the transfer request. This method also includes identifying the second account provider based on data included in the transfer request and generating a request to transfer the value of the transfer request to the account in a format compatible with the second account provider. The method may then transmit the generated request to the second account provider.

Abstract: A code change request prioritization tool that uses weighting values specific to pre-determined factors to concurrently calculate a total weighted prioritization score, is disclosed. The total weighted prioritization score may be calculated using a percentile score for factors as inputs in the calculation. Once a solution is found for a highest priority code change request, similar code defects may be identified so as to provide solutions to all similar defects, simultaneously.

Abstract: A system and a method are disclosed that efficiently supports an append operation in an object storage system. A size of data received with a request for an append operation from an application is determined based on a data-alignment characteristic of a storage medium. Data that is not aligned with the data-alignment characteristic is stored in persistent memory and aggregated with other data from the application that is not aligned with the data-alignment characteristic, while data that is aligned with the data-alignment characteristic is stored directly in the storage medium. Aggregated data that becomes aligned with the data-alignment characteristic as additional requests for append operations are received are migrated to the storage medium.

Abstract: Techniques for template generation from image content includes extracting information associated with an input image. The information comprises: 1) layout information indicating positions of content corresponding to a content type of a plurality of content types within the input image; and 2) text attributes indicating at least a font of text included in the input image.

Abstract: Various embodiments herein each include at least one of systems, methods, and software for value transfer between disparate systems. One such embodiment includes receiving a transfer request to transfer a value from a first account provider to an account maintained with a second account provider and including data identifying an individual or entity that initiated the transfer request. This method also includes identifying the second account provider based on data included in the transfer request and generating a request to transfer the value of the transfer request to the account in a format compatible with the second account provider. The method may then transmit the generated request to the second account provider.

Abstract: Techniques for template generation from image content includes extracting information associated with an input image. The information comprises: 1) layout information indicating positions of content corresponding to a content type of a plurality of content types within the input image; and 2) text attributes indicating at least a font of text included in the input image.

Abstract: Techniques for template generation from image content includes extracting information associated with an input image. The information comprises: 1) layout information indicating positions of content corresponding to a content type of a plurality of content types within the input image; and 2) text attributes indicating at least a font of text included in the input image. A user-editable template having the characteristics of the input image is generated based on the layout information and the text attributes.

Abstract: State-sequence pathing in a low-latency data access and analysis system includes obtaining, by the low-latency data access and analysis system, predicate data responsive to a request for data expressed in previously obtained data expressing usage intent, obtaining, by the low-latency data access and analysis system, state-sequence pathing criteria identified with respect to the predicate data, obtaining, by the low-latency data access and analysis system, state-sequence path data in accordance with the predicate data and the state-sequence pathing criteria, wherein the state-sequence path data aggregates data representing multiple state-sequence paths, wherein a respective state-sequence path represents an ordered sequence of states of a system, wherein the states are represented individually by the predicate data, generating, by the low-latency data access and analysis system, state-sequence path visualization data for presenting a visualization of the state-sequence path data, and outputting, by the low-lat

Abstract: Methods, systems, and devices for wireless communications are described. An example method may include identifying that a user equipment (UE) includes a first subscriber identification module (SIM) card in a first card slot of a plurality of card slots of the UE is associated with a first operator and associated with a first subscription for which use of the UE is subject to a contractual obligation to the first operator. The method may further include determining that the UE is in communication with a first radio access network of the first operator and communicating in accordance with a second subscription associated with a second SIM card in a second card slot, the communicating allowed based at least in part on the first SIM card associated with the first operator being in the first card slot and the UE being in communication with the first radio access network.

Abstract: A code change request prioritization tool that uses weighting values specific to pre-determined factors to concurrently calculate a total weighted prioritization score, is disclosed. The total weighted prioritization score may be calculated using a percentile score for factors as inputs in the calculation. Once a solution is found for a highest priority code change request, similar code defects may be identified so as to provide solutions to all similar defects, simultaneously.

Abstract: A storage system. In some embodiments, the storage system includes a plurality of object stores, and a plurality of data managers, connected to the object stores. The plurality of data managers may include a plurality of processing circuits. A first processing circuit of the plurality of processing circuits may be configured to process primarily input-output operations, and a second processing circuit of the plurality of processing circuits may be configured to process primarily input-output completions.

Abstract: The present disclosure relates to a system and computer-implemented method for character recognition in a payment card. The method includes receiving an image of a payment card and one or more details associated with the payment card. Further, a derivative of the image is determined based on the one or more details and a horizontal sum of pixel values is determined for a plurality of rows in the image. Furthermore, one or more Regions of Interest (ROIs) are identified in the image by comparing the horizontal sum of pixel values with a predefined first threshold. Subsequently, one or more characters in the one or more ROIs are extracted using one or more peak values in a histogram of the one or more ROIs. Finally, each of the one or more characters extracted from the one or more ROIs is recognized using a trained Artificial Intelligence technique.

Abstract: Provided is a method of data storage in a data storage system, the method including identifying object headers respectively corresponding to object data, storing the object data at one side of an allocated data chunk, and storing the object headers at another side of the allocated data chunk.

Abstract: Systems and methods for multi-layered key-value storage are described. For example, methods may include receiving two or more put requests that each include a respective primary key and a corresponding respective value; storing the two or more put requests in a buffer in a first datastore; determining whether the buffer is storing put requests that collectively exceed a threshold; responsive to the determination that the threshold has been exceeded, transmitting a write request to a second datastore, including a subsidiary key and a corresponding data file that includes the respective values of the two or more put requests at respective offsets in the data file; for the two or more put requests, storing respective entries in an index in the first datastore that associate the respective primary keys with the subsidiary key and the respective offsets; and deleting the two or more put requests from the buffer.

Abstract: Described are methods and systems for improved cardinality estimation. A method may include obtaining a data-query, obtaining a row, generating a hash value, determining a cardinality of leading zeros in the hash value, identifying a bucket with respect to the hash value, including a bucket identifier and the cardinality of leading zeros in a representation, determining the approximate unique count, and outputting the approximate unique count as results data responsive to the portion of the data-query.