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

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

作者： Li, Qingqing 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 problem that ultra-wideband systems are easily interfered by narrowband signals, In this paper, a novel ultra-wideband (UWB) bandpass filter with dual-notch characteristics. This filter is mainly composed of Composition of a multimode resonator (MMR)and a folded dual-mode step-impedance resonator. Paralleling T-shaped SIR stubs in the basic MMR structure realizes the introduction of transmission zeros within the passband. At the same time, a pair of high-impedance stubs are also loaded to extend the upper stopband of the filter, and a folded dual-mode stepped impedance resonator is coupled below the filter to generate dual-notch frequencies. Through the electromagnetic simulation software HFSS for simulation optimization, the simulation results show that the passband of the filter is 3.4211.21GHz and its notch frequencies are 8.8GHz and 9.5GHz respectively. Insertion loss below 0.5dB and stopband up to 20GHz (S21 © 2022 IEEE.

关键词： Electromagnetic simulation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Point Pattern Matching Based on Spectra of Directed Graphs

引用

Chinese Journal of Electronics 2023年第4期20卷 662-666页

作者： LIANG Dong ZHU Ming FAN Yizheng YAN Pu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

We present a novel algorithm for point pattern matching by means of spectra of directed graphs. Given a feature point-set, we construct a weighted directed graph and skew-symmetric matrix associated with the graph. By using spectral decomposition of the matrix, we give a spectral representation of the feature points with half of the eigenvectors. We theoretically analyze that our method can well deal with the matching problem under affine transformation. The expreiments applied to synthetic data and real-world images show the effectiveness of our method.

关键词： Technological innovation Directed graphs Medical services Matrix decomposition Pattern matching Synthetic data

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

DisenGCD: a meta multigraph-assisted disentangled graph learning framework for cognitive diagnosis 24

DisenGCD: a meta multigraph-assisted disentangled graph lear...

引用

Proceedings of the 38th International Conference on Neural Information processing Systems

作者： Shangshang Yang Mingyang Chen Ziwen Wang Xiaoshan Yu Panpan Zhang Haiping Ma Xingyi Zhang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui P. R. China and Anhui Province Key Laboratory of Intelligent Computing and Applications Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui P. R. China and Department of Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui P. R. China

ISBN: (纸本)9798331314385

Existing graph learning-based cognitive diagnosis (CD) methods have made relatively good results, but their student, exercise, and concept representations are learned and exchanged in an implicit unified graph, which makes the interaction-agnostic exercise and concept representations be learned poorly, failing to provide high robustness against noise in students' interactions. Besides, lower-order exercise latent representations obtained in shallow layers are not well explored when learning the student representation. To tackle the issues, this paper suggests a meta multigraph-assisted disentangled graph learning framework for CD (DisenGCD), which learns three types of representations on three disentangled graphs: student-exercise-concept interaction, exercise-concept relation, and concept dependency graphs, respectively. Specifically, the latter two graphs are first disentangled from the interaction graph. Then, the student representation is learned from the interaction graph by a devised meta multigraph learning module; multiple learnable propagation paths in this module enable current student latent representation to access lower-order exercise latent representations, which can lead to more effective nad robust student representations learned; the exercise and concept representations are learned on the relation and dependency graphs by graph attention modules. Finally, a novel diagnostic function is devised to handle three disentangled representations for prediction. Experiments show better performance and robustness of DisenGCD than state-of-the-art CD methods and demonstrate the effectiveness of the disentangled learning framework and meta multigraph module. The source code is available at https://***/BIMK/intelligent-Education/tree/main/DisenGCD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Low Coupling Sparse Array Based on Uniform Linear Array Fitting Method 7

Low Coupling Sparse Array Based on Uniform Linear Array Fitt...

引用

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

作者： Yao, Yichang Li, Yingsong Li, Liping 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 order to solve the problem that traditional sparse arrays only emphasize high degrees of freedom and ignore low coupling, uniform array fitting method can design arrays with low coupling. However, the existing array coupling based on uniform array fitting method still has room for decline, and the value of weight function is not the minimum, so the performance of array DOA estimation needs to be further optimized. Therefore, based on the uniform matrix fitting method, a uniform matrix fitting 6-base-layer array is designed. By extending the spacing of each subarray of the uniform subarray in the base layer, the number of small array element spacing pairs in the differential cooperative array is reduced, and the coupling between the elements of the whole sparse array is reduced as a whole. The performance of DOA estimation of the designed array is simulated and analyzed by using spatial smoothing multiple signal classification algorithm. © 2024 IEEE.

关键词： Multiple signal classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：