Informationsansvarig: thkar@mai.liu.se, thkar@mai.liu.se
Sidan uppdaterades senast: 2010-12-08
LiU - MAI >
Examensarbeten >
Avslutade examensarbeten
Denna studie behandlar arbetet av laborativ matematik för grundskolans senare år. Enligt läroplanen och kursplanen är undervisningens syfte att utveckla elevers kunskaper om matematikens användning både i vardagliga situationer och inom andra ämnesområden. Undervisningen ska även bidra till att elever kan reflektera över matematikens användning i vardagslivet. Många elever är idag omotiverade, uttråkade och har tappat lusten för att lära, vilket kan bero på att lärobokstyrd undervisning domineras i grundskolans senare år. Studien är ett konsumtionsinriktat arbete med litteraturstudie som metod. Databaserna som användes var Academic Search Primer och ERIC. Resultatet visade att om laborativt material används i undervisningen bidrar det till att arbetssättet varieras. Då får eleverna större möjlighet att arbeta tillsammans i grupp, diskutera matematiska begrepp och idéer och uttrycka sitt matematiska tänkande. Syftet med laborativ matematik är att hjälpa eleverna att koppla samman det konkreta materialet med abstrakta begrepp, där läraren har en avgörande roll. Det laborativa materialet i sig hjälper inte eleverna till en ökad förståelse, utan det krävs god planering och reflektion över arbetet för att syftet ska uppnås. Elevers lust och motivation hänger ihop med elevers förståelse för matematik. På detta sett kan laborativ matematik bidra till att elevers intresse för ämnet ökar.
@mastersthesis{diva2:500268,
author = {Elebring, Viktoria},
title = {{Laborativ matematik:
ett sätt att väcka nyfikenhet och lust att lära?}},
school = {Linköping University},
type = {{LIU-LÄR-L-A--12/34--SE}},
year = {2012},
address = {Sweden},
}
Using fnite difference methods for partial differential equations, this thesis focuses on the problem of connecting overlapping solution domains in the context of a frst order hyperbolic problem. Especially the stability properties of such constructions is studied, and a stable general implementation of the the test problem is proposed. However, no energy estimate could be found, and indeed proven not to exist in the natural norm. Finally, an example is also put forward where the interface conditions derived are, for stability considerations, incompatible with the boundary conditions in a coupled system of hyperbolic equations.
@mastersthesis{diva2:439459,
author = {Lundquist, Tomas},
title = {{Stability of SBP schemes on overlapping domains}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2011/17--SE}},
year = {2011},
address = {Sweden},
}
In this thesis the connections between the boundary conditions and the vari- ance of the solution to a stochastic partial differential equation (PDE) are investigated. In particular a hyperbolical system of PDE’s with stochastic initial and boundary data are considered. The problem is shown to be well- posed on a class of boundary conditions through the energy method. Stability is shown by using summation-by-part operators coupled with simultaneous- approximation-terms. By using the energy estimates, the relative variance of the solutions for different boundary conditions are analyzed. It is concluded that some types of boundary conditions yields a lower variance than others. This is verified by numerical computations.
@mastersthesis{diva2:438438,
author = {Arndt, Carl-Fredrik},
title = {{Energy estimates and variance estimation for hyperbolic stochastic partial differentialequations}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2011/18--SE}},
year = {2011},
address = {Sweden},
}
The focus in this thesis is on the calculations of an empirical null distributionfor likelihood ratio tests testing either separable or double separable covariancematrix structures versus an unstructured covariance matrix. These calculationshave been performed for various dimensions and sample sizes, and are comparedwith the asymptotic χ2-distribution that is commonly used as an approximative distribution. Tests of separable structures are of particular interest in cases when data iscollected such that more than one relation between the components of the observationis suspected. For instance, if there are both a spatial and a temporalaspect, a hypothesis of two covariance matrices, one for each aspect, is reasonable.
@mastersthesis{diva2:432352,
author = {Gottfridsson, Anneli},
title = {{Likelihood ratio tests of separable or double separable covariance structure, and the empirical null distribution}},
school = {Linköping University},
type = {{LiTH-MAT-EX--11/09--SE}},
year = {2011},
address = {Sweden},
}
The aim of this work is to study the relation between two invariants of water flow in a channel of finite depth. The first invariant is the height of the water wave and the second one is the flow force. We restrict ourselves to water waves of small amplitude. Using asymptotic technique together with the method of separation of variables, we construct all water waves of small amplitude which are parameterized by a small parameter. Then we demonstrate numerically that the flow force depends monotonically on the height.
@mastersthesis{diva2:427186,
author = {Hasnain, Shahid},
title = {{Steady Periodic Water Waves Solutions Using Asymptotic Approach}},
school = {Linköping University},
type = {{LiTH-MAI-EX--2011/14-SE}},
year = {2011},
address = {Sweden},
}
Fractal geometry is a new branch of mathematics. This report presents the tools, methods and theory required to describe this geometry. The power of Iterated Function Systems (IFS) is introduced and applied to produce fractal images or approximate complex estructures found in nature.
The focus of this thesis is on how fractal geometry can be used in applications to computer graphics or to model natural objects.
@mastersthesis{diva2:421691,
author = {Joanpere Salvadó, Meritxell},
title = {{Fractals and Computer Graphics}},
school = {Linköping University},
type = {{LiTH-MAT-INT-A--2011/01--SE}},
year = {2011},
address = {Sweden},
}
Interaktiva skrivtavlor blir ett allt vanligare hjälpmedel i de svenska klassrummen. Syftet med denna litteraturstudie är att utifrån ett lärarperspektiv ge inblick i vad forskningen säger om vilka kunskaper som är lämpliga för att interaktiva skrivtavlor ska kunna användas så effektivt som möjligt i matematikundervisningen. Frågeställningarna behandlar lärares kunskapsbehov, vilka faktorer som påverkar utvecklingen och av dessa kunskaper samt hur lärarens roll förändras vid introduktionen av interaktiva skrivtavlor.
Litteraturstudiens resultat visar att en grundläggande kompetens inom IKT underlättar planering och undervisning med interaktiva skrivtavlor men är även en förutsättning för en lyckad vidareutbildning inom området. Lärare behöver ha insikt i vad interaktiv undervisning innebär och hur detta kan förverkligas med hjälp av den interaktiva skrivtavlan. Här är lärarens egen inställning avgörande för att en förändring av pedagogiken ska kunna ske.
Vid en satsning på interaktiva skrivtavlor i undervisningen behöver det finnas tid för vidareutbildning av den pedagogiska personalen. Utbildningen bör påbörjas gemensamt men anpassas sedan utefter de olika förkunskaper och behov som lärare har. För att introduktionen ska bli lyckad behöver den vara långsiktig och ge möjlighet för lärare att utveckla den egna färdigheten i användningen av interaktiva skrivtavlor.
Den interaktiva skrivtavlan kan under rätt förutsättningar vara en hjälp i att främja en mer interaktiv undervisning där elevers lärande hamnar i centrum och läraren intar rollen som handledare, coach eller samtalsledare.
@mastersthesis{diva2:418816,
author = {Stenström, Alfrida},
title = {{Läraren och den interaktiva skrivtavlan:
en litteraturstudie om lärarens roll och kunskaper}},
school = {Linköping University},
type = {{LIU-LÄR-MA-A--11/1--SE}},
year = {2011},
address = {Sweden},
}
Inom vården utförs ofta schemaläggning av personal manuellt, vilket kräver mycket tid och resurser. Att planera arbetet för en grupp läkare, med dess ofta mycket komplexa sammansättning vad gäller exempelvis arbetsuppgifter och kompetenser, är ingen lätt uppgift. Detta examensarbete studerar huruvida en automatiserad taktisk bemanningsplanering med en tidshorisont på ett halvår till ett år, skulle kunna underlätta denna uppgift.
I rapporten presenteras en måloptimeringsmodell som implementerats i AMPL för att med CPLEX som lösare generera förslag till bemanningsplaner. För att utveckla en matematisk modell som väl representerar de förutsättningar som råder vid bemanningsplanering av läkare har alternativa formuleringar provats och utvärderats. Den mest lovande av modellerna, som baseras på måloptimering, har i en pilotstudie testats på data från Onkologiska kliniken vid Linköpings universitetssjukhus. Flexibiliteten i modellen gjorde att den enkelt kunde användas på de data som erhölls därifrån. Resultatet från pilotstudien indikerar att den utvecklade modellen har kapacitet att ge förslag till rimliga bemanningsplaner.
@mastersthesis{diva2:411402,
author = {Lund\'{e}n, Anna},
title = {{Taktisk bemanningsplanering av läkare:
modellutveckling och en pilotstudie}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/15--SE}},
year = {2010},
address = {Sweden},
}
The distribution of particles in a rarefied gas in a vessel can be described by the Boltzmann equation. As an approximation of the solution to this equation, Caprino, Pulvirenti and Wagner [3] constructed a random N-particle system.
In the equilibrium case, they prove in [3] that the L1-distance between the density function of k particles in the N-particle process and the k-fold product of the solution to the stationary Boltzmann equation is of order 1/N. They do this in order to show that the N-particle system converges to the system described by the stationary Boltzmann equation as the number of particles tends to infinity.
This is different from the standard approach of describing convergence of an N-particle system. Usually, convergence in distribution of random measures or weak convergence of measures over the space of probability measures is used. The purpose of the present thesis is to compare different modes of convergence of the N-particle system as N tends to infinity assuming stationarity.
@mastersthesis{diva2:383583,
author = {Petersson, Mikael},
title = {{Comparison of modes of convergence in a particle system related to the Boltzmann equation}},
school = {Linköping University},
type = {{LiTH-MAT-EX--10/27--SE}},
year = {2010},
address = {Sweden},
}
In the study of the Degasperis-Procesi dierential equation, an eigenvalue problem called the cubic string occurs. This is a third order generalization of the second order problem describing the eigenmodes of a vibrating string. In this thesis we study the eigenfunctions of the cubic string for discrete and continuous mass distributions, using the theory of total positivity, via a combinatorial approach with planar networks.
@mastersthesis{diva2:359963,
author = {Kardell, Marcus},
title = {{Total positivity and oscillatory kernels:
An overview, and applications to the spectral theory of the cubic string}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/18--SE}},
year = {2010},
address = {Sweden},
}
Ruttningen av trafik i IP-nätverk sker ofta med hjälp av bågvikter som bestämmer vilken väg trafiken tar (kortastevägruttning). Problemet här är att avgöra ifall det existerar en uppsättning vikter givet ett önskat ruttningsschema. Den hör rapporten undersöker prestandan hos ett antal modeller och optimeringsprogram avsedda att lösa denna typ av problem som ofta kallas inversa kortastevägruttningsproblemet.
Undersökningen visar att det existerar en stor skillnad mellan modellerna och optimeringsprogrammen och att modellen baserad på cykelbaser löst med CPLEXdualopt lösaren är snabbast.
@mastersthesis{diva2:352876,
author = {Sandberg, Richard},
title = {{A survey of optimization methods for solving the inverse shortest path routing problem}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/26--SE}},
year = {2010},
address = {Sweden},
}
This bachelor thesis shows a way to classify second order symmetric tensors in the Lorentz metric. Some basic prerequisite about indefinite and definite algebra is introduced, such as the Jordan form, indefinite inner products, the Segre type, and the Minkowski space. There are also some results concerning the invariant 2-spaces of a symmetric tensor and a different approach on how to classify second order symmetric tensor.
@mastersthesis{diva2:323702,
author = {Hjelm Andersson, Hampus},
title = {{Classification of second order symmetric tensors in the Lorentz metric}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/21--SE}},
year = {2010},
address = {Sweden},
}
Investigation of stains from crime scenes are commonly used in the search for criminals. At The National Laboratory of Forensic Science, where these stains are examined, a number of questions of theoretical and practical interest regarding the databases of DNA profiles and the strength of DNA evidence against a suspect in a trial are not fully investigated. The first part of this thesis deals with how a sample of DNA profiles from a population is used in the process of estimating the strength of DNA evidence in a trial, taking population genetic factors into account. We then consider how to combine hypotheses regarding the relationship between a suspect and other possible donors of the stain from the crime scene by two applications of Bayes’ theorem. After that we assess the DNA profiles that minimize the strength of DNA evidence against a suspect, and investigate how the strength is affected by sampling error using the bootstrap method and a Bayesian method. In the last part of the thesis we examine discrepancies between different databases of DNA profiles by both descriptive and inferential statistics, including likelihood ratio tests and Bayes factor tests. Little evidence of major differences is found.
@mastersthesis{diva2:359171,
author = {Hedell, Ronny},
title = {{Rarities of genotype profiles in a normal Swedish population}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/25--SE}},
year = {2010},
address = {Sweden},
}
Fredriksons Verkstads AB i Vadstena är en modern verkstadsindustri med kompetens främst inom plåtbearbetning, svetsning, skärande bearbetning och systemmontage. Verksamheten kan delas in i de tre delarna kontraktstillverkning, konstruktion och produktion. Kontraktstillverkningen består av serier till livsmedels-, medicinteknisk och verkstadsindustrin. Fredriksons Conveyor Solutions konstruerar egna produkter i form av transportörsystem till livs- och läkemedelsindustrin.
Fredriksons kunder ställer i allt högre grad krav på reducerade ledtider och ökad leveransprecision. Syftet med examensarbetet är därför att försöka reducera Fredriksons interna ledtider för ett specifikt produktsortiment.
Ett första steg i arbetet med ledtidsreduceringen är att ta fram bra utarbetade prognoser. Framförallt har kvantitativa tidsseriemetoder analyserats. De enkla tidsseriemetoderna glidande medelvärde och exponentiell utjämning har undersökts i syfte att förbättra Fredriksons prognoser. Därutöver har en mer teoretisk fördjupning i avancerade tidsseriemetoder, främst ARMA-processer, genomförts.
Andra faktorer som påverkar produktionsledtiden är exempelvis partiformning, ställtider, säkerhetsmekanismer, kötider och sekvensering. Även dessa faktorer har analyserats och åtgärder har föreslagits i syfte att reducera Fredriksons interna ledtider.
@mastersthesis{diva2:346502,
author = {Johansson, Frida},
title = {{Analys av ledtid för volymprodukter till en nyckelkund hos Fredriksons Verkstads AB.}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/17--SE}},
year = {2010},
address = {Sweden},
}
This thesis discusses the mathematical formulation and computational treatment of slow strain rate corrosion tests based on nonlinear finite elements methods. The theory is illustrated by a description of classical small strain elastoplasticity theory as implemented in the Comsol Multiphysics 3.2 software package. The possible extension of the theory to finite strain is briefly addressed. Practical simulations and results regarding the evolution of stresses, strains and geometric deformation are also presented and discussed. Experimental data used in simulation where reported by Onchi, Takeo et al. and published in Journal of Nuclear Science and Technology in May 2006.
@mastersthesis{diva2:346530,
author = {Lundquist, Tomas},
title = {{FEM-modelling of SSRT for Corrosion Tests}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/08--SE}},
year = {2010},
address = {Sweden},
}
Within telecommunication and routing of traffic in IP-networks a protocol named“Open Shortest Path First” (OSPF) is widely used. This means that a server dealswith the routing over a network with given weights by calculating shortest paths touse for routing. If we assume that a desired traffic pattern is given the problem isto find out if it is possible to set the weights so that the desired traffic pattern is apart of a shortest path graph. In this thesis we assume that it is a unique shortestpath. To search for weights that solve the problem leads to a complex LP-model. Analternative is to search in the LP-dual under certain restrictions. These solutions tothe LP-dual are called conflicts and a conflict means that there exists no weights sothat the desired traffic pattern is obtained. The goal of this thesis is to study, classifyand search for conflicts. An algorithm has been developed that finds some kind ofconflicts in polynomial time with respect to the size of the graph.
@mastersthesis{diva2:345479,
author = {Mor\'{e}n, Björn},
title = {{Icke-triviala billigaste väg-ruttningskonflikter - klassificering och sökmetoder}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/19--SE}},
year = {2010},
address = {Sweden},
}
In phylogenetic analysis one study the relationship between different species. By comparing DNA from two different species it is possible to get a numerical value representing the difference between the species. For a set of species, all pair-wise comparisons result in a dissimilarity matrix d.
In this thesis I present a few methods for constructing a phylogenetic tree from d. The common denominator for these methods is that they do not generate a tree, but instead give a connected graph. The resulting graph will be a tree, in areas where the data perfectly matches a tree. When d does not perfectly match a tree, the resulting graph will instead show the different possible topologies, and how strong support they have from the data.
Finally I have tested the methods both on real measured data and constructed test cases.
@mastersthesis{diva2:327534,
author = {Krig, Kåre},
title = {{Methods for phylogenetic analysis}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/20--SE}},
year = {2010},
address = {Sweden},
}
In this thesis we use the method of Semantic Mirrors to create a graph of words that are semantically related to a seed word. Spectral graph partitioning methods are then used to partition the graph into subgraphs, and thus dividing the words into different word senses. These methods are applied to a bilingual lexicon of English and Swedish adjectives. A panel of human evaluators have looked at a few examples, and evaluated consistency within the derived senses and synonymy with the seed word.
@mastersthesis{diva2:330160,
author = {Fagerlund, Martin},
title = {{Computing Word Senses by Semantic Mirroring and Spectral Graph Partitioning}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2010/11--SE}},
year = {2010},
address = {Sweden},
}
Given a random sample from a multivariate probability distribution p, the maximum minimum parents and children algorithm locates the skeleton of the directed acyclic graph of a Bayesian network for p provided that there exists a faithful Bayesian network and that the dependence structure derived from data is the same as that of the underlying probability distribution.
The aim of this thesis is to examine the consequences when one of these conditions is not fulfilled. There are some circumstances where the algorithm works well even if there does not exist a faithful Bayesian network, but there are others where the algorithm fails.
The MMPC tests for conditional independence between the variables and assumes that if conditional independence is not rejected, then the conditional independence statement holds. There are situations where this procedure leads to conditional independence being accepted that contradict conditional dependence relations in the data. This leads to edges being removed from the skeleton that are necessary for representing the dependence structure of the data.
@mastersthesis{diva2:332341,
author = {Petersson, Mikael},
title = {{The Maximum Minimum Parents and Children Algorithm}},
school = {Linköping University},
type = {{LiTH - MAT - EX - - 2010 / 09 - - SE}},
year = {2010},
address = {Sweden},
}
The inverse heat conduction problem also frequently referred as the sideways heat equation, in short SHE, is considered as a mathematical model for a real application, where it is desirable for someone to determine the temperature on the surface of a body. Since the surface itself is inaccessible for measurements, one is restricted to use temperature data from the interior measurements. From a mathematical point of view, the entire situation leads to a non-characteristic Cauchy problem, where by using recorded temperature one can solve a well-posed nonlinear problem in the finite region for computing heat flux, and consequently obtain the Cauchy data [u, ux]. Further by using these data and by performing an appropriate method, e.g. a space marching method, one can eventually achieve the desired temperature at x = 0.
The problem is severely ill-posed in the sense that the solution does not depend continuously on the data. The problem solved by two different methods, and for both cases we stabilize the computations by replacing the time derivative in the heat equation by a bounded operator. The first one, a spectral method based on finite Fourier space is illustrated to supply an analytical approach for approximating the time derivative. In order to get a better accuracy in the numerical computation, we use cubic spline function for approximating the time derivative in the least squares sense.
The inverse problem we want to solve, by using Cauchy data, is a nonlinear heat conduction problem in one space dimension. Since the temperature data u = g(t) is recorded, e.g. by a thermocouple, it usually contains some perturbation in the data. Thus the solution can be severely ill-posed if the Cauchy data become very noisy. Two experiments are presented to test the proposed approach.
@mastersthesis{diva2:325988,
author = {Hussain, Muhammad Anwar},
title = {{Numerical Solution of a Nonlinear Inverse Heat Conduction Problem}},
school = {Linköping University},
type = {{LiTH - MAT - EX - 2010 / 10 - SE}},
year = {2010},
address = {Sweden},
}
This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Since Goppa's construction of algebraic geometric codes, there has been great interest in finding curves with many rational points. Here we explain the main tools for finding rational points on a curve over a nite eld and provide the necessary background on ring and field theory. Four different articles are analyzed, the first of these articles gives a complete set of table showing the numbers of rational points for curves with genus up to 50. The other articles provide interesting constructions of covering curves: covers by the Hemitian curve, Kummer extensions and Artin-Schreier extensions. With these articles the great difficulty of finding explicit equations for curves with many rational points is overcome. With the method given by Arnaldo García in [6] we have been able to nd examples that can be used to define the lower bounds for the corresponding entries in the tables given in http: //wins.uva.nl/~geer, which to the time of writing this Thesis appear as "no information available". In fact, as the curves found are maximal, these entries no longer need a bound, they can be given by a unique entry, since the exact value of Nq(g) is now known.
At the end of the thesis an outline of the construction of Goppa codes is given and the NXL and XNL codes are presented.
@mastersthesis{diva2:321905,
author = {Rovi, Carmen},
title = {{Algebraic Curves over Finite Fields}},
school = {Linköping University},
type = {{LiTH-MAT-INT-A--2010/02--SE}},
year = {2010},
address = {Sweden},
}
The question about how to determine the rank of a tensor has been widely studied in the literature. However the analytical methods to compute the decomposition of tensors have not been so much developed even for low-rank tensors.
In this report we present analytical methods for finding real and complex PARAFAC decompositions of 2 x 2 x 2 tensors before computing the actual rank of the tensor.
These methods are also implemented in MATLAB.
We also consider the question of how best lower-rank approximation gives rise to problems of degeneracy, and give some analytical explanations for these issues.
@mastersthesis{diva2:321908,
author = {Rovi, Ana},
title = {{Analysis of 2 x 2 x 2 Tensors}},
school = {Linköping University},
type = {{LiTH-MAT-INT-A--2010/01--SE}},
year = {2010},
address = {Sweden},
}
This thesis makes a survey of converse theorems for Dirichlet series. A converse theo-rem gives sufficient conditions for a Dirichlet series to be the Dirichlet series attachedto a modular form. Such Dirichlet series have special properties, such as a functionalequation and an Euler product. Sometimes these properties characterize the modularform completely, i.e. they are sufficient to prove the proper transformation behaviourunder some discrete group. The problem dates back to Hecke and Weil, and has morerecently been treated by Conrey et.al. The articles surveyed are:
The results and the proofs are described. The second article is found to contain anerror. Finally an alternative proof strategy is proposed.
@mastersthesis{diva2:278038,
author = {Karlsson, Jonas},
title = {{Modular forms and converse theorems for Dirichlet series}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2009/05--SE}},
year = {2009},
address = {Sweden},
}
In this paper the reflection-extension of one-dimensional quasiminimizers is studied.A brief introduction to quasiminimizers, focused on the one-dimensional ones, is given.The main result of the study concerns the size of the quasiminimizing constant of theextended function relative to the unextended one. Previous work by O. Martio gives anupper bound for this relation. This bound is lowered, and the new bound is proven to besharp.Sharp quasiminimizer constants are calculated for a few simple functions and theirreflection-extensions.
@mastersthesis{diva2:225219,
author = {Uppman, Hannes},
title = {{The Reflection Principle for One-dimensional Quasiminimizers}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2009/04--SE}},
year = {2009},
address = {Sweden},
}
This report consider a system describing three competing species with populations x, y and z. Sufficient conditions for every positive equilibrium to be asymptotically stable have been found. First it is shown that conditions on the pairwise competitive interaction between the populations are needed. Actually, these conditions are equivalent to asymptotic stability for any two-dimensional competing system of the three species. It is also shown that these alone are not enough, and that a condition on the competitive interaction between all three populations is also needed. If all conditions are fulfilled, each population will survive on a long-term basis and there will be a stable coexistence.
@mastersthesis{diva2:225012,
author = {Carlsson, Linn\'{e}a},
title = {{Stable Coexistence of Three Species in Competition}},
school = {Linköping University},
type = {{LiTH - MAT - EX - - 2009/02 - - SE}},
year = {2009},
address = {Sweden},
}
This paper deals with Lebesgue points and studies properties of the set of Lebesgue points for various classes of functions. We consider continuous functions, L1 functions and Sobolev functions. In the case of uniformly continuous functions and Hölder continuous functions we develop a characterization in terms of Lebesgue points. For Sobolev functions we study the dimension of the set of non-Lebesgue points.
@mastersthesis{diva2:218045,
author = {Karlsson, John},
title = {{Lebesgue points, Hölder continuity and Sobolev functions}},
school = {Linköping University},
type = {{LiTH-MAT-EX--08/15--SE}},
year = {2009},
address = {Sweden},
}
In this paper I give a description and derivation of Dirichlet's problem, a boundary value problem, for p-harmonic functions on graphs and study an iterative method for solving it.The method's convergence is proved and some preliminary results about its speed of convergence are presented.There is an implementation accompanying this thesis and a short description of the implementation is included. The implementation will be made available on the internet at http://www.mai.liu.se/~anbjo/pharmgraph/ for as long as possible.
@mastersthesis{diva2:216379,
author = {Andersson, Tomas},
title = {{An iterative solution method for p-harmonic functions on finite graphs with an implementation}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2009/03--SE}},
year = {2009},
address = {Sweden},
}
Image rendering is the process of creating realistic computer images from geometric models and physical laws of light and reflection. This master thesis deals mainly with the numerical intricacies of implementing an image renderer using spherical harmonics. It investigates how to calculate the reflection of light in a surface using the Phong model, and employs ray tracing to create a realistic image of a geometric model. Further, it investigates different ways of calculating the spherical harmonic representation of a function defined on the sphere. The thesis also deals with the implementation of self-shadowing, and the effects of adding this component to the rendering equation.
@mastersthesis{diva2:214236,
author = {Gyllensten, Johan},
title = {{Numerical Aspects of Image Rendering using Spherical Harmonics}},
school = {Linköping University},
type = {{LITH-MAI-EX-2008/10-SE}},
year = {2009},
address = {Sweden},
}
Schacket har sitt ursprung i Indien på 500-talet. Spelets karaktär har fascinerat människan genom tiderna. Mångamatematiker har analyserat spelet samt utvecklat problem knutna till det. I detta examensarbete analyserar vi destudier som undersökt om det finns en koppling mellan schackspelande och matematiklärande. Vi har ävenanalyserat studier som har undersökt om det finns en koppling mellan schackspelande och lärande i andraskolämnen. Det visar sig att det inte gjorts så många vetenskapliga studier för att undersöka dessa kopplingar. Deflesta av de studier som genomförts kvalificeras som kvasistudier. Flera studier visar att det inte finns någon tydligkoppling mellan schackspelande och matematiklärande. I vår litteraturstudie kan vi inte se att denna koppling finns,men vi anar dock att den finns. Vi hoppas att det i framtiden genomförs mer vetenskaplig forskning inom området.
@mastersthesis{diva2:216588,
author = {Hedman, Anders and von Sch\'{e}ele, Andreas},
title = {{Schack och Matematik:
En litteraturstudie om möjliga kopplingar mellan schackspelande och matematiklärande}},
school = {Linköping University},
type = {{LIU-LÄR-L-EX--08/176--SE}},
year = {2008},
address = {Sweden},
}
Crew costs are one of the largest expenses for airlines and effective manpower planning is therefore important to maximize profit. The focus of research in the field of manpower planning for airlines has mainly been on the scheduling of crew, while other areas, surprisingly, have received very little attention. This thesis provides an overview of some of the other problems facing manpower planners, such as designing a career ladder, planning transitions and making course schedules.
Mathematical models are presented for some of theses problems, and for the problem of allocating training and vacation in time the mathematical model has been tested on data from SAS Scandinavian Airlines. When allocating training and vacation there are many aspects to consider, such as avoiding crew shortage, access to resources needed for training, and vacation laws. Comparisons between solutions obtained with the model and SAS Scandinavian Airlines manual plan show encouraging results with savings around 10%.
@mastersthesis{diva2:37669,
author = {Holm, Åsa},
title = {{Manpower Planning in Airlines:
Modeling and Optimization}},
school = {Linköping University},
type = {{LiTH-MAT-EX--2008/13--SE}},
year = {2008},
address = {Sweden},
}
In general relativity, the nature of mass is non-local. However, an appropriate def-inition of mass at a quasi-local level could give a more detailed characterization ofthe gravitational field around massive bodies. Several attempts have been made tofind such a definition. One of the candidates is the Hawking mass. This thesispresents a method for calculating the spin coefficients used in the expression for theHawking mass, and gives a closed-form expression for the Hawking mass of ellipsoidal2-surfaces in Minkowski spacetime. Furthermore, the Hawking mass is shown to havethe correct limits, both in Minkowski and Schwarzschild, along particular foliationsof leaves approaching a metric 2-sphere. Numerical results for Schwarzschild are alsopresented.
@mastersthesis{diva2:114136,
author = {Hansevi, Daniel},
title = {{The Hawking mass for ellipsoidal 2-surfaces in Minkowski and Schwarzschild spacetimes}},
school = {Linköping University},
type = {{LiTH-MAT-EX--08/14--SE}},
year = {2008},
address = {Sweden},
}
Many companies have traveling salesmen that market and sell their products.This results in much traveling by car due to the daily customer visits. Thiscauses costs for the company, in form of travel expenses compensation, and environmentaleffects, in form of carbon dioxide pollution. As many companies arecertified according to environmental management systems, such as ISO 14001,the environmental work becomes more and more important as the environmentalconsciousness increases every day for companies, authorities and public.The main task of this thesis is to compute reasonable limits on the mileage ofthe salesmen; these limits are based on specific conditions for each salesman’sdistrict. The objective is to implement a heuristic algorithm that optimizes thecustomer tours for an arbitrary chosen month, which will represent a “standard”month. The output of the algorithm, the computed distances, will constitute amileage limit for the salesman.The algorithm consists of a constructive heuristic that builds an initial solution,which is modified if infeasible. This solution is then improved by a local searchalgorithm preceding a genetic algorithm, which task is to improve the toursseparately.This method for computing mileage limits for traveling salesmen generates goodsolutions in form of realistic tours. The mileage limits could be improved if theinput data were more accurate and adjusted to each district, but the suggestedmethod does what it is supposed to do.
@mastersthesis{diva2:200,
author = {Torstensson, Johan},
title = {{Computation of Mileage Limits for Traveling Salesmen by Means of Optimization Techniques}},
school = {Linköping University},
type = {{LiTH-MAT-EX--08/08--SE}},
year = {2008},
address = {Sweden},
}
The well-known Dijkstra's algorithm uses weights to determine the shortest path. The focus here is instead on the opposite problem, does there exist weights for a certain set of shortest paths? OSPF (Open Shortest Path First) is one of several possible protocols that determines how routers will send data in a network like the internet. Network operators would however like to have some control of how the traffic is routed, and being able to determine the weights, which would lead to the desired shortest paths to be used, would be a help in this task.The first part of this thesis is a mathematical explanation of the problem with a lot of examples to make it easier to understand. The focus here is on trying to combine several routing patterns into one, so that the result will be fewer, but more fully spanned, routing patterns, and it can e.g. be shown that there can't exist a common set of weights if two routing patterns can't be combined.The second part is a program that can be used to make several tests and changes to a set of routing patterns. It has a polynomial implementation of a function that can combine routing patterns. The examples that I used to combine routing patterns, showed that this will increase the likelihood of finding and significantly speed up the computation of a “valid cycle”.
@mastersthesis{diva2:112,
author = {Haraldsson, Erik},
title = {{Combining unobtainable shortest path graphs for OSPF}},
school = {Linköping University},
type = {{LITH-MAT-EX--2008/07--SE}},
year = {2008},
address = {Sweden},
}
The expected equity premium is an important parameter in many financial models, especially within portfolio optimization. A good forecast of the future equity premium is therefore of great interest. In this thesis we seek to forecast the equity premium, use it in portfolio optimization and then give evidence on how sensitive the results are to estimation errors and how the impact of these can be minimized.
Linear prediction models are commonly used by practitioners to forecast the expected equity premium, this with mixed results. To only choose the model that performs the best in-sample for forecasting, does not take model uncertainty into account. Our approach is to still use linear prediction models, but also taking model uncertainty into consideration by applying Bayesian model averaging. The predictions are used in the optimization of a portfolio with risky assets to investigate how sensitive portfolio optimization is to estimation errors in the mean vector and covariance matrix. This is performed by using a Monte Carlo based heuristic called portfolio resampling.
The results show that the predictive ability of linear models is not substantially improved by taking model uncertainty into consideration. This could mean that the main problem with linear models is not model uncertainty, but rather too low predictive ability. However, we find that our approach gives better forecasts than just using the historical average as an estimate. Furthermore, we find some predictive ability in the the GDP, the short term spread and the volatility for the five years to come. Portfolio resampling proves to be useful when the input parameters in a portfolio optimization problem is suffering from vast uncertainty.
@mastersthesis{diva2:18211,
author = {Bjurgert, Johan and Edstrand, Marcus},
title = {{Forecasting the Equity Premium and Optimal Portfolios}},
school = {Linköping University},
type = {{LITH-MAT-EX--2008/04--SE}},
year = {2008},
address = {Sweden},
}
Den forensiska vetenskapen innefattar en mängd olika vetenskaper som tillämpas för att bistå och besvara frågor av intresse för rättsväsendet. Skoavtrycksjämförelser har använts sedan slutet av 1700-talet för att bistå i brottsutredningar. Genom att undersöka egenskaper hos ett skoavtryck kan en forensiker ge utredaren värdefull information om skon och ibland även om bäraren. I bästa fall är skoavtrycket så unikt att det kan individualiseras och identifieras till en specifik sko.
För att underlätta och förbättra den forensiska bevisvärderingen är det av stort intresse att statistiskt erhålla förekomsten av ett bevis. Genom att samla in data gällande sulmönster och sedan etablera en databas kan styrkan hos ett specifikt skoavtryck fastställas. I denna studie samlades 687 avtryck in slumpmässigt och lades in i ett visualiserat databasklassificeringssystem, SIMSALAPIM, varpå en statistisk utvärdering utfördes.
Resultatet i denna studie visar på att ett specifikt sulmönster generellt förekommer endast en gång i databasen, varför det kan sägas att ett skoavtryck tillför en viss styrka/värde som forensiskt bevis även om det inte besitter några individualiserande detaljer. Vidare, genom ytterliggare statistiska utvärderingar, kunde även ett samband mellan ålder och typ av sko ses.
@mastersthesis{diva2:18227,
author = {Johansson, Åsa and Stattin, Teres\'{e}},
title = {{Footwear Impression as Forensic Evidence - Prevalence, Characteristics and Evidence Value}},
school = {Linköping University},
type = {{LITH--MAT--EX--07/15--SE}},
year = {2008},
address = {Sweden},
}
In this masters’ thesis report we present a graph theoretical method used for automatic bilingual lexicon acquisition with parallel texts. We analyze the concept of graph similarity and give an interpretation, of the parallel texts, connected to the vector space model. We represent the parallel texts by a directed, tripartite graph and from here use the corresponding adjacency matrix, A, to compute the similarity of the graph. By solving the eigenvalue problem ρS = ASAT + ATSA we obtain the self-similarity matrix S and the Perron root ρ. A rank k approximation of the self-similarity matrix is computed by implementations of the singular value decomposition and the non-negative matrix factorization algorithm GD-CLS. We construct an algorithm in order to extract the bilingual lexicon from the self-similarity matrix and apply a statistical model to estimate the precision, the correctness, of the translations in the bilingual lexicon. The best result is achieved with an application of the vector space model with a precision of about 80 %. This is a good result and can be compared with the precision of about 60 % found in the literature.
@mastersthesis{diva2:17980,
author = {Törnfeldt, Tobias},
title = {{Graph Similarity, Parallel Texts, and Automatic Bilingual Lexicon Acquisition}},
school = {Linköping University},
type = {{LITH-MAT-EX--08/03--SE}},
year = {2008},
address = {Sweden},
}
Is it possible for a minimal model of anaerobic muscle contraction to describe measured data? There have been many models trying to describe separate parts of the human body with various results. In this thesis a model has been created to describe all the essential biochemical reactions of anaerobic muscle metabolism during contraction but with as few states and parameters as possible. A toolbox in Matlab was used for simulation and also for parameter estimation. The best model eventually got validated to see statistically how well it can describe the measured data. During the simulations an unnecessary assumption got revealed which helped us to understand the system better. The vision of a whole-body model may not be so far into the future as many think and the first step is to understand smaller biochemical systems like muscle contraction.
@mastersthesis{diva2:17840,
author = {Maksai, Tibor},
title = {{Modeling Anaerobic Muscle Metabolism}},
school = {Linköping University},
type = {{LiTH-ISY-EX--08/3789--SE}},
year = {2008},
address = {Sweden},
}
In this master's thesis, hidden Markov models (HMM) are evaluated as a tool for forecasting movements in a currency cross. With an ever increasing electronic market, making way for more automated trading, or so called algorithmic trading, there is constantly a need for new trading strategies trying to find alpha, the excess return, in the market.
HMMs are based on the well-known theories of Markov chains, but where the states are assumed hidden, governing some observable output. HMMs have mainly been used for speech recognition and communication systems, but have lately also been utilized on financial time series with encouraging results. Both discrete and continuous versions of the model will be tested, as well as single- and multivariate input data.
In addition to the basic framework, two extensions are implemented in the belief that they will further improve the prediction capabilities of the HMM. The first is a Gaussian mixture model (GMM), where one for each state assign a set of single Gaussians that are weighted together to replicate the density function of the stochastic process. This opens up for modeling non-normal distributions, which is often assumed for foreign exchange data. The second is an exponentially weighted expectation maximization (EWEM) algorithm, which takes time attenuation in consideration when re-estimating the parameters of the model. This allows for keeping old trends in mind while more recent patterns at the same time are given more attention.
Empirical results shows that the HMM using continuous emission probabilities can, for some model settings, generate acceptable returns with Sharpe ratios well over one, whilst the discrete in general performs poorly. The GMM therefore seems to be an highly needed complement to the HMM for functionality. The EWEM however does not improve results as one might have expected. Our general impression is that the predictor using HMMs that we have developed and tested is too unstable to be taken in as a trading tool on foreign exchange data, with too many factors influencing the results. More research and development is called for.
@mastersthesis{diva2:17431,
author = {Idvall, Patrik and Jonsson, Conny},
title = {{Algorithmic Trading:
Hidden Markov Models on Foreign Exchange Data}},
school = {Linköping University},
type = {{LITH-MAT-EX-- 08/01--SE}},
year = {2008},
address = {Sweden},
}
In today’s society we are surrounded by large amounts of information, quick decisions and high expectations to perform successfully in everything we do. As a statistical agency, Statistics Sweden is responsible for producing some of the information that is used for decision-making in society and is therefore under constant internal and external pressure to perform well. The responsibility to produce high-quality statistics to all customers and users is not simple. What is the quality of the statistics produced? How do we assure and control the quality of the statistics? Do we use our resources efficiently? These are important questions, which need to be addressed.
One way of addressing these and other issues is to work with quality in a systematic fashion. Thus there is a need for a Quality Management System, i.e., a systematic way to handle quality issues of all kinds in all parts of the organization, and to continue the journey towards the vision of being a “world class statistical agency”.
This Masters thesis is a description and discussion of the efforts to find a suitable Quality Management System. The thesis starts with a discussion about the vague quality concept, continues with a description of numerous frameworks, methods and systems related to quality management as well as their pros and cons and ends with a recommendation for Statistics Sweden. The recommendation is to use the EFQM Excellence Model as a quality framework, Six Sigma as a tool-box for improvement projects and modern internal auditing methods for evaluation and follow-up. Finally, issues related to the implementation of the system are discussed.
@mastersthesis{diva2:17405,
author = {Lisai, Dan},
title = {{Choosing and Implementing a Quality Management System at Statistics Sweden}},
school = {Linköping University},
type = {{LITH-MAT-EX--07/18--SE}},
year = {2008},
address = {Sweden},
}
This thesis studies the allocation of stock in a two-level inventory system with stochastic demand. The system consists of one central warehouse which supplies N non-identical retailers with one single product. Customer demand occurs solely at the retailers and follows independent Poisson processes. The purpose is to investigate the value of using a more advanced allocation policy than First Come-First Serve at the central warehouse. The focus is on evaluating how well the simple First Come-First Serve assumption works in a system where the warehouse has access to real-time point-of-sale data, and where shipments are time based and consolidated for all retailers. The considered allocation policy is a myopic policy where the solution to a minimization problem, formulated as a constrained newsvendor problem, determines how the warehouse allocates its stock to the retailers. The minimization problem is solved using (a heuristic method based on) Lagrangian relaxation, and simulation is used to evaluate the average inventory holding costs and backorder costs per time unit when using the considered policy. The simulation study shows that cost savings around 1-4 percent can be expected for most system configurations. However, there were cases where savings were as high as 5 percent, as well as cases where the policy performed worse than First Come-First Serve. The study also shows that the highest cost savings are found in systems with relatively low demand, few retailers, short transportation times and a short time interval between shipments.
@mastersthesis{diva2:17153,
author = {Howard, Christian},
title = {{Myopic Allocation in Two-level Distribution Systems with Continuous Review and Time Based Dispatching}},
school = {Linköping University},
type = {{LITH--MAT-EX----07/17----SE}},
year = {2007},
address = {Sweden},
}
This thesis contributes to theoretical and quantitative aspects of machine scheduling. In fact, it is dedicated to the issue of scheduling n jobs on one single machine. The scope is limited to deterministic problems - i.e. those with all data available and known with certainty in advance - with tardiness involved objectives; hence, the common denominator of all problems addressed are jobs with a predetermined due date assigned to. A job is finished on time as long as it is completed before its due date, otherwise it is said to be tardy. Since the single machine utilized is assumed to be restricted to process at most one job at a time, the aim is to find a proper sequence - a schedule - of how to process the jobs in order to best fulfill a certain objective. The contribution of this thesis aims at giving a state of the art survey and detailed review of research effort considering the objectives "minimizing the number of tardy jobs" and "minimizing the weighted number of tardy jobs". Further, the objectives of "minimizing the total tardiness", "minimizing the total weighted tardiness" and "minimizing the maximum tardiness" are adumbrated but reduced to a rough overview of research effort made.
@mastersthesis{diva2:23372,
author = {Mundt, Andreas and Wich, Thomas},
title = {{Single Machine Scheduling with Tardiness Involved Objectives : A Survey}},
school = {Linköping University},
type = {{LiTH-MAT-EX-2007/09-SE}},
year = {2007},
address = {Sweden},
}
Penrose's inequality which relates the total mass of a space-time containing a black hole with the area of the event horizon, is a yet unproven condition that is required for the cosmic censorship hypothesis. It is believed that the inequality could be proved by using properties of the Hawking mass. This thesis gives analytical expressions for the Hawking mass in slowly rotating Kerr and Kerr-Newman space-times. It is also shown that the expressions are monotonically increasing, a result that does not contradict Penrose's inequality.
@mastersthesis{diva2:23821,
author = {Bengtsson, Martin},
title = {{Analytical Expressions for the Hawking Mass in slowly rotating Kerr and Kerr-Newman Space-times}},
school = {Linköping University},
type = {{LiTH-MAT-EX--07/11--SE}},
year = {2007},
address = {Sweden},
}
In this project we illustrate how queueing simulation may be used to find the optimal interval for checkpointing problems and compare results with theoretical computations for simple systems that may be treated analytically.
We consider a relatively simple model for an internet banking facility. From time to time, the application server breaks down. The information at the time of the breakdown has to be passed onto the back up server before service may be resumed. To make the change over as efficient as possible, information of the state of user’s accounts is saved at regular intervals. This is known as checkpointing.
Firstly, we use GPSS (a queueing simulation tool) to find, by simulation, an optimal checkpointing interval, which maximises the efficiency of the server. Two measures of efficiency are considered; the availability of the server and the average time a customer spends in the system. Secondly, we investigate how far the queueing theory can go to providing an analytic solution to the problem and see whether or not this is in line with the results obtained through simulation.
The analysis shows that checkpointing is not necessary if breakdowns occur frequently and log reading after failure does not take much time. Otherwise, checkpointing is necessary and the analysis shows how GPSS may be used to obtain the optimal checkpointing interval. Relatively complicated systems may be simulated, where there are no analytic tools available. In simple cases, where theoretical methods may be used, the results from our simulations correspond with the theoretical calculations.
@mastersthesis{diva2:23321,
author = {Savatovic, Anita and Cakic, Mejra},
title = {{Estimating Optimal Checkpoint Intervals Using GPSS Simulation}},
school = {Linköping University},
type = {{LiTH-MAT-EX--07/06--SE}},
year = {2007},
address = {Sweden},
}
In this thesis we address the problem of how to construct an optimal algorithm for displaying banners (i.e advertisements shown on web sites). The optimization is based on the revenue each banner generates, with the aim of selecting those banners which maximize future total revenue. Banner optimality is of major importance in the e-commerce industry, in particular on web sites with heavy traffic. The 'micropayments' from showing banners add up to substantial profits due to the large volumes involved. We provide a broad, up-to-date and primarily theoretical treatment of this global optimization problem. Through a synthesis of mathematical modeling, statistical methodology and computer science we construct a stochastic 'planning algorithm'. The superiority of our algorithm is based on empirical analysis conducted by us on real internet-data at TradeDoubler AB, as well as test-results on a selection of stylized data-sets. The algorithm is flexible and adapts well to new environments.
@mastersthesis{diva2:23289,
author = {Bastani, Spencer and Andersson, Olov},
title = {{Stochastic Optimization in Dynamic Environments:
with applications in e-commerce}},
school = {Linköping University},
type = {{LITH-MAT-EX--2007/04--SE}},
year = {2007},
address = {Sweden},
}
Objective: In recent years there has been an increasing interest within the clinical (medical) science in measuring people’s health. When estimating quality of life, present practise is to use the EQ-5D questionnaire and an index which weighs the different questions. The question is what happens if the individuals estimate there own health, would it differ from the public preferences? The aim is to make a new prediction model based on the opinion of patients and compare it to the present model based on public preferences.
Method: A sample of 362 patients with unstable coronary artery disease from the Frisc II trial, valued their quality of life in the acute phase and after 3, 6 and 12 months. The EQ-5D question form and also the Time Trade-off method (TTO), a direct method of valuing health was used. A regression technique managing panel data had to be used in estimating TTO by the EQ-5D and other variables like gender and age.
Result: Different regression techniques vary in estimating parameters and standard errors. A Generalized Estimating Equation approach with empirical correlation structure is the most suitable regression technique for the data material. A model based on the EQ-5D question form and a continuous age variable proves to be the best model for an index derived by individuals. The difference between heart patients own opinion of health and the public preferences differs a great amount in the severe health conditions, but are rather small for healthy patients. Of the total 243 health conditions, only eight of the conditions were estimated higher by the public index.
Conclusions: As the differences between the approaches are significantly large the choice of index could affect the decision making in a health economic study.
@mastersthesis{diva2:37858,
author = {Lyth, Johan},
title = {{En jämförelse mellan individers självuppskattade livskvalitet och samhällets hälsopreferenser:
En paneldatastudie av hjärtpatienter}},
school = {Linköping University},
type = {{LIU-MAT-D-06/08-SE}},
year = {2006},
address = {Sweden},
}
A compact Riemann surface can be realized as a quotient space $\mathcal{U}/\Gamma$, where $\mathcal{U}$ is the sphere $\Sigma$, the euclidian plane $\mathbb{C}$ or the hyperbolic plane $\mathcal{H}$ and $\Gamma$ is a discrete group of automorphisms. This induces a covering $p:\mathcal{U}\rightarrow\mathcal{U}/\Gamma$.
For each $\Gamma$ acting on $\mathcal{H}$ we have a polygon $P$ such that $\mathcal{H}$ is tesselated by $P$ under the actions of the elements of $\Gamma$. On the other hand if $P$ is a hyperbolic polygon with a side pairing satisfying certain conditions, then the group $\Gamma$ generated by the side pairing is discrete and $P$ tesselates $\mathcal{H}$ under $\Gamma$.
@mastersthesis{diva2:22858,
author = {Bartolini, Gabriel},
title = {{On Poicar\'{e}s Uniformization Theorem}},
school = {Linköping University},
type = {{LITH-MAT-EX--2006/14}},
year = {2006},
address = {Sweden},
}
This thesis is about a generalization of permutation theory. The concept of pattern avoidance in permutation matrices is investigated in a larger class of matrices - the alternating sign matrices. The main result is that the set of alternating sign matrices avoiding the pattern 132, is counted by the large Schröder numbers. An algebraic and a bijective proof is presented. Another class is shown to be counted by every second Fibonacci number. Further research in this new area of combinatorics is discussed.
@mastersthesis{diva2:22841,
author = {Johansson, Robert},
title = {{Pattern Avoidance in Alternating Sign Matrices}},
school = {Linköping University},
type = {{LiTH-MAT-EX--06/15--SE}},
year = {2006},
address = {Sweden},
}
Vid Onkologiska klinikens behandlingsmottagning ges cytostatika till de patienter som inte är inlagda vid kliniken. Arbetsförhållandena för sjuksköterskorna på mottagningen är ibland mycket påfrestande, genom att arbetsbelastningen kan vara mycket varierande, både mellan olika dagar och mellan olika sjuksköterskor. Vidare ger dagens bokningsrutiner inte någon samordning mellan sjuksköterskorna, vilket gör att mottagningen även har svårigheter att på ett bra sätt utnyttja sina behandlingsresurser.
Behandlingstiderna för patienterna bokas idag löpande. Examensarbetet syftar till att simulera förändringar i dagens verksamhet. Vi undersöker möjligheterna att genom samordnad bokning dels förbättra arbetsförhållandena för sjuksköterskorna och dels förbättra resursutnyttjandet vid mottagningen. Detta görs genom att konstruera dagsscheman för sjuksköterskorna. Arbetsförhållandena i dessa dagsschemana styrs av regler. Genom att utnyttja historisk statistik över utförda behandlingar genereras dagsscheman som uppfyller mottagningens behandlingsbehov på lång sikt. På så sätt kan även mottagningens maximala behandlingskapacitet undersökas. Dagsscheman skapas med hjälp av kolumngenerering, varvid kolumngenereringsproblemet löses med en girig heuristik.
Analyser visar att det finns stora möjligheter att med hjälp av samordnad bokning förbättra arbetsförhållandena för sjuksköterskorna, samtidigt som samma antal patienter, eller till och med fler, kan behandlas.
@mastersthesis{diva2:22295,
author = {Nolander, Mattias},
title = {{Matematisk simulering av optimerad patientbokning vid Onkologiska kliniken i Linköping}},
school = {Linköping University},
type = {{LITH-MAT-EX--06/07--SE}},
year = {2006},
address = {Sweden},
}
Fractal analysis is an important tool when we need to study geometrical objects less regular than ordinary ones, e.g. a set with a non-integer dimension value. It has developed intensively over the last 30 years which gives a hint to its young age as a branch within mathematics.
In this thesis we take a look at some basic measure theory needed to introduce certain definitions of fractal dimensions, which can be used to measure a set's fractal degree. Comparisons of these definitions are done and we investigate when they coincide. With these tools different fractals are studied and compared.
A key idea in this thesis has been to sum up different names and definitions referring to similar concepts.
@mastersthesis{diva2:22333,
author = {Leifsson, Patrik},
title = {{Fractal sets and dimensions}},
school = {Linköping University},
type = {{LiTH-MAT-EX--06/06--SE}},
year = {2006},
address = {Sweden},
}
GPGPU is a collective term for research involving general computation on graphics cards. A modern graphics card typically provides more than ten times the computational power of an ordinary PC processor. This is a result of the high demands for speed and image quality in computer games.
This thesis investigates the possibility of exploiting this computational power for image processing purposes. Three well known methods where implemented on a graphics card: FFT (Fast Fourier Transform), KLT (Kanade Lucas Tomasi point tracking) and the generation of scale pyramids. All algorithms where successfully implemented and they are tree to ten times faster than correspondning optimized CPU implementation.
@mastersthesis{diva2:22239,
author = {Hedborg, Johan},
title = {{GPGPU:
Bildbehandling på grafikkort}},
school = {Linköping University},
type = {{LITH-MAI-EX--06/12-SE}},
year = {2006},
address = {Sweden},
}
In this report, we show how to implement direct ray tracing of B´ezier surfaces on graphics processing units (GPUs), in particular bicubic rectangular Bézier surfaces and nonparametric cubic Bézier triangles. We use Newton’s method for the rectangular case and show how to use this method to find the ray-surface intersection. For Newton’s method to work we must build a spatial partitioning hierarchy around each surface patch, and in general, hierarchies are essential to speed up the process of ray tracing. We have chosen to use bounding box hierarchies and show how to implement stackless traversal of such a structure on a GPU. For the nonparametric triangular case, we show how to find the wanted intersection by simply solving a cubic polynomial. Because of the limited precision of current GPUs, we also propose a numerical approach to solve the problem, using a one-dimensional Newton search.
@mastersthesis{diva2:21327,
author = {Löw, Joakim},
title = {{Ray Tracing B\'{e}zier Surfaces on GPU}},
school = {Linköping University},
type = {{LITH-MAT-EX--06/24--SE}},
year = {2006},
address = {Sweden},
}
In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is based on a reformulation of the original problem into a Set Partitioning Problem (SPP), in which the columns represent partial solutions to the original problem. For solving this problem, column generation, with systematic overgeneration of columns, is used. Conditions that guarantee that an optimal solution to a restricted SPP is optimal also in the original problem are given. In order to satisfy these conditions, not only columns with the most negative Lagrangian reduced costs need to be generated, but also others; this observation leads to the use of overgeneration of columns.
The Generalized Assignment Problem has shown to be NP-hard and therefore efficient algorithms are needed, especially for large problems. The application of the proposed method decomposes GAP into several knapsack problems via Lagrangian relaxation, and enumerates solutions to each of these problems. The solutions obtained from the knapsack problems form a Set Partitioning Problem, which consists of combining one solution from each knapsack problem to obtain a solution to the original problem. The algorithm has been tested on problems with 10 agents and 60 jobs. This leads to 10 knapsack problems, each with 60 variables.
@mastersthesis{diva2:21391,
author = {Brommesson, Peter},
title = {{Solving the Generalized Assignment Problem by column enumeration based on Lagrangian reduced costs}},
school = {Linköping University},
type = {{LiTH-MAT-EX--05/12--SE}},
year = {2006},
address = {Sweden},
}
The Laplace equation and the related p-Laplace equation are closely associated with Sobolev spaces. During the last 15 years people have been exploring the possibility of solving partial differential equations in general metric spaces by generalizing the concept of Sobolev spaces. One such generalization is the Newtonian space where one uses upper gradients to compensate for the lack of a derivative.
All papers on this topic are written for an audience of fellow researchers and people with graduate level mathematical skills. In this thesis we give an introduction to the Newtonian spaces accessible also for senior undergraduate students with only basic knowledge of functional analysis. We also give an introduction to the tools needed to deal with the Newtonian spaces. This includes measure theory and curves in general metric spaces.
Many of the properties of ordinary Sobolev spaces also apply in the generalized setting of the Newtonian spaces. This thesis includes proofs of the fact that the Newtonian spaces are Banach spaces and that under mild additional assumptions Lipschitz functions are dense there. To make them more accessible, the proofs have been extended with comments and details previously omitted. Examples are given to illustrate new concepts.
This thesis also includes my own result on the capacity associated with Newtonian spaces. This is the theorem that if a set has p-capacity zero, then the capacity of that set is zero for all smaller values of p.
@mastersthesis{diva2:21524,
author = {Färm, David},
title = {{Upper gradients and Sobolev spaces on metric spaces}},
school = {Linköping University},
type = {{LiTH-MAT-EX--06/02--SE}},
year = {2006},
address = {Sweden},
}
In case of the PDE's the concept of solving by separation of variables
has a well defined meaning. One seeks a solution in a form of a
product or sum and tries to build the general solution out of these
particular solutions. There are also known systems of second order
ODE's describing potential motions and certain rigid bodies that are
considered to be separable. However, in those cases, the concept of
separation of variables is more elusive; no general definition is
given.
In this thesis we study how these systems of equations separate and find that their separation usually can be reduced to sequential separation of single first order ODE´s. However, it appears that other mechanisms of separability are possible.
@mastersthesis{diva2:21406,
author = {Måhl, Anna},
title = {{Separation of variables for ordinary differential equations}},
school = {Linköping University},
type = {{LiTH-MAT-EX--06/01--SE}},
year = {2006},
address = {Sweden},
}
I detta examensarbete har jag studerat hur elever i år 6 tänker vid decimalform inom taluppfattningens område. Begreppet taluppfattning är ett mycket brett område där det dessutom finns många olika uppfattningar om vad som ingår i begreppet. Därför har jag fokuserat mitt arbete på övergången från heltal till decimaltal. Syftet med undersökningen är att belysa vikten av att lärare har goda matematiska och metodiska kunskaper, hur elever utvecklar sin taluppfattning och förhoppningsvis ge lite tips och idéer som kan användas i undervisningen med elever. Studien omfattar en litteraturgenomgång som behandlar begreppet taluppfattning där jag delat upp kapitlet i tre underrubriker: Vad innebär det att elever har en grundläggande taluppfattning? Hur utvecklar elever en god taluppfattning? Vilka speciella svårigheter finns vid övergången från heltal till decimaltal? Under metoddelen skriver jag om hur pilot- och huvudundersökningen gjordes innan läsaren får ta del av undersökningarnas resultat. Resultatet av undersökningen är att många elever har svårt för övergången från heltal till decimaltal. Det finns tre moment i förståelsen av positionssystemet som tycks orsaka större svårigheter och det är platssiffrans värde, multiplikation med tal mindre än ett och uppskattning av rimligheten av svaret i en beräkning. Uppsatsen innehåller också ett avsnitt om vad vi lärare kan göra för att underlätta elevers förståelse för övergången från heltal till decimaltal.
@mastersthesis{diva2:21527,
author = {Andersson, Carina},
title = {{Taluppfattning:
En undersökning av elevers förståelse av decimaltal}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--05/02--SE}},
year = {2006},
address = {Sweden},
}
Syftet med det här examensarbetet var att vi ville undersöka om eleverna blev motiverade att arbeta med och lära sig matematik om den framställs på ett lustfyllt och verklighetshetsanknutet sätt. Att arbeta med matematik i projektform som ett komplement till den ordinarie matematikundervisningen skulle kunna vara ett sätt att motivera eleverna. För att få svar på våra frågeställningar planerade, utformade och genomförde vi en projektvecka i matematik på en gymnasieskola. Under veckans gång observerade vi eleverna och deras arbete. Utifrån våra observationer utvärderade vi själva projektveckan. Dessutom lät vi eleverna besvara en enkät.
När vi utformade projektveckan valde vi att utforma den som att det vore ett realityprogram som skulle sändas på TV. Vi lät eleverna arbeta med projekt i grupp och samtidigt med laborationer enskilt eller två och två. Vi valde att ge projekten och laborationerna nya namn, missions och sidospår, både med förhoppning att öka elevernas intresse och för att knyta ihop dessa med projektveckans upplägg, TV-programmet.
För att få innehållet i en projektvecka i matematik på gymnasiet verklighetsanknutet anser vi att det är viktigt att utgå från en verklig situation, istället för att utgå från ett matematiskt problem och utifrån detta arbeta fram ett projekt. Vi arbetade mycket med att få innehållet i projektveckan så verklighetsanknutet som möjligt och det anser vi att vi lyckades bra med. Vi kan även utläsa från enkäten eleverna besvarade att de upplevde matematiken i projektet verklighetsanknuten.
@mastersthesis{diva2:20500,
author = {Karlsson, Lina and Evertsson, Josefin},
title = {{MAsterCamp NågontinG -- Planering, utformning och genomförande av en projektvecka på gymnasiet}},
school = {Linköping University},
type = {{LiU-MAT/LÄR-EX--05/01--SE}},
year = {2005},
address = {Sweden},
}
This report presents an analysis of a partial differential equation, resulting from population model with age structure. The existence and uniqueness of a solution to the equation are proved. We look at stability of the solution. The asymptotic behaviour of the solution is treated. The report also contains a section about the connection between the solution to the age structure population model and a simple model without age structure.
@mastersthesis{diva2:20614,
author = {Håkansson, Nina},
title = {{Population growth:
analysis of an age structure population model}},
school = {Linköping University},
type = {{LITH-MAT-EX--05/16--SE}},
year = {2005},
address = {Sweden},
}
Using the finite element software FEMLAB® solutions are computed to Dirichlet problems for the Infinity-Laplace equation ∆∞(u) ≡ u2xuxx + 2uxuyuxy + u2yuyy = 0. For numerical reasons ∆q(u) = div (|▼u|q▼u) = 0, which (formally) approaches as ∆∞(u) = 0 as q → ∞, is used in computation. A parametric nonlinear solver is used, which employs a variant of the damped Newton-Gauss method. The analysis of the experiments is done using the known theory of solutions to Dirichlet problems for ∆∞(u) = 0, which includes AMLEs (Absolutely Minimizing Lipschitz Extensions), sets of uniqueness, critical segments and lines of singularity. From the experiments one main conjecture is formulated: For Dirichlet problems, which have a non-constant boundary function, it is possible to predict the structure of the lines of singularity in solutions in the Infinity-Laplace case by examining the corresponding Laplace case.
@mastersthesis{diva2:20436,
author = {Hansson, Mattias},
title = {{Numerical experiments with FEMLAB® to support mathematical research}},
school = {Linköping University},
type = {{LITH-MAT-EX--05/14--SE}},
year = {2005},
address = {Sweden},
}
Quantum key growing, often called quantum cryptography or quantum key distribution, is a method using some properties of quantum mechanics to create a secret shared cryptography key even if an eavesdropper has access to unlimited computational power. A vital but often neglected part of the method is unconditionally secure message authentication. This thesis examines the security aspects of authentication in quantum key growing. Important concepts are formalized as Python program source code, a comparison between quantum key growing and a classical system using trusted couriers is included, and the chain rule of entropy is generalized to any Rényi entropy. Finally and most importantly, a security flaw is identified which makes the probability to eavesdrop on the system undetected approach unity as the system is in use for a long time, and a solution to this problem is provided.
@mastersthesis{diva2:20355,
author = {Cederlöf, Jörgen},
title = {{Authentication in quantum key growing}},
school = {Linköping University},
type = {{LITH-MAT-EX--05/18--SE}},
year = {2005},
address = {Sweden},
}
Gas sensors are today used in many different application areas, and one growing future market is battery operated sensors. As many gas sensor components are heated, one major limit of the operation time is caused by the power dissipated as heat. AppliedSensor is a company that develops and produces gas sensor components, modules and solutions, among which battery operated gas sensors are one targeted market.
The aim of the diploma work has been to simulate the heat transfer on a hydrogen gas sensor component and its closest surroundings consisting of a carrier mounted on a printed circuit board. The component is heated in order to improve the performance of the gas sensing element.
Power dissipation occurs by all three modes of heat transfer; conduction from the component through bond wires and carrier to the printed circuit board as well as convection and radiation from all the surfaces. It is of interest to AppliedSensor to understand which factors influence the heat transfer. This knowledge will be used to improve different aspects of the gas sensor, such as the power consumption.
Modeling and simulation have been performed in FEMLAB, a tool for solving partial differential equations by the finite element method. The sensor system has been defined by the geometry and the material properties of the objects. The system of partial differential equations, consisting of the heat equation describing conduction and boundary conditions specifying convection and radiation, was solved and the solution was validated against experimental data.
The convection increases with the increase of hydrogen concentration. A great effort was made to finding a model for the convection. Two different approaches were taken, the first based on known theory from the area and the second on experimental data. When the first method was compared to experiments, it turned out that the theory was insufficient to describe this small system involving hydrogen, which was an unexpected but interesting result. The second method matched the experiments well. For the continuation of the project at the company, a better model of the convection would be a great improvement.
@mastersthesis{diva2:18631,
author = {Domeij Bäckryd, Rebecka},
title = {{Simulation of Heat Transfer on a Gas Sensor Component}},
school = {Linköping University},
type = {{LITH-MAT-EX--05/10--SE}},
year = {2005},
address = {Sweden},
}
Nynas produces bitumen at two refineries in Sweden. The bitumen is shipped to seven depots along the swedish coast line, and from the depots special trucks handle the transportation to customers. Recently Nynas has transformed its supply chain and closed down a few depots. At the moment the company is considering a further reduction of the number of depots. In connection to these discussions an analyse of the companys distributionsystem and of possible changes is required. In this thesis an optimization model is developed that simulates Nynas distribution of bitumen from the depots to the customers. The model is used to investigate the required vehicle fleet size for a number of different scenarios, that is with different depots closed down. The question to be answered is, thus, what depots could be closed without any dramatic increase in the required vehicle fleet size? Scenarios where customers are allocated an increased storage capacity are also studied.
The distribution model that is developed is an inventory route planning problem. It is solved by column generation. Each column represents a route and is generated by a subproblem with restrictions on permitted working hours for the truck drivers. Integer solutions are generated heuristically.
Simulations that have been performed with the model reveals interesting differences concerning how the distribution is handled in different parts of Sweden. In western Sweden the transportation planning works well, but the distribution in the central parts of the country could be planned in a better way. Results from simulations also show that the depots in Norrköping and Västerås could be closed down without increasing the vehicle fleet. Probably, the existing vehicle fleet size will be sufficient even with the Kalmar-depot closed down. Nevertheless, Nynas transportation suppliers will have to purchase new vehicles if the Sandarne-depot is to be closed.
Another interesting conclusion that can be drawn from this thesis is that there is a potential for reducing the vehicle fleet size if the storage capacity is increased at a few chosen customers. A considerably small increase in the storage capacity at a few big customers that are located far from the depots will have a great effect.
@mastersthesis{diva2:20246,
author = {Hjort, Mattias},
title = {{Bestämning av optimal fordonspark -Distribution av bitumen vid Nynäs AB}},
school = {Linköping University},
type = {{LITH-MAT-EX--05/06--SE}},
year = {2005},
address = {Sweden},
}
This thesis grew out of a problem encountered by a subsidiary of a Swedish multinational industrial corporation. This subsidiary is responsible for the corporation’s customer financing activities. In the thesis, we refer to these entities as the Division and the Corporation. The Division needed to find a new approach to finance its customer loan portfolio. Risk control and return maximization were important aspects of this need. The objective of this thesis is to devise and implement a method that allows the Division to make optimal funding decisions, given a certain risk limit.
We propose a funding approach based on stochastic programming. Our approach allows the Division’s portfolio manager to minimize the funding costs while hedging against market risk. We employ principal component analysis and Monte Carlo simulation to develop a multicurrency scenario generation model for interest and exchange rates. Market rate scenarios are used as input to three different optimization models. Each of the optimization models presents the optimal funding decision as positions in a unique set of financial instruments. By choosing between the optimization models, the portfolio manager can decide which financial instruments he wants to use to fund the loan portfolio.
To validate our models, we perform empirical tests on historical market data. Our results show that our optimization models have the potential to deliver sound and profitable funding decisions. In particular, we conclude that the utilization of one of our optimization models would have resulted in an increase in the Division’s net income over the past 3.5 years.
@mastersthesis{diva2:20004,
author = {Brushammar, Tobias and Windelhed, Erik},
title = {{An Optimization-Based Approach to the Funding of a Loan Portfolio}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/18--SE}},
year = {2004},
address = {Sweden},
}
Denna uppsats presenterar en undersökning av fallstudiekaraktär. Fallet är ett matematiklärarkollegium på en gymnasieskola i Sverige, vilket studeras med inriktning på hur lärarna i det lägger upp sin undervisning, och varför de gör som de gör. Utifrån kvalitativa intervjuer behandlar uppsatsen hur tre av matematiklärarna beskriver att de introducerar begreppet derivata och orsakerna till deras lektionsupplägg. Intervjuerna analyseras med hjälp av en antropologisk didaktikteori.
I uppsatsen redogörs för hur lärarna tänker sig sina undervisningsupplägg i sin helhet. Alla börjar emellertid avsnittet om derivata med en intuitiv beskrivning av detta begrepp. Denna beskrivning sker utifrån ett exempel om medelhastighet och momentanhastighet. Lärarna betonar den praktiska kunskapen, att kunna derivera, framför den teoretiska.
Angående de faktorer som styr de tre lärarna till den undervisning de har lyfter lärarna fram olika företeelser. Kursplanen, läroboken och elevinflytande är de faktorer som lärarna ser som de som påverkar dem mest. Lärarna menar även att de framförallt påverkas av det de låter sig styras av och de betonar sitt eget tänkande som orsak till uppläggen. Utifrån den antropologiska didaktikteorin observeras en styrande faktor som de intervjuade lärarna inte tar upp: Den akademiska matematiska kunskapen. Denna påverkar lärarna indirekt genom att den påverkar kursplanerna och upplägget på läroboken som lärarna använder. Även elevernas förkunskaper är något som styr lärarna mycket.
@mastersthesis{diva2:19714,
author = {Hellrup, Gustav},
title = {{Gymnasielärares introduktion av derivata:
En studie av tre matematiklärares undervisningsupplägg och vad som påverkar dem}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/08--SE}},
year = {2004},
address = {Sweden},
}
Traffic planning in a modern congested society is an important and time consuming procedure. Finding fast algorithms for solving traffic problems is therefore of great interest for traffic planners allover the world.
This thesis concerns solving the fixed demand traffic assignment problem (TAP) on a number of different transportation test networks. TAP is solved using the Frank-Wolfe algorithm and the shortest path problems that arise as subproblems to the Frank-Wolfe algorithm are solved using the network simplex algorithm. We evaluate how a number of existing pricing strategies to the network simplex algorithm performs with TAP. We also construct a new efficient pricing strategy, the Bucket Pricing Strategy, inspired by the heap implementation of Dijkstra's method for shortest path problems. This pricing strategy is, together with the actual use of the network simplex algorithm, the main result of the thesis and the pricing strategy is designed to take advantage of the special structure of TAP. In addition to performing tests on the conventional Frank-Wolfe algorithm, we also test how the different pricing strategies perform on Frank-Wolfe algorithms using conjugate and bi-conjugate search directions.
These test results show that the updating shortest path calculations obtained by using the network simplex outperforms the non-updating Frank-Wolfe algorithms. Comparisons with Bar-Gera's OBA show that our implementation, especially together with the bucket pricing strategy, also outperforms this algorithm for relative gaps down to 10E-6.
@mastersthesis{diva2:19908,
author = {Holmgren, Johan},
title = {{Efficient Updating Shortest Path Calculations for Traffic Assignment}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/13--SE}},
year = {2004},
address = {Sweden},
}
We derive the equation linking the Weyl tensor with its Lanczos potential, called the Weyl-Lanczos equation, in 1+3 covariant formalism for perfect fluid Bianchi type I spacetime and find an explicit expression for a Lanczos potential of the Weyl tensor in these spacetimes. To achieve this, we first need to derive the covariant decomposition of the Lanczos potential in this formalism. We also study an example by Novello and Velloso and derive their Lanczos potential in shear-free, irrotational perfect fluid spacetimes from a particular ansatz in 1+3 covariant formalism. The existence of the Lanczos potential is in some ways analogous to the vector potential in electromagnetic theory. Therefore, we also derive the electromagnetic potential equation in 1+3 covariant formalism for a general spacetime. We give a short description of the necessary tools for these calculations and the cosmological formalism we are using.
@mastersthesis{diva2:19917,
author = {Holgersson, David},
title = {{Lanczos potentialer i kosmologiska rumtider}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/12--SE}},
year = {2004},
address = {Sweden},
}
Sweden experiences heavy snowfall during the winter season and cost effective road maintenance is significantly affected by the routing of snowplows. The routing problem becomes more complex as the SwedishNational Road Administration (Vägverket) sets operational requirements such as satisfying a time window for each road segment.
This thesis focuses on route optimization for snowplows after snowfall; to develop and implement an algorithm for finding combinations of generated routes which minimize the total cost. The results are compared to those stated in the licentiate thesis by Doctoral student Nima Golbaharan (2001).
The algorithm calculates a lower bound to the problem using a Lagrangian master problem. A common subgradient approach is used to find near-optimal dual variables to be sent to a column-generation program which returns routes for the snowplows. A greedy heuristic chooses a feasible solution, which gives an upper bound to the problem. This entire process is repeated as needed.
This method for routing snowplows produces favorable results with a relatively small number of routes and are comparable to Golbaharan's results. An interesting observation involves the allocation of vehicles in which certain depots were regularly over- or under-utilized. This suggests that the quantity and/or distribution of available vehicles may not be optimal.
@mastersthesis{diva2:19885,
author = {Sochor, Jana and Yu, Cecilia},
title = {{A Heuristic Method for Routing Snowplows After Snowfall}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/11--SE}},
year = {2004},
address = {Sweden},
}
Jag ville få en större förståelse för varför det är så många elever som anser att matematik är ett tråkigt ämne. Frågeställningarna som detta arbete har fokuserats kring är elevernas uppfattningar och attityder om matematik och vad det är som gör dem motiverade i ämnet.
Resultaten visade att det framför allt var sådan matematik som de kände att de hade användning av i vardagslivet som gjorde dem motiverade. Eleverna hade blandade uppfattningar till exempel så ansåg de att matematik var tråkigt och ibland roligt. Områden som eleverna kände var bra att kunna var till exempel procent och huvudräkning. Algebra och ekvationer var det ingen som förstod vad man skulle med det till. Det var flera elever som ansåg att ekvationer var onödigt att kunna. En vanlig lektion för eleverna var ofta en kort genomgång och sedan enskilt räknande. De fick samarbeta med bänkkamraten om de gjorde det tyst enligt eleverna. Det var sällan som läraren hade grupparbeten, men ett par per läsår blev det. Matematikboken ansåg de var sådär till att vara bra. Det fanns ett fåtal uppgifter i läroben som väckte deras intresse. Några elever sa att det berodde på humöret hur mycket det blev gjort på lektionerna. Vissa var trötta på eftermiddagen och då orkade de inte med att räkna på de lektioner som låg på eftermiddagen. Det pratades mycket på lektionerna som inte handlade om matematik enligt eleverna. De hade svårt att gå vidare om de körde fast utan de väntade på att få hjälp av läraren och det kunde ta tid ibland. Då satt eleverna bara och väntade utan att räkna och ibland så pratade de medan de väntade med bänkkamraten. Detta innebar att vissa lektioner hade de bara räknat något enstaka tal. Eleverna i årskurs nio var mer nöjda med matematikboken än eleverna i årskurs sju. Läraren försökte stärka elevernas tilltro till sin egen förmåga genom att ge eleverna kortsiktiga mål som är möjliga för eleven att nå. I Skolverkets rapport om"Lusten att lära - med fokus på matematiken"har kommit fram till att eleverna behöver känna relevans för det som de ska lära sig för att kunna bli intresserade av området.
@mastersthesis{diva2:19880,
author = {Järvstråt, Madeleine},
title = {{Hur upplever elever matematik? En studie av uppfattningar om matematik hos elever i grundskolans senare år}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/06--SE}},
year = {2004},
address = {Sweden},
}
Detta arbete handlar om elevers kunskaper i att översätta en matematisk problemtext till en ekvation. Jag har dels studerat tidigare forskning inom området och dels gjort en egen studie. Huvudsyftet med arbetet är att ta reda på om det finns problem för elever i årskurs nio att finna en ekvation som kan lösa en bestämd uppgift och i så fall vilka är svårigheterna för eleverna. För att uppfylla syftet med detta arbete har jag valt att göra en litteraturstudie, en kvantitativ studie samt en mindre kvalitativ studie. I litteraturstudien tar jag bland annat upp vad algebra och ekvationer är för något, algebrans betydelse i skolan och vad tidigare undersökningar säger i det område jag undersöker. I min undersökning har 49 elever i årskurs nio deltagit i den skriftliga undersökningen och tre elever gjorde en gruppintervju.
Litteraturstudien och min studie avslutas med en diskussion. I diskussionen dras det slutsatser mellan min undersökning och litteraturstudien Några slutsatser som har framkommit av undersökningen och litteraturstudien är att elever i årskurs nio har svårt med att översätta ett problem till en ekvation. Det är framförallt förståelsen för bokstäver och likhetstecknets funktion i ekvationer som är svårt för eleverna. Avslutningsvis tar jag upp några didaktiska perspektiv på ekvationer som kan vara till hjälp för lärarna i undervisningen.
@mastersthesis{diva2:19883,
author = {Nilsson, Daniel},
title = {{Att skriva en ekvation. En studie av hur elever i år 9 översätter en matematisk problemtext till en ekvation}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/07--SE}},
year = {2004},
address = {Sweden},
}
In this thesis we calculate the Hawking mass numerically for surfaces in Kerr spacetime. The Hawking mass is a useful tool for proving the Penrose inequality and the result does not contradict the inequality. It also does not contradict the assumption that the Hawking mass should be monotonic for surfaces in Kerr spacetime. The Hawking mass is quasi-local and defined by the spin coefficents of Newman and Penrose, so first we give a discussion about quasi-local quantities and then a short description of the Newman-Penrose formalism.
@mastersthesis{diva2:19868,
author = {Jonsson Holm, Jonas},
title = {{Hawkingmassa i Kerr-rumtid}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/10--SE}},
year = {2004},
address = {Sweden},
}
Intresset är lågt för matematik hos elever i grundskolans senare del visar färska undersökningar. Skolverket efterlyser bland annat variation av arbetsformer. Jag har kommit i kontakt med en lärare som arbetar med laborativ matematik som återkommande inslag i matematikundervisningen. Denna uppsats är en fallstudie av hans arbete.
Syftet med detta examensarbete är att undersöka och beskriva hur man kan utveckla och arbeta med laborativ matematik som återkommande inslag i matematikundervisningen. Frågeställningarna har varit: Vilken är lärarens definition av laborativ matematik? Hur arbetar läraren inför, under och efter en matematisk laboration och hur svarar eleverna på lärarens intentioner? Vad har läraren för erfarenhet av hur kollegor och skolledning påverkar när det gäller utveckling av laborativ matematik?
För att finna svar på dessa frågor har jag genomfört lektionsbesök och intervjuer.
Resultatet beskriver dels lärarens definition på laborativ matematik, men även hur rapportskrivning kan användas i matematikundervisning, elevers motstånd till att byta arbetsmetod och hur viktigt stöd från skolledning och kommun är i utvecklingsarbete.
@mastersthesis{diva2:16842,
author = {Håkansson, Olof},
title = {{Laborativ matematik. En studie av hur en lärare arbetar laborativt i matematik i grundskolans senare år}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/05--SE}},
year = {2004},
address = {Sweden},
}
Uppsatsens syfte har varit att försöka få en bild av hur bevis och bevisföring fokuseras och har fokuserats i gymnasiematematiken. De frågeställningar arbetet inriktas på är vad elever har för attityd till matematiska bevis, syn på matematiska bevis samt kunskap om matematiska bevis. I uppsatsen har olika läroböcker som använts under de senaste decennierna studerats, och då genom att se hur härledningen av ett par centrala satser har genomförts. Vidare har kursplaner, läroplaner samt litteratur som berör didaktiska aspekter på matematiska bevis granskats. För att få svar på frågeställningarna ovan så har dels en enkätundersökning och dels ett test genomförts bland naturvetarelever på en gymnasieskola i Sydsverige.
Resultatet av studien visar att det är svårt att påstå att bevisfokuseringen i läroböcker och kursplaner skulle ha genomgått en drastisk förändring under de senaste decennierna mot en mindre bevisorienterad matematik, även om det finns exempel från läroboksanalysen som stöder ett sådant påstående. Resultatet från enkäten visar att elevernas uppfattningar om matematiska bevis på det hela taget är diffusa och att det finns många olika typer av föreställningar. Ett påtagligt resultat är att eleverna resonerar kring formlers giltighet när de beskriver det matematiska beviset. En elevgrupp i studien har en syn på det matematiska beviset som ligger nära ett naturvetenskapligt förhållningssätt. Anledningen till att det finns elevgrupper som associerar matematisk bevisföring till en naturvetenskaplig metod kan ha sin förklaring i att eleverna är färgade av andra förhållningssätt som finns i deras utbildning. Resultatet visar å andra sidan att det finns elever som uppfattar beviset som en del av ett större sammanhang där beviset bygger på tidigare grunder och genomförs exempelvis med hjälp av logiken. Undersökningen ger också uttryck för att en stor del av eleverna anser att det är viktigt att kunna bevisa matematiska satser, samtidigt som många av eleverna misslyckades med att bevisa enklare påståenden i det test som genomfördes. Detta kan möjligen hänga samman med att bara omkring en fjärdedel av de elever som ingick i studien instämde helt i påståendet att de haft möjlighet att öva på bevis i gymnasiet.
@mastersthesis{diva2:19798,
author = {Johansson, Jimmy},
title = {{Om bevis i gymnasiematematiken:
En studie av gymnasieelevers syn på, attityd till och kunskap om matematiska bevis}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/03--SE}},
year = {2004},
address = {Sweden},
}
Syftet med detta examensarbete var att undersöka om det är läromedlet som styr matematikundervisningen. Mina frågeställningar har varit: Hur påverkar läromedel matematikundervisningen? Hur använder olika lärare samma läromedel? För att söka svar på dessa frågor valde jag att genomföra litteraturstudier, genomgång av läromedlet Mattestegen samt observationer och intervjuer med fem olika lärare som alla jobbar med Mattestegen i åldersintegrerad verksamhet, år 4-6.
Uppsatsen bygger på en litteraturstudie, som visar på tidigare forskning om matematikundervisning och lärarens roll i matematikundervisningen. Uppsatsen bygger även på en empirisk del där läromedlet Mattestegen presenteras, observations- och intervjuresultaten redovisas, samt en analys av dessa.
Resultatet av min undersökning visar att lärarna uppfattar sig vara mycket styrda av läromedlet i sin undervisning. Det går att se en viss skillnad mellan de lärare som varit verksamma i några år, de vågar släppa läroboken och använda annat material, jämförelsevis med de lärare som är relativt nyexaminerade, de använder i stort sett inget annat än läromedlet i sin undervisning. Alla lärare i undersökningen har visioner om att de ska bli bättre på att använda annat material. Lärarna tror och litar på att läromedlet överensstämmer med kunskapsmålen, att läromedelsförfattaren har byggt upp boken på så sätt att eleverna klarar de nationella proven.
@mastersthesis{diva2:19776,
author = {Krüger, Elisebeth},
title = {{Är det läromedlet som styr matematikundervisningen? En undersökning om hur lärare använder ett och samma läromedel i år 4-6}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/02--SE}},
year = {2004},
address = {Sweden},
}
There are many types of bioreactors used for producing bacteria populations in commercial, medical and research applications.
This report presents a systematic discussion of some of the most important models corresponding to the well known reproduction kinetics such as the Michaelis-Menten kinetics, competitive substrate inhibition and competitive product inhibition. We propose a modification of a known model, analyze it in the same manner as known models and discuss the most popular types of bioreactors and ways of controlling them.
This work summarises much of the known results and may serve as an aid in attempts to design new models.
@mastersthesis{diva2:19668,
author = {Strandberg, Per Erik},
title = {{Mathematical models of bacteria population growth in bioreactors: formulation, phase space pictures, optimisation and control.}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/04--SE}},
year = {2004},
address = {Sweden},
}
The transportation cost of logs from forest to customers is a large part of the overall cost for the Swedish forestry industry. Finding good routes from harvesting points to saw and pulp mills is a complex task, where the total number of feasible routes is extremely high. In this thesis we present two methods for log truck scheduling.
The first is to, from a given set of routes, find the most valuable subset that fulfils the customers demand. We use a model that is similar to the set partitioning problem and a method that is referred to as a composite pricing coupled with Branch and Bound. The composite pricing based method prices the routes (columns) and chooses the most valuable ones that are then added to the LP relaxation. Once an LP optimum is found, the Branch and Bound method is used to find an integer optimum solution. We have tested this on a case of realistic size.
The second method is a tabu search heuristic. Here, the purpose is to create efficient and qualitative routes from a given number of trips (referred to as predefined trips). From a start solution tabu search systematically generates new solutions. This method was tested on a small problem and on a five times larger problem to study how the size of the problem affected the result. It was also tested and compared on two cases in which the backhauling possibilities (i.e. instead of traveling empty the truck picks up another load on the return trip) had and had not been studied. The composite pricing based method and the tabu search method proved to be very useful for this kind of scheduling.
@mastersthesis{diva2:19477,
author = {Holm, Christer and Larsson, Andreas},
title = {{A Model for Multiperiod Route Planning and a Tabu Search Method for Daily Log Truck Scheduling}},
school = {Linköping University},
type = {{LITH-MAT-EX--04/01--SE}},
year = {2004},
address = {Sweden},
}
Whist is one of the most played card games of the world. Though there have been many studies made in the field of game theory, whist is still somewhat of an unchartered territory. In this thesis some methods to obtain an optimal strategy for whist are discussed.
Whist belongs to a group of games called logical games. For this group there exists algorithms which result in an optimal strategy. Two algorithms where examined. The minmax algorithm and the alphbeta algorithm. these algorithms could be adapted to whist
It is possible that there are methods that use the properties of the cards better the the former algorithms to get an optimal result. A few such methods will also be discussed.
The practical result of the theoretical investigation was a game where the adapted algorithms were implemented.
@mastersthesis{diva2:19445,
author = {Eiderbrant, Emanuel},
title = {{Optimala strategier för whist}},
school = {Linköping University},
type = {{LITH-MAT-EX--03/18--SE}},
year = {2004},
address = {Sweden},
}
Uppsatsen ger en beskrivning av olika lärares resonemang kring hur man organiserar matematik- undervisningen under skolår 7-9. Ingår gör också lärares resonemang om vilka moment/förmågor i matematik som olika elever bör ha med sig efter avslutad grundskola. Den tredje frågan som behandlas i uppsatsen är vilka moment/förmågor inom matematiken som undervisningens organisation ger eleverna möjlighet att lära sig. Dessa frågor besvaras med hjälp av observationer på tre olika skolor och intervjuer med sex lärare på dessa tre skolor. I uppsatsen ingår en analys av de läromedel som skolorna använder sig av inom matematikundervisningen.
Ett gemensamt resultat, enligt den forskning som ingår i litteraturstudien och enligt de lärare som jag har intervjuat, är att frågan om hur man ska organisera matematikundervisningen är mycket svår att svara på. Enligt forskningen kan man hitta både för- och nackdelar med olika sätt att organisera undervisningen på. De lärare som jag har intervjuat pekar också på olika för- och nackdelar med olika sätt att organisera matematik-undervisningen. Det visar sig att läromedlet i matematik kan spela en ganska stor roll för hur man organiserar undervisningen.
@mastersthesis{diva2:20014,
author = {Elf, Jonas},
title = {{Matematikundervisningens organisation under grundskolans senare del:
lärare resonerar}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/04--SE}},
year = {2003},
address = {Sweden},
}
I en rapport från Skolverket framkommer att elever uppger att de lär sig mest och bäst när matematiken är relevant och begriplig, verklighetsanknuten samt då undervisningen är varierad, flexibel och där monotona räkningar undviks (Skolverket 2003). Skulle kanske då utomhusmatematiken kunna vara ytterligare en metod för att förklara problem för elever, ge matematiken en verklighetsanknytning och samtidigt skapa variation i undervisningen?
Det jag vill uppnå i arbetet är att beskriva hur utomhusmatematik kan användas som ett komplement till ordinarie matematikundervisning, sett ur ett lärarperspektiv. Detta har jag försökt svara på genom att ställa frågorna; Hur beskriver och resonerar undervisande lärare i grundskolans senare år om utomhusmatematik och elevernas lärande? Vilka faktorer påverkar/avgör om lärare använder sig av utomhusmatematik samt vilka utomhusmatematiska övningar ger lärarna exempel på? Jag har utgått från en explorativ ansats med ett hermeneutiskt perspektiv och som metod har jag använt mig av kvalitativa intervjuer där jag intervjuat sex lärare för att få svar på mina frågeställningar.
Resultatet visar att utomhusmatematik är ett arbetssätt där man använder sig av praktiska och konkreta matematikövningar som är verklighetsanknutna och som utförs utomhus. Majoriteten av eleverna tycker att det är positivt med utomhusmatematik och lärarna ser att elevernas lärande påverkas både direkt och indirekt. Några av de fördelar som nämnts är att eleverna använder fler sinnen vilket leder till ett annat tänkande som kan ge fördjupade kunskaper samtidigt som eleverna upptäcker vad matematiken kan användas till utanför klassrummet. Nackdelar finns, dels de som är påverkbara för läraren som exempelvis att det krävs vana för att utomhusmatematik ska ge bra resultat, dels de som är svåra att påverka för läraren till exempel schemat och skolkoden på skolan. Utomhusmatematiska övningar går att använda i ett flertal områden inom grundskolans matematik.
@mastersthesis{diva2:19573,
author = {Wänström, Anders},
title = {{En kugge i kugghjulet:
Utomhusmatematik i grundskolans senare år ur ett lärarsperspektiv}},
school = {Linköping University},
type = {{LIU-MAT/LÄR-EX--04/01--SE}},
year = {2003},
address = {Sweden},
}
The Swedish National Debt Office (SNDO) is the Swedish Government’s financial administration. It has several tasks and the main one is to manage the central government’s debt in a way that minimizes the cost with due regard to risk. The debt management problem is to choose currency composition and maturity profile - a problem made difficult because of the many stochastic factors involved.
The SNDO has created a simulation model to quantitatively analyze different aspects of this problem by evaluating a set of static strategies in a great number of simulated futures. This approach has a number of drawbacks, which might be handled by using a financial optimization approach based on Stochastic Programming.
The objective of this master’s thesis is thus to apply financial optimization on the Swedish government’s strategic debt management problem, using the SNDO’s simulation model to generate scenarios, and to evaluate this approach against a set of static strategies in fictitious future macroeconomic developments.
In this report we describe how the SNDO’s simulation model is used along with a clustering algorithm to form future scenarios, which are then used by an optimization model to find an optimal decision regarding the debt management problem.
Results of the evaluations show that our optimization approach is expected to have a lower average annual real cost, but with somewhat higher risk, than a set of static comparison strategies in a simulated future. These evaluation results are based on a risk preference set by ourselves, since the government has not expressed its risk preference quantitatively. We also conclude that financial optimization is applicable on the government debt management problem, although some work remains before the method can be incorporated into the strategic work of the SNDO.
@mastersthesis{diva2:19553,
author = {Grill, Tomas and Östberg, Håkan},
title = {{A Financial Optimization Approach to Quantitative Analysis of Long Term Government Debt Management in Sweden}},
school = {Linköping University},
type = {{LITH-MAT-EX--03/16--SE}},
year = {2003},
address = {Sweden},
}
Asymptotically flat spaces are widely studied because it is one natural way of describing an isolated system in general relativity. In this thesis we study what happens to the Lanczos potential at spacelike infinity in such spacetimes. By transformations of the Weyl-Lanczos equation, we derive expressions for the limiting equations on both the timelike unit hyperboloid, and the timelike unit cylinder. Finally the Newman-Penrose formalism is used to get a component version of the equations.
@mastersthesis{diva2:19358,
author = {Bäckdahl, Thomas},
title = {{Asymptotiska egenskaper för Lanczosspinoren}},
school = {Linköping University},
type = {{LITH-MAT-EX--03/15--SE}},
year = {2003},
address = {Sweden},
}
Tel: 013-28 10 00
Fax: 013-10 07 46
Linköpings universitet
Matematiska institutionen
581 83 LINKÖPING
Kontakta MAI |
Kartor

