Analysis of Spectral Reflectance Using Normalization Method from Endoscopic Spectroscopy System

Objective assessment of gastrointestinal mucosal color is extremely important in the endoscopic diagnosis of digestive tract disease. In this paper, we propose a method to clarify the spectral characteristics of gastric and colon cancer. A large number of spectral reflectance data of mucous membrane are measured by the endoscopic spectroscopy system (ESS) in the National Cancer Center Hospital East, Kashiwa, Japan and the Department of Internal Medicine, Self-Defense Force Center Hospital, Tokyo, Japan. We assume that early cancer appears primarily in the spectral data of short wavelength, because it is usually present in a superficial cell where short wavelength light is scattered more strongly than long wavelength light. To identify the features in the short wavelength components, the spectral reflectance was divided by the reflectance of a long wavelength. We investigated the possibility of distinguishing early cancer from normal spectral data through statistical analysis, employing the projection axis as the mean difference between them. Early cancer and normal spectral data were projected on the projection axis, and the Student’s T-test was applied to evaluate the mean of the distribution between these data.     

Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations

In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement.     

New initial-value method for singularly perturbed boundary-value problems

An initial-value method is given for second-order singularly perturbed boundary-value problems with a boundary layer at one endpoint. The idea is to replace the original two-point boundary value problem by two suitable initial-value problems. The method is very easy to use and to implement. Nontrivial text problems are used to show the feasibility of the given method, its versatility, and its performance in solving linear and nonlinear singularly perturbed problems.This work was supported in part by the Consiglio Nazionale delle Ricerche, Contract No. 86.02108.01, and in part by the Ministero della Pubblica Istruzione.     

Numerical differentiation from a viewpoint of regularization theory

In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.

     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

Dynamics of liquid membranes. II: Adaptive finite difference methods

Two domain-adaptive finite difference methods are presented and applied to study the dynamic response of incompressible, inviscid, axisymmetric liquid membranes subject to imposed sinusoidal pressure oscillations. Both finite difference methods map the time-dependent physical domain whose downstream boundary is unknown onto a fixed computational domain. The location of the unknown time-dependent downstream boundary of the physical domain is determined from the continuity equation and results in an integrodifferential equation which is non-linearly coupled with the partial differential equations which govern the conservation of mass and linear momentum and the radius of the liquid membrane. One of the finite difference methods solves the non-conservative form of the governing equations by means of a block implicit iterative method. This method possesses the property that the Jacobian matrix of the convection fluxes has an eigenvalue of algebraic multiplicity equal to four and of geometric multiplicity equal to one. The second finite difference procedure also uses a block implicit iterative method, but the governing equations are written in conservation law form and contain an axial velocity which is the difference between the physical axial velocity and the grid speed. It is shown that these methods yield almost identical results and are more accurate than the non-adaptive techniques presented in Part I. It is also shown that the actual value of the pressure coefficient determined from linear analyses can be exceeded without affecting the stability and convergence of liquid membranes if the liquid membranes are subjected to sinusoidal pressure variations of sufficiently high frequencies.     

晶体中离子质量差异与激活离子光谱线热加宽和热位移

证明了基质晶体离子的质量差异对其中的激活离子光谱线的热加宽和热位移有贡献，对于单声子吸收或发射机制产生的热加宽和热位移而言，其贡献可以用一个乘积因子D^2表示，对于喇曼散射机制引起的热加宽，其贡献可以用乘积因子D^4表示，文中分别给出两种离子组成的晶体和三种离子组成的晶体的D的表示式。     

Time Asymptotic Behaviour for a One-Velocity Transport Operator with Maxwell Boundary Condition

This paper is concerned with the spectral analysis of a one-velocity transport operator with Maxwell boundary condition in L ₁-space. After a detailed spectral analysis it is shown that the associated Cauchy problem is governed by a C ₀-semigroup. Next, we discuss the irreducibility of the transport semigroup. In particular, we show that the transport semigroup is irreducible. Finally, a spectral decomposition of the solutions into an asymptotic term and a transient one which will be estimated for smooth initial data is given.     

A Particle-Mesh Method for the Shallow Water Equations Near Geostrophic Balance

In this paper we outline a new particle-mesh method for rapidly rotating shallow water flows based on a set of regularized equations of motion. The time-stepping method uses an operator splitting of the equations into an Eulerian gravity wave part and a Lagrangian advection part. An essential ingredient is the advection of absolute vorticity by means of translated radial basis functions. We show that this implies exact conservation of enstrophy. The method is tested on two model problems based on the qualitative features of the solutions obtained (i.e., dispersion or smoothness of potential vorticity contours) as well as on the increase in mean divergence level.     

Numerical treatment of an asset price model with non-stochastic uncertainty

In contrast to stochastic differential equation models used for the calculation of the term structure of interest rates, we develop an approach based on linear dynamical systems under non-stochastic uncertainty with perturbations. The uncertainty is described in terms of known feasible sets of varying parameters. Observations are used in order to estimate these parameters by minimizing the maximum of the absolute value of measurement errors, which leads to a linear or nonlinear semi-infinite programming problem. A regularized logarithmic barrier method for solving (ill-posed) convex semi-infinite programming problems is suggested. In this method a multi-step proximal regularization is coupled with an adaptive discretization strategy in the framework of an interior point approach. A special deleting rule permits one to use only a part of the constraints of the discretized problems. Convergence of the method and its stability with respect to data perturbations in the cone of convexC ¹-functions are studied. On the basis of the solutions of the semi-infinite programming problems a technical trading system for future contracts of the German DAX is suggested and developed. Supported by the Stiftung Rheinland/Pfalz für Innovation, No. 8312-386261/307.