Temperature-induced fractionation of oxygen isotopes of diatom frustules and growth water in Lake Sihailongwan in Northeast China

Diatom oxygen isotopes have been widely applied in quantitative reconstruction of the paleoclimate and paleoenvironment, but have rarely been reported in China. In the present study, Lake Sihailongwan in Northeast China was selected for detailed investigation of oxygen isotopic fractionation between diatom frustules and lake water induced by growth temperature. This study involved a 2-year period of field monitoring of the lake water temperature at multiple depths and biweekly collections of traps for both sediment and water at shallow and bottom depths (7 and 49 m below the lake surface, respectively), diatom separation and purification of the trap sediments, and oxygen isotope measurement for diatom silica and lake water samples. The conditioned experiment conducted herein demonstrated that the laboratory device, methods and techniques used in this study were capable of generating reliable data for the typical oxygen isotope composition of diatom frustules. The data obtained revealed a prominent linear relationship between the oxygen isotope composition of the modern diatom and lake temperature during growth. The fractionation coefficient was about −0.185‰/°C−0.238‰/°C in the temperature range of 3.6–24°C, which is consistent with the observations from various aquatic environments and laboratory culture with different diatom taxa. These findings provide strong support for the dominant control of the growth temperature on the oxygen isotope fractionation between the diatom frustules and ambient water. A notable difference in the fractionation coefficient was observed between the surface and bottom diatom oxygen isotopes, suggesting that various depositional processes and taphonomic effects influenced the surface and bottom trap samples. Another factor leading to this difference may be that enrichment by evaporation and dilution by rainfall have a stronger influence on the surface. Overall, the results presented here demonstrate significant progress in evaluation of diatom oxygen isotopes in China and draw attention to the differences between surface and bottom diatom oxygen isotope compositions.     

Application of surface plasmon resonance in screening adsorbents and explaining adsorption phenomena using model polymers

A surface plasmon resonance (SPR) technique was developed as an online screening method to identify effective adsorbents for the peptide NH₂-Cys-Thr-Trp-Trp-COOH (CW-4). To validate the SPR technique, several linear polymers containing amino acid residues were synthesized as models of their corresponding adsorbents. SPR screening of all the linear polymers demonstrated that the linear polymer containing phenylalanine residues (PPhe) exhibited the highest affinity for CW-4 among the polymers tested. In accordance with the screening results from SPR, the adsorbent containing phenylalanine (APhe) exhibited the highest adsorption capacity for CW-4. An interesting observation was that the amounts of CW-4 adsorbed on 3 adsorbents were quite small, even though both SPR and isothermal titration calorimetry (ITC) experiments indicated the presence of interactions between CW-4 and the three polymers. A kinetic analysis performed using SPR technology suggested such a phenomenon was ascribed to the poor stability of the CW-4/polymer complexes; that is, CW-4 associates with the polymers quickly, but it also dissociated quickly. The combined results suggested that SPR was a promising tool to identify the optimal adsorbent for peptides, analyze the interactions contributing to adsorption and explain adsorption phenomena using polymer models.     

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.     

Intrusion Detection Method for Program Vulnerability via Library Calls

Library function call sequence is the direct reflection of a program＇s behavior. The relationship between program vulnerability and library calls is analyzed, and an intrusion detection method via library calls is proposed, in which the short sequences of library call are used as signature profile. In this intrusion detection method, library interposition is used to hook library calls, and with the discussion of the features of the library call sequence in detail, an algorithm based on information-theory is applied to determine the appropriate length of the library call sequence. Experiments show good performance of our method against intrusions caused by the popular program vulnerabilities.