Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for latent summarization of a graph. Structural features can be captured from feature vectors associated with each node of the graph by applying base functions on the feature vectors and iteratively applying relational operators to successive feature matrices to derive deeper inductive relational functions that capture higher-order structural information in different subgraphs of increasing size (node separations). Heterogeneity can be summarized by performing capturing features in appropriate subgraphs (e.g., node-centric neighborhoods associated with each node type, edge direction, and/or edge type). Binning and/or dimensionality reduction can be applied to the resulting feature matrices.

Abstract: The application relates to an assembly for controlling detonation wave mode of a rotating detonation combustion chamber, which includes an inner barrel, an outer plate and at least one sectoral direction-changing block. The outer plate is sleeved outside the inner barrel. An annular cavity is formed between the outer plate and the inner barrel. At least one groove is arranged on one side of the outer plate close to the inner barrel. The groove wall comprises an arc edge and a straight edge. The groove is connected with the annular cavity. The sectoral direction-changing blocks are arranged in the grooves in one-to-one correspondence. An arc edge of the sectoral direction-changing block is positioned far away from the inner barrel.

Abstract: Deriving network embeddings that represent attributes of, and relationships between, different nodes in a network while preserving network data temporal and structural properties is described. A network representation system generates a plurality of graph time-series representations of network data that each includes a subset of nodes and edges included in a time segment of the network data, constrained either by time or a number of edges included in the representation. A temporal graph of the network data is generated by implementing a temporal model that incorporates temporal dependencies into the graph time-series representations. From the temporal graph, network embeddings for the network data are derived, where the network embeddings capture temporal dependencies between nodes, as indicated by connecting edges, as well as temporal structural properties of the network data.

Abstract: Computer technology where a data table and its index are created using a VOLATILE column type. Records are inserted with a final value and index is inserted with staging value. One bit is used in the data record header to indicate whether it is in-sync with its index. One bit in index key header indicates either this can be an index only update or needs to be a regular update. In the beginning, when a record is inserted into data page, both flag bits will be in the off status, meaning the data record is not in sync with its index entry and only index-only update(s) may be performed. This can prevent needless updates to a data page stored in a volatile memory (for example, a random access memory).

Abstract: The application relates to a mode control flow channel structure of a rotating detonation combustion chamber, which includes an inner barrel, an outer plate and at least one sectoral direction-changing block. The outer plate is sleeved outside the inner barrel. An annular cavity is formed between the outer plate and the inner barrel. At least one groove is arranged on one side of the outer plate close to the inner barrel. The groove wall comprises an arc edge and a straight edge. The groove is connected with the annular cavity. The sectoral direction-changing blocks are arranged in the grooves in one-to-one correspondence. An arc edge of the sectoral direction-changing block is positioned far away from the inner barrel.

Abstract: The application relates to an anti-back-transfer intake structure of a rotating detonation combustion chamber including a Tesla valve communicating with the rotating detonation combustion chamber and arranged at an inlet of the rotating detonation combustion chamber. The Tesla valve includes a casing and a flow passage, the casing is coaxially connected with an outer wall of the rotating detonation combustion chamber, the flow passage is arranged in the casing, and the flow passage has an inlet end for introducing air, and an outlet end connected with an annular passage of the rotating detonation combustion chamber.

Abstract: Embodiments of the present disclosure relate to a method, system, and computer program product for block level lock on a data table. According to the method, in response to first transactional processing to be applied on a data table, one or more processors determine that first target data to be accessed during execution of the first transactional processing is comprised in a continuous range of data in the data table. One or more processors determine whether a block lock is available for locking the continuous range of data for the first transactional processing. In accordance with a determination that the block lock is available, one or more processors grant the first transactional processing with the block lock, the block lock being associated with lock information indicating the continuous range of data.

Abstract: Deriving network embeddings that represent attributes of, and relationships between, different nodes in a network while preserving network data temporal and structural properties is described. A network representation system generates a plurality of graph time-series representations of network data that each includes a subset of nodes and edges included in a time segment of the network data, constrained either by time or a number of edges included in the representation. A temporal graph of the network data is generated by implementing a temporal model that incorporates temporal dependencies into the graph time-series representations. From the temporal graph, network embeddings for the network data are derived, where the network embeddings capture temporal dependencies between nodes, as indicated by connecting edges, as well as temporal structural properties of the network data.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for latent summarization of a graph. Structural features can be captured from feature vectors associated with each node of the graph by applying base functions on the feature vectors and iteratively applying relational operators to successive feature matrices to derive deeper inductive relational functions that capture higher-order structural information in different subgraphs of increasing size (node separations). Heterogeneity can be summarized by performing capturing features in appropriate subgraphs (e.g., node-centric neighborhoods associated with each node type, edge direction, and/or edge type). Binning and/or dimensionality reduction can be applied to the resulting feature matrices.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for latent summarization of a graph. Structural features can be captured from feature vectors associated with each node of the graph by applying base functions on the feature vectors and iteratively applying relational operators to successive feature matrices to derive deeper inductive relational functions that capture higher-order structural information in different subgraphs of increasing size (node separations). Heterogeneity can be summarized by performing capturing features in appropriate subgraphs (e.g., node-centric neighborhoods associated with each node type, edge direction, and/or edge type). Binning and/or dimensionality reduction can be applied to the resulting feature matrices.

Abstract: Provided in the present invention is a banknote management method. The method comprises: acquiring, identifying, and processing banknote features by a banknote information processing apparatus, so as to obtain banknote feature information; transmitting the banknote feature information, service information, and information about the banknote information processing apparatus together to a main control server; and the main control server processing the received information and classifying banknotes. Also provided is a banknote management system for the banknote management method. The method of the present invention can enhance robustness of identification while maintaining an operation speed, thus ensuring accuracy and practicability in actual applications.

Abstract: Provided in the present invention is a banknote management method. The method comprises: acquiring, identifying, and processing banknote features by a banknote information processing apparatus, so as to obtain banknote feature information; transmitting the banknote feature information, service information, and information about the banknote information processing apparatus together to a main control server; and the main control server processing the received information and classifying banknotes. Also provided is a banknote management system for the banknote management method. The method of the present invention can enhance robustness of identification while maintaining an operation speed, thus ensuring accuracy and practicability in actual applications.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for inserting one or more records into a database table. An insert request for inserting a new record to a database table is received, wherein the new record includes at least one key field. a partial identity of at least one record matching the at least one key field of the new record is searched for. A partial identity is assigned to the new record based on a result of the searching.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for latent summarization of a graph. Structural features can be captured from feature vectors associated with each node of the graph by applying base functions on the feature vectors and iteratively applying relational operators to successive feature matrices to derive deeper inductive relational functions that capture higher-order structural information in different subgraphs of increasing size (node separations). Heterogeneity can be summarized by performing capturing features in appropriate subgraphs (e.g., node-centric neighborhoods associated with each node type, edge direction, and/or edge type). Binning and/or dimensionality reduction can be applied to the resulting feature matrices.

Abstract: Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.

Abstract: An approach for index B-tree page creation associated with linear sequential insertions in database management systems (DBMS). A linear pre-splitter receives a current index leaf page for linear sequential insertion. The linear pre-splitter asynchronously creates index leaf pages where the current index leaf page is in a predetermined position at least one page away from a last index leaf page. The linear pre-splitter updates index leaf page position identifiers associated with the index leaf pages where the index leaf page position identifiers link the index leaf pages and the last index leaf page and the linear pre-splitter inserts index leaf page identifiers and index key metadata associated with each of the index leaf pages into index non-leaf pages.

Abstract: An approach for index B-tree page creation associated with linear sequential insertions in database management systems (DBMS). A linear pre-splitter receives a current index leaf page for linear sequential insertion. The linear pre-splitter asynchronously creates index leaf pages where the current index leaf page is in a predetermined position at least one page away from a last index leaf page. The linear pre-splitter updates index leaf page position identifiers associated with the index leaf pages where the index leaf page position identifiers link the index leaf pages and the last index leaf page and the linear pre-splitter inserts index leaf page identifiers and index key metadata associated with each of the index leaf pages into index non-leaf pages.

Abstract: Coexistence and migration of legacy and VXLAN networks may be provided. A first anchor leaf switch and a second anchor leaf switch may detect that they can reach each other over a Virtual Extensible Local Area Network (VXLAN) overlay layer 2 network. In response to detecting that they can reach each other over the VXLAN, the second anchor leaf switch may block VLANs mapped to the VXLAN's VXLAN Network Identifier (VNI) on the second anchor leaf switch's ports connecting to spine routers. In addition, the first anchor leaf switch and the second anchor leaf switch may detect that they can reach each other over a physical layer 2 network. In response to detecting that they can reach each other over a physical layer 2 network, the second anchor leaf switch may block Virtual Extensible Local Area Network (VXLAN) segments at the second anchor leaf switch.

Abstract: Allocating free space in a database table. Statistics associated with records in a database are received, including an average record byte size for records stored in the database table. A primary free space byte size for record updates is determined, including comparing a preliminary free space byte size to the average record byte size and a byte size of a record subjected to a database operation. Based on the primary free space byte size, free space at the page level of the database table is allocated.

Abstract: Embodiments of the present invention provide computer-implemented methods, computer systems and computer program products. According to one embodiment of the present invention, an index of a database is obtained, where the index includes at least one node associated with index information of at least one old data entry that has been deleted from the database, and the node is marked as invalid. Then, a node included in the index is selected based on a key value in index information of a new data entry in response to the new data entry being inserted into the database. Next, the selected node is updated with the index information of the new data entry.