Spelling suggestions: "subject:"abstraction"" "subject:"obstraction""
81 |
Validation de modèles de simulation / Validation of simulation modelsFoures, Damien 26 June 2015 (has links)
Ce travail de thèse s'est intéressé à la validité des modèles de simulation dans le cadre du développement des systèmes complexes et critiques. Une analyse de l'approche d'ingénierie système, et plus particulièrement de l'aspect modélisation et simulation, a permis de constater qu'il est impossible d'établir de façon directe la validité du modèle de simulation. De nombreux points sont à l'origine de cette impossibilité, comme une mauvaise formulation des objectifs de simulation, une incohérence implémentatoire, les limites du moteur de simulation, etc. La validité d'un modèle de simulation étant définie pour un objectif de simulation, il est apparu important de proposer une approche globale de la M&S, associant un ensemble d'outils capables de détecter des incohérences entre les objectifs de simulation et les modèles du système d'intérêt. Ces outils, à destination de l'utilisateur de la simulation, permettent l'amélioration du niveau de confiance dans le modèle de simulation et donc dans les résultats de simulation. Notre étude se base sur la théorie de la M&S telle que proposée par B.P. Zeigler. En considérant le concept de cadre expérimental qui y est introduit, nous avons pu proposer un cadre méthodologique capable d'exprimer les objectifs de simulation de manière claire. Ce cadre méthodologique nous permet d'étudier les problématiques d'application et d'accommodation de la M& S que nous regroupons sous la problématique de compatibilité. Ainsi, notre premier objectif a été de proposer une approche capable de mesurer l'incohérence entre les objectifs de simulation et le modèle du système. En s'appuyant sur les méthodes formelles et la théorie des automates, nous avons établi un ensemble de métriques capables de mesurer le degré de compatibilité dynamique entre cadre expérimental et modèle du système d'intérêt. Pour cela, nous étudions en premier lieu la compatibilité dynamique entre automates à interface en utilisant la décomposition en arbre. Montrant les limites d'une telle approche, nous sommes passé à l'étude de la compatibilité entre modèles DEVS en utilisant la génération de graphes de classe, autrement appelés graphes d'atteignabilité. Cette étude formelle de la compatibilité nous permet de proposer un ensemble de bonnes propriétés de la simulation. Nous proposons finalement une méthodologie qui permet de guider l'utilisateur de la simulation dans l'élaboration de métriques permettant de mesurer ce niveau de compatibilité. S'appuyant sur les concepts de l'ingénierie dirigée par les modèles, nous proposons un langage dédié à la simulation permettant de guider l'utilisateur de la simulation dans l'évaluation de la validité des modèles de simulation. / This work is focused on the validity of simulation models during development of complex and critical systems. The analysis of the system engineering approach and, especially the modeling and simulation aspect, showed that it was impossible to directly determine simulation models validity. Many aspects can cause this unattainability, such as bad formulation of simulation objectives, implementation inconsistency, limits of the simulation engine, etc. The validity of a simulation model being defined for a specific simulation goal, it seemed important to provide a global M&S approach, combining a set of tools to detect inconsistencies between objectives and models of the system under test. These tools, dedicated to the simulation user, allow to improve confidence level of the simulation model and thus in simulation results. Our study is based on the M& S theory as proposed by B.P. Zeigler. Using the concept of experimental frame, we are able to propose a methodological framework to express simulation objectives clearly. This allows us to study applicability and accommodation, witch we grouped under compatibility issue. Thus, our first objective was to propose an approach able to measure inconsistencies between experimental frame and model of the system. Based on formal methods and automata theory, we propose a set of metrics that measure the degree of dynamic compatibility between experimental frame and model system of interest. For this, we firstly study the dynamic compatibility between interface automata using tree decomposition. Showing limits of this approach, we studied compatibility between DEVS models using reachability graphs analysis. This formal study of the compatibility help us to propose a set of good properties of the simulation. Finally, we propose a methodology to guide the simulation user in metrics development to measure the compatibility level. Based on model-driven engineering approach, we propose a simulation dedicated language, to help users to asses the validity of simulation models.
|
82 |
All Things Being Equal.Bell, Jessica January 2015 (has links)
Jessica Bell’s MFA thesis exhibition, All things being equal., presents the very idea of constructing a painting as a way of making sense of the world. Simple materials and formal devices make allusions to ordinary events and experiences. The works bear the marks of incidental studio occurrences, which conjure a conversation between the will of objects and the artist’s intention to activate them. Canvas and stretchers appear like characters, assuming the posture of active participants instead of subservient structure. The pieces engage with and resonate in one another, emphasizing the temporal relationship with the physical space. The forms are deliberately abstract and minimal, drawing our attention to subtle differences in the surfaces of material, gentle play with volume and light, and the quiet passage of time.
All things being equal. was exhibited at the Ottawa Art Gallery’s Firestone Gallery in Ottawa from August 21 through September 13, 2015.
|
83 |
Seven dreams in colorIsaak, Sophia 01 May 2018 (has links)
Years ago, my mother choreographed a dance entitled "Seven Dreams in Color", a seven-act dance wherein each act relayed a memory of her childhood. These memories were colored by her individual experience and often seemed warped to her, as if having been filtered through a dream. I seek to recontextualize these dreams through my own lens as a way of honoring my mother's history and my own memories. Each work functions, through color and composition, as a separate act and embodies a non-linear memory. I utilize painting, drawing and printmaking to harness dichotomous visual elements in order to convey scenes as tumultuous as both the world around me and my own shifting moods. Abrupt changes of atmosphere are of particular interest to me. I portray this shift through the visual disruptions of cropping imagery, color or medium shifts, and scale changes. Graphic schisms take my work to an unpredictable conclusion while confounding the viewer. My work reveals my desperation and need to translate all of the conflict, battles and resolutions that I observe.
|
84 |
The Abstraction Problem: An Analysis of Early Science Learning Standards and ResearchOcasio, Ana 25 May 2022 (has links)
No description available.
|
85 |
On a hot summer day, with an open blue sky, Lookout Mountain was doing all of its looking at me, and together, we gave my lawn a haircut with small rounded scissors and quiet consoling.Parrett, Hannah Kay 06 October 2020 (has links)
No description available.
|
86 |
On a hot summer day, with an open blue sky, Lookout Mountain was doing all of its looking atme, and together, we gave my lawn a haircut with small rounded scissors and quiet consoling.Parrett, Hannah Kay January 2020 (has links)
No description available.
|
87 |
Paying Attention to What Matters: Observation Abstraction in Partially Observable EnvironmentsWolfe, Alicia Peregrin 01 February 2010 (has links)
Autonomous agents may not have access to complete information about the state of the environment. For example, a robot soccer player may only be able to estimate the locations of other players not in the scope of its sensors. However, even though all the information needed for ideal decision making cannot be sensed, all that is sensed is usually not needed. The noise and motion of spectators, for example, can be ignored in order to focus on the game field. Standard formulations do not consider this situation, assuming that all the can be sensed must be included in any useful abstraction. This dissertation extends the Markov Decision Process Homomorphism framework (Ravindran, 2004) to partially observable domains, focusing specically on reducing Partially Observable Markov Decision Processes (POMDPs) when the model is known. This involves ignoring aspects of the observation function which are irrelevant to a particular task. Abstraction is particularly important in partially observable domains, as it enables the formation of a smaller domain model and thus more efficient use of the observed features.
|
88 |
Synthesis of Heterocycles Via Free Radical CyclizationKunka, Cheryl P. A. 03 1900 (has links)
<p> Aryl radical ring closures onto the azo functional group were investigated. A series of ortho-substituted aryl radicals (83a-f) have been generated by bromine abstraction from the corresponding 1-(orthobromophenyl)-1-methoxy-azoethanes (82a-f) by tributyltin radicals. The radicals generated underwent cyclization in the 5-endo sense, to ultimately afford the substituted indazoles (86a-f). There was also some evidence for cyclization to the other azo nitrogen (closure in the 4-exo sense) to form a 4-membered ring. The aryl radical also underwent hydrogen atom abstraction from tributyltin hydride in competition with cyclization. Since the rate constant for hydrogen atom abstraction from tributyltin hydride by aryl radicals is known, this makes it possible to estimate the rate constants for cyclization throughout the series.</p> / Thesis / Master of Science (MSc)
|
89 |
Agent abstraction in multi-agent reinforcement learningMemarian, Amin 06 1900 (has links)
Cette thèse est organisée en deux chapitres. Le premier chapitre sert d’introduction aux concepts et idées utilisés dans le deuxième chapitre (l’article).
Le premier chapitre est divisé en trois sections. Dans la première section, nous introduisons l’apprentissage par renforcement en tant que paradigme d’apprentissage automatique et montrons comment ses problèmes sont formalisés à l’aide de processus décisionnels de Markov. Nous formalisons les buts sous forme de rendements attendus et montrons comment les équations de Bellman utilisent la formulation récursive du rendement pour établir une relation entre les valeurs de deux états successifs sous la politique de l’agent. Après cela, nous soutenons que la résolution des équations d’optimalité de Bellman est insoluble et introduisons des algorithmes basés sur des valeurs tels que la programmation dynamique, les méthodes de Monte Carlo et les méthodes de différence temporelle qui se rapprochent de la solution optimale à l’aide de l’itération de politique généralisée. L’approximation de fonctions est ensuite proposée comme moyen de traiter les grands espaces d’états. Nous discutons également de la manière dont les méthodes basées sur les politiques optimisent directement la politique sans optimiser la fonction de valeur. Dans la deuxième section, nous introduisons les jeux de Markov comme une extension des processus décisionnels de Markov pour plusieurs agents. Nous couvrons les différents cadres formés par les différentes structures de récompense et donnons les dilemmes sociaux séquentiels comme exemple du cadre d’incitation mixte. En fin de compte, nous introduisons différentes structures d’information telles que l’apprentissage centralisé qui peuvent aider à faire face à la non-stationnarité in- duite par l’adversaire. Enfin, dans la troisième section, nous donnons un bref aperçu des types d’abstraction d’état et introduisons les métriques de bisimulation comme un concept inspiré de l’abstraction de non-pertinence du modèle qui mesure la similarité entre les états.
Dans le deuxième chapitre (l’article), nous approfondissons finalement l’abstraction d’agent en tant que métrique de bisimulation et dérivons un facteur de compression que nous pouvons appliquer à la diplomatie pour révéler l’agence supérieure sur les unités de joueur. / This thesis is organized into two chapters. The first chapter serves as an introduction to the concepts and ideas used in the second chapter (the article).
The first chapter is divided into three sections. In the first section, we introduce Reinforcement Learning as a Machine Learning paradigm and show how its problems are formalized using Markov Decision Processes. We formalize goals as expected returns and show how the Bellman equations use the recursive formulation of return to establish a relation between the values of two successive states under the agent’s policy. After that, we argue that solving the Bellman optimality equations is intractable and introduce value-based algorithms such as Dynamic Programming, Monte Carlo methods, and Temporal Difference methods that approximate the optimal solution using Generalized Policy Iteration. Function approximation is then proposed as a way of dealing with large state spaces. We also discuss how policy-based methods optimize the policy directly without optimizing the value function. In the second section, we introduce Markov Games as an extension of Markov Decision Processes for multiple agents. We cover the different settings formed by the different reward structures and give Sequential Social Dilemmas as an example of the mixed-incentive setting. In the end, we introduce different information structures such as centralized learning that can help deal with the opponent-induced non-stationarity. Finally, in the third section, we give a brief overview of state abstraction types and introduce bisimulation metrics as a concept inspired by model-irrelevance abstraction that measures the similarity between states.
In the second chapter (the article), we ultimately delve into agent abstraction as a bisimulation metric and derive a compression factor that we can apply to Diplomacy to reveal the higher agency over the player units.
|
90 |
This Is A Book. This Is Not A BookBaker, Darren J. 20 July 2012 (has links)
No description available.
|
Page generated in 0.0625 seconds