Dynamic viscosity of binary and ternary mixtures containing poly(ethylene glycol), potassium phosphate, and water

Dynamic viscosity of binary mixtures of poly(ethylene glycol) molar mass 1500 da + water, potassium phosphate + water, and ternary mixtures of poly(ethylene glycol) molar mass 1500 da + potassium phosphate + water were determined at 303.15 K Binary and ternary mixture viscosities showed a direct logarithm-type relation with the increase of poly(ethylene glycol) and potassium phosphate contents. The models used for viscosity correlation gave a good fit to the experimental data.

Spectrophotometric study of binary and ternary systems involving metal ions and benzylidenepyruvates: Equilibria in aqueous solutions

The protonation of 4-dimethylaminobenzylidenepyruvate (DMBP) and 2-chloro-4-dimethylaminobenzylidenepyruvate (2-CI-DMBP) and their complex formation with Mn(II), Co(II), Ni(II), Cu(II), Zn(II), Pb(II), Cd(II) and Al(III) have been studied by potentiometric and spectrophotometric methods at 25 °C and ionic strength 0.500 M, held with sodium perchlorate. The stability order found for 1 :1 complexes of both ligands is Al(III) > Cu(II) > Pb(II) > Ni(II) > Zn(II) > Co(II) > Cd(II) > Mn(II). The stability changes move in the same direction as the pKa of the ligands. The results are compared with literature values reported for metal ion pyruvate systems. Thermodynamic stabilities of ternary complexes formed in Cu(II)-B-L- systems, where B = 2,2′-bipyridyl (bipy), ethylenediamine or glycinate and L = DMBP or 2-CI-DMBP, were also determined. The Cu(bipy)L+ species are more stable than would be expected on purely statistical grounds. The importance of the :t system associated with bipy on the enhanced stability of its mixed ligand complexes is stressed. Analytical applications of the investigated ligands are outlined.

Stability of curcumin microencapsulated by spray and freeze drying in binary and ternary matrices of maltodextrin, gum arabic and modified starch

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

Microencapsulation of turmeric oleoresin in binary and ternary blends of gum arabic, maltodextrin and modified starch

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

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Special subsets and optimum codes based on lattices and cosets

This paper introduces the concept of special subsets when applied to generator matrices based on lattices and cosets as presented by Calder-bank and Sloane. By using the special subsets we propose a non exhaustive code search for optimum codes. Although non exhaustive, the search always results in optimum codes for given (k1, V, Λ/Λ′). Tables with binary and ternary optimum codes to partitions of lattices with 8, 9 e 16 cosets, were obtained.

Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem

This paper studies the use of different population structures in a Genetic Algorithm (GA) applied to lot sizing and scheduling problems. The population approaches are divided into two types: single-population and multi-population. The first type has a non-structured single population. The multi-population type presents non-structured and structured populations organized in binary and ternary trees. Each population approach is tested on lot sizing and scheduling problems found in soft drink companies. These problems have two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to simultaneously determine the lot sizing and scheduling of raw materials in tanks and products in lines. Computational results are reported allowing determining the better population structure for the set of problem instances evaluated. Copyright 2008 ACM.

Análise do comportamento de queima de argilas e formulações para revestimento cerâmico

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

'Ti''O IND.2'/'Sn''O IND. 2 modificado com 'Ag IND. 2''O', para obtenção de fotocatalisadores

Pós-graduação em Química - IQ

Novas estratégias no estudo da eletro-oxidação de etanol: nanocatalisadores multimetálisos e análises dos produtos de reação

Pós-graduação em Química - IQ

Estudo do comportamento eletroquímico e da resistência a corrosão de eletrodepósitos de ligas ZnFe e ZnFeCo para proteção de aço

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Sistemas nanoestruturados mucoadesivos para administração nasal de zidovudina

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

Mean motion resonances and the stability of a circumbinary disk in a triple stellar system

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

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.