Projected Landweber iteration for matrix completion

Recovering an unknown low-rank or approximately low-rank matrix from a sampling set of its entries is known as the matrix completion problem. In this paper, a nonlinear constrained quadratic program problem concerning the matrix completion is obtained. A new algorithm named the projected Landweber iteration (PLW) is proposed, and the convergence is proved strictly. Numerical results show that the proposed algorithm can be fast and efficient under suitable prior conditions of the unknown low-rank matrix.     

单可变资源最小化加权完工时间和排序问题的强NP-困难性

Baker和Nuttle提出了下述单可变资源排序问题：扎个工件利用某个单资源进行加工使得工件的完工时间的某个函数达到最小,而资源的可利用率是随着时间而变化的．当最小化的目标函数是工件的加权完工时间和时,Baker和Nuttle猜测该问题是NP-困难的．最近,Yuan、Cheng和Ng证明该问题在一般意义下是NP-困难的,但是问题的精确复杂性仍然是悬而未决的．本文我们证明了该问题是强NP-困难的．     

A Shirota Theorem for Frames

We establish a version of the Shirota Theorem which characterises realcompactness in terms of completeness for frames; an interesting problem considering the various notions of realcompactness for frames and the fact that the frame completion behaves differently from its spatial counterpart. Amongst other consequences of this characterisation, we can describe the completion of a uniform sigma frame. We highlight some differences between frames and spaces when considering the Lindelöf property, realcompactness, paracompactness and completeness. Most of these results appear in the doctoral thesis of the author.     

Z-Continuous Posets and Their Topological Manifestation

A subset selection Z assigns to each partially ordered set P a certain collection Z P of subsets. The theory of topological and of algebraic (i.e. finitary) closure spaces extends to the general Z-level, by replacing finite or directed sets, respectively, with arbitrary Z-sets. This leads to a theory of Z-union completeness, Z-arity, Z-soberness etc. Order-theoretical notions such as complete distributivity and continuity of lattices or posets extend to the general Z-setting as well. For example, we characterize Z-distributive posets and Z-continuous posets by certain homomorphism properties and adjunctions. It turns out that for arbitrary subset selections Z, a poset P is strongly Z-continuous iff its Z-join ideal completion Z P is Z-ary and completely distributive. Using that characterization, we show that the category of strongly Z-continuous posets (with interpolation) is concretely isomorphic to the category of Z-ary Z-complete core spaces. For suitable subset selections Y and Z, these are precisely the Y-sober core spaces.     

A note on recursive completions of the countable atomless Boolean algebras

The Baire category theorem for compact Hausdorff spaces is used to show that any recursive completion ℬ^ϕof the countable atomless Boolean algebra ℬ is ℬrecursively closed." Also, a theorem of R.D. Anderson on the simplicity of Aut(ℬ) is used to show that uncountably many automorphisms of ℬ extend to ℬ^ϕ. This revised version was published online in June 2006 with corrections to the Cover Date.     

Extensions of l.s.c. Mappings into Reflexive Banach Spaces

Every lower semi-continuous closed-and-convex valued mapping : X2 ^Y where X is a collectionwise normal and countably paracompact space and Y is a reflexive Banach space can be extended to the Dieudonné completion (X) of X. Generalizations and applications to the theory of selections of set-valued mappings are presented.     

含不相关机的动态可重入柔性流水车间问题的混合DABC-GA算法

为了改善生产线的物流平衡和加强阶段间的时间衔接,扩展一般可重入柔性流水车间调度理论,以最小化总加权完工时间为目标,研究了每阶段含不相关并行机的动态可重入柔性流水车间问题,工件在各阶段的加工时间取决于加工它的机器。鉴于所研究问题为NP-hard问题,首先,建立整数规划模型;其次,设计元胞矩阵编码方案,提出融合离散人工蜂群算法和遗传算法的一种混合算法以获得问题的近优解;最后,为了评估混合算法的性能,将所提出算法和一些元启发式算法进行了不同规模问题的对比测试,实验结果说明了所提算法的有效性。     

On some algorithmic problems regarding the hairpin completion

We consider a few algorithmic problems regarding the hairpin completion. The first problem we consider is the membership problem of the hairpin and iterated hairpin completion of a language. We propose an O(nf(n)) and O(n²f(n)) time recognition algorithm for the hairpin completion and iterated hairpin completion, respectively, of a language recognizable in O(f(n)) time. We show that the n factor is not needed in the case of hairpin completion of regular and context-free languages. The n² factor is not needed in the case of iterated hairpin completion of context-free languages, but it is reduced to n in the case of iterated hairpin completion of regular languages. We then define the hairpin completion distance between two words and present a cubic time algorithm for computing this distance. A linear time algorithm for deciding whether or not the hairpin completion distance with respect to a given word is connected is also discussed. Finally, we give a short list of open problems which appear attractive to us.     

Constructions of Solid Hulls

For each concrete category (K,U) an extension LIM(K,U) is constructed and under certain 'smallness conditions' it is proved that LIM(K,U) is a solid hull of (K,U), i.e., the least finally dense solid extension of (K,U). A full subcategory of Top ₂ is presented which does not have a solid hull.