Constraint reasoning for differential models

The basic motivation of this work was the integration of biophysical models within the interval constraints framework for decision support. Comparing the major features of biophysical models with the expressive power of the existing interval constraints framework, it was clear that the most important inadequacy was related with the representation of differential equations. System dynamics is often modelled through differential equations but there was no way of expressing a differential equation as a constraint and integrate it within the constraints framework. Consequently, the goal of this work is focussed on the integration of ordinary differential equations within the interval constraints framework, which for this purpose is extended with the new formalism of Constraint Satisfaction Differential Problems. Such framework allows the specification of ordinary differential equations, together with related information, by means of constraints, and provides efficient propagation techniques for pruning the domains of their variables. This enabled the integration of all such information in a single constraint whose variables may subsequently be used in other constraints of the model. The specific method used for pruning its variable domains can then be combined with the pruning methods associated with the other constraints in an overall propagation algorithm for reducing the bounds of all model variables. The application of the constraint propagation algorithm for pruning the variable domains, that is, the enforcement of local-consistency, turned out to be insufficient to support decision in practical problems that include differential equations. The domain pruning achieved is not, in general, sufficient to allow safe decisions and the main reason derives from the non-linearity of the differential equations. Consequently, a complementary goal of this work proposes a new strong consistency criterion, Global Hull-consistency, particularly suited to decision support with differential models, by presenting an adequate trade-of between domain pruning and computational effort. Several alternative algorithms are proposed for enforcing Global Hull-consistency and, due to their complexity, an effort was made to provide implementations able to supply any-time pruning results. Since the consistency criterion is dependent on the existence of canonical solutions, it is proposed a local search approach that can be integrated with constraint propagation in continuous domains and, in particular, with the enforcing algorithms for anticipating the finding of canonical solutions. The last goal of this work is the validation of the approach as an important contribution for the integration of biophysical models within decision support. Consequently, a prototype application that integrated all the proposed extensions to the interval constraints framework is developed and used for solving problems in different biophysical domains.

A CMOS variable width short-pulse generator circuit for UWB RADAR applications

IEEE International Symposium on Circuits and Systems, pp. 2713 – 2716, Seattle, EUA

Sondagem de Belverde (Cenozóico, Península de Setúbal, Portugal). Diagrafias

In the aim of the project "Recognition of the Miocene of the distal region of the Lower Tagus Basin through a borehole with continuous sampling", Temperature, Natural Gamma Ray, Neutron (almost in all the borehole), Sonic, SP and SPR (in two small sections in upper and lower parts of the Miocene Series) geophysical logs were carried on. Interpretation of those logs and comparison with chronological, lithostratigraphical, micropaleontological and clay mineraIs data; helped in the definition of depositional sequences and to obtain paleoenvironmental reconstructions that could lead to a better understanding of the evolution of the Setúbal Península and Lisboa regions Miocene gulf. Log data agree with the lithologic succession observed in the Belverde borehole, essentially silty sandstones/sandy siltstones (with variable clay content) to clays, often with marly intercalations. Sonic logs (and Neutron logs, in general) reflect the sediments porosity. The higher acoustic velocities are often related to compact/massive layers as claystones and/or limestones and rather fossiliferous marly layers. Lower values are obtained for porous, silty sandstones (fossiliferous and with scarce clay content) and bio-calcareous sandstones. As indicative, we obtained the mean values of 2500-3000m/s for the higher velocities and 1300-1600m/s for the lowest ones. ln Natural Gamma Ray log, the radiation peaks can be correlated to often fossiliferous marly micaceous layers. Radioactive micas are present. It seems that the gamma peaks and the depositional sequences previously defined for the Lower Tagus Basin (see Antunes et al., 1999, 2000; Pais et al., 2002) can be correlated, taking also into account the whole available micropaleontological, palynological and isotopic evidence.

Caracterização mineralógica da sequência sedimentar Ha7 do Cretácico Inferior do Guincho (Bacia Lusitaniana) (*)

Mineralogical assemblages, specially clay mineral assemblages, have been widely used in multidisciplinary stratigraphical studies. This paper presents the results obtained in the study of a Lower Cretaceous depositional sequence from the Lusitanian Basin (Portugal). The Upper Hauterivian – Lower Barremian section at Guincho Fort pertains mostly to the Ha7 3rd order depositional sequence defined by J. REY & al. (2003) and has been studied in a detailed bed-by-bed sampling corresponding to a total of 85 samples. The analysis of the obtained clay mineral assemblages has contributed to the paleoenvironmental and paleogeographical reconstruction of the studied interval and has improved the sequence stratigraphic interpretation and positioning of sequence boundaries and other sequential surfaces (transgressive and flooding surfaces).

Computational design with flexible backbone sampling for protein remodeling and scaffolding of complex binding sites

Dissertation presented to obtain the Doutoramento (Ph.D.) degree in Biochemistry at the Instituto de Tecnologia Qu mica e Biol ogica da Universidade Nova de Lisboa

Parameter estimation in the presence of auxiliary information

Dissertação para obtenção do Grau de Doutora em Estatística e Gestão de Risco, Especialidade em Estatística

Development of a satellite based PM10 concentration product for urban areas

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

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.