IIR数字滤波器联立优化CAD

文中介绍了多目标联立最佳逼近CAD方法,对各种设计方法的性能作了分析比较,提出了改善途径。程序在IBM-PC/XT微机上运行通过,文中给出了应用线性相位IIR数字滤波器线性规划逼近法设计的低通实例。     

基于Neumann谱和PM谱的海浪感应磁场能量分布计算

结合前人在海浪功率谱以及海浪产生磁场两方面的研究 ,求出了海浪 磁场系统的传递函数 ,分析了该系统的性质 ,并利用该传递函数和Neumann谱、PM谱计算了磁场功率谱 ;在此基础上 ,根据实际观测我国海区的海浪高度 周期分布 ,求解海浪分布参数 ,模拟实际的海浪过程 ,求出了实际情况下的海浪感应磁场功率谱 ,并分析了其特性 .     

An application of yield management for Internet Service Providers

In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

基于Petri网的C2S性能分析方法研究

给出了用时间连续随机Petri网和时间离散随机Petri网计算系统稳态概率的方法,并将其应用于指挥控制系统(C2S)的性能分析中,分析结果表明这种计算方法是可行的。     

Response surface analysis of two‐stage stochastic linear programming with recourse

We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999     

基于约束满足的多目标对地观测卫星成像调度

EOS(对地观测卫星)成像调度需要根据用户提出的成像任务需求确定卫星成像序列,是一个复杂的组合优化问题。考虑到成像侧视约束条件,建立EOS成像调度的多目标有向无环约束图模型。在此模型的基础上提出了基于SPEA2(strength pareto evolutionary algorithm 2)的多目标成像调度算法,采用约束控制技术设计遗传算子处理成像约束。经过三个实际的多目标成像调度问题测试,表明该算法可以有效地解决EOS成像调度问题。     

超燃冲压发动机燃烧室构型优化的试验研究

在直连式超燃冲压发动机试验系统上,通过调节超燃冲压发动机燃烧室壁面扩张角和燃料喷注位置,对燃烧室构型优化进行了试验研究。为了提高试验效率,燃烧室形面调节采用正交试验设计方法进行组织,每个形面进行5种喷注位置的试验,每次试验通过文氏管调节3个当量比的燃料流量。利用试验数据构造燃烧室性能关于构型参数的响应面模型,可用于燃烧室构型优化。通过两次渐进优化获得了性能更优的燃烧室构型,并根据试验数据分析了各构型参数对燃烧室性能的影响,结果表明:优化构型燃烧室的推力增益比基准构型增大了10.4%;燃烧室性能受各构型参数的强烈耦合影响。     

A guarantee rate optimization model for wastewater treatment system design under uncertainty

We consider a design problem for wastewater treatment systems that considers uncertainty in pollutant concentration levels at water sources. The goal is to optimize the selection of treatment technologies and pipeline connections, so that treated wastewater can achieve specified effluents discharge limits as well as possible. We propose a new two-stage model to optimize a set of guarantee levels, that is, the maximum concentration level of source pollutants for which treated wastewater can be compliant with discharge limits. In the first stage, treatment technologies and pipeline connections are selected. In the second stage, when pollutant concentration levels are revealed, wastewater distribution and mixing are determined. A key attractiveness of the proposed guarantee rate optimization model is that it can be simplified into a single-stage mixed-integer linear program. In our numerical experiments based on real-world pollutants data, the guarantee rate model demonstrates its advantages in terms of computational efficiency, scalability and solution quality, compared with the standard probability maximization model. Finally, the methodology proposed in this paper can also be applied to other two-stage problems under uncertainty with similar uncertainty characteristics.     

基于不完全测量数据的飞行器轨迹参数估计

提出基于稀疏优化的轨迹参数估计新方法,通过降低参数空间的维数改善模型的病态性。利用B样条函数实现轨迹参数的稀疏表示,根据轨迹参数与测量数据的关系建立估计轨迹参数的稀疏表示寻优模型,采用高斯牛顿法获得模型的解。寻优模型中待估参数的数量取决于样条节点数,利用样条函数的高阶导数在节点处的不连续性建立了选取样条节点的稀疏优化模型,采用凸优化方法求解该模型,实现样条节点数的最小化。仿真结果表明,稀疏优化方法能够大幅度提高不完全测量段落轨迹参数的估计精度。