Molecular Orbital Calculations on 2, 4, 6-Trinitrotoluene

Three ab initio calculations (HF/6-3IG, HF/6-3IG*, and HF/6-3IG**) on 2,4,6-trinitrotoluene were made, The results compare well with xray data, except dihedral angles of NO₂ relative to the plane of the benzene ring. The deviations are attributed to packing forces and steric effects in the crystal. The most stable structure was a torsional angle 10° of the methyl top with the benzene ring, unlike toluene. The rotational barriers of the methyl top and the 4-nitro group are small. Hydrogen bonding, dipole moments and total atomic charges arc calculated.     

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.     

A rigid graph for every set

A graph G is called rigid if the identical mapping V(G)→V(G) is the only homomorphism G→G. In this note we give a simple construction of a rigid oriented graph on every set. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 108–110, 2002     

基于模糊方法的多人合作对策的研究

多人合作对策模型中联盟的收入和总体的收入常常出现相互矛盾的情况 ,此时核是空集 .由于不存在核 ,无法用 Nash-Harsanyi谈判模型求解 .采用模糊数学方法 ,调整模型中线性约束的右端系数 ,使核在一定程度上是非空集合 ,得到模糊意义下的 Nash平衡解 .该方法一定程度上解决了各联盟收入与总体收入的矛盾 .最后通过一个算例说明该方法的可行性 .     

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

利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 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.