基于DEM的山地可照时间的空间分布

以山区高空间分辨率的DEM数据为主要数据源，在提取纬度、坡度、坡向等相应的地形要素栅格数据的基础上，利用GIS技术对山区可照时间的空间分布进行了模拟，实现了山区可照时间空间分布规律的可视化表达，分析了山区可照时间的空间分布特征，对于山区的农业、林业和生态环境等方面的研究具有重要意义．     

Fourier Analysis of Semistable Distributions

We consider the generalized convolution powers G _α ^*u (x) of an arbitrary semistable distribution function G _α (x) of exponent α∈(0,2), and prove that for all j, k∈{0,1,2,…} and u>0 the derivatives G _α ^(k,j)(x;u)=∂ ^k+j G _α ^*u (x)/∂ x ^k ∂ u ^j , x∈ℝ, are of bounded variation on the whole real line ℝ. The proof, along with an integral recursion in j, is new even in the special case of stable laws, and the result provides a framework for possible asymptotic expansions in merge theorems from the domain of geometric partial attraction of semistable laws. An erratum to this article can be found at     

短波通滤光片膜系设计

详细介绍用等效折射率概念设计短波通滤光片的原理和计算方法。根据原理和方法，选择二氧化钛（TiO2）作为高折射率材料、二氧化硅（SiO2）作为低折射率材料。首先从理论上计算出用这2种材料设计的波长λ=950～1150nm的短波通滤光片所需要的周期数，然后给出短波通滤光片的主膜系和光谱曲线。由于据此周期数设计出的膜系光谱曲线在750～810nm处的透过率不符合要求，因此对该膜系进行了改进。依照改进的设计进行多次制备，最终制备出了符合要求的短波通滤光片，找到了最佳制备工艺和方法。最后，对制备出来的短波通滤光片薄膜进行了各种环境实验。实验结果表明，膜层的各项指标符合设计要求。     

New light on Hensel''s lemma

The historical development of Hensel's lemma is briefly discussed (Section 1). Using Newton polygons, a simple proof of a general Hensel's lemma for separable polynomials over Henselian fields is given (Section 3). For polynomials over algebraically closed, valued fields, best possible results on continuity of roots (Section 4) and continuity of factors (Section 6) are demonstrated. Using this and a general Krasner's lemma (Section 7), we give a short proof of a general Hensel's lemma and show that it is, in a certain sense, best possible (Section 8). All valuations here are non-Archimedean and of arbitrary rank. The article is practically self-contained.     

Banach空间中凸映照的增长定理

本文利用凸映照的几何特征证明了一般复Banach空间中单位球上正规化双全纯凸映照的增长定理，即||f(x)||≤||x||/(1-||x||),A↓x∈B，对复内积空间，上述估计是最佳的。     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

A unifying local-semilocal convergence analysis and applications for two-point Newton-like methods in Banach space

We provide a local as well as a semilocal convergence analysis for two-point Newton-like methods in a Banach space setting under very general Lipschitz type conditions. Our equation contains a Fréchet differentiable operator F and another operator G whose differentiability is not assumed. Using more precise majorizing sequences than before we provide sufficient convergence conditions for Newton-like methods to a locally unique solution of equation F(x)+G(x)=0. In the semilocal case we show under weaker conditions that our error estimates on the distances involved are finer and the information on the location of the solution at least as precise as in earlier results. In the local case a larger radius of convergence is obtained. Several numerical examples are provided to show that our results compare favorably with earlier ones. As a special case we show that the famous Newton-Kantorovich hypothesis is weakened under the same hypotheses as the ones contained in the Newton-Kantorovich theorem.     

ContributionsSign-balanced covering matrices

A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]^t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C₁, C₂,…, C_t of t columns and for each choice = (₁,…,_t) Δ of signs, the linear combination ∑_j=1^t _jC_j contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (₁, …, _t) of signs in δ, the linear combination ∑_j=1^t _jC_j contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described.     

期刊发稿动力学系统

发稿库库存量是影响稿件发表时间的关键因素之一,文章分析了影响发稿库库存量的两个指标:一是二审库稿件进入发稿库的入库率,二是发稿库中排队时间为x的稿件的刊登率.最后给出了研究问题的数学描述.     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.