Creació del nucli d'un servidor web

Disseny i implementació d'un nou servidor web multifil i multiplataforma en C++.

Bioinformática: base de datos de matrices de expresión génica para su análisis vía web

El IBB ha desarrollado un servidor de aplicaciones: http://revolutionresearch.uab.es para el análisis de microarrays. Estas microarrays las obtienen y las suben a la base de datos local los usuarios de la aplicación. En la presente memoria se detalla el proceso realizado para automatizar la subida de microarrays públicas a la base de datos local. Estas microarrays se obtendrán del NCBI. El proceso de descarga de microarrays se realizará cada dos meses y estará sincronizado con un proceso de descarga de genes marcadores de microarrays del NCBI. En la memoria también se describen las fases realizadas para crear la interfaz web para gestionar estas microarrays públicas y las modificaciones realizadas sobre el aplicativo web para permitir realizar análisis con estas microarrays.

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.

Torneos MMA

El projecte es basa en un aplicatiu web de gestió de tornejos, combats i cursos de diferents modalitats d'arts marcials, principalment de MMA (Mixed Martial Arts). L'aplicació està desenvolupada en J2EE, Java Server Faces, Prime Faces, Spring, Hibernate i utilitzant PostreSQL.

SGP-1: prediction and validation of homologous genes based on sequence alignments

Conventional methods of gene prediction rely on the recognition of DNA-sequence signals, the coding potential or the comparison of a genomic sequence with a cDNA, EST, or protein database. Reasons for limited accuracy in many circumstances are species-specific training and the incompleteness of reference databases. Lately, comparative genome analysis has attracted increasing attention. Several analysis tools that are based on human/mouse comparisons are already available. Here, we present a program for the prediction of protein-coding genes, termed SGP-1 (Syntenic Gene Prediction), which is based on the similarity of homologous genomic sequences. In contrast to most existing tools, the accuracy of SGP-1 depends little on species-specific properties such as codon usage or the nucleotide distribution. SGP-1 may therefore be applied to nonstandard model organisms in vertebrates as well as in plants, without the need for extensive parameter training. In addition to predicting genes in large-scale genomic sequences, the program may be useful to validate gene structure annotations from databases. To this end, SGP-1 output also contains comparisons between predicted and annotated gene structures in HTML format. The program can be accessed via a Web server at http://soft.ice.mpg.de/sgp-1. The source code, written in ANSI C, is available on request from the authors.

ClubADSL: When your neighbors are your friends

ADSL is becoming the standard form of residential and small-business broadband Internet access due to, primarily, its low deployment cost. These ADSL residential lines are often deployed with 802.11 Access Points (AP) that providewireless connectivity. Given the density of ADSL deployment, it is often possible for a residential wireless client to be in range of several other APs, belonging to neighbors, with ADSL connectivity. While the ADSL technology has showed evident limits in terms of capacity (with speeds ranging 1-10 Mbps), the short-range wireless communication can guarantee a muchhigher capacity (up to 20 Mbps). Furthermore, the ADSL links in the neighborhood are generally under-utilized, since ADSL subscribers do not connect 100% of the time. Therefore, it is possible for a wireless client to simultaneously connect to several APs in range and effectively aggregate their available ADSL bandwidth.In this paper, we introduce ClubADSL, a wireless client that can simultaneously connect to several APs in range on different frequencies and aggregate both their downlink and uplink capacity. ClubADSL is a software that runs locally on the client-side, and it requires neither modification to the existing Internet infrastructure, nor any hardware/protocol upgradesto the 802.11 local area network. We show the feasibility of ClubADSL in seamlessly transmitting TCP traffic, and validate its implementation both in controlled scenarios and with current applications over real ADSL lines. In particular we show that a ClubADSL client can greatly benefit from the aggregated download bandwidth in the case of server-client applications such as video streaming, but can also take advantage of the increased upload bandwidth greatly reducing download times with incentive-based P2P applications such as BitTorrent.

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.

Generación automática de cuadros de mando vía web

El proyecto consta de una aplicación web destinada a generar cuadros de mandos para distintos clientes de una manera ágil y dinámica reduciendo así los tiempos de implementación de una herramienta de estas características. Dicha aplicación será desarrollada bajo .NET para el lado del servidor y jQuery & google Maps API para el lado cliente, por lo que hace a los informes y la base de datos todo estará implementado con Microsoft SQL Server 2008 R2.

ProyGes : soporte de gestión de proyectos

La aplicación tiene como objetivo llegar a la comunidad de alumnos, los cuales no pueden tener reuniones presenciales debido a su situación geográfica. La aplicación dispone de un conjunto de herramientas para poder centralizar toda la información que los usuarios vayan generando durante el desarrollo de los proyectos. Ha de ser una herramienta para facilitar la organización y la administración de los recursos de los usuarios de la plataforma. El proyecto que se presenta es una aplicación web, desarrollada en lenguajes PHP, SQL, HTML, JavaScript, CSS, Ajax, en un servidor Apache y base de datos MySQL.

Construcción y explotación de un almacén de datos para el análisis del sistema de ventas de una distribuidora farmacéutica

Construcción y explotación de un almacén de datos para el análisis del sistema de ventas de una distribuidora farmacéutica, realizado sobre la plataforma Microsoft SQL Server 2012.

Virtualització de sistemes

Aquest projecte està pensat per ajudar en la implantació de la tecnologia de virtualització dintre de la sala de servidors d'una empresa concreta on el projectista ha estat treballant. Aquesta tecnologia aporta certs avantatges tecnològics que cal estudiar i aplicar correctament. L'empresa ja tenia pensada la compra de nous servidors i s'ha cregut convenient, abans de seguir amb la infraestructura tradicional, de posar en pràctica aquesta tecnologia que com més avança el temps, més imprescindible s'està tornant.

Cercador documental amb lematització

Un cercador documental d'arxius locals, en diferents formats, que permet l'extracció i indexació de lemes en diferents idiomes (principalment català, castellà i anglès) en el que s'habilita la cerca a través d'una pàgina web allotjada en un servidor local.

Clúster de alta disponibilidad y balanceo de carga sobre un servidor web

El present projecte neix degut a la necessitat de dotar a un pàgina web de una estructura sòlida així com una millor resposta als usuaris. El projecte es pot fraccionar en 2 blocs, els quals son: -La creació de un clúster de alta disponibilitat de manera que assegurem que en cas de fallida de un dels servidors físics la web seguirà sent visible per al públic. -La creació de un clúster de balanceig de càrrega que s’encarrega de redirigir les peticions per a veure la web al node del clúster que sigui més ociós en aquell.