OPTICALLY PUMPED (CD3OH)-C-13 - FAR-INFRARED LASER LINES AND ASSIGNMENT

Fourier transform and IR optoacoustic absorption data of (CD3OH)-C-13 were used to search for new FIR laser lines. We have used a waveguide CO2 laser of 300 MHz tunability as the optical pumping source. We report the observation and characterization of 13 new lines. Three of these lines are associated with absorbing transitions appertaining to the weak (CD3)-C-13 asymmetric bending mode.

Assignment and frequency measurement of rotational transitions of (CD3OH)-C-13 by intracavity laser Stark spectroscopy

We present the results of an intracavity Stark spectroscopy experiment on the fundamental state of (CD3OH)-C-13. We use an optically pumped hybrid waveguide FIR laser, CH2F2 as active molecule, and (CD3OH)-C-13 as absorbent molecule. No Brewster window is needed to separate the lasing gas from the absorbing deuterated methanol. An absorption line is assigned as E(l) symmetry (n, K, J): (1,4,18) --> (1,5,18) and its frequency is measured as 63.08631 cm(-1) with a precision of a few parts in 10(7); two more absorptions are reported and a tentative assignment for one of them.

Exchange and crystal field effects in the ESR spectra of Eu(2+) in LaB(6)

Electron spin resonance of Eu(2+) (4f(7), S=7/2) in a La hexaboride (LaB(6)) single crystal shows a single anisotropic Dysonian resonance. From the observed negative g shift of the resonance, it is inferred that the Eu(2+) ions are covalent exchange coupled to the B 2p-like host conduction electrons. From the anisotropy of the spectra (linewidth and field for resonance), we found that the S ground state of Eu(2+) ions experience a cubic crystal field of a negative fourth order crystal field parameter (CFP), b(4)=-11.5(2.0) Oe, in agreement with the negative fourth order CFP, A(4), found for the non-S ground state R hexaborides. These results support covalency as the dominant contribution to the fourth order CFP for the whole R hexaboride family.

Assignment of the disulfide bridges in bothropstoxin-I, a myonecrotic Lys49 PLA(2) homolog from Bothrops jararacussu snake venom

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.

A Lagrangian bound for many-to-many assignment problems

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

Lagrangian heuristic for a class of the generalized assignment problems

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.

Simple heuristics for the assembly line worker assignment and balancing problem

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

Studying properties of Lagrangian bounds for many-to-many assignment problems

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.

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

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

Negative dimensional integration: Lab testing at two loops

Negative dimensional integration method (NDIM) is a technique to deal with D-dimensional Feynman loop integrals. Since most of the physical quantities in perturbative Quantum Field Theory (pQFT) require the ability of solving them, the quicker and easier the method to evaluate them the better. The NDIM is a novel and promising technique, ipso facto requiring that we put it to test in different contexts and situations and compare the results it yields with those that we already know by other well-established methods. It is in this perspective that we consider here the calculation of an on-shell two-loop three point function in a massless theory. Surprisingly this approach provides twelve non-trivial results in terms of double power series. More astonishing than this is the fact that we can show these twelve solutions to be different representations for the same well-known single result obtained via other methods. It really comes to us as a surprise that the solution for the particular integral we are dealing with is twelvefold degenerate.

Assignment of the bisulfide bridges in bothropstoxin-I, a Myonecrotic Lys49 PLA2 homolog from bothrops jararacussu snake venom

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.

Using remote lab networks to provide support to public secondary school education level

The advantages of networking are widely known in many areas (from business to personal ones). One particular area where networks have also proved their benefits is education. Taking the secondary school education level into account, some successful cases can be found in literature. In this paper we describe a particular remote lab network supporting physical experiments accessible to students of institutions geographically separated. The network architecture and application examples of using some of the available remote experiments are illustrated in detail. ©2008 IEEE.

Problem of assignment cells to switches in a cellular mobile network via beam search method

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.

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

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.