基于FTA方法的COVID-19疫情应急防控决策研究

鉴于新型冠状病毒肺炎(COVID-19)的易感染性与聚集性等特点,基于COVID-19的传播机制,应用故障树分析(FTA)方法,研究了具有不同特征的疫情突发事件风险决策问题,包括疫情突发事件的动态演化过程、多种情景以及应急方案对突发事件的影响。通过分析COVID-19疫情突发事件的演化过程,构建故障树来描述导致突发事件演变的条件与因素之间的逻辑关系,给出了不同的可行应急方案。利用FTA预估出疫情突发事件发生的概率,计算出可行应急方案的整体排序值,获得最优应急方案。最后通过一个COVID-19确诊患者的案例分析,验证了所提出的方法的可行性和有效性。     

广义Pareto分布的广义有偏概率加权矩估计方法

广义Pareto分布(GPD)是统计分析中一个极为重要的分布,被广泛应用于金融、保险、水文及气象等领域.传统的参数估计方法如极大似然估计、矩估计及概率加权矩估计方法等已被广泛应用,但使用中存在一定的局限性.虽然提出很多改进方法如广义概率加权矩估计、L矩和LH矩法等,但都是研究完全样本的估计问题,而在水文及气象等应用领域常出现截尾样本.本文基于概率加权矩理论,利用截尾样本对三参数GPD提出一种应用范围广且简单易行的参数估计方法,可有效减弱异常值的影响.首先求解出具有较高精度的形状参数的参数估计,其次得出位置参数及尺度参数的参数估计.通过Monte Carlo模拟说明该方法估计精度较高.     

状态概率的E-Bayes估计与多层Bayes估计

在文献[1]中提出了参数估计的一种方法--E-Bayes估计并给出了状态概率的E-Bayes估计的定义、E-Bayes估计公式、预测模型及其在证券投资中应用,本文在此基础上将给出状态概率的多层Bayes估计、状态概率的E-Bayes估计的性质--E-Bayes估计,多层Bayes估计的关系.最后,给出模拟算例.     

失效概率的E-Bayes估计及其性质

该文提出了参数的一种新估计方法----- E-Bayes估计法. 在无失效数据情形, 给出了失效概率的E-Bayes估计的定义,在此基础上给出了失效概率的E-Bayes估计, 并给出了失效概率的E-Bayes估计的性质----- E-Bayes估计和多层Bayes估计的关系.最后, 给出了模拟算例, 结果表明该文提出的E-Bayes估计法可行且便于应用.     

无失效数据失效概率的Bayes估计

本文对无失效数据(ti,ni)在ti 时刻的失效概率pi= P｛T< ti｝的先验密度的核为(1- pi)k时,给出了pi 的Bayes估计和多层Bayes估计,由此可以得到无失效数据可靠度的估计.最后,结合实际问题进行了计算.     

独立同分布随机变量加权和的概率估计

设{ξ_i}_i=1ⁿ为独立同分布的随机变量,且P(ξ_i=1)=P(ξ_i=-1)=1/2.设a=(a₁,…,a_n)为与{ξⁱ}_i=1ⁿ独立的服从超球面S^n-1={(a₁,…,a_n)∈Rⁿ|∑_i-1ⁿ a_i²=1}上均匀分布的随机变量,该文用极坐标变换得到了P(|∑_i=1ⁿ a_iξ_i|≤1)的表达式.当n<7时,该文通过直接计算得到此概率值大于等于1/2;当n≥8时,该文通过R软件也得到了此概率值大于等于1/2.特别地,n=3,4时,借助于贝塔函数,该文直接证明了该概率值大于等于1/2.     

威布尔分布无失效数据失效概率的估计

通过讨论威布尔分布函数形状参数m的大小,给出各检测时刻失效概率pi的相互关系作为先验信息,得到pi(i=1,2,…,n)的Bayes估计,并且试验数据显示此种方法是可行的.     

平衡数据结构下ANOVA 估计和SD 估计的比较

在线性混合效应模型下, 方差分析(ANOVA) 估计和谱分解(SD) 估计对构造精确检验和广义P-值枢轴量起着非常重要的作用. 尽管这两估计分别基于不同的方法, 但它们共享许多类似的优点, 如无偏性和有精确的表达式等. 本文借助于已得到的协方差阵的谱分解结果, 揭示了平衡数据一般线性混合效应模型下ANOVA 估计与SD 估计的关系, 并分别针对协方差阵两种结构: 套结构和多项分类随机效应结构, 给出了ANOVA 估计与SD 估计等价的充分必要条件.     

风险值的估计及其周期分析

本文提出了两种风险值的估计方法，这两种方法均是先估计出收益的分布，然后求得分布左侧p分位点作为风险值的估计．第一种方法是用核估计方法得到收益的分布估计；第二种方法则是由分布的核估计算得收益的众数，引入所谓的广义半t分布拟合众数左侧的样本．文章以上证指数为实例验证了这两种方法的可行性与精确性．最后我们利用上述两种估计方法得到了上证指数风险值的波动主周期．     

Subset solving algorithm: A novel sensitivity-based method for damage detection of structures

We present an efficient method for structural damage detection using natural frequencies. The method, which is based on sensitivity analysis of the structure, consists of two main stages. In the first stage, the structural elements are ordered based on their damage probability into a vector referred to as elements damage probability ordering vector (EDPOV). In the second stage, a rather small subset of EDPOV elements are judiciously selected to form a nonlinear system of equations, which are subsequently solved to detect potential damages. In the second stage, the procedure of subset selecting and solving iterates until a feasible solution is achieved. In order to assess the merits of the proposed method some illustrative cases are studied. Numerical results demonstrate the high efficiency of the proposed algorithm compared to those found in the literature.     

考虑风险关联情形的风险评估方法研究

针对多个风险之间存在关联的风险评估问题,给出了一种风险评估方法。在本文中,首先依据专家小组给出关于风险关联的评价信息,通过构建综合关联矩阵识别风险之间的影响关系,进而确定风险的层次结构;然后依据确定的可划分或不可划分的风险层次结构以及专家小组给出的风险发生的概率和风险损失,运用概率论相关知识来计算各风险值。最后,通过一个算例说明了本文提出方法的可行性和有效性。     

回归分析中参数估计的一种新方法

本文根据矩阵的广义逆理论,建立了回归分析中进行参数估计的一种新方法,该方法更简单更精确。     

基于多项式混沌拓展模型和bootstrap的结构可靠性分析方法

多项式混沌拓展(polynomial chaos expansion,PCE)模型现已发展为全局灵敏度分析的强大工具,却很少作为替代模型用于可靠性分析。针对该模型缺乏误差项从而很难构造主动学习函数来逐步更新的事实,在结构可靠性分析的框架下提出了基于PCE模型和bootstrap重抽样的仿真方法来计算失效概率。首先,对试验设计(experimental design)使用bootstrap重抽样步骤以刻画PCE模型的预测误差;其次,基于这个局部误差构造主动学习函数,通过不断填充试验设计以自适应地更新模型,直到能够精确地逼近真实的功能函数;最后,当PCE模型具有足够精确的拟合、预测能力,再使用蒙特卡洛仿真方法来计算失效概率。提出的平行加点策略既能在模型更新过程中找到改进模型拟合能力的"最好"的点,又考虑了模型拟合的计算量;而且,当失效概率的数量级较低时,PCE-bootstrap步骤与子集仿真(subset simulation)的结合能进一步加速失效概率估计量的收敛。本文方法将PCE模型在概率可靠性领域的应用从灵敏度分析延伸到了可靠性分析,同时,算例分析结果显示了该方法的精确性和高效性。     

生产函数中参数估计方法的改进

在原有生产函数参数估计方法的基础上,提出一种新的估计方法。计算实例表明:该估计方法具有最小的残差平方和,是一种比较理想的估计方法     

Reliability analysis of non‐repairable systems modeled by dynamic fault trees with priority AND gates

Many real‐life systems are typically involved in sequence‐dependent failure behaviors. Such systems can be modeled by dynamic fault trees (DFTs) with priority AND gates, in which the occurrence of the top events depends on not only combinations of basic events but also their failure sequences. To the author's knowledge, the existing methods for reliability assessment of DFTs with priority AND gates are mainly Markov‐state‐space‐based, inclusion–exclusion‐based, Monte Carlo simulation‐based, or sequential binary decision diagram‐based approaches. Unfortunately, all these methods have their shortcomings. They either suffer the problem of state space explosion or are restricted to exponential components time‐to‐failure distributions or need a long computation time to obtain a solution with a high accuracy. In this article, a novel method based on dynamic binary decision tree (DBDT) is first proposed. To build the DBDT model of a given DFT, we present an adapted format of the traditional Shannon's decomposition theorem. Considering that the chosen variable index has a great effect on the final scale of disjoint calculable cut sequences generated from a built DBDT, which to some extent determines the computational efficiency of the proposed method, some heuristic branching rules are presented. To validate our proposed method, a case study is analyzed. The results indicate that the proposed method is reasonable and efficient. Copyright © 2015 John Wiley & Sons, Ltd.     

A Generalized Single Linkage Method for Estimating the Cluster Tree of a Density

The goal of clustering is to detect the presence of distinct groups in a dataset and assign group labels to the observations. Nonparametric clustering is based on the premise that the observations may be regarded as a sample from some underlying density in feature space and that groups correspond to modes of this density. The goal then is to find the modes and assign each observation to the domain of attraction of a mode. The modal structure of a density is summarized by its cluster tree; modes of the density correspond to leaves of the cluster tree. Estimating the cluster tree is the primary goal of nonparametric cluster analysis. We adopt a plug-in approach to cluster tree estimation: estimate the cluster tree of the feature density by the cluster tree of a density estimate. For some density estimates the cluster tree can be computed exactly; for others we have to be content with an approximation. We present a graph-based method that can approximate the cluster tree of any density estimate. Density estimates tend to have spurious modes caused by sampling variability, leading to spurious branches in the graph cluster tree. We propose excess mass as a measure for the size of a branch, reflecting the height of the corresponding peak of the density above the surrounding valley floor as well as its spatial extent. Excess mass can be used as a guide for pruning the graph cluster tree. We point out mathematical and algorithmic connections to single linkage clustering and illustrate our approach on several examples. Supplemental materials for the article, including an R package implementing generalized single linkage clustering, all datasets used in the examples, and R code producing the figures and numerical results, are available online.     

关于混凝土坝基渗流系统最优线态控制计算的惩罚移位法

研究了惩罚移位法应用于混凝土坝基渗流系统最优控制的计算 ,构造了其逼近程序 ,并证明了这种方法在适当的 Hilbert空间的收敛性 .     

对DEA中有效单元排序的一种新方法

文章对数据包络分析(DEA)的强有效性问题提出了一种新的研究方法.利用有效值和负有效值来构造复合输入和输出这种方法可以实现有效决策单元的完全排序.文章还给出了新方法中模型的一些性质.最后,用两个例子来检验此方法并和其他模型的计算结果进行了比较.