Raspberry-like Hierarchical Au/Pt Nanoparticle Assembling Hollow Spheres with Nanochannels: An Advanced Nanoelectrocatalyst for the Oxygen Reduction Reaction

In this contribution, we for the first time report the synthesis of raspberry-like hierarchical Au/Pt nanoparticle (NP) assembling hollow spheres (RHAHS) with pore structure and complex morphology through one in situ sacrificial template approach without any post-treatment procedure. This method has some clear advantages including simplicity, quickness, high quality, good reproducibility, and no need of a complex post-treatment process (removing templating). Furthermore, the present method could be extended to other metal-based NP assembling hollow spheres. Most importantly, the as-prepared RHAHS exhibited excellent electrocatalytic activity for oxygen reduction reaction (ORR). For instance, the present RHAHS-modified electrode exhibited more positive potential (the half-wave potential at about 0.6 V), higher specific activity, and higher mass activity for ORR than that of commercial platinum black (CPB). Rotating ring-disk electrode (RRDE) voltarnmetry demonstrated that the RHAHS-modified electrode could almost catalyze a four-electron reduction of O-2 to H2O in a 0.5 M air-saturated H2SO4 solution.

Nucleobase-metal hybrid materials: Preparation of submicrometer-scale, spherical colloidal particles of adenine-gold(III) via a supramolecular hierarchical self-assembly approach

We report a simple and effective supramolecular route for facile synthesis of submicrometer-scale, hierarchically self-assembled spherical colloidal particles of adenine - gold(III) hybrid materials at room temperature. Simple mixture of the precursor aqueous solutions of adenine and HAuCl4 at room temperature could result in spontaneous formation of the hybrid colloidal particles. Optimization of the experimental conditions could yield uniform-sized, self-assembled products at 1:4 molar ration of adenine to HAuCl4. Transmission electron microscopy results reveal the formation of hierarchical self-assembled structure of the as-prepared colloidal particles. Concentration dependence, ratio dependence, time dependence, and kinetic measurements have been investigated. Moreover, spectroscopic evidence [i.e., Fourier transform infrared (FTIR) and UV-vis spectra and wide-angle X-ray scattering data] of the interaction motives causing the formation of the colloidal particles is also presented.

Precursor induced synthesis of hierarchical nanostructured ZnO

As-synthesized ZnO nanostructures with a bladed bundle-like architecture have been fabricated from a flower-like precursor ZnO (.) 0.33ZnBr(2) (.) 1.74H(2)O via a mechanism of dissolution - recrystallization. Experimental conditions, such as initial reactants and reaction time, are examined. The results show that no bladed bundle-like ZnO hierarchical nanostructures can be obtained by using the same molar amount of other zinc salts, such as ZnBr2, instead of the flower-like ZnO (.) 0.33ZnBr(2) (.) 1.74H(2)O precursor, and keeping other conditions unchanged. The products were characterized by field emission scanning electron microscopy (FE-SEM) and transmission electron microscopy (TEM). The ZnO nanostructures are mainly composed of nanowires with a diameter around 40 - 50 nm and length up to 1.5 - 2.5 mu m. Meanwhile, ZnO nanoflakes with a thickness of about 4 - 5 nm attached to the surface of ZnO nanowires with a preferred radially aligned orientation. Furthermore, the photoluminescence (PL) measurements exhibited the unique white-light-emitting characteristic of hierarchical ZnO nanostructures. The emission spectra cover the whole visible region from 380 to 700 nm.

A NEW SCHEME FOR ASSIGNMENT OF A CANONICAL CONNECTION TABLE

A new algorithm for deriving canonical numbering of atoms in a molecular graph has been developed. Some graph invariants, such as node properties, degree (connectivity), topological path, the smallest node ring index, etc., are encoded together to partit

Towards an Example-Based Image Compression Architecture for Video-Conferencing

This paper consists of two major parts. First, we present the outline of a simple approach to very-low bandwidth video-conferencing system relying on an example-based hierarchical image compression scheme. In particular, we discuss the use of example images as a model, the number of required examples, faces as a class of semi-rigid objects, a hierarchical model based on decomposition into different time-scales, and the decomposition of face images into patches of interest. In the second part, we present several algorithms for image processing and animation as well as experimental evaluations. Among the original contributions of this paper is an automatic algorithm for pose estimation and normalization. We also review and compare different algorithms for finding the nearest neighbors in a database for a new input as well as a generalized algorithm for blending patches of interest in order to synthesize new images. Finally, we outline the possible integration of several algorithms to illustrate a simple model-based video-conference system.

A Perturbation Scheme for Spherical Arrangements with Application to Molecular Modeling

We describe a software package for computing and manipulating the subdivision of a sphere by a collection of (not necessarily great) circles and for computing the boundary surface of the union of spheres. We present problems that arise in the implementation of the software and the solutions that we have found for them. At the core of the paper is a novel perturbation scheme to overcome degeneracies and precision problems in computing spherical arrangements while using floating point arithmetic. The scheme is relatively simple, it balances between the efficiency of computation and the magnitude of the perturbation, and it performs well in practice. In one O(n) time pass through the data, it perturbs the inputs necessary to insure no potential degeneracies and then passes the perturbed inputs on to the geometric algorithm. We report and discuss experimental results. Our package is a major component in a larger package aimed to support geometric queries on molecular models; it is currently employed by chemists working in "rational drug design." The spherical subdivisions are used to construct a geometric model of a molecule where each sphere represents an atom. We also give an overview of the molecular modeling package and detail additional features and implementation issues.

Revised Report on the Algorithmic Language Scheme

Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the Lambda Order they are all first-class. One thing to name them all, one things to define them, one thing to place them in environments and bind them, in the Lambda Order they are all first-class. Keywords: Scheme, Lisp, functional programming, computer languages.

MIT Scheme Reference Manual

MIT Scheme is an implementation of the Scheme programming language that runs on many popular workstations. The MIT Scheme Reference Manual describes the special forms, procedures, and datatypes provided by the implementation for use by application programmers.

Hierarchical Shape Description of Objects by Selection and Modification of Prototypes

An approach towards shape description, based on prototype modification and generalized cylinders, has been developed and applied to the object domains pottery and polyhedra: (1) A program describes and identifies pottery from vase outlines entered as lists of points. The descriptions have been modeled after descriptions by archeologists, with the result that identifications made by the program are remarkably consisten with those of the archeologists. It has been possible to quantify their shape descriptors, which are everyday terms in our language applied to many sorts of objects besides pottery, so that the resulting descriptions seem very natural. (2) New parsing strategies for polyhedra overcome some limitations of previous work. A special feature is that the processes of parsing and identification are carried out simultaneously.

RABBIT: A Compiler for SCHEME

We have developed a compiler for the lexically-scoped dialect of LISP known as SCHEME. The compiler knows relatively little about specific data manipulation primitives such as arithmetic operators, but concentrates on general issues of environment and control. Rather than having specialized knowledge about a large variety of control and environment constructs, the compiler handles only a small basis set which reflects the semantics of lambda-calculus. All of the traditional imperative constructs, such as sequencing, assignment, looping, GOTO, as well as many standard LISP constructs such as AND, OR, and COND, are expressed in macros in terms of the applicative basis set. A small number of optimization techniques, coupled with the treatment of function calls as GOTO statements, serve to produce code as good as that produced by more traditional compilers. The macro approach enables speedy implementation of new constructs as desired without sacrificing efficiency in the generated code. A fair amount of analysis is devoted to determining whether environments may be stack-allocated or must be heap-allocated. Heap-allocated environments are necessary in general because SCHEME (unlike Algol 60 and Algol 68, for example) allows procedures with free lexically scoped variables to be returned as the values of other procedures; the Algol stack-allocation environment strategy does not suffice. The methods used here indicate that a heap-allocating generalization of the "display" technique leads to an efficient implementation of such "upward funargs". Moreover, compile-time optimization and analysis can eliminate many "funargs" entirely, and so far fewer environment structures need be allocated at run time than might be expected. A subset of SCHEME (rather than triples, for example) serves as the representation intermediate between the optimized SCHEME code and the final output code; code is expressed in this subset in the so-called continuation-passing style. As a subset of SCHEME, it enjoys the same theoretical properties; one could even apply the same optimizer used on the input code to the intermediate code. However, the subset is so chosen that all temporary quantities are made manifest as variables, and no control stack is needed to evaluate it. As a result, this apparently applicative representation admits an imperative interpretation which permits easy transcription to final imperative machine code. These qualities suggest that an applicative language like SCHEME is a better candidate for an UNCOL than the more imperative candidates proposed to date.

Explicit representation of subgrid heterogeneity in a GCM land-surface scheme

Essery, R L H, Best, M J, Betts, R A, Cox, P M & Taylor, C M, Explicit representation of subgrid heterogeneity in a GCM land-surface scheme. Journal of Hydrometeorology 4, pp 530-543 (2003).