Maximum likelihood Linear Programming Data Fusion for Speaker Recognition

Biometric system performance can be improved by means of data fusion. Several kinds of information can be fused in order to obtain a more accurate classification (identification or verification) of an input sample. In this paper we present a method for computing the weights in a weighted sum fusion for score combinations, by means of a likelihood model. The maximum likelihood estimation is set as a linear programming problem. The scores are derived from a GMM classifier working on a different feature extractor. Our experimental results assesed the robustness of the system in front a changes on time (different sessions) and robustness in front a change of microphone. The improvements obtained were significantly better (error bars of two standard deviations) than a uniform weighted sum or a uniform weighted product or the best single classifier. The proposed method scales computationaly with the number of scores to be fussioned as the simplex method for linear programming.

Trust region versus line search for computing the optical flow

We consider the numerical treatment of the optical flow problem by evaluating the performance of the trust region method versus the line search method. To the best of our knowledge, the trust region method is studied here for the first time for variational optical flow computation. Four different optical flow models are used to test the performance of the proposed algorithm combining linear and nonlinear data terms with quadratic and TV regularization. We show that trust region often performs better than line search; especially in the presence of non-linearity and non-convexity in the model.

A programming environment having three levels of complexity for mobile robotics = Entorno de programación con tres niveles de complejidad para robótica móvil

This paper presents a programming environment for supporting learning in STEM, particularly mobile robotic learning. It was designed to maintain progressive learning for people with and without previous knowledge of programming and/or robotics. The environment was multi platform and built with open source tools. Perception, mobility, communication, navigation and collaborative behaviour functionalities can be programmed for different mobile robots. A learner is able to programme robots using different programming languages and editor interfaces: graphic programming interface (basic level), XML-based meta language (intermediate level) or ANSI C language (advanced level). The environment supports programme translation transparently into different languages for learners or explicitly on learners’ demand. Learners can access proposed challenges and learning interfaces by examples. The environment was designed to allow characteristics such as extensibility, adaptive interfaces, persistence and low software/hardware coupling. Functionality tests were performed to prove programming environment specifications. UV BOT mobile robots were used in these tests

Are figures accessible in mathematics academic journals?

Are figures accessible in mathematics academic journals? An analysis of current image accessibility in highly cited mathematics journals.

Are figures accessible in mathematics academic journals?

Are figures accessible in mathematics academic journals? An analysis of current image accessibility in highly cited mathematics journals.

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

Why Mathematics is essential in Biomedical Sciences degree?

Improvement of mathematical education and motivation of students in the mathematics" area is needed. What can be done? We introduce some ideas to generate the student"s interest for mathematics, because they often present difficulties in appreciating the relevance of mathematics and its role in the health sciences. We consider that a cornerstone in the strategy to attract the students" interest is linking the mathematics with real biomedical situations. We proceed in the following manner: We first present a real biomedical situation to produce interest and to generate curiosity. Second, we ask thought-provoking questions to students as: Which is the biomedical problem presented? Which is my knowledge on this situation? What could I do to solve this biomedical situation? Do I need some new mathematical concepts and procedures? Thereupon, the teacher explains the mathematical concepts necessary to solve the case presented, providing definitions, properties and tools for graphical display and/or mathematical calculations. In this learning methodology, ICTs were cornerstones for reaching the proposed competences. Furthermore, ICTs can also be used in the evaluative task in its two possible aspects: formative and for obtaining a qualification. Comments from students about this new mathematics teaching method indicate that the use of real biomedical case studies kept the lessons in mathematics interesting.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

Trust region versus line search for computing the optical flow

We consider the numerical treatment of the optical flow problem by evaluating the performance of the trust region method versus the line search method. To the best of our knowledge, the trust region method is studied here for the first time for variational optical flow computation. Four different optical flow models are used to test the performance of the proposed algorithm combining linear and nonlinear data terms with quadratic and TV regularization. We show that trust region often performs better than line search; especially in the presence of non-linearity and non-convexity in the model.

Desenvolupament d'una app

El TFM ha consistit en participar i conèixer de prop tots el passos de desenvolupament d’una aplicació: elaboració d’un guió, realització de la part gràfica, programació i màrqueting. Per aquest motiu he realitzat unes hores de pràctiques a l'empresa Factoria Interactive SL. Durant aquest periòde vaig realitzar diversos guions per diferents apps relacionades amb continguts matemàtics i vaig participar en el programació de l'app "Dress up". I l'últim pas va consistir en penjar l'app a la botiga de Google Play. Per poder accedir a l'aplicació cal seguir el següent enllaç de Google Play: https://play.google.com/store/apps/details?id=eu.lafactoria.dressup&hl=es

A Virtual Laboratory Structure for Developing Programming Labs

Virtual Laboratories are an indispensablespace for developing practical activities in a Virtual Environment. In the field of Computer and Software Engineering different types of practical activities have tobe performed in order to obtain basic competences which are impossible to achieve by other means. This paper specifies an ontology for a general virtual laboratory.The proposed ontology provides a mechanism to select the best resources needed in a Virtual Laboratory once a specific practical activity has been defined and the maincompetences that students have to achieve in the learning process have been fixed. Furthermore, the proposed ontology can be used to develop an automatic and wizardtool that creates a Moodle Classroom using the practical activity specification and the related competences.

A virtual mathematics learning environment for engineering students

Teachers of the course Introduction to Mathematics for Engineers at the UOC, an online distance-learning university, have designed,developed and tested an online studymaterial. It includes basic pre-university mathematics, indications for correct follow-up of this content and recommendations for finding appropriate support and complementarymaterials. Many different resources are used,depending on the characteristics of thecontents: Flash sequences, interactive applets, WIRIS calculators and PDF files.During the last semester, the new study material has been tested with 119 students. The academic results and student satisfaction have allowed us to outline and prioritise future lines of action.

A Virtual Mathematics Learning Environment for Engineering Students

Teachers of the course Introduction to Mathematics for Engineers at the UOC, an online distance-learning university, have designed and produced online study material which includes basic pre-university mathematics, instructions for correct follow-up of this content and recommendations for finding appropiate support and complementary materials.