注水站微机数据采集与控制系统

用工控机组成了油田注水站数据采集系统．给出了系统的组成及测量方法，并讨论了系统的可靠性等问题．     

数据传输链路中几种纠错编译码的算法和性能

介绍数据传输中常用的戈莱码的几种不同译码算法，分析各种算法的纠错性能，给出用计算机模拟的结果。还介绍对数据链Ｌｉｎｋｌ中的纠错码和地址码的编译码算法，分析其性能，给出计算机模拟的结果。     

Liquid Crystal Television Spatial Light Modulator

The liquid crystal televison spatia light modulator(LCTVSLM)characterized is usable in optical processing applications.e.g.,optical pattern recognition,associative memory,optical computing,correlation detection and optical data processing systems.The array performance and real-time optical correlation applications are reviewed.     

Designing Templates for Mining Association Rules

Current approaches to data mining usually address specific userrequests, while no general design criteria for the extraction of associationrules are available for the end-user. In this paper, we propose aclassification of association rule types, which provides a general frameworkfor the design of association rule mining applications. Based on theidentified association rule types, we introduce predefined templates as ameans to capture the user specification of mining applications. Furthermore,we propose a general language to design templates for the extraction ofarbitrary association rule types.     

数据处理系统性能评价的简单理论模型

提出了一个简单的理论模型．旨在为数据处理系统的性能评价提出一个理论框架．以此框架为基础，可形成实用的简单评估方法．该模型只含两个参数，它们是统计量，可用统计方法确定．     

A clustering method to distribute a database on a grid

Clusters and grids of workstations provide available resources for data mining processes. To exploit these resources, new distributed algorithms are necessary, particularly concerning the way to distribute data and to use this partition. We present a clustering algorithm dubbed Progressive Clustering that provides an “intelligent” distribution of data on grids. The usefulness of this algorithm is shown for several distributed datamining tasks.     

高速连续数据记录系统中双页缓存的设计和实现

在高速连续数据记录系统中，存储设备需要速度匹配单元来实现高速连续数据记录，文章讨论了双页缓存在高速连续记录系统中的作用，并以实际开发的记录系统为例，详细介绍了双页缓存的设计和实现。     

Canonical density control

The Sparse Table is a data structure for controlling density in an array which was first proposed in 1981 and has recently reappeared as a component of cache-oblivious data structures. All existing variants of the Sparse Table divide the array into blocks that have a calibrator tree above them. We show that the same amortized complexity can be achieved without this auxiliary structure, obtaining a canonical data structure that can be updated by conceptually simpler algorithms.