929 resultados para Attribute Assignment


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we propose a hybrid methodology based on Graph-Coloring and Genetic Algorithm (GA) to solve the Wavelength Assignment (WA) problem in optical networks, impaired by physical layer effects. Our proposal was developed for a static scenario where the physical topology and traffic matrix are known a priori. First, we used fixed shortest-path routing to attend demand requests over the physical topology and the graph-coloring algorithm to minimize the number of necessary wavelengths. Then, we applied the genetic algorithm to solve WA. The GA finds the wavelength activation order on the wavelengths grid with the aim of reducing the Cross-Phase Modulation (XPM) effect; the variance due to the XPM was used as a function of fitness to evaluate the feasibility of the selected WA solution. Its performance is compared with the First-Fit algorithm in two different scenarios, and has shown a reduction in blocking probability up to 37.14% when considered both XPM and residual dispersion effects and up to 71.42% when only considered XPM effect. Moreover, it was possible to reduce by 57.14% the number of wavelengths.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We report the synthesis and total NMR characterization of 5-thia-1-azabicyclo-[4.2.0]oct-2-ene-2-carboxylic acid-3-[[[(4″- nitrophenoxy)carbonyl]oxy]-methyl]-8-oxo-7-[(2-thienyloxoacetyl)amino] -diphenylmethyl ester-5-dioxide (5), a new cephalosporin derivative. This compound can be used as the carrier of a wide range of drugs containing an amino group. The preparation of the intermediate product, 5-thia-1-azabicyclo[4.2.0] oct-2-ene-2-carboxylic acid-3-[methyl 4-(6-methoxyquinolin-8-ylamino) pentylcarbamate]-8-oxo-7-[(2-thienyloxoacetyl)amino]-diphenylmethyl ester-5-dioxide (6), as well as the synthesis of the antimalarial primaquine prodrug 5-thia-1-azabicyclo[4.2.0]oct-2-ene-2-carboxylic acid-3-[methyl 4-(6-methoxyquinolin-8-ylamino)pentylcarbamate]-8-oxo-7-[(2-thienyloxoacetyl) amino]- 5-dioxide (7) are also described, together with their total 1H- and 13C-NMR assignments. © 2008 by MDPI.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the well-known simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority rules defining the order in which the tasks and workers should be assigned to the workstations. We present a number of such rules and compare their performance across three possible uses: as a stand-alone method, as an initial solution generator for meta-heuristics, and as a decoder for a hybrid genetic algorithm. Our results show that the heuristics are fast, they obtain good results as a stand-alone method and are efficient when used as a initial solution generator or as a solution decoder within more elaborate approaches.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work is described a complete H-1 and C-13 NMR analysis for a group of four sesquiterpene lactones, three previously unknown. The unequivocal assignments were achieved by H-1 NMR, C-13{H-1} NMR, gCOSY. gHMQC, gHMBC and NOESY experiments and no ambiguities were left behind. All hydrogen coupling constants were measured, clarifying all hydrogen signals multiplicities. (C) 2011 Elsevier B.V. All rights reserved.