用不变速度推导卢瑟福散射公式

通过横向速度变换得到两种不变速度，由此推出卢瑟福散射公式。     

On inclusion theorems for absolute matrix summability methods, corrections: [J. Math. Anal. Appl. 238 (1999) 82-90]

We modify some of the conditions of the theorem to make it more applicable.     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

Another Extension of the Mitrinovic—Djokovic Inequality

Another generalization of the Mitrinovic-Djokovic inequality is proved by elementarymeans.     

The Equivalence of Several Basic Theorems for Subdifferentials

Several different basic tools are used for studying subdifferentials. They are a nonlocal fuzzy sum rule in (Borwein et al., 1996; Zhu, 1996), a multidirectional mean value theorem in (Clarke and Ledyaev, 1994; Clarke et al., 1998), local fuzzy sum rules in (Ioffe, 1984, 1990) and an extremal principle in (Kruger and Mordukhovich, 1980; Mordukhovich, 1976, 1980, 1994). We show that all these basic results are equivalent and discuss some interesting consequences of this equivalence.     

Minimum Disparity Estimation in Linear Regression Models: Distribution and Efficiency

This paper deals with the minimum disparity estimation in linear regression models. The estimators are defined as statistical quantities which minimize the blended weight Hellinger distance between a weighted kernel density estimator of errors and a smoothed model density of errors. It is shown that the estimators of the regression parameters are asymptotic normally distributed and efficient at the model if the weights of the density estimators are appropriately chosen.     

A general converse theorem for mean‐value theorems in linear elasticity

We prove a rather general mean‐value formula in the theory of elasticity, which expresses the value of the displacement at the centre of a sphere in terms of certain combinations of integral averages over the sphere itself of the traction and the displacement. We also establish the corresponding converse to this mean‐value formula under minimal smoothness assumptions on the displacement. Copyright © 2006 John Wiley & Sons, Ltd.     

L1-optimal estimates for a regression type function in R

Let X₁, X₂, …, X_n be random vectors that take values in a compact set in R^d, d ≥ 1. Let Y₁, Y₂, …, Y_n be random variables (“the responses”) which conditionally on X₁ = x₁, …, X_n = x_n are independent with densities f(y | x_i, θ(x_i)), i = 1, …, n. Assuming that θ lives in a sup-norm compact space Θ_q,d of real valued functions, an optimal L₁-consistent estimator of θ is constructed via empirical measures. The rate of convergence of the estimator to the true parameter θ depends on Kolmogorov's entropy of Θ_q,d.     

De Sitter空间中具有常均曲率的类空超曲面（Ⅱ）

设Ｍ＾ｎ是Ｄｅ Ｓｉｔｔｅｒ空间Ｓ１＾ｎ＋１中具有常数平均曲率且第二基本形式长度的平方为常数的完备类空超曲面，若Ｓ≤２（ｎ－１）＾１／２，则Ｍ＾ｎ是等参超曲面。     

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.