Nucleophilic substitution of ferrocenyl alcohols catalyzed by bismuth(III) in aqueous medium at room temperature

A nucleophilic substitution reaction of an α‐ferrocenyl alcohol with various amines, indoles and thiols was successfully developed by using a catalytic amount of Bi(NO₃)₃.5H₂O at room temperature without the aid of phase transfer catalyst. The reactions proceeded in aqueous media, leading to the formation of new C=C, C=N and C=S bonds bearing ferrocenyl substituent with high efficiency. Copyright © 2012 John Wiley & Sons, Ltd.     

Optimal convex hull algorithms on enhanced meshes

In this paper we propose time-optimal convex hull algorithms for two classes of enhanced meshes. Our first algorithm computes the convex hull of an arbitrary set ofn points in the plane inO (logn) time on a mesh with multiple broadcasting of sizen×n. The second algorithm shows that the same problem can be solved inO (1) time on a reconfigurable mesh of sizen×n. Both algorithms achieve time lower bounds for their respective model of computation.This work was supported by NASA under grant NCCI-99.Additional support by the National Science Foundation under grant CCR-8909996 is gratefully acknowledged.     

Reconstructing visible regions from visible segments

An algorithm is presented for reconstructing visible regions from visible edge segments in object space. This has applications in hidden surface algorithms operating on polyhedral scenes and in cartography. A special case of reconstruction can be formulated as a graph problem: Determine the faces of a straight-edge planar graph given in terms of its edges. This is accomplished inO(n logn) time using linear space for a graph withn edges, and is worst-case optimal. The graph may have separate components but the components must not contain each other. The general problem of reconstruction is then solved by applying our algorithm to each component in the containment relation.Research of this author is supported by the National Science Foundation under grant no. ECS-8351942, and by the Schlumberger-Doll Research Labs, Ridgefield, Connecticut.     

Structural transformation and oxidation of Sr2MnO3.5+x determined by in-situ neutron powder diffraction

The oxidation of the n = 1 Ruddlesden-Popper phase, Sr₂MnO_3.5+x, where 0 ≤ x ≤ 0.5 has been investigated using a combination of in-situ diffraction techniques. In agreement with previous reports the room temperature structure of Sr₂MnO_3.5+x was determined to be monoclinic crystallising in space group P2₁/c. On heating in air the material undergoes rapid oxidation at a relatively modest temperature, ∼275 °C. The oxidation process is coincident with a significant change in the structure, with the material now adopting a tetragonal I4/mmm structure. In the oxygen deficient phase where x > 0 the Mn coordination is square pyramidal, with a sixth partially occupied oxygen position giving rise to octahedral coordination. Oxidation of Sr₂MnO_3.5+x results in the filling of the partially occupied O4 positions and a resulting increase in symmetry, with the Mn coordination now adopting solely a distorted octahedral environment.     

两步熔盐法制备片状NaNbO3晶体

以分析纯Bi2O3、Na2CO3和Nb2O5为原料,采用两步熔盐法合成出片状NaNbO3.首先以NaCl为熔盐,在1100 ℃保温3 h合成出片状中间体Bi2.5Na3.5Nb5O18(简称BNN5)晶粒;然后以BNN5为模板晶粒,以NaCl为熔盐,在950 ℃保温3 h制备出片状NaNbO3.通过XRD和SEM分析表明:所制备的NaNbO3晶体为纯钙钛矿相,NaNbO3晶粒呈各向异性片状,其边长约为12 μm,厚约为0.6 μm,并探讨了BNN5转变为片状形貌NaNbO3形成机理.     

微波法制备3.5G PAMAM树状大分子保护的金纳米粒子

以3.5 G PAMAM(3.5代聚酰胺-胺型)树状大分子为保护剂,利用微波法还原HAuCl₄溶液制备金纳米粒子.考察了当3.5 G PAMAM与HAuCl₄物质的量的比一定时,微波照射不同时间对金纳米粒子大小及形状的影响;以及同一照射条件下,3.5 G PAMAM与HAuCl₄不同的物质的量比值对金纳米粒子大小及形状的影响.利用紫外可见分光光度计、透射电子显微镜对其进行了表征.结果表明,当3.5 G PAMAM与HAuCl₄物质的量的比值一定时,金纳米粒子的形状和大小受微波照射时间长短的影响不大;适当延长照射时间,制得的金纳米粒子的分散性较好.在相同照射条件下,随着3.5 G PAMAM与HAu-Cl₄物质的量比值的减小,得到的金纳米粒子粒径逐渐变大,且分散性变差.     

MIDI! basis set for silicon, bromine, and iodine

The MIDI! basis set is extended to three new atoms: silicon, bromine, and iodine. The basis functions for these heteroatoms are developed from the standard 3-21G basis set by adding one Gaussian-type d subshell to each Si, Br, or I atom. The exponents of the d functions are optimized to minimize errors in the geometries and charge distributions that these basis functions yield when they are used in Hartree-Fock calculations with all atoms represented by the MIDI! basis. The MIDI! basis is defined to use five spherical d functions in a d subshell. We present a detailed comparison of such calculations to calculations employing six Cartesian d functions in each d subshell; these studies show that 5D and 6D options give very similar results for molecular geometries and dipole moments, not only for compounds containing Si, Br, and I but also for compounds containing N, O, F, P, S, and Cl. The MIDI! basis set is also tested successfully for hypervalent Si compounds. Received: 7 January 1998 / Accepted: 7 January 1998     

Applications of a semi-dynamic convex hull algorithm

We obtain new results for manipulating and searching semi-dynamic planar convex hulls (subject to deletions only), and apply them to derive improved bounds for two problems in geometry and scheduling. The new convex hull results are logarithmic time bounds for set splitting and for finding a tangent when the two convex hulls are not linearly separated. Using these results, we solve the following two problems optimally inO(n logn) time: (1) [matching] givenn red points andn blue points in the plane, find a matching of red and blue points (by line segments) in which no two edges cross, and (2) [scheduling] givenn jobs with due dates, linear penalties for late completion, and a single machine on which to process them, find a schedule of jobs that minimizes the maximum penalty.     

An efficient and numerically correct algorithm for the 2D convex hull problem

An efficient and numerically correct program called FastHull for computing the convex hulls of finite point sets in the plane is presented. It is based on the Akl-Toussaint algorithm and the MergeHull algorithm. Numerical correctness of the FastHull procedure is ensured by using special routines for interval arithmetic and multiple precision arithmetic. The FastHull algorithm guaranteesO(N logN) running time in the worst case and has linear time performance for many kinds of input patterns. It appears that the FastHull algorithm runs faster than any currently known 2D convex hull algorithm for many input point patterns.