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

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Wu, Gang Wu, Bo Huang, Zhixiang Key Laboratory of Intelligent Computing Signal Processing Anhui University Hefei China

ISBN: (纸本)9781538671115

We develop the broadband polarizers functioning in an extremely wide wavelength range from 0.3 to 5 μ m based on structural design and numerical simulation. The finite-difference frequency-domain (FDFD) method is a powerful and simple method for analyzing the electromagnetic structures. We propose a broadband polarizer using dual-layer metallic nanowire grids on a substrate, reflectance and transmittance are simulated by the FDFD method including normal incidence and oblique incidence. © 2019 IEEE.

关键词： Reflection

来源：评论

学校读者我要写书评

暂无评论

Staggered Grid Scheme for the FFT-Based Methods

引用

Chinese Journal of Electronics 2019年第5期28卷 1066-1072页

作者： XIE Jiaye KONG Weibin PANG Lili SONG Weiju HUANG Zhixiang WU Xianliang Industrial Center Nanjing Institute of Technology State Key Laboratory of Millimeter Waves College of Information Engineering Yancheng Institute of Technology Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

A staggered grid scheme is proposed to reduce both the total memory requirement and the CPU time of generating the corrected near matrix in the FFTbased methods. Two sets of Cartesian grids are used to project the source points and the field points, *** proposed method does not lower the efficiency of computing far matrix-vector products, compared with the traditional uniform Cartesian grid scheme. Some numerical experiments are provided to demonstrate both the correctness and the efficiency of the proposed method.

关键词： Green’s function Singularity RFG-FFT Staggered grid scheme Corrected near matrix

来源：评论

学校读者我要写书评

暂无评论

Interactive Prototype Learning and Self-Learning for Few-Shot Medical Image Segmentation

SSRN

引用

SSRN 2024年

作者： Song, Yuhui Xu, Chenchu Wang, Boyan Du, Xiuquan Chen, Jie Zhang, Yanping Li, Shuo School of Computer Science and Technology Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230051 China Department of Computer Science and Technology Tsinghua University Beijing100084 China School of Engineering Case Western Reserve University Cleveland44106 United States

Few-shot learning alleviates the heavy dependence of medical image segmentation tasks on large-scale labeled data, but it shows a strong performance gap when dealing with new targets and new tasks compared with traditional deep learning. Existing few-shot medical image segmentation models mainly realize segmentation by learning the semantic class knowledge of a few known (support) samples and extending it to unknown (query) samples. However, the neglect of the differences between known and unknown samples leads to a certain deviation in the transfer of class knowledge, and the trained model tends to overfit the class knowledge of training classes, which greatly reduces the segmentation and generalization performance of few-shot model. In this work, we propose an interactive prototype learning and self-learning network to alleviate the above problems. Specifically, we propose an interactive prototype learning network to promote feature consistency between support images and query images to improve the accuracy of prototype metric learning. In addition, to avoid overfitting the training class knowledge and reduce the over-dependence of query segmentation on the class knowledge, we introduce a query features-guided self-learning network to achieve the finer segmentation of query images through its rich feature information. Our model obtained the competitive segmentation results on three multi-organ and multi-modal public datasets that show a substantial improvement in generalization ability. © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Finite-time asynchronous dissipative filtering of conic-type nonlinear Markov jump systems

引用

Science China(Information Sciences) 2021年第5期64卷 151-162页

作者： Xiang ZHANG Shuping HE Vladimir STOJANOVIC Xiaoli LUAN Fei LIU Key Laboratory of Intelligent Computing and Signal Processing (Ministry of Education) School of Electrical Engineering and Automation Anhui University Department of Automatic Control Robotics and Fluid Technique Faculty of Mechanical and Civil EngineeringUniversity of Kragujevac Key Laboratory of Advanced Process Control for Light Industry (Ministry of Education) Institute of AutomationJiangnan University

In the present study, the finite-time asynchronous dissipative filter design problem for the Markov jump systems with conic-type nonlinearity is studied. The hidden Markov model can describe the asynchronism embodied in the system modes and the filter modes reasonably. Moreover, a suitable LyapunovKrasovskii function is utilized and linear matrix inequalities are applied to obtain adequate conditions. These techniques guarantee the finite-time boundedness and strict dissipativity of the filtering error dynamic system. Furthermore, the design problems of the passive filter and the H∞ filter are studied by adjusting the three parameters U, G and V. Finally, the filter gains and the optimal index α*are obtained and the correctness and feasibility of the designed approach are verified by a simulation example.

关键词： dissipative filtering hidden Markov model finite-time boundedness Markov jump systems conic-type nonlinearity

来源：评论

学校读者我要写书评

暂无评论

On the coset graph construction of distance-regular graphs

arXiv

引用

arXiv 2022年

作者： Shi, Minjia Krotov, Denis S. Solé, Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Sobolev Institute of Mathematics Novosibirsk630090 Russia I2M CNRS Centrale Marseille University of Aix-Marseille Marseille France

We show that no more new distance-regular graphs in the tables of the book of (Brouwer, Cohen, Neumaier, 1989) can be produced by using the coset graph of additive completely regular codes over finite *** Codes 05E30,... 详细信息

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Constructing MRD codes by switching

arXiv

引用

arXiv 2022年

作者： Shi, Minjia Krotov, Denis S. Özbudak, Ferruh Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Anhui Hefei230601 China Sobolev Institute of Mathematics Novosibirsk630090 Russia Department of Mathematics Institute of Applied Mathematics Middle East Technical University Ankara Turkey

MRD codes are maximum codes in the rank-distance metric space on m-by-n matrices over the finite field of order q. They are diameter perfect and have the cardinality qm(n-d+1) if m ≥ n. We define switching in MRD codes as replacing special MRD subcodes by other subcodes with the same parameters. We consider constructions of MRD codes admitting such switching, including punctured twisted Gabidulin codes and direct-product codes. Using switching, we construct a huge class of MRD codes whose cardinality grows doubly exponentially in m if the other parameters (n, q, the code distance) are fixed. Moreover, we construct MRD codes with different affine ranks and aperiodic MRD *** Codes 94B25 Copyright © 2022, The Authors. All rights reserved.

关键词： Switching

来源：评论

学校读者我要写书评

暂无评论

Interblock-interference-free precoding using square-root decomposition for faster-than-Nyquist signaling

引用

Digital Communications and Networks 2025年

作者： Yan Wang Qiang Li Liping Li Yingsong Li Xingwang Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230601 China School of Physics and Electronic Information Engineering Henan Polytechnic University Jiaozuo China

Precodings using square-root decomposition, including Cholesky and G-To-Minus-Half (GTMH) precodings, are promising for eliminating the Faster-Than-Nyquist (FTN)-induced Intersymbol-Interference (ISI). However, the existing precodings using square-root decomposition either ignore Interblock-Interference (IBI) or increase the signal power, deteriorating the Bit Error Rate (BER) performance for high-order modulations and severe ISI. To overcome these drawbacks, we adopt two approaches for constructing the circular ISI matrix. The first approach inserts a Cyclic Prefix/Suffix (CPS) after each precoded symbol block, while the second approach replaces the linear convolution of the FTN shaping and the matched filter by the circular convolution, resulting in the Circular FTN (CFTN). Using these two approaches, we propose three IBI-free precodings, i.e., CPS-Cholesky, CFTN-Cholesky and CFTN-GTMH precodings. Furthermore, employing QR decomposition shows that the GTMH and Cholesky precodings can be converted interchangeably. Thus, we demonstrate that the GTMH precoding is essentially equivalent to the Cholesky precoding. Simulation results indicate that the BER performance of three IBI-free precodings approaches Nyquist performance for moderate ISI. However, as ISI intensifies, the CPS-Cholesky scheme increases the transmit power, causing BER performance degradation. In contrast, the CFTN-Cholesky and CFTN-GTMH precodings maintain optimal BER performance even for severe ISI. Considering 128-amplitude phase shift keying with a code rate of 1/2, the BER loss of CFTN-Cholesky and CFTN-GTMH precodings for the ideal BER of 10-5 is approximately 0.002 dB and 0.005 dB when packing factor is 0.7 and roll-off factor is 0.3. To the best knowledge of the authors, this is the optimal performance achievable through precoding.

关键词： Faster-than-Nyquist Intersymbol-interference Interblock-interference Bit error rate Precoding

来源：评论

学校读者我要写书评

暂无评论

Investigation on ULA Fitting Promoting Low Coupling Sparse Arrays

Investigation on ULA Fitting Promoting Low Coupling Sparse A...

引用

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Yichang Yao Wanlu Shi Yingsong Li Zhixiang Huang Guohui Yang Kuang Zhang College of Information and Communication Engineering Harbin Engineering University Harbin China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China School of Electronics and Information Engineering Harbin Institute of Technology Harbin China

A low coupling sparse array (LCSA) is presented, analyzed and discussed on the basis of the recent proposed uniform linear array (ULA) fitting scheme with close-expressions, and its performance with different uniform subarrays in the basic layer is investigated via parameter estimation like direction-of-arrival(DOA). The results gives a superior performance for the presented LCSA.

关键词： Couplings Mutual coupling Direction-of-arrival estimation Fitting Estimation Computational electromagnetics

来源：评论

学校读者我要写书评

暂无评论

Some bounds on the cardinality of the b-symbol weight spectrum of codes

arXiv

引用

arXiv 2024年

作者： Zhu, Hongwei Li, Shitao Shi, Minjia Xia, Shu-Tao Solé, Patrick Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen518055 China School of Mathematical Sciences Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Centrale Marseille CNRS I2M Aix Marseille University Marseille13009 France State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the b-symbol distance spectrum. We examine this question for various types of codes, including unrestricted codes, additive codes, linear codes, and cyclic codes, successively. For the first three cases, we determine the maximum size of the b-symbol distance spectra of these codes smoothly. For the case of cyclic codes, we introduce three approaches to characterize the upper bound for the cardinality of the b-symbol weight spectrum of cyclic codes, namely the period distribution approach, the primitive idempotent approach, and the b-symbol weight formula approach. As two by-products of this paper, the maximum number of symplectic weights of linear codes is determined, and a basic inequality among the parameters [n, k, dH(C)]q of cyclic codes is provided. © 2024, CC0.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

A Novel Technique for Analyzing the Metasurface of Varying Element Sizes or Rotate Angles

A Novel Technique for Analyzing the Metasurface of Varying E...

引用

IEEE International Conference on Computational Electromagnetics (ICCEM)

作者： Huihui Li G. S. Cheng Bo Wu Z. X. Huang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Auhui University China

ISBN: (数字)9781728134482

ISBN: (纸本)9781728134499

This paper presents an efficient method for analyzing the metasurface of varying element sizes or rotate angles. In this method, the characteristic modes (CMs) for metasurface element can be obtained by solving a generalized eigenvalue problem (GEP) based on the mixed potential integral equation (MPIE). Then, by choosing the first several CMs of the isolated reference element with larger mode significance (MS) to construct the entire domain basis functions, the induced current of the metasurface structure can be expanded using the set of entire domain basis functions. By truncating the order of the entire domain basis functions, this method can significantly reduce the number of unknowns and greatly reduce the computational time and memory requirement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：