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

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

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

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

The integral experiment on beryllium with D-T neutrons for verification of tritium breeding

A clean benchmark experiment on beryllium was performed with D-T neutrons at the FNS facility of the Japan Atomic Energy Agency. The main objective was to verify the integral data related to the tritium production on lithium isotopes. Tritium production rates, as well as activation reaction rates were measured inside the beryllium assembly that was shaped as a pseudo-cylindrical slab with an area-equivalent diameter of 628 mm and a thickness of 355 mm. Experimental results were analyzed with a three-dimensional Monte Carlo transport code MCNP-4C and FENDL/MC-2.0, JENDL-3.2/3.3 neutron transport libraries. Evaluation of reaction rates was based on the cross section data taken from the JENDL Dosimetry File and ENDF B-VI data libraries. Analysis shows that all calculation combinations (transport and activation cross section libraries) used for evaluation of reaction rates give data that is agreeable with measured values within 10%.     

SQL extension for spatio-temporal data

An SQL extension is formalized for the management of spatio-temporal data, i.e. of spatial data that evolves with respect to time. The extension is dedicated to applications such as topography, cartography, and cadastral systems, hence it considers discrete changes both in space and in time. It is based on the rigid formalization of data types and of SQL constructs. Data types are defined in terms of time and spatial quanta. The SQL constructs are defined in terms of a kernel of few relational algebra operations, composed of the well-known operations of the 1NF model and of two more, Unfold and Fold. In conjunction with previous work, it enables the uniform management of 1NF structures that may contain not only spatio-temporal but also either purely temporal or purely spatial or conventional data. The syntax and semantics of the extension is fully consistent with the {SQL:2003} standard.     

Distributed multi-join query processing in data grids

Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.     

An efficient algorithm for mining frequent inter-transaction patterns

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude.     

CXFTV2: A Fortran subroutine for the discrete least squares convex approximation

A Fortan subroutine calculates the least squares approximation to n data values containing random errors subject to non-negative second divided differences (convexity). The method employs a dual active set quadratic programming technique that allows several concavities of an iterate to be corrected simultaneously, which is a distinctive feature of this calculation. A B-spline representation of the iterates reduces each active set calculation to an unconstrained minimization with fewer variables that requires only O(n) computer operations. Details in these techniques including the data structure that establishes the implementation of the method are specified. Numerical testing on a variety of data sets indicates that the subroutine is particularly efficient, terminating after a small number of active set changes, the subroutine being suitable for large numbers of data. A numerical example and its output is provided to help the use of the software.     

基于VME总线的高速A／D缓冲系统的研制

本文介绍一种基于ＶＭＥ总线的高速Ａ／Ｄ缓冲系统的原理和结构。着重阐述了高速数据采集技术，高速ＦＩＦＯ缓冲技术，存储器总线切换技术，ＶＭＥ及ＰＣ／ＩＳＡ总线接口技术在本系统中的成功应用。