检索结果-内蒙古大学图书馆

LDGCN: An Edge-End Lightweight Dual GCN Based on Single-Channel EEG for Driver Drowsiness Monitoring

IEEE Transactions on Consumer Electronics 2025年

作者： Huang, Jingwei Wang, Chuansheng Huang, Jiayan Fan, Haoyi Xue, Xingsi Zhang, Fuquan Fuzhou University College of Computer and Big Data Fuzhou China Polytechnic University of Catalonia Department of Automatic Control Barcelona Spain Putian University New Engineering Industry College Putian China Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian Fuzhou350118 China Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Minjiang University College of Computer and Control Engineering Fuzhou China Sichuan Conservatory of Music Digital Media Art Key Laboratory of Sichuan Province Chengdu China Minjiang University Fuzhou Technology Innovation Center of Intelligent Manufacturing information System Fuzhou China Fuzhou China

Driver drowsiness electroencephalogram (EEG) signal monitoring can promptly alert drivers of their drowsiness in edge-end Consumer Electronics (CE), thereby reducing the probability of traffic accidents. Graph convolutional networks (GCNs) have shown significant advancements in processing the non-stationary, time-varying, and non-Euclidean nature of EEG signals. However, the existing single-channel EEG adjacency graph construction process lacks interpretability, which hinders the ability of GCNs to effectively extract adjacency graph features, thus affecting the performance of drowsiness monitoring. To address this issue, we propose an edge-end Lightweight Dual Graph Convolutional Network (LDGCN). Specifically, we are the first to incorporate neurophysiological knowledge to design a Baseline Drowsiness Status Adjacency Graph (BDSAG), which characterizes driver drowsiness status. Additionally, to express more features within limited EEG data, we introduce the Augmented Graph-level Module (AGM). This module captures global and local information at the graph level, ensuring that BDSAG features remain intact while enhancing effective feature expression capability. To further enhance the application of CE, we apply Adaptive Pruning Optimization (APO) to the channels and neurons of LDGCN, which nearly halves the inference latency. Experiments on benchmark datasets demonstrate that LDGCN offers the best trade-off between monitoring performance and hardware resource utilization, outperforming existing state-of-the-art algorithms. © 1975-2011 IEEE.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

Hyper-Parameter Optimization and Proxy Re-encryption for Federated Learning 6th

Hyper-Parameter Optimization and Proxy Re-encryption for F...

引用

6th International Conference on Blockchain and Trustworthy Systems, BlockSys 2024

作者： Du, Wanrong Wen, Bin Ma, Mengshuai Liu, Wenlong Wei, Xiaoxun Key Laboratory of Data Science and Smart Education Ministry of Education Hainan Normal University Haikou571158 China School of Information Science and Technology Hainan Normal University Haikou571158 China Cloud Computing and Big Data Research Center Hainan Normal University Haikou571158 China

ISBN: (纸本)9789819614103

Federated learning is a distributed machine learning paradigm that allows multiple participants to collaborate on training a shared model without revealing their own data. However, federated learning faces challenges such as data heterogeneity, communication overhead, security attacks, etc., which result in low efficiency of data training. To address these issues, this paper proposes a strategy to enhance the training efficiency of federated learning data through hyperparameter optimization and proxy re-encryption. A semi-supervised model of federated learning based on generative adversarial network is designed so that each participant can automatically adjust and optimize their own training parameters according to their own data distribution and environment in order to adapt to the data heterogeneity and dynamics of federated learning. Finally, experiments demonstrate that the proposed method can significantly improve the efficiency of data training and model performance compared with traditional federated learning methods across different datasets and scenarios. Experimental results show that the proposed strategy can achieve the same or even better accuracy than centralized machine learning while safeguarding data privacy and enabling ciphertext conversion. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Correction: Deep learning assists early-detection of hypertension-mediated heart change on ECG signals

引用

Hypertension research : official journal of the Japanese Society of Hypertension 2025年第2期48卷 874-875页

作者： Chengwei Liang Fan Yang Xiaobing Huang Lijuan Zhang Ying Wang Department of Automation Xiamen University Xiamen Fujian China. National Institute for Data Science in Health and Medicine Xiamen University Xiamen Fujian China. Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Xiamen Fujian China. Fuzhou First General Hospital Fujian Medical University Fujian China. The First Affiliation Hospital of Xiamen University Xiamen University Xiamen Fujian China. zhangli.jennifer@***. Department of Automation Xiamen University Xiamen Fujian China. wangying@***. National Institute for Data Science in Health and Medicine Xiamen University Xiamen Fujian China. wangying@***. Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Xiamen Fujian China. wangying@***.

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Recommender system based on noise enhancement and multi-view graph contrastive learning

引用

Applied Soft computing 2025年 177卷

作者： Li, Duantengchuan Lu, Jiayao Wang, Zhihao Wang, Jingxiong Wang, Xiaoguang Shi, Fobo Liu, Yu School of Information Management Wuhan University Wuhan430072 China Intelligent Computing Laboratory for Cultural Heritage Wuhan University Wuhan430072 China Big Data Institute Wuhan University Wuhan430072 China School of Computer Science Wuhan University Wuhan430072 China

Graph neural network has become the mainstream model of Knowledge-aware Recommendation because of its ability to capture higher-order information. Contrastive learning, due to its self-supervised learning paradigm, has been successfully employed to alleviate the sparse supervision signal problem in Knowledge-aware Recommendation models based on graph neural network. While graph neural networks and contrastive learning have advanced knowledge-aware recommendation, two critical limitations persist: (1) indistinguishable node representations due to data sparsity exacerbate the long-tail problem, and (2) suboptimal contrastive performance caused by non-uniform node distributions in embedding space. To mitigate the aforementioned issues, we propose the novel recommender system based on Noise Enhancement and Multi-View Graph Contrastive Learning (MNCL), the first framework that jointly optimizes node distribution uniformity and multi-view semantic alignment. Specifically, we inject uncertainty-aware noise into some graphs to achieve topology-invariant uniform representations and construct structural diversity-driven view for contrastive preference disentanglement. Unlike existing GNN-based contrastive methods that rely on heuristic augmentation or single-view alignment, MNCL dynamically regulates distribution entropy via noise intensity and preserves heterogeneous graph semantics through multi-view sampling. Extensive experiments on three public datasets show that our model achieves better results compared with the mainstream methods. © 2025 Elsevier B.V.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Exploiting Robust Model Watermarking Against the Model Fine-Tuning Attack via Flat Minima Aware Optimizers

Exploiting Robust Model Watermarking Against the Model Fine-...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dongdong Lin Yue Li Bin Li Jiwu Huang Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China SZU-AFS Joint Innovation Center for AI Technology Shenzhen University Shenzhen China Xiamen Key Laboratory of Data Security and Blockchain Technology Huaqiao University Xiamen China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University Shenzhen China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

With the rapid advancement of deep neural networks (DNNs), model watermarking has emerged as a widely adopted technique for safeguarding model copyrights. A prevalent method involves utilizing a watermark decoder to retrieve watermark bits from generated outputs, but such methods are often vulnerable to model fine-tuning attacks. Traditionally, this challenge is mitigated through adversarial training or data augmentation, both of which significantly increase the computational burden. In this paper, we present a solution employing Flat Minima Aware (FMA) optimizers to bolster the robustness of model watermarking without requiring additional training data. By optimizing the watermark loss with flat minima awareness, our approaches significantly enhance the robustness of watermarks against the model fine-tuning attack. Comprehensive experiments have demonstrated our method’s superior ability to preserve watermark integrity. These findings suggest that this innovative optimization strategy offers a robust and efficient pathway for protecting models, thereby contributing to more secure and reliable model copyright protection mechanisms.

关键词： Training Resistance Computational modeling Training data Watermarking Signal processing Diffusion models Robustness Speech processing Optimization

来源：评论

学校读者我要写书评

暂无评论

Safe Reinforcement Learning for Social Motor Coordination in Two Dimensional Space 26

Safe Reinforcement Learning for Social Motor Coordination in...

引用

26th International Conference on Industrial Technology, ICIT 2025

作者： Yang, Fan Huang, Yuening Zhai, Chao Zhang, Hehong China University of Geosciences School of Automation Wuhan Campus China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Rice University George R. Brown School of Engineering and Computing HoustonTX United States Fuzhou University School of Computer and Data Science Fuzhou China

ISBN: (纸本)9798331521950

This paper presents an interactive motion control method based on reinforcement learning, designed to assist children with autism who have social motor impairments through a mirror game intervention. The virtual teacher uses the Deep Deterministic Policy Gradient (DDPG) algorithm to optimize its actions, guiding the participant to follow a Lissajous trajectory. To ensure safety, a motion-correction mechanism was developed, which automatically adjusts actions when the predicted trajectory surpasses predefined safety boundaries. The reward function considers both the distance between the virtual teacher and the target trajectory, as well as the distance between the virtual teacher and the participant, with dynamic adjustments applied by the motion-correction mechanism. Experimental results demonstrate that the virtual teacher effectively guides the participant towards the target trajectory while adhering to safety constraints. © 2025 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Incorporating edge sharpening and covariance attention for named entity recognition

引用

Neurocomputing 2025年 643卷

作者： Yang, Caiwei Chen, Yanping Yu, Shuai Huang, Ruizhang Qin, Yongbin Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Guizhou University Guizhou Guiyang550025 China State Key Laboratory of Public Big Data Guizhou university Guizhou Guiyang550025 China College of Computer Science and Technology Guizhou University Guiyang550025 China

Named Entity Recognition (NER) is a key application in the field of Artificial Intelligence and Natural Language Processing, which automatically identifies and categorizes entities in text by intelligent algorithms. In NER, all spans of a sentence can be organized into a two-dimensional representation. The semantic plane has the advantage to represent the semantic structure of a sentence and to learn the interaction between spans. One of an important phenomenon of this representation is that neighboring elements of the semantic plane are spans denoted to overlapped subsequences in a sentence. Because they share the same contextual features and semantic dependencies, it is difficult to distinguish true entities from the backgrounds. Therefore, refining span representations and building the semantic dependency between spans is helpful for the entity recognition task. In this paper, we propose an Edge Sharpening and Covariance Attention (ES&CA) model to support recognizing named entities from the semantic plane representation. The edge sharpening (ES) module adopts a differential convolution to sharpen the semantic gradients in the semantic plane, which has the ability to gather semantic information from neighborhoods. In the covariance attention (CA) module, the covariance between spans are applied to weight the attention of spans relevant to task-relevant learning objective. Establishing semantic relationships across spans is a highly successful approach. The ES&CA model is assessed on five public datasets for nested and flattened named entity recognition. The evaluation results demonstrate the effectiveness of our strategy in distinguishing entity spans from the backgrounds, hence significantly enhancing the final performance. © 2025 Elsevier B.V.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

UNeLF: Unconstrained Neural Light Field for Self-Supervised Angular Super-Resolution

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhao, Mingyuan Sheng, Hao Chen, Rongshan Cong, Ruixuan Cui, Zhenglong Yang, Da Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang University Data Science and Intelligent Computing Laboratory Hangzhou International Innovation Institute Hangzhou311115 China Macao Polytechnic University Faculty of Applied Sciences 999078 China

Compared to supervised learning methods, self-supervised learning methods address the domain gap problem between light field (LF) datasets collected under varying acquisition conditions, which typically leads to decreased performance when differences exist in the distribution between the training and test sets. However, current self-supervised light field angular super-resolution (LFASR) techniques primarily focus on exploiting discrete spatial-angular features while neglecting continuous LF information. In contrast to previous work, we propose a self-supervised unconstrained neural light field (UNeLF) to continuously represent LF for LFASR. Specifically, any LF can be described as the camera pose for each sub-aperture image (SAI) and the two-plane that captures these SAIs. To describe the former, we introduce a SAIs-dependent pose optimization method to solve the issue that arises from the narrow baseline of most LF data, which hinders robust camera pose estimation. This mechanism reduces the number of trainable camera parameters from a quadratic to a constant scale, thereby alleviating the complexity of joint optimization. For the latter, we propose a novel adaptive two-plane parameterization strategy to determine the two-plane that captures these SAIs, facilitating refocusing. Finally, we jointly optimize the camera parameters, near-far planes and neural light field, efficiently mapping each adaptive two-plane parameterized ray to its correspondence color in a continuous manner. Comprehensive experiments demonstrate that UNeLF achieves faster training and inference with fewer computational resources while exhibiting superior performance on both synthetic and real-world datasets. © 1991-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

MODFuzz: A Multi-Objective Directed Fuzzer for USB Drivers

引用

IEEE Internet of Things Journal 2025年

作者： Zhou, Yilin Peng, Guojun Wang, Xingliang Wang, Chenyang Li, Zichuan Liu, Side Wang, Yanhao Yang, Xiuzhang Fu, Jianming Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Indiana University Bloomington BloomingtonIN United States Nio Inc Beijing China Guizhou University Guizhou Big Data Academy Guiyang China

USB interfaces have become ubiquitous in various Internet of Things (IoT) devices, all adhering to the same USB protocol. While enhancing convenience, they also widen the potential attack surface. Fuzzing is a proactive way to identify potential security threats for USB drivers. However, existing USB driver fuzzers primarily prioritize the code coverage of USB drivers, leading to a significant waste of computational resources on irrelevant code segments. To this end, we combine directed fuzzing and USB driver fuzzing for the first time, and present MODFuzz, a pioneering multi-objective directed fuzzing method for USB drivers. MODFuzz autonomously locates the most vulnerable parts within USB drivers, concentrating fuzzing efforts on these areas. Diverging from the existing directed fuzzers, MODFuzz employs a dynamic direction instead of predetermined addresses to guide the fuzzing campaign toward the triggered execution traces with a greater probability of containing vulnerabilities. MODFuzz outperforms the strong baseline in terms of execution speed (about 14% improvement) and crash generation capabilities (about 69% improvement). Meanwhile, we found six previously unknown bugs (all confirmed and assigned vulnerability IDs) in Linux kernel v6.4.10 and received acknowledgment from Red Hat. © 2025 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：