期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
On Convergence for TrigonometricInterpolation of Analytic Function
1
作者 Liu Hua Du Jing-yuan 《Wuhan University Journal of Natural Sciences》 EI CAS 1999年第3期275-277,共3页
In this paper, we give a necessary and sufficient condition of sequence of nodes, such that, the error of trigonometric interpolation for analytic function converges to 0.
关键词 trigonometric interpolation CONVERGENCE well-distributed
下载PDF
Some Results on B_r-Spaces
2
作者 朱同林 王戍堂 《Chinese Quarterly Journal of Mathematics》 CSCD 1996年第3期55-58,共4页
In this paper,the following results are obtained: (1) The Sorgenfrey Line is a non-Br-space; (2) We introduce Well-distributed complete spaces and locally Cech complete spaces andprove both the two classes of spacs ar... In this paper,the following results are obtained: (1) The Sorgenfrey Line is a non-Br-space; (2) We introduce Well-distributed complete spaces and locally Cech complete spaces andprove both the two classes of spacs are Br-spaces. The first result shows that there is the non-Br-space which is paracompact, Lindelof and complete quasi-metric. The second result generalizes theByczowski &. Pol theorem(i. e. Cech-complete spaces are Br-spaces) in two aspects. 展开更多
关键词 Br-spaces Sorgenfrey Line well-distributed complete spaces locallyCech-complete spaces
下载PDF
Pseudo-Randomness of Certain Sequences of k Symbols with Length pq 被引量:1
3
作者 陈智雄 杜小妮 吴晨煌 《Journal of Computer Science & Technology》 SCIE EI CSCD 2011年第2期276-282,共7页
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k sym... The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sarkozy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated. 展开更多
关键词 stream ciphers pseudo-random sequences well-distribution measure correlation measure discrete logarithm modulo pq residue class rings character sums
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部