Transition-Metal Catalysis of Triene 6π Electrocyclization: The π-Complexation Strategy Realized

Triene 6π electrocyclization, wherein a conjugated triene undergoes a concerted stereospecific cycloisomerization to a cyclohexadiene, is a reaction of great historical and practical significance. In order to circumvent limitations imposed by the normally harsh reaction conditions, chemists have long sought to develop catalytic variants based upon the activating power of metal–alkene coordination. Herein, we demonstrate the first successful implementation of such a strategy by utilizing [(C₅H₅)Ru(NCMe)₃]PF₆ as a precatalyst for the disrotatory 6π electrocyclization of highly substituted trienes that are resistant to thermal cyclization. Mechanistic and computational studies implicate hexahapto transition-metal coordination as responsible for lowering the energetic barrier to ring closure. This work establishes a foundation for the development of new catalysts for stereoselective electrocyclizations.     

Role of FTFSI Anion Asymmetry on Physical Properties of AFTFSI (A=Li,Na and K) Based Electrolytes and Consequences on Supercapacitor Application

This study compares the physicochemical properties of six electrolytes comprising of three salts: LiFTFSI, NaFTFSI and KFTFSI in two solvent mixtures, the binary (3EC/7EMC) and the ternary (EC/PC/3DMC). The transport properties (conductivity, viscosity) as a function of temperature and concentration were modeled using the extended Jones-Dole-Kaminsky equation, the Arrhenius model, and the Eyring theory of transition state for activated complexes. Results are discussed in terms of ionicity, solvation shell, and cross-interactions between electrolyte components. The application of the six formulated electrolytes in symmetrical activated carbon (AC)//AC supercapacitors (SCs) was characterized by cyclic voltammetry (CV), galvanostatic cycling with potential limitation (GCPL), electrochemical impedance spectroscopy (EIS) and accelerated aging. Results revealed that the geometrical flexibility of the FTFSI anion allows it to access and diffuse easily in AC whereas its counter ions (Li⁺, Na⁺ or K⁺) can remain trapped in porosity. However, this drawback was partially resolved by mixing LiFTFSI and KFTFSI salts in the electrolyte.     

Optical Trapping with Focused Surface Waves

Near-field optical trapping can be realized with focused evanescent waves that are excited at the water–glass interface due to the total internal reflection, or with focused plasmonic waves excited on the water–gold interface. Herein, the performance of these two kinds of near-field optical trapping techniques is compared using the same optical microscope configuration. Experimental results show that only a single-micron polystyrene bead can be trapped by the focused evanescent waves, whereas many beads are simultaneously attracted to the center of the excited region by focused plasmonic waves. This difference in trapping behavior is analyzed from the electric field intensity distributions of these two kinds of focused surface waves and the difference in trapping behavior is attributed to photothermal effects due to the light absorption by the gold film.     

Experimental Investigations on the Thermal Diffusion Characteristics and Photoluminescence in Multiphase Micro Fluids Containing ZnO Micro Tubes and Fluorescein Dye

Optics and Spectroscopy - Scattering of light by disordered structures is normally detrimental to their applicability in many optoelectronic devices. However, some micro and nanostructures are...     

Invariant discrete flows

In this paper, we investigate the evolution of joint invariants under invariant geometric flows using the theory of equivariant moving frames and the induced invariant discrete variational complex. For certain arc length preserving planar curve flows invariant under the special Euclidean group , the special linear group , and the semidirect group , we find that the induced evolution of the discrete curvature satisfies the differential‐difference mKdV, KdV, and Burgers' equations, respectively. These three equations are completely integrable, and we show that a recursion operator can be constructed by precomposing the characteristic operator of the curvature by a certain invariant difference operator. Finally, we derive the constraint for the integrability of the discrete curvature evolution to lift to the evolution of the discrete curve itself.     

A posteriori error estimation with finite element methods of lines for one-dimensional parabolic systems

Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP ^th -degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

Geometry of Differential Equations: A Concise Introduction

A short introduction to geometrical theory of nonlinear differential equations is given to provide a unified overview to the collection 'Symmetries of differential equations and related topics'.     

Polyhedral <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">2</Emphasis></Subscript>

 Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional case provides interesting classes of groups. Received: 13 December 2001 / Revised version: 24 June 2002 The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107 Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20