Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

基于重复测量数据的Poisson回归模型的偏大离差的Score检验

Poisson回归模型广泛应用于分析计数型数据 ,Dean&Lawless(1989)和Dean(1992 )讨论了非重复测量得到的计数型数据的偏大离差存在性的检验问题 .本文分别利用随机系数模型和对数非线性模型讨论了基于重复测量得到的计数型数据的偏大离差的检验问题 ,得到了检验的score统计量 .     

受迫广义KdV-Burgers方程行波解的存在唯一性

本文研究具有受迫性的广义二维KdV-Burgers方程的周期行波解,为了获得周期行波解的存在唯一性定理,使唤用特定系数法和Schauder不动点定理获得了受迫广义KdV-Burgers方程周期行波解存在唯一性的条件.并获得了周期行波解的一些先验估计式.     

相位差与q变形广义相干叠加态的压缩特性

对于q变形的非简谐振子广义相干态的叠加态β〉+eiφβeiδ〉,其量子涨落的可能高阶压缩阶数可以表示为k≠2πn/δ,这里n是整数.当δ=π时,压缩阶数不能是偶数即只能是奇数,这正是q变形非简谐振子广义奇偶相干态的结果.由此表明参数相位差δ对决定q变形的非简谐振子广义相干态叠加态的高阶压缩阶数起决定性作用.     

上海基础房价相关指标及走势的分析与研究

基础房价的相关指标及其走势一直是大众关心的热门话题．本文通过对上海基础房价相关指标的分析，建立了市场房价走势的两个数学模型．模型一：在相关性分析的基础上利用主成分分析消除指标间的共线性，再用回归拟合房价模型并进行预测；模型二：在相关性分析的基础上利用核估计方法预测出房价．继呵对2005年下半年的房价走势进行了预测，得出的结果与实际情况相吻合．     

Bayesian Prediction Analysis for Growth Curve Model Using Noninformative Priors

We apply a Bayesian approach to the problem of prediction in an unbalanced growth curve model using noninformative priors. Due to the complexity of the model, no analytic forms of the predictive densities are available. We propose both approximations and a prediction-oriented Metropolis-Hastings sampling algorithm for two types of prediction, namely the prediction of future observations for a new subject and the prediction of future values for a partially observed subject. They are illustrated and compared through real data and simulation studies. Two of the approximations compare favorably with the approximation in Fearn (1975, Biometrika, 62, 89–100) and are very comparable to the more accurate Rao-Blackwellization from Metropolis-Hastings sampling algorithm.     

一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

Controlling global stochasticity of Hamiltonian systems by nonlinear perturbation

A method of controlling global stochasticity in Hamiltonian systems by applying nonlinear perturbation is proposed. With the well-known standard map we demonstrate that this control method can convert global stochasticity into regular motion in a wide chaotic region for arbitrary initial condition, in which the control signal remains very weak after a few kicks. The system in which chaos has been controlled approximates to the original Hamiltonian system, and this approach appears robust against small external noise. The mechanism underlying this high control efficiency is intuitively explained. Received 15 January 2002 Published online 6 June 2002     

Codes with a Certain Weight-preserving Transitive Group of Automorphisms

We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C. Michael Giudici - The author holds an Australian Postdoctoral Fellowship.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.