基于模糊故障树的高速列车电流互感器可靠性分析

针对目前高速列车差动保护系统所使用的直通式电流互感器的结构与运行方式,结合主要元件的故障模式和机理,构建故障树模型,采用下行法计算其最小割集为84个,利用专家评分法与梯度模糊数相结合的方法计算故障树各个底事件与中间事件的发生概率及其权重,进而计算出顶事件的失效概率,发现其可靠度较高,其中绕组故障对顶事件(电流互感器失效)的贡献度最高,通过与传统的模糊故障树分析法作比较,体现出了本文所提算法的优越性。可为高速列车电力牵引系统的可靠性量化分析与评估奠定基础,为动车组电流互感器的运营维护决策提供依据。     

利用模拟退火遗传算法实现图像阈值分割

本文提出了一种利用模拟退火算法和遗传算法相结合的图像阈值分割算法,试验结果表明该算法增强了算法的全局收敛性,加快了算法的收敛速度,提高了图像阈值分割的效率.     

产品质量危机事件原因挖掘模型研究

为有效解决因产品质量危机事件发生原因揭示不准确而导致应对措施选择与实施不当问题,根据产品质量危机影响因素发掘结果,提取出了产品质量危机事件可能原因,采用故障树法构建了质量危机事件潜在原因关系模型;将故障树法和贝叶斯网络相结合,基于专家调查与模糊集理论,推理出底层原因先验概率算法,并将其先验概率输入贝叶斯网络模型,获得底层原因后验概率及关键重要度,将后验概率及关键重要度共同作为质量危机事件关键原因诊断依据,构建了质量危机事件原因挖掘模型;通过实际案例验证了关键原因挖掘结果的准确性,为企业挖掘质量危机事件发生原因提供了理论依据。     

一种故障树分析的新算法

本论文中，首先引入了ＢＤＤ（ＢｒｉｎａｒｙＤｅｃｉｓｉｏｎＤｉａｇｒａｍｓ－ＢＤＤ）的概念，介绍由故障树到ＢＤＤ转化算法一递归法，及ＢＤＤ进行故障树分析的方法。     

机助故障树分析的统一算法

本文提出一种机助故障树分析的统一算法。该算法能给出原故障树的全部模块子树,各模块子树及其对偶模块子村的不交蕴涵族,原故障树的质蕴涵族,完成常规的定量计算和某些新的定量分析。它与Willie的算法相比较功能更全也更为有效。     

环Z／（m）上两种序列综合算法之间的关系

有限域Fq上单条序列的综合算法有著名的Berlkamp-Massey算法(简记B-M算法)，Reeds和Sipane(1985)将这一算法推广到整数同余类环Z／(m)上．作者曾利用推广的Gr6bner基理论，蛤出了环Z／(m)上单条及多条序列的新的综合算法，简称G-算法．本文讨论这两种序列综合算法之间的关系，并证明了G-算法和B-M算法对域上序列的综合是等价的；对环Z／(m)上的序列，通过对G-算法适当改进，可以顺序得到由推广的B-M算法求得的特征多项式．     

基于贝叶斯网络的多态故障树分析方法

针对多态系统故障树分析的难点,通过一个多态雷达系统的实例给出了一种基于贝叶斯网络的多态故障树分析方法.首先根据多态故障树的结构建立贝叶斯网络的拓扑结构,然后根据多态逻辑算子对其进行定量化,进而利用贝叶斯网络分析多态故障树顶事件概率、部件重要度及其它结果.最后通过对实例的分析说明了基于贝叶斯网络的多态故障树分析方法有更强的建模分析能力.     

一类MPEC问题的SQP算法

本文研究带线性互补约束规划问题的 SQP算法 .该算法不要求精确计算初值 ,是针对初值非精确计算情形的新算法 ,证明了该算法的收敛性 .     

基于模糊故障树的动车组塞拉门系统可靠性分析

塞拉门系统作为动车组的重要组成部分,在动车组的运营过程中,其可靠性的高低直接关系到列车运营的安全性。通过对CHR5型动车组塞拉门系统历史故障数据统计及分析的基础上,将模糊数学理论与故障树方法相结合,对塞拉门系统可靠性进行分析。首先建立了以塞拉门发生故障为顶事件的模糊故障树;然后采用定量分析法,得到了顶事件的故障概率;最后对故障树各个底事件进行重要度分析,得到会影响塞拉门系统的薄弱环节。该分析结果为动车组安全可靠的运营提供了数据分析基础。     

基于故障树分析的堰塞湖溃坝概率估计方法

堰塞湖排险的一个关键问题是如何针对实施不同应对措施情况下的堰塞湖溃坝概率进行估计,这是一个值得关注的重要研究课题。本文提出了一种基于故障树分析(FTA)的堰塞湖溃坝概率估计方法。首先,通过堰塞湖排险问题的实际背景分析,基于FTA构建了堰塞湖溃坝故障树的基本架构;然后,通过相关领域知识、历史案例分析、专家主观判断和多位专家主观判断信息的融合,可以确定实施某一应对措施情形下故障树中各基本事件在不同时段内发生的概率;进一步地,依据构建的故障树和基本事件发生的概率,给出了在不同时段内堰塞湖溃坝事件发生的概率的估计方法。最后,通过一个实例分析说明了本文所提出方法的可行性与有效性。     

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time

We describe a randomized algorithm for computing the trapezoidal decomposition of a simple polygon. Its expected running time is linear in the size of the polygon. By a well-known and simple linear time reduction, this implies a linear time algorithm for triangulating a simple polygon. Our algorithm is considerably simpler than Chazelle's [3] celebrated optimal deterministic algorithm. The new algorithm can be viewed as a combination of Chazelle's algorithm and of simple nonoptimal randomized algorithms due to Clarkson et al. [6], [7], [9] and to Seidel [20]. As in Chazelle's algorithm, it is indispensable to include a bottom-up preprocessing phase, in addition to the actual top-down construction. An essential new idea is the use of random sampling on subchains of the initial polygonal chain, rather than on individual edges as is normally done. Received April 18, 2000, and in revised form December 7, 2000. Online publication June 20, 2001.     

Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

In this paper, we address a two-machine flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that the processing time of a job is a simple linear function of its execution start time. The objective is to find a sequence that minimizes total weighted completion time. Optimal schedules are obtained for some special cases. For the general case, several dominance properties and two lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational analysis on randomly generated problems is conducted to evaluate the branch-and-bound algorithm and heuristic algorithm.     

线性规划新算法的改进

本文基于算法要简单实用的思想,对一种线性规划新算法中的核心算法进行改进,使其计算方法更简单计算量更小,使整个算法更为可行有效。     

A two-step algorithm of smooth spline generation on Riemannian manifolds

This paper presents a simple geometric algorithm to generate splines of arbitrary degree of smoothness in Euclidean spaces. Unlike other existing methods, this simple geometric algorithm does not require a recursive procedure and, consequently, introduces a significant reduction in calculation time. The algorithm is then extended to other complete Riemannian manifolds, namely to matrix Lie groups and spheres.     

Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm

Machine-loading problem of a flexible manufacturing system is known for its complexity. This problem encompasses various types of flexibility aspects pertaining to part selection and operation assignments along with constraints ranging from simple algebraic to potentially very complex conditional constraints. From the literature, it has been seen that simple genetic-algorithm-based heuristics for this problem lead to constraint violations and large number of generations. This paper extends the simple genetic algorithm and proposes a new methodology, constraint-based genetic algorithm (CBGA) to handle a complex variety of variables and constraints in a typical FMS-loading problem. To achieve this aim, three new genetic operators—constraint based: initialization, crossover, and mutation are introduced. The methodology developed here helps avoid getting trapped at local minima. The application of the algorithm is tested on standard data sets and its superiority is demonstrated. The solution approach is illustrated by a simple example and the robustness of the algorithm is tested on five well-known functions.     

有限域上多项式集的简单分解

研究如何将任意有限域上的多项式集分解为有限多个简单列.为了解决这一问题,首先研究简单列和根理想之间的关系,然后基于已有的正则分解算法和有限域上理想的根的两种计算方法设计一个有限域上多项式集的简单分解算法.计算试验表明,文章给出的算法是有效的.     

On success rates for controlled random search

Controlled Random Search (CRS) is a simple population based algorithm which despite its attractiveness for practical use, has never been very popular among researchers on Global Optimization due to the difficulties in analysing the algorithm. In this paper, a framework to study the behaviour of algorithms in general is presented and embedded into the context of our view on questions in Global Optimization. By using as a reference a theoretical ideal algorithm called N-points Pure Adaptive Search (NPAS) some new analytical results provide bounds on speed of convergence and the Success Rate of CRS in the limit once it has settled down into simple behaviour. To relate the performance of the algorithm to characteristics of functions to be optimized, constructed simple test functions, called extreme cases, are used.     

带等式约束的光滑优化问题的一类新的精确罚函数

罚函数方法是将约束优化问题转化为无约束优化问题的主要方法之一. 不包含目标函数和约束函数梯度信息的罚函数, 称为简单罚函数. 对传统精确罚函数而言, 如果它是简单的就一定是非光滑的; 如果它是光滑的, 就一定不是简单的. 针对等式约束优化问题, 提出一类新的简单罚函数, 该罚函数通过增加一个新的变量来控制罚项. 证明了此罚函数的光滑性和精确性, 并给出了一种解决等式约束优化问题的罚函数算法. 数值结果表明, 该算法对于求解等式约束优化问题是可行的.     

求最大匹配的一个新算法

简单无向图G的最大匹配问题分为二部图和一般图的最大匹配两类。前者主要采用可增广路的思想解决,〔1〕中已经详述;本文主要讨论有关后者的算法。 定义 设G=(V,E)是简单无向图,在G的所有匹配M′中,若M=max|M′|,则称M是G的一个最大匹配。     

求解用户平衡与系统最优模型的新算法

近些年,国内外许多学者针对交通规划提出了诸如用户平衡(UE)、系统最优(SO)等模型,但由于交通网络的复杂性,这些模型的求解相对困难,考虑到在一般的UE、S0模型中,其约束条件为线性约束与非负约束,给出一种求解交通规划模型的新算法,算法不需使用任何线搜索,只要通过求解一个简单的二次规划问题得到下降方向即可,最后,将该算法应用到简单的交通网络中,并通过与相继平均法(MSA)进行比较,验证了该算法的收敛速度较快。