Abstract: Mechanisms are provided to implement a neural flow attestation engine and perform computer model execution integrity verification based on neural flows. Input data is input to a trained computer model that includes a plurality of layers of neurons. The neural flow attestation engine records, for a set of input data instances in the input data, an output class generated by the trained computer model and a neural flow through the plurality of layers of neurons to thereby generate recorded neural flows. The trained computer model is deployed to a computing platform, and the neural flow attestation engine verifies the execution integrity of the deployed trained computer model based on a runtime neural flow of the deployed trained computer model and the recorded neural flows.

Abstract: A method for quickly optimizing key mining parameters of an outburst coal seam as provided includes steps of constructing a graphic basic information model of the coal mine, giving coal mine characteristic information, performing mining simulation, constructing a CNN-LSTM predicating model, obtaining changes under different mining conditions, constructing a Lorenz chaotic primer, and the like. The model can be improved with continuous breakthroughs in theory, so that the model has a strong learning ability and can adapt to the constantly changing complex geological environment. The method has very good predictability for the determination of coal seam group parameters, and can efficiently select and output a set of candidate parameters.

Abstract: A multiple-input multiple-output (MIMO) receiver for Wireless Fidelity (Wi-Fi), and an electronic device. The MIMO receiver for Wi-Fi includes n antennas, an energy detection circuitry, a multilink gating circuitry, receiving links, a frequency offset adjustment circuitry, and a gating control circuitry. The multilink gating circuitry includes one energy detection gating output terminal coupled to the frequency offset adjustment circuitry through the energy detection circuitry and n-1 non-energy detection gating output terminals coupled to the frequency offset adjustment circuitry. The multilink gating circuitry connects each gating input terminal to one of the gating output terminals. The gating control circuitry periodically obtains a signal strength of each of the receiving links, and controls, based on the signal strength, the multilink gating circuitry to connect the gating input terminal corresponding to the receiving link that meets a preset condition to the energy detection gating output terminal.

Abstract: Disclosed is an intelligent control system of spunlace production line, which includes a data acquiring module, which is used for acquiring and storing real-time production line data; the production line data includes cotton feeding roller value, real-time moisture value, real-time speed value and real-time gram weight value; the data process module is used for classify and controlling that production line data, and giving the adjustment opinions of the cotton feeding roller parameters; the parameter control module is used for verifying the parameter adjustment opinions and applying the opinions to the control system; the data acquiring module, the data processing module and the parameter control module are connected in sequence.

Abstract: A system may include a memory and a processor in communication with the memory. The processor may be configured to perform operations. The operations may include training a neural network and predicting structural feature sets with the neural network. The operations may include producing predicted structures with the neural network using the structural feature sets, converting the predicted structures into predicted graphs with predicted edges, and comparing predicted graphs to training graphs and predicted edges to training edges to obtain a comparison. The operations may include training a model with the comparison, constructing a graph with the neural network using a node feature set, and reducing missing edges in the graph with the model.

Abstract: Mechanisms are provided to implement a neural flow attestation engine and perform computer model execution integrity verification based on neural flows. Input data is input to a trained computer model that includes a plurality of layers of neurons. The neural flow attestation engine records, for a set of input data instances in the input data, an output class generated by the trained computer model and a neural flow through the plurality of layers of neurons to thereby generate recorded neural flows. The trained computer model is deployed to a computing platform, and the neural flow attestation engine verifies the execution integrity of the deployed trained computer model based on a runtime neural flow of the deployed trained computer model and the recorded neural flows.

Abstract: A computer-implemented method for calculating a similarity between a pair of graph-structured objects by learning-based techniques. The operations include computing the node embeddings of a pair of graph-structured objects of two computer graphs utilizing a hierarchical graph matching network (HGMN). A first component of the HGMN performs graph matching of global-level graph interactions of the two computer graphs. A second component of the HGMN performs graph matching of cross-level node-graph interactions of the two computer graphs. There is an aggregating of features learned from the graph matching of the global-level graph interactions and the cross-level node-graph interactions. At least one of a graph-graph classification or a graph-graph regression is performed utilizing the learned features of the two computer graphs.

Abstract: Mechanisms are provided to implement a neural flow attestation engine and perform computer model execution integrity verification based on neural flows. Input data is input to a trained computer model that includes a plurality of layers of neurons. The neural flow attestation engine records, for a set of input data instances in the input data, an output class generated by the trained computer model and a neural flow through the plurality of layers of neurons to thereby generate recorded neural flows. The trained computer model is deployed to a computing platform, and the neural flow attestation engine verifies the execution integrity of the deployed trained computer model based on a runtime neural flow of the deployed trained computer model and the recorded neural flows.

Abstract: Techniques that facilitate layered stochastics anonymization of data are provided. In one example, a system includes a machine learning component and an evaluation component. The machine learning component performs a machine learning process for first data associated with one or more features to generate second data indicative of one or more example datasets within a degree of similarity to the first data. The first data and the second data comprise a corresponding data format. The evaluation component evaluates the second data for a particular feature from the one or more features and generates third data indicative of a confidence score for the second data.

Abstract: A set of sentences within a natural language text document are parsed, generating a word-level graph corresponding to a sentence in the set of sentences. Within the word-level graph using a trained entity identification model, a set of entity candidates are identified. From a set of graphs modelling relationships between portions of the set of sentences, a set of embeddings is generated. From a set of pairs of embeddings in the set of embeddings using a set of deconvolution layers, a set of links between entity candidates within the set of entity candidates is extracted. From the set of links and the set of entity candidates, an output graph modelling linkages between portions of the set of sentences within the natural language text document is generated.

Abstract: A method, a computer system, and a computer program product for mapping operational records to a topology graph. Embodiments of the present invention may include generating an event frequent pattern using operational records. Embodiments of the present invention may include integrating topology-based event frequent patterns. Embodiments of the present invention may include mapping the operational records with an embedding engine. Embodiments of the present invention may include predicting incident events. Embodiments of the present invention may include receiving labeled patterns to the embedding engine for an active learning cycle.

Abstract: A method for implementing video frame synthesis using a tensor neural network includes receiving input video data including one or more missing frames, converting the input video data into an input tensor, generating, through tensor completion based on the input tensor, output video data including one or more synthesized frames corresponding to the one or more missing frames by using a transform-based tensor neural network (TTNet) including a plurality of phases implementing a tensor iterative shrinkage thresholding algorithm (ISTA), and obtaining a loss function based on the output video data.

Abstract: A system includes a plurality of graph convolutional networks corresponding to a plurality of time steps, each network modelling a graph including nodes and edges, and in turn including a plurality of graph convolution units; an evolving mechanism; and an output layer. Each of the units, for a given one of the time steps, takes as input a graph adjacency matrix, a node feature matrix, and a parameter matrix for a current layer, and outputs a new node feature matrix for a next highest layer. The mechanism takes as input a parameter matrix for a prior time step updates the input parameter matrix, and outputs the parameter matrix for the given time step. The output layer obtains, as input, output of each of the units for a final time step, and based on the output of each of the units for the final time step, outputs a graph solution.

Abstract: Aspects of the present disclosure relate to knowledge graph compression. An input knowledge graph (KG) can be received. The input KG can be encoded to receive a first set of node embeddings. The input KG can be compressed into an output KG. The output KG can be encoded to receive a second set of node embeddings. A model for KG compression can be trained using optimal transport based on a distance matrix between the first set of node embeddings and the second set of node embeddings.

Abstract: A set of sentences within a natural language text document are parsed, generating a word-level graph corresponding to a sentence in the set of sentences. Within the word-level graph using a trained entity identification model, a set of entity candidates are identified. From a set of graphs modelling relationships between portions of the set of sentences, a set of embeddings is generated. From a set of pairs of embeddings in the set of embeddings using a set of deconvolution layers, a set of links between entity candidates within the set of entity candidates is extracted. From the set of links and the set of entity candidates, an output graph modelling linkages between portions of the set of sentences within the natural language text document is generated.

Abstract: A method for implementing video frame synthesis using a tensor neural network includes receiving input video data including one or more missing frames, converting the input video data into an input tensor, generating, through tensor completion based on the input tensor, output video data including one or more synthesized frames corresponding to the one or more missing frames by using a transform-based tensor neural network (TTNet) including a plurality of phases implementing a tensor iterative shrinkage thresholding algorithm (ISTA), and obtaining a loss function based on the output video data.

Abstract: A method for quickly optimizing key mining parameters of an outburst coal seam as provided includes steps of constructing a graphic basic information model of the coal mine, giving coal mine characteristic information, performing mining simulation, constructing a CNN-LSTM predicating model, obtaining changes under different mining conditions, constructing a Lorenz chaotic primer, and the like. The model can be improved with continuous breakthroughs in theory, so that the model has a strong learning ability and can adapt to the constantly changing complex geological environment. The method has very good predictability for the determination of coal seam group parameters, and can efficiently select and output a set of candidate parameters.

Abstract: A computer-implemented method for calculating a similarity between a pair of graph-structured objects by learning-based techniques. The operations include computing the node embeddings of a pair of graph-structured objects of two computer graphs utilizing a hierarchical graph matching network (HGMN). A first component of the HGMN performs graph matching of global-level graph interactions of the two computer graphs. A second component of the HGMN performs graph matching of cross-level node-graph interactions of the two computer graphs. There is an aggregating of features learned from the graph matching of the global-level graph interactions and the cross-level node-graph interactions. At least one of a graph-graph classification or a graph-graph regression is performed utilizing the learned features of the two computer graphs.

Abstract: A method, a computer system, and a computer program product for mapping operational records to a topology graph. Embodiments of the present invention may include generating an event frequent pattern using operational records. Embodiments of the present invention may include integrating topology-based event frequent patterns. Embodiments of the present invention may include mapping the operational records with an embedding engine. Embodiments of the present invention may include predicting incident events. Embodiments of the present invention may include receiving labeled patterns to the embedding engine for an active learning cycle.

Abstract: A system includes a plurality of graph convolutional networks corresponding to a plurality of time steps, each network modelling a graph including nodes and edges, and in turn including a plurality of graph convolution units; an evolving mechanism; and an output layer. Each of the units, for a given one of the time steps, takes as input a graph adjacency matrix, a node feature matrix, and a parameter matrix for a current layer, and outputs a new node feature matrix for a next highest layer. The mechanism takes as input a parameter matrix for a prior time step updates the input parameter matrix, and outputs the parameter matrix for the given time step. The output layer obtains, as input, output of each of the units for a final time step, and based on the output of each of the units for the final time step, outputs a graph solution.