一种新的对潜应召搜索法及其效能分析

论述了一种新的对潜应召搜索法 ,并对其效能进行了分析 ,同时就平均发现概率、搜索时间、转向次数三个指标与海军现在使用的扩展方阵搜索法进行了仿真比较     

以太网交换机仿真与验证

叙述了以太网交换机的结构、端口缓存交换策略,从排队论出发建立仿真模型和仿真流程,按数理统计原理用t函数进行均值假设检验,验证仿真模型及流程的可信度。文章叙述以太网交换机仿真模型与算法对进行计算机网络仿真有参考价值。     

MABAC method for multiple attribute group decision making under q-rung orthopair fuzzy environment

As the generalization of intuitionistic fuzzy set (IFS) and Pythagorean fuzzy set (PFS), the q-rung orthopair fuzzy set (q-ROFS) has emerged as a more meaningful and effective tool to solve multiple attribute group decision making (MAGDM) problems in management and scientific domains. The MABAC (multi-attributive border approximation area comparison) model, which handles the complex and uncertain decision making issues by computing the distance between each alternative and the bored approximation area (BAA), has been investigated by an increasing number of researchers more recent years. In our article, consider the conventional MABAC model and some fundamental theories of q-rung orthopair fuzzy set (q-ROFS), we shall introduce the q-rung orthopair fuzzy MABAC model to solve MADM problems. at first, we briefly review some basic theories related to q-ROFS and conventional MABAC model. Furthermore, the q-rung orthopair fuzzy MABAC model is built and the decision making steps are described. In the end, An actual MADM application has been given to testify this new model and some comparisons between this novel MABAC model and two q-ROFNs aggregation operators are provided to further demonstrate the merits of the q-rung orthopair fuzzy MABAC model.     

On the reduction of total‐cost and average‐cost MDPs to discounted MDPs

This article provides conditions under which total‐cost and average‐cost Markov decision processes (MDPs) can be reduced to discounted ones. Results are given for transient total‐cost MDPs with transition rates whose values may be greater than one, as well as for average‐cost MDPs with transition probabilities satisfying the condition that there is a state such that the expected time to reach it is uniformly bounded for all initial states and stationary policies. In particular, these reductions imply sufficient conditions for the validity of optimality equations and the existence of stationary optimal policies for MDPs with undiscounted total cost and average‐cost criteria. When the state and action sets are finite, these reductions lead to linear programming formulations and complexity estimates for MDPs under the aforementioned criteria.© 2017 Wiley Periodicals, Inc. Naval Research Logistics 66:38–56, 2019     

量测误差的时间序列分析方法

针对工程实践中实际量测误差大多并非纯白噪声特点,运用概率统计学的一个分支——时间序列分析中提供的动态数据处理的方法,采用多种的参数估计算法来对量测误差进行拟合和仿真,给出了实验室仿真过程中需叠加的量测误差的新生成办法。所用方法可以推广到对其它数据序列的处理。     

烟雾干扰光学制导武器中Mie散射系数快速算法

烟雾干扰光学制导武器中烟雾中的颗粒物的浓度、平均粒径的精确测量是评价武器隐蔽效果的关键指标。Mie散射中的消光系数计算是烟雾中颗粒物的平均粒径和浓度测量中的关键步骤。在传统Mie散射计算的基础上提出一种适用不同颗粒大小和复折射率的Mie散射系数算法。推导了散射系数计算公式,分析了不同折射率和粒径的递推公式。计算表明,该方法的计算精度高、范围广、时间短,适用于干扰烟雾中生成颗粒物的平均粒径和浓度在线测量。     

语音信号相空间重构中时间延迟选择的改进的平均位移法

本文在分析时间序列相空间重构中的时间延迟选取的平均位移法基础上,对该法的原有度量进行改进,得到较好的求时间延迟的准则。改进的平均位移法具有更强的理论依据;应用于语音信号相空间重构的仿真实验表明,其度量一般情况下可得到合适的时间延迟。     

关于=2~(1/2)的一种推导

应用一级近似下的泰勒级数及统计平均的概念 ,简明地推出公式 u =2 v 。     

Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming

The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes.     

基于相关熵的MACH滤波器

最大平均相关高度(MACH:Maximum Average Correlation Height)滤波器是一种重要的基于相关的模式识别方法。滤波器由训练数据线性构造而成,具有良好的畸变容忍能力,在线性高斯噪声条件下具有理论最优性。为将算法适用于广泛的非线性、非高斯情形,本文引入一种新的度量函数相关熵,可隐性地将输入数据通过非线性变换映射到特征空间;并在新的空间中提出了基于相关熵的MACH滤波器构造方法。最后将此方法应用于合成孔径雷达(SAR:Synthetic Aperture Radar)图像目标分类进行了实验,在接收机工作性能曲线和峰值旁瓣比的比对中,本文算法的性能均有所提升。