Pine processionary moth (Thaumetopoea pityocampa) and great tit (Parus major) in Portugal

In the present work, we studied a common outbreaking Lepidoptera species in Portuguese pine stands – Thaumetopoea pityocampa (Den. & Schiff.) - and one of its potential predators – Parus major (L.). The population dynamics of the immature stages of the Lepidoptera was studied in several types of Pinus pinaster (Aiton) plantations in three different areas: Setúbal Peninsula, Abrantes and National Pine Forest of Leiria. Location and plantation structure was the most important factors determining population density of T. pityocampa. Setubal and Abrantes was highly susceptible to attacks by the Lepidoptera, whereas Leiria had lower densities. Young and homogeneous pine stands was more susceptible to attacks than older and more heterogeneous pines stands. However, a desynchronized population of T. pityocampa, in which the larvae develops during summer instead of during winter, reached high densities also in Leiria. The impact of several mortality factors and climatic conditions on the immature stages of the insect (eggs and larvae), in normal and desynchronized populations are discussed, as well as possible evolutionary implications of the sudden appearance of the new version of T. pityocampa. The break of the pupa diapause and adult emergence times the annual life cycle of this insect. Adults from the desynchronized population emerged earlier than adults from the normal population, which in turn determined the change in the larvae development period. Different factors, potentially affecting the timing of adult emergence in both normal and abnormal populations are also discussed. To study P. Major, nest-boxes were placed in the areas of Setúbal and Leiria and they were monitored during three seasons. The nest-boxes increased the density of breeding and wintering birds in the studied pine plantations, indicating that a lack of natural holes are in fact a limiting factor for this populations. The earliest breeding start for this species was recorded in my study area, indicating that Portuguese coastal pines provide good breeding conditions earlier than in other areas of Europe and North Africa. This leads to an overlap between the end of the larvae stage of T. pityocampa and the beginning of the breeding season of P. major. Key-words: Thaumetopoea pityocampa, Parus major, Pinus pinaster, population dynamics, Portugal.

IPTV data reduction strategy to measure real users’ behaviours

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

Characterization and surface reconstruction of objects in tomographic images of composite materials

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.