Portfolio optimization with options

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

Grout optimization for masonry consolidation

Tese apresentada para obtenção do Grau de Doutor em Engenharia Civil na especialidade de Reabilitação do Património Edificado, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Business model optimization of Prego Gourmet

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

An RF LC Q-enhanced CMOS iter using integrated inductors with layout optimization

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

Exopolysaccharide production by Enterobacter A47: optimization of cultivation conditions and study of polymer functional properties

Dissertação para obtenção do Grau de Mestre em Biotecnologia

Lightweight robust behavior industrial agent methodology

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Optimization based design of LC voltage controlled oscilators

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e de Computadores

Optimization of ring oscillators

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

The optimization of the complaints management system

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

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

A nanopore-based stochastic detection method: Single molecule characterisation of nanoparticles using ()- hemolysin

Dissertation presented to obtain the Ph.D degree in Chemistry.

Optimization of randomly amplified polymorphic DNA-polymerase chain reaction for molecular typing of Salmonella enterica serovar Typhi

Optimization of the RAPD reaction for characterizing Salmonella enterica serovar Typhi strains was studied in order to ensure the reproducibility and the discriminatory power of this technique. Eight Salmonella serovar Typhi strains isolated from various regions in Brazil were examined for the fragment patterns produced using different concentrations of DNA template, primer, MgCl2 and Taq DNA polymerase. Using two different low stringency thermal cycle profiles, the RAPD fingerprints obtained were compared. A set of sixteen primers was evaluated for their ability to produce a high number of distinct fragments. We found that variations associated to all of the tested parameters modified the fingerprinting patterns. For the strains of Salmonella enterica serovar Typhi used in this experiment, we have defined a set of conditions for RAPD-PCR reaction, which result in a simple, fast and reproducible typing method.

Controlling gene expression in enterobacteriaceae: studies on sRNAs and strategies for synthetic biology

Dissertation presented to obtain the Master Degree in Molecular, Genetics and Biomedicine

Evaluation and optimization of a session-based middleware for data management

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

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.