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.

Programming and analysing measurement experiments using the PicoCricket system

The aim of this project is to get used to another kind of programming. Since now, I used very complex programming languages to develop applications or even to program microcontrollers, but PicoCricket system is the evidence that we don’t need so complex development tools to get functional devices. PicoCricket system is the clear example of simple programming to make devices work the way we programmed it. There’s an easy but effective way to program small, devices just saying what we want them to do. We cannot do complex algorithms and mathematical operations but we can program them in a short time. Nowadays, the easier and faster we produce, the more we earn. So the tendency is to develop fast, cheap and easy, and PicoCricket system can do it.

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

Feblesa de tutories: manca de feedback i autoregulació en l'estudiant d'infermeria. Valoració de l'avaluació continuada en l'assignatura Ciències Psicosocials Aplicades a la Salut en el Grau d'Infermeria (EEES), (2009-2010)

Resum: En el nou model derivat de l"Espai Europeu d"Educació Superior (EEES), l"ensenyament aprenentatge (E-A) es centra en l"estudiant, enfront del rol més destacat del professor en l"ensenyament tradicional. El procés d"experimentació al que assistim en el nostre medi, requereix la valoració de les primeres experiències. Objectiu: L"objectiu d"aquest estudi és identificar si la metodologia utilitzada en l"assignatura Ciències Psicosocials Aplicades a la Salut, en el Grau d"Infermeria a l"Escola d" infermeria de la Universitat de Barcelona, està ben enfocada per assolir una avaluació continuada de qualitat. Metodologia: Es presenta a traves d"un estudi descriptiu. La població estudiada mitjançant un qüestionari, ha estat els estudiants dels quatre grups de primer curs, del primer any de desenvolupament del Grau d"Infermeria en el nostre Centre, passades el curs acadèmic 2009-2010, amb una mostra total de 221 alumnes. Conclusions: Els resultats permeten tres franges interpretatives: 1) qualificació de notable que fa referència a la modalitat disciplinar i experiència docent del professorat, 2) qualificació entre notable i aprovat referida a la metodologia didàctica i organitzativa, 3) qualificació d"aprovat que fa referència a les tutories.

Feblesa de tutories: manca de feedback i autoregulació en l'estudiant d'infermeria. Valoració de l'avaluació continuada en l'assignatura Ciències Psicosocials Aplicades a la Salut en el Grau d'Infermeria (EEES), (2009-2010)

Resum: En el nou model derivat de l"Espai Europeu d"Educació Superior (EEES), l"ensenyament aprenentatge (E-A) es centra en l"estudiant, enfront del rol més destacat del professor en l"ensenyament tradicional. El procés d"experimentació al que assistim en el nostre medi, requereix la valoració de les primeres experiències. Objectiu: L"objectiu d"aquest estudi és identificar si la metodologia utilitzada en l"assignatura Ciències Psicosocials Aplicades a la Salut, en el Grau d"Infermeria a l"Escola d" infermeria de la Universitat de Barcelona, està ben enfocada per assolir una avaluació continuada de qualitat. Metodologia: Es presenta a traves d"un estudi descriptiu. La població estudiada mitjançant un qüestionari, ha estat els estudiants dels quatre grups de primer curs, del primer any de desenvolupament del Grau d"Infermeria en el nostre Centre, passades el curs acadèmic 2009-2010, amb una mostra total de 221 alumnes. Conclusions: Els resultats permeten tres franges interpretatives: 1) qualificació de notable que fa referència a la modalitat disciplinar i experiència docent del professorat, 2) qualificació entre notable i aprovat referida a la metodologia didàctica i organitzativa, 3) qualificació d"aprovat que fa referència a les tutories.

Cooking and Active Leisure TAS Program, Spain: A Program Impact Pathways (PIP) analysis

Background. The “Cooking and Active Leisure” Tu y Alícia por la Salud (CAL-TAS) Program is a schoolbased pilot that addresses healthy lifestyle needs of Spanish secondary school students with initiatives that research has proven to improve dietary and physical activity behaviors. Objective. The objectives were to perform a Program Impact Pathways (PIP) analysis to describe key activities and processes of the CAL-TAS Program, identify Critical Quality Control Points (CCPs), and identify a suite of common indicators of healthy lifestyles to be applied across participant schools. Methods. The CAL-TAS Program designers and implementation team developed this PIP analysis through an iterative process and presented the results for feedback at the seven-country Healthy Lifestyles Program Evaluation Workshop held in Granada, Spain, 13–14 September 2013, under the auspices of the Mondelēz International Foundation. Results. The team identified three PIP CCPs: teachers’ motivation and training, changes in students’ knowledge of healthy lifestyles, and changes in students’ healthy lifestyle behavior. The selected indicators of the program’s impact on healthy lifestyles are adequacy of food intake, level of knowledge of healthy lifestyles gained, and adequacy of physical activity level according to World Health Organization recommendations. A clear definition of impact indicators, as well as collection of accurate data on healthy lifestyle behaviors and knowledge, is essential to understanding the effectiveness of this program before it can be scaled up. Conclusions. CAL-TAS is an effective secondary school-based program encouraging healthy lifestyles. The PIP analysis was instrumental in identifying CCPs to sustain and improve the quality of the program. The team hopes to sustain and improve the program through these program evaluation recommendations.

Programming and analysing measurement experiments using the PicoCricket system

The aim of this project is to get used to another kind of programming. Since now, I used very complex programming languages to develop applications or even to program microcontrollers, but PicoCricket system is the evidence that we don’t need so complex development tools to get functional devices. PicoCricket system is the clear example of simple programming to make devices work the way we programmed it. There’s an easy but effective way to programs mall devices just saying what we want them to do. We cannot do complex algorithms and mathematical operations but we can program them in a short time. Nowadays, the easier and faster we produce, the more we earn. So the tendency is to develop fast, cheap and easy, and PicoCricket system can do it.

Social Presence Approach Within the Question and Answering eLearning Model: An Experiment with a Multi-Agent System

The model of Questions Answering (Q&A) for eLearning is based on collaborative learning through questions that are posed by students and their answers to that questions which are given by peers, in contrast with the classical model in which students ask questions to the teacher only. In this proposal we extend the Q&A model including the social presence concept and a quantitative measure of it is proposed; besides it is considered the evolution of the resulting Q&A social network after the inclusion of the social presence and taking into account the feedback on questions posed by students and answered by peers. The social network behaviorwas simulated using a Multi-Agent System to compare the proposed social presence model with the classical and the Q&A models

Aplicaciones Single Program Multiple Data (SPMD) en ambientes distribuidos

Un reto al ejecutar las aplicaciones en un cluster es lograr mejorar las prestaciones utilizando los recursos de manera eficiente, y este reto es mayor al utilizar un ambiente distribuido. Teniendo en cuenta este reto, se proponen un conjunto de reglas para realizar el cómputo en cada uno de los nodos, basado en el análisis de cómputo y comunicaciones de las aplicaciones, se analiza un esquema de mapping de celdas y un método para planificar el orden de ejecución, tomando en consideración la ejecución por prioridad, donde las celdas de fronteras tienen una mayor prioridad con respecto a las celdas internas. En la experimentación se muestra el solapamiento del computo interno con las comunicaciones de las celdas fronteras, obteniendo resultados donde el Speedup aumenta y los niveles de eficiencia se mantienen por encima de un 85%, finalmente se obtiene ganancias de los tiempos de ejecución, concluyendo que si se puede diseñar un esquemas de solapamiento que permita que la ejecución de las aplicaciones SPMD en un cluster se hagan de forma eficiente.

Optimal feedback control rules sensitive to controlled endogenous risk-aversion

The objective of this paper is to correct and improve the results obtained by Van der Ploeg (1984a, 1984b) and utilized in the theoretical literature related to feedback stochastic optimal control sensitive to constant exogenous risk-aversion (see, Jacobson, 1973, Karp, 1987 and Whittle, 1981, 1989, 1990, among others) or to the classic context of risk-neutral decision-makers (see, Chow, 1973, 1976a, 1976b, 1977, 1978, 1981, 1993). More realistic and attractive, this new approach is placed in the context of a time-varying endogenous risk-aversion which is under the control of the decision-maker. It has strong qualitative implications on the agent's optimal policy during the entire planning horizon.

Anàlisi del Microsoft Robotics Studio

Cada cop més s’utilitzen robots en molts àmbits de la vida, els quals han de ser programats, i el fet que Microsoft s’impliqui aportant una eina de programació resulta interessant. Aprendre a programar robots i colònies de robots amb aquesta eina, la qual està tenint una bona acollida, és molt important, per això en aquest projecte s’ha fet una anàlisi crítica de MRS i del material docent associat a l’aplicació. Els resultats i conclusions obtinguts han estat, d’una banda, que és la millor eina de programació de robots, en termes generals, i d’altra, una guia iniciativa a l’entorn MRS, accessible a la direcció: http://shades.uab.cat/MSRS.

The Electoral Determinants of Collective Remittances: The Mexican 3x1 Program for Migrants

The 3x1 Program for Migrants is a matching grant scheme that seeks to direct the money sent by migrant organizations abroad to the provision of public and social infrastructure, and to productive projects in migrants’ communities of origin. To do so, the municipal, state, and federal administrations match the amount sent by hometown associations by 3 to 1. This opens the door to the political manipulation of the program. We explore the impact of a particular facet of Mexican political life on the operation of the 3x1: its recent democratization and the increasing political competition at the municipal level. Relying on the literature on redistributive politics, we posit that an increasing number of effective parties in elections may have two different effects. On the one hand, the need to cater to more heterogeneous constituencies may increase the provision of public projects. On the other hand, since smaller coalitions are needed to win elections under tighter competition, fewer public and more private (clientelistic) projects could be awarded. Using a unique dataset on the 3x1 Program for Migrants for over 2,400 municipalities in the period 2002 through 2007, we find a lower provision of public goods in electorally competitive jurisdictions. Thus, we remain sceptical about the program success in promoting public goods in politically competitive locations with high migration levels.

La programació al servei de la matemàtica

Treball de recerca realitzat per un alumne d'ensenyament secundari i guardonat amb un Premi CIRIT per fomentar l'esperit cientí­fic del Jovent l'any 2009. La programació al servei de la matemàtica és un programa informàtic fet amb Excel i Visual Basic. Resol equacions de primer grau, equacions de segon grau, sistemes d'equacions lineals de dues equacions i dues incògnites, sistemes d'equacions lineals compatibles determinats de tres equacions i tres incògnites i troba zeros de funcions amb el teorema de Bolzano. En cadascun dels casos, representa les solucions gràficament. Per a això, en el treball s'ha hagut de treballar, en matemàtiques, amb equacions, nombres complexos, la regla de Cramer per a la resolució de sistemes, i buscar la manera de programar un mètode iteratiu pel teorema de Bolzano. En la part gràfica, s'ha resolt com fer taules de valors amb dues i tres variables i treballar amb rectes i plans. Per la part informàtica, s'ha emprat un llenguatge nou per l'alumne i, sobretot, ha calgut saber decidir on posar una determinada instrucció, ja que el fet de variar-ne la posició una sola lí­nea ho pot canviar tot. A més d'això, s'han resolt altres problemes de programació i també s'ha realitzat el disseny de pantalles.

The Multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria

A multiple-partners assignment game with heterogeneous sales and multiunit demands consists of a set of sellers that own a given number of indivisible units of (potentially many different) goods and a set of buyers who value those units and want to buy at most an exogenously fixed number of units. We define a competitive equilibrium for this generalized assignment game and prove its existence by using only linear programming. In particular, we show how to compute equilibrium price vectors from the solutions of the dual linear program associated to the primal linear program defined to find optimal assignments. Using only linear programming tools, we also show (i) that the set of competitive equilibria (pairs of price vectors and assignments) has a Cartesian product structure: each equilibrium price vector is part of a competitive equilibrium with all optimal assignments, and vice versa; (ii) that the set of (restricted) equilibrium price vectors has a natural lattice structure; and (iii) how this structure is translated into the set of agents' utilities that are attainable at equilibrium.