素环上的交换映射

设R是一个环,F:R→R是一个映射.如果对所有的x∈R,有[F(x),x]=0成立,则称F是R上的交换映射.文章的主要结论为:设R是特征不为2的素环.如果存在一个非零广义导子:δR→R,使得映射x→[δ(x),x]在R上是可变换的且δ(I)∈Z(R),则δ在R上是可交换的.     

不同剂量戊巴比妥钠对豚鼠听性脑干诱发电位的影响

目的比较不同剂量戊巴比妥钠麻醉对豚鼠听性脑干反应(ABR)测试的影响,探讨进行ABR测试最佳的戊巴比妥钠剂量。方法:16只(32耳)豚鼠按3%戊巴比妥钠(40mg/Kg)、3%戊巴比妥钠(30mg/Kg)、1%戊巴比妥钠(40mg/Kg)、1%戊巴比妥钠(30mg/Kg)麻醉剂量随机分为4组;采取腹腔注射麻醉,于每次麻醉后进行ABR测试;观察有关麻醉诱导时间、维持时间、呼吸频率、死亡例数及ABR反应阈、各波潜伏期及波间期。结果各组麻醉诱导时间及维持时间有显著性差异,其中3%戊巴比妥钠(40mg/Kg)组诱导时间最短、维持时间最长,1%戊巴比妥钠(30mg/Kg)组麻醉诱导时间稍长,而维持时间最短,但均超过2.5h。各组除Ⅱ波潜伏期、Ⅰ-Ⅱ、Ⅱ-Ⅲ波间期有显著性差异外,其余各波潜伏期和波间期、反应阈均无显著性差异。1%戊巴比妥钠(30mg/Kg)组在重复麻醉后各指标均无显著性差异,且无一例死亡,其余各组均有1-2只豚鼠死亡。结论对豚鼠腹腔注射1%戊巴比妥钠(30mg/Kg)即可达到较理想的麻醉效果,而且重复麻醉后不影响ABR测试结果。     

SSR分子标记在作物遗传多样性研究中的应用现状

微卫星(microsatellites)或简单序列重复(simple sequence repeats,SSRs)是以1-6个碱基为基本单元的串联重复序列,具有含量丰富、多态性高、共显性和检测方法简单等优点,是研究植物遗传多样性的主要的分子标记方法之一,已被用于多种农作物的遗传多样性研究。概述了微卫星DNA标记的原理及特点,探讨了其在农作物物遗传多样性研究中的应用和发展前景。     

航空钛合金的激光冲击研究

介绍了用激光冲击处理航空材料钛合金TC4提高其力学性能的技术.当利用强激光冲击钛合金表面时,涂层表面形成高幅值冲击波.在冲击波的高压作用下,钛合金表面发生微塑性变形,形成高幅值残余压应力层.激光冲击后,表面压应力层厚度达1 mm以上,压应力达200 MPa以上.随着激光能量的增加,冲击区域的残余应力有增大的趋势,在功率密度由1 GW/cm2增加到5 GW/cm2过程中,其冲击波峰值处的压力线性增加,表面最大残余压应力也相应线性增加;在功率密度为2 GW/cm2时,残余压应力随着次数增加而升高,而且表面硬度也大大提高,从而有效地改善了材料的机械性能,大幅度提高航空材料的疲劳寿命和抗应力腐蚀性能.     

Security Architecture of Trusted Virtual Machine Monitor for Trusted Computing

With analysis of limitations Trusted Computing Group （TCG） has encountered, we argued that virtual machine monitor （VMM） is the appropriate architecture for implementing TCG specification. Putting together the VMM architecture, TCG hardware and application-oriented ＂thin＂ virtual machine （VM）, Trusted VMM-based security architecture is present in this paper with the character of reduced and distributed trusted computing base （TCB）. It provides isolation and integrity guarantees based on which general security requirements can be satisfied.     

Provable Efficient Certificateless Group Key Exchange Protocol

Certificateless public key cryptography （CL-PKC） avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we present an efficient constant-round group key exchange protocol, which is provably secure under the intractability of computation Diffie-Hellman problem. Our protocol is a contributory key exchange with perfect forward secrecy and has only two communication rounds. So it is more efficient than other protocols. Moreover, our protocol provides a method to design efficient constant-round group key exchange protocols and most secret sharing schemes could be adopted to construct our protocol.     

Escrow-Free Certificate-Based Authenticated Key Agreement Protocol from Pairings

Key agreement protocols are essential for secure communications. In this paper, to solve the inherent key escrow problem of identity-based cryptography, an escrow-free certificate-based authenticated key agreement （CB-AK） protocol with perfect forward secrecy is proposed. Our protocol makes use of pairings on elliptic curves. The protocol is described and its properties are discussed though comparison with Smart＇s protocol.     

Improved Non-Sieving Quadratic Sieve

In this paper, we give about prime numbers and Blum two theorems and one guess integers.We prove the two theorems about Blum integers.Combining the guess with the primitive non-sieving quadratic sieve,we proposed a improved non-sieving quadratic sieve（INQS）.In INQS,we not only reduce the times of squares and modulo n, but also imply another important conclusion,that is,we don＇t need to find the greatest common divisor of two integers as we do in PNQS.By some examples,we compare it with the primitive non-sieving quadratic sieve（PNQS）. It＇s faster to factor a integer by using improved non-sieving quadratic sieve than the primitive one.     

A Weighted Algorithm for Watermarking Relational Databases

0 Introduction Watermarking relational database become a hotspot in recent years, it aims to protect copyrights by intro- ducing small errors into the original content without af- fecting the usability for intended purpose. Although some pioneer efforts h…     

A Method to Implement Full Anonymous Attestation for Trusted Computing Platform

Trusted computing （TC） technology is brought out by trusted computing group （TCG） to make computing as safe and reliable as people expect. Attestation is one main function specified by TCG, which is the means by which a trusted computer assures a remote computer whose platform is not tampered with. There are two protocols that implement attestation without disclosing the platform＇s real identity, which are Privacy CA-based protocol and direct anonymous attestation （DAA） protocol. However, in the first protocol the privacy CA is the bottleneck and the platform＇s identity will be disclosed if the privacy CA is compromise, while DAA protocol can do profiling when dealing with rogue hardware device. In this paper, we propose a DAA-extended new approach to ensure full anonymous attestation that can not only detect a rogue TPM, but also reveal rogue TPM＇s real identity.