Induced focusing and conversion of a Gaussian beam into an elliptic Gaussian beam

We have presented an investigation of the induced focusing in Kerr media of two laser beams, the pump beam and the probe beam, which could be either Gaussian or elliptic Gaussian or a combination of the two. We have used variational formalism to derive relevant beam-width equations. Among several important findings, the finding that a very week probe beam can be guided and focused when power of both beams are well below their individual threshold for self-focusing, is a noteworthy one. It has been found that induced focusing is not possible for laser beams of any wavelength and beam radius. In case both beams are elliptic Gaussian, we have shown that when power of both beams is above a certain threshold value then the effective radius of both beams collapses and collapse distance depends on power. Moreover, it has been found that induced focusing can be employed to convert a circular Gaussian beam into an elliptic Gaussian beam.     

Harmonic Calculus on Fractals - A Measure Geometric Approach I

Differentiation of functions w.r.t. finite atomless measures with compact support on the real line is introduced. The related harmonic calculus is similar to that of the classical Lebesgue case. As an application we obtain the Weyl exponent for the spectral asymptotics of the Laplacians w.r.t. linear Cantor-type measures with arbitrary weights.     

基于正弦灰度变换的X光图像增强

介绍了灰度变换法的几种形式 ,提出了一种正弦非线性变换法 ,对三幅数字X光医学图像进行了处理 ,获得了令人满意的对比度增强效果 ,证明该方法有效而实用     

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Performance and simulation of an on-board guided-wave optical processor for airborne SAR applications

This paper describes the performance and simulation of a compact integrated optical processor for the real-time reconstruction of two-dimensional images in airborne stripmap synthetic aperture radar applications. The functional behavior of the processor is explained in some detail. The design criteria are briefly given. The simulation step allowed the main processor characteristics and properties to be identified. A number of comparisons were obtained in airborne SAR mission scenarios between the predictions of the optical device and those achieved by the modern electronic digital approach, based on the wavefront reconstruction method by matched filtering.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

改善液晶光阀投影光学系统偏振特性的理论设计方法

定量分析了液晶光阀投影光学系统中影响系统对比度的主要因素，利用矢量方法建立三维空间数学模型对光线进行追迹，并利用琼斯矩阵和矢量光学的原理分析了偏振器件--主要是波片--和各种光学薄膜对光学系统性能的影响。给出了在一定假设条件下的对没有波片的光学系统和插入波征后的光学系统的仿真计算结果。两组数据比较表明在光路中插入合适相位差的波片可以显著提高系统对比度等性能。