Determination of urinary nucleosides by direct injection and coupled-column high-performance liquid chromatography

A coupled-column liquid chromatographic method for the direct analysis of 14 urinary nucleosides is described. Efficient on-line clean-up and concentration of 14 nucleosides from urine samples were obtained by using a boronic acid-substituted silica column (40 turn x 4.0 mm I.D.) as the first column (Col-1) and a Hypersil ODS2 column (250 mm x 4.6 mm I.D.) as the second column (Col-2). The mobile phases applied consisted of 0.25 mol/L ammonium acetate (pH 8.5) on Col-1, and of 25 mmol/L potassium dihydrogen phosphate (pH 4.5) on Col-2, respectively. Determination of urinary nucleosides was performed on Col-2 column by using a linear gradient elution comprising 25 mmol/L potassium dihydrogen phosphate (pH 4.5) and methanol-water (60:40, v/v) with UV detection at 260 nm. Urinary nucleosides analysis can be carried out by this procedure in 50 min requiring only pH adjustment and the protein precipitation by centrifugation of urine samples. Calibration plots of 14 standard nucleosides showed excellent linearity (r > 0.995) and the limits of detection were at micromolar levels. Both of intra- and inter-day precisions of the method were better than 6.6% for direct determination of 14 nucleosides. The validated method was applied to quantify 14 nucleosides in 20 normal urines to establish reference ranges. (c) 2005 Elsevier B.V. All rights reserved.

Development of electrocatalysts for direct alcohol fuel cells

In the present review, we summarize the recent progress in electrocatalysts for direct alcohol fuel cells, focussing on the research of electrocatalysts for both alcohol oxidation and oxygen reduction, which are crucial in the development of fuel cells. A modified EG (ethylene polyol) method to prepare well-dispersed nano-sized Pt-based electrocatalysts with high loadings is reported. By this method, a more active carbon supported PtRu catalyst for methanol oxidation reaction and a PtSn catalyst for ethanol oxidation reaction have been synthesized successfully. Furthermore, a methanol tolerant Pd-based catalyst for cathode oxygen reduction reaction has been developed. HRTEM and HR-EDS have been employed to characterize the microstructure and micro-components of the above electrocatalysts. Results show that the bimetallic electrocatalysts prepared by the modified EG method display uniform size and homogeneous components at nanometer scale.

Improvement of direct methanol fuel cell performance by modifying catalyst coated membrane structure

A five-layer catalyst coated membrane (CCM) based upon Nation 115 membrane for direct methanol fuel cell (DMFC) was designed and fabricated by introducing a modified Nafion layer between the membrane and the catalyst layer. The properties of the CCM were determined by SEM, cyclic voltammetry, impedance spectroscopy, ruinous test and I-V curves. The characterizations show that the modified Nation layers provide increased interface contact area and enhanced interaction between the membrane and the catalyst layer. As a result, higher Pt utilization, lower contact resistance and superior durability of membrane electrode assembly was achieved. A 75% Pt utilization efficiency was obtained by using the novel CCM structure, whereas the conventional structure gave 60% efficiency. All these features greatly contribute to the increase in DMFC performance. The DMFC with new CCM structure presented a maximum power density of 260 MW cm(-2), but the DMFC with conventional structure gave only 200 mW cm(-2) under the same operation condition. (c) 2005 Elsevier B.V. All rights reserved.

Direct observation of Schottky to Ohmic transition in Al-diamond contacts using real-time photoelectron spectroscopy

Evans D A, Roberts O R, Vearey-Roberts A R, Langstaff D P, Twitchen D J and Schwitters M 2007 Direct observation of Schottky to ohmic transition in Al-diamond contacts using realtime photoelectron spectroscopy Appl. Phys. Lett. 91 132114 doi:10.1063/1.2790779

E-marketing and SMEs: Operational lessons for the future

Gilmore, A.; Gallagher, D.; and Henry, S. (2007). E-marketing and SMEs: Operational lessons for the future. European Business Review. 19(3), pp.234-247 RAE2008

Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem

Gough, John, 'Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem', Journal of Mathematical Physics. 47, 113509, (2006)

Rola środków Wspólnej Polityki Rolnej Unii Europejskiej w przekształceniach rolnictwa w województwie wielkopolskim

Nauk Geograficznych i Geologicznych:Geografii Społeczno-Ekonomicznej i Gospodarki Przestrzennej

Typability and Type Checking in the Second-Order Λ-Calculus Are Equivalent and Undecidable (Preliminary Draft)

We consider the problems of typability[1] and type checking[2] in the Girard/Reynolds second-order polymorphic typed λ-calculus, for which we use the short name "System F" and which we use in the "Curry style" where types are assigned to pure λ -terms. These problems have been considered and proven to be decidable or undecidable for various restrictions and extensions of System F and other related systems, and lower-bound complexity results for System F have been achieved, but they have remained "embarrassing open problems"[3] for System F itself. We first prove that type checking in System F is undecidable by a reduction from semi-unification. We then prove typability in System F is undecidable by a reduction from type checking. Since the reverse reduction is already known, this implies the two problems are equivalent. The second reduction uses a novel method of constructing λ-terms such that in all type derivations, specific bound variables must always be assigned a specific type. Using this technique, we can require that specific subterms must be typable using a specific, fixed type assignment in order for the entire term to be typable at all. Any desired type assignment may be simulated. We develop this method, which we call "constants for free", for both the λK and λI calculi.

A Note On the Statistical Difference of Small Direct Products

We demonstrate that if two probability distributions D and E of sufficiently small min-entropy have statistical difference ε, then the direct-product distributions D^l and E^l have statistical difference at least roughly ε\s√l, provided that l is sufficiently small, smaller than roughly ε^{4/3}. Previously known bounds did not work for few repetitions l, requiring l>ε^2.

A Linearization of the Lambda-Calculus and Consequences

If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly normalizing and all are simply-typable. We extend the syntax of the standard lambda-calculus L to a non-standard lambda-calculus L^ satisfying a linearity condition generalizing the notion in the standard case. Specifically, in L^ a subterm Q of a term M can be applied to several subterms R1,...,Rk in parallel, which we write as (Q. R1 \wedge ... \wedge Rk). The appropriate notion of beta-reduction beta^ for the calculus L^ is such that, if Q is the lambda-abstraction (\lambda x.P) with m\geq 0 bound occurrences of x, the reduction can be carried out provided k = max(m,1). Every M in L^ is thus beta^-SN. We relate standard beta-reduction and non-standard beta^-reduction in several different ways, and draw several consequences, e.g. a new simple proof for the fact that a standard term M is beta-SN iff M can be assigned a so-called "intersection" type ("top" type disallowed).

Some Considerations on a Calculus with Weak References

Weak references are references that do not prevent the object they point to from being garbage collected. Most realistic languages, including Java, SML/NJ, and OCaml to name a few, have some facility for programming with weak references. Weak references are used in implementing idioms like memoizing functions and hash-consing in order to avoid potential memory leaks. However, the semantics of weak references in many languages are not clearly specified. Without a formal semantics for weak references it becomes impossible to prove the correctness of implementations making use of this feature. Previous work by Hallett and Kfoury extends λgc, a language for modeling garbage collection, to λweak, a similar language with weak references. Using this previously formalized semantics for weak references, we consider two issues related to well-behavedness of programs. Firstly, we provide a new, simpler proof of the well-behavedness of the syntactically restricted fragment of λweak defined previously. Secondly, we give a natural semantic criterion for well-behavedness much broader than the syntactic restriction, which is useful as principle for programming with weak references. Furthermore we extend the result, proved in previously of λgc, which allows one to use type-inference to collect some reachable objects that are never used. We prove that this result holds of our language, and we extend this result to allow the collection of weakly-referenced reachable garbage without incurring the computational overhead sometimes associated with collecting weak bindings (e.g. the need to recompute a memoized function). Lastly we use extend the semantic framework to model the key/value weak references found in Haskell and we prove the Haskell is semantics equivalent to a simpler semantics due to the lack of side-effects in our language.