<p>This thesis consists of four papers in domain theory and a summary. The first two papers deal with the problem of defining effectivity for continuous cpos. The third and fourth paper present the new notion of an admissible domain representation, where a domain representation D of a space X is λ-admissible if, in principle, all other λ-based domain representations E of X can be reduced to X via a continuous function from E to D. </p><p>In Paper I we define a cartesian closed category of effective bifinite domains. We also investigate the method of inducing effectivity onto continuous cpos via projection pairs, resulting in a cartesian closed category of projections of effective bifinite domains. </p><p>In Paper II we introduce the notion of an almost algebraic basis for a continuous cpo, showing that there is a natural cartesian closed category of effective consistently complete continuous cpos with almost algebraic bases. We also generalise the notion of a complete set, used in Paper I to define the bifinite domains, and investigate what closure results that can be obtained. </p><p>In Paper III we consider admissible domain representations of topological spaces. We present a characterisation theorem of exactly when a topological space has a λ-admissible and κ-based domain representation. We also show that there is a natural cartesian closed category of countably based and countably admissible domain representations. </p><p>In Paper IV we consider admissible domain representations of convergence spaces, where a convergence space is a set X together with a convergence relation between nets on X and elements of X. We study in particular the new notion of weak κ-convergence spaces, which roughly means that the convergence relation satisfies a generalisation of the Kuratowski limit space axioms to cardinality κ. We show that the category of weak κ-convergence spaces is cartesian closed. We also show that the category of weak κ-convergence spaces that have a dense, λ-admissible, κ-continuous and α-based consistently complete domain representation is cartesian closed when α ≤ λ ≥ κ. As natural corollaries we obtain corresponding results for the associated category of weak convergence spaces.</p>

This thesis consists of four papers in domain theory and a summary. The first two papers deal with the problem of defining effectivity for continuous cpos. The third and fourth paper present the new notion of an admissible domain representation, where a domain representation D of a space X is λ-admissible if, in principle, all other λ-based domain representations E of X can be reduced to X via a continuous function from E to D. In Paper I we define a cartesian closed category of effective bifinite domains. We also investigate the method of inducing effectivity onto continuous cpos via projection pairs, resulting in a cartesian closed category of projections of effective bifinite domains. In Paper II we introduce the notion of an almost algebraic basis for a continuous cpo, showing that there is a natural cartesian closed category of effective consistently complete continuous cpos with almost algebraic bases. We also generalise the notion of a complete set, used in Paper I to define the bifinite domains, and investigate what closure results that can be obtained. In Paper III we consider admissible domain representations of topological spaces. We present a characterisation theorem of exactly when a topological space has a λ-admissible and κ-based domain representation. We also show that there is a natural cartesian closed category of countably based and countably admissible domain representations. In Paper IV we consider admissible domain representations of convergence spaces, where a convergence space is a set X together with a convergence relation between nets on X and elements of X. We study in particular the new notion of weak κ-convergence spaces, which roughly means that the convergence relation satisfies a generalisation of the Kuratowski limit space axioms to cardinality κ. We show that the category of weak κ-convergence spaces is cartesian closed. We also show that the category of weak κ-convergence spaces that have a dense, λ-admissible, κ-continuous and α-based consistently complete domain representation is cartesian closed when α ≤ λ ≥ κ. As natural corollaries we obtain corresponding results for the associated category of weak convergence spaces.

Despite the high cost of memory and CPU time required to resolve the boundary layer, a viscous unstructured grid solver has many advantages over a structured grid solver such as the convenience in automated grid generation and shock or vortex capturing by solution adaption. Since the geometry and flow phenomenon of a helicopter are very complex, unstructured grid-based methods are well-suited to model properly the rotor-fuselage interaction than the structured grid solver. In present study, an unstructured Cartesian grid solver is developed on the basis of the existing solver, NASCART-GT. Instead of cut-cell approach, immersed boundary approach is applied with ghost cell boundary condition, which increases the accuracy and minimizes unphysical fluctuations of the flow properties. The standard k-epsilon model by Launder and Spalding is employed for the turbulence modeling, and a new wall function approach is devised for the unstructured Cartesian grid solver. It is quite challenging and has never done before to apply wall function approach to immersed Cartesian grid. The difficulty lies in the inability to acquire smooth variation of y+ in the desired range due to the non-body-fitted cells near the solid wall. The wall function boundary condition developed in this work yields stable and reasonable solution within the accuracy of the turbulence model. The grid efficiency is also improved with respect to the conventional method. The turbulence modeling is validated and the efficiency of the developed boundary condition is tested in 2-D flow field around a flat plate, NACA0012 airfoil, axisymmetric hemispheroid, and rotorcraft applications. For rotor modeling, an actuator disk model is chosen, since it is efficient and is widely verified in the study of the rotor-fuselage interaction. This model considers the rotor as an infinitely thin disk, which carries pressure jump across the disk and allows flow to pass through it. The full three dimensional calculations of Euler and RANS equations are performed for the GT rotor model and ROBIN configuration to test implemented actuator disk model along with the developed turbulence modeling. Finally, the characteristics of the rotor-fuselage interaction are investigated by comparing the numerical solutions with the experiments.

This thesis discusses colouring, circular list colouring and adapted game colouring of graphs. For colouring, this thesis obtains a sufficient condition for a planar graph to be 3-colourable. Suppose G is a planar graph. Let H_G be the graph with vertex set V (H_G) = {C : C is a cycle of G with |C| ∈ {4, 6, 7}} and edge set E(H_G) = {CiCj : Ci and Cj have edges in common}. We prove that if any 3-cycles and 5-cycles are not adjacent to i-cycles for 3 ≤ i ≤ 7, and H_G is a forest, then G is 3-colourable. For circular consecutive choosability, this thesis obtains a basic relation among chcc(G), X(G) and Xc(G) for any finite graph G. We show that for any finite graph G, X(G) − 1 ≤ chcc(G) < 2 Xc(G). We also determine the value of chcc(G) for complete graphs, trees, cycles, balanced complete bipartite graphs and some complete multi-partite graphs. Upper and lower bounds for chcc(G) are given for some other classes of graphs. For adapted game chromatic number, this thesis studies the adapted game chromatic number of various classes of graphs. We prove that the maximum adapted game chromatic number of trees is 3; the maximum adapted game chromatic number of outerplanar graphs is 5; the maximum adapted game chromatic number of partial k-trees is between k + 2 and 2k + 1; and the maximum adapted game chromatic number of planar graphs is between 6 and 11. We also give upper bounds for the Cartesian product of special classes of graphs, such as the Cartesian product of partial k-trees and outerplanar graphs, or planar graphs.

Cartesian grids offer a valuable option to simulate aerodynamic flows around complex geometries such as multi-element airfoils, aircrafts, and rockets. Therefore, an adaptively-refined Cartesian grid generator and Euler solver are developed. For the mesh generation part of the algorithm, dynamic data structures are used to determine connectivity information between cells and uniform mesh is created in the domain. Marching squares and cubes algorithms are used to form interfaces of cut and split cells. Geometry-based cell adaptation is applied in the mesh generation. After obtaining appropriate mesh around input geometry, the solution is obtained using either flux vector splitting method or Roe&rsquo / s approximate Riemann solver with cell-centered approach. Least squares reconstruction of flow variables within the cell is used to determine high gradient regions of flow. Solution based adaptation method is then applied to current mesh in order to refine these regions and also coarsened regions where unnecessary small cells exist. Multistage time stepping is used with local time steps to increase the convergence rate. Also FAS multigrid technique is used in order to increase the convergence rate. It is obvious that implementation of geometry and solution based adaptations are easier for Cartesian meshes than other types of meshes. Besides, presented numerical results show the accuracy and efficiency of the algorithm by especially using geometry and solution based adaptation. Finally, Euler solutions of Cartesian grids around airfoils, projectiles and wings are compared with the experimental and numerical data available in the literature and accuracy and efficiency of the solver are verified.

A fully automated Cartesian/Quad grid generator and laminar flow solver have been developed for external flows by using C++. After defining the input geometry by nodal points, adaptively refined Cartesian grids are generated automatically. Quadtree data structure is used in order to connect the Cartesian cells to each other. In order to simulate viscous flows, body-fitted quad cells can be generated optionally. Connectivity is provided by cut and split cells such that the intersection points of Cartesian cells are used as the corners of quads at the outmost row. Geometry based adaptation methods for cut, split cells and highly curved regions are applied to the uniform mesh generated around the geometry. After obtaining a sufficient resolution in the domain, the solution is achieved with cellcentered approach by using multistage time stepping scheme. Solution based grid adaptations are carried out during the execution of the program in order to refine the regions with high gradients and obtain sufficient resolution in these regions. Moreover, multigrid technique is implemented to accelerate the convergence time significantly. Some tests are performed in order to verify and validate the accuracy and efficiency of the code for inviscid and laminar flows.

Nuclear nonproliferation research and forensics have a need for improved software solutions, particularly in the estimates of the transmutation of nuclear fuel during burnup and depletion. At the same time, parallel computers have become effectively sized to enable full core simulations using highly-detailed 3d mesh models. In this work, the capability for modeling 3d reactor models is researched with PENBURN, a burnup/depletion code that couples to the PENTRAN Parallel Sn Transport Solver and also to the Monte Carlo solver MCNP5 using the multigroup option. This research is computationally focused, but will also compare a subset of results of experimental Pressurized Water Reactor (PWR) burnup spectroscopy data available with a designated BR3 PWR burnup benchmark. Also, this research will analyze large-scale Cartesian mesh models that can be feasibly modeled for 3d burnup, as well as investigate the improvement of finite differencing schemes used in parallel discrete ordinates transport with PENTRAN, in order to optimize runtimes for full core transport simulation, and provide comparative results with Monte Carlo simulations. Also, the research will consider improvements to software that will be parallelized, further improving large model simulation using hybrid OpenMP-MPI. The core simulations that form the basis of this research, utilizing discrete ordinates methods and Monte Carlo methods to drive time and space dependent isotopic reactor production using the PENBURN code, will provide more accurate detail of fuel compositions that can benefit nuclear safety, fuel management, non-proliferation, and safeguards applications.

The dissertation addresses the negative consequences of the generally positive democratic ambition behind social planning: the good purpose may conceal less good actions. The aim is to study the thought-style of social planning and its most powerful topos, the denial of discrepancies. The focus of the dissertation is to exemplify how the denial of discrepancies and the consequences of denial become manifest. With emphasis on continuity and history, is shown how a Cartesian legacy shapes the thought-style of social planning, which is animated and upheld by the planning-collective: the integration of policy and science in planning. The planning-collective’s voice has become hegemonic through maintaining a harmony of illusions. The result is a lack of responsiveness to people’s varied modes of expression; voices that differ from the hegemonic thought-style are thus perceived as dissonance. Discrepancies in the form of differences of opinion and lack of consensus thus appear as sources of anxiety.  The mode of planning is based on a set of habitual thoughts and actions, topoi, that have become taken-for-granted. The result is an objectification of that which we call living, and the study shows through a number of examples, including “social economy”, how this form of objectification occurs. The epistemological frame of reference of the dissertation is constituted by Ludwik Fleck’s theory of thought-collectives, thought-styles and migrations of thought, and José Luis Ramírez’s action-theory, focused on language as action. Michel Foucault’s works on disciplining, political technologies, and discursive struggles are applied to create understanding of how the planning approach to representing people’s life activities has been shaped and how it influences them.

This thesis presents TransLucid, a low-level, purely declarative, intensional programming language. Built on a simple algebra and with just a small number of primitives, TransLucid programs define arbitrary dimensional infinite data structures, which are then queried to produce results. The formal foundations of TransLucid come from the work in intensional logic by Montague and Scott. The background chapters give a history of intensional logic and its predecessors in the Western world, as well as a history of intensional programming and Lucid, the first intensional programming language. The semantics of TransLucid are fully specified in the form of operational semantics. Three levels of semantics are given, in increasing order of efficiency, with the sequential warehouse semantics, the most efficient, being presented together with a proof that any expression will be evaluated by only examining relevant dimensions in the current context. The language is then extended in three important ways, by adding versioned identifiers, (declarative) side-effects and timestamped equations and demands. Adding versioned identifiers to TransLucid enriches the expressiveness of the language and allows the encoding of a variety of programming paradigms, ranging from manipulating large data-cubes to pattern-matching. Adding side-effects supports one of the main reasons for TransLucid: namely, to provide a target language, together with a methodology, for translating the main programming paradigms, thus creating a uniform end platform that can be the focus for optimisation and program verification. A translation of imperative programs into TransLucid is given. Timestamped equations and demands enable TransLucid to become a language for synchronous programming in real-time systems, as well as allowing runtime updates to a program's equations. The language TransLucid represents a decisive advance in declarative programming. It has applications in many fields of computer science and opens up exciting new avenues of research.

Submitted by Emanuel Varela Cardoso (emanuel.varela@ufcg.edu.br) on 2018-06-11T23:25:51Z No. of bitstreams: 1 RUBENS MACIEL MIRANDA PINHEIRO – TESE (PPGEP) 2017.pdf: 3597155 bytes, checksum: c7a82fbab15a4a78e7d7a4dfdee185c5 (MD5) / Made available in DSpace on 2018-06-11T23:25:51Z (GMT). No. of bitstreams: 1 RUBENS MACIEL MIRANDA PINHEIRO – TESE (PPGEP) 2017.pdf: 3597155 bytes, checksum: c7a82fbab15a4a78e7d7a4dfdee185c5 (MD5) Previous issue date: 2017-03-03 / Objetivou-se com este trabalho avaliar o processo difusivo na desidratação osmótica , seguida de secagem em estufa, de melão cortado em formato de cubo com ênfase na modelagem matemática, análises físico-química e sensorial do produto obtido. As cinéticas características do processo de desidratação osmótica e da secagem em estufa são descritas por meio de dois modelos matemáticos que usam soluções analíticas da equação de difusão, em coordenadas cartesianas, com condição de contorno de primeiro e terceiro tipo. Às soluções analíticas foram acoplados algoritmos de otimização propostos neste trabalho, escritos na linguagem FORTRAN, que se baseiam na remoção ótima de pontos experimentais, visando-se à determinação dos parâmetros termofísicos para a descrição das cinéticas de absorção de sacarose e de remoção de água do melão. Foram realizados testes comparativos entre os otimizadores desenvolvidos com os resultados obtidos por outros softwares, os quais também utilizam as condições de contorno de primeiro (Prescribed) e terceiro tipo (Convective). Esta comparação possibilitou analisar a capacidade dos otimizadores propostos de encontrar os valores ótimos nos processos de transferência de massa. Adicionalmente, os cubos de melões desidratados foram submetidos à avaliação físico-química, pelas determinações de atividade de água, acidez, pH, açucares, cinzas, cor e firmeza, bem como, a avaliação sensorial pelos testes de aceitação e intenção de compra. Os dados foram obtidos em experimentos de desidratação osmótica de melão (cortados em pedaços de 10 mm de aresta) usando soluções osmodesidratante com teor de sólidos solúveis totais de 25, 45 e 65 ºBrix . A secagem posterior foi realizada em estufa, nas temperaturas de 50, 60 e 70 ºC. Os resultados indicaram que os otimizadores propostos têm capacidade para obter os parâmetros necessários ao estudo proposto neste trabalho. Constatou-se, através dos valores obtidos para o coeficiente de transferência convectiva, número de Biot e indicadores estatísticos que a condição de contorno mais adequada para descrever o processo que rege a transferência de massa é a condição de terceiro tipo. Verificou-se, através da análise sensorial, que a amostra com maior aceitação pelos provadores foi aquela submetida a desidratação osmótica na concentração de 65 ºBrix e secagem posterior na temperatura de 50 ºC, sendo que as maiores concentrações de sacarose e temperaturas de secagem favoreceram maior remoção da água, todavia as amostras submetidas às maiores temperaturas complementares apresentaram maior escurecimento enzimático. Todas as amostras apresentaram atividades de água dentro dos valores considerados microbiologicamente seguros após a secagem em estufa. / The present study makes an assessment of the diffusive process used in osmotic dehydration of melon sliced into cubes following kiln-drying based on mathematical modeling, considering the physicochemical and sensory properties of the product. The kinetic features of both osmotic dehydration and kiln-drying are described by means of two mathematical models using the analytical solution of the diffusion equation in conjunction with Cartesian coordinates of the first and third kind boundary conditions. In the present work, optimization algorithms have been correlated to analytical solutions. These algorithms were written in FORTRAN based on the optimum removal of experimental points so as to determine the thermophysical parameters with the purpose of describingthe melon solid absorption kinetics and moisture removal.Comparative tests have been conducted between the optimizers implemented for the present study. These were based on the results obtained by other software which also uses contour conditions of the first type (Prescribed) and the third type (Convective). As a result, it waspossible to analyze the efficiency of the proposed optimizers to determine the optimal values along mass transfer processes. In addition, the dehydrated melon cubes were submitted to physicochemical evaluation, considering water activity, acidity, pH, sugars, ash, color and firmness. They were also submitted to sensory evaluati on as determined bythe acceptance tests and purchase intention.The data were obtained via experiments conducted on the osmotic dehydration of melons (cut into pieces of 10 mm) using osmodesidratant solutions with total soluble solid contents of 25, 45 and 65 ºBrix. The drying was done in an oven at temperatures of 50, 60 and 70 ºC. Results demonstrated that the proposed optimizers can provide the necessary parameters for the study proposed in the present work. It has been verified, considering the values obtained for the convective transfer coefficient, Biot number and for the statistical indicators that the most adequate contour condition to describe the process governing mass transfer is that of the third kind condition. The sensorial analysis has also revealed that the sample with the greater acceptance by the testers was the one that underwe nt osmotic dehydration ata 65 ºBrix concentration and subsequent drying at a temperature of 50 ºC, considering as well that higher concentrations of sucrose and drying temperatures favored better water removal. However, the samples submitted to higher complementary temperatures displayed greater enzymatic browning. All samples have exhibited, after oven drying, water activities within values considered microbiologically safer.