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

Dimensional-noise-aware battery lifetime prediction via an EM-TLS framework

Progress in Natural science:Materials International 2025年第1期35卷 146-155页

作者： Chenlong Yu Ting Lu Guohua Liu Xiaoang Zhai Wuyan Deng Jiayu Wan Yang Liu Xin Li School of Computer Science and Technology Donghua University Future Battery Research Center Global Institute of Future Technology Shanghai Jiaotong University Data Science Research Center Duke Kunshan University

Machine learning has been massively utilized to construct data-driven solutions for predicting the lifetime of rechargeable batteries in recent years, which project the physical measurements obtained during the early charging/discharging cycles to the remaining useful lifetime. While most existing techniques train the prediction model through minimizing the prediction error only, the errors associated with the physical measurements can also induce negative impact to the prediction accuracy. Although total-least-squares(TLS) regression has been applied to address this issue, it relies on the unrealistic assumption that the distributions of measurement errors on all input variables are equivalent, and cannot appropriately capture the practical characteristics of battery degradation. In order to tackle this challenge, this work intends to model the variations along different input dimensions, thereby improving the accuracy and robustness of battery lifetime prediction. In specific, we propose an innovative EM-TLS framework that enhances the TLS-based prediction to accommodate dimension-variate errors, while simultaneously investigating the distributions of them using expectation-maximization(EM). Experiments have been conducted to validate the proposed method based on the data of commercial Lithium-Ion batteries, where it reduces the prediction error by up to 29.9 % compared with conventional TLS. This demonstrates the immense potential of the proposed method for advancing the R&D of rechargeable batteries.

关键词： Battery lifetime prediction Dimension-variate measurement error Energy storage Expectation-maximization Total-least-squares regression

来源：评论

学校读者我要写书评

暂无评论

Toward Precise Quantification of Energy Expenditure in Wheelchair Users

引用

IEEE Access 2025年 13卷 72189-72201页

作者： Alam, Iftikhar Ali, Zulfiqar Khalid, Wassauf Ali, Gauhar ELAffendi, Mohammed City University of Science and Information Technology Department of Computer Science Peshawar25000 Pakistan Prince Sultan University EIAS Data Science and Blockchain Laboratory College of Computer and Information Sciences Riyadh11586 Saudi Arabia

Modern electronic devices like smart bands, smartwatches, smartphones, and treadmills are widely used to track exertion metrics, also called energy expenditure, such as step counts, running, time, and distance. However, these devices often fail to meet the needs of individuals with mobility impairments, such as wheelchair users, for whom such metrics are hard to evaluate. This research introduces a tailored model to track and quantify exertion data for manual wheelchair users. The existing Heart Intensity Metric (HIM), which relies on parameters such as heart rate, weight, age, and time (exercise duration), is adapted with a revised Activity Intensity Assessor (AIA). The model incorporates critical factors for wheelchair users, including heart rate, adjusted movement status (1 for movement and zero for no movement), and inclination status, with new parameters, such as Metabolic Equivalent of Task (MET), and wheelchair speed. The revised AIA is then adapted for the energy expenditure formula to calculate calorie-burning estimation specifically for manual wheelchair users. The revised approach minimizes false positives commonly produced by existing approaches for manual wheelchair users, especially in scenarios involving non-movement exercises like upper limb activities. Unlike prior models, the proposed AIA ensures precise energy expenditure calculations, even during stationary activities, and reflects a zero-calorie expenditure when no exercise occurs. Results are statistically verified and demonstrate that traditional formulas yield inaccurate calorie estimations for wheelchair users, while the revised model aligns better with physiological realities. This work provides a practical framework for designing electronic tools that effectively track energy expenditure/total energy (ET), also known as exertion efforts, and estimate calories burnt by manual wheelchair users. The scope of this study is limited to examining energy expenditure exclusively for manual wheelcha

关键词： Wheelchairs Heart rate Software Legged locomotion Monitoring Manuals Estimation Accuracy Hardware Adaptation models

来源：评论

学校读者我要写书评

暂无评论

Optimized Neural Network for Automated Cardiovascular Disease Classification: Meta-heuristic Enabled Model

引用

SN computer science 2025年第1期6卷 1-14页

作者： Kusuma, S. Jothi, K.R. Department of Computer Science & Engineering (Data Science) Madanapalle Institute of Technology & Science Madanapalle India School of Computer Science and Engineering Vellore Institute of Technology Vellore India

Cardiovascular disease remains a major issue for mortality and morbidity, making accurate classification crucial. This paper introduces a novel heart disease classification model utilizing Electrocardiogram (ECG) signals. The model consists of two main steps: feature extraction using a refined Lion Algorithm with New Mutated evaluation (LA-NM) and classification through an ensemble approach combined with a Neural Network (NN). The proposed model significantly outperforms traditional classifiers. At 80% training data, it achieves accuracy improvements of 8.4% to 3.11% over Neural Network (NN), K-Nearest Neighbors (KNN), Support Vector Machine (SVM), Decision Tree (DT), Random Forest (RF), and ensemble models. At 90% training data, it shows precision improvements ranging from 1.03% to 0.31% better than the comparison models and specificity improvements ranging from 13.92% to 0.52%. These results underscore the effectiveness of the model and suggest its potential for further development in personalized treatment recommendations based on patient history. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2024.

关键词： Ensemble models Feature extraction Heart disease classification Neural network Optimization

来源：评论

学校读者我要写书评

暂无评论

High-speed encrypted traffic classification by using payload features

引用

Digital Communications and Networks 2025年第2期11卷 412-423页

作者： Xinge Yan Liukun He Yifan Xu Jiuxin Cao Liangmin Wang Guyang Xie School of Cyber Science and Engineering Southeast University Nanjing Huafei Data Technology Co. Ltd. School of Computer Science and Communication Engineering Jiangsu University

Traffic encryption techniques facilitate cyberattackers to hide their presence and activities. Traffic classification is an important method to prevent network threats. However, due to the tremendous traffic volume and limitations of computing, most existing traffic classification techniques are inapplicable to the high-speed network environment. In this paper, we propose a High-speed Encrypted Traffic Classification(HETC) method containing two stages. First, to efficiently detect whether traffic is encrypted, HETC focuses on randomly sampled short flows and extracts aggregation entropies with chi-square test features to measure the different patterns of the byte composition and distribution between encrypted and unencrypted flows. Second, HETC introduces binary features upon the previous features and performs fine-grained traffic classification by combining these payload features with a Random Forest model. The experimental results show that HETC can achieve a 94% F-measure in detecting encrypted flows and a 85%–93% F-measure in classifying fine-grained flows for a 1-KB flow-length dataset, outperforming the state-of-the-art comparison methods. Meanwhile, HETC does not need to wait for the end of the flow and can extract mass computing features. The average time for HETC to process each flow is only 2 or 16 ms, which is lower than the flow duration in most cases, making it a good candidate for high-speed traffic classification.

关键词： Traffic classification Flow analysis Information entropy Machine learning Randomness test

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

science China(Information sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

Novel Reliability Indicators From the Perspective of data Center Networks

引用

IEEE Transactions on Reliability 2025年第1期74卷 2459-2472页

作者： Zhuang, Hongbin Li, Xiao-Yan Lin, Cheng-Kuan Liu, Ximeng Jia, Xiaohua Fuzhou University College of Computer and Data Science Fuzhou350108 China National Yang Ming Chiao Tung University Department of Computer Science Hsinchu300 Taiwan City University of Hong Kong Department of Computer Science Kowloon Tong Hong Kong

Modern large-scale computing systems always demand better connectivity indicators for reliability evaluation. However, as more processing units have been rapidly incorporated into emerging computing systems, existing indicators (e.g., -component edge connectivity and -extra edge connectivity) have gradually failed to provide the required fault tolerance. In addition, these indicators require, for example, that the faulty network should have at least components (or that each component should have at least nodes). These fault assumptions are not flexible enough to deal with diversified structural demands in practice circumstances. In order to address these challenges simultaneously, this article proposes two novel indicators for network reliability by utilizing the partition matroid technique, named matroidal connectivity and conditional matroidal connectivity. We first investigate the accurate values of (conditional) matroidal connectivity of k -ary n -cube Qnk, which is an appealing option as the underlying topology for modern parallel computing systems. Moreover, we propose an O(kn-1) algorithm for determining structural features of minimum edge sets whose cardinality is the conditional matroidal connectivity of Qnk. Simulation results are presented to verify our algorithm's correctness and further investigate the distribution pattern of edge sets subject to the restriction of partition matroid. We also present comparative analyses illustrating the superior edge fault tolerance of our findings in relation to prior research, which even exhibits an exponential enhancement when k ≥ 4. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

PECHA: Privacy-Preserving and Efficient Cross-Domain Handover Authentication for Heterogeneous Networks

引用

IEEE Transactions on Dependable and Secure Computing 2025年第3期22卷 2806-2822页

作者： Liu, Gao Li, Hao Wang, Ning Chen, Biwen Le, Junqing Liu, Yining Xiang, Tao Chongqing University College of Computer Science Chongqing400044 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325000 China

The sixth-generation (6G) mobile communication networks are perceived as large-scale heterogeneous networks. With their increased heterogenization and densification, it is crucial to guarantee the security and efficiency of user equipment's handovers between networks. However, existing cross-domain handover authentication schemes cannot ensure handover authentication efficiency and cannot balance privacy and system efficiency, which thus cannot be directly applied in heterogeneous networks. In this paper, we present PECHA, a privacy-preserving and efficient cross-domain handover authentication scheme for heterogeneous networks, which enables anonymous authentication on user equipment (UE) through the collision property of chameleon hash functions. PECHA ensures authentication efficiency by employing the interplanetary file system and blockchain to synchronize UE's authentication information to target networks in advance. The privacy and system efficiency are balanced by modeling the unlinkability of UE's new and old chameleon hash values and determining the update frequency of UE chameleon hash value. PECHA also achieves correctness, mutual authentication and key agreement, anonymity, unlinkability, conditional privacy, forward/backward secrecy, robustness, known randomness secrecy, key escrow freeness and rapid response, and resists against spoofing attacks, replay attacks and man-in-the-middle attacks. Comprehensive performance analysis, evaluation and comparisons show that PECHA is efficient with respect to both computation and communication. © 2004-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

DeepSwarm:towards swarm deep learning with bi-directional optimization of data acquisition and processing

引用

Frontiers of computer science 2025年第3期19卷 125-127页

作者： Sicong LIU Bin GUO Ziqi WANG Lehao WANG Zimu ZHOU Xiaochen LI Zhiwen YU School of Computer Science and Engineering Northwestern Polytechnical UniversityXi’an 710072China School of Data Science City University of Hong KongHong Kong 999077China College Of Computer Science And Technology Harbin Engineering UniversityHarbin 150001China

1 Introduction On-device deep learning(DL)on mobile and embedded IoT devices drives various applications[1]like robotics image recognition[2]and drone swarm classification[3].Efficient local data processing preserves privacy,enhances responsiveness,and saves ***,current ondevice DL relies on predefined patterns,leading to accuracy and efficiency *** is difficult to provide feedback on data processing performance during the data acquisition stage,as processing typically occurs after data acquisition.

关键词： drone swarm classification efficient local data processing data processing deep learning dl device deep learning bi directional optimization iot devices swarm deep learning

来源：评论

学校读者我要写书评

暂无评论

Stylometry-driven framework for Urdu intrinsic plagiarism detection: a comprehensive analysis using machine learning, deep learning, and large language models

引用

Neural Computing and Applications 2025年第9期37卷 6479-6513页

作者： Manzoor, Muhammad Faraz Farooq, Muhammad Shoaib Abid, Adnan Department of Computer Science University of Management and Technology Lahore Pakistan Department of Data Science Faculty of Computing and Information Technology University of the Punjab Lahore Pakistan

Detecting plagiarism in documents is a well-established task in natural language processing (NLP). Broadly, plagiarism detection is categorized into two types (1) intrinsic: to check the whole document or all the passages have been written by a single author;(2) extrinsic: where a suspicious document is compared with a given set of source documents to figure out sentences or phrases which appear in both documents. In the pursuit of advancing intrinsic plagiarism detection, this study addresses the critical challenge of intrinsic plagiarism detection in Urdu texts, a language with limited resources for comprehensive language models. Acknowledging the absence of sophisticated large language models (LLMs) tailored for Urdu language, this study explores the application of various machine learning, deep learning, and language models in a novel framework. A set of 43 stylometry features at six granularity levels was meticulously curated, capturing linguistic patterns indicative of plagiarism. The selected models include traditional machine learning approaches such as logistic regression, decision trees, SVM, KNN, Naive Bayes, gradient boosting and voting classifier, deep learning approaches: GRU, BiLSTM, CNN, LSTM, MLP, and large language models: BERT and GPT-2. This research systematically categorizes these features and evaluates their effectiveness, addressing the inherent challenges posed by the limited availability of Urdu-specific language models. Two distinct experiments were conducted to evaluate the impact of the proposed features on classification accuracy. In experiment one, the entire dataset was utilized for classification into intrinsic plagiarized and non-plagiarized documents. Experiment two categorized the dataset into three types based on topics: moral lessons, national celebrities, and national events. Both experiments are thoroughly evaluated through, a fivefold cross-validation analysis. The results show that the random forest classifier achieved an ex

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

FaVEL: Fact Validation Ensemble Learning 24th

FaVEL: Fact Validation Ensemble Learning

引用

24th International Conference on Knowledge Engineering and Knowledge Management, EKAW 2024

作者： Qudus, Umair Pekarou, Franck Lionel Tatkeu da Silva, Ana Alexandra Morim Röder, Michael Ngomo, Axel-Cyrille Ngonga Data Science Group Department of Computer Science Paderborn University Paderborn Germany

ISBN: (纸本)9783031777912

Validating assertions before adding them to a knowledge graph is an essential part of its creation and maintenance. Due to the sheer size of knowledge graphs, automatic fact-checking approaches have been developed. These approaches rely on reference knowledge to decide whether a given assertion is correct. Recent hybrid approaches achieve good results by including several knowledge sources. However, it is often impractical to provide a sheer quantity of textual knowledge or generate embedding models to leverage these hybrid approaches. We present FaVEL, an approach that uses algorithm selection and ensemble learning to amalgamate several existing fact-checking approaches that rely solely on a reference knowledge graph and, hence, use fewer resources than current hybrid approaches. For our evaluation, we create updated versions of two existing datasets and a new dataset dubbed FaVEL-DS. Our evaluation compares our approach to 15 fact-checking approaches—including the state-of-the-art approach HybridFC—on 3 datasets. Our results demonstrate that FaVEL outperforms all other approaches significantly by at least 0.04 in terms of the area under the ROC curve. Our source code, datasets, and evaluation results are open-source and can be found at https://***/dice-group/favel. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：