Lognormal Approximations of Fault Tree Uncertainty Distributions

Fault trees are used in reliability modeling to create logical models of fault combinations that can lead to undesirable events. The output of a fault tree analysis (the top event probability) is expressed in terms of the failure probabilities of basic events that are input to the model. Typically, the basic event probabilities are not known exactly, but are modeled as probability distributions: therefore, the top event probability is also represented as an uncertainty distribution. Monte Carlo methods are generally used for evaluating the uncertainty distribution, but such calculations are computationally intensive and do not readily reveal the dominant contributors to the uncertainty. In this article, a closed‐form approximation for the fault tree top event uncertainty distribution is developed, which is applicable when the uncertainties in the basic events of the model are lognormally distributed. The results of the approximate method are compared with results from two sampling‐based methods: namely, the Monte Carlo method and the Wilks method based on order statistics. It is shown that the closed‐form expression can provide a reasonable approximation to results obtained by Monte Carlo sampling, without incurring the computational expense. The Wilks method is found to be a useful means of providing an upper bound for the percentiles of the uncertainty distribution while being computationally inexpensive compared with full Monte Carlo sampling. The lognormal approximation method and Wilks’s method appear attractive, practical alternatives for the evaluation of uncertainty in the output of fault trees and similar multilinear models.     

论间接故意与过于自信的过失 --理论与实际的矛盾

间接故意与过于自信的过失是犯罪构成中主观方面最容易混淆的两种罪过,本文对这两种罪过进行了系统的比较,并对两者的实际操作中所体现的矛盾进行了分析,最后文章对矛盾提出了解决的方案。     

Multivariate outlier detection in incomplete survey data: the epidemic algorithm and transformed rank correlations

Summary.  As a part of the EUREDIT project new methods to detect multivariate outliers in incomplete survey data have been developed. These methods are the first to work with sampling weights and to be able to cope with missing values. Two of these methods are presented here. The epidemic algorithm simulates the propagation of a disease through a population and uses extreme infection times to find outlying observations. Transformed rank correlations are robust estimates of the centre and the scatter of the data. They use a geometric transformation that is based on the rank correlation matrix. The estimates are used to define a Mahalanobis distance that reveals outliers. The two methods are applied to a small data set and to one of the evaluation data sets of the EUREDIT project.     

基于移动代理的新型IDS维护更新机制设计

提出了一种基于移动代理的新型分布式入侵检测系统。该系统是针对广域网环境专门设计的,数据的处理通过各节点所设置的代理来进行分布式计算,不仅能实现全网络范围内的入侵检测功能,具有良好的可移植性;而且对网络系统和主机的资源占用较低,减少了出现网络瓶颈的可能。还建立了移动代理的新型分布式入侵检测系统的体系结构和理论分析模型,并讨论了该系统的维护更新机制。     

遗传算法在入侵检测中的应用

介绍了基于模型推理和基于模型两种入侵检测系统,提出了一种新的基于智能体技术的入侵检测系统体系结构,解决了传统集中式入侵检测系统的弊病,将任务处理和数据分布到网络各个结点上,充分利用网络资源协同完成入侵检测任务;介绍了遗传算法在该系统中的应用,因系统安全的先验知识体现在对原始数据中有价值特征属性变量集的选择上,故利用遗传算法对特征属性变量子集的选择进行优化,找到相对最优的由特征向量表示的特征属性变量集,以降低入侵检测系统的负荷。     

CCD图象检测信号的失真校正

本文从CCD图象输入系统误差引起图象检测信号失真的原因分析出发,以降低系统装校误差精度要求和增大元器件离散性的宽容度为目标,讨论朱真校正方法的原理和数学描述。最后,介绍两种失真校正方法。     

论缔约过失责任制度——兼评合同自由与合同正义

缔约过失责任制度的产生与发展是 19世纪下半叶尤其是 2 0世纪以来合同法走向现代化的重要标志之一。缔约过失责任制度的价值论基础 ,就在于诚实信用原则所体现的正义价值与合同自由原则所体现的自由价值构成相倚的两极 ,产生相互亲和的张力。加强对我国缔约过失责任制度的深入研究 ,评析其得失 ,有助于进一步完善我国缔约过失责任制度     

基于规则的MCD磨粒信息诊断专家系统

研究了一种用于发动机磨损状态监测与故障诊断的MCD磨粒信息诊断专家系统 (ES)。首先讨论了诊断知识的获取与规则表示方法 ,接着根据面向对象模板化设计思想 ,研究了一种知识库、推理机和人机界面的一体化构造策略 ,并在此基础上引入深度优先搜索、反向引导正向控制的启发性推理机制     

横向塞曼稳频He－Ne激光器的研究

稳频横向塞曼Ｈｅ－Ｎｅ激光器作为一种新型光源，具有功率大、频差低、易于相位细分的特点，因而能广泛应用于各种精密测量中．本文介绍了我们研制的稳频横向塞曼激光器，实验结果表明，其激光频率稳定度达４．７×１０（－１０），再现性达１．８×１０（－８）．     

Wide Diameters of Cartesian Product Graphs and Digraphs

In graph theory and study of fault tolerance and transmission delay of networks, connectivity and diameter of a graph are two very important parameters and have been deeply studied by many authors. Wide diameter combining connectivity with diameter is a more important parameter to measure fault tolerance and efficiency of parallel processing computer networks and has received much attention in the recent years. Diameter with width k of a graph G is defined as the minimum integer d for which between any two distinct vertices in G there exist at least k internally disjoint paths of length at most d. In the present paper, the tight upper bounds of wide diameter of the Cartesian product graphs are obtained. Some known results can be deduced or improved from ours.