Theoretical and numerical analysis on multispectral bioluminescence tomography

Recently, molecular imaging has been rapidly developed to studyphysiological and pathological processes in vivo at the cellularand molecular levels. Among molecular imaging modalities, opticalimaging has attracted a major attention for its unique advantages.In this paper, we establish a mathematical framework for multispectralbioluminescence tomography (BLT) that allows simultaneous studiesof multiple optical reporters. We show solution existence, uniquenessand continuous dependence on data as well as the limiting behaviourswhen the regularization parameter approaches zero or when thepenalty parameter approaches infinity. Then, we propose twonumerical schemes for multispectral BLT and derive error estimatesfor the corresponding solutions.     

几种模糊传递关系的收敛性

本文对几种模糊传递关系进行比较 ,从一个侧面说明了用于构造偏好关系的模糊关系应是互逆关系 .文中证明了对任意的 n阶互逆传递模糊关系 R,必有 Rn=Rn+1 .     

关于任意随机变量序列泛函的强极限定理

本文在k是固定的正整数，{fn}是R^k 1上的Borel可测函数列时，得到了任意随机变量序列{Xrn≥0}的泛函{fn(Xn-k,…,Xn)}的强极限定理，它是Chung的关于独立随机变量序列的强大数律的推广，作为推论，得到了k重非齐次马尔科夫链的一类强极限定理．     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.     

Inner Radius of Univalence for a Strongly Starlike Domain

 The inner radius of univalence of a domain D with Poincaré density ρ _D is the possible largest number σ such that the condition ∥ S _f ∥ _D  = sup _{w∈ D} ρ _D (w) ⁻²∥ S _f (z) ∥ ≤ σ implies univalence of f for a nonconstant meromorphic function f on D, where S _f is the Schwarzian derivative of f. In this note, we give a lower bound of the inner radius of univalence for strongly starlike domains of order α in terms of the order α. The author was partially supported by the Ministry of Education, Grant-in-Aid for Encouragement of Young Scientists, 11740088. A part of this work was carried out during his visit to the University of Helsinki under the exchange programme of scientists between the Academy of Finland and the JSPS. Received November 26, 2001; in revised form September 24, 2002 Published online May 9, 2003     

Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Semi-implicit complementary volume scheme for solving level set like equations in image processing and curve evolution

Summary. We introduce linear semi-implicit complementary volume numerical scheme for solving level set like nonlinear degenerate diffusion equations arising in image processing and curve evolution problems. We study discretization of image selective smoothing equation of mean curvature flow type given by Alvarez, Lions and Morel ([3]). Solution of the level set equation of Osher and Sethian ([26], \[30]) is also included in the study. We prove and estimates for the proposed scheme and give existence of its (generalized) solution in every discrete time-scale step. Efficiency of the scheme is given by its linearity and stability. Preconditioned iterative solvers are used for computing arising linear systems. We present computational results related to image processing and plane curve evolution. Received April 25, 2000 / Revised version received June 11, 2001 / Published online November 15, 2001     

Ambient connections realising conformal Tractor holonomy

For a conformal manifold we introduce the notion of an ambient connection, an affine connection on an ambient manifold of the conformal manifold, possibly with torsion, and with conditions relating it to the conformal structure. The purpose of this construction is to realise the normal conformal Tractor holonomy as affine holonomy of such a connection. We give an example of an ambient connection for which this is the case, and which is torsion free if we start the construction with a C-space, and in addition Ricci-flat if we start with an Einstein manifold. Thus, for a C-space this example leads to an ambient metric in the weaker sense of Čap and Gover, and for an Einstein space to a Ricci-flat ambient metric in the sense of Fefferman and Graham. Current address for first author: Erwin Schr?dinger International Institute for Mathematical Physics (ESI), Boltzmanngasse 9, 1090 Vienna, Austria Current address for second author: Department of Mathematics, University of Hamburg, Bundesstra?e 55, 20146 Hamburg, Germany