Author details
Author's Published Works
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Author details
Showing 1-25 of 28 results
- Sort
Filter Results
Show
Sort By
Results
Leveraging Pixel Difference Feature for Deepfake Detection
IEEE Transactions on Emerging Topics in Computational Intelligence
Year: 2025 | Early Access Article |
The rise of Deepfake technology poses a formidable threat to the credibility of both judicial evidence and intellectual property safeguards. Current methods lack the ability to integrate the texture information of facial features into CNNs, despite the fact that fake contents are subtle and pixel-level. Due to the fixed grid kernel structure, CNNs are limited in their ability to describe detailed ...Show More
Graph Multi-Convolution and Attention Pooling for Graph Classification
Many studies have achieved excellent performance in analyzing graph-structured data. However, learning graph-level representations for graph classification is still a challenging task. Existing graph classification methods usually pay less attention to the fusion of node features and ignore the effects of different-hop neighborhoods on nodes in the graph convolution process. Moreover, they discard...Show More
In federated learning (FL), multiple parties collaborate to train a global model by aggregating their local models while keeping private training sets isolated. One problem hindering effective model aggregation is data heterogeneity. Federated ensemble distillation tackles this problem by using fused local-model knowledge to train the global model rather than directly averaging model parameters. H...Show More
Data-Free Knowledge Filtering and Distillation in Federated Learning
Year: 2024 | Early Access Article |
Adaptive Knowledge Recomposition for Personalized Federated Learning via Discrete Wavelet Transform
Heterogeneous data silos hinder the application of deep learning in the Internet of Things. As a dealing scheme, personalized federated learning (pFL) distributedly customizes multiple local models for these silos. Most pFL methods directly use a global model to assist the local model optimization ignoring the performance drop caused by irrelevant or misleading global-model knowledge. To address t...Show More
DRL-Based VNF Cooperative Scheduling Framework With Priority-Weighted Delay
Effective Service Function Chains (SFCs) mapping and Virtual Network Functions (VNFs) scheduling are crucial to ensure high-quality service provision for Internet of Things (IoT) tasks. Meeting the varying demands of multiple SFCs poses a significant challenge, particularly when working with the limited resources available in edge computing networks. Most existing working focuses on uniformly mapp...Show More
Graph Convolutional Networks With Adaptive Neighborhood Awareness
Mingjian Guang;Chungang Yan;Yuhua Xu;Junli Wang;Changjun Jiang
Graph convolutional networks (GCNs) can quickly and accurately learn graph representations and have shown powerful performance in many graph learning domains. Despite their effectiveness, neighborhood awareness remains essential and challenging for GCNs. Existing methods usually perform neighborhood-aware steps only from the node or hop level, which leads to a lack of capability to learn the neigh...Show More
The Probabilistic Liveness Decision Method of Unbounded Petri Nets Based on Machine Learning
The liveness of Petri nets (PNs) means that every event can occur in any state, establishing a close relationship with the deadlock-free property of existing systems. Due to the problem of state space explosion and the infinite state space of unbounded PNs (UPNs), the time complexity and space complexity of the liveness decision are difficult to give accurate measures; at least, they are both NP-h...Show More
PHAED: A Speaker-Aware Parallel Hierarchical Attentive Encoder-Decoder Model for Multi-Turn Dialogue Generation
This article presents a novel open-domain dialogue generation model emphasizing the differentiation of speakers in multi-turn conversations. Differing from prior work that treats the conversation history as a long text, we argue that capturing relative social relations among utterances (i.e., generated by either the same speaker or different persons) benefits the machine capturing fine-grained con...Show More
Stable QoE-Aware Multi-SFCs Cooperative Routing Mechanism Based on Deep Reinforcement Learning
The explosive development of the Internet of Things (IOT) has stimulated the sudden and dynamic demand pattern of potential Service Function Chain (SFC) traffic. The virtual network built based on the requirements of Multiple SFCs (Multi-SFCs), sharing the resource, should provide better Quality of Experience (QoE) for Multi-SFCs according to the real-time network status. However, simultaneous Mul...Show More
Probabilistic Reachability Prediction of Unbounded Petri Nets: A Machine Learning Method
Hongda Qi;Mingjian Guang;Junli Wang;Chungang Yan;Changjun Jiang
Unbounded Petri nets (UPNs) can describe and analyze discrete event systems with infinite states (DESIS). Due to the infinite state space and the combination explosion problem, the reachability analysis of UPNs is an NP-Hard problem. The existing reachability analysis methods cannot achieve an accurate result at reasonable costs (computational time and space) due to the finite reachability tree wi...Show More
A Multichannel Convolutional Decoding Network for Graph Classification
Mingjian Guang;Chungang Yan;Yuhua Xu;Junli Wang;Changjun Jiang
Graph convolutional networks (GCNs) have shown superior performance on graph classification tasks, and their structure can be considered as an encoder-decoder pair. However, most existing methods lack the comprehensive consideration of global and local in decoding, resulting in the loss of global information or ignoring some local information of large graphs. And the commonly used cross-entropy lo...Show More
An Energy-efficient Traffic Scheduling Method based on Slime Mould Algorithm for SDN
2023 6th International Conference on Information Systems and Computer Networks (ISCON)
Year: 2023 | Conference Paper |
Cited by: Papers (1)
Software defined network (SDN) enables efficient and green traffic management by separating the control and data planes. However, the existing itemized scheduling approach is prone to waste of network resources and energy consumption due to the different sensitivity of traffic to time delay. To address these problems, we design a Slime Mould Algorithm based Energy-efficient Traffic Scheduling Meth...Show More
Multistructure Graph Classification Method With Attention-Based Pooling
Yuhua Xu;Junli Wang;Mingjian Guang;Chungang Yan;Changjun Jiang
Graph neural networks (GNNs) have achieved effective performance in many graph-related tasks involving recommendation systems, social networks, and bioinformatics. Recent studies have proposed several graph pooling operators to obtain graph-level representations from node representations. Nevertheless, they usually adopt a single strategy to evaluate the importance of nodes, which may generate nod...Show More
With the expansion of network scale, traditional routing strategies in Software-Defined Networking (SDN) have difficulty adapting to fast traffic variability. The large flow in the network occupies 80% of the network traffic. An unreasonable schedule of the large flow will lead to the emergence of bottleneck links and reduce the network performance. To solve the above problems, this paper proposes...Show More
Traffic matrix is the main research object of traffic prediction in software-defined networking. Accurate and timely traffic matrix prediction plays an important role in avoiding network congestion. While various methods have been proposed in previous studies to solve the SDN traffic prediction problem, few of them consider both inter- and intra-flow features. In this paper, we propose a dual-stag...Show More
LAMPT: LAbel Mask-Predicted Transformer for Extreme Multi-label Text Classification
2022 IEEE International Conference on Big Data (Big Data)
Year: 2022 | Conference Paper |
Extreme Multi-label text Classification ( XMC) is a task of recalling the most relevant labels for each given text from an extremely large-scale label set. It is emphasized that XMC is a more complex classification task because there are two main problems: large space of labels and the labels in XMC tasks tend to be correlated. Existing methods attempt to model label correlations by viewing the XM...Show More
GNN-EA: Graph Neural Network with Evolutionary Algorithm
2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
Year: 2022 | Conference Paper |
Cited by: Papers (1)
Recently, Graph Neural Networks (GNNs) have shown great promise in addressing various tasks with non-Euclidean data. Encouraged by the successful application on discovering convolutional and recurrent neural networks, Neural Architecture Search (NAS) is extended to alleviate the complexity of designing appropriate task-specific GNNs. Unfortunately, existing graph NAS methods are usually susceptibl...Show More
Word Order is Considerable: Contextual Position-aware Graph Neural Network for Text Classification
2022 International Joint Conference on Neural Networks (IJCNN)
Year: 2022 | Conference Paper |
Cited by: Papers (2)
Text Classification is a crucial and classical research branch in Natural Language Processing. Recently, Graph Neural Networks (GNNs) have been explored for this task since GNNs are proficient in handling non-Euclidean data with more complex relations. Despite the success, these graph-based methods have some limitations to model the word order information in the document. In this paper, to address...Show More
Net Learning
Junli Wang;Hongda Qi;Mingjian Guang;Chaobo Zhang;Chungang Yan;Changjun Jiang
Graph neural networks, which generalize deep learning to graph-structured data, have achieved significant improvements in numerous graph-related tasks. Petri nets (PNs), on the other hand, are mainly used for the modeling and analysis of various event-driven systems from the perspective of prior knowledge, mechanisms, and tasks. Compared with graph data, net data can simulate the dynamic behaviora...Show More
Multi-View Metrics Enhanced Heterogeneous Graph Neural Network for Extractive Summarization
Chaobo Zhang;Junli Wang;Hongda Qi;Chungang Yan;Changjun Jiang
2021 China Automation Congress (CAC)
Year: 2021 | Conference Paper |
Currently, many works regarded extractive summarization as a binary classification problem. However, the metric of the summary classification is always too singular and cannot fully utilize sentence features. To address this issue, we propose a multi-view metrics enhanced heterogeneous graph neural network for extractive summarization (MHGS). Firstly, the text is modeled as a heterogeneous graph, ...Show More
Benchmark Datasets for Stochastic Petri Net Learning
Mingjian Guang;Chungang Yan;Junli Wang;Hongda Qi;Changjun Jiang
2021 International Joint Conference on Neural Networks (IJCNN)
Year: 2021 | Conference Paper |
Cited by: Papers (9)
The existing Stochastic Petri Net (SPN) analysis methods are based on a series of steps, including generating the reachable graph, solving the state equation, etc. Unfortunately, these methods cannot perform performance analysis when the state equation has no unique solution. The end-to-end deep learning methods can build a mapping relationship from SPN to performance indicators, which avoids solv...Show More
Recently, deep learning has become a mainstream method of image inpainting. It can not only restore the image texture, obtain high-level abstract features of images, but also restore semantic images such as human face images. Among these methods, generative adversarial networks (GANs) using autoencoder as the generator have become the promising model for image inpainting. These models implement th...Show More
The Generative Adversarial Networks (GAN) has been successfully applied to the generation of text content such as poetry and speech, and it is a hot topic in the field of text generation. However, GAN has been facing the problem of training and convergence. For the generation model, this paper redefines on the loss function. The truth-guided method has been added to make the generated text closer ...Show More
Optimal Web Service Selection based on Multi-Objective Genetic Algorithm
2008 International Symposium on Computational Intelligence and Design
Year: 2008 | Conference Paper |
Cited by: Papers (25)
Considering that there are three aspects of constrains in the service selection process, such as control structure within a composition plan, relationship between concrete services, and tradeoff among multiple QoS indexes, a QoS based optimal Web services selection method by multi-objective genetic algorithm is presented. First we design a chromosome coding method to represent a feasible service s...Show More
AI Planning for Web Service Automatic Composition Using Petri Nets
2007 11th International Conference on Computer Supported Cooperative Work in Design
Year: 2007 | Conference Paper |
Cited by: Papers (4)
This paper presents an AI planning method for Web service automatic composition using Predicate/Transition (Pr/T) net model. First, based on Web service description of inputs, outputs, preconditions and effects in OWL-S specification, a Pr/T net model is constructed for a service composition plan. Then, this plan is effectively solved by a reachability algorithm of the Pr/T net and a corresponding...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.