Optimal taxation without state-contingent debt

To recover a version of Barro's (1979) `random walk'tax smoothing outcome, we modify Lucas and Stokey's (1983) economyto permit only risk--free debt. This imparts near unit root like behaviorto government debt, independently of the government expenditureprocess, a realistic outcome in the spirit of Barro's. We showhow the risk--free--debt--only economy confronts the Ramsey plannerwith additional constraints on equilibrium allocations thattake the form of a sequence of measurability conditions.We solve the Ramsey problem by formulating it in terms of a Lagrangian,and applying a Parameterized Expectations Algorithm tothe associated first--order conditions. The first--order conditions andnumerical impulse response functions partially affirmBarro's random walk outcome. Though the behaviors oftax rates, government surpluses, and government debts differ, allocationsare very close for computed Ramsey policies across incomplete and completemarkets economies.

Mixed equilibrium in a Downsian model with a favored candidate

This paper examines competition in the standard one-dimensional Downsian model of two-candidate elections, but where one candidate (A) enjoys an advantage over the other candidate (D). Voters' preferences are Euclidean, but any voter will vote for candidate A over candidate D unless D is closer to her ideal point by some fixed distance \delta. The location of the median voter's ideal point is uncertain, and its distribution is commonly known by both candidates. The candidates simultaneously choose locations to maximize the probability of victory. Pure strategy equilibria often fails to exist in this model, except under special conditions about \delta and the distribution of the median ideal point. We solve for the essentially unique symmetric mixed equilibrium, show that candidate A adopts more moderate policies than candidate D, and obtain some comparative statics results about the probability of victory and the expected distance between the two candidates' policies.

Parental altruism under imperfect information: Theory and evidence

Can we reconcile the predictions of the altruism model of the familywith the evidence on intervivos transfers in the US? This paper expandsthe altruism model by introducing e ?ort of the child and by relaxingthe assumption of perfect information of the parent about the labormarket opportunities of the child. First, I solve and simulate a modelof altruism under imperfect information. Second, I use cross-sectionaldata to test a prediction of the model: Are parental transfers especiallyresponsive to the income variations of children who are very attached tothe labor market? The results suggest that imperfect information accountsfor several patterns of intergenerational transfers in the US.

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.

Incorporating waiting time in competitive location models: Formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum CaptureProblem. In the original MCP, market capture is obtained by lower traveling distances or lowertraveling time, in this new version not only the traveling time but also the waiting time willaffect the market share. This problem is hard to solve using standard optimization techniques.Metaheuristics are shown to offer accurate results within acceptable computing times.

Parental altruism under imperfect information: Theory and evidence

Can we reconcile the predictions of the altruism model of the family withthe evidence on parental monetary transfers in the US? This paper providesa new assessment of this question. I expand the altruism model by introducingeffort of the child and by relaxing the assumption of perfect informationof the parent about the labor market opportunities of the child. First,I solve and simulate a model of altruism and labor supply under imperfectinformation. Second, I use cross-sectional data to test the following prediction of the model: Are parental transfers especially responsive tothe income variations of children who are very attached to the labor market? The results of the analysis suggest that imperfect informationaccounts for many of the patterns of intergenerational transfers in theUS.

Solving a concrete sleepers production scheduling by genetic algorithms

PRECON S.A is a manufacturing company dedicated to produce prefabricatedconcrete parts to several industries as rail transportation andagricultural industries.Recently, PRECON signed a contract with RENFE,the Spanish Nnational Rail Transportation Company to manufacturepre-stressed concrete sleepers for siding of the new railways of the highspeed train AVE. The scheduling problem associated with the manufacturingprocess of the sleepers is very complex since it involves severalconstraints and objectives. The constraints are related with productioncapacity, the quantity of available moulds, satisfying demand and otheroperational constraints. The two main objectives are related withmaximizing the usage of the manufacturing resources and minimizing themoulds movements. We developed a deterministic crowding genetic algorithmfor this multiobjective problem. The algorithm has proved to be a powerfuland flexible tool to solve the large-scale instance of this complex realscheduling problem.

A recoverable production planning model

Aware of the importance of developing new alternatives to improve the performance of the companies, our purpose in this paper is to develop a medium term production planning model that deals with the concepts of Partnership and Reverse Logistics. Our model takes advantage of the synergies of integration, developing a model for global production planning that generates the optimal production and purchasing schedule for all the companies integrating a logistic chain. In a second part of the paper we incorporate products returns to the first model proposed, and analyze the implications they have over this model. We use some examples with different configurations of supply chains varying the number of production plants, distribution centers and recovery plants. To solve the model we have combined optimization and simulation procedures.

Comparison and evaluation of states of health

Starting from a finite or countable set of states of health, and assumingthe existence of an objective transitive preference relation on that set,we propose a way of performing interpersonal comparisons of states ofhealth. In so doing, we first consider the population divided into types,and consider that two individuals of a different type have a comparablestate of health whenever they sit at the same centile of their respectivetype. A way of comparing and evaluating states of health for differentgroups is then proposed and rationalized. This can be viewed as both analternative and an extension of the traditional QALY approach.

Lectura ambiental de la cartografía geológica

Geological and geomorphological maps are, apart from a source of scientific information, a necessary tool in order to take proper decisions to solve the geo-environmental problems that arise when dealing with territorial planning. In this paper, the social and economical utility of such maps is described, and some exercises meant for Science of Earth and Environmental Sciences students are proposed

Generalized Multiobjective Multitree model solution using MOEA

In a previous paper a novel Generalized Multiobjective Multitree model (GMM-model) was proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, in this paper a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows

An Efficient Nominal Unification Algorithm

Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently

Projecte P.I.T.O.S (Projecte d'informació telefònica d'orientació al S.A.T)

JCM és una empresa dedicada al disseny de sistemes de control d’accés. Disposa d’uns equips elèctrics amb molts paràmetres configurables, així es poden utilitzar en molts tipus d’instal•lació. Aquets paràmetres són configurables pels clients. JCM, disposa d’un servei d’atenció telefònica (SAT), que intenta donar solucions a tots els problemes que puguin sorgir als clients. Sovint, no poden donar suport als dubtes dels clients per culpa de la poca informació que reben a través del client. L'objectiu del projecte és resoldre el problema de falta d'informació i mala comunicació per millorar la qualitat del servei que ofereix el SAT. La solució, no ha d’alterar el cost de producció del producte. S’ha de tenir en compte també que els equips poden estar instal•lats en qualsevol part del món i que només es poden utilitzar recursos de fàcil accés per tots els clients. Per complir amb aquests objectius, emetrem un missatge, a través del brunzidor del equip, amb la informació de configuració de l'equip. Aquest missatge viatjarà a través de la xarxa telefònica fins al SAT. Un cop allà, el descodificarem i n'enviarem les dades a un PC perquè pugui presentar les dades sobre la configuració de una forma clara pel SAT.

Domo Hogar, Automatització de l'habitatge

En aquest projecte crearem un sistema per automatitzar els diferents dispositius que podem trobar en una casa. En primer lloc dissenyarem el hardware que serà el sistema nerviós des del que controlarem els dispositius a través del port USB d’un ordinador. Aquest sistema nerviós serà el punt d’interconnexió entre els dispositius de la casa i l’ordinador central que els controlarà. A nivell de hardware, a més a més del mòdul d’entrades i sortides d’interconnexió amb els dispositius que hem esmentat, ens trobem amb la necessitat d’instal•lar un ordinador central i diferents aparells repartits per la casa per poder realitzar les nostres necessitats (accions dels diferents dispositius) des de qualsevol punt de la casa. Amb aquests requeriments haurem d’estudiar les diferents possibilitats per fer el nostre sistema el màxim d’eficaç possible. Finalitzat l’estudi del hardware necessari pel nostre projecte, el següent pas és dissenyar el software. Aquest software serà l’aplicació encarregada de controlar tot el maquinari que hem dissenyat anteriorment i rebrà el nom de DOMO HOGAR. Aquest estarà format per dos programes diferents, DOMO HOGAR SERVER i DOMO HOGAR TERMINAL, cadascun d’ells amb unes funcions específiques. DOMO HOGAR SERVER serà l’aplicació que residirà a l’ordinador central i que permetrà a l’administrador gestionar totes les parts de les que forma part el nostre sistema: dispositius, tasques, pre-condicions, etc... També des d’aquesta aplicació editarem el panell tàctil que mostrarem des dels diferents terminals de l’habitatge. Per últim, aquesta aplicació també s’encarregarà de resoldre les peticions que farem, tant de l’ordinador central com dels terminals, i gestionar les diferents sortides en funció de l’acció a realitzar. Paral•lelament ens trobarem l’aplicació DOMO HOGAR TERMINAL que residirà en cada un dels terminals que hi hagi a la casa. Aquesta aplicació s’inicialitzarà llegint la configuració del panell tàctil de la base de dades de l’aplicació servidor resident a l’ordinador central i reconstruint una rèplica d’aquest panell tàctil. Finalment des d’aquesta aplicació terminal podrem donar ordres que seran emmagatzemades a la llista de tasques pendents de l’ordinador central perquè les resolgui des de l’aplicació del servidor. DOMO HOGAR ha estat creat per facilitar i confortar la vida quotidiana de les persones agilitzant el nostre dia a dia i permetent-nos invertir el nostre temps en les coses realment importants.

Small scale underwater change detection

In this paper, we present a method to deal with the constraints of the underwater medium for finding changes between sequences of underwater images. One of the main problems of underwater medium for automatically detecting changes is the low altitude of the camera when taking pictures. This emphasise the parallax effect between the images as they are not taken exactly at the same position. In order to solve this problem, we are geometrically registering the images together taking into account the relief of the scene