An integrated system to remote monitor and control anaerobic wastewater treatment plants through the internet.

The TELEMAC project brings new methodologies from the Information and Science Technologies field to the world of water treatment. TELEMAC offers an advanced remote management system which adapts to most of the anaerobic wastewater treatment plants that do not benefit from a local expert in wastewater treatment. The TELEMAC system takes advantage of new sensors to better monitor the process dynamics and to run automatic controllers that stabilise the treatment plant, meet the depollution requirements and provide a biogas quality suitable for cogeneration. If the automatic system detects a failure which cannot be solved automatically or locally by a technician, then an expert from the TELEMAC Control Centre is contacted via the internet and manages the problem.     

Optimal management of logistic activities in multi-site environments

The new emerging area of Enterprise Wide Optimization (EWO) has focused the attention in effectively solving the combined production/distribution scheduling problem. The importance of logistic activities performed in multi-site environments comes from the relative magnitude of the associated transportation costs and the good chance of getting large savings on such expenses. This paper first develops an exact MILP mathematical formulation for the multiple vehicle time-window-constrained pickup and delivery (MVPDPTW) problem. The approach is able to account for many-to-many transportation requests, pure pickup and delivery tasks, heterogeneous vehicles and multiple depots. Optimal solutions for a variety of benchmark problems with cluster/random distributions of pickup and delivery locations and limited sizes in terms of customer requests and vehicles have been discovered. However, the computational cost exponentially grows with the number of requests. For large-scale m-PDPTW problems, a local search improvement algorithm steadily providing a better solution through two evolutionary steps is also presented. A neighborhood structure around the starting solution is generated by first allowing multiple request exchanges among nearby trips and then permitting the reordering of nodes on every individual route. If a better set of routes is found, both steps are repeated until no improved solution is discovered. Compact MILP mathematical formulations for both sub-problems have been developed and solved through an efficient branch-and-bound algorithm. A significant number of large-scale m-PDPTW benchmark problems, some of them including up to 100 transportation requests, were successfully solved in reasonable CPU times.     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

Comparison of a modified Sugiura procedure with portal systemic shunt for prevention of recurrent variceal bleeding in cirrhosis

BACKGROUND: There is no agreement on the management of patients with cirrhosis and recurrent variceal bleeding after failure of medical or endoscopic treatments or both. Portal systemic shunts are highly effective in preventing rebleeding but are associated with a high incidence of chronic encephalopathy. This study compared the results of a slightly modified Sugiura procedure (esophageal transection plus esophagogastric devascularization plus splenectomy) with those of nonselective portal systemic shunts in patients with previous variceal bleeding. METHODS: Fifty-four patients were included in this randomized controlled study between January 1984 and April 1989. The major end point was chronic encephalopathy. Secondary end points were recurrent variceal bleeding, survival, ascites, and hepatocellular carcinoma. RESULTS: Twenty-seven patients were assigned to each group. The rate of chronic encephalopathy was significantly (p = 0.002) lower after modified Sugiura procedure than after portal systemic shunt. Recurrent variceal bleeding was more frequent after modified Sugiura procedure than after portal systemic shunt, but the difference is not significant. One-, two-, and three-year survival rates were 93%, 81%, and 67%, respectively, in the modified Sugiura group and 78%, 66%, and 39%, respectively, in the portal systemic shunt group (p = 0.044). CONCLUSIONS: These results suggest that the modified Sugiura procedure is better overall than the nonselective portal systemic shunt in the management of patients with cirrhosis and recurrent variceal bleeding. Although the rebleeding rate is higher after the modified Sugiura procedure, this does not seem to affect mortality in these patients.     

Transmission loss allocation through equivalent bilateral exchanges and economical analysis

A new loss allocation (LA) scheme based on the principle of equivalent bilateral exchanges (EBEs) is presented and compared with other available techniques. Formulation and results from extensive simulations including consistency tests show that the suggested methodology has several desirable properties: It is flow-based, requiring only a solved load flow for its implementation; it is not dependent on the choice of a slack bus; it is straightforward to apply; undesirable negative loss allocation is not produced; and low volatilities are shaped. An economic analysis with various LA methods is also carried out when these are integrated into a combined economic dispatch/load flow dispatch strategy, a likely scenario for LA in a real system. This combined dispatch strategy yields prices charged to the loads and rates received by the generators that account for loss allocation and loss supply. Results show that these economic indexes are very close to the marginal costs derived from an optimal power flow (OPF) approach with the advantage of reducing volatility.     

Bioactivity of antifouling paints based on organotin toxicants

This paper discusses the bioactivity of antifouling paints based on organotin toxicants, such as tributyltin fluoride (TBTF) and triphenyltin fluoride (TPTF). These compounds were used alone or mixed as the main toxicant in formulations. The use of TPTF or mixtures of TPTF and TBTF, with vinyl binders, led to paints with satisfactory bioactivity during a 24 months immersion period. With the same binders, TBTF alone provided only 12 months of antifouling protection. The correlation coefficients calculated from the fouling attachment values and the rosin content in the binder showed that the bioactivity of the tested formulations depended on the solubility of the toxicant in sea water and on the composition and solubility of the binders.     

Epoxide polymerization

Summary Poly(propylene oxide), PPO, obtained using diphenylzinc, Ph₂Zn, and using the diphenylzinc-water system at various molar ratios H₂O/Ph₂Zn, were studied through ¹H NMR and IR spectroscopy establishing that the polymerization initiates by coordition of propylene oxide (PO) to a terminal zinc atom of the active species followed by consecutive insertions of PO units at this zinc atom. The PPO obtained showed Ph-and HO-, HO-and HO-end-groups depending on the molar ratio H₂O/Ph²Zn used, and also HO-and PhO-end-groups when oxygen was present in the polymerization system.     

Integrating scheduling and control functions in computer integrated manufacturing using artificial intelligence

Proper integration of scheduling and control in Flexible Manufacturing Systems will make available the required level of decision-making capacity to provide a flexibly-automated, efficient, and quality manufacturing process. To achieve this level of integration, the developments in computer technology and sophisticated techniques of artificial intelligence (AI) should be applied to such FMS functions as scheduling. In this paper, we present an Intelligent Scheduling System for FMS under development that makes use of the integration of two AI technologies. These two AI technologies — Neural Networks and Expert Systems — provide the intelligence that the scheduling function requires in order to generate goodschedules within the restrictions imposed by real-time problems. Because the system has the ability to plan ahead and learn, it has a higher probability of success than conventional approaches. The adaptive behavior that will be achieved contribute to the integration of scheduling and control in FMS.     

Longitudinal investigation of the abstinence violation effect in binge eaters.

This study, guided in part by G. A. Marlatt and J. R. Gordon's (1985) abstinence violation effect (AVE) model, examined whether variability in cognitive and emotional reactions to binges accounts for recurrence of binge eating. Attributional, cognitive, and affective reactions to 2 successive binges, as well as the latencies between each binge and a subsequent binge, were evaluated through a series of structured phone interviews with 50 nonpurging normal-weight female bingers. Reported mood after binging was unrelated to binge latency. However, when Ss made more intense internal, global, and uncontrollable causal attributions for a binge, a subsequent binge followed significantly sooner. Within-subject variations in AVEs across binges prospectively predicted within-subject variations in the speed with which another binge followed. Analyses suggested that cognitive states (e.g., AVE and guilt) evoked by particular events were better predictors of how quickly binging repeats than were stable differences in attributional style. (PsycINFO Database Record (c) 2010 APA, all rights reserved)