974 resultados para Multiobjective Evolutionary Algorithm
Resumo:
The type of pulmonary histoplasmosis presents limited lesions to the lungs, with symptoms that are clinically and radiological similar to chronic pulmonary tuberculosis. This paper describes the clinical features of four cases of pulmonary histoplasmosis. Aspects of diagnostic and clinical, epidemiological, laboratorial and imaging exams are discussed, in addition to the clinical status of the individuals five years after disease onset. The treatment of choice was oral medication, following which all the patients improved. It is important to understand the clinical status and the difficulties concerning the differential diagnosis of histoplasmosis, to assist the proper indication of cases, thus reducing potential confusion with other diseases.
Resumo:
Land plant evolution required the generation of a new body plan that could resist the harsher and fluctuating environmental conditions found outside of aquatic environments. Unraveling the genetic basis of plant developmental innovations is not only revealing in terms of an evolutionary point of view, but it is also important for understanding the emergence of agronomically important traits. Comparative genetic studies between basal and modern land plants, both at the genome and trancriptome levels, can help in the generation of hypotheses related to the genetic basis of plant evolutionary development.(...)
Resumo:
The obligate intracellular bacterium Chlamydia trachomatis is a human pathogen of major public health significance. Strains can be classified into 15 main serovars (A to L3) that preferentially cause ocular infections (A-C), genital infections (D-K) or lymphogranuloma venereum (LGV) (L1-L3), but the molecular basis behind their distinct tropism, ecological success and pathogenicity is not welldefined. Most chlamydial research demands culture in eukaryotic cell lines, but it is not known if stains become laboratory adapted. By essentially using genomics and transcriptomics, we aimed to investigate the evolutionary patterns underlying the adaptation of C. trachomatis to the different human tissues, given emphasis to the identification of molecular patterns of genes encoding hypothetical proteins, and to understand the adaptive process behind the C. trachomatis in vivo to in vitro transition. Our results highlight a positive selection-driven evolution of C. trachomatis towards nichespecific adaptation, essentially targeting host-interacting proteins, namely effectors and inclusion membrane proteins, where some of them also displayed niche-specific expression patterns. We also identified potential "ocular-specific" pseudogenes, and pointed out the major gene targets of adaptive mutations associated with LGV infections. We further observed that the in vivo-derived genetic makeup of C. trachomatis is not significantly compromised by its long-term laboratory propagation. In opposition, its introduction in vitro has the potential to affect the phenotype, likely yielding virulence attenuation. In fact, we observed a "genital-specific" rampant inactivation of the virulence gene CT135, which may impact the interpretation of data derived from studies requiring culture. Globally, the findings presented in this Ph.D. thesis contribute for the understanding of C.trachomatis adaptive evolution and provides new insights into the biological role of C. trachomatishypothetical proteins. They also launch research questions for future functional studies aiming toclarify the determinants of tissue tropism, virulence or pathogenic dissimilarities among C. trachomatisstrains.
Resumo:
The aim of this work project is to analyze the current algorithm used by EDP to estimate their clients’ electrical energy consumptions, create a new algorithm and compare the advantages and disadvantages of both. This new algorithm is different from the current one as it incorporates some effects from temperature variations. The results of the comparison show that this new algorithm with temperature variables performed better than the same algorithm without temperature variables, although there is still potential for further improvements of the current algorithm, if the prediction model is estimated using a sample of daily data, which is the case of the current EDP algorithm.
Resumo:
Contém resumo
Resumo:
Ship tracking systems allow Maritime Organizations that are concerned with the Safety at Sea to obtain information on the current location and route of merchant vessels. Thanks to Space technology in recent years the geographical coverage of the ship tracking platforms has increased significantly, from radar based near-shore traffic monitoring towards a worldwide picture of the maritime traffic situation. The long-range tracking systems currently in operations allow the storage of ship position data over many years: a valuable source of knowledge about the shipping routes between different ocean regions. The outcome of this Master project is a software prototype for the estimation of the most operated shipping route between any two geographical locations. The analysis is based on the historical ship positions acquired with long-range tracking systems. The proposed approach makes use of a Genetic Algorithm applied on a training set of relevant ship positions extracted from the long-term storage tracking database of the European Maritime Safety Agency (EMSA). The analysis of some representative shipping routes is presented and the quality of the results and their operational applications are assessed by a Maritime Safety expert.
Resumo:
The environment can modify developmental trajectories and generate a range of distinct phenotypes without altering an organism’s genome, a widespread phenomenon called developmental plasticity. The past decades have seen a resurgent interest in understanding how developmental plasticity contributes to evolutionary processes, as it can produce phenotypic variation among individuals and facilitate diversification among populations that inhabit distinct ecological niches. To better understand the importance of plastic responses for evolutionary change, we need to explore how the environment alters development to produce phenotypic variation and then compare this to how genetic variation influences these same developmental processes.(...)
Resumo:
Autor proof
Resumo:
The present paper reports the precipitation process of Al3Sc structures in an aluminum scandium alloy, which has been simulated with a synchronous parallel kinetic Monte Carlo (spkMC) algorithm. The spkMC implementation is based on the vacancy diffusion mechanism. To filter the raw data generated by the spkMC simulations, the density-based clustering with noise (DBSCAN) method has been employed. spkMC and DBSCAN algorithms were implemented in the C language and using MPI library. The simulations were conducted in the SeARCH cluster located at the University of Minho. The Al3Sc precipitation was successfully simulated at the atomistic scale with the spkMC. DBSCAN proved to be a valuable aid to identify the precipitates by performing a cluster analysis of the simulation results. The achieved simulations results are in good agreement with those reported in the literature under sequential kinetic Monte Carlo simulations (kMC). The parallel implementation of kMC has provided a 4x speedup over the sequential version.
Resumo:
Traffic Engineering (TE) approaches are increasingly impor- tant in network management to allow an optimized configuration and resource allocation. In link-state routing, the task of setting appropriate weights to the links is both an important and a challenging optimization task. A number of different approaches has been put forward towards this aim, including the successful use of Evolutionary Algorithms (EAs). In this context, this work addresses the evaluation of three distinct EAs, a single and two multi-objective EAs, in two tasks related to weight setting optimization towards optimal intra-domain routing, knowing the network topology and aggregated traffic demands and seeking to mini- mize network congestion. In both tasks, the optimization considers sce- narios where there is a dynamic alteration in the state of the system, in the first considering changes in the traffic demand matrices and in the latter considering the possibility of link failures. The methods will, thus, need to simultaneously optimize for both conditions, the normal and the altered one, following a preventive TE approach towards robust configurations. Since this can be formulated as a bi-objective function, the use of multi-objective EAs, such as SPEA2 and NSGA-II, came nat- urally, being those compared to a single-objective EA. The results show a remarkable behavior of NSGA-II in all proposed tasks scaling well for harder instances, and thus presenting itself as the most promising option for TE in these scenarios.
Resumo:
Earthworks tasks aim at levelling the ground surface at a target construction area and precede any kind of structural construction (e.g., road and railway construction). It is comprised of sequential tasks, such as excavation, transportation, spreading and compaction, and it is strongly based on heavy mechanical equipment and repetitive processes. Under this context, it is essential to optimize the usage of all available resources under two key criteria: the costs and duration of earthwork projects. In this paper, we present an integrated system that uses two artificial intelligence based techniques: data mining and evolutionary multi-objective optimization. The former is used to build data-driven models capable of providing realistic estimates of resource productivity, while the latter is used to optimize resource allocation considering the two main earthwork objectives (duration and cost). Experiments held using real-world data, from a construction site, have shown that the proposed system is competitive when compared with current manual earthwork design.
Resumo:
Earthworks tasks are often regarded in transportation projects as some of the most demanding processes. In fact, sequential tasks such as excavation, transportation, spreading and compaction are strongly based on heavy mechanical equipment and repetitive processes, thus becoming as economically demanding as they are time-consuming. Moreover, actual construction requirements originate higher demands for productivity and safety in earthwork constructions. Given the percentual weight of costs and duration of earthworks in infrastructure construction, the optimal usage of every resource in these tasks is paramount. Considering the characteristics of an earthwork construction, it can be looked at as a production line based on resources (mechanical equipment) and dependency relations between sequential tasks, hence being susceptible to optimization. Up to the present, the steady development of Information Technology areas, such as databases, artificial intelligence and operations research, has resulted in the emergence of several technologies with potential application bearing that purpose in mind. Among these, modern optimization methods (also known as metaheuristics), such as evolutionary computation, have the potential to find high quality optimal solutions with a reasonable use of computational resources. In this context, this work describes an optimization algorithm for earthworks equipment allocation based on a modern optimization approach, which takes advantage of the concept that an earthwork construction can be regarded as a production line.
Resumo:
The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.
Resumo:
The Electromagnetism-like (EM) algorithm is a population- based stochastic global optimization algorithm that uses an attraction- repulsion mechanism to move sample points towards the optimal. In this paper, an implementation of the EM algorithm in the Matlab en- vironment as a useful function for practitioners and for those who want to experiment a new global optimization solver is proposed. A set of benchmark problems are solved in order to evaluate the performance of the implemented method when compared with other stochastic methods available in the Matlab environment. The results con rm that our imple- mentation is a competitive alternative both in term of numerical results and performance. Finally, a case study based on a parameter estimation problem of a biology system shows that the EM implementation could be applied with promising results in the control optimization area.
Resumo:
In this paper, we propose an extension of the firefly algorithm (FA) to multi-objective optimization. FA is a swarm intelligence optimization algorithm inspired by the flashing behavior of fireflies at night that is capable of computing global solutions to continuous optimization problems. Our proposal relies on a fitness assignment scheme that gives lower fitness values to the positions of fireflies that correspond to non-dominated points with smaller aggregation of objective function distances to the minimum values. Furthermore, FA randomness is based on the spread metric to reduce the gaps between consecutive non-dominated solutions. The obtained results from the preliminary computational experiments show that our proposal gives a dense and well distributed approximated Pareto front with a large number of points.