21st week of 2022 patent applcation highlights part 45 |
Patent application number | Title | Published |
20220164301 | STATUS CHECK USING SIGNALING - Methods, systems, and devices for status check using signaling are described. A memory system may receive ready signals from memory dies. The ready signal may indicate whether a memory die is available to receive a command. The memory system may generate an indicator of whether the memory die is available based on values of ready signals. The memory system may output the indicator to a controller over one or more pins based on generating the indicator. | 2022-05-26 |
20220164302 | ADAPTIVE I/O COMPLETION METHOD AND RECORDABLE MEDIUM STORING PROGRAM FOR THE SAME - In accordance with an aspect of the present disclosure, there is provided a method for adaptive I/O completion. The method comprises, determining whether an application is a foreground application or a background application; in response to the application determined to be the foreground application, determining whether the application is a CPU-bound application or an I/O-bound application; and applying an I/O polling method in response to that the application determined to be the foreground application and the I/O-bound application, and applying an interrupt method in response to that the application determined to be the foreground application and the CPU-bound application, or the application determined to be the background application. | 2022-05-26 |
20220164303 | OPTIMIZATIONS OF BUFFER INVALIDATIONS TO REDUCE MEMORY MANAGEMENT PERFORMANCE OVERHEAD - Methods, apparatus, systems, and articles of manufacture to manage memory in a computing apparatus are disclosed. Methods, apparatus, systems, and articles of manufacture to optimize or improve buffer invalidation to reduce memory management performance overhead are disclosed. An example apparatus includes an input-output memory management unit (IOMMU) circuitry to control access to memory circuitry, the IOMMU circuitry to increment a counter from a first value to a second value when a memory access to a location in the memory circuitry is allocated and to decrement the counter from the second value to the first value when the memory access to the location in the memory circuitry is deallocated; and an operating system (OS) memory manager to enable reallocation of the location in the memory circuitry when the counter is at the first value. | 2022-05-26 |
20220164304 | BUS ENDPOINT ISOLATION - An example of a controller for bus endpoint isolation can include an interface to couple to a bus that has respective communication channels and respective switches corresponding to endpoints of the bus, a processing resource, and a memory resource storing non-transitory instructions executable by the processing resource to select a first endpoint of the endpoints to receive a message from the interface via a first switch on a first communication channel associated with the first endpoint, cause, via a switch control mechanism, a second switch associated with a second endpoint of the bus to open to isolate the second switch; and responsive to causing the second switch to open, send the message via the first communication channel and the first switch to the first endpoint. | 2022-05-26 |
20220164305 | CROSS-THREADED MEMORY SYSTEM - A multi-chip package includes a logic integrated circuit (IC) die formed with plural memory controller circuits, a first memory IC die and a second memory IC die. The second memory IC die is mounted to the first memory IC die. The first memory IC die and the logic IC die are mounted to one another. The logic IC die includes a serial link interface for coupling to multiple serial links. The first memory die includes a first memory group accessed by a first one of the plural memory controller circuits, and a second memory group accessed by a second one of the plural memory controller circuits. | 2022-05-26 |
20220164306 | Direct Network Access by a Memory Mapped Peripheral Device for Scheduled Data Transfer on the Network - A network interface peripheral device (NIP) may include a network interface for communicating with a network, and an interconnect interface for communicating with a processor subsystem. First buffers in the NIP may hold data received from and/or distributed to peer peripherals by the NIP, and second buffers may hold payload data of scheduled data streams transmitted to and/or received from the network by the NIP. Payload data from the data in the first buffers may be stored in the second buffers and transmitted to the network according to transmit events generated based on a received schedule. Data may be received from the network according to receive events generated based on the received schedule, and distributed from the second buffers to the first buffers. A centralized system configuration entity may generate the schedule, manage configuration of the NIP, and coordinate the internal configuration of the NIP with a network configuration flow. | 2022-05-26 |
20220164307 | Test Codes for Secure Test Mode on Math Assistance Devices - A method for test configuration on a first math assistance device is provided that includes receiving a test code by the first math assistance device, wherein the test code includes one or more functionality restrictions, and entering secure test mode on the first math assistance device with the one or more functionality restrictions. | 2022-05-26 |
20220164308 | SYSTOLIC ARRAY PROCESSOR AND OPERATING METHOD OF SYSTOLIC ARRAY PROCESSOR - Disclosed is a processor according to the present disclosure, which includes processing elements, a kernel data memory that provides a kernel data set to the processing elements, a data memory that provides an input data set to the processing elements, and a controller that provides commands to the processing elements, and a first processing element among the processing elements delays a first command received from the controller and first input data received from the data memory for a delay time, and then transfers the delayed first command and the delayed first input data to a second processing element, and the controller adjusts the delay time. | 2022-05-26 |
20220164309 | SYSTEMS AND METHODS FOR DEALERSHIPS FOR OPTIMIZING CUSTOMER FINANCING OPTIONS - A method of providing a deal optimization web service for dealerships includes receiving rate sheets from subscriber dealerships, the rate sheets containing parameters and parameter data for at least some of parameters that define a new deal, mapping the parameters into fields of a database, formatting the data for storage in the database, and storing the updated database. A system has a server having at least one processor, a display device, and a local memory, the server connected to a network, a database connected to the server, and a network of dealerships connected to the server through the network, wherein the at least one processor is configured to execute code that causes the at least one processor to render a user interface on the display device that allows an administrative user to enter data into the database in a pre-defined format, the pre-defined format configured standardize and configure the data in the database for efficient searching by end-users. | 2022-05-26 |
20220164310 | Systems And Methods For Remote Storage Of Information Associated With A Distributed Ledger Network - The disclosure is directed to, among other things, systems and methods for remote storage of information associated with a node of a distributed ledger network. In some embodiments, the systems and methods described herein may involve providing, by a first node of a distributed ledger network of nodes and to a first server, first information associated with the first node, wherein the network of nodes includes a network of vehicles. The systems and methods may also involve receiving, by a ledger of the first node and from the first server, a pointer to the first information that is stored at the first server, wherein the pointer is stored in the ledger, and wherein the ledger is a distributed ledger included in all of the nodes of the network of nodes. | 2022-05-26 |
20220164311 | WEAK REFERENCES OF ALLOCATED LOGICAL CLUSTERS - Aspects of the present disclosure relate to weak references of allocated logical clusters. In examples, a deduplication hash table stores associations between block hashes and block addresses, such that a block can be identified and used in place of another block storing the same data. A weak reference may be generated on a block, such that an intact weak reference indicates that the block is unchanged. When a block is identified that has a hash matching that of an existing block in the hash table, it may be determined whether a weak reference on the existing block is intact. If there is not an intact weak reference on the existing block, the existing block may have changed, such that it is not used for deduplication. By contrast, if the weak reference is intact, the existing block has not changed, such that it may be used for deduplication accordingly. | 2022-05-26 |
20220164312 | ELECTRONIC COMMUNICATION AND FILE REFERENCE ASSOCIATION - Examples of the present disclosure describe systems and methods for electronic communication and file reference association. In an example, a file reference may refer to file content stored by a file service. The file reference may be used to share the file content in an electronic communication among a plurality of users. The file reference may be identified within the electronic communication, and may be used to generate a file node. The file node may store information relating to the file content and/or file reference. A message node associated with the electronic communication may be created, which may be associated with the file node. The file node may later be used to identify electronic communications relating to the file reference. Thus, electronic communications relating to the file reference may be accessible to a user using the file reference or by searching, rather than manually identifying related electronic communications. | 2022-05-26 |
20220164313 | PREFETCHING DATA FROM A DATA STORAGE SYSTEM - Data can be prefetched from a data storage system. For example, a computing device can receive a write request from a software application. The write request can be for writing a first data object to a storage device. The computing device can determine a second data object that is to be prefetched based on a read request for the first data object from the software application. The computing device can generate metadata for the first data object. The metadata can indicate that the second data object is to be prefeteched. The computing device can store the first data object with the metadata in the storage device. | 2022-05-26 |
20220164314 | Method and System for Real-Time Collaboration and Annotation-Based Action Creation and Management - A method of collaborating in real-time via action creation, including detecting an annotation on a managed document, parsing the annotation, generating an action record responsive to information identified from parsing the annotation, and recording a generated action record to an action database. A user can access the action database and retrieve action records for which they are the assigned user. The annotation does not change the file content of the managed document. | 2022-05-26 |
20220164315 | System and Method for Selective Synchronization - A client computer includes a synchronization manager. The synchronization manager communicates with a remote content management system to determine a set of objects in a content navigation hierarchy. The synchronization manager provides a user interface with controls to allow a user to independently select multiple objects in the content navigation hierarchy for synchronization and receives an input, via the interface, that selects objects from the set of objects for synchronization. The synchronization manager stores local peers of the selected objects in a local cache in a local file system. The synchronization manager synchronizes changes to the selected objects at the content management system to the local peers in the file system. | 2022-05-26 |
20220164316 | DEDUPLICATION METHOD AND APPARATUS - A deduplication method and apparatus are provided. In the method, a fingerprint record that includes a plurality of fingerprint record items is first obtained, and at least two first fingerprint record items that include a same fingerprint are then determined from the fingerprint record. For example, the at least two first fingerprint record items each include a first fingerprint, so that deduplication is performed on data corresponding to the first fingerprints in the at least two first fingerprint record items. The at least two first fingerprint record items are deleted, a stub of the first fingerprint is recorded in the fingerprint record, and the stub of the first fingerprint indicates that the first fingerprint is a duplicated fingerprint. | 2022-05-26 |
20220164317 | REMOTE FILE ACCESS APPARATUS AND METHOD THEREOF - A remote file access apparatus and a corresponding method are provided. An access score corresponding to an access instruction is generated, and the approach to process the access instruction is determined when the access instruction is going to access data external to the remote file access apparatus, wherein the access score is calculated according to an access information of the access instruction and the access information includes at least one of a type of an application requesting the access instruction, a related information of a user requesting the access instruction and at least one attribute of a file accessed by the access instruction. | 2022-05-26 |
20220164318 | ISSUE TRACKING SYSTEMS AND METHODS - Described herein is a computer implemented method. The method comprises receiving, from a user device, a selected workflow message identifying a selected workflow; accessing the selected workflow from a workflow data store; evaluating, using runtime context information received from the user device, one or more secondary triggers associated with the selected workflow to determine an applicable branch of the selected triggered workflow; communicating, to the user device, branch information in respect of the applicable branch, the branch information including information in respect of one or more operations that would be performed if the selected workflow was executed. | 2022-05-26 |
20220164319 | Security for Data at Rest in a Remote Network Management Platform - An embodiment may involve persistent storage including a parent filesystem and a pre-configured amount of free space within the parent filesystem that is dedicated for shared use. The embodiment may also involve one or more processors configured to, for each of a plurality of child filesystems: create a sparse file with an apparent size equivalent to the pre-configured amount of free space; create a virtual mapped device associated with the sparse file; establish one or more cryptographic keys for the virtual mapped device; create an encrypted virtual filesystem for the virtual mapped device and within the sparse file, wherein the encrypted virtual filesystem uses the cryptographic keys for application-transparent encryption and decryption of data stored by way of the encrypted virtual filesystem; and mount the encrypted virtual filesystem within the parent filesystem as one of the child filesystems. | 2022-05-26 |
20220164320 | AUTONOMOUS DEPLOYMENT OF MULTIPLE DATABASE FILE SYSTEMS - A manager file system (MFS) runs as a user space file system. The MFS, implemented using an OS process, exposes a mount point as a communication endpoint to the single process. Mounting, unmounting, and changing configuration of individual database file systems (DBFSs) are done by overloading extended attributes on the mount point. The MFS services all DBFSs mounted at different mount points registered to the single process of the MFS and ensures optimal resource utilization among the DBFSs in the single process while guaranteeing resource isolation. Multiple MFSs may be created to manage sets of DBFSs. | 2022-05-26 |
20220164321 | SCALABLE FRAMEWORK FOR MANAGING CONCURRENT ACCESSES TO DATABASE FILE SYSTEMS - A manager file system (MFS) runs as a user space file system. The MFS, implemented using an OS process, exposes a mount point as a communication endpoint to the single process. Mounting, unmounting, and changing configuration of individual database file systems (DBFSs) are done by overloading extended attributes on the mount point. The MFS services all DBFSs mounted at different mount points registered to the single process of the MFS and ensures optimal resource utilization among the DBFSs in the single process while guaranteeing resource isolation. | 2022-05-26 |
20220164322 | TECHNIQUES FOR USING AN IN-MEMORY ONLY FILE SYSTEM AS AN INTERFACE FOR MANAGING COMPUTER SYSTEMS AND USER SPACE FILE SYSTEMS - A manager file system (MFS), implemented using an OS process, exposes a path in the native file system as the root of its file system (e.g., mount point). The MFS informs the OS kernel that any file system operation whose path contains the mount point as its prefix, should be handed over to the process by invoking an appropriate interface method that the process implements as part of its file system implementation. The MFS manages one or more applications and leverages the authentication mechanism of the OS to provide fined-grained access control of MFS managed applications. | 2022-05-26 |
20220164323 | ONLINE SCHEMA CHANGE OF RANGE-PARTITIONED INDEX IN A DISTRIBUTED STORAGE SYSTEM - A distributed storage system includes table controllers collectively storing partitions of a logical table having multiple rows. For each of the partitions, a corresponding table controller stores a subset of the rows of the logical table across individual pages. A management controller updates a schema of the logical table from a first to a second schema definition by, for each of the partitions, sending an update command indicating the second schema definition to the corresponding table controller. The first table controller corresponds to a first partition that includes a first subset of the rows. The first table controller, prior to receiving the update command, includes an identifier of the first schema definition within each page of data for the first subset. Subsequent to receiving the update command, the first table controller, when writing each new page of data for the first subset, includes an identifier of the second schema definition. | 2022-05-26 |
20220164324 | SYSTEMS AND METHODS FOR UNIVERSAL REFERENCE SOURCE CREATION AND ACCURATE SECURE MATCHING - The present disclosure is directed to systems and methods for reference source matching. Specifically, the systems and methods disclosed enable matching among tokens using a reference source. In one example, a Consolidation Platform may receive tokens from a customer environment and tokens from a reference source environment. The customer tokens may be compared to each other using AB matching. If a match does not occur, the customer tokens may further be compared to the reference source tokens via transitive matching. If a match does occur, then the customer tokens may be denoted as a match. In further example aspects, the reference source may be a universal reference token repository that comprises unique tokens. If, after a match is indicated, the matched token(s) may be compared to the universal reference token repository. If the matched token(s) does not exist, it may be added to the repository for future use. | 2022-05-26 |
20220164325 | DATA VALIDATION USING INFERRED PATTERNS - Aspects of the present disclosure relate to data validation using inferred patterns. Columns of a data store may be processed to generate a set of candidate patterns for each respective column, which may be combined to form a combined set of candidate patterns. Columns of the data store may then be processed using the combined set of candidate patterns to generate pattern scores for each candidate pattern with respect to each respective column. The candidate patterns may be ranked according to the pattern scores for given column. For example, the patterns may be ranked using an impurity score indicative of the percentage of rows not represented by a pattern and/or a coverage score indicative of a number of columns in a data store for which the pattern applies. A ranked pattern may be manually or automatically selected, which may then be applied to perform data validation of new data accordingly. | 2022-05-26 |
20220164327 | TUNING LARGE DATA INFRASTRUCTURES - An automated tuning service is used to automatically tune, or modify, the operational parameters of a large-scale cloud infrastructure. The tuning service performs automated and fully data/model-driven configuration based from learning various real-time performance of the cloud infrastructure. Such performance is identified through monitoring various telemetric data of the cloud infrastructure. The tuning service leverages a mix of domain knowledge and principled data-science to capture the essence of our cluster dynamic behavior in a collection of descriptive machine learning (ML) models. The ML models power automated optimization procedures for parameter tuning, and inform administrators in most tactical and strategical engineering/capacity decisions (such as hardware and datacenter design, software investments, etc.). Rich “observational” models (models collected without modifying the system) are combined with judicious use of “fighting” (testing in production), allowing the tuning service to automatically configure operational parameters of a large cloud infrastructure for a broad range of applications. | 2022-05-26 |
20220164328 | SYSTEM AND SERVER FOR BEST-FIT DATA STORAGE - Some embodiments include computer-implemented method and system operating the method including a first step of receiving input data from an operational historian during a time interval, where the input data is derived from at least a portion of the operational state data. If the time interval has exceeded a specified time interval, then resetting base data values, and outputting stored input data to a computer-readable storage medium of the network. If the time interval has not exceeded a specified time interval, then comparing the input data with base values, and if any of the input data exceeds at least one of the base values, then updating the base values and proceeding to the first step. Further, if any of the input data does not exceed at least one of the base values, then discarding the input data and proceeding to the first step of the method. | 2022-05-26 |
20220164329 | EFFICIENT DATABASE SEARCH AND REPORTING, SUCH AS FOR ENTERPRISE CUSTOMERS HAVING LARGE AND/OR NUMEROUS FILES - This application discloses a server for handling data reporting requests in a system that also comprises storage managers, primary storage devices, and secondary storage devices connected over one or more networks. The server receives, from each storage manager, a copy of data associated with the storage manager, and stores the received copies in one or more local databases. The server builds offline one or more indices for part or all of the received copies to improve query processing against the one or more local databases. Next, the server receives a request over a network from one of the storage managers or a standalone console, which received the request from a user for a report of data associated with the storage managers. The server produces a data report in response to the request, using the one or more indices and without impacting performance of the storage managers. | 2022-05-26 |
20220164330 | GENERATING A VENN DIAGRAM USING A COLUMNAR DATABASE MANAGEMENT SYSTEM - Venn diagrams are computed for a given plurality of input sets. The process of computing the Venn diagrams is executed on columnar database systems for efficient execution. The computation of various subsets of the Venn diagrams is performed by determining subsets of various combinations of the input sets and computing set differences of the intersection sets. The process orders the execution of various steps of computing the subsets for the Venn diagram in an order that reduces the number of times an input set is loaded. Information describing various subsets of a Venn diagram is used to render the Venn diagram for display, for example, on a client device. | 2022-05-26 |
20220164331 | EFFICIENT SPATIAL INDEXING - Embodiments herein describe computer-implemented methods, computer program products and systems for efficient spatial indexing. In an embodiment, the computer-implemented method may include one or more processors configured for obtaining from a database index data representing one or more assets, wherein each of the one or more assets comprise an asset identifier and a spatial attribute; generating a location hash for each of the one or more assets using the respective asset identifier and the respective spatial attribute; determining one or more sets of location hashes based on the asset identifier and the spatial attribute at one of one or more precision values; generating shadow index data comprising the one or more sets of location hashes at the one of one or more precision values; receiving a query corresponding to the index data; and returning a first set of results corresponding to the query in a first query response time. | 2022-05-26 |
20220164332 | UNSUPERVISED FEATURE LEARNING FOR RELATIONAL DATA - In an approach to unsupervised feature learning for relational data, a computer trains one or more entity aware autoencoders on one or more tables in a relational database, where each of the one or more entity aware autoencoders corresponds to one of the one or more tables in the relational database, and where each of the one or more entity aware autoencoders are comprised of an encoder and a decoder. A computer transforms each of the one or more tables in the relational database with the encoder of the corresponding trained entity aware autoencoder. A computer joins a first transformed table of the one or more tables in the relational database with each remaining one or more transformed tables in the relational database to form one or more joined tables. A computer aggregates the one or more joined tables. A computer outputs one or more feature representations. | 2022-05-26 |
20220164333 | SYSTEM AND METHOD FOR ELECTRONIC DOCUMENT ISSUING USING BLOCKCHAIN AND COMPUTER PROGRAM FOR THE SAME - The system for issuing electronic documents using a blockchain according to the present invention comprises: a transceiver receiving identification information of a facility and status information of the facility from a complex sensor device for sensing the status of the facility and transmitting sensing the status of facilities and transmitting the status information of the facility to the outside; a diagnosis unit performing safety diagnosis on the facility and calculating a safety diagnosis grade according to the safety diagnosis result; a transmitter retrieving the safety diagnosis result from the distributed ledger of the blockchain network at the request of a user device and transmitting the safety diagnosis result in the form of an electronic document; and a data processer for converting the received status information of the facility and the safety diagnosis result by the diagnosis unit into a standardized data format suitable for storage in a blockchain network. | 2022-05-26 |
20220164334 | SYSTEMS AND METHODS FOR MANAGING A HIGHLY AVAILABLE AND SCALABLE DISTRIBUTED DATABASE IN A CLOUD COMPUTING ENVIRONMENT - Systems and methods for managing a highly available distributed database comprising: a memory storing instructions; and one or more processors configured to execute the instructions to: determine that a source node, in a distributed database comprising the source node and one or more replica nodes, is not available; select a most-updated replica node from the one or more replica nodes; switch a role of the most-updated replica node to source; update a data store to label the source node as unavailable and the selected replica node as being a promoted source node; send a notification to a user device to update a database topology based on the updated data store; determine whether the user device has updated the database topology; and upon determining the user device has not updated the database topology, continue to send the notification to the user device until the user device has updated the database topology. | 2022-05-26 |
20220164335 | CLOUD-NATIVE OBJECT STORAGE FOR PAGE-BASED RELATIONAL DATABASE - Systems and methods include determination of a first logical page number of a first database page to be persisted, identification of a first blockmap page associated with the first logical page number, determination, from the first blockmap page, of a block number associated with the first logical page number, determination that the block number is an object key, determination, in response to the determination, that the block number is an object key, determination of a first object key to associate with the first logical page number, and writing of the first database page to the object store using the first object key. | 2022-05-26 |
20220164336 | SYSTEM AND METHOD FOR EFFICIENTLY TRANSFERRING DATA FOR OFFLINE USE - Disclosed are some implementations of systems, apparatus, methods and computer program products for transmitting data to a client device. A first database is generated for a client device and a client identifier of the client device is stored in association with the first database. The first database is transmitted to the client device responsive to receiving a first message from the client device. After transmitting the first database to the client device and responsive to receiving a second message from the client device, data relevant to the client device is ascertained. A delta between database records stored in the first database and the data is generated. A database message is generated and transmitted to the client device, where the database message indicates the delta and includes a client directive pertaining to updating the first database according to the delta. | 2022-05-26 |
20220164337 | MANAGING DATA OBJECTS FOR GRAPH-BASED DATA STRUCTURES - Various embodiments provide methods, systems, apparatus, computer program products, and/or the like for managing, ingesting, monitoring, updating, and/or extracting/retrieving information/data associated with an electronic record (ER) stored in an ER data store and/or accessing information/data from the ER data store, wherein the ERs are generated, updated/modified, and/or accessed via a graph-based domain ontology. | 2022-05-26 |
20220164338 | SCALABLE, SECURE, EFFICIENT, AND ADAPTABLE DISTRIBUTED DIGITAL LEDGER TRANSACTION NETWORK - The present disclosure relates to systems, methods, and non-transitory computer readable storage media for implementing a scalable, secure, efficient, and adaptable distributed digital ledger transaction network. Indeed, the disclosed systems can reduce storage and processing requirements, improve security of implementing computing devices and underlying digital assets, accommodate a wide variety of different digital programs (or “smart contracts”), and scale to accommodate billions of users and associated digital transactions. For example, the disclosed systems can utilize a host of features that improve storage, account/address management, digital transaction execution, consensus, and synchronization processes. The disclosed systems can also utilize a new programming language that improves efficiency and security of the distributed digital ledger transaction network. | 2022-05-26 |
20220164339 | SCHEDULING DATA PROCESSING TASKS USING A STREAM OF TRACKING ENTRIES - Systems, methods, and devices for scheduling of data processing tasks are disclosed. A method includes performing a modification on a first set of immutable partitions storing database data to generate a second set of immutable partitions. The second set is associated with a modified version of the database data. A change tracking entry is entered in a stream of tracking entries based on committing the modification. The change tracking entry includes an indication of the modification on the first set of immutable partitions. A stream offset of the stream of tracking entries is advanced based on the entering of the change tracking entry in the stream of tracking entries. The stream offset indicates a timestamp associated with a latest committed modification to the database data. A data processing task is scheduled for execution on the modified version of the database data based on the advancing of the stream offset. | 2022-05-26 |
20220164340 | EARLY GROUPING OPTIMIZATION FOR SQL STATEMENTS WITH CONDITIONAL EXPRESSIONS - To increase the applicability of group-by placement (GBP) transformations, according to embodiments described herein, database objects referred to in the aggregate function expression of a query are analyzed to determine whether any of these database objects are referred to exclusively within a condition check portion of the aggregate function expression. Such database objects may be dealt with differently (i.e., with respect to inclusion in GBP views) than the rest of the database objects referred to in aggregate function expressions of the query. This distinction between (a) aggregation-condition database objects exclusively found in condition check portions of an aggregate function expression and (b) aggregation-source database objects within an aggregate function expression allows application of GBP transformation to a wider variety of queries and also increases the possible GBP states that can be costed for GBP transformation-eligible queries. | 2022-05-26 |
20220164341 | DISPLAYING DATA USING GRANULARITY CLASSIFICATION - A query on a data is received. One or more granularity of data is determined of the data to respond to the query. The one or more granularity of data includes a low granularity data and a high granularity data. Whether the low granularity data is stored in a cache is determined. Responsive to determining the low granularity data is stored in the cache, the low granularity data is retrieved. The low granularity data is displayed. | 2022-05-26 |
20220164342 | GENERATING ENHANCED GRAPHICAL USER INTERFACES FOR PRESENTATION OF ANTI-INFECTIVE DESIGN SPACES FOR SELECTING DRUG CANDIDATES - In one aspect, a method is disclosed for presenting, on a computing device, a graphical user interface (GUI) of a therapeutic tool. The method includes presenting, in a first screen of the GUI, a design space for a protein for an application, where the design space includes a set of sequences, where each sequence contains a respective set of activities pertaining to the application. The method also includes receiving, via a graphical element in the first screen, a selection of one or more query parameters of the design space, and presenting, in a second screen of the GUI, a solution space that includes a subset of the set of sequences, where each sequence contains the respective set of activities, where the subset of the set of sequences is selected based on the one or more query parameters. | 2022-05-26 |
20220164343 | GENERATING ENHANCED GRAPHICAL USER INTERFACES FOR PRESENTATION OF ANTI-INFECTIVE DESIGN SPACES FOR SELECTING DRUG CANDIDATES - In one aspect, a method is disclosed for presenting, on a computing device, a graphical user interface (GUI) of a therapeutic tool. The method includes presenting, in a first screen of the GUI, a design space for a protein for an application, where the design space includes a set of sequences, where each sequence contains a respective set of activities pertaining to the application. The method also includes receiving, via a graphical element in the first screen, a selection of one or more query parameters of the design space, and presenting, in a second screen of the GUI, a solution space that includes a subset of the set of sequences, where each sequence contains the respective set of activities, where the subset of the set of sequences is selected based on the one or more query parameters. | 2022-05-26 |
20220164344 | DATA PROCESSING METHOD, DATA PROCESSING DEVICE AND NON-VOLATILE COMPUTER-READABLE STORAGE MEDIA - A data processing method, a data processing device, and a non-volatile computer-readable storage medium are provided. The data processing method includes: setting a default mapping file; when a database query request is received, parsing through a default mapping file to generate a first query instruction; and querying a corresponding datasheet according to the first query instruction. | 2022-05-26 |
20220164345 | MANAGED QUERY EXECUTION PLATFORM, AND METHODS THEREOF - A query execution fabric is provided. The a plurality of computing machines; and a plurality of storage devices communicatively connected to the plurality of computing machines using a storage communication protocol and configured to maintain a plurality of indexed views comprising index information and a plurality of data chunks, wherein the index information includes at least one local index per data chunk and at least one global index per each of the indexed views of the plurality of indexed views, and wherein each of the plurality of computing machines is configured to: verify a global index to locate segments of the plurality of indexed views; and verify a plurality of local indexes to locate the data chunks containing values related to a plurality of statements. | 2022-05-26 |
20220164346 | QUERY-ORIENTED APPROXIMATE QUERY PROCESSING BASED ON MACHINE LEARNING TECHNIQUES - In some embodiments, a model training system trains a sample generation model configured to generate synthetic data entries for a dataset. The sample generation model includes a prior model for generating an estimated latent vector from a partially observed data entry, a proposal model for generating a latent vector from a data entry of the dataset and a mask corresponding to the partially observed data entry, and a generative model for generating the synthetic data entries from the latent vector and the partially observed data entry. The model training system trains the sample generation model to optimize an objective function that includes a first term determined using the synthetic data entries and a second term determined using the estimated latent vector and the latent vector. The trained sample generation model can be executed on a client computing device to service queries using the generated synthetic data entries. | 2022-05-26 |
20220164347 | INSIGHT GENERATION FROM A TABULAR DATASET - Systems, methods, and software of processing a tabular dataset. In one embodiment, a system extracts raw association rules from the tabular dataset. Each of the raw association rules comprises a relationship between a set of antecedents and a single consequent, and corresponds to one or more transactions. The system determines potential rule merge groups of the raw association rules based on the antecedents, and determines one or more actual rule merge groups of the raw association rules in each potential rule merge group based on the transactions. The system combines the raw association rules in an actual rule merge group to generate a merged association rule. The system then generates a set of insights based on one or more merged association rules, and performs an operation based on the set of insights. | 2022-05-26 |
20220164348 | DISTRIBUTED DATA PROCESSING - Data is processed in a distributed computing environment with at least one server and a plurality of clients comprising at least a first client and a second client. The first client sends a first request to the server to obtain result data, receives raw data from the server as a response to the first request, processes the raw data to obtain the result data and stores the result data, and sends the result data to the second client in response to receiving a third request to obtain the result data from the second client. | 2022-05-26 |
20220164349 | DISTRIBUTED QUERIES THROUGH DYNAMIC VIEWS - A data query and retrieval system receives a query request and identifies a plurality of data warehouses, or stores, where data needed to satisfy the query is stored. Data items, or fields, called for by the query request are grouped into sets based on fields stored at the same data warehouse. Individual data connections are generated for each data warehouse accessed, and a database view defined for the fields available at each respective data warehouse. The individual views are invoked in a single query statement by a query processor for accessing the respective data warehouses via the corresponding database view. In this manner, a query operator or user need not define multiple query expressions or perform separate queries for accessing data fields or dimensions residing at different data warehouses. | 2022-05-26 |
20220164350 | SEARCHING AN AUTONOMOUS VEHICLE SENSOR DATA REPOSITORY BASED ON CONTEXT EMBEDDING - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for searching an autonomous vehicle sensor data repository. One of the methods includes maintaining a collection of sensor samples and one or more embeddings of each sensor sample. Each sensor sample is generated from sensor data at multiple time steps and characterizes an environment at each of the multiple time steps. Each embedding corresponds to a respective portion of the sensor sample and has been generated by an embedding neural network. A query specifying a query portion of a query sensor sample is received. A query embedding corresponding to the query portion of the query sensor sample is generated through the embedding neural network. A plurality of relevant sensor samples that have embeddings that are closest to the query embedding are identified as characterizing similar scenarios to the query portion of the query sensor sample. | 2022-05-26 |
20220164351 | SYSTEMS AND METHODS FOR MANAGING A HIGHLY AVAILABLE DISTRIBUTED HYBRID TRANSACTIONAL AND ANALYTICAL DATABASE - Systems and methods for managing a highly available distributed hybrid database comprising: a memory storing instructions; and one or more processors configured to execute the instructions to: receive a query from a user device to retrieve data from a distributed database comprising a source node, a first plurality of replica nodes, and a second plurality of replica nodes, wherein the source node and the first plurality of replica nodes form a transactional cluster, and wherein the second plurality of replica nodes forms an analytical cluster; determine whether to process the query using the transactional cluster or the analytical cluster based on one or more rules; translate the query into a first protocol that the determined cluster comprehends; select a replica node corresponding to the determined cluster; process the query using the selected replica node; and send data associated with results from processing the query to the user device. | 2022-05-26 |
20220164352 | OPTIMAL QUERY SCHEDULING ACCORDING TO DATA FRESHNESS REQUIREMENTS - A process for optimal query scheduling includes receiving in an information retrieval data processing system, a request to accelerate query execution of a specified query to a time prior to a scheduled time. A specific field corresponding to data in a database is then identified in the query and a freshness of data requirement for the specific field retrieved along with a frequency of change the data corresponding to the specific field. Then, if execution of the specific query at the time prior to the scheduled time instead of the scheduled time is determined not to violate the freshness of data requirement based upon the frequency of change of the data corresponding of the specific field, the specific query is scheduled for execution at the time prior to the scheduled time. But otherwise, the scheduled time may be maintained for executing the specific query. | 2022-05-26 |
20220164353 | EARLY GROUPING OPTIMIZATION FOR SQL STATEMENTS BY NORMALIZING ARITHMETIC EXPRESSIONS IN AGGREGATES - According to embodiments, a database server instance may generate group-by placement (GBP) states that define potential GBP transformations for a query in which some aggregate tables are included in the GBP view and other aggregate tables are not. Such states are referred to herein as relaxed-C states. To rewrite a query based on a selected relaxed-C GBP state such that the rewritten query is semantically equivalent to the original query, any arithmetic expression within an aggregate expression of the query is normalized into terms, and the query rewrite is implemented on a term-specific basis. Specifically, aggregate function-specific query modification rules are applied to each term of the normalized arithmetic expression. The applied query modification rules dictate what is included in the GBP view and what is included in the outer portion of the rewritten query to ensure that the rewritten query is semantically equivalent to the original query. | 2022-05-26 |
20220164354 | DATA AGGREGATION AND PRE-POSITIONING FOR MULTI-STORE QUERIES - A query engine or compute engine receiving a query request identifies a plurality of data sources for satisfying a query request, and determines, from among multiple data sources, one or more fields likely to incur substantial computational demands in processing the query request. Pre-positioning aggregation logic moves the determined fields one data source to another data source for positioning the moved fields to a single data source from which the query result will be computed. | 2022-05-26 |
20220164355 | METHODS FOR UPDATING REFERENCE COUNT AND SHARED OBJECTS IN A CONCURRENT SYSTEM - A method for to manage concurrent access to a shared resource in a distributed computing environment. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache. | 2022-05-26 |
20220164356 | ADAPTIVE BIG DATA SERVICE - An event processing system comprising a processor and a non-transitory computer readable medium coupled to the processor. The non-transitory computer readable medium stores computer-readable code executable to provide a domain-agnostic service for analyzing data and process heterogeneous events conforming to a plurality of schemas using the service. The domain-agnostic service comprises an adaptive data model and an adaptive processing model. The adaptive data model supports runtime event type discovery and event schema management that reacts to new schemas discovered at runtime. The adaptive processing model supports configurable partitioning of events by event type and time and is reactive to create new aggregations and analyses based on the propagation of new partitions. | 2022-05-26 |
20220164357 | METHODS AND SYSTEMS OF DYNAMICALLY MANAGING CONTENT DELIVERY OF SENSOR DATA FROM NETWORK DEVICES - The present application is at least directed to a method of dynamically managing content delivery of sensor data to a third party. A step of the method may include receiving, via plural smart devices each including a trained machine learning algorithm, data of an object detected in an environment and filtered to remove an attribute of the detected object. Another step of the method may include aggregating the filtered data with the removed attribute received from the plural devices. Yet another step of the method may include obtaining a credential of a third party requesting the aggregated data of the object. Yet even another step of the method may include determining, via another trained machine learning algorithm, an additional filter of the aggregated data is required in view of the credential of the third party. A further step of the method may include transmitting, to the third party, the additionally filtered data in view of the credential. Yet even a further step of the method may include dynamically displaying, via a graphical user interface, a real-time status of the third party obtaining the additionally filtered data. | 2022-05-26 |
20220164358 | IDENTIFYING USERS OF INTEREST VIA ELECTRONIC MAIL AND SECONDARY DATA ANALYSIS - Email metadata, and in some embodiments other secondary data, is analyzed to identify users of interest defined as having knowledge or expertise in a subject matter. Specifically, a corpus of email metadata is analyzed to determine, at least, which subject matters are associated with users, which users received or transmitted subject matter-specific emails, the distribution groups to which users, and any other relevant email metadata. In additional embodiments, secondary data other than email metadata is also analyzed and used to identify the users of interest. The analyzed email metadate, and in some embodiments the secondary data, is used to render reputation indicator(s) for each user that indicate a level of knowledge/expertise that the user possesses on subject matter(s). A requester provides input criteria including the subject matter, and, in response, is presented a ranked user listing that is ranked based on the level of reputation indictor. | 2022-05-26 |
20220164359 | SYSTEMS AND METHOD FOR GENERATING SEARCH TERMS - A method for generating keywords for searches, comprising the steps of retrieving search metric data comprising a plurality of search strings and interaction data; retrieving a plurality of first product identifiers each having one or more first attributes; generating, a table comprising the plurality of search strings ranked by interaction data; generating relevant lists comprising the plurality of search strings having interaction data above threshold values; retrieving data relating to a second product identifier; extracting one or more second attributes of the second product identifier; performing searches in the relevant lists using the second attribute data; assigning keywords to the data relating to the second identifier. | 2022-05-26 |
20220164360 | ENHANCED COGNITIVE QUERY CONSTRUCTION - An embodiment for cognitively enhancing a search query is provided. The embodiment may include receiving a voice query from a user. The embodiment may also include analyzing the voice query. The embodiment may further include identifying an object within a focus area of the user based on the voice query. The embodiment may also include determining whether the identification of the object is confident, and in response to determining the identification of the object is not confident, receiving feedback from the user. In response to determining the identification of the object is confident, the embodiment may further include generating a relationship between a word in the voice query and the identified object. The embodiment may also include delivering an enhanced response to the user based on the identified object and the received feedback. | 2022-05-26 |
20220164361 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR EXTENDING AN ACTION VECTOR - Embodiments of the present invention provide methods, systems, apparatuses, and computer program products for extending an action vector. In one embodiment, an apparatus is configured to scan each client action vector cell of the client action vector to identify an empty client action vector cell, the client action vector associated with a client profile; upon identifying an empty client action vector cell, extract an empty client action vector cell device rendered object category; retrieve, from a similarity table, a similarity measure for each of the other device rendered object categories of the plurality of device rendered object categories, the similarity measure being in comparison to the empty client action vector cell device rendered object category; for each of the other device rendered object categories of the plurality of device rendered object categories having a similarity measure above a similarity threshold, extract an action count from the client action vector cell associated with the device rendered object category; compute a similarity action measure for the device rendered object category based at least on the action count and the similarity measure; and compute an action measure for the empty client action vector cell using at least one of the similarity action measures; and increment an action count in the empty client action vector cell based on the action measure. | 2022-05-26 |
20220164362 | FRAMEWORK TO FACILITATE DATA ACCESS - Systems and methods include an application programming interface based on a first plurality of object attributes of a data structure, and a framework to update the data structure with a second one or more object attributes and associate the first object type with a first search method. The application programming interface is updated based on the updated data structure, and the framework receives attribute values and the first object type via the updated application programming interface, maps the attribute values to respective ones of the first object attributes and the second object attributes, and identifies and executes the first search method to generate a query of object instances of the first object type. | 2022-05-26 |
20220164363 | DATA EXTRACTION SYSTEM - Described herein is a data extraction system for extracting data from one or more tabular data files. The system includes a user interlace adapted for facilitating one or more users to submit one or more tabular data files, each tabular data file including at least one table. | 2022-05-26 |
20220164364 | INTERACTIVE DYNAMIC GEO-SPATIAL APPLICATION WITH ENRICHED MAP TILES - Systems and methods for preparing and analyzing data related to geo-spatial properties. A system generates from a first data source, based on an ontology, a geographic dataset including first data objects representative of first data from the first data source and at least one geo-spatial reference based on respective location information from the first data source that corresponds to the first data. The system can also generate a vector map data tile layer based on the ontology using the geographic dataset and including vector map data tiles, having map geometry data linked to the first data objects by a geo-spatial reference, and corresponding to a portion of a geographic area represented by the vector map data tile layer. In response to requests from the front-end system application for first data related to a geo-spatial feature, tiles can be provided and first data corresponding to selected geo-spatial references can be displayed. | 2022-05-26 |
20220164365 | INTELLIGENT MASTER DATA REPLICATION - In an example embodiment, a solution is provided that allows for intelligent demand-driven data replication. Only the data that is needed has to be replicated, and this data can be kept only as long as needed. This allows cloud-based applications to be built that integrate deeper with the existing customer landscape with the most efficient data footprint. It allows data types that could not be used before to be integrated into an application. There are additional savings due to the reduced data footprint in the database, compared to a full data replication, without giving up resilience or response time. | 2022-05-26 |
20220164366 | OFFLINE INDEX BUILDS FOR DATABASE TABLES - Offline building of a projected data subset may be performed. A request to create a data set that is a projected subset of data from a source data set may be received. A data store separate from the data store storing the source data set may store a copy of the source data set that is used to replicate items to the projected subset of data according to a schema for the projected data subset. Updates made to the source data set may also be replicated to the projected data subset according to the schema. Conflicts between replicated items and replicated updates to the projected data set may be resolved by comparing a version identifier for the replicated update and replicated item to determine what to store in the projected data subset. | 2022-05-26 |
20220164367 | PARTITIONING A TEMPORAL GRAPH FOR DISTRIBUTED STORAGE - In one embodiment, present disclosure discloses a method for partitioning a temporal graph is described. Embodiments of the method comprises creating a plurality of storage blocks for each type of the different types of graph elements based on predefined label groups, each of the plurality of storage blocks configured to store the telemetry information generated in a corresponding predefined time-range, recreating each of the plurality of storage blocks upon expiry of a configurable rollover time, and sharding each of the plurality of storage blocks into a plurality of shards based on a configurable sharding count. | 2022-05-26 |
20220164368 | MANAGEMENT OF DATA WAREHOUSE FOR ELECTRONIC PAYMENT TRANSACTION PROCESSING NETWORKS - Embodiments include apparatuses, methods, and systems for managing a data warehouse associated with an electronic payment transaction processing network. A first set of stores are active and a second set of stores are inactive in an offer program related to merchandise of a merchant. A first set of transaction records for a first set of transactions from the first set of stores and a second set of transaction records for a second set of transactions from the second set of stores are obtained. A first set of operations on the data warehouse for the first set of transaction records and a second set of operations on the data warehouse for the second set of transaction records may be performed. The second set of operations, different from the first set of operations, includes an update operation on the data warehouse. Other embodiments may also be described and claimed. | 2022-05-26 |
20220164369 | SYSTEMS AND METHODS FOR IMPROVING COMPUTATIONAL SPEED OF PLANNING BY TRACKING DEPENDENCIES IN HYPERCUBES - A system for updating a hypercube includes an interface and a processor. The interface is configured to receive an indication to update a cell of the hypercube. The processor is configured to determine a primary dimension value associated with the cell; determine a group of dependencies based at least in part on the primary dimension value, wherein a dependency of the group of dependencies comprises one or more primary dimension values and a pattern; for the dependency of the group of dependencies, determine a set of source locations based at least in part on the one or more primary dimension values and the pattern; and mark the set of source locations as invalid. | 2022-05-26 |
20220164370 | LABEL-BASED DOCUMENT CLASSIFICATION USING ARTIFICIAL INTELLIGENCE - Label-based document classification using artificial intelligence includes collecting, by one or more processors, a plurality of pre-trained classification models into a model pool and a plurality of documents into a document pool. The collected plurality of pre-trained classification models are applied in parallel to the plurality of documents in the document pool to generate a list of labels. Based on the list of labels, a final label result is generated according to which a baseline algorithm for document classification is generated by the one or more processors. | 2022-05-26 |
20220164371 | SYSTEMS AND METHODS FOR ATTRIBUTE ANALYSIS OF ONE OR MORE DATABASES - Systems and techniques for indexing and/or querying a database are described herein. Multiple, large disparate data sources may be processed to cleanse and/or combine item data and/or item metadata. Further, attributes may be extracted from the item data sources. The interactive user interfaces allow a user to select one or more attributes and/or other parameters to present visualizations based on the processed data. | 2022-05-26 |
20220164372 | SYSTEM AND METHOD FOR DISTRIBUTED, CO-LOCATED, AND SELF-ORGANIZING DATA STORAGE AND CLUSTER COMPUTATION FRAMEWORK FOR BATCH ALGORITHMS ON BIG DATASETS - A system and method for providing a distributed, co-located, self-organizing data storage and cluster computation framework for batch algorithms on big datasets. The system includes various subscriber devices reporting session information relevant to telecommunications companies to computing devices capable of combining records into trie organizational data structures for storage and optimization. Querying via user request and batch algorithms performed via parallel computing processes and index-on-index data keys enable users and algorithms to quickly determine subscribers of interest, based on numerous possible data points contained in subscriber records. The method of performing data receipt, re-organization, trie formation, trie ingestion at a server, and trie structural optimization for the enablement of user and algorithmic querying of the data stored thereon the server. | 2022-05-26 |
20220164373 | Data Preparation User Interface with Conditional Remapping of Data Values - A user selects a node that specifies an operation for a dataset. In response, a computer system displays data values for the dataset, in a grid in a data pane. The grid includes a first column and a second column. In the grid, the user edits a first data value in the first column in a first row. The user input changes the first data value to a replacement data value. The computer system identifies a second data value in the second column in the first row, and identifies one or more additional rows in the grid, whose data values for the first column and the second column match the first data value and the second data value. The computer system then updates the data value in the first column for a second row in the grid to the replacement data value. | 2022-05-26 |
20220164374 | METHOD OF SCORING AND VALUING DATA FOR EXCHANGE - A system and method for valuing a plurality of sets of data and similar medium, comprising receiving datasets, creating a first sub-score for each of the datasets, creating a second numerical sub-score for each of the plurality of datasets, the second numerical value varying based on information characteristics, the second sub-score being larger for improved information characteristics characterized by one or more of increased structural quality, increased completeness, increased interconnectivity, increased diversity, decreased redundancy, creating a third sub-score for each of the plurality of datasets, the third sub-score comprising a third numerical value being larger for improved meaning characteristics characterized by one or more of increased impact on a community, an increased number of impacted communities, greater veracity, greater relevance to an impacted community, greater scarcity; creating a composite score for each of the plurality of datasets that is a mathematical combination of the first, second, and third sub-scores. | 2022-05-26 |
20220164375 | METHOD AND SYSTEM FOR PRODUCING A GLOBAL MULTILAYER CARTOGRAPHIC DATA BASE - A method and system for producing a global multilayer cartographic database enabling the production of maps and, more particularly, to the production of maps containing topographic, altimetric, vegetation cover, soil nature and subsidence information. through a collaborative process of using remote sensing systems carried by drones (DBSS), where information collected during individual surveys is incorporated into a global multilayer cartographic database, whose information is made available to amateur and professional parties. The system includes, in addition to the global multilayer cartographic database (BCGMC), an applications databank, a production infrastructure, an intermediation system service and a database of accredited operators | 2022-05-26 |
20220164376 | SYSTEMS AND METHODS FOR EARTH OBSERVATION - Systems and methods are provided for obtaining and managing remote sensing data (e.g. Earth observation data). A remote sensing platform obtains imagery and other remote sensing data of the Earth and other planetary objects. The remote sensing platform includes the International Space Station, or manned and unmanned spacecraft or aircraft. A sensor captures observation data and transmits the data to ground stations on the Earth. A ground segment receives and stores the data. Users use an order management system to place orders for the observation data, which specify processing parameters for the remote sensing data. The remote sensing data is retrieved from storage is processed according to the parameters to generate a data product. This system provides tools for searching and analyzing the data, and for interacting with the system through an API. The system combines data that is produced by the remote sensing platform and by third parties. | 2022-05-26 |
20220164377 | METHOD AND APPARATUS FOR DISTRIBUTING CONTENT ACROSS PLATFORMS, DEVICE AND STORAGE MEDIUM - Some embodiments of present disclosure provide a method and apparatus for distributing content across platforms, a device and a storage medium, relates to the field of cloud storage technology, and may be applied to a cloud platform. A specific implementation of the method can include: receiving a content acquisition request, the content acquisition request containing content category information; generating identifier information of a sending end of the content acquisition request, and configuring the content category information under the identifier information; acquiring abstract information of content corresponding to the content category information; and sending the abstract information to the sending end of the content acquisition request based on the identifier information. | 2022-05-26 |
20220164378 | TYPE AHEAD SEARCH AMELIORATION BASED ON IMAGE PROCESSING - System and methods for type ahead search amelioration based on image processing are provided. In embodiments, a method includes: capturing, by a computing device, image data based on images viewed by a user during a computing session; converting, by the computing device, the image data to text using image processing; and storing, by the computing device, the text in a temporary buffer of a type ahead search function, wherein the text constitutes image context data for use by the type ahead search function. | 2022-05-26 |
20220164379 | BURIED OBJECT INFORMATION MANAGEMENT DEVICE, BURIED OBJECT INFORMATION MANAGEMENT SYSTEM COMPRISING SAME, BURIED OBJECT INFORMATION MANAGEMENT METHOD, AND BURIED OBJECT INFORMATION MANAGEMENT PROGRAM - A buried object information management unit manages information about a buried object included in a search image showing the presence or absence of the buried object in a wall surface generated by a buried object scanning device that is scanned along a wall surface, and comprises a data receiving unit, an input unit, and a collation unit. The data receiving unit acquires search information including the search image generated by the buried object scanning device. To the input unit is inputted construction information including position information about the buried object in the wall surface. The collation unit collates the search information acquired by the data receiving unit with the construction information inputted to the input unit, and determines whether or not there is a match. | 2022-05-26 |
20220164380 | ENHANCED IMAGE SEARCH VIA CONTROLLABLE ATTRIBUTES - A query image is received, along with a query to initiate a search process to find other images based on the query image. The query includes a preference value associated with an attribute, the preference value indicative of a level of emphasis to be placed on the attribute during the search. A full query vector, which is within a first dimensional space and representative of the query image, is generated. The full query vector is projected to a reduced dimensional space having a dimensionality lower than the first dimensional space, to generate a query vector. An attribute direction corresponding to the attribute is identified. A plurality of candidate vectors of the reduced dimensional space is searched, based on the attribute direction, the query vector, and the preference value, to identify a target vector of the plurality of candidate vectors. A target image, representative of the target vector, is displayed. | 2022-05-26 |
20220164381 | IMAGE RETRIEVAL SYSTEM AND IMAGE RETRIEVAL METHOD - An image retrieval system with high retrieval accuracy is provided. The image retrieval system includes a database and a processing portion. The database has a function of storing a plurality of pieces of database image data, and a database tag is linked to each of the plurality of pieces of database image data. The processing portion has a function of obtaining database image feature value data representing a feature value of the database image data for each piece of the database image data. The processing portion has a function of obtaining query image feature value data representing a feature value of the query image data. The processing portion has a function of calculating first similarity of the database image data to the query image data for each piece of the database image data. The processing portion has a function of obtaining a query tag linked to the query image data using some of the database tags. | 2022-05-26 |
20220164382 | CUSTOMIZED SELECTION OF VIDEO THUMBNAILS TO PRESENT ON SOCIAL MEDIA WEBPAGES - A framework generates a thumbnail to represent a video on a webpage based on a prominent individual appearing in both the video and content of the webpage. Content of a webpage on which a video is to be posted is analyzed to identify individuals represented in the webpage content. Frames of the video are also analyzed to identify individuals in the video. A first individual that appears in both the webpage content and the video is selected based on a score for the first individual determined based on the webpage content. Subsequent to selecting the first individual, frames of the video that include the first individual are analyzed to select a first frame of the video that includes the first individual. A thumbnail to represent the video on the webpage is generated from the first frame, and the thumbnail is provided for presentation on the webpage to represent the video. | 2022-05-26 |
20220164383 | NFT INVENTORY PRODUCTION - Methods and processes for manufacture of an image product from a digital image. An object in the digital image is detected and recognized. Object metadata is assigned to the object, the object metadata linking sound to the object in the digital image which produced the sound. At least one cryptographic hash of the object metadata is generated, and the hash is written to a node of a transaction processing network. | 2022-05-26 |
20220164384 | EFFICIENT STORAGE AND PROCESSING OF HIGH-DIMENSIONAL FEATURE VECTORS - In one embodiment, an apparatus comprises a storage device and a processor. The storage device stores a feature vector index, wherein the feature vector index comprises a sparse-array data structure representing a feature space for a set of labeled feature vectors, wherein the set of labeled feature vectors are assigned to a plurality of classes. The processor is to: receive a query corresponding to a target feature vector; access, via the storage device, a first portion of the feature vector index, wherein the first portion of the feature vector index comprises a subset of labeled feature vectors that correspond to a same portion of the feature space as the target feature vector; determine the corresponding class of the target feature vector based on the subset of labeled feature vectors; and provide a response to the query based on the corresponding class. | 2022-05-26 |
20220164385 | EXISTENCE CHECKS ON ROWS WITHIN A DATABASE - Example methods and systems are directed to existence checks on rows within a database. A page data structure stores bitmap data for the rows in the page. A row within the page corresponds to a single bit in the bitmap data. To determine if a row has been deleted, the page data structure for the page containing the row is located and the bit for the row in the page data structure is checked. An array of page data structures is created, indexed by a hash of the page identifier. In the event of a hash collision, a linked list of page data structures is used, sorted by page identifier. | 2022-05-26 |
20220164386 | DATA AUGMENTATION FOR LOCATION-BASED SEARCHING - System and methods for augmenting search results with external/user-provided data fields not contained in a primary datastore. A method includes receiving, by a processor, a location-based query; searching, by the processor, a primary datastore for one or more candidates for the location-based query; identifying, by the processor, one or more data fields for the one or more candidates contained in a secondary datastore, the one or more data fields not contained in the primary datastore; augmenting, by the processor, the one or more candidates with the one or more data fields; and providing, by the processor, the augmented one or more candidates. | 2022-05-26 |
20220164387 | CONCURRENT MULTIPROTOCOL ACCESS TO AN OBJECT STORAGE SYSTEM - In accordance with some aspects of the present disclosure, a non-transitory computer readable medium is disclosed. The non-transitory computer readable medium includes instructions when executed by a processor cause the processor to write an object to an object store using an object-based access protocol, look up the object from the object store using a file-based access protocol, and create one or more directories on-demand in the object store. | 2022-05-26 |
20220164388 | DFS-BASED CYCLE DETECTION ON PREGEL MODEL - A method, system and computer program product are presented for reducing memory consumption in depth first search (DFS)-based cycle detection processes to detect an n-length cycle on a Pregel model. The method includes generating a graph including a plurality of vertices and edges connecting the plurality of vertices, commencing a cycle from a first vertex of the plurality of vertices, setting an ID of the first vertex to a path and the first vertex as a target vertex, and iterating the following n−1 times: send the path to out-edges starting from the first vertex and transferring the path, via out-edges, n−1 times by subsequent received vertices, find one vertex before returning to the target vertex, add an ID of a found vertex to the path, and set the found vertex as the target vertex such that n=n−1, where is a number of iterations. | 2022-05-26 |
20220164389 | LABEL PROPAGATION IN A DISTRIBUTED SYSTEM - Data are maintained in a distributed computing system that describe a graph. The graph represents relationships among items. The graph has a plurality of vertices that represent the items and a plurality of edges connecting the plurality of vertices. At least one vertex of the plurality of vertices includes a set of label values indicating the at least one vertex's strength of association with a label from a set of labels. The set of labels describe possible characteristics of an item represented by the at least one vertex. At least one edge of the plurality of edges includes a set of label weights for influencing label values that traverse the at least one edge. A label propagation algorithm is executed for a plurality of the vertices in the graph in parallel for a series of synchronized iterations to propagate labels through the graph. | 2022-05-26 |
20220164390 | SYSTEM AND METHODS FOR DATA SUPPLY, VERIFICATION, MATCHING, AND ACQUISITION - A data supply, verification, matching, and acquisition platform comprising a data supply sub-system and interface, a data verification sub-system, a data matching sub-system, and a data acquisition sub-system and interface, with the data supply sub-system configured to obtain a first type of data, the data verification sub-system configured to verify the first type of data, the data acquisition sub-system configured to obtain a second type of data, and the data matching sub-system configured to match the first type of data with the second type of data and return positive matches to the data acquisition sub-system. | 2022-05-26 |
20220164391 | CONDUCTING A REPETITIVE SEARCH INCLUDING DIFFERENCE DETERMINATION - Computer-implemented systems and methods for repetitively performing a search. The methods include receiving a search query that includes one or more search parameters including one or more search terms. A search may be repetitively performed to produce a plurality of search results at different points in time, each performed search being based, at least in part, on the one or more search parameters included in the search query. A determination may be made for one or more of the search results whether there is a difference between each of the one or more of the search results and a preceding search result and presenting the one or more of the search results including identifying one or more differences between each of the one or more of the search results and a preceding search result if there are any differences. | 2022-05-26 |
20220164392 | USER REACTION BASED INFORMATION OPTIONS - A method, a computer program product, and a computer system determine, based on reactions exhibited by a user while consuming information, options for further information. The method includes determining a user reaction while the user is consuming the information. The user reaction is indicative of the user implicitly requesting the further information. The information is presented based on the user selecting from original search results according to an original search string submitted by the user. The method includes determining a portion of the information corresponding to the user reaction being exhibited. The method includes determining a further search string corresponding to the portion of the information. The method includes receiving further search results based on the further search string. Each of the further search results configured to present the further information to the user. The method includes modifying the original search results to include the further search results. | 2022-05-26 |
20220164393 | METHOD OF "OUTCOME DRIVEN DATA EXPLORATION" FOR DATASETS, BUSINESS QUESTIONS, AND PIPELINES BASED ON SIMILARITY MAPPING OF BUSINESS NEEDS AND ASSET USE OVERLAP - One example method includes receiving a query that recites a particular question for which a user who originated the query needs an answer, parsing the query to identify the question, identifying information that is responsive to the question, presenting the information to the user in a user-selectable form, and receiving, from the user, a selection of the information. In some cases, the information presented to the user may include one or more datasets, or one or more pipelines. | 2022-05-26 |
20220164394 | SYSTEM AND METHODS FOR FASTER PROCESSOR COMPARISONS OF VISUAL GRAPH FEATURES - Techniques allow a computer to responsively search for graph shapes similar to a user-selected graph shape much faster. Data can be pre-processed and stored as vectors, along with an index. The index can be used to find similar vectors that represent graph shapes similar to a user-selected shape in a computationally efficient manner. Vectors of multiple resolutions can be used to anticipate different sizes of a graph that a user can select, and comparisons can be repeated and refined. When a satisfactorily small number of candidate vectors are determined, more computationally intensive distance calculations can be performed on data reconstructed from the vectors. | 2022-05-26 |
20220164395 | Using Natural Language Processing for Visual Analysis of a Data Set - A method uses natural language for visual analysis of a dataset, and is performed at a computer having a display, processors, and memory. The computer displays a data visualization based on a dataset retrieved from a database and receives a first user input to specify a natural language command related to the displayed data visualization. Based on the displayed data visualization and the natural language command, the computer identifies an initial range of values for a first data field in the dataset and displays an editable user interface control showing the initial range of values. The computer receives a second user input, at the user interface control, specifying a modified range of values for the first data field and retrieves an updated dataset from the database using the modified range of values for the first data field. The computer then updates the displayed data visualization using the updated dataset. | 2022-05-26 |
20220164396 | METADATA INDEXING FOR INFORMATION MANAGEMENT - A method, apparatus, computer system, and computer program product for managing information. A set of bucket hashes and comparison information for a data record are identified by a computer system. The set of bucket hashes is generated from the comparison information, wherein the set of bucket hashes and the comparison information form a metadata record. A number of candidate metadata records in a metadata database is identified by the computer system using the set of bucket hashes, wherein the number of candidate metadata records comprises a set of candidate bucket hashes and candidate comparison information. An entity membership is identified by the computer system for the data record from a comparison of the comparison information in the metadata record with the candidate comparison information in the number of candidate metadata records. | 2022-05-26 |
20220164397 | SYSTEMS AND METHODS FOR ANALYZING MEDIA FEEDS - Aspects of the present disclosure provide systems, methods, apparatus, and computer-readable storage media that support relevance-based analysis and filtering of documents and media for one or more enterprises. Aspects disclosed herein leverage custom-built taxonomies, natural language processing (NLP), and machine learning (ML) for identifying and extracting features from highly-relevant documents. The extracted features are vectorized and then filtered based on entities (e.g., enterprises, organizations, individuals, etc.) and compliance-based risks (e.g., illegal or non-compliant activities) that are highly relevant to a particular client. The filtered feature vectors are used to identify and highlight relevant information in the corresponding documents, enabling decision making to resolve compliance-related risks. The aspects described herein generate fewer false positive or otherwise less relevant results than conventional document screening applications or manual techniques. | 2022-05-26 |
20220164398 | METHOD AND SYSTEM FOR ORDINARY USERS TO MODERATE INFORMATION - A method and system that allows ordinary users to moderate information in a computer system under conditions in which their evaluations can be trusted. | 2022-05-26 |
20220164399 | LOCATING METHOD AND DEVICE, AND STORAGE MEDIUM - A locating method and device, and a storage medium. The method comprises: displaying a locating control provided with a navigation point at a first preset position on a display interface loading list data, wherein the navigation point represents an identifier corresponding to a position marked in a loaded data link in the list data (S | 2022-05-26 |
20220164400 | METHODS AND APPARATUSES FOR PROVIDING INTERNET-BASED PROXY SERVICES - A proxy server receives, from multiple visitors of multiple client devices, a plurality of requests for actions to be performed on identified network resources belonging to a plurality of origin servers. At least some of the origin servers belong to different domains and are owned by different entities. The proxy server and the origin servers are also owned by different entities. The proxy server analyzes each request it receives to determine whether that request poses a threat and whether the visitor belonging to the request poses a threat. The proxy server blocks those requests from visitors that pose a threat or in which the request itself poses a threat. The proxy server transmits the requests that are not a threat and is from a visitor that is not a threat to the appropriate origin server. | 2022-05-26 |
20220164401 | SYSTEMS AND METHODS FOR DYNAMICALLY CREATING HYPERLINKS ASSOCIATED WITH RELEVANT MULTIMEDIA CONTENT - The present disclosure relates to systems and methods for dynamically creating hyperlinks associated with relevant multimedia content in a computer network. A hyperlink generation module receives an electronic text file from a server. The module searches the text file to identify keywords present in the file. Once the keywords have been identified, a database is queried to identify multimedia content that is related to the keywords. Generally, multimedia content is associated with metadata to enable efficient searching of the multimedia content. Typically, the multimedia content is contextually relevant to both the identified keywords and text file. One or more hyperlinks corresponding to the keywords are then generated and inserted into the text file. The hyperlinks provide pointers to the identified multimedia content. After insertion into the text file, the hyperlinks may be clicked by a user or viewer of the file to retrieve and display the identified multimedia content. | 2022-05-26 |