基于傅立叶变换轮廓术的物面相位提取

采用傅立叶变换轮廓术,针对基频提取的关键技术采用逐行傅立叶变换,准确提取基频信息的方法恢复相位信息.在此基础上,以未畸变条纹为基准,得出被测物体的真实位相值.该方法只需一幅条纹图,节约了测量时间.实验证明可实现无接触面型的自动传感.     

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

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

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

Algebra with Quadratic Commutation Relations for an Axially Perturbed Coulomb–Dirac Field

The motion of a particle in the field of an electromagnetic monopole (in the Coulomb–Dirac field) perturbed by an axially symmetric potential after quantum averaging is described by an integrable system. Its Hamiltonian can be written in terms of the generators of an algebra with quadratic commutation relations. We construct the irreducible representations of this algebra in terms of second-order differential operators; we also construct its hypergeometric coherent states. We use these states in the first-order approximation with respect to the perturbing field to obtain the integral representation of the eigenfunctions of the original problem in terms of solutions of the model Heun-type second-order ordinary differential equation and present the asymptotic approximation of the corresponding eigenvalues.     

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     

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

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

Consolidation around a borehole embedded in media with double porosity under release of geostatic stresses

The paper deals with the stress, displacement, pore and fissure pressures fields induced by the drilling and/or the pressurization of a vertical borehole in a formation of water-saturated porous media with double porosity. The solution includes the boundary condition of non-hydrostatic in situ state of stress. The solid skeleton is assumed to behave as a linearly poroelastic material with compressible constituents. The analytical solution is derived in Laplace’s space and transformed to the time domain using a numerical inversion technique. The histories of pore and fissure pressures are illustrated to show the influence of permeabilities of the pore and fissure systems.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

Improved holographic particle sizing by using absolute values of the wavelet transform

A new method for sizing particle from in-line particle holograms by using absolute values of the wavelet transform is proposed in order to improve accuracy in measurements. The proposed method provides direct calculation of the particle size by using spatial frequency information of a chirp signal at minima position of an envelope function. Simulation and experimental results are presented.     

Widrow-cellular neural network and optoelectronic implementation

A new type of optoelectronic cellular neural network has been developed by providing the capability of coefficients adjusment of cellular neural network (CNN) using Widrow based perceptron learning algorithm. The new supervised cellular neural network is called Widrow-CNN. Despite the unsupervised CNN, the proposed learning algorithm allows to use the Widrow-CNN for various image processing applications easily. Also, the capability of CNN for image processing and feature extraction has been improved using basic joint transform correlation architecture. This hardware application presents high speed processing capability compared to digital applications. The optoelectronic Widrow-CNN has been tested for classic CNN feature extraction problems. It yields the best results even in case of hard feature extraction problems such as diagonal line detection and vertical line determination.