Especificacions, Anàlisi i Disseny d'un Programari de Gestió de Magatzems

Aquest treball de fi de carrera vol reflectir les necessitats bàsiques per al disseny d'un programari de gestió de magatzems (PGM a partir d'ara). Un PGM té la particularitat d'haver d'establir connexions entre els fluxos físics del treball propi d'un magatzem i els fluxos de dades propis d'un sistema informàtic. Les prestacions del PGM s'hauran de desenvolupar en part en terminals de radiofreqüència, ja que es considera que el treball en línia és bàsic per a gestionar un magatzem.

A virtual exhibition of open source software for libraries

Frequently the choice of a library management program is conditioned by social, economic and/or political factors that result in the selection of a system that is not altogether suitable for the library’s needs, characteristics and functions. Open source software is quickly becoming a preferred solution, owing to the freedom to copy, modify and distribute it and the freedom from contracts, as well as for greater opportunities for interoperability with other applications. These new trends regarding open source software in libraries are also reflected in LIS studies, as evidenced by the different courses addressing automated programs, repositorymanagement, including the Linux/GNU operating system, among others. The combination of the needs of the centres and the new trends for open source software is the focus of a virtual laboratory for the use of open source software for library applications. It was the result of a project, whose aim was to make a useful contribution to the library community, that was carried out by a group of professors of the School of Library and Information Science of the University of Barcelona, together with a group of students, members of a Working Group on Open Source Software for Information Professionals, of the Professional Library Association of Catalonia.

Implementació d'un pla director de seguretat

Treball final de màster consistent en la implementació d'un pla director de seguretat.

Control biológico de Panonychus ulmi (Koch) mediante ácaros fitoseidos en plantaciones de control integrado de manzano en Cataluña

Se ha aplicado el Control Integrado de Plagas en unas 40 parcelas comerciales de manzano de Girona y de Lleida desde 1991 a 1993 con el objetivo de controlar biológicamente la araña roja (P. ulmi) mediante ácaros Phytoseiidae. Así mismo, se ha evaluado la estrategia de control de esta plaga, se han evaluado los factores principales que pueden influir en el éxito del control biológico y se ha diseñado una estrategia de defensa sencilla. En la mayoría de los casos, el control biológico se ha debido a la acción de Amblyseius andersoni o a la acción combinada de A. andersoni y A. californicus. A. andersoni impide el desarrollo de poblaciones elevadas de araña roja y la aparición de daños por decoloración. En las parcelas de Girona se ha producido la sustitución paulatina de A. californicus por A. andersoni. Los factores determinantes del éxito del control biológico fueron el nivel de actividad de P. ulmi y la presencia de A. andersoni, lo que plantea nuevas cuestiones relativas a cómo se puede favorecer la implantación de esta especie en parcelas comerciales. Finalmente, se propone una estrategia de defensa sencilla, basada en la época de aparición de la plaga y de los fitoseidos y en la relación que se establece entre ambas poblaciones durante el ciclo vegetativo.

Elaboración de un plan de implementación de la ISO/IEC 27001:2005 en le empresa Ahorraya

Implementación de un sistema de gestión de seguridad de la información (SGSI), basado en las normas ISO 27001:2005 e ISO 27002:2005, en la empresa financiera Ahorraya, el cual pretende administrar el modelo de seguridad y gestionar los riesgos presentados en la organización llevándolos a su mínima expresión.

Un model per a la gestió cultural municipal : Les arts visuals locals en revisió

El treball desenvolupa en cinc capítols la recerca, l'estudi de dades i les conclusions de la hipòtesi de treball inicial: es possible implementar un nou programa d'arts visuals de qualitat a Rubí? A través de l'estudi detallat, l'anàlisi de dates quantitatives i qualitatives, les entrevistes a responsables de centres d'arts visuals de tota Catalunya i amb la realitat de gestió de les arts visuals del municipi de Rubí, es tracta d'arribar a unes conclusions que condueixen al plantejament d'un nou model de gestió per a l'Ajuntament de Rubí.

L'impacte de la iconografia musical en les dinàmiques socials : David Bowie o el poder social de les imatges musicals

El present treball de recerca posa de relleu que la música és un element fonamental de la configuració de les societats humanes actuals i analitza un cas concret, el de l'artista britànic David Bowie, per il·lustrar els mecanismes pels quals un artista pot convertir-se en una icona i, d'aquesta manera, influir decissivament en la configuració d'elements de l'imaginari social compartit.

Abstenció diferencial, vot dual i vot diferencial a L'Hospitalet de Llobregat : Estudi sobre el comportament electoral a L'Hospitalet de Llobregat entre 1979 i 2014

Aquest treball presenta un anàlisi sobre el comportament electoral a L'Hospitalet de Llobregat entre 1979 i 2014, en relació als diferents nivells de participació electoral i les diferències en el vot a partits que es produeixen segons l'àmbit de la convocatòria electoral.

An enhanced concave program relaxation for choice network revenue management

The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.

The role of computational fluid dynamics in the management of unruptured intracranial aneurysms: a clinicians' view

Objective: The importance of hemodynamics in the etiopathogenesis of intracranial aneurysms (IAs) is widely accepted.Computational fluid dynamics (CFD) is being used increasingly for hemodynamic predictions. However, alogn with thecontinuing development and validation of these tools, it is imperative to collect the opinion of the clinicians. Methods: A workshopon CFD was conducted during the European Society of Minimally Invasive Neurological Therapy (ESMINT) Teaching Course,Lisbon, Portugal. 36 delegates, mostly clinicians, performed supervised CFD analysis for an IA, using the @neuFuse softwaredeveloped within the European project @neurIST. Feedback on the workshop was collected and analyzed. The performancewas assessed on a scale of 1 to 4 and, compared with experts’ performance. Results: Current dilemmas in the management ofunruptured IAs remained the most important motivating factor to attend the workshop and majority of participants showedinterest in participating in a multicentric trial. The participants achieved an average score of 2.52 (range 0–4) which was 63% (range 0–100%) of an expert user. Conclusions: Although participants showed a manifest interest in CFD, there was a clear lack ofawareness concerning the role of hemodynamics in the etiopathogenesis of IAs and the use of CFD in this context. More effortstherefore are required to enhance understanding of the clinicians in the subject.

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.

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 tractable consideration set structure for network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.

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.