37 resultados para pole assignment
Resumo:
Bothropstoxin-I (BthTX-1), a Lys49 phospholipase A(2) homolog with no apparent catalytic activity, was first isolated from Bothrops jararacussu snake venom and completely sequenced in this laboratory. It is a 121-amino-acid single polypeptide chain, highly myonecrotic, despite its inability to catalyze hydrolysis of egg yolk phospholipids, and has 14 half-cystine residues identified at positions 27, 29, 44, 45, 50, 51, 61, 84, 91, 96, 98, 105, 123, and 131 (numbering according to the conventional alignment including gaps, so that the last residue is Cys 131). In order to access its seven disulfide bridges, two strategies were followed: (1) Sequencing of isolated peptides from (tryptic + SV8) and chymotryptic digests by Edman-dansyl degradation; (2) crystallization of the protein and determination of the crystal structure so that at least two additional disulfide bridges could be identified in the final electron density map. Identification of the disulfide-containing peptides from the enzymatic digests was achieved following the disappearance of the original peptides from the HPLC profile after reduction and carboxymethylation of the digest. Following this procedure, four bridges were initially identified from the tryptic and SV8 digests: Cys50-Cys131, Cys51-Cys98, Cys61-Cys91, and Cys84-Cys96. From the chymotryptic digest other peptides were isolated either containing some of the above bridges, therefore confirming the results from the tryptic digest, or presenting a new bond between Cys27 and Cys123. The two remaining bridges were identified as Cys29-Cys45 and Cys44-Cys105 by determination of the crystal structure, showing that BthTX-1 disulfide bonds follow the normal pattern of group II PLA(2)s.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
We obtain constraints on possible anomalous interactions of the top quark with the electroweak vector bosons arising from the precision measurements at the Z pole. In the framework of SU(2)L ⊕ U(1)Y chiral Lagrangians, we examine all effective CP-conserving operators of dimension five which induce fermionic currents involving the top quark. We constrain the magnitudes of these anomalous interactions by evaluating their one-loop contributions to the Z pole physics. Our analysis shows that the operators that contribute to the LEP observables get bounds close to the theoretical expectation for their anomalous couplings. We also show that those which break the SU(2)C custodial symmetry are more strongly bounded. © 1997 Elsevier Science B.V.
Resumo:
Bothropstoxin-I (BthTX-I), a Lys49 phospholipase A2 homolog with no apparent catalytic activity, was first isolated from Bothrops jararacussu snake venom and completely sequenced in this laboratory. It is a 121-amino-acid single polypeptide chain, highly myonecrotic, despite its inability to catalyze hydrolysis of egg yolk phospholipids, and has 14 half-cystine residues identified at positions 27, 29, 44, 45, 50, 51, 61, 84, 91, 96, 98, 105, 123, and 131 (numbering according to the conventional alignment including gaps, so that the last residue is Cys 131). In order to access its seven disulfide bridges, two strategies were followed: (1) Sequencing of isolated peptides from (tryptic + SV8) and chymotryptic digests by Edman-dansyl degradation; (2) crystallization of the protein and determination of the crystal structure so that at least two additional disulfide bridges could be identified in the final electron density map. Identification of the disulfide-containing peptides from the enzymatic digests was achieved following the disappearance of the original peptides from the HPLC profile after reduction and carboxymethylation of the digest. Following this procedure, four bridges were initially identified from the tryptic and SV8 digests: Cys50-Cysl31, Cys51-Cys98, Cys61-Cys91, and Cys84-Cys96. From the chymotryptic digest other peptides were isolated either containing some of the above bridges, therefore confirming the results from the tryptic digest, or presenting a new bond between Cys27 and Cys 123. The two remaining bridges were identified as Cys29-Cys45 and Cys44-Cysl05 by determination of the crystal structure, showing that BthTX-I disulfide bonds follow the normal pattern of group II PLA2s. © 2001 Plenum Publishing Corporation.
Resumo:
A systematic procedure of zero placement to design control systems is proposed. A state feedback controller with vector gain K is used to perform the pole placement. An estimator with vector gain L is also designed for output feedback control. A new systematic method of zero assignment to reduce the effect of the undesirable poles of the plant and also to increase the velocity error constant is presented. The methodology places the zeros in a specific region and it is based on Linear Matrix Inequalities (LMIs) framework, which is a new approach to solve this problem. Three examples illustrate the effectiveness of the proposed method.
Resumo:
This letter describes a novel algorithm that is based on autoregressive decomposition and pole tracking used to recognize two patterns of speech data: normal voice and disphonic voice caused by nodules. The presented method relates the poles and the peaks of the signal spectrum which represent the periodic components of the voice. The results show that the perturbation contained in the signal is clearly depicted by pole's positions. Their variability is related to jitter and shimmer. The pole dispersion for pathological voices is about 20% higher than for normal voices, therefore, the proposed approach is a more trustworthy measure than the classical ones. © 2007.
Resumo:
The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic methods, because they allow us to find a good quality solution in a quite satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach to provide good solutions for medium- and large-sized cellular mobile network.
Resumo:
This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses' preferences and minimize the violation of soft constraints. This paper presents a new deterministic heuristic algorithm, called MAPA (multi-assignment problem-based algorithm), which is based on successive resolutions of the assignment problem. The algorithm has two phases: a constructive phase and an improvement phase. The constructive phase builds a full schedule by solving successive assignment problems, one for each day in the planning period. The improvement phase uses a couple of procedures that re-solve assignment problems to produce a better schedule. Given the deterministic nature of this algorithm, the same schedule is obtained each time that the algorithm is applied to the same problem instance. The performance of MAPA is benchmarked against published results for almost 250,000 instances from the NSPLib dataset. In most cases, particularly on large instances of the problem, the results produced by MAPA are better when compared to best-known solutions from the literature. The experiments reported here also show that the MAPA algorithm finds more feasible solutions compared with other algorithms in the literature, which suggest that this proposed approach is effective and robust. © 2013 Springer Science+Business Media New York.
Resumo:
The tetrahydroquinoline derivatives can be easily synthesized through Povarov reaction and have several important biological activities. This work describes a comparative study for the unequivocal assignment of molecular structure of different tetrahydroquinoline derivatives, through a complete analysis of NMR 1D and 2D NMR spectra (1H, 13C, COSY, HSQC, and HMBC), and the correlation this data with theoretical calculations of energy-minimization and chemical shift (δ), employing the theory level of DFT/B3LYP with set of the cc-pVDZ basis. For these derivatives the experimental analyses and the theoretical model adopted were sufficient to obtain a good description of its structures, and these results can be used to assign the structure of various others tetrahydroquinoline derivatives. © 2013 Springer Science+Business Media New York.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)