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

arXiv 2025年

作者： Wu, Ruixin Li, Zihan Wang, Jin Xu, Xiangyu Yu, Huan Zheng, Zhi Huang, Kaixiang Lu, Guodong The State Key Laboratory of Fluid Power and Mechatronic Systems School of Mechanical Engineering Zhejiang University Hangzhou310058 China Zhejiang Key Laboratory of Industrial Big Data and Robot Intelligent Systems Zhejiang University Hangzhou310058 China Robotics Research Center of Yuyao City Ningbo315400 China State Key Laboratory of Robotics and Systems Department of Mechatronics Engineering Harbin Institute of Technology Harbin150001 China

Millimeter-wave (mmWave) radar has attracted significant attention in robotics and autonomous driving. However, despite the perception stability in harsh environments, the point cloud generated by mmWave radar is relatively sparse while containing significant noise, which limits its further development. Traditional mmWave radar enhancement approaches often struggle to leverage the effectiveness of diffusion models in super-resolution, largely due to the unnatural range-azimuth heatmap (RAH) or bird’s eye view (BEV) representation. To overcome this limitation, we propose a novel method that pioneers the application of fusing range images with image diffusion models, achieving accurate and dense mmWave radar point clouds that are similar to LiDAR. Benefitting from the projection that aligns with human observation, the range image representation of mmWave radar is close to natural images, allowing the knowledge from pre-trained image diffusion models to be effectively transferred, significantly improving the overall performance. Extensive evaluations on both public datasets and self-constructed datasets demonstrate that our approach provides substantial improvements, establishing a new state-of-the-art performance in generating truly three-dimensional LiDAR-like point clouds via mmWave radar. Copyright © 2025, The Authors. All rights reserved.

关键词： Radar imaging

来源：评论

学校读者我要写书评

暂无评论

FMDPgram: An Improvement of FMD for Rotating Machinery Fault Diagnosis

引用

IEEE Transactions on Industrial Informatics 2025年

作者： Li, Hua Wang, Tianyang Zhang, Feibin Chu, Fulei Guizhou University State Key Laboratory of Public Big Data Guiyang 550025 China Tsinghua University Department of Mechanical Engineering Beijing 100084 China

Recently, feature mode decomposition (FMD) has been proposed and has demonstrated robust performance in the application of rotating machinery fault diagnosis. However, FMD does not have parameter adaptability, and its influencing parameters (i.e., segment number, mode number and filter length) need to be defined in advance. Inspired by the decomposition mode of wavelet packet transform, this article cleverly proposes a binary decomposition structure of FMD to form the concept of FMD packet (FMDP). Furthermore, the tiling structure of FMDP is constructed, thus forming the FMDPgram. In FMDPgram, the frequency band of the raw signal is evenly divided into 2 segments, and each FMD generates two submode components (SMCs), thus simplifying the hyperparameter optimization into a single-parameter optimization. Additionally, an indicator called narrowband peak-to-average ratio (NPAR) is proposed for optimal SMC positioning, and which is displayed in the FMDPgram tile map. First, performing FMDPgram with NPAR on the raw signal. Then, the optimal SMC is located based on the NPAR in the FMDPgram tile map. Finally, the envelope power spectrum of the optimal SMC is calculated to characterize the fault characteristic information. FMDPgram is tested on simulated and experimental data, and compared with FMD, spectral kurtosis, VMD and improved Kurtogram to evaluate its performance in rolling bearing diagnosis under low signal-to-noise ratio and non-Gaussian interference. © 2005-2012 IEEE.

关键词： Fault diagnosis feature mode decomposition (FMD) FMD packet (FMDP) FMDPgram main submode component narrowband peak-to-average ratio (NPAR)

来源：评论

学校读者我要写书评

暂无评论

Global Feature Enhancing and Fusion Framework for Strain Gauge Status Recognition 25

Global Feature Enhancing and Fusion Framework for Strain Gau...

引用

Companion Proceedings of the ACM on Web Conference 2025

作者： Xu Zhang Peng Wang Chen Wang Zhe Xu Xiaohua Nie Wei Wang Shanghai Key Laboratory of Data Science School of Computer Science and Technology Fudan University Shang Hai China Shanghai Key Laboratory of Data Science School of Computer Science and Technology Fudan University Shanghai China National Engineering Research Center for Big Data Software Tsinghua University Beijing China School of Software Tsinghua University Beijing China National Key Laboratory of Strength and Structural Integrity Aircraft Strength Research Institute of China Xi'an Shaanxi China

ISBN: (纸本)9798400713316

Strain Gauge Status (SGS) recognition is crucial in the field of intelligent manufacturing based on the Internet of Things, as accurate identification helps timely detection of failed mechanical components, avoiding accidents. The loading and unloading sequences generated by strain gauges can be identified through time series classification (TSC) algorithms. Recently, deep learning models, e.g., convolutional neural networks (CNNs) have shown remarkable success in the TSC task, as they can extract discriminative local features from the subsequences to identify the time series. However, we observe only the local features may not be sufficient for expressing the time series, especially when the local sub-sequences between different time series are very similar, e.g., SGS data of aircraft wings in static strength experiments. Nevertheless, CNNs suffer from the limitation in extracting global features due to the nature of convolution operations. For extracting global features to more comprehensively represent the SGS time series, we propose two insights: (i) Constructing global features through feature engineering. (ii) Learning high-order relationships between local features to capture global features. To realize and utilize them, we propose a hypergraph-based global feature learning and fusion framework, which learns and fuses global features for semantic consistency to enhance the representation of SGS time series, thereby improving recognition accuracy. Our method designs are validated on industrial SGS and public UCR datasets, showing better generalization for unseen data in SGS recognition.

关键词： deep learning models

来源：评论

学校读者我要写书评

暂无评论

DFF: Decision-Focused Fine-tuning for Smarter Predict-then-Optimize with Limited data

arXiv

引用

arXiv 2025年

作者： Yang, Jiaqi Liang, Enming Su, Zicheng Zou, Zhichao Zhen, Peng Guo, Jiecheng Ma, Wanjing An, Kun The Key Laboratory of Road and Traffic Engineering of the Ministry of Education Tongji University China Department of Data Science City University of Hong Kong Hong Kong Didi Chuxing Beijing China

Decision-focused learning (DFL) offers an end-to-end approach to the predict-then-optimize (PO) framework by training predictive models directly on decision loss (DL), enhancing decision-making performance within PO contexts. However, the implementation of DFL poses distinct challenges. Primarily, DL can result in deviation from the physical significance of the predictions under limited data. Additionally, some predictive models are non-differentiable or black-box, which cannot be adjusted using gradient-based methods. To tackle the above challenges, we propose a novel framework, Decision-Focused Fine-tuning (DFF), which embeds the DFL module into the PO pipeline via a novel bias correction module. DFF is formulated as a constrained optimization problem that maintains the proximity of the DL-enhanced model to the original predictive model within a defined trust region. We theoretically prove that DFF strictly confines prediction bias within a predetermined upper bound, even with limited datasets, thereby substantially reducing prediction shifts caused by DL under limited data. Furthermore, the bias correction module can be integrated into diverse predictive models, enhancing adaptability to a broad range of PO tasks. Extensive evaluations on synthetic and real-world datasets, including network flow, portfolio optimization, and resource allocation problems with different predictive models, demonstrate that DFF not only improves decision performance but also adheres to fine-tuning constraints, showcasing robust adaptability across various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Li, Mengyu Pang, Wei Giunchiglia, Fausto Huang, Lan Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University China Mathematical and Computer Sciences Heriot-Watt University United Kingdom University of Trento Italy

Short text classification, as a research subtopic in natural language processing, is more challenging due to its semantic sparsity and insufficient labeled samples in practical scenarios. We propose a novel model named MI-DELIGHT for short text classification in this work. Specifically, it first performs multi-source information (i.e., statistical information, linguistic information, and factual information) exploration to alleviate the sparsity issues. Then, the graph learning approach is adopted to learn the representation of short texts, which are presented in graph forms. Moreover, we introduce a dual-level (i.e., instance-level and cluster-level) contrastive learning auxiliary task to effectively capture different-grained contrastive information within massive unlabeled data. Meanwhile, previous models merely perform the main task and auxiliary tasks in parallel, without considering the relationship among tasks. Therefore, we introduce a hierarchical architecture to explicitly model the correlations between tasks. We conduct extensive experiments across various benchmark datasets, demonstrating that MI-DELIGHT significantly surpasses previous competitive models. It even outperforms popular large language models on several datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

THC-DL: Three-Party Homomorphic Computing Delegation Learning for Secure Optimization

引用

IEEE Internet of Things Journal 2025年

作者： Yang, Ze Tian, Youliang Xiong, Jinbo Niu, Kun Li, Mengqian Zhang, Xinyu Ma, Jianfeng Guizhou University Guizhou Provincial Key Laboratory of Cryptography and Blockchain Technology College of Computer Science and Technology Guiyang550025 China Guizhou University College of Big Data and Information Engineering Guiyang550025 China Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou350117 China Xidian University State Key Laboratory of Integrated Services Network Xi’an710071 China Xidian University State Key Laboratory of Integrated Services Network School of Cyber Engineering Xi’an710071 China

Delegation Learning(DL) flourishes data sharing, enabling agents to delegate data to the cloud for model training. To preserve privacy, homomorphic encryption (HE) offers an effective solution for privacy-preserving machine learning (PPML) in delegation learning, yet faces critical challenges in functionality (non-linear activation support), practicality (ciphertext blow-up from iterative computations), and security (data leakage risks caused by public knowledge of the mathematical principles applied in model training). To tackle these challenges, we propose THC-DL, a three-party HE framework addressing these challenges holistically for the first time. We elaborately design the ciphertext secure comparison (DL-CSC) protocol to satisfy secure comparison with private inputs, enabling efficient non-linear operations with O(1) communication complexity that reduces runtime to 12.5% of the DGK (Dolev-Greensmith-Kent protocol, the well-known comparison protocol). Second, we construct a Truncation-Mapping (Tru-Map) scheme, a mechanism that transforms input data by truncating and mapping it into a domain that facilitates more efficient processing, and the addition of truncated mapped data to resolve ciphertext blow-up by adaptively scaling ciphertexts during iterative training, ensuring correctness. Third, we formalize data leakage risks in HE-based quadratic convex optimization (standard in ML) and apply THC-DL to construct a secure optimization scheme. Theoretical analysis confirms THC-DL’s resilience against input recovery attacks, even when adversaries exploit public model parameters. Experiments on a real-world platform validate DL-CSC’s efficiency and scalability while reducing the computational complexity and communication complexity from O(n) to O(1) where n denotes the length of the input bits. © 2014 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Any-Angle Routing Algorithm for Microfluidic Biochips Driven by Flow Path

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 978-988页

作者： Youlin, Pan Shuai, Guo Xing, Huang Genggeng, Liu College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

Continuous-flow microfluidic biochips (CFMBs) have become a hot research topic in recent years due to their ability to perform biochemical assays automatically and efficiently. For the first time, PathDriver+ takes the requirements of the actual fluid transportation into account in the design process of CFMBs and implements the actual fluid transport and removal, and plans separate flow paths for each transport task, which have been neglected in previous work. However, PathDriver+ does not take full advantage of the flexibility of CFMBs routing because it only considers the optimization of flow channel length for the global routing in the mesh model, except for the detailed routing. In addition, PathDriver+ only considers the X architecture, while the existing work shows that the any-angle routing can utilize the routing resources more efficiently and shorten the flow channel length. To address the above issues, we propose a flow path-driven arbitrary angle routing algorithm, which can improve the utilization of routing resources and reduce the flow channel length while considering the actual fluid transportation requirements. The proposed algorithm constructs a search graph based on constrained Delaunay triangulation to improve the search efficiency of routing solutions while ensuring the routing quality. Then, a Dijkstra-based flow path routing method is used on the constructed search graph to generate a routing result with a short channel length quickly. In addition, in the routing process, channel reuse strategy and intersection optimization strategy are proposed for the flow path reuse and intersection number optimization problems, respectively, to further improve the quality of routing results. The experimental results show that compared with the latest work PathDriver+, the length of channels, the number of ports used, and the number of channel intersections are significantly reduced by 33.21%, 11.04%, and 44.79%, respectively, and the channel reuse rate is i

关键词： High level synthesis

来源：评论

学校读者我要写书评

暂无评论

Joint Multi-Scale Contextual and Noise Suppression for Group Emotion Recognition

Joint Multi-Scale Contextual and Noise Suppression for Group...

引用

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

作者： Wangdong Guo Qing Zhu Qirong Mao School of Computer Science and Communication Engineering Jiangsu University Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Group Emotion Recognition (GER) seeks to identify emotional states within multi-person groups. The complexity of the environment and the reliance on a single group emotion label often result in noisy individuals with inconsistent emotional expressions, hampering accurate emotion classification. Mainstream GER networks attempt to downweight noisy individuals, but when their numbers are high and over-relying on a single group label, the negative impact of noise on individuals remains significant, further complicating classification and diminishing accuracy. To address these limitations, we propose the Multi-Scale Contextual and Noise Suppression Model (MCon-NSM), a novel framework that enhances GER by capturing fine-grained interaction contexts and collaboratively suppressing noise at both the individual and group label levels. Extensive experiments on the GAF series datasets demonstrate that our method achieves results comparable to state-of-the-art techniques, validating its effectiveness in mitigating noise in GER.

关键词： Emotion recognition Analytical models Accuracy Noise Noise reduction Speech recognition Complexity theory Noise measurement Speech processing Context modeling

来源：评论

学校读者我要写书评

暂无评论

Low-loss Ge-As-S glass fiber for high-power Er:YAG laser transmission and ablation

引用

Optics Express 2025年第10期33卷 20370-20382页

作者： Liang, Xiaolin Wang, Yuyang Jiao, Kai Wang, Xiange Xu, Weisheng Bai, Shengchuang Zhao, Zheming Wang, Rongping Li, Pingxue Shiryaev, Vladimir Wang, Xunsi Laboratory of Infrared Materials and Devices Advanced Technology Research Institute Ningbo University Ningbo 315211 China Zhejiang Key Laboratory of Photoelectric Materials and Devices Ningbo 315211 China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo 315211 China College of Information and Intelligence Engineering Zhejiang Wanli University Ningbo 315000 China College of Data Science Jiaxing University 314001 China Faculty of Materials and Manufacturing Beijing University of Technology Beijing 100124 China Devyatykh Institute of Chemistry of High-Purity Substances Russian Academy of Sciences 49 Tropinin Str. Nizhny Novgorod 603951 Russian Federation

Ge-based chalcogenide glass fibers exhibit a high damage threshold and exceptional water stability, making them an ideal material for transmitting Er: YAG laser beams. However, the problem of particle scattering in the current glass poses formidable challenge to the transmission of high-power Er: YAG lasers. In this study, we introduce what we believe to be a novel approach to mitigate internal scattering by employing a micron-scale filter in combination with a multi-stage dynamic distillation process, effectively extending the purity limits of Ge-CHG fibers. The loss of Ge-As-S glass has achieved a record of 0.1 dB/m by reducing the internal particle scattering. In addition, the Ge-As-S optical fiber prepared by the isolation extrusion method also exhibits excellent performance in the transmission of Er: YAG laser. The Ge-As-S fiber rod with a core diameter of approximately 750 µm can sustain a laser power of 13.43 W at wavelength of 2.94 µm, i.e., energy density of 684 J/cm² under atmosphere surrounding. To enhance flexibility, the fiber rod was tapered to gradually reduce its diameter, achieving a core diameter of 300 µm at the narrow end. The flexible Ge-As-S fiber achieved a maximum power output of 4.1 W with an energy density of 580 J/cm². To our knowledge, this is the first instance of a chalcogenide fiber handling Er: YAG laser power exceeding 5 W flexibly. Finally, we demonstrated the capability of the flexible optical fiber to transmit Er: YAG laser energy for biological tissue ablation, achieving a cutting depth of 3 mm. These results highlight the potential of Ge-As-S fibers as a promising platform for high-power mid-infrared laser transmission, with significant applications in minimally invasive surgery procedures. © 2025 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement.

关键词： Chalcogenide glass High power fiber lasers High power lasers Laser beams Laser energy Single mode fibers

来源：评论

学校读者我要写书评

暂无评论

Generative Classifier for Domain Generalization

arXiv

引用

arXiv 2025年

作者： Long, Shaocong Zhou, Qianyu Li, Xiangtai Ying, Chenhao Tong, Yunhai Ma, Lizhuang Luo, Yuan Tao, Dacheng Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Nanyang Technological University Singapore Peking University Beijing China

Domain generalization (DG) aims to improve the generalizability of computer vision models toward distribution shifts. The mainstream DG methods predominantly focus on learning domain invariance across domains, however, such methods overlook the untapped potential inherent in domain-specific information. While the prevailing practice of discriminative linear classifier has been tailored to domain-invariant features, it struggles when confronted with diverse domain-specific information, e.g., intra-class shifts, that exhibits multi-modality. To address these issues, we explore the theoretical implications of relying on domain-invariant features, revealing the crucial role of domain-specific information in mitigating the target risk for DG. Drawing from these insights, we propose Generative Classifier-driven Domain Generalization (GCDG), introducing a generative paradigm for the DG classifier based on Gaussian Mixture Models (GMMs) for each class across domains. GCDG consists of three key modules: Heterogeneity Learning Classifier (HLC), Spurious Correlation Blocking (SCB), and Diverse Component Balancing (DCB). Concretely, HLC attempts to model the feature distributions and thereby capture valuable domain-specific information via GMMs. SCB identifies the neural units containing spurious correlations and perturbs them, mitigating the risk of HLC learning irrelevant spurious patterns. Meanwhile, DCB ensures a balanced contribution of components within HLC, preventing the underestimation or neglect of critical components. In this way, GCDG excels in capturing the nuances of domain-specific information characterized by diverse distributions. GCDG demonstrates the potential to reduce the target risk and encourage flat minima, improving the model’s generalizability. Extensive experiments show GCDG’s comparable performance on five DG benchmarks and one face anti-spoofing dataset, seamlessly integrating into existing DG methods with consistent improvements. Code will be avail

关键词： Discriminant analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：