Applying sequential injection analysis (SIA) and response surface methodology for optimization of Fenton-based processes

This work presents the use of sequential injection analysis (SIA) and the response surface methodology as a tool for optimization of Fenton-based processes. Alizarin red S dye (C.I. 58005) was used as a model compound for the anthraquinones family. whose pigments have a large use in coatings industry. The following factors were considered: [H(2)O(2)]:[Alizarin] and [H(2)O(2)]:[FeSO(4)] ratios and pH. The SIA system was designed to add reagents to the reactor and to perform on-line sampling of the reaction medium, sending the samples to a flow-through spectrophotometer for monitoring the color reduction of the dye. The proposed system fed the statistical program with degradation data for fast construction of response surface plots. After optimization, 99.7% of the dye was degraded and the TOC content was reduced to 35% of the original value. Low reagents consumption and high sampling throughput were the remarkable features of the SIA system. (C) 2008 Published by Elsevier B.V.

Determination of sorbate and benzoate in beverage samples by capillary electrophoresis - Optimization of the method with inspection of ionic mobilities

The aim of this study was to develop a fast capillary electrophoresis method for the determination of benzoate and sorbate ions in commercial beverages. In the method development the pH and constituents of the background electrolyte were selected using the effective mobility versus pH curves. As the high resolution obtained experimentally for sorbate and benzoate in the studies presented in the literature is not in agreement with that expected from the ionic mobility values published, a procedure to determine these values was carried out. The salicylate ion was used as the internal standard. The background electrolyte was composed of 25 mmol L(-1) tris(hydroxymethyl)aminomethane and 12.5 mmol L(-1) 2-hydroxyisobutyric acid, atpH 8.1.Separation was conducted in a fused-silica capillary(32 cm total length and 8.5 cm effective length, 50 mu m I.D.), with short-end injection configuration and direct UV detection at 200 nm for benzoate and salicylate and 254 nm for sorbate ions. The run time was only 28 s. A few figures of merit of the proposed method include: good linearity (R(2) > 0.999), limit of detection of 0.9 and 0.3 mg L(-1) for benzoate and sorbate, respectively, inter-day precision better than 2.7% (n =9) and recovery in the range 97.9-105%. Beverage samples were prepared by simple dilution with deionized water (1:11, v/v). Concentrations in the range of 197-401 mg L(-1) for benzoate and 28-144 mg L(-1) for sorbate were found in soft drinks and tea. (c) 2008 Elsevier B.V. All rights reserved.

Optimization of the rheological properties of probiotic yoghurts supplemented with milk proteins

This study aimed to optimize the rheological properties of probiotic yoghurts supplemented with skimmed milk powder (SMP) whey protein concentrate (WPC) and sodium caseinate (Na-Cn) by using an experimental design type simplex-centroid for mixture modeling It Included seven batches/trials three were supplemented with each type of the dairy protein used three corresponding to the binary mixtures and one to the ternary one in order to increase protein concentration in 1 g 100 g(-1) of final product A control experiment was prepared without supplementing the milk base Processed milk bases were fermented at 42 C until pH 4 5 by using a starter culture blend that consisted of Streptococcus thermophilus Lactobacillus delbrueckii subsp bulgaricus and Bifidobacterium (Humans subsp lactis The kinetics of acidification was followed during the fermentation period as well the physico-chemical analyses enumeration of viable bacteria and theological characteristics of the yoghurts Models were adjusted to the results (kinetic responses counts of viable bacteria and theological parameters) through three regression models (linear quadratic and cubic special) applied to mixtures The results showed that the addition of milk proteins affected slightly acidification profile and counts of S thermophilus and B animal`s subsp lactis but it was significant for L delbrueckii subsp bulgaricus Partially-replacing SMP (45 g/100 g) with WPC or Na-Cn simultaneously enhanced the theological properties of probiotic yoghurts taking into account the kinetics of acidification and enumeration of viable bacteria (C) 2010 Elsevier Ltd All rights reserved

Use of Experimental Design for the Optimization of the Production of New Secondary Metabolites by Two Penicillium Species

A fractional factorial design approach has been used to enhance secondary metabolite production by two Penicillium strains. The method was initially used to improve the production of bioactive extracts as a whole and subsequently to optimize the production of particular bioactive metabolites. Enhancements of over 500% in secondary metabolite production were observed for both P. oxalicum and P. citrinum. Two new alkaloids, citrinalins A (5) and B (6), were isolated and identified from P. citrinum cultures optimized for production of minor metabolites.

Optimization of performances of gelatin/LiBF(4)-based polymer electrolytes by plasticizing effects

Gelatin is a cheap and abundant natural product with very good biodegradation properties and can be used to obtain acetic acid or LiClO(4)-based gel polymer electrolytes (GPEs) with high ionic conductivity and good stability. This article presents results of GPEs obtained by the plasticization of gelatin and addition of LiBF(4), where the optimization of the system was achieved by using a factorial design type 22 with two variables: glycerol and LiBF(4). From this analysis it was stated that the effect of glycerol as a plasticizer on the ionic conductivity results is much more important than the effect obtained by varying the lithium salt content or the effect of the interaction of both variables. Also all the samples were characterized by X-ray diffraction measurements, UV-vis-NIR spectroscopy and scanning electron microscopy (SEM) and impedance spectroscopy. The ionic conductivity results of all analyzed samples as a function of temperature obey predominantly an Arrhenius relationship and the samples are stable up to 160 degrees C. Good conductivity results combined with transparency and good adhesion to the electrodes have shown that gelatin-based GPEs are very promising materials to be used as solid electrolytes in electrochromic devices. (C) 2009 Elsevier Ltd. All rights reserved.

Studies toward the structural optimization of novel thiazolylhydrazone-based potent antitrypanosomal agents

In previous studies, we identified promising anti-Trypanosoma cruzi cruzain inhibitors based on thiazolylhydrazones. To optimize this series, a number of medicinal chemistry directions were explored and new thiazolylhydrazones and thiosemicarbazones were thus synthesized. Potent cruzain inhibitors were identified, such as thiazolylhydrazones 3b and 3j, which exhibited IC(50) of 200-400 nM. Furthermore, molecular docking studies showed concordance with experimentally derived structure-activity relationships (SAR) data. In the course of this work, lead compounds exhibiting in vitro activity against both the epimastigote and trypomastigote forms of T. cruzi were identified and in vivo general toxicity analysis was subsequently performed. Novel SAR were documented, including the importance of the thiocarbonyl carbon attached to the thiazolyl ring and the direct comparison between thiosemicarbazones and thiazolylhydrazones. (C) 2010 Elsevier Ltd. All rights reserved.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Task assignment optimization in SAP Extended WarehouseManagement

Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex and difficult taskregarding to the different processes and factors in a usual warehouse when we want tominimize the labor costs. Most of the workers’ working time is spent with travelingbetween source and destination points which cause deadheading. Even if a worker knowsthe structure of a warehouse well and because of that he or she can find the shortest pathbetween two points, it is still not guaranteed that there won’t be long traveling timebetween the locations of two consecutive tasks. We need optimal assignments betweentasks and workers.In the scientific literature Generalized Assignment Problem (GAP) is a wellknownproblem which deals with the assignment of m workers to n tasks consideringseveral constraints. The primary purpose of my thesis project was to choose a heuristics(genetic algorithm, tabu search or ant colony optimization) to be implemented into SAPExtended Warehouse Management (SAP EWM) by with task assignment will be moreeffective between tasks and resources.After system analysis I had to realize that due different constraints and businessdemands only 1:1 assingments are allowed in SAP EWM. Because of that I had to use adifferent and simpler approach – instead of the introduced heuristics – which could gainbetter assignments during the test phase in several cases. In the thesis I described indetails what ware the most important questions and problems which emerged during theplanning of my optimized assignment method.

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.

Train Dispatching: Heuristic Optimization

Train dispatchers faces lots of challenges due to conflicts which causes delays of trains as a result of solving possible dispatching problems the network faces. The major challenge is for the train dispatchers to make the right decision and have reliable, cost effective and much more faster approaches needed to solve dispatching problems. This thesis work provides detail information on the implementation of different heuristic algorithms for train dispatchers in solving train dispatching problems. The library data files used are in xml file format and deals with both single and double tracks between main stations. The main objective of this work is to build different heuristic algorithms to solve unexpected delays faced by train dispatchers and to help in making right decisions on steps to take to have reliable and cost effective solution to the problems. These heuristics algorithms proposed were able to help dispatchers in making right decisions when solving train dispatching problems.

Design/Evaluation of A Methodology For Performance Optimization Of Indexable Carbide Inserts

In this project, two broad facets in the design of a methodology for performance optimization of indexable carbide inserts were examined. They were physical destructive testing and software simulation.For the physical testing, statistical research techniques were used for the design of the methodology. A five step method which began with Problem definition, through System identification, Statistical model formation, Data collection and Statistical analyses and results was indepthly elaborated upon. Set-up and execution of an experiment with a compression machine together with roadblocks and possible solution to curb road blocks to quality data collection were examined. 2k factorial design was illustrated and recommended for process improvement. Instances of first-order and second-order response surface analyses were encountered. In the case of curvature, test for curvature significance with center point analysis was recommended. Process optimization with method of steepest ascent and central composite design or process robustness studies of response surface analyses were also recommended.For the simulation test, AdvantEdge program was identified as the most used software for tool development. Challenges to the efficient application of this software were identified and possible solutions proposed. In conclusion, software simulation and physical testing were recommended to meet the objective of the project.