Abstract: A method for dynamic selection of transactions for inclusion in new blocks added to a blockchain includes: receiving, by a blockchain node in a blockchain network that manages a blockchain, a plurality of proposed transactions; sorting, by the blockchain node, each proposed transaction into one of a plurality of transaction groups; identifying, by the blockchain node, a selection of proposed transactions based on one or more dynamic selection criteria, where the selection of proposed transactions includes one or more proposed transactions from one or more of the plurality of transactions groups based on the one or more dynamic selection criteria; generating, by the blockchain node, a new block including a new block header and the identified selection of proposed transactions; and distributing, by the blockchain node, the generated new block to a plurality of additional nodes included in the blockchain network.

Abstract: A computerized method includes obtaining a set of historical data characterizing interactions of a user with a first network provider and a second network provider. The first network provider includes a restrictive condition with respect to the second network provider, and the restrictive condition indicates that a network provider preference included in configuration data corresponding to an account of the user is constrained to one of the first network provider or the second network provider. The method includes generating, using the set of historical data, a predicted network provider indicating one of the first network provider or the second network provider. The method includes communicating the predicted network provider as a recommended network provider preference for the configuration data corresponding to the account of the user.

Abstract: An information processing apparatus 4 includes: a transformation unit 423 configured to transform a plurality of tuples of feature vector data XV in a presentation space into a plurality of tuples of latent vector data ZV in a latent space; an extraction unit 423 configured to extract, based on the plurality of tuples of latent vector data, feature vector data having a shorter distance from query data DQ in the latent space than the other feature vector data, as neighbor data DNi from among the plurality of tuples of feature vector data; a generation unit 424 configured to generate, based on the neighbor data, a local model LM that outputs an estimation value dpi of a latent distance di when difference information Vi is inputted, the latent distance being a distance between the query data and the neighbor data in the latent space, the difference information being related to a difference, for each element of the features, between the query data and the neighbor data in the presentation space; and a calculation

Abstract: An autonomous data container and methods of use are disclosed. The autonomous data container includes a data storage structure for storing financial transaction information. The autonomous data container also includes an artificially intelligent agent stored as code within the container. The artificially intelligent agent can run on a system storing the autonomous data container. The artificially intelligent agent can access transaction information in the data storage structure and make predictions and/or decisions on a consumer's behalf. The artificially intelligent agent can make new purchases on the consumer's behalf. The artificially intelligent agent can also provide fraud alerts for the consumer.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for optimizing a digital resource search. One of the methods includes receiving a search query that specifies one or more parameters including a first parameter for a web resource request; determining that the first parameter is a particular parameter; in response to determining that the first parameter is a particular parameter: determining, using a historical search database, historical search data; predicting a subset of databases that are predicted to have web resources that are more likely responsive to the search query than second web resources; and obtaining a dataset that includes a plurality of web resources that each satisfy at least one parameter of the search query or at least partially satisfy the first parameter; and generating a plurality of search results for the web resource request.

Abstract: Computer-readable media, methods, and systems are disclosed for improving performance when dropping database snapshots by linking converter streams associated with adjacent snapshots in a database system. A request is received to drop a snapshot. The database system iterates a first converter tree associated with a first converter stream to identify a first physical page number to be loaded. A physical page corresponding to the first physical page number is loaded. The database system iterates a second converter tree associated with a second converter stream to identify a second physical page number to be loaded. The second physical page number is queried from an iterator associated with the first converter tree. Responsive to determining that the physical page associated with the second physical page number is not present in main memory, the in-memory database system loads from disk, the physical page associated with the second physical page number.

Abstract: Methods, systems, and computer program products for identifying anomalous transformations using lineage data are provided herein. A computer-implemented method includes generating a set of column profiles for a corresponding set of columns within one or more datasets based at least in part on lineage data and glossary data, wherein the lineage data comprises information related to transformations performed on each column in the set by a computing platform, and wherein the glossary data comprises information related to one or more terms assigned to one or more of the columns; obtaining information related to a new transformation involving at least one column in the set of columns; comparing the new transformation to the set of column profiles to determine whether the new transformation is anomalous; and in response to determining the new transformation is anomalous, outputting an alert to a user of the computing platform.

Abstract: Techniques are disclosed for implementing a unified partitioning scheme within distributed database systems to allow a table to be horizontally partitioned and those partitions stored on and serviced by a storage group. A storage group is a subset of storage manager (SM) nodes, and each SM node is configured to persist database data in durable storage. The distributed database system assigns each storage group to a subset of SM nodes. The distributed database system can address each storage group using a symbolic mapping that allows transactions to identify a particular storage group, and to direct read and write operations to a subset of SM nodes servicing that storage group. An administrator can update this mapping on-the-fly to cause the distributed database system to dynamically adjust an implemented partitioning scheme without necessarily interrupting on-going database operations.

Abstract: A chatbot server that provides an instant messaging service using a relay chatbot linked to multiple chatbots includes a receiving unit that receives, from a messenger server, a question message relevant to a service selected from multiple services and service account information corresponding to the selected service; a derivation unit that derives an answer to the question message using the relay chatbot corresponding to the service account information; and a transmission unit that transmits the answer to the messenger server, wherein the relay chatbot relays a user device to the multiple chatbots linked to the relay chatbot to derive the answer through at least one of the multiple chatbots.

Abstract: According to a one embodiment of the present invention, a method for collecting a website in an electronic device includes: step a of accessing a web server corresponding to a Uniform Resource Locator (URL) and receiving a website corresponding to the URL; step b of obtaining a first solution key based on a CAPTCHA solution model when CAPTCHA exists in the website; step c of transmitting the first solution key to the web server and receiving an authentication result; step d of recalculating the first solution key when authentication of the first solution key has failed and transmitting a CAPTCHA resolution request signal to a user terminal when the authentication has failed more than a preset number of times; and step e of receiving a second solution key from the user terminal, transmitting the second solution key to the web server, and crawling the website.

Abstract: A determination device according to the present application has an acquisition unit and a determination unit. The acquisition unit acquires the search queries, which are the search queries input by a plurality of input customers who have input the reference query and input within a predetermined period. The determination unit determines whether a predetermined period is appropriate or not based on the attributes of the input customers who have input search queries or based on whether these search queries satisfy predetermined conditions or not.

Abstract: The disclosed embodiments related to multilateral portfolio compression using general large-scale linear optimization which pre-processes a model to decrease model size using domain knowledge to remove variables to reduce dimensionality, thereby making the model faster to solve and improving numerical characteristics. but it would not remove, for example, as much as half of the model, but rather a smaller fraction. The disclosed pre-processing enables an approximate solution for large, linear optimization models by automatically iteratively and selectively partitioning them into independently easily solvable sub-models. The sub-models are themselves linear optimization models, which can be solved with any preferred algorithm or library. The solutions for each sub-model are aggregated to obtain an acceptable, e.g., approximate, solution for a large model without solving the full model.

Abstract: A method includes obtaining a schema of a database and obtaining a field of a data table of the schema, the field including a field name and a field descriptor. The method includes accessing a first set of records structured in accordance with the schema and assigning a category to the field of the schema based on the field name and the field descriptor using a machine learning model. The method includes receiving an identifier via an application program interface and obtaining a set of query generation model parameters associated with the database or the schema. The method includes generating a plurality of queries based on the set of query generation model parameters, the identifier, and the category. The method includes retrieving a second set of records from the database based on the plurality of queries and storing the second set of records in association with the identifier.

Abstract: Increasing index search efficiency and availability in a database is provided. An index space matrix corresponding to a plurality of mini-indices of the database is built using ordered boundary values that correspond to key value ranges of each respective mini-index to increase index search efficiency by removing redundant mini-index accesses. Mini-indices of the plurality of mini-indices are consolidated asynchronously without suspending access to the mini-indices using a particular consolidation policy of a plurality of consolidation policies that corresponds to an amount of key value overlap identified between the mini-indices. Data operations corresponding to transactions are performed using the index space matrix during consolidation of the mini-indices without suspending access to the mini-indices.

Abstract: A method for managing a file system includes obtaining, by a compression optimizing manager, a compression algorithm selection request for the file system, determining a set of selection inputs based on a set of file system parameters of the file system, applying a compression selection model to the set of selection inputs to obtain a compression algorithm selection, and initiating a file system compression implementation of the file system using the compression algorithm selection.

Abstract: Distributed database systems including a plurality of SQL compute nodes are described herein that enable such nodes to operate with versioned metadata despite the fact that SQL is only single-version aware. The distributed database system further includes a global logical metadata server to store and manage versions of metadata, to determine which of such versions should be visible at any given point in time, and enable creation of a virtual database that includes the proper versions of metadata. In an aspect, a central transaction manager manages global transaction identifiers and their associated start times, abort times and/or commit times that enables determination of transaction and metadata version visibility for any point in time. In an aspect, the visible metadata is included in a virtual database that logically overlays a physical database and provides the correct version of metadata in lieu of the current metadata version stored in the physical database.

Abstract: A method of processing multimedia data, a device, and a medium, which relates to a field of an artificial intelligence technology, in particular to fields of knowledge graph and deep learning. The method of processing the multimedia data includes: recognizing the multimedia data so as to obtain at least one key information of the multimedia data; querying a predetermined knowledge base according to the at least one key information, so as to determine a multimedia name associated with the at least one key information and an association degree between the multimedia name and the at least one key information; and determining, in the multimedia name, a name of the multimedia data based on a similarity between alternative multimedia data for the multimedia name and the multimedia data, in response to the association degree being less than a first threshold value.

Abstract: A computing architecture includes a continuous property record (CPR) mass asset model. The CPR mass asset model includes a retirement unit field, an asset location field, and a vintage field for each mass asset. The retirement unit field stores an identifier of the mass asset, the asset location field storing a region of installation of the mass asset, and the vintage field storing a date of the mass asset. The CPR asset model is a wrapper for a corresponding master data structure of an existing asset system. The computing architecture further includes a retirement ledger for storing a postings for the mass assets. The retirement ledger stores at least one line for each transaction using the mass assets. The computing architecture further includes CPR unitization and retirement engine for adding lines to the retirement ledger.

Abstract: A computer-implemented method for managing data quality is provided. The method comprising determining, by a rule engine, a number of critical data points in a number of different software modules. A classifier is identified based on a data type of the critical data points, and the classifier is bound to the critical data points. The classifier scans the critical data points for anomality to verify an ability to correctly process the critical data points. A data quality report is generated based on the scan and displayed to an end user in a graphical user interface.

Abstract: The disclosed technology addresses the need in the art for a content management system that can be highly flexible to the needs of its subjects. The present technology permits any object to be shared by providing a robust and flexible access control list mechanism. The present technology utilizes a data structure that is highly efficient that both minimizes the amount of information that needs to be written into any database, but also allows for fast reads and writes of information from authoritative tables that are a source of truth for the content management system, while allowing for maintenance of indexes containing more refined data that allow for efficient retrieval of certain information that would normally need to be calculated when it is needed.