In this thesis, we will present examples of Voronoi diagrams that are not tessellations. Moreover, we will find sufficient conditions on subspaces of E2, S2 and the Poincaré disk and the sets of sites that guarantee that the Voronoi diagrams are pre-triangulations. We will also study g-spaces, which are metric spaces with ‘extendable’ geodesics joining any 2 points and give properties for a set of sites in a g-space that again guarantees that the Voronoi diagram is a pre-triangulation.

This study is concerned with how children interpret the slope of a line graph. Today with the vast accumulations of data which are available from computers, people are being faced with an ever increasing amount of pictorial representation of this data. Therefore it is of the utmost importance that children understand pictorial representation. Yet in spite of the popularity of graphs as tools of communication, studies show that many adults experience difficulty in reading information presented in a graphical form. The slope of the graph was chosen for this investigation because it is in this aspect of graphing (as shown by the results of the 1981 B.C. Assessment) that children in British Columbia seem to have the greatest difficulty when they reach Grade 8. The study dealt with positive, negative, zero and infinite slopes, combinations of these slopes, curvilinear graphs and qualitative graphs, that is, graphs that have no numerical data shown on the axes. The researcher chose to use a structured individual interview as a means of collecting data about how the students interpreted the slope of a line graph. Graphs used in the interviews dealt with temperature, height, weight and distance. Twenty-two students were chosen for this study. The students were found to have problems mainly with graphs dealing with distance related to time. This problem may be due to the fact that many students read only one axis and when interpreting distance seem to include direction as an added dimension of the graph. Infinite slope graphs were misinterpreted by every student, which may be due to the fact that they ignore the time axis. In general students used two methods of interpreting graphs. In some cases they observed the direction of the graph from left to right, that is, whether the slope went up or down from left to right. In other cases they examined the end points on the graph and drew their conclusions from them. The choice of method varied with the contextual material shown on the graph, which may be due to the children's concept of the parameter in the physical world and whether they see the parameter as being able to increase and decrease over time. From the study the investigator feels that more discussion of graphing by teachers and students is needed if the misconceptions are to be cleared up. Discussion of the parameters of both axes by teachers might help clear up the misconceptions students have about distance travelled over a period of time when this is expressed as a graph. There would be less chance of a graph being read as a map if the relationships between the two axes were demonstrated to students. Teachers also need to be aware of both methods used by students in interpreting graphs. / Education, Faculty of / Graduate

Orientador: Mario de Jesus Mendes / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Quimica / Made available in DSpace on 2018-08-07T19:04:30Z (GMT). No. of bitstreams: 1 Schmitz_JonesErni_D.pdf: 1427141 bytes, checksum: 5c994ce371331fd4c3ac0f3e3861f49b (MD5) Previous issue date: 2006 / Resumo: A simulação de processos é um componente fundamental de uma grande variedade de atividades de Engenharia de Processos, tais como a Otimização Online, o controle em Tempo Real, a Identificação, etc. O cálculo de Equilíbrio de Fases é uma atividade fundamental em qualquer simulação de processos de separação. O elevado tempo computacional deste cálculo provocado pela sua natureza iterativa pode criar incompatibilidades entre a atividade de simulação e as aplicações em tempo real que ela integra. O objetivo deste trabalho foi desenvolver um método alternativo simples, mas suficientemente preciso, para realizar os cálculos de equilíbrio de fases na simulação de processos de separação de sistemas complexos. Entende-se por tal, sistemas que apresentam problemas de Equilíbrio Líquido-Líquido e de Equilíbrio Líquido-Líquido-Vapor, como é o caso dos que possuem um Azeótropo Heterogêneo. Pelas suas propriedades, as Redes Neurais Artificiais surgem naturalmente como candidatas alternativas para esta tarefa. Como objeto de aplicação foram escolhidos dois sistemas que apresentam um azeótropo heterogêneo, o sistema binário acetato de etila - água e o sistema ternário etanol - acetato de etila - água. Para gerar os dados usados no treinamento das redes foi implementado um método convencional de cálculo de equilíbrio de fases, adequado à complexidade dos sistemas escolhidos, o método de Pham & Doherty. Para a resolução do problema da estabilidade de fases, a primeira etapa do cálculo do equilíbrio de fases, foram testados dois tipos de redes neurais artificiais (RNAs), as Redes Neurais Artificiais Probabilísticas (RNAPs) e os Perceptrons. Com os perceptrons foram encontradas dificuldades para atingir a precisão desejada, sendo necessário recorrer a perceptrons com várias camadas escondidas. Já as RNAPs apresentaram uma excelente precisão, embora a sua simulação seja mais lenta. Perceptrons simples de uma só camada escondida foram usados com êxito na solução da segunda etapa do cálculo de equilíbrio de fases, o problema da divisão de fases. Combinando as redes desenvolvidas para cada uma das etapas foi criada uma ferramenta que permite resolver qualquer problema de equilíbrio de fases para os sistemas estudados. A precisão dos resultados fornecidos pelas redes neurais é comparável à dos apresentados pelos métodos tradicionais, mas os cálculos do equilíbrio de fases feitos usando redes neurais foram mais rápidos. Pode-se concluir que as redes neurais artificiais constituem uma alternativa válida aos métodos tradicionais do cálculo do equilíbrio de fases baseados em equações de estado para sistemas complexos como os avaliados / Abstract: Process simulation is a basic component of different Process Engineering activities such as On-line Optimization, Model Predictive Control, Identification, etc. The calculation of Phase Equilibrium appears as a fundamental task in any simulation of a separation process. However, the high computational time due to the iterative nature of this calculation makes it oft unsuitable for use with real time process analysis and synthesis strategies. The objective of this work is to develop a simple but accurate method to perform the phase equilibrium calculations required to the study of the behavior of complex systems. As such we mind those systems who present liquid-liquid and vapor-liquid-liquid phase equilibrium problems, such as systems with a heterogeneous azeotrope do. Given their inherent ability to learn and recognize non-linear and highly complex relationships, artificial neural networks (ANNs) appear to be well suited for such a task. Two chemical systems, the binary ethyl acetate ¿ water and the ternary ethanol ¿ ethyl acetate ¿ water were chosen; both systems present a miscibility gap and a heterogeneous azeotrope. The data sets used to train the ANNs were computed using the method of Pham & Doherty. Two kinds of neural networks were tried to solve the phase stability problem, namely the probabilistic neural networks (PNNs) and the perceptrons. In order to attain an acceptable precision perceptrons had to be trained with several hidden layers. Even though, PNNs got slightly better results than the perceptrons. Simple perceptrons were able to deliver the required precision when trained to predict the compositions of phases in equilibrium. Coupling the ANNs trained for phase stability with those trained for phase division a tool was obtained that can solve any phase equilibrium problem for the two chosen systems. Predictions made with the use of neural networks were faster than those made using the traditional methods, and delivered comparable precision / Doutorado / Sistemas de Processos Quimicos e Informatica / Doutor em Engenharia Química

Magister Commercii - MCom / This research project focuses on the application of process improvement techniques in a clothing manufacturer to address delay problems in workflow in the factory. The objective of the research is threefold; investigate delays at the beginning of production and make suggestions, show the usefulness of continuous improvement techniques in improving activities in a clothing manufacturer and demonstrate how action research can be used in doing research in production and operation management. Using tools such as flow charts, check sheets, pareto analysis, fishbone diagrams, interviews and the "ask why five times" tool, an investigation into delays led to a second investigation into sewing defects. This established that these sewing defects are caused mainly by time constraints, the malfunctioning of machines, the wrong handling of garments, and previous operations. After an investigation using the above tools it was established that these defects could be addressed by setting realistic targets, doing regular maintenance on machines, cautioning operators to be more careful during their operations, and encouraging regular checks on garments before the next operation. The action learning methodology led to the following lessons; selecting a correct measuring tool is important, that not all tools need to be used, and that it takes time to do a research project using this method.

To any Frobenius superalgebra A we associate an oriented Frobenius Brauer category and an affine oriented Frobenius Brauer categeory. We define natural actions of these categories on categories of supermodules for general linear Lie superalgebras gl_m|n(A) with entries in A. These actions generalize those on module categories for general linear Lie superalgebras and queer Lie superalgebras, which correspond to the cases where A is the ground field and the two-dimensional Clifford superalgebra, respectively. We include background on monoidal supercategories and Frobenius superalgebras and discuss some possible further directions.

Cette thèse étudie la confluence des systèmes de récriture en l'absence de propriété de terminaison, pour des applications aux langages fonctionnels de premier ordre comme MAUDE, ou aux langages d'ordre supérieur comportant des types dépendants, comme Dedukti. Dans le premier cas, les calculs opérant sur des structures de données infinies ne terminent pas. Dans le second, les calculs non typés ne terminent pas à cause de la beta-réduction. Dans le cas où les calculs terminent, la confluence se réduit à celle des pics critiques, divergences minimales du calcul, obtenues à partir d'un terme médian appellé superposition qui se récrit de deux manière différentes en une paire de termes appellée critique. Dans le cas où les calculs ne terminent pas, le résultat majeur est que les calculs définis par des règles linéaires à gauche et sans paires critiques confluent. Il s'agit donc d'étendre ce résultat aux systèmes dont les règles peuvent être non-linéaires à gauche et avoir des paires critiques.L'étude la confluence est faite à partir de la méthode des diagrammes décroissants, qui généralise les techniques utilisées antérieurement aussi bien pour des calculs qui terminent que pour des calculs qui ne terminent pas. Cette technique est abstraite, en ce sens qu'elle s'applique à des relations arbitraires opérant sur un ensemble abstrait. Elle consiste à équipper chaque étape de calcul d'un label pris dans un ensemble bien fondé. Un pic de calcul, composé d'un terme se récrivant de deux manières différentes, possède un diagramme décroissant lorsque ses extémités peuvent se récrire en un terme commun avec des étapes de calcul satisfaisant des conditions de comparaison avec les labels du pic. La force de cette technique est sa complétude, c-a-d que toute relation confluente peut-être équippée d'un système de labels (par des entiers) pour lequel tous ses pics possèdent des diagrammes décroissants. Ce résultat est basé sur un théorème assez ancien de Klop, qui définit pour les systèmes non-terminant, uneespèce de forme normale sous la forme d'une suite infinie de récritures élémentaires, appellée "dérivation cofinale".Dans une première partie, nous révisitons les résultats de van Oostrom, et en proposons une preuve différente dans le but de les généraliser au cas des calculs dits "modulo", c-a-d dans des quotients, qui mèlent des règles et deséquations. Cette généralisation inclue la complétude, en faisant intervenir une généralisation de lanotion de dérivation cofinale dans le cas des calculs cohérents au sens de Jouannaud et Kirchner.La second partie de la thèse applique le théorème de van Oostrom et sa généralisation à des système (concrets) de récriture de termes, ainsi qu'à plusieurs priblèmes ouverts du domaine. L'application récente à des problèmes d'ordre supérieur tirés de la théorie des types dépendants ne fait pas partie de la thèse. / This thesis is devoted to the confluence of rewrite systems in the absence of termination, for applications in first-order functional languages like MAUDE or higher-order languages with dependent types, as Dedukti. In the first case, the computations on infinite data structures do not terminate, while in the second case, untyped computations do not terminate because of beta-reduction. In the case where the computations terminate, confluence is reduced to that of critical peaks, the "minimal diverging computations", made of a minimal middle term called "overlap" which computes in two different ways, resulting in a so-called "critical pair". In the case of non-terminating computations, a main result is that left-linear rewrite rules that have no critical pairs are always confluent. This suggests that the notion of critical pairs plays a key role there too, but a general understanding of the confluence of non-terminating computations in terms of critical pairs is still missing.Our investigation of confluence is based on the decreasing diagrams method due to van Oostrom, which generalizes the techniques used previously for both terminating and non-terminating computations. The method is abstract in the sense that it applies to arbitrary relations on an abstract set. It equips each step of computations with a label taken from a well-founded set. A diverging computation, called peak, has a decreasing diagram if its extremities can be joined by steps whose direction and labels satisfy some constraints with respect to the peak's rewrites and labels. The strength of this technique is its completeness, that is, any confluent relation can be equipped with a well-founded set of labels such that all peaks have decreasing diagrams. The proof of completeness is based on Klop's notion of cofinal derivations, which is an infinite derivation playing the role of a normal form when computations do not terminate.In the first part, we revise the results of van Oostrom, and propose an alternative proof that extends the method to the "modulo" case, in which computations mix rewrite steps and equational steps. The completeness result is extended as well, via a generalization of cofinal derivations and the notion of strong coherence due to Jouannaud and Kirchner.The second part of the thesis applies the decreasing diagrams method and its generalization to concrete systems rewriting terms, as well as to several open problems. The recent application to the problems of higher-order computations in dependent type theory is not part of the thesis.

The variety of platforms for describing models of discrete event systems brings about the problem of how these models should be represented in order to be easily shared across platforms (shared for the purposes of model validation, effective execution, model reusing,  or model integration). This study develops and implements the language DEVSML for the representation of the DEVS models. For the description of these models components, I use state diagrams, which are represented by SCXML. Actions and guards of the state diagrams are described using the language Scheme. This study also presents a visual tool for creation of the state diagrams, which is incorporated in the SmallDEVS system. For the Adevs environment, a transformer of the models described by DEVSML is implemented.

京都大学 / 0048 / 新制・課程博士 / 博士(工学) / 甲第21103号 / 工博第4467号 / 新制||工||1694(附属図書館) / 京都大学大学院工学研究科材料工学専攻 / (主査)教授 田中 功, 教授 中村 裕之, 准教授 弓削 是貴 / 学位規則第4条第1項該当 / Doctor of Philosophy (Engineering) / Kyoto University / DFAM

京都大学 / 0048 / 新制・課程博士 / 博士(文学) / 甲第21491号 / 文博第796号 / 新制||文||672(附属図書館) / 京都大学大学院文学研究科行動文化学専攻 / (主査)教授 蘆田 宏, 教授 Anderson James Russell, 教授 Emmanuel MANALO / 学位規則第4条第1項該当 / Doctor of Letters / Kyoto University / DGAM

No description available.