An admissible minimax estimator of a bounded scale-parameter in a subclass of the exponential family under scale-invariant squared-error loss

A subclass of the scale-parameter exponential family is considered and for the rth power of the scale parameter, which is lower bounded, an admissible minimax estimator under scale-invariant squared-error loss is presented. Also, an admissible minimax estimator of a lower-bounded parameter in the family of transformed chi-square distributions is given. These estimators are the pointwise limits of a sequence of Bayes estimators. Some examples are given.     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

The Nonexistence of Procedures with Bounded Performance Characteristics in Certain Parametric Inference Problems

This paper gives a condition which implies the nonexistence of parametric statistical procedures with bounded risk or error performance characteristics. Many examples for which such a condition is satisfied are considered.     

On the Stability of Bifurcation Diagrams of Vanishing Flattening Points

On a smooth surface in Euclidean 3-space, we consider vanishing curves whose projections on a given plane are small circles centered at the origin. The bifurcations diagram of a parameter-dependent surface is the set of parameters and radii of the circles corresponding to curves with degenerate flattening points. Solving a problem due to Arnold, we find a normal form of the first nontrivial example of a flattening bifurcation diagram, which contains one continuous invariant.     

─族亚纯函数的正规定则

本文讨论亚纯函数族的正规性，推广并改进了杨乐￣［２，３］，陈怀惠￣［５］和朱秀蓉，龚向宏￣［７］等人的结果。     

全纯函数族的正规定则

Let f be a holomorphic function on a domain D Lontaiu in C, and let a be a finite complex number. We denote by -↑Ef/(a) = {z ∈ D : f(z) = a, ignoring multiplicity} the set of all distinct α-points of f. Let F be a family of holomorphic functions on D. If there exist three finite values a, b(≠ O,α) and c(≠ O) such that for every f ∈F, -↑Ef′/(0) Lontain in -↑Ef(α） and -↑Ef′ (b) Lontain in -↑Ef(c), then F is a normal family on D.     

Normal families and exceptional functions

In this paper, we obtain some normality criteria for families of meromorphic functions that concern the exceptional functions of derivatives.     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

关于紧优双环网络的无限族

双环网络是计算机互连网络和通讯系统的一类重要拓扑结构．1993年,李乔等人提出一个系统的构造方法,构造出69类0紧优和33类1紧优双环网络的无限族,并提出研究下述问题:求k(k>1)紧优双环网络的无限族．2003年,徐俊明等人给出一个4紧优双环网络的无限族．本文首先证明从每一个具体的0紧优双环网络出发,都可以构造若干0紧优双环网络无限族;结合同余方程组理论和数论中的素数理论,给出若干求一般k(k≥0)紧优双环网络无限族(包括非单位步长双环网络无限族)的方法．