Efficient Legendre moment computation for grey level images

Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been devoted to the reduction of computational complexity. Nevertheless, the existing algorithms are mainly focused on binary images. We propose here a new fast method for computing the Legendre moments, which is not only suitable for binary images but also for grey level images. We first establish a recurrence formula of one-dimensional (1D) Legendre moments by using the recursive property of Legendre polynomials. As a result, the 1D Legendre moments of order p, L_p=L_p(0), can be expressed as a linear combination of L_p-1(1) and L_p-2(0). Based on this relationship, the 1D Legendre moments L_p(0) can thus be obtained from the arrays of L₁(a) and L₀(a), where a is an integer number less than p. To further decrease the computation complexity, an algorithm, in which no multiplication is required, is used to compute these quantities. The method is then extended to the calculation of the two-dimensional Legendre moments L_pq. We show that the proposed method is more efficient than the direct method.     

空间柔性机械臂三维动力学数值仿真

本文应用ｄ＇Ａｌｅｍｂｅｒｔ－Ｌａｇｒａｎｇｅ原理，对由基座、（ｎ－１）个柔性连杆及端部负载组成，相互用柱铰连接的柔性链式多体系统进行建模；对在空间技术中，具有一刚杆，两柔杆加上刚性负载所组成的三维机械臂系统，采用Ｇｅａｒ算法进行数值仿真。仿真结果比较符合实际，从而在柔性多体系统的数学模型为刚性常微分方程的情况下，为解决其数值仿真问题，特别是三维问题的数值仿真取得了进展。     

直接斜率波前复原算法的控制效果分析

建立自适应光学系统功率谱抑制函数的概念，分析了采用直接斜率波前复原算法的自适应当光学系统的控制效果，理论分析与６１单元自适应光学系统上的实验结果表明，直接斜率波前复原算法将导致控制效果下降。     

3^n阶矩阵乘法的分块算法

针对３＾ｎ阶矩阵的乘法运行，给出了一种分块算法，其乘法运行量比常规的矩阵乘法计算方法和补零的基－２算法都有所减少。     

256比特的混沌分组密码

由于密码分析研究的进展及DES自身的弱点,原64比特的DES将不能作为数据加密的标准算法而长期存在。在原来工作的基础上,本文提出了256比特的分组密码方案。密码算法由基于混沌映射的数字滤波器构造。     

An algorithm for the three-dimensional packing problem with asymptotic performance analysis

The three-dimensional packing problem can be stated as follows. Given a list of boxes, each with a given length, width, and height, the problem is to pack these boxes into a rectangular box of fixed-size bottom and unbounded height, so that the height of this packing is minimized. The boxes have to be packed orthogonally and oriented in all three dimensions. We present an approximation algorithm for this problem and show that its asymptotic performance bound is between 2.5 and 2.67. This result answers a question raised by Li and Cheng [5] about the existence of an algorithm for this problem with an asymptotic performance bound less than 2.89. This research was partially supported by FAPESP (proc. 93/0603-1) and by CNPq/ProTeM-CC, project ProComb (proc. 680065/94-6).     

Optimized Schwarz methods without overlap for highly heterogeneous media

In this paper an original variant of the Schwarz domain decomposition method is introduced for heterogeneous media. This method uses new optimized interface conditions specially designed to take into account the heterogeneity between the sub-domains on each sides of the interfaces. Numerical experiments illustrate the dependency of the proposed method with respect to several parameters, and confirm the robustness and efficiency of this method based on such optimized interface conditions. Several mesh partitions taking into account multiple cross points are considered in these experiments.     

Decisive arrival law parameters and a general finite capacity queueing problem

This paper addresses the problem of finding the parameters of the arrival law which most significantly influence expected occupation and loss of a finite capacity queue. The input process is supposed to be ergodic and wide sense stationary. We show that it is mostly possible to fit an MMPP(2) to the decisive parameters of observational data. Numerical examples illustrate the importance of the decisive parameters, called key parameters, and also show the accuracy of the proposed fitting procedure. Finally, in the appendix we present the solution of the finite capacity queueing problem with Special Semi Markov Process (SSMP) arrivals and a general service strategy.     

THE ANALYSIS OF THE SEPARATED LAYERS ALGORITHM BY DOMAIN DECOMPOSITION METHOD

From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed.