A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

MyHits: improvements to an interactive resource for analyzing protein sequences.

The MyHits web site (http://myhits.isb-sib.ch) is an integrated service dedicated to the analysis of protein sequences. Since its first description in 2004, both the user interface and the back end of the server were improved. A number of tools (e.g. MAFFT, Jacop, Dotlet, Jalview, ESTScan) were added or updated to improve the usability of the service. The MySQL schema and its associated API were revamped and the database engine (HitKeeper) was separated from the web interface. This paper summarizes the current status of the server, with an emphasis on the new services.

The Microbe browser for comparative genomics.

The Microbe browser is a web server providing comparative microbial genomics data. It offers comprehensive, integrated data from GenBank, RefSeq, UniProt, InterPro, Gene Ontology and the Orthologs Matrix Project (OMA) database, displayed along with gene predictions from five software packages. The Microbe browser is daily updated from the source databases and includes all completely sequenced bacterial and archaeal genomes. The data are displayed in an easy-to-use, interactive website based on Ensembl software. The Microbe browser is available at http://microbe.vital-it.ch/. Programmatic access is available through the OMA application programming interface (API) at http://microbe.vital-it.ch/api.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Aplicación de software de interpolación en las evaluaciones hidroacústicas de la biomasa y distribución de recursos pelágicos

Propone una alternativa para el procesamiento de datos de ecointegración acústica cuando se pretende obtener la distribución y el nivel de biomasa de recursos marinos, mediante la aplicación de un software de interpolación de datos.

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.

Projecto de Software Utilizando a UML Caso Prático: Modelação do Subsistema de Secretaria Digital – Universidade Jean Piaget

O presente trabalho demonstra a utilização da linguagem UML na modelação (também se aplica à projecção e desenvolvimento) de sistemas. Incorpora um estudo de caso que consiste na modelação (também, propostas de implementação, sobretudo ao nível do modelo de dados) de um subsistema que faz parte do Sistema de Gestão Académico (SIAC) na Universidade Jean Piaget de Cabo Verde (Unipiaget).O trabalho surge após a percepção das dificuldades em que os alunos e não só, se enfrentam para terem acessos aos dados académicos, principalmente nos períodos em que estes se encontram de férias, daí a necessidade de implementação da Universidade Digital. Assim, aproveitando as boas práticas do desenvolvimento de sistemas, iniciou-se o processo da subdivisão do problema maior (Universidade Digital) em subproblemas (vários subsistemas), cujo projecto se concentra na análise e modelação do subsistema de secretaria digital. A metodologia adoptada foi a do diálogo directo programado e não programado, aplicação de questionários e entrevistas, assim como a da proposta de melhorias.Sendo assim, o trabalho iniciou-se com o levantamento de requisitos e avaliado face ao comportamento de subsistema no seu modo presencial (estado actual). E, por fim foram efectuadas propostas de melhorias, as quais permitirão alcançar a satisfação dos potênciais actores (utilizador do sistema).

Tenda Virtual orientada a compres per escaneig amb el telèfon mòbil

CMS (Sistema Gestor de Continguts) és una tecnologia en ple auge que permet implantar solucions web d'una manera senzilla, econòmica i amb un fàcil manteniment per part dels usuaris que en fan ús. Aquest projecte és un estudi que pretén analitzar i escollir el millor CMS dirigit a comerç electrònic d'entre el ventall existent actualment al mercat, creant un document que serveixi de referent o guia a qualsevol persona interessada en implantar un sistema d'aquestes característiques. A més, es centrarà a la programació d'un component instal·lable pel CMS escollit que permeti introduir-nos a la creació d'extensions i ens formi en l'àmbit de la programació web. Aquest component el podrem afegir al CMS i permetrà realitzar compres escanejant codis amb el telèfon mòbil.

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.

Manual de uso del software Ocean Data View (ODV)

El presente manual de uso del software de visualización de datos “Ocean Data View” (ODV) describe la exploración, análisis y visualización de datos oceanográficos según el formato de la colección mundial de base de datos del océano “World Ocean Database” (WOD). El manual comprende 6 ejercicios prácticos donde se describe paso a paso la creación de las metavariables, la importación de los datos y su visualización mediante mapas de latitud, longitud y gráficos de dispersión, secciones verticales y series de tiempo. Se sugiere el uso extensivo del ODV para la visualización de datos oceanográficos por el personal científico del IMARPE.

Software lliure aplicat a un institut

Aquest projecte intenta donar una alternativa al software privatiu, fent servir el software lliure, i per aconseguir aquest objectiu es crea una distribució GNU/Linux adaptada a les necessitats del institut IES Sabadell. També es realitza un petit estudi dels dos tipus de software, lliure i privatiu, en que es mostrà la historia, tipus de llicències, models de negoci i les avantatges que tenen.