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缓冲系统的研制

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

Speed-up fractal image compression with a fuzzy classifier

This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system.     

一种彩色C型显示及数据处理终端

本文介绍了一种利用数字信号处理器ＴＭＳ３２０Ｃ２５用作雷达数据实时处理，利用图形处理器ＴＭＳ３４０１０用作雷达视频图象处理，完成雷达视频图象彩色显示的雷达终端。     

An object design framework for structural engineering

Object-oriented principles have introduced several useful concepts for developing complex software systems. As a result, several methodologies have been suggested for the overall design of software systems based on these concepts. Methodologies and frameworks for designing objects that are to be part of the software systems are currently lacking. This paper proposes anobject design framework andmethodology, which utilizes the object-oriented concepts, for planning, organizing and designing structural engineering design objects. Design objects in an integrated structural engineering system are complex and often related to each other in various different ways. The paper also identifies several important relationships among structural engineering design objects. These relationships serve as communication channels through wich design objects send messages to and receive responses from each other. Several examples, drawn from reinforced concrete structures, will be presented to demonstrate the object design methodology and to illustrate how the framework is effective in reducing the complexity of design objects in an integrated structural engineering system.     

基于神经-模糊推理系统的机械设计数据处理

针对机械设计领域中所存在的大计算量、多图表问题,应用一种神经-模糊推理系统进行映射辩识,以提高计算速度和编程处理能力,消除知识的"组合爆炸"现象。通过对具体数据、图表的实际应用表明,应用这种方法能够很好地表达原图表数据关系。同时,相对于单纯应用人工神经网络方法,它的数据识别精度更高,速度更快,能够满足设计计算要求。