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 Construction of Difference Sets in High Exponent 2-Groups Using Representation Theory

Nontrivial difference sets in groups of order a power of 2 are part of the family of difference sets called Menon difference sets (or Hadamard), and they have parameters (2^2d+2, 2^2d+1±2 ^d , 2^2d ±2 ^d ). In the abelian case, the group has a difference set if and only if the exponent of the group is less than or equal to 2 ^d+2. In [14], the authors construct a difference set in a nonabelian group of order 64 and exponent 32. This paper generalizes that result to show that there is a difference set in a nonabelian group of order 2^2d+2 with exponent 2 ^d+3. We use representation theory to prove that the group has a difference set, and this shows that representation theory can be used to verify a construction similar to the use of character theory in the abelian case.     

Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.     

模糊集单调型分解定理

模糊集的分解集定理有两种形式，第一种形式与模糊集的λ—截集有关：Ａ＝其中Ａ＿λ是的λ—截集￣［１］．第二种形式与集合套有关：其中Ｈ（λ）为集合套￣［２］或者Ａ＝其中Ｈ（λ）为集合套，Ｑ为（０，１）的可列稠密子集＿［３］，．其实，这两种形式在本文提出的基本模糊集的概念下，可以统一起来成为任何模糊集可以分解为一些（可数或不可数）基本模糊集的和。不仅如此，本文还提出简单模糊集的概念，并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和，或等价地，可以表示成可数个单调上升的简单模糊集的极限，所用的证明方法是构造性的，所以对模糊集的结构也得出了一个清晰的认识．     

ON THE SHEAF OF GENERALIZED FUNDAMENTAL GROUP AND COVERING SPACE

ＯＮ ＴＨＥ ＳＨＥＡＦ ＯＦ ＧＥＮＥＲＡＬＩＺＥＤ ＦＵＮＤＡＭＥＮＴＡＬ ＧＲＯＵＰ ＡＮＤ ＣＯＶＥＲＩＮＧ ＳＰＡＣＥ￥ＧＡＮＤＡＮＹＡＮＡｂｓｔｒａｃｔ：Ｔｈｅａｕｔｈｏｒｃｏｎｓｔｒｕｃｔｓｔｈｅｓｈｅａｆｏｆｇｅｎｅｒａｌｉｚｅｄｆｕ...     

变分方法与反向上下解

本文在非线性方程的下解不小于上解这一条件（即反向上下解条件）下研究了其解的存在性．我们证明了，如果非线性算子方程有变分结构，有一对反向上下解，对应的算子映某个锥入锥并且满足一定的辅助条件，那么这一方程在锥中至少有两个解．另外，本文还研究了反向上下解条件下非线性椭圆边值问题正解的存在性．     

Numerical analysis for factorial data analysis. Part II: Special purpose hardware—the programmable systolic array SARDA

The second part of this paper deals with the systolic implementation of the computational kernel for factorial data analysis, defined in Part I, on special-purpose hardware. The framework of the study is that a sequence of different algorithms has to be performed on a unique hardware array. This fact has led us to the design of the programmable systolic array SARDA: this is a triangular array which consists of programmable nodes with local memory and programmable orthogonal connections.     

Cantor型分形光栅的夫琅禾费衍射特性研究

研究了Cantor型分形光栅的夫琅禾费衍射特性，使我们对分形结构上的衍射问题和特性有一定的了解。     

A review of research progress in air-to-water sound transmission

International and domestic research progress in theory and experiment and applications of the air-to-water sound transmission are presented in this paper. Four classical numerical methods of calculating the underwater sound field generated by an airborne source, i.e., the ray theory, the wave solution, the normal-mode theory and the wavenumber integration approach, are introduced. Effects of two special conditions, i.e., the moving airborne source or medium and the rough air-water interface, on the air-to-water sound transmission are reviewed. In experimental studies, the depth and range distributions of the underwater sound field created by different kinds of airborne sources in near-field and far-field, the longitudinal horizontal correlation of underwater sound field and application methods for inverse problems are reviewed.     

A hybrid level set method for modelling detonation and combustion problems in complex geometries

We present an accurate and fast wave tracking method that uses parametric representations of tracked fronts, combined with modifications of level set methods that use narrow bands. Our strategy generates accurate computations of the front curvature and other geometric properties of the front. We introduce data structures that can store discrete representations of the location of the moving fronts and boundaries, as well as the corresponding level set fields, that are designed to reduce computational overhead and memory storage. We present an algorithm we call stack sweeping to efficiently sort and store data that is used to represent orientable fronts. Our implementation features two reciprocal procedures, a forward ‘front parameterization’ that constructs a parameterization of a front given a level set field and a backward ‘field construction’ that constructs an approximation of the signed normal distance to the front, given a parameterized representation of the front. These reciprocal procedures are used to achieve and maintain high spatial accuracy. Close to the front, precise computation of the normal distance is carried out by requiring that displacement vectors from grid points to the front be along a normal direction. For front curves in two dimensions, a cubic interpolation scheme is used, and G ¹ surface parameterization based on triangular patches is used for the three-dimensional implementation to compute the distances from grid points near the front. To demonstrate this new, high accuracy method we present validations and show examples of combustion-like applications that include detonation shock dynamics, material interface motions in a compressible multi-material simulation and the Stephan problem associated with dendrite solidification.