浅析二阶齐次线性变系数微分方程的一个可积类型

本文讨论了二阶齐次线性变系数微分方程的特殊形式，给出了这种微分方程的一个可积类型．     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

多小波子空间上的单小波表示

本文在较弱的条件下,建立了2重多小波子空间与单小波子空间的关系.即由2重多小波构造出单小波.一方面,这种单小波的平移伸缩与2重多小波的平移伸缩生成的子空间是完全相同的;另一方面,它具有插值性.因此通过构造出的单小波建立了多小波子空间上的Shannon型采样定理.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

OU型Markov过程的不变测度及弱对偶性

本文研究ＯＵ型Ｍａｒｋｏｖ过程的不变测度、参考测度和弱对偶半群的存在性问题，并得出了不变测度的唯一性。     

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

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

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

Exceptional set of a representation with fractional powers

We prove that for any given c, 1 < c < 17/11, almost all natural numbers are representable in the form [x ^c] + [p ^c], where x is a natural number and p is a prime.