Filetype
The objective of the study was to describe 20 matched pairs of children born to psychosocial risk mothers who have been followed from early pregnancy through their first 16 years of life. Interviews and standardized behavior measurements with a focus on the children's development were used. When considering the overall data from the different measurements done over the 16-year study period, the st
We present new polynomial-time approximation schemes (PTAS) for several basic minimum-cost multi-connectivity problems in geometrical graphs. We focus on low connectivity requirements. Each of our schemes either signifi- cantly improves the previously known upper time-bound or is the first PTAS for the considered problem. We provide a randomized approximation scheme for finding a biconnected graph
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-COLOURABILITY, MAX IND k-COL, MAX VAL k-COL, and, finally, MAX k-COL, which is the unweighted case of the MAX k-CUT problem. The algorithms are based on the idea of partitioning the domain of the problems into disjoint subsets, and then considering all possible instances were the va
Popular Abstract in Swedish Avhandlingen studerar flera olika algoritmiska problem inom grafteori och geometri, applikationerna sträcker sig från kretskortsdesign till matrismultiplikation. Vi börjar med att studera en grafteoretisk modell för det så kallade "firefigher problem". Målet med detta problemet är att rädda så mycket som möjligt av en given area genom att placera ut brandmän på relevaThis thesis studies several different algorithmic problems in graph theory and in geometry. The applications of the problems studied range from circuit design optimization to fast matrix multiplication. First, we study a graph-theoretical model of the so called ''firefighter problem''. The objective is to save as much as possible of an area by appropriately placing firefighters. We provide both n
We show how probabilistic numerics can be used to convert an initial value problem into a Gauss–Markov process parametrised by the dynamics of the initial value problem. Consequently, the often difficult problem of parameter estimation in ordinary differential equations is reduced to hyper-parameter estimation in Gauss–Markov regression, which tends to be considerably easier. The method’s relation
[abstract missing]
This paper discusses a Python interface for the recently published Dune-Fem-DG module which provides highly efficient implementations of the Discontinuous Galerkin (DG) method for solving a wide range of non linear partial differential equations (PDE). Although the C++ interfaces of Dune-Fem-DG are highly flexible and customizable, a solid knowledge of C++ is necessary to make use of this powerful
In this paper we consider the problem of solving geometric reconstruction problems with the L-infinity-norm. Previous work has shown that globally optimal solutions can be computed reliably for a series of such problems. The methods for computing the solutions have relied on the property of quasiconvexity. For quasiconvex problems, checking if there exists a solution below a certain objective valu
Submitted for publication in the "International Journal for Numerical Methods in Engineering".
A data-driven reduced basis (RB) method for parametrized time-dependent problems is proposed. This method requires the offline preparation of a database comprising the time history of the full-order solutions at parameter locations. Based on the full-order data, a reduced basis is constructed by the proper orthogonal decomposition (POD), and the maps between the time/parameter values and the proje
Many problems in computer vision can be formulated as geometric estimation problems, i.e. given a collection of measurements (e.g. point correspondences) we wish to fit a model (e.g. an essential matrix) that agrees with our observations. This necessitates some measure of how much an observation 'agrees' with a given model. A natural choice is to consider the smallest perturbation that makes the o
This study analyzes the problems of implementation in the EU with the help of Principal-Agent Analysis. The focus of the study is the Principal-Agent relationship between the member states and the Commission, where the member states have delegated the task of enforcing EU law to the Commission. Four main problems are discussed and analyzed, and it is argued that these are the reasons for the probl
Popular Abstract in Swedish Kring familjeproblematiken och för behandlingen av familjekonflikter har det svenska samhället organiserat olika sociala verksamheter som traditionellt regleras av Socialtjänstlagen. Familjerådgivningen är en av dessa verksamheter och definieras som en psykoterapeutisk behandling, till vilken en eller båda parter vänder sig oftast på frivillig basis när de upplever att
Objectives Most indices of disease activity in SLE combine physicians' assessments and laboratory tests. However, there is also a need to capture patients' perspectives of disease activity. Consequently, we need new, preferably quick and easy instruments to collect this information, which can be very useful for online consultations and registry purposes. We compared patients' assessments of SLE di
