Presents the B∗∗-tree, a data organization method which achieves a storage utilization which is higher than that of the B∗-tree. The proposed structure performs especially well in just those cases where the B∗-tree pe...
详细信息
Multiprocessors and multicomput.rs differ in important ways in terms of hardware and software. One kind of machine is hard to build but easy to program, and the other is easy to build but hard to program. We believe t...
Building the hardware for a high-performance distributed comput.r system is a lot easier than building its software. The authors describe a model for programming distributed systems based on abstract data types that c...
详细信息
In this paper, we analyze the performance of GI/GI/s/s+r systems. In particular we examine steady-state call blocking and time blocking. We vary several parameters such as the number of servers, the number of waiting ...
Many object oriented methods have assumed class based approaches, without considering prototype based ones. Some authors, while admitting prototypes as a useful concept, only envision their application in early phases...
详细信息
作者：
SHEN, XJComput. Sci. Telecommun. Program
Missouri Univ. Kansas City MO USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions
A K-EMCTN is obtained by adding k more stages in front of a multistage cube-type network (MCTN), It is shown that a permutation is admissible to a k-EMCTN if and only if the conflict graph is 2(k)-colorable, For the c...
详细信息
A K-EMCTN is obtained by adding k more stages in front of a multistage cube-type network (MCTN), It is shown that a permutation is admissible to a k-EMCTN if and only if the conflict graph is 2(k)-colorable, For the case k = 1, an O(NlgN) algorithm is given for constructing the conflict graph, which leads to an O(NlgN) admissibility algorithm. Furthermore, it is shown that Omega(NlgN) bits must be checked in the binary representation of a permutation for determining its admissibility.
Visualization of topological information of a vector field can provide useful information on the structure of the field. However, in turbulent flows standard critical point visualization will result in a cluttered ima...
详细信息
ISBN:
(纸本)078035897X
Visualization of topological information of a vector field can provide useful information on the structure of the field. However, in turbulent flows standard critical point visualization will result in a cluttered image which is difficult to interpret. This paper presents a technique for collapsing topologies. The governing idea is to classify the importance of the critical points in the topology. By only displaying the more important critical points, a simplified depiction of the topology can be provided. Flow consistency is maintained when collapsing the topology, resulting in a visualization which is consistent with the original topology. We apply the collapsing topology technique to a turbulent flow field.
The problem of construction of a code sequence with good auto- and cross-correlation properties for multiple access communications has received a lot of attention. M-sequences and sequences derived from them solve the...
详细信息
Attempts to discuss the existence of the Virasoro symmetry, previously found by Hou and Li (1987), without two auxiliary constants introduced in the Hauser-Ernst linearisation equations (1980) for the O(3) nonlinear s...
Attempts to discuss the existence of the Virasoro symmetry, previously found by Hou and Li (1987), without two auxiliary constants introduced in the Hauser-Ernst linearisation equations (1980) for the O(3) nonlinear sigma -model.
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in image processing but is closer to its...
详细信息
ISBN:
(纸本)9783642104688
We describe an algorithm for segmenting three-dimensional medical imaging data modeled as a continuous function on a 3-manifold. It is related to watershed algorithms developed in image processing but is closer to its math.matical roots, which are Morse theory and homological algebra. It allows for the implicit treatment of an underlying mesh, thus combining the structural integrity of its math.matical foundations with the comput.tional efficiency of image processing.
暂无评论