组合数学方法推引原子谱项（Ⅲ）非等效组态的谱项及其微机处理

讨论了推引非等效组态原子谱项的组合数学方法和矢量加和法，并编制了ＢＡＳＩＣ语言程序，在微机上快速推求非等效组态的谱项。     

The Legendre–Stirling numbers

The Legendre–Stirling numbers are the coefficients in the integral Lagrangian symmetric powers of the classical Legendre second-order differential expression. In many ways, these numbers mimic the classical Stirling numbers of the second kind which play a similar role in the integral powers of the classical second-order Laguerre differential expression. In a recent paper, Andrews and Littlejohn gave a combinatorial interpretation of the Legendre–Stirling numbers. In this paper, we establish several properties of the Legendre–Stirling numbers; as with the Stirling numbers of the second kind, they have interesting generating functions and recurrence relations. Moreover, there are some surprising and intriguing results relating these numbers to some classical results in algebraic number theory.     

Best approximation in polyhedral Banach spaces

In the present paper, we study conditions under which the metric projection of a polyhedral Banach space X onto a closed subspace is Hausdorff lower or upper semicontinuous. For example, we prove that if X satisfies (∗) (a geometric property stronger than polyhedrality) and Y⊂X is any proximinal subspace, then the metric projection P_Y is Hausdorff continuous and Y is strongly proximinal (i.e., if {y_n}⊂Y, x∈X and , then ).One of the main results of a different nature is the following: if X satisfies (∗) and Y⊂X is a closed subspace of finite codimension, then the following conditions are equivalent: (a) Y is strongly proximinal; (b) Y is proximinal; (c) each element of Y^⊥ attains its norm. Moreover, in this case the quotient X/Y is polyhedral.The final part of the paper contains examples illustrating the importance of some hypotheses in our main results.     

Two linear-time algorithms for computing the minimum length polygon of a digital contour

The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexity of the shape, its perimeter is a good estimate of the perimeter of the digitized shape. We present here two novel equivalent definitions of MLP, one arithmetic, one combinatorial, and both definitions lead to two different linear time algorithms to compute them. This paper extends the work presented in Provençal and Lachaud (2009) [26], by detailing the algorithms and providing full proofs. It includes also a comparative experimental evaluation of both algorithms showing that the combinatorial algorithm is about 5 times faster than the other. We also checked the multigrid convergence of the length estimator based on the MLP.     

Computing curve intersection by homotopy methods

Intersection problems are fundamental in computational geometry, geometric modeling and design and manufacturing applications, and can be reduced to solving polynomial systems. This paper introduces two homotopy methods, i.e. polyhedral homotopy method and linear homotopy method, to compute the intersections of two plane rational parametric curves. Extensive numerical examples show that computing curve intersection by homotopy methods has better accuracy, efficiency and robustness than by the Ehrlich-Aberth iteration method. Finally, some other applications of homotopy methods are also presented.     

An Algorithm for Computing the Global Basis of a Finite Dimensional Irreducible U q ( so 2 n + 1 ) or U q ( so 2 n )-Module

Abstract

We describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional U _q (s o _2n+1) or U _q (s o _2n )-module.     

The combinatorics of N.G. de Bruijn

In memoriam: N.G. de Bruijn.     

聚氨酯/POSS纳米复合材料的制备及阻燃性能

利用笼形倍半硅氧烷(POSS)纳米粒子与二苯基甲烷-4,4'-二异腈酸酯之间的相容性,采用聚合法合成聚氨酯/POSS纳米复合材料.扫描电镜及红外光谱测试表明POSS粒子均匀分散在聚氨酯基体中,热重分析、氧指数及垂直燃烧测试表明：POSS能使复合材料的热稳定性和阻燃性能得到提升.     

Tracing Robert's use of representations to solve counting problems: A 16-year case study

This study describes how Robert used his external representations (formulae, notations, sketches, models, and figures) to solve progressively more challenging counting tasks over a 16-year period. In his explorations of counting tasks, Robert discovered intricate connections between solutions to problems that looked different on the surface. Using video data from Robert's problem solving, analyses of his solutions are presented that shed light on how he built new ideas from existing ideas and how he modified external representations to make new mathematical discoveries and provide justifications for his solutions.     

Simulation-Based Simultaneous Confidence Bands in Multiple Linear Regression With Predictor Variables Constrained in Intervals

This article presents a method for the construction of a simultaneous confidence band for the normal-error multiple linear regression model. The confidence bands considered have their width proportional to the standard error of the estimated regression function, and the predictor variables are allowed to be constrained in intervals. Past articles in this area gave exact bands only for the simple regression model. When there is more than one predictor variable, only conservative bands are proposed in the statistics literature. This article advances this methodology by providing simulation-based confidence bands for regression models with any number of predictor variables. Additionally, a criterion is proposed to assess the sensitivity of a simultaneous confidence band. This criterion is defined to be the probability that a false linear regression model is excluded from the band at least at one point and hence this false linear regression model is correctly declared as a false model by the band. Finally, the article considers and compares several computational algorithms for obtaining the confidence band.