一类广义非线性隐拟变分包含

引入和研究了一类新的涉及集值极大单调映象的广义非线性隐拟变分包含.对此类变分包含在没有紧性假设下证明了解的存在定理.为寻求此类变分包含的近似解,建议和分析了一个新的迭代算法.给出了由新算法产生的迭代序列的收敛性.作为特殊情形,也讨论了在此领域内的某些已知结果.     

Adaptive optics in astronomy

Since Galileo’s first observations in 1609, telescopes have grown dramatically in size. Larger telescopes collect more light, allowing astronomers to detect fainter sources and to look further back in time towards the birth of the universe. The angular resolution of these telescopes, however, has been limited by turbulence in the earth’s atmosphere. This limitation can be dramatically reduced with the use of adaptive optics (AO) to measure and correct the blurring introduced by atmospheric turbulence. AO is now routinely used for science observations on the world’s largest telescopes and is providing a much more detailed view of our universe.     

极值温差红外图像的自适应双局部增强算法

针对目前红外焦平面成像系统在观察目标、特别是极值温差目标时,各温度段灰度描述不均匀和细节不够的问题,提出了一种自适应红外图像双局部增强算法。详细介绍了通过空间分布和灰度统计特性两个方向实现对极值温差图像自适应增强的方法,该方法首先从红外图像的空间分布特性出发,将图像切割成多个局部图像,然后再从直方图灰度分布出发,将局部图像的直方图进行聚类分段,并对分段直方图均衡增强,最后对生成的每个局部图像增强结果进行线性插值拼接完成增强算法。通过在红外焦平面系统中实验证明了极值温差自适应的红外图像双局部增强算法的可行性,并获得了很好的效果,成像质量有明显提高。     

场景自适应的红外焦平面成像动态范围调整技术

针对红外焦平面对辐射强度较大的目标输出动态范围不足的问题,提出了一种场景自适应的红外焦平面成像动态范围调整技术。包括3个方面的内容：从图像中提取目标灰度特征,获取动态范围自适应依据;结合最小均方自适应滤波算法,对调整依据进行滤波预测后给出调节值;把灰度调节值转换成电平值,利用电平值设置红外焦平面偏置电压完成焦平面成像动态范围自适应。最后,对整体方案进行了实验验证。通过在红外焦平面成像系统中实验证明了基于场景成像动态范围自适应方法的可行性,并获得了很好的效果,成像质量有明显提高。     

An ε-Minimax Theorem for Bi-Lower-Semicontinuous Set-Valued Mappings

In this article, an approximate minimax theorem for bi-lower-semicontinuous set-valued mapping was proved, relationships between semicontinuous set-valued mappings are discussed and the existence of approximate maxmin was given. The minimax theorem in this article is the first minimax theorem that doesn’t require the set-valued mappings to be continuous.     

New Exact Solutions for (2+1)-Dimensional Breaking Soliton Equation

New exact solutions in terms of the Jacobi elliptic functions are obtained to the (2+1)-dimensional breaking soliton equation by means of the modified mapping method. Limit cases are studied, and new solitary wave solutions and triangular periodic wave solutions are obtained.     

Multi-Conjugate Adaptive Optics for ELTs: constraints and limitations

We present how enlarging the size of a telescope from the current 10 meter telescope to the future 100 meter Extremely Large Telescopes increases the complexity of a classical or multiconjugate adaptive optics instrument. We point out elements or parameters of the system for which it is critical to propose new ideas as solutions and we study the effect of the increase of the diameter on the point spread function of an MCAO and a Ground Layer AO system. To cite this article: R. Ragazzoni et al., C. R. Physique 6 (2005).     

Additive inequalities for intermediate derivatives of differentiable mappings of Banach spaces

Suppose thatX andY are real Banach spaces,U ⊂X is an open bounded set star-shaped with respect to some point,n, k ∈ ℕ,k <n, andMn, k (U,Y) is the sharp constant in the Markov type inequality for derivatives of polynomial mappings. It is proved that for anyM ≥M _n,k (U, Y) there exists a constantB > 0 such that for any functionf ∈C ⁿ (U, Y) the following inequality holds:

Banach空间四阶周期边值问题正解的存在性

讨论了Banach空间E中的四阶周期边值问题:( u(4)(t)??u00(t)+′u(t)= f(t; u(t));06 t 61; u(i)(0)= u(i)(1); i =0;1;2;3正解的存在性,其中f :[0;1]￡ P ! P连续, P为E的正元锥,?;′2 R且满足0<′<(?2+2?2)2;?>?2?2;′?4+??2+1>0:通过非紧性测度的估计技巧与凝聚映射的不动点指数理论获得了该问题正解的存在性结果.     

On Rockafellar’s theorem using proximal point algorithm involving -maximal monotonicity framework

On the basis of the general framework of H-maximal monotonicity (also referred to as H-monotonicity in the literature), a generalization to Rockafellar’s theorem in the context of solving a general inclusion problem involving a set-valued maximal monotone operator using the proximal point algorithm in a Hilbert space setting is explored. As a matter of fact, this class of inclusion problems reduces to a class of variational inequalities as well as to a class of complementarity problems. This proximal point algorithm turns out to be of interest in the sense that it plays a significant role in certain computational methods of multipliers in nonlinear programming. The notion of H-maximal monotonicity generalizes the general theory of set-valued maximal monotone mappings to a new level. Furthermore, some results on general firm nonexpansiveness and resolvent mapping corresponding to H-monotonicity are also given.