An Optimal Model and Algorithm of Distributed Information System

Distributed information system makes itself be placed in changing file storage position according to the users＇ request pattern. In this paper, we rebuild the model for a management system to turn the process of file managing into a 0-1 programming problem, and present a new individual form to improve the operating efficiency. Aiming at the model, we define a neighborhood span to make segmentation for searching space by using the fitness, based on the region contraction algorithm, present a new evolution algorithm which has the capability of self-adaptively generating new individuals, and ultimately solve the management problem of the distributed file system.     

Database Encoding and A New Algorithm for Association Rules Mining

This paper proposes a method to encode database. By this way, a record is denoted by only one binary number, so the size of the database is reduced sharply. If some known modified algorithms are used on the database encoded, the efficiency will be improved significantly. At the meantime, a new algorithm based on the proposed encoding method is introduced too. By using some properties of numbers, the itemsets of the database can be converted into numerical fields. Different from the Apriori, the new algorithm discovers the association rules from the largest frequent itemset at first, and then all subitemsets, which are also frequent, will be gotten without any calculation, and all the other small none-frequent itemsets that must be generated in the Apriori will be omitted, and the scan times of the database are also reduced. Test results show the new algorithm based on the encoding database has a lower complexity of time and space.     

抑制微光波前传感器随机噪声的方法研究

在自适应光学系统微光波前传感器中采用像增强器后，高帧频CCD输出的图像中会产生严重的随机噪声，影响光斑质心计算精度，从而使自适应光学系统波前探测精度降低。本文根据微光波前传感器中CCD输出图像的特点对中值滤波，均值滤波，自相关，延时相关等多种方法进行了仿真和实验比较，并提出了一系列评价方法。研究表明延时相关算法是最佳选择。     

一种系统信息提示的方法及其在汇编程序设计中的实现

本文介绍了系统信息提示的一种方法，井重点讨论了用８０８８汇编语言实现的方法。它采用基本信息串表和索引表，对于使用频度较高的系统，可以大大节约系统内存，具存较好的实性用。     

浅析两种分布式路由选择算法

本文介绍及分析了两种基本的动态路由选择算法.     

Partitioning multiple objective optimal solutions with applications in radiotherapy design

The optimal partition for linear programming is induced by any strictly complementary solution, and this partition is important because it characterizes the optimal set. However, constructing a strictly complementary solution in the presence of degeneracy was not practical until interior point algorithms became viable alternatives to the simplex algorithm. We develop analogs of the optimal partition for linear programming in the case of multiple objectives and show that these new partitions provide insight into the optimal set (both pareto optimality and lexicographic ordering are considered). Techniques to produce these optimal partitions are provided, and examples from the design of radiotherapy plans show that these new partitions are useful. A. Holder. Research conducted at Trinity University, TX, and The University of Mississippi, MS. This research was partially supported by ONR Grant N00014-01-1-0917.     

排序聚类分析算法在派生式CAPP系统中的应用及实现

利用零件的相似性原理对零件分组是派生式CAPP系统的重要内容,对零件的分组是否合理,直接影响到派生式CAPP系统能否正常运行。阐述了排序聚类分析算法在生产流程分析法中的工作原理,分析了利用该算法实现零件分组的实现过程,并用示例验证了该算法。     

基于软件无线电的突发模式8DPSK的全数字化实现

提出了一种软件无线电中频收发机的结构和突发模式 8DPSK解调的实现框架 ,在 8DPSK解调时采用了前向初始参数估计算法 ,并证实了该算法的可行性。     

Determination of optimal feedback terminal controllers for general boundary conditions using generating functions

Given a nonlinear system and a performance index to be minimized, we present a general approach to expressing the finite time optimal feedback control law applicable to different types of boundary conditions. Starting from the necessary conditions for optimality represented by a Hamiltonian system, we solve the Hamilton-Jacobi equation for a generating function for a specific canonical transformation. This enables us to obtain the optimal feedback control for fundamentally different sets of boundary conditions only using a series of algebraic manipulations and partial differentiations. Furthermore, the proposed approach reveals an insight that the optimal cost functions for a given dynamical system can be decomposed into a single generating function that is only a function of the dynamics plus a term representing the boundary conditions. This result is formalized as a theorem. The whole procedure provides an advantage over methods rooted in dynamic programming, which require one to solve the Hamilton-Jacobi-Bellman equation repetitively for each type of boundary condition. The cost of this favorable versatility is doubling the dimension of the partial differential equation to be solved.