Application of TiO2-nanotubes/PbO2 as an anode for the electrochemical elimination of Acid Red 1 dye

Journal of Solid State Electrochemistry - In this study, galvanostatic electrolysis, through the use of the platinum supported on Ti (Ti/Pt) and Ti/TiO2-nanotubes/PbO2 anodes, was conducted in an...     

Organotellurides as a source of organometallics: application in the synthesis of (+/−)-frontalin

A masked lithium homoenolate, generated by tellurium/lithium exchange, was reacted with epoxides. The lithium compound was also converted into other organometallics such as Grignard, and cuprates and the reactivity of those organometallics with epoxides was evaluated. The same building block was employed in the synthesis of (+/−)-frontalin.     

226Ra in milk of the dairy cattle from the rural region of Pernambuco, Brazil

Summary Studies performed by the Brazilian Nuclear Corporation (NUCLEBRAS), in collaboration with the Geological Survey Company of Brazil (CPRM), identified high levels of natural uranium in the districts of Pedra and Venturosa, in the rural region of the state of Pernambuco (PE) - Brazil, where the maximum value found in rocks was 22,000 mg.     

Spectrofluorimetric Method for the Determination of Aluminum with Alizarin Red PS

 A simple and direct spectrofluorimetric method has been developed for the determination of aluminum using alizarin red PS (1,2,4-trihydroxy 9,10-anthraquinone-3-sulfonic acid). The method is based on the strong fluorescence (480/564 nm) of Al³⁺ and alizarin red. Experimental parameters such as pH, concentration of the ligand, ionic strength of the solution, reaction time and temperature were optimized in order to maximize the analytical signal. Interferences of several ions (anions and cations) were studied and evaluated. The linear range of the method extends from 3 to 100 μg L⁻¹. Limit of detection (3s_b) was 0.9 μg L⁻¹. The method was tested with a silicate certified reference material. Interferences were eliminated by a liquid extraction with cupferron. Author for correspondence. E-mail: aucelior@rdc.puc-rio.br Received September 10, 2002; accepted January 15, 2003 Published online May 5, 2003     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation

Let G=(V,E) be a undirected k-edge connected graph with weights c_e on edges and w_v on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable.