Query：
学者姓名：董晨
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
Due to the complexity of integrated circuit design and manufacturing process, an increasing number of third parties are outsourcing their untrusted intellectual property (IP) cores to pursue greater economic benefits, which may embed numerous security issues. The covert nature of hardware Trojans (HTs) poses a significant threat to cyberspace, and they may lead to catastrophic consequences for the national economy and personal privacy. To deal with HTs well, it is not enough to just detect whether they are included, like the existing studies. Same as malware, identifying the attack intentions of HTs, that is, analyzing the functions they implement, is of great scientific significance for the prevention and control of HTs. Based on the fined detection, for the first time, this article proposes a two-stage Graph Neural Network model for HTs' multifunctional classification, GNN4HT. In the first stage, GNN4HT localizes HTs, achieving a notable true positive rate (TPR) of 94.28% on the Trust-Hub dataset and maintaining high performance on the TRTC-IC dataset. GNN4HT further transforms the localization results into HT information graphs (HTIGs), representing the functional interaction graphs of HTs. In the second stage, the dataset is augmented through logical equivalence for training and HT functionalities are classified based on the extracted HTIG from the first stage. For the multifunctional classification of HTs, the correct classification rate reached as high as 80.95% at gate-level and 62.96% at register transfer level. This article marks a breakthrough in HT detection, and it is the first to address the multifunctional classification issue, holding significant practical importance and application prospects.
Keyword ：
Gate level Gate level golden free golden free Hardware Hardware hardware Trojan (HT) hardware Trojan (HT) HT information graph (HTIG) HT information graph (HTIG) HT location HT location HT multifunctional classification HT multifunctional classification Integrated circuit modeling Integrated circuit modeling Location awareness Location awareness Logic gates Logic gates register transfer level (RTL) register transfer level (RTL) Security Security Training Training Trojan horses Trojan horses
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Lihan , Dong, Chen , Wu, Qiaowen et al. GNN4HT: A Two-Stage GNN-Based Approach for Hardware Trojan Multifunctional Classification [J]. | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS , 2025 , 44 (1) : 172-185 . |
| MLA | Chen, Lihan et al. "GNN4HT: A Two-Stage GNN-Based Approach for Hardware Trojan Multifunctional Classification" . | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 44 . 1 (2025) : 172-185 . |
| APA | Chen, Lihan , Dong, Chen , Wu, Qiaowen , Liu, Ximeng , Guo, Xiaodong , Chen, Zhenyi et al. GNN4HT: A Two-Stage GNN-Based Approach for Hardware Trojan Multifunctional Classification . | IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS , 2025 , 44 (1) , 172-185 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The objective of dialogue state tracking (DST) is to dynamically track information within dialogue states by populating predefined state slots, which enhances the comprehension capabilities of task-oriented dialogue systems in processing user requests. Recently, there has been a growing popularity in using graph neural networks to model the relationships between slots and slots as well as between dialogue and slots. However, these models overlook the relationships between words and phrases in the current turn dialogue and dialogue history. Specific syntactic dependencies (e.g., the object of a preposition) and constituents (e.g., noun phrases) have a higher probability of being the slot values that need to be retrieved at current moment. Neglecting these syntactic dependency and constituent information may cause the loss of potential candidate slot values, thereby limiting the overall performance of DST models. To address this issue, we propose a Hierarchical Fine-grained State Aware Graph Attention Network for Dialogue State Tracking (HFSG-DST). HFSG-DST exploits the syntactic dependency and constituent tree information, such as phrase segmentation and hierarchical structure in dialogue utterances, to construct a relational graph between entities. It then employs a hierarchical graph attention network to facilitate the extraction of fine-grained candidate dialogue state information. Additionally, HFSG-DST designs a Schema-enhanced Dialogue History Selector to select the most relevant turn of dialogue history for current turn and incorporates schema description information for dialogue state tracking. Consequently, HFSG-DST is capable of constructing the dependency tree and constituent tree on noise-free utterances. Experimental results on two public benchmark datasets demonstrate that HFSG-DST outperforms other state-of-the-art models.
Keyword ：
Dialogue state tracking Dialogue state tracking Hierarchical graph attention network Hierarchical graph attention network Schema enhancement Schema enhancement Syntactic information Syntactic information
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liao, Hongmiao , Chen, Yuzhong , Chen, Deming et al. Hierarchical fine-grained state-aware graph attention network for dialogue state tracking [J]. | JOURNAL OF SUPERCOMPUTING , 2025 , 81 (5) . |
| MLA | Liao, Hongmiao et al. "Hierarchical fine-grained state-aware graph attention network for dialogue state tracking" . | JOURNAL OF SUPERCOMPUTING 81 . 5 (2025) . |
| APA | Liao, Hongmiao , Chen, Yuzhong , Chen, Deming , Xu, Junjie , Zhong, Jiayuan , Dong, Chen . Hierarchical fine-grained state-aware graph attention network for dialogue state tracking . | JOURNAL OF SUPERCOMPUTING , 2025 , 81 (5) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Aspect-level multimodal sentiment analysis aims to ascertain the sentiment polarity of a given aspect from a text review and its accompanying image. Despite substantial progress made by existing research, aspect-level multimodal sentiment analysis still faces several challenges: (1) Inconsistency in feature granularity between the text and image modalities poses difficulties in capturing corresponding visual representations of aspect words. This inconsistency may introduce irrelevant or redundant information, thereby causing noise and interference in sentiment analysis. (2) Traditional aspect-level sentiment analysis predominantly relies on the fusion of semantic and syntactic information to determine the sentiment polarity of a given aspect. However, introducing image modality necessitates addressing the semantic gap in jointly understanding sentiment features in different modalities. To address these challenges, a multi-granularity visual-textual feature fusion model (MG-VTFM) is proposed to enable deep sentiment interactions among semantic, syntactic, and image information. First, the model introduces a multi-granularity hierarchical graph attention network that controls the granularity of semantic units interacting with images through constituent tree. This network extracts image sentiment information relevant to the specific granularity, reduces noise from images and ensures sentiment relevance in single-granularity cross-modal interactions. Building upon this, a multilayered graph attention module is employed to accomplish multi-granularity sentiment fusion, ranging from fine to coarse. Furthermore, a progressive multimodal attention fusion mechanism is introduced to maximize the extraction of abstract sentiment information from images. Lastly, a mapping mechanism is proposed to align cross-modal information based on aspect words, unifying semantic spaces across different modalities. Our model demonstrates excellent overall performance on two datasets.
Keyword ：
Aspect-level sentiment analysis Aspect-level sentiment analysis Constituent tree Constituent tree Multi-granularity Multi-granularity Multimodal data Multimodal data Visual-textual feature fusion Visual-textual feature fusion
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Yuzhong , Shi, Liyuan , Lin, Jiali et al. Multi-granularity visual-textual jointly modeling for aspect-level multimodal sentiment analysis [J]. | JOURNAL OF SUPERCOMPUTING , 2025 , 81 (1) . |
| MLA | Chen, Yuzhong et al. "Multi-granularity visual-textual jointly modeling for aspect-level multimodal sentiment analysis" . | JOURNAL OF SUPERCOMPUTING 81 . 1 (2025) . |
| APA | Chen, Yuzhong , Shi, Liyuan , Lin, Jiali , Chen, Jingtian , Zhong, Jiayuan , Dong, Chen . Multi-granularity visual-textual jointly modeling for aspect-level multimodal sentiment analysis . | JOURNAL OF SUPERCOMPUTING , 2025 , 81 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Biological assays around "lab-on-a-chip (LoC)" are required in multiple concentration (or dilution) factors, satisfying specific sample concentrations. Unfortunately, most of them suffer from non-locality and are non-protectable, requiring a large footprint and high purchase cost. A digital geometric technique can generate arbitrary gradient profiles for digital microfluidic biochips (DMFBs). A next- generation DMFB has been proposed based on the microelectrode-dot-array (MEDA) architectures are shown to produce and disperse droplets by channel dispensing and lamination mixing. Prior work in this area must address the problem of reactant and waste minimization and concurrent sample preparation for multiple target concentrations. This paper proposes the first splitting-droplet sharing algorithm for reactant and waste minimization of multiple target concentrations on MEDAs. The proposed algorithm not only minimizes the consumption of reagents but also reduces the number of waste droplets by preparing the target concentrations concurrently. Experimental results on a sequence of exponential gradients are presented in support of the proposed method and demonstrate its effectiveness and efficiency. Compared to prior work, the proposed algorithm can achieve up to a 24.8% reduction in sample usage and reach an average of 50% reduction in waste droplets.
Keyword ：
Biochip Biochip Dilution Dilution Microelectrode-dot-array (MEDA) Microelectrode-dot-array (MEDA) Mixing tree Mixing tree Reactant minimization Reactant minimization Sample preparation Sample preparation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Dong, Chen , Chen, Xiao , Chen, Zhenyi . Reactant and Waste Minimization during Sample Preparation on Micro-Electrode-Dot-Array Digital Microfluidic Biochips using Splitting Trees [J]. | JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS , 2024 , 40 (1) : 87-99 . |
| MLA | Dong, Chen et al. "Reactant and Waste Minimization during Sample Preparation on Micro-Electrode-Dot-Array Digital Microfluidic Biochips using Splitting Trees" . | JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 40 . 1 (2024) : 87-99 . |
| APA | Dong, Chen , Chen, Xiao , Chen, Zhenyi . Reactant and Waste Minimization during Sample Preparation on Micro-Electrode-Dot-Array Digital Microfluidic Biochips using Splitting Trees . | JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS , 2024 , 40 (1) , 87-99 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
With the development of technology, robots are gradually being used more and more widely in various fields. Industrial robots need to perform path planning in the course of their tasks, but there is still a lack of a simple and effective method to implement path planning in complex industrial scenarios. In this paper, an improved whale optimization algorithm is proposed to solve the robot path planning problem. The algorithm initially uses a logistic chaotic mapping approach for population initialization to enhance the initial population diversity, and proposes a jumping mechanism to help the population jump out of the local optimum and enhance the global search capability of the population. The proposed algorithm is tested on 12 complex test functions and the experimental results show that the improved algorithm achieves the best results in several test functions. The algorithm is then applied to a path planning problem and the results show that the algorithm can help the robot to perform correct and efficient path planning. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Keyword ：
Industrial robots Industrial robots Mapping Mapping Motion planning Motion planning Optimization Optimization Robot programming Robot programming
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Huang, Peixin , Dong, Chen , Chen, Zhenyi et al. An Industrial Robot Path Planning Method Based on Improved Whale Optimization Algorithm [C] . 2024 : 209-222 . |
| MLA | Huang, Peixin et al. "An Industrial Robot Path Planning Method Based on Improved Whale Optimization Algorithm" . (2024) : 209-222 . |
| APA | Huang, Peixin , Dong, Chen , Chen, Zhenyi , Zhen, Zihang , Jiang, Lei . An Industrial Robot Path Planning Method Based on Improved Whale Optimization Algorithm . (2024) : 209-222 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Addressing privacy concerns and the evolving nature of user preferences, it is crucial to explore collaborative training methods for federated recommendation models that match the performance of centralized models while preserving user privacy. Existing federated recommendation models primarily rely on static relational data, overlooking the temporal patterns that dynamically evolve over time. In domains like travel recommendations, factors such as the availability of attractions, introduction of new activities, and media coverage constantly change, influencing user preferences. To tackle these challenges, we propose a novel approach called FedNTF. It leverages an LSTM encoder to capture multidimensional temporal interactions within relational data. By incorporating tensor factorization and multilayer perceptrons, we project users and items into a latent space with time encoding, enabling the learning of nonlinear relationships among diverse latent factors. This approach not only addresses the privacy concerns by preserving the confidentiality of user data but also enables the modeling of temporal dynamics to enhance the accuracy and relevance of recommendations over time. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.
Keyword ：
Factorization Factorization Learning systems Learning systems Long short-term memory Long short-term memory Recommender systems Recommender systems Signal encoding Signal encoding Tensors Tensors User profile User profile
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ye, Jingzhou , Lin, Hui , Wang, Xiaoding et al. Efficient and Reliable Federated Recommendation System in Temporal Scenarios [C] . 2024 : 97-107 . |
| MLA | Ye, Jingzhou et al. "Efficient and Reliable Federated Recommendation System in Temporal Scenarios" . (2024) : 97-107 . |
| APA | Ye, Jingzhou , Lin, Hui , Wang, Xiaoding , Dong, Chen , Liu, Jianmin . Efficient and Reliable Federated Recommendation System in Temporal Scenarios . (2024) : 97-107 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Active learning (AL) tries to maximize the model's performance when the labeled data set is limited, and the annotation cost is high. Although it can be efficiently implemented in deep neural networks (DNNs), it is questionable whether the model can maintain the ability to generalize well when there are significant distributional deviations between the labeled and unlabeled data sets. In this article, we consider introducing adversarial training and adversarial samples into AL to mitigate the problem of degraded generalization performance due to different data distributions. In particular, our proposed adversarial training AL (ATAL) has two advantages, one is that adversarial training by different networks enables the network to have better prediction performance and robustness with limited labeled samples. The other is that the adversarial samples generated by the adversarial training can effectively expand the labeled data set so that the designed query function can efficiently select the most informative unlabeled samples based on the expanded labeled data set. Extensive experiments have been performed to verify the feasibility and efficiency of our proposed method, i.e., CIFAR-10 demonstrates the effectiveness of our method-new state-of-the-art robustness and accuracy are achieved.
Keyword ：
Active learning (AL) Active learning (AL) adversarial learning adversarial learning adversarial samples adversarial samples Bayes methods Bayes methods data distribution data distribution Data models Data models Generative adversarial networks Generative adversarial networks Labeling Labeling robustness robustness Robustness Robustness Training Training Uncertainty Uncertainty
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Xuanwei , Liu, Ximeng , Chen, Bijia et al. ATAL: Active Learning Using Adversarial Training for Data Augmentation [J]. | IEEE INTERNET OF THINGS JOURNAL , 2024 , 11 (3) : 4787-4800 . |
| MLA | Lin, Xuanwei et al. "ATAL: Active Learning Using Adversarial Training for Data Augmentation" . | IEEE INTERNET OF THINGS JOURNAL 11 . 3 (2024) : 4787-4800 . |
| APA | Lin, Xuanwei , Liu, Ximeng , Chen, Bijia , Wang, Yuyang , Dong, Chen , Hu, Pengzhen . ATAL: Active Learning Using Adversarial Training for Data Augmentation . | IEEE INTERNET OF THINGS JOURNAL , 2024 , 11 (3) , 4787-4800 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The recommendation system aims to recommend items to users by capturing their personalized interests. Traditional recommendation systems typically focus on modeling target behaviors between users and items. However, in practical application scenarios, various types of behaviors (e.g., click, favorite, purchase, etc.) occur between users and items. Despite recent efforts in modeling various behavior types, multi-behavior recommendation still faces two significant challenges. The first challenge is how to comprehensively capture the complex relationships between various types of behaviors, including their interest differences and interest commonalities. The second challenge is how to solve the sparsity of target behaviors while ensuring the authenticity of information from various types of behaviors. To address these issues, a multi-behavior recommendation framework based on Multi-View Multi-Behavior Interest Learning Network and Contrastive Learning (MMNCL) is proposed. This framework includes a multi-view multi-behavior interest learning module that consists of two submodules: the behavior difference aware submodule, which captures intra-behavior interests for each behavior type and the correlations between various types of behaviors, and the behavior commonality aware submodule, which captures the information of interest commonalities between various types of behaviors. Additionally, a multi-view contrastive learning module is proposed to conduct node self- discrimination, ensuring the authenticity of information integration among various types of behaviors, and facilitating an effective fusion of interest differences and interest commonalities. Experimental results on three real-world benchmark datasets demonstrate the effectiveness of MMNCL and its advantages over other state-of-the-art recommendation models. Our code is available at https://github.com/sujieyang/MMNCL.
Keyword ：
Contrastive learning Contrastive learning Interest learning network Interest learning network Meta learning Meta learning Multi-behavior recommendation Multi-behavior recommendation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Su, Jieyang , Chen, Yuzhong , Lin, Xiuqiang et al. Multi-view multi-behavior interest learning network and contrastive learning for multi-behavior recommendation [J]. | KNOWLEDGE-BASED SYSTEMS , 2024 , 305 . |
| MLA | Su, Jieyang et al. "Multi-view multi-behavior interest learning network and contrastive learning for multi-behavior recommendation" . | KNOWLEDGE-BASED SYSTEMS 305 (2024) . |
| APA | Su, Jieyang , Chen, Yuzhong , Lin, Xiuqiang , Zhong, Jiayuan , Dong, Chen . Multi-view multi-behavior interest learning network and contrastive learning for multi-behavior recommendation . | KNOWLEDGE-BASED SYSTEMS , 2024 , 305 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
With each advancement in internet technology, new security challenges arise. The prevalence of malicious programs continues to increase, which makes it crucial to detect and address them effectively. Many researchers focus on solving different datasets by using deep learning methods and make significant progress. However, these strategies must be continuously improved to adapt to the latest data. In this paper, an improved model based on CNN-LSTM is proposed to detect and classify malware programs, named malDetect I. At the same time, the Transformer Encoder module is also modified based on model Bert to adapt to the classification task. Lastly, two models are compared with prediction results on evaluation indicators. The data used in this paper is the Windows API sequence extracted after dynamic operation. The text processing methods are also suitable for processing sequence data. The experiment uses Word2Vec and two different learning rate strategies, and the improved model accuracy is 9.83% higher than the original CNN-LSTM model. The model integrated the BiLSTM model with the Self-Attention mechanism, named malDetect II, is 11.46% higher than the basic model CNN-LSTM and 2.82% higher than the Transformer Encoder classification model. © 2024 IEEE.
Keyword ：
Data handling Data handling Deep learning Deep learning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Jingjing , Lin, Jingsong , Lyu, Chenxi et al. MalDetect: Malware Classification Using API Sequence and Comparison with Transformer Encoder [C] . 2024 : 133-140 . |
| MLA | Lin, Jingjing et al. "MalDetect: Malware Classification Using API Sequence and Comparison with Transformer Encoder" . (2024) : 133-140 . |
| APA | Lin, Jingjing , Lin, Jingsong , Lyu, Chenxi , Fan, Xinmin , Dong, Chen . MalDetect: Malware Classification Using API Sequence and Comparison with Transformer Encoder . (2024) : 133-140 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Digital microfluidic biochips (DMFBs), by precisely controlling and manipulating minute fluids, have realized the integration, automation, and cost-effectiveness of biochemical experiments and are applied in various fields such as medical diagnostics, drug development, and environmental monitoring. However, due to the composition of microelectronic component arrays, DMFBs are prone to electrode faults, leading to erroneous biochemical operations and, consequently, inaccurate experimental results. In this paper, a test path optimization algorithm combining an improved grey wolf algorithm and priority strategy is proposed to solve the problem of an extended test droplet path when DMFB tests faulty electrodes. By encoding the priority of the electrodes of the DMFB and the paths between the electrodes, the test droplet routing is performed according to the priority order. The priority coefficients are dynamically adjusted using the improved grey wolf algorithm to shorten the testing path length. Experimental results demonstrate that the proposed path optimization algorithm reduces the path length by 0.45% to 2.08% compared to the Eulerian circuit method in offline testing, achieving the theoretical optimum value, and by 4.90% to 10.53% compared to the ant colony algorithm in online testing. This provides an essential foundation for accelerating the safe and reliable development of DMFBs in healthcare. © 2024 IEEE.
Keyword ：
Ant colony optimization Ant colony optimization Diagnosis Diagnosis Digital microfluidics Digital microfluidics Microfluidic chips Microfluidic chips Swarm intelligence Swarm intelligence
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yang, Zhongliao , Xie, Zhengye , Dong, Chen et al. Digital Microfluidic Biochips Test Path Planning Based on Swarm Intelligence Optimization and Internet of Things Technology [C] . 2024 : 82-89 . |
| MLA | Yang, Zhongliao et al. "Digital Microfluidic Biochips Test Path Planning Based on Swarm Intelligence Optimization and Internet of Things Technology" . (2024) : 82-89 . |
| APA | Yang, Zhongliao , Xie, Zhengye , Dong, Chen , Fan, Xinmin , Chen, Zhenyi . Digital Microfluidic Biochips Test Path Planning Based on Swarm Intelligence Optimization and Internet of Things Technology . (2024) : 82-89 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
