Multi-purpose infrastructure for delivering and supporting mobile context-aware applications

The use of contextual information in mobile devices is receiving increasing attention in mobile and ubiquitous computing research. An important requirement for mobile development today is that devices should be able to interact with the context. In this paper we present a series of contributions regarding previous work on context-awareness. In the first place, we describe a client-server architecture that provides a mechanism for preparing target non context-aware applications in order to be delivered as context-aware applications in a semi-automatic way. Secondly, the framework used in the server to instantiate specific components for context-awareness, the Implicit Plasticity Framework, provides independence from the underlying mobile technology used in client device, as it is shown in the case studies presented. Finally, proposed infrastructure deals with the interaction among different context constraints provided by diverse sensors. All of these contributions are extensions to the infrastructure based on the Dichotomic View of plasticity, which now offers multi-purpose support.

Coscheduling techniques and monitoring tools for non-dedicated cluster computing

Our efforts are directed towards the understanding of the coscheduling mechanism in a NOW system when a parallel job is executed jointly with local workloads, balancing parallel performance against the local interactive response. Explicit and implicit coscheduling techniques in a PVM-Linux NOW (or cluster) have been implemented. Furthermore, dynamic coscheduling remains an open question when parallel jobs are executed in a non-dedicated Cluster. A basis model for dynamic coscheduling in Cluster systems is presented in this paper. Also, one dynamic coscheduling algorithm for this model is proposed. The applicability of this algorithm has been proved and its performance analyzed by simulation. Finally, a new tool (named Monito) for monitoring the different queues of messages in such an environments is presented. The main aim of implementing this facility is to provide a mean of capturing the bottlenecks and overheads of the communication system in a PVM-Linux cluster.

Integrating defeasible argumentation with fuzzy ART neural networks for pattern classification

Many classification systems rely on clustering techniques in which a collection of training examples is provided as an input, and a number of clusters c1,...cm modelling some concept C results as an output, such that every cluster ci is labelled as positive or negative. Given a new, unlabelled instance enew, the above classification is used to determine to which particular cluster ci this new instance belongs. In such a setting clusters can overlap, and a new unlabelled instance can be assigned to more than one cluster with conflicting labels. In the literature, such a case is usually solved non-deterministically by making a random choice. This paper presents a novel, hybrid approach to solve this situation by combining a neural network for classification along with a defeasible argumentation framework which models preference criteria for performing clustering.

Teaching fundamentals of computing theory: a constructivist approach

A Fundamentals of Computing Theory course involves different topics that are core to the Computer Science curricula and whose level of abstraction makes them difficult both to teach and to learn. Such difficulty stems from the complexity of the abstract notions involved and the required mathematical background. Surveys conducted among our students showed that many of them were applying some theoretical concepts mechanically rather than developing significant learning. This paper shows a number of didactic strategies that we introduced in the Fundamentals of Computing Theory curricula to cope with the above problem. The proposed strategies were based on a stronger use of technology and a constructivist approach. The final goal was to promote more significant learning of the course topics.

Formalizing defeasible argumentation using a labeled deductive system

In the last years there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI, logic programming and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to formalize such a kind of complex logical systems. In the last decade, defeasible argumentation has proven to be a confluence point for many approaches to formalizing commonsense reasoning. Different formalisms have been developed, many of them sharing common features. This paper presents a formalization of an LDS for defensible argumentation, in which the main issues concerning defeasible argumentation are captured within a unified logical framework. The proposed framework is defined in two stages. First, defeasible inference will be formalized by characterizing an argumentative LDS. That system will be then extended in order to capture conflict among arguments using a dialectical approach. We also present some logical properties emerging from the proposed framework, discussing also its semantical characterization.

What to consider for applying backfilling on non-dedicated environments

The resource utilization level in open laboratories of several universities has been shown to be very low. Our aim is to take advantage of those idle resources for parallel computation without disturbing the local load. In order to provide a system that lets us execute parallel applications in such a non-dedicated cluster, we use an integral scheduling system that considers both Space and Time sharing concerns. For dealing with the Time Sharing (TS) aspect, we use a technique based on the communication-driven coscheduling principle. This kind of TS system has some implications on the Space Sharing (SS) system, that force us to modify the way job scheduling is traditionally done. In this paper, we analyze the relation between the TS and the SS systems in a non-dedicated cluster. As a consequence of this analysis, we propose a new technique, termed 3DBackfilling. This proposal implements the well known SS technique of backfilling, but applied to an environment with a MultiProgramming Level (MPL) of the parallel applications that is greater than one. Besides, 3DBackfilling considers the requirements of the local workload running on each node. Our proposal was evaluated in a PVM/MPI Linux cluster, and it was compared with several more traditional SS policies applied to non-dedicated environments.

CISNE-P: a global scheduling oriented to NOW environments

In this work, we present an integral scheduling system for non-dedicated clusters, termed CISNE-P, which ensures the performance required by the local applications, while simultaneously allocating cluster resources to parallel jobs. Our approach solves the problem efficiently by using a social contract technique. This kind of technique is based on reserving computational resources, preserving a predetermined response time to local users. CISNE-P is a middleware which includes both a previously developed space-sharing job scheduler and a dynamic coscheduling system, a time sharing scheduling component. The experimentation performed in a Linux cluster shows that these two scheduler components are complementary and a good coordination improves global performance significantly. We also compare two different CISNE-P implementations: one developed inside the kernel, and the other entirely implemented in the user space.

Statistical modelling of CSP solving algorithms performance

The goal of this work is to try to create a statistical model, based only on easily computable parameters from the CSP problem to predict runtime behaviour of the solving algorithms, and let us choose the best algorithm to solve the problem. Although it seems that the obvious choice should be MAC, experimental results obtained so far show, that with big numbers of variables, other algorithms perfom much better, specially for hard problems in the transition phase.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Ontologia de Twitter : El primer pas per inferir informació dels tweets

En aquest treball es realitza un estudi sobre l'estat de l'art de la web semàntica i els seus estàndards actuals, més concretament sobre ontologies. Descriu també el procés pràctic emprat pel disseny i la implementació d'una ontologia en el domini concret de Twitter, en format OWL, fent servir l'aplicació Protégé per a la seva creació. Finalment explica la creació (captura de requeriments, disseny i implementació) d'una aplicació capaç d'obtenir dades reals de Twitter, processar-les per extreure'n la informació rellevant i emmagatzemar-la a la ontologia creada.

I am free

Desarrollo de una aplicación basada en la localización y creación de rutas para personas discapacitadas, mayores, con movilidad reducida, con Alzheimer o demencia senil y personas que no puedan comunicarse verbalmente. La función de la aplicación es saber siempre su ubicación y, en caso de sufrir alguna crisis, llamar a sus cuidadores o familiares.

PuzleFotoApp

Memòria del projecte final de carrera de l'aplicació PuzleFotoApp. Aquesta aplicació és un joc educatiu (pel sistema operatiu Android) que permet resoldre puzles lliscants.

MeteoCAT : Visor web SIG de dades meteorològiques

El projecte consisteix en la creació d'un visor web SIG de dades meteorològiques. Esta eina permetrà els usuaris accedir a una web on podran consultar i visualitzar diferents dades cartogràfiques i meteorològiques. A més a més, podran superposar en un mapa diferents conjunts de dades a analitzar, facilitant per tant la feina dels meteoròlegs. Es podrà també accedir a dades de diferents dates i visualitzar un històric de la situació del clima, facilitant la tasca de crear models històrics i permetent veure com ha evolucionat el clima al llarg del temps.

Diseño, elaboración y explotación de un data warehouse para una institución sanitaria

Diseño, elaboración y explotación de un data warehouse para una institución sanitaria.

Inventario de fichas de operaciones estadísticas

Se ha propuesto al IBESTAT un proyecto global basado en la implantación de un sistema de gestión mediante un desarrollo a medida para el tratamiento, la gestión, el control y la difusión de las actividades estadísticas que se llevan a cabo en la comunidad autónoma por parte de los diferentes organismos públicos, enmarcadas en el programa anual y en el plan estadístico que oficializan dichos datos, basado en las reuniones mantenidas y en la información a la que ha tenido acceso. El alcance contempla tanto la definición de la arquitectura necesaria de la plataforma, como el desarrollo y la puesta en producción. El proyecto permitirá al IBESTAT disponer de una aplicación web desarrollada mediante una tecnología integrada con el resto de la informática del gobierno de las Islas Baleares y en especial con lo referente a la nueva estrategia de desarrollo de servicios web y de aplicación telemática enmarcada en la Ley 11/2007 de acceso de los ciudadanos a la administración digital por medios telemáticos.