单循环赛赛程安排的一个图论方法

利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案     

Global existence and blow-up of solutions to a parabolic system with nonlocal sources and boundaries

This paper deals with a semi-linear parabolic system with nonlinear nonlocal sources and nonlocal boundaries.By using super-and sub-solution techniques,we first give the sufficient conditions that the classical solution exists globally and blows up in a finite time respectively,and then give the necessary and sufficient conditions that two components u and v blow up simultaneously.Finally,the uniform blow-up profiles in the interior are presented.     

On the structure of stationary sets

We isolate several classes of stationary sets of [k]ωand investigate implications among them. Under a large cardinal assumption, we prove a structure theorem for stationary sets.     

Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks.     

Bases,spanning sets,and the axiom of choice

Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?₂ has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An algorithm for decomposing a polynomial system into normal ascending sets

We present an algorithm to decompose a polynomial system into a finite set of normal ascending sets such that the set of the zeros of the polynomial system is the union of the sets of the regular zeros of the normal ascending sets.If the polynomial system is zero dimensional,the set of the zeros of the polynomials is the union of the sets of the zeros of the normal ascending sets.     

解约束优化问题的QP-free可行域方法

本文利用一个新的分片线性NCP函数提出一个新的可行的QP-free方法解非线性不等式约束优化问题.不同于其他的QP-free方法,这个方法只考虑在工作集中的约束函数,工作集是积极集的一个估计,因此子问题的维数不是满秩的.这个方法可行的并且不需假定严格互补条件、聚点的孤立性得到算法的全局收敛性,并且积极约束函数的梯度不要求线性独立的,其中由拟牛顿法得到的子矩阵不需要求一致正定性.     

New variants of the generalized level method for minimization of convex nondifferentiable functions taking infinite values

New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately.     

混合方次的Waring——Goldbach问题

研究混合方次的Waring--Goldbach     

Supercompactness and measurable limits of strong cardinals II: Applications to level by level equivalence

We construct models for the level by level equivalence between strong compactness and supercompactness in which for κ the least supercompact cardinal and δ ≤ κ any cardinal which is either a strong cardinal or a measurable limit of strong cardinals, 2^δ > δ ⁺ and δ is < 2^δ supercompact. In these models, the structure of the class of supercompact cardinals can be arbitrary, and the size of the power set of κ can essentially be made as large as desired. This extends and generalizes [5, Theorem 2] and [4, Theorem 4]. We also sketch how our techniques can be used to establish a weak indestructibility result. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)