O objetivo deste trabalho é verificar os resultados fornecidos pelo programa computacional FRAPCON-3, hoje na versão 5, utilizado no processo de simulação do comportamento de varetas combustíveis de reatores refrigerados a água pressurizada (Pressurized Water Reactor PWR), sob situações operacionais de regime permanente, em condições de alta queima. Para realizar a verificação, foi utilizada a base de dados FUMEX-III, que fornece dados relativos a experimentos realizados com diversos tipos de combustíveis nucleares, submetidos a diversas condições operacionais. Através dos resultados obtidos na simulação do programa FRAPCON-3.5 e da sua comparação com os dados experimentais da base FUMEX-III, foi possível constar que o programa possui boa capacidade de predizer o comportamento operacional da vareta combustível em regime permanente a altas queimas. O trabalho consiste também em verificar a correlação entre UO2 e UO2-7%Gd2O3 na análise dos modelos que simulam o comportamento das pastilhas combustível. A adição do óxido de gadolínio ou gadolínia (Gd2O3), constitui-se na opção tecnológica mais solidamente consagrada e hoje comum em várias centrais nucleares. Por meio dos resultados obtidos nas simulações computacionais foram apresentadas e discutidas a influência das propriedades do UO2 e UO2-7%Gd2O3, quanto à temperatura no centro do combustível, liberação de gás de fissão na vareta, temperatura média do revestimento, volume interno e pressão interna da vareta combustível. / The objective of this work is to verify the results provided by the computer program FRAPCON-3, now in version 5, used in the simulation process of the behavior of fuel rods of pressurized water reactors - PWR permanent, in conditions of high burn. In order to carry out the verification, the FUMEX-III database was used, which provides data on experiments performed with different types of nuclear fuel, under different operating conditions. The results obtained in the simulation of the FRAPCON-3.5 program and its comparison with the experimental data of the FUMEX-III base showed that the program has a good ability to predict the operational behavior of the fuel rod in a steady state at high burn. The work also consists in verifying the correlation between UO2 and UO2-7%Gd2O3 in the analysis of models that simulate the behavior of fuel pellets. The addition of gadolinium oxide (Gd2O3) constitutes the most solidly established and now common technological option in several nuclear power plants. The influence of the properties of UO2 and UO2-7%Gd2O3 on the temperature at the center of the fuel, fission gas release on the rod, average coating temperature, internal volume and pressure were presented and discussed. of the fuel rod.

by Lam, Hin-ki Isaac. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references (leaves 219-220). / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- The Problem --- p.1 / Chapter 1.2 --- Related Works --- p.3 / Chapter 1.3 --- Contribution of the Present Study --- p.8 / Chapter 1.4 --- Outline of the Thesis --- p.8 / Chapter Chapter 2 --- Nontermination and Recursive Definition --- p.11 / Chapter 2.1 --- Prolog Execution Model --- p.11 / Chapter 2.2 --- Nontermination --- p.15 / Chapter 2.3 --- Exit Condition --- p.21 / Chapter 2.4 --- Exit-Reaching Process --- p.29 / Chapter 2.5 --- Parameter Based Detection --- p.35 / Chapter Chapter 3 --- Parameter Analysis --- p.38 / Chapter 3.1 --- Parameter Links --- p.39 / Chapter 3.1.1 --- Parameter Links and Parameter Modifying Process --- p.39 / Chapter 3.1.2 --- Parameter Links of Multi-Parameters --- p.43 / Chapter 3.1.3 --- Parameter Links in Indirect Recursive Definition --- p.44 / Chapter 3.1.4 --- Parameter Links with Special Parameters --- p.46 / Chapter 3.1.5 --- Parameter Links of the Same Name Parameters --- p.47 / Chapter 3.1.6 --- The Significance of Parameter Links --- p.49 / Chapter 3.2 --- Cyclic Parameter Links --- p.51 / Chapter 3.3 --- Parameter Link Detection --- p.58 / Chapter 3.3.1 --- Graph Technique --- p.58 / Chapter 3.3.1.1 --- Preliminaries --- p.58 / Chapter 3.3.1.2 --- on Parameter Links --- p.59 / Chapter 3.3.2 --- Algorithms --- p.62 / Chapter Chapter 4 --- Data Analysis --- p.70 / Chapter 4.1 --- Data Links --- p.72 / Chapter 4.1.1 --- The Direct Recursive Definition Case --- p.76 / Chapter 4.1.1.1 --- Subgoal Procedures with Facts Alone --- p.76 / Chapter 4.1.1.2 --- Procedures with Rules --- p.79 / Chapter 4.1.2 --- The Indirect Recursive Definition Case --- p.84 / Chapter 4.2 --- on the Difference between Pure and General Prolog --- p.86 / Chapter 4.3 --- Data Link Significance --- p.89 / Chapter 4.4 --- Connected Data-link Lists --- p.92 / Chapter 4.4.1 --- Data Links and Connected Data-link Lists --- p.92 / Chapter 4.4.1.1 --- Connected Data-link Lists and Data Transfer Sequence --- p.95 / Chapter 4.4.1.2 --- Connected Data-link Lists and Backtracking --- p.97 / Chapter 4.4.1.3 --- Connected Data-link Lists and the Recursion Result --- p.99 / Chapter 4.4.2 --- Cyclic and Non-Cyclic Connected Data-link Lists --- p.100 / Chapter 4.4.2.1 --- Non-Cyclic Connected Data-link Lists and Exit Conditions --- p.102 / Chapter 4.4.2.2 --- Cyclic Connected Data-link Lists and Nontermination --- p.104 / Chapter 4.4.3 --- Multi-Connected Data-link Lists --- p.107 / Chapter 4.4.3.1 --- in One Cyclic Parameter Link --- p.107 / Chapter 4.4.3.2 --- in Multi-Cyclic Parameter Links --- p.115 / Chapter 4.4.3.3 --- The Case of Multiple Recursive Subgoals in the Same Rule --- p.120 / Chapter 4.5. --- Special Parameters and Data Links --- p.125 / Chapter 4.5.1. --- Data Links with Special Parameters Only --- p.126 / Chapter 4.5.2 --- Data Links with Both Special Parameters and Subgoals --- p.136 / Chapter 4.6 --- Data Links and Infinite Data Transfer Sequence Detection --- p.142 / Chapter CHAPTER 5 --- Special Cases --- p.150 / Chapter 5.1 --- Interdependent Cyclic Parameter Links --- p.150 / Chapter 5.1.1 --- Interdependent Cyclic Parameter Links through Common Parameters --- p.151 / Chapter 5.1.1.1 --- Interdependency between Cyclic and Non-cyclic Parameter Links and Interdependency between Cyclic Parameter Link and Subgoals --- p.158 / Chapter 5.1.1.2 --- Interdependency between Cyclic Parameter Links --- p.165 / Chapter 5.1.1.2.1 --- Lengths of Cyclic Connected- data Links in Different Ratios --- p.171 / Chapter 5.1.1.2.2 --- Cyclic Parameter Links with Lengths in Different Ratios --- p.182 / Chapter 5.1.2 --- Interdependent Cyclic Parameter Links through Common Subgoals --- p.196 / Chapter 5.1.3 --- Interdependent Cyclic Parameter Links with Special Parameters --- p.202 / Chapter 5.2 --- A Special Case of Cyclic Parameter Links established through Special Parameters --- p.208 / Chapter CHAPTER 6 --- Discussion and Conclusion --- p.213 / Chapter 6.1 --- The Results and Implications --- p.213 / Chapter 6.2 --- Limitations and Future Research --- p.215 / Chapter 6.3 --- Conclusion --- p.217 / Reference --- p.219

by Kwan Kar Kin, Karl. / Thesis (M.Ph.)--Chinese University of Hong Kong, 1987. / Bibliography: leaves 77-79. / Library's copy:Disk for circulation (3.5 in.)

by Lam Chin-keung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1995. / Includes bibliographical references (leaves 129-135 (2nd gp.)). / ACKNOWLEDGMENTS --- p.I / ABSTRACT --- p.II / TABLE OF CONTENTS --- p.III / LIST OF FIGURES --- p.VI / LIST OF TABLES --- p.VIII / Chapter CHAPTER 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- Motivations --- p.1 / Chapter 1.2 --- Objectives --- p.3 / Chapter 1.3 --- More to go --- p.3 / Chapter 1.4 --- Chapter Summary --- p.4 / Chapter CHAPTER 2 --- RELATED WORK --- p.6 / Chapter 2.1 --- Chinese Related Work --- p.6 / Chapter 2.1.1 --- Chinese Natural Language --- p.6 / Chapter 2.1.2 --- Chinesized Query Language From English --- p.7 / Chapter 2.2 --- High Level Database Query Language --- p.8 / Chapter 2.2.1 --- Relational Algebra vs Relational Calculus --- p.9 / Chapter 2.2.2 --- Procedural vs Declarative --- p.10 / Chapter 2.2.3 --- Natural Language (NL) vs Restricted Natural Language (RNL) --- p.11 / Chapter 2.3 --- Database Query Interface --- p.13 / Chapter 2.3.1 --- Linear Textual Interface --- p.13 / Chapter 2.3.2 --- Form-based Interface --- p.14 / Chapter 2.3.3 --- Graphical Interface --- p.14 / Chapter 2.4 --- Remarks --- p.14 / Chapter CHAPTER 3 --- DESIGN PRINCIPLES --- p.16 / Chapter 3.1 --- Underlying Data Model of the new language --- p.16 / Chapter 3.2 --- Problems Under Attack --- p.17 / Chapter 3.2.1 --- Naturalness --- p.17 / Chapter 3.2.2 --- Procedural vs Declarative --- p.19 / Chapter 3.2.3 --- Supports of Chinese Characters --- p.21 / Chapter 3.3 --- Design Principles --- p.22 / Chapter 3.4 --- Chapter Summary --- p.26 / Chapter CHAPTER 4 --- LANGUAGE DEFINITION --- p.28 / Chapter 4.1 --- Language Overvew --- p.28 / Chapter 4.2 --- The Data Manipulation Language --- p.29 / Chapter 4.2.1 --- Relational Operators --- p.30 / Chapter 4.2.2 --- Rail-Track Diagram of Chiql --- p.32 / Chapter 4.2.3 --- The 11-template --- p.33 / Chapter 4.2.4 --- Chiql Examples --- p.37 / Chapter 4.2.5 --- Common Language Constructs --- p.39 / Chapter 4.2.6 --- ONE issue about GROUP BY and RESTRICTION --- p.41 / Chapter 4.3 --- Other Language Features --- p.42 / Chapter 4.3.1 --- Aggregate Functions --- p.43 / Chapter 4.3.2 --- Attribute Alias --- p.44 / Chapter 4.3.3 --- Conditions in Chinese --- p.45 / Chapter 4.3.4 --- Unquantifed Predicates --- p.45 / Chapter 4.3.5 --- sorting --- p.47 / Chapter 4.4 --- Treatment of Quantified Predicates --- p.48 / Chapter 4.5 --- The Data Definition Language --- p.52 / Chapter 4.5.1 --- Create Table --- p.52 / Chapter 4.5.2 --- Drop Table --- p.54 / Chapter 4.5.3 --- Alter Table --- p.54 / Chapter 4.5.4 --- Insert Row --- p.56 / Chapter 4.5.5 --- Delete Row --- p.56 / Chapter 4.5.6 --- Update Row --- p.57 / Chapter 4.5.7 --- Remarks on DDL --- p.58 / Chapter 4.6 --- Chapter Summary --- p.59 / Chapter CHAPTER 5 --- END-USER INTERFACE --- p.61 / Chapter 5.1 --- EUI Overview --- p.61 / Chapter 5.2 --- Design Principles --- p.62 / Chapter 5.2.1 --- Language Independent Aspects --- p.62 / Chapter 5.2.2 --- Language Dependent Aspects --- p.64 / Chapter 5.3 --- Complex Condition Handling --- p.68 / Chapter 5.4 --- Input Sequences of the EUI --- p.71 / Chapter 5.5 --- Query Formulation： An Example --- p.73 / Chapter 5.6 --- Chapter Summary --- p.85 / Chapter CHAPTER 6 --- CHIQL TO SQL TRANSLATIONS --- p.86 / Chapter 6.1 --- Related Work --- p.87 / Chapter 6.2 --- Translation Overview --- p.87 / Chapter 6.2.1 --- "Pass One:Mapping( Input = Chiql, Output = multi-statement SQL)" --- p.89 / Chapter 6.2.2 --- "Pass Two:Nesting(Input = multi-statement SQL, Output = single statement SQL)" --- p.92 / Chapter 6.2.3 --- Technical Difficulties in Chiql/SQL Translation --- p.99 / Chapter 6.3 --- Chapter Summary --- p.106 / Chapter CHAPTER 7 --- EVALUATION --- p.108 / Chapter 7.1 --- Expressiveness Test --- p.108 / Chapter 7.1.1 --- Results --- p.109 / Chapter 7.1.2 --- Implications --- p.111 / Chapter 7.2 --- Usability Evaluation --- p.111 / Chapter 7.2.1 --- Evaluation Methodology --- p.112 / Chapter 7.2.2 --- Result:Completion Time --- p.113 / Chapter 7.2.3 --- Result: Additional Help --- p.116 / Chapter 7.2.4 --- Result： Query Error --- p.116 / Chapter 7.2.5 --- Result： Overall Score --- p.118 / Chapter 7.2.6 --- User Comments --- p.120 / Chapter 7.3 --- Chapter Summary --- p.120 / Chapter CHAPTER 8 --- CONCLUSIONS --- p.122 / Chapter 8.1 --- Thesis Conclusions --- p.122 / Chapter 8.2 --- Future Work --- p.124 / REFERENCES / APPENDIX

Chiu, Yiu Man Edmund. / Thesis submitted in: December 1999. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (leaves 269-248). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgments --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- The Beginning Story --- p.2 / Chapter 1.2 --- Background --- p.3 / Chapter 1.2.1 --- History of Nonmonotonic Reasoning --- p.3 / Chapter 1.2.2 --- Formalizations of Nonmonotonic Reasoning --- p.6 / Chapter 1.2.3 --- Belief Revision --- p.13 / Chapter 1.2.4 --- Network Representation of Knowledge --- p.17 / Chapter 1.2.5 --- Reference from Logic Programming --- p.21 / Chapter 1.2.6 --- Recent Work on Network-type Automatic Reasoning Sys- tems --- p.22 / Chapter 1.3 --- A Novel Inference Network Approach --- p.23 / Chapter 1.4 --- Objectives --- p.23 / Chapter 1.5 --- Organization of the Thesis --- p.24 / Chapter 2 --- The Predicate Inference Network PIN --- p.25 / Chapter 2.1 --- Preliminary Terms --- p.26 / Chapter 2.2 --- Overall Structure --- p.27 / Chapter 2.3 --- Object Layer --- p.29 / Chapter 2.3.1 --- Virtual Object --- p.31 / Chapter 2.4 --- Predicate Layer --- p.33 / Chapter 2.4.1 --- Node Values --- p.34 / Chapter 2.4.2 --- Information Source --- p.35 / Chapter 2.4.3 --- Belief State --- p.36 / Chapter 2.4.4 --- Predicates --- p.37 / Chapter 2.4.5 --- Prototypical Predicates --- p.37 / Chapter 2.4.6 --- Multiple Inputs for a Single Belief --- p.39 / Chapter 2.4.7 --- External Program Call --- p.39 / Chapter 2.5 --- Variable Layer --- p.40 / Chapter 2.6 --- Inter-Layer Links --- p.42 / Chapter 2.7 --- Chapter Summary --- p.43 / Chapter 3 --- Computation for PIN --- p.44 / Chapter 3.1 --- Computation Functions for Propagation --- p.45 / Chapter 3.1.1 --- Computational Functions for Combinative Links --- p.45 / Chapter 3.1.2 --- Computational Functions for Alternative Links --- p.49 / Chapter 3.2 --- Applying the Computation Functions --- p.52 / Chapter 3.3 --- Relations Represented in PIN --- p.55 / Chapter 3.3.1 --- Relations Represented by Combinative Links --- p.56 / Chapter 3.3.2 --- Relations Represented by Alternative Links --- p.59 / Chapter 3.4 --- Chapter Summary --- p.61 / Chapter 4 --- Dynamic Knowledge Update --- p.62 / Chapter 4.1 --- Operations for Knowledge Update --- p.63 / Chapter 4.2 --- Logical Expression --- p.63 / Chapter 4.3 --- Applicability of Operators --- p.64 / Chapter 4.4 --- Add Operation --- p.65 / Chapter 4.4.1 --- Add a fully instantiated single predicate proposition with no virtual object --- p.66 / Chapter 4.4.2 --- Add a fully instantiated pure disjunction --- p.68 / Chapter 4.4.3 --- Add a fully instantiated expression which is a conjunction --- p.71 / Chapter 4.4.4 --- Add a human biased relation --- p.74 / Chapter 4.4.5 --- Add a single predicate expression with virtual objects --- p.76 / Chapter 4.4.6 --- Add a IF-THEN rule --- p.80 / Chapter 4.5 --- Remove Operation --- p.88 / Chapter 4.5.1 --- Remove a Belief --- p.88 / Chapter 4.5.2 --- Remove a Rule --- p.91 / Chapter 4.6 --- Revise Operation --- p.94 / Chapter 4.6.1 --- Revise a Belief --- p.94 / Chapter 4.6.2 --- Revise a Rule --- p.96 / Chapter 4.7 --- Consistency Maintenance --- p.97 / Chapter 4.7.1 --- Logical Suppression --- p.98 / Chapter 4.7.2 --- Example on Handling Inconsistent Information --- p.99 / Chapter 4.8 --- Chapter Summary --- p.102 / Chapter 5 --- Knowledge Query --- p.103 / Chapter 5.1 --- Domains of Quantification --- p.104 / Chapter 5.2 --- Reasoning through Recursive Rules --- p.109 / Chapter 5.2.1 --- Infinite Looping Control --- p.110 / Chapter 5.2.2 --- Proof of the finite termination of recursive rules --- p.111 / Chapter 5.3 --- Query Functions --- p.117 / Chapter 5.4 --- Type I Queries --- p.119 / Chapter 5.4.1 --- Querying a Simple Single Predicate Proposition (Type I) --- p.122 / Chapter 5.4.2 --- Querying a Belief with Logical Connective(s) (Type I) --- p.128 / Chapter 5.5 --- Type II Queries --- p.132 / Chapter 5.5.1 --- Querying Single Predicate Expressions (Type II) --- p.134 / Chapter 5.5.2 --- Querying an Expression with Logical Connectives (Type II) --- p.143 / Chapter 5.6 --- Querying an Expression with Virtual Objects --- p.152 / Chapter 5.6.1 --- Type I Queries Involving Virtual Object --- p.152 / Chapter 5.6.2 --- Type II Queries involving Virtual Objects --- p.156 / Chapter 5.7 --- Chapter Summary --- p.157 / Chapter 6 --- Uniqueness and Finite Termination --- p.159 / Chapter 6.1 --- Proof Structure --- p.160 / Chapter 6.2 --- Proof for Completeness and Finite Termination of Domain Search- ing Procedure --- p.161 / Chapter 6.3 --- Proofs for Type I Queries --- p.167 / Chapter 6.3.1 --- Proof for Single Predicate Expressions --- p.167 / Chapter 6.3.2 --- Proof of Type I Queries on Expressions with Logical Con- nectives --- p.172 / Chapter 6.3.3 --- General Proof for Type I Queries --- p.174 / Chapter 6.4 --- Proofs for Type II Queries --- p.175 / Chapter 6.4.1 --- Proof for Type II Queries on Single Predicate Expressions --- p.176 / Chapter 6.4.2 --- Proof for Type II Queries on Disjunctions --- p.178 / Chapter 6.4.3 --- Proof for Type II Queries on Conjunctions --- p.179 / Chapter 6.4.4 --- General Proof for Type II Queries --- p.181 / Chapter 6.5 --- Proof for Queries Involving Virtual Objects --- p.182 / Chapter 6.6 --- Uniqueness and Finite Termination of PIN Queries --- p.183 / Chapter 6.7 --- Chapter Summary --- p.184 / Chapter 7 --- Lifschitz's Benchmark Problems --- p.185 / Chapter 7.1 --- Structure --- p.186 / Chapter 7.2 --- Default Reasoning --- p.186 / Chapter 7.2.1 --- Basic Default Reasoning --- p.186 / Chapter 7.2.2 --- Default Reasoning with Irrelevant Information --- p.187 / Chapter 7.2.3 --- Default Reasoning with Several Defaults --- p.188 / Chapter 7.2.4 --- Default Reasoning with a Disabled Default --- p.190 / Chapter 7.2.5 --- Default Reasoning in Open Domain --- p.191 / Chapter 7.2.6 --- Reasoning about Unknown Exceptions I --- p.193 / Chapter 7.2.7 --- Reasoning about Unknown Exceptions II --- p.194 / Chapter 7.2.8 --- Reasoning about Unknown Exceptions III --- p.196 / Chapter 7.2.9 --- Priorities between Defaults --- p.198 / Chapter 7.2.10 --- Priorities between Instances of a Default --- p.199 / Chapter 7.2.11 --- Reasoning about Priorities --- p.199 / Chapter 7.3 --- Inheritance --- p.200 / Chapter 7.3.1 --- Linear Inheritance --- p.200 / Chapter 7.3.2 --- Tree-Structured Inheritance --- p.202 / Chapter 7.3.3 --- One-Step Multiple Inheritance --- p.203 / Chapter 7.3.4 --- Multiple Inheritance --- p.204 / Chapter 7.4 --- Uniqueness of Names --- p.205 / Chapter 7.4.1 --- Unique Names Hypothesis for Objects --- p.205 / Chapter 7.4.2 --- Unique Names Hypothesis for Functions --- p.206 / Chapter 7.5 --- Reasoning about Action --- p.206 / Chapter 7.6 --- Autoepistemic Reasoning --- p.206 / Chapter 7.6.1 --- Basic Autoepistemic Reasoning --- p.206 / Chapter 7.6.2 --- Autoepistemic Reasoning with Incomplete Information --- p.207 / Chapter 7.6.3 --- Autoepistemic Reasoning with Open Domain --- p.207 / Chapter 7.6.4 --- Autoepistemic Default Reasoning --- p.208 / Chapter 8 --- Comparison with PROLOG --- p.214 / Chapter 8.1 --- Introduction of PROLOG --- p.215 / Chapter 8.1.1 --- Brief History --- p.215 / Chapter 8.1.2 --- Structure and Inference --- p.215 / Chapter 8.1.3 --- Why Compare PIN with Prolog --- p.216 / Chapter 8.2 --- Representation Power --- p.216 / Chapter 8.2.1 --- Close World Assumption and Negation as Failure --- p.216 / Chapter 8.2.2 --- Horn Clauses --- p.217 / Chapter 8.2.3 --- Quantification --- p.218 / Chapter 8.2.4 --- Build-in Functions --- p.219 / Chapter 8.2.5 --- Other Representation Issues --- p.220 / Chapter 8.3 --- Inference and Query Processing --- p.220 / Chapter 8.3.1 --- Unification --- p.221 / Chapter 8.3.2 --- Resolution --- p.222 / Chapter 8.3.3 --- Computation Efficiency --- p.225 / Chapter 8.4 --- Knowledge Updating and Consistency Issues --- p.227 / Chapter 8.4.1 --- PIN and AGM Logic --- p.228 / Chapter 8.4.2 --- Knowledge Merging --- p.229 / Chapter 8.5 --- Chapter Summary --- p.229 / Chapter 9 --- Conclusion and Discussion --- p.230 / Chapter 9.1 --- Conclusion --- p.231 / Chapter 9.1.1 --- General Structure --- p.231 / Chapter 9.1.2 --- Representation Power --- p.231 / Chapter 9.1.3 --- Inference --- p.232 / Chapter 9.1.4 --- Dynamic Update and Consistency --- p.233 / Chapter 9.1.5 --- Soundness and Completeness Versus Efficiency --- p.233 / Chapter 9.2 --- Discussion --- p.234 / Chapter 9.2.1 --- Different Selection Criteria --- p.234 / Chapter 9.2.2 --- Link Order --- p.235 / Chapter 9.2.3 --- Inheritance Reasoning --- p.236 / Chapter 9.3 --- Future Work --- p.237 / Chapter 9.3.1 --- Implementation --- p.237 / Chapter 9.3.2 --- Application --- p.237 / Chapter 9.3.3 --- Probabilistic and Fuzzy PIN --- p.238 / Chapter 9.3.4 --- Temporal Reasoning --- p.238 / Bibliography --- p.239

In this project,European Call and Put options,and also American Call and Put options have been priced by some finite difference methods using the C++ programming language.The report describes the following:The theory behind the pricing of options,some pricing methods,and how some finite difference pricing methods have been implemented in C++.

"As software systems become more complex, so does the task of understanding them. To modify even a simple component of a complex system, at least a rudimentary understanding of the structure and behavior of the whole system is necessary. Although currently available development tools can provide a static representation of a complex system, these utilities are severely limited and prohibitively expensive. As a result, most programmers working on large software systems today resort to classic debuggers and time-consuming plain-text searches through hundreds or thousands of source files. This proposal describes a software development environment that uses static representations of hierarchically structured source code side by side with dynamic visualizations of software systems as they run. This environment provides an intuitive, visual means of easily comprehending complex systems, and has been provided as an open-source development tool for both professionals and students of software engineering."

Term rewriting -- an expressive language based on equational logic -- can be used to author and analyze policies that are part of an access control system. Maude is a simple, yet powerful, reflective programming language based on term rewriting that models systems along with the subjects, objects and actions within them. We specify the behavior of the system as a theory defined by conditional rewrite rules, and define the access control policy as an equational theory in a separate module. The tools that Maude provides, such as the Maude Model Checker and the Sufficient Completeness Checker, are used to reason about the behavior and verify properties of access control systems in an automated manner.

Typescript, etc. / Digitized by Kansas Correctional Industries

Typescript, etc. / Digitized by Kansas Correctional Industries