Use of the q-Gaussian mutation in evolutionary algorithms

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.

Most of the patients presenting myocardial infarction would not be eligible for intensive lipid-lowering based on clinical algorithms or plasma C-reactive protein

Objective: The study we assessed how often patients who are manifesting a myocardial infarction (MI) would not be considered candidates for intensive lipid-lowering therapy based on the current guidelines. Methods: In 355 consecutive patients manifesting ST elevation MI (STEMI), admission plasma C-reactive protein (CRP) was measured and Framingham risk score (FRS), PROCAM risk score, Reynolds risk score, ASSIGN risk score, QRISK, and SCORE algorithms were applied. Cardiac computed tomography and carotid ultrasound were performed to assess the coronary artery calcium score (CAC), carotid intima-media thickness (cIMT) and the presence of carotid plaques. Results: Less than 50% of STEMI patients would be identified as having high risk before the event by any of these algorithms. With the exception of FRS (9%), all other algorithms would assign low risk to about half of the enrolled patients. Plasma CRP was <1.0 mg/L in 70% and >2 mg/L in 14% of the patients. The average cIMT was 0.8 +/- 0.2 mm and only in 24% of patients was >= 1.0 mm. Carotid plaques were found in 74% of patients. CAC > 100 was found in 66% of patients. Adding CAC >100 plus the presence of carotid plaque, a high-risk condition would be identified in 100% of the patients using any of the above mentioned algorithms. Conclusion: More than half of patients manifesting STEMI would not be considered as candidates for intensive preventive therapy by the current clinical algorithms. The addition of anatomical parameters such as CAC and the presence of carotid plaques can substantially reduce the CVD risk underestimation. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

Fractional Photothermolysis for the Treatment of Hypertrophic Scars: Clinical Experience of Eight Cases

Hypertrophic scars are common problems and represent a challenging condition to treat. Fractional photothermolysis has been effective at resurfacing photodamaged skin, acne scars, and atrophic scars, but there are few reports on its use for hypertrophic scars. To evaluate the safety and efficacy of 1,550-nm erbium-doped fiber laser treatment of hypertrophic scars in eight patients. Eight patients (skin phototypes II-IV) with hypertrophic scars received monthly treatments with a 1,550-nm erbium-doped fiber laser. Energy settings ranged from 35 to 50 mJ, and eight to 10 passes were applied with treatment levels 6 to 8. An independent physician evaluator assessed the treatment response by comparing pre- and posttreatment clinical photographs using a quartile grading scale (grade 1, <= 25%=minimal to no improvement; grade 2, 26-50%=moderate improvement; grade 3, 51-75%=marked improvement; grade 4, > 75%=near total improvement. At four weeks after the last treatment session, a mean grade of 2.4 was achieved based on an independent physician`s clinical assessment. Improvement in pigmentation occurred in all hyperpigmented scars. Hypertrophic scars can be effectively and safely improved with 1,550-nm erbium-doped fiber laser treatment. The authors have indicated no significant interest with commercial supporters.

Elevated left and reduced right orbitomedial prefrontal fractional anisotropy in adults with bipolar disorder revealed by tract-based spatial statistics

Context Diffusion tensor imaging (DTI) studies in adults with bipolar disorder (BD) indicate altered white matter (WM) in the orbitomedial prefrontal cortex (OMPFC), potentially underlying abnormal prefrontal corticolimbic connectivity and mood dysregulatioin in BD. Objective: To use tract-based spatial statistics (TBSS) to examine VVM skeleton (ie, the most compact whole-brain WM) in subjects with BD vs healthy control subjects. Design: Cross-sectional, case-control, whole-brain DTI using TBSS. Setting: University research institute. Participants: Fifty-six individuals, 31 having a DSM-IV diagnosis of BD type 1 (mean age, 35.9 years [age range, 24-52 years]) and 25 controls (mean age, 29.5 years [age range, 19-52 years]). Main Outcome Measures: Fractional anisotropy (FA) longitudinal and radial diffusivities in subjects with BD vs controls (covarying for age) and their relationships with clinical and demographic variables. Results: Subjects with BD vs controls had significantly greater FA (t > 3.0, P <=.05 corrected) in the left uncinate fasciculus (reduced radial diffusivity distally and increased longitudinal diffusivity centrally), left optic radiation (increased longitudinal diffusivity), and right anterothalamic radiation (no significant diffusivity change). Subjects with BD vs controls had significantly reduced FA (t > 3.0, P <=.05 corrected) in the right uncinate fasciculus (greater radial diffusivity). Among subjects with BD, significant negative correlations (P <.01) were found between age and FA in bilateral uncinate fasciculi and in the right anterothalamic radiation, as well as between medication load and FA in the left optic radiation. Decreased FA (P <.01) was observed in the left optic radiation and in the right anterothalamic radiation among subjects with BD taking vs those not taking mood stabilizers, as well as in the left optic radiation among depressed vs remitted subjects with BD. Subjects having BD with vs without lifetime alcohol or other drug abuse had significantly decreased FA in the left uncinate fasciculus. Conclusions: To our knowledge, this is the first study to use TBSS to examine WM in subjects with BD. Subjects with BD vs controls showed greater WM FA in the left OMPFC that diminished with age and with alcohol or other drug abuse, as well as reduced WM FA in the right OMPFC. Mood stabilizers and depressed episode reduced WM FA in left-sided sensory visual processing regions among subjects with BD. Abnormal right vs left asymmetry in FA in OMPFC WM among subjects with BD, likely reflecting increased proportions of left-sided longitudinally aligned and right-sided obliquely aligned myelinated fibers, may represent a biologic mechanism for mood dysregulation in BD.

A hybrid approach to learn with imbalanced classes using evolutionary algorithms

There is an increasing interest in the application of Evolutionary Algorithms (EAs) to induce classification rules. This hybrid approach can benefit areas where classical methods for rule induction have not been very successful. One example is the induction of classification rules in imbalanced domains. Imbalanced data occur when one or more classes heavily outnumber other classes. Frequently, classical machine learning (ML) classifiers are not able to learn in the presence of imbalanced data sets, inducing classification models that always predict the most numerous classes. In this work, we propose a novel hybrid approach to deal with this problem. We create several balanced data sets with all minority class cases and a random sample of majority class cases. These balanced data sets are fed to classical ML systems that produce rule sets. The rule sets are combined creating a pool of rules and an EA is used to build a classifier from this pool of rules. This hybrid approach has some advantages over undersampling, since it reduces the amount of discarded information, and some advantages over oversampling, since it avoids overfitting. The proposed approach was experimentally analysed and the experimental results show an improvement in the classification performance measured as the area under the receiver operating characteristics (ROC) curve.

Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms

J.A. Ferreira Neto, E.C. Santos Junior, U. Fra Paleo, D. Miranda Barros, and M.C.O. Moreira. 2011. Optimal subdivision of land in agrarian reform projects: an analysis using genetic algorithms. Cien. Inv. Agr. 38(2): 169-178. The objective of this manuscript is to develop a new procedure to achieve optimal land subdivision using genetic algorithms (GA). The genetic algorithm was tested in the rural settlement of Veredas, located in Minas Gerais, Brazil. This implementation was based on the land aptitude and its productivity index. The sequence of tests in the study was carried out in two areas with eight different agricultural aptitude classes, including one area of 391.88 ha subdivided into 12 lots and another of 404.1763 ha subdivided into 14 lots. The effectiveness of the method was measured using the shunting line standard value of a parceled area lot`s productivity index. To evaluate each parameter, a sequence of 15 calculations was performed to record the best individual fitness average (MMI) found for each parameter variation. The best parameter combination found in testing and used to generate the new parceling with the GA was the following: 320 as the generation number, a population of 40 individuals, 0.8 mutation tax, and a 0.3 renewal tax. The solution generated rather homogeneous lots in terms of productive capacity.

Extending the use of canonical and microcanonical Monte Carlo algorithms to spin models

We describe the canonical and microcanonical Monte Carlo algorithms for different systems that can be described by spin models. Sites of the lattice, chosen at random, interchange their spin values, provided they are different. The canonical ensemble is generated by performing exchanges according to the Metropolis prescription whereas in the microcanonical ensemble, exchanges are performed as long as the total energy remains constant. A systematic finite size analysis of intensive quantities and a comparison with results obtained from distinct ensembles are performed and the quality of results reveal that the present approach may be an useful tool for the study of phase transitions, specially first-order transitions. (C) 2009 Elsevier B.V. All rights reserved.

Fractional quantum Hall effect in second subband of a 2DES

In the present paper we report on the experimental electron sheet density vs. magnetic field diagram for the magnetoresistance R(xx) of a two-dimensional electron system (2DES) with two occupied subbands. For magnetic fields above 9T, we found fractional quantum Hall levels centered around the filing factor v = 3/2 in both the two occupied electric subbands. We focused specially on the fractional levels of the second subband, whose experimental values of the magnetic field B of their minima do not obey a periodicity law in 1/|B-B(c)|, where B(c) is the critical field at the filling factor v = 3/2, and we explain this fact entirely in the framework of the composite fermions theory. We use a simple theoretical model to give a possible explanation for the fact. Copyright (c) EPLA, 2011

Integer and fractional microwave induced resistance oscillations in a 2D system with moderate mobility

We report on integer and fractional microwave-induced resistance oscillations in a 2D electron system with high density and moderate mobility, and present results of measurements at high microwave intensity and temperature. Fractional microwave-induced resistance oscillations occur up to fractional denominator 8 and are quenched independently of their fractional order. We discuss our results and compare them with existing theoretical models. (C) 2009 Elsevier B.V. All rights reserved.

A novel MAP-MRF approach for multispectral image contextual classification using combination of suboptimal iterative algorithms

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

Sr-Nd isotopic evidence for crustal contamination in the Niquelandia complex, Goias, Central Brazil

The Niquelandia complex is a Neoproterozoic mafic-ultramafic intrusion resulting from fractional crystallization of primary picritic basalt intrusions. It consists of two layered sequences: a lower and larger one (LS), where four stratigraphic units exhibit an upward decrease of ultramafic layers and increase of gabbroic layers; an upper, smaller sequence (US), separated from LS by a high-temperature shear zone and consisting of two stratigraphic units (gabbros + anorthosites and amphibolites). Nd and Sr isotopic analyses and rare earth element (REE) profiles provide evidence that the complex suffered important crustal contamination. The LS isotopic array trends from a DM region with positive epsilon Nd and moderately positive epsilon Sr towards a field occupied by crustal xenoliths, especially abundant in the upper LS (negative epsilon Nd and large, positive E:Sr). Each LS stratigraphic unit is distinct from the next underlying unit, showing lower epsilon Nd and higher epsilon Sr, suggesting inputs of fresh magma and mixing with the contaminated, residual magma. The US is characterised by a relatively high variation of epsilon Nd and constant epsilon Sr. REE patterns vary within each unit from LREE depleted to LREE enriched in the samples having lower epsilon Nd and higher epsilon Sr. The contamination process has been modelled by using the EC-AFC algorithms from [Spera, F.J., Bohrson, W.A., 2001. Energy-constrained open-system magmatic processes 1: general model and energy-constrained assimilation and fractional crystallization (EC-AFC) formulation. J. Petrology 42, 999-1018]. The differences between the LS and US isotopic arrays are consistent with contamination by the same crustal component, provided that its melting degree was higher in LS than in US. The different degrees of anatexis are explained by the heat budget released from the magma, higher in LS (because of its larger mass) than in US. Comparison of the correlations between isotopes and incompatible trace element ratios of the models and of the gabbros shows some differences, which are demonstrably related with the variable amount of cumulus phases and trapped melt in the gabbros. (c) 2007 Elsevier Ltd. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.