环形线电荷的电场分布

给出了圆环形线电荷电场分布的理论公式，并利用计算机计算出其具体分布规律。     

双折射双频激光器偏振特性的分析

用激光原理和晶体光学原理分析了腔内加旋光晶体的激光器输出光的偏振特性，实验和分析表明，激光器输出两束不同频率的垂直线偏振光，激光器两端输出光的偏振面有一夹角ａ，且此夹角与晶轴和传光方向的夹角θ有关。理论计算结果在双折射双频激光器的实验结果符合很好。     

Some existence results on periodic and generalized periodic solutions for singular hamiltonian systems

In this paper, we use the variational method to study the existence of periodic and generalized periodic solutions of planar second order Hamiltonian systems when a singular potential is present. The results obtained are applied to the study of generalized periodic solutions of the Restricted Three-Body Problem and the Planarn-Body Problem.     

LF λ-subgroup Generated by LF Subset

In this paper .an important property layer-preserving of LF group and an concept LF λ-subgroup generated by LF subset will be introduced. On the height of LF group theory ,we recognize the concept generated subgroup more clearly.     

Asymmetric synthesis XXVII: Asymmetric catalytic trimethylsilylcyanation of aldehydes by novel Ti-chiral Schiff base complexes

Enantioselective catalytic trimethylsilylcyanations of aldehydes with 48% to 92% e.e. have been studied using the novel Ti-chiral Schiff base complexes. We have found that the catalyst led to high enantoselectivity when the molar ratio of the Schiff base 1 to Ti(O-i-Pr)₄ was 2:1.     

Implicitly representing arrangements of lines or segments

Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n ²) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space¹ and (n ^3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n ^1/3)+O(K) time, given(n ^4/3) space and (n ^5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m ^2/3 n ^2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.     

Strong approximation of Riesz means at critical index on Hp(T) (0<p≤1)

This paper is a continuation of [3]. Suppose f∈H^p(T), 0σ _r ^σ f,σ=1/p?1. When p=1, it is just the partial Fourier sums S_kf. In this paper we establish the sharp estimations on the degree of approximation: $$\left\{ { - \frac{1}{{logR}}\int\limits_1^R {\left\| {\sigma _r^\delta f - f} \right\|_{H^p (T)}^p \frac{{dr}}{r}} } \right\}^{1/p} \leqq C{\mathbf{ }}{}_p\omega \left( {f,{\mathbf{ }}( - \frac{1}{{logR}})^{1/p} } \right)_{H^p (T)} ,0< p< 1,$$ and \(\frac{1}{{\log L}}\sum\limits_{k - 1}^L {\frac{{\left\| {S_k f - f} \right\|_H 1_{(T)} }}{k} \leqq Cp\omega (f; - \frac{1}{{\log L}})_H 1_{(T)} } \) Where $$\omega (f,{\mathbf{ }}h)_{H^p (T)} \begin{array}{*{20}c} { = Sup} \\ {0 \leqq \left| u \right| \leqq h} \\ \end{array} \left\| {f( \cdot + u) - f( \cdot )} \right\|_{H^p (T).} $$ .     

在H－ZSM－5沸石上甲醇转化为汽油的初始产物分布

在Ｈ－ＺＳＭ－５沸石上甲醇转化为汽油的初始产物分布姜玄珍（浙江大学化学系，杭州３１００２７）Ｒ．Ｆ．Ｈｏｗｅ（新南威尔士大学物理化学系，澳大利亚）关键词Ｈ－ＺＳＭ－５沸石，甲醇转化汽油，产物分布以氢型ＺＳＭ－５沸石作催化剂转化甲醇为汽油（ＭＴＧ），在...     

Fabrication of tunable colloid crystals from amine-terminated polyamidoamine dendrimers

A pH-responsive colloidal crystal was assembled using core-shell composite spheres, poly(styrene-methyl methacrylate-acrylic acid) (P(St-MMA-AA)) spheres covered by generation 4 amine-terminated polyamidoamine dendrimers. The light reflection of the colloidal crystal film can be tuned at different pH due to different protonation level of the dendrimers. The method shows a facile way to fabricate diffraction-based chemical and biological sensors by exploiting the effect of photonic crystal cooperated with tunable nanoparticles.