The lattice of strict completions of a finite poset

For a given finite poset , we construct strict completions of P which are models of all finite lattices L such that the set of join-irreducible elements of L is isomorphic to P. This family of lattices, , turns out to be itself a lattice, which is lower bounded and lower semimodular. We determine the join-irreducible elements of this lattice. We relate properties of the lattice to properties of our given poset P, and in particular we characterize the posets P for which . Finally we study the case where is distributive. Received October 13, 2000; accepted in final form June 13, 2001.     

Markovian Imperfect Software Debugging Model and Its Performance Measures

Abstract

This paper considers a Markovian imperfect software debugging model incorporating two types of faults and derives several measures including the first passage time distribution. When a debugging process upon each failure is completed, the fault which causes the failure is either removed from the fault contents with probability p or is remained in the system with probability 1 ? p. By defining the transition probabilities for the debugging process, we derive the distribution of first passage time to a prespecified number of fault removals and evaluate the expected numbers of perfect debuggings and debugging completions up to a specified time. The availability function of a software system, which is the probability that the software is in working state at a given time, is also derived and thus, the availability and working probability of the software system are obtained. Throughout the paper, the length of debugging time is treated to be random and thus its distribution is assumed. Numerical examples are provided for illustrative purposes.     

The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies

The two-machine flowshop environment with sequence-independent setup times has been intensely investigated both from theoretical and practical perspectives in the scheduling literature. Nevertheless, very scant attention has been devoted to deriving effective lower bounding strategies. In this paper, we propose new lower bounds for the total completion time minimization criterion. These bounds are based on three relaxation schemes, namely the waiting time-based relaxation scheme, the single machine-based relaxation scheme, and the Lagrangian relaxation scheme. Extensive computational study carried on instances with up to 500 jobs reveals that embedding the waiting time-based bounding strategy within the Lagrangian relaxation framework yields the best performance while requiring negligible CPU time.     

带两个服务等级的三台机最优在线算法

研究了带服务等级约束的三台平行机在线排序问题.每台机器和每个工件的服务等级为1或者2,工件只能在等级不高于它的机器上加工,即等级为1的工件只能在等级为1的机器上加工,等级为2的工件可在所有机器上加工.每个工件的加工时间为一个单位,目标是极小化所有工件的总完工时间.考虑两种情形:当一台机器等级为1,两台机器等级为2时,给出了竞争比为17/14的最优在线算法;当两台机器等级为1,一台机器等级为2时,给出了竞争比为43/36的最优在线算法.     

冲击成孔配合回旋终孔工艺在象山港大桥及接线工程桩基施工中的应用

选择合适的桩基成孔工艺是决定桩基施工质量及进度的关键因素.根据象山港大桥及接线工程的地质情况,通过对桩基施工工艺进行比选及试验,最终确定采用冲击成孔配合回旋终孔工艺,保证了桩基施工的质量、安全和进度.同时也提出该工艺的关键控制技术,使其可供具有相似地质情况的工程借鉴使用.     

工件加工时间是开工时间线性函数的单机排序问题

研究了具有线性恶化工件的单机排序问题,其中线性恶化工件指的是工件的加工时间是开工时间的线性增长函数.在一般情况下,对目标函数为极小化完工时间平方和与极小化总误工数问题分别给出了最优算法.此外,在分段情况下,对目标函数为极小化最大完工时间问题也给出了最优算法.     

On a relative uniform completion of an archimedean lattice ordered group

The notion of a relatively uniform convergence (ru-convergence) has been used first in vector lattices and then in Archimedean lattice ordered groups. Let G be an Archimedean lattice ordered group. In the present paper, a relative uniform completion (ru-completion) of G is dealt with. It is known that exists and it is uniquely determined up to isomorphisms over G. The ru-completion of a finite direct product and of a completely subdirect product are established. We examine also whether certain properties of G remain valid in . Finally, we are interested in the existence of a greatest convex l-subgroup of G, which is complete with respect to ru-convergence. This work was supported by Science and Technology Assistance Agency under the contract No. APVT-20-004104. Supported by Grant VEGA 1/3003/06.     

TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH

We present a sufficient and necessary condition for a so-called Cnk pattern to have positive semidefinite (PSD) completion. Since the graph of the Cnk pattern is composed by some simple cycles, our results extend those given in [1] for a simple cycle. We also derive some results for a partial Toeplitz PSD matrix specifying the Cnk pattern to have PSD completion and Toeplitz PSD completion.     

Combining SAD/SIR iteration and MR iteration in partial-model extension of proteins

There are two kinds of dual-space partial-model extensions which involve the direct-method program OASIS. The first kind, named SAD/SIR iteration, uses SAD/SIR information, while the second kind, named molecular replacement (MR) iteration, does not use that information. In general, the SAD/SIR iteration is more powerful since more experimental information is used. However, in most cases when protein structures are solved with the molecular replacement method, SAD/SIR information is not available. Thus the MR iteration is particularly useful for the completion of models from molecular replacement. The SAD/SIR iteration will be automatically used in OASIS for data sets containing SAD/SIR signals, while the MR iteration will be dedicated to data sets without SAD/SIR signals. The present paper shows that for data containing SAD/SIR signals, a combination of SAD/SIR iteration and MR iteration could lead to significantly better results than that obtained from the SAD/SIR iteration alone.