Carboxyl-cored dendrimer and toluene-assisted fabrication of uniform platinum nanodendrites at a water/oil interface and their potential application as a catalyst

Uniform platinum nanodendrites have been prepared at a water/oil interface by a facile catalyst-free method at room temperature. This is carried out by introducing NaBH4 into the platinum precursor solution in the presence of the second generation of carboxyl-cored dendrimer ([G-2]-CO2H dendrimer) and toluene to act as a protective agent and a linker, respectively. The average fractal dimension of 1.61 of the obtained platinum nanodendrites is calculated by analysing the transmission electron micrographs using the programs Fractal Dimension Version 1.1 and Fractal Dimension Calculator. Control experiments show that the fabrication of platinum nanodendrites can be operated with a wide parameter window, which undoubtedly raises the degree of control of the synthesis process. The potential application of such a nanostructure as a catalyst is investigated, and the results reveal that they show highly efficient catalytic properties for the typical redox reaction between hexacyanoferrate (III) and thiosulfate ions at 301 K.

CRYSTALLINITY OF UNIFORM OLIGO(OXYETHYLENE) MONO-N-ALKYL ETHERS STUDIED BY X-RAY-DIFFRACTION AND DIFFERENTIAL SCANNING CALORIMETRY

The crystallinity of two series of uniform oligo(oxyethylene) mono-n-alkyl ethers has been investigated: alpha-alkyl,omega-hydroxyoligo(oxyethylene)s, H(CH2)n(OCH2CH2)mOH, and alpha-alkyl,omega-methoxyoligo(oxyethylene)s, H(CH2)n(OCH2CH2)mOCH3. The hydroxy-ended oligomers formed bilayer crystals, and the methoxy-ended oligomers formed monolayer crystals. The helical oxyethylene blocks were oriented normal to the layer-crystal end-group plane, whilst the trans-planar alkyl blocks were generally tilted at an angle delta = 60-degrees. The melting temperature and enthalpy of fusion were higher for hydroxy-ended oligomers than for corresponding methoxy-ended oligomers.

Strongly nonlinear long interfacial waves in uniform basic flows and their dispersion relationship

In this paper, long interfacial waves of finite amplitude in uniform basic flows are considered with the assumption that the aspect ratio between wavelength and water depth is small. A new model is derived using the velocities at arbitrary distances from the still water level as the velocity variables instead of the commonly used depth-averaged velocities. This significantly improves the dispersion properties and makes them applicable to a wider range of water depths. Since its derivation requires no assumption on wave amplitude, the model thus can be used to describe waves with arbitrary amplitude.

Second-order solutions for random interfacial waves under steady uniform currents

In the present research, the study of Song (2004) for random interfacial waves in two-layer fluid is extended to the case of fluids moving at different steady uniform speeds. The equations describing the random displacements of the density interface and the associated velocity potentials in two-layer fluid are solved to the second order, and the wave-wave interactions of the wave components and the interactions between the waves and currents are described. As expected, the extended solutions include those obtained by Song (2004) as one special case where the steady uniform currents of the two fluids are taken as zero, and the solutions reduce to those derived by Sharma and Dean (1979) for random surface waves if the density of the upper fluid and the current of the lower fluid are both taken as zero.

Second-order solutions for random interfacial waves in N-layer density-stratified fluid with steady uniform currents

In the present paper, the random inter facial waves in N-layer density-stratified fluids moving at different steady uniform speeds are researched by using an expansion technique, and the second-order a symptotic solutions of the random displacements of the density interfaces and the associated velocity potentials in N-layer fluid are presented based on the small amplitude wave theory. The obtained results indicate that the wave-wave second-order nonlinear interactions of the wave components and the second-order nonlinear interactions between the waves and currents are described. As expected, the solutions include those derived by Chen (2006) as a special case where the steady uniform currents of the N-layer fluids are taken as zero, and the solutions also reduce to those obtained by Song (2005) for second-order solutions for random interfacial waves with steady uniform currents if N=2.

XRD and XPS studies on the ultra-uniform Raney-Ni catalyst prepared from the melt-quenching alloy

We present a novel method for preparing an ultra-uniform Raney-Ni catalyst, which includes melt-quenching, hydrogen treatment and leaching in an alkali solution. The resultant catalyst shows superior activity in the reaction of cyclohexanone hydrogenation. X-ray diffraction (XRD) and XPS have been employed to characterize the catalysts. As demonstrated, the pretreatment with hydrogen caused a distinct phase transfer of the Ni-Al alloys, forming more of the Ni2Al3 component. In the subsequent leaching process, the Ni2Al3 component shows high activity and the resultant catalyst exhibits high surface areas and small pores. Moreover, metallic Al in the hydrogen-pretreated alloy appeared to be leached more easily and thus the aluminium species remaining on the catalyst surface is aluminium oxide predominantly, which serves as a matrix to stabilize active Ni species on the surface. Copyright (C) 2001 John Wiley & Sons, Ltd.

Controlled growth of uniform silver clusters on HOPG

We have investigated growth of silver clusters on three different, i.e. normally cleaved, thermally oxidized and Ar+ ion sputtered highly oriented pyrolytic graphite (HOPG), surfaces. Scanning tunneling microscopy (STM) observations reveal that uniformly sized and spaced Ag clusters only form on the sputtered surface. Ar+ sputtering introduces relatively uniform surface defects compared to other methods. These defects are found to serve as preferential sites for Ag cluster nucleation, which leads to the formation of uniform clusters. (c) 2005 Elsevier B.V. All rights reserved.

Approximately Uniform Random Sampling in Sensor Networks

Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately, our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.

Ergodicity and Mixing Rate of One-Dimensional Cellular Automata

One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. The latter either have large noise probability ε or belong to the small family of two-state nearest-neighbor monotonic rules which includes local majority voting. For a certain simple automaton L called the soldiers rule, this problem has intrigued researchers for the last two decades since L is clearly more robust than local voting: in the absence of noise, L eliminates any finite island of perturbation from an initial configuration of all 0's or all 1's. The same holds for a 4-state monotonic variant of L, K, called two-line voting. We will prove that the probabilistic cellular automata Kε and Lε asymptotically lose all information about their initial state when subject to small, strongly biased noise. The mixing property trivially implies that the systems are ergodic. The finite-time information-retaining quality of a mixing system can be represented by its relaxation time Relax(⋅), which measures the time before the onset of significant information loss. This is known to grow as (1/ε)^c for noisy local voting. The impressive error-correction ability of L has prompted some researchers to conjecture that Relax(Lε) = 2^(c/ε). We prove the tight bound 2^(c1log^21/ε) ＜ Relax(Lε) ＜ 2^(c2log^21/ε) for a biased error model. The same holds for Kε. Moreover, the lower bound is independent of the bias assumption. The strong bias assumption makes it possible to apply sparsity/renormalization techniques, the main tools of our investigation, used earlier in the opposite context of proving fault-tolerance.

Entropy Loss is Maximal for Uniform Inputs

A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : if w comes from a distribution of entropy m, then a secure sketch guarantees that the distribution of w conditioned on s has entropy m˜ , where λ = m−m˜ is called the entropy loss. In this note we show that the entropy loss of any secure sketch (or, more generally, any randomized algorithm) on any distribution is no more than it is on the uniform distribution.

Non-Uniform Reductions

We study properties of non-uniform reductions and related completeness notions. We strengthen several results of Hitchcock and Pavan and give a trade-off between the amount of advice needed for a reduction and its honesty on NEXP. We construct an oracle relative to which this trade-off is optimal. We show, in a more systematic study of non-uniform reductions, that among other things non-uniformity can be removed at the cost of more queries. In line with Post's program for complexity theory we connect such 'uniformization' properties to the separation of complexity classes.

Computing a Uniform Scaling Parameter for 3D Registration of Lung Surfaces

A difficulty in lung image registration is accounting for changes in the size of the lungs due to inspiration. We propose two methods for computing a uniform scale parameter for use in lung image registration that account for size change. A scaled rigid-body transformation allows analysis of corresponding lung CT scans taken at different times and can serve as a good low-order transformation to initialize non-rigid registration approaches. Two different features are used to compute the scale parameter. The first method uses lung surfaces. The second uses lung volumes. Both approaches are computationally inexpensive and improve the alignment of lung images over rigid registration. The two methods produce different scale parameters and may highlight different functional information about the lungs.