图的3限制性边割

3限制性边割将连通图分离成不连通图，使其各连通分支含有至少3个顶点．含3限制性边割的图在本文中得到刻划．     

智能剥离——有竞争力的SOI制备新技术

ＳＯＩ（Ｓｉｌｉｃｏｎ－ｏｎ－Ｉｎｓｕｌａｔｏｒ）技术被认为是２１世纪的硅集成电路技术，近年来，国际上出现了一种引人注目的ＳＯＩ制备新技术－智能剥离（Ｓｍａｒｔｃｕｔ）技术，它的出现为解决ＳＯＩ技术中质量与价格的矛盾带来了新的希望，将会有力地堆动ＳＯＩ技术的进一步发展，文章简要回顾了目前存在的几种ＳＯＩ制备技术，并结合我们的工作重点介绍了智能剥离这种有竞争力的ＳＯＩ制备新技术。     

点可迁图中的正则因子

设图G是一个K-正则连通点可迁图.如果G不是极大限制性边连通的,那么G含有一个(k-1)-因子,它的所有分支都同构于同一个阶价于k和2k-3之间的点可迁图.此结果在某种程度上加强了Watkins的相应命题:如果k正则点可迁图G不是k连通的,那么G有一个因子,它的每一个分支都同构于同一个点可迁图.     

网络割的计数

指出了文献[1],[2]所出现的欠妥处,给出了网络割的计数.     

Minimizing breaks by maximizing cuts

We propose to solve the break minimization problem in sports scheduling by transforming it into a maximum cut problem in an undirected graph and applying a branch-and-cut algorithm. Our approach outperforms previous approaches with constraint programming and integer programming techniques.     

Exact ground states of two-dimensional ±J Ising spin glasses

In this paper we study the problem of finding an exact ground state of a two-dimensional ±J Ising spin glass on a square lattice with nearest neighbor interactions and periodic boundary conditions when there is a concentrationp of negative bonds, withp ranging between 0.1 and 0.9. With our exact algorithm we can determine ground states of grids of sizes up to 50×50 in a moderate amount of computation time (up to 1 hr each) for several values ofp. For the ground-state energy of an infinite spin-glass system withp=0.5 we estimateE _0.5 =–1.4015±0.0008. We report on extensive computational tests based on more than 22,000 experiments.     

General Purpose Heuristics for Integer Programming—Part II

In spite of the many special purpose heuristics for specific classes of integer programming (IP) problems, there are few developments that focus on general purpose integer programming heuristics. This stems partly from the perception that general purpose methods are likely to be less effective than specialized procedures for specific problems, and partly from the perception that there is no unifying theoretical basis for creating general purpose heuristics. Still, there is a general acknowledgment that methods which are not limited to solving IP problems on a class by class basis, but which apply to a broader range of problems, have significant value. We provide a theoretical framework and associated explicit proposals for generating general purpose IP heuristics. Our development, makes use of cutting plane derivations that also give a natural basis for marrying heuristics with exact branch and cut methods for integer programming problems.     

Trace Anion Determination in Concentrated Nitric Acid by Means of Two Coupled Ion Chromatography Systems

The analysis of trace anions in concentrated nitric acid requires two online coupled ion chromatography systems for the required selectivity. The first system acts as preseparator of the trace anions from the matrix compounds. The trace anions are preconcentrated by means of a heart-cut valve and a concentrator column. The second system acts as detection device and allows sensitive determination of chloride, sulfate and phosphate.Several commercial columns were tested for usefulness in system no. 1. Eventually the anion exchanger for the first system was developed in-house so as to obtain a maximum selectivity difference between the analytes and the matrix anions. The column accepts a total amount of 22µmol nitric acid per run without losing the resolution between analytes and matrix.The second system utilizes a high performance anion exchanger for quantification of the analytes. Recoveries found are 80% to 100% for phosphate and around 100% for sulfate and chloride. Detection limits for chloride, sulfate and phosphate in concentrated nitric acid (69% w/w) are 0.1, 1 and 5mgL^–1, respectively.     

模糊质量设计的数学模型及解法

本文给出了模糊质量设计的数学模型 ,并给出了具有模糊约束、模糊约束函数值及双目标两层次的模糊质量设计模型的解法 .