Graph transformation systems have become a general formal modeling language to describe many models in software development process.Behavioral modeling of dynamic systems and model-to-model transformations are only a ...Graph transformation systems have become a general formal modeling language to describe many models in software development process.Behavioral modeling of dynamic systems and model-to-model transformations are only a few examples in which graphs have been used to software development.But even the perfect graph transformation system must be equipped with automated analysis capabilities to let users understand whether such a formal specification fulfills their requirements.In this paper,we present a new solution to verify graph transformation systems using the Bogor model checker.The attributed graph grammars(AGG)-like graph transformation systems are translated to Bandera intermediate representation(BIR),the input language of Bogor,and Bogor verifies the model against some interesting properties defined by combining linear temporal logic(LTL) and special-purpose graph rules.Experimental results are encouraging,showing that in most cases our solution improves existing approaches in terms of both performance and expressiveness.展开更多
Multimodal spatiotemporal data from smart city consumer electronics present critical challenges including cross-modal temporal misalignment,unreliable data quality,limited joint modeling of spatial and temporal depend...Multimodal spatiotemporal data from smart city consumer electronics present critical challenges including cross-modal temporal misalignment,unreliable data quality,limited joint modeling of spatial and temporal dependencies,and weak resilience to adversarial updates.To address these limitations,EdgeST-Fusion is introduced as a cross-modal federated graph transformer framework for context-aware smart city analytics.The architecture integrates cross-modal embedding networks for modality alignment,graph transformer encoders for spatial dependency modeling,temporal self-attention for dynamic pattern learning,and adaptive anomaly detection to ensure data quality and security during aggregation.A privacy-preserving federated learning protocol with differential privacy guarantees enables collaborative model training without centralizing sensitive data.The framework employs data-quality-aware weighted aggregation to enhance robustness against noisy and malicious client updates.Experimental evaluation on the GeoLife,PeMS-Bay,and SmartHome+datasets demonstrates that EdgeST-Fusion achieves 21.8%improvement in prediction accuracy,35.7%reduction in communication overhead,and 29.4%enhancement in security resilience compared to recent baselines.Real-world deployment across three smart city testbeds validates practical viability with 90.0%average accuracy and sub-250 ms inference latency.The proposed framework remains feasible for deployment on heterogeneous and resource-constrained consumer electronics devices whilemaintaining strong privacy guarantees and scalability for large-scale urban environments.展开更多
Industrial fault diagnosis is a critical challenge in complex systems,where sensor data is often noisy and interdependencies between components are difficult to capture.Traditional methods struggle to effectively mode...Industrial fault diagnosis is a critical challenge in complex systems,where sensor data is often noisy and interdependencies between components are difficult to capture.Traditional methods struggle to effectively model these complexities.This paper presents a novel approach by transforming fault diagnosis into a graph recognition task,using sensor data represented as graph-structured data with the k-nearest neighbors(KNN)algorithm.A Graph Transformer is applied to extract node and graph features,with a combined loss function of cross-entropy and weighted consistency loss to stabilize graph representations.Experiments on the TFF dataset show that Graph Transformer combined with consistency loss outperforms conventional methods in fault diagnosis accuracy,offering a promising solution for enhancing fault detection in industrial systems.展开更多
The ability to assess the reliability of safety-critical systems is one of the most crucial requirements in the design of modern safety-critical systems where even a minor failure can result in loss of life or irrepar...The ability to assess the reliability of safety-critical systems is one of the most crucial requirements in the design of modern safety-critical systems where even a minor failure can result in loss of life or irreparable damage to the environment.Model checking is an automatic technique that verifies or refutes system properties by exploring all reachable states(state space)of a model.In large and complex systems,it is probable that the state space explosion problem occurs.In exploring the state space of systems modeled by graph transformations,the rule applied on the current state specifies the rule that can perform on the next state.In other words,the allowed rule on the current state depends only on the applied rule on the previous state,not the ones on earlier states.This fact motivates us to use a Markov chain(MC)to capture this type of dependencies and applies the Estimation of Distribution Algorithm(EDA)to improve the quality of the MC.EDA is an evolutionary algorithm directing the search for the optimal solution by learning and sampling probabilistic models through the best individuals of a population at each generation.To show the effectiveness of the proposed approach,we implement it in GROOVE,an open source toolset for designing and model checking graph transformation systems.Experimental results confirm that the proposed approach has a high speed and accuracy in comparison with the existing meta-heuristic and evolutionary techniques in safety analysis of systems specified formally through graph transformations.展开更多
Computational approaches for predicting drug-target interactions(DTIs)are pivotal in advancing drug discovery.Current methodologies leveraging heterogeneous networks often fall short in fully integrating both local an...Computational approaches for predicting drug-target interactions(DTIs)are pivotal in advancing drug discovery.Current methodologies leveraging heterogeneous networks often fall short in fully integrating both local and global network information.To comprehensively consider network information,we propose DHGT-DTI,a novel deep learning-based approach for DTI prediction.Specifically,we capture the local and global structural information of the network from both neighborhood and meta-path per-spectives.In the neighborhood perspective,we employ a heterogeneous graph neural network(HGNN),which extends Graph Sample and Aggregate(GraphSAGE)to handle diverse node and edge types,effectively learning local network structures.In the meta-path perspective,we introduce a Graph Transformer with residual connections to model higher-order relationships defined by meta-paths,such as"drug-disease-drug",and use an attention mechanism to fuse information across multiple meta-paths.The learned features from these dual perspectives are synergistically integrated for DTI prediction via a matrix decomposition method.Furthermore,DHGT-DTI reconstructs not only the DTI network but also auxiliary networks to bolster prediction accuracy.Comprehensive experiments on two benchmark datasets validate the superiority of DHGT-DTI over existing baseline methods.Additionally,case studies on six drugs used to treat Parkinson's disease not only validate the practical utility of DHGT-DTI but also highlight its broader potential in accelerating drug discovery for other diseases.展开更多
The properties of generalized flip Markov chains on connected regular digraphs are discussed.The 1-Flipper operation on Markov chains for undirected graphs is generalized to that for multi-digraphs.The generalized 1-F...The properties of generalized flip Markov chains on connected regular digraphs are discussed.The 1-Flipper operation on Markov chains for undirected graphs is generalized to that for multi-digraphs.The generalized 1-Flipper operation preserves the regularity and weak connectivity of multi-digraphs.The generalized 1-Flipper operation is proved to be symmetric.Moreover,it is presented that a series of random generalized 1-Flipper operations eventually lead to a uniform probability distribution over all connected d-regular multi-digraphs without loops.展开更多
Graphs are used in various disciplines such as telecommunication,biological networks,as well as social networks.In large-scale networks,it is challenging to detect the communities by learning the distinct properties o...Graphs are used in various disciplines such as telecommunication,biological networks,as well as social networks.In large-scale networks,it is challenging to detect the communities by learning the distinct properties of the graph.As deep learning hasmade contributions in a variety of domains,we try to use deep learning techniques to mine the knowledge from large-scale graph networks.In this paper,we aim to provide a strategy for detecting communities using deep autoencoders and obtain generic neural attention to graphs.The advantages of neural attention are widely seen in the field of NLP and computer vision,which has low computational complexity for large-scale graphs.The contributions of the paper are summarized as follows.Firstly,a transformer is utilized to downsample the first-order proximities of the graph into a latent space,which can result in the structural properties and eventually assist in detecting the communities.Secondly,the fine-tuning task is conducted by tuning variant hyperparameters cautiously,which is applied to multiple social networks(Facebook and Twitch).Furthermore,the objective function(crossentropy)is tuned by L0 regularization.Lastly,the reconstructed model forms communities that present the relationship between the groups.The proposed robust model provides good generalization and is applicable to obtaining not only the community structures in social networks but also the node classification.The proposed graph-transformer shows advanced performance on the social networks with the average NMIs of 0.67±0.04,0.198±0.02,0.228±0.02,and 0.68±0.03 on Wikipedia crocodiles,Github Developers,Twitch England,and Facebook Page-Page networks,respectively.展开更多
The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal verte...The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex x 0. In this paper, several conditions for the characterization of G * are presented.展开更多
Circuits with switched current are described by an admittance matrix and seeking current transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit a...Circuits with switched current are described by an admittance matrix and seeking current transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to carry out an analysis of the whole switched circuit in two-phase switching exclusively by the graph method as well. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphs to reduce Mason graphs for all the four phases of switching, and then plot a summary graph from the transformed graphs obtained this way. First the author draws nodes and possible branches, obtained by transformation graphs for transfers of EE （even-even） and OO （odd-odd） phases. In the next step, branches obtained by transformation graphs for EO and OE phase are drawn between these nodes, while their resulting transfer is 1 multiplied by z^1/2. This summary graph is extended by two branches from input node and to output node, the extended graph can then be interpreted by the Mason＇s relation to provide transparent current transfers. Therefore it is not necessary to compose a sum admittance matrix and to express this consequently in numbers, and so it is possible to reach the final result in a graphical way.展开更多
The enhanced definition of Mechatronics involves the four underlying characteristics of integrated,unified,unique,and systematic approaches.In this realm,Mechatronics is not limited to electro-mechanical systems,in th...The enhanced definition of Mechatronics involves the four underlying characteristics of integrated,unified,unique,and systematic approaches.In this realm,Mechatronics is not limited to electro-mechanical systems,in the multi-physics sense,but involves other physical domains such as fluid and thermal.This paper summarizes the mechatronic approach to modeling.Linear graphs facilitate the development of state-space models of mechatronic systems,through this approach.The use of linear graphs in mechatronic modeling is outlined and an illustrative example of sound system modeling is given.Both time-domain and frequency-domain approaches are presented for the use of linear graphs.A mechatronic model of a multi-physics system may be simplified by converting all the physical domains into an equivalent single-domain system that is entirely in the output domain of the system.This approach of converting(transforming)physical domains is presented.An illustrative example of a pressure-controlled hydraulic actuator system that operates a mechanical load is given.展开更多
Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a central pillar of exact state-of-the-art sol...Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a central pillar of exact state-of-the-art solvers for well-known variants such as the Steiner tree problem in graphs. In this article transformations for both the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to the Steiner arborescence problem are introduced for the first time. Furthermore, the considerable implications for practical solving approaches will be demonstrated, including the computation of strong upper and lower bounds.展开更多
In this paper, we study the long-time behavior of the solution of the initial boundary value problem of the coupled Kirchhoff equations. Based on the relevant assumptions, the equivalent norm on E<sub>k</sub&...In this paper, we study the long-time behavior of the solution of the initial boundary value problem of the coupled Kirchhoff equations. Based on the relevant assumptions, the equivalent norm on E<sub>k</sub> is obtained by using the Hadamard graph transformation method, and the Lipschitz constant l<sub>F</sub><sub> </sub>of F is further estimated. Finally, a family of inertial manifolds satisfying the spectral interval condition is obtained.展开更多
文摘Graph transformation systems have become a general formal modeling language to describe many models in software development process.Behavioral modeling of dynamic systems and model-to-model transformations are only a few examples in which graphs have been used to software development.But even the perfect graph transformation system must be equipped with automated analysis capabilities to let users understand whether such a formal specification fulfills their requirements.In this paper,we present a new solution to verify graph transformation systems using the Bogor model checker.The attributed graph grammars(AGG)-like graph transformation systems are translated to Bandera intermediate representation(BIR),the input language of Bogor,and Bogor verifies the model against some interesting properties defined by combining linear temporal logic(LTL) and special-purpose graph rules.Experimental results are encouraging,showing that in most cases our solution improves existing approaches in terms of both performance and expressiveness.
基金supported by the University of Tabuk,Saudi Arabia。
文摘Multimodal spatiotemporal data from smart city consumer electronics present critical challenges including cross-modal temporal misalignment,unreliable data quality,limited joint modeling of spatial and temporal dependencies,and weak resilience to adversarial updates.To address these limitations,EdgeST-Fusion is introduced as a cross-modal federated graph transformer framework for context-aware smart city analytics.The architecture integrates cross-modal embedding networks for modality alignment,graph transformer encoders for spatial dependency modeling,temporal self-attention for dynamic pattern learning,and adaptive anomaly detection to ensure data quality and security during aggregation.A privacy-preserving federated learning protocol with differential privacy guarantees enables collaborative model training without centralizing sensitive data.The framework employs data-quality-aware weighted aggregation to enhance robustness against noisy and malicious client updates.Experimental evaluation on the GeoLife,PeMS-Bay,and SmartHome+datasets demonstrates that EdgeST-Fusion achieves 21.8%improvement in prediction accuracy,35.7%reduction in communication overhead,and 29.4%enhancement in security resilience compared to recent baselines.Real-world deployment across three smart city testbeds validates practical viability with 90.0%average accuracy and sub-250 ms inference latency.The proposed framework remains feasible for deployment on heterogeneous and resource-constrained consumer electronics devices whilemaintaining strong privacy guarantees and scalability for large-scale urban environments.
基金supported by the National Natural Science Foundation of China under Grants Nos.62573292,62206199 and 62476192National Key Laboratory of Marine Engine Science and Technology under Grant No.LAB-2024-04-WD+2 种基金Young Elite Scientist Sponsorship Program under Grant No.YESS20220409the Hainan Province Science and Technology Special Fund under Grant No.ZDYF2024GXJS003the Natural Science Foundation of Tianjin under Grant No.23JCQNJC02010.
文摘Industrial fault diagnosis is a critical challenge in complex systems,where sensor data is often noisy and interdependencies between components are difficult to capture.Traditional methods struggle to effectively model these complexities.This paper presents a novel approach by transforming fault diagnosis into a graph recognition task,using sensor data represented as graph-structured data with the k-nearest neighbors(KNN)algorithm.A Graph Transformer is applied to extract node and graph features,with a combined loss function of cross-entropy and weighted consistency loss to stabilize graph representations.Experiments on the TFF dataset show that Graph Transformer combined with consistency loss outperforms conventional methods in fault diagnosis accuracy,offering a promising solution for enhancing fault detection in industrial systems.
文摘The ability to assess the reliability of safety-critical systems is one of the most crucial requirements in the design of modern safety-critical systems where even a minor failure can result in loss of life or irreparable damage to the environment.Model checking is an automatic technique that verifies or refutes system properties by exploring all reachable states(state space)of a model.In large and complex systems,it is probable that the state space explosion problem occurs.In exploring the state space of systems modeled by graph transformations,the rule applied on the current state specifies the rule that can perform on the next state.In other words,the allowed rule on the current state depends only on the applied rule on the previous state,not the ones on earlier states.This fact motivates us to use a Markov chain(MC)to capture this type of dependencies and applies the Estimation of Distribution Algorithm(EDA)to improve the quality of the MC.EDA is an evolutionary algorithm directing the search for the optimal solution by learning and sampling probabilistic models through the best individuals of a population at each generation.To show the effectiveness of the proposed approach,we implement it in GROOVE,an open source toolset for designing and model checking graph transformation systems.Experimental results confirm that the proposed approach has a high speed and accuracy in comparison with the existing meta-heuristic and evolutionary techniques in safety analysis of systems specified formally through graph transformations.
基金the National Natural Science Foundation of China(Grant Nos.:62272288,U22A2041)Fundamental Research Funds for the Central Universities,Shaanxi Normal University(Grant No.:GK202302006)the Scientific Research Fund of Hunan Provincial Education Department of China(Grant No.:22B0097).
文摘Computational approaches for predicting drug-target interactions(DTIs)are pivotal in advancing drug discovery.Current methodologies leveraging heterogeneous networks often fall short in fully integrating both local and global network information.To comprehensively consider network information,we propose DHGT-DTI,a novel deep learning-based approach for DTI prediction.Specifically,we capture the local and global structural information of the network from both neighborhood and meta-path per-spectives.In the neighborhood perspective,we employ a heterogeneous graph neural network(HGNN),which extends Graph Sample and Aggregate(GraphSAGE)to handle diverse node and edge types,effectively learning local network structures.In the meta-path perspective,we introduce a Graph Transformer with residual connections to model higher-order relationships defined by meta-paths,such as"drug-disease-drug",and use an attention mechanism to fuse information across multiple meta-paths.The learned features from these dual perspectives are synergistically integrated for DTI prediction via a matrix decomposition method.Furthermore,DHGT-DTI reconstructs not only the DTI network but also auxiliary networks to bolster prediction accuracy.Comprehensive experiments on two benchmark datasets validate the superiority of DHGT-DTI over existing baseline methods.Additionally,case studies on six drugs used to treat Parkinson's disease not only validate the practical utility of DHGT-DTI but also highlight its broader potential in accelerating drug discovery for other diseases.
基金National Natural Science Foundation of China(No.11671258)。
文摘The properties of generalized flip Markov chains on connected regular digraphs are discussed.The 1-Flipper operation on Markov chains for undirected graphs is generalized to that for multi-digraphs.The generalized 1-Flipper operation preserves the regularity and weak connectivity of multi-digraphs.The generalized 1-Flipper operation is proved to be symmetric.Moreover,it is presented that a series of random generalized 1-Flipper operations eventually lead to a uniform probability distribution over all connected d-regular multi-digraphs without loops.
基金The research is funded by the Researchers Supporting Project at King Saud University(Project#RSP-2021/305).
文摘Graphs are used in various disciplines such as telecommunication,biological networks,as well as social networks.In large-scale networks,it is challenging to detect the communities by learning the distinct properties of the graph.As deep learning hasmade contributions in a variety of domains,we try to use deep learning techniques to mine the knowledge from large-scale graph networks.In this paper,we aim to provide a strategy for detecting communities using deep autoencoders and obtain generic neural attention to graphs.The advantages of neural attention are widely seen in the field of NLP and computer vision,which has low computational complexity for large-scale graphs.The contributions of the paper are summarized as follows.Firstly,a transformer is utilized to downsample the first-order proximities of the graph into a latent space,which can result in the structural properties and eventually assist in detecting the communities.Secondly,the fine-tuning task is conducted by tuning variant hyperparameters cautiously,which is applied to multiple social networks(Facebook and Twitch).Furthermore,the objective function(crossentropy)is tuned by L0 regularization.Lastly,the reconstructed model forms communities that present the relationship between the groups.The proposed robust model provides good generalization and is applicable to obtaining not only the community structures in social networks but also the node classification.The proposed graph-transformer shows advanced performance on the social networks with the average NMIs of 0.67±0.04,0.198±0.02,0.228±0.02,and 0.68±0.03 on Wikipedia crocodiles,Github Developers,Twitch England,and Facebook Page-Page networks,respectively.
基金Project supported by the National Natural Science Foundation of China!(19771075)
文摘The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex x 0. In this paper, several conditions for the characterization of G * are presented.
文摘Circuits with switched current are described by an admittance matrix and seeking current transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to carry out an analysis of the whole switched circuit in two-phase switching exclusively by the graph method as well. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphs to reduce Mason graphs for all the four phases of switching, and then plot a summary graph from the transformed graphs obtained this way. First the author draws nodes and possible branches, obtained by transformation graphs for transfers of EE （even-even） and OO （odd-odd） phases. In the next step, branches obtained by transformation graphs for EO and OE phase are drawn between these nodes, while their resulting transfer is 1 multiplied by z^1/2. This summary graph is extended by two branches from input node and to output node, the extended graph can then be interpreted by the Mason＇s relation to provide transparent current transfers. Therefore it is not necessary to compose a sum admittance matrix and to express this consequently in numbers, and so it is possible to reach the final result in a graphical way.
基金supported by research grants from the Natural Sciences and Engineering Research Council(NSERC)of Canada
文摘The enhanced definition of Mechatronics involves the four underlying characteristics of integrated,unified,unique,and systematic approaches.In this realm,Mechatronics is not limited to electro-mechanical systems,in the multi-physics sense,but involves other physical domains such as fluid and thermal.This paper summarizes the mechatronic approach to modeling.Linear graphs facilitate the development of state-space models of mechatronic systems,through this approach.The use of linear graphs in mechatronic modeling is outlined and an illustrative example of sound system modeling is given.Both time-domain and frequency-domain approaches are presented for the use of linear graphs.A mechatronic model of a multi-physics system may be simplified by converting all the physical domains into an equivalent single-domain system that is entirely in the output domain of the system.This approach of converting(transforming)physical domains is presented.An illustrative example of a pressure-controlled hydraulic actuator system that operates a mechanical load is given.
文摘Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a central pillar of exact state-of-the-art solvers for well-known variants such as the Steiner tree problem in graphs. In this article transformations for both the prize-collecting Steiner tree problem and the maximum-weight connected subgraph problem to the Steiner arborescence problem are introduced for the first time. Furthermore, the considerable implications for practical solving approaches will be demonstrated, including the computation of strong upper and lower bounds.
文摘In this paper, we study the long-time behavior of the solution of the initial boundary value problem of the coupled Kirchhoff equations. Based on the relevant assumptions, the equivalent norm on E<sub>k</sub> is obtained by using the Hadamard graph transformation method, and the Lipschitz constant l<sub>F</sub><sub> </sub>of F is further estimated. Finally, a family of inertial manifolds satisfying the spectral interval condition is obtained.
