956 resultados para Sequence of problems
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A vector-valued impulsive control problem is considered whose dynamics, defined by a differential inclusion, are such that the vector fields associated with the singular term do not satisfy the so-called Frobenius condition. A concept of robust solution based on a new reparametrization procedure is adopted in order to derive necessary conditions of optimality. These conditions are obtained by taking a limit of those for an appropriate sequence of auxiliary standard optimal control problems approximating the original one. An example to illustrate the nature of the new optimality conditions is provided. © 2000 Elsevier Science B.V. All rights reserved.
Resumo:
A variational inequality problem (VIP) satisfying a constraint qualification can be reduced to a mixed complementarity problem (MCP). Monotonicity of the VIP implies that the MCP is also monotone. Introducing regularizing perturbations, a sequence of strictly monotone mixed complementarity problems is generated. It is shown that, if the original problem is solvable, the sequence of computable inexact solutions of the strictly monotone MCP's is bounded and every accumulation point is a solution. Under an additional condition on the precision used for solving each subproblem, the sequence converges to the minimum norm solution of the MCP. Copyright © 2000 by Marcel Dekker, Inc.
Resumo:
We show some evidences that the Southeastern Brazilian Continental Shelf (SBCS) has a devil's staircase structure, with a sequence of scarps and terraces with widths that obey fractal formation rules. Since the formation of these features is linked with the sea-level variations, we say that the sea level changes in an organized pulsating way. Although the proposed approach was applied in a particular region of the Earth, it is suitable to be applied in an integrated way to other shelves around the world, since the analyses favor the revelation of the global sea-level variations. Copyright (C) 2009 M. S. Baptista and L. A. Conti.
Resumo:
Several numerical methods for boundary value problems use integral and differential operational matrices, expressed in polynomial bases in a Hilbert space of functions. This work presents a sequence of matrix operations allowing a direct computation of operational matrices for polynomial bases, orthogonal or not, starting with any previously known reference matrix. Furthermore, it shows how to obtain the reference matrix for a chosen polynomial base. The results presented here can be applied not only for integration and differentiation, but also for any linear operation.
Resumo:
In this work we prove that the Achilles-Manaresi multiplicity sequence, like the classical Hilbert-Samuel multiplicity, is additive with respect to the exact sequence of modules. We also prove the associativity formula for his mulitplicity sequence. As a consequence, we give new proofs for two results already known. First, the Achilles-Manaresi multiplicity sequence is an invariant up to reduction, a result first proved by Ciuperca. Second, I subset of J is a reduction of (J,M) if and only if c(0)(I(p), M(p)) = c(0)(J(p), M(p)) for all p is an element of Spec(A), a result first proved by Flenner and Manaresi.
Resumo:
This work deals with the problem of minimizing the waste of space that occurs on a rotational placement of a set of irregular two dimensional polygons inside a two dimensional container. This problem is approached with an heuristic based on simulated annealing. Traditional 14 external penalization"" techniques are avoided through the application of the no-fit polygon, that determinates the collision free area for each polygon before its placement. The simulated annealing controls: the rotation applied, the placement and the sequence of placement of the polygons. For each non placed polygon, a limited depth binary search is performed to find a scale factor that when applied to the polygon, would allow it to be fitted in the container. It is proposed a crystallization heuristic, in order to increase the number of accepted solutions. The bottom left and larger first deterministic heuristics were also studied. The proposed process is suited for non convex polygons and containers, the containers can have holes inside. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
L-Amino acid oxidases (LAAOs, EC 1.4.3.2) are flavoenzymes that catalyze the stereospecific oxidative deamination of an L-amino acid substrate to the corresponding a-ketoacid with hydrogen peroxide and ammonia production. The present work describes the first report on the antiviral (Dengue virus) and antiprotozoal (trypanocidal and leishmanicide) activities of a Bothrops jararaca L-amino acid oxidase (BjarLAAO-I) and identify its cDNA sequence. Antiparasite effects were inhibited by catalase, suggesting that they are mediated by H(2)O(2) production. Cells infected with DENV-3 virus previously treated with BjarLAAO-I, showed a decrease in viral titer (13-83-fold) when compared with cells infected with untreated viruses. Untreated and treated promastigotes (T. cruzi and L. amazonensis) were observed by transmission electron microscopy with different degrees of damage. Its complete cDNA sequence, with 1452 bp, encoded an open reading frame of 484 amino acid residues with a theoretical molecular weight and pl of 54,771.8 and 5.7, respectively. The cDNA-deduced amino acid sequence of BjarLAAO shows high identity to LAAOs from other snake venoms. Further investigations will be focused on the related molecular and functional correlation of these enzymes. Such a study should provide valuable information for the therapeutic development of new generations of microbicidal drugs. (C) 2008 Elsevier Inc. All rights reserved.
Resumo:
The moving finite element collocation method proposed by Kill et al. (1995) Chem. Engng Sci. 51 (4), 2793-2799 for solution of problems with steep gradients is further developed to solve transient problems arising in the field of adsorption. The technique is applied to a model of adsorption in solids with bidisperse pore structures. Numerical solutions were found to match the analytical solution when it exists (i.e. when the adsorption isotherm is linear). The method is simple yet sufficiently accurate for use in adsorption problems, where global collocation methods fail. (C) 1998 Elsevier Science Ltd. All rights reserved.
Resumo:
Fluorescence in situ hybridization of a tile path of DNA subclones has previously enabled the cytogenetic definition of the minimal DNA sequence which spans the FRA16D common chromosomal fragile site, located at 16q23.2. Homozygous deletion of the FRA16D locus has been reported in adenocarcinomas of stomach, colon, lung and ovary. We have sequenced the 270 kb containing the FRA16D fragile site and the minimal homozygously deleted region in tumour cells. This sequence enabled localization of some of the tumour cell breakpoints to regions which contain AT-rich secondary structures similar to those associated with the FRA10B and FRA16B rare fragile sites. The FRA16D DNA sequence also led to the identification of an alternatively spliced gene, named FOR (fragile site FRA16D oxidoreductase), exons of which span both the fragile site and the minimal region of homozygous deletion. In addition, the complete DNA sequence of the FRA16D-containing FOR intron reveals no evidence of additional authentic transcripts. Alternatively spliced FOR transcripts (FOR I, FOR II and FOR III) encode proteins which share N-terminal WW domains and differ at their C-terminus, with FOR III having a truncated oxidoreductase domain. FRA16D-associated deletions selectively affect the FOR gene transcripts. Three out of five previously mapped translocation breakpoints in multiple myeloma are also located within the FOR gene. FOR is therefore the principle genetic target for DNA instability at 16q23.2 and perturbation of FOR function is likely to contribute to the biological consequences of DNA instability at FRA16D in cancer cells.
Resumo:
As a consequence of selective pressure exerted by the immune response during hepatitis C virus (HCV) infection, a high rate of nucleotide mutations in the viral genome is observed which leads to the emergence of viral escape mutants. The aim of this study was to evaluate the evolution of the amino acid (aa) sequence of the HCV nonstructural protein 3 (NS3) in viral isolates after liver transplantation. Six patients with HCV-induced liver disease undergoing liver transplantation (LT) were followed up for sequence analysis. Hepatitis C recurrence was observed in all patients after LT. The rate of synonymous (dS) nucleotide substitutions was much higher than that of nonsynonymous (dN) ones in the NS3 encoding region. The high values of the dS/dN ratios suggest no sustained adaptive evolution selection pressure and, therefore, absence of specific NS3 viral populations. Clinical genotype assignments were supported by phylogenetic analysis. Serial samples from each patient showed lower mean nucleotide genetic distance when compared with samples of the same HCV genotype and subtype. The NS3 samples studied had an N-terminal aa sequence with several differences as compared with reference ones, mainly in genotype 1b-infected patients. After LT, as compared with the sequences before, a few reverted aa substitutions and several established aa substitutions were observed at the N-terminal of NS3. Sites described to be involved in important functions of NS3, notably those of the catalytic triad and zinc binding, remained unaltered in terms of aa sequence. Rare or frequent aa substitutions occurred indiscriminately in different positions. Several cytotoxic T lymphocyte epitopes described for HCV were present in our 1b samples. Nevertheless, the deduced secondary structure of the NS3 protease showed a few alterations in samples from genotype 3a patients, but none were seen in 1b cases. Our data, obtained from patients under important selective pressure during LT, show that the NS3 protease remains well conserved, mainly in HCV 3a patients. It reinforces its potential use as an antigenic candidate for further studies aiming at the development of a protective immune response.
Resumo:
Phenylalanine hydroxylase (PAH) is activated by its substrate phenylalanine and inhibited by its cofactor tetrahydrobiopterin (BH4). The crystal structure of PAH revealed that the N-terminal sequence of the enzyme (residues 19-29) partially covered the enzyme active site, and suggested its involvement in regulation. We show that the protein lacking this N-terminal sequence does not require activation by phenylalanine, shows an altered structural response to phenylalanine, and is not inhibited by BH4. Our data support the model where the N-terminal sequence of PAH acts as an intrasteric autoregulatory sequence, responsible for transmitting the effect of phenylalanine activation to the active site, (C) 2001 Federation of European Biochemical Societies. Published by Elsevier Science B.V. All rights reserved.
Resumo:
The complete nucleotide sequence of the mitochondrial (mt) DNA molecule of the liverfluke, Fasciola hepatica (phylum Platyhelminthes, class Trematoda, family Fasciolidae), was determined, It comprises 14462 bp, contains 12 protein-encoding, 2 ribosomal and 22 transfer RNA genes, and is the second complete flatworm (and the first trematode) mitochondrial sequence to be described in detail. All of the genes are transcribed from the same strand. Of the genes typically found in mitochondrial genomes of eumetazoans, only atp8 is absent. The nad4L and nad4 genes overlap by 40 nt. Most intergenic sequences are very short. Two larger non-coding regions are present. The longer one (817 nt) is located between trnG and cox3 and consists of 8 identical tandem repeats of 85 nt, rich in G and C, followed by 1 imperfect repeat. The shorter non-coding region (187 nt) exhibits no special features and is separated from the longer region by trnG. The gene arrangement resembles that of some other trematodes including the eastern Asian Schistosoma species (and cyclophyllidean cestode species) but it is strikingly different from that of the African schistosomes, represented by Schistosoma mansoni. The genetic code is as inferred previously for flatworms. Transfer RNA genes range in length from 58 to 70 nt, their products producing characteristic 'clover leaf' structures, except for tRNA(S-VON) and tRNA(S-AGN) lacking the DHU arm.
Resumo:
The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.
Resumo:
This paper introduces a new unsupervised hyperspectral unmixing method conceived to linear but highly mixed hyperspectral data sets, in which the simplex of minimum volume, usually estimated by the purely geometrically based algorithms, is far way from the true simplex associated with the endmembers. The proposed method, an extension of our previous studies, resorts to the statistical framework. The abundance fraction prior is a mixture of Dirichlet densities, thus automatically enforcing the constraints on the abundance fractions imposed by the acquisition process, namely, nonnegativity and sum-to-one. A cyclic minimization algorithm is developed where the following are observed: 1) The number of Dirichlet modes is inferred based on the minimum description length principle; 2) a generalized expectation maximization algorithm is derived to infer the model parameters; and 3) a sequence of augmented Lagrangian-based optimizations is used to compute the signatures of the endmembers. Experiments on simulated and real data are presented to show the effectiveness of the proposed algorithm in unmixing problems beyond the reach of the geometrically based state-of-the-art competitors.