Rendering of Surface and Volume Details in Volume Data*

Aiming at the detail rendering in volume data, a new volume illumination model, called Composed Scattering Model (CSM), is presented. In order to enhance different details in volume data, scattering intensity is decomposed into volume scattering intensity and surface scattering intensity with different weight functions. According to the Gauss probability distribution of gray and gradient of data, we propose an accurate method to detect the materials in a voxel, called composed segmentation. In addition, we discuss the principle of constructing these weight functions based on the operators defined in composed segmentation. CSM can generate images containing more details than most popular volume rendering models. This model has been applied to the direct volume rendering of 3D data sets obtained by CT and MRI. The resultant images show not only rich details but also clear boundary surfaces. CSM is demonstrated as an accurate volume rendering model suited for detail enhancement in volume data sets.     

集群系统与公用网互连的仿真模型和模拟算法

在讨论ＭＰＴ１３２７信令的集群移动通信系统与国内Ｎｏ．７信令的ＰＳＴＮ网间互连，帝现两种信令配合中，研究了集群系统的仿真模型和模拟算法，同时模拟出整个集群系统的工作情况，运行结果证实了所提方案的可行性与准确性。     

二钼酸铵(ADM)非团聚晶体的生成试验

探讨了二钼酸铵非团聚晶体生成的机理及制取新工艺。采取该工艺制取的ADM费氏粒度（Fsss)约30μm，激光粒度分布d0.5为370μm，松装比达1.37/cm^3。     

Calendar maintenance of arbitrarily structured systems

A semi-Markov model is constructed that describes an arbitrarily structured multicomponent technological system and takes into account its calendar maintenance. Using an aggregation algorithm, approximate values of stationary reliability characteristics and an optimal term of maintenance work are determined for the system. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 69–86, March–April 2006.     

Stereo and motion correspondences using nonlinear optimization method

This paper presents a new approach for using stereo and motion correspondences to solve the problem of tracking multiple independently moving features. In this approach, quantitative relational structure (QRS) is proposed as a framework for the integration of stereo–motion correspondences. The similarity function, tightly coupled to stereo and motion cues, is constructed on QRS, and then energy function E² consisting of the similarity function is defined. The tracking problem can be converted into the maximization problem of the energy function E². The stereo and motion correspondences that maximize E² are recovered by applying an extended graduated assignment algorithm. The relaxation labeling method is also presented for the comparison with the proposed method. Experimental results are presented to illustrate the performance of the proposed method.     

Inversion of confluent Vandermonde matrices

This paper is concerned with the inversion of confluent Vandermonde matrices. A novel and simple recursive algorithm for inverting confluent Vandermonde matrices is presented. The algorithm is suitable for classroom use in both numerical as well as symbolic computation. Examples are included to illustrate the proposed algorithm.     

Generation of adaptive gait patterns for quadruped robot with CPG network including motor dynamic model

This paper describes the generation of adaptive gait patterns using new Central Pattern Generators (CPGs) including motor dynamic models for a quadruped robot under various environments. The CPGs act as the flexible oscillators of the joints and adjust joint angles to required values. The CPGs are interconnected with each other and sets of their coupling parameters are adjusted by a genetic algorithm so that the quadruped robot can realize stable and adequate gait patterns. Generation of gait patterns results in the formation of the CPG networks suitable for the formation of not only a straight walking pattern but also of rotating gait patterns. Experimental results demonstrate that the proposed CPG networks are effective for the automatic adjustment of the adaptive gait patterns for the tested quadruped robot under various environments. Furthermore, the target tracking control based on image processing is achieved by combining the general gait patterns. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 155(1): 35–43, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20225     

THE RELATIONSHIP BETWEEN HAZE AND THE SIZE OF PARTICLES IN BEER

Haze measurements have been obtained for suspensions of polystyrenelatex particles of known diameter using two light scattering instruments which measure at angles of 90° and 13° respectively. The results agree well with the theory of light scattering and demonstrate the significant effects of particle size and angle of detection upon the instrumental values for haze. This information has been used to correlate the particle size distributions of a number of beers, as measured by Coulter Counter, with the corresponding, measured haze values.     

水平管气力输送数值模拟

本文采用粒子追踪理论对水平管中粒子流动状态进行了数值模拟.文中提出了一种新的粒子碰撞模型,并忽略粒子的旋转和扬力,仅考虑气流阻力和重力对粒子的影响,在输送量为9.13×10~3kg/s,混合比约0.3的条件下,通过数值计算得知:由于粒子间的碰撞,使得异径粒子的速度趋向平均化;粒子间的碰撞是粒子悬浮的原因之一;粒子的浓度沿管轴向是随时间而发生变化的.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.