Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Convergence analysis of time-point relaxation iterates for linear systems of differential equations

We study convergence properties of time-point relaxation (TR) Runge-Kutta methods for linear systems of ordinary differential equations. TR methods are implemented by decoupling systems in Gauss-Jacobi, Gauss-Seidel and successive overrelaxation modes (continuous-time iterations) and then solving the resulting subsystems by means of continuous extensions of Runge-Kutta (CRK) methods (discretized iterations). By iterating to convergence, these methods tend to the same limit called diagonally split Runge-Kutta (DSRK) method. We prove that TR methods are equivalent to decouple in the same modes the linear algebraic system obtained by applying DSRK limit method. This issue allows us to study the convergence of TR methods by using standard principles of convergence of iterative methods for linear algebraic systems. For a particular problem regions of convergence are plotted.     

集合环

本文用集环来表现模糊集，得到了表现定理的新形式，并证明了这种表现可以有限化，即用有限个经典集近似刻划模糊集并且这样的刻划是同态的。最后，证明了集对方法是集环表现的特殊情形。     

Complete Surjections and Complete Epimorphisms over Completely Distributive Lattices

Generators and lattice properties of the poset of complete homomorphisic images of a completely distributive lattice are exploited via the localic methods. Some intrinsic and extrinsic conditions about this poset to be a completely distributive lattice are given. It is shown that the category of completely distributive lattices is co-well-powered,and complete epimorphisms on completely distributive lattice are not necessary to be surjections. Finally, some conditions about complete epimorphisms to be surjections are given.     

Approximation by a class of modified Szász-Durrmeyer operators

We modify Szász-Durrmeyer operators by means of three-diagonal generalized matrix which overcomes a difficulty in extending a Berens-Lorentz result to the Szász-Durrmeyer operators for second order of smoothness. The direct and converse theorems for these operators inL _p are also presented by Ditzian-Totik modulus of smoothness.This project is supported by Zhejiang Provincial Foundation of China.     

用于光学神经网络硬件系统误差纠正的虚拟神经网络

提出了一种用于修正光学神经网络硬件系统误差的虚拟神经网络模型，光学实验结果表明该网络能够有效地消除硬件系统误差对实验结果的影响。     

ON THE COHOMOLOGY OF GENERALIZED RESTRICTED LIE ALGEBRAS

0.IntroductionThispaperisaimedatdevelopingthecohomologytheoryofmodularLiealgebrasandthendeterminingthefirstcohomologygroupsofCartantypeLiealgebras.AsgeneralizationoftheconceptofrestrictedLiealgebras,ageneralizedrestrictedLiealgebra(GRLiealgebra)wasintroducedin[21],whichisassociatedwithabasisandamappingofthebasisintotheLiealgebrasatisfyingthegeneralized-restrictednessconditions.Generalizedrestrictedrepresentations(GRrepresentations)werethenintroduced,whichcanbereducedtotherepresentationsofa…     

Shape Hessian for generalized Oseen flow by differentiability of a minimax: A Lagrangian approach

The goal of this paper is to compute the shape Hessian for a generalized Oseen problem with nonhomogeneous Dirichlet boundary condition by the velocity method. The incompressibility will be treated by penalty approach. The structure of the shape gradient and shape Hessian with respect to the shape of the variable domain for a given cost functional are established by an application of the Lagrangian method with function space embedding technique. This work was supported by the National Natural Science Fund of China (No. 10371096) for ZM Gao and YC Ma.     

Study on a Cross Diffusion Parabolic System

This paper considers a kind of strongly coupled cross diffusion parabolic system,which can be usedas the multi-dimensional Lyumkis energy transport model in semiconductor science.The global existence andlarge time behavior are obtained for smooth solution to the initial boundary value problem.When the initialdata are a small perturbation of an isothermal stationary solution,the smooth solution of the problem under theinsulating boundary condition,converges to that stationary solution exponentially fast as time goes to infinity.