一种基于代价函数和模糊熵的图像分割方法

提出了一种基于代价函数和模糊熵的图像分割方法.该方法先用代价函数最小化法对退化的图像作预处理,之后,利用模糊熵作进一步的处理.实验结果表明:新方法和一般的阈值分割方法相比,不但分割图像的错分率较小,而且图像的视觉效果也有较大的改善.     

Back Reaction in Static Einstein Spaces—Change of Entropy

Using the thermodynamical approach and the method of York, the back-reaction of anti-de Sitter Schwarzschild black hole in thermal equilibrium with conformal spin-2 field is studied. It is found that both approaches give identical results.     

Sufficient Stochastic Maximum Principle for the Optimal Control of Jump Diffusions and Applications to Finance

We give a verification theorem by employing Arrow's generalization of the Mangasarian sufficient condition to a general jump diffusion setting and show the connections of adjoint processes to dynamic programming. The result is applied to financial optimization problems.     

Note on André's reflection principle

This note generalizes André's reflection principle to give a new combinatorial proof of a formula for the number of lattice paths lying within certain trapezoids.     

HILBERTIAN INVARIANCE PRINCIPLE FOR EMPIRICAL PROCESS ASSOCIATED WITH A MARKOV PROCESS

The authors establish the Hilbertian invariance principle for the empirical process of a stationary Markov process, by extending the forward-backward martingale decomposition of Lyons-Meyer-Zheng to the Hilbert space valued additive functionals associated with general non-reversible Markov processes.     

-混合序列的不变原理

给出一类较广泛的ρ-混合序列 ,并证明了在一定的矩条件下 ,ρ-混合序列的不变原理成立     

转动系统的相对论性分析力学理论

本文讨论了转动相对论力学理论，主要是建立转动系统的相对论性分析力学理论·构造转动系统的相对论性广义动能函数Ｔｒ＝∑ｎｉ＝１Ｉ０ｉΓｉ２（１－１－θ·２ｉ／Γｉ２）和广义加速度能量函数Ｓｒ＝１２∑ｎｉ＝１Ｉｉ（θ·ｉ·θ¨ｉ）２Γｉ２－θ·２ｉ＋θ¨２ｉ，给出其Ｈａｍｉｌｔｏｎ原理和三种不同形式的Ｄ′Ａｌｅｍｂｅｒｔ原理；对于完整约束系统，建立了转动系统的相对论性Ｌａｇｒａｎｇｅ方程、Ｎｉｅｌｓｅｎ方程、Ａｐｐｅｌ方程和Ｈａｍｉｌｔｏｎ正则方程；对于非完整约束系统，建立了转动系统的相对论性Ｒｏｕｔｈ方程、Чаплыгин方程、Ｎｉｅｌｓｅｎ方程和Ａｐｐｅｌ方程；并给出转动系统的相对论性Ｎｏｅｔｈｅｒ守恒律     

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.     

EXISTENCE OF GLOBAL SMOOTH SOLUTION FOR SCALAR CONSERVATION LAWS WITH DEGENERATE VISCOSITY IN 2-DIMENSIONAL SPACE

This article concerns the existence of global smooth solution for scalar conservation laws with degenerate viscosity in 2-dimensional space. The analysis is based on successive approximation and maximum principle.     

优化路问题的代数方法—论动态规划（Ⅱ）

本文用同一思路求解多阶段有向图中三种优化路问题:最优路、N阶最优路及多指标Pareto优化路问题,它们都服从嘉量原理,都用同一个代数公式表达它们的嘉量,并可在同一种表格中进行计算,只是所在半域不同,以本文的方法讨论动态规划中一些离散决定型典型应用问题,其提法、建模思路以及求解过程都有可观的扩大与改善。