An efficient algorithm for finding the largest chain graph according to a given chain graph

Chain graph (CG) is a general model of graphical Markov models. Some different chain graphs may describe the same conditional independence structure, then we say that these CGs are Markov equivalent. In 1990 Frydenberg showed that every class of Markov equivalent CGs has a CG which is called the largest chain graph with the greatest number of lines. This paper presents an efficient algorithm for finding the largest chain graph of the corresponding Markov equivalent class of a given CG. The computational complexity of the algorithm is O(n3). It is more efficient than the complexity O(n!) of the present algorithms. Also a more intuitive graphical characterization of the largest chain graph is provided based on the algorithm in this paper.     

Determination/estimation of an optimal replacement interval under minimal repair

In this paper the problem of estimation of an optimal replacement interval for a system which is minimally repaired at failures is studied. The problem is investigated both under a parametric and a nonparametric form of the failure intensity of the system. It is assumed that observational data from n systems are available. Some asymptotic results are shown. A graphical procedure for determining/estimating an optimal replacement interval is presented. The procedure is particularly valuable for sensitivity analyses, for example with respect to the costs involved.     

郑州白糖期货的因果图分析

主要探讨郑州白糖期货价、纽约白糖期货价和郑州白糖现货价格三者之间的动态关系,利用图模型方法、多维的多元线性回归等方法来分析它们之间的相互影响关系.又由于三者之间的关系受到牛市、熊市等市场因素的影响,故在熊市、牛市和震荡市三种情况下分别探讨三者的关联性.结果显示:不论市场是熊市还是牛市或者是震荡市,郑州白糖期货价都受到纽约白糖期货价的影响作用,郑州白糖现货价都受到郑州白糖期货价的影响;在市场为牛市时,纽约白糖期货价对郑州白糖现货价有显著影响.     

基于Eclipse平台的本体图形编辑器的设计与实现

文章通过对Eclipse平台和GEF框架的介绍,分析了Eclipse平台在图形编辑方面的优越性.结合本体编辑,设计并实现了基于Eclipse平台下的本体编辑器,对编辑器的系统结构做了详细地分析.编辑器由模型、视图、控制以及文件四大部分组成,由于采用基于MVC模式的GEF框架,使得软件结构清晰,明显缩短了软件的开发周期,提高了软件的可维护性和代码的重用性.     

凸四边形上一类具有C~2-连续的插值问题的样条解及其应用

本文讨论了一类凸四边形上的插值问题.指出这类插值问题是可解的,其解是分片二元三次多项式,且在凸四边形上是C~2-连续的.我们证明了这类插值问题的解的存在性和唯一性,给出了解样条的分片表达式及其逼近度的估计.最后还给出了一个应用实例和图形显示来说明本方法是可行的.     

The graphical relaxation: A new framework for the symmetric traveling salesman polytope

A present trend in the study of theSymmetric Traveling Salesman Polytope (STSP(n)) is to use, as a relaxation of the polytope, thegraphical relaxation (GTSP(n)) rather than the traditionalmonotone relaxation which seems to have attained its limits. In this paper, we show the very close relationship between STSP(n) and GTSP(n). In particular, we prove that every non-trivial facet of STSP(n) is the intersection ofn + 1 facets of GTSP(n),n of which are defined by the degree inequalities. This fact permits us to define a standard form for the facet-defining inequalities for STSP(n), that we calltight triangular, and to devise a proof technique that can be used to show that many known facet-defining inequalities for GTSP(n) define also facets of STSP(n). In addition, we give conditions that permit to obtain facet-defining inequalities by composition of facet-defining inequalities for STSP(n) and general lifting theorems to derive facet-defining inequalities for STSP(n +k) from inequalities defining facets of STSP(n).Partially financed by P.R.C. Mathématique et Informatique.     

Schemata, Distributions and Graphical Models in Evolutionary Optimization

In this paper the optimization of additively decomposed discrete functions is investigated. For these functions genetic algorithms have exhibited a poor performance. First the schema theory of genetic algorithms is reformulated in probability theory terms. A schema defines the structure of a marginal distribution. Then the conceptual algorithm BEDA is introduced. BEDA uses a Boltzmann distribution to generate search points. From BEDA a new algorithm, FDA, is derived. FDA uses a factorization of the distribution. The factorization captures the structure of the given function. The factorization problem is closely connected to the theory of conditional independence graphs. For the test functions considered, the performance of FDA—in number of generations till convergence—is similar to that of a genetic algorithm for the OneMax function. This result is theoretically explained.