874 resultados para Simulated Annealing Calculations
Resumo:
A novel member of the human relaxin subclass of the insulin superfamily was recently discovered during a genomics database search and named relaxin-3. Like human relaxin-1 and relaxin-2, relaxin-3 is predicted to consist of a two-chain structure and three disulfide bonds in a disposition identical to that of insulin. To undertake detailed biophysical and biological characterization of the peptide, its chemical synthesis was undertaken. In contrast to human relaxin-1 and relaxin-2, however, relaxin-3 could not be successfully prepared by simple combination of the individual chains, thus necessitating recourse to the use of a regioselective disulfide bond formation strategy. Solid phase synthesis of the separate, selectively S-protected A and B chains followed by their purification and the subsequent stepwise formation of each of the three disulfides led to the successful acquisition of human relaxin-3. Comprehensive chemical characterization confirmed both the correct chain orientation and the integrity of the synthetic product. Relaxin-3 was found to bind to and activate native relaxin receptors in vitro and stimulate water drinking through central relaxin receptors in vivo. Recent studies have demonstrated that relaxin-3 will bind to and activate human LGR7, but not LGR8, in vitro. Secondary structural analysis showed it to adopt a less ordered confirmation than either relaxin-1 or relaxin-2, reflecting the presence in the former of a greater percentage of nonhelical forming amino acids. NMR spectroscopy and simulated annealing calculations were used to determine the three-dimensional structure of relaxin-3 and to identify key structural differences between the human relaxins.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
The solution structure of A beta(1-40)Met(O), the methionine-oxidized form of amyloid beta-peptide A beta(1-40), has been investigated by CD and NMR spectroscopy. Oxidation of Met35 may have implications in the aetiology of Alzheimer's disease. Circular dichroism experiments showed that whereas A beta(1-40) and A beta(1-40)Met(O) both adopt essentially random coil structures in water (pH 4) at micromolar concentrations, the former aggregates within several days while the latter is stable for at least 7 days under these conditions. This remarkable difference led us to determine the solution structure of A beta(1-40)Met(O) using H-1 NMR spectroscopy. In a water-SDS micelle medium needed to solubilize both peptides at the millimolar concentrations required to measure NMR spectra, chemical shift and NOE data for A beta(1-40)Met(O) strongly suggest the presence of a helical region between residues 16 and 24. This is supported by slow H-D exchange of amide protons in this region and by structure calculations using simulated annealing with the program XPLOR. The remainder of the structure is relatively disordered. Our previously reported NMR data for A beta(1-40) in the same solvent shows that helices are present over residues 15-24 (helix 1) and 28-36 (helix 2), Oxidation of Met35 thus causes a local and selective disruption of helix 2. In addition to this helix-coil rearrangement in aqueous micelles, the CD data show that oxidation inhibits a coil-to-beta-sheet transition in water. These significant structural rearrangements in the C-terminal region of A beta may be important clues to the chemistry and biology of A beta(1-40) and A beta(1-42).
Resumo:
In this paper, the optimum design of 3R manipulators is formulated and solved by using an algebraic formulation of workspace boundary. A manipulator design can be approached as a problem of optimization, in which the objective functions are the size of the manipulator and workspace volume; and the constrains can be given as a prescribed workspace volume. The numerical solution of the optimization problem is investigated by using two different numerical techniques, namely, sequential quadratic programming and simulated annealing. Numerical examples illustrate a design procedure and show the efficiency of the proposed algorithms.
Resumo:
The simulated annealing approach to structure solution from powder diffraction data, as implemented in the DASH program, is easily amenable to parallelization at the individual run level. Very large scale increases in speed of execution can therefore be achieved by distributing individual DASH runs over a network of computers. The GDASH program achieves this by packaging DASH in a form that enables it to run under the Univa UD Grid MP system, which harnesses networks of existing computing resources to perform calculations.
Resumo:
The problems of combinatory optimization have involved a large number of researchers in search of approximative solutions for them, since it is generally accepted that they are unsolvable in polynomial time. Initially, these solutions were focused on heuristics. Currently, metaheuristics are used more for this task, especially those based on evolutionary algorithms. The two main contributions of this work are: the creation of what is called an -Operon- heuristic, for the construction of the information chains necessary for the implementation of transgenetic (evolutionary) algorithms, mainly using statistical methodology - the Cluster Analysis and the Principal Component Analysis; and the utilization of statistical analyses that are adequate for the evaluation of the performance of the algorithms that are developed to solve these problems. The aim of the Operon is to construct good quality dynamic information chains to promote an -intelligent- search in the space of solutions. The Traveling Salesman Problem (TSP) is intended for applications based on a transgenetic algorithmic known as ProtoG. A strategy is also proposed for the renovation of part of the chromosome population indicated by adopting a minimum limit in the coefficient of variation of the adequation function of the individuals, with calculations based on the population. Statistical methodology is used for the evaluation of the performance of four algorithms, as follows: the proposed ProtoG, two memetic algorithms and a Simulated Annealing algorithm. Three performance analyses of these algorithms are proposed. The first is accomplished through the Logistic Regression, based on the probability of finding an optimal solution for a TSP instance by the algorithm being tested. The second is accomplished through Survival Analysis, based on a probability of the time observed for its execution until an optimal solution is achieved. The third is accomplished by means of a non-parametric Analysis of Variance, considering the Percent Error of the Solution (PES) obtained by the percentage in which the solution found exceeds the best solution available in the literature. Six experiments have been conducted applied to sixty-one instances of Euclidean TSP with sizes of up to 1,655 cities. The first two experiments deal with the adjustments of four parameters used in the ProtoG algorithm in an attempt to improve its performance. The last four have been undertaken to evaluate the performance of the ProtoG in comparison to the three algorithms adopted. For these sixty-one instances, it has been concluded on the grounds of statistical tests that there is evidence that the ProtoG performs better than these three algorithms in fifty instances. In addition, for the thirty-six instances considered in the last three trials in which the performance of the algorithms was evaluated through PES, it was observed that the PES average obtained with the ProtoG was less than 1% in almost half of these instances, having reached the greatest average for one instance of 1,173 cities, with an PES average equal to 3.52%. Therefore, the ProtoG can be considered a competitive algorithm for solving the TSP, since it is not rare in the literature find PESs averages greater than 10% to be reported for instances of this size.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
In this work, we have used a combined of atomistic simulation methods to explore the effects of confinement of water molecules between silica surfaces. Firstly, the mechanical properties of water severe confined (~3A) between two silica alpha-quartz was determined based on first principles calculations within the density functional theory (DFT). Simulated annealing methods were employed due to the complex potential energry surface, and the difficulties to avoid local minima. Our results suggest that much of the stiffness of the material (46%) remains, even after the insertion of a water monolayer in the silica. Secondly, in order to access typical time scales for confined systems, classical molecular dynamics was used to determine the dynamical properties of water confined in silica cylindrical pores, with diameters varying from 10 to 40A. in this case we have varied the passivation of the silica surface, from 13% to 100% of SiOH, and the other terminations being SiOH2 and SiOH3, the distribution of the different terminations was obtained with a Monte Carlo simulation. The simulations indicates a lowering of the diffusion coefficientes as the diameter decreases, due to the structuration of hydrogen bonds of water molecules; we have also obtained the density profiles of the confined water and the interfacial tension.
Resumo:
A 12 bp long GCN4-binding, self-complementary duplex DNA d(CATGACGTCATG)2 has been investigated by NMR spectroscopy to study the structure and dynamics of the molecule in aqueous solution. The NMR structure of the DNA obtained using simulated annealing and iterative relaxation matrix calculations compares quite closely with the X-ray structure of ATF/CREB DNA in complex with GCN4 protein (DNA-binding domain). The DNA is also seen to be curved in the free state and this has a significant bearing on recognition by the protein. The dynamic characteristics of the molecule have been studied by 13C relaxation measurements at natural abundance. A correlation has been observed between sequence-dependent dynamics and recognition by GCN4 protein.
Resumo:
Chloroperoxidase (CPO), a 298-residue glycosylated protein from the fungus Caldariomyces fumago, is probably the most versatile heme enzyme yet discovered. Interest in CPO as a catalyst is based on its power to produce enantiomerically enriched products. Recent research has focused its attention on the ability of CPO to epoxidize alkenes in high regioselectivity and enantioselectivity as an efficient and environmentally benign alternative to traditional synthetic routes. There has been little work on the nature of ligand binding, which probably controls the regio- and enantiospecifity of CPO. Consequently it is here that we focus our work. We report docking calculations and computer simulations aimed at predicting the enantiospecificity of CPO-catalyzed epoxidation of three model substrates. On the basis of this work candidate mutations to improve the efficiency of CPO are predicted. In order to accomplish these aims, a simulated annealing and molecular dynamics protocol is developed to sample potentially reactive substrate/CPO complexes.
A hybrid Particle Swarm Optimization - Simplex algorithm (PSOS) for structural damage identification
Resumo:
This study proposes a new PSOS-model based damage identification procedure using frequency domain data. The formulation of the objective function for the minimization problem is based on the Frequency Response Functions (FRFs) of the system. A novel strategy for the control of the Particle Swarm Optimization (PSO) parameters based on the Nelder-Mead algorithm (Simplex method) is presented; consequently, the convergence of the PSOS becomes independent of the heuristic constants and its stability and confidence are enhanced. The formulated hybrid method performs better in different benchmark functions than the Simulated Annealing (SA) and the basic PSO (PSO(b)). Two damage identification problems, taking into consideration the effects of noisy and incomplete data, were studied: first, a 10-bar truss and second, a cracked free-free beam, both modeled with finite elements. In these cases, the damage location and extent were successfully determined. Finally, a non-linear oscillator (Duffing oscillator) was identified by PSOS providing good results. (C) 2009 Elsevier Ltd. All rights reserved
Resumo:
This paper presents a strategy for the solution of the WDM optical networks planning. Specifically, the problem of Routing and Wavelength Allocation (RWA) in order to minimize the amount of wavelengths used. In this case, the problem is known as the Min-RWA. Two meta-heuristics (Tabu Search and Simulated Annealing) are applied to take solutions of good quality and high performance. The key point is the degradation of the maximum load on the virtual links in favor of minimization of number of wavelengths used; the objective is to find a good compromise between the metrics of virtual topology (load in Gb/s) and of the physical topology (quantity of wavelengths). The simulations suggest good results when compared to some existing in the literature.