OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY

An optimization approach for multi-relational joins based on the matching concept in graph theory is introduced. The basic idea lies in constructing a join graph from an expression of N-relation query, and seeking for a maximun matching with minimun total weight. The algorithm for bipartition(X, Y) is proposed in this paper.     

A Dynamic Model for Generation Expansion Planning and Algorithm

This paper discusses the problem of long-range generation expansion planning. A dynamic model for long-range expansion planning is set up and an algorithm-a two-step programming is presented, which is used here in a case.     

A New Adaptive Sequential Diagnosis Algorithm in the PMC Model

We present an adaptive algorithm for sequential diagnosis in the PMC model,which can directly identify a faulty processor without first identifying a fault-free processor.     

Real-time Performance of Linux System

The standard Linux is a typical time-sharing system, it has a poor real-time performance. But according to the applications of the Linux OS are expanding on real-time domain, it becomes necessary to enhance the performance of the Linux system. This paper analyses the schedule policies and schedule algorithms of the Linux kernel, and discusses several different kinds of methods about enhancing real-time performance of the Linux system from the total Linux system. They authors summarizes the current research's developments of the Linux system.     

Automatic Fingerprint Classification by GA-Based Neural Network

Fingerprint classification can provide an important indexing mechanism in a fingerprint database. An accurate and consistent classification can greatly reduce fingerprint matching time for large database. In the paper, by combining genetic algorithm and neural network is presented a fingerprint classification algorithm which is able to achieve an accurate classification. By inputting the global feature represented by directional image to three layer neural network trained by genetic algorithm, the fingerprints were classified into six categories: whorl, right loop, left loop, arch, double loop and undiscerning type successfully.     

Avoiding Obstacle Planning for Robots on Molecular Optimization Algorithm

Interest in DNA computing has increased overwhelmingly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem. This article introduces the improving method in virtue of the biological thery of DNA technology, a new molecular algorithm is advanced. After a numerical simulation, the result shows that it avoids the prematurely and lower convergent speed of the classic genetic algorithm, and inherits global search capability, the validity and the speed of the genetic algorithm have been increased. The best result can be obtained in few iterative times. It is fit for solving path planning problem.     

基于混沌算法的工程车辆自动变速神经网络控制

为了克服BP神经网络收敛速度慢和易陷入局部极小点的不足，提出了一种基于混沌算法的工程车辆自动变速神经网络控制方法，并利用ZL50型装载机传动系统换挡控制试验的数据进行了验证性仿真试验。仿真结果表明：该方法对于车辆自动换挡智能控制是可行的，可以根据操作工况实现正确的变速挡位决策。     

泵站竖井进水流道数值模拟与装置特性试验

采用雷诺平均纳维—斯托克斯方程(RANS)和标准kε湍流模型,运用SIMPLEC算法,对椭圆型线前置竖井贯流进水流道内的流动进行了三维数值计算,揭示了竖井进水流道内流场、特征断面的速度分布及水力损失规律。对椭圆型线竖井进水流道与出水流道匹配组成的模型泵装置进行动力特性试验,得出了4种叶片角度下的泵装置特性曲线。研究结果表明:采用椭圆型线设计的竖井进水流道合理;大型低扬程泵站采用卧式竖井贯流结构,泵装置效率较高。