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

Conference on algorithms for Synthetic Aperture Radar Imagery II

作者： KOUTSOUDIS, T LOVAS, L GRUMMAN AEROSP CORP BETHPAGENY

ISBN: (纸本)0819418404

Airborne surveillance and ultra wideband radars operating at low frequencies experience co- channel (or in-band) electromagnetic RF interference (RFI) from nonhostile emitter sources (e.g. fixed and mobile communications). Although many of these interference sources will be received in the antenna sidelobe region, approximately 30-35 dB down, a significant number will be encountered in the mainbeam. This paper describes an algorithm that 'notches' out the mainbeam, in-band interference sources, while simultaneously 'equalizing' or compensating for the range-time sidelobes that results from the 'notching' process. Target resolution performance and SAR imaging integrity is maintained with the RFI suppression technique and algorithm developed. The algorithm developed by Grumman, is referred to as the minimization algorithm. This paper describes in detail the derivation of this algorithm and presents performance results of its application against numerous RFI data scenarios.

关键词： RF INTERFERENCE SUPPRESSION ULTRA WIDE-BAND RADAR minimization algorithm SAR IMAGING EQUALIZATION TARGET RESOLUTION FIXED AND MOBILE COMMUNICATION EMITTERS

来源：评论

学校读者我要写书评

暂无评论

Monotone convex and first order maps in optimization of nonsmooth lipschitz functions*

引用

Optimization 1995年第2期33卷 105-118页

作者： Peretti, A. Sutti, C. Istituto di Matematica Facollá di Economia e Commercio Universitá. di Verona Verona Via dell'Artigliere 19 Italy

Looking for optimization of nonsmooth Lipschitz functions, the paper considers quasidifferential and subdifferential mappings for this class of functions. Namely, a generalized subdifferential is introduced for Lipschitz functions and discussed with respect to the Demyanov's quasi- and the Clarke's subdifferential. Then a new minimization algorithm is defined and numerical results are reported. Moreover, some aspects of operations and relations among sets, relevant within the nonsmooth analysis, are pointed out. © 1995 Taylor & Francis Group, LLC

关键词： Generalized subdifferentials Lipschitz functions minimization algorithm Nonsmooth optimization Quasi-differentials

来源：评论

学校读者我要写书评

暂无评论

A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits

引用

IEEE Transactions on Computers 1976年第7期C-25卷 684-702页

作者： Tabloski, Theodore F. Mowle, Frederic J. Bell Laboratories Holmdel NJ 07733 United States Department of Electrical Engineering Purdue University West Lafayette IN 47907 United States

A method of realizing arbitrary combinational switching functions with multiplexers is derived. These circuits are divided in two classes where the first allows only uncomplemented variables as control inputs and the second has unrestricted inputs. The selected inputs to each multiplexer in the first class of circuits (tree circuits) are shown to be residue functions of the output function. Using this fact, it is demonstrated that many functional properties simplify realization procedures. A numerical method for applying Shannon's expansion is used in an implicitly exhaustive search synthesis procedure. By using the numerical form of each minterm of a function, any multi-variable expansion residue function can be found by using a simple set intersection operation on a group of single-variable expansion residue functions. Methods of detecting equal residue functions and single-variable residue functions by using their numerical representations are derived for both completely and incompletely specified functions. An implicitly exhaustive search procedure using the residue functions derived from the numerical procedure is demonstrated for numerous functions with various numbers of variables. The results of this procedure show that approximately 50 percent of the number of multiplexers in a canonical tree realization can be eliminated for the minimal tree realization. It is also shown that it is possible to realize suboptimal multiplexer tree circuits with significant reduction after a short computation time. © 1976, IEEE. All rights reserved.

关键词： Implicitly exhaustive search logic design automation minimization algorithm modular logic arrays multiplexer multiplexer universal logic module (MULM) numerical technique Shannon's expansion universal logic module (ULM)

来源：评论

学校读者我要写书评

暂无评论

minimization algorithms for weakly defined boolean functions

引用

Cybernetics 1965年第2期1卷 53-60页

作者： Zakrevskii, A.D.

来源：评论

学校读者我要写书评

暂无评论

On the use of generalized inverses in function minimization

引用

Computing 1970年第3-4期6卷 241-248页

作者： Tewarson, R.P. Applied Mathematics Department State University of New York Stony Brook N. Y. United States

In this paper an attempt is made to provide a unified derivation of various minimization algorithms which use the notion of updating an estimate of the inverse of the Hessian matrix. A new method for updating the estimated inverse of the Hessian matrix and a simple technique for making computational improvements in the various algorithms are also given. © 1970 Springer-Verlag.

关键词： Computational Mathematic Simple Technique Generalize Inverse Function minimization minimization algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：