Banach空间中的幂级数方程

本文考虑Banach空间中形如x=u+sum from k=1 to ∞(a_kx~k)的幂级数方程,建立了一个比较定理,并将其应用于一定的非线性积分方程.     

不可压缩非牛顿粘性流体二维定常流动的第一边值问题

讨论不可压缩非牛顿粘性流体二维定常流动的第一边值问题,在比以往较弱的假设条件下证明了解的存在性和唯一性。     

Intelligent Control Mechanism of Part Picking Operations of Automated Warehouse

This paper studies the part picking operations of a ut omated warehouse. It assumed the demand of picking orders of automated warehouse are dynamic generated. Once the picking orders of certain period of time are kn own, it is necessary to decide an efficient order picking sequence and routing t o minimize the total travel distance to complete those orders. Assumed there are n i items to be picked in order O i. Each item in the picking ord er is located in different locations in the warehouse. Since i...     

关于丢番图方程x~2+27y~2=4p

分类讨论了方程x2 +2 7y2 =4p解的存在性 ,给出其有解的一个充要条件 .     

岩芯筒压入地层的塑性力学问题

摘要首先从库仑定律出发导出了地层介质塑性流动条件。其结果类似于一般塑性力学中的Tresca,Mises条件。其次列出了轴对称地层塑性流动的微分方程组,并推出了其简化近似方程。最后提出了简化方程的特征线解法,并举例说明。     

关于线性NDDE振动性的代数判据（Ⅰ）

本文给一阶线性自治中立型方程一切解振动的充要条件，这些条件仅依赖于系统的参数，从而对自治系统彻底解决了［１］中提出的问题１２     

Solving the State Equation of a System by Walsh Function

In this paper, We deal with the solution of the state equation of a system by the Walsh function, that is, we shall find the solution of a matrix differential equation by the Walsh function, and introduce a solution of the higher-order matrix differential equation. First, after a certain transform, we turn the higher-order matrix differential equation into a state equation. Then we find the solution of the state equation by the Walsh function. Finally after a certain transform, we obtain a solution of the higher-order matrix differential equation.     

乒乓球运动中的力学分析

利用力学原理分析了乒乓球的运动方程与击球时作用力、球的速度和位置之间的关系．确定出任意条件下的球的落点．并给出了一些计算结果．     

Security Analysis of Discrete Logarithm Based Cryptosystems

0 IntroductionNowthere are many well known cryptosystems based ondiscrete logarithms , such as the ElGamal cryptosys-tem[1]and the digital signature algorithm(DSA)[2]. Discretelogarithms have many advantages . Breaking the discrete log-arithm modulo pri mepappears to be somewhat harder thanfactoringintegern,and elliptic curve cryptosystems may usemuchsmaller keysizesthan RSA-basedcryptosystems of com-parable security.The discrete logarithmproblemover a group can be bro-ken down into a numb…