良序套张量积的代数中的强不可约算子

设Ｈ为复的可分无限维Ｈｉｌｂｅｒｔ空间，称有界线性算子Ｔ为强不可约的，如果与Ｔ可交换的幂等算子只有０和Ｉ．王宗尧、蒋春澜、纪有清等人证明了在任何一个套的套代数中都存在大量的强不可约算子，并且找到了它们的酉轨道闭包．本文考虑有限个套的张量积的代数中强不可约算子的存在性问题。证明了：对复平面上任何一个连通完备集σ、总存在一个对角算子Ｎ和它的一个范数可以任意小的紧摄动Ｔ＝Ｘ＋Ｋ，使得Ｔ是一个强不可约算子、Ｔ在有限个良序套的张量积的代数中，并且σ（Ｔ）＝σｌｒｅ（Ｔ）＝σ（Ｎ）＝σｌｒｅ（Ｎ）＝σ进一步，文章还对具有单点谱的算子和良序套与正交补为良序套的张量积的代数进行了讨论，得到了一些结果．     

Hyers–Ulam stability of linear differential operator with constant coefficients

Let P(z) be a polynomial of degree n with complex coefficients and consider the n–th order linear differential operator P(D). We show that the equation P(D)f = 0 has the Hyers–Ulam stability, if and only if the equation P(z) = 0 has no pure imaginary solution. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Randomly censored partially linear single-index models

This paper proposes a method for estimation of a class of partially linear single-index models with randomly censored samples. The method provides a flexible way for modelling the association between a response and a set of predictor variables when the response variable is randomly censored. It presents a technique for “dimension reduction” in semiparametric censored regression models and generalizes the existing accelerated failure-time models for survival analysis. The estimation procedure involves three stages: first, transform the censored data into synthetic data or pseudo-responses unbiasedly; second, obtain quasi-likelihood estimates of the regression coefficients in both linear and single-index components by an iteratively algorithm; finally, estimate the unknown nonparametric regression function using techniques for univariate censored nonparametric regression. The estimators for the regression coefficients are shown to be jointly root-n consistent and asymptotically normal. In addition, the estimator for the unknown regression function is a local linear kernel regression estimator and can be estimated with the same efficiency as all the parameters are known. Monte Carlo simulations are conducted to illustrate the proposed methodology.     

On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

Probabilistic Analysis of Condition Numbers for Linear Programming

In this paper, we provide bounds for the expected value of the log of the condition number C(A) of a linear feasibility problem given by a n × m matrix A (Ref. 1). We show that this expected value is O(min{n, m log n}) if n > m and is O(log n) otherwise. A similar bound applies for the log of the condition number C _R(A) introduced by Renegar (Ref. 2).     

高精度CCD尺寸自动检测系统的光学系统设计

介绍测量精度为±０．００３ｍｍ的ＣＣＤ尺寸检测系统的光学系统设计特点及远心物镜设计原理，并给出了测试结果。     

The many facets of linear programming

We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods. Received: June 22, 2000 / Accepted: April 4, 2001?Published online October 2, 2001     

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite variance, and a regularly varying tail, i.e., P(τ >К) ~ К^-Lα L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination. We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

电子直线加速器磁控管频率稳定的自适应线性神经元方法

 电子直线加速器电子束能量的稳定与否取决于功率源工作频率的稳定性,磁控管在短时间内的散谱和轻微跳谱造成稳频系统的控制精度下降,最后电子束的扫描均匀度下降。引入自适应线性神经元方法(ADALINE)和噪声对消技术以消除对工作频率长期稳定性的影响,从而保证了电子束的扫描均匀度。     

Constrained control for uncertain linear systems

The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments.