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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Power synchronization: taming massive diversified serverless functions under power constraints

引用

science China(Information sciences) 2025年第3期68卷 47-65页

作者： Du LIU Lu ZHANG Yechen XU Xinkai WANG Lingyu SUN Yifei PU Xiaofeng HOU Chao LI Minyi GUO Department of Computer Science and Engineering Shanghai Jiao Tong University AI Chip Center for Emerging Smart Systems The Hong Kong University of Science and Technology

Carbon neutrality has become an important design objective worldwide. However, the on-going shift to cloud-naive era does not necessarily mean energy efficiency. From the perspective of power management, co-hosted serverless functions are difficult to tame. They are lightweight, short-lived applications sensitive to power capping activities. In addition, they exhibit great individual and temporal variability, presenting idiosyncratic performance/power scaling goals that are often at odds with one another. To date, very few proposals exist in terms of tailored power management for serverless platforms. In this work, we introduce power synchronization, a novel yet generic mechanism for managing serverless functions in a power-efficient way. Our insight with power synchronization is that uniform application power behavior enables consistent and uncompromised function operation on shared host machines. We also propose PowerSync, a synchronization-based power management framework that ensures optimal efficiency based on a clear understanding of functions. Our evaluation shows that PowerSync can improve the energy efficiency of functions by up to 16% without performance loss compared to conventional power management strategies.

关键词： serverless computing variability energy efficiency power management power synchronization

来源：评论

学校读者我要写书评

暂无评论

FMCC-RT: a scalable and fine-grained all-reduce algorithm for large-scale SMP clusters

引用

science China(Information sciences) 2025年第5期68卷 362-379页

作者： Jintao PENG Jie LIU Jianbin FANG Min XIE Yi DAI Zhiquan LAI Bo YANG Chunye GONG Xinjun MAO Guo MAO Jie REN School of Computer Science and Technology National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology National Supercomputer Center in Tianjin School of Computer Science Shaanxi Normal University

All-reduce is a widely used communication technique for distributed and parallel applications typically implemented using either a tree-based or ring-based scheme. Each of these approaches has its own limitations: tree-based schemes struggle with efficiently exchanging large messages, while ring-based solutions assume constant communication throughput,an unrealistic expectation in modern network communication infrastructures. We present FMCC-RT, an all-reduce approach that combines the advantages of tree-and ring-based implementations while mitigating their drawbacks. FMCC-RT dynamically switches between tree and ring-based implementations depending on the size of the message being processed. It utilizes an analytical model to assess the impact of message sizes on the achieved throughput, enabling the derivation of optimal work partitioning parameters. Furthermore, FMCC-RT is designed with an Open MPI-compatible API, requiring no modification to user code. We evaluated FMCC-RT through micro-benchmarks and real-world application tests. Experimental results show that FMCC-RT outperforms state-of-the-art tree-and ring-based methods, achieving speedups of up to 5.6×.

关键词： all-reduce collective communication MPI scalability

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed Sparse Relative Similarity Learning

引用

ACM Transactions on Knowledge Discovery from Data 2025年第3期19卷 1-27页

作者： Yao, Dezhong Li, Sanmu Wang, Zhiwei Zhao, Peilin Wu, Gang Yu, Chen Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Tencent AI Lab Shenzhen China National Super Computing Center in Zhengzhou Zhengzhou University Zhengzhou China

Learning a good similarity measure for large-scale high-dimensional data is a crucial task in machine learning applications, yet it poses a significant challenge. Distributed minibatch Stochastic Gradient Descent (SGD) serves as an efficient optimization method in large-scale distributed training, allowing linear speedup in proportion to the number of workers. However, communication efficiency in distributed SGD requires a sufficiently large minibatch size, presenting two distinct challenges. Firstly, a large minibatch size leads to high memory usage and computational complexity during parallel training of high-dimensional models. Second, a larger batch size of data reduces the convergence rate. To overcome these challenges, we propose an Efficient Distributed Sparse Relative Similarity Learning (EDSRSL) framework. This framework integrates two strategies: local minibatch SGD and sparse relative similarity learning. By effectively reducing the number of updates through synchronous delay while maintaining a large batch size, we address the issue of high computational cost. Additionally, we incorporate sparse model learning into the training process, significantly reducing computational cost. This article also provides theoretical proof that the convergence rate does not decrease significantly with increasing batch size. Various experiments on six high-dimensional real-world datasets demonstrate the efficacy and efficiency of the proposed algorithms, with a communication cost reduction of up to 90.89% and a maximum wall time speedup of 5.66× compared to the baseline methods. © 2025 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Generative Image Steganography Based on Disentangled Attribute Feature Transformation and Invertible Mapping Rule

引用

computers, Materials & Continua 2025年第4期83卷 1149-1171页

作者： Xiang Zhang Shenyan Han Wenbin Huang Daoyong Fu School of Computer Science Nanjing University of Information Science and TechnologyNanjing210044China Engineering Research Center of Digital Forensics Nanjing University of Information Science and TechnologyMinistry of EducationNanjing210044China

Generative image steganography is a technique that directly generates stego images from secret *** traditional methods,it theoretically resists steganalysis because there is no cover ***,the existing generative image steganography methods generally have good steganography performance,but there is still potential room for enhancing both the quality of stego images and the accuracy of secret information ***,this paper proposes a generative image steganography algorithm based on attribute feature transformation and invertible mapping ***,the reference image is disentangled by a content and an attribute encoder to obtain content features and attribute features,***,a mean mapping rule is introduced to map the binary secret information into a noise vector,conforming to the distribution of attribute *** noise vector is input into the generator to produce the attribute transformed stego image with the content feature of the reference ***,we design an adversarial loss,a reconstruction loss,and an image diversity loss to train the proposed *** results demonstrate that the stego images generated by the proposed method are of high quality,with an average extraction accuracy of 99.4%for the hidden ***,since the stego image has a uniform distribution similar to the attribute-transformed image without secret information,it effectively resists both subjective and objective steganalysis.

关键词： Image information hiding generative information hiding disentangled attribute feature transformation invertible mapping rule steganalysis resistance

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Time Series Segmentation Network Based on Eddy Current Testing for Detecting Surface Metal Defects

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 528-538页

作者： Xiaorui Li Xiaojuan Ban Haoran Qiao Zhaolin Yuan Hong-Ning Dai Chao Yao Yu Guo Mohammad S.Obaidat George Q.Huang the School of Intelligence Science and Technology University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering the Key Laboratory of Intelligent Bionic Unmanned Systems and the Institute of Materials Intelligent Technology Liaoning Academy of Materials IEEE the Department of Computer Science Hong Kong Baptist University the School of Computer and Communication Engineering Key Laboratory of Advanced Materials and Devices for Post-Moore Chips Ministry of Education University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing the School of Computer and Communication Engineering University of Science and Technology Beijing the King Abdullah Ⅱ School of Information Technology The University of Jordan the Department of Computational Intelligence the School of Computing SRM University the School of Engineering The Amity University The Hong Kong Polytechnic University

In high-risk industrial environments like nuclear power plants, precise defect identification and localization are essential for maintaining production stability and safety. However, the complexity of such a harsh environment leads to significant variations in the shape and size of the defects. To address this challenge, we propose the multivariate time series segmentation network(MSSN), which adopts a multiscale convolutional network with multi-stage and depth-separable convolutions for efficient feature extraction through variable-length templates. To tackle the classification difficulty caused by structural signal variance, MSSN employs logarithmic normalization to adjust instance distributions. Furthermore, it integrates classification with smoothing loss functions to accurately identify defect segments amid similar structural and defect signal subsequences. Our algorithm evaluated on both the Mackey-Glass dataset and industrial dataset achieves over 95% localization and demonstrates the capture capability on the synthetic dataset. In a nuclear plant's heat transfer tube dataset, it captures 90% of defect instances with75% middle localization F1 score.

关键词： Eddy current testing nondestructive testing semantic segmentation time series analysis

来源：评论

学校读者我要写书评

暂无评论

Fusion of Time-Frequency Features in Contrastive Learning for Shipboard Wind Speed Correction

引用

Journal of Ocean University of China 2025年第2期24卷 377-386页

作者： SONG Jian HUANG Meng LI Xiang ZHANG Zhenqiang WANG Chunxiao ZHAO Zhigang Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250000China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250000China

Accurate wind speed measurements on maritime vessels are crucial for weather forecasting,sea state prediction,and safe ***,vessel motion and challenging environmental conditions often affect measurement *** address this issue,this study proposes an innovative framework for correcting and predicting shipborne wind *** integrating a main network with a momentum updating network,the proposed framework effectively extracts features from the time and frequency domains,thereby allowing for precise adjustments and predictions of shipborne wind speed *** using real sensor data collected at the Qingdao Oceanographic Institute demonstrates that the proposed method outperforms existing approaches in single-and multi-step predictions compared to existing methods,achieving higher accuracy in wind speed *** proposed innovative approach offers a promising direction for future validation in more realistic maritime onboard scenarios.

关键词： time series prediction wind speed correction comparative learning shipborne sensor

来源：评论

学校读者我要写书评

暂无评论

Single-Valued Neutrosophic Graph with Heptapartitioend Structure

引用

Neutrosophic Sets and Systems 2025年 80卷 728-748页

作者： Fathi, Hanaa Myvizhi, M. Abdelhafeez, Ahmed Abdellah, Mohamed Refaat Eassa, Mohamed Sawah, Mohamed S. Elbehiery, Hussam College of Information Technology Amman Arab University Amman Jordan KPR Institute of Engineering and Technology Tamilnadu Coimbatore India 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 The Department of Computer Science College of Information Technology Misr University for Science and Technology Cairo Egypt Department of Computer Science Faculty of Information Technology Ajloun National University P.O.43 Ajloun26810 Jordan

This study applies single-valued neutrosophic sets, which extend the frameworks of fuzzy and intuitionistic fuzzy sets, to graph theory. We introduce a new category of graphs called Single-Valued Heptapartitioned Neutrosophic Graphs (SVHNG) and investigate their characteristics through comprehensive proofs and illustrative examples. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioend Neutrosophic Set Neutrosophic Graph Neutrosophic Sets SVHN-Graph

来源：评论

学校读者我要写书评

暂无评论

PIAFGNN:Property Inference Attacks against Federated Graph Neural Networks

引用

computers, Materials & Continua 2025年第2期82卷 1857-1877页

作者： Jiewen Liu Bing Chen Baolu Xue Mengya Guo Yuntao Xu College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing321002China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing210023China

Federated Graph Neural Networks (FedGNNs) have achieved significant success in representation learning for graph data, enabling collaborative training among multiple parties without sharing their raw graph data and solving the data isolation problem faced by centralized GNNs in data-sensitive scenarios. Despite the plethora of prior work on inference attacks against centralized GNNs, the vulnerability of FedGNNs to inference attacks has not yet been widely explored. It is still unclear whether the privacy leakage risks of centralized GNNs will also be introduced in FedGNNs. To bridge this gap, we present PIAFGNN, the first property inference attack (PIA) against FedGNNs. Compared with prior works on centralized GNNs, in PIAFGNN, the attacker can only obtain the global embedding gradient distributed by the central server. The attacker converts the task of stealing the target user’s local embeddings into a regression problem, using a regression model to generate the target graph node embeddings. By training shadow models and property classifiers, the attacker can infer the basic property information within the target graph that is of interest. Experiments on three benchmark graph datasets demonstrate that PIAFGNN achieves attack accuracy of over 70% in most cases, even approaching the attack accuracy of inference attacks against centralized GNNs in some instances, which is much higher than the attack accuracy of the random guessing method. Furthermore, we observe that common defense mechanisms cannot mitigate our attack without affecting the model’s performance on mainly classification tasks.

关键词： Federated graph neural networks GNNs privacy leakage regression model property inference attacks embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：