~ Transform Demonstration of Dark Soliton Solutions Found by Inverse Scattering

One of the basic problems about the inverse scattering transform for solving a completely integrable nonlinear evolutions equation is to demonstrate that the Jost solutions obtained from the inverse scattering equations of Cauchy integral satisfy the Lax equations. Such a basic problem still exists in the procedure of deriving the dark soliton solutions of the NLS equation in normal dispersion with non-vanishing boundary conditions through the inverse scattering transform. In this paper, a pair of Jost solutions with same analytic properties are composed to be a 2 × 2 matrix and then another pair are introduced to be its right inverse confirmed by the Liouville theorem. As they are both 2 × 2 matrices, the right inverse should be the left inverse too, based upon which it is not difficult to show that these Jost solutions satisfy both the first and second Lax equations. As a result of compatibility condition, the dark soliton solutions definitely satisfy the NLS equation in normal dispersion with non-vanishing boundary conditions.     

Estimating Invariant Probability Densities for Dynamical Systems

Knowing a probability density (ideally, an invariant density) for the trajectories of a dynamical system allows many significant estimates to be made, from the well-known dynamical invariants such as Lyapunov exponents and mutual information to conditional probabilities which are potentially more suitable for prediction than the single number produced by most predictors. Densities on typical attractors have properties, such as singularity with respect to Lebesgue measure, which make standard density estimators less useful than one would hope. In this paper we present a new method of estimating densities which can smooth in a way that tends to preserve fractal structure down to some level, and that also maintains invariance. We demonstrate with applications to real and artificial data.     

Implementation of a Nonzero-order Joint Transform Correlator Using Interferometric Technique

The implementation of a nonzero-order joint transform correlator using the double port Mach-Zehnder interferometric technique is proposed and demonstrated. This approach provides on-line processing for directly removing the zero-order components of a joint power spectrum in one step and performs the nonzero-order optical correlation. Experimental results are presented and discussed.     

Eigenvalue approach to study the effect of rotation and relaxation time in generalized magneto-thermo-viscoelastic medium in one dimension

The fundamental equations of the problems of generalized thermoelasticity with one relaxation parameter including heat sources in infinite rotating magneto-thermo-viscoelastic media have been derived in the form of a vector matrix differential equation in the Laplace transform domain for a one dimensional problem. These equations have been solved by the eigenvalue approach to determine deformations, stress, and temperature. The results have been compared to those available in the existing literature. The graphs have been drawn to show the effect of rotation in the medium.     

关于微分熵的一类强偏差定理

利用关于乘积分布密度的相对熵和相对熵率的概念,建立了相依连续型随机变量序列关于参考微分熵的一类强偏差定理,证明中给出了将Laplace变换应用于微分熵强偏差定理的研究的一种途径．     

On Hardy’s Theorem on SU(1, 1)

The classical Hardy theorem asserts that ■ and its Fourier transform ■ can not both be very rapidly decreasing.This theorem was generalized on Lie groups and also for the Fourier-Jacobi transform.However,on SU(1,1)there are infinitely many"good"functions in the sense that ■ and its spherical Fourier transform ■ both have good decay. In this paper,we shall characterize such functions on SU(1,1).     

基于移动Agent技术的医学图像检索方法

针对现有医学图像检索方法中，检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题，设计并实现了一种基于移动Agent技术的医学图像检索方法，重点讨论了该方法实现的关键技术，包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法．模拟实验结果表明，该方法实时性较强，占用网络带宽较少，采用的算法运算速度提高近10倍、运算复杂度降低约50％，提取的纹理特征能充分表达图像内容，较好地满足了医学图像的检索要求，实现了对医学图像库快速较准确的检索．     

On the number of full levels in tries

We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2^k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log_1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

代数课程教学改革的一些探索

本文结合代数教学中的实际情况．针对代数教学过程中出现的问题。提出了在代数教学过程中改进教学方法的几条措施．