Abstract: System, method, and computer readable medium for dynamic graph representation learning with self-supervision, including extracting a time window of data from the dynamic graph representation to obtain a history graph that represents a sub-set of the dynamic graph representation; generating, using an encoder model configured by a set of learned encoder parameters and implemented by the computer system, a set of embeddings for the history graph; and predicting, using a first decoder model configured by a first set of learned decoder parameters and implemented by the computer system, one or more predictions for the dynamic graph representation corresponding to the specific prediction task.

Abstract: The present disclosure provides a multi-path universal asynchronous transceiver (UART) and transmission method thereof. The multi-path UART comprises a first buffer, a second buffer, and a tx aggregation and arbitration circuit respectively coupled to the first buffer and the second buffer and presets a predetermined threshold. The tx aggregation and arbitration circuit polls the first buffer and the second buffer according to the predetermined threshold, and executes an arbitration procedure on the first buffer and the second buffer to obtain at least one of first log information packet and at least one of second log information packet correspondingly. Thus, when inputting a plurality of log sources, it is not necessary to have a plurality of output pins and to avoid disorder caused by the cross-influence of multiple log information for resource conservation and providing log information correctness.

Abstract: Probabilistic spatiotemporal forecasting comprising acquiring a time series of observed states from a real-world system, each observed state corresponding to a respective time-step in the time series and including a set of data observations of the real-world system for the respective time-step. For each of a plurality of the time steps in the time series of observed states, a hidden state is generated for the time-step based on an observed state for a prior time-step and an approximated posterior distribution generated for a hidden state for the prior time-step. The use of an approximated posterior distribution can enable improved forecasting in complex, high dimensional settings.

Abstract: Methods and systems for generating a floorplan for a circuit are disclosed. A netlist graph of the circuit and block features associated with blocks of the circuit are obtained. A reinforcement learning (RL) agent is used to generate a sequence of corner block list (CBL) actions. Each CBL action is generated by: generating a current state embedding representing a current state of the floorplan; and inputting the current state embedding to a policy network of the RL agent to generate a predicted output vector, which is used to generate the CBL action. After each CBL action is generated, the current CBL representation of the floorplan and the block features are updated to reflect the state of the floorplan after applying the CBL action. The CBL representation is outputted as a final floorplan after all blocks have been placed.

Abstract: System and method for training a recommender system (RS). The RS is configured to make recommendations in respect of a bipartite graph that comprises a plurality of user nodes, a plurality of item nodes, and an observed graph topology that defines edges connecting at least some of the user nodes to some of the item nodes, the RS including an existing graph neural network (GNN) model configured by an existing set of parameters. The method includes: applying a loss function to compute an updated set of parameters for an updated GNN model that is trained with a new graph using the first set of parameters as initialization parameters, the loss function being configured to distil knowledge based on node embeddings generated by the existing GNN model in respect of an existing graph, wherein the new graph includes a plurality of user nodes and a plurality of item nodes that are also included in the existing graph; and replacing the existing GNN model of the RS with the updated GNN model.

Abstract: Method and system for assisting electronic chip design, comprising: receiving netlist data for a proposed electronic chip design, the netlist data including a list of circuit elements and a list of interconnections between the circuit elements; converting the netlist data to a graph that represents at least some of the circuit elements as nodes and represents the interconnections between the circuit elements as edges; extracting network embeddings for the nodes based on a graph topology represented by the edges; extracting degree features for the nodes based on the graph topology; and computing, using a graph neural network, a congestion prediction for the circuit elements that are represented as nodes based on the extracted network embeddings and the extracted degree features.

Abstract: Method and system for processing a bipartite graph that comprises a plurality of first nodes of a first node type, and a plurality of second nodes of a second type, comprising: generating a target first node embedding for a target first node based on features of second nodes and first nodes that are within a multi-hop first node neighbourhood of the target first node, the target first node being selected from the plurality of first nodes of the first node type; generating a target second node embedding for a target second node based on features of first nodes and second nodes that are within a multi-hop second node neighbourhood of the target second node, the target second node being selected from the plurality of second nodes of the second node type; and determining a relationship between the target first node and the target second node based on the target first node embedding and the target second node embedding.

Abstract: System and method for processing a graph that defines a set of nodes and a set of edges, the nodes each having an associated set of node attributes, the edges each representing a relationship that connects two respective nodes, comprising: generating a first node embedding for each node by: generating, for the node and each of a plurality of neighbour nodes, a respective first edge attribute defining a respective relationship type between the node and the neighbour node based on the node attributes of the node and the node attributes of the neighbour node; generating a first neighborhood vector that aggregates information from the generated first edge attributes and the node attributes of the neighbour nodes; generating the first node embedding based on the node attributes of the node and the generated first neighborhood vector.

Abstract: Systems, methods, and computer-readable media provide a graph processing system that incorporates a graph neural network (GNN) based recommender system (RS), as well as a method for training a GNN based RS to address feature leakage that leads to overfitting of the trained GNN based RS. A message correction algorithm is used to modify a user node embedding and a positive item node embedding generated by the graph neural network when generating mini batches of training triples used to train the GNN based RS. The GNN message passing operations are performed on one graph only, in contrast to existing approaches which typically run GNN message passing operations on multiple adjusted input graphs constructed for multiple training triples.

Abstract: Method and system for assisting electronic chip design, comprising: receiving netlist data for a proposed electronic chip design, the netlist data including a list of circuit elements and a list of interconnections between the circuit elements; converting the netlist data to a graph that represents at least some of the circuit elements as nodes and represents the interconnections between the circuit elements as edges; extracting network embeddings for the nodes based on a graph topology represented by the edges; extracting degree features for the nodes based on the graph topology; and computing, using a graph neural network, a congestion prediction for the circuit elements that are represented as nodes based on the extracted network embeddings and the extracted degree features.

Abstract: Method and system for predicting labels for nodes in an observed graph, including deriving a plurality of random graph realizations of the observed graph; learning a predictive function using the random graph realizations; predicting label probabilities for nodes of the random graph realizations using the learned predictive function; and averaging the predicted label probabilities to predict labels for the nodes of the observed graph.

Abstract: Methods and systems are described for training a graph neural network (GNN) to perform a node classification task. A GNN is first pre-trained using ground-truth labeled nodes. The GNN is then used to predict labels for a set of unlabeled nodes, and the predicted labels having confidence indicators that satisfy a high confidence criterion are selected as pseudo labels that are assigned to corresponding nodes. The pseudo labeled nodes and ground-truth labeled nodes are combined together into a combined set of labeled nodes. Using the combined set of labeled nodes, the GNN is trained by computing a total loss between predicted labels generated by the GNN and assigned labels in the combined set of labeled nodes, the total loss being computed as a sum of a computed cross-entropy loss and a computed supervised contrastive loss.

Abstract: System and method for processing an observed bipartite graph that has a plurality of user nodes, a plurality of item nodes, and an observed graph topology that defines edges connecting at least some of the user nodes to some of the item nodes such that at least some nodes have node neighbourhoods comprising edge connections to one or more other nodes. A plurality of random graph topologies are derived that are realizations of the observed graph topology by replacing the node neighbourhoods of at least some nodes with the node neighbourhoods of other nodes. A non-linear function is trained using the plurality of user nodes, plurality of item nodes and plurality of random graph topologies to learn user node embeddings and item node embeddings for the plurality of user nodes and plurality of item nodes, respectively.

Abstract: A recommendation system (RS) for processing an input dataset that identifies a set of users, a set of items, and user-item interaction data about historic interactions between users in the set of users and items in the set of items. The RS is configured to: generate, based on a user-item interaction dataset, a user-user similarity dataset and an item-item similarity dataset, filter the user-user similarity dataset based on a user similarity threshold vector that includes a respective user similarity threshold value for each user, filter the item-item similarity dataset based on an item similarity threshold vector including a respective item similarity threshold value for each item generate a set of user neighbour embeddings based on the filtered user-user similarity dataset, and generating a set of item neighbour embeddings based on the filtered item-item similarity dataset.

Abstract: Recommendation system for processing an input dataset that identifies a set of users, a set of items, and user-item interaction data. A plurality of unique triplets are identified based on the input dataset, wherein each triplet includes: a positive user-item pair; and a negative user-item pair. Over a plurality of training iterations system parameters are learned, including (i) a set of model embeddings for generating respective user-item relevance scores for the positive user-item pairs and the negative user-item pairs; and (ii) weight parameters for each of the triplets. The learning is configured to jointly optimize the model embeddings and the weight parameters to reach a learning objective that is based on weighted difference values determined for the triplets.

Abstract: Method and system for processing an attributed graph that comprises a training dataset of labelled nodes and an unlabeled dataset of unlabeled nodes. The method and system includes selecting, using logistic regression, which candidate node from a plurality of possible candidate nodes included in the unlabeled dataset will minimize a risk if that candidate node is added to the training dataset; obtaining a label for the selected candidate node from a classification resource; and adding the selected candidate node and the obtained label to the training dataset as a labelled node to provide an enhanced training dataset.

Abstract: System and method for processing an observed bipartite graph that has a plurality of user nodes, a plurality of item nodes, and an observed graph topology that defines edges connecting at least some of the user nodes to some of the item nodes such that at least some nodes have node neighbourhoods comprising edge connections to one or more other nodes. A plurality of random graph topologies are derived that are realizations of the observed graph topology by replacing the node neighbourhoods of at least some nodes with the node neighbourhoods of other nodes. A non-linear function is trained using the plurality of user nodes, plurality of item nodes and plurality of random graph topologies to learn user node embeddings and item node embeddings for the plurality of user nodes and plurality of item nodes, respectively.

Abstract: Method and system for predicting labels for nodes in an observed graph, including deriving a plurality of random graph realizations of the observed graph; learning a predictive function using the random graph realizations; predicting label probabilities for nodes of the random graph realizations using the learned predictive function; and averaging the predicted label probabilities to predict labels for the nodes of the observed graph.

Abstract: Method and system for detecting potentially perturbed nodes in a graph that comprises potentially perturbed nodes and clean nodes, comprising: calculating, for each of a plurality of nodes of the graph, a discrepancy value in respect of the node, wherein the discrepancy value for each node indicates a statistical discrepancy for classification probabilities associated with the node and classification probabilities associated with neighbouring nodes; fitting a statistical distribution for the discrepancy values for the clean nodes; determining a detection threshold for potentially perturbed nodes based on the statistical distribution; and identifying nodes having a discrepancy value greater than the detection threshold as potentially perturbed nodes.

Abstract: A method for reducing levels of JAK 1 and thereby blocking the signal transduction pathways that are employed by IFN-.alpha., IFN-.beta., and IFN-.gamma. is provided. In one embodiment the method comprises the steps of: providing a cytomegalovirus (CMV) gene product selected from the group consisting of the CMV immediate early gene (IE) products, the CMV early gene (E) products, and combinations thereof; and introducing the CMV gene product or products into cells at levels sufficient to decrease the levels of JAK 1 in the cell. In another embodiment the method comprises the steps of providing a DNA molecule that comprises a CMV IE gene, a CMV E gene, or combinations thereof; introducing the DNA molecule into the cell; and inducing the expression of CMV IE and E genes in the cell, wherein the expression of products encoded by the CMV IE and CMV E genes decreases the levels of JAK 1 in the cell.