Historical GIS Research in Canada

Fundamentally concerned with place, and our ability to understand human relationships with environment over time, Historical Geographic Information Systems (HGIS) as a tool and a subject has direct bearing for the study of contemporary environmental issues and realities. To date, HGIS projects in Canada are few and publications that discuss these projects directly even fewer. This book brings together case studies of HGIS projects in historical geography, social and cultural history, and environmental history from Canada's diverse regions. Projects include religion and ethnicity, migration, indigenous land practices, rebuilding a nineteenth-century neighborhood, and working with Google Earth. With contributions by: Colleen Beard Stephen Bocking Jennifer Bonnell Jim Clifford Joanna Dean François Dufaux Patrick A. Dunae Marcel Fortin Jason Gilliland William M. Glen Megan Harvey Matthew G. Hatvany Sally Hermansen Andrew Hinson Don Lafreniere John S. Lutz Joshua D. MacFadyen Daniel Macfarlane Jennifer Marvin Cameron Metcalf Byron Moldofsky Sherry Olson Jon Pasher Daniel Rueck R. W. Sandwell Henry Yu Barbara Znamirowsk

Evolutionary design assistants for architecture

In its parallel pursuit of an increased competitivity for design offices and more pleasurable and easier workflows for designers, artificial design intelligence is a technical, intellectual, and political challenge. While human-machine cooperation has become commonplace through Computer Aided Design (CAD) tools, a more improved collaboration and better support appear possible only through an endeavor into a kind of artificial design intelligence, which is more sensitive to the human perception of affairs. Considered as part of the broader Computational Design studies, the research program of this quest can be called Artificial / Autonomous / Automated Design (AD). The current available level of Artificial Intelligence (AI) for design is limited and a viable aim for current AD would be to develop design assistants that are capable of producing drafts for various design tasks. Thus, the overall aim of this thesis is the development of approaches, techniques, and tools towards artificial design assistants that offer a capability for generating drafts for sub-tasks within design processes. The main technology explored for this aim is Evolutionary Computation (EC), and the target design domain is architecture. The two connected research questions of the study concern, first, the investigation of the ways to develop an architectural design assistant, and secondly, the utilization of EC for the development of such assistants. While developing approaches, techniques, and computational tools for such an assistant, the study also carries out a broad theoretical investigation into the main problems, challenges, and requirements towards such assistants on a rather overall level. Therefore, the research is shaped as a parallel investigation of three main threads interwoven along several levels, moving from a more general level to specific applications. The three research threads comprise, first, theoretical discussions and speculations with regard to both existing literature and the proposals and applications of the thesis; secondly, proposals for descriptive and prescriptive models, mappings, summary illustrations, task structures, decomposition schemes, and integratory frameworks; and finally, experimental applications of these proposals. This tripartite progression allows an evaluation of each proposal both conceptually and practically; thereby, enabling a progressive improvement of the understanding regarding the research question, while producing concrete outputs on the way. Besides theoretical and interpretative examinations, the thesis investigates its subject through a set of practical and speculative proposals, which function as both research instruments and the outputs of the study. The first main output of the study is the “design_proxy” approach (d_p), which is an integrated approach for draft making design assistants. It is an outcome of both theoretical examinations and experimental applications, and proposes an integration of, (1) flexible and relaxed task definitions and representations (instead of strict formalisms), (2) intuitive interfaces that make use of usual design media, (3) evaluation of solution proposals through their similarity to given examples, and (4) a dynamic evolutionary approach for solution generation. The design_proxy approach may be useful for AD researchers that aim at developing practical design assistants, as has been examined and demonstrated with the two applications, i.e., design_proxy.graphics and design_proxy.layout. The second main output, the “Interleaved Evolutionary Algorithm” (IEA, or Interleaved EA) is a novel evolutionary algorithm proposed and used as the underlying generative mechanism of design_proxybased design assistants. The Interleaved EA is a dynamic, adaptive, and multi-objective EA, in which one of the objectives leads the evolution until its fitness progression stagnates; in the sense that the settings and fitness values of this objective is used for most evolutionary decisions. In this way, the Interleaved EA enables the use of different settings and operators for each of the objectives within an overall task, which would be the same for all objectives in a regular multi-objective EA. This property gives the algorithm a modular structure, which offers an improvable method for the utilization of domain-specific knowledge for each sub-task, i.e., objective. The Interleaved EA can be used by Evolutionary Computation (EC) researchers and by practitioners who employ EC for their tasks. As a third main output, the “Architectural Stem Cells Framework” is a conceptual framework for architectural design assistants. It proposes a dynamic and multi-layered method for combining a set of design assistants for larger tasks in architectural design. The first component of the framework is a layer-based, parallel task decomposition approach, which aims at obtaining a dynamic parallelization of sub-tasks within a more complicated problem. The second component of the framework is a conception for the development mechanisms for building drafts, i.e., Architectural Stem Cells (ASC). An ASC can be conceived as a semantically marked geometric structure, which contains the information that specifies the possibilities and constraints for how an abstract building may develop from an undetailed stage to a fully developed building draft. ASCs are required for re-integrating the separated task layers of an architectural problem through solution-based development. The ASC Framework brings together many of the ideas of this thesis for a practical research agenda and it is presented to the AD researchers in architecture. Finally, the “design_proxy.layout” (d_p.layout) is an architectural layout design assistant based on the design_proxy approach and the IEA. The system uses a relaxed problem definition (producing draft layouts) and a flexible layout representation that permits the overlapping of design units and boundaries. User interaction with the system is carried out through intuitive 2D graphics and the functional evaluations are performed by measuring the similarity of a proposal to existing layouts. Functioning in an integrated manner, these properties make the system a practicable and enjoying design assistant, which was demonstrated through two workshop cases. The d_p.layout is a versatile and robust layout design assistant that can be used by architects in their design processes

Tree-Structured Problems and Parallel Computation

Turing-Maschinen sind das klassische Beschreibungsmittel für Wortsprachen und werden daher auch benützt, um Komplexitätsklassen zu definieren. Dies geschieht zum Beispiel durch das Einschränken des Platz- oder Zeitaufwandes der Berechnung zur Lösung eines Problems. Für sehr niedrige Komplexität wie etwa sublineare Laufzeit, werden Schaltkreise verwendet. Schaltkreise können auf natürliche Art Komplexitäten wie etwa logarithmische Laufzeit modellieren. Ebenso können sie als eine Art paralleles Rechenmodell gesehen werden. Eine wichtige parallele Komplexitätsklasse ist NC1. Sie wird beschrieben durch Boolesche Schaltkreise logarithmischer Tiefe und beschränktem Eingangsgrad der Gatter. Eine initiale Beobachtung, die die vorliegende Arbeit motiviert, ist, dass viele schwere Probleme in NC1 eine ähnliche Struktur haben und auf ähnliche Art und Weise gelöst werden. Das Auswertungsproblem für Boolesche Formeln ist eines der repräsentativsten Probleme aus dieser Klasse: Gegeben ist hier eine aussagenlogische Formel samt Belegung für die Variablen; gefragt ist, ob sie zu wahr oder zu falsch auswertet. Dieses Problem wird in NC1 gelöst durch den Algorithmus von Buss. Auf ähnliche Art können arithmetische Formeln in #NC1 ausgewertet oder das Wortproblem für Visibly-Pushdown-Sprachen gelöst werden. Zu besagter Klasse an Problemen gehört auch Courcelles Theorem, welches Berechnungen in Baumautomaten involviert. Zu bemerken ist, dass alle angesprochenen Probleme gemeinsam haben, dass sie aus Instanzen bestehen, die baumartig sind. Formeln sind Bäume, Visibly-Pushdown-Sprachen enthalten als Wörter kodierte Bäume und Courcelles Theorem betrachtet Graphen mit beschränkter Baumweite, d.h. Graphen, die sich als Baum darstellen lassen. Insbesondere Letzteres ist ein Schema, das häufiger auftritt. Zum Beispiel gibt es NP-vollständige Graphprobleme wie das Finden von Hamilton-Kreisen, welches unter beschränkter Baumweite in P fällt. Neuere Analysen konnten diese Schranke weiter zu SAC1 verbessern, was eine parallele Komplexitätsklasse ist. Die angesprochenen Probleme kommen aus unterschiedlichen Bereichen und haben individuelle Lösungen. Hauptthese dieser Arbeit ist, dass sich diese Vielfalt vereinheitlichen lässt. Es wird ein generisches Lösungskonzept vorgestellt, welches darauf beruht, dass sich die Probleme auf ein Termevaluierungsproblem reduzieren lassen. Kernstück ist daher ein Termevaluierungsalgorithmus, der unabhängig von der Algebra, über welche der Term evaluiert werden soll, ist. Resultat ist, dass eine Vielzahl, darunter die oben angesprochenen Probleme, sich auf analoge Art lösen lassen, und dass sich ebenso leicht neue Resultate zeigen lassen. Diese Menge an Resultaten hätte sich ohne den vereinheitlichten Lösungsansatz nicht innerhalb des Rahmens einer Arbeit wie der vorliegenden zeigen lassen. Der entwickelte Lösungsansatz führt stets zu Schaltkreisfamilien polylogarithmischer Tiefe. Es wird jedoch auch die Frage behandelt, wie mächtig Schaltkreisfamilien konstanter Tiefe noch bezüglich Termevaluierung sind. Die Klasse AC0 ist hierfür ein natürlicher Kandidat; sie entspricht der Menge der Sprachen, die durch Logik erster Ordung beschreibbar sind. Um dieses Problem anzugehen, wird zunächst das Termevaluierungsproblem über endlichen Algebren betrachtet. Dieses wiederum lässt sich in das Wortproblem von Visibly-Pushdown-Sprachen einbetten. Daher handelt dieser Teil der Arbeit vornehmlich von der Beschreibbarkeit von Visibly-Pushdown-Sprachen in Logik erster Ordnung. Hierbei treten ungelöste Probleme zu Tage, welche ein Indiz dafür sind, wie schlecht die Komplexität konstanter Tiefe bisher noch verstanden ist, und das, trotz des Resultats von Furst, Saxe und Sipser, bzw. Håstads. Die bis jetzt beschrieben Inhalte sind Teil einer kontinuierlichen Entwicklung. Es gibt jedoch ein Thema in dieser Arbeit, das orthogonal dazu ist: Automaten und im speziellen Cost-Register-Automaten. Zum einen sind, wie oben angedeutet, Automaten Beispiele für Anwendungen des hier entwickelten generischen Lösungsansatzes. Zum anderen können sie selbst zur Beschreibung von Termevaluierungsproblemen dienen; so können Visibly-Pushdown-Automaten Termevaluierung über endlichen Algebren ausführen. Um über endliche Algebren hinauszugehen, benötigen die Automaten mehr Speicher. Visibly-Pushdown-Automaten haben einen Keller, der genau dafür geeignet ist, die Baumstruktur einer Eingabeformel zu verifizieren. Für nichtendliche Algebren eignet sich ein Modell, welches hier vorgestellt werden soll. Es kombiniert Visibly-Pushdown-Automaten mit Cost-Register-Automaten. Ein Cost-Register-Automat ist ein endlicher Automat, welcher mit zusätzlichen Registern ausgestattet ist. Die Register können Werte einer Algebra speichern und werden in jedem Schritt in Abhängigkeit des Eingabezeichens und des Zustandes aktualisiert. Dieser Einwegdatenfluss von Zuständen zu Registern sorgt dafür, dass dieses Modell nicht nur entscheidbar bleibt, sondern, in Abhängigkeit der Algebra, auch niedrige Komplexität hat. Das neue Modell der Cost-Register-Visibly-Pushdown-Automaten kann nun Terme evaluieren. Es werden grundlegende Eigenschaften gezeigt, einschließlich Komplexitätsaussagen

LIPIcs, Volume 274, ESA 2023, Complete Volume

LIPIcs, Volume 274, ESA 2023, Complete Volum

Mathematical programming models to design and analyse efficient and robust raiway freight transport networks

(English) Searching to achieve an ambitious reduction in greenhouse gas emissions, the European Union has set as a goal a modal shift in freight transport of 30\% by rail or waterborne for the near future. The increasing efforts of many governments to intensify rail freight transport often must face the difficulties involved in improving both infrastructure and rail operations. Moreover, infrastructure management and business operations usually correspond to different entities with highly contradictory economic interests. Making progress on the reliability of the railway network is one of the main factors to be considered to make the use of the train more attractive as a means of transport for industry. Also, focusing on shippers' response to road and rail competition and the role of different rail undertakings competing with each other may help boost the use of rail for freight transport. Seeking to reinforce these two goals, this thesis introduces two independent mathematical optimisation models, which may also be complementary, and which have been developed under a common conceptual framework of data structures and variables to guarantee their compatibility. The first model is a mathematical programming-based design model for evaluating the impact on a mixed railway network from proposals for infrastructure improvement and capacity expansion that are oriented mainly toward increasing freight transportation. The model has been applied to extend elements of an existing mixed railway network, perform relatively less costly actions on the network, and enhance capacity by adding new blocking/control systems at specific locations. These aspects are usually not considered in models for regional planning. Rather than a model whose sole focus is on railway capacity expansion, this approach combines capacity-expansion with network design. Because the way investments generate returns to the freight transportation system is of utmost relevance for these types of problems, this model is based on the efficient frontier between investment and operating costs. The second model is a combined model for jointly evaluating the modal split road-rail, and the resulting railway freight flows on the railway network. This combined modal split-traffic assignment model is addressed to the case when a modal split based on a random utility model is available, and some of its coefficients may present a non-negligible variability. To this end, after the initial deterministic formulation, a robust counterpart of the model is developed. The model, formulated as a non-linear integer programming problem, is oriented to a multi-carrier environment and includes constraints to consider the interactions between the different types of flows on the railway network, allowing a detailed evaluation of the cost types of the carriers and the network capacity. An algorithmic solution based on the outer approximation method is shown to provide accurate solutions in a reasonable computational time for the robust and non-robust versions of the model. Examples centred on a section of the Trans-European Transport Network, the TEN-T Core network corridors, are reported to test the applicability of the models. Results show the effectiveness of both models. The design model can be a helpful tool for analysing the impact infrastructure investments may have on operating costs, where (implicit) capacity limitations in the scenarios to be evaluated may necessarily be taken into account. At the same time, it can be complemented with the combined modal split-traffic assignment model by assessing the possible shippers' response to the different railway carriers' services competing with each other and the road.(Español) Tratando de lograr una significativa y ambiciosa reducción de las emisiones de gases de efecto invernadero, la Unión Europea se ha marcado como objetivo que los modos de transporte de mercancías alternativos a la carretera, como el ferrocarril o la navegación fluvial, alcancen una cuota del 30% sobre el total de mercancías transportadas por tierra en Europa en los próximos años. Los crecientes esfuerzos que llevan a cabo los diferentes gobiernos se enfrentan con demasiada frecuencia con las dificultades que suponen mejorar de forma simultánea infraestructura y operaciones ferroviarias, habitualmente gestionados por entes diferentes con intereses económicos enfrentados. Mejorar la fiabilidad de la red ferroviaria es uno de los principales factores a tener en cuenta para hacer más atractivo el uso del tren como medio de transporte para la industria. Por otro lado, centrarse en los criterios que pueden llevar a las empresas a elegir entre carretera o tren, y en el papel que juegan las diferentes compañías ferroviarias en esta elección, compitiendo entre sí, puede ayudar a incrementar el uso del tren para el transporte de mercancías. Con la idea de reforzar estos dos objetivos, este trabajo de tesis presenta dos modelos matemáticos de optimización, independientes pero a la vez complementarios, y desarrollados bajo un marco conceptual de estructuras de datos y variables común para garantizar su compatibilidad. El primer modelo es un modelo de diseño basado en programación matemática para evaluar el impacto que pueden tener, sobre una red ferroviaria de uso mixto, propuestas de mejora de la infraestructura y de ampliación de la capacidad dirigidas principalmente a incrementar el uso del tren para el transporte de mercancías. El modelo se ha orientado a la modificación de elementos de una red ferroviaria de uso mixto existente, proponiendo intervenciones en la red relativamente poco costosas, y aumentando la capacidad añadiendo nuevos sistemas de bloqueo y control en ubicaciones específicas. Para este tipo de problemas, es de la máxima relevancia la manera en que las inversiones generan retornos al sistema de transporte ferroviario. Por eso, este modelo está basado en el óptimo equilibrio entre la inversión y los costes de operación. El segundo modelo es un modelo combinado para evaluar de forma conjunta el reparto modal entre carretera y tren, y los flujos de mercancías en la red ferroviaria resultantes. Este modelo está enfocado hacia aquellas situaciones en que hay un modelo de utilidad aleatoria disponible, pero algunos de sus coeficientes pueden presentar una variabilidad que no debe ser ignorada. Con esta finalidad, tras la formulación inicial del modelo determinístico se presenta una versión robusta de la formulación. El modelo, formulado como un problema de programación no lineal entera, está enfocado hacia un entorno en el que conviven (y compiten) diferentes compañías ferroviarias. Se detalla un algoritmo para resolver el modelo, basado en el método de aproximaciones externas, que permite obtener soluciones precisas con un tiempo computacional razonable, tanto para la versión determinística como para la versión robusta. Ejemplos basados en una sección de la Red Trans-Europea de Transporte (TEN-T por sus siglas en inglés) permiten validar la aplicabilidad y eficacia de los modelos. El modelo de diseño puede ser una herramienta útil para analizar el impacto que las inversiones en infraestructura pueden tener en los costes de operación, teniendo en cuenta las limitaciones de capacidad que existen en los escenarios evaluados. De la misma forma, se puede complementar este análisis con el modelo combinado de reparto modal y asignación de flujos, en el que se puede comprobar la posible respuesta de las empresas que requieren transportar sus productos ante los diferentes servicios ofrecidos por las compañías ferroviarias compitiendo entre si, y compitiendo con la carretera.Estadística i investigació operativ