Dissertations / Theses on the topic 'Goal-oriented'
To see the other types of publications on this topic, follow the link: Goal-oriented.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Goal-oriented.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Chau, Man Ping Grace. "Goal-oriented hardware design." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45853.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.Includes bibliographical references (p. 145-146).
This thesis presents Fide, a hardware design system that uses Goal-oriented programming. Goal-oriented programming is a programming framework to specify open-ended decision logic. This approach relies on two fundamental concepts-Goals and Techniques. Goals encode decision points and Techniques are scripts that describe how to satisfy Goals. In Fide, Goals represent the functional requirements (e.g., addition of two 32-bit binary integers) of the target circuit. Techniques represent hardware implementation alternatives that fulfill the functions. Techniques may declare their own subgoals, allowing a hierarchical decomposition of the functions. A Planner selects among Techniques based on the Goals declared to generate an implementation of the target circuit automatically. Users' preferences can be added to generate circuits for different scenarios: for different hardware environments, under different circuit constraints, or different implementation criteria etc. A Beta processor is implemented using Fide. The quality of the implementation is comparable to those optimized manually.
by Man Ping Grace Chau.
S.M.
2
Williamson, Victor Lamont. "Goal-oriented Web search." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/61247.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 57-58).
We have designed and implemented a Goal-oriented Web application to search videos, images, and news by querying YouTube, Truveo, Google and Yahoo search services. The Planner module decomposes functionality in Goals and Techniques. Goals declare searches for specific types of content and Techniques query the various Web services. We choose which Web service has the best rating at runtime and return the winning results. Users weight their preferred Web services and declare a repository of their own Techniques to upload and execute.
by Victor Lamont Williamson.
M.Eng.
3
Berg, Emanuel. "Goal-Oriented Collision-Free Schedule." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-198097.
Full textAbstract:
The education of to-be physicians at Akademiska sjukhuset, Uppsala, includes practical services. The students are divided into groups that each has its own goals. The goals specify (1) what services that group's students should perform, and (2) for each service, a minimum number of times each student should attend that service. It is only possible to perform any service at certain occasions: each occasion offers slots, to be filled by students. The occasions make up a calendar. The challenge is to distribute the students over the calendar, so that the goal isa chieved for each student and service. No occasion is overpopulated, and no student is due to attend two (or more) occasions that collide in time. The algorithm to solve this sets up a table with occasions (expanded horizontally by their number of slots) as the x-axis, and dates (expanded vertically by two: the day parts) as the y-axis. Then, distribution of students is done top-down, left-right. Collision is avoided by having students only appear once per row. Overpopulation won't happen as the allocation of students is done explicitly to slots, not to occasionsin general. MS Access forms make up the UI. My thoughts when I set them up was that each form should boil down to a single purpose, but include everything to fulfill that purpose (and nothing else). Also, I setup an intuitive flow of movements between forms, and I made an effort to setup mnemonic shortcuts (and tab chains) as to minimize mouse use
4
Baumslag, David J. H. "A goal-oriented theory of science." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq24524.pdf.
Full text
5
Materna, Daniel. "Goal-oriented recovery bei nichtlinearen Scheibenproblemen." Kassel Univ.-Bibliothek, 2006. https://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2006111515696.
Full text
6
Heidrich, Jens. "Goal-oriented quantitative software project control." Stuttgart Fraunhofer-IRB-Verl, 2008. http://d-nb.info/993138713/04.
Full text
7
Li, Harriet. "Model adaptivity for goal-oriented inference." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101440.
Full textAbstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2015.Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 47-49).
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
In scientific and engineering contexts, physical systems are represented by mathematical models, characterized by a set of parameters. The inverse problem arises when the parameters are unknown and one tries to infer these parameters based on observations. Solving the inverse problem can require many model simulations, which may be expensive for complex models; multiple models of varying fidelity and complexity may be available to describe the physical system. However, inferring the parameters may only be an intermediate step, and what is ultimately desired may be a low-dimensional Quantity of Interest (QoI); we refer to this as the goal-oriented inverse problem. We present a novel algorithm for solving the goal-oriented inverse problem, which allows one to manage the fidelity of modeling choices while solving the inverse problem. We formulate a hierarchy of models, and assume that the QoI obtained by inferring the parameters with the highest-fidelity model is the most accurate QoI. We derive an estimate for the error in the QoI from inferring the parameters using a lower-fidelity model instead of the highest-fidelity model. This estimate can be localized to individual elements of a discretized domain, and this element-wise decomposition can then be used to adaptively form mixed-fidelity models. These mixed-fidelity models can be used to infer the parameters, while controlling the error in the QoI. We demonstrate the method with two pairs of steady-state models in 2D. In one pair, the models differ in the physics included; in the other pair, the models differ in the space to which the parameters belong. In both cases, we are able to obtain a QoI estimate with a small relative error without having to solve the inverse problem with the high-fidelity model. We also demonstrate a case where solving the inverse problem with the high-fidelity model requires a more complex algorithm, but where our method gives a mixed-fidelity model with which we can infer parameters using a simple Newton solver, while achieving a low error in the QoI.
by Harriet Li.
S.M.
8
Nilsson, Björn, and John Linder. "Sport Structure and Goal Oriented Motivation." Thesis, Umeå universitet, Institutionen för psykologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-167443.
Full textAbstract:
The aim of this study was to assess differences in goal orientation between athletes practicing two different sports. These sports differ structurally in how they are performed and in regard to factors influencing goal orientation. The achievement goal theory (AGT) states that individuals’ motivational orientation is made up of two aspects, task oriented motivation and ego oriented motivation. These two goal orientations are independent of one another and are affected by several factors. The effect on goal orientation by factors influenced by coaches, parents and peers is well documented. The two hypotheses were that climbers would be more task-oriented than squash players and secondly that squash players would be more ego-oriented than climbers. The study was conducted as a quasi-experimental between group comparison. 81 sport practitioners, 43 rock climbers and 38 squash players, took the Task and Ego in Sport Questionnaire (TEOSQ) in connection with performing their sport. Independent t-tests of both sub scales showed a difference in ego-motivation between groups, but not in task-motivation.Syftet med den här studien var fastställa skillnader i målorientering mellan idrottare som utför olika sporter. Dessa sporter skiljer sig strukturellt i utförande och i avseende av faktorer som påverkar målorientering. Målorienteringsteorin (AGT) säger att individers målorientering består av två aspekter, uppgiftsorienterad motivation och egoorienterad motivation. Dessa två orienteringar är oberoende av varandra och påverkas av flera olika faktorer. Effekten på målorientering av faktorer som påverkas av tränare, föräldrar och kamrater är väldokumenterad. Den första hypotesen var att klättrare är mer uppgifts-orienterade än vad squashspelare är och den andra att squashspelare är mer egoorienterade än vad klättrare är. Studien utfördes som en kvasiexperimentell mellangruppsjämförelse. 81 idrottare, 43 klättrare och 38 squashspelare fyllde i formuläret Task and Ego in Sport Questionnaire (TEOSQ) i samband med sin träning. Oberoende t-test visade en skillnad i ego-motivation, men inte i uppgifts-motivation mellan grupperna.
9
Abid, Muhammad Rizwan. "UML profile for goal-oriented modelling." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27616.
Full textAbstract:
The Unified Modeling Language (UML) is a standard for visual modelling. We can design abstract models by using its elements. Although the semantic scope of UML elements is very broad, it does not fully address the needs of some modelling domains, including the modelling of goals and non-functional requirements (NFR). To address this problem, UML allows the customization of its metamodel with an extension mechanism called UML profile.
Some work has already been done in the area of UML profiles for NFR and goals. In some cases, the proposed solutions were incorrectly or only partially integrated with UML. Sometimes, the profiles were based on metamodels whose nature and accuracy for this domain were unclear. In other cases, the profiling approaches taken were not well supported by tools, which have led to unsatisfactory solutions.
In this thesis, we propose a UML profile for the Goal-oriented Requirement Language (GRL), a goal/NFR notation undergoing standardization at the International Telecommunication Union. Our profile is based on an abstract metamodel of GRL, which has already been successfully tested and implemented in non-UML tools. This profile is also implemented in a UML 2 tool, namely Telelogic G2 4.0, and is well integrated with the rest of UML. Challenges and design decisions for the concrete support of this profile with tools are discussed along the way. The profiling approach used in this thesis is one that has been recommended by modellers and standards developers. Our profile for goal-oriented modelling is also illustrated and validated with several examples.
10
Nagel, Benjamin [Verfasser]. "Goal-oriented business process engineering / Benjamin Nagel." Paderborn : Universitätsbibliothek, 2015. http://d-nb.info/1072463091/34.
Full text
11
Ayala, Martínez Claudia Patricia. "Systematic construction of goal-oriented COTS taxonomies." Doctoral thesis, Universitat Politècnica de Catalunya, 2008. http://hdl.handle.net/10803/6653.
Full textAbstract:
El proceso de construir software a partir del ensamblaje e integración de soluciones de software pre-fabricadas, conocidas como componentes COTS (Comercial-Off-The-Shelf) se ha convertido en una necesidad estratégica en una amplia variedad de áreas de aplicación. En general, los componentes COTS son componentes de software que proveen una funcionalidad específica, que están disponibles en el mercado para ser adquiridos e integrados dentro de otros sistemas de software. Los beneficios potenciales de esta tecnología son principalmente la reducción de costes y el acortamiento del tiempo de desarrollo, a la vez que fomenta la calidad. Sin embargo, numerosos retos que van desde problemas técnicos y legales deben ser afrontados para adaptar las actividades tradicionales de ingeniería de software para explotar los beneficios del uso de COTS para el desarrollo de sistemas.Actualmente, existe un incrementalmente enorme mercado de componentes COTS; así, una de las actividades más críticas en el desarrollo de sistemas basados en COTS es la selección de componentes que deben ser integrados en el sistema a desarrollar. La selección está básicamente compuesta de dos procesos principales: La búsqueda de componentes candidatos en el mercado y su posterior evaluación con respecto a los requisitos del sistema. Desafortunadamente, la mayoría de los métodos existentes para seleccionar COTS, se enfocan en el proceso de evaluación, dejando de lado el problema de buscar los componentes en el mercado. La búsqueda de componentes en el mercado no es una tarea trivial, teniendo que afrontar varias características del mercado de COTS, tales como su naturaleza dispersa y siempre creciente, cambio y evolución constante; en este contexto, la obtención de información de calidad acerca de los componentes no es una tarea fácil. Como consecuencia, el proceso de selección de COTS se ve seriamente dañado. Además, las alternativas tradicionales de reuso también carecen de soluciones apropiadas para reusar componentes COTS y el conocimiento adquirido en cada proceso de selección. Esta carencia de propuestas es un problema muy serio que incrementa los riesgos de los proyectos de selección de COTS, además de hacerlos ineficientes y altamente costosos. Esta disertación presenta el método GOThIC (Goal- Oriented Taxonomy and reuse Infrastructure Construction) enfocado a la construcción de infraestructuras de reuso para facilitar la búsqueda y reuso de componentes COTS. El método está basado en el uso de objetivos para construir taxonomías abstractas, bien fundamentadas y estables para lidiar con las características del mercado de COTS. Los nodos de las taxonomías son caracterizados por objetivos, sus relaciones son declaradas como dependencias y varios artefactos son construidos y gestionados para promover la reusabilidad y lidiar con la evolución constante.El método GOThIC ha sido elaborado a través de un proceso iterativo de investigación-acción para identificar los retos reales relacionados con el proceso de búsqueda de COTS. Posteriormente, las soluciones posibles fueron evaluadas e implementadas en varios casos de estudio en el ámbito industrial y académico en diversos dominios. Los resultados más relevantes fueron registrados y articulados en el método GOThIC. La evaluación industrial preliminar del método se ha llevado a cabo en algunas compañías en Noruega.The process of building software systems by assembling and integrating pre-packaged solutions in the form of Commercial-Off-The-Shelf (COTS) software components has become a strategic need in a wide variety of application areas. In general, COTS components are software components that provide a specific functionality, available in the market to be purchased, interfaced and integrated into other software systems. The potential benefits of this technology are mainly its reduced costs and shorter development time, while maintaining the quality. Nevertheless, many challenges ranging form technical to legal issues must be faced for adapting the traditional software engineering activities in order to exploit these benefits.Nowadays there is an increasingly huge marketplace of COTS components; therefore, one of the most critical activities in COTS-based development is the selection of the components to be integrated into the system under development. Selection is basically composed of two main processes, namely: searching of candidates from the marketplace and their evaluation with respect to the system requirements. Unfortunately, most of the different existing methods for COTS selection focus their efforts on evaluation, letting aside the problem of searching components in the marketplace. Searching candidate COTS is not an easy task, having to cope with some challenging marketplace characteristics related to its widespread, evolvable and growing nature; and the lack of available and well-suited information to obtain a quality-assured search. Indeed, traditional reuse approaches also lack of appropriate solutions to reuse COTS components and the knowledge gained in each selection process. This lack of proposals is a serious drawback that makes the whole selection process highly risky, and often expensive and inefficient. This dissertation introduces the GOThIC (Goal- Oriented Taxonomy and reuse Infrastructure Construction) method aimed at building a domain reuse infrastructure for facilitating COTS components searching and reuse. It is based on goal-oriented approaches for building abstract, well-founded and stable taxonomies capable of dealing with the COTS marketplace characteristics. Thus, the nodes of these taxonomies are characterized by means of goals, their relationships declared as dependencies among them and several artifacts are constructed and managed for reusability and evolution purposes. The GOThIC method has been elaborated following an iterative process based on action research premises to identify the actual challenges related to COTS components searching. Then, possible solutions were envisaged and implemented by several industrial and academic case studies in different domains. Successful results were recorded to articulate the synergic GOThIC method solution, followed by its preliminary industrial evaluation in some Norwegian companies.
12
BLEISTEIN, Steven, Karl COX, Haruhiko KAIYA, and Shuichiro YAMAMOTO. "Goal Oriented Requirements Engineering: Trends and Issues." Institute of Electronics, Information and Communication Engineers, 2006. http://hdl.handle.net/2237/15023.
Full text
13
Ayala, Claudia P. (Claudia Patricia). "Systematic construction of goal-oriented COTS taxonomies." Doctoral thesis, Universitat Politècnica de Catalunya, 2008. http://hdl.handle.net/10803/6653.
Full textAbstract:
El proceso de construir software a partir del ensamblaje e integración de soluciones de software pre-fabricadas, conocidas como componentes COTS (Comercial-Off-The-Shelf) se ha convertido en una necesidad estratégica en una amplia variedad de áreas de aplicación. En general, los componentes COTS son componentes de software que proveen una funcionalidad específica, que están disponibles en el mercado para ser adquiridos e integrados dentro de otros sistemas de software. Los beneficios potenciales de esta tecnología son principalmente la reducción de costes y el acortamiento del tiempo de desarrollo, a la vez que fomenta la calidad. Sin embargo, numerosos retos que van desde problemas técnicos y legales deben ser afrontados para adaptar las actividades tradicionales de ingeniería de software para explotar los beneficios del uso de COTS para el desarrollo de sistemas.Actualmente, existe un incrementalmente enorme mercado de componentes COTS; así, una de las actividades más críticas en el desarrollo de sistemas basados en COTS es la selección de componentes que deben ser integrados en el sistema a desarrollar. La selección está básicamente compuesta de dos procesos principales: La búsqueda de componentes candidatos en el mercado y su posterior evaluación con respecto a los requisitos del sistema. Desafortunadamente, la mayoría de los métodos existentes para seleccionar COTS, se enfocan en el proceso de evaluación, dejando de lado el problema de buscar los componentes en el mercado. La búsqueda de componentes en el mercado no es una tarea trivial, teniendo que afrontar varias características del mercado de COTS, tales como su naturaleza dispersa y siempre creciente, cambio y evolución constante; en este contexto, la obtención de información de calidad acerca de los componentes no es una tarea fácil. Como consecuencia, el proceso de selección de COTS se ve seriamente dañado. Además, las alternativas tradicionales de reuso también carecen de soluciones apropiadas para reusar componentes COTS y el conocimiento adquirido en cada proceso de selección. Esta carencia de propuestas es un problema muy serio que incrementa los riesgos de los proyectos de selección de COTS, además de hacerlos ineficientes y altamente costosos.
Esta disertación presenta el método GOThIC (Goal- Oriented Taxonomy and reuse Infrastructure Construction) enfocado a la construcción de infraestructuras de reuso para facilitar la búsqueda y reuso de componentes COTS. El método está basado en el uso de objetivos para construir taxonomías abstractas, bien fundamentadas y estables para lidiar con las características del mercado de COTS. Los nodos de las taxonomías son caracterizados por objetivos, sus relaciones son declaradas como dependencias y varios artefactos son construidos y gestionados para promover la reusabilidad y lidiar con la evolución constante.
El método GOThIC ha sido elaborado a través de un proceso iterativo de investigación-acción para identificar los retos reales relacionados con el proceso de búsqueda de COTS. Posteriormente, las soluciones posibles fueron evaluadas e implementadas en varios casos de estudio en el ámbito industrial y académico en diversos dominios. Los resultados más relevantes fueron registrados y articulados en el método GOThIC. La evaluación industrial preliminar del método se ha llevado a cabo en algunas compañías en Noruega.
The process of building software systems by assembling and integrating pre-packaged solutions in the form of Commercial-Off-The-Shelf (COTS) software components has become a strategic need in a wide variety of application areas. In general, COTS components are software components that provide a specific functionality, available in the market to be purchased, interfaced and integrated into other software systems. The potential benefits of this technology are mainly its reduced costs and shorter development time, while maintaining the quality. Nevertheless, many challenges ranging form technical to legal issues must be faced for adapting the traditional software engineering activities in order to exploit these benefits.
Nowadays there is an increasingly huge marketplace of COTS components; therefore, one of the most critical activities in COTS-based development is the selection of the components to be integrated into the system under development. Selection is basically composed of two main processes, namely: searching of candidates from the marketplace and their evaluation with respect to the system requirements. Unfortunately, most of the different existing methods for COTS selection focus their efforts on evaluation, letting aside the problem of searching components in the marketplace. Searching candidate COTS is not an easy task, having to cope with some challenging marketplace characteristics related to its widespread, evolvable and growing nature; and the lack of available and well-suited information to obtain a quality-assured search. Indeed, traditional reuse approaches also lack of appropriate solutions to reuse COTS components and the knowledge gained in each selection process. This lack of proposals is a serious drawback that makes the whole selection process highly risky, and often expensive and inefficient.
This dissertation introduces the GOThIC (Goal- Oriented Taxonomy and reuse Infrastructure Construction) method aimed at building a domain reuse infrastructure for facilitating COTS components searching and reuse. It is based on goal-oriented approaches for building abstract, well-founded and stable taxonomies capable of dealing with the COTS marketplace characteristics. Thus, the nodes of these taxonomies are characterized by means of goals, their relationships declared as dependencies among them and several artifacts are constructed and managed for reusability and evolution purposes. The GOThIC method has been elaborated following an iterative process based on action research premises to identify the actual challenges related to COTS components searching. Then, possible solutions were envisaged and implemented by several industrial and academic case studies in different domains. Successful results were recorded to articulate the synergic GOThIC method solution, followed by its preliminary industrial evaluation in some Norwegian companies.
14
Ho, Mok Cheong Dean Christopher, and chris cheong@gmail com. "Hermes: Goal-Oriented Interactions for Intelligent Agents." RMIT University. Computer Science and Information Technology, 2009. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20090227.102654.
Full textAbstract:
Intelligent agents are goal-oriented software entities which exhibit a number of desirable characteristics, such as flexibility and robustness, which are suitable for complex, dynamic, and failure-prone environments. However, these characteristics of individual agents are not exhibited by their interactions with each other since traditional approaches to interaction design are message-centric, and these message-centric approaches force the intelligent agents to follow prescribed message sequences in order to achieve their interactions, thus usually resulting in interactions which have limited flexibility and robustness. In this thesis an alternative to the traditional message-centric interaction design approaches is presented. In this approach, the interactions are designed based on interaction goals, and message sequences are not prescribed. Instead, message sequences emerge from the interactions as the intelligent agents attempt to achieve the interaction goals. The main contribution of this work is Hermes, a methodology for the design and implementation of goal-oriented interactions. An important motivation for Hermes is to not only allow for the design and implementation of goal-oriented interactions, but to also be pragmatic and usable by practicing software engineers. To that end, Hermes has a clear and guided design process with a notation explicitly created for the design of goal-oriented interactions. Furthermore, Hermes, which covers the design and implementation of agent interactions only, has been integrated with Prometheus, a full agent system design methodology. Guidelines for the integration are provided so that, in future, Hermes may also be integrated with other existing methodologies if desired. Hermes also provides guidelines for mapping its design artifacts to an implementation. As Hermes is goal-oriented, the implementation platform should be one that is goal-based. The guidelines help developers map the design to skeleton code. This contributes to the pragmatism of Hermes. To further ensure that Hermes is pragmatic, two prototype software support tools have been developed. The design support tool allows for the graphical design of Hermes artifacts and the implementation support tool produces skeleton code for the Jadex agent platform based on a structured textual representation of Hermes design artifacts. Although only the Jadex agent platform is currently supported, the implementation tool can be extended to accommodate other goal-based agent platforms. An empirical evaluation was carried out, and its results show that Hermes designs are significantly more flexible and robust than message-centric designs, although more time is required to design Hermes interactions. This suggests that Hermes is suitable for interactions which are complex and/or error-prone.
15
Darrigrand, Vincent. "Goal-Oriented Adaptivity using Unconventional Error Representations." Thesis, Pau, 2017. http://www.theses.fr/2017PAUU3011/document.
Full textAbstract:
Dans un contexte d'adaptabilité ciblée, l'erreur commise sur une quantité d'intérêt peut être représentée grâce aux erreurs globales des problèmes direct et adjoint. Cette représentation de l'erreur est majorée par la somme des indicateurs d'erreurs élémentaires. Ces derniers sont alors utilisés pour produire des raffinements de maillage optimaux. Dans ces travaux, nous proposons de représenter l’erreur du problème adjoint via un opérateur alternatif. L’avantage principal de notre approche est que lorsque l'on choisit correctement l'opérateur alternatif, la majoration correspondante de l'erreur à la quantité d'intérêt devient plus précise, pour autant l'adaptabilité issue de l'utilisation de ces nouveaux indicateurs s'en trouve améliorée. Ces représentations peuvent être employées pour concevoir des algorithmes adaptatifs en espace (h), en ordre d’approximation (p) ou les deux (hp), basés sur la norme d’énergie ou bien ciblés sur une quantité d'intérêt. Bien que la méthode puisse être appliquée à une large gamme de problèmes, nous nous concentrons tout d’abord sur des problèmes unidimensionnels (1D), comme le problème d’Helmholtz et le problème de convection-diffusion stationnaire à convection dominante. Les résultats numériques en 1D montrent que, pour les problèmes de propagation d'ondes, les avantages de notre méthode sont notoires lorsque l'on considère l'opérateur de Laplace pour la représentation de l'erreur. Plus précisément, les majorations issues de la nouvelle représentation sont plus précises que celles provenant de la méthode classique et ce si l'on considère l'énergie globale ou bien une quantité d'intérêt particulière. Le phénomène est d’autant plus notable lorsque l'erreur de dispersion (pollution) est significative. Le problème 1D de convection-diffusion stationnaire à convection dominante avec des conditions limites de Dirichlet homogènes présente une couche limite qui produit une perte de stabilité numérique. La nouvelle représentation d'erreur délivre des majorations plus précises. Lorsqu’appliquée à une p-adaptabilité ciblée, la représentation d'erreur alternative permet une capture plus efficace la couche limite, malgré les oscillations numériques parasites existantes. Devant ces résultats encourageants, nous nous penchons sur l'équation d'Helmholtz à deux et trois dimensions (2D et 3D). Nous montrons, au travers de multiples simulations numériques, que les majorations fournies par les représentations d'erreur alternatives sont plus précises que celle de la représentation classique. Lorsque l'on utilise les indicateurs d'erreur alternatifs, un processus naïf de p-adaptabilité ciblée converge, tandis que dans les mêmes conditions, la méthode classique échoue et requiert l'utilisation d'un opérateur de projection ou d'autre techniques pour récupérer la convergence. Dans ce travail, nous fournissons également des directives pour déterminer les opérateurs qui fournissent des représentations d’erreur induisant de majorations précises. Des résultats similaires sont aussi établis tant pour un problème 2D de convection-diffusion stationnaire à convection dominante que pour des problèmes 2D ayant des coefficients de matériaux discontinus. Nous considérons un problème de diagraphie ultra-sonique en cours de forage pour illustrer l'applicabilité de la méthode proposéeIn Goal-Oriented Adaptivity (GOA), the error in a Quantity of Interest (QoI) is represented using global error functions of the direct and adjoint problems. This error representation is subsequently bounded above by element-wise error indicators that are used to drive optimal refinements. In this work, we propose to replace, in the error representation, the adjoint problem by an alternative operator. The main advantage of the proposed approach is that, when judiciously selecting such alternative operator, the corresponding upper bound of the error representation becomes sharper, leading to a more efficient GOA. These representations can be employed to design novel h, p, and hp energy-norm and goal-oriented adaptive algorithms. While the method can be applied to a variety of problems, in this Dissertation we first focus on one-dimensional (1D) problems, including Helmholtz and steady state convection-dominated diffusion problems. Numerical results in 1D show that for the Helmholtz problem, it is advantageous to select the Laplace operator for the alternative error representation. Specifically, the upper bounds of the new error representation are sharper than the classical ones used in both energy-norm and goal-oriented adaptive methods, especially when the dispersion (pollution) error is significant. The 1D steady state convection-dominated diffusion problem with homogeneous Dirichlet boundary conditions exhibits a boundary layer that produces a loss of numerical stability. The new error representation based on the Laplace operator delivers sharper error upper bounds. When applied to a p-GOA, the alternative error representation captures earlier the boundary layer, despite the existing spurious numerical oscillations. We then focus on the two- and three-dimensional (2D and 3D) Helmholtz equation. We show via extensive numerical experimentation that the upper bounds provided by the alternative error representations are sharper than the classical ones. When using the alternative error indicators, a naive p-adaptive process converges, whereas under the same conditions, the classical method fails and requires the use of the so-called Projection Based Interpolation (PBI) operator or some other technique to regain convergence. We also provide guidelines for finding operators delivering sharp error representation upper bounds
En un contexto de adaptatividad orientada a un objetivo, el error en una cantidad de interés está representado a través de los errores globales de los problemas directo y adjunto. Esta representación del error se acota superiormente por una suma de indicadores de error de cada elemento. Estos se utilizan para producir refinamientos óptimos. En este trabajo, proponemos representar el error del problema adjunto utilizando un operador alternativo. La principal ventaja de nuestro enfoque es que cuando se elige correctamente dicho operador alternativo, la correspondiente cota superior se vuelve más cercana al error en la cantidad de interés, lo que permite una adaptatividad más eficiente. Estas representaciones pueden ser utilizadas para diseñar algoritmos adaptativos en h, p o hp, basados en la norma de la energía o para aproximar una cantidad de interés específica. Aunque el método propuesto se puede aplicar a una amplia gama de problemas, en esta tesis doctoral nos centramos primero en problemas unidimensionales (1D), tales como el problema de Helmholtz y el problema estacionario de convección-difusión con convección dominante. Los resultados numéricos en 1D muestran que, para los problemas de propagación de ondas, las ventajas de este método son notorias cuando se considera el operador de Laplace para la representación del error. Específicamente, las cotas superiores derivadas de la nueva representación son más cercanas a la cantidad de interés que las del método convencional. Esto es cierto tanto para la norma de la energía global como para una cantidad de interés particular, especialmente cuando el error de dispersión es significativo. El problema estacionario 1D de convección-difusión con convección dominante y con condiciones de Dirichlet homogéneas tiene una capa límite que produce una pérdida de estabilidad numérica. La nueva representación del error proporciona cotas superiores más cercanas a la cantidad de interés. Cuando se aplica a un algoritmo adaptativo en p orientado a un objetivo, la representación alternativa del error captura antes la capa límite, a pesar de las existentes oscilaciones numéricas no físicas. En esta tesis doctoral, también nos centramos en la ecuación de Helmholtz en dos y tres dimensiones (2D y 3D). Mostramos a través de múltiples experimentos numéricos que las cotas superiores proporcionadas por las representaciones alternativas del error son más cercanas a la cantidad de interés que cuando uno considera la representación clásica. Al utilizar los indicadores alternativos del error, un algoritmo adaptativo en p sencillo converge, mientras que en las mismas condiciones, el método convencional falla y requiere el uso de operadores de proyección o de otras técnicas para recuperar la convergencia. En este trabajo, también determinamos operadores que proporcionan representaciones del error que inducen cotas superiores más ajustadas. Establecemos resultados similares tanto para el problema estacionario de convección-difusión con convección dominante en 2D como para problemas 2D con materiales discontinuos. Finalmente, se considera un problema sónico en pozos petrolíferos para ilustrar la aplicabilidad del método propuesto
16
Lee-Klenz, Soonhwa. "Multiple perspectives driven goal-oriented requirements elicitation." Thesis, University of Manchester, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.629923.
Full textAbstract:
A sceptical voice arisen in the Software Engineering (SE) discipline, which is what Requirements Engineering (RE) is nested on, is that the SE must augment the approach towards reflecting human limitations and capabilities, which will require learning more about human errors and limitations in performing SE tasks and using the tools and products. RE tends to be studied in hard systems thinking, which is considered to be a lack of describing complicated real world problems. This thesis focuses on the extension of an interdisciplinary requirements elicitation framework towards business and IT (BIT) alignment. The interdisciplinary framework is developed by amalgamating two methodologies derived from different disciplines, namely goal-oriented RE from RE and Multiview from Information System (IS). IS usually considers human and social factors more than SE. Multiple perspectives concept (Technology (T), Organisation (0) and Personal (P) factors) in IS is enriched in analysis of human and social factors. The Multiview method grounded in soft systems thinking has adopted such multiple perspectives in IS development. RE and IS are found to be a core interdisciplinary concept that can be shared in order to produce the synergy of RE by adopting the approach that conceives social and human factors. IS development is targeted on BIT alignment, which is a Chief Information Officer's (CIO) primary concern. One of the strategic BIT alignment methods suggested by Henderson et al is to align IT with business strategy. However, business strategy driven RE is paucity. Therefore, the approach taken for this study is to drive business goal-oriented RE with multiple dimensions analysis of system environment, which is believed to be beneficial in a BIT alignment context in the RE process. There are several techniques and methodologies used for articulating the interdisciplinary requirements elicitation framework. The backbone of the framework is a simple goal tree that represents the business goals of a company. The goal tree is structured and decomposed by adopting multiple perspectives (Multiview). The Multiview is a driver in an expansion of the knowledge of firms' business goals since the multiple perspectives seize the diverse areas of concern in system development. Several modelling techniques are taken in order to specify and refine the requirements for each perspective. The contributions of the current study attempt: to reduce the gap between RE and IS in software requirements analysis (theoretical contribution); to be an opportunity to verify the applicability of the Multiview methodology in a requirements elicitation towards enhancing the strategic alignment of BIT (methodological contribution); and to develop a software tool to support the framework (practical contribution).
17
Akhigbe, Okhaide Samson. "A Goal-Oriented Method for Regulatory Intelligence." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/38253.
Full textAbstract:
When creating and administering regulations, regulators have to demonstrate that regulations accomplish intended societal outcomes at costs that do not outweigh their benefits. While regulators have this responsibility as custodians of the regulatory ecosystem, they are also required to create and administer regulations transparently and impartially, addressing the needs and concerns of all stakeholders involved. This is in addition to regulators having to deal with various administrative bottlenecks, competing internal priorities, as well as financial and human resource limitations. Nonetheless, governments, regulated parties, citizens and interest groups can each express different views on the relevance and performance of a piece of regulation. These views range from too many regulations burdening business operations to perceptions that crises in society are the results of insufficient regulations. As such, regulators have to be innovative, employing methods that show that regulations are effective, and justify the introduction, evolution or repeal of regulations.
The regulatory process has been the topic of various studies with several such studies exploring the use of information systems at the software level to confirm compliance with regulations and evaluate issues related to non-compliance. The rationale is that if information systems can improve operational functions in organizations, they can also help measure compliance. However, the research focus has been on enabling regulated parties to comply with regulations rather than on enabling regulators to assess or enforce compliance or show that regulations are effective. Regulators need to address concerns of too much regulations or too little regulations with data-driven evidence especially in this age of big data and artificial intelligence enhanced tools. A method that facilitates evidencebased decision-making using data for enacting, implementing and reviewing regulations is now inevitable. In response to the above challenges, this thesis explores the use of a goaloriented modelling method and a data analytics software, to create a method that enables monitoring, assessing and reporting on the effectiveness of regulations and regulatory initiatives. This Goal-oriented Regulatory Intelligence Method (GoRIM) provides an intelligent approach to regulatory management, as well as a feedback loop in the use of data from and within the regulatory ecosystem to create and administer regulations.
To demonstrate its applicability, GoRIM was applied to three case studies involving regulators in three different real regulatory scenarios, and its feasibility and utility were evaluated. The results indicate that regulators found GoRIM promising in enabling them to show, with evidence, whether their regulations are effective.
18
Letier, Emmanuel. "Reasoning about Agents in Goal-Oriented Requirements Engineering." Université catholique de Louvain, 2002. http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-11042002-163458/.
Full textAbstract:
The thesis proposes a number of techniques for elaborating requirements constructively from high-level goals. The techniques are based on the KAOS goal-oriented method for requirements engineering. This method consists in identifying goals and refining them into subgoals until the latter can be assigned as responsibilities of single agents such as humans, devices and software. Domain properties and assumptions about the software environment are also used during the goal refinement process. The method supports the exploration of alternative goal refinements and alternative responsibility assignments of goals to agents. It also supports the identification and resolution of conflicts between goals, and the identification and resolution of exceptional agent behaviors, called obstacles, that violate goals and assumptions produced during the goal refinement process. The thesis enriches the KAOS framework through three kinds of techniques: (a) techniques for identifying agents, goal refinements, and alternative responsibility assignments, and for deriving agent interfaces from such responsibility assignments; (b) techniques for deriving operational requirements from goal specifications; (c) techniques for generating obstacles to the satisfaction of idealized goals and assumptions, and for generating alternative obstacle resolutions. The result is a coherent body of systematic techniques for requirements elaboration that are both theoretically well-founded (a formal model of agent is defined) and effective in practice (the techniques are validated on two real case studies of significant size: the London ambulance despatching system, and the Bay Area Rapid Transit train system).
19
Green, Stewart John Marshall. "A synthesised approach to goal-oriented requirements engineering." Thesis, Imperial College London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.415018.
Full text
20
Vemaganti, Kumar S. "Goal-oriented adaptive modeling of heterogeneous elastic solids /." Full text (PDF) from UMI/Dissertation Abstracts International, 2000. http://wwwlib.umi.com/cr/utexas/fullcit?p3004392.
Full text
21
Zardari, Shehnila. "Cloud adoption : a goal-oriented requirements engineering approach." Thesis, University of Birmingham, 2016. http://etheses.bham.ac.uk//id/eprint/6567/.
Full textAbstract:
The enormous potential of cloud computing for improved and cost-effective service has generated unprecedented interest in its adoption. However, a potential cloud user faces numerous risks regarding service requirements, cost implications of failure and uncertainty about cloud providers’ ability to meet service level agreements. These risks hinder the adoption of cloud computing. We motivate the need for a new requirements engineering methodology for systematically helping businesses and users to adopt cloud services and for mitigating risks in such transition. The methodology is grounded in goal-oriented approaches for requirements engineering. We argue that Goal-Oriented Requirements Engineering (GORE) is a promising paradigm to adopt for goals that are generic and flexible statements of users’ requirements, which could be refined, elaborated, negotiated, mitigated for risks and analysed for economics considerations. The methodology can be used by small to large scale organisations to inform crucial decisions related to cloud adoption. We propose a risk management framework based on the principle of GORE. In this approach, we liken risks to obstacles encountered while realising cloud user goals, therefore proposing cloud-specific obstacle resolution tactics for mitigating identified risks. The proposed framework shows benefits by providing a principled engineering approach to cloud adoption and empowering stakeholders with tactics for resolving risks when adopting the cloud. We extend the work on GORE and obstacles for informing the adoption process. We argue that obstacles’ prioritisation and their resolution is core to mitigating risks in the adoption process. We propose a novel systematic method for prioritising obstacles and their resolution tactics using Analytical Hierarchy Process (AHP). To assess the AHP choice of the resolution tactics we support the method by stability and sensitivity analysis.
22
Olofsson, Malmberg William. "Utvärdering av sökriktningar i Goal-Oriented Action Planning." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-15608.
Full textAbstract:
Goal-Oriented Action Planning, även kallat GOAP, är ett system för att styra beteende av artificiell intelligens. Systemet använder en sökalgoritm för att besluta vilket beteende som ska köras baserat på ett mål och ett antal åtgärder. Studien målsatte att undersöka vilken sökriktning som var mest lämpad för givet scenario. Undersökningen utfördes med hjälp av en simpel spelprototyp baserat på rollspel med stridsmekaniker. Totalt tre tester utfördes med olika scenarion och alla resulterade i att regressiv sökning var snabbare än progressiv sökning. Resultat för det mest krävande målet visade att progressiv sökning besökte 1724 %, 1100 % och 232 % fler noder än regressiv sökning för respektive test.
23
Kandru, Nischel. "Intelligent Goal-Oriented Feedback for Java Programming Assignments." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/83947.
Full textAbstract:
Within computer science education, goal-oriented feedback motivates beginners to be engaged in learning programming. As the number of students increases, it is challenging for teaching assistants to cater to all the doubts of students and provide goals. This problem is addressed by intelligent visual feedback which guides beginners formulate effective goals to resolve all the errors they would incur while solving a programming assignment.
Most current automated feedback mechanisms provide feedback without categorization, prioritization, or goal formulation in mind. Students may overlook important issues, and high priority issues might be hidden among other issues. Also, beginners are not well equipped in formulating goals to resolve the issues provided in the feedback.
In this research, we address the problem of providing an effective, intelligent goal-oriented feedback to student's code to resolve all the issues in their code while ensuring that the code is well tested. The goal-oriented feedback would eventually implicitly navigate the students to write a logically correct solution. The code feedback is summarized into four categories in the descending order of priority: Coding, Student's Testing, Behavior, and Style. Each category is further classified into subcategories, and a simple visual summary of the student's code is also provided.
Each of the above-mentioned categories has detailed feedback on each error in that category to provide a better understanding of the errors. We also offer enhanced error messages and diagnosis of errors to make the feedback very useful.
This intelligent feedback has been integrated into Web-CAT, an open-source automated grading tool developed at Virginia Tech that is widely used by many universities. A user survey was collected after the students have utilized this feedback for a couple of programming assignments and we obtained promising results to claim that our intelligent feedback is effective.Master of Science
24
Magnusson, Matteus, and Tobias Hall. "Adaptive goal oriented action planning for RTS games." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4361.
Full textAbstract:
This thesis describes the architecture of an adaptive goal-oriented AI system that can be used for Real-Time Strategy games. The system is at the end tested against a single opponent on three different maps with different sizes to test the ability of the AI opposed to the 'standard' Finite State Machines and the likes in Real-Time Strategy games. The system consists of a task handler agent that manages all the active and halted tasks. A task is either low-level; used for ordering units, or high-level that can form advanced strategies. The General forms plans that are most beneficial at the moment. For creating effective units against the opponent a priority system is used; where the unit priorities are calculated dynamically.Den här uppsatsen beskriver en adaptiv målorienterad AI-arkitektur som kan tillämpas på "Real-Time Strategy" spel. Systemet testat mot en annan AI som använder mer traditionella "Finite State Machines" in sin arkitekture. Testet utförs på tre olika banor som är olika stora. Systemet består utav en "Uppgiftshanterare" som har hand om alla aktiva och inaktiva uppgifter. En uppgift kan antingen vara utav låg-nivå, som används för att skicka kommandon till enheterna, eller utav hög-nivå för att göra mer avancerade strategier. Generalen planerar och skapar uppgifter som är mest fördelaktig för tillfället. För att skapa enheter som är effektiva mot fiendens enheter används ett prioritetssystem, där enhetens prioritet kalkyleras ut dynamiskt under spelets gång.
25
Hall, Tobias, and Matteus Magnusson. "Adaptive Goal Oriented Action Planning for RTS Games." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4362.
Full textAbstract:
This thesis describes the architecture of an adaptive goal-oriented AI system that can be used for Real-Time Strategy games. The system is at the end tested against a single opponent on three di erent maps with di erent sizes to test the ability of the AI opposed to the 'standard' Finite State Machines and the likes in Real-Time Strategy games. The system consists of a task handler agent that manages all the active and halted tasks. A task is either low-level; used for ordering units, or high-level that can form advanced strategies. The General forms plans that are most advantageous at the moment. For creating e ective units against the opponent a priority system is used; where the unit priorities are calculated dynamically.
26
Dingwall-Smith, Andrew Ross. "Run-time monitoring of goal-oriented requirements specification." Thesis, University College London (University of London), 2006. http://discovery.ucl.ac.uk/1444624/.
Full textAbstract:
The environment in which a software system operates is as important to the correct operation of the system as the software itself. Most software development involves making assumptions about the environment in which the resulting system will operate. These assumptions may cease to be valid if the environment changes, causing the system to fail to operate correctly. One solution to this problem is to use run-time requirements monitoring to deter mine, as a system operates, whether it is satisfying the requirements specified for it and to take action to rectify these problems. This thesis describes work that has been carried out in the area of run-time requirements monitoring. A framework has been developed for monitoring requirements which are formally specified using temporal logic and the KAOS goal-oriented requirements specification language. The framework uses AspecU to instrument the monitored system so that events are emitted which are used to determine whether the monitored system satisfies the requirements specification. The framework also provides a language which can specify a mapping between requirements and implementation which can be used to generate instrumentation code. The monitoring framework supports monitoring of soft goals by allowing the formal specification of metrics which can be used to determine whether soft goals are in fact being satisfied. These contributions are validated using a workforce scheduling system as a case study. This is a real world system and the requirements monitored were those considered useful by the developers of the system. The case study shows that the monitoring framework can be used to instrument a system to monitor hard and soft goals and that those goals can be monitored with reasonable performance overhead. Goal failures due to changes in the environment can be detected using the information supplied by the monitoring framework.
27
Gil, André Tiago Varejão. "Integrating early aspects with goal-oriented requirements engineering." Master's thesis, FCT - UNL, 2008. http://hdl.handle.net/10362/1781.
Full textAbstract:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia InformáticaRequirements engineering aims at eliciting, analyzing, specifying, validating and managing system requirements. When eliciting system requirements, it is possible to use various approaches, including goal-oriented and aspect-oriented approaches. Although those are two well-known approaches, they are seldom used in conjunction. On the other hand, when using goal-oriented approaches, one common and usual problem is the fact that some of the goals repeat themselves all over the system. This makes goal-oriented models to have a boost in complexity because of the repeating goals, and thus, making the evolution of this model harder than necessary. This complexity could be minimized if an aspect-oriented approach would be used. The big advantage of using a hybrid approach, in our case goal-oriented and aspect-oriented one is the possibility to identify all the scattered goals and modularize them as aspects. In this way we can represent this kind of goal (now an aspect) only once in the model. This means the complexity of the model will be greatly reduced and the readability of the model will also be improved. The final result will be an evolution that could be easily controlled, thus minimizing errors. Although this seems a good idea, there are some challenges to overcome when merging goals and aspects. First of all, a notation and a set of rules must be built in order to compose the model. In order to do this we will use patterns based on roles, as these will help elaborating the model. This work will present an approach that will make possible after modeling the system with a goal-oriented approach, identify aspects and then refine the model taking into account the aspects. In order to accomplish this, the KAOS methodology will be extended with aspects.
28
Helmesjö, Fred. "Goal-Oriented Action Planning : Utvärdering av A* och IDA*." Thesis, Högskolan i Skövde, Institutionen för kommunikation och information, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-6336.
Full textAbstract:
Goal-Oriented Action Planning (GOAP) är en AI-arkitektur som tillämpar ett måldrivet beteende åt agenter i spel. Mål uppnås genom att planer med åtgärder genereras med hjälp av en sökalgoritm. Syftet med denna rapport är att undersöka hur två sökalgoritmer, A* och IDA*, presterar under planering i GOAP. De experimenten som används är dels en miljö där agenter simuleras, samt ett test där planer genereras för samtliga implementerade mål utan rendering och simulering av agenter. Data som utvärderas är bl.a. planeringstiden, antal besökta noder under sökning och genererade planer. Utvärderingen visar en tydlig fördel till A*, som i snitt är 38 % snabbare än IDA* vid planering av åtgärder i GOAP. Slutsatsen blir att A* är den algoritm att föredra om prestanda är det som eftertraktas men IDA* kan motiveras för dess egenskaper, så som lägre minneskomplexitet.För tillgång till implementationen, maila f.helmesjo@gmail.com
29
Ahmadi, Behnam Saeed. "Goal-oriented Pattern Family Framework for Business Process Modeling." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23459.
Full textAbstract:
While several approaches exist for modeling goals and business processes in organizations, the relationships between these two views are often not well defined. This inhibits the effective reuse of available knowledge in models. This thesis aims to address this issue through the introduction of a Goal-oriented Pattern Family (GoPF) framework that helps constructing business process models from organization goals while expanding these goals, establishing traceability relationships between the goal and process views, and improving reusability. Methods for extracting domain knowledge as patterns, which are composed of goal model building blocks, process model building blocks, and their relationships, and for maintaining the patterns over time are also presented. The GoPF framework provides the infrastructure for defining pattern families, i.e., collections of related patterns for particular domains. The foundation of GoPF is formalized as a profile of the User Requirements Notation, a standard modeling language that supports goals, scenarios, and links between them. A method for the use of GoPF is defined and then illustrated through a case study that targets the improvement of patient safety in healthcare organizations. The framework and the extraction/maintenance methods are also validated against another case study involving aviation security in a regulatory environment. The GoPF framework is expected to have a positive impact on the scientific community through the formalization, evolution, and reuse of patterns in domain-specific business domains. From an industrial viewpoint, this framework will also help intermediary organizations (such as consulting firms) who are required to repeatedly create and document goal and process models for other organizations in their business domain.
30
Peisert, Sean Philip. "A model of forensic analysis using goal-oriented logging." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3246091.
Full textAbstract:
Thesis (Ph. D.)--University of California, San Diego, 2007.Title from first page of PDF file (viewed March 9, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 156-165).
31
El-Maddah, Islam Ahmed Mahmoud. "Goal-oriented requirement analysis for process control system design." Thesis, King's College London (University of London), 2004. https://kclpure.kcl.ac.uk/portal/en/theses/goaloriented-requirement-analysis-for-process-control-system-design(d4c127bb-7381-4c95-96b0-8ddbe86b7886).html.
Full text
32
Faaborg, Alexander James. "A goal-oriented user interface for personalized semantic search." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34186.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, February 2006.Includes bibliographical references (v. 2, leaves 280-288).
Users have high-level goals when they browse the Web or perform searches. However, the two primary user interfaces positioned between users and the Web, Web browsers and search engines, have very little interest in users' goals. Present-day Web browsers provide only a thin interface between users and the Web, and present-day search engines rely solely on keyword matching. This thesis leverages large knowledge bases of semantic information to provide users with a goal-oriented Web browsing experience. By understanding the meaning of Web pages and search queries, this thesis demonstrates how Web browsers and search engines can proactively suggest content and services to users that are both contextually relevant and personalized. This thesis presents (1) Creo, a Programming by Example system that allows users to teach their computers how to automate interactions with their favorite Web sites by providing a single demonstration, (2) Miro, a Data Detector that matches the content of a Web page to high-level user goals, and allows users to perform semantic searches, and (3) Adeo, an application that streamlines browsing the Web on mobile devices, allowing users to complete actions with a minimal amount of input and output.
(cont.) An evaluation with 34 subjects found that they were more effective at completing tasks when using these applications, and that the subjects would use these applications if they had access to them. Beyond these three user interfaces, this thesis also explores a number of underlying issues, including (1) automatically providing semantics to unstructured text, (2) building robust applications on top of messy knowledge bases, (3) leveraging surrounding context to disambiguate concepts that have multiple meanings, and (4) learning new knowledge by reading the Web.
by Alexander James Faaborg.
S.M.
33
Noori, Zaid Izzadin Mohammed. "Arabic goal-oriented conversational agents using semantic similarity techniques." Thesis, Manchester Metropolitan University, 2015. http://e-space.mmu.ac.uk/380/.
Full textAbstract:
Conversational agents (CAs) are computer programs used to interact with humans in conversation. Goal-Oriented Conversational agents (GO-CAs) are programs that interact with humans to serve a specific domain of interest; its’ importance has increased recently and covered fields of technology, sciences and marketing. There are several types of CAs used in the industry, some of them are simple with limited usage, others are sophisticated. Generally, most CAs were to serve the English language speakers, a few were built for the Arabic language, this is due to the complexity of the Arabic language, lack of researchers in both linguistic and computing. This thesis covered two types of GO-CAs. The first is the traditional pattern matching goal oriented CA (PMGO-CA), and the other is the semantic goal oriented CA (SGO-CA). Pattern matching conversational agents (PMGO-CA) techniques are widely used in industry due to their flexibility and high performance. However, they are labour intensive, difficult to maintain or update, and need continuous housekeeping to manage users’ utterances (especially when instructions or knowledge changes). In addition to that they lack for any machine intelligence. Semantic conversational agents (SGO-CA) techniques utilises humanly constructed knowledge bases such as WordNet to measure word and sentence similarity. Such measurement witnessed many researches for the English language, and very little for the Arabic language. In this thesis, the researcher developed a novelty of a new methodology for the Arabic conversational agents (using both Pattern Matching and Semantic CAs), starting from scripting, knowledge engineering, architecture, implementation and evaluation. New tools to measure the word and sentence similarity were also constructed. To test performance of those CAs, a domain representing the Iraqi passport services was built. Both CAs were evaluated and tested by domain experts using special evaluation metrics. The evaluation showed very promising results, and the viability of the system for real life.
34
Westermann, Dennis [Verfasser]. "Deriving Goal-oriented Performance Models by Systematic Experimentation / Dennis Westermann." Karlsruhe : KIT Scientific Publishing, 2014. http://www.ksp.kit.edu.
Full text
35
Canducci, Marco. "End-to-End Goal-Oriented Conversational Agent for Risk Awareness." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20381/.
Full textAbstract:
Traditional development of goal-oriented conversational agents typically require a lot of domain-specific handcrafting, which precludes scaling up to different domains; end-to-end systems would escape this limitation because they can be trained directly from dialogues. The very promising success recently obtained in end-to-end chatbots development could carry over to goal-oriented settings: applying deep learning models for building robust and scalable goal-oriented dialog systems directly from corpora of conversations is a challenging task and an open research area. For this reason, I decided that it would have been more relevant in the context of a master's thesis to experiment and get acquainted with these new promising methodologies - although not yet ready for production - rather than investing time in hand-crafting dialogue rules for a domain-specific solution. My thesis work had the following macro objectives: (i) investigate the latest research works concerning goal-oriented conversational agents development; (ii) choose a reference study, understand it and implement it with an appropriate technology; (iii) apply what learnt to a particular domain of interest. As a reference framework I chose the end-to-end memory networks (MemN2N) (Sukhbaatar et al., 2015) because it has proven to be particularly promising and has been used as a baseline for many recent works. Not having real dialogues available for training though, I took care of synthetically generating a corpora of conversations, taking a cue from the Dialog bAbI dataset for restaurant reservations (Bordes et al., 2016) and adapting it to the new domain of interest of risk awareness. Finally, I built a simple prototype which exploited the pre-trained dialog model in order to advise users about risk through an anthropomorphic talking avatar interface.
36
Zhang, Juan. "Goal-oriented buffer pool tuning algorithms for decision support workloads." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59417.pdf.
Full text
37
Zlatev, Zlatko Vasilev. "Goal-oriented design of value and process models from patterns." Enschede : University of Twente [Host], 2007. http://doc.utwente.nl/58038.
Full text
38
Patterson, Lachlan Joel. "A prototype goal oriented construction prototype management application for owners." Thesis, Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51894.
Full textAbstract:
The construction industry has had difficulty adopting project management software effectively and in a widespread manner. This thesis seeks to uncover common problems preventing the adoption of new software for construction project management, and to find a method to design more successful software. Construction project managers working at universities in the state of Georgia were selected as the specific group to study. To better define the functions of project management software, as well as uncover benefits both realized and anticipated, research was conducted. A Situation Awareness based approach was selected to result in proposing a prototype application that would specifically match the mental model of the study group. To define the mental model, a Goal Directed Task Analysis method was used by way of an online survey and in-person verification. In order to collect the survey data, a web based Goal Directed Task Analysis application was created and tested as a part of this thesis. Using the survey data, a proposed design for a prototype application was proposed. The application design was specifically made to fulfill the needs of project managers like those in the study group. The GDTA method proved effective in producing a software design. Recommendations to create and test the proposed prototype application are provided as a next step.
39
CUNHA, HERBET DE SOUZA. "THE USE OF GOAL-ORIENTED STRATEGIES TO SECURITY REQUIREMENTS MODELING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10995@1.
Full textAbstract:
PETRÓLEO BRASILEIRO S. A.Adicionar requisitos de segurança às arquiteturas de software após elas terem sido construídas é uma tarefa bastante difícil. Conceitos de segurança devem permear todo o ciclo de desenvolvimento do software, desde a engenharia de requisitos, passando por desenho (design), implementação, testes e distribuição. Este trabalho apresenta uma abordagem para modelagem de requisitos de segurança, especialmente os requisitos de confidencialidade e consistência das informações, baseada em estratégias orientadas a metas, trazendo a questão da segurança para o início do ciclo de desenvolvimento de software. São apresentados também os resultados da aplicação desta abordagem em um estudo de caso.
Adding security requirements to software architectures after they are built is a hard work. Security concepts have to cross the whole software development cycle, from requirement engineering to deployment, passing by design, coding and test. This work presents an approach to security requirements modeling, mainly the information confidentiality and consistency, based on goal oriented strategies, bringing the security issues to the beginning of the software development cycle. It also presents the results of this approach in a case study.
40
Gul, Saba. "Novelty in goal-oriented machines using a thread memory structure." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53143.
Full textAbstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.Includes bibliographical references (leaves 55-56).
Resourcefulness and creativity are desirable properties for an intelligent machine. The incredible adeptness of the human mind at seeing situations from diverse viewpoints allows it to conjure many techniques to accomplish the same goal, and hence recover elegantly when one method fails. In the context of goal-oriented machines, this thesis presents a system that finds substitutes for the typical physical resource used to accomplish a goal, by finding novel uses for other, available resources-uses that these resources were not originally meant or designed for. In a domain where an object can serve multiple functions, this requires: (1) understanding the functional context the object is operating in; (2) building a realistic representation of the given objects, which often do not fall neatly into tightly-structured categorizations, but instead share properties with other 'boundary' objects. The system does this by learning from examples, and using the average member, or 'stereotype' as the class representative; (3) allowing imperfection: identifying properties that are not crucial for goal satisfaction, and selectively ignoring them; and (4) measuring similarity between objects to find the best substitute. The system bootstraps with knowledge about the properties of the objects and is given positive and negative examples for the goal. It can infer, for example, that two objects such as an orange (the typical resource) and a ball (the positive example) are related in the context of finding a throwable object on account of their similarity in shape and size, but unrelated in the context of finding an ingredient for a fruit salad, because one is a fruit and the other is not.
(cont.) It then finds a substitute that shares shape and size features with the orange. If, on the other hand, we need an ingredient for a fruit salad, we can supply it another edible fruit as a positive example. The system is implemented in Java; its performance is illustrated with 7 examples in the domain of everyday objects.
by Saba Gul.
M.Eng.
41
Aucoin, Bryan. "A model for goal oriented learning in a neural network." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/43285.
Full textAbstract:
A mathematical model for goal oriented learning in a network of neuron-like elements was developed. Using a mouse/goal box analogy, a simulation of a network with four elements was programmed in Turbo Pascal, Version 4.0 (Borland International) to test the model. Each location in the network corresponded to a particular network input. The output of the network consisted of one of four behaviors: forward, backward, left or right. The network successfully learned sequences of up to six movements in increasingly complex mazes.
Master of Science
42
Li, Harriet. "Scalable online nonlinear goal-oriented inference with physics-informed maps." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122370.
Full textAbstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Thesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 103-114).
This thesis develops a physics-informed k-nearest neighbors approach, which draws from both physics-based modeling and data-driven machine learning. In doing so, our method achieves robustness and increased accuracy with small datasets, while being cheap to apply. Our method tackles the challenges of high-dimensional inverse problems governed by complex physical models. Such inverse problems arise in important engineering applications, such as heat transfer, medical and structural imaging, and contaminant control. In particular, we consider the goal-oriented inverse problem setting, where unknown model parameters are inferred from observations in order to calculate some low-dimensional quantity of interest (QoI). When computational resources and/or time are limited, it is infeasible to solve the full inverse problem for inferred parameters to obtain the QoI.
This thesis describes an algorithm that bypasses solving the inverse problem, instead directly giving rapid QoI estimates for observations. We generate a library of physics-informed maps based on local approximations to the goal-oriented inverse problem. Applying tensor decompositions to these approximate problems gives compact multilinear physics-informed maps. These maps are calculated and stored in an offline preparatory phase, and then applied to online observations to give rapid QoI estimates. This thesis also describes tailored active learning algorithms, which efficiently choose training points in observation space at which to generate these physics-informed maps. This improves the online prediction performance given a limited offline computational and/or storage budget. We demonstrate our rapid QoI estimation and active learning algorithms on a quality-control problem for additive manufacturing.
The proposed physics-informed approach achieves 5% relative QoI error in 0.1% of the time to solve the full inverse problem. Our physics-informed mappings give a third of the QoI estimate error that black-box regression methods do for small datasets, and are more robust when the offline dataset does not well represent the online test points. The tailored active learning algorithms produce datasets that reduce maximum QoI error by 25% and misclassification by 15%, compared to randomly chosen datasets.
"This work was supported in part by the NSF Computational and Data-Enabled Science and Engineering Program grant CNS-050186 and the US Department of Energy Office of Advanced Scientific Computing Research (ASCR) Applied Mathematics Program, awards DE-FG02-08ER2585 and DE-SC0009297, as part of the DiaMonD Multifaceted Mathematics Integrated Capability Center, and the MIT-SUTD International Design Center"--Page 6.
by Harriet Li.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Aeronautics and Astronautics
43
Li, Fengyi S. M. Massachusetts Institute of Technology. "A combinatorial approach to goal-oriented optimal Bayesian experimental design." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122376.
Full textAbstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2019
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 83-87).
Optimal experimental design plays an important role in science and engineering. In many situations, we have many observations but only few of them can be selected due to limited resources. We then need to decide which ones to select based on our goal. In this thesis, we study the Bayesian linear Gaussian model with a large number of observations, and propose several algorithms for solving the combinatorial problem of observation selection/optimal experimental design in a goal-oriented setting. Here, the quantity of interest (QoI) is not the model parameters, but some (vector-valued) function of the parameters. We wish to select a subset of the candidate observations that is most informative for this QoI, in the sense of reducing its uncertainty. More precisely, we seek to maximize the mutual information between the selected observations and the QoI. Finding the true optimum is NP-hard, and in this setting, the mutual information objective is in general not submodular. We thus introduce several algorithms that approximate the optimal solution, including a greedy approach, a minorize-maximize approach employing modular bounds, and certain score-based heuristics. We compare the computational cost these algorithms, and demonstrate their performance on a synthetic data set and a real data set from a climate model.
Support from Department of Energy
by Fengyi Li.
S.M.
S.M. Massachusetts Institute of Technology, Department of Aeronautics and Astronautics
44
Saget, Sylvie, and Marc Guyomard. "Goal-oriented dialog as a collaborative subordinated activity involving collective acceptance." Universität Potsdam, 2006. http://opus.kobv.de/ubp/volltexte/2006/1042/.
Full textAbstract:
Modeling dialog as a collaborative activity
consists notably in specifying the contain
of the Conversational Common Ground
and the kind of social mental state involved.In previous work (Saget, 2006), we claim that Collective Acceptance is the proper social attitude for modeling Conversational Common Ground in the particular case of goal-oriented dialog. We provide a formalization of Collective Acceptance, besides elements in order to integrate this attitude in a rational model of dialog are provided; and finally, a model of referential acts as being part of a collaborative activity is provided. The particular case of reference has been chosen in order to exemplify our claims.
45
Overall, Christopher. "Framing the Reference : An Analysis of Contextual and Goal Oriented Design." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-207617.
Full textAbstract:
We are all in a codependent, dysfunctional relationship with the technology we use. We have grown to be utterly dependent on it but technology is often designed withit’s needs and not the users in mind. But is there a method of design that will create usable systems or are we left in the hands of design auteurs with a magical touch? By analysing and contrasting the methodology of Contextual and Goal Oriented design I applied a version of both to a piece of software in order not only to improve the experience of using it but also to determine how well the methods could be applied and how they could be combined
46
Zoli, Enrico. "CAO=S un modello di progettazione goal oriented per interfacce web." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amslaurea.unibo.it/1243/.
Full text
47
Kim, Jun Beom. "A goal-oriented design evaluation framework for decision making under uncertainty." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80016.
Full text
48
Zhang, Tianhao. "Stability analysis of goal-oriented adaptivity for 2D incompressible flow problems." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-398226.
Full textAbstract:
In this thesis, we present a computational study of the stability of time-dependent dual problem for incompressible flow with low viscosity in 2D. The dual problem measures the sensitivity of an output functional with respect to numerical errors and is a key part of goal-oriented a posteriori error estimation. Our investigation shows that the dual problem associated with the computation of the drag force for the incompressible Navier-Stokes equations, which is approximated numerically using finite element discretization and residual based artificial viscosity stabilization technique, is unstable and exhibits blowup.
49
Eshky, Aciel. "Generative probabilistic models of goal-directed users in task-oriented dialogs." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/15947.
Full textAbstract:
A longstanding objective of human-computer interaction research is to develop better dialog systems for end users. The subset of user modelling research specifically, aims to provide dialog researchers with models of user behaviour to aid with the design and improvement of dialog systems. Where dialog systems are commercially deployed, they are often to be used by a vast number of users, where sub-optimal performance could lead to an immediate financial loss for the service provider, and even user alienation. Thus, there is a strong incentive to make dialog systems as functional as possible immediately, and crucially prior to their release to the public. Models of user behaviour fill this gap, by simulating the role of human users in the lab, without the losses associated with sub-optimal system performance. User models can also tremendously aid design decisions, by serving as tools for exploratory analysis of real user behaviour, prior to designing dialog software. User modelling is the central problem of this thesis. We focus on a particular kind of dialogs termed task-oriented dialogs (those centred around solving an explicit task) because they represent the frontier of current dialog research and commercial deployment. Users taking part in these dialogs behave according to a set of user goals, which specify what they wish to accomplish from the interaction, and tend to exhibit variability of behaviour given the same set of goals. Our objective is to capture and reproduce (at the semantic utterance level) the range of behaviour that users exhibit while being consistent with their goals. We approach the problem as an instance of generative probabilistic modelling, with explicit user goals, and induced entirely from data. We argue that doing so has numerous practical and theoretical benefits over previous approaches to user modelling which have either lacked a model of user goals, or have been not been driven by real dialog data. A principal problem with user modelling development thus far has been the difficulty in evaluation. We demonstrate how treating user models as probabilistic models alleviates some of these problems through the ability to leverage a whole raft of techniques and insights from machine learning for evaluation. We demonstrate the efficacy of our approach by applying it to two different kinds of task-oriented dialog domains, which exhibit two different sub-problems encountered in real dialog corpora. The first are informational (or slot-filling) domains, specifically those concerning flight and bus route information. In slot-filling domains, user goals take categorical values which allow multiple surface realisations, and are corrupted by speech recognition errors. We address this issue by adopting a topic model representation of user goals which allows us capture both synonymy and phonetic confusability in a unified model. We first evaluate our model intrinsically using held-out probability and perplexity, and demonstrate substantial gains over an alternative string-goal representations, and over a non-goal-directed model. We then show in an extrinsic evaluation that features derived from our model lead to substantial improvements over strong baseline in the task of discriminating between real dialogs (consistent dialogs) and dialogs comprised of real turns sampled from different dialogs (inconsistent dialogs). We then move on to a spatial navigational domain in which user goals are spatial trajectories across a landscape. The disparity between the representation of spatial routes as raw pixel coordinates and their grounding as semantic utterances creates an interesting challenge compared to conventional slot-filling domains. We derive a feature-based representation of spatial goals which facilitates reasoning and admits generalisation to new routes not encountered at training time. The probabilistic formulation of our model allows us to capture variability of behaviour given the same underlying goal, a property frequently exhibited by human users in the domain. We first evaluate intrinsically using held-out probability and perplexity, and find a substantial reduction in uncertainty brought by our spatial representation. We further evaluate extrinsically in a human judgement task and find that our model’s behaviour does not differ significantly from the behaviour of real users. We conclude by sketching two novel ideas for future work: the first is to deploy the user models as transition functions for MDP-based dialog managers; the second is to use the models as a means of restricting the search space for optimal policies, by treating optimal behaviour as a subset of the (distributions over) plausible behaviour which we have induced.
50
Soganci, Hasan Ali. "Goal Oriented Modeling Of Situation Awareness In A Command And Control System." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612713/index.pdf.
Full textAbstract:
This thesis presents a preliminary goal oriented modeling of situation awareness in a command and control system. Tropos, an agent oriented software development methodology, has been used for modeling. Use of Tropos allows us to represent, at the knowledge level, the Command and Control actors along with their goals and interdependencies. Through refinement we aim to derive an architectural design for the Situation Awareness component of an Air Defense Command and Control system. This work suggests that goal oriented methodologies can be successfully used in the modeling of the complex systems at the requirement analysis phase. By analyzing dependencies between Command and Control entities, it should be possible to improve the modularity of the Command and Control system architecture.