Spot-test identification and rapid quantitative sequential analysis of dipyrone

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

Sequential injection analysis system with spectrophotometric detection for determination of norfloxacin and ciprofloxacin in pharmaceutical formulations

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

Phosphite determination in fertilizers after online sequential sample preparation in a flow injection system

A flow injection spectrophotometric system is proposed for phosphite determination in fertilizers by the molybdenum blue method after the processing of each sample two times on-line without and with an oxidizing step. The flow system was designed to add sulfuric acid or permanganate solutions alternately into the system by simply displacing the injector-commutator from one resting position to another, allowing the determination of phosphate and total phosphate, respectively. The concentration of phosphite is obtained then by difference between the two measurents. The influence of flow rates, sample volume, and dimension of flow line connecting the injector-commutator to the main analytical channel was evaluated. The proposed method was applied to phosphite determination in commercial liquid fertilizers. Results obtained with the proposed FIA system were not statistically different from those obtained by titrimetry at the 95% confidence level. In addition, recoveries within 94 and 100% of spiked fertilizers were found. The relative standard deviation (n = 12) related to the phosphite-converted-phosphate peak alone was <= 3.5% for 800 mg L-1 P (phoshite) solution. Precision due to the differences of total phosphate and phosphate was 1.1% for 10 mg L-1 P (phosphate) + 3000 mg L-1 P (phosphite) solution. The sampling rate was calculated as 15 determinations per hour, and the reagent consumption was about 6.3 mg of KMnO4, 200 mg of (NH4)(6)Mo7O24 center dot 4H(2)O, and 40 mg of ascorbic acid per measurement.

Design and management optimization of trickle irrigation systems using non-linear programming

A non-linear model is presented which optimizes the lay-out, as well as the design and management of trickle irrigation systems, to achieve maximum net benefit. The model consists of an objective function that maximizes profit at the farm level, subject to appropriate geometric and hydraulic constraints. It can be applied to rectangular shaped fields, with uniform or zero slope. The software used is the Gams-Minos package. The basic inputs are the crop-water-production function, the cost function and cost of system components, and design variables. The main outputs are the annual net benefit and pipe diameters and lengths. To illustrate the capability of the model, a sensitivity analysis of the annual net benefit for a citrus field is evaluated with respect to irrigated area, ground slope, micro-sprinkler discharge and shape of the field. The sensitivity analysis suggests that the greatest benefit is obtained with the smallest microsprinkler discharge, the greatest area, a square field and zero ground slope. The costs of the investment and energy are the components of the objective function that had the greatest effect in the 120 situations evaluated. (C) 1996 Academic Press Limited

Periodic orbits for a class of reversible quadratic vector field on R-3

For a class of reversible quadratic vector fields on R-3 we study the periodic orbits that bifurcate from a heteroclinic loop having two singular points at infinity connected by an invariant straight line in the finite part and another straight line at infinity in the local chart U-2. More specifically, we prove that for all n is an element of N, there exists epsilon(n) > 0 such that the reversible quadratic polynomial differential systemx = a(0) + a(1y) + a(3y)(2) + a(4Y)(2) + epsilon(a(2x)(2) + a(3xz)),y = b(1z) + b(3yz) + epsilon b(2xy),z = c(1y) +c(4az)(2) + epsilon c(2xz)in R-3, with a(0) < 0, b(1)c(1) < 0, a(2) < 0, b(2) < a(2), a(4) > 0, c(2) < a(2) and b(3) is not an element of (c(4), 4c(4)), for epsilon is an element of (0, epsilon(n)) has at least n periodic orbits near the heteroclinic loop. (c) 2007 Elsevier B.V. All rights reserved.

A flow-injection-ICP system sequential multielemental analysis with simultaneously mercury(II) preconcentration step

A flow-injection system for multielemental analysis with a mercury(II) preconcentration step using a resin Chelite-S(R)(Serva Feinbiochemica Heidelberg, Part No. 41709) packed minicolumn by inductively coupled plasma atomic emission spectroscopy is described. A mercury reductive elution procedure with a mixture of SnCl2/HCl was used, which allows use of 6 mol/L HCl solution instead of concentrated hydrochoric acid. The main parameters related to ICP operation, such as radio frequency power (950-1750 W), auxiliary argon flow (0.0-1.5 L/min) and spray chamber nebulizer pressure (15-35 psi), were studied. Optimization of the FIA system was reached by defining the best eluent carrier stream (1.4-2.8 mL/min), Hgdegrees carrier stream (10-40 mL min(-1)), loading time (0.5-4.0 min), sample flow rate (1.25-10.0 mL/min), temperature of reactor gas liquid separator (GLS) (25-75 degreesC) and eluent volume (50-350 muL). Throughput is around 30 samples per hour for analytical solutions within the range 50-2500 ng Hg(II)/L. Results from certified material showed good precision (RSD < 3%, n = 12) and no statistical difference was observed for real samples analyzed by AAS and by the proposed system.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

A heuristic method for reactive power planning

An approach for solving reactive power planning problems is presented, which is based on binary search techniques and the use of a special heuristic to obtain a discrete solution. Two versions were developed, one to run on conventional (sequential) computers and the other to run on a distributed memory (hypercube) machine. This latter parallel processing version employs an asynchronous programming model. Once the set of candidate buses has been defined, the program gives the location and size of the reactive sources needed(if any) in keeping with operating and security constraints.

Simple orbit determination using GPS based on a least-squares algorithm employing sequential givens rotations

A low-cost computer procedure to determine the orbit of an artificial satellite by using short arc data from an onboard GPS receiver is proposed. Pseudoranges are used as measurements to estimate the orbit via recursive least squares method. The algorithm applies orthogonal Givens rotations for solving recursive and sequential orbit determination problems. To assess the procedure, it was applied to the TOPEX/POSEIDON satellite for data batches of one orbital period (approximately two hours), and force modelling, due to the full JGM-2 gravity field model, was considered. When compared with the reference Precision Orbit Ephemeris (POE) of JPL/NASA, the results have indicated that precision better than 9 m is easily obtained, even when short batches of data are used. Copyright (c) 2007.

Bound states of the Dirac equation for a class of effective quadratic plus inversely quadratic potentials

The Dirac equation is exactly solved for a pseudoscalar linear plus Coulomb-like potential in a two-dimensional world. This sort of potential gives rise to an effective quadratic plus inversely quadratic potential in a Sturm-Liouville problem, regardless the sign of the parameter of the linear potential, in sharp contrast with the Schrodinger case. The generalized Dirac oscillator already analyzed in a previous work is obtained as a particular case. (C) 2004 Elsevier B.V. All rights reserved.

A simple mechanism to deal with sequential code in dataflow architectures

The aim of this work is to propose a simple and efficient mechanism to deal with the problem of executing sequential code in a pure dataflow machine. Our results is obtained with a simulator of Wolf [4] architecture. The implemented mechanism improved the architecture performance when executing sequential code and we expect that this improvement could be better if we use some heuristics to deal with some special groups of instructions such as branch operations. Further research will show us if this is true.

Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

Batch, sequential and hybrid approaches to spacecraft sensor alignment estimation

Two Kalman-filter formulations are presented for the estimation of spacecraft sensor misalignments from inflight data. In the first the sensor misalignments are part of the filter state variable; in the second, which we call HYLIGN, the state vector contains only dynamical variables, but the sensitivities of the filter innovations to the misalignments are calculated within the Kalman filter. This procedure permits the misalignments to be estimated in batch mode as well as a much smaller dimension for the Kalman filter state vector. This results not only in a significantly smaller computational burden but also in a smaller sensitivity of the misalignment estimates to outliers in the data. Numerical simulations of the filter performance are presented.

Sequential spectrophotometric determination of chromium(III) and chromium(VI) using flow injection analysis

A flow injection analysis (FIA) procedure for the speciation of Cr(III) and Cr(VI) using the 1,5-diphenylcarbazide (DPC) method is presented. As Cr(III) does not interfere in the Cr(VI) - DPC reaction, both Cr(VI) and total chromium [after the on-line oxidation of Cr(III) by Ce(IV)] are sequentially determined. Cr(III) is obtained by difference. Under the experimental conditions described, the calibration graphs are linear up to 2 μg mh1 of Cr(VI) and 4 μg ml-1 of Cr(III). The detection limits found were 18 ng ml -1 for Cr(VI) and 55 ng ml-1 for Cr(III), at a signal to noise ratio of 3. The common interfering elements in the Cr(VI) - DPC reaction were investigated under dynamic FIA conditions. The FIA method was also compared with the conventional spectrophotometric procedure.