线性递归序列模q

设{u_k}_k≥0为一个线性递归序列．序列{u_k(mod q)}_(k≥0)是周期的,很多人都对其周期有过研究．本文应用二次数域中理想的理论,较完全地刻面了二次线性递归序列模q的周期长度,所获结果加强并推广了Engstrom及Wall的结论．     

An improved algorithm for computing topological entropy

A new algorithm is presented for computing the topological entropy of a unimodal map of the interval. The accuracy of the algorithm is discussed and some graphs of the topological entropy which are obtained using the algorithm are displayed.     

Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error

Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.      

Banach空间无界域上二阶脉冲积分微分方程的解

在比较宽松的条件下，研究了Banach空间中二阶脉冲积分微分方程在正半实轴上具有无穷个脉冲点的初值问题的解的存在性。利用递归法、Tonelii序列和局部凸拓扑，建立了新的存在性定理，对郭大钧的结果做了本质改进。     

The weak pigeonhole principle for function classes in S 12

It is well known that S ¹₂ cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S ¹₂ for provably weaker function classes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Special simplices and Gorenstein toric rings

Athanasiadis [Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley, J. Reine Angew. Math., to appear.] studies an effective technique to show that Gorenstein sequences coming from compressed polytopes are unimodal. In the present paper we will use such the technique to find a rich class of Gorenstein toric rings with unimodal h-vectors arising from finite graphs.     

On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.     

关于Z-空间的对偶空间的讨论

本文以自然的方式定义了从Z-空间X到Z-空间Y的有界线性算子的和以及它们的数乘.从而得到了与赋范空间的对偶空间理论类似的一系列结论.     

全面成绩管理的初探

利用数量化方法,数字特征法,W ilcoxon顺序和检验法以及试卷分析的各种方法(试题难度,区分度,信度,效度等),定量地解决了影响学生成绩的主要因素,并引入全面管理方法,明显地改善了学生成绩,学生综合能力明显加强.