Calculation of Activity Coefficients of Electrolytes of Other Charge Types than 1-1 by Equations Containing No Adjustable Parameters in Aqueous Solutions at 25 0C

Normally either the Güntelberg or Davies equation is used to predict activity coefficients of electrolytes in dilute solutions when no betterequation is available. The validity of these equations and, additionally, of the parameter-free equation used in the Bates-Guggenheim convention for activity coefficients were tested with experimentally determined activity coefficients of LaCl3, CaCl2, SrCl2 and BaCl2 in aqueous solutions at 298.15 K. The experimentalactivity coefficients of these electrolytes can be usually reproduced within experimental error by means of a two-parameter equation of the Hückel type. The best Hückel equations were also determined for all electrolytes considered. The data used in the calculations of this study cover almost all reliable galvanic cell results available in the literature for the electrolytes considered. The results of the calculations reveal that the parameter-free activity coefficient equations can only be used for very dilute electrolyte solutions in thermodynamic studies

A Topological Approach to Fuzzy Sets

This thesis presents a topological approach to studying fuzzy setsby means of modifier operators. Modifier operators are mathematical models, e.g., for hedges, and we present briefly different approaches to studying modifier operators. We are interested in compositional modifier operators, modifiers for short, and these modifiers depend on binary relations. We show that if a modifier depends on a reflexive and transitive binary relation on U, then there exists a unique topology on U such that this modifier is the closure operator in that topology. Also, if U is finite then there exists a lattice isomorphism between the class of all reflexive and transitive relations and the class of all topologies on U. We define topological similarity relation "≈" between L-fuzzy sets in an universe U, and show that the class LU/ ≈ is isomorphic with the class of all topologies on U, if U is finite and L is suitable. We consider finite bitopological spaces as approximation spaces, and we show that lower and upper approximations can be computed by means of α-level sets also in the case of equivalence relations. This means that approximations in the sense of Rough Set Theory can be computed by means of α-level sets. Finally, we present and application to data analysis: we study an approach to detecting dependencies of attributes in data base-like systems, called information systems.

Relaciones entre conocimiento del catalán y del castellano y el rendimiento matemático. Un estudio empírico

Este trabajo se desarrolla en el contexto sociocultural y lingüístico de la provincia de Lleida. En él se analiza la relación entre el dominio de las dos lenguas en contacto (catalán y castellano) con el rendimiento en matemáticas. Los resultados revelan que existe una correlación significativa entre el dominio de la lengua vehicular y el rendimiento matemático y, a su vez, que el mayor conocimiento de la lengua vehicular tiene efectos superiores en el rendimiento de los tres tipos de conocimiento que contempla la prueba de matemáticas. Por otra parte, se constata una elevada correlación entre el dominio del castellano y el resultado de la prueba de matemáticas, lo que revela que el conocimiento matemático obtenido a través de una de las lenguas se transfiere a la otra.

Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants

PLFC is a first-order possibilistic logic dealing with fuzzy constants and fuzzily restricted quantifiers. The refutation proof method in PLFC is mainly based on a generalized resolution rule which allows an implicit graded unification among fuzzy constants. However, unification for precise object constants is classical. In order to use PLFC for similarity-based reasoning, in this paper we extend a Horn-rule sublogic of PLFC with similarity-based unification of object constants. The Horn-rule sublogic of PLFC we consider deals only with disjunctive fuzzy constants and it is equipped with a simple and efficient version of PLFC proof method. At the semantic level, it is extended by equipping each sort with a fuzzy similarity relation, and at the syntactic level, by fuzzily “enlarging” each non-fuzzy object constant in the antecedent of a Horn-rule by means of a fuzzy similarity relation.

Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One interesting alternative for solving this limitation is the use of PGL+, a possibilistic logic over Gödel logic extended with fuzzy constants. Fuzzy constants in PGL+ allow expressing disjunctive information about the unknown value of a variable, in the sense of a magnitude, modelled as a (unary) predicate. The aim of this article is twofold: firstly, we formalize DePGL+, a possibilistic defeasible logic programming language that extends P-DeLP through the use of PGL+ in order to incorporate fuzzy constants and a fuzzy unification mechanism for them. Secondly, we propose a way to handle conflicting arguments in the context of the extended framework.

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studied

Polttoaineen reaktiivisuuden määrittäminen kiertoleijupoltossa

Kehitettäessä leijupolttotekniikkaa entistä ympäristöystävällisemmäksi ja tehokkaammaksi tarvitaan lisää tietoa polttoaineen käyttäytymisestä tulipesässä. Polttoaineen palamisprofiili ja reaktiivisuus vaikuttavat oleellisesti esimerkiksi voimalaitoskattilan lämmönsiirtopintojen sijoitteluun ja suunnitteluun sekä ohjausjärjestelmän toteutukseen. Varsinkin monipolttoainekattiloilla ohjausjärjestelmän toimivuus joutuu koetukselle esimerkiksi kuormanmuutostilanteissa ja äkillisissä polttoaineen syöttöhäiriöissä. Tässä työssä on aluksi tutustuttu kiertoleijupolton ilmiöihin ja niiden matemaattiseen mallintamiseen. Lisäksi esitetään katsaus eri prosessiolosuhteiden vaikutuksesta palamiseen kiertoleijuolosuhteissa. Työn tutkimusosassa kehitettiin menetelmä polttoaineen reaktiivisuuden määrittämiseksi kiertoleijupoltossa. Kehitetty menetelmä koostuu koesarjasta ja matemaattisesta simulointimallista. Koetoiminta suoritettiin VTT Energian laboratoriokokoluokan kiertoleijukoelaitteella. Koesarja polttoaineen reaktiivisuuden määrittämiseksi sisältää eri kaasukomponenttien profiilimittauksia ja dynaamisia muutoskokeita. Menetelmän avulla voidaan tutkia eri polttoaineiden reaktiivisuuksia sekä polttoaineen reaktiivisuuden ja tietyn prosessiolosuhteen välistä riippuvuutta. Suorittamalla koeajomatriisin mukaiset kokeet tietyissä prosessiolosuhteissa voidaan polttoaineen reaktiivisuus selvittää koetulosten ja simulointimallin perusteella.

Privacy as a Tradeoff: Introducing the Notion of Privacy Calculus for Context-Aware Mobile Applications

Evidences collected from smartphones users show a growing desire of personalization offered by services for mobile devices. However, the need to accurately identify users' contexts has important implications for user's privacy and it increases the amount of trust, which users are requested to have in the service providers. In this paper, we introduce a model that describes the role of personalization and control in users' assessment of cost and benefits associated to the disclosure of private information. We present an instantiation of such model, a context-aware application for smartphones based on the Android operating system, in which users' private information are protected. Focus group interviews were conducted to examine users' privacy concerns before and after having used our application. Obtained results confirm the utility of our artifact and provide support to our theoretical model, which extends previous literature on privacy calculus and user's acceptance of context-aware technology.

Transcriptome diversity among rice root types during asymbiosis and interaction with arbuscular mycorrhizal fungi.

Root systems consist of different root types (RTs) with distinct developmental and functional characteristics. RTs may be individually reprogrammed in response to their microenvironment to maximize adaptive plasticity. Molecular understanding of such specific remodeling-although crucial for crop improvement-is limited. Here, RT-specific transcriptomes of adult rice crown, large and fine lateral roots were assessed, revealing molecular evidence for functional diversity among individual RTs. Of the three rice RTs, crown roots displayed a significant enrichment of transcripts associated with phytohormones and secondary cell wall (SCW) metabolism, whereas lateral RTs showed a greater accumulation of transcripts related to mineral transport. In nature, arbuscular mycorrhizal (AM) symbiosis represents the default state of most root systems and is known to modify root system architecture. Rice RTs become heterogeneously colonized by AM fungi, with large laterals preferentially entering into the association. However, RT-specific transcriptional responses to AM symbiosis were quantitatively most pronounced for crown roots despite their modest physical engagement in the interaction. Furthermore, colonized crown roots adopted an expression profile more related to mycorrhizal large lateral than to noncolonized crown roots, suggesting a fundamental reprogramming of crown root character. Among these changes, a significant reduction in SCW transcripts was observed that was correlated with an alteration of SCW composition as determined by mass spectrometry. The combined change in SCW, hormone- and transport-related transcript profiles across the RTs indicates a previously overlooked switch of functional relationships among RTs during AM symbiosis, with a potential impact on root system architecture and functioning.