966 resultados para Harvard College (1636-1780).--Class of 1760.
Resumo:
New Mo(II) diimine derivatives of [Mo(q (3)allyl)X(CO)(2)(CH3CN)(2)] (allyl = C3H5 and C5H5O; X = Cl, Br) were prepared, and [MO(eta(3)-C3H5)Cl(CO)(2)(BIAN)] (BIAN = 1,4-(4-chloro)phenyl-2,3-naphthalene-diazabutadiene) (7) was structurally characterized by single-crystal X-ray diffraction. This complex adopted an equatorial-axial arrangement of the bidentate ligand (axial isomer), in contrast with the precursors, found as the equatorial isomer in the solid and fluxional in solution. The new complexes of the type [Mo(eta(3)-allyl)X(CO)(2)(N-N)l (N-N is a bidentate chelating dinitrogen ligand) were tested for the catalytic epoxidation of cyclooctene using tert-butyl hydroperoxide as oxidant. All catalytic systems were 100% selective toward epoxide formation. While their turnover frequencies paralleled those of related Mo(eta) carbonyl compounds or Mo(VI) compounds bearing similar N-donor ligands, they exhibited similar olefin conversions in consecutive catalytic runs. The acetonitrile precursors were generally more active than the diimine complexes, and the chloro derivatives more active than the bromo ones. Combined vibrational and NMR spectroscopy and computational studies (DFT) were used to investigate the nature of the molybdenum species formed in the catalytic system with [Mo(eta(3)-C3H5)Cl(CO)(2){1,4-(2,6-dimethyl)phenyl-2.3-dimethyldiazabuta diene}] (4) and to propose that the resulting species may be dimeric bearing oxide bridges.
Resumo:
Dendrimers and hyperbranched polymers are a relatively new class of materials with unique molecular architectures and dimensions in comparison to traditional linear polymers. This review details recent notable advances in the application of these new polymers in terms of the development of new polymeric delivery systems. Although comparatively young, the developing field of hyperbranched drug delivery devices is a rapidly maturing area and the key discoveries in drug-conjugate systems amongst others are highlighted. As a consequence of their ideal hyperbranched architectures, the utilisation of host-guest chemistries in dendrimers has been included within the scope of this review. (C) 2003 Elsevier Ltd. All rights reserved.
Resumo:
The synthesis of the first example of a new class of tetradentate reagents for the efficient separation of americium(Ill) and europium(111) is reported together with the structure of the complex formed with europium(III), (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
The first examples of sigmatropic rearrangements of ene-endo-spirocyclic, tetrahydropyridine-derived ammonium ylids are reported. Thus, spiro[6.7]-ylids rearrange primarily by a [2,3]-pathway, whereas the analogous [6.6]-ylids rearrange by [1,2]- and [2,3]-mechanisms in roughly equal proportions. This method serves as a rapid entry to the core of a range of alkaloids bearing a pyrrolo[1,2-a]azepine or octahydroindolizidine nucleus.
Resumo:
Chiral polyaromatic amide dendrimers incorporating a C-3-core have been prepared as potential catalysts for asymmetric reactions. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
From the reaction of tert-butyl lithium or n-butyl lithium with N-methylpyrrole (1a), furan (1b) or 2-bromo-thiophen (1c), 2-N-methylpyrrolyl lithium (2a), 2-furyl lithium (2b) or 2-thiophenyl lithium (2c), respectively, was obtained. When reacted with 6-(2-N-methylpyrrolyl) fulvene (3a), 6-(2-furyl) fulvene (3b) or 6-(2-thiophenyl) fulvene (3c), the corresponding lithiated intermediates were formed (4a-c). Titanocenes (5a-c) were obtained through transmetallation with titanium tetrachloride. When these titanocenes were tested against pig kidney epithelial (LLC-PK) cells, inhibitory concentrations (IC50) of 32 mu M, 140 mu M, and 240 mu M, respectively, were observed. These values represent improved cytotoxicity against LLC-PK, compared to their ansa-analogues. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.
Resumo:
In this paper, we initiate the study of a class of Putnam-type equation of the form x(n-1) = A(1)x(n) + A(2)x(n-1) + A(3)x(n-2)x(n-3) + A(4)/B(1)x(n)x(n-1) + B(2)x(n-2) + B(3)x(n-3) + B-4 n = 0, 1, 2,..., where A(1), A(2), A(3), A(4), B-1, B-2, B-3, B-4 are positive constants with A(1) + A(2) + A(3) + A(4) = B-1 + B-2 + B-3 + B-4, x(-3), x(-2), x(-1), x(0) are positive numbers. A sufficient condition is given for the global asymptotic stability of the equilibrium point c = 1 of such equations. (c) 2005 Elsevier Ltd. All rights reserved.
Resumo:
In this paper, we study the periodic oscillatory behavior of a class of bidirectional associative memory (BAM) networks with finite distributed delays. A set of criteria are proposed for determining global exponential periodicity of the proposed BAM networks, which assume neither differentiability nor monotonicity of the activation function of each neuron. In addition, our criteria are easily checkable. (c) 2005 Elsevier Inc. All rights reserved.
Resumo:
In this paper, we propose to study a class of neural networks with recent-history distributed delays. A sufficient condition is derived for the global exponential periodicity of the proposed neural networks, which has the advantage that it assumes neither the differentiability nor monotonicity of the activation function of each neuron nor the symmetry of the feedback matrix or delayed feedback matrix. Our criterion is shown to be valid by applying it to an illustrative system. (c) 2005 Elsevier Ltd. All rights reserved.
Resumo:
We analyze a fully discrete spectral method for the numerical solution of the initial- and periodic boundary-value problem for two nonlinear, nonlocal, dispersive wave equations, the Benjamin–Ono and the Intermediate Long Wave equations. The equations are discretized in space by the standard Fourier–Galerkin spectral method and in time by the explicit leap-frog scheme. For the resulting fully discrete, conditionally stable scheme we prove an L2-error bound of spectral accuracy in space and of second-order accuracy in time.
Resumo:
We prove that all the eigenvalues of a certain highly non-self-adjoint Sturm–Liouville differential operator are real. The results presented are motivated by and extend those recently found by various authors (Benilov et al. (2003) [3], Davies (2007) [7] and Weir (2008) [18]) on the stability of a model describing small oscillations of a thin layer of fluid inside a rotating cylinder.
Resumo:
In a previous paper (J. of Differential Equations, Vol. 249 (2010), 3081-3098) we examined a family of periodic Sturm-Liouville problems with boundary and interior singularities which are highly non-self-adjoint but have only real eigenvalues. We now establish Schatten class properties of the associated resolvent operator.
Resumo:
A technique is derived for solving a non-linear optimal control problem by iterating on a sequence of simplified problems in linear quadratic form. The technique is designed to achieve the correct solution of the original non-linear optimal control problem in spite of these simplifications. A mixed approach with a discrete performance index and continuous state variable system description is used as the basis of the design, and it is shown how the global problem can be decomposed into local sub-system problems and a co-ordinator within a hierarchical framework. An analysis of the optimality and convergence properties of the algorithm is presented and the effectiveness of the technique is demonstrated using a simulation example with a non-separable performance index.