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

40th Asilomar Conference on Signals, Systems, and computers, ACSSC '06

作者： Calderbank, A.R. Howard, S.D. Moran, W. Pezeshki, A. Zoltowski, M. Program in Applied and Computational Mathematics Princeton University Princeton NJ United States Defence Science and Technology Organization Edinburgh Australia Electrical Engineering and Computer Science University of Melbourne Melbourne Australia Electrical and Computer Engineering Purdue University West Lafayette IN United States

ISBN: (纸本)1424407850

Fully Polarimetric radar systems are capable of simultaneously transmitting and receiving in two orthogonal polarizations. Instantaneous radar polarimetry exploits both polarization modes of a dually-polarized radar transmitter and receiver on a pulse by pulse basis, and can improve the radar detection performance and suppress range sidelobes. In this paper, we extend the use of instantaneous radar polarimetry for radar systems with multiple dually-polarized transmit and receive antennas. Alamouti signal processing is used to coordinate transmission of Golay pairs of phase codes waveforms across polarizations and multiple antennas. The integration of multi-antenna signal processing with instantaneous radar polarimetry can further improve the detection performance, at a computational cost comparable to single channel matched filtering.

关键词： Polarimeters

来源：评论

学校读者我要写书评

暂无评论

Guest editorial nonlinear optimization of communication systems

引用

IEEE Journal on Selected Areas in Communications 2006年第8期24卷 1421-1423页

作者： Chiang, Mung Low, Steven H. Luo, Zhi-Quan Shroff, Ness B. Yu, Wei Steenstrup, M. Princeton University Department of Electrical Engineering Program in Applied and Computational Mathematics Princeton NJ 08544 United States California Institute of Technology Department of Computer Science Pasadena CA 91125 United States University of Minnesota Department of Electrical and Computer Engineering Minneapolis MN 55455 United States Purdue University School of Electrical and Computer Engineering West Lafayette IN 47907 United States University of Toronto Edward S. Rogers Sr. Department of Electrical and Computer Engineering Toronto Ont. M4S 3G5 Canada

No abstract available

关键词： Communication systems Design optimization Communication system control Optimization methods Protocols Distributed algorithms Power system modeling Nonlinear control systems Lagrangian functions Surges

来源：评论

学校读者我要写书评

暂无评论

Instantaneous Radar Polarimetry with Multiple Dually-polarized Antennas

Instantaneous Radar Polarimetry with Multiple Dually-polariz...

引用

Asilomar Conference on Signals, Systems & computers

作者： A. R. Calderbank S. D. Howard W. Moran A. Pezeshki M. Zoltowski Program Applied and Computational Mathematics Princeton University Princeton NJ USA Defence Science and Technology Organization Edinburgh Australia Electrical Engineering and Computer Science University of Melbourne Melbourne Australia Electrical and Computer Engineering Purdue University West Lafayette IN USA

Fully polarimetric radar systems are capable of simultaneously transmitting and receiving in two orthogonal polarizations. Instantaneous radar polarimetry exploits both polarization modes of a dually-polarized radar transmitter and receiver on a pulse by pulse basis, and can improve the radar detection performance and suppress range sidelobes . In this paper, we extend the use of instantaneous radar polarimetry for radar systems with multiple dually-polarized transmit and receive antennas. Alamouti signal processing is used to coordinate transmission of Golay pairs of phase codes waveforms across polarizations and multiple antennas. The integration of multi- antenna signal processing with instantaneous radar polarimetry can further improve the detection performance, at a computational cost comparable to single channel matched filtering.

关键词： Radar polarimetry Radar antennas Polarization Radar detection Radar signal processing Transmitters Receiving antennas Transmitting antennas Computational efficiency Matched filters

来源：评论

学校读者我要写书评

暂无评论

Value function approximation with diffusion wavelets and Laplacian eigenfunctions

Value function approximation with diffusion wavelets and Lap...

引用

2005 Annual Conference on Neural Information Processing Systems, NIPS 2005

作者： Mahadevan, Sridhar Maggioni, Mauro Department of Computer Science University of Massachusetts Amherst MA 01003 United States Program in Applied Mathematics Department of Mathematics Yale University New Haven CT 06511 United States

ISBN: (纸本)9780262232531

We investigate the problem of automatically constructing efficient representations or basis functions for approximating value functions based on analyzing the structure and topology of the state space. In particular, two novel approaches to value function approximation are explored based on automatically constructing basis functions on state spaces that can be represented as graphs or manifolds: one approach uses the eigenfunctions of the Laplacian, in effect performing a global Fourier analysis on the graph;the second approach is based on diffusion wavelets, which generalize classical wavelets to graphs using multiscale dilations induced by powers of a diffusion operator or random walk on the graph. Together, these approaches form the foundation of a new generation of methods for solving large Markov decision processes, in which the underlying representation and policies are simultaneously learned.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

Value function approximation with diffusion wavelets and Laplacian eigenfunctions 05

Value function approximation with diffusion wavelets and Lap...

引用

Proceedings of the 19th International Conference on Neural Information Processing Systems

作者： Sridhar Mahadevan Mauro Maggioni Department of Computer Science University of Massachusetts Amherst MA Program in Applied Mathematics Department of Mathematics Yale University New Haven CT

We investigate the problem of automatically constructing efficient representations or basis functions for approximating value functions based on analyzing the structure and topology of the state space. In particular, two novel approaches to value function approximation are explored based on automatically constructing basis functions on state spaces that can be represented as graphs or manifolds: one approach uses the eigenfunctions of the Laplacian, in effect performing a global Fourier analysis on the graph; the second approach is based on diffusion wavelets, which generalize classical wavelets to graphs using multiscale dilations induced by powers of a diffusion operator or random walk on the graph. Together, these approaches form the foundation of a new generation of methods for solving large Markov decision processes, in which the underlying representation and policies are simultaneously learned.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Human systems integration and advanced technology in engineering department workload and manpower reduction

引用

NAVAL ENGINEERS JOURNAL 2003年第1期115卷 57-65页

作者： Lively, KA Seman, AJ Kirkpatrick, M KENNETH A. LIVELY graduated from the University of Colorado with a BS in applied mathematics and an MS in mathematics in 1976 and from the Massachusetts Institute of Technology with an MS in electrical engineering and the degree ocean engineer in naval architecture and marine engineering in 1984. He retired from the U.S. Navy in 1989 after 23 years of service. Assignments included electrical officer on the USS Constellation (CV 64) project engineer for the DDG 51 machinery control system (NAVSEA) and DDG 51 Technical Director (NAVSEA). He was vice president of the PDI Division of Bird-Johnson Company from July 1989 to November 1998 where he managed various gas turbine and machinery controls related development projects. He joined Anteon Corporation's Systems Engineering Group as senior controls engineer in December 1998 where he provided technical support to the integrated power systems program (NAVSEA PMS 510) and managed the Office of Naval Research Afloat Laboratory. DR. MARK KIRKPATRICK is currently an independent consultant in human factors and work-load/manning analysis and modeling. He holds a Ph.D. degree in experimental psychology from The Ohio State University and has 34 years of experience in applied human factors. From 1982 through 2000 Dr. Kirkpatrick served as the senior vice president of Carlow International. Prior to joining Carlow in 1982 Dr. Kirkpatrick served as a member of the technical staff at North American Rockwell's Missiles Division and as a project director and vice president for Essex Corporation. His areas of expertise include workload simulation task analysis operator-in-the-loop simulation human performance experimentation statistical analysis and human factors T&E. He has directed and/or participated in human factors projects for the U.S. Navy U.S. Army NASA Department of Transportation the U.S. Nuclear Regulatory Commission and private industry. ANTHONY J. SEMAN III is the technical manager for the reduced ship's crew by virtual presence (RSVP) advanced technology d

Aboard current ships, such as the DDG 51, engineering control and damage control activities are manpower intensive. It is anticipated that, for future combatants, the workload demand arising from operation of systems under conditions of normal steaming and during casualty response will need to be markedly reduced via automated monitoring, autonomous control, and other technology initiatives. Current DDG 51 class ships can be considered as a manpower baseline and under Condition III typical engineering control involves seven to eight watchstanders at manned stations in the Central Control Station, the engine rooms and other machinery spaces. In contrast to this manning level, initiatives such as DD 21 and the integrated engineering plant (IEP) envision a partnership between the operator and the automation system, with more and more of the operator's functions being shifted to the automation system as manning levels decrease. This paper describes some human systems integration studies of workload demand reduction and, consequently, manning reduction that can be achieved due to application of several advanced technology concepts. Advanced system concept studies in relation to workload demand are described and reviewed including. Piecemeal applications of diverse automation and remote control technology concepts to selected high driver tasks in current DDG 51 activities. Development of the reduced ship's crew by virtual presence system that will provide automated monitoring and display to operators of machinery health, compartment conditions, and personnel health. The IEP envisions the machinery control system as a provider of resources that are used by various consumers around the ship. Resource needs and consumer priorities are at all times dependent upon the ship's current mission and the availability of equipment pawnbrokers.

关键词： Naval warfare

来源：评论

学校读者我要写书评

暂无评论

TSP cuts which do not conform to the template paradigm 5th

引用

5th International Conference on Mobile Agents, MA 2001

作者： Applegate, David Bixby, Robert Chvátal, Vašek Cook, William Algorithms and Optimization Department AT and T Labs – Research Florham ParkNJ07932 United States Computational and Applied Mathematics Rice University HoustonTX77005 United States Department of Computer Science Rutgers University PiscatawayNJ08854 United States Program in Applied and Computational Mathematics Princeton University PrincetonNJ08544 United States

ISBN: (纸本)3540428771

The first computer implementation of the Dantzig-Fulkerson- Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory’s type. The practice of looking for and using cuts that match prescribed templates in conjunction with Gomory cuts was continued in computer codes of Miliotis, Land, and Fleischmann. Gr¨otschel, Padberg, and Hong advocated a different policy, where the template paradigm is the only source of cuts;furthermore, they argued for drawing the templates exclusively from the set of linear inequalities that induce facets of the TSP polytope. These policies were adopted in the work of Crowder and Padberg, in the work of Gr¨otschel and Holland, and in the work of Padberg and Rinaldi;their computer codes produced the most impressive computational TSP successes of the nineteen eighties. Eventually, the template paradigm became the standard frame of reference for cutting planes in the TSP. The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates. Combining this technique with the traditional template approach was a crucial step in our solutions of a 13,509-city TSP instance and a 15,112-city TSP instance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

TWO ALGORITHMS FOR LC^1 UNCONSTRAINED OPTIMIZATION

引用

Journal of Computational mathematics 2000年第6期18卷 621-632页

作者： Wen-yu Sun R.J.B.de Sampaio Jin-Yun Yuan School of Mathematics and Computer Science Nanjing Normal UniversityNanjing 210097China Applied Informatics Program Pontifical Catholic University of ParanaCuritibaPR81611-970Brazil Department of Mathematics Federal University of ParanaCuritibaPR81531-990Brazil

Presents two algorithms for LC unconstrained optimization problems which use the second order Dini upper directional derivative. Simplicity of the methods to use and perform; Discussion of related properties of the it... 详细信息

关键词： nonsmooth optimization directional derivative Newton-like method convergence trust region method

来源：评论

学校读者我要写书评

暂无评论

A trace bound for the hereditary discrepancy 00

A trace bound for the hereditary discrepancy

引用

Proceedings of the sixteenth annual symposium on Computational geometry

作者： Bernard Chazelle Alexey Lvov Department of Computer Science Princeton University and NEC Research Institute Program in Applied and Computational Mathematics Princeton University

来源：评论

学校读者我要写书评

暂无评论

A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube 99

A lower bound on the complexity of approximate nearest-neigh...

引用

Proceedings of the thirty-first annual ACM symposium on Theory of Computing

作者： Amit Chakrabarti Bernard Chazelle Benjamin Gum Alexey Lvov Department of Computer Science Princeton University Department of Computer Science Princeton University and NEC Research Institute Program in Applied and Computational Mathematics Princeton University

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：