Exit effect on hydrodynamics of the internal circulating fluidized bed riser

This is the first time an extensive investigation has been carried out regarding the effects of riser exit geometry on pressure drop and solid behaviour inside the Internal Circulating Fluidized Bed (ICFB) riser, using different riser exit geometries at several operating conditions.The Radioactive Particle-Tracking (RPT) technique was used for solid concentration measurements and solid residence time distribution at the exit zone. Experiments were conducted using Geldart B particles, in the gas superficial velocity range of 4 to 10 m/s. Axial solid hold-up, solid residence time distribution in the exit zone, and the reflux ratio factor k_m, (defined earlier by [E.H. Van der Meer, R.B. Thorpe, J.F. Davidson, Flow patterns in the square cross-section riser of a circulating fluidized bed and the effect of riser exit design, Chem. Eng. Sc. 55 (19) (2000) 4079-4099]), were the main criteria used to investigate the impact of gas-solid separator devices implemented at the ICFB riser exit.Solid residence time distribution results and axial solid hold-up profiles provided clear evidence that the separator device at the riser exit strongly influences the hydrodynamic structure of the ICFB riser. The V-shaped riser exit geometry was found to be the optimum of all the configurations studied.     

Ready, Set, Go! The Voronoi diagram of moving points that start from a line

It is an outstanding open problem of computational geometry to prove a near-quadratic upper bound on the number of combinatorial changes in the Voronoi diagram of points moving at a common constant speed along linear trajectories in the plane. In this note we observe that this quantity is Θ(n²) if the points start their movement from a common line.     

《周培德三角剖分不是最小权三角剖分》一文商榷——反例不成立

周培协三角剖分是否能得到最小权三角剖分，周培德在《周培德三角部分不是最小权三角剖分》一文撰写之前已有新的结论，本文还指出《周培德三角剖分不是最小权三角剖分》一文所举反例不成立。     

A generalized approach to the reconstruction of a restricted class of digitized planar curves

Reconstruction of an original continuous curve and the estimation of its parameters from the digitized version of the curve is a challenging problem, as quantization always causes some loss of information. In this paper, we have developed a scheme for reconstruction which is applicable to a class of curves having at the most two parameters. The class of curves for which the scheme works has also been characterized. We have shown that for one-parameter curves the exact domain of values of the parameter can be obtained. But in the two-parameter case, only the smallest rectangle containing the domain can be realised. The distinctive feature of our scheme is that it provides a unified approach to solve the reconstruction and the domain-finding problem for a class of curves.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

A Dynamic Dictionary for Priced Information with Application

In this paper we design a dynamic dictionary for the priced information model initiated by Charikar et al. Assume that a set S consisting of n elements is given such that each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function of their prices. The cost of an algorithm is the sum of the costs of all operations it performs. The objective is to design algorithms which incur low cost. In this model we propose a dynamic dictionary, supporting search, insert and delete, for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments, a fundamental problem in computational geometry.     

Tree-shaped flow structures designed by minimizing path lengths

This paper outlines a direct route to the construction of effective tree-shaped flow structures. Dendritic flow structures dominate the design of natural and engineered flow systems, especially in thermal and fluid systems. The starting point is the optimization of the shape of each elemental area or volume, such that the length of the flow path housed by the element is minimized. Proceeding toward larger and more complex structures - from elements, to first constructs, second constructs, etc. - the paper develops tree-shaped flow structures between one point and a straight line, one point and a plane, a circle and its center, and a point and many points distributed uniformly over an area. In the latter, the construction method is applied to a fluid flow configuration with laminar fully developed flow. The constructions reveal several features that are supported by empirical observations of natural tree-shaped flows: asymmetry, flow rate imbalance, pairing or bifurcation, angles between branches, and Y-shaped constructs that lie in a plane. It is shown that these basic features are necessary because of “packing”, i.e., assembling optimized elements into a fixed space, and filling the space completely. For the flow between an area and one point, the best elemental shape is the regular hexagon. It is shown that the emergence of string-shaped links that connect two or more elements are necessary features, which are also required by packing. Strings cover some of the inner zones of the tree network, particularly the inner zones of large and complex trees. Dichotomous Y-shaped constructs dominate the tree structure, especially the peripheral zones of the tree canopy. The practical importance of the simplified design method is discussed.     

二维地震过障碍观测系统模式及其参数设计

在二维地震勘探中,为了避免因地表障碍物使地震反射剖面出现间断现象,需要改变观测系统设计,跨越障碍物(江河、城镇等),以保证反射同相轴能连续追踪对比。在以往地震勘探中,有时因过障碍观测系统设计不合理,不但增加勘探费用,而且影响采集质量。因此只有科学合理地设计过障碍观测系统模式和参数,才能保证地震测线顺利通过障碍物,得到较好的障碍物下方的地震资料并降低勘探成本。为此本文在调查和研究大量野外实际的过障碍观测系统的基础上,总结归纳成三大类过障碍观测系统模式,并分析其特点和应用范围。采用图解法,推导出主要模式的跨越宽度、最小炮检距及最大炮检距等参数公式。采用这套过障碍观测模式不仅可以得到和障碍区两侧等质量的地震资料,而且可以有效地降低勘探成本。     

Applications of the 4×4 determinant method and the POLYGON ENGINE

In the first half of the paper, various types of processing pertaining to a polygon, using the 4×4 determinant theories are explained along with a new containment test algorithm of a point in a polygon. In the latter half of the paper, a general-purpose geometric processor, the POLYGON ENGINE, is presented which can deal with various types of interference problems, such as Boolean operations in solid modelling, hidden line and surface eliminations, ray tracing and so on. It is, a successor of the TRIANGLE PROCESSOR and is also based upon the 4×4 determinant theories [4–6]. While the TRIANGLE PROCESSOR processes a triangulated polygon on a triangle-by-triangle basis, the POLYGON ENGINE can treat a polygon without triangulation. The latter is expected to be more functional, more efficient and easier to use.     

用MAXScript脚本语言生成分形图形

介绍了分形生成技术的原理与性质、MAXScript脚本语言的特点及功能，详细叙述了用MAXScript脚本语言生成分形图形的设计思想和实现方法。针对分形几何的特点，以具有严格自相似性的分形树为例，通过解释源代码、描述程序运行过程和结果，以及对生成的图片用3DSMAX进行再处理，分析了在3DSMAX环境中用MAXScript脚本语言生成分形图形这一新方法的优点和不足。