Query：
学者姓名：董晨
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
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 ：
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 ：
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 ：
Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding Network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural Network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.
Keyword ：
Benchmarking Benchmarking Encoding (symbols) Encoding (symbols) Graph algorithms Graph algorithms Graphic methods Graphic methods Graph neural networks Graph neural networks Network coding Network coding Network theory (graphs) Network theory (graphs) Semantics Semantics Syntactics Syntactics Word processing Word processing
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Xu, Junjie , Chen, Yuzhong , Xiao, Lingsheng et al. A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving [J]. | Neural Computing and Applications , 2025 , 37 (3) : 1651-1672 . |
| MLA | Xu, Junjie et al. "A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving" . | Neural Computing and Applications 37 . 3 (2025) : 1651-1672 . |
| APA | Xu, Junjie , Chen, Yuzhong , Xiao, Lingsheng , Liao, Hongmiao , Zhong, Jiayuan , Dong, Chen . A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving . | Neural Computing and Applications , 2025 , 37 (3) , 1651-1672 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Electronic tickets (e-tickets) are gradually being adopted as a substitute for paper-based tickets to bring convenience to customers, corporations, and governments. However, their adoption faces a number of practical challenges, such as flexibility, privacy, secure storage, and inability to deploy on IoT devices such as smartphones. These concerns motivate the current research on e-ticket systems, which seeks to ensure the unforgeability and authenticity of e-tickets while simultaneously protecting user privacy. Many existing schemes cannot fully satisfy all these requirements. To improve on the current state-of-the-art solutions, this paper constructs a blockchain-enhanced privacy-preserving e-ticket system for IoT devices, dubbed PriTKT, which is based on blockchain, structure-preserving signatures (SPS), unlinkable redactable signatures (URS), and zero-knowledge proofs (ZKP). It supports flexible policy-based ticket purchasing and ensures user unlinkability. According to the data minimization and revealing principle of GDPR, PriTKT empowers users to selectively disclose subsets of (necessary) attributes to sellers as long as the disclosed attributes satisfy ticket purchasing policies. In addition, benefiting from the decentralization and immutability of blockchain, effective detection and efficient tracing of double spending of e-tickets are supported in PriTKT. Considering the impracticality of existing e-tickets schemes with burdensome ZKPs, we replace them with URS/SPS or efficient ZKP to significantly improve the efficiency of ticket issuing and make it suitable for use on smartphones.
Keyword ：
blockchain blockchain double-spending detection double-spending detection electronic tickets electronic tickets IoT IoT privacy-preserving privacy-preserving
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhan, Yonghua , Yuan, Feng , Shi, Rui et al. PriTKT: A Blockchain-Enhanced Privacy-Preserving Electronic Ticket System for IoT Devices [J]. | SENSORS , 2024 , 24 (2) . |
| MLA | Zhan, Yonghua et al. "PriTKT: A Blockchain-Enhanced Privacy-Preserving Electronic Ticket System for IoT Devices" . | SENSORS 24 . 2 (2024) . |
| APA | Zhan, Yonghua , Yuan, Feng , Shi, Rui , Shi, Guozhen , Dong, Chen . PriTKT: A Blockchain-Enhanced Privacy-Preserving Electronic Ticket System for IoT Devices . | SENSORS , 2024 , 24 (2) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Digital microfluidic biochips (DMFBs) have a significant stride in the applications of medicine and the biochemistry in recent years. DMFBs based on micro -electrode -dot -array (MEDA) architecture, as the nextgeneration DMFBs, aim to overcome drawbacks of conventional DMFBs, such as droplet size restriction, low accuracy, and poor sensing ability. Since the potential market value of MEDA biochips is vast, it is of paramount importance to explore approaches to protect the intellectual property (IP) of MEDA biochips during the development process. In this paper, an IP authentication strategy based on the multi-PUF applied to MEDA biochips is presented, called bioMPUF, consisting of Delay PUF, Split PUF and Countermeasure. The bioMPUF strategy is designed to enhance the non -linearity between challenges and responses of PUFs, making the challenge-response pairs (CRPs) on the MEDA biochips are difficult to be anticipated, thus thwarting IP piracy attacks. Moreover, based on the easy degradation of MEDA biochip electrodes, a countermeasure is proposed to destroy the availability of piracy chips. Experimental results demonstrate the feasibility of the proposed bioMPUF strategy against the brute force attack and modeling attack.
Keyword ：
Hardware security Hardware security IP protection IP protection MEDA biochips MEDA biochips Modeling attack Modeling attack Multi-PUF Multi-PUF
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Dong, Chen , Guo, Xiaodong , Lian, Sihuang et al. Harnessing the advances of MEDA to optimize multi-PUF for enhancing IP security of biochips [J]. | JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES , 2024 , 36 (3) . |
| MLA | Dong, Chen et al. "Harnessing the advances of MEDA to optimize multi-PUF for enhancing IP security of biochips" . | JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 36 . 3 (2024) . |
| APA | Dong, Chen , Guo, Xiaodong , Lian, Sihuang , Yao, Yinan , Chen, Zhenyi , Yang, Yang et al. Harnessing the advances of MEDA to optimize multi-PUF for enhancing IP security of biochips . | JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES , 2024 , 36 (3) . |
| 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 ：
Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.
Keyword ：
Contrastive Learning Contrastive Learning Knowledge graph Knowledge graph Prediction models Prediction models Semantic Segmentation Semantic Segmentation
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Zhanghui , Chen, Shijie , Chen, Yuzhong et al. A knowledge-enhanced interest segment division attention network for click-through rate prediction [J]. | Neural Computing and Applications , 2024 , 36 (34) : 21817-21837 . |
| MLA | Liu, Zhanghui et al. "A knowledge-enhanced interest segment division attention network for click-through rate prediction" . | Neural Computing and Applications 36 . 34 (2024) : 21817-21837 . |
| APA | Liu, Zhanghui , Chen, Shijie , Chen, Yuzhong , Su, Jieyang , Zhong, Jiayuan , Dong, Chen . A knowledge-enhanced interest segment division attention network for click-through rate prediction . | Neural Computing and Applications , 2024 , 36 (34) , 21817-21837 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In the field of intelligent digital healthcare, Continuous-flow microfluidic biochip (CFMB) has become a research direction of widespread concern. CFMB integrates a large number of microvalves and large-scale microchannel networks into a single chip, enabling efficient execution of various biochemical protocols. However, as the scale of the chip increases, the routing task for CFMB becomes increasingly complex, and traditional manual routing is no longer sufficient to meet the requirements. Therefore, this paper proposes an automatic routing framework for CFMB based on Genetic algorithm (GA) and A* algorithms. Specifically, we adopt a two-stage A* algorithm to design the routing between modules, using the routing results obtained from the A* algorithm as the basis for evaluating the quality of solutions in the GA algorithm. Then, the GA algorithm is used to search for the optimal approximate solution in the solution space. Experimental results show that this method can reduce routing length and minimize routing crossings, thereby improving the parallel transmission speed of reagents on CFMB. This approach provides a feasible solution for large-scale automated routing of CFMB in the field of intelligent digital healthcare. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.
Keyword ：
Biochips Biochips Digital microfluidics Digital microfluidics Genetic algorithms Genetic algorithms Health care Health care Routing algorithms Routing algorithms
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Huang, Huichang , Yang, Zhongliao , Zhong, Jiayuan et al. Genetic-A* Algorithm-Based Routing for Continuous-Flow Microfluidic Biochip in Intelligent Digital Healthcare [C] . 2024 : 209-223 . |
| MLA | Huang, Huichang et al. "Genetic-A* Algorithm-Based Routing for Continuous-Flow Microfluidic Biochip in Intelligent Digital Healthcare" . (2024) : 209-223 . |
| APA | Huang, Huichang , Yang, Zhongliao , Zhong, Jiayuan , Xu, Li , Dong, Chen , Bao, Ruishen . Genetic-A* Algorithm-Based Routing for Continuous-Flow Microfluidic Biochip in Intelligent Digital Healthcare . (2024) : 209-223 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
