Cost operator algorithms for the transportation problem

A primal transportation algorithm is devised via post-optimization on the costs of a modified problem. The procedure involves altering the costs corresponding to the basic cells of the initial (primal feasible) solution so that it is dual feasible as well. The altered costs are then successively restored to their true values with appropriate changes in the optimal solution by the application of cell or area cost operators discussed elsewhere. The cell cost operator algorithm converges to optimum within (2T – 1) steps for primal nondegenerate transportation problems and [(2T + 1) min (m, n)] – 1 steps for primal degenerate transportation problems, whereT is the sum of the (integer) warehouse availabilities (also the sum of the (integer) market requirements) andm andn denote the number of warehouses and markets respectively. For the area cost operator algorithm the corresponding bounds on the number of steps areT and (T + 1) min (m, n) respectively.This report was prepared as part of the activities of the Management Sciences Research Group, Carnegie—Mellon University, under Contract N00014-67-A-0314-0007 NR 047-048 with the U.S. Office of Naval Research.     

On the symmetric travelling salesman problem I: Inequalities

We investigate several classes of inequalities for the symmetric travelling salesman problem with respect to their facet-defining properties for the associated polytope. A new class of inequalities called comb inequalities is derived and their number shown to grow much faster with the number of cities than the exponentially growing number of subtour-elimination constraints. The dimension of the travelling salesman polytope is calculated and several inequalities are shown to define facets of the polytope. In part II (On the travelling salesman problem II: Lifting theorems and facets) we prove that all subtour-elimination and all comb inequalities define facets of the symmetric travelling salesman polytope.     

基于柯西分布的视频图像序列背景建模和运动目标检测

提出了一种用于视觉监视系统的基于柯西分布的发光模型的光照不变变化检测方法.假定视频图像序列中每个背景图像像素点灰度观测值的时序变化由白噪声引起,利用建立的初始化背景高斯统计模型对每帧图像进行归一化,得到了背景像灰度比值的分布符合标准柯西分布的结论,解决了柯西分布的模型参量估计问题.在变化检测的基础上,YCbCr颜色空间的亮度、色调和饱和度被用来识别和消除由阴影和反光等引起的变化区域.结果表明,提出的背景建模方法对场景中各种光线变化、小的背景扰动等噪声具有稳健性,可以较为可靠地检测前景目标,识别和去除阴影和反光.     

$R^n$空间中的Cauchy积分公式

In this note p(D) = Dm+ b1Dm 1+···+ bmis a polynomial Dirac operator in R~n, where D =nj=1ej xjis a standard Dirac operator in Rn, bjare the complex constant coefficients. In this note we discuss all decompositions of p(D) according to its coefficients bj,and obtain the corresponding explicit Cauchy integral formulae of f which are the solution of p(D)f = 0.     

Global existence and time decay estimate of solutions to the Keller–Segel system

We consider the chemotaxis‐Navier–Stokes system 1.1-1.4 (Keller–Segel system) in the whole space, which describes the motion of oxygen‐driven bacteria, eukaryotes, in a fluid. We proved the global existence and time decay estimate of solutions to the Cauchy problem 1.1-1.2 in with the small initial data. Moreover, when the fluid motion is described by the Stokes equations, we established the global weak solutions to 1.3-1.4 in with the potential function ? is small and the initial density n₀(x) has finite mass.     

Cauchy-type integral formula and Plemelj formula of hypermonogenic functions on unbounded domains

In this paper, we discuss the Cauchy-type integral formula of hypermonogenic functions on unbounded domains in real Clifford analysis, then we extend the Plemelj formula and Cauchy–Pompeiu formula of hypermonogenic functions on bounded domains to unbounded domains. We also deal with the Green-type formula on unbounded domains and get several important corollaries.