Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

低速圆管流动的粒子仿真

运用信息保存法对低速圆管的流动现象进行了模拟,并与实验结果进行了比较,粒子仿真结果与实验结果吻合较好,且优于NS方程的结果。研究表明,在对低速圆管的模拟过程中,运用IP法在获得较好的结果的同时,具有比DSMC方法更高的计算效率。IP算法是解决低速圆管流动问题的有效途径。     

Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria

In this article an interactive method is developed to identify and rank a most preferred subset, T, of alternatives assuming that the decision maker has an implicit quasiconcave nondecreasing utility function. The method requires the decision maker to compare pairs of selected alternatives. Based on the responses of the decision maker, convex cones are constructed to eliminate alternatives that are proved to be inferior to alternatives in set T. The method aims at keeping the number of pairwise comparisons small. Computational experience with the method indicates that the required number of pairwise comparisons to form set T is usually small. However, the number of pairwise comparisons needed to confirm that this set is best may be large.     

连续波雷达低仰角测量算法研究

针对采用频域比相测角的连续波体制雷达,提出了一种基于频域比幅测角的低仰角测量算法.通过分析比相测角与比幅测角的关系,得到可以通过在频域比幅实现连续波雷达角度测量的结论.结合C2算法,实现了连续波雷达低仰角测量算法.通过实际试验结果分析,表明该算法具有优良的抗多径干扰性能.     

Replicated batch means for steady‐state simulations

This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

用多点随机激励进行结构模态试验分析

本文利用通用仪器设备和微型机采用多点随机激励法对某导弹进行了试验模态分析,并与单点随机激励和稳态正弦调模的结果进行了比较。同时对Bendat公式进行了新的解释和推导。     

Exact bayesian estimation of system reliability from component test data

System reliability is often estimated by the use of components' reliability test results when system test data are not available, or are very scarce. A method is proposed for computing the exact posterior probability density function, cumulative distribution function, and credible intervals for system reliability in a Bayesian setting, with the use of components' prior probability distributions and current test results. The method can be applied to series, parallel, and many mixed systems. Although in theory the method involves evaluating infinite series, numerical results show that a small number of terms from the infinite series are sufficient in practice to provide accurate estimates of system reliability. Furthermore, because the coefficients in the series follow some recurrence relations, our results allow us to calculate the reliability distribution of a large system from that of its subsystems. Error bounds associated with the proposed method are also given. Numerical comparisons with other existing approaches show that the proposed method is efficient and accurate. © 1997 John Wiley & Sons, Inc.     

群决策理论在多机协同空战机动决策中的应用

针对近距空战中多架战机对空中的多个敌对目标进行协同攻击的机动决策问题进行了研究。将群决策理论引入多机协同空战机动决策,首先确定了决策成员与候选方案,然后基于战场态势评估提出了采用风险决策准则的偏好排序确定方法,给出了集结偏好的序数型群决策方法。在不同空战想定条件下进行仿真,结果表明,该方法合理、可行,具有良好的应用前景。     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

新型小规模装备备件品种确定的犹豫模糊粗糙集决策方法

针对新研装备备件品种确定过程中决策信息“犹豫性”和“模糊性”特点突出、难以运用传统备件品种确定方法进行决策的问题,提出一种基于犹豫模糊粗糙集的备件品种确定方法。利用风险偏好系数对不完备犹豫模糊信息进行数值延拓,为构建不同风险偏好下备件品种确定的犹豫模糊决策信息系统奠定了基础；考虑得分函数和数值延拓边界的综合因素影响给出了改进的包含度计算公式,并基于包含度定义进行了证明；给出了基于改进包含度计算的备件品种决策属性的约简条件和规则获取方法,实现了犹豫模糊决策信息的深度挖掘和有效利用。以某新研装备备件品种确定为例进行了方法验证,研究结果表明：通过该法能够有效处理犹豫模糊决策信息,获取精简实用的备件品种决策规则集,验证了方法的可行性。     

PSOR方法的比较性定理

给出了一种PSOR方法,在理论上证明了PSOR方法的渐近收敛速度快于基本的AOR迭代法．同时,给出了在条件0〈ω≤1下,PSOR方法中参数ω的最优值．最后用数值例子验证了所得的主要结论．     

An exact algorithm for the maximal covering problem

This article develops a robust, exact algorithm for the maximal covering problem (MCP) using dual-based solution methods and greedy heuristics in branch and bound. Based on tests using randomly generated problems with problem parameters similar to those in the existing literature, the hybrid approach developed in this work appears to be effective over a wide range of MCP model parameters. The method is further validated on problems constructed from three real-world data sets. The extensive computational study compares the new method with other existing exact methods using problems that are as big, or larger than, those used in previous work on MCP. The results show that the proposed method is effective in most instances of MCP. In particular, it is shown that bounding schemes using Lagrangian relaxation are effective on MCP as a method of obtaining both exact and heuristic solutions. © 1996 John Wiley & Sons, Inc.     

单星定向原理及GPS仿真试验

介绍了一种新的卫星定向方法,该方法仅利用一颗地球静止轨道卫星完成定向;介绍了利用GPS卫星进行单星定向原理验证试验的方法、条件和结果。试验结果表明,对于3m长基线,单星定向精度可达0.05°。从而说明利用一颗地球静止轨道卫星进行定向,在原理上是正确可行的。     

Gabor二进制编码异源图像匹配方法

异源图像匹配是图像处理领域尚未解决的问题。其中,合成孔径雷达图像与光学图像差异较大,用现有方法匹配通常难以得到满意结果。针对这个问题,提出一种基于Gabor编码的异源图像匹配方法:选取一组Gabor滤波器,分别对大图和小图进行Gabor卷积;采用池化方法对卷积结果进行压缩表示;对池化结果二值化并转换为二进制表示得到Gabor二进制编码特征;采用二进制位操作计算实时图与基准图对应窗口特征的相似性,相似性最大值对应图像匹配结果。本方法采用二进制对图像进行描述,减少了计算量,同时也更好地描述了异源图像间的共性特征。实验结果表明,本方法具有较高的匹配概率,计算时间少于现有方法。     

剪刀撑水泥砂浆网薄层加固砌体墙体拟静力试验

主拉应力破坏是砌体结构在地震荷载作用下最常见的一种破坏形式,剪刀撑水泥砂浆网薄层加固法就是针对砌体结构抵抗主拉应力不足的一种加固方法。为了考察该方法加固砌体墙体的受力性能及加固效果,对6片砂浆强度不同、加固方法不同的墙体试件进行了拟静力试验。试验结果表明：剪刀撑水泥砂浆网薄层加固法能够明显提高砌体墙体的抗剪承载力;该方法更适合于加固砂浆强度较低的砌体墙体;采用该方法加固后的砌体墙体破坏形式以剪切滑移破坏为主;加固面层能够与原有墙体较好地共同工作。目前剪刀撑水泥砂浆网薄层加固法是一个崭新的课题,该拟静力试验给出的试验分析结果和建议可供相关研究和加固工程设计参考。     

基于尺度选择性的空间数据源选择与预取策略

合理高效的数据源选择策略是提高空间信息检索系统效率的重要因素之一。针对以往研究中对空间尺度语义关注程度的不足,提出一种结合空间尺度语义选择检索数据源的方法。该方法综合考虑人眼视觉特性,计算出参与分布式查询计划生成的数据源集合,过滤在尺度意义上对最终查询结果无影响的数据源,并通过将数据源的简化表达进行预取,进一步减少了查询的整体执行代价。实验结果表明,提出的方法在大尺度查询和小尺度查询时均具有良好的性能。     

航天测控通信系统可靠性分析的Krylov子空间投影算法

基于Markov模型对航天测控通信系统进行可靠性分析的过程中,若系统中测控通信设备数量较多,模型中的状态空间随设备数量呈指数增长,将会导致数值计算困难.提出了一种基于Krylov子空间技术的可靠性分析方法,将大规模问题投影至小规模子空间中,求得问题的近似解.实验结果证明,Krylov子空间方法的计算速度及精度优于Ross方法和前向Euler法(forward Euler method,FEM).     

柴油机PID、F并联调速控制研究

为了提高柴油机动态和稳态控制性能,提出了PID、F并联调速控制的方法,并利用Matlab/Simulink工具箱对PID、F交替调速控制和并联调速控制进行了仿真研究,表明Fuzzy-PID并联控制的性能优于常规PID控制和单纯的模糊调速控制以及PID、F交替调速控制的调速性能.     

高超声速流动计算中LU-SGS隐式算法的应用研究

在高超声速条件下,对原始LU-SGS格式及其改进方法的收敛速度做了深入地比较分析,目的是进一步更好地将LU-SGS算法用于工程上复杂外形的计算模拟当中。二维圆柱,三维钝锥及空天飞机算例的结果表明：(i)对于高超声速粘性流动的计算,粘性项应进行隐式处理;(ii)BLU-SGS方法给出的内迭代方式的收敛性优于DP-LUR方法所给出的内迭代方式;(iii)LU-SGS算法中雅克比系数矩阵的计算方式对计算量及收敛性影响较大,若采用精确的矩阵形式则在流动无分离情况下能取得快速收敛的效果,而在含有流动分离的情况因受稳定性的影响精确的矩阵形式的收敛表现不及对角近似形式。     

Locating a target from directional data

Statistical estimation plays an important role in locating a target in space, a task that has important applications in many areas. However, theoretical measures on the quality of various estimators reported in the literature have been difficult to obtain because of mathematical complications. As a result, choice of estimator in practice has been largely arbitrary. In this paper, we present a systematic study on major target estimators reported in the literature. Focus is on comparisons between the traditional angle method, the line method, and a recently developed line-to-point transformation method. Insights gained from the study directly lead to the development of a novel two-stage angle method that not only produces highly accurate target estimation among all known estimators but is also computationally efficient. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 353–364, 1998