中美几何教学中信息技术的比较

中美两国均十分关注信息技术对数学教学的影响,但在几何教学中又呈现出不同的特征:美国课堂以学生操作为主,我国则以教师演示为主;美国主要用于学生改变图形、提出猜想等探究性活动,我国则主要用于教师画图、呈现问题情境等方面.比较还发现,两国教师在应用信息技术时存在盲目性.要进一步推进几何教学现代化,则迫切需要认清计算机辅助几何教学所具有的优势.以几何画板为例探讨了信息技术的优势:更有效地作图、几何探究和体会证明的必要性;同时也指出了实践中存在的误区:随意呈现几何图形、利用度量功能机械地“发现”几何关系及盲目地进行计算机模拟.     

Au吸附在GaAs（110表面的研究

研究了Au吸附在GaAs(110)表面的吸附构型,并计算了表面态密度和表面能带结构.计算结果表明,可以认定Au与Ga的悬挂键杂化成键,从而引起2条附加的能带,一条位于禁带之中,距价带顶为0.9ev;另一条与价带共振,离价带顶为0.7ev,所得结果与实验结果相一致.     

On the performance of peeling algorithms

The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n^˙ Log (n)) execution time, may give an O(n^˙n^˙ Log (n)) to peel all the set; an O(n^˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^˙n) performance.     

TERNARY OPERATIONS AS PRIMITIVE NOTIONS FOR PLANE GEOMETRY II

We proved in the first part [1] that plane geometry over Pythagorean fields is axiomatizable by quantifier-free axioms in a language with three individual constants, one binary and three ternary operation symbols. In this paper we prove that two of these operation symbols are superfluous.     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

TKSS—C型信号与系统实验箱的低通滤波器分析

对TKSS-C型信号与系统实验箱的低通滤波器实验模块进行了s平面几何分析，并利用MATLAB7．01中的Power Systems Blockset对其进行了仿真．     

Heat Kernel Asymptotics of Zaremba Boundary Value Problem

The Zaremba boundary-value problem is a boundary value problem for Laplace-type second-order partial differential operators acting on smooth sections of a vector bundle over a smooth compact Riemannian manifold with smooth boundary but with discontinuous boundary conditions, which include Dirichlet boundary conditions on one part of the boundary and Neumann boundary conditions on another part of the boundary. We study the heat kernel asymptotics of Zaremba boundary value problem. The construction of the asymptotic solution of the heat equation is described in detail and the heat kernel is computed explicitly in the leading approximation. Some of the first nontrivial coefficients of the heat kernel asymptotic expansion are computed explicitly. This revised version was published online in July 2006 with corrections to the Cover Date.     

Tail probabilities of the limiting null distributions of the Anderson–Stephens statistics

For the purpose of testing the spherical uniformity based on i.i.d. directional data (unit vectors) z_i, i=1,…,n, Anderson and Stephens (Biometrika 59 (1972) 613–621) proposed testing procedures based on the statistics S_max=max_u S(u) and S_min=min_u S(u), where u is a unit vector and nS(u) is the sum of squares of u′z_i's. In this paper, we also consider another test statistic S_range=S_max−S_min. We provide formulas for the P-values of S_max, S_min, S_range by approximating tail probabilities of the limiting null distributions by means of the tube method, an integral-geometric approach for evaluating tail probability of the maximum of a Gaussian random field. Monte Carlo simulations for examining the accuracy of the approximation and for the power comparison of the statistics are given.     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing     

The Ends of Manifolds with Bounded Geometry, Linear Growth and Finite Filling Area

We prove that simply connected open manifolds of bounded geometry, linear growth and sublinear filling growth (e.g. finite filling area) are simply connected at infinity.