Repairs of databases with null values

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

Calibration, selection and mosaicing of SMART-1 AMIE images

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

Improvements on the KNN classifier

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

Mapping Mediterranean Portugal: Pastoral and Counter-pastoral

This article focuses on the different images of Mediterranean Portugal developed by three important Portuguese social scientists of the 20th century: the geographer Orlando Ribeiro, the ethnologist Jorge Dias and the social anthropologist José Cutileiro. The article argues that these different images stem from different ideological attitudes towards the countryside, ranging from pastoral to counter-pastoral, and are also related to different ways of addressing the links between the countryside and national identity.

Comparative analysis of multicriteria decision making methods

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

Um estudo de performance de uma ferramenta de Object/Relational Mapping

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

Healing replicas in a software component replication system

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

SIG Municipais aplicados a Levantamento de Vídeo e Respectiva Georreferenciação (Mobile Mapping) e Carregamento em Base de Dados SIG

Relatório de Estágio apresentado para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Gestão do Território, especialização em Detecção Remota e Sistemas de Informação Geográfica

Genetic parameters and mapping quantitative trait loci associated with tibia traits in broilers.

Abstract: Selection among broilers for performance traits is resulting in locomotion problems and bone disorders, once skeletal structure is not strong enough to support body weight in broilers with high growth rates. In this study, genetic parameters were estimated for body weight at 42 days of age (BW42), and tibia traits (length, width, and weight) in a population of broiler chickens. Quantitative trait loci (QTL) were identified for tibia traits to expand our knowledge of the genetic architecture of the broiler population. Genetic correlations ranged from 0.56 +/- 0.18 (between tibia length and BW42) to 0.89 +/- 0.06 (between tibia width and weight), suggesting that these traits are either controlled by pleiotropic genes or by genes that are in linkage disequilibrium. For QTL mapping, the genome was scanned with 127 microsatellites, representing a coverage of 2630 cM. Eight QTL were mapped on Gallus gallus chromosomes (GGA): GGA1, GGA4, GGA6, GGA13, and GGA24. The QTL regions for tibia length and weight were mapped on GGA1, between LEI0079 and MCW145 markers. The gene DACH1 is located in this region; this gene acts to form the apical ectodermal ridge, responsible for limb development. Body weight at 42 days of age was included in the model as a covariate for selection effect of bone traits. Two QTL were found for tibia weight on GGA2 and GGA4, and one for tibia width on GGA3. Information originating from these QTL will assist in the search for candidate genes for these bone traits in future studies.

Collecting data for indoor mapping of the university of Münster via a location based game

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Social entrepreneurship as a solution provider for ageing societies in Europe

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

Haptic robot-environment interaction for self-supervised learning in ground mobility

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

Service-oriented infrastructure to support the control, monitoring and management of a shop floor system

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

A volumetric hybrid representation for obstacle detection in all-terrain robots

This dissertation presents an approach aimed at three-dimensional perception’s obstacle detection on all-terrain robots. Given the huge amount of acquired information, the adversities such environments present to an autonomous system and the swiftness, thus required, from each of its navigation decisions, it becomes imperative that the 3-D perceptional system to be able to map obstacles and passageways in the most swift and detailed manner. In this document, a hybrid approach is presented bringing the best of several methods together, combining the lightness of lesser meticulous analyses with the detail brought by more thorough ones. Realizing the former, a terrain’s slope mapping system upon a low resolute volumetric representation of the surrounding occupancy. For the latter’s detailed evaluation, two novel metrics were conceived to discriminate the little depth discrepancies found in between range scanner’s beam distance measurements. The hybrid solution resulting from the conjunction of these two representations provides a reliable answer to traversability mapping and a robust discrimination of penetrable vegetation from that constituting real obstructions. Two distinct robotic platforms offered the possibility to test the hybrid approach on very different applications: a boat, under an European project, the ECHORD Riverwatch, and a terrestrial four-wheeled robot for a national project, the Introsys Robot.

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.