LINEAR SEARCH FOR A BROWNIAN TARGET MOTION

A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point.The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite,and to show the existence of a search plan which made this expected value minimum.     

从最优规模到更大的最优规模--理性企业规模的线性优化

企业效益是以规模为基础的，不同企业最优规模及达到的方式不同。本讨论了企业为获得最优效益，在理性、线性的最优规模下处理过剩资源，单纯的规模扩张及价格与产量关系线性时的规模扩张。指出在初步最优规模，无过剩资源时，单纯的规模扩张以资源同增长的方式最优；在价格与产量关系线性时，企业有最优扩张系数，最大的最优规模。     

一类混杂动态系统的能控性（I）——基本结果

首次将时滞现象引入到线性切换系统的模型中，研究含有时滞线性切换系统的能控性及其判定条件．全部工作由三部分组成，第I部分首先，提出含时滞的线性切换系统的数学模型，并介绍切换系统的基本概念——切换序列．其次，引入列空间、循环不变子空间和广义循环不变子空间等基本几何概念，给出一些有关概念的基本性质，特别是分离引理．然后以一个基本引理的形式揭式某一积分方程的解集与广义循环不变子空间之间的联系，这个引理将在能控性的判定中起关键作用．这些概念和引理都将作为以后展开能控性分析所必需的研究工具．     

一类混杂动态系统的能控性(Ⅲ)——含多时滞的情形

首次将时滞现象引入到线性切换系统的模型中,研究含有时滞线性切换系统的能控性及其判定条件。全部工作由三部分组成。第Ⅲ部分,主要研究含多时滞的线性切换系统的能控性及其判定规则。首先给出周期型系统的单周能控性和多周期能控性的定义和充要条件,其次给出非周期系统的能控性的定义和充要条件。最后,研究时滞大小不一致的情形,指出能控性与时滞大小无关。     

Adsorption effects and NMR properties: Continuous chain approach

The NMR properties of nuclei linked to long linear polymer molecules are sensitive to the influence of hard walls. In this context, the residual energy of tensorial spin-spin interactions is calculated using a path integral approach. Several thermodynamic quantities of the polymer system (free energy, equation of state,...) are also expressed, taking chain stiffness effects and the presence of two repulsive walls into consideration.     

The solvability conditions for inverse eigenproblem of symmetric and anti‐persymmetric matrices and its approximation

The problem of generating a matrix A with specified eigen‐pair, where A is a symmetric and anti‐persymmetric matrix, is presented. An existence theorem is given and proved. A general expression of such a matrix is provided. We denote the set of such matrices by ??????_Eⁿ. The optimal approximation problem associated with ??????_Eⁿ is discussed, that is: to find the nearest matrix to a given matrix A* by A∈??????_Eⁿ. The existence and uniqueness of the optimal approximation problem is proved and the expression is provided for this nearest matrix. Copyright © 2002 John Wiley & Sons, Ltd.     

Parameter choice by discrepancy principles for ill-posed problems leading to optimal convergence rates

Schock (Ref. 1) considered a general a posteriori parameter choice strategy for the Tikhonov regularization of the ill-posed operator equationTx=y which provides nearly the optimal rate of convergence if the minimal-norm least-squares solution belongs to the range of the operator (T ^* T) ^v , o<v1. Recently, Nair (Ref. 2) improved the result of Schock and also provided the optimal rate ifv=1. In this note, we further improve the result and show in particular that the optimal rate can be achieved for 1/2v1.The final version of this work was written while M. T. Nair was a Visiting Fellow at the Centre for Mathematics and Its Applications, Australian National University, Canberra, Australia. The work of S. George was supported by a Senior Research Fellowship from CSIR, India.     

Optimal control of infinite-dimensional uncertain systems

In this paper, we consider a minimax problem of optimal control for a class of strongly nonlinear uncertain evolution equations on a Banach space. We prove the existence of optimal controls. A nontrivial example of a class of systems governed by a nonlinear partial differential equation with uncertain spatial parameters is presented for illustration.This work was supported in part by the National Science and Engineering Research Council of Canada under Grant No. A7109 and The Engineering Faculty Development Fund, University of Ottawa.The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.     

Dynamic complexity of optimal paths and discount factors for strongly concave problems

We study the relationship between the dynamical complexity of optimal paths and the discount factor in general infinite-horizon discrete-time concave problems. Given a dynamic systemx _t+1=h(x _t ), defined on the state space, we find two discount factors 0 < ^{* **} < 1 having the following properties. For any fixed discount factor 0 < < ^*, the dynamic system is the solution to some concave problem. For any discount factor ^** < < 1, the dynamic system is not the solution to any strongly concave problem. We prove that the upper bound ^** is a decreasing function of the topological entropy of the dynamic system. Different upper bounds are also discussed.This research was partially supported by MURST, National Group on Nonlinear dynamics in Economics and Social Sciences. The author would like to thank two anonymous referees for helpful comments and suggestions.     

Approximating the zeros of analytic functions by the exclusion algorithm

We give a practical version of the exclusion algorithm for localizing the zeros of an analytic function and in particular of a polynomial in a compact of . We extend the real exclusion algorithm to a Jordan curve and give a method which excludes discs without any zero. The result of this algorithm is a set of discs arbitrarily small which contains the zeros of the analytic function.