基于混合遗传算法的树状注水管网拓扑优化

以投资最小为目标函数,以井间隶属关系的惟一性、连接注水井数量等限制为约束条件,建立了树状注水管网拓扑优化数学模型.根据模型特点,将优化问题分为分配层和几何层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,采用随机多父辈适应函数值加权交叉和多种变异操作,结合了模拟退火算法,并给出了初温的确定方法,改进了选择复制操作,从而形成了混合遗传算法.该算法能够有效地提高收敛速度,避免早熟收敛.利用算例说明了该方法的有效性.     

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.     

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

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

基于广义最小均方的自适应递归滤波算法

本文提出了一种广义最小均方(GLMS)算法,分析了GLMS算法的性能,并根据GLMS算法,导出一种自适应递归滤波(ARF)算法。在推导中,ARF算法避开了超稳定定理,从而考虑自适应系统的严格正实条件和Popov不等式是不必要的。计算机模拟表明ARF算法具有很高的收敛速度。     

一种基于MPEG-2的立体视频编码中的视差匹配快速算法

高效，快速的视差匹配是立体视频处理中的一项关键技术。本文在分析立体图像序列的视差矢量与运动矢量之间的相关性的基础上，提出一种基于MPEG-2的立体视频编码中的视差匹配快速算法。实验结果表明，与全搜索法相比，在保证重建图像质量的前提下，快速算法能显著降低视差估计的计算复杂度。     

准连续波体制雷达最大熵方法的算法选择

准连续体制作为一种新型雷达体制以其固有的优越性给雷达界带来了巨大的冲击。其数字信号处理系统的开发是进一步完善该体制雷达的关键。本文针对数字信号处理系统中最大熵谱外推电路的算法选择进行了研究。     

BP神经网络在致密砂岩储层识别中的应用

川西须家河组地层岩性复杂,属于超致密低孔渗储层,所以储层识别是该地层天然气勘探中所面临的关键问题和难点之一。针对常规储层识别准确率不高的状况,提出利用BP神经网络进行储层的气水干层识别,利用模糊聚类和产层测试结果标定建模样本,采取随机抽样形成建模集与测试集,建立BP神经网络模型对23口井的储层进行气水干层预测,正确率达77.9%以上,明显提高了该地区的测井解释精度,并提供了一种准确率较高的储层预测方法。     

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.