图的极小顶剖的有效枚举算法

设G=(V,E)是无向连通单图,S为G的一个顶子集,G[S]为S的导出子图。若G[V-S]不连通,则称S为G的一个顶剖;若S是G的顶剖,而S的任意真子集都不是G的顶剖,则称S为G的一个极小顶剖。a,b为G中任意两个不相邻的顶,若a,b分别处在G[V-S]的不同连通片中,则称S是G的一个(a,b)顶剖;若S是G的(a,b)顶剖,而S的任意真子集都不是G的(a,b)顶剖,则称S为G的一个极小的(a,b)顶剖。枚举图中所有极小(a,b)顶剖和所有极小顶剖是图论中的一个基本枚举问题,这个问题在网络的可靠性分析和运筹学等方面有着极大的应用价值,已     

Minimal model generation for refined answering of generalized queries in disjunctive deductive databases

Generalized queries are defined as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of disjunctive deductive databases (DDDBs). The advanced approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those that are true in some minimal models of the theory. We address the issue of answering positive queries through the construction of the minimal model state of the DDDB, using a minimal model generating procedure. The refinements allowed by the procedure include isolating a minimal component of a disjunctive answer, the specification of possible updates to the theory to enable the derivability of certain queries and deciding the monotonicity properties of answers to different classes of queries.     

Finding a minimal cover for binary images: An optimal parallel algorithm

Given a black-and-white image, represented by an array of n × n binary-valued pixels, we wish to cover the black pixels with aminimal set of (possibly overlapping) maximal squares. It was recently shown that obtaining aminimum square cover for a polygonal binary image with holes is NP-hard. We derive an optimal parallel algorithm for theminimal square cover problem, which for any desired computation timeT in [logn,n] runs on an EREW-PRAM with (n/T) processors. The cornerstone of our algorithm is a novel data structure, the cover graph, which compactly represents the covering relationships between the maximal squares of the image. The size of the cover graph is linear in the number of pixels. This algorithm has applications to problems in VLSI mask generation, incremental update of raster displays, and image compression.The research reported here forms part of the author's doctoral dissertion, submitted to Cornell University in May 1989. This work was partially supported by NSF Grant DC1-86-02256, IBM Agreement 12060043, and ONR Contract N00014-83-K-0640. A preliminary version of this paper was presented at the 26th Annual Allerton Conference on Communications, Control, and Computing, Monticello, IL, September 28–30, 1988.     

Can we trust PRA?

The Fault-Tree/Event-Tree method is widely used in industry as the underlying formalism of probabilistic risk assessment. Almost all of the tools available to assess Event-Tree models implement the ‘classical’ assessment technique based on minimal cutsets and the rare event approximation. Binary decision diagrams (BDDs) are an alternative approach, but they were up to now limited to medium size models because of the exponential blow up of the memory requirements. We have designed a set of heuristics, which make it possible to quantify, by means of BDD, all of the sequences of a large Event-Tree model coming from the nuclear industry. For the first time, it was possible to compare results of the classical approach with those of the BDD approach, i.e. with exact results. This article reports this comparison and shows that the minimal cutsets technique gives overestimated results in a significant proportion of cases and underestimated results in some cases as well. Hence, the (indeed provocative) question in the title of this article.     

适用于Living PSA的故障树求解方法

Living PSA是当前核电厂的安全分析与评价中最热点的问题之一，Living PSA实现中最为根本而又关键的问题是“速度”问题：在现有PSA方法的基础上，根据Living PSA的特性，设计了一种适用于Living PSA的故障树求解方法，即独立模块排序求解法，并通过例子详细地说明了该方法实现过程：这个方法除了能快速地求解故障树以外，当故障树结构或故障树中部件可靠性模型或数据发生变化时能实时地求解故障树。     

Stable Minimal Hypersurfaces in E~n

局部证明了Ｙａｕ′ｓｃｏｎｊｅｃｔｕｒｅ．获得如下定理；Ｍ为Ｅｎ中稳定极小超曲面且局部紧的，则Ｍ为超平面．     

半球形厚壁封头冲压成形有限元分析及优化

在制造厚壁封头的过程中,经常由于锻造后的封头减薄量过大,最小壁厚值小于规定值,在强度方面不能满足要求;或者锻造后封头壁较厚,增加了机加工量。而厚壁封头冲压成形过程属于几何非线性和材料非线性的问题,很难用弹塑性力学理论的解析法进行研究。采用钢塑性有限元法,使用ANSYS有限元分析软件模拟了半球形厚壁封头冲压成形的整个过程,分析了成形后封头壁厚的变化规律。计算结果表明,封头心部的减薄量并非最大,减薄量最大值出现在靠近坯料中心的地方,边缘的直边部分增厚量最大,最大的减薄量或增厚量均达到坯料厚度的16%左右。通过优化坯料形状和尺寸,使封头易于成形且壁厚均匀。     

旋耕机运动参数的优化设计方法

首先分析了旋耕机单位体积功耗数学模型，根据数学模型的特点，提出用广义最小二乘法确定目标函数和用最速下降法优化运动参数，为旋耕机总体参数的优化设计提供了可靠的计算模型。     

A new algorithm for resolution of the quadratic programming problem with fuzzy relation inequality constraints

The minimization problem of a quadratic objective function with the max-product fuzzy relation inequality constraints is studied in this paper. In this problem, its objective function is not necessarily convex. Hence, its Hessian matrix is not necessarily positive semi-definite. Therefore, we cannot apply the modified simplex method to solve this problem, in a general case. In this paper, we firstly study the structure of its feasible domain. We then use some properties of n × n real symmetric indefinite matrices, Cholesky’s decomposition, and the least square technique, and convert the problem to a separable programming problem. Furthermore, a relation in terms of a closed form is presented to solve it. Finally, an algorithm is proposed to solve the original problem. An application example in the economic area is given to illustrate the problem. Of course, there are other application examples in the area of digital data service and reliability engineering.     

Probit Analysis as a Technique for Estimating the Reliability of a Simple System

In this paper the problem of estimating the relation between reliability and stress is considered for a simple system composed of several, say m, identical but independent components. The parameters of the failure probability equation P = H[F _X (x)] are estimated where F _X (x) has the cumulative normal form. The method of analysis used is a modification of probit analysis.