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.     

Local branching

The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical applications. In the present paper we investigate the use of a generic MIP solver as a black-box ``tactical' tool to explore effectively suitable solution subspaces defined and controlled at a ``strategic' level by a simple external branching framework. The procedure is in the spirit of well-known local search metaheuristics, but the neighborhoods are obtained through the introduction in the MIP model of completely general linear inequalities called local branching cuts. The new solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the MIP solver at hand. It alternates high-level strategic branchings to define the solution neighborhoods, and low-level tactical branchings to explore them. The result is a completely general scheme aimed at favoring early updatings of the incumbent solution, hence producing high-quality solutions at early stages of the computation. The method is analyzed computationally on a large class of very difficult MIP problems by using the state-of-the-art commercial software ILOG-Cplex 7.0 as the black-box tactical MIP solver. For these instances, most of which cannot be solved to proven optimality in a reasonable time, the new method exhibits consistently an improved heuristic performance: in 23 out of 29 cases, the MIP solver produced significantly better incumbent solutions when driven by the local branching paradigm. Mathematics Subject Classification (2000):90C06, 90C10, 90C11, 90C27, 90C59     

An optimal choice problem for a set of checking procedures

An item having a known initial failure probability is to be controlled by some out of a finite set of possible checks. Every check costs a certain amount of money, and budget constraints must be met. A check is characterized by the probabilities of three events: (i) letting a workable item pass, (ii) overlooking a failure if one is present, (iii) introducing a failure into a workable item. We show how any subset of checks to be employed is ordered optimally, and how the optimal subsequence of checks depends on the initial failure probability and oil the budget constraint.     

自适应光学中的非等晕性

本文讨论了自适应光学中非等晕域对补偿效果的影响,提出了一种减小非等晕性误差的新方法—位相梯度法。分析结果表明,该方法可显著增大有效校正的角范围,使非等晕性误差的影响大大减小。我们预期位相梯度法有望解决自适应光学中信标的非等晕性问题。     

逼近严格伪压缩映象不动点的Ishikawa迭代程序

Let(X,‖·‖ ) be a Banach space.Let K be a nonempty closed,convex subset of Xand T∶K→K.Assume that T is Lipschitzian,i.e.there exists L>0 such that‖ T(x) -T(y)‖≤ L‖ x -y‖for all x,y∈K.Withoutloss of generality,assume that L≥ 1 .Assume also that T is strictly pseudocontractive.According to[1 ] this may be statedas:there exists k∈ (0 ,1 ) such that‖ x -y‖≤‖ x -y + r[(I -T -k I) x -(I -T -k I) y]‖for all r>0 and all x,y∈ K.Throughout,let N denote the set of positive in…     

ARMAX系统不外加输入激励的辨识

本文在不外加输入激励情况下，讨论了开环不稳定和非最小相位的ARMAX系统系数的一致估计．所用方法是用适应镇定的办法，使得闭环系统成为平稳可逆的ARMA过程，然后利用Yule-Walker方程给出闭环系统系数的一致估计，而把求开环系统系数的一致估计归结为解一组线性代数方程。     

Pure adaptive search in global optimization

Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89.     

Multi-conjugate solar adaptive optics at the Vacuum Tower Telescope on Tenerife

We present a breadboard multi-conjugate adaptive optics (MCAO) system for high angular resolution solar observations which we operate at the Vacuum Tower Telescope. We have developed methods to estimate quantitatively the performance of solar adaptive optics from science data. Several sets of short exposure images of the solar photosphere were analyzed to assess the performance of the MCAO. We demonstrate that a 30 arcsec field of view is substantially improved when the MCAO system is turned on. This compares favourably with an improvement of a 10 arcsec field with conventional solar adaptive optics. We also show how irradiance fluctuations in the MCAO compensated focus can be suppressed. To cite this article: O. von der Lühe et al., C. R. Physique 6 (2005).     

On general form of Navier-Stokes equations and implicit factored scheme

A general weak conservative form of Navier-Stokes equations expressed with respect to non-orthogonal Curvilinear coordinates and with primitive variables was obtained by using tensor analysis technique, where the contravariant and covariant velocity components were employed. Compared with the current coordinate transformation method, the established equations are concise and forthright, and they are more convenient to be used for solving problems in body-fitted curvilinear coordinate system. An implicit factored scheme for solving the equations is presented with detailed discussions in this paper. For n-dimensional flow the algorithm requires n-steps and for each step only a block tridiagonal matrix equation needs to be solved. It avoids inverting the matrix for large systems of equations and enhances the speed of arithmetic. In this study, the Beam- Warming’s implicit factored schceme is extended and developed in non-orthogonal curvilinear coordinate system.