混沌实验数据处理及仿真

大学物理实验中混沌实验大多采用观察现象的方法进行,本实验采用蔡氏电路(Chua s circuit)产生混沌行为.在观察不同初始值条件下出现的倍周期分岔、阵发混沌、奇异吸引子等相图及现象的基础上,通过对采集数据进行处理,对负电阻伏安特性进行分段线性拟合,用功率频谱法、计算机仿真方法(龙格-库塔数值积分法)对混沌现象进行描绘,将实验数据与非线性方程组的数值解相结合,呈现出混沌现象的本质.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.     

Fabrication of material-independent morphology gradients for high-throughput applications

Gradient surfaces allow rapid, high-throughput investigations and systematic studies in many disparate fields, including biology, tribology and adhesion. We describe a novel method for the fabrication of material-independent morphology gradients, involving a two-step process of particle erosion followed by a chemical polishing procedure that preferentially removes features with a small radius of curvature as a function of time. Gradients are fabricated on aluminium surfaces, but they may be readily transferred to other materials via a replication technique, which allows for the production of identical roughness gradient samples with any chosen surface chemistry. The gradients have been characterized by means of scanning electron microscopy and optical profilometry. Standard roughness parameters (Ra, Rq, Rz, Sm and Sk) were calculated from optical profilometry data. The roughness has also been assessed over different wavelength windows by means of a fast Fourier transformation approach.     

AN ITERATIVE EQUATION ON THE UNIT CIRCLE

A functional equation of nonlinear iterates is discussed on the circle S1 for its continuous solutions and differentiable solutions. By lifting to R, the existence, uniqueness and stability of those solutions are obtained. Techniques of continuation are used to guarantee the preservation of continuity and differentiability in lifting.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.     

利用MLP和FFT实现快速脸部检测

提出了一种对静止图像进行快速脸部检测的方法.通过将多层感知器隐层神经元视为滤波器,利用快速傅立叶变换的性质,把时域卷积转换为频域乘积形式,在保持较高检测率的情况下提高了检测速度.实验证明,利用本文提出的算法可以获得较好的结果.     

Modified Householder iterative method free from second derivatives for nonlinear equations

In this paper, we suggest and analyze a new two-step predictor–corrector type iterative method free from second derivatives for solving nonlinear equations of the type f(x)=0. This new method includes the two-step Newton method as a special case. We prove that the new iterative method is of fourth-order. Several examples are given to illustrate the efficiency of this new method and its comparison with other iterative methods. This method can be considered as a significant improvement of the Newton method and its variant forms.     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

关于离散HJB方程的下解与上解

本文讨论HJB方程上、下解的几个性质,并讨论了从上解出发的一个迭代法的收敛性.