L-Fuzzy拟序集的理想完备化

建立[4]中定义的L-fuzzy拟序集的一种理想完备化,即证明了L-fuzzy拟序集上的所有L-fuzzy理想组成的集合,赋以合适的程度映射构成L-fuzzydomain,任意从L-fuzzy拟序集到L-fuzzydomain的L-fuzzy单调映射都可以扩张成为一个L-fuzzyScott连续映射。     

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.     

低复杂度序列的维数

本文研究符号空间中由零拓扑熵序列组成的集合.通过构造适当的自相似集,证明了该集合的盒维数为1,而Hausdorff维数为0.     

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.     

推广的Kantorovich算子在Ba空间中的逼近

利用Ditzian-Totik光滑模,研究了推广的Kantorovich算子在Ba空间中的逼近,得到逼近的正定理与等价定理.所得结果改进、推广和统一了一些作者的结果.     

Isoperimetric estimates in products

In a product M ₁ × M ₂ of Riemannian manifolds, the least perimeter required to enclose given volume among general regions is at least 1/√ 2 times that among regions of product form, assuming that the isoperimetric profiles of M ₁ and M ₂ are concave. This result sharpens earlier work of Grigor'yan, generalizes results of Bollobás and Leader and of Barthe, and yields a lower bound on the Cheeger isoperimetric constant of a product.     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（n,m,t）弹性函数,其非线性度为2^n-1-2^n-l/2-1＋2^l/2.nlmax（n-l,m,t）,在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.     

多元线性回归法在互联网网间结算中的应用

本文建立一个理论模型研究互联网互联结算的问题。文章利用多元线性回归法对互联网骨干网运营商(IBPs:Internet Backbone Providers)的网络价值进行评估,利用IBPs各自的网络价值对其交换速率进行加权,从而得出网络价值加权速率,依据这个速率进行结算既可以反映了每个网络对互联的贡献程度,又反映了在互联中对网络资源的被占用程度。