A Seemingly Unrelated Nonparametric Additive Model with Autoregressive Errors

This article considers a nonparametric additive seemingly unrelated regression model with autoregressive errors, and develops estimation and inference procedures for this model. Our proposed method first estimates the unknown functions by combining polynomial spline series approximations with least squares, and then uses the fitted residuals together with the smoothly clipped absolute deviation (SCAD) penalty to identify the error structure and estimate the unknown autoregressive coefficients. Based on the polynomial spline series estimator and the fitted error structure, a two-stage local polynomial improved estimator for the unknown functions of the mean is further developed. Our procedure applies a prewhitening transformation of the dependent variable, and also takes into account the contemporaneous correlations across equations. We show that the resulting estimator possesses an oracle property, and is asymptotically more efficient than estimators that neglect the autocorrelation and/or contemporaneous correlations of errors. We investigate the small sample properties of the proposed procedure in a simulation study.     

x~n+1在有理数域上的因式分解

从特殊情况研究多项式f(x)=xn+1在有理数域上的因式分解.对于正整数,设H(n)是n的大于1的奇约数的个数.本文用初等数论和近世代数的知识证明了:多项式xn+1在有理数域上可分解为H(n)+1个不可约因式的乘积,即D(f)=H(n)+1.     

自然数幂方和的一个巧妙猜想

文章将利用已知的几种特殊的自然数的幂方和,研究其算法特征,进而给出并证明了自然数幂方和的一个巧妙猜想,希望这一猜想能给自然数的幂方求和寻求更简单的方法提供一些新思路.     

一种三维复杂介质波前时间的高精度数值算法

基于水平集的波前扩展算法,如FMM(Fast Marching Method)、GMM(Group Marching Method)，作为一类计算复杂介质波前时间的有效方法而被广泛使用。该类算法都是基于程函方程的有限差分格式来计算波传播时间，在介质离散单元尺寸较大的情况下，计算精度较低。为提高波前时间的计算精度，在一个长方体单元内，将任意点的波传播时间用已知节点上波前时间的插值函数表示，然后根据Fermat原理确定未知节点上的波前时间，再结合高效率的GMM算法，形成了一种计算三维复杂介质波前时间的有效算法。数值模拟实验表明，与原GMM算法相比，该算法大大提高了波前时间的计算精度，同时具有很强的稳定性和适应性。     

Analysis of microtubule dynamics using growth curve models

Microtubules are part of the structural network within a cell's cytoplasm, providing structural support as well as taking part in many of the cellular processes. A large body of data provide evidence that dynamics of microtubules in a cell is reponsible for the performance of many critical cellular functions such as cell division. In this article, we study the effect of four different isoforms of a protein tau on microtubule dynamics using growth curve models. The results show that a linear growth curve model is sufficient to explain the data. Moreover, we find that a mutated version of a 3-repeat tau protein has a similar effect as a 4-repeat tau protein on microtubule dynamics. The latter findings conform with the biological understanding of the effect of the protein tau on microtubule dynamics.     

Extreme statistics from the cosine distribution

The cosine distribution serves as a very good teaching example for which exact moment properties of extreme order statistics can be expressed in terms of elementary functions. This article presents the limiting joint distribution of the extreme order statistics for the cosine distribution. It is shown that burrows'(1986) result is a special case of the result presented in this article.     

Lattice path combinatorics for multiple product identities

Lattice paths are enumerated as walks on a lattice under the Delannoy criterion of vertical, horizontal and upward diagonal steps. Delannoy recursions are generalized for arbitrary weights in each of these directions, where the row elements of the Delannoy triangles correspond to lattice paths for all walks at a given length.     

The mean of linear signed rank statistics under alternatives

An expression is presented for the mean of a linear signed rank statistic for the one sample location model. Several examples are given to illustrate its application.     

从解一个古典概率问题所想到的

文章给出一个古典概率问题的两个解法，从而导出几个有趣的等式。     

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph

Given an undirected multigraph G = (V, E) and two positive integers and k, we consider the problem of augmenting G by the smallest number of new edges to obtain an -edge-connected and k-vertex-connected multigraph. In this paper, we show that the problem can be solved in Õ(mn²) time for any fixed and k = 3 if an input multigraph G is 2-vertex-connected, where n = |V| and m is the number of pairs of adjacent vertices in G.