635 resultados para Acyclic ketones


Relevância:

70.00% 70.00%

Publicador:

Resumo:

A general and simple methodology for spirocyclopentannulation of cyclic ketones (or 4,4-disubstituted cyclopentenones from acyclic ketones) and its application in the synthesis of the spirodienone 7 via a prochiral precursor constituting a formal total synthesis of (+/-)-acorone (6), are described.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

A series of novel naphthyridine derivatives 3 and 4 was prepared from substituted pyridine 2 and ketones using ZnCl2 as catalyst under microwave irradiation conditions. All the compounds were evaluated for AChE inhibitory activity and promising compounds 3d, 3e, 4b, and 4g was identified. Representative compounds 3d and 3e were found to show insignificant THLE-2 liver cell viability/toxicity. The binding mode between X-ray crystal structure of human AChE and compounds was studied using molecular docking method and fitness scores were found to be in good correlation with the activity data.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

Aqueous 2,2-dimethoxyacetaldehyde (60% wt solution) is used as an acceptor in aldol reactions, with cyclic and acyclic ketones and aldehydes as donors, organocatalyzed by 10 mol % of N-tosyl-(Sa)-binam-l-prolinamide [(Sa)-binam-sulfo-l-Pro] at rt under solvent-free conditions. The corresponding monoprotected 2-hydroxy-1,4-dicarbonyl compounds are obtained in good yields and with high levels of diastereo- and enantioselectivity mainly as anti-aldols. In the case of 4-substituted cyclohexanones a desymmetrization process takes place to mainly afford the anti,anti-aldols. 2,2-Dimethyl-1,3-dioxan-5-one allows the synthesis of a useful intermediate for the preparation of carbohydrates in higher yield, de and ee than with l-Pro as the organocatalyst.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

N-(3-Halogenopropyl)-4-phenylazetidin-2-ones undergo amination in liquid ammonia followed by transamidative ring expansion to give the eight-membered 4-phenyl -1,5-diazacyclooctan-2-one in excellent yield. Ring expansion of the amines in liquid ammonia is found to be much more effective than in hydrocarbon solvents. Formation of 7-, 8-, and 9-membered azalactams from the requisite -halogenoalkyl--lactams is an excellent synthetic process, though it is not applicable to 10membered rings. In the cases of rings of 13-, 15- and 17-members, although amination and apparent expansion takes place, the large rings appear not to be stable to ammonia and the final products are acyclic amides. N-[4-Halogenobut-2(Z)-enyl]-4-phenylazetidin-2-one satisfactorily forms a 9-membered (Z)-olefinic azalactam, but the (E)-isomer gives an acyclic amino amide. By using alkyl-substituted -lactam side-chains, C-substituted medium rings can be obtained; the relative instability of N-acyl -lactams to ammonia, however, leads to acylamino amides rather than expanded rings.Employing ethylamine in place of ammonia, it is shown that N-ethylated azalactams are formed satisfactorily, and using allylamine, N-allyl medium rings capable of further elaboration are obtained. The chemistry of these systems is discussed. Using transamidation in liquid ammonia, a short synthesis of the 9-membered spermidine alkaloid (±)-dihydroperiphylline is reported. Synthesis of key intermediates, whose transformation into the 13-membered alkaloids of the celabenzine group has already been effected, has been carried out.X-Ray single-crystal structure determinations for 4-phenyl-1,5-diazacyclononan-2-one, trans-4-phenyl-8-methyl-1,5-diazacyclooctan-2-one and (Z)-4-phenyl-1,5-diazacyclonon-7-en-2-one are reported, and comment is made on certain conformational features.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a behavioral equivalence notion that preserves the observed concurrency of tasks in equivalent process models. The article gives a full characterization of the subclass of acyclic process models that have no equivalent well-structured representation, but do have an equivalent maximally-structured one, as well as proposes a complete structuring method. Together with our previous results, this article completes the solution of the process model structuring problem for the class of acyclic process models.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article studies the problem of transforming a process model with an arbitrary topology into an equivalent well-structured process model. While this problem has received significant attention, there is still no full characterization of the class of unstructured process models that can be transformed into well-structured ones, nor an automated method for structuring any process model that belongs to this class. This article fills this gap in the context of acyclic process models. The article defines a necessary and sufficient condition for an unstructured acyclic process model to have an equivalent well-structured process model under fully concurrent bisimulation, as well as a complete structuring method. The method has been implemented as a tool that takes process models captured in the BPMN and EPC notations as input. The article also reports on an empirical evaluation of the structuring method using a repository of process models from commercial practice.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recently, a new approach for structuring acyclic process models has been introduced. The algorithm is based on a transformation between the Refined Process Structure Tree (RPST) of a control flow graph and the Modular Decomposition Tree (MDT) of ordering relations. In this paper, an extension of the algorithm is presented that allows to partially structure process models in the case when a process model cannot be structured completely. We distinguish four different types of unstructuredness of process models and show that only two are possible in practice. For one of these two types of unstructuredness an algorithm is proposed that returns the maximally structured representation of a process model.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper addresses the problem of transforming a process model with an arbitrary topology into an equivalent well-structured process model. While this problem has received significant attention, there is still no full characterization of the class of unstructured process models that can be transformed into well-structured ones, nor an automated method to structure any process model that belongs to this class. This paper fills this gap in the context of acyclic process models. The paper defines a necessary and sufficient condition for an unstructured process model to have an equivalent structured model under fully concurrent bisimulation, as well as a complete structuring method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

By definition, the two faces of a pi bond are equivalent.1 However, they are rendered nonequivalent in most molecules because of the absence of a plane of symmetry encompassing the double bond and the adjacent substituents. As a result, additions to trigonal centers from the two faces need not be equally facile. Exploiting this stereodifferentiation in a controlled manner represents one of the core problems in organic synthesis. Evidently, the factors which determine such diastereoselection need to be delineated in as much detail as possible.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A one step, clean and efficient, conversion of arylaldehydes, ketones and ketals into the corresponding hydrocarbon using ionic hydrogenation conditions employing sodium cyanoborohydride in the presence of two to three equivalents of BF3. OEt(2) is described.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Rat lung microsomes were shown to �-hydroxylate acyclic monoterpene alcohols in the presence of NADPH and O2. NADH could neither support hydroxylation efficiently nor did it show synergistic effect. The hydroxylase activity was greater in microsomes prepared from β-naphthoflavone (BNF)-treated rats than from phenobarbital (PB)-treated or control microsomal preparations. Hydroxylation was specific to the C-8 position in geraniol and has a pH optimum of 7.8. The inhibition of the hydroxylase activity by SKF-525A, CO, N-ethylmaleimide, ellipticine, α-naphthoflavone, cyt. Image and p-CMB indicated the involvement of the cyt. P-450 system. However, NaN3 stimulated the hydroxylase activity to a significant level. Rat kidney microsomes were also capable of �-hydroxylating geraniol although the activity was lower than that observed with lungs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Oxidation of diaryl, aryl alkyl, and dialkyl thioketones by singlet oxygen generated via self-sensitization and other independent methods yielded the corresponding ketone and sulfine in varying amounts. A zwitterionic/ diradical intermediate arising out of the primary interaction of singlet oxygen with the thiocarbonyl chromophore is believed to be the common intermediate for the ketone and sulfine. While closure of the zwitterion/diradical to give 1,2,3-dioxathietane would lead to the ketone, competing oxygen elimination is believed to lead to the sulfine. This partitioning is governed by steric and electronic factors operating on the zwitterionic/diradical intermediate.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is well known that the notions of normal forms and acyclicity capture many practical desirable properties for database schemes. The basic schema design problem is to develop design methodologies that strive toward these ideals. The usual approach is to first normalize the database scheme as far as possible. If the resulting scheme is cyclic, then one tries to transform it into an acyclic scheme. In this paper, we argue in favor of carrying out these two phases of design concurrently. In order to do this efficiently, we need to be able to incrementally analyze the acyclicity status of a database scheme as it is being designed. To this end, we propose the formalism of "binary decompositions". Using this, we characterize design sequences that exactly generate theta-acyclic schemes, for theta = agr,beta. We then show how our results can be put to use in database design. Finally, we also show that our formalism above can be effectively used as a proof tool in dependency theory. We demonstrate its power by showing that it leads to a significant simplification of the proofs of some previous results connecting sets of multivalued dependencies and acyclic join dependencies.