Testing a single-aliquot protocol for recuperated OSL dating

IEECAS SKLLQG

Optical dating of Holocene sand dune activities in the Horqin sand-fields in inner Mongolia；China；using the SAR protocol

IEECAS SKLLQG

a new client-to-client password-authenticated key agreement protocol

Natl Univ Defen Technol, China & Nanyang Technol Univ, NUDT

Label free electrochemiluminescence protocol for sensitive DNA detection with a tris(2,2'-bipyridyl)ruthenium(II) modified electrode based on nucleic acid oxidation

Label free electrochemiluminescence (ECL) DNA detection based on catalytic guanine and adenine bases oxidation using tris(2,2'-bipyridyl)ruthenium(II) [Ru(bpy)(3)(2+)] modified glassy carbon (GC) electrode was demonstrated in this work. The modified GC electrode was prepared by casting carbon nanotubes (CNT)/Nafion/Ru(bpy)(3)(2+) composite film on the electrode surface. ECL signals of doublestranded DNA and their thermally denatured counterparts can be distinctly discriminated using cyclic voltammetry (CV) with a low concentration (3.04 x 10(-8) mol/L for Salmon Testes-DNA). Most importantly, sensitive single-base mismatch detection of p53 gene sequence segment was realized with 3.93 x 10(-10) mol/L employing CV stimulation (ECL signal of C/A mismatched DNA oligonucleotides was 1.5-fold higher than that of fully base-paired DNA oligonucleotides). Label free, high sensitivity and simplicity for single-base mismatch discrimination were the main advantages of the present ECL technique for DNA detection over the traditional DNA sensors.

Protocol of capillary isoelectric focusing to separate extremely acidic and basic proteins

A new set-up was constructed for capillary isoelectric focusing (CIEF) involving a sampling capillary as a bypass fixed to the separation capillary. Sample solutions were subjected to a previously established pH gradient from the sample capillary. Besides performing conventional CIEF, the separation of ampholytic compounds with isoelectric points (p/s) beyond the pH gradient was carried out on this system. This method was termed as pH gradient driven electrophoresis (PGDE) and the basic mathematical expressions were derived to express the dynamic fundamentals. Proteins such as lysozyme, cytochrome C, and pepsin with p/s higher than 10 or below 3 were separated in a pH gradient provided by Pharmalyte (pH 3-10). Finally, this protocol convincingly exhibited its potential in the separation of a solution of chicken egg white.

Performance evaluation of the RPL Protocol in fixed and mobile sinks low-power and lossy networks.

Low-Power and Lossy-Network (LLN) are usually composed of static nodes, but the increase demand for mobility in mobile robotic and dynamic environment raises the question how a routing protocol for low-power and lossy-networks such as (RPL) would perform if a mobile sink is deployed. In this paper we investigate and evaluate the behaviour of the RPL protocol in fixed and mobile sink environments with respect to different network metrics such as latency, packet delivery ratio (PDR) and energy consumption. Extensive simulation using instant Contiki simulator show significant performance differences between fixed and mobile sink environments. Fixed sink LLNs performed better in terms of average power consumption, latency and packet delivery ratio. The results demonstrated also that RPL protocol is sensitive to mobility and it increases the number of isolated nodes.

Development and validation of a sport-specific exercise protocol for elite youth soccer players

Thatcher, Rhys, and Alan Batterham, 'Development and validation of a sport-specific exercise protocol for elite youth soccer players', Journal of Sports Medicine and Physical Fitness, (2004) 44(1) pp.15-22 RAE2008

Cryptographic Tamper Evidence

We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div can determine whether one of them was generated by the forger. Surprisingly, this is possible even after the adversary has inconspicuously learned (exposed) some-or even all-the secrets in the system. In this case, it might be impossible to tell which signature is generated by the legitimate signer and which by the forger. But at least the fact of the tampering will be made evident. We define several variants of tamper-evidence, differing in their power to detect tampering. In all of these, we assume an equally powerful adversary: she adaptively controls all the inputs to the legitimate signer (i.e., all messages to be signed and their timing), and observes all his outputs; she can also adaptively expose all the secrets at arbitrary times. We provide tamper-evident schemes for all the variants and prove their optimality. Achieving the strongest tamper evidence turns out to be provably expensive. However, we define a somewhat weaker, but still practical, variant: α-synchronous tamper-evidence (α-te) and provide α-te schemes with logarithmic cost. Our α-te schemes use a combinatorial construction of α-separating sets, which might be of independent interest. We stress that our mechanisms are purely cryptographic: the tamper-detection algorithm Div is stateless and takes no inputs except the two signatures (in particular, it keeps no logs), we use no infrastructure (or other ways to conceal additional secrets), and we use no hardware properties (except those implied by the standard cryptographic assumptions, such as random number generators). Our constructions are based on arbitrary ordinary signature schemes and do not require random oracles.

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.

SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks

We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources-this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.