词偏序集的Mbius函数的Cohen-Macaulay性质的推广

本文主要利用偏序集的同调方法，给出任意两个分层偏序集的等价分类映射概念；证明了该映射是保Cohen-Macaulay性质的．本文的结论部份回答了B．Stechin[1]的问题，同时推广了词偏序集的Mobins函数的符号交错性．     

离散偏序集上的最优停点和最优策略

本文将[1]中定理1的一致有界性条件减弱到A~ 条件并首次得到了偏序集上最优停点和最优策略的充要条件.     

偏序集最小顶点割算法与最小费用赶工问题

在网络计划问题中,一项大的工程由许多工序合成。工序与工序之间存在着一定的前后关系,每个工序有着自己的正常加工时间和通过赶工所能达到的最短加工时间以及每赶工一天的赶工费用。设一项工程的正常工期为T天,通过对所有可能的工序赶工,整个工程能达到的最短工期为S天。本文的问题是,对于任意给定的t(S t相似文献   

群的一个Domain结构

群可以通过在其上赋予循环群拓扑构造群的Domain模型，从而实现群的可计算性。群上的循环群偏序集及其对偶都是连续的偏序集，这个连续偏序集是代数Domain的充分必要条件是群的单位元是代数元。如果在pseudo-有限的群G及其循环群偏序集的对偶￡^op[G]上分别赋予循环群拓扑和Scott拓扑，那么恒同函数是连续的。     

从树型集上最优停止问题到一般偏序集上最优停止问题

本文讨论了树型集上与偏序集上最优停止问题两者间的关系，证明了最优策略与最优控制变量的一一对应关系，从而导出最优策略．可在最优控制变量中取到．     

偏序集的完备化

首先给出了偏序集的一些完备化的具体构造，又给出了关于完备格中完备子集的某些有用的定理，最终解决了关于偏序集的所有可能的完备化问题     

Rasche方法在偏序集上最优集止问题中的应用

本用Ｒａｓｃｈｅ方法对偏序集Ｓ中的点进行了筛选，筛选算法简单明了。设Ｂ（Ｅ）记筛选后的点集，我们证明了１）Ｖ＝ｓｕｐ ＥＸｒ＝ｓｕｐ｛ＥＸτ：τ∈Ｂ（Ｅ）｝；２）若最优停点存在，则必几乎处处取值于Ｂ（Ｅ）中。     

元素个数不超过6的真伪BCK-代数

研究元素个数不超过6的真伪BCK-代数的计数问题.首先,证明了在元素个数不超过3的偏序集上不存在真伪BCK-代数.其次,引入NP-型偏序集(不存在真伪BCK-代数的含重大元的偏序集)、偏序集的层、次余原子等概念,证明了在一个层数n≤3的NP-型偏序集上添加孤立余原子(或孤立次余原子或上邻元的个数n≥3的极小次余原子)后得到的偏序集也是NP-型偏序集,由此得到26种NP-型偏序集(元素个数n≤6).最后,借助Matlab软件编程计算得出所有非同构的元素个数不超过6的真伪BCK-代数,其中元素个数为4的真伪BCK-代数2个,元素个数为5的真伪BCK-代数34个,元素个数为6的真伪BCK-代数631个.     

HC-偏序集的若干性质

基于超连续格的内蕴式刻画,引入HC-偏序集的概念,讨论了HC-偏序集的一些性质.类似地,作为超代数格的推广,引入了HA-偏序集并讨论其相关性质.     

偏序集的关联环的同构问题

设Ｘ是局部有限偏序集（或拟序集），Ｒ是含１的结合环，Ⅰ（Ｘ，Ｒ）是Ｒ上Ｘ的关联环，关联环的同构问题是指：问题１：怎样的环，能使环同构Ⅰ（Ｘ，Ｒ）Ⅰ（Ｘ，Ｒ）推出偏序集之间的同构Ｘ芒Ｘ’？问题２：怎样的环或偏序集，能使环同构Ⅰ（Ｘ，Ｒ）Ⅰ（Ｘ，Ｓ）推出Ｒ　Ｓ？本文证明了对唯一幂等元环（非交换），问题１有正面回答；对问题２，我们证明了对交换不可分解环Ｒ、Ｓ，由环同构Ⅰ（Ｘ，Ｒ）Ⅰ（Ｘ，Ｒ）可得到Ｒ＝Ｓ，Ｘ＝Ｘ’。     

A new method for constructing a minimal PERT network

A project is an enterprise consisting of several activities which are to be carried out in some specific order. The activities and the order in which they need to be carried out can be represented by a PERT network. The PERT technique is a traditional, well-known approach to the expert of project management. When networks are used, it often becomes necessary to draw dummy activities. Since the computation of project completion time is proportional to the number of arcs, including dummy arcs, it is desirable to draw a network with as few dummy activities as possible.In this paper, we propose a new method for constructing, for a given project scheduling problem, a PERT network having as small as possible the number of dummy arcs by using some results on line graphs. This algorithm deals with the existence of transitive arcs. The paper contains illustrative examples, proofs of some theoretical results as well as a comparative study with a similar algorithm known in the literature. Computational results showed the superiority of our algorithm.     

A dependent project evaluation and review technique: A Bayesian network approach

The Program Evaluation and Review Technique (PERT) dates back to 1959. This method evaluates the uncertainty distribution of a project’s completion time given the uncertain completion times of the activities/tasks comprised within it. Each activity’s uncertainty was defined originally by a unique two parameter beta PERT distribution satisfying what is known to be the PERT mean and PERT variance. In this paper, a three-parameter PERT family of bounded distributions is introduced satisfying that same mean and variance, generalizing the beta PERT distribution. Their additional flexibility allows for the modeling of statistical dependence in a continuous Bayesian network, generalizing in turn the traditional PERT procedure where statistical independence is assumed among beta PERT activity durations. Through currently available Bayesian network software and the construction of that PERT family herein, the coherent monitoring of remaining project completion time uncertainty given partial completion of a project may become more accessible to PERT analysts. An illustrative example demonstrating the benefit of monitoring of remaining project completion time uncertainty as activities complete in that Bayesian fashion shall be presented, including expressions and algorithms for the specification of the three prior parameters for each activity in the project network to adhere to classical the PERT mean and PERT variance and a degree of statistical dependence between them.     

On some new types of greedy chains and greedy linear extensions of partially ordered sets

Two new types of greedy chains, strongly and semi-strongly greedy, in posets are defined and their role in solving the jump number problem is discussed in this paper. If a poset P contains a strongly greedy chain C then C may be taken as the first chain in an optimal linear extension of P. If a poset P has no strongly greedy chains then it contains an optimal linear extension which starts with a semi-strongly greedy chain. Hence, every poset has an optimal linear extension which consists of strongly and semi-strongly greedy chains. Algorithmic issues of finding such linear extensions are discussed elsewhere (Syslo, 1987, 1988), where we provide a very efficient method for solving the jump number problem which is polynomial in the class of posets whose arc representations contain a bounded number of dummy arcs. In another work, the author has recently demonstrated that this method restricted to interval orders gives rise to 3/2-approximation algorithm for such posets.     

Minimizing the jump number for partially ordered sets: A graph-theoretic approach

The purpose of this paper is to present a graph-theoretic approach to the jump number problem for N-free posets which is based on the observation that the Hasse diagram of an N-free poset is a line digraph. Therefore, to every N-free poset P we can assign another digraph which is the root digraph of the Hasse diagram of P. Using this representation we show that the jump number of an N-free poset is equal to the cyclomatic number of its root digraph and can be found (without producing any linear extension) by an algorithm which tests if a given poset is N-free. Moreover, we demonstrate that there exists a correspondence between optimal linear extensions of an N-free poset and spanning branchings of its root digraph. We provide also another proof of the fact that optimal linear extensions of N-free posets are exactly greedy linear extensions. In conclusion, we discuss some possible generalizations of these results to arbitrary posets.     

用最少的虚工序构建等效多阶段工序网络

运用网络计划可以直观地表示项目管理中的诸多疑难问题, 便于分析和求解. 但是它也存在明显的缺点, 如, (1) 工序网络的有向无回路性表明很多时候适合运用动态规划法, 但它在通常情况下的无阶段性使得该方法无法直接应用; (2) 任意构建的工序网络容易表现得错综复杂, 不利于研究; (3) 用最少的虚工序表示双代号网络是NP-难问题, 因此对一个工序系统可能构建出多个差别迥异的工序网络, 有碍于进度计划管理研究, 等等. 如果能将工序网络构建成等效的多阶段网络, 各工序分别表示在相应的阶段中, 无疑有助于上述问题的解决. 构建等效多阶段工序网络需要添加虚工序. 通过添加最少的虚工序将工序网络构建成等效多阶段网络, 从而有助于建立更合理的工序网络表示法.     

On the representation of partially ordered sets

It is well known that any distributive poset (short for partially ordered set) has an isomorphic representation as a poset (Q, ⊆) such that the supremum and the infimum of any finite setF ofP correspond, respectively to the union and intersection of the images of the elements ofF. Here necessary and sufficient conditions are given for similar isomophic representation of a poset where however the supremum and infimum of also infinite subsetsI correspond to the union and intersection of images of elements ofI.     

An upper bound on the expected completion time of PERT networks

In this paper the problem of determining an upper bound on the expected project completion time, described by the PERT network, is considered. It is assumed that activity durations are independent random variables with given means. The exact forms of probability distributions do not have to be known; however, their cumulative distribution functions are expected to belong to the so-called NBUE class. Very simple algorithms for deriving this bound are presented. The computations can even be performed manually for more involved networks. Our approach producing a pessimistic evaluation of the expected value of the project duration, extends considerably the information obtained through the use of the classical PERT that always underestimates this value. The results are illustrated by a simple example, and errors of approximations are discussed.     

非肯定型PERT网络分析

本文用一个具体示例说明非肯定型PERT网络中原来一般方法的不足 ,提出用仿真方法解决这问题     

The monoid of ordered partitions of a natural number

The sequences of non-negative integers form a monoid, a natural submonoid of which has elements corresponding to order-preserving transformations of a finite chain. This, in turn, has a submonoid whose elements are ordered partitions of a natural number. A presentation for the last monoid is given, and the inclusion poset of principal right ideals is described. The poset of principal left ideals has a recursive structure that gives rise to an interesting sequence of numbers.