Theory of Valuations on Manifolds: A Survey

This is a non-technical survey of a recent theory of valuations on manifolds constructed in [A10], [A11], [AF] and [A12], and actually a guide to this series of articles. We also review some recent related results obtained by a number of people. Received: February 2006, Revision: June 2006, Accepted: June 2006     

A Nonlinear Drift - Diffusion System with Electric Convection Arising in Electrophoretic and Semiconductor Modeling

A multi-dimensional transient drift-diffusion model for (at most) three charged particles, consisting of the continuity equations for the concentrations of the species and the Poisson equation for the electric potential, is considered. The diffusion terms depend on the concentrations. Such a system arises in electrophoretic modeling of three species (neutrally, positively and negatively charged) and in semiconductor theory for two species (positively charged holes and negatively charged electrons). Diffusion terms of degenerate type are also possible in semiconductor modeling. For the initial boundary value problem with mixed Dirichlet - Neumann boundary conditions and general reaction rates, a global existence result is proved. Uniqueness of solutions follows in the Dirichlet boundary case if the diffusion terms are uniformly parabolic or if the initial and boundary densities are strictly positive. Finally, we prove that solutions exist which are positive uniformly in time and globally bounded if the reaction rates satisfy appropriate growth conditions.     

无穷区间上二阶微分方程的边值问题

利用Schauder不动点定理讨论了一类非线性二阶微分方程在无穷区间上的边值问题无界解的存在性，部分改进了郭大钧教授最近得到的结果。     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

w-DENSITY AND w-BALANCED PROPERTY OF WEIGHTED GRAPHS

§ 1　IntroductionAll graphsconsidered in this paperare finite undirected ones withoutloops ormultipleedges.Our terminology and notation are standard exceptas indicated.A good reference forany undefined terms is[1 ] .Let G be a graph with vertex set V( G) and edge set E( G) .The density of G is definedbyd( G) =ε( G)ν( G) ,whereν( G) andε( G) denote| V( G) | and| E( G) | ,respectively.G is said to be balanced iffor each subgraph H of G we have d( H )≤ d( G) ,where V( H ) is assum…     

串联系统可靠性虚拟系统法置信下限的小样本性质

本文讨论了具有r个成败型元件串联系统可靠性的置信下限问题。研究了虚拟系统法置信下限的小样本性质,证明了,在通常情况下虚拟系统法置信下限要大于常见的L-M法置信下限.更一般地,本文证明了在成败型试验中,当成功数与试验数之比保持不变时,试验次数的增加将直接缩小成功率置信区间的长度。     

Bager第五图的完善

１９８９年发表的Ｂａｇｅｒ第五图，包含关于三角形元素的３５个二次规范画数之间的５１个不等式通过细致的分析，本文给出了其中遗漏的１２个基本不等式     

一类几乎最优循环图{C_p(m,m+1,p/a)}

本文比较了循环图类{c_p(n_1,…,n_p)}和{c-p(n_1…,n_p,p/α)}的直径下界。对于p和α满足一定条件的循环图类{c_p(n_1,n_2,p/α)},本文给出了达到或几乎达到此图类直径下界的一类几乎最优循环图{c_p(m,m+1,p/α)}。     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

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.