Implantació d'un ERP i una plataforma e-commerce de software lliure per al desenvolupament web d'una empresa

Aquest projecte constitueix la introducció d'un sistema d'informació a una PIME catalana. Incorporant dos grans i potents funcionalitats i serveis a l'empresa: la venta online mitjançant un e-commerce i la gestió de la informació i productes que hi ha a l'empresa mitjançant un ERP.

RestKiosk : Software d'autoservei per a restauració

Primera versió d'una aplicació per a establiments de restauració que té com a finalitat oferir als clients la possibilitat de fer les comandes de forma autònoma.

Creació d’un visor web basat en software lliure per al Consorci d’Ardenya-Cadiretes

En aquest treball es pretén explicar el procés metodològic que s'ha seguit per a crear una eina informàtica de visualització de dades "online" per al Consorci d'Ardenya – Cadiretes. Inicialment s'explica el context en el que es desenvolupa el projecte, com a conveni de col·laboració en pràctiques, per a realitzar el treball de final del Màster en Tecnologies de la Informació Geogràfica, en la seva tretzena edició. S'explica també la situació de l'entitat col·laboradora del projecte, el consorci d'Ardenya – Cadiretes. Els objectius que es fixen al projecte són els de generar aquest visor amb eines de software lliure, de manera que el cost de producció sigui el menor possible. També es pretén crear una aplicació de senzill ús i que resulti atractiva per al client web. Es repassen els diferents aspectes tècnics i funcionals que ha de tenir en compte el projecte, per tal que aquest es pugui desenvolupar de forma correcte. Es tracten temes com el tipus de programari que s'ha de fer servir i per que unes aplicacions es consideren més oportunes que d'altres per a treballar tasques concretes del propi projecte. A través de la metodologia seguida en el projecte es repassa el dia a dia que s'ha anat seguint durant el projecte, des de l'inici en el que s'instal·laven els diferents programes necessaris fins al final de l'escriptura del codi de programació, passant per l'edició de les dades geogràfiques o la càrrega d'aquestes al servidor de mapes

An Analysis of black-box optimization problems in reinsurance: evolutionary-based approaches

Black-box optimization problems (BBOP) are de ned as those optimization problems in which the objective function does not have an algebraic expression, but it is the output of a system (usually a computer program). This paper is focussed on BBOPs that arise in the eld of insurance, and more speci cally in reinsurance problems. In this area, the complexity of the models and assumptions considered to de ne the reinsurance rules and conditions produces hard black-box optimization problems, that must be solved in order to obtain the optimal output of the reinsurance. The application of traditional optimization approaches is not possible in BBOP, so new computational paradigms must be applied to solve these problems. In this paper we show the performance of two evolutionary-based techniques (Evolutionary Programming and Particle Swarm Optimization). We provide an analysis in three BBOP in reinsurance, where the evolutionary-based approaches exhibit an excellent behaviour, nding the optimal solution within a fraction of the computational cost used by inspection or enumeration methods.

Propuesta para incorporar evaluación y pruebas de usabilidad dentro de un proceso de desarrollo de software

Usability is critical to consider an interactive software system successful. Usability testing and evaluation during product development have gained wide acceptance as a strategy to improve product quality. Early introduction of usability perspectives in a product is very important in order to provide a clear visibility of the quality aspects not only for the developers, but also for the testing users as well. However, usability evaluation and testing are not commonly taken into consideration as an essential element of the software development process. Then, this paper exposes a proposal to introduce usability evaluation and testing within a software development through reuse of software artifacts. Additionally, it suggests the introduction of an auditor within the classification of actors for usability tests. It also proposes an improvement of checklists used for heuristics evaluation, adding quantitative and qualitative aspects to them

Implementació d'un contact center per empreses basat en software lliure

El proyecto consiste en la creación de un CRM de contact center con canal de telefonía y correo electrónico. Se ha llevado a cabo utilizando software libre. Se integra con centralita telefónica para permitir la realización de llamadas por Voip.

Plan de implantación y migración al software libre del Ayuntamiento de Palencia

Proyecto de migración e implantación de software libre en el Ayuntamiento de Palencia.

Free-and open source software for a course on network management: authoring and enactment of scripts based on collaborative learning strategies

This paper describes a Computer-Supported Collaborative Learning (CSCL) case study in engineering education carried out within the context of a network management course. The case study shows that the use of two computing tools developed by the authors and based on Free- and Open-Source Software (FOSS) provide significant educational benefits over traditional engineering pedagogical approaches in terms of both concepts and engineering competencies acquisition. First, the Collage authoring tool guides and supports the course teacher in the process of authoring computer-interpretable representations (using the IMS Learning Design standard notation) of effective collaborative pedagogical designs. Besides, the Gridcole system supports the enactment of that design by guiding the students throughout the prescribed sequence of learning activities. The paper introduces the goals and context of the case study, elaborates onhow Collage and Gridcole were employed, describes the applied evaluation methodology, anddiscusses the most significant findings derived from the case study.

Biana: a software framework for compiling biological interactions and analyzing networks

Background: The analysis and usage of biological data is hindered by the spread of information across multiple repositories and the difficulties posed by different nomenclature systems and storage formats. In particular, there is an important need for data unification in the study and use of protein-protein interactions. Without good integration strategies, it is difficult to analyze the whole set of available data and its properties.Results: We introduce BIANA (Biologic Interactions and Network Analysis), a tool for biological information integration and network management. BIANA is a Python framework designed to achieve two major goals: i) the integration of multiple sources of biological information, including biological entities and their relationships, and ii) the management of biological information as a network where entities are nodes and relationships are edges. Moreover, BIANA uses properties of proteins and genes to infer latent biomolecular relationships by transferring edges to entities sharing similar properties. BIANA is also provided as a plugin for Cytoscape, which allows users to visualize and interactively manage the data. A web interface to BIANA providing basic functionalities is also available. The software can be downloaded under GNU GPL license from http://sbi.imim.es/web/BIANA.php.Conclusions: BIANA's approach to data unification solves many of the nomenclature issues common to systems dealing with biological data. BIANA can easily be extended to handle new specific data repositories and new specific data types. The unification protocol allows BIANA to be a flexible tool suitable for different user requirements: non-expert users can use a suggested unification protocol while expert users can define their own specific unification rules.

The customer valuations game as a basis for revenue management

I describe the customer valuations game, a simple intuitive game that can serve as a foundation for teaching revenue management. The game requires little or no preparation, props or software, takes around two hours (and hence can be finished in one session), and illustrates the formation of classical (airline and hotel) revenue management mechanisms such as advanced purchase discounts, booking limits and fixed multiple prices. I normally use the game as a base to introduce RM and to develop RM forecasting and optimization concepts off it. The game is particularly suited for non-technical audiences.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

KemapMobile: una adaptación de la herramienta software KeMap a la plataforma Android

Este trabajo describe el proceso de creación de la herramienta de software KemapMobile para la plataforma Android. El artefacto es una adaptación del software de escritorio KeMap que se integra en la plataforma educativa VerilUOC y permite a los estudiantes conectarse a ella para descargar, en la aplicación, ejercicios con los que poner a prueba y afianzar sus conocimientos sobre la simplificación de funciones lógicas booleanas con mapas de Karnaugh y tablas de verdad. La arquitectura cliente-servidor de la aplicación permite a los estudiantes disponer de ejercicios personalizados y al profesorado obtener datos sobre el uso de la herramienta y sobre la progresión del alumnado.

Laboratorio virtual de química en software libre para la preparación de disoluciones

Con este TFM se muestra un laboratorio virtual de química a través de diversos experimentos para la preparación de disoluciones en función de sus expresiones de concentración.