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.     

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...     

Solid‐state 31P NMR investigation on the status of guanine nucleotides in paclitaxel‐stabilized microtubules

Microtubule dynamics is a target for many chemotherapeutic drugs. In order to understand the biochemical effects of paclitaxel on the GTPase activity of tubulin, the status of guanine nucleotides in microtubules was investigated by ³¹P cross‐polarization magic angle spinning (CPMAS) NMR. Microtubules were freshly prepared in vitro in the presence of paclitaxel and then lyophilized in sucrose buffer for solid‐state NMR experiments. A ³¹P CPMAS NMR spectrum with the SNR of 25 was successfully acquired from the lyophilized microtubule sample. The broadness of the ³¹P spectral lines in the spectrum indicates that the molecular environments around the guanine nucleotides inside tubulin may not be as crystalline as reported by many diffraction studies. Deconvolution of the spectrum into four spectral components was carried out in comparison with the ³¹P NMR spectra obtained from five control samples. The spectral analysis suggested that about 13% of the nucleotides were present as GTP and 37% as GDP in the β‐tubulin (E‐site) of the microtubules. It was found that most of the GDPs were present as GDP‐P_i complex in the microtubules, which seems to be one of the effects of paclitaxel binding. Copyright © 2015 John Wiley & Sons, Ltd.     

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     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

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