Nutrient compositions of cultured Thalassiosira rotula and Skeletonema costatum from the Jiaozhou Bay in China

Carbon, nitrogen, phosphorus, silicon composition of cultured two different sized phytoplankton common species of Thalassiosira rotula and Skeletonema costatum from the Jiaozhou Bay were measured. Carbon, nitrogen, phosphorus, silicon contents in cell were. obvious higher in T. rotula than in S. costatum, but the percents of nitrogen, phosphorus, silicon contents in cell dry mass in T. rotula were lower than those in S. costatum. The dry mass concentrations of nitrogen,phosphorus,silicon in S. costatum were much higher than those in T. rotula, particularly silicon, the former was 6.4 times of the latter, showing that S. costatum could more assimilate these elements. Especially, S. costatum had competitive dominance for assimilating silicon, which is beneficial to its becoming a major dominant species in relative short silicon of the Jiaozhou Bay. There were some differences in numerical value of nutrient ratios both laboratory-cultured phytoplankton and different sized suspended particulates (mainly phytoplankton) in the Jiaozhou Bay, which was caused by the changes of environment. High contents of carbon, nitrogon and relative low phosporus,silicon, high molar ratio of nitrogen to phosphorus (far higher than Redfield value) and low ratio of silicon to phosphorus and silicon to nitrogen (far lower than Redfield values) in the two diatoms and different sized suspended particulates were consistent with those in the seawater. Relative short silicon in the seawater and phytoplankton showed that silicon was possibly affectting phytoplankton growth in the Jiaozhou Bay.

Structure and chemical composition of supported Pt-Sn electrocatalysts for ethanol oxidation

Carbon supported PtSn alloy and PtSnOx particles with nominal Pt:Sn ratios of 3:1 were prepared by a modified polyol method. High resolution transmission electron microscopy (HRTEM) and X-ray microchemical analysis were used to characterize the composition, size, distribution, and morphology of PtSn particles. The particles are predominantly single nanocrystals with diameters in the order of 2.0-3.0 nm. According to the XRD results, the lattice constant of Pt in the PtSn alloy is dilated due to Sn atoms penetrating into the Pt crystalline lattice. While for PtSnOx nanoparticles, the lattice constant of Pt only changed a little. HRTEM micrograph of PtSnOx clearly shows that the change of the spacing of Pt (111) plane is neglectable, meanwhile, SnO2 nanoparticles, characterized with the nominal 0.264 nm spacing of SnO2 (10 1) plane, were found in the vicinity of Pt particles. In contrast, the HRTEM micrograph of PtSn alloy shows that the spacing of Pt (111) plane extends to 0.234 nm from the original 0.226 nm. High resolution energy dispersive X-ray spectroscopy (HR-EDS) analyses show that all investigated particles in the two PtSn catalysts represent uniform Pt/Sn compositions very close to the nominal one. Cyclic voltammograms (CV) in sulfuric acid show that the hydrogen ad/desorption was inhibited on the surface of PtSn alloy compared to that on the surface of the PtSnOx catalyst. PtSnOx catalyst showed higher catalytic activity for ethanol electro-oxidation than PtSn alloy from the results of chronoamperometry (CA) analysis and the performance of direct ethanol fuel cells (DEFCs). It is deduced that the unchanged lattice parameter of Pt in the PtSnOx catalyst is favorable to ethanol adsorption and meanwhile, tin oxide in the vicinity of Pt nanoparticles could offer oxygen species conveniently to remove the CO-like species of ethanolic residues to free Pt active sites. (C) 2005 Elsevier Ltd. All rights reserved.

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.

Validating Arbitrarily Large Network Protocol Compositions with Finite Computation

Formal tools like finite-state model checkers have proven useful in verifying the correctness of systems of bounded size and for hardening single system components against arbitrary inputs. However, conventional applications of these techniques are not well suited to characterizing emergent behaviors of large compositions of processes. In this paper, we present a methodology by which arbitrarily large compositions of components can, if sufficient conditions are proven concerning properties of small compositions, be modeled and completely verified by performing formal verifications upon only a finite set of compositions. The sufficient conditions take the form of reductions, which are claims that particular sequences of components will be causally indistinguishable from other shorter sequences of components. We show how this methodology can be applied to a variety of network protocol applications, including two features of the HTTP protocol, a simple active networking applet, and a proposed web cache consistency algorithm. We also doing discuss its applicability to framing protocol design goals and to representing systems which employ non-model-checking verification methodologies. Finally, we briefly discuss how we hope to broaden this methodology to more general topological compositions of network applications.