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

A universal approach to high-performance thermoelectric module design for power generation (vol 9, 101818, 2025)

JOULE 2025年第4期9卷

作者： Cheng, Jinxuan Xue, Wenhua Zhang, Tianyu Li, Xiaofang Zhu, Yichen Yin, Li Yao, Honghao Fu, Zixuan Wu, Longzhi Chen, Chen Zhao, Peng Ma, Xiaojing Jiang, Feng Wang, Xiaodong Li, Mingyu Mao, Jun Wang, Yumei Cao, Feng Zhang, Qian School of Materials Science and Engineering and Institute of Materials Genome & Big Data Harbin Institute of Technology Shenzhen 518055 China Beijing National Laboratory for Condensed Matter Physics Institute of Physics Chinese Academy of Science Beijing 100190 China School of Science Harbin Institute of Technology Shenzhen 518055 China Sauvage Laboratory for Smart Materials School of Materials Science and Engineering Harbin Institute of Technology Shenzhen 518055 China State Key Laboratory of Advanced Welding and Joining Harbin Institute of Technology Harbin 150001 China School of Physical Sciences Great Bay University Dongguan 523000 China Institute of Special Environments Physical Sciences Harbin Institute of Technology Shenzhen 518055 China Beijing Branch of Songshan Lake Materials Laboratory Dongguan 523808 China

Thermoelectric modules fabricated by traditional welding fall short of achieving optimal conversion efficiencies, primarily due to performance degradation of materials at high temperatures, severe elemental diffusion, and residual thermal stress at the interface. Transient liquid phase bonding enables the realization of joints with high-melting-point compounds at low bonding temperatures, providing a promising solution for achieving "low-temperature bonding and high-temperature service." Owing to the low eutectic point of the solder and high melting points of compounds, we optimize the design of a germanium-telluride-based module at 533 K, which is successfully applied at the hot-side temperature of 773 K. Attributed to high-performance materials and reliable joints, the module realizes a high conversion efficiency of ∼15.1% and remains stable throughout 150 h of service. By adopting the same approach, the low- (Bi2Te3) and high-temperature (half-Heusler) modules are assembled. We provide a promising and general route for the assembly of full-temperature-range thermoelectric devices.

关键词： transient liquid phase bonding thermoelectric module intermetallic compounds GeTe

来源：评论

学校读者我要写书评

暂无评论

IMPACT: Importance-Informed Prefetching and Caching for I/O-Bound DNN Training

引用

IEEE Transactions on Computers 2025年

作者： Chen, Weijian He, Shuibing Zhang, Ruidong Zhang, Xuechen Chen, Ping Yang, Siling Qu, Haoyang Zhan, Xuan Zhejiang University State Key Laboratory of Blockchain and Data Security China Institute of Blockchain and Data Security Hangzhou China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver School of Engineering and Computer Science VancouverWA98686 United States

Fetching large amounts of DNN training data from storage systems causes high I/O latency and GPU stalls. Importance sampling can reduce data processing on GPUs while maintaining model accuracy, but current frameworks lack a prefetching and caching layer to optimize data fetches and cache management based on sample importance. This leads to unnecessary fetches, poor cache hit ratios, and random I/Os. We present ImPACT, an importance-informed prefetching and caching system, to accelerate I/O-bound DNN training. First, we propose an importance-informed prefetching technique to reduce the prefetching of unimportant data. Then, we introduce an importance-aware caching layer, partitioned into two regions: H-cache and L-cache, which store samples of high importance and low importance respectively. Rather than using recency or frequency, we manage data items in H-cache according to their corresponding sample importance. When there is a cache miss in L-cache, we use sample substitutability and dynamic packaging to improve the cache hit ratio and reduce the number of random I/Os. Our experimental results show that ImPACT has a negligible impact on training accuracy while speeding up DNN training by up to 3.5× compared to state-of-the-art prefetching and caching systems. © 1968-2012 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Collision-Aware MPCC Integrated with Neural Augmentation for Quadrotor Trajectory Tracking

Collision-Aware MPCC Integrated with Neural Augmentation for...

引用

2025 IEEE International Conference on Mechatronics, ICM 2025

作者： Hu, Chuanqi Wang, Jin Chen, Yikai Chen, Yonghang Zheng, Zhi Meng, Jun Lu, Guodong Zhejiang University State Key Laboratory of Fluid Power and Mechatronic Systems Hangzhou310058 China Zhejiang University Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Hangzhou310058 China Robotics Research Center of Yuyao City Ningbo315400 China National Elite Institute of Engineering Chongqing University Chongqing401135 China School of Mechanical Engineering Zhejiang University Hangzhou310058 China College of Electrical Engineering Zhejiang University Hangzhou310027 China Center for Data Mining and Systems Biology College of Electrical Engineering Zhejiang University Hangzhou310027 China

ISBN: (纸本)9798331533892

This paper presents a trajectory tracking algorithm designed for autonomous quadrotors to navigate complex dy-namic environments that is resilient to collision disturbances. Since it combines Model Predictive Contouring Control (MPCC) with the capabilities of neural networks, our method is named MPCC Integrated with Neural Augmentation (MINA). By equip-ping the quadrotor with PVDF piezoelectric sensors, we achieve real-time perception of collision forces and utilize S4D-Conv Adaptive Net Architecture (SANA) for state computation, a network that integrates the advantages of S4D and convolutional kernels to enhance the accuracy of state predictions. We incorporate the predicted results into the MPCC framework to optimize the thrust output of the quadrotor for the next time step, ensuring precise trajectory tracking. Experimental validation demonstrates the reliability and effectiveness of our algorithm, providing an innovative solution for autonomous flight and trajectory tracking of quadrotors in complex dynamic environments. © 2025 IEEE.

关键词： Flight paths

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Based Framework for Privacy-Preserving Machine Learning 24th

An Encoder-Based Framework for Privacy-Preserving Machine L...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Wu, Jiayun Ren, Wei Zhang, Xianchao Zheng, Xianghan School of Computer Science China University of Geosciences Wuhan430074 China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China Ministry of Education Chengdu China Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province Jiaxing University Jiaxing China Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing University Jiaxing China College of Computer and Big Data Fuzhou University Fujian Fuzhou China School of Information and Intelligent Engineering Sanya College Hainan China

ISBN: (纸本)9789819615506

As a data-driven science, machine learning requires vast amounts of training data and computational resources. However, for highly privacy-sensitive data, it is crucial to protect the privacy of the data during both the training and utilization of machine learning models. In this paper, we propose a privacy-preserving machine learning approach using autoencoders and differential privacy mechanisms to safeguard data privacy while minimizing the impact on data availability. Specifically, we augment logistic regression and ResNet18 models with different architectures of autoencoders to perform data encryption? without compromising the machine learning tasks. Additionally, we employ differential privacy mechanisms to introduce gradient perturbations in the encoding part of the autoencoder, enhancing the algorithm’s security and further protecting data privacy. We also design the cosine similarity between the encoded and original data as a metric for evaluating data privacy, considering model performance, privacy budget, and data privacy collectively to balance data availability and privacy. Extensive experiments conducted on MNIST, CIFAR-10, PathMNIST, and BloodMNIST datasets demonstrate that for simple logistic regression models handling easily classifiable datasets, employing simple autoencoder structures can enhance classification accuracy, with significant performance impact after adding differential privacy. For ResNet18, utilizing convolutional autoencoders for data encryption generally has minimal impact on model classification performance and can even improve accuracy in most cases. Adding differential privacy has minor effects on model classification performance. Selecting appropriate model structures and privacy budgets for different usage scenarios can ensure both data availability and privacy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Exploring Heterogeneity and Uncertainty for Graph-based Cognitive Diagnosis Models in Intelligent Education 25

Exploring Heterogeneity and Uncertainty for Graph-based Cogn...

引用

Proceedings of the 31st ACM SIGKDD Conference on knowledge Discovery and data Mining V.1

作者： Pengyang Shao Yonghui Yang Chen Gao Lei Chen Kun Zhang Chenyi Zhuang Le Wu Yong Li Meng Wang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei Anhui China BNRist Tsinghua University Beijing China Department of Electronic Engineering BNRist Tsinghua University Beijing China Ant Group HangZhou Zhejiang China

ISBN: (纸本)9798400712456

Graph-based Cognitive Diagnosis (CD) has attracted much research interest due to its strong ability on inferring students' proficiency levels on knowledge concepts. While graph-based CD models have demonstrated remarkable performance, we contend that they still cannot achieve optimal performance due to the neglect of edge heterogeneity and uncertainty. Edges involve both correct and incorrect response logs, indicating heterogeneity. Meanwhile, a response log can have uncertain semantic meanings, e.g., a correct log can indicate true mastery or fortunate guessing, and a wrong log can indicate a lack of understanding or a careless mistake. In this paper, we propose an Informative Semantic-aware Graph-based Cognitive Diagnosis model (ISG-CD), which focuses on how to utilize the heterogeneous graph in CD and minimize effects of uncertain edges. Specifically, to explore heterogeneity, we propose a semantic-aware graph neural networks based CD model. To minimize effects of edge uncertainty, we propose an Informative Edge Differentiation layer from an information bottleneck perspective, which suggests keeping a minimal yet sufficient reliable graph for CD in an unsupervised way. We formulate this process as maximizing mutual information between the reliable graph and response logs, while minimizing mutual information between the reliable graph and the original graph. After that, we prove that mutual information maximization can be theoretically converted to the classic binary cross entropy loss function, while minimizing mutual information can be realized by the Hilbert-Schmidt Independence ***, we adopt an alternating training strategy for optimizing learnable parameters of both the semantic-aware graph neural networks based CD model and the edge differentiation layer. Extensive experiments on three real-world datasets have demonstrated the effectiveness of ISG-CD.

关键词： cognitive diagnosis

来源：评论

学校读者我要写书评

暂无评论

CoSIL: Software Issue Localization via LLM-Driven Code Repository Graph Searching

arXiv

引用

arXiv 2025年

作者： Jiang, Zhonghao Ren, Xiaoxue Yan, Meng Jiang, Wei Li, Yong Liu, Zhongxin The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Institute of Blockchain and Data Security Hangzhou China School of Big Data and Software Engineering Chongqing University Chongqing China Ant Group Hangzhou China

Large language models (LLMs) have significantly advanced autonomous software engineering, leading to a growing number of software engineering agents that assist developers in automatic program repair. Issue localization forms the basis for accurate patch generation. However, because of limitations caused by the context window length of LLMs, existing issue localization methods face challenges in balancing concise yet effective contexts and adequately comprehensive search spaces. In this paper, we introduce CoSIL, an LLM-driven, simple yet powerful function-level issue localization method without training or indexing. CoSIL reduces the search space through module call graphs, iteratively searches the function call graph to obtain relevant contexts, and uses context pruning to control the search direction and manage contexts effectively. Importantly, the call graph is dynamically constructed by the LLM during search, eliminating the need for pre-parsing. Experiment results demonstrate that CoSIL achieves a Top-1 localization success rate of 43% and 44.6% on SWE-bench Lite and SWE-bench Verified, using Qwen2.5-Coder-32B, respectively, outperforming existing methods by 8.6%–98.2%. When CoSIL is applied to guide the patch generation stage, the resolved rate further improves by 9.3%–31.5%. Copyright © 2025, The Authors. All rights reserved.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

Compressing Model with Few Class-Imbalance Samples: An Out-of-Distribution Expedition

arXiv

引用

arXiv 2025年

作者： Wu, Tian-Shuang Lyu, Shen-Huan Chen, Ning Qu, Zhihao Ye, Baoliu Key Laboratory of Water Big Data Technology Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

In recent years, as a compromise between privacy and performance, few-sample model compression has been widely adopted to deal with limited data resulting from privacy and security concerns. However, when the number of available samples is extremely limited, class imbalance becomes a common and tricky problem. Achieving an equal number of samples across all classes is often costly and impractical in real-world applications, and previous studies on few-sample model compression have mostly ignored this significant issue. Our experiments comprehensively demonstrate that class imbalance negatively affects the overall performance of few-sample model compression methods. To address this problem, we propose a novel and adaptive framework named OOD-Enhanced Few-Sample Model Compression (OE-FSMC). This framework integrates easily accessible out-of-distribution (OOD) data into both the compression and fine-tuning processes, effectively rebalancing the training distribution. We also incorporate a joint distillation loss and a regularization term to reduce the risk of the model overfitting to the OOD data. Extensive experiments on multiple benchmark datasets show that our framework can be seamlessly incorporated into existing few-sample model compression methods, effectively mitigating the accuracy degradation caused by class imbalance. Copyright © 2025, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Improving Multi-Label Contrastive Learning by Leveraging Label Distribution

arXiv

引用

arXiv 2025年

作者： Chen, Ning Lyu, Shen-Huan Wu, Tian-Shuang Wang, Yanyan Tang, Bin Key Laboratory of Water Big Data Technology of Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

In multi-label learning, leveraging contrastive learning to learn better representations faces a key challenge: selecting positive and negative samples and effectively utilizing label information. Previous studies selected positive and negative samples based on the overlap between labels and used them for label-wise loss balancing. However, these methods suffer from a complex selection process and fail to account for the varying importance of different labels. To address these problems, we propose a novel method that improves multi-label contrastive learning through label distribution. Specifically, when selecting positive and negative samples, we only need to consider whether there is an intersection between labels. To model the relationships between labels, we introduce two methods to recover label distributions from logical labels, based on Radial Basis Function (RBF) and contrastive loss, respectively. We evaluate our method on nine widely used multi-label datasets, including image and vector datasets. The results demonstrate that our method outperforms state-of-the-art methods in six evaluation metrics. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An Image Semantic Communication System Based on GAN and Relative Position-Encoding

引用

IEEE Communications Letters 2025年

作者： Zhang, Ziqi Tan, Weijie Li, Chunguo Guizhou University College of Big Data and Information Engineering Guiyang550025 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Ministry of Industry and Information Technology Laboratory of Cryptography Application Technology Innovation and Testing Verification Beijing100015 China Southeast University School of Information Science and Engineering Nanjing210096 China

In image semantic communication, the complex wireless channel environment leads to the loss of image details and performance degradation during transmission. To address this issue, we propose an image semantic communication system based on Generative Adversarial Networks (GAN) and Relative Position-Encoding (RPE), named GAN-RpeSC. Specifically, in the system design, we introduce the GAN network at the output of the semantic communication framework to enhance the image restoration. We integrate the RPE module into the Visual Transformer (ViT) module, adding the RPE module to its Multihead Self Attention (MHSA), so that the model can better capture the spatial location information of the image. Experimental results show that the proposed GAN-RpeSC has significant advantages in improving image transmission quality, with a 0.3 dB improvement in peak signal-to-noise ratio (PSNR) compared to the ViT module alone. © 1997-2012 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：