Advanced search
Showing result 1 - 5 of 59 swedish dissertations matching the above criteria.
-
1. Family, Neighborhoods, and Health : Conditions for the Development of Human Capabilities
Abstract : Essay 1: We use data from a large sample of adoptees born in Sweden to decompose the intergenerational persistence in health inequality across generations into one pre-birth component, measured by the biological parents’ longevity, and one post-birth component, measured by the adopting parents’ longevity. We find that most of the health inequality is transmitted via pre-birth factors. READ MORE
-
2. Neighborhoods without community : collective efficacy and crime in Malmö, Sweden
Abstract : Brottslighet i utsatta bostadsområden har de senaste åren fått stort utrymme i samhällsdebatten. Polisen har börjat sammanställa nationella listor över de bostadsområden i Sverige som anses präglas av kriminella nätverk, samtidigt har media rapporterat att vissa brott, främst skjutningar och bilbränder, är betydligt vanligare i dessa områden än i andra delar av samhället. READ MORE
-
3. The Social Roles of Buildings : An Account of Materiality and Meaning in Urban Outcomes
Abstract : The dissertation explores the roles of buildings in urban social life. Buildings, as both a methodological tool and a research site, are valuable for understanding society. As a method, buildings allow access to various urban contexts. READ MORE
-
4. The Euclidean traveling salesman problem with neighborhoods and a connecting fence
Abstract : An important class of problems in robotics deals with the planning of paths. In this thesis, we study this class of problems from an algorithmic point of view by considering cases where we have complete knowledge of the environment and each solution must ensure that a point-sized robot capable of moving continuously and turning arbitrarily accomplishes the following: (1) visits a given set of objects attached to an impenetrable simple polygon in the plane, and (2) travels along a path of minimum length over all the possible paths that visit the objects without crossing the polygon. READ MORE
-
5. Geometric Decompositions and Networks - Approximation Bounds and Algorithms
Abstract : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. READ MORE