64 resultados para Algorithmic skeleton
Resumo:
Infrared spectra of oxazolidine-2-one (Oxo), -2-thione (Oxt) and their N-deuteriated derivatives have been measured over the range 4000-20 cm−1. The fundamental frequencies of these molecules have been assigned on the basis of normal coordinate calculations carried out using a Urey-Bradley potential function supplemented with valence type constants for the out-of-plane modes of the planar skeleton. The results of the vibrational analyses are discussed and correlated with the assignments available for the other related five membered heterocyclic molecules.
Resumo:
Tlhe well-known Cahn-lngold-Prelog method of specifying the stereoisomers is introduced within the framework of ALWIN-Algorithmic Wiswesser Notation. Given the structural diagram, the structural ALWIN is first formed; the speclflcation symbols are then introduced at the appropriate places to describe the stereoisomers.
Resumo:
Achieving stabilization of telomeric DNA in G-quadruplex conformation by Various organic compounds has been an important goal for the medicinal chemists seeking to develop new anticancer agents. Several compounds are known to stabilize G-quadruplexes. However, relatively few are known to induce their formation and/or alter the topology, of the preformed quadruplex DNA. Herein, four compounds having the 1,3-phenylene-bis(piperazinyl benzimidazole) unit as a basic skeleton have been synthesized, and their interactions with the 24-mer telomeric DNA sequences from Tetrahymena thermophilia d(T(2)G(4))(4) have been investigated using high-resolution techniques Such as circular dichroism (CD) spectropolarimetry, CD melting, emission spectroscopy, and polyacrylamide gel electrophoresis. The data obtained, in the presence of one of three ions (Li+, Na+, or K+), indicate that all the new compounds have a high affinity for G-quadruplex DNA, and the strength of the binding with G-quadruplex depends on (1) phenyl ring substitution, (ii) the piperazinyl side chain, and (iii) the type of monovalent cation present in the buffer. Results further Suggest that these compounds are able to abet the conversion of the Intramolecular quadruplex into parallel stranded intermolecular G-quadruplex DNA. Notably, these compounds are also capable of inducing and stabilizing the parallel stranded quadruplex from randomly structured DNA in the absence of any stabilizing cation. The kinetics of the structural changes Induced by these compounds could be followed by recording the changes in the CD signal as a function of time. The implications of the findings mentioned above are discussed in this paper.
Resumo:
We find sandwiched metal dimers CB5H6M–MCB5H6 (M = Si, Ge, Sn) which are minima in the potential energy surface with a characteristic M–M single bond. The NBO analysis and the M–M distances (Å) (2.3, 2.44 and 2.81 for M = Si, Ge, Sn) indicate substantial M–M bonding. Formal generation of CB5H6M–MCB5H6 has been studied theoretically. Consecutive substitution of two boron atoms in B7H−27 by M (Si, Ge, Sn) and carbon, respectively followed by dehydrogenation may lead to our desired CB5H6M–MCB5H6. We find that the slip distorted geometry is preferred for MCB5H7 and its dehydrogenated dimer CB5H6M–MCB5H6. The slip-distortion of M–M bond in CB5H6M–MCB5H6 is more than the slip distortion of M–H bond in MCB5H7. Molecular orbital analysis has been done to understand the slip distortion. Larger M–M bending (CB5H6M–MCB5H6) in comparison with M–H bending (MCB5H7) is suspected to be encouraged by stabilization of one of the M–M π bonding MO’s. Preference of M to occupy the apex of pentagonal skeleton of MCB5H7 over its icosahedral analogue MCB10H11 has been observed.
Resumo:
Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.
Resumo:
This paper gives a new iterative algorithm for kernel logistic regression. It is based on the solution of a dual problem using ideas similar to those of the Sequential Minimal Optimization algorithm for Support Vector Machines. Asymptotic convergence of the algorithm is proved. Computational experiments show that the algorithm is robust and fast. The algorithmic ideas can also be used to give a fast dual algorithm for solving the optimization problem arising in the inner loop of Gaussian Process classifiers.
Resumo:
By a series of reactions the Diels-Alder adduct IV of maleic anhydride and β-trans-Ocimene gave 1-hydroxy-1,4-dimethyl-7-hydroxymethyloctahydroindane (XII). Its further synthetic elaboration furnished 1,4-dimethyl-7-(2-ethoxycarbonyl-1-propenyl)-Δ1-octahydroindane of the valerenic acid skeleton.
Resumo:
Infrared and Raman spectra of N,N-dimethylacetamide (DMA) are recorded and the normal vibrational analysis of the DMA skeleton as well as the entire molecule carried out employing the Urey-Bradley and modified Urey-Bradley force fields. Vibrational frequencies are assigned on the basis of the normal coordinate calculations and are compared with those of related molecules. Infrared spectra of metal complexes are examined to substantiate the band assignments.
Resumo:
Infrared and Raman spectra of N,N-dimethylacetamide (DMA) are recorded and the normal vibrational analysis of the DMA skeleton as well as the entire molecule carried out employing the Urey-Bradley and modified Urey-Bradley force fields. Vibrational frequencies are assigned on the basis of the normal coordinate calculations and are compared with those of related molecules. Infrared spectra of metal complexes are examined to substantiate the band assignments.
Resumo:
We present the theoretical foundations for the multiple rendezvous problem involving design of local control strategies that enable groups of visibility-limited mobile agents to split into subgroups, exhibit simultaneous taxis behavior towards, and eventually rendezvous at, multiple unknown locations of interest. The theoretical results are proved under certain restricted set of assumptions. The algorithm used to solve the above problem is based on a glowworm swarm optimization (GSO) technique, developed earlier, that finds multiple optima of multimodal objective functions. The significant difference between our work and most earlier approaches to agreement problems is the use of a virtual local-decision domain by the agents in order to compute their movements. The range of the virtual domain is adaptive in nature and is bounded above by the maximum sensor/visibility range of the agent. We introduce a new decision domain update rule that enhances the rate of convergence by a factor of approximately two. We use some illustrative simulations to support the algorithmic correctness and theoretical findings of the paper.
Resumo:
A new strategy for the construction of the isotwistane skeleton is reported from easily available cyclohexadienes, which involves a one-pot cationic skeletal rearrangement and ene cyclisation of a bicyclo[2.2.2]octenone derivative and a cationic rearrangement of a tricyclo[5.3.0.0(4,8)]decane to a [4.3.1.0(3,7)]decane skeleton as the key steps in the synthesis of 2-pupukeanone.
Resumo:
Novel molecular matrices have been derived from coumarin-4-acetic acids and beta-phenylethylamines using the Bischler-Napieralski protocol which has led to the synthesis of analogues of tetrahydropapaverine in which the dimethoxybenzene moiety has been replaced by substituted coumarins. One carbon homologation has led to cyclization at the C3 position of coumarin generating the protoberberine skeleton. Structures have been confirmed by diffraction studies. The results showed that compounds 6e, 6f, 7e and 7f were found to be very effective against DNA samples of Gram positive bacterium Staphylococcus aureus and fungus Aspergillus niger. (C) 2010 Elsevier Masson SAS. All rights reserved.
Resumo:
Design of speaker identification schemes for a small number of speakers (around 10) with a high degree of accuracy in controlled environment is a practical proposition today. When the number of speakers is large (say 50–100), many of these schemes cannot be directly extended, as both recognition error and computation time increase monotonically with population size. The feature selection problem is also complex for such schemes. Though there were earlier attempts to rank order features based on statistical distance measures, it has been observed only recently that the best two independent measurements are not the same as the combination in two's for pattern classification. We propose here a systematic approach to the problem using the decision tree or hierarchical classifier with the following objectives: (1) Design of optimal policy at each node of the tree given the tree structure i.e., the tree skeleton and the features to be used at each node. (2) Determination of the optimal feature measurement and decision policy given only the tree skeleton. Applicability of optimization procedures such as dynamic programming in the design of such trees is studied. The experimental results deal with the design of a 50 speaker identification scheme based on this approach.
Resumo:
The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.
Resumo:
Infrared spectra of imidazolidine-2-thione (N,N?-ethylenethiourea, ETU) and its N,N?-deuterated (ETU-d2) and S-methylthiouronium iodides have been recorded from 4000 to 30 cm?1. Normal coordinate analyses of ETU and ETU-d2 have been made for all the fundamental frequencies, employing a Urey-Bradley potential function supplemented with valence type constants for the out of plane modes of the planar skeleton. Raman frequencies of ETU from literature have been utilised. The results of the vibrational analyses are discussed in relation to the group frequencies in structurally related molecules and frequency shifts on deuteration and S-methylation. The normal coordinate treatment is also performed for the planar vibrations of imidazolidine-2-selenone (N,N?-ethyleneselenourea, ESU) to propose assignments for ESU and so also to support the assignments of ETU.