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

A two-stage method with twin autoencoders for the degradation trajectories prediction of lithium-ion batteries

Journal of Energy Chemistry 2025年第4期103卷 759-772页

作者： Lei Cai Jing Yan Haiyan Jin Jinhao Meng Jichang Peng Bin Wang Wei Liang Remus Teodorescu School of Computer Science and Engineering Xi'an University of Technology School of Electrical Engineering Xi'an Jiaotong University Smart Grid Research Institute Nanjing Institute of Technology Department of Energy Aalborg University

To predict the lithium-ion(Li-ion) battery degradation trajectory in the early phase,arranging the maintenance of battery energy storage systems is of great ***,under different operation conditions,Li-ion batteries present distinct degradation patterns,and it is challenging to capture negligible capacity fade in early *** the data-driven method showing promising performance,insufficient data is still a big issue since the ageing experiments on the batteries are too slow and *** this study,we proposed twin autoencoders integrated into a two-stage method to predict the early cycles' degradation *** two-stage method can properly predict the degradation from course to *** twin autoencoders serve as a feature extractor and a synthetic data generator,***,a learning procedure based on the long-short term memory(LSTM) network is designed to hybridize the learning process between the real and synthetic *** performance of the proposed method is verified on three datasets,and the experimental results show that the proposed method can achieve accurate predictions compared to its competitors.

关键词： Autoencoder Battery degradation trajectory Early prediction Synthetic data generation

来源：评论

学校读者我要写书评

暂无评论

Leveraging BERT, DistilBERT and TinyBERT for Rumor Detection

引用

IEEE Access 2025年 13卷 72918-72929页

作者： Qazi, Aijazahamed Goudar, R.H. Patil, Rudragoud Hukkeri, Geetabai S. Kulkarni, Dhanashree Angadi Institute of Technology and Management Department of Artificial Intelligence and Data science Belagavi591108 India Visvesvaraya Technological University Department of Computer Science and Engineering Belagavi590018 India KLS Gogte Institute of Technology Department of Computer Science and Engineering Belagavi590008 India Manipal Academy of Higher Education Manipal Institute of Technology Department of Computer Science and Engineering Bengaluru Karnataka Manipal576104 India Angadi Institute of Technology and Management Department of Computer Science and Engineering Belagavi591108 India

The rapid spread of false information on social media has become a major challenge in today's digital world. This has created a need for an effective rumor detection system that can identify and control the spread of false information in real-time. The proposed work introduces a rumor detection system by integrating transformer-based models such as BERT, DistilBERT, and TinyBERT with traditional Machine Learning (ML) techniques. The proposed method involves fine-tuning transformer models to recognize the contextual meaning of social media posts. The classifiers include Decision Tree (DT), Support Vector Machine (SVM), Random Forest (RF) and Naïve Bayes (NB), which help in categorizing content as either rumor or non-rumor based on the patterns. The proposed work evaluated BERT, DistilBERT, TinyBERT combined with ML models (SVM, DT, RF, NB) across PHEME dataset using 70:30, 60:40, and 80:20 splits. Overall, BERT+DT and TinyBERT+SVM provided significant results, with BERT+RF and DistilBERT+NB demonstrating better classification capabilities across various events and split ratios on the dataset. © 2013 IEEE.

关键词： Tweets

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Path Planning Based on Conflict-Based Search (CBS) Variations for Heterogeneous Robots

引用

Journal of Intelligent and Robotic Systems: Theory and Applications 2025年第1期111卷 1-12页

作者： Bai, Yifan Kotpalliwar, Shruti Kanellakis, Christoforos Nikolakopoulos, George Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå797187 Sweden

This article introduces a novel Multi-agent path planning scheme based on Conflict Based Search (CBS) for heterogeneous holonomic and non-holonomic agents, designated as Heterogeneous CBS (HCBS). The proposed methodology employs a hybrid A∗ algorithm for non-holonomic car-like robots and a conventional A∗ algorithm for holonomic robots. Following this, a body conflict detection strategy is utilized to construct the conflict tree, bridging the initial path planning with the resolution of conflicts among agents. Moreover, we present two variants of HCBS: the Enhanced Conflict-Based Search (EHCBS) and the Depth-First Conflict-Based Search (DFHCBS). We evaluate the efficacy of our proposed algorithms—HCBS, EHCBS, and DFHCBS—against a standard prioritized planning algorithm, focusing on success rates and computational efficiency in environments with varying numbers of agents and obstacles. The empirical results demonstrate that EHCBS exhibits superior computational efficiency in small, dense environments, while DFHCBS performs well in larger-scale environments. This highlights the adaptability of our proposed approaches in various settings, proving the computational advantage of EHCBS and DFHCBS over traditional methods. © The Author(s) 2025.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

CRT and PUF-based Self/Mutual-healing Key Distribution Protocol with Collusion Resistance and Revocation Capability

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4607-4622页

作者： Othman, Wajdy Hong, Zhong Fuyou, Miao Xue, Kaiping Hawbani, Ammar Amin, Ruhul Zhao, Liang Li, Tao Nankai University Haihe Lab of ITAI College of Cyber Science Tianjin China Anhui University School of Computer Science and Technology China University of Science and Technology of China School of Computer Science and Technology School of Information Science and Technology Anhui Hefei China Shenyang Aerospace University School of Computer Science Shenyang110136 China Department of Computer Science & Engineering IIIT-NR China Nankai University Haihe Lab of ITAI College of Cyber Science China

Self-healing group key distribution (SGKD) protocols guarantee the security of group communications by allowing authorized users to independently recover missed previous session keys from the current broadcast without retransmission. However, existing SGKD protocols have flaws: (1) collusion resistance and revocable nodes are both upper-bounded by the degree of polynomials used, (2) the disclosure of personal secrets enables the recovery of group key, (3) temporary revocation of a group member is not possible, and (4) a revoked node may obtain the session key when initiating mutual healing, moreover, a malicious node may cause the recovery of false group keys. To address these limitations, we propose an SGKD protocol using the Chinese remainder theorem (CRT) and Physical Unclonable Function (PUF). Our proposed SGKD protocol generates a PUF-based dynamic secret by stimulating nodes' PUF using a polynomial-based encrypted challenge. This secret is then employed to retrieve a CRT-based encrypted group key. By combining PUF and CRT, we can generate dynamic secrets on the fly and reduce computation time significantly. Utilizing such a technique, our protocol achieves superior security goals, including resistance to any coalition of group nodes even if nodes' personal secrets were disclosed. Furthermore, the proposed protocol provides an unlimited number of revocable nodes. Additionally, a revoked node can rejoin its group in later sessions without affecting backward secrecy. Moreover, the protocol provides a backward secrecy guaranteed mutual-healing feature free from desynchronization. Our performance and security analyses (i.e., theorem-based formal analysis, NS3-based experiment, and formal verification using the AVIPSA tool) show that our proposed protocol achieves stronger security goals and better efficiency in terms of computation, communication, and storage costs compared to existing SGKD schemes. © 2002-2012 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Based Side-Channel Attack Detection for Mobile Devices Security in 5G Networks

引用

清华大学学报自然科学版（英文版） 2025年第3期30卷 1012-1026页

作者： Amjed A.Ahmed Mohammad Kamrul Hasan Ali Alqahtani Shayla Islam Bishwajeet Pandey Leila Rzayeva Huda Saleh Abbas Azana Hafizah Mohd Aman Nayef Alqahtani Center for Cyber Security Faculty of Information Science and TechnologyUniversiti Kebangsaan MalaysiaBangi 43600Malaysia Imam Alkadhim University College Department of Computer Techniques EngineeringBaghdad 10066Iraq Center for Cyber Security Faculty of Information Science and TechnologyUniversiti Kebangsaan MalaysiaBangi 43600Malaysia Department of Networks and Communications Engineering College of Computer Science and Information SystemsNajran UniversityNajran 61441Saudi Arabia Institute of Computer Science and Digital Innovation UCSI UniversityKuala Lumpur 56000Malaysia Department of Intelligent Systems and Cyber Security Astana IT UniversityAstana 20000Kazakstan Department of Computer Science College of Computer Science and EngineeringTaibah UniversityMadinah 42353Saudi Arabia Department of Electrical Engineering College of EngineeringKing Faisal UniversityAl-Hofuf 31982Saudi Arabia

Mobile devices within Fifth Generation(5G)networks,typically equipped with Android systems,serve as a bridge to connect digital gadgets such as global positioning system,mobile devices,and wireless routers,which are vital in facilitating end-user communication ***,the security of Android systems has been challenged by the sensitive data involved,leading to vulnerabilities in mobile devices used in 5G *** vulnerabilities expose mobile devices to cyber-attacks,primarily resulting from security ***-permission apps in Android can exploit these channels to access sensitive information,including user identities,login credentials,and geolocation *** such attack leverages"zero-permission"sensors like accelerometers and gyroscopes,enabling attackers to gather information about the smartphone's *** underscores the importance of fortifying mobile devices against potential future *** research focuses on a new recurrent neural network prediction model,which has proved highly effective for detecting side-channel attacks in mobile devices in 5G *** conducted state-of-the-art comparative studies to validate our experimental *** results demonstrate that even a small amount of training data can accurately recognize 37.5％of previously unseen user-typed ***,our tap detection mechanism achieves a 92％accuracy rate,a crucial factor for text *** findings have significant practical implications,as they reinforce mobile device security in 5G networks,enhancing user privacy,and data protection.

关键词： Fifth Generation(5G)networks smartphone information leakage Side-Channel Attack(SCA) deep learning

来源：评论

学校读者我要写书评

暂无评论

Merging Context Clustering with Visual State Space Models for Medical Image Segmentation

引用

IEEE Transactions on Medical Imaging 2025年第5期44卷 2131-2142页

作者： Zhu, Yun Zhang, Dong Lin, Yi Feng, Yifei Tang, Jinhui Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China The Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong Hong Kong The Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong Hong Kong Nanjing Medical University First School of Clinical Medicine China First Affiliated Hospital of Nanjing Medical University Department of General Surgery Nanjing China

Medical image segmentation demands the aggregation of global and local feature representations, posing a challenge for current methodologies in handling both long-range and short-range feature interactions. Recently, vision mamba (ViM) models have emerged as promising solutions for addressing model complexities by excelling in long-range feature iterations with linear complexity. However, existing ViM approaches overlook the importance of preserving short-range local dependencies by directly flattening spatial tokens and are constrained by fixed scanning patterns that limit the capture of dynamic spatial context information. To address these challenges, we introduce a simple yet effective method named context clustering ViM (CCViM), which incorporates a context clustering module within the existing ViM models to segment image tokens into distinct windows for adaptable local clustering. Our method effectively combines long-range and short-range feature interactions, thereby enhancing spatial contextual representations for medical image segmentation tasks. Extensive experimental evaluations on diverse public datasets, i.e., Kumar, CPM17, ISIC17, ISIC18, and Synapse, demonstrate the superior performance of our method compared to current state-of-the-art methods. Our code can be found at https://***/zymissy/CCViM. © 1982-2012 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Average AoI Minimization with Directional Charging for Wireless-Powered Network Edge

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 4889-4906页

作者： Chen, Quan Guo, Song Xu, Wenchao Li, Jing Shi, Tuo Gao, Hong Cai, Zhipeng Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China The Hong Kong University of Science and Technology Department of Computer Science and Engineering 999077 Hong Kong Hong Kong Polytechnic University Department of Computing Hong Kong999077 Hong Kong City University of Hong Kong Department of Computer Science Hong Kong Hong Kong Zhejiang Normal University School of Computer Science and Technology Jinhua China Georgia State University Department of Computer Science AtlantaGA30303 United States

Age of Information (AoI) has been proposed as a new performance metric to capture the freshness of data. At wireless-powered network edge, the source nodes first need to be charged ready for update transmissions, which means the system AoI is not only decided by the scheduling of update transmissions but also by the designing of charging plan. However, the existing works either only focused on the point of scheduling update transmissions or have a rigid assumption that only one source node can be charged per time. Aiming at making the work more practical and general, we investigate the average AoI optimization problem at wireless-powered network edge with directional charging. Firstly, the theoretical bound of the weighted sum of average AoI of the entire network with a directional charger is analyzed, which is proved to be related to nodes' maximum transmitting interval and the charging strategy. An optimal charging time computation algorithm is proposed to obtain the maximum transmitting interval of each source node by considering the overlapped areas of different charging orientations. After then, an AoI-aware periodical charging scheduling algorithm is proposed to compute a periodical charging schedule while the average AoI is bounded, including a charging period T and the charging orientations assigned to each time slot within T. The proposed algorithm is proved to have an approximation ratio of up to 1.5625. Furthermore, several approximate algorithms are also proposed for average AoI optimization with multiple chargers and network bandwidth constraint. Finally, the extensive simulations demonstrate the high performance of the proposed algorithm in terms of AoI. © 2002-2012 IEEE.

关键词： Inductive power transmission

来源：评论

学校读者我要写书评

暂无评论

FLAG: frequency-based local and global network for face forgery detection

引用

Multimedia Tools and Applications 2025年第2期84卷 647-663页

作者： Zhou, Kai Sun, Guanglu Wang, Jun Wang, Jiahui Yu, Linsen School of Computer Science and Technology Harbin University of Science and Technology Harbin150080 China Department of Information Engineering and Mathematics University of Siena Siena53100 Italy

Deepfake detection aims to mitigate the threat of manipulated content by identifying and exposing forgeries. However, previous methods primarily tend to perform poorly when confronted with cross-dataset scenarios. To address the above issue, we propose an innovative hybrid network called the Frequency-based Local and Global (FLAG) network to explore local and global information with the help of frequency-domain cues for better generalization capability. In consideration of the fact that forged faces often exhibit flaws in the frequency domain, we design a Frequency-based Attention Enhancement Module (FAEM) to enhance the aggregation of CNN and Vision Transformer (ViT). In this design, local features from CNN are attentively enhanced by selected frequency coefficients in FAEM, facilitating generalizable global features learning by the ViT module. The effectiveness of the proposed method is validated via numerous experiments and the generalization performance is improved under cross-dataset scenarios. Especially, the proposed method have obtained an AUC of 99.26% and an ACC of 96.56% using intra-dataset experimental results on FaceForensics++ (C23). © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Enhanced Neutrosophic Set and Machine Learning Approach for Kidney Disease Prediction

引用

Neutrosophic Sets and Systems 2025年 80卷 465-477页

作者： Al-Doori, Humam M. Alkellezli, Tareef S. Abdelhafeez, Ahmed Eassaa, Mohamed Sawah, Mohamed S. El-Douh, Ahmed A. Cybersecurity Sciences Department College of Science Ashur University Baghdad Iraq Cybersecurity Engineering Department College of Engineering Ashur University Baghdad Iraq Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan Department of Computer Science Faculty of Information Technology Ajloun National University P.O.43 Ajloun26810 Jordan Cybersecurity Technology Engineering Department College of Engineering Technology Ashur University Baghdad Iraq

Kidney disease (KD) is a gradually increasing global health concern. It is a chronic illness linked to higher rates of morbidity and mortality, a higher risk of cardiovascular disease and numerous other illnesses, and expensive medical expenses. The machine learning (ML) models are applied for KD prediction with higher accuracy and precision. The KD dataset has uncertainty and vague information, so, we used the neutrosophic set (NS) to deal with vague and uncertainty information in the KD dataset. The KD dataset is converted into the N-KD dataset with three membership functions: truth, indeterminacy, and falsity. Three ML models are used in this study such as logistic regression (LR), support vector machine (SVM), and k-nearest neighbor (KNN). These ML models are applied to the N-KD dataset. The results show the LR has higher accuracy and precision on the N-KD dataset than the original KD dataset. © 2025, university of New Mexico. All rights reserved.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

Clustered Reinforcement Learning

引用

Frontiers of computer science 2025年第4期19卷 43-57页

作者： Xiao MA Shen-Yi ZHAO Zhao-Heng YIN Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing UniversityNanjing 210023China Department of Electrical Engineering and Computer Sciences University of CaliforniaBerkeleyCA 94720-1770USA

Exploration strategy design is a challenging problem in reinforcement learning(RL),especially when the environment contains a large state space or sparse *** exploration,the agent tries to discover unexplored(novel)areas or high reward(quality)*** existing methods perform exploration by only utilizing the novelty of *** novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent’s *** address this problem,this paper proposes a novel RL framework,called clustered reinforcement learning(CRL),for efficient exploration in *** adopts clustering to divide the collected states into several clusters,based on which a bonus reward reflecting both novelty and quality in the neighboring area(cluster)of the current state is given to the *** leverages these bonus rewards to guide the agent to perform efficient ***,CRL can be combined with existing exploration strategies to improve their performance,as the bonus rewards employed by these existing exploration strategies solely capture the novelty of *** on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.

关键词： deep reinforcement learning exploration count-based method clustering K-means

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：