带有状态滞后的连续广义系统的鲁棒正实控制﹡

对带有状态滞后的连续广义系统的严格正实性进行了分析,得出了这类系统渐近稳定且严格正实的充分条件,该充分条件与滞后无关。进一步地,对这类系统带有不确定性和控制量的情况进行了研究。提出了一种基于线性状态反馈控制的鲁棒正实控制器设计方法,使得控制器设计可以通过求解线性矩阵不等式方便地加以解决,且保证了闭环系统的严格正实性。最后,通过实例分析说明所提出的鲁棒正实控制器设计方法是可行的、有效的。     

一种基于广义Hough变换的遥感图像船舶横波自动检测与速度估计方法

从Kelvin横波航迹的形成原理出发,详细推导了Kelvin横波波峰模型,提出一种基于广义Hough变换的遥感图像船舶横波自动检测方法,取得了较好的检测效果,并依据检测结果对船舶速度进行了估计。所述方法对海上船舶运输和港口管理等具有重要意义。     

弹道目标微多普勒特性基于逆Radon变换的稀疏表示

作为识别空间弹道目标的有效方法,微多普勒特性提取对于雷达系统的时频分辨率提出了很高的要求,因此,要求雷达系统具有更高的采样频率。作为近年来新兴的技术手段,在远低于奈奎斯特采样定理的采样频率下,压缩感知技术可以对具有稀疏特性的信号实现高精度还原。对空间弹道目标时频分布进行逆Radon变换,在变换后的IRT域内获得时频分布的稀疏表示,从而可以借助压缩感知技术有效降低采样频率的要求。     

数学物理反演问题

介绍数学物理反演问题的概念、由来、历史、分类和特点。     

黑体辐射数值反演新方法

应用广义偏离原则对黑体辐射问题进行了反演的研究,给出了正则参数的选择方法,由计算机仿真结果知,该方法计算精度高,有良好的应用前景。     

基于人工神经网络的操作手IKP 求解

人工神经网络以其信息的并行处理与分布式存储、自组织和自适应等特点,在机器人领域显示了极大的应用潜力。本文探讨人工神经网络在机器人操作手ＩＫＰ求解中的应用,试图求得操作手ＩＫＰ的一组或所有可行解。文章利用ＢＰ网络对操作手ＩＫＰ的求解进行了讨论和分析,并给出了具体的求解实例。     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001     

Bayesian inference based on partial monitoring of components with applications to preventive system maintenance

Consider a binary, monotone system of n components. The assessment of the parameter vector, θ, of the joint distribution of the lifetimes of the components and hence of the reliability of the system is often difficult due to scarcity of data. It is therefore important to make use of all information in an efficient way. For instance, prior knowledge is often of importance and can indeed conveniently be incorporated by the Bayesian approach. It may also be important to continuously extract information from a system currently in operation. This may be useful both for decisions concerning the system in operation as well as for decisions improving the components or changing the design of similar new systems. As in Meilijson [12], life‐monitoring of some components and conditional life‐monitoring of some others is considered. In addition to data arising from this monitoring scheme, so‐called autopsy data are observed, if not censored. The probabilistic structure underlying this kind of data is described, and basic likelihood formulae are arrived at. A thorough discussion of an important aspect of this probabilistic structure, the inspection strategy, is given. Based on a version of this strategy a procedure for preventive system maintenance is developed and a detailed application to a network system presented. All the way a Bayesian approach to estimation of θ is applied. For the special case where components are conditionally independent given θ with exponentially distributed lifetimes it is shown that the weighted sum of products of generalized gamma distributions, as introduced in Gåsemyr and Natvig [7], is the conjugate prior for θ. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 551–577, 2001.     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034