A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.     

Reversible addition–fragmentation transfer (RAFT) copolymerization of methyl methacrylate and styrene in miniemulsion

In the reversible addition–fragmentation transfer (RAFT) copolymerization of two monomers, even with the simple terminal model, there are two kinds of macroradical and two kinds of polymeric RAFT agent with different R groups. Because the structure of the R group could exert a significant influence on the RAFT process, RAFT copolymerization may behave differently from RAFT homopolymerization. The RAFT copolymerization of methyl methacrylate (MMA) and styrene (St) in miniemulsion was investigated. The performance of the RAFT copolymerization of MMA/St in miniemulsion was found to be dependent on the feed monomer compositions. When St is dominant in the feed monomer composition, RAFT copolymerization is well controlled in the whole range of monomer conversion. However, when MMA is dominant, RAFT copolymerization may be, in some cases, out of control in the late stage of copolymerization, and characterized by a fast increase in the polydispersity index (PDI). The RAFT process was found to have little influence on composition evolution during copolymerization. The synthesis of the well‐defined gradient copolymers and poly[St‐b‐(St‐co‐MMA)] block copolymer by RAFT miniemulsion copolymerization was also demonstrated. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 6248–6258, 2004     

STABILITY NUMBER IN SUBCLASSES OF P5-FREE GRAPHS

Two new hereditary classes of P5-free graphs where the stability number can be found in polynomial time are proposed. They generalize several known results.     

外来的捕食物种对濒危物种的影响

In this paper, an important problem arising from conservation biology is considered. Namely, how does the introduced species affect the survival of a native endangered species through predation? By using Kamke comparison theorem and some results in Cui and Chen‘s paper (1998), some sufficient conditions that guarantee the permanence of the species and global stability of a unique positive periodic solution are obtained. Biological implication of these results are discussed.     

INVERSE EIGENVALUE PROBLEM OF HERMITIAN GENERALIZED ANTI-HAMILTONIAN MATRICES

§1　IntroductionWe considerthe following inverse eigenvalue problem offinding an n-by-n matrix A∈S such thatAxi =λixi,i =1,2 ,...,m,where S is a given set of n-by-n matrices,x1 ,...,xm(m≤n) are given n-vectors andλ1 ,...,λmare given constants.Let X=(x1 ,...,xm) ,Λ=(λ1 ,λ2 ,...,λm) ,then the above inverse eigenvalue problemcan be written as followsProblem Given X∈Cn×m,Λ=(λ1 ,...,λm) ,find A∈S such thatAX =XΛ,where S is a given matrix set.We also discuss the so-called opti…     

Physics with large extra dimensions

The recent understanding of string theory opens the possibility that the string scale can be as low as a few TeV. The apparent weakness of gravitational interactions can then be accounted by the existence of large internal dimensions, in the sub-millimeter region. Furthermore, our world must be confined to live on a brane transverse to these large dimensions, with which it interacts only gravitationally. In my lecture, I describe briefly this scenario which gives a new theoretical framework for solving the gauge hierarchy problem and the unification of all interactions. I also discuss a minimal embedding of the standard model, gauge coupling unification and proton stability. On leave from: Centre de Physique Théorique, Ecole Polytechnique, 91128 Palaiseau, Cedex, France.     

Titanium carbonitride films on cemented carbide cutting tool prepared by pulsed high energy density plasma

Hard films prepared by pulsed high energy density plasma (PHEDP) are characterized by high film/substrate adhesive strength, and high wear resistance. Titanium carbonitride (TiCN) films were deposited onto YG11C (ISO G20) cemented carbide cutting tool substrates by PHEDP at room temperature. XRD, XPS, SEM, AES, etc. were adopted to analyze the phases (elements) composition, microstructure and the interface of the films, respectively. The results show that, the uniform dense films are composed of grains ranging from 70 to 90 nm. According to the AES result, there is a broad transition layer between the film and the substrate, due to the ion implantation effect of the PHEDP. The transition layer is favorable for the film/substrate adhesion.     

最小树的一般算法

本文根据设计并行算法的基本原则,给出了最小树的两个对偶定理.在此基础上,建立了两种对偶的同步并行算法的雏型.这两种算法恰恰在对偶的意义下,概括了以往的最小树算法.     

Researches of DC—Problem Under the Model S in which the Numbers of Defective Coins are not Fixed

In this paper,we research general Defective Cion Problem under the model S,i.e,the number d of Defective cions is not fixed. For d=O,1,or 2. we get some good results.     

关于无环Euler平面地图数目的注记

本文提供了组合上不等价的有根无环Euler平面地图以边数为参数的的数目,同时对于几乎无环的情形也给出了一个计数显式.