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.     

双层桥梁耦合系统的强迫振动

本文研究作为双层桥模型的梁方程耦合系统，利用Ｌｅｒａｙ－Ｓｃｈａｕｄｅｒ不动点定理，得到了一个关于这种系统的解的存在性定理，它类似于ＭｃＫｅｎｎａ和Ｗａｌｔｅｒ文２中关于吊桥方程的一个定理。     

Identity principles for commuting holomorphic self-maps of the unit disc

Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g.     

Mass transport in metals under intensive impulse reactions

An unusually high mobility of atoms under intensive impulse reactions is explained by the behavior of point defects at the shock wave front. It is shown that either a shock wave front or moving dislocations can capture the interstitials, or they can be thermally activated in the direction of the shock wave propagation.     

Banach空间中渐近正则半群的不动点定理

设X是p一致凸Banach空间,具有弱一致正规结构与非严格的Opial性质.又设C是X的非空凸弱紧子集.在适当的条件下,证明了C上每个渐近正则半群T={T(t):t∈S}都有不动点进一步,在类似的条件下,也讨论了一致凸Banach空间中渐近正则半群的不动点的存在性.     

一致Banach空间中非扩张映象的弱收敛定理

设犈是一致凸Ｂａｎａｃｈ空间，满足Ｏｐｉａｌ条件或具有Ｆｒｅｃｈｅｔ可微范数，犆是犈的非空闭凸子集，且犜：犆→犆是非扩张映象．又设对任何初始数据狓１ ∈犆，序列｛狓狀｝由下列修改了的Ｉｓｈｉｋａｗａ迭代程序生成：狓狀＋１ ＝狋狀犜狀（狊狀犜狀狓狀＋ （１－狊狀）狓狀）＋ （１－狋狀）狓狀，　狀≥１， （Ｉ）其中，数列｛狋狀｝与｛狊狀｝满足下列条件（ｉ）和（ｉｉ）之一：（ｉ）狋狀∈ ［犪，犫］且狊狀∈ ［０，犫］；（ｉｉ）狋狀∈ ［犪，１］且狊狀∈ ［犪，犫］，这里，常数犪，犫满足０＜犪≤犫＜１．作者证明了，犜有不动点的充要条件是，｛狓狀｝ 弱收敛且｛‖狓狀－犜狓狀‖｝收敛到０．而且，由此即知，若犜有不动点，则｛狓狀｝弱收敛到犜的一个不动点．     

Electronic transport properties of bismuth nanobridges through silicon-nitride membranes

The electronic transport through nanostructured bismuth nanobridges has been investigated at low temperatures (T<2 K) and in magnetic fields B up to 8.5 T. The samples show reproducible resistance fluctuations as a function of B, superimposed on a large magnetoresistance of up to 50%. In addition, time-dependent resistance fluctuations in zero magnetic field demonstrate the presence of bistable scatterers in the constriction region of our samples, which are described by two-level systems. Their dynamics are shown to be sensitive to subtle modifications of the static scatterer configuration in their vicinity, which cannot be detected in the sample magnetofingerprint.     

滤波器对偏振模色散的补偿

根据耦合非线性薛定谔方程 ,本文研究了偏振模色散如何影响各种码型的频谱 ,分析了滑频滤波器和固定滤波器对偏振模色散的补偿作用。研究结果表明 :偏振模色散对不同码型的频谱影响是不一样的 ,对色散管理孤子的频谱影响最大 ,产生新的频率分量也最多 ,而且每个新频率分量都较强 ,比入射频谱展宽许多 ;滑频滤波器和固定滤波器对偏振模色散都具有补偿作用 ,使最大可传输距离成倍增加 ,两种滤波器对偏振模色散的补偿作用相差较小 ;但是对色散管理孤子系统中的偏振模色散补偿效果最佳。     

Fixed point theorems in metric spaces

In this paper, we establish two general theorems for equivalence between the Meir–Keeler type contractive conditions and the contractive definitions involving gauge functions. One of these theorems is an extension of a recent result of Lim (On characterization of Meir–Keeler contractive maps, Nonlinear Anal. 46 (2001) 113–120).