Architectural program of airports has evolved from being a mere transportation space into a &ldquo / city&rdquo / containing various activities along with transportation at its core. This thesis aims to discuss and criticize it, by arguing that the city and the airport are to be integrated by giving a special importance to the user (both the passenger and the inhabitant of the city). The discussion is focused on three dialectically related constituents of the program: Process, User and Product (building). Rather than the architectural design process generating the built form, process refers to the influential actors in shaping the space of airport. User refers to both the active and passive actors of the organization of space. Product denotes the space itself, transformed according to the wishes and demands of both the user and the mode of production. These constituents are accepted as significant factors in the development of the airport architectural program in a way to answer the requirements of the integration with the city. In contemporary airports, users do not have enough rights over the space to be able to show their existence against the domination of capital&#039 / s spaces. Therefore, this thesis proposes an alternative airport architectural program integrating the airport with the city by placing the user at the center.

This thesis aims to discuss the argument of exhaustion of economic globalization as an American foreign policy principle. This study argues that economic globalization is intended to restore declining American hegemony started in 1970s, but it has eventually given way to the argument of &ldquo / return of the geopolitics&rdquo / . The return of the geopolitics is an imperial, expansionist drive as a new foreign policy imperative for United States. The new developments in the international arena in the post-cold war era and especially after the September 11, 2001 brought the end of the globalization as an American project. Globalization is replaced with geopolitics in the transition period from hegemony to empire in United States foreign policy. Because there are new threats for United States in the twenty-first century such as the rise of new global actors in world politics or international competition for oil resources in the strategic regions of the world. In this framework, this study focuses on the rise of new, alternative &ldquo / great powers&rdquo / (European Union, China etc...).

Στην διπλωματική εργασία γίνεται μελέτη της κωδικοποίησης καναλιού, μελέτη των προβλημάτων που εισάγει το κανάλι, μελετώνται σε βάθος οι turbo κωδικοποιητές και διάφορα κριτήρια τερματισμού, γίνεται μελέτη της επίδρασης της πεπερασμένης ακρίβειας σε turbo συστήματα και προτείνονται αρχιτεκτονικές για την υλοποίηση των turbo αποκωδικοποιητών. / In this thesis we study the problem of channel coding, particularly we study turbo coding and termination criteria. Moreover we study the impact of fix point arithmetic on early stopping iterative turbo decoders and we proposed architectures for the implementation of turbo decoders in hardware.

El objetivo principal de este trabajo es predecir la dispersión de un flujo bifásico en el lecho de un reactor de hidrodesulfuración. Se consideran propiedades físicas constantes, sin incluir reacciones químicas ni procesos de transferencia de calor ni materia. Dos herramientas de simulación diferentes se han utilizado en este estudio. Una de ellas es el software comercial Fluent, ampliamente utilizado en el campo de la Computación en Dinámica de Fluidos, en el que se han introducido nuevos modelos de arrastre y capilaridad no incluidos en la versión comercial del software. La segunda herramienta utilizada es el código doméstico Multiphase Flow Solver, escrito en lenguaje de programación Fortran, que ha sido desarrollado durante esta tesis doctoral, constituyendo un importante objetivo de la misma. Este código incorpora los modelos necesarios para describir los procesos físicos que describen el comportamiento de este tipo de flujos multifásicos y su dispersión en medios porosos. / The main objective of this work is to predict the two-phase flow dispersion in the bed of a hydrodesulfurization reactor. Physical properties are considered to remain constant, without including chemical reactions nor heat and mass transfer processes. Two different simulation tools have been used in this study. One of them is the commercial software Fluent, widely used in the field of Computational Fluid Dynamics, in which new drag and capillarity models not included in the commercial version of the software have been implemented. The second tool used is the domestic code Multiphase Flow Solver, written in Fortran programming language, which has been developed during this doctoral thesis, being one important goal of it. This code includes the models needed to describe the physical processes which describe the behavior of this type of multiphase flows and their dispersion in porous media.

A geração de quadros de horários escolares é um problema clássico de otimização que tem sido largamente estudado devido a sua importâncias prática e teórica. O problema consiste em alocar um conjunto de aulas entre professor-turma em períodos de tempo pré-determinados, satisfazendo diferentes tipos de requisitos. Devido a natureza combinatória do problema, a resolução de instâncias médias e grandes torna-se uma tarefa desafiadora. Quando recursos são escassos, mesmo uma solução factível pode ser difícil de ser encontrada. Várias técnicas tem sido propostas na literatura científica para resolver o problema de geração de quadros de horários escolares, no entanto, métodos robustos ainda não existem. Visto que o uso de métodos exatos, como por exemplo, técnicas de programação matemática, não podem ser utilizados na prática, para resolver instâncias grandes da realidade, meta-heurísticas e meta-heurísticas híbridas são usadas com frequência como abordagens de resolução. Nesta pequisa, são desenvolvidas técnicas que combinam programação matemática e heurísticas, denominadas mateheurísticas, para resolver de maneira eficiente e robusta algumas variações de problemas de geração de quadros de horários escolares. Embora neste trabalho sejam abordados problemas encontrados no contexto de instituições brasileiras, os métodos propostos também podem ser aplicados em problemas similares oriundo de outros países. / The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of time, satisfying requirements of different types. Given the combinatorial nature of this problem, solving medium and large instances of timetabling to optimality is a challenging task. When resources are tight, it is often difficult to find even a feasible solution. Several techniques have been developed in the scientific literature to tackle the high school timetabling problem, however, robust solvers do not exist yet. Since the use of exact methods, such as mathematical programming techniques, is considered impracticable to solve large real world instances, metaheuristics and hybrid metaheuristics are the most used solution approaches. In this research we develop techniques that combine mathematical programming and heuristics, so-called matheuristics, to solve efficiently and in a robust way some variants of the high school timetabling problem. Although we pay special attention to problems arising in Brazilian institutions, the proposed methods can also be applied to problems from different countries.

A geração de quadros de horários escolares é um problema clássico de otimização que tem sido largamente estudado devido a sua importâncias prática e teórica. O problema consiste em alocar um conjunto de aulas entre professor-turma em períodos de tempo pré-determinados, satisfazendo diferentes tipos de requisitos. Devido a natureza combinatória do problema, a resolução de instâncias médias e grandes torna-se uma tarefa desafiadora. Quando recursos são escassos, mesmo uma solução factível pode ser difícil de ser encontrada. Várias técnicas tem sido propostas na literatura científica para resolver o problema de geração de quadros de horários escolares, no entanto, métodos robustos ainda não existem. Visto que o uso de métodos exatos, como por exemplo, técnicas de programação matemática, não podem ser utilizados na prática, para resolver instâncias grandes da realidade, meta-heurísticas e meta-heurísticas híbridas são usadas com frequência como abordagens de resolução. Nesta pequisa, são desenvolvidas técnicas que combinam programação matemática e heurísticas, denominadas mateheurísticas, para resolver de maneira eficiente e robusta algumas variações de problemas de geração de quadros de horários escolares. Embora neste trabalho sejam abordados problemas encontrados no contexto de instituições brasileiras, os métodos propostos também podem ser aplicados em problemas similares oriundo de outros países. / The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of time, satisfying requirements of different types. Given the combinatorial nature of this problem, solving medium and large instances of timetabling to optimality is a challenging task. When resources are tight, it is often difficult to find even a feasible solution. Several techniques have been developed in the scientific literature to tackle the high school timetabling problem, however, robust solvers do not exist yet. Since the use of exact methods, such as mathematical programming techniques, is considered impracticable to solve large real world instances, metaheuristics and hybrid metaheuristics are the most used solution approaches. In this research we develop techniques that combine mathematical programming and heuristics, so-called matheuristics, to solve efficiently and in a robust way some variants of the high school timetabling problem. Although we pay special attention to problems arising in Brazilian institutions, the proposed methods can also be applied to problems from different countries.

Although the idea of the entrepreneurial city is nothing new, recent research in contemporary urban geography and related disciplines indicates that the modus operandi of such entrepreneurial endeavors has shifted, as a result of an increasing recognition and acceptance of global climate change, to include and even prioritize sustainable urban development discourses and practices. While these discourses purportedly culminate in the production of the “sustainable city,” they often fail to deliver upon their promise to create a greener, more sustainable city for all. Such practices, in an effort to help cities obtain an urban sustainability fix (While et al. 2004), often lead to the selective uptake and implementation of “sustainable” policies and projects by local governments and members of the urban elite in their efforts to positively market their respective cities to potential residents and investors. The city of Lexington, Kentucky’s ongoing efforts to establish a new downtown park system—the Town Branch Commons—along the route of a once buried stream, is representative of how such a sustainability fix is both conceived of and ultimately produced by urban elites in the contemporary neoliberal city.

Most of previous program repair approaches are only able to generate fixes for one-line bugs, including machine learning based approaches. This work aims to reveal whether such a system with the state of the art technique is able to make useful predictions while being fed by whole source files. To verify whether multi-line bugs can be fixed using a state of the art solution a system has been created, using already existing Neural Machine Translation tools and data gathered from GitHub. The result of the finished system shows however, that the method used in this thesis is not sufficient to get satisfying results. No bug has successfully been corrected by the system. Although the results are poor there are still unexplored approaches to the project that possibly could improve the performance of the system. One way being narrowing down the input data to method level of source code instead of file level.

This thesis applies a historical approach to critical planning research to deepen the understanding of the ways in which the planning process of Stockholm Royal Seaport can be viewed as ideological. The Seaport is understood as a case study, in which sustainability is understood as a bearer of neoliberal ideology and a depoliticised concept. This study concludes more research is needed, and not the least more critical planning research which applies a historical lens to compare this case with other similar seaport projects to broaden the understanding of how planning processes and the ideology within them take shape over time. / Denna uppsats applicerar ett historiskt perspektiv till kritisk urbanforskning i syfte att fördjupa kunskapen om på vilka sätt planeringsprocessen av Norra Djurgårdsstaden kan förstås som ideologisk. Norra Djurgårdsstaden är använd som en fallstudie, där hållbarhet tolkas som en bärare av neoliberal ideologi och därmed ett depolitiserat koncept. Den här studien konstaterar att mer forskning behövs, inte minst kritisk urbanforskning som applicerar en historisk lins för att jämföra denna fallstudie med liknande sjöstäder för att öka förståelsen av hur planeringsprocesser och dess underliggande ideologi tar form över tid.

Air traffic flow management is a critical component of air transport operations because at some point in time, often very frequently, one of more of the critical resources in the air transportation network has significantly reduced capacity, resulting in congestion and delay for airlines and other entities and individuals who use the network. Typically, these “bottlenecks” are noticed at a given airport or terminal area, but they also occur in en route airspace. The two-stage combinatorial optimization framework for air traffic flow management under constrained capacity that is presented in this thesis, represents a important step towards the full consideration of the combinatorial nature of air traffic flow management decision that is often ignored or dealt with via priority-based schemes. It also illustrates the similarities between two traffic flow management problems that heretofore were considered to be quite distinct. The runway systems at major airports are highly constrained resources. From the perspective of arrivals, unnecessary delays and emissions may occur during peak periods when one or more runways at an airport are in great demand while other runways at the same airport are operating under their capacity. The primary cause of this imbalance in runway utilization is that the traffic flow into and out of the terminal areas is asymmetric (as a result of airline scheduling practices), and arrivals are typically assigned to the runway nearest the fix through which they enter the terminal areas. From the perspective of departures, delays and emissions occur because arrivals take precedence over departures with regard to the utilization of runways (despite the absence of binding safety constraints), and because arrival trajectories often include level segments that ensure “procedural separation” from arriving traffic while planes are not allowed to climb unrestricted along the most direct path to their destination. Similar to the runway systems, the terminal radar approach control facilities (TRACON) boundary fixes are also constrained resources of the terminal airspace. Because some arrival traffic from different airports merges at an arrival fix, a queue for the terminal areas generally starts to form at the arrival fix, which are caused by delays due to heavy arriving traffic streams. The arrivals must then absorb these delays by path stretching and adjusting their speed, resulting in unplanned fuel consumption. However, these delays are often not distributed evenly. As a result, some arrival fixes experience severe delays while, similar to the runway systems, the other arrival fixes might experience no delays at all. The goal of this thesis is to develop a combined optimization approach for terminal airspace flow management that assigns a TRACON boundary fix and a runway to each flight while minimizing the required fuel burn and emissions. The approach lessens the severity of terminal capacity shortage caused by and imbalance of traffic demand by shunting flights from current positions to alternate runways. This is done by considering every possible path combination. To attempt to solve the congestion of the terminal airspace at both runways and arrival fixes, this research focuses on two sequential optimizations. The fix assignments are dealt with by considering, simultaneously, the capacity constraints of fixes and runways as well as the fuel consumption and emissions of each flight. The research also develops runway assignments with runway scheduling such that the total emissions produced in the terminal area and on the airport surface are minimized. The two-stage sequential framework is also extended to en route airspace. When en route airspace loses its capacity for any reason, e.g. severe weather condition, air traffic controllers and flight operators plan flight schedules together based on the given capacity limit, thereby maximizing en route throughput and minimizing flight operators' costs. However, the current methods have limitations due to the lacks of consideration of the combinatorial nature of air traffic flow management decision. One of the initial attempts to overcome these limitations is the Collaborative Trajectory Options Program (CTOP), which will be initiated soon by the Federal Aviation Administration (FAA). The developed two-stage combinatorial optimization framework fits this CTOP perfectly from the flight operator's perspective. The first stage is used to find an optimal slot allocation for flights under satisfying the ration by schedule (RBS) algorithm of the FAA. To solve the formulated first stage problem efficiently, two different solution methodologies, a heuristic algorithm and a modified branch and bound algorithm, are presented. Then, flights are assigned to the resulting optimized slots in the second stage so as to minimize the flight operator's costs.