Dissertations / Theses on the topic 'Rule based systems'
To see the other types of publications on this topic, follow the link: Rule based systems.
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 'Rule based systems.'
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
Wang, Olivier. "Adaptive Rules Model : Statistical Learning for Rule-Based Systems." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLX037/document.
Full textAbstract:
Les Règles Métiers (Business Rules en anglais, ou BRs) sont un outil communément utilisé dans l’industrie pour automatiser des prises de décisions répétitives. Le problème de l’adaptation de bases de règles existantes à un environnement en constante évolution est celui qui motive cette thèse. Des techniques existantes d’Apprentissage Automatique Supervisé peuvent être utilisées lorsque cette adaptation se fait en toute connaissance de la décision correcte à prendre en toute circonstance. En revanche, il n’existe actuellement aucun algorithme, qu’il soit théorique ou pratique, qui puisse résoudre ce problème lorsque l’information connue est de nature statistique, comme c’est le cas pour une banque qui souhaite contrôler la proportion de demandes de prêt que son service de décision automatique fait passer à des experts humains. Nous étudions spécifiquement le problème d’apprentissage qui a pour objectif d’ajuster les BRs de façon à ce que les décisions prises aient une valeur moyenne donnée.Pour ce faire, nous considérons les bases de Règles Métiers en tant que programmes. Après avoir formalisé quelques définitions et notations dans le Chapitre 2, le langage de programmation BR ainsi défini est étudié dans le Chapitre 4, qui prouve qu’il n’existe pas d’algorithme pour apprendre des Règles Métiers avec un objectif statistique dans le cas général. Nous limitons ensuite le champ d’étude à deux cas communs où les BRs sont limités d’une certaine façon : le cas Borné en Itérations dans lequel, quelles que soit les données d’entrée, le nombre de règles exécutées en prenant la décision est inférieur à une borne donnée ; et le cas Linéaire Borné en Itérations dans lequel les règles sont de plus écrite sous forme Linéaire. Dans ces deux cas, nous produisons par la suite un algorithme d’apprentissage basé sur la Programmation Mathématique qui peut résoudre ce problème. Nous étendons brièvement cette formalisation et cet algorithme à d’autres problèmes d’apprentissage à objectif statistique dans le Chapitre 5, avant de présenter les résultats expérimentaux de cette thèse dans le Chapitre 6Business Rules (BRs) are a commonly used tool in industry for the automation of repetitive decisions. The emerging problem of adapting existing sets of BRs to an ever-changing environment is the motivation for this thesis. Existing Supervised Machine Learning techniques can be used when the adaptation is done knowing in detail which is the correct decision for each circumstance. However, there is currently no algorithm, theoretical or practical, which can solve this problem when the known information is statistical in nature, as is the case for a bank wishing to control the proportion of loan requests its automated decision service forwards to human experts. We study the specific learning problem where the aim is to adjust the BRs so that the decisions are close to a given average value.To do so, we consider sets of Business Rules as programs. After formalizing some definitions and notations in Chapter 2, the BR programming language defined this way is studied in Chapter 3, which proves that there exists no algorithm to learn Business Rules with a statistical goal in the general case. We then restrain the scope to two common cases where BRs are limited in some way: the Iteration Bounded case in which no matter the input, the number of rules executed when taking the decision is less than a given bound; and the Linear Iteration Bounded case in which rules are also all written in Linear form. In those two cases, we later produce a learning algorithm based on Mathematical Programming which can solve this problem. We briefly extend this theory and algorithm to other statistical goal learning problems in Chapter 5, before presenting the experimental results of this thesis in Chapter 6. The last includes a proof of concept to automate the main part of the learning algorithm which does not consist in solving a Mathematical Programming problem, as well as some experimental evidence of the computational complexity of the algorithm
2
Stackhouse, Christian Paul 1960. "AN ADAPTIVE RULE-BASED SYSTEM." Thesis, The University of Arizona, 1987. http://hdl.handle.net/10150/276534.
Full textAbstract:
Adaptive systems are systems whose characteristics evolve over time to improve their performance at a task. A fairly new area of study is that of adaptive rule-based systems. The system studied for this thesis uses meta-knowledge about rules, rulesets, rule performance, and system performance in order to improve its overall performance in a problem domain. An interesting and potentially important phenomenon which emerged is that the performance the system learns while solving a problem appears to be limited by an inherent break-even level of complexity. That is, the cost to the system of acquiring complexity does not exceed its benefit for that problem. If the problem is made more difficult, however, more complexity is required, the benefit of complexity becomes greater than its cost, and the system complexity begins increasing, ultimately to the new break-even point. There is no apparent ultimate limit to the complexity attainable.
3
Clark, Gary George. "Rule-based integrated building management systems." Thesis, Brunel University, 1993. http://bura.brunel.ac.uk/handle/2438/5150.
Full textAbstract:
The introduction of building management systems in large buildings have improved the control of building services and provided energy savings. However, current building management systems are limited by the physical level of integration of the building's services and the lack of intelligence provided in the control algorithms. This thesis proposes a new approach to the design and operation of building management systems using rule-based artificial intelligence techniques. The main aim of is to manage the services in the building in a more co-ordinated and intelligent manner than is possible by conventional techniques. This approach also aims to reduce the operational cost of the building by automatically tuning the energy consumption in accordance with occupancy profile of the building. A rule-based design methodology is proposed for building management systems. The design adopts the integrated structure made possible by the introduction of a common communications network for building services. The 'intelligence' is coded in the form of rules in such a way that it is both independent of any specific building description and easy to facilitate subsequent modification and addition. This is achieved using an object-oriented approach and classifying the range of data available into defined classes. The rules are divided into two knowledge-bases which are concerned with the building's control and its facilities management respectively. A wide range of rule-based features are proposed to operate on this data structure and are classified in terms of the data classes on which they operate. The concepts presented in this thesis were evaluated using software simulations, mathematical analysis and some hardware implementation. The conclusions of this work are that a rule-based building management system could provide significant enhancements over existing systems in terms of energy savings and improvements for both the building's management staff and its occupants.
4
Carden, Kenneth John. "Explanation in rule-based expert systems." Thesis, Rhodes University, 1988. http://hdl.handle.net/10962/d1002034.
Full textAbstract:
The ability of an expert system to explain its reasoning is fundamental to the system's credibility. Explanations become even more vital in systems which use methods of uncertainty propagation. The research documented here describes the development of an explanation sub-system which interfaces with the P.R.O. Expert System Toolkit. This toolkit has been used in the development of three small ecological expert systems. This project has involved adapting the results of research in the field of explanation-generation, to the requirements of the ecologist users. The subsystem contains two major components. The first lists the rules that fired during a consultation. The second component comprises routines responsible for quantifying the effects on the system conclusions of the answers given to questions. These latter routines can be used to perform sensitivity analyses on the answers given. The incorporation of such routines in small expert systems is quite unique
5
Moi, Havard. "Rule-based control of manufacturing systems." Thesis, Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22190168.
Full text
6
Selva, Valero Daniel. "Rule-based system architecting of Earth observation satellite systems." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/76089.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2012.Cataloged from PDF version of thesis.
Includes bibliographical references (p. 399-412).
System architecting is concerned with exploring the tradespace of early, high-level, system design decisions with a holistic, value-centric view. In the last few years, several tools and methods have been developed to support the system architecting process, focusing on the representation of an architecture as a set of interrelated decisions. These tools are best suited for applications that focus on breadth - i.e., enumerating a large and representative part of the architectural tradespace -as opposed to depth - modeling fidelity. However, some problems in system architecting require good modeling depth in order to provide useful results. In some cases, a very large body of expert knowledge is required. Current tools are not designed to handle such large bodies of knowledge because they lack scalability and traceability. As the size of the knowledge base increases, it becomes harder: a) to modify existing knowledge or add new knowledge; b) to trace the results of the tool to the model assumptions or knowledge base. This thesis proposes a holistic framework for architecture tradespace exploration of large complex systems that require a large body of expert knowledge. It physically separates the different bodies of knowledge required to solve a system architecting problem (i.e., knowledge about the domain, knowledge about the class of optimization or search problem, knowledge about the particular instance of problem) by using a rule-based expert system. It provides a generic population-based heuristic algorithm for search, which can be augmented with rules that encode knowledge about the domain, or about the optimization problem or class of problems. It identifies five major classes of system architecting problems from the perspective of optimization and search, and provides rules to enumerate architectures and search through the architectural tradespace of each class. A methodology is also defined to assess the value of an architecture using a rule-based approach. This methodology is based on a decomposition of stakeholder needs into requirements and a systematic comparison between system requirements and system capabilities using the rules engine. The framework is applied to the domain of Earth observing satellite systems (EOSS). Three EOSS are studied in depth: the NASA Earth Observing System, the NRC Earth Science Decadal Survey, and the Iridium GEOscan program. The ability of the framework to produce useful results is shown, and specific insights and recommendations are drawn.
by Daniel Selva Valero.
Ph.D.
7
Deedman, Galvin Charles. "Building rule-based expert systems in case-based law." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26137.
Full textAbstract:
This thesis demonstrates that it is possible to build rule-based expert systems in case-based law using a deep-structure analysis of the law and commercially available artificial intelligence tools. Nervous shock, an area of the law of negligence, was the domain chosen. The expert whose knowledge was used to build the system was Professor J.C. Smith of the Faculty of Law at the University of British ColumbiaLaw, Peter A. Allard School of
Graduate
8
Wang, Jinchang. "Rule-based expert systems and discrete optimization." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/29358.
Full text
9
Bottaci, L. "The modifiability of rule-based expert systems." Thesis, Brunel University, 1985. http://bura.brunel.ac.uk/handle/2438/5789.
Full textAbstract:
This thesis examines the claim that rule representations of knowledge are conveniently modified. The thesis falls into two parts and in the first, a precise notion of a convenient modification, called an extension, is developed and it is shown that extensible knowledge-bases are very convenient to modify and develop. We show that- rule representations of knowledge are extensible only if they incorporate a suitable organisation of knowledge. Furthermore, we show that non-rule representations with a suitable organisation of knowledge are also extensible. We therefore conclude that rule representations of knowledge are no more or less extensible than non-rule representations. In the second part, we consider the more pragmatic aspects of knowledge-base modifiability. In each of two detailed case studies, we compare the modifiability of a rule-based expert system with its "second generation” counterpart which incorporates non-rule representations of knowledge. We conclude that in practice the modifiability of extensible knowledge-bases can be compromised if the organisation of knowledge is represented obscurely. Above all, the thesis emphasizes the importance of the organisation of knowledge in an expert system.
10
Shin, Hyun-Myung. "Rule-based systems approach to fixture design /." The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487597424137913.
Full text
11
Eshete, Azeb Bekele. "Integrated Case Based and Rule Based Reasoning for Decision Support." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9978.
Full textAbstract:
This project is a continuation of my specialization project which was focused on studying theoretical concepts related to case based reasoning method, rule based reasoning method and integration of them. The integration of rule-based and case-based reasoning methods has shown a substantial improvement with regards to performance over the individual methods. Verdande Technology As wants to try integrating the rule based reasoning method with an existing case based system. This project focuses on designing, implementing and testing of a demo system that demonstrates the development of a rule based reasoning component and integrating it with the existing case based system of Verdande Technology As.
12
Jayanty, Suresh. "A Rule Based Expert System Framework for Small Water Systems." TopSCHOLAR®, 2005. http://digitalcommons.wku.edu/theses/502.
Full textAbstract:
Using an expert system to make decision making more reliable has been well studied and implemented over the years. For effective use, both data-driven questions (forward chaining) and goal-driven questions (backward chaining) need to be supported. Similarly, an avenue to update rules in the system as and when they change without major recompilation should be available. In this thesis we present an expert system framework that can help small water system operators make informed decisions regarding compliance with various EPA rules that may apply to them. To support both types of questions mentioned earlier, the system incorporates two expert system shells: JESS for answering data-driven questions such as "This is my reading for sample X. What needs to happen next?" and MANDARAX for goal-driven questions such as "We want to be compliant with the Total Coliform Rule. What do we need to do?" To make sure that rules are consistent and to support a straightforward rule-updating process, we use a native xml database to store the rules. All the rules are in XML format which ensures better symbiosis with other tools that support XML and allows one set of rules to be used for both JESS and MANDARAX.
13
Cook, Anthony. "Automated cartographic name placement using rule-based systems." Thesis, University of South Wales, 1988. https://pure.southwales.ac.uk/en/studentthesis/automated-cartographic-name-placement-using-rulebased-systems(d49af2c8-3a37-44c1-8cb6-a6cd3ec3195f).html.
Full textAbstract:
This thesis describes automated cartographic name placement using rule-based systems. In particular it describes the problem involved with designing a system which is flexible enough to place names on a variety of maps. This is demonstrated using logic programming techniques written in PROLOG. Most previous name placement systems are either map specific or have demonstrated only a few aspects of name placement. However two of these systems, which use the rule-based approach for solving the name placement problem, do show greater flexibility. Nevertheless all known results from these seem unsophisticated when compared to many manually produced maps. This thesis describes further research into the use of rule-based systems. The systems described have the capability to handle a wider range of maps of greater complexity. Also described is a procedural program which implements an iterative strategy for name placement on the Ordnance Survey Route Planner map. The research attempts to classify label positions and configurations used on a wide range of maps and discusses ways of implementing these in an automated name placement system. A range of name placement rules are also studied in order to decide what type of data a flexible automated name placement system must be able to access. A combined vector and raster data structure approach is adopted. This supplies the necessary "visual" information needed to apply most of the name placement rules. Name placement and database primitives are used to construct the high level rules which make up the rule-based systems. This work has been undertaken in collaboration with the Ordnance Survey. The procedural name placement program, capable of placing names on the 1:625000 Route Planner map, has been implemented at their headquarters.
14
Grossner, Clifford. "Models and tools for cooperating rule-based systems." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=28768.
Full textAbstract:
A Cooperative Distributed Problem Solving system (CDPS) is composed of a set of agents designed to solve a single problem by working together in a cooperative fashion. In this thesis, we present models and tools which aid the CDPS designer in determining how data items are to be shared between the agents (data distribution) in a CDPS, when the agents are implemented as rule-based systems. Our models consider CDPS from two different perspectives: the inter-agent perspective, and the intra-agent perspective. The inter-agent perspective is concerned with issues relating to the manner in which the agents in a CDPS achieve cooperation. The intra-agent perspective is concerned with the internal structure of an agent, and how an agent is affected when it cooperates with other agents. The inter-agent perspective is modeled using a notion of an "organization" that is imposed on a set of agents sharing data items via a "blackboard"; this model permits the CDPS designer to indicate the mechanism used to achieve both forms of cooperation between the rule-based systems in a CDPS: cooperation by sharing data, and cooperation for control. The intra-agent perspective is modeled using a notion of a "path", which captures the sequence of rules fired by a rule-based system. Based upon the path model, we have developed two tools: Path Hunter and Path Tracer. The models and tools described in this thesis permit the CDPS designer to study the impact of the data distribution chosen for a CDPS on the performance of a rule-based system that will be a member of that CDPS; this helps the CDPS designer in setting the data distribution within a CDPS.
15
Janidlo, Peter S. "Rule-based expert systems and tonal chord classification." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1137841.
Full textAbstract:
The purpose of the proposed thesis is to:1. Define expert systems and discuss various implementation techniques for the components of expert systems. This includes discussion on knowledge representation, inference methods, methods for dealing with uncertainty, and methods of explanation. Specifically, the focus will be on the implementation of rule-based expert systems;2. Apply selected expert system techniques to a case study. The case study will be a rule-based expert system in Prolog to recognize and identify musical chords from tonal harmony. The system will have a general knowledge base containing fundamental rules about chord construction. It will also contain some knowledge that will allow it to deduce non-trivial chords. Furthermore, it will contain procedures to deal with uncertainty and explanation;3. Explain general concepts about music theory and tonal chord classification to put the case study in context; and4. Discuss the limitations of expert systems based on the results of the case study and the current literature.Department of Computer Science
16
Moseley, Charles Warren. "A Timescale Estimating Model for Rule-Based Systems." Thesis, North Texas State University, 1987. https://digital.library.unt.edu/ark:/67531/metadc332089/.
Full textAbstract:
The purpose of this study was to explore the subject of timescale estimating for rule-based systems. A model for estimating the timescale necessary to build rule-based systems was built and then tested in a controlled environment.
17
Haghighi, Mona. "Rule-based Risk Monitoring Systems for Complex Datasets." Scholar Commons, 2016. http://scholarcommons.usf.edu/etd/6248.
Full textAbstract:
In this dissertation we present rule-based machine learning methods for solving problems with high-dimensional or complex datasets. We are applying decision tree methods on blood-based biomarkers and neuropsychological tests to predict Alzheimer’s disease in its early stages. We are also using tree-based methods to identify disparity in dementia related biomarkers among three female ethnic groups. In another part of this research, we tried to use rule-based methods to identify homogeneous subgroups of subjects who share the same risk patterns out of a heterogeneous population. Finally, we applied a network-based method to reduce the dimensionality of a clinical dataset, while capturing the interaction among variables. The results show that the proposed methods are efficient and easy to use in comparison to the current machine learning methods.
18
Llibre, Lawrence Michael. "A prototype explanation facility for rule-based and/or object-oriented knowledge-based systems." Thesis, Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/19547.
Full text
19
Liu, Han. "Rule based systems for classification in machine learning context." Thesis, University of Portsmouth, 2015. https://researchportal.port.ac.uk/portal/en/theses/rule-based-systems-for-classification-in-machine-learning-context(1790225c-ceb1-48d3-9e05-689edbfa3ef1).html.
Full textAbstract:
This thesis introduces a unified framework for design of rule based systems for classification tasks, which consists of the operations of rule generation, rule simplification and rule representation. This thesis also stresses the importance of combination of different rule learning algorithms through ensemble learning approaches. For the three operations mentioned above, novel approaches are developed and validated by comparing with existing ones for advancing the performance of using this framework. In particular, for rule generation, Information Entropy Based Rule Generation is developed and validated through comparing with Prism. For rule simplification, Jmid-pruning is developed and validated through comparing with J-pruning and Jmax-pruning. For rule representation, rule based network is developed and validated through comparing with decision tree and linear list. The results show that the novel approaches complement well the existing ones in terms of accuracy, efficiency and interpretability. On the other hand, this thesis introduces ensemble learning approaches that involve collaborations in training or testing stage through combination of learning algorithms or models. In particular, the novel framework Collaborative and Competitive Random Decision Rules is created and validated through comparing with Random Prisms. This thesis also introduces the other novel framework Collaborative Rule Generation which involves collaborations in training stage through combination of multiple learning algorithms. This framework is validated through comparing with each individual algorithm. In addition, this thesis shows that the above two frameworks can be combined as a hybrid ensemble learning framework toward advancing overall performance of classification. This hybrid framework is validated through comparing with Random Forests. Finally, this thesis summarises the research contributions in terms of theoretical significance, practical importance, methodological impact and philosophical aspects. In particular, theoretical significance includes creation of the framework for design of rule based systems and development of novel approaches relating to rule based classification. Practical importance shows the usefulness in knowledge discovery and predictive modelling and the independency in application domains and platforms. Methodological impact shows the advances in generation, simplification and representation of rules. Philosophical aspects include the novel understanding of data mining and machine learning in the context of human research and learning, and the inspiration from information theory, system theory and control theory toward methodological innovations. On the basis of the completed work, this thesis provides suggestions regarding further directions toward advancing this research area.
20
Moon, Myung Soo. "Rule-Based Approaches for Controlling on Mode Dynamic Systems." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30684.
Full textAbstract:
This dissertation presents new fuzzy logic techniques for designing control systems for a wide class of complex systems. The methods are developed in detail for a crane system which contains one rigid-body and one oscillation mode. The crane problem is to transfer the rigid body a given distance such that the pendulation of the oscillation mode is regulated at the final time using a single control input. The investigations include in-depth studies of the time-optimal crane control problem as an integral part of the work. The main contributions of this study are:
(1) Development of rule-based systems (both fuzzy and crisp) for the design of optimal controllers. This development involves control variable parametrization, rule derivation with parameter perturbation methods, and the design of rule based controllers, which can be combined with model-based feedback control methods.
(2) A thorough investigation and analysis of the solutions for time-optimal control problems of oscillation mode systems, with particular emphasis on the use of phase-plane interpretation.
(3) Development of fuzzy logic control system methodology using expert rules obtained through energy reducing considerations. In addition, dual mode control is a "spin-off" design method which, although no longer time optimal, can be viewed as a near-optimal control method which may be easier to implement. In both types of design optimization of the fuzzy logic controller can be used to improve performance.Ph. D.
21
Carse, Brian. "Artificial evolution of fuzzy and temporal rule based systems." Thesis, University of the West of England, Bristol, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.267551.
Full text
22
Shea, Timothy E. "Use of computer-based rule systems in graphic design." Thesis, Massachusetts Institute of Technology, 1986. http://hdl.handle.net/1721.1/78952.
Full textAbstract:
Thesis (M.S.V.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1986.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ROTCH.
Bibliography: leaves 125-130.
Timothy E. Shea.
M.S.V.S.
23
Weng, Wen-I. "A rule-based weapon suggestion system for shipboard three dimensional defense." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA243421.
Full textAbstract:
Thesis (M.S. in Engineering Science)--Naval Postgraduate School, December 1990.Thesis Advisor(s): Lee, Yuh-jeng. Second Reader: Giannotti, B. B. "December 1990." Description based on title screen as viewed on March 30, 2010. DTIC Descriptor(s): Weapons, Simulation, Detectors, Decision Making, Defense Systems, Accuracy, Efficiency, Theses, Targets, Three Dimensional, Shipboard, Expert Systems, Systems Approach, Enemy, Timeliness, Battles, Naval Vessels(Combatant), Preprocessing, Decision Support Systems, Input. DTIC Identifier(s): Rule Based Systems, Decision Aids, Weapon System Effectiveness, Shipboard, KEE(Knowledge Engineering Environment), WSS(Weapon Suggestion System), Target Detection, Threat Evaluation, Naval Vessels(Combatant), Tactical Analysis, Theses. Includes bibliographical references (p. 74-76). Also available in print.
24
Sánchez-Martínez, Felipe. "Using unsupervised corpus-based methods to build rule-based machine translation systems." Doctoral thesis, Universidad de Alicante, 2008. http://hdl.handle.net/10045/13879.
Full text
25
Sankarasubramanian, Venkatasubramanian. "Rule based expert system for manufacturing process selection." Ohio : Ohio University, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1126215558.
Full text
26
Toms, Anders. "Utredning av integrationsaspekter vid Rule Based Engineering (RBE)." Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-673.
Full textAbstract:
Vid produktutveckling inom industriföretag finns idag luckor vad gäller IT-stöd i arbetets olika faser. Införandet av s.k. RBE-system (Rule Based Engineering) är ett steg på vägen mot att försöka fylla dessa luckor. Meningen med ett RBE-system kan sägas vara att ersätta traditionella konstruktionshandböcker med motsvarande konstruktionsanvisningar i digital form. Detta ger möjligheter till automatisering av processer som är tidskrävande, monotona och ofta förekommande, t.ex. olika former av komponentval, dimensioneringsprocesser etc. En av utgångspunkterna vid utvecklingen av RBE-system är att utgå från existerande programvaror. Detta kan ställa stora krav på utvecklarna. En fördel är om det finns en solid grund i form av fakta om vilka attribut hos ett program som är viktiga att ta hänsyn till för att underlätta valet av programvaror som lämpar sig integrationstekniskt för att koppla ihop med andra. Detta arbete syftar till att utreda dessa integrationstekniska aspekter.
27
Rasmussen, Kai. "Developing a Cognitive Rule-Based Tutor for the ASSISTment System." Digital WPI, 2007. https://digitalcommons.wpi.edu/etd-theses/39.
Full textAbstract:
The ASSISTment system is a web-based tutor that is currently being used as an eighth and tenth-grade mathematics in both Massachusetts and Pennsylvania. This system represents its tutors as state-based "pseudo-tutors" which mimic a more complex cognitive tutor based on a set of production rules. It has been shown that building pseudo-tutors significantly decreases the time spent authoring content. This is an advantage for authoring systems such as the ASSITment builder, though it sacrifices greater expressive power and flexibility. A cognitive tutor models a student's behavior with general logical rules. Through model-tracing of a cognitive tutor's rule space, a system can find the reasons behind a student action and give better tutoring. In addition, these cognitive rules are general and can be used for many different tutors. It is the goal of this thesis to provide the architecture for using cognitive rule-based tutors in the ASSITment system. A final requirement is that running these computationally intensive model-tracing tutors do not slow down students using the pseudo-tutors, which represents the majority of ASSISTment usage. This can be achieved with remote computation, realized with SOAP web services. The system was further extended to allow the creation and implementation of user-level experiments within the system. These experiments allow the testing of pedagogical choices. We implemented a hint dissuasion experiment to test this experimental framework and provide those results.
28
Wada, Atsushi. "Analysis and design of rule-based evolutionary reinforcement learning systems." 京都大学 (Kyoto University), 2005. http://hdl.handle.net/2433/144507.
Full text
29
Blackman, Susan Jane. "Expert systems in case-based law : the rule against hearsay." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/27763.
Full textAbstract:
The rule against hearsay of evidence law, and its exceptions, can be explained with a simple heuristic device. Where the circumstances surrounding the making of the hearsay statement indicate that the declarant perceived the matters reported accurately, believed and remembered what she saw when she reported it, and intended to accurately report it, the evidence appears reliable and is admissible in court. This theory is used as the basis for building an expert system to advise lawyers about admissibility of hearsay evidence. The expert whose knowledge forms the basis of this expert system is Professor M. T. MacCrimmon of the Faculty of Law at the University of British Columbia.Law, Peter A. Allard School of
Graduate
30
Williamson, C. J. "Computer aided process control systems synthesis using rule-based programming." Thesis, University of Canterbury. Chemical Engineering, 1989. http://hdl.handle.net/10092/9407.
Full textAbstract:
Current steady-state process simulators have greatly increased the speed and efficiency of the development of Process Flow Diagrams. Chemical Engineers would benefit in the same way from a Computer Aided Design package to assist with generating completed Piping and Instrument Diagrams. Despite the many theoretical methods available in the control science area there is no single and complete available solution to the problem of synthesising control systems for whole chemical processes and therefore no concrete basis from which to develop a computer program. Design activities rely on a significant experience factor and this element has largely been ignored especially in control systems synthesis. The recent emergence of rule-based programming allows this "experience" dimension to be added to software. Although there is previous work in the literature on expert systems for distillation column control systems synthesis there is very little published on programs for other unit operations or the whole plant problem.
In this project the problem of how to set up an expert system for whole plant control systems synthesis was addressed. As a preliminary step this required that expert systems for control systems synthesis for unit operations be written. The necessary knowledge to do this for distillation columns, heat exchangers and reactors was sourced from the literature and programs developed for each using a shell written in a version of Prolog. These programs were coordinated to work together and provide controllable solutions to whole process control problems using a matrix representation of the relationship between control objectives and manipulated variables developed in structural controllability analysis. This provided the framework for a prototype whole plant program. The operation of all the programs is illustrated using typical examples and their rule bases included in appendices to the thesis.
The work demonstrated that, with more extensive rulebases than it was possible to develop in the time available for this project including access to theoretical methods when required, expert systems could provide a useful solution to both unit operation and whole plant control systems synthesis problems.
31
Medders, Stephen Charles. "Using rule-based structure to evaluate rule-based system testing completeness a case study of Loci and Quick Test /." Master's thesis, Mississippi State : Mississippi State University, 2008. http://library.msstate.edu/etd/show.asp?etd=etd-03052008-174707.
Full text
32
Arney, Dale Curtis. "Rule-based graph theory to enable exploration of the space system architecture design space." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44840.
Full textAbstract:
NASA's current plans for human spaceflight include an evolutionary series of missions based on a steady increase in capability to explore cis-lunar space, the Moon, near-Earth asteroids, and eventually Mars. Although the system architecture definition has the greatest impact on the eventual performance and cost of an exploration program, selecting an optimal architecture is a difficult task due to the lack of methods to adequately explore the architecture design space and the resource-intensive nature of architecture analysis. This research presents a modeling framework to mathematically represent and analyze the space system architecture design space using graph theory. The framework enables rapid exploration of the design space without the need to limit trade options or the need for user interaction during the exploration process. The architecture design space for three missions in a notional evolutionary exploration program, which includes staging locations, vehicle implementation, and system functionality, for each mission destination is explored. Using relative net present value of various system architecture options, the design space exploration reveals that the launch vehicle selection is the primary driver in reducing cost, and other options, such as propellant type, staging location, and aggregation strategy, provide less impact.
33
Oeltjen, Craig L. "A comparison of computational cognitive models : agent-based systems versus rule-based architectures." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03Mar%5FOeltjen.pdf.
Full textAbstract:
Thesis (M.S. in Modeling, Virtual Environments and Simulation)--Naval Postgraduate School, March 2003.Thesis advisor(s): Rudolph Darken, Barry Peterson. Includes bibliographical references (p. 61). Also available online.
34
Jafar, Musa Jafar. "A tool for interactive verification and validation of rule-based expert systems." Diss., The University of Arizona, 1989. http://hdl.handle.net/10150/184805.
Full textAbstract:
Interactive as well as Automatic Verification and Validation is valuable, especially when the size of a knowledge base grows and manual techniques are not feasible. It ensures the stability of the system and raises the confidence in its level of performance. In this dissertation I address the problem of verification and validation of rule based expert systems. It is a problem knowledge engineers have to deal with while building their expert systems to ensure the reliability, accuracy, and completeness of their knowledge bases. The objective of this research is to make it easy for expert systems developers to build the right system by proposing practical and simple methods for building verification and validation programs to insure the integrity and performance of large scale knowledge based systems.
35
Cong, Phan Chinh. "An approach to adaptive inference engine for rule-based consultation systems." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=982121717.
Full text
36
Kopanas, Vassilios. "Relational database support for a rule based approach to information systems." Thesis, University of Manchester, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358052.
Full text
37
Jirapanthong, Waraporn. "A rule-based approach for software traceability on product family systems." Thesis, City University London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435040.
Full text
38
Cruz, Anderson Paiva. "On Fuzzy Implication Classes - Towards Extensions of Fuzzy Rule-Based Systems." Universidade Federal do Rio Grande do Norte, 2012. http://repositorio.ufrn.br:8080/jspui/handle/123456789/18684.
Full textAbstract:
Made available in DSpace on 2015-03-03T15:47:46Z (GMT). No. of bitstreams: 1
AndersonPC_DISSERT.pdf: 1402040 bytes, checksum: 960b15bc1392a94fb7ba8ba980e3a0b4 (MD5)
Previous issue date: 2012-12-20Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior
Atualmente, h? diferentes defini??es de implica??es fuzzy aceitas na literatura. Do ponto de vista te?rico, esta falta de consenso demonstra que h? discord?ncias sobre o real significado de "implica??o l?gica" nos contextos Booleano e fuzzy. Do ponto de vista pr?tico, isso gera d?vidas a respeito de quais "operadores de implica??o" os engenheiros de software devem considerar para implementar um Sistema Baseado em Regras Fuzzy (SBRF). Uma escolha ruim destes operadores pode implicar em SBRF's com menor acur?cia e menos apropriados aos seus dom?nios de aplica??o. Uma forma de contornar esta situa??o e conhecer melhor os conectivos l?gicos fuzzy. Para isso se faz necess?rio saber quais propriedades tais conectivos podem satisfazer. Portanto, a m de corroborar com o significado de implica??o fuzzy e corroborar com a implementa??o de SBRF's mais apropriados, v?rias leis Booleanas t?m sido generalizadas e estudadas como equa??es ou inequa??es nas l?gicas fuzzy. Tais generaliza??es s?o chamadas de leis Boolean-like e elas n?o s?o comumente v?lidas em qualquer sem?ntica fuzzy. Neste cen?rio, esta disserta??o apresenta uma investiga??o sobre as condi??es suficientes e necess?rias nas quais tr?s leis Booleanlike ?like ? y ? I(x, y), I(x, I(y, x)) = 1 e I(x, I(y, z)) = I(I(x, y), I(x, z)) ?? se mant?m v?lidas no contexto fuzzy, considerando seis classes de implica??es fuzzy e implica??es geradas por automorfismos. Al?m disso, ainda no intuito de implementar SBRF's mais apropriados, propomos uma extens?o para os mesmos
There are more than one acceptable fuzzy implication definitions in the current literature dealing with this subject. From a theoretical point of view, this fact demonstrates a lack of consensus regarding logical implication meanings in Boolean and fuzzy contexts. From a practical point of view, this raises questions about the implication operators" that software engineers must consider to implement a Fuzzy Rule Based System (FRBS). A poor choice of these operators generates less appropriate FRBSs with respect to1 their application domain. In order to have a better understanding of logical connectives, it is necessary to know the properties that they can satisfy. Therefore, aiming to corroborate with fuzzy implication meaning and contribute to implementing more appropriate FRBSs to their domain, several Boolean laws have been generalized and studied as equations or inequations in fuzzy logics. Those generalizations are called Booleanlike laws and a lot of them do not remain valid in any fuzzy semantics. Within this context, this dissertation presents the investigation of sucient and necessary conditions under which three Boolean-like laws | y I(x; y), I(x; I(y; x)) = 1 and I(x; I(y; z)) = I(I(x; y); I(x; z)) | hold for six known classes of fuzzy implications and for implications generated by automorphisms. Moreover, an extension to FRBSs is proposed
39
Erdani, Yuliadi. "Acquisition of Human Expert Knowledge for Rule-based Knowledge-based Systems using Ternary Grid." Gerhard-Mercator-Universitaet Duisburg, 2005. http://www.ub.uni-duisburg.de/ETD-db/theses/available/duett-06282005-101136/.
Full textAbstract:
Knowledge acquisition is the most important part in the development of expert system. It deals with extracting knowledge from sources of expertise and transferring it to a knowledge base. Knowledge acquisition is major research field in knowledge engineering and still the most difficult and error-prone task for knowledge engineer while building an expert system. This situation influences the performance of the knowledge due to the quality of information and the reduction of error possibility. It is not an easy task to acquire knowledge from human expert not trained in knowledge engineering. The performance of the knowledge is performed by interaction between experts and knowledge engineer or machine during acquisition process. In most rule-based expert system, building of rules can easily be done. Knowledge Engineer or expert does not have to do any work specifying rules and how they are linked to each other. Sometime the knowledge engineer or expert can reference rules or facts that have not yet been created. It seems to be a simple and an instant work. The problem due to the performance of the knowledge will not occur until the number of rules is getting higher. Some problem may appear in the form of inconsistent rules, unreachable rules, redundant rule and rotating chain of rules. In order to solve that problem and to achieve that mentioned performance, a rule-based knowledge acquisition system using Ternary Grid is developed. This system acquires knowledge from human expert using grid or matrix system. Ternary Grid represents a model of rule-based knowledge in a grid or matrix format.
40
Steffens, Timo. "Enhancing similarity measures with imperfect rule-based background knowledge." Doctoral thesis, Berlin Aka, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2898562&prov=M&dok_var=1&dok_ext=htm.
Full text
41
Karakaşoğlu, Ahmet 1961. "Design of a rule-based control system for decentralized adaptive control of robotic manipulators." Thesis, The University of Arizona, 1988. http://hdl.handle.net/10150/276874.
Full textAbstract:
This thesis is concerned with the applicability of model reference adaptive control to the control of robot manipulators under a wide range of configuration and payload changes, and a comparison of the performance of this technique with that of the non-adaptive schemes. The dynamic equations of robot manipulators are highly nonlinear and are difficult to determine precisely. For these reasons there is an interest in applying adaptive control techniques to robot manipulators. In this work, the detailed performance of three adaptive controllers are studied and compared with that of a non-adaptive controller, namely, the computed torque control scheme. Computer simulation results show that the use of adaptive control improves the performance of the manipulator despite changes in the payload or in the manipulator configuration. Making use of these results, a rule-based controller is developed by dividing a given manipulation task into portions where a particular adaptive control scheme, based on a specific linearized subsystem model, performs best. This strategy of selecting the proper controller during each portion of the overall task yields a performance having the least deviation from the desired trajectory during the entire length of the task.
42
Islam, Raihan Ul. "Wireless Sensor Network Based Flood Prediction Using Belief Rule Based Expert System." Licentiate thesis, Luleå tekniska universitet, Datavetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-66415.
Full textAbstract:
Flood is one of the most devastating natural disasters. It is estimated that flooding from sea level rise will cause one trillion USD to major coastal cities of the world by the year 2050. Flood not only destroys the economy, but it also creates physical and psychological sufferings for the human and destroys infrastructures. Disseminating flood warnings and evacuating people from the flood-affected areas help to save human life. Therefore, predicting flood will help government authorities to take necessary actions to evacuate humans and arrange relief for the people. This licentiate thesis focuses on four different aspects of flood prediction using wireless sensor networks (WSNs). Firstly, different WSNs, protocols related to WSN, and backhaul connectivity in the context of predicting flood were investigated. A heterogeneous WSN network for flood prediction was proposed. Secondly, data coming from sensors contain anomaly due to different types of uncertainty, which hampers the accuracy of flood prediction. Therefore, anomalous data needs to be filtered out. A novel algorithm based on belief rule base for detecting the anomaly from sensor data has been proposed in this thesis. Thirdly, predicting flood is a challenging task as it involves multi-level factors, which cannot be measured with 100% certainty. Belief rule based expert systems (BRBESs) can be considered to handle the complex problem of this nature as they address different types of uncertainty. A web based BRBES was developed for predicting flood. This system provides better usability, more computational power to handle larger numbers of rule bases and scalability by porting it into a web-based solution. To improve the accuracy of flood prediction, a learning mechanism for multi-level BRBES was proposed. Furthermore, a comparison between the proposed multi-level belief rule based learning algorithm and other machine learning techniques including Artificial Neural Networks (ANN), Support Vector Machine (SVM) based regression, and Linear Regression has been performed. In the light of the research findings of this thesis, it can be argued that flood prediction can be accomplished more accurately by integrating WSN and BRBES.
43
Haldavnekar, Nikhil. "An algorithm and implementation for extracting schematic and semantic knowledge from relational database systems." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000541.
Full text
44
Karmakar, Gour Chandra 1970. "An integrated fuzzy rule-based image segmentation framework." Monash University, Gippsland School of Computing and Information Technology, 2002. http://arrow.monash.edu.au/hdl/1959.1/8752.
Full text
45
Chatterjee, Raja. "KBMS-based evolutionary prototyping of object-oriented software systems /." CLICK ON LINK, THEN SEARCH BY AUTHOR OR TITLE; ACCESS RESTRICTED TO COMPUTERS ON UF CAMPUS OR WITH UF IP ADDRESSES, 1998. http://wwwlib.umi.com/cr/ufl/main.
Full textAbstract:
Thesis (Ph. D.)--University of Florida, 1998.Typescript. Vita. Includes bibliographical references (leaves 115-118). Full text also available from UMI Current Research @ database; Adobe Acrobat Reader required to display text; see LINKS to connect
46
Kuo, Yung-Li. "Developing a rule-based expert system with C programming language." Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/552943.
Full textAbstract:
Expert system techniques are now being incorporated successfully in commercial computer software packages. This thesis introduces the techniques of developing a rule-based expert system in a general-purpose programming language -- C. The topics of this thesis include significance of expert system shells and approaches used, structure of the knowledge base, loading of the knowledge base, manipulation of the probabilities of rule attributes, and implementation of the inference engine. The inference engine uses the information that users supply to find an object that matches. Today C language is one of the most popular programming languages in use and C compilers consistently produce extremely fast and efficient executable programs. Thisthesisdemonstrates that C language is an appropriate computer language for a rule-based expert system.Department of Computer Science
47
Vetcha, Sarat Babu. "Fault diagnosis in pumps by unsupervised neural networks." Thesis, University of Sussex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300604.
Full text
48
Mehldau, Gerhard 1959. "A RULE-BASED PROGRAMMING LANGUAGE AND ITS APPLICATION TO IMAGE RECOGNITION." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/276360.
Full text
49
Thola, Forest D. "Minimizing Recommended Error Costs Under Noisy Inputs in Rule-Based Expert Systems." NSUWorks, 2012. http://nsuworks.nova.edu/gscis_etd/323.
Full textAbstract:
This dissertation develops methods to minimize recommendation error costs when inputs to a rule-based expert system are prone to errors. The problem often arises in web-based applications where data are inherently noisy or provided by users who perceive some benefit from falsifying inputs. Prior studies proposed methods that attempted to minimize the probability of recommendation error, but did not take into account the relative costs of different types of errors. In situations where these differences are significant, an approach that minimizes the expected misclassification error costs has advantages over extant methods that ignore these costs.
Building on the existing literature, two new techniques - Cost-Based Input Modification (CBIM) and Cost-Based Knowledge-Base Modification (CBKM) were developed and evaluated. Each method takes as inputs (1) the joint probability distribution of a set of rules, (2) the distortion matrix for input noise as characterized by the probability distribution of the observed input vectors conditioned on their true values, and (3) the misclassification cost for each type of recommendation error. Under CBIM, for any observed input vector v, the recommendation is based on a modified input vector v' such that the expected error costs are minimized. Under CBKM the rule base itself is modified to minimize the expected cost of error.
The proposed methods were investigated as follows: as a control, in the special case where the costs associated with different types of errors are identical, the recommendations under these methods were compared for consistency with those obtained under extant methods. Next, the relative advantages of CBIM and CBKM were compared as (1) the noise level changed, and (2) the structure of the cost matrix varied.
As expected, CBKM and CBIM outperformed the extant Knowledge Base Modification (KM) and Input Modification (IM) methods over a wide range of input distortion and cost matrices, with some restrictions. Under the control, with constant misclassification costs, the new methods performed equally with the extant methods. As misclassification costs increased, CBKM outperformed KM and CBIM outperformed IM. Using different cost matrices to increase misclassification cost asymmetry and order, CBKM and CBIM performance increased. At very low distortion levels, CBKM and CBIM underperformed as error probability became more significant in each method's estimation. Additionally, CBKM outperformed CBIM over a wide range of input distortion as its technique of modifying an original knowledge base outperformed the technique of modifying inputs to an unmodified decision tree.
50
Baggi, Michele. "Rule-based Methodologies for the Specification and Analysis of Complex Computing Systems." Doctoral thesis, Universitat Politècnica de València, 2010. http://hdl.handle.net/10251/8964.
Full textAbstract:
Desde los orígenes del hardware y el software hasta la época actual, la complejidad
de los sistemas de cálculo ha supuesto un problema al cual informáticos, ingenieros
y programadores han tenido que enfrentarse. Como resultado de este esfuerzo han
surgido y madurado importantes áreas de investigación. En esta disertación abordamos
algunas de las líneas de investigación actuales relacionada con el análisis y
la verificación de sistemas de computación complejos utilizando métodos formales y
lenguajes de dominio específico.
En esta tesis nos centramos en los sistemas distribuidos, con un especial interés por
los sistemas Web y los sistemas biológicos. La primera parte de la tesis está dedicada
a aspectos de seguridad y técnicas relacionadas, concretamente la certificación del
software. En primer lugar estudiamos sistemas de control de acceso a recursos y proponemos
un lenguaje para especificar políticas de control de acceso que están fuertemente
asociadas a bases de conocimiento y que proporcionan una descripción sensible
a la semántica de los recursos o elementos a los que se accede. También hemos desarrollado
un marco novedoso de trabajo para la Code-Carrying Theory, una metodología
para la certificación del software cuyo objetivo es asegurar el envío seguro de código
en un entorno distribuido. Nuestro marco de trabajo está basado en un sistema de
transformación de teorías de reescritura mediante operaciones de plegado/desplegado.
La segunda parte de esta tesis se concentra en el análisis y la verificación de sistemas
Web y sistemas biológicos. Proponemos un lenguaje para el filtrado de información
que permite la recuperación de informaciones en grandes almacenes de datos. Dicho
lenguaje utiliza información semántica obtenida a partir de ontologías remotas
para re nar el proceso de filtrado. También estudiamos métodos de validación para
comprobar la consistencia de contenidos web con respecto a propiedades sintácticas
y semánticas. Otra de nuestras contribuciones es la propuesta de un lenguaje que
permite definir y comprobar automáticamente restricciones semánticas y sintácticas
en el contenido estático de un sistema Web. Finalmente, también consideramos los
sistemas biológicos y nos centramos en un formalismo basado en lógica de reescritura
para el modelado y el análisis de aspectos cuantitativos de los procesos biológicos.
Para evaluar la efectividad de todas las metodologías propuestas, hemos prestado
especial atención al desarrollo de prototipos que se han implementado utilizando
lenguajes basados en reglas.Baggi ., M. (2010). Rule-based Methodologies for the Specification and Analysis of Complex Computing Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/8964
Palancia