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

Gastrointestinal symbionts of chimpanzees in Cantanhez National Park, Guinea-Bissau with respect to habitat fragmentation

One of the major factors threatening chimpanzees (Pan troglodytes verus) in Guinea-Bissau is habitat fragmentation. Such fragmentation may cause changes in symbiont dynamics resulting in increased susceptibility to infection, changes in host specificity and virulence. We monitored gastrointestinal symbiotic fauna of three chimpanzee subpopulations living within Cantanhez National Park (CNP) in Guinea Bissau in the areas with different levels of anthropogenic fragmentation. Using standard coproscopical methods (merthiolate-iodine formalin concentration and Sheather's flotation) we examined 102 fecal samples and identified at least 13 different symbiotic genera (Troglodytella abrassarti, Troglocorys cava, Blastocystis spp., Entamoeba spp., Iodamoeba butschlii, Giardia intestinalis, Chilomastix mesnili, Bertiella sp., Probstmayria gombensis, unidentified strongylids, Strongyloides stercoralis, Strongyloides fuelleborni, and Trichuris sp.). The symbiotic fauna of the CNP chimpanzees is comparable to that reported for other wild chimpanzee populations, although CNP chimpanzees have a higher prevalence of Trichuris sp. Symbiont richness was higher in chimpanzee subpopulations living in fragmented forests compared to the community inhabiting continuous forest area. We reported significantly higher prevalence of G. intestinalis in chimpanzees from fragmented areas, which could be attributed to increased contact with humans and livestock.

In situ measured cross section geometry of old timber structures and its influence on structural safety

Old timber structures may show significant variation in the cross section geometry along the same element, as a result of both construction methods and deterioration. As consequence, the definition of the geometric parameters in situ may be both time consuming and costly. This work presents the results of inspections carried out in different timber structures. Based on the obtained results, different simplified geometric models are proposed in order to efficiently model the geometry variations found. Probabilistic modelling techniques are also used to define safety parameters of existing timber structures, when subjected to dead and live loads, namely self-weight and wind actions. The parameters of the models have been defined as probabilistic variables, and safety of a selected case study was assessed using the Monte Carlo simulation technique. Assuming a target reliability index, a model was defined for both the residual cross section and the time dependent deterioration evolution. As a consequence, it was possible to compute probabilities of failure and reliability indices, as well as, time evolution deterioration curves for this structure. The results obtained provide a proposal for definition of the cross section geometric parameters of existing timber structures with different levels of decay, using a simplified probabilistic geometry model and considering a remaining capacity factor for the decayed areas. This model can be used for assessing the safety of the structure at present and for predicting future performance.

Cohesion decay: quantitative analysis of partial sister chromatid cohesion

Cell division is a highly dynamic process where sister chromatids remain associated with each other from the moment of DNA replication until the later stages of mitosis, giving rise to two daughter cells with equal genomes. The “molecular glue” that links sister DNA molecules is called cohesin, a tripartite ring-like protein complex composed of two Structural Maintenance of Chromosome proteins (Smc1 and Smc3) bridged by a kleisin subunit Rad21/Scc1, that together prevent precocious sister chromatid separation. Accumulating evidence has suggested that cohesion decay may be the cause of segregation errors that underlie certain human pathologies. However it remains to be determined how much cohesin loss abolishes functional sister chromatid cohesion. To answer these questions, we have developed different experimental conditions aiming to titrate the levels of cohesin on mitotic chromosomes in a precise manner. Using these tools, we will determine the minimal amount of cohesin needed to confer functional cohesion. The approaches described here take advantage of a system in Drosophila melanogaster where the Tobacco Etch Virus (TEV) protease can cleave the Rad21 subunit of cohesin leading to precocious sister chromatid separation. Firstly, we tried to express different levels of TEV protease to obtain partial loss of cohesion. However, this approach has failed to produce systematic different levels of sister chromatid separation. Most of the work was therefore focused on a second strategy, for which we established strains with different levels of cohesin sensitive/cohesin resistant to TEV protease. Strains containing different amounts of functional cohesin (TEV resistant) were tested by in vitro cleavage and by in vivo injections in embryos for their ability to promote sister chromatid cohesion. Our results reveal that removal of half of the cohesin complexes does not impair chromosome segregation, implying that chromosome cohesion is less sensitive to cohesin amounts than previously anticipated.

An agent based architecture to support monitoring in plug and produce manufacturing systems using knowledge extraction

In recent years a set of production paradigms were proposed in order to capacitate manufacturers to meet the new market requirements, such as the shift in demand for highly customized products resulting in a shorter product life cycle, rather than the traditional mass production standardized consumables. These new paradigms advocate solutions capable of facing these requirements, empowering manufacturing systems with a high capacity to adapt along with elevated flexibility and robustness in order to deal with disturbances, like unexpected orders or malfunctions. Evolvable Production Systems propose a solution based on the usage of modularity and self-organization with a fine granularity level, supporting pluggability and in this way allowing companies to add and/or remove components during execution without any extra re-programming effort. However, current monitoring software was not designed to fully support these characteristics, being commonly based on centralized SCADA systems, incapable of re-adapting during execution to the unexpected plugging/unplugging of devices nor changes in the entire system’s topology. Considering these aspects, the work developed for this thesis encompasses a fully distributed agent-based architecture, capable of performing knowledge extraction at different levels of abstraction without sacrificing the capacity to add and/or remove monitoring entities, responsible for data extraction and analysis, during runtime.

Intraday volatility

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

Semantics of logic programs with explicit negation

After a historical introduction, the bulk of the thesis concerns the study of a declarative semantics for logic programs. The main original contributions are: ² WFSX (Well–Founded Semantics with eXplicit negation), a new semantics for logic programs with explicit negation (i.e. extended logic programs), which compares favourably in its properties with other extant semantics. ² A generic characterization schema that facilitates comparisons among a diversity of semantics of extended logic programs, including WFSX. ² An autoepistemic and a default logic corresponding to WFSX, which solve existing problems of the classical approaches to autoepistemic and default logics, and clarify the meaning of explicit negation in logic programs. ² A framework for defining a spectrum of semantics of extended logic programs based on the abduction of negative hypotheses. This framework allows for the characterization of different levels of scepticism/credulity, consensuality, and argumentation. One of the semantics of abduction coincides with WFSX. ² O–semantics, a semantics that uniquely adds more CWA hypotheses to WFSX. The techniques used for doing so are applicable as well to the well–founded semantics of normal logic programs. ² By introducing explicit negation into logic programs contradiction may appear. I present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based in a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction.

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.