一类特殊根及其刻划

研究了任一个超幂零根为零的亚直不可约环所确定的环类 ,证明了由这样的环类所确定的上根都是特殊根 ,并且给出了这类根的一些刻划     

与半群的完全不可逆生成集相关的几个性质

讨论了半群环的两个性质以及关于半群的a.c.c.p.（主理想升链条件）的一个结论。     

关于Herstein定理的逆问题研究

设R是一个环,如果存在n>1使f:x→xn为R的一个环同态,则映射f:R→R称为一个幂自同态。本文将完全刻划出无零因子环的所有幂自同态。     

均匀带电圆环的电势

从电势的一般概念出发得出均匀带电圆环的公式，并讨论在极限情况下约化为均匀带电细圆环的电势公式。     

关于中心指数是2的环

本文首先定义了环的中心指数的概念,然后特别讨论了中心指数是2的一些环。     

系列硫氮环分子的量子化学从头算研究

本文用从头算方法,采用 STO—3G 基组,对系列硫氮环分子(包括未知分子)的基态几何构型进行了全优化,在优化的结果基础上,比较了硫氮环分子的稳定性,得出了硫氮环分子的稳定构型,本文还讨论了硫氮环分子的芳香性问题,说明在硫氮环系列分子中,只有一部分具有“多电子芳香性”。同时预测了 S_2N_3~+和 S_5N_~(2+)合成的可能性。     

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

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

THE PRACTICE OF ACRYLIC SIROSPUN YARN ON THE SEMI WORSTED SPINNING FRAME

The technique of sirospun process is applied on a modified semi-worsted balloonless spinningframe to investigate the effect of spindle-speed,yarn-twist and strand-spacing on yarn properties.Yarn breaking strength,breaking extension,evenness and imperfection are examined on the basisof CCD experimental design.Yarn hairiness is particularly concerned,being found that all spinningparameters tested have significant effects on hairiness and that the minimum number of hairs oc-curs at the strand-spacing of 14.4 mm.Compared to conventional single spun yarn,experimentshave revealed the greatest advantage of using sirospun process is that all sirospun yarns have muchless hairiness.A new sirospun yarn fault,so called“loop”,has also been examined.The most likely cause forthis yarn fault is the strand-tension unbalance between the two strands when low tension spinningis applied.Further analysis and some initial tests have been carried out in the hope of overcomingthis loop fault which is an important obstacle to the application of balloonless spinning.     

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…     

分次环的Brown-McCoy根

研究了分次环的Brown-McCoy根,用新的方法证明并推广了文献[1]中的主要结果,证明在比自由群更广泛的群类上分次环的Brown-McCoy根是分次的.