171 |
Modal satisifiability in a constraint logic environmentStevenson, Lynette 30 November 2007 (has links)
The modal satisfiability problem has to date been solved using either a specifically
designed algorithm, or by translating the modal logic formula into a different class
of problem, such as a first-order logic, a propositional satisfiability problem or a constraint
satisfaction problem. These approaches and the solvers developed to support
them are surveyed and a synthesis thereof is presented.
The translation of a modal K formula into a constraint satisfaction problem,
as developed by Brand et al. [18], is further enhanced. The modal formula, which
must be in conjunctive normal form, is translated into layered propositional formulae.
Each of these layers is translated into a constraint satisfaction problem and solved
using the constraint solver ECLiPSe. I extend this translation to deal with reflexive
and transitive accessibility relations, thereby providing for the modal logics KT and
S4. Two of the difficulties that arise when these accessibility relations are added
are that the resultant formula increases considerably in complexity, and that it is
no longer in conjunctive normal form (CNF). I eliminate the need for the conversion
of the formula to CNF and deal instead with formulae that are in negation normal
form (NNF). I apply a number of enhancements to the formula at each modal layer
before it is translated into a constraint satisfaction problem. These include extensive
simplification, the assignment of a single value to propositional variables that occur
only positively or only negatively, and caching the status of the formula at each node
of the search tree. All of these significantly prune the search space. The final results
I achieve compare favorably with those obtained by other solvers. / Computing / M.Sc. (Computer Science)
|
172 |
梭:在GMF 編輯器上以概念同步為基礎之即時模型同步輔助工具 / Shuttle: an Instant Model Synchronization Assistant for GMF Editors Based on Concept Synchronization高振益, Kao, Chen-yi Unknown Date (has links)
支援自動即時雙向工程(Roundtrip engineering,自即雙工)與重構,是當前先進整合開發環境的兩項殺手級特色。然而,當今自即雙工所實現的即時同步,僅針對特定塑模環境(如圖形使用者介面編排、物件類別設計等)量身訂製,並非任意同步。而精確字串匹配的彈性不足,也使以此為基礎的重構技術面臨些瓶頸。以上限制,使我們無法在跨模型、語言或文件的層次進行同步或重構,以滿足現今系統開發過程中的龐大資料同步需求。
我們的補強方案就是梭。這是一具在Eclipse【1】圖形化塑模框架(Graphical Modeling Framework,GMF【2】)下運作的塑模輔助引擎。梭可監聽GMF編輯器的模型元素輸入,同時連結元素與「同步概念」,以建立同步規則,最後依據規則,輸出視覺化的模型同步建議,輔助達成模型-模型間的資訊同步。
我們借鏡知識本體與資訊擷取「概念搜尋」中的「概念(Concept)」觀,提出了「概念同步」的想法。用以同步的「同步概念」,則延伸自詞網(WordNet【3】)的自然語言同義詞集合,代表著「擁有相關自然語言內容的模型元素間,應當同步」的關係。梭對模型元素屬性內容進行自然語言斷詞後,將斷詞結果投入詞網搜尋,以取得前述的相似內容。
梭以「概念」串連了原本難以即時同步的模型元素。梭的規則推論架構,也為未來的知識本體化、結構化模型同步推論、驗證,鋪好了道路。開發者的夢想──在開發的任何階段,系統皆能維持同步──離實現又邁進一步。 / Roundtrip engineering and refactoring are killer features of modern IDE systems. Most implementations of these features nowadays, however, are tailor-made for scenarios like GUI or UML diagramming ones and hence are hard to generalize; moreover, existing refactoring ways are usually restricted to exact string matching and are thus unable to synchronize artifacts with different occurrences of the equivalent term. These problems inhibit today's IDEs from supporting developments requiring synchronization across models, languages and documents.
Shuttle is a modeling assistant developed by us running on Eclipse GMF editors. It monitors users' input model elements and link them by related concepts automatically. Later modifications of an element will trigger rules to find the others under the same related concepts and result in various synchronization recommendations which developers may choose to take to enforce consistency among parts of the developed system.
The linking-triggering mechanism of Shuttle is based on what we call concept synchronization (CS), which is inspired by the idea of concept in ontology and concept search in information retrieval. CS captures the simple idea that model elements with related text descriptions would be very likely modified accordingly if one of them is changed by the developer. To detect all others related to a target model element, we establish a many-to-many mapping between elements and WordNet Synsets【3】according to element text descriptions ahead of time and then, with WordNet’s help【40】, all elements related to the target can be found by looking for those mapped to a Synset associated with the target.
|
173 |
Indirect Imaging of Cataclysmic Variable Stars / Indirekte Abbildung kataklysmischer veränderlicher SterneKube, Jens 17 June 2002 (has links)
No description available.
|
174 |
Modal satisifiability in a constraint logic environmentStevenson, Lynette 30 November 2007 (has links)
The modal satisfiability problem has to date been solved using either a specifically
designed algorithm, or by translating the modal logic formula into a different class
of problem, such as a first-order logic, a propositional satisfiability problem or a constraint
satisfaction problem. These approaches and the solvers developed to support
them are surveyed and a synthesis thereof is presented.
The translation of a modal K formula into a constraint satisfaction problem,
as developed by Brand et al. [18], is further enhanced. The modal formula, which
must be in conjunctive normal form, is translated into layered propositional formulae.
Each of these layers is translated into a constraint satisfaction problem and solved
using the constraint solver ECLiPSe. I extend this translation to deal with reflexive
and transitive accessibility relations, thereby providing for the modal logics KT and
S4. Two of the difficulties that arise when these accessibility relations are added
are that the resultant formula increases considerably in complexity, and that it is
no longer in conjunctive normal form (CNF). I eliminate the need for the conversion
of the formula to CNF and deal instead with formulae that are in negation normal
form (NNF). I apply a number of enhancements to the formula at each modal layer
before it is translated into a constraint satisfaction problem. These include extensive
simplification, the assignment of a single value to propositional variables that occur
only positively or only negatively, and caching the status of the formula at each node
of the search tree. All of these significantly prune the search space. The final results
I achieve compare favorably with those obtained by other solvers. / Computing / M.Sc. (Computer Science)
|
175 |
Domain Specific Modeling Support for ArCon / Stöd för domänspecifik modellering med ArConAzari, Leila January 2013 (has links)
One important phase in software development process is to create a design model of the system which follows all the architectural rules. Often the architectural rules are defined by the system architect and the system model is designed by the system designer. The architect defines the rules in a text file where no standard or pattern is followed. Therefore, there is always the risk of violating the architectural rules by the designer. So manual reviews on the system model should be done by the architect to ensure the system model is valid.In order to remove this manual checking which can be erroneous and time consuming ArCon (Architecture Conformance Checker) was developed by Combitech AB. ArCon is a tool which lets the architect define the architectural rules in the format of UML (Unified Modeling Language) models where the elements of the model have different meaning than the standard UML. ArCon can read this model and extract architectural rules from it and check the system model against those rules and then print all the rule violations.ArCon is an open source tool i.e. free for everyone to download and use. Currently, it supports Papyrus as the UML modeling tool. Papyrus is integrated to Eclipse platform and is a general purpose modeling tool. It supports users with all types of UML diagrams and elements.The idea for this thesis work was to implement a new feature for ArCon in order to facilitate the design process for system designers. The feature should provide the system designers only those types of elements which they are permitted to add to a specific fraction of the system model. The list of permitted element types should be extracted from the architecture model where all the architectural rules are defined in advance. This new support in ArCon was named Domain Specific Modeling (DSM) support.To evaluate the effect of DSM support on the system designers performance a few test sessions, called usability tests, were performed. The participants in the test sessions were a representative sample of software designers. After analyzing the data collected from the test sessions, the pros and cons of the new support were discovered. Furthermore, a few new ideas for enhancing DSM support were generated.
|
176 |
Die kerkorde en die kerklike reg in die Nederduitsch Hervormde Kerk van Afrika aan die hand van die Presbiteriaal-sinodale kerkbegrip (Afrikaans)Van Wyk, B.J. (Barend Jacobus), 1946- 17 May 2005 (has links)
This dissertation presents a contribution to measure the church order and ecclesiastical law in the Nederduitsch Hervormde Church of Africa against the Presbyterial-synodal understanding of church government. The latter forms the canonical outline of Biblical Reformative Theology as an indication of the theology currently practiced in the Nederduitsch Hervormde Church of Africa. At the outset a historical overview is given on the origin and development of the Presbyterial-synodal church government that was mainly shaped by Calvin in Geneva and later elaborated upon in Paris, and then further developed in the Netherlands. Reference is also made to the Algemeen Reglement of 1816, the 1951 church order of the Nederlandse Hervormde Church, as well as the 1951 church order of the Nederduitsch Hervormde Church of Africa. A description is given of what is understood by Biblical Reformative Theology as a revelation theology, which objectively assesses man as a sinner redeemed by grace through Jesus Christ. In this regard the church is willed by God and exists in eschatological expectation when Jesus will be everything in everyone. An exposition of Presbyterial-synodal church government calls attention to the church's existence from the beginning of time, founded by God, and it is therefore of a covenantal nature. Offices are seen as gifts from God to mankind to bring those who had been saved by Jesus Christ to faith in Him. Office bearers gather together in an assembly of offices to govern the church according to the Word of God. The church is a confessing church who confesses its faith with the church of all ages, as summarized in the ecumenical creeds and the three formularies of unity. Reference is also made here to the sacraments, ceremonies, church festivals and days of remembrance. The chapter concludes with a reference to church discipline as well as the relationship between church and state. Finally the church order and ecclesiastical law in the Nederduitsch Hervormde Church of Africa is measured against the previous definition of the Presbyterial-synodal understanding of church government. / Thesis (PhD (Theology))--University of Pretoria, 2006. / Church History and Church Policy / unrestricted
|
177 |
Lokalizace Vstupního profilu normy ISO/IEC 29110 do češtiny a jeho publikace v Eclipse Process Framework Composer / Localization Entry profile of ISO/IEC 29110 standard and its publication in Eclipse Process Framework ComposerŠimko, David January 2012 (has links)
The aim of diploma thesis is translation, customization, realization and publication English version of Entry profile which is part of ISO/IEC 29110 in Eclipse Process Framework Composer tool with own methodology of realization so that profile will be available to Czech expert public. The goals are achieved by conversion of Entry Profile in Eclipse Process Framework Composer tool into web form. The first benefit of diploma thesis is description and characteristics of Entry Profile which is part of ISO/IEC 29110 standard, which serves to profile understanding and its practical usage. The second benefit is creation own methodology which allows Entry Profile conversion into electronic version. For profile realization is used Eclipse Process Framework Composer tool. The third benefit is detail reference book of profile realization in Eclipse Process Framework Composer. The main benefit is Entry Profile created in web form, which is available to expert public. At the beginning of diploma thesis is described Entry Profile, its goal, structure and implementation packages. In third chapter is described concept of Unified Method Architecture which serves as theoretical input for chapter about Eclipse Process Framework Composer tool. In fourth chapter is characterized tool for management and maintenance methodology - Eclipse Process Framework Composer. Follows chapter about methodology of profile realization in Eclipse Process Framework Composer. Sixth chapter is detail reference book realization of Entry Profile in Eclipse Process Framework Composer. In following chapter is profile published in web form. Eight chapter evaluates realization and publication in Eclipse Process Framework Composer tool.
|
178 |
Inference propojení komponent / Component Interconnection InferenceOlšarová, Nela January 2012 (has links)
The Master Thesis deals with the design of hardware component interconnection inference algorithm that is supposed to be used in the FPGA schema editor that was integrated into educational integrated development environment VLAM IDE. The aim of the algorithm is to support user by finding an optimal interconnection of two given components. The editor and the development environment are implemented as an Eclipse plugin using GMF framework. A brief description of this technologies and the embedded systems design are followed by the design of the inference algorithm. This problem is a topic of combinatorial optimization, related to the bipartite matching and assignment problem. After this, the implementation of the algorithm is described, followed by tests and a summary of achieved results.
|
179 |
Model-Based Early Validation and Verification of Design Decisions for Cross-Disciplinary StakeholdersStenlund, Alexander January 2024 (has links)
Systems engineering becomes more challenging as system engineers must tackle increasingly growing and complex systems while balancing stakeholder needs, dependability, costs, and much more. Engineering decisions at early stages become important as their impact can affect the product's entire life cycle. Model-Based System Engineering (MBSE) is a way to capture this system complexity and explore how different engineering decisions affect a system. With this in mind, this thesis will explore how MBSE can capture engineering decisions and their impact at early stages of development and what insight can be gained into a system. This is done by exploratively creating a concept, using it on a toy example to get direct feedback on its performance, and refining the concept before evaluating it in a case study. The case study evaluates the concept in an industrial context through a focus group and receives direct industry feedback. The modelling concept is implemented in Papyrus Eclipse as a Unified Modeling Language (UML) profile to capture concept-specific details and an Eclipse plugin. This implementation is to retrieve and process data from the modelled system. This is used to answer impact questions of choices, such as: "How much does this parameter change if component X is exchanged for another?".The evaluation of the concept was generally positive and gave valuable feedback and possible future directions of the concept. This includes the opinion that a spread sheet gives a better overview of the system and ways to expand the tool though parameterised relations and other suggestions. The thesis in the end presents, one way that MBSE can be used to support the analysis of early cross-disciplinary models, and two major insights which could be gained, namely risk and constraints.
|
180 |
Life after Harry / Eine Gattungsdiskussion zeitgenössischer Kinder- und Jugendliteratur in der Post-Potter-Ära / Life After Harry / Contemporary Children’s Literature and Young Adult Fiction in the Post-Potter Era – a Discussion of Genre AspectsFitz, Victoria 03 March 2015 (has links)
No description available.
|
Page generated in 0.019 seconds