水下无线传感器网络的节点精确定位

以无线传感器网络(WSN)水下应用为背景,针对特定的环境要求,提出了一种可实现网络规模升级的分布式无锚点网络节点自定位机制。该定位算法通过距离误差估计和分布式坐标计算方法,有效地减少了由于测量距离误差所带来的坐标计算误差和节点坐标计算所带来的通信开销,有利于网络节点能量的合理使用和大规模的WSN布放。通过试验仿真计算,验证了该定位机制的合理性,为水下WSN应用提供了有力的技术支持。     

Subspace dynamic‐simplex linear interpolation search for mixed‐integer black‐box optimization problems

Design and management of complex systems with both integer and continuous decision variables can be guided using mixed‐integer optimization models and analysis. We propose a new mixed‐integer black‐box optimization (MIBO) method, subspace dynamic‐simplex linear interpolation search (SD‐SLIS), for decision making problems in which system performance can only be evaluated with a computer black‐box model. Through a sequence of gradient‐type local searches in subspaces of solution space, SD‐SLIS is particularly efficient for such MIBO problems with scaling issues. We discuss the convergence conditions and properties of SD‐SLIS algorithms for a class of MIBO problems. Under mild conditions, SD‐SLIS is proved to converge to a stationary solution asymptotically. We apply SD‐SLIS to six example problems including two MIBO problems associated with petroleum field development projects. The algorithm performance of SD‐SLIS is compared with that of a state‐of‐the‐art direct‐search method, NOMAD, and that of a full space simplex interpolation search, Full‐SLIS. The numerical results suggest that SD‐SLIS solves the example problems efficiently and outperforms the compared methods for most of the example cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 305–322, 2017     

Alleviating time inconsistent behaviors via a competition scheme

Under quasi‐hyperbolic discounting, the valuation of a payoff falls relatively rapidly for earlier delay periods, but then falls more slowly for longer delay periods. When the salespersons with quasi‐hyperbolic discounting consider the product sale problem, they would exert less effort than their early plan, thus resulting in losses of future profit. We propose a winner‐takes‐all competition to alleviate the above time inconsistent behaviors of the salespersons, and allow the company to maximize its revenue by choosing an optimal bonus. To evaluate the effects of the competition scheme, we define the group time inconsistency degree of the salespersons, which measures the consequence of time inconsistent behaviors, and two welfare measures, the group welfare of the salespersons and the company revenue. We show that the competition always improves the group welfare and the company revenue as long as the company chooses to run the competition in the first place. However, the effect on group time inconsistency degree is mixed. When the optimal bonus is moderate (extreme high), the competition motivates (over‐motivates) the salesperson to work hard, thus alleviates (worsens) the time inconsistent behaviors. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 357–372, 2017     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

区域和参数化可靠性灵敏度指标及其解法

针对基于方差的全局可靠性灵敏度指标,分别提出基于方差的区域和参数化可靠性灵敏度指标,以衡量输入变量的取值区域发生变化时或输入变量的方差减小时整个输入变量系统对失效概率不确定性贡献的变化情况。然后从Pearson相关系数的视角分别将所提指标表述成无条件失效域指示函数与固定某一随机输入时的条件失效域指示函数之间的相关系数。在此转换的基础上,提出基于Pearson相关系数的两种求解方法,一种采用蒙特卡洛方法重复抽样进行循环计算,另一种借鉴重要抽样的思想。功能函数的计算样本可重复使用而不增加任何额外的计算代价,故后者大大提高了求解所提区域和参数化灵敏度指标的计算效率。算例结果验证了所提指标的合理性,同时也证明了所提方法的准确性与高效性。     

一种稳健的循环平稳信号时延估计算法

基于信号循环平稳特性的时延估计算法具有较强的抗干扰和抗噪声能力,但循环频率误差时性能下降严重。针对这一问题,首先分析了循环频率误差对循环时延估计算法中,循环互相关函数相关法估计性能的影响,进而提出了一种对循环频率误差稳健的改进循环时延估计算法。改进算法通过两次搜索确定循环频率的真实值。仿真实验结果表明,改进算法可以有效地校正循环频率误差,最终使时延估计误差与无循环频率误差时基本相同。     

针对舰船目标高分辨距离像的特征选择方法

为了提高基于高分辨距离像(HRRP)的舰船目标识别率,首先通过目标区域提取来解决HRRP的幅度敏感性和平移敏感性的问题;然后根据传统的特征提取方法,提取出15个较好的特征进行多特征综合识别;最后在基于Fisher准则的特征选择方法上进行改进,提出了一种基于特征互补性的特征选择方法,选择一个最优特征子集。通过仿真实验验证了提出的特征选择方法,同时选择出一个最佳分类器。     

飞行器试验多测控目标发射零点应急处理方法

飞行器飞行试验任务中,发射零点T0是整个测控系统启动运行的基准点,是保证测控系统有条不紊正常工作的关键因素。特别是执行多个测控目标连射飞行试验任务,多个发射零点的正确处理更是关乎试验任务的成败。在分析发射零点形成机制基础上,对发射零点在指控系统实时测控软件中的处理方法进行了研究,提出了一种实时测控软件重启后重新获得多测控目标正确发射零点的应急处理方法,解决了试验过程中一旦实时测控软件因重大软件故障导致初始发射零点丢失的问题,保障了试验任务的顺利进行。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

Model parameter estimation and residual life prediction for a partially observable failing system

We consider a partially observable degrading system subject to condition monitoring and random failure. The system's condition is categorized into one of three states: a healthy state, a warning state, and a failure state. Only the failure state is observable. While the system is operational, vector data that is stochastically related to the system state is obtained through condition monitoring at regular sampling epochs. The state process evolution follows a hidden semi‐Markov model (HSMM) and Erlang distribution is used for modeling the system's sojourn time in each of its operational states. The Expectation‐maximization (EM) algorithm is applied to estimate the state and observation parameters of the HSMM. Explicit formulas for several important quantities for the system residual life estimation such as the conditional reliability function and the mean residual life are derived in terms of the posterior probability that the system is in the warning state. Numerical examples are presented to demonstrate the applicability of the estimation procedure and failure prediction method. A comparison results with hidden Markov modeling are provided to illustrate the effectiveness of the proposed model. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 190–205, 2015