On countable completions of quotient ordered semigroups

A poset is said to be ω-chain complete if every countable chain in it has a least upper bound. It is known that every partially ordered set has a natural ω-completion. In this paper we study the ω-completion of partially ordered semigroups, and the topological action of such a semigroup on its ω-completion. We show that, for partially ordered semigroups, ω-completion and quotient with respect to congruences are two operations that commute with each other. This contrasts with the case of general partially ordered sets.     

Information processing in three-state neural networks

We introduce networks of three-state neurons, where the additional state embodies the absence of information. Their dynamical behavior is studied from the standpoint of information processing. These networks display strong pattern completion capabilities. Moreover, inference naturally occurs between coherent patterns.     

Phantom Maps from a Strong Homology Viewpoint

Let X and Y be connected nilpotent CW-complexes of finite type. In this paper we deal with another complete analysis of a set of phantom maps in terms of strong homology by using the derived functors. We also prove that the set of homotopy classes of maps is independent of the choice of both rational homotopy equivalent classes and completion genera.     

Continuous Selections and Locally Pseudocompact Groups

We characterize locally pseudocompact groups by means of the selection theory. Our result is the selection version of the well-known Comfort—Ross theorem on pseudocompactness which states that a topological group is pseudocompact if and only its Stone—Čech compactification is a topological group.     

关于机器随机故障完工时间方差最小化单机调度问题

讨论了机器随机故障时,工件完工时间方差的期望最小化单机调度问题,其中描述机器故障的计数过程为广义泊松过程.推导出了目标函数等价的确定形式,而后进一步给出了工件加工时间相同时问题的最优解.     

On the universal completion of pointfree function spaces

This paper approaches the construction of the universal completion of the Riesz space $\mathrm{C}(L)$ of continuous real functions on a completely regular frame L in two different ways. Firstly as the space of continuous real functions on the Booleanization of L. Secondly as the space of nearly finite Hausdorff continuous functions on L. The former has no counterpart in the classical theory, as the Booleanization of a spatial frame is not spatial in general, and it offers a lucid way of representing the universal completion as a space of continuous real functions. As a corollary we obtain that $\mathrm{C}(L)$ and $\mathrm{C}(M)$ have isomorphic universal completions if and only if the Booleanization of L and M are isomorphic and we characterize frames L such that $\mathrm{C}(L)$ is universally complete as almost Boolean frames. The application of this last result to the classical case $\mathrm{C}(X)$ of the space of continuous real functions on a topological space X characterizes those spaces X for which $\mathrm{C}(X)$ is universally complete. Finally, we present a pointfree version of the Maeda-Ogasawara-Vulikh representation theorem and use it to represent the universal completion of an Archimedean Riesz space with weak unit as a space of continuous real functions on a Boolean frame.     

Hypercontinuous Posets

The concepts of hypercontinuous posets and generalized completely continuous posets are introduced. It is proved that for a poset P the following three conditions are equivalent:(1) P is hypercontinuous;(2) the dual of P is generalized completely continuous;(3) the normal completion of P is a hypercontinuous lattice. In addition, the relational representation and the intrinsic characterization of hypercontinuous posets are obtained.     

一类随机完工时间二阶矩的表示方法

给出一种运用机器的工作时间、故障时间和工件的加工时间的分布特征表示在一台具有Birge所定义的序列随机故障的机器上加工一个中断-重复型工件的完工时间的二阶矩的方法, 并通过举例说明所建立的表示在风险分析与决策优化方面的应用.     

Complexity of a scheduling problem with controllable processing times

We consider the problem of scheduling a set of independent jobs on a single machine so as to minimize the total weighted completion time, subject to the constraint that the total compression cost is less than or equal to a fixed amount. The complexity of this problem is mentioned as an open problem. In this note we show that the problem is NP-hard.     

Rescheduling problems with deteriorating jobs under disruptions

In this paper, we consider two single-machine rescheduling problems with linear deteriorating jobs under disruption. By a deteriorating jobs, we mean that the actual processing time of the job is an increasing function of its starting time. The two problems correspond to two different increasing linear function. Rescheduling means a set of original jobs has already been scheduled to minimize some classical objective, then a new set of jobs arrives and creates a disruption. We consider the rescheduling problem to minimize the total completion time under a limit of the disruption from the original scheduling. For each problem, we consider two versions. For each version, the polynomial algorithms are proposed, respectively.