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

Gene Expression Data Classification Using Laplacian Eigenmap Based on Improved Maximum Margin Criterion

Chinese Journal of Electronics 2023年第3期22卷 521-524页

作者： WANG Nian WANG Junsheng GE Fang Education Ministry Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei China

To deal with the insufficiency problem of Laplacian eigenmap (LE) method and Maximum margin criterion (MMC) method in feature extraction, a new dimensionality reduction method called Laplacian eigenmap based on Improved maximum margin criterion (LE/IMMC) is proposed with applications in gene expression data classification. The LE/IMMC intends to constrain similar data points as close to each other as possible and maximize the margin regions between different pattern classes simultaneously. The proposed LE/IMMC by introducing IMMC into the cost function of LE retains the characteristic of local neighborhood relationship of LE. Meanwhile, it emphasizes the discriminative information by incorporating IMMC, which can maximize the between-class scatter and minimize the within-class scatter. Gene expression data classification experiments on four public datasets demonstrate our method is effective for feature extraction,

关键词： Laplace equations education Medical services Feature extraction Cost function Manifold learning Gene expression

来源：评论

学校读者我要写书评

暂无评论

Sparsity-aware Subband Adaptive Filtering in Impulsive Interferences 7

Sparsity-aware Subband Adaptive Filtering in Impulsive Inter...

引用

7th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2024

作者： Gong, Zhikai Li, Yingsong Pang, Baohe Li, Xueyan Xiao, Wudang Li, Liping Zlatanov, Nikola Harbin Engineering University College of Information and Communication Engineering Harbin150001 China Ministry of Education Anhui University Key Laboratory of Intelligent Computing and Signal Processing China Innopolis University Faculty of Computer and Engineering Sciences Russia

ISBN: (纸本)9798350384437

In this paper, we propose two new subband adaptive filtering (SAF) algorithms based on the cost function of the logistic distance metric cost function and use the proportionate proximal gradient algorithm to exploit the sparsity of the system fully. Compared with prior works, the proposed algorithms can handle many different situations better. Through computer simulations, we prove that the algorithm performs excellently in sparse systems disturbed by impulse noises. The algorithm can be used in areas like system identifications. © 2024 IEEE.

关键词： Adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

Design of Broadband Asymmetric Multisection Directional Coupler

Design of Broadband Asymmetric Multisection Directional Coup...

引用

2022 International Applied computational Electromagnetics Society Symposium, ACES-China 2022

作者： Geng, Xiaolei Wu, Xianliang Huang, Zhixiang Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei230601 China

ISBN: (纸本)9781665452366

The multi-section coupled transmission line is equivalent to the cascade of multi-section ladder impedance filters, which provides a basis for the research of broadband directional couplers and meets the needs of microwave systems. Using this method, a multi-section -15 dB stripline directional coupler was designed in the application frequency range of 0.7-3.7 GHz, and the directional coupler was improved by loading the branch compensation capacitor. And through the electromagnetic simulation software HFSS for simulation optimization. The simulation results show that the coupling degree of the coupler is about -15 dB in 0.7-3.7 GHz, the return loss is greater than 20 dB and the isolation is greater than 30 dB, the insertion loss is less than 0.33 dB, the in-band fluctuation is less than 1 dB, and the physical size is 38mm × 6 mm, which meets the design requirements of the -15 dB coupler. © 2022 IEEE.

关键词： Electromagnetic simulation

来源：评论

学校读者我要写书评

暂无评论

A Novel Frequency Reconfigurable Mode Reconfigurable Ultra-Wideband Antenna

A Novel Frequency Reconfigurable Mode Reconfigurable Ultra-W...

引用

2022 International Applied computational Electromagnetics Society Symposium, ACES-China 2022

作者： Guo, Chen. Wu, Xianliang. Huang, Zhixiang. Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei230601 China

ISBN: (纸本)9781665452366

Aiming at the inability to reconstruct the frequency and the pattern of the traditional monopole antenna, an ultra-wideband monopole antenna with frequency reconstruction and pattern reconstruction is proposed. The antenna consists of a monopole antenna and a metasurface with a distance H1 between them. Using HFSS simulation software to simulate, the size of the monopole antenna is 30mm×30mm×1.6mm, and the center frequency is 4.3 GHz. The simulation results show that the impedance bandwidth of the antenna when S11 is less than -10 dB is 3.21-13.64 GHz. In this design, the antenna widens the bandwidth while realizing the frequency reconstruction and pattern reconstruction, and basically does not affect other performances. The simulation results are basically consistent with the measured results, indicating that the antenna has good gain and radiation characteristics in the working frequency band, and can be widely used in ultra-wideband communication systems. © 2022 IEEE.

关键词： Monopole antennas

来源：评论

学校读者我要写书评

暂无评论

A Fast Clustering Based Evolutionary Algorithm for Super-Large-Scale Sparse Multi-Objective Optimization

引用

IEEE/CAA Journal of Automatica Sinica 2023年第4期10卷 1048-1063页

作者： Ye Tian Yuandong Feng Xingyi Zhang Changyin Sun Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information TechnologyAnhui UniversityHefei 230601China School of Computer Science and Technology Anhui UniversityHefei 230601China School of Artificial Intelligence Anhui UniversityHefei 230601China School of Automation Southeast UniversityNanjing 210096China

During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable ***,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision *** tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal *** proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search *** importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by *** existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real ***,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.

关键词： Evolutionary computation fast clustering sparse multi-objective optimization super-large-scale optimization

来源：评论

学校读者我要写书评

暂无评论

A Self-adaptive Two-Stage Local Expansion Algorithm for Community Detection on Complex Networks 7th

A Self-adaptive Two-Stage Local Expansion Algorithm for Com...

引用

7th International Conference on Data Mining and Big Data, DMBD 2022

作者： Shan, Hui Li, Bin Yang, Haipeng Zhang, Lei Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China

ISBN: (纸本)9789811989902

Community detection is of great importance to find hidden information in complex networks. For this problem, local expansion algorithms are becoming popular due to the low time complexity. However, most of them depend heavily on seed selection or require setting some thresholds in advance, leading to inaccurate partition. To this end, this paper proposes a self-adaptive two-stage local expansion algorithm (SALEA) for community detection. Specifically, we propose a self-adaptive strategy that can be used in SALEA for finding communities spontaneously. In the first stage, we apply the self-adaptive strategy for nodes to conduct local expansion and get coarse community structures. In the second stage, we apply the self-adaptive strategy for weak communities obtained in the first stage to refine the coarse community structures and get more accurate partitions. Finally, the experimental results on real and synthetic networks demonstrate that SALEA is superior over several state-of-the-arts. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Asymptotically Optimal Sequence Sets With Low/Zero Ambiguity Zone Properties

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4785-4796页

作者： Tian, Liying Song, Xiaoshi Liu, Zilong Li, Yubo Northeastern University School of Computer Science and Engineering Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China University of Essex School of Computer Science and Electronics Engineering ColchesterCO4 3SQ United Kingdom Yanshan University School of Information Science and Engineering Qinhuangdao066004 China Hebei Key Laboratory of Information Transmission and Signal Processing Qinhuangdao066004 China

Sequences with low/zero ambiguity zone (LAZ/ZAZ) properties are useful in modern communication and radar systems operating over mobile environments. This paper first presents a new family of ZAZ sequence sets motivated by the "modulating" zero correlation zone (ZCZ) sequences which were first proposed by Popovic and Mauritz. We then introduce a second family of ZAZ sequence sets with comb-like spectrum, whereby the local Doppler resilience is guaranteed by their inherent spectral nulls in the frequency domain. Finally, LAZ sequence sets are obtained by exploiting their connection with a novel class of mapping functions. These proposed unimodular ZAZ and LAZ sequence sets are cyclically distinct and asymptotically optimal with respect to the existing theoretical bounds on ambiguity functions. © 1963-2012 IEEE.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Spring pair method of finding saddle points using the minimum energy path as a compass

引用

Physical Review E 2024年第6期110卷 064123-064123页

作者： Gang Cui Kai Jiang Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Xiangtan Hunan 411105 China

Finding index-1 saddle points is crucial for understanding phase transitions. In this work, we propose a simple yet efficient approach, the spring pair method (SPM), to accurately locate saddle points. Without requiring the Hessian information, the SPM evolves a single pair of spring-coupled particles on an energy surface. By designing complementary drifting and climbing dynamics based on gradient decomposition, the spring pair converges onto the minimum energy path (MEP) and spontaneously aligns its orientation with the MEP tangent, providing a reliable ascent direction for efficient convergence to saddle points. The SPM fundamentally differs from traditional surface walking methods that rely on the eigenvectors of the Hessian, which may deviate from the MEP tangent and potentially lead to convergence failure or undesired saddle points. The efficiency of the SPM for finding saddle points is verified by ample examples, including Lennard-Jones clusters, Morse clusters, water clusters, and the Landau energy functional involving quasicrystal phase transitions.

关键词： Lennard-Jones potential

来源：评论

学校读者我要写书评

暂无评论

Multi-scale Cascaded Large-Model for Whole-body ROI Segmentation

arXiv

引用

arXiv 2024年

作者： Hao, Rui Tan, Dayu Su, Yansen Zheng, Chunhou Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

Organs-at-risk segmentation is critical for ensuring the safety and precision of radiotherapy and surgical procedures. However, existing methods for organs-at-risk image segmentation often suffer from uncertainties and biases in target selection, as well as insufficient model validation experiments, limiting their generality and reliability in practical applications. To address these issues, we propose an innovative cascaded network architecture called the Multi-scale Cascaded Fusing Network (MCFNet), which effectively captures complex multi-scale and multi-resolution features. MCFNet includes a Sharp Extraction Backbone and a Flexible Connection Backbone, which respectively enhance feature extraction in the downsampling and skip-connection stages. This design not only improves segmentation accuracy but also ensures computational efficiency, enabling precise detail capture even in low-resolution images. We conduct experiments using the A6000 GPU on diverse datasets from 671 patients, including 36,131 image-mask pairs across 10 different datasets. MCFNet demonstrates strong robustness, performing consistently well across 10 datasets. Additionally, MCFNet exhibits excellent generalizability, maintaining high accuracy in different clinical scenarios. We also introduce an adaptive loss aggregation strategy to further optimize the model training process, improving both segmentation accuracy and efficiency. Through extensive validation, MCFNet demonstrates superior performance compared to existing methods, providing more reliable image-guided support. Our solution aims to significantly improve the precision and safety of radiotherapy and surgical procedures, advancing personalized treatment. The code has been made available on GitHub: https://***/Henry991115/MCFNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Radiotherapy

来源：评论

学校读者我要写书评

暂无评论

Near-field Source DOA Estimation Algorithm Based on De-impact Function under Impulse Noise 7

Near-field Source DOA Estimation Algorithm Based on De-impac...

引用

7th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2024

作者： Xu, Xingchao Pang, Baohe Li, Yingsong Li, Liping Zou, Dingcheng Zlatanov, Nikola Harbin Engineering University College of Information and Communication Engineering Harbin150001 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China Innopolis University Faculty of Computer and Engineering Sciences Innopolis Russia

ISBN: (纸本)9798350384437

In addressing the issue of localizing near-field source signals in the presence of impulse noise, this manuscript introduces a novel de-impact function designed for preprocessing received signals to alleviate the interference caused by impulse noise. Simulation experiments verify the effectiveness of the proposed de-impact function in effectively suppressing impulse noise. Furthermore, to augment estimation precision, a novel algorithm for near-field source localization is proposed. Building upon the framework of correlation entropy theory, a new correntropy covariance matrix is formulated to replace the original signal covariance matrix for signal processing. Through a succession of low-bias approximations between near-field and far-field scenarios, the algorithm converts the original 2-D search into 1-D operations. Additionally, the conventional spectral peak search is replaced by polynomial solving to further mitigate the computational complexity of the algorithm. © 2024 IEEE.

关键词： Impulse noise

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：