检索结果-南通市图书馆

A Miniaturized Bandwidth Reconfigurable Bandpass Chip Filter with Semi-lumped Topology and GaAs pHEMT Technology

Chinese Journal of Electronics 2021年第1期30卷 192-198页

作者： LI Linqing ZHU Haoran NING Xingyu LI Zunwen WU Xianliang key lab of intelligent computing and signal processing Ministry of Education Anhui University

A miniaturized reconfigurable bandpass chip filter with semi-lumped topology and Gallium Arsenide pseudomorphic High electron mobility transistor（GaAs pHEMT） technology is proposed. Semi-lumped topology is employed to instead the traditional lumped inductor with microstrip transmission line, which can reduced the size of the tunable filter significantly. Three-order series and shunt resonated bandpass filter is implemented with shorted stubs and metal-insulator-metal capacitors. Two transmission zeros are introduced with the series resonator and the shunted GaAs FET. By tuning the gate bias circuit of the FET, the capacitance of the series resonator is changed and the bandwidth of the filter is adjusted correspondingly. An equivalent circuit model is developed to interpret the mechanism of the proposed filter circuit. A reconfigurable on chip filter sample operated at 10 GHz is fabricated to validate the design. Two fractional bandwidth of 14.3% and 23.5% are tuned with bias voltage of the FET, while insertion loss of 2.4 d B and 2.2 d B are observed with the filter, respectively. The area of the chip filter is 0.86 × 0.96 mm2and is equivalent to an electrical length of 0.08 × 0.09λg2at center frequency. Measurement results agree well with the simulation ones.

关键词： gallium arsenide tunable filter transmission zeros equivalent circuit model resonator filters shunted FET III-V semiconductors miniaturized bandwidth reconfigurable bandpass chip filter MIM devices microstrip transmission line chip filter sample shunt resonated bandpass filter metal-insulator-metal capacitors semilumped topology loss 2.4 dB Gallium Arsenide pseudomorphic High electron mobility transistor technology insertion loss filter circuit integrated circuit design GaAs integrated circuit manufacture frequency 10.0 GHz pHEMT technology microwave filters loss 2.2 dB HEMT integrated circuits series resonator miniaturized reconfigurable bandpass chip filter band-pass filters

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

MICkNN:Multi-Instance Covering kNN Algorithm

引用

Tsinghua Science and Technology 2013年第4期18卷 360-368页

作者： Shu Zhao Chen Rui Yanping Zhang Department of Computer Science and Technology and key lab of intelligent computing and signal processing Anhui University

Mining from ambiguous data is very important in data mining. This paper discusses one of the tasks for mining from ambiguous data known as multi-instance problem. In multi-instance problem, each pattern is a labeled bag that consists of a number of unlabeled instances. A bag is negative if all instances in it are negative. A bag is positive if it has at least one positive instance. Because the instances in the positive bag are not labeled, each positive bag is an ambiguous. The mining aim is to classify unseen bags. The main idea of existing multi-instance algorithms is to find true positive instances in positive bags and convert the multi-instance problem to the supervised problem, and get the labels of test bags according to predict the labels of unknown instances. In this paper, we aim at mining the multi-instance data from another point of view, i.e., excluding the false positive instances in positive bags and predicting the label of an entire unknown bag. We propose an algorithm called Multi-Instance Covering kNN （MICkNN） for mining from multi-instance data. Briefly, constructive covering algorithm is utilized to restructure the structure of the original multi-instance data at first. Then, the kNN algorithm is applied to discriminate the false positive instances. In the test stage, we label the tested bag directly according to the similarity between the unseen bag and sphere neighbors obtained from last two steps. Experimental results demonstrate the proposed algorithm is competitive with most of the state-of-the-art multi-instance methods both in classification accuracy and running time.

关键词： mining ambiguous data multi-instance classification constructive covering algorithm kNN algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Hierarchical Covering Algorithm

引用

Tsinghua Science and Technology 2014年第1期19卷 76-81页

作者： Jie Chen Shu Zhao Yanping Zhang Department of Computer Science and Technology and key lab of intelligent computing and signal processing Anhui University

The concept of deep learning has been applied to many domains, but the definition of a suitable problem depth has not been sufficiently explored. In this study, we propose a new Hierarchical Covering Algorithm （HCA） method to determine the levels of a hierarchical structure based on the Covering Algorithm （CA）. The CA constructs neural networks based on samples＇ own characteristics, and can effectively handle multi-category classification and large-scale data. Further, we abstract characters based on the CA to automatically embody the feature of a deep structure. We apply CA to construct hidden nodes at the lower level, and define a fuzzy equivalence relation R on upper spaces to form a hierarchical architecture based on fuzzy quotient space theory. The covering tree naturally becomes from R. HCA experiments performed on MNIST dataset show that the covering tree embodies the deep architecture of the problem, and the effects of a deep structure are shown to be better than having a single level.

关键词： deep architecture hierarchy fuzzy equivalence relation covering tree MNIST dataset

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Regularized Super Resolution Algorithm for Generalized Gaussian Noise

引用

Journal of Donghua University(English Edition) 2010年第1期27卷 25-35页

作者：陈文方向忠刘立峰蒋伟丁大为乔艳涛 Institute of Image Communication and Information processing Shanghai Jiaotong University Computer and Information Department Shanghai University of Electric Power key lab oratory of intelligent computing & signal processing Ministry of EducationAnhui University

In this paper,an iterative regularized super resolution (SR) algorithm considering non-Gaussian noise is *** on the assumption of a generalized Gaussian distribution for the contaminating noise,an lp norm is adopted to measure the data fidelity term in the cost *** the meantime,a regularization functional defined in terms of the desired high resolution (HR) image is employed,which allows for the simultaneous determination of its value and the partly reconstructed image at each iteration *** convergence is thoroughly *** results show the effectiveness of the proposed algorithm as well as its superiority to conventional SR methods.

关键词： super resolution generalized p-Gaussian distribution regularization parameter

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm

引用

Tsinghua Science and Technology 2014年第3期19卷 285-292页

作者： Yanping Zhang Heng Zhang Huazhen Wei Jie Tang Shu Zhao the Department of Computer Science and Technology and key lab of intelligent computing and signal processing Anhui University the Department of Computer Science and Technology and key lab of intelligent computing and signal processing Anhui University1Hefei 230601 China the Department of Computer Science and Technology Tsinghua University

Multiple-Instance Learning （MIL） is used to predict the unlabeled bags＇ label by learning the labeled positive training bags and negative training *** bag is made up of several unlabeled instances.A bag is labeled positive if at least one of its instances is positive,otherwise *** multiple-instance learning methods with instance selection ignore the representative degree of the selected *** example,if an instance has many similar instances with the same label around it,the instance should be more representative than *** on this idea,in this paper,a multiple-instance learning with instance selection via constructive covering algorithm （MilCa） is *** MilCa,we firstly use maximal Hausdorff to select some initial positive instances from positive bags,then use a Constructive Covering Algorithm （CCA） to restructure the structure of the original instances of negative *** an inverse testing process is employed to exclude the false positive instances from positive bags and to select the high representative degree instances ordered by the number of covered instances from training ***,a similarity measure function is used to convert the training bag into a single sample and CCA is again used to classification for the converted *** results on synthetic data and standard benchmark datasets demonstrate that MilCa can decrease the number of the selected instances and it is competitive with the state-of-the-art MIL algorithms.

关键词： multiple-instance learning instance selection constructive covering algorithm maximal Hausdorff

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Solving multi-object radar cross section based on wide-angle parabolic equation method

引用

Journal of Systems Engineering and Electronics 2006年第4期17卷 722-724页

作者： Huang Zhixiang Wu Qiong Wu Xianliang The key lab of Ministry of Education of intelligent computing & signal processing Anhui Univ. Hefei 230039 P. R. China

Based on a Pade approximation, a wide-angle parabolic equation method is introduced for computing the multiobject radar cross section （RCS） for the first time. The method is a paraxial version of the scalar wave equation, which solves the field by marching them along the paraxial direction. Numerical results show that a single wide-angle parabofic equation run can compute multi-object RCS efficiently for angles up to 45 ° . The method provides anew and efficient numerical method for computation electromagnetics.

关键词： parabolic equation method Pade approximation radar cross section paraxial direction.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Study on moving target detection to passive radar based on FM broadcast transmitter

引用

Journal of Systems Engineering and Electronics 2007年第3期18卷 462-468页

作者： Zhu Jiabing Tao Liang Hong yi Education Ministry key lab of intelligent computing and signal processing Anhui Univ. Hefei 230039 P. R. China Inst. of signal processing East China Research Inst. of Electronic Engineering Hefei 230031 P. R. China

Target detection by a noncooperative illuminator is a topic of general interest in the electronic warfare field. First of all, direct-path interference （DPI） suppression which is the technique of bottleneck of moving target detection by a noncooperative frequency modulation（FM） broadcast transmitter is analyzed in this article; Secondly, a space-time-frequency domain synthetic solution to this problem is introduced： Adaptive nulling array processing is considered in the space domain, DPI cancellation based on adaptive fractional delay interpolation （AFDI） technique is used in planned time domain, and long-time coherent integration is utilized in the frequency domain; Finaily, an experimental system is planned by considering FM broadcast transmitter as a noncooperative illuminator, Simulation results by real collected data show that the proposed method has a better performance of moving target detection.

关键词： passive radar direct path interference adaptive beamforming adaptive fractional delay interpolation,long-time coherent integration.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

FAST COMPUTATION OF WIDEBAND RCS USING CHARACTERISTIC BASIS FUNCTION METHOD AND ASYMPTOTIC WAVEFORM EVALUATION TECHNIQUE

引用

Journal of Electronics(China) 2010年第4期27卷 453-457页

作者： Sun Yufa Du Yan Shao Yong key lab. of intelligent computing and signal processing Ministry of Education Anhui University Hefei 230039 China

The Asymptotic Waveform Evaluation (AWE) technique is an extrapolation method that provides a reduced-order model of linear system and has already been successfully used to analyze wideband electromagnetic scattering problems. As the number of unknowns increases, the size of Method Of Moments (MOM) impedance matrix grows very rapidly, so it is a prohibitive task for the computation of wideband Radar Cross Section (RCS) from electrically large object or multi-objects using the traditional AWE technique that needs to solve directly matrix inversion. In this paper, an AWE technique based on the Characteristic Basis Function (CBF) method, which can reduce the matrix size to a manageable size for direct matrix inversion, is proposed to analyze electromagnetic scattering from multi-objects over a given frequency band. Numerical examples are presented to il-lustrate the computational accuracy and efficiency of the proposed method.

关键词： Method of Moments (MOM) Radar Cross Sections (RCS) Characteristic Basis Func-tion (CBF) method Asymptotic Waveform Evaluation (AWE) Multi-objects

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Robust low-rank tensor factorization by cyclic weighted median

引用

Science China(Information Sciences) 2015年第5期58卷 145-155页

作者： MENG DeYu ZHANG Biao XU ZongBen ZHANG Lei GAO ChenQiang Institute for Information and System Sciences and Ministry of Education key lab for intelligent Networks and Network Security Xi'an Jiaotong University Department of computing Hong Kong Polytechnic University Chongqing key laboratory of signal and Information processing Chongqing University of Posts and Telecommunications

Low-rank tensor factorization(LRTF) provides a useful mathematical tool to reveal and analyze multi-factor structures underlying data in a wide range of practical applications. One challenging issue in LRTF is how to recover a low-rank higher-order representation of the given high dimensional data in the presence of outliers and missing entries, i.e., the so-called robust LRTF problem. The L1-norm LRTF is a popular strategy for robust LRTF due to its intrinsic robustness to heavy-tailed noises and outliers. However, few L1-norm LRTF algorithms have been developed due to its non-convexity and non-smoothness, as well as the high order structure of data. In this paper we propose a novel cyclic weighted median(CWM) method to solve the L1-norm LRTF problem. The main idea is to recursively optimize each coordinate involved in the L1-norm LRTF problem with all the others fixed. Each of these single-scalar-parameter sub-problems is convex and can be easily solved by weighted median filter, and thus an effective algorithm can be readily constructed to tackle the original complex problem. Our extensive experiments on synthetic data and real face data demonstrate that the proposed method performs more robust than previous methods in the presence of outliers and/or missing entries.

关键词： tensor factorization low-rank weighted median filter tensorface

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Tissue P systems with cell separation: attacking the partition problem

引用

Science China(Information Sciences) 2011年第2期54卷 293-304页

作者： ZHANG XingYi1, WANG Shuo2, NIU YunYun2 & PAN LinQiang2 1key lab of intelligent computing and signal processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei 230039, China 2Image processing and intelligent Control key laboratory of Education Ministry of China, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China 1. key lab of intelligent computing and signal processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China2. Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for effciently solving a well-known NP-complete problem, the partition problem.

关键词： membrane computing tissue P system cell separation partition problem

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：