951 resultados para Approximation en probabilité
Resumo:
(I)Lantadene-B: C35H52O5,M r =552.80, MonoclinicC2,a=25.65(1),b=6.819(9),c=18.75(1) Å,beta=100.61(9),V=3223(5) Å3,Z=4,D x =1.14 g cm–3 CuKagr (lambda=1.5418A),mgr=5.5 cm–1,F(000)=1208,R=0.118,wR=0.132 for 1527 observed reflections withF o ge2sgr(F o ). (II)Lantadene-C: C35H54O5·CH3OH,Mr=586.85, Monoclinic,P21,a=9.822(3),b=10.909(3),c=16.120(8)Å,beta=99.82(4),V=1702(1)Å3,Z=2,D x =1.145 g cm–3, MoKagr (lambda=0.7107Å), mgr=0.708 cm–1 F(000)=644,R=0.098, wR=0.094 for 1073 observed reflections. The rings A, B, C, D, and E aretrans, trans, trans, cis fused and are in chair, chair, sofa, half-chair, chair conformations, respectively, in both the structures. In the unit cell the molecules are stabilized by O-HctdotO hydrogen bonds in both the structures, however an additional C-HctdotO interaction is observed in the case of Lantadene-C.
Resumo:
Ground-state properties of the two-dimensional Hubbard model with point-defect disorder are investigated numerically in the Hartree-Fock approximation. The phase diagram in the p(point defect concentration)-delta(deviation from half filling) plane exhibits antiferromagnetic, spin-density-wave, paramagnetic, and spin-glass-like phases. The disorder stabilizes the antiferromagnetic phase relative to the spin-density-wave phase. The presence of U strongly enhances the localization in the antiferromagnetic phase. The spin-density-wave and spin-glass-like phases are weakly localized.
Resumo:
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.
Resumo:
We consider three dimensional finite element computations of thermoelastic damping ratios of arbitrary bodies using Zener's approach. In our small-damping formulation, unlike existing fully coupled formulations, the calculation is split into three smaller parts. Of these, the first sub-calculation involves routine undamped modal analysis using ANSYS. The second sub-calculation takes the mode shape, and solves on the same mesh a periodic heat conduction problem. Finally, the damping coefficient is a volume integral, evaluated elementwise. In the only other decoupled three dimensional computation of thermoelastic damping reported in the literature, the heat conduction problem is solved much less efficiently, using a modal expansion. We provide numerical examples using some beam-like geometries, for which Zener's and similar formulas are valid. Among these we examine tapered beams, including the limiting case of a sharp tip. The latter's higher-mode damping ratios dramatically exceed those of a comparable uniform beam.
Resumo:
We develop four algorithms for simulation-based optimization under multiple inequality constraints. Both the cost and the constraint functions are considered to be long-run averages of certain state-dependent single-stage functions. We pose the problem in the simulation optimization framework by using the Lagrange multiplier method. Two of our algorithms estimate only the gradient of the Lagrangian, while the other two estimate both the gradient and the Hessian of it. In the process, we also develop various new estimators for the gradient and Hessian. All our algorithms use two simulations each. Two of these algorithms are based on the smoothed functional (SF) technique, while the other two are based on the simultaneous perturbation stochastic approximation (SPSA) method. We prove the convergence of our algorithms and show numerical experiments on a setting involving an open Jackson network. The Newton-based SF algorithm is seen to show the best overall performance.
Resumo:
Preparation of the key intermediates, 11 and 21, required for the synthesis of (+/-)-allo-cedrol (khusiol) is reported by a novel methodology involving the substitution at the bridgehead position of 1-methoxybicyclo[2.2.2]oct-5-en-2-one derivatives
Resumo:
We develop in this article the first actor-critic reinforcement learning algorithm with function approximation for a problem of control under multiple inequality constraints. We consider the infinite horizon discounted cost framework in which both the objective and the constraint functions are suitable expected policy-dependent discounted sums of certain sample path functions. We apply the Lagrange multiplier method to handle the inequality constraints. Our algorithm makes use of multi-timescale stochastic approximation and incorporates a temporal difference (TD) critic and an actor that makes a gradient search in the space of policy parameters using efficient simultaneous perturbation stochastic approximation (SPSA) gradient estimates. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal policy. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Birch reduction of 8,9-didehydroestradiol-17 beta 3-methyl ether 1 or 9(11)-didehydroestradiol-17 beta 3-methyl ether 2 followed by acid hydrolysis results in a mixture of 19-nortestosterone 8 and 19-nor-9 beta, 10 alpha-testosterone 9 in varying amounts. However, reduction of their acetates with sodium or lithium, tert-butyl alcohol in liquid ammonia and in the presence of aniline affords exclusively 19-nortestosterone. Similarly, 18a-homo-19-nortestosterone 12 is prepared from the acetate of 18a-homoestradiol-17 beta 3-methyl ether, 10.
Resumo:
Generation of the thermodynamic dienolate of 9-bromocarvone derivatives 5, 7 and 11 furnished the chiral bicycle[2.2.2] octenones 6, 8 and 9 and 12 and 13 containing a bridgehead methyl group via an intramolecular alkylation reaction. In an analogous manner intramolecular alkylation reaction of the bromo enones 15a-e, obtained from carvone 2 by 1,3-alkylative enone transposition (-->14) followed by a regiospecific bromoetherification reaction, furnished the bicyclo[2.2.2]oct-5-en-2-ones 16a-e and 17a-e.
Resumo:
Acid-catalysed thermal rearrangement of 4-aryl-4-methylhex-5-en-2-ones (products of the Claisen rearrangement of beta-methylcinnamyl alcohols and 2-methoxypropene) to isomeric 5-aryl-4-methylhex-5-en-2-ones via an intramolecular ene reaction of the enol tautomer followed by a retro ene reaction of the resultant acetylcyclopropane is described. Formation of the known diketone 13 via the ozonolysis of the rearrangement product 10, confirmed the structures of the rearranged enones, whereas formation of the enone 15 containing an extra methyl group on the styrene double bond confirmed the proposed mechanism. Finally, the rearrangement has been extended to the formal synthesis of beta-cuparenone 20 via the enones 22 and 23.
Resumo:
A two timescale stochastic approximation scheme which uses coupled iterations is used for simulation-based parametric optimization as an alternative to traditional "infinitesimal perturbation analysis" schemes, It avoids the aggregation of data present in many other schemes. Its convergence is analyzed, and a queueing example is presented.