Utility assessment procedures for polynomial-exponential functions

This article develops a methodology for testing constant exchange risk properties and identifying an appropriate form for a decision maker's utility function. These risk properties characterize six different utility functions which are sums of products of polynomials and exponential functions. Such functional forms are commonly used in decision analysis applications. The practical advantage of this methodology is that these constant exchange risk properties eliminate the usual arbitrariness in the selection of a parametric utility function and often reduce the data requirements for subsequent estimation. The procedure is straightforward to apply. The decision maker need only provide certainty equivalents for two-outcome gambles and determine the more-preferred gamble in paired comparisons. The technical details of the procedure can be handled by interactive computer software.     

基于圆阵的二维DOA估计新方法

通过分析圆阵阵列流形,提出一种新的圆阵二维谱估计模型,可以直接应用MUSIC算法进行二维DOA估计,从而避免了对圆阵输出信号进行模式激励.应用此模型仿真分析了均匀圆阵和均匀半圆阵的二维DOA估计性能,相比模式激励方法,减小了计算量;半圆阵与圆阵的DOA性能差别很小,但是半圆阵减少近一半的阵元数.     

飞机电传操纵系统控制律的神经网络实现

现代多功能战机多用电传操纵系统替代传统的机械杆系,但由于飞机的多变量、强耦合和不稳定等强非线性特点,使得其电传控制律的工程实现相当复杂.为此,对电传操纵系统控制律的神经网络实现方法进行了研究.通过利用径向基函数(RBF)网络良好的非线性跟踪性能,探讨了用RBF网络实现电传控制律的一般方法,并以某型飞机电传操纵系统纵向通道为例,对该方法进行了验证.     

基于SDG的物资供应动态过程定性模型的建立

针对物资供应过程仿真中仿真信息不明确、不完整、比较模糊而又难于定量化描述的问题,引入定性仿真中符号定向图(SDG)法,定性分析了通用物资供应的过程.首先,提取物资供应过程中各定性环节要素,对其建立定性关系方程和定性模型(SDG模型图),然后,根据方程和模型仿真结果给出具体环节因素的取值标准.通过实例验证得出了用定性建模的方法研究物资供应动态过程更加简明实际的结论.     

The outfit planning problem: Production planning in shipbuilding

Shipbuilding as currently practiced in U.S. commercial shipyards employs little quantitative modeling or analysis in production planning. This paper presents a brief discussion of the shipbuilding process and focuses on one major component which is referred to as outfitting. The outfit planning problem is described in detail and then formally modeled as a generalization of the resource constrained project scheduling problem. The value of the approach as well as barriers to its adoption are also discussed.     

The continuous multiple-modular design problem

In this article we extend our previous work on the continuous single-module design problem to the multiple-module case. It is assumed that there is a fixed cost associated with each additional module used. The Kuhn–Tucker conditions characterize local optima among which there is a global optimum. Modules are associated with partitions and a special class, guillotine partitions, are characterized. Branch-and-bound, partial enumeration, and heuristic procedures for finding optimum or good guillotine partitions are discussed and illustrated with examples.     

Optimal maintenance models for systems subject to failure–A Review

This paper is a state-of-the-art review of the literature related to optimal maintenance models of systems subject to failure. The emphasis is on work appearing since the 1976 survey, “A Survey of Maintenance Models: The Control and Surveillance of Deteriorating Systems,” by W.P. Pierskalla and J.A. Voelker, published in this journal.     

Solving a (0, 1) hyperbolic program by branch and bound

A problem in (0, 1) hyperbolic programming is formulated and solved by the use of branch and bound methods. Computational results are presented including a comparison among several branching rules. Heuristic methods for quickly finding relatively good feasible solutions are presented and tested. The problem finds application in the scheduling of common carriers. In the solution of the main problem, a subproblem is identified and solved. A geometric analogue is presented, which allows an interesting interpretation of the subproblem. The subproblem itself finds application in the design of gambles.