Identification of active sites on supported metal catalysts with carbon nanotube hydrogen highways

Catalysts consisting of metal particles supported on reducible oxides exhibit promising activity and selectivity for a variety of current and emerging industrial processes. Enhanced catalytic activity can arise from direct contact between the support and the metal or from metal-induced promoter effects on the oxide. Discovering the source of enhanced catalytic activity and selectivity is challenging, with conflicting arguments often presented based on indirect evidence. Here, we separate the metal from the support by a controlled distance while maintaining the ability to promote defects via the use of carbon nanotube hydrogen highways. As illustrative cases, we use this approach to show that the selective transformation of furfural to methylfuran over Pd/TiO2 occurs at the Pd-TiO2 interface while anisole conversion to phenol and cresol over Cu/TiO2 is facilitated by exposed Ti3+ cations on the support. This approach can be used to clarify many conflicting arguments in the literatureWe acknowledge financial support from the National Science Foundation, Grant CAREER1653935. Use of the Advanced Photon Source is supported by the U.S. Department of Energy, Office of Science, and Office of Basic Energy Sciences, under Contract DE-AC02-06CH11357. MRCAT operations are supported by the Department of Energy and the MRCAT member institutions. E.C.W. and J.T.M. were supported in part by Center for Innovative Transformation of Alkane Resources (CISTAR) by the National Science Foundation under Cooperative Agreement No. EEC-1647722. Open access fees fees for this article provided whole or in part by OU Libraries Open Access Fund.Ye

New Public-key Cryptosystem Using Braid Groups

Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups can serve as a good source to enrich cryptography. The feature that makes the braid groups useful to cryptography includes the followings: (i) The word problem is solved via a fast algorithm which computes the canonical form which can be efficiently manipulated by computers. (ii) The group operations can be performed efficiently. (iii) The braid groups have many mathematically hard problems that can be utilized to design cryptographic primitives. The other is to propose and implement a new key agreement scheme and public key cryptosystem based on these primitives in the braid groups. The efficiency of our systems is demonstrated by their speed and information rate. The security of our systems is based on topological, combinatorial and group-theoretical problems that are intractible according to our current mathematical knowledge. The foundation of our systems is quite different from widely used cryptosystems based on number theory, but there are some similarities in design. Key words: public key cryptosystem, braid group, conjugacy problem, key exchange, hard problem, non-commutative group, one-way function, public key infrastructure