Trace elements determination in red and white wines using total-reflection X-ray fluorescence

Several wines produced in different regions from south of Brazil and available in markets in Rio de Janeiro were analyzed for their contents of elements such as: P, S, Cl, Ca, Ti, Cr, Mn, Fe, Ni, Cu, Zn, Rb and Sr. Multi-element analysis was possible with simple sample preparation and subsequent analysis by total-reflection X-ray fluorescence using synchrotron radiation. The measurement was carried at the X-ray fluorescence beamline in the Synchrotron Light Source Laboratory in Campinas, Brazil. The levels of the various elements obtained were lower in the Brazilian wines than the values generally found in the literature. The present study indicates the capability of multi-element analysis for determining the contents of various elements present in wines coming from Brazil vineyards by using a simple, sensitive and precise method.     

An improved semidefinite programming relaxation for the satisfiability problem

The satisfiability (SAT) problem is a central problem in mathematical logic, computing theory, and artificial intelligence. An instance of SAT is specified by a set of boolean variables and a propositional formula in conjunctive normal form. Given such an instance, the SAT problem asks whether there is a truth assignment to the variables such that the formula is satisfied. It is well known that SAT is in general NP-complete, although several important special cases can be solved in polynomial time. Semidefinite programming (SDP) refers to the class of optimization problems where a linear function of a matrix variable X is maximized (or minimized) subject to linear constraints on the elements of X and the additional constraint that X be positive semidefinite. We are interested in the application of SDP to satisfiability problems, and in particular in how SDP can be used to detect unsatisfiability. In this paper we introduce a new SDP relaxation for the satisfiability problem. This SDP relaxation arises from the recently introduced paradigm of higher liftings for constructing semidefinite programming relaxations of discrete optimization problems. To derive the SDP relaxation, we first formulate SAT as an optimization problem involving matrices. Relaxing this formulation yields an SDP which significantly improves on the previous relaxations in the literature. The important characteristics of the SDP relaxation are its ability to prove that a given SAT formula is unsatisfiable independently of the lengths of the clauses in the formula, its potential to yield truth assignments satisfying the SAT instance if a feasible matrix of sufficiently low rank is computed, and the fact that it is more amenable to practical computation than previous SDPs arising from higher liftings. We present theoretical and computational results that support these claims.Mathematics Subject Classification (2000): 20E28, 20G40, 20C20     

Determination of kinetic parameters of Cu(II) interaction with chemically modified thin chitosan membranes

In this work, vanillin-modified thin chitosan membranes were utilized as adsorbents for the removal of Cu(II) from aqueous solutions. A rise of temperature accelerates mass transfer of Cu(II) to the membranes surfaces. The kinetic data did present a rough fit to the traditional Lagergren adsorption kinetic equations. An alternative Avrami kinetic equation was successfully fitted to the kinetic adsorption quantities. From this new equation, from one to three regions presenting distinct kinetic parameters were found, and the use of the parameter n was also related to the determination of the kinetic orders. Variations of the adsorption rate in relation to the contact time and the temperature were also calculated and are discussed.