On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

坐标旋转法的收敛性,误差估计及扩展

本文通过推广正规序列的定义,得到一个不等式,由此证明了统一计算初等函数数值的坐标旋转法的收敛性,作了误差估计,并拓广了所计算的函数范围,成为快速计算所有初等函数的统一算法．     

Application of the blind source separation method to feature extraction of machine sound signals

As the result of vibration emission in air, a machine sound signal carries important information about the working condition of machinery. But in practice, the sound signal is typically received with a very low signal-to-noise ratio. To obtain features of the original sound signal, uncorrelated sound signals must be removed and the wavelet coefficients related to fault condition must be retrieved. In this paper, the blind source separation technique is used to recover the wavelet coefficients of a monitored source from complex observed signals. Since in the proposed blind source separation (BSS) algorithms it is generally assumed that the number of sources is known, the Gerschgorin disk estimator method is introduced to determine the number of sound sources before applying the BSS method. This method can estimate the number of sound sources under non-Gaussian and non-white noise conditions. Then, the partial singular value analysis method is used to select these significant observations for BSS analysis. This method ensures that signals are separated with the smallest distortion. Afterwards, the time-frequency separation algorithm, converted to a suitable BSS algorithm for the separation of a non-stationary signal, is introduced. The transfer channel between observations and sources and the wavelet coefficients of the source signals can be blindly identified via this algorithm. The reconstructed wavelet coefficients can be used for diagnosis. Finally, the separation results obtained from the observed signals recorded in a semi-anechoic chamber demonstrate the effectiveness of the presented methods .     

Transformations in machining. Part 1. enhancement of wavelet transformation neural network (WT-NN) combination with a preprocessor

Properly selected transformation methods obtain the most significant characteristics of metal cutting data efficiently and simplify the classification. Wavelet Transformation (WT) and Neural Networks (NN) combination was used to classify the experimental cutting force data of milling operations previously. Preprocessing (PreP) of the approximation coefficients of the WT is proposed just before the classification by using the Adaptive Resonance Theory (ART2) type NNs. Genetic Algorithm (GA) was used to estimate the weights of each coefficient of the PreP. The WT-PreP-NN (ART2) combination worked at lower vigilances by creating only a few meaningful categories without any errors. The WT-NN (ART2) combination could obtain the same error rate only if very high vigilances are used and many categories are allowed.     

Evolving Fault-Tolerant Neural Networks

In this paper, genetic algorithm is used to help improve the tolerance of feedforward neural networks against an open fault. The proposed method does not explicitly add any redundancy to the network, nor does it modify the training algorithm. Experiments show that it may profit the fault tolerance as well as the generalisation ability of neural networks.     

Tuning fuzzy power-system stabilizers in multi-machine systems by global optimization algorithms based on efficient domain partitions

In this paper, the problem of global tuning of fuzzy power-system stabilizers (FPSSs) present in a multi-machine power system in order to damp the power system oscillations is considered. In particular, it is formulated as a problem of global minimization of a multiextremal black-box function over a multidimensional hyperinterval. A global optimization technique, recently proposed, is used for solving the stated problem: the search hyperinterval is partitioned into smaller hyperintervals and the objective function is evaluated only at two vertices corresponding to the main diagonal of the generated hyperintervals, thus avoiding unnecessary ponderous simulations. Then, the performances of this technique are numerically compared with ones of a genetic algorithm (GA).     

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阶矩阵乘法的分块算法

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