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.

On the impact of leverage constraints on asset prices and trading volume

Researchers have used stylized facts on asset prices and trading volumein stock markets (in particular, the mean reversion of asset returnsand the correlations between trading volume, price changes and pricelevels) to support theories where agents are not rational expected utilitymaximizers. This paper shows that this empirical evidence is in factconsistent with a standard infite horizon perfect information expectedutility economy where some agents face leverage constraints similar tothose found in todays financial markets. In addition, and in sharpcontrast to the theories above, we explain some qualitative differencesthat are observed in the price-volume relation on stock and on futuresmarkets. We consider a continuous-time economy where agents maximize theintegral of their discounted utility from consumption under both budgetand leverage con-straints. Building on the work by Vila and Zariphopoulou(1997), we find a closed form solution, up to a negative constant, for theequilibrium prices and demands in the region of the state space where theconstraint is non-binding. We show that, at the equilibrium, stock holdingsvolatility as well as its ratio to stock price volatility are increasingfunctions of the stock price and interpret this finding in terms of theprice-volume relation.

Solving heterogeneous-agent models by projection and perturbation

The paper proposes a numerical solution method for general equilibrium models with a continuum of heterogeneous agents, which combines elements of projection and of perturbation methods. The basic idea is to solve first for the stationary solutionof the model, without aggregate shocks but with fully specified idiosyncratic shocks. Afterwards one computes a first-order perturbation of the solution in the aggregate shocks. This approach allows to include a high-dimensional representation of the cross-sectional distribution in the state vector. The method is applied to a model of household saving with uninsurable income risk and liquidity constraints. The model includes not only productivity shocks, but also shocks to redistributive taxation, which cause substantial short-run variation in the cross-sectional distribution of wealth. If those shocks are operative, it is shown that a solution method based on very few statistics of the distribution is not suitable, while the proposed method can solve the model with high accuracy, at least for the case of small aggregate shocks. Techniques are discussed to reduce the dimension of the state space such that higher order perturbations are feasible.Matlab programs to solve the model can be downloaded.

A low dimensional Kalman filter for systems with lagged observables

This note describes how the Kalman filter can be modified to allow for thevector of observables to be a function of lagged variables without increasing the dimensionof the state vector in the filter. This is useful in applications where it is desirable to keepthe dimension of the state vector low. The modified filter and accompanying code (whichnests the standard filter) can be used to compute (i) the steady state Kalman filter (ii) thelog likelihood of a parameterized state space model conditional on a history of observables(iii) a smoothed estimate of latent state variables and (iv) a draw from the distribution oflatent states conditional on a history of observables.

The stationary distribution of a continuously varying strategy in a class-structured population under mutation-selection-drift balance.

Many traits and/or strategies expressed by organisms are quantitative phenotypes. Because populations are of finite size and genomes are subject to mutations, these continuously varying phenotypes are under the joint pressure of mutation, natural selection and random genetic drift. This article derives the stationary distribution for such a phenotype under a mutation-selection-drift balance in a class-structured population allowing for demographically varying class sizes and/or changing environmental conditions. The salient feature of the stationary distribution is that it can be entirely characterized in terms of the average size of the gene pool and Hamilton's inclusive fitness effect. The exploration of the phenotypic space varies exponentially with the cumulative inclusive fitness effect over state space, which determines an adaptive landscape. The peaks of the landscapes are those phenotypes that are candidate evolutionary stable strategies and can be determined by standard phenotypic selection gradient methods (e.g. evolutionary game theory, kin selection theory, adaptive dynamics). The curvature of the stationary distribution provides a measure of the stability by convergence of candidate evolutionary stable strategies, and it is evaluated explicitly for two biological scenarios: first, a coordination game, which illustrates that, for a multipeaked adaptive landscape, stochastically stable strategies can be singled out by letting the size of the gene pool grow large; second, a sex-allocation game for diploids and haplo-diploids, which suggests that the equilibrium sex ratio follows a Beta distribution with parameters depending on the features of the genetic system.

Planning under partial observability by classical replanning: theory and experiments

Planning with partial observability can be formulated as a non-deterministic search problem in belief space. The problem is harder than classical planning as keeping track of beliefs is harder than keeping track of states, and searching for action policies is harder than searching for action sequences. In this work, we develop a framework for partial observability that avoids these limitations and leads to a planner that scales up to larger problems. For this, the class of problems is restricted to those in which 1) the non-unary clauses representing the uncertainty about the initial situation are nvariant, and 2) variables that are hidden in the initial situation do not appear in the body of conditional effects, which are all assumed to be deterministic. We show that such problems can be translated in linear time into equivalent fully observable non-deterministic planning problems, and that an slight extension of this translation renders the problem solvable by means of classical planners. The whole approach is sound and complete provided that in addition, the state-space is connected. Experiments are also reported.

Report on theorerical results of power generation and conversion

Experimental results of a new controller able to support bidirectional power flow in a full-bridge rectifier with boost-like topology are obtained. The controller is computed using port Hamiltonian passivity techniques for a suitable generalized state space averaging truncation system, which transforms the control objectives, namely constant output voltage dc-bus and unity input power factor, into a regulation problem. Simulation results for the full system show the essential correctness of the simplifications introduced to obtain the controller, although some small experimental discrepancies point to several aspects that need further improvement.

Aktiivisten magneettilaakereiden tilasäädön mallinnus ja simulointi

Aktiivisten magneettilaakereiden avulla on mahdollista kannatella ferromagneettisia kappaleita, kuten sähkökoneiden roottoreita, ilman fyysistä kontaktia. Magneettilaakerit tarjoavat monia etuja, kuten esimerkiksi kitkattomuuden, verrattuina perinteisiin mekaanisiin laakereihin. Nämä edut vielä korostuvat suurnopeuskäytöissä, jotka ovat magneettilaakereiden pääasiallisia käyttökohteita. Tässä työssä esitellään magneettilaakereihin liittyvät erusteoriat ja niiden sovellustavat. Tämän jälkeen tarkastellaanmagneettilaakereiden kanssa käytettäviä säätöratkaisuja ja esitetään niille soveltuvat viritysmenetelmät. Teorioiden pohjalta rakennetaan täydellinen magneettilaakerijärjestelmän simulointimalli säätöratkaisuineen ja suoritetaan järjestelmän toimintaa kuvaavia simulointeja. Simuloinneissa saadut tulokset pyritään vielä varmentamaan suorittamalla mittauksia koelaitteistolla ja vertaamalla saatuja tuloksia keskenään.

Ehrenfest dynamics is purity non-preserving: a necessary ingredient for decoherence

We discuss the evolution of purity in mixed quantum/classical approaches to electronic nonadiabatic dynamics in the context of the Ehrenfest model. As it is impossible to exactly determine initial conditions for a realistic system, we choose to work in the statistical Ehrenfest formalism that we introduced in Alonso et al. [J. Phys. A: Math. Theor. 44, 396004 (2011)10.1088/1751-8113/44/39/395004]. From it, we develop a new framework to determine exactly the change in the purity of the quantum subsystem along with the evolution of a statistical Ehrenfest system. In a simple case, we verify how and to which extent Ehrenfest statistical dynamics makes a system with more than one classical trajectory, and an initial quantum pure state become a quantum mixed one. We prove this numerically showing how the evolution of purity depends on time, on the dimension of the quantum state space D, and on the number of classical trajectories N of the initial distribution. The results in this work open new perspectives for studying decoherence with Ehrenfest dynamics.

A dynamic analysis of asymmetric shocks in EU manufacturing

Available empirical evidence regarding the degree of symmetry between European economies in the context of Monetary Unification is not conclusive. This paper offers new empirical evidence concerning this issue related to the manufacturing sector. Instead of using a static approach as most empirical studies do, we analyse the dynamic evolution of shock symmetry using a state-space model. The results show a clear reduction of asymmetries in terms of demand shocks between 1975 and 1996, with an increase in terms of supply shocks at the end of the period.

Laitosmittaukset turbiinilaitoksen suorituskyvyn seurantaan ydinvoimalaitoksen vuosihuoltojen yhteydessä

Työssä kehitettiin höyryvoimalaitosprosessin tilan seurantaan laitosmittausrutiini, jolla tarkastellaan erityisesti turbiinilaitoksen suorituskykyä ennen ja jälkeen vuosihuoltojen. Laitosmittaukset on kehitetty Teollisuuden Voima Oyj:n Olkiluodon ydinvoimalaitosyksikköjen OL1 ja OL2 tarpeisiin. Mittauksilla saadaan tietoa vuosihuollon kokonaisvaikutuksista prosessiin eli muuttuiko mikään vuosihuollon aikana ja mitkä syyt johtivat muutokseen. Lisäksi säännöllisillä mittauksilla tavoitellaan pitkän aikavälin referenssitietoa prosessin tilasta. Esimerkkimittaukset tehtiin kevään 2008 vuosihuolloissa, R108 ja R208. Työssä on esitetty mittausten suorittaminen, tulosten laskenta ja tarkastelu sekä raportointi. Luotu mittausrutiini pohjautuu höyryturbiinien ja lämmönsiirtimien vastaanottokokeita käsitteleviin standardeihin sekä laitosten viimeisimpiin prosessimuutosten yhteydessä toteutettuihin suorituskykymittauksiin. Laitosmittauksista tehtiin vastaanottokokeita kevyemmät ja yksinkertaisemmat mittaustapahtumat, joilla saadaan kuitenkin riittävän luotettavaa tietoa. Tunnuslukuja, joita ei käytettävissä olevien mittatietojen avulla saatu suoraan selville tai laskettua massa- ja energiataseilla, määritettiin stationaarisen tilan mallinnusohjelmalla TEMPO:lla. Esimerkkimittaukset sujuivat hyvin ja saadut tulokset antoivat kaivattua lisätietoa vuosihuollon vaikutuksesta prosessiin. Generaattorin bruttoteho aleni OL1:llä ja pysyi ennallaan OL2:lla. OL1:n tehon aleneminen selittyi syöttöveden virtausmäärän vähenemisellä, johon vaikutti virtausmittalaitteen lähettimen vaihto. OL2:lla ei havaittu turbiiniprosessissa muutoksia, mutta lauhduttimien suorituskyky parani. Lauhduttimien suorituskyvyn paraneminen ilmeni asteisuuksien pienentymisenä, johon vaikuttivat puhdistaminen ja ilmavuotojen väheneminen.

Kaksisuuntaisen DC/DC-hakkurin virtasäätö polttokennosovelluksessa

Ilmastonmuutos ja fossiilisten polttoaineiden ehtyminen ovat edesauttaneet uusiutuvien energialähteiden tutkimusta huomattavasti. Lisäksi alati kasvava sähköenergian tarve lisää hajautetun sähköntuotannon ja vaihtoehtoisten energialähteiden kiinnostavuutta. Yleisimpiä hajautetun sähköntuotannon energialähteitä ovat tuulivoima, aurinkovoima ja uutena tulokkaana polttokennot. Polttokennon kytkeminen sähköverkkoon vaatii tehoelektroniikkaa, ja yleensä yksinkertaisessa polttokennosovelluksessa polttokenno kytketään galvaanisesti erottavan yksisuuntaisen DC/DC-hakkurin ja vaihtosuuntaajan kanssa sarjaan. Polttokennon rinnalla voidaan käyttää akkua tasaamaan polttokennon syöttämää jännitettä, jolloin akun ja polttokennon väliin tarvitaan kaksisuuntainen DC/DC-hakkuri, joka pystyy siirtämään energiaa molempiin suuntiin. Tässä diplomityössä on esitetty kaksisuuntaisen DC/DC-hakkurin tilayhtälökeskiarvoistusmenetelmään perustuva malli sekä mallin perusteella toteutettu virtasäätö. Tutkittava hakkuritopologia on kokosilta-tyyppinen boost-hakkuri, ja säätömenetelmä keskiarvovirtasäätö. Työn tuloksena syntyi tilayhtälömalli kaksisuuntaiselle FB boost -hakkurille sekä sen tulokelan virran säätämiseen soveltuva säädin. Säädin toimii normaalitilanteissa hyvin, mutta erikoistilanteissa, kuten hakkurin tulojännitteen äkillisessä muutostilanteessa, vaadittaisiin tehokkaampi säädin, jolla saavutettaisiin nopeampi nousuaika ilman ylitystä ja oskillointia.

Curving simulation and stability of a creep-controlled wheelset for high speed rail-vehicles

Higher travel speeds of rail vehicles will be possible by developing sophisticated top performance bogies having creep-controlled wheelsets. In this case the torque transmission between the right and the left wheel is realized by an actively controlled creep coupling. To investigate hunting stability and curving capability the linear equations of motion are written in state space notation. Simulation results are obtained with realistic system parameters from industry and various controller gains. The advantage of the „creep-controlled wheelset" is discussed by comparison the simulation results with the dynamic behaviour of the special cases „solid-axle wheelset" and „loose wheelset" (independent rotation of the wheels). The stability is also investigated with a root-locus analysis.

Estimating Attractor Dimension on the Nonlinear Pendulum Time Series

Chaotic dynamical systems exhibit trajectories in their phase space that converges to a strange attractor. The strangeness of the chaotic attractor is associated with its dimension in which instance it is described by a noninteger dimension. This contribution presents an overview of the main definitions of dimension discussing their evaluation from time series employing the correlation and the generalized dimension. The investigation is applied to the nonlinear pendulum where signals are generated by numerical integration of the mathematical model, selecting a single variable of the system as a time series. In order to simulate experimental data sets, a random noise is introduced in the time series. State space reconstruction and the determination of attractor dimensions are carried out regarding periodic and chaotic signals. Results obtained from time series analyses are compared with a reference value obtained from the analysis of mathematical model, estimating noise sensitivity. This procedure allows one to identify the best techniques to be applied in the analysis of experimental data.

Scheduling dynamic dataflow graphs with model checking

With the shift towards many-core computer architectures, dataflow programming has been proposed as one potential solution for producing software that scales to a varying number of processor cores. Programming for parallel architectures is considered difficult as the current popular programming languages are inherently sequential and introducing parallelism is typically up to the programmer. Dataflow, however, is inherently parallel, describing an application as a directed graph, where nodes represent calculations and edges represent a data dependency in form of a queue. These queues are the only allowed communication between the nodes, making the dependencies between the nodes explicit and thereby also the parallelism. Once a node have the su cient inputs available, the node can, independently of any other node, perform calculations, consume inputs, and produce outputs. Data ow models have existed for several decades and have become popular for describing signal processing applications as the graph representation is a very natural representation within this eld. Digital lters are typically described with boxes and arrows also in textbooks. Data ow is also becoming more interesting in other domains, and in principle, any application working on an information stream ts the dataflow paradigm. Such applications are, among others, network protocols, cryptography, and multimedia applications. As an example, the MPEG group standardized a dataflow language called RVC-CAL to be use within reconfigurable video coding. Describing a video coder as a data ow network instead of with conventional programming languages, makes the coder more readable as it describes how the video dataflows through the different coding tools. While dataflow provides an intuitive representation for many applications, it also introduces some new problems that need to be solved in order for data ow to be more widely used. The explicit parallelism of a dataflow program is descriptive and enables an improved utilization of available processing units, however, the independent nodes also implies that some kind of scheduling is required. The need for efficient scheduling becomes even more evident when the number of nodes is larger than the number of processing units and several nodes are running concurrently on one processor core. There exist several data ow models of computation, with different trade-offs between expressiveness and analyzability. These vary from rather restricted but statically schedulable, with minimal scheduling overhead, to dynamic where each ring requires a ring rule to evaluated. The model used in this work, namely RVC-CAL, is a very expressive language, and in the general case it requires dynamic scheduling, however, the strong encapsulation of dataflow nodes enables analysis and the scheduling overhead can be reduced by using quasi-static, or piecewise static, scheduling techniques. The scheduling problem is concerned with nding the few scheduling decisions that must be run-time, while most decisions are pre-calculated. The result is then an, as small as possible, set of static schedules that are dynamically scheduled. To identify these dynamic decisions and to find the concrete schedules, this thesis shows how quasi-static scheduling can be represented as a model checking problem. This involves identifying the relevant information to generate a minimal but complete model to be used for model checking. The model must describe everything that may affect scheduling of the application while omitting everything else in order to avoid state space explosion. This kind of simplification is necessary to make the state space analysis feasible. For the model checker to nd the actual schedules, a set of scheduling strategies are de ned which are able to produce quasi-static schedulers for a wide range of applications. The results of this work show that actor composition with quasi-static scheduling can be used to transform data ow programs to t many different computer architecture with different type and number of cores. This in turn, enables dataflow to provide a more platform independent representation as one application can be fitted to a specific processor architecture without changing the actual program representation. Instead, the program representation is in the context of design space exploration optimized by the development tools to fit the target platform. This work focuses on representing the dataflow scheduling problem as a model checking problem and is implemented as part of a compiler infrastructure. The thesis also presents experimental results as evidence of the usefulness of the approach.