3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects

We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λ_s(n)log³n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λ_s(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λ_s(n)log²n). The query time in the first problem is O(log⁴n), the query time in the second and third problems is O(log³n + klog²n), and the query time in the fourth problem is O(log³n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K₁, K₂ and K₁ lies vertically above K₂, then K₁ precedes K₂.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.     

直流稳压电源波形演示器制作说明

直流稳压电源可以将交流电压变换为直流电压,并使之稳定,在我们现实生活中应用很广泛,在实验中我们利用的电学知识,设计制造了一种直流稳压电源。本文简要介绍了这种直流稳压电源波形演示器的设计目的和电路原理,重点阐述了它的制作流程、滤波和稳压原理以及性能测试输出波形。     

ZnSe及ZnSe/GaAs异质结构中压力导致的直接禁带向间接禁带的转变

用经验赝势方法计算了体ZnSe以及ZnSe/GaAs单异质结系统中ZnSe外延层г、X、L等特殊对称点导带底能量随压力的变化。结果表明，同Si、Ge、GaAs等半导体材料不同，ZnSe的X点导带底具有正的压力系数，但比г点的压力系数小，这是ZnSe材料以及ZnSe基异质结构材料发生直接禁带向间接禁带的转变时所需转变压力较大的根本原因。研究了ZnSe/GaAs异质结构中晶格失配造成的应变对外延层г、X、L对称点压力系数的影响，表明这种晶格失配造成的应变可以极大地减小ZnSe外延层材料由直接禁带向间接禁带的转变压力。     

Methods for implementing the stream boundary condition in DSMC computations

In the direct simulation Monte‐Carlo (DSMC) method for simulating rarefied gas flows, the velocities of simulator particles that cross a simulation boundary and enter the simulation space are typically generated using the acceptance–rejection procedure that samples the velocities from a truncated theoretical velocity distribution that excludes low and high velocities. This paper analyses an alternative technique, where the velocities of entering particles are obtained by extending the simulation procedures to a region adjacent to the simulation space, and considering the movement of particles generated within that region during the simulation time step. The alternative method may be considered as a form of acceptance–rejection procedure, and permits the generation of all possible velocities, although the population of high velocities is depleted with respect to the theoretical distribution. Nevertheless, this is an improvement over the standard acceptance–rejection method. Previous implementations of the alternative method gave a number flux lower than the theoretical number required. Two methods for obtaining the correct number flux are presented. For upstream boundaries in high‐speed flows, the alternative method is more computationally efficient than the acceptance–rejection method. However, for downstream boundaries, the alternative method is extremely inefficient. The alternative method, with the correct theoretical number flux, should therefore be used in DSMC computations in favour of the acceptance–rejection method for upstream boundaries in high‐speed flows. Copyright © 2003 John Wiley & Sons, Ltd.     

HoYb:YVO4的上转换发光研究

研究了960nm激光激发下HoYb双掺钒酸钇晶体HoYb:YVO4的直接上转换增敏发光,发现了Ho3+离子的上转换发光现象,HoYb:YVO4晶体的上转换发光是5F5→5I8最强,而5S2→5I8相对小了一个数量级,这是由于YVO4晶体既有很强的振子强度又有很大的多声子无辐射弛豫造成的. 关键词： 上转换发光 直接增敏(敏化) 钒酸钇YVO4晶体 Ho3+离子     

功能性丙烯酸/MBAM体系共聚产物的研制

以丙烯酸和MBAM为主要原料，经聚合，合成了一种高性能的具有良好保水性能的聚合产物，其保水量达到750～1000倍．50℃以下有良好的保水性能，28℃以下有极好的保水性能，并研究了工艺条件对该产品性能的影响因素．     

Axisymmetric Collision Problem for Two Identical Elastic Solids of Revolution

A direct central collision of two identical bodies of revolution is studied. A nonstationary mixed boundary-value problem with an unknown moving boundary is formulated. Its solution is represented by a series in term of Bessel functions. An infinite system of Volterra equations of the second kind for the unknown expansion coefficients is derived by satisfying the boundary conditions. The basic characteristics of the collision process are determined depending on the curvature of the frontal surface of the bodies     

稀薄气体二维外部柱体绕流特性研究

本文采用直接模拟蒙特卡罗方法对稀薄气体二维外部柱体绕流问题进行了数值模拟。结果表明:外部绕流问题,在特定情况下会产生激波,激波的产生,不仅与气体的稀薄程度有关,还与来流马赫数有关。而气流与壁面之间的换热,随来流马赫数增加而增加,随气体稀薄程度增加而减小。     

Notes on Sublattice-Lattices

We prove that directly reducible lattices and selfdual subdirectly irreducible lattices of locally finite length are determined by their sublattice-lattices. As a corollary we obtain that splitting varieties are closed under the isomorphism of sublattice-lattices iff they are selfdual. A class of selfdual non-closed varieties is given too.     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007