Local Exact Particle Tracing on Unstructured Grids

For analyzing and interpreting results of flow simulations, particle tracing is a well established visualization method. In addition, it is a preliminary step for more advanced techniques such as line integral convolution. For interactive exploration of large data sets, a very efficient and reliable particle tracing method is needed. For wind channel experiments or flight simulations, large unstructured computational grids have become common practice. Traditional approachs, based on numerical integration methods of ordinary differential equations however fail to deliver sufficiently accurate path calculation at the speed required for interactive use. In this paper we extend the local exact approach of Nielson and Jung in such a way that it can be used for interactive particle tracing in large data sets of steady flow simulation experiments. This will be achieved by sophisticated preprocessing using additional memory. For further visual enhancement of the streamline we construct an implicitly defined smooth Bézier curve that is used for ray tracing. This allows us to visualize additional scalar values of the simulation as attributes to the trajectory and enables the display of high‐quality smooth curves without creating any visualization geometry and providing a good impression of the spatial situation at the same time. ACM CSS: I.3.3 Computer Graphics—Line and curve generation; I .3.7 Computer Graphics—Raytracing; G.1.2 Numerical Analysis—Spline and piecewise polynomial approximation     

Active set truncated-Newton algorithm for simultaneous optimization of distillation column

An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996     

寻找非构造油气藏的新思路

目前,一种新的理论体系和研究方法已经形成,并正在发展和逐步完善。那就是层序地层学和油气成藏系统理论的诞生和发展;以及由计算机的快速发展带动起来的地震测井资料的采集、处理、显示和各种地质问题的计算机模拟技术,使得地质学和石油地质学都在朝着从定性到定量,从推测到更科学的预测方向发展。在今后的5～10年中,中国的石油地质家们不仅要注意方法和技术方面的进步,还应当重视在陆相层序地层学和陆相层序中油气成藏机制等基本理论方面的研究。     

The formalization and analysis of a communications protocol

The MSMIE protocol [SBC89] allows processors in a distributed system to communicate via shared memory. It was designed to meet the reliability and efficiency needs of applications such as nuclear safety systems. We present a formal model of the MSMIE protocol expressed in the notation CCS. Desirable properties of the protocol are expressed in the modal mu-calculus, an expressive modal logic. We show that the protocol lacks an important liveness property. In actual operation, additional operating constraints are checked to avoid potential problems. We present a modified protocol and show that it possesses the liveness property even without checking operating constraints. We also show how parts of the analysis were automated with the Concurrency Workbench.     

符号运算在求解车辆传动系扭振中的应用

介绍符号运算方法在用拉普拉斯变换方法求解车辆传动系扭振过程中的作用．针对弹性联轴器的匹配计算，给出了具体求解实例．实践表明，与传统的纯数值计算方法相比，符号运算方法可以方便准确地处理车辆传动系统扭振分析中的非线性等复杂问题，具有推广应用价值．     

Mechanization techniques for poplar development in Turkey

Annual commercial poplar wood production in Turkey is about 3.6 million cubic meters, half of which comes from hybrid poplar I-214. The poplar plantation areas of Turkey are 70% of the poplar plantation areas of the Near and Middle Eastern countries, and nearly 5% of the world. In this study, unit times of standard operations were investigated in poplar nurseries and plantations in which new mechanical technology was applied and compared with traditional methods. Analyses of unit times were made on 11 treatments for poplar nurseries and nine treatments for poplar plantations; some new methods are also recommended. Mechanization methods based on new technologies give promising results in poplar nurseries and plantations.     

The rank one mixed μ problem and ‘kharitonov-type’ analysis

The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven.