Parameter cascades and profiling in functional data analysis

A data smoothing method is described where the roughness penalty depends on a parameter that must be estimated from the data. Three levels of parameters are involved in this situation: Local parameters are the coefficients of the basis function expansion defining the smooth, global parameters define low-dimensional trend and the roughness penalty, and a complexity parameter controls the amount of roughness in the smooth. By defining local parameters as regularized functions of global parameters, and global parameters in turn as functions of complexity parameter, we define a parameter cascade, and show that the accompanying multi-criterion optimization problem leads to good estimates of all levels of parameters and their precisions. The approach is illustrated with real and simulated data, and this application is a prototype for a wide range of problems involving nuisance or local parameters.     

Distance-balanced graphs: Symmetry conditions

A graph X is said to be distance-balanced if for any edge uv of X, the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. A graph X is said to be strongly distance-balanced if for any edge uv of X and any integer k, the number of vertices at distance k from u and at distance k+1 from v is equal to the number of vertices at distance k+1 from u and at distance k from v. Exploring the connection between symmetry properties of graphs and the metric property of being (strongly) distance-balanced is the main theme of this article. That a vertex-transitive graph is necessarily strongly distance-balanced and thus also distance-balanced is an easy observation. With only a slight relaxation of the transitivity condition, the situation changes drastically: there are infinite families of semisymmetric graphs (that is, graphs which are edge-transitive, but not vertex-transitive) which are distance-balanced, but there are also infinite families of semisymmetric graphs which are not distance-balanced. Results on the distance-balanced property in product graphs prove helpful in obtaining these constructions. Finally, a complete classification of strongly distance-balanced graphs is given for the following infinite families of generalized Petersen graphs: GP(n,2), GP(5k+1,k), GP(3k±3,k), and GP(2k+2,k).     

Generalized Burnside rings and group cohomology

In this paper we give by a unified formula the classification of exceptional compact simple Kantor triple systems defined on tensor products of composition algebras corresponding to realifications of exceptional simple Lie algebras.     

Constructions and Properties of k out of n Visual Secret Sharing Schemes

The idea of visual k out of n secret sharing schemes was introduced in Naor. Explicit constructions for k = 2 and k = n can be found there. For general k out of n schemes bounds have been described.Here, two general k out of n constructions are presented. Their parameters are related to those of maximum size arcs or MDS codes. Further, results on the structure of k out of n schemes, such as bounds on their parameters, are obtained. Finally, the notion of coloured visual secret sharing schemes is introduced and a general construction is given.     

随机微分方程终值问题的弱解(英)

设｛Wt．Ft．t∈［0．T］｝为概率空间（Ω，P）上的标准α维Brown运动，为由它生成的自然σ－代数流．本文讨论了如下随机微分方程终值问题弱解的存在性：其中ξ∈L2（Ω，P；Rn），g：［0，T」×Rn×Rnd→Rn为有界可测函数．此外，还讨论了它在金融市场期权定价问题中的应用．     

Global optimization for the sum of generalized polynomial fractional functions

In this paper, a branch and bound approach is proposed for global optimization problem (P) of the sum of generalized polynomial fractional functions under generalized polynomial constraints, which arises in various practical problems. Due to its intrinsic difficulty, less work has been devoted to globally solving this problem. By utilizing an equivalent problem and some linear underestimating approximations, a linear relaxation programming problem of the equivalent form is obtained. Consequently, the initial non-convex nonlinear problem (P) is reduced to a sequence of linear programming problems through successively refining the feasible region of linear relaxation problem. The proposed algorithm is convergent to the global minimum of the primal problem by means of the solutions to a series of linear programming problems. Numerical results show that the proposed algorithm is feasible and can successfully be used to solve the present problem (P).     

Generalized stress intensity factors in the interaction within a rectangular array of rectangular inclusions

Summary To evaluate the mechanical strength of fiber-reinforced composites, it is necessary to consider singular stresses at the end of fibers because they cause crack initiation, propagation, and final failure. A square array of rectangular inclusions under longitudinal tension is considered in this paper. The body-force method is applied to a unit cell region. Then, the problem is formulated as a system of singular integral equations, where the unknown functions are the densities of body forces distributed in infinite plates having the same elastic constants as those of the matrix and inclusions. The unknown functions are expressed as piecewise-smooth functions using power series and two types of fundamental densities which express singular stresses. Generalized stress intensity factors at the corners of inclusions are systematically calculated with varying the shape and spacing of a square array of square and rectangular inclusions.     

素特征域上广义Witt李超代数的自同构群

设W是素特征域上无限维或有限维广义Witt李超代数.本文利用W的自然滤过不变性和W的底代数的不变维数性质,证明了W的自同构群AutW同构于W的底代数的容许自同构群,还证明了在此群同构之下,AutW的标准正规列恰好对应W的底代数的容许自同构群的标准正规列,并给出AutW若干较为细致的性质.     

论广义Liénard系统的全局中心

本文讨论了广义Liénard系统的局部和全局中心,给出了两个定理,它们推广和改进了文[1—3]的结果.文中引理对研究广义Liénard系统解的震荡性,稳定性和极限环的存在性也是有用的.     

Heterogeneous cost sharing, the directional serial rule

The directional serial rule is introduced as a natural serial extension, generalizing the Moulin–Shenker cost sharing rule to heterogeneous cost sharing models. It is the unique regular rule compatible with the radial serial principle. In particular, this shows the incompatibility of the serial principle with differentiability of a cost sharing rule as a function of the individual demands.I would like to thank the editor and the referee for their comments which have been most useful.