Smart Cities: Inverse Design of 3D Urban Procedural Models with Traffic and Weather Simulation

Urbanization, the demographic transition from rural to urban, has changed how we envision and share the world. From just one-fourth of the population living in cities one hundred years ago, now more than half of the population does, and this ratio is expected to grow in the near future. Creating more sustainable, accessible, safe, and enjoyable cities has become an imperative

New Directions for Contact Integrators

Contact integrators are a family of geometric numerical schemes which guarantee the conservation of the contact structure. In this work we review the construction of both the variational and Hamiltonian versions of these methods. We illustrate some of the advantages of geometric integration in the dissipative setting by focusing on models inspired by recent studies in celestial mechanics and cosmology.Comment: To appear as Chapter 24 in GSI 2021, Springer LNCS 1282

Higher-order Voronoi diagrams of polygonal objects

Higher-order Voronoi diagrams are fundamental geometric structures which encode the k-nearest neighbor information. Thus, they aid in computations that require proximity information beyond the nearest neighbor. They are related to various favorite structures in computational geometry and are a fascinating combinatorial problem to study. While higher-order Voronoi diagrams of points have been studied a lot, they have not been considered for other types of sites. Points lack dimensionality which makes them unable to represent various real-life instances. Points are the simplest kind of geometric object and therefore higher- order Voronoi diagrams of points can be considered as the corner case of all higher-order Voronoi diagrams. The goal of this dissertation is to move away from the corner and bring the higher-order Voronoi diagram to more general geometric instances. We focus on certain polygonal objects as they provide flexibility and are able to represent real-life instances. Before this dissertation, higher-order Voronoi diagrams of polygonal objects had been studied only for the nearest neighbor and farthest Voronoi diagrams. In this dissertation we investigate structural and combinatorial properties and discover that the dimensionality of geometric objects manifests itself in numerous ways which do not exist in the case of points. We prove that the structural complexity of the order-k Voronoi diagram of non-crossing line segments is O(k(n-k)), as in the case of points. We study disjoint line segments, intersecting line segments, line segments forming a planar straight-line graph and extend the results to the Lp metric, 1<=p<=infty. We also establish the connection between two mathematical abstractions: abstract Voronoi diagrams and the Clarkson-Shor framework. We design several construction algorithms that cover the case of non-point sites. While computational geometry provides several approaches to study the structural complexity that give tight realizable bounds, developing an effective construction algorithm is still a challenging problem even for points. Most of the construction algorithms are designed to work with points as they utilize their simplicity and relations with data-structures that work specifically for points. We extend the iterative and the sweepline approaches that are quite efficient in constructing all order-i Voronoi diagrams, for i<=k and we also give three randomized construction algorithms for abstract higher-order Voronoi diagrams that deal specifically with the construction of the order-k Voronoi diagrams

KI-Realitäten: Modelle, Praktiken und Topologien maschinellen Lernens

Maschinelles Lernen stellt zunehmend einen wichtigen Faktor soziotechnischen Wandels dar. Zugleich ist es selbst Produkt der Realitäten, an deren Reproduktion es in Form praktischer Anwendungen wie auch als Spekulationsobjekt beteiligt ist. Die Beiträge des Bandes verhandeln gegenwärtige Manifestationen maschinellen Lernens als Phänomene, die für epistemische Verunsicherungen sorgen und die Bedingungen von Sozialität rekonfigurieren. Sie begegnen dieser Herausforderung, indem sie konkrete Verfahren in ihrer gesellschaftlichen Einbettung analysieren sowie bestehende theoretische Charakterisierungen sogenannter Künstlicher Intelligenz kritisch reflektieren

Data bases and data base systems related to NASA's aerospace program. A bibliography with indexes

This bibliography lists 1778 reports, articles, and other documents introduced into the NASA scientific and technical information system, 1975 through 1980