Stability and dynamics of terrestrial planets in binary star systems: application on Alpha Centauri

Binary stars are frequent in the universe, with about 50% of the known main sequence stars being located at a multiple star system (Abt, 1979). Even though, they are universally thought as second rate sites for the location of exo-planets and the habitable zone, due to the difficulties of detection and high perturbation that could prevent planet formation and long term stability. In this work we show that planets in binary star systems can have regular orbits and remain on the habitable zone. We introduce a stability criterium based on the solution of the restricted three body problem and apply it to describe the short period planar and three-dimentional stability zones of S-type orbits around each star of the Alpha Centauri system. We develop as well a semi-analytical secular model to study the long term dynamics of fictional planets in the habitable zone of those stars and we verify that planets on the habitable zone would be in regular orbits with any eccentricity and with inclination to the binary orbital plane up until 35 degrees. We show as well that the short period oscillations on the semi-major axis is 100 times greater than the Earth's, but at all the time the planet would still be found inside the Habitable zone.

Link prediction using a probabilistic description logic

Due to the growing interest in social networks, link prediction has received significant attention. Link prediction is mostly based on graph-based features, with some recent approaches focusing on domain semantics. We propose algorithms for link prediction that use a probabilistic ontology to enhance the analysis of the domain and the unavoidable uncertainty in the task (the ontology is specified in the probabilistic description logic crALC). The scalability of the approach is investigated, through a combination of semantic assumptions and graph-based features. We evaluate empirically our proposal, and compare it with standard solutions in the literature.

Programmable logic design of a compact Genetic Algorithm for phasor estimation in real-time

The main objective of this work is to present an efficient method for phasor estimation based on a compact Genetic Algorithm (cGA) implemented in Field Programmable Gate Array (FPGA). To validate the proposed method, an Electrical Power System (EPS) simulated by the Alternative Transients Program (ATP) provides data to be used by the cGA. This data is as close as possible to the actual data provided by the EPS. Real life situations such as islanding, sudden load increase and permanent faults were considered. The implementation aims to take advantage of the inherent parallelism in Genetic Algorithms in a compact and optimized way, making them an attractive option for practical applications in real-time estimations concerning Phasor Measurement Units (PMUs).

Transformaciones basadas en el algoritmo Local Binary Pattern de imágenes capturadas con la Kinect para clasificación facial

Máster Universitario en Sistemas Inteligentes y Aplicaciones Numéricas en Ingeniería (SIANI)

Specification, execution and verification of interaction protocols: an approach based on computational logic

Interaction protocols establish how different computational entities can interact with each other. The interaction can be finalized to the exchange of data, as in 'communication protocols', or can be oriented to achieve some result, as in 'application protocols'. Moreover, with the increasing complexity of modern distributed systems, protocols are used also to control such a complexity, and to ensure that the system as a whole evolves with certain features. However, the extensive use of protocols has raised some issues, from the language for specifying them to the several verification aspects. Computational Logic provides models, languages and tools that can be effectively adopted to address such issues: its declarative nature can be exploited for a protocol specification language, while its operational counterpart can be used to reason upon such specifications. In this thesis we propose a proof-theoretic framework, called SCIFF, together with its extensions. SCIFF is based on Abductive Logic Programming, and provides a formal specification language with a clear declarative semantics (based on abduction). The operational counterpart is given by a proof procedure, that allows to reason upon the specifications and to test the conformance of given interactions w.r.t. a defined protocol. Moreover, by suitably adapting the SCIFF Framework, we propose solutions for addressing (1) the protocol properties verification (g-SCIFF Framework), and (2) the a-priori conformance verification of peers w.r.t. the given protocol (AlLoWS Framework). We introduce also an agent based architecture, the SCIFF Agent Platform, where the same protocol specification can be used to program and to ease the implementation task of the interacting peers.

Liquid-liquid equilibria in binary solutions formed by [Pyridinium-Derived][F4B] ionic liquids and alkanols:new experimental data and validation of a multiparametric model for correlating LLE data

[EN]Experimental solubility data are presented for a set of binary systems composed of ionic liquids (IL) derived from pyridium, with the tetrafluoroborate anion, and normal alcohols ranging from ethanol to decanol, in the temperature interval of 275 420 K, at atmospheric pressure. For each case, the miscibility curve and the upper critical solubility temperature (UCST) values are presented. The effects of the ILs on the behavior of solutions with alkanols are analyzed, paying special attention to the pyridine derivatives, and considering a series of structural characteristics of the compounds involved.

Correlation and prediction of mixing thermodynamic properties of ester-containing systems Ester+alkane and ester+ester binary systems and the ternary dodecane+ethyl pentonoate+ethyl ethanoate

[EN]Excess thermodynamic properties VE m and HE m, have been measured for the ternary mixture dodecane + ethyl pentanoate + ethyl ethanoate and for the corresponding binaries dodecane + ethyl pentanoate, dodecane + ethyl ethanoate, ethyl pentanoate + ethyl ethanoate at 298.15 K. All mixtures show endothermic and expansive effects. Experimental results are correlated with a suitable equation whose final form for the excess ternary quantity ME contains the particular contributions of the three binaries (i–j) and a last term corresponding to the ternary, all of them obtained considering fourth-order interactions.

Measurements and correlations of the isobaric vapor-liquid equilibria of binary mixtures and excess properties for mixtures containing and alkyl (Methyl, Ethyl) butanoate with an alkane (Heptane, Nonane) at 101.32 kPa.

[EN]In this work, the measurements of the isobaric vapor−liquid equilibrium (VLE) data at 101.32 kPa and the excess molar volumes (vE), obtained at 10 K intervals of temperature in the range (288.15 to 328.15) K, for four binary systems comprised of methyl or ethyl butanoate with two alkanes (heptane and nonane) are presented.

Multiproperty modeling for a set of binary systems. Evaluation of a model to correlate simultaneously several mixing properties of methyl ethanoate+alkanes and new experimental data

[EN] This work makes a theoretical–experimental contribution to the study of ester and alkane solutions. Experimental data of isobaric vapor–liquid equilibria (VLE) are presented at 101.3 kPa for binary systems of methyl ethanoate with six alkanes (from C5 to C10), and of volumes and mixing enthalpies, vE and hE.

Binary liquid-liquid equilibria for systems of mono or disubstituted haloakanes (Cl,Br) and pyiridinium based ionic liquids. Advances in the experimentation and interpretation of results

[EN]This work presents the measurements made to define the temperature−composition curves for a set of binary systems composed of several pyridinium-based ionic liquids (ILs) [bpy][BF4] and [bYmpy][BF4] (Y = 2,3,4) with mono- and dihaloalkanes (Cl and Br) in the temperature interval [280−473] K and at atmospheric pressure. With the exception of the short chain dichloroalkanes (1,1- and 1,2-), all the compounds present some degree of immiscibility with the ionic liquids selected.

Interactions between normative systems and software cognitive agents. A formalization in temporal modal defeasible logic and its implementation

Sustainable computer systems require some flexibility to adapt to environmental unpredictable changes. A solution lies in autonomous software agents which can adapt autonomously to their environments. Though autonomy allows agents to decide which behavior to adopt, a disadvantage is a lack of control, and as a side effect even untrustworthiness: we want to keep some control over such autonomous agents. How to control autonomous agents while respecting their autonomy? A solution is to regulate agents’ behavior by norms. The normative paradigm makes it possible to control autonomous agents while respecting their autonomy, limiting untrustworthiness and augmenting system compliance. It can also facilitate the design of the system, for example, by regulating the coordination among agents. However, an autonomous agent will follow norms or violate them in some conditions. What are the conditions in which a norm is binding upon an agent? While autonomy is regarded as the driving force behind the normative paradigm, cognitive agents provide a basis for modeling the bindingness of norms. In order to cope with the complexity of the modeling of cognitive agents and normative bindingness, we adopt an intentional stance. Since agents are embedded into a dynamic environment, things may not pass at the same instant. Accordingly, our cognitive model is extended to account for some temporal aspects. Special attention is given to the temporal peculiarities of the legal domain such as, among others, the time in force and the time in efficacy of provisions. Some types of normative modifications are also discussed in the framework. It is noteworthy that our temporal account of legal reasoning is integrated to our commonsense temporal account of cognition. As our intention is to build sustainable reasoning systems running unpredictable environment, we adopt a declarative representation of knowledge. A declarative representation of norms will make it easier to update their system representation, thus facilitating system maintenance; and to improve system transparency, thus easing system governance. Since agents are bounded and are embedded into unpredictable environments, and since conflicts may appear amongst mental states and norms, agent reasoning has to be defeasible, i.e. new pieces of information can invalidate formerly derivable conclusions. In this dissertation, our model is formalized into a non-monotonic logic, namely into a temporal modal defeasible logic, in order to account for the interactions between normative systems and software cognitive agents.

Intrinsic ordering, combinatorial numbers and reliability engineering

[EN]A new algorithm for evaluating the top event probability of large fault trees (FTs) is presented. This algorithm does not require any previous qualitative analysis of the FT. Indeed, its efficiency is independent of the FT logic, and it only depends on the number n of basic system components and on their failure probabilities. Our method provides exact lower and upper bounds on the top event probability by using new properties of the intrinsic order relation between binary strings. The intrinsic order enables one to select binary n-tuples with large occurrence probabilities without necessity to evaluate them. This drastically reduces the complexity of the problem from exponential (2n binary n-tuples) to linear (n Boolean variables)...