Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.

Effect of Fill Time on the Performance of Pilot-scale ASBR and AnSBBR Applied to Sanitary Wastewater Treatment

Many lab-scale studies have been carried out regarding the effect of feed strategy on the performance of anaerobic sequencing batch reactors (ASBR); however, more detailed pilot-scale studies should be performed to assess the real applicability of this type of operation. Therefore, the objective of this work was to assess the effect of feed strategy or fill time in a 1-m(3) mechanically stirred pilot-scale sequencing batch reactor, treating 0.65 m(3) sanitary wastewater in 8-h cycles at ambient temperature. Two reactor configurations were used: one containing granular biomass (denominated ASBR) and the other immobilized biomass on polyurethane foam as inert support (denominated anaerobic sequencing batch biofilm reactor (AnSBBR)). The reactors were operated under five distinct feed strategies, namely: typical batch and fed-batch for 25%, 50%, 75%, and 100% of the cycle length. Stirring frequency in the ASBR was 40 rpm with two flat-blade turbine impellers and 80 rpm in the AnSBBR with two helix impellers. The results showed that both the ASBR and AnSBBR when operated under typical batch, fed-batch for 50% and 75% of the cycle length, presented improved organic matter removal efficiencies, without significant differences in performance, thus showing important operational flexibility. In addition, the reactors presented operation stability under all conditions.

Buckling and post-buckling of extensible rods revisited: A multiple-scale solution

An exact non-linear formulation of the equilibrium of elastic prismatic rods subjected to compression and planar bending is presented, electing as primary displacement variable the cross-section rotations and taking into account the axis extensibility. Such a formulation proves to be sufficiently general to encompass any boundary condition. The evaluation of critical loads for the five classical Euler buckling cases is pursued, allowing for the assessment of the axis extensibility effect. From the quantitative viewpoint, it is seen that such an influence is negligible for very slender bars, but it dramatically increases as the slenderness ratio decreases. From the qualitative viewpoint, its effect is that there are not infinite critical loads, as foreseen by the classical inextensible theory. The method of multiple (spatial) scales is used to survey the post-buckling regime for the five classical Euler buckling cases, with remarkable success, since very small deviations were observed with respect to results obtained via numerical integration of the exact equation of equilibrium, even when loads much higher than the critical ones were considered. Although known beforehand that such classical Euler buckling cases are imperfection insensitive, the effect of load offsets were also looked at, thus showing that the formulation is sufficiently general to accommodate this sort of analysis. (c) 2008 Elsevier Ltd. All rights reserved.

Recycling Krylov subspaces for efficient large-scale electrical impedance tomography

Electrical impedance tomography (EIT) captures images of internal features of a body. Electrodes are attached to the boundary of the body, low intensity alternating currents are applied, and the resulting electric potentials are measured. Then, based on the measurements, an estimation algorithm obtains the three-dimensional internal admittivity distribution that corresponds to the image. One of the main goals of medical EIT is to achieve high resolution and an accurate result at low computational cost. However, when the finite element method (FEM) is employed and the corresponding mesh is refined to increase resolution and accuracy, the computational cost increases substantially, especially in the estimation of absolute admittivity distributions. Therefore, we consider in this work a fast iterative solver for the forward problem, which was previously reported in the context of structural optimization. We propose several improvements to this solver to increase its performance in the EIT context. The solver is based on the recycling of approximate invariant subspaces, and it is applied to reduce the EIT computation time for a constant and high resolution finite element mesh. In addition, we consider a powerful preconditioner and provide a detailed pseudocode for the improved iterative solver. The numerical results show the effectiveness of our approach: the proposed algorithm is faster than the preconditioned conjugate gradient (CG) algorithm. The results also show that even on a standard PC without parallelization, a high mesh resolution (more than 150,000 degrees of freedom) can be used for image estimation at a relatively low computational cost. (C) 2010 Elsevier B.V. All rights reserved.

Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil

In this paper, we consider a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries that occurs in a major Brazilian retail group. A single depot attends 519 stores of the group distributed in 11 Brazilian states. To find good solutions to this problem, we propose heuristics as initial solutions and a scatter search (SS) approach. Next, the produced solutions are compared with the routes actually covered by the company. Our results show that the total distribution cost can be reduced significantly when such methods are used. Experimental testing with benchmark instances is used to assess the merit of our proposed procedure. (C) 2008 Published by Elsevier B.V.

On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain

We consider in this paper the optimal stationary dynamic linear filtering problem for continuous-time linear systems subject to Markovian jumps in the parameters (LSMJP) and additive noise (Wiener process). It is assumed that only an output of the system is available and therefore the values of the jump parameter are not accessible. It is a well known fact that in this setting the optimal nonlinear filter is infinite dimensional, which makes the linear filtering a natural numerically, treatable choice. The goal is to design a dynamic linear filter such that the closed loop system is mean square stable and minimizes the stationary expected value of the mean square estimation error. It is shown that an explicit analytical solution to this optimal filtering problem is obtained from the stationary solution associated to a certain Riccati equation. It is also shown that the problem can be formulated using a linear matrix inequalities (LMI) approach, which can be extended to consider convex polytopic uncertainties on the parameters of the possible modes of operation of the system and on the transition rate matrix of the Markov process. As far as the authors are aware of this is the first time that this stationary filtering problem (exact and robust versions) for LSMJP with no knowledge of the Markov jump parameters is considered in the literature. Finally, we illustrate the results with an example.

Cognitive functioning in subjects with recent-onset psychosis from a low-middle-income environment: Multiple-domain deficits and longitudinal evaluation

Cognitive deficits are a key feature of recent-onset psychosis, but there is no consensus on whether such deficits are generalized or confined to specific domains. Besides, it is unclear whether cognitive deficits: a) are found in psychotic patients in samples from outside high-income countries; and b) whether they progress uniformly over time in schizophrenia and affective psychoses. We applied 12 tests organized into eight cognitive domains, comparing psychosis patients (n = 56, time from initial contact = 677.95+/-183.27 days) versus healthy controls (n = 70) recruited from the same area of Sao Paulo, Brazil. Longitudinal comparisons (digit span and verbal fluency) were conducted between a previous assessment of the subjects carried out at their psychosis onset, and the current follow-up evaluation. Psychosis patients differed significantly from controls on five domains, most prominently on verbal memory. Cognitive deficits remained detectable in separate comparisons of the schizophrenia subgroup and, to a lesser extent, the affective psychosis subjects against controls. Longitudinal comparisons indicated significant improvement in schizophrenia, affective psychoses, and control subjects, with no significant group-by-time interactions. Our results reinforce the view that there are generalized cognitive deficits in association with recent-onset psychoses, particularly of non-affective nature, which persist over time. (C) 2009 Elsevier Ireland Ltd. All rights reserved.

Multiple cranial burr holes as an alternative treatment for total scalp avulsion

Total scalp avulsion is a devastating injury in clinical practice. It often occurs in female adults, being rare in children. The standard treatment for scalp avulsion is microsurgical replantation, when feasible. Coverage becomes a major problem when replantation fails or is contraindicated, resulting in significant morbidity and requiring multiple procedures. In this article, in addition to reviewing the literature, we report a historical method for obtaining skin coverage after failure of replantation. The authors report a case of a 10-year-old girl who had her scalp totally avulsed by an agricultural machine, including her right auricle. Microsurgery scalp replantation was attempted immediately after fluid resuscitation. The surgery failed probably due to the long time interval between trauma and surgery, which resulted in total ischemic time of 11 h and consequently made vascular microanastomosis impracticable. Multiple trephination of the calvarium was performed in order to expose the diploe. After 4 weeks, granulation tissue from the holes began to cover the defect, allowing the formation of a vascular bed suitable for skin grafting. Total scalp avulsion in children is seldom reported in the literature. Therefore, its management is both difficult and challenging. The exposure of the diploe with multiple burr holes is a safe and effective method for treating this injury. It may be considered, along with skin grafting, a good therapeutic alternative to be used when microsurgical replantation fails or is not feasible.