Reducing the number of membership functions in linguistic variables

Dissertation presented at Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia in fulfilment of the requirements for the Masters degree in Mathematics and Applications, specialization in Actuarial Sciences, Statistics and Operations Research

Target-specific multiphysics modeling for thermal medicine applications

Dissertation to obtain the degree of Doctor of Philosophy in Biomedical Engineering

Optimization of multi-stage amplifiers in deep-submicron CMOS using a distributed/parallel genetic algorithm

IEEE International Symposium on Circuits and Systems, pp. 724 – 727, Seattle, EUA

Time-domain optimization of amplifiers based on distributed genetic algorithms

Thesis presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Electrical and Computer Engineering

Extremum estimators and stochastic optimization methods

Submitted in partial fulfillment for the Requirements for the Degree of PhD in Mathematics, in the Speciality of Statistics in the Faculdade de Ciências e Tecnologia

Constraint reasoning with local search for continuous optimization

Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.

A lightweight distributed super peer election algorithm for unstructured dynamic P2P systems

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

A systems biology framework for pathway level culture media engineering: pplication to Pichia pastoris cultures

Dissertação para obtenção do Grau de Doutor em Engenharia Química e Bioquímica

Optimization of investment promotion tools for Portugal: Specific recommendations to attract investments from Germany

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Development of a satellite based PM10 concentration product for urban areas

Dissertação para obtenção do Grau de Doutor em Engenharia do Ambiente

A public transport bus assignment problem: parallel metaheuristics assessment

Combinatorial Optimization Problems occur in a wide variety of contexts and generally are NP-hard problems. At a corporate level solving this problems is of great importance since they contribute to the optimization of operational costs. In this thesis we propose to solve the Public Transport Bus Assignment problem considering an heterogeneous fleet and line exchanges, a variant of the Multi-Depot Vehicle Scheduling Problem in which additional constraints are enforced to model a real life scenario. The number of constraints involved and the large number of variables makes impracticable solving to optimality using complete search techniques. Therefore, we explore metaheuristics, that sacrifice optimality to produce solutions in feasible time. More concretely, we focus on the development of algorithms based on a sophisticated metaheuristic, Ant-Colony Optimization (ACO), which is based on a stochastic learning mechanism. For complex problems with a considerable number of constraints, sophisticated metaheuristics may fail to produce quality solutions in a reasonable amount of time. Thus, we developed parallel shared-memory (SM) synchronous ACO algorithms, however, synchronism originates the straggler problem. Therefore, we proposed three SM asynchronous algorithms that break the original algorithm semantics and differ on the degree of concurrency allowed while manipulating the learned information. Our results show that our sequential ACO algorithms produced better solutions than a Restarts metaheuristic, the ACO algorithms were able to learn and better solutions were achieved by increasing the amount of cooperation (number of search agents). Regarding parallel algorithms, our asynchronous ACO algorithms outperformed synchronous ones in terms of speedup and solution quality, achieving speedups of 17.6x. The cooperation scheme imposed by asynchronism also achieved a better learning rate than the original one.

Optimization of the electrodialytic phosphorus recovery from sewage sludge ash

Phosphorus (P) is becoming a scarce element due to the decreasing availability of primary sources. Therefore, recover P from secondary sources, e.g. waste streams, have become extremely important. Sewage sludge ash (SSA) is a reliable secondary source of P. The use of SSAs as a direct fertilizer has very restricted legislation due to the presence of inorganic contaminants. Furthermore, the P present in SSAs is not in a plant-available form. The electrodialytic (ED) process is one of the methods under development to recover P and simultaneously remove heavy metals. The present work aimed to optimize the P recovery through a 2 compartment electrodialytic cell. The research was divided in three independent phases. In the first phase, ED experiments were carried out for two SSAs from different seasons, varying the duration of the ED process (2, 4, 6 and 9 days). During the ED treatment the SSA was suspended in distilled water in the anolyte, which was separated from the catholyte by a cation exchange membrane. From both ashes 90% of P was successfully extracted after 6 days of treatment. Regarding the heavy metals removal, one of the SSAs had a better removal than the other. Therefore, it was possible to conclude that SSAs from different seasons can be submitted to ED process under the same parameters. In the second phase, the two SSAs were exposed to humidity and air prior to ED, in order to carbonate them. Although this procedure was not successful, ED experiments were carried out varying the duration of the treatment (2 and 6 days) and the period of air exposure that SSAs were submitted to (7, 14 and 30 days). After 6 days of treatment and 30 days of air exposure, 90% of phosphorus was successfully extracted from both ashes. No differences were identified between carbonated and non-carbonated SSAs. Thus, SSAs that were exposed to the air and humidity, e.g. SSAs stored for 30 days in an open deposit, can be treated under the same parameters as the SSAs directly collected from the incineration process. In the third phase, ED experiments were carried out during 6 days varying the stirring time (0, 1, 2 and 4 h/day) in order to investigate if energy can be saved on the stirring process. After 6 days of treatment and 4 h/day stirring, 80% and 90% of P was successfully extracted from SSA-A and SSA-B, respectively. This value is very similar to the one obtained for 6 days of treatment stirring 24 h/day.

Quadratic programming versus second order con programming in portfolio optimization

Despite the extensive literature in finding new models to replace the Markowitz model or trying to increase the accuracy of its input estimations, there is less studies about the impact on the results of using different optimization algorithms. This paper aims to add some research to this field by comparing the performance of two optimization algorithms in drawing the Markowitz Efficient Frontier and in real world investment strategies. Second order cone programming is a faster algorithm, appears to be more efficient, but is impossible to assert which algorithm is better. Quadratic Programming often shows superior performance in real investment strategies.

Marketing plan for online aqctivity of Rota Vicentina boosting direct website sales

The nature tourism experienced a great expansion of its market with the appearance of different lifestyles. In this Work Project a study regarding the website direct sales of Rota Vicentina was developed. Its website shows the idea of being solely an information structure and not a purchase one, leading to a current absence of online sales. Hence, it is suggested the modification of its business model, using different instruments and channels. Some digital marketing recommendations were developed in order to boost website sales, such as a platform for online reviews, remarketing campaigns and social media activity.