A Photoactivated Cu–CeO2 Catalyst with Cu-[O]-Ce Active Species Designed through MOF Crystal Engineering

Fully utilizing solar energy for catalysis requires the integration of conversion mechanisms and therefore delicate design of catalyst structures and active species. Herein, a MOF crystal engineering method was developed to controllably synthesize a copper–ceria catalyst with well-dispersed photoactive Cu-[O]-Ce species. Using the preferential oxidation of CO as a model reaction, the catalyst showed remarkably efficient and stable photoactivated catalysis, which found practical application in feed gas treatment for fuel cell gas supply. The coexistence of photochemistry and thermochemistry effects contributes to the high efficiency. Our results demonstrate a catalyst design approach with atomic or molecular precision and a combinatorial photoactivation strategy for solar energy conversion.     

Twice Q-polynomial distance-regular graphs of diameter 4

It is known that a distance-regular graph with valency k at least three admits at most two Qpolynomial structures. We show that all distance-regular graphs with diameter four and valency at least three admitting two Q-polynomial structures are either dual bipartite or almost dual bipartite. By the work of Dickie(1995) this implies that any distance-regular graph with diameter d at least four and valency at least three admitting two Q-polynomial structures is, provided it is not a Hadamard graph, either the cube H(d, 2)with d even, the half cube 1/2H(2d + 1, 2), the folded cube?H(2d + 1, 2), or the dual polar graph on [2A2d-1(q)]with q 2 a prime power.     

Uniform partition extensions,a generating functions perspective

In this paper, a bivariate generating function CF(x, y) =f(x)-yf(xy)1-yis investigated, where f(x)= n 0fnxnis a generating function satisfying the functional equation f(x) = 1 + r j=1 m i=j-1aij xif(x)j.In particular, we study lattice paths in which their end points are on the line y = 1. Rooted lattice paths are defined. It is proved that the function CF(x, y) is a generating function defined on some rooted lattice paths with end point on y = 1. So, by a simple and unified method, from the view of lattice paths, we obtain two combinatorial interpretations of this bivariate function and derive two uniform partitions on these rooted lattice paths.     

Separation of 23 dansylated amino acids by micellar electrokinetic chromatography at low temperature

Summary The baseline separation of 23 dansylated amino acids (including 3 didansylated species) is reported. Lowering of the analysis temperature and fine control of the surfactant concentration were essential in obtaining this result. Calibration graphs with good linearity were obtained.     

A simple method improving the analyzing accuracy of circular groove guide

A simple method is introduced to improve the analysing accuracy of circular groove guide. With this method, the characteristic equation of circular groove guide is derived and its solution is given and discussed.The Project Supported by National Natural Science Foundation of P.R.China     

Sufficiency in Quantum Statistical Inference

This paper attempts to develop a theory of sufficiency in the setting of non-commutative algebras parallel to the ideas in classical mathematical statistics. Sufficiency of a coarse-graining means that all information is extracted about the mutual relation of a given family of states. In the paper sufficient coarse-grainings are characterized in several equivalent ways and the non-commutative analogue of the factorization theorem is obtained. As an application we discuss exponential families. Our factorization theorem also implies two further important results, previously known only in finite Hilbert space dimension, but proved here in generality: the Koashi-Imoto theorem on maps leaving a family of states invariant, and the characterization of the general form of states in the equality case of strong subadditivity. Supported by the EU Research Training Network Quantum Probability with Applications to Physics, Information Theory and Biology and Center of Excellence SAS Physics of Information I/2/2005. Supported by the Hungarian grant OTKA T032662