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

Data-Driven Digital Adaptive Timing Mismatch Calibration for Sub-Nyquist Wideband Sampling

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Ma, Yuan Zheng, Yiling Zhang, Xingjian Liao, Bin Shenzhen University State Key Laboratory of Radio Frequency Heterogeneous Integration Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen518060 China Pengcheng Laboratory Shenzhen518055 China Shenzhen University College of Electronic and Information Engineering Shenzhen518060 China Harbin Institute of Technology Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology Shenzhen518055 China Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen518060 China State Key Laboratory of Radio Frequency Heterogeneous Integration Shenzhen518060 China Fudan University Institute of Space Internet Shanghai China

The employment of sub-Nyquist sampling enables the adaptation to the ever-increasing bandwidth demands of wireless communication systems. Multicoset sampling is a nonuniform sub-Nyquist sampling technique that can be realized by using a multi-channel architecture. Nevertheless, the performance of multicoset sampling is significantly affected by timing mismatches among sub-ADCs. Traditional analog calibration scheme mitigates timing mismatch errors by adjusting the sampling clock in the front-end, but its performance is suboptimal due to the difficulty in selecting an appropriate initial step size and the sequential calibration process. In this paper, a data-driven digital adaptive timing mismatch calibration approach is proposed that uses real-time measurement data only to calculate calibration parameters without changing hardware circuits, making it effective for tracking variations in mismatches among multiple channels. Based on the nonlinear relationship between the timing mismatches and the normalized mean squared error of the output spectrum, the proposed data-driven calibration scheme jointly computes calibration parameters among multiple channels in parallel through a series of dynamic linearization data models with a time-varying pseudo-partial derivative parameter estimation procedure, and then adaptively adjusts the sampling matrix in the reconstruction to correct unwanted distortions in the output spectrum. To further improve the calibration performance, particle swarm optimization algorithm is exploited to generate parameter vectors used in the proposed data-driven calibration scheme. Numerical analyses indicate that the proposed data-driven digital calibration scheme can eliminate timing mismatches with fewer calibration iterations and enhanced accuracy. © 2015 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Analysis of Schema Formation in Genetic Algorithms: A Review 16th

Analysis of Schema Formation in Genetic Algorithms: A Review

引用

16th International Conference on Genetic and Evolutionary Computing, ICGEC 2024

作者： Zhang, Tiancong Chu, Shu-Chuan Weng, Shaowei Dao, Thi-Kien Nguyen, Trong-The School of Computing and Information Science Fuzhou Institute of Technology Fuzhou350506 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qing-Dao266590 China University of Information Technology Ho Chi Minh City700000 Viet Nam

ISBN: (纸本)9789819615346

Genetic algorithms (GAs) are a powerful class of optimization techniques inspired by the principles of natural selection and genetics. One of the theoretical cornerstones of GAs is schema theory, which provides a framework for understanding how building blocks of solutions, known as schemas, are propagated and combined through generations. This review paper aims to provide a comprehensive theoretical analysis of schema formation in genetic algorithms. It delves into the foundational principles of schema theory, including the schema theorem and its implications for the efficiency and behavior of GAs. The paper also explores advanced topics such as schema disruption mechanisms, the impact of multimodal and epistatic fitness landscapes, and the integration of schema theory with hybrid approaches. Additionally, practical implications and real-world applications of schema theory are discussed through case studies and best practices. By elucidating the mechanisms of schema formation and their influence on genetic algorithm performance, this review seeks to offer valuable insights and directions for future research. Ultimately, this theoretical exploration aims to bridge the gap between abstract concepts and practical application, contributing to the advancement of genetic algorithms as robust optimization tools. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

BEVUDA++: Geometric-Aware Unsupervised Domain Adaptation for Multi-View 3D Object Detection

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年第5期35卷 5109-5122页

作者： Zhang, Rongyu Liu, Jiaming Li, Xiaoqi Chi, Xiaowei Wang, Dan Du, Li Du, Yuan Zhang, Shanghang Nanjing University School of Electronic Science and Engineering Nanjing210093 China The Hong Kong Polytechnic University Department of Computing Hung Hom Hong Kong Peking University National Key Laboratory for Multimedia Information Processing School of Computer Science Beijing100871 China The Hong Kong University of Science and Technology Academy of Interdisciplinary Studies Hung Hom Hong Kong

Vision-centric Bird’s Eye View (BEV) perception holds considerable promise for autonomous driving. Recent studies have prioritized efficiency or accuracy enhancements, yet the issue of domain shift has been overlooked, leading to substantial performance degradation upon transfer. We identify major domain gaps in real-world cross-domain scenarios and initiate the first effort to address the Domain Adaptation (DA) challenge in multi-view 3D object detection for BEV perception. Given the complexity of BEV perception approaches with their multiple components, domain shift accumulation across multi-geometric spaces (e.g., 2D, 3D Voxel, BEV) poses a significant challenge for BEV domain adaptation. In this paper, we introduce an innovative geometric-aware teacher-student framework, BEVUDA++, to diminish this issue, comprising a Reliable Depth Teacher (RDT) and a Geometric Consistent Student (GCS) model. Specifically, RDT effectively blends target LiDAR with dependable depth predictions to generate depth-aware information based on uncertainty estimation, enhancing the extraction of Voxel and BEV features that are essential for understanding the target domain. To collaboratively reduce the domain shift, GCS maps features from multiple spaces into a unified geometric embedding space, thereby narrowing the gap in data distribution between the two domains. Additionally, we introduce a novel Uncertainty-guided Exponential Moving Average (UEMA) to further reduce error accumulation due to domain shifts informed by previously obtained uncertainty guidance. To demonstrate the superiority of our proposed method, we execute comprehensive experiments in four cross-domain scenarios, securing state-of-the-art performance in BEV 3D object detection tasks, e.g., 12.9% NDS and 9.5% mAP enhancement on Day-Night adaptation. © 1991-2012 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

LSU-NET: Lightweight Automatic Organs Segmentation Network for Medical Images

LSU-NET: Lightweight Automatic Organs Segmentation Network f...

引用

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

作者： Yujie Ding Shenghua Teng Zuoyong Li Xiao Chen College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Minjiang University Fuzhou China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

UNet and its variants have widespread applications in medical image segmentation. However, the substantial number of parameters and computational complexity of these models make them less suitable for use in clinical settings with limited computational resources. To address this limitation, we propose a novel Lightweight Shift U-Net (LSU-Net). We integrate the Light Conv Block and the Tokenized Shift Block in a lightweight manner, combining them with a dynamic weight multi-loss design for efficient dynamic weight allocation. The Light Conv Block effectively captures features with a low parameter count by combining standard convolutions with depthwise separable convolutions. The Tokenized Shift Block optimizes feature representation by shifting and capturing deep features through a combination of the Spatial Shift Block and depthwise separable convolutions. Dynamic adjustment of the loss weights at each layer approaches the optimal solution and enhances training stability. We validated LSU-Net on the UWMGI and MSD Colon datasets, and experimental results demonstrate that LSU-Net outperforms most state-of-the-art segmentation architectures.

关键词： Training Image segmentation Convolution Dynamic scheduling Stability analysis Resource management Speech processing Standards Monitoring Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Evolving Effective Drug Therapies with Multi-objective Genetic Algorithm 16th

Evolving Effective Drug Therapies with Multi-objective Genet...

引用

16th International Conference on Genetic and Evolutionary Computing, ICGEC 2024

作者： Zhang, Tiancong Weng, Shaowei Chu, Shu-Chuan Nguyen, Trong-The Dao, Thi-Kien School of Computing and Information Science Fuzhou Institute of Technology Fuzhou350506 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qing-dao266590 China University of Information Technology Ho Chi Minh City700000 Viet Nam

ISBN: (纸本)9789819615346

The development of effective drug therapies is a complex and multifaceted problem involving various biological, chemical, and computational challenges. Traditional drug development methods are often time-consuming and costly, necessitating innovative approaches. Multi-objective genetic algorithms (MOGAs) have emerged as a powerful tool for optimizing drug design by simultaneously considering multiple conflicting objectives, such as efficacy, safety, and cost. This paper reviews the application of MOGAs in drug discovery, highlighting their principles, advantages, and case studies, and discussing future directions in the field. Enhancing MOGAs in drug discovery are also outlined, emphasizing the integration with machine learning, advancements in computational infrastructure, and the potential for personalized medicine. The paper concludes by affirming the significant promise of MOGAs in accelerating the development of safe and effective drug therapies, thereby addressing critical needs in modern pharmacology. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Drug discovery

来源：评论

学校读者我要写书评

暂无评论

SPRGAN: Streamlined Progressive Refinement for Adversarial Point Cloud Video Upsampling

SPRGAN: Streamlined Progressive Refinement for Adversarial P...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Zhang, Zhiyong Liu, Ruyu Wang, Chaochao Zhang, Xianchao Zhang, Jianhua Liu, Xiufeng School of Computer Science and Engineering Tianjin University of Technology Tianjin China School of Information Science and Technology Hangzhou Normal University Hangzhou China Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems Jiaxing University Zhejiang China Department of Technology Management and Economics Technical University of Denmark Lyngby Denmark

ISBN: (纸本)9798350368741

Getting dense, uniform, time-series point cloud data is critical for effective rendering. However, due to the limited computational power of edge devices, existing methods cannot achieve real-time results, which affects the visual quality of the consumer experience. To effectively address this issue, this paper presents a self-supervised adversarial upsampling method for point cloud video streams called SPR-GAN. In the generator, we design the Temporal Iterative Graph module to learn local features for each frame and captures long-range spatial information using three iterations of graph convolution operations. Then the Contextual Temporal Fusion module is developed to merge information between different frames, synthesizing temporal information and enriching the dynamic feature representation of the point cloud. Meanwhile, in the discriminator, we introduce the Efficient Shape module. Through dynamic graph convolution operations and stacked learning, it significantly improves the resolution efficiency of global shape information in point clouds. The final experiments show that the proposed method exhibits high practicality and superiority. The model achieves a good result on both the D-FAUST and DeformingThing4D-Animals datasets. © 2025 IEEE.

关键词： point cloud sequence Point cloud upsampling self-supervised temporal aggregation

来源：评论

学校读者我要写书评

暂无评论

ReHyGen: Relational hypergraph enhanced generative aspect sentiment triplet extraction

引用

Neurocomputing 2025年 639卷

作者： Lin, Zehong Chen, Weibo Xue, Yun Li, Fenghuan South China Normal University Guangdong Foshan528225 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Guangdong Shenzhen518060 China School of Computer Science and Technology Guangdong University of Technology Guangdong Guangzhou510006 China

Aspect Sentiment Triplet Extraction (ASTE) has emerged as a pivotal task in sentiment analysis, focusing on extracting the aspect terms along with the corresponding opinion terms and the expressed sentiments. Recently, generative models have achieved significant success in ASTE task. However, existing generative approaches fail to further model the specific relations within the context for ASTE at the encoding phase, making it difficult to establish the nuanced connections between aspect and opinion terms. Additionally, these approaches rely on simple structured templates at the decoding phase to pair aspect terms with opinion terms, which fails to provide effective relation information for the decoding process. To address the aforementioned issues, we propose ReHyGen, a novel relational hypergraph enhanced framework designed to enhance the relational modeling capabilities of generative ASTE models during both the encoding and decoding phases. Specifically, ReHyGen comprises two core components: the Relational Hypergraph Enhanced Module (RHEM) and the Relational Prompt Module (RPM). RHEM leverages the hypergraph attention network and auxiliary relation classification to capture high-order word interactions and boundary-sensitive word pair relations. RPM incorporates relational information into the decoding phase by providing relation-aware prompts, guiding the generation of more accurate target sequences. Extensive experiments on benchmark datasets demonstrate that our proposed framework significantly improve the performance of generative ASTE models. © 2025

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

An Efficient Threshold Ring Signature from G+G Identification Protocol 2nd

An Efficient Threshold Ring Signature from G+G Identificati...

引用

2nd International Conference on Data Security and Privacy Protection, DSPP 2024

作者： Wu, Chunhui Jiang, Siwei Zhang, Fangguo Du, Yusong Lin, Qiping School of Internet Finance and Information Engineering Guangdong University of Finance Guangzhou510521 China School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China Guangdong Provincial Key Laboratory of Information Security Technology Guangzhou510006 China Xingtang Telecommunication Technology Co. Ltd. Beijing100191 China

ISBN: (纸本)9789819785391

Threshold ring signature confirms that t signers are participating in the signature and keep them anonymous. It is a generalization of ring signature, and has many important applications such as whistleblower, e-voting and blockchain et al. In this paper, an improved lattice-based ring signature and threshold ring signature scheme from Fiat-Shamir heuristic are proposed. The schemes eliminte the dependence on Stern-like identification protocols and have much shorter signature sizes. We also use the Gaussian convolution technique (G+G) presented by Devevey et al. in Asiacrypt 2023 to remove the reject-sampling in BLISS. This allows the threshold ring signature to overcome the proof issue caused by "abort" and achieve higher computation efficiency than previous ones. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

HiRes: Hierarchical Feature Optimization and Rescorer for Automatic ICD Coding

HiRes: Hierarchical Feature Optimization and Rescorer for Au...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal processing, ICASSP 2025

作者： Liang, Zhenpeng Guan, Hongjiao Lu, Wenpeng Peng, Xueping Xu, Bing Yang, Muyun Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia Faculty of Computing Harbin Institute of Technology Harbin China

ISBN: (纸本)9798350368741

The International Classification of Diseases (ICD) coding assigns standardized codes to diseases. Automating this process enhances the efficiency and accuracy of clinical records processing. However, current methods struggle with noisy and lengthy clinical texts, making it difficult to ensure the reliability of feature extraction. Furthermore, they typically make separate binary predictions for each code, overlooking the dependencies between them. To address these issues, we propose a novel model called Hierarchical Feature Optimization and Rescorer (HiRes). We employ a cascaded convolution architecture to mitigate noise and enhance feature representation. Additionally, a masked autoencoder-based rescorer is introduced to capture ICD code interdependencies, refining initial predictions for improved accuracy. The model also considers the inconsistencies in code representations. Experiments on the MIMIC datasets demonstrate the effectiveness of our model. © 2025 IEEE.

关键词： automatic ICD coding cascaded convolutional network multi-label classification

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

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

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：