海豚链球菌灭活疫苗对罗非鱼免疫效果的研究

用野外分离的海豚链球菌(Streptococcus iniae)海水菌株HD-1和淡水菌株TBY-1制备成含1×1010cfu/mL的灭活疫苗,以0.1 mL/尾的剂量对尼罗罗非鱼(Oreochromis niloticus)进行腹腔注射,免疫2次,测定免疫后1周、3周和5周免疫鱼血清中抗海豚链球菌的抗体滴度和相应菌株攻毒后的相对保护率,以评价海豚链球菌灭活疫苗对罗非鱼的免疫保护性.结果显示免疫鱼血清中抗体凝集效价在免疫后第3周和第5周呈显著性升高,且两种疫苗免疫血清存在明显的交叉凝集反应,说明HD-1和TBY-1抗原具有交叉免疫原性.在免疫后第4周,利用8倍半数致死量浓度(LD50)的海豚链球菌强毒菌株进行攻毒试验,结果显示:HD-1和TBY-1免疫组的死亡率分别为5%和0%,相对保护率分别为93.8%和100%;未经免疫的阴性对照组的死亡率分别为77.5%和62.5%.     

论英语委婉语的发展与变化

委婉语的研究与具体的言语交际相结合，不仅可以对其特性有直观的了解，还可以及时发现其中某些方面的最新变化，使言语交际达到最大的效能。现存的许多机读语料库可以帮助人们在研究中减少数据带来的诱导因素，提高数据的代表性和自然性。利用语料库提供的数据支持，考察英语委婉语的分类和变化，并尝试揭示其变化的原因。     

ESA教学模式在英语阅读课中的应用

杰里米·哈默(Jeremy Harmer)的ESA教学理论提出:在英语教学中,投入(Engage)、学习(Study)和运用(Activate)三种要素必不可少。根据此三种要素的顺序变换和不同组合,可以创造出三种不同的教学模式:直线型(Straight Arrows sequence)、反弹型(Boomerang sequence)和杂拼型(Patchwork sequence),灵活运用于课堂教学。本文结合实例就这一理论在英语阅读教学中的具体实践与应用做以阐述,指出ESA理论是一种有效、实用的教学方法。     

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.     

An Authentication Method of Distinguishing Proxy＇s Secure Accident Responsibility

The publish/subscribe （pub/sub） paradigm has asynchronous, loosely-coupled and many-to-many communication properties and is widely used in the application of large-scale distributed computing environment. There is the problem that is mutual trustable between network proxies in terms of pub/sub systems and the problem which is hardly to distinguish accident responsibility while the accident happens in Kerberos based on symmetrical encryption algorithm. A proxy identity authentication algorithm based on RSA encryption is proposed to solve the problem of mutual trust between proxies, and the security of the messages is guaranteed through certificate delegation. The algorithm can distinguish accident responsibility. The feasibility analysis, security analysis and efficiency analysis of the algorithm are carried out.