Teses / dissertações: "Rule based programming"

1

Kuo, Yung-Li. "Developing a rule-based expert system with C programming language". Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/552943.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Soltan-Zadeh, Yasaman. "Improved rule-based document representation and classification using genetic programming". Thesis, Royal Holloway, University of London, 2011. http://repository.royalholloway.ac.uk/items/479a1773-779b-8b24-b334-7ed485311abe/8/.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

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.

Texto completo da fonte

Resumo:

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.

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Pappa, Gisele Lobo. "Automatically evolving rule induction algorithms with grammar-based genetic programming". Thesis, University of Kent, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445792.

Texto completo da fonte

Resumo:

In the last 30 years, research in the field of rule induction algorithms produced a large number of algorithms. However, these algorithms are usually obtained from the combination of a basic rule induction algorithm (typically following the sequential covering approach) with new evaluation functions, pruning methods and stopping criteria for refining or producing rules, generating many "new" and more sophisticated sequential covering algorithms. We cannot deny that these attempts to improve the basic sequential covering ~approach have succeeded. Hence, if manually changing these major components of rule induction algorithms can result in new, significantly better ones, why not to automate this process to make it more cost-effective? This is the core idea of this work: to automate the process of designing rule induction algorithms by means of grammar-based genetic programming. Grammar-based Genetic Programming (GGP) is a special type of evolutionary algorithm used to automatically evolve computer programs. The most interesting feature of this type of algorithm is that it incorporates a grammar into its search mechanism, which expresses prior knowledge about the problem being solved. Since we have a lot of previous knowledge about how humans design rule induction algorithms, this type of algorithm is intuitively a suitable tool to automatically evolve rule induction algorithms. The grammar given to the proposed GGP system includes knowledge about how humans- design rule induction algorithms, and also presents some new elements which could work in rule induction algorithms, but to the best of our knowledge were not previously tested. The GG P system aims to evolve rule induction algorithms under two different frameworks, as follows. In the first framework, the GGP is used to evolve robust rule induction algorithms, i.e., algorithms which were designed to be applied to virtually any classification data set, like a manually-designed rule induction algorithm. In the second framework, the GGP is applied to evolve rule induction algorithms tailored to a specific application XVI domain, i.e., rule induction algorithms tailored to a single data set. Note that the latter framework is hardly feasible on a hard scale in the case of conventional, manually-designed algorithms, since the number of classification data sets greatly outnumbers the number of rule induction algorithms designers. However, it is clearly feasible on a large scale when using the proposed system, which automates the process of rule induction algorithm design and implementation. Overall, extensive computational experiments with 20 VCI data sets and 5 bioinformatics data sets showed that effective rule induction algorithms can be automatically generated using the GGP in both frameworks. Moreover, the automatically evolved rule induction algorithms were shown to be competitive with (and overall slightly better than) four well-known manually designed rule induction algorithms when comparing their predictive accuracies. The proposed GGP system was also compared to a grammar-based hillclimbing system, and experimental results showed that the GGP system is a more effective method to evolve rule induction algorithms than the grammar-based hillclimbing method. At last, a multi-objective version of the GGP (based on the concept of Pareto dominance) was also proposed, and experiments were performed to evolve robust rule induction algorithms which generate both accurate and simple models. The results showed that in most of the cases the GGP system can produce rule induction algorithms which are competitive in predictive accuracy to wellknown human-designed rule induction algorithms, but generate simpler classification modes - i.e., smaller rule sets, intuitively easier to be interpreted by the user.

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Liu, Youzhong. "Rule warehouse system for knowledge sharing and business collaboration". [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp4027/Youzhong%5FLiu%5FDissertation.pdf.

Texto completo da fonte

Resumo:

Thesis (Ph. D.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains xi, 121 p.; also contains graphics. Vita. Includes bibliographical references (p. 113-120).

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Lum, Bik. "A rule-based analysis system for Chinese sentences /". [Hong Kong : University of Hong Kong], 1989. http://sunzi.lib.hku.hk/hkuto/record.jsp?B1240231X.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Lakkaraju, Sai Kiran, University of Western Sydney, of Science Technology and Environment College e School of Computing and Information Technology. "A SLDNF based formalization for updates and abduction". THESIS_CSTE_CIT_Lakkaraju_S.xml, 2001. http://handle.uws.edu.au:8081/1959.7/381.

Texto completo da fonte

Resumo:

Knowledge representation and inference are the backbone of artificial intelligence, and logic programming is one of the most widely used knowledge representation tools. Logic programming with deduction/induction/abduction as the reasoning technique is serving numerous fields of artificial intelligence. In dynamic domains where there are constant changes in knowledge, updating the knowledge base is crucial to keep it stable. This thesis investigates the issues in updating the knowledge base. Two types of logic program based updates are considered, simple fact based updates where the knowledge base is updated by a simple fact, and rule based updates where the knowledge base is updated by a rule. A SLDNF based procedural approach is proposed to implement such updates. This thesis also investigates the issues involved in simple fact based and rule based abduction, and it is observed that updates are closely related to abduction. A SLDNF based procedural approach to perform simple fact/rule based updates and abduction is proposed as a result of this study
Master of Science (Hons)

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Sahin, Yavuz. "A Programming Framework To Implement Rule-based Target Detection In Images". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12610213/index.pdf.

Texto completo da fonte

Resumo:

An expert system is useful when conventional programming techniques fall short of capturing human expert knowledge and making decisions using this information. In this study, we describe a framework for capturing expert knowledge under a decision tree form and this framework can be used for making decisions based on captured knowledge. The framework proposed in this study is generic and can be used to create domain specific expert systems for different problems. Features are created or processed by the nodes of decision tree and a final conclusion is reached for each feature. Framework supplies 3 types of nodes to construct a decision tree. First type is the decision node, which guides the search path with its answers. Second type is the operator node, which creates new features using the inputs. Last type of node is the end node, which corresponds to a conclusion about a feature. Once the nodes of the tree are developed, then user can interactively create the decision tree and run the supplied inference engine to collect the result on a specific problem. The framework proposed is experimented with two case studies
"
Airport Runway Detection in High Resolution Satellite Images"
and "
Urban Area Detection in High Resolution Satellite Images"
. In these studies linear features are used for structural decisions and Scale Invariant Feature Transform (SIFT) features are used for testing existence of man made structures.

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Terfloth, Kirsten [Verfasser]. "A rule-based programming model for wireless sensor networks / Kirsten Terfloth". Berlin : Freie Universität Berlin, 2009. http://d-nb.info/1023664135/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Sankarasubramanian, Venkatasubramanian. "Rule based expert system for manufacturing process selection". Ohio : Ohio University, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1126215558.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Le, Truong Giang. "Using Event-Based and Rule-Based Paradigms to Develop Context-Aware Reactive Applications". Phd thesis, Conservatoire national des arts et metiers - CNAM, 2013. http://tel.archives-ouvertes.fr/tel-00953368.

Texto completo da fonte

Resumo:

Context-aware pervasive computing has attracted a significant research interest from both academy and industry worldwide. It covers a broad range of applications that support many manufacturing and daily life activities. For instance, industrial robots detect the changes of the working environment in the factory to adapt their operations to the requirements. Automotive control systems may observe other vehicles, detect obstacles, and monitor the essence level or the air quality in order to warn the drivers in case of emergency. Another example is power-aware embedded systems that need to work based on current power/energy availability since power consumption is an important issue. Those kinds of systems can also be considered as smart applications. In practice, successful implementation and deployment of context-aware systems depend on the mechanism to recognize and react to variabilities happening in the environment. In other words, we need a well-defined and efficient adaptation approach so that the systems' behavior can be dynamically customized at runtime. Moreover, concurrency should be exploited to improve the performance and responsiveness of the systems. All those requirements, along with the need for safety, dependability, and reliability pose a big challenge for developers.In this thesis, we propose a novel programming language called INI, which supports both event-based and rule-based programming paradigms and is suitable for building concurrent and context-aware reactive applications. In our language, both events and rules can be defined explicitly, in a stand-alone way or in combination. Events in INI run in parallel (synchronously or asynchronously) in order to handle multiple tasks concurrently and may trigger the actions defined in rules. Besides, events can interact with the execution environment to adjust their behavior if necessary and respond to unpredictable changes. We apply INI in both academic and industrial case studies, namely an object tracking program running on the humanoid robot Nao and a M2M gateway. This demonstrates the soundness of our approach as well as INI's capabilities for constructing context-aware systems. Additionally, since context-aware programs are wide applicable and more complex than regular ones, this poses a higher demand for quality assurance with those kinds of applications. Therefore, we formalize several aspects of INI, including its type system and operational semantics. Furthermore, we develop a tool called INICheck, which can convert a significant subset of INI to Promela, the input modeling language of the model checker SPIN. Hence, SPIN can be applied to verify properties or constraints that need to be satisfied by INI programs. Our tool allows the programmers to have insurance on their code and its behavior.

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

林碧 e Bik Lum. "A rule-based analysis system for Chinese sentences". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1989. http://hub.hku.hk/bib/B31208769.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Manamalkav, Shankar N. "A framework for specifying and generating alerts in relational medical databases". [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000139.

Texto completo da fonte

Resumo:

Thesis (M.S.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains xi, 68 p.; also contains graphics. Includes vita. Includes bibliographical references.

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Shi, Yuan. "Integrated verification of constraints and event-and-action-oriented business rules". [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1051/thesis%5Fyshi.pdf.

Texto completo da fonte

Resumo:

Thesis (M.S.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains ix, 68 p.; also contains graphics. Vita. Includes bibliographical references (p. 64-67).

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Raj, Himanshu. "Integrated alerting for structured and free-text data in TriggerMan". [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000346.

Texto completo da fonte

Resumo:

Thesis (M.S.)--University of Florida, 2001.
Title from title page of source document. Document formatted into pages; contains viii, 60 p.; also contains graphics. Includes vita. Includes bibliographical references.

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Joshi, Nicky. "IntelliBid an event-trigger-rule-based auction system over the Internet /". [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1603/thesis%5Fsubmit2.pdf.

Texto completo da fonte

Resumo:

Thesis (M.S.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains x, 61 p.; also contains graphics. Vita. Includes bibliographical references (p. 58-60).

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Thakore, Kushal. "Intellibid an Event-Trigger-Rule-Based auction system over the Internet /". [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1001185.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

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.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Blum, Jesse Michael. "Handling emergent conflicts in adaptable rule-based sensor networks". Thesis, University of Stirling, 2012. http://hdl.handle.net/1893/10622.

Texto completo da fonte

Resumo:

This thesis presents a study into conflicts that emerge amongst sensor device rules when such devices are formed into networks. It describes conflicting patterns of communication and computation that can disturb the monitoring of subjects, and lower the quality of service. Such conflicts can negatively affect the lifetimes of the devices and cause incorrect information to be reported. A novel approach to detecting and resolving conflicts is presented. The approach is considered within the context of home-based psychiatric Ambulatory Assessment (AA). Rules are considered that can be used to control the behaviours of devices in a sensor network for AA. The research provides examples of rule conflict that can be found for AA sensor networks. Sensor networks and AA are active areas of research and many questions remain open regarding collaboration amongst collections of heterogeneous devices to collect data, process information in-network, and report personalised findings. This thesis presents an investigation into reliable rule-based service provisioning for a variety of stakeholders, including care providers, patients and technicians. It contributes a collection of rules for controlling AA sensor networks. This research makes a number of contributions to the field of rule-based sensor networks, including areas of knowledge representation, heterogeneous device support, system personalisation, and in particular, system reliability. This thesis provides evidence to support the conclusion that conflicts can be detected and resolved in adaptable rule-based sensor networks.

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Le, Truong Giang. "Using Event-Based and Rule-Based Paradigms to Develop Context-Aware Reactive Applications". Electronic Thesis or Diss., Paris, CNAM, 2013. http://www.theses.fr/2013CNAM0883.

Texto completo da fonte

Resumo:

Les applications réactives et sensibles au contexte sont des applications intelligentes qui observent l’environnement (ou contexte) dans lequel elles s’exécutent et qui adaptent, si nécessaire, leur comportement en cas de changements dans ce contexte, ou afin de satisfaire les besoins ou d'anticiper les intentions des utilisateurs. La recherche dans ce domaine suscite un intérêt considérable tant de la part des académiques que des industriels. Les domaines d'applications sont nombreux: robots industriels qui peuvent détecter les changements dans l'environnement de travail de l'usine pour adapter leurs opérations; systèmes de contrôle automobiles pour observer d'autres véhicules, détecter les obstacles, ou surveiller le niveau d'essence ou de la qualité de l'air afin d'avertir les conducteurs en cas d'urgence; systèmes embarqués monitorant la puissance énergétique disponible et modifiant la consommation en conséquence. Dans la pratique, le succès de la mise en œuvre et du déploiement de systèmes sensibles au contexte dépend principalement du mécanisme de reconnaissance et de réaction aux variations de l'environnement. En d'autres termes, il est nécessaire d'avoir une approche adaptative bien définie et efficace de sorte que le comportement des systèmes peut être modifié dynamiquement à l'exécution. En outre, la concurrence devrait être exploitée pour améliorer les performances et la réactivité des systèmes. Tous ces exigences, ainsi que les besoins en sécurité et fiabilité constituent un grand défi pour les développeurs.C’est pour permettre une écriture plus intuitive et directe d'applications réactives et sensibles au contexte que nous avons développé dans cette thèse un nouveau langage appelé INI. Pour observer les changements dans le contexte et y réagir, INI s’appuie sur deux paradigmes : la programmation événementielle et la programmation à base de règles. Événements et règles peuvent être définis en INI de manière indépendante ou en combinaison. En outre, les événements peuvent être reconfigurésdynamiquement au cours de l’exécution. Un autre avantage d’INI est qu’il supporte laconcurrence afin de gérer plusieurs tâches en parallèle et ainsi améliorer les performances et la réactivité des programmes. Nous avons utilisé INI dans deux études de cas : une passerelle M2M multimédia et un programme de suivi d’objet pour le robot humanoïde Nao. Enfin, afin d’augmenter la fiabilité des programmes écrits en INI, un système de typage fort a été développé, et la sémantique opérationnelle d’INI a été entièrement définie. Nous avons en outre développé un outil appelé INICheck qui permet de convertir automatiquement un sous-ensemble d’INI vers Promela pour permettre un analyse par model checking à l’aide de l’interpréteur SPIN
Context-aware pervasive computing has attracted a significant research interest from both academy and industry worldwide. It covers a broad range of applications that support many manufacturing and daily life activities. For instance, industrial robots detect the changes of the working environment in the factory to adapt their operations to the requirements. Automotive control systems may observe other vehicles, detect obstacles, and monitor the essence level or the air quality in order to warn the drivers in case of emergency. Another example is power-aware embedded systems that need to work based on current power/energy availability since power consumption is an important issue. Those kinds of systems can also be considered as smart applications. In practice, successful implementation and deployment of context-aware systems depend on the mechanism to recognize and react to variabilities happening in the environment. In other words, we need a well-defined and efficient adaptation approach so that the systems' behavior can be dynamically customized at runtime. Moreover, concurrency should be exploited to improve the performance and responsiveness of the systems. All those requirements, along with the need for safety, dependability, and reliability pose a big challenge for developers.In this thesis, we propose a novel programming language called INI, which supports both event-based and rule-based programming paradigms and is suitable for building concurrent and context-aware reactive applications. In our language, both events and rules can be defined explicitly, in a stand-alone way or in combination. Events in INI run in parallel (synchronously or asynchronously) in order to handle multiple tasks concurrently and may trigger the actions defined in rules. Besides, events can interact with the execution environment to adjust their behavior if necessary and respond to unpredictable changes. We apply INI in both academic and industrial case studies, namely an object tracking program running on the humanoid robot Nao and a M2M gateway. This demonstrates the soundness of our approach as well as INI's capabilities for constructing context-aware systems. Additionally, since context-aware programs are wide applicable and more complex than regular ones, this poses a higher demand for quality assurance with those kinds of applications. Therefore, we formalize several aspects of INI, including its type system and operational semantics. Furthermore, we develop a tool called INICheck, which can convert a significant subset of INI to Promela, the input modeling language of the model checker SPIN. Hence, SPIN can be applied to verify properties or constraints that need to be satisfied by INI programs. Our tool allows the programmers to have insurance on their code and its behavior

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Zhu, Leon Yang. "Dominant strategy double auction mechanisms design and implementation /". [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0011354.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Meng, Jie. "Achieving dynamic inter-organizational workflow management by integrating business processes, e-services, events, and rules". [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000143.

Texto completo da fonte

Resumo:

Thesis (Ph. D.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains xii, 102 p.; also contains graphics. Includes vita. Includes bibliographical references.

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

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.

Texto completo da fonte

Resumo:

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

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Wadatkar, Ajit. "Process Selection for Hole Operations Using a Rule Based Approach". Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1108480552.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Vitorino, dos Santos Filho Jairson. "CHROME: a model-driven component-based rule engine". Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1638.

Texto completo da fonte

Resumo:

Made available in DSpace on 2014-06-12T15:51:39Z (GMT). No. of bitstreams: 2 arquivo2757_1.pdf: 5759741 bytes, checksum: 8075c58c36a6d409b242f2a7873fb02f (MD5) license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2009
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Vitorino dos Santos Filho, Jairson; Pierre Louis Robin, Jacques. CHROME: a model-driven component-based rule engine. 2009. Tese (Doutorado). Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Pernambuco, Recife, 2009.

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Jarvis, Matthew P. "Applying machine learning techniques to rule generation in intelligent tutoring systems". Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0429104-112724.

Texto completo da fonte

Resumo:

Thesis (M.S.)--Worcester Polytechnic Institute.
Keywords: Intelligent Tutoring Systems; Model Tracing; Machine Learning; Artificial Intelligence; Programming by Demonstration. Includes bibliographical references.

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Garzón, Miguel Alejandro. "Reverse Engineering Object-Oriented Systems into Umple: An Incremental and Rule-Based Approach". Thesis, Université d'Ottawa / University of Ottawa, 2015. http://hdl.handle.net/10393/32615.

Texto completo da fonte

Resumo:

This thesis investigates a novel approach to reverse engineering, in which modeling information such as UML associations, state machines and attributes is incrementally added to code written in Java or C++, while maintaining the system in a textual format. Umple is a textual representation that blends modeling in UML with programming language code. The approach, called umplification, produces a program with behavior identical to the original one, but written in Umple and enhanced with model-level abstractions. As the resulting program is Umple code, our approach eliminates the distinction between code and model. We implemented automated umplification in a tool called the Umplificator. The tool is rule-driven: code, including Umple code, is parsed and processed into an internal representation, which is then operated on by rules; transformed textual code and model, in Umple, is then generated. The rules used to transform code to model have been iteratively refined by using the tool on a variety of open-source software systems. The thesis consists of three main parts. The first part (Chapters 1 and 2) present the research questions and research methodology, as well as introducing Umple and the background necessary to understand the rest of the thesis. The umplification method is presented at increasing levels of detail through Chapters 3 and 4. Chapters 5 and 6 present the tool and evaluation of our approach, respectively. An analysis of related work, and comparison to our own, appears in Chapter 7. Finally, conclusions and future work directions are presented in Chapter 8.

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Burhans, Debra Thomas. "A question answering interpretation of resolution refutation". Buffalo, N.Y. : Dept. of Computer Science, State University of New York at Buffalo, 2002. http://www.cse.buffalo.edu/tech%2Dreports/2002%2D03.ps.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Lakkaraju, Sai Kiran. "A SLDNF formalization for updates and abduction /". View thesis View thesis, 2001. http://library.uws.edu.au/adt-NUWS/public/adt-NUWS20030507.112018/index.html.

Texto completo da fonte

Resumo:

Thesis (M.Sc. (Hons.)) -- University of Western Sydney, 2001.
"A thesis submitted for the degree of Master of Science (Honours) - Computing and Information Technology at University of Western Sydney" Bibliography : leaves 93-98.

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

De, Kock Erika. "Decentralising the codification of rules in a decision support expert knowledge base". Pretoria : [s.n.], 2003. http://upetd.up.ac.za/thesis/available/etd-03042004-105746.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Endl, Rainer. "Regelbasierte Entwicklung betrieblicher Informationssysteme /". Bern : [s.n.], 2004. http://www.zb.unibe.ch/download/eldiss/04endl_r.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Ong, Yongzhi [Verfasser], Winfried [Akademischer Betreuer] Kurth e Hans-Jörg [Akademischer Betreuer] Kreowski. "Extension of the Rule-Based Programming Language XL by Concepts for Multi-Scaled Modelling and Level-of-Detail Visualization / Yongzhi Ong. Gutachter: Winfried Kurth ; Hans-Jörg Kreowski. Betreuer: Winfried Kurth". Göttingen : Niedersächsische Staats- und Universitätsbibliothek Göttingen, 2015. http://d-nb.info/1070423653/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Håkansson, Anne. "Graphic Representation and Visualisation as Modelling Support for the Knowledge Acquisition Process". Doctoral thesis, Uppsala University, Computer Science, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3812.

Texto completo da fonte

Resumo:

The thesis describes steps taken towards using graphic representation and visual modelling support for the knowledge acquisition process in knowledge-based systems – a process commonly regarded as difficult. The performance of the systems depends on the quality of the embedded knowledge, which makes the knowledge acquisition phase particularly significant. During the acquisition phase, a main obstacle to proper extraction of information is the absence of effective modelling techniques.

The contributions of the thesis are: introducing a methodology for user-centred knowledge modelling, enhancing transparency to support the modelling of content and of the reasoning strategy, incorporating conceptualisation to simplify the grasp of the contents and to support assimilation of the domain knowledge, and supplying a visual compositional logic programming language for adding and modifying functionality.

The user-centred knowledge acquisition model, proposed in this thesis, applies a combination of different approaches to knowledge modelling. The aim is to bridge the gap between the users (i.e., knowledge engineers, domain experts and end users) and the system in transferring knowledge, by supporting the users through graphics and visualisation. Visualisation supports the users by providing several different views of the contents of the system.

The Unified Modelling Language (UML) is employed as a modelling language. A benefit of utilising UML is that the knowledge base can be modified, and the reasoning strategy and the functionality can be changed directly in the model. To make the knowledge base more comprehensible and expressive, we incorporated visual conceptualisation into UML’s diagrams to describe the contents. Visual conceptualisation of the knowledge can also facilitate assimilation in a hypermedia system through visual libraries.

Visualisation of functionality is applied to a programming paradigm, namely relational programming, often employed in artificial intelligence systems. This approach employs Venn-Euler diagrams as a graphic interface to a compositional operator based relational programming language.

The concrete result of the research is the development of a graphic representation and visual modelling approach to support the knowledge acquisition process. This approach has been evaluated for two different knowledge bases, one built for hydropower development and river regulation and the other for diagnosing childhood diseases.

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Beatrix, Christopher. "Justifications dans les approches ASP basées sur les règles : application au backjumping dans le solveur ASPeRiX". Thesis, Angers, 2016. http://www.theses.fr/2016ANGE0026/document.

Texto completo da fonte

Resumo:

L’ Answer Set Programming (ASP) est un formalisme capable de représenter des connaissances en Intelligence Artificielle à l’aide d’un programme logique au premier ordre pouvant contenir des négations par défaut. En quelques années, plusieurs solveurs performants ont été proposés pour calculer les solutions d’un programme ASP que l’on nomme answer sets.Nous nous intéressons ici plus particulièrement au solveur ASPeRiX qui instancie les règles au premier ordre à la volée durant le calcul des answer sets. Pour réaliser cela, ASPeRiX applique un chaînage avant sur les règles à partir de littéraux précédemment déterminés.L’étude de ce solveur nous amène notamment à considérer la notion de justification dans le cadre d’une approche de calcul d’ answer sets basée sur les règles. Les justifications permettent d’expliquer pourquoi certaines propriétés sont vérifiées. Parmi celles-ci, nous nous concentrons particulièrement sur les raisons d’échecs qui justifient pourquoi certaines branches de l’arbre de recherche n’aboutissent pas à un answer set.Cela nous conduit à implémenter une version d’ ASPeRiX proposant du backjumping qui évite de parcourir systématiquement toutes les branches de l’arbre de recherche grâce aux informations fournies par les raisons d’échecs
Answer set programming (ASP) is a formalism able to represent knowledge in Artificial Intelligence thanks to a first order logic program which can contain default negations. In recent years, several efficient solvers have been proposed to compute the solutions of an ASP program called answer sets. We are particularly interested in the ASPeRiX solver that instantiates the first order rules on the fly during the computation of answer sets. It applies a forward chaining of rules from literals previously determined. The study of this solver leads us to consider the concept of justification as part of a rule-based approach for computing answer sets. Justifications enable to explain why some properties are true or false. Among them, we focus particularly on the failure reasons which justify why some branches of the search tree does not result in an answer set. This encourages us to implement a version of ASPeRiX with backjumping in order to jump to the last choice point related to the failure in the search tree thanks to information provided by the failure reasons

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Ellery, Ian Gareth. "The creation of missing rules for knowledge based systems". Thesis, University of Aberdeen, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.291022.

Texto completo da fonte

Resumo:

It is unlikely that any knowledge based system will have a complete rule-base when it is first built. Whether the rules are automatically generated from examples by machine learning methods, or hand encoded by a knowledge engineer, some rules will almost certainly be missing. It is the aim of Knowledge Refinement Systems to enable new rules to be created and included into an existing knowledge base as easily as possible. Previous approaches to this problem have either helped the expert detect that a rule is missing, or attempted to learn a new rule automatically from examples. However, in the former approach, the expert still has to express the new rule, and in the latter, many examples are usually required. The approach described in this thesis falls somewhere between these two extremes. By taking an example which has just failed to give the conclusion the expert required, it should be possible to generate a few plausible new rules. The expert can then select the required rule; a task which he should find easier than building a rule. The method used is to search forward from the example given by the expert, and backward from the conclusion he requires. This 'closes the gap' in the reasoning, and reduces the number of spurious rules generated. Many new rules are created by comparing states from the search processes. These are then filtered using domain specific heuristics, which can be automatically generated from the existing rule-base. These heuristics can also be refined, allowing the refinement system to improve its performance.

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Mário, Oliveira Rodrigues Cleyton. "Component assembly and theorem proving in constraint handling rules". Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1821.

Texto completo da fonte

Resumo:

Made available in DSpace on 2014-06-12T15:52:36Z (GMT). No. of bitstreams: 1 license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2009
Devido á grande demanda por softwares cada vez mais robustos, complexos e flexíveis, e, sobretudo, pelo curtíssimo tempo de entrega exigido, a engenharia de software tem procurado novos meios de desenvolvimento que supram satisfatoriamente essas demandas. Uma forma de galgar esses novos patamares de produtividade provém do uso de uma metodologia baseada em agentes que se comunicam e com isso, ao invés dos programas serem estritamente programados, o comportamento destes sistemas de software emerge da interação de agentes, robôs, ou subsistemas aut onomos, independentes, além de declarativamente especificados. Isto provê a habilidade para automaticamente configurá -los, otimizá-los, monitorá-los, adaptá-los, diagnosticá-los, repará-los e protegê-los dentro do ambiente. Contudo, um grande problema das linguagens declarativas é a falta de mecanismos que permitem a melhor estruturação de dados, facilitando portanto, o reuso. Portanto, esta dissertação explica o desenvolvimento de nova linguagem lógica declarativa para programar sistemas de raciocínio automático de uma forma modularizada: C2HR∨. A linguagem base escolhida para a extensão com componentes lógicos foi CHR. Os motivos para essa escolha são definidos ao longo da dissertação. Duas abordagens, portanto, são apresentadas: a primeira, conhecida como CHRat, foi desenvolvida numa parceria juntamente com o grupo de pesquisas CONTRAINTES do INRIA/Rocquencourt-Paris, onde o programador ´e o responsável direto por definir os componentes CHR, permitindo o seu reuso por outros componentes; a segunda aplicação, CHRtp, visa atender prioritariamente requisitos de completude e, por isso, se baseia em procedimentos lógicos de inferência como: o raciocínio para frente, o raciocínio para trás, e a resolução/factoring. A dissertação mostra também alguns exemplos práticos, onde uso de componentes facilita radicalmente sua implementação. As contribuições almejadas com essa dissertação são: a definição de uma família bem formalizada de provadores de teoremas automáticos, que podem trabalhar com sentenças especificadas em lógica horn ou em lógica de primeira ordem, a extensão de CHR como uma linguagem modular de propósito geral, a melhor estruturação de bases conhecimentos e até o uso em conjunto de bases heterogêneas, a definição de uma linguagem para a fácil e direta estruturação de dados por meio de componentes, dentre outras

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Pierre-Louis, Péguy. "Algorithmic Developments in Monte Carlo Sampling-Based Methods for Stochastic Programming". Diss., The University of Arizona, 2012. http://hdl.handle.net/10150/228433.

Texto completo da fonte

Resumo:

Monte Carlo sampling-based methods are frequently used in stochastic programming when exact solution is not possible. In this dissertation, we develop two sets of Monte Carlo sampling-based algorithms to solve classes of two-stage stochastic programs. These algorithms follow a sequential framework such that a candidate solution is generated and evaluated at each step. If the solution is of desired quality, then the algorithm stops and outputs the candidate solution along with an approximate (1 - α) confidence interval on its optimality gap. The first set of algorithms proposed, which we refer to as the fixed-width sequential sampling methods, generate a candidate solution by solving a sampling approximation of the original problem. Using an independent sample, a confidence interval is built on the optimality gap of the candidate solution. The procedures stop when the confidence interval width plus an inflation factor falls below a pre-specified tolerance epsilon. We present two variants. The fully sequential procedures use deterministic, non-decreasing sample size schedules, whereas in another variant, the sample size at the next iteration is determined using current statistical estimates. We establish desired asymptotic properties and present computational results. In another set of sequential algorithms, we combine deterministically valid and sampling-based bounds. These algorithms, labeled sampling-based sequential approximation methods, take advantage of certain characteristics of the models such as convexity to generate candidate solutions and deterministic lower bounds through Jensen's inequality. A point estimate on the optimality gap is calculated by generating an upper bound through sampling. The procedure stops when the point estimate on the optimality gap falls below a fraction of its sample standard deviation. We show asymptotically that this algorithm finds a solution with a desired quality tolerance. We present variance reduction techniques and show their effectiveness through an empirical study.

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Deng, Mario [Verfasser]. "Predicting Rules for Cancer Subtype Classification using Grammar-Based Genetic Programming on various Genomic Data Types / Mario Deng". Bonn : Universitäts- und Landesbibliothek Bonn, 2018. http://d-nb.info/115667946X/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Gomes, Ana Sofia. "Derivation methods for hybrid knowledge bases with rules and ontologies". Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2563.

Texto completo da fonte

Resumo:

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática
First of all, I would like to thank my advisor, José Júlio Alferes, for his incredible support. Right from the start, during the first semester of this work, when we were 2700 km apart and meeting regularly via Skype, until the end of this dissertation, he was always committed and available for discussions, even when he had lots of other urgent things to do. A really special thanks to Terrance Swift, whom acted as an advisor, helping me a lot in the second implementation, and correcting all XSB’s and CDF’s bugs. This implementation wouldn’t surely have reached such a fruitful end without his support. I would also like to thank all my colleagues and friends at FCT for the great work environment and for not letting me take myself too serious. A special thanks to my colleagues from Dresden for encouraging me to work even when there were so many other interesting things to do as an Erasmus student. I’m indebted to Luís Leal, Bárbara Soares, Jorge Soares and Cecília Calado, who kindly accepted to read a preliminary version of this report and gave me their valuable comments. For giving me working conditions and a partial financial support, I acknowledge the Departamento de Informática of the Faculdade de Ciências e Tecnologias of Universidade Nova de Lisboa. Last, but definitely not least, I would like to thank my parents and all my family for their continuous encouragement and motivation. A special thanks to Bruno for his love, support and patience.

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Espinosa, Oviedo Javier Alfonso. "Coordination fiable de services de données à base de politiques actives". Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM022/document.

Texto completo da fonte

Resumo:

Nous proposons une approche pour ajouter des propriétés non-fonctionnelles (traitement d'exceptions, atomicité, sécurité, persistance) à des coordinations de services. L'approche est basée sur un Modèle de Politiques Actives (AP Model) pour représenter les coordinations de services avec des propriétés non-fonctionnelles comme une collection de types. Dans notre modèle, une coordination de services est représentée comme un workflow compose d'un ensemble ordonné d'activité. Chaque activité est en charge d'implante un appel à l'opération d'un service. Nous utilisons le type Activité pour représenter le workflow et ses composants (c-à-d, les activités du workflow et l'ordre entre eux). Une propriété non-fonctionnelle est représentée comme un ou plusieurs types de politiques actives, chaque politique est compose d'un ensemble de règles événement-condition-action qui implantent un aspect d'un propriété. Les instances des entités du modèle, politique active et activité peuvent être exécutées. Nous utilisons le type unité d'exécution pour les représenter comme des entités dont l'exécution passe par des différents états d'exécution en exécution. Lorsqu'une politique active est associée à une ou plusieurs unités d'exécution, les règles vérifient si l'unité d'exécution respecte la propriété non-fonctionnelle implantée en évaluant leurs conditions sur leurs états d'exécution. Lorsqu'une propriété n'est pas vérifiée, les règles exécutant leurs actions pour renforcer les propriétés en cours d'exécution. Nous avons aussi proposé un Moteur d'exécution de politiques actives pour exécuter un workflow orientés politiques actives modélisé en utilisant notre AP Model. Le moteur implante un modèle d'exécution qui détermine comment les instances d'une AP, une règle et une activité interagissent entre elles pour ajouter des propriétés non-fonctionnelles (NFP) à un workflow en cours d'exécution. Nous avons validé le modèle AP et le moteur d'exécution de politiques actives en définissant des types de politiques actives pour adresser le traitement d'exceptions, l'atomicité, le traitement d'état, la persistance et l'authentification. Ces types de politiques actives ont été utilisés pour implanter des applications à base de services fiables, et pour intégrer les données fournies par des services à travers des mashups
We propose an approach for adding non-functional properties (exception handling, atomicity, security, persistence) to services' coordinations. The approach is based on an Active Policy Model (AP Model) for representing services' coordinations with non-functional properties as a collection of types. In our model, a services' coordination is represented as a workflow composed of an ordered set of activities, each activity in charge of implementing a call to a service' operation. We use the type Activity for representing a workflow and its components (i.e., the workflow' activities and the order among them). A non-functional property is represented as one or several Active Policy types, each policy composed of a set of event-condition-action rules in charge of implementing an aspect of the property. Instances of active policy and activity types are considered in the model as entities that can be executed. We use the Execution Unit type for representing them as entities that go through a series of states at runtime. When an active policy is associated to one or several execution units, its rules verify whether each unit respects the implemented non-functional property by evaluating their conditions over their execution unit state, and when the property is not verified, the rules execute their actions for enforcing the property at runtime. We also proposed a proof of concept Active Policy Execution Engine for executing an active policy oriented workflow modelled using our AP Model. The engine implements an execution model that determines how AP, Rule and Activity instances interact among each other for adding non-functional properties (NFPs) to a workflow at execution time. We validated the AP Model and the Active Policy Execution Engine by defining active policy types for addressing exception handling, atomicity, state management, persistency and authentication properties. These active policy types were used for implementing reliable service oriented applications, and mashups for integrating data from services

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Wolf, Robert Pawel. "Declarative computer music programming: using Prolog to generate rule-based musical counterpoints". Thesis, 2015. http://hdl.handle.net/2440/96913.

Texto completo da fonte

Resumo:

This submission for the degree of Doctor of Philosophy at the Elder Conservatorium of Music, University of Adelaide, is presented as a conventional, text-based thesis, supported by computer code and audio files. The primary purpose of this research investigation in the field of Artificial Intelligence has been to test the capabilities of the declarative programming paradigm to generate musical counterpoints within the framework of a specially created expert system. The project has tested if such a contrapuntal expert system can evolve through a process of mutation of its own code and generate musical counterpoints that do not conform exactly with the original programming. It presents for the first time a music based study of this capacity for code self-modification. The expert system developed for this project was constructed declaratively, using the Prolog computer language, rather than the more common imperative approach. Although it is a General-Purpose language, Prolog is particularly effective in the construction of Artificial Expert Systems, because its unique declarative programming style allows the programmer to focus on describing the problem rather than describing how to solve the problem. This leaves to the machine the task of finding the solution to the given problem. The problem in this case is how to generate - artificially – simple counterpoints to short melodic phrases drawn from the cantus firmus tradition. As part of the problem solving process the expert system was taken through a series of evolutionary experiments with Artificial Neural Networks used as a fitness function.
Thesis (Ph.D.) -- University of Adelaide, Elder Conservatorium of Music, 2015

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Lakkaraju, Sai K. "A SLDNF based formalization for updates and abduction". Thesis, 2001. http://handle.uws.edu.au:8081/1959.7/381.

Texto completo da fonte

Resumo:

Knowledge representation and inference are the backbone of artificial intelligence, and logic programming is one of the most widely used knowledge representation tools. Logic programming with deduction/induction/abduction as the reasoning technique is serving numerous fields of artificial intelligence. In dynamic domains where there are constant changes in knowledge, updating the knowledge base is crucial to keep it stable. This thesis investigates the issues in updating the knowledge base. Two types of logic program based updates are considered, simple fact based updates where the knowledge base is updated by a simple fact, and rule based updates where the knowledge base is updated by a rule. A SLDNF based procedural approach is proposed to implement such updates. This thesis also investigates the issues involved in simple fact based and rule based abduction, and it is observed that updates are closely related to abduction. A SLDNF based procedural approach to perform simple fact/rule based updates and abduction is proposed as a result of this study

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Shyu, Jenq-Long, e 徐正龍. "CAROL4: An Object and Rule-Based Programming Language— An Interpreter Using C++ Implementation". Thesis, 1995. http://ndltd.ncl.edu.tw/handle/33635581927824809009.

Texto completo da fonte

Resumo:

碩士
國立中央大學
資訊及電子工程研究所
83
Most software developing systems do not provide a good language or mechanism to model the complex student model and teaching strategy in intelligent tutoring systems (ITSs). This motivates us to design a general-purpose language , named CAROL4, to achieve this objective. In CAROL4, we preserve the rule-based programming style inherited from its previous version, CAROL3, and use delegation for resource sharing between objects, instead of inheritance. Delegation removes the distinction between classes and instances, and allows objects to delegate responsibility for performing an operation or finding a value to their ancestors. It helps us to build CAROL4 as a language that has the ability to add properties to objects dynamically. There is no difference between the state and behavior of an object, they are both variables of the object now. This makes CAROL4 a simpler and more elegant language for knowledge construction.

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Lei, Yiming. "Architectural aspects and a prototype system for handling disputes in electronic commerce transactions /". 2002.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Zhan, Ruo-Jie, e 詹若(木疌). "Cognitive Diagnosis of Learning Path in C++ Programming Language based on Rule Space Model for College Students". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/53739985985314916316.

Texto completo da fonte

Resumo:

碩士
中華大學
資訊管理學系(所)
98
Programming Language is a practical course, which trains students’ logical thinking and problem solving. It involves logical design, problem analysis and problem solving. Therefore, to promote students’ programming, debugging and basic concepts understanding is an important issue. Programming Language is one of the basic courses. Students learn the information planning, managing and manipulation from variable declaration, data processing, flow control and output progress. This study applied Rule Space Model to generalize, analyze and study the C++ teaching concepts. Students are evaluated and found out the cognition mistakes. This study assisted find out the learning routes and help learning actively. The experimental objectives are 100 freshmen of the Information Management Department, who studied Programming Language (I) course. The experiment result showed the Knowledge attributes which students mastered and the two learning routes in programming language. According to the student learning analysis table from the knowledge structure, students can realize the weakness and follow teachers’ instructions and suggestions. Based on the analysis result, teachers design the appropriate learning route for students and provide sufficient practical practice, engage team competitions and motivate students to promote the learning performance.

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

"Supervisory Control Optimization with Sequential Quadratic Programming for Parallel Hybrid Vehicle with Synchronous Power Sources". Master's thesis, 2017. http://hdl.handle.net/2286/R.I.44420.

Texto completo da fonte

Resumo:

abstract: The thesis covers the development and modeling of the supervisory hybrid controller using two different methods to achieve real-world optimization and power split of a parallel hybrid vehicle with a fixed shaft connecting the Internal Combustion Engine (ICE) and Electric Motor (EM). The first strategy uses a rule based controller to determine modes the vehicle should operate in. This approach is well suited for real-world applications. The second approach uses Sequential Quadratic Programming (SQP) approach in conjunction with an Equivalent Consumption Minimization Strategy (ECMS) strategy to keep the vehicle in the most efficient operating regions. This latter method is able to operate the vehicle in various drive cycles while maintaining the SOC with-in allowed charge sustaining (CS) limits. Further, the overall efficiency of the vehicle for all drive cycles is increased. The limitation here is the that process is computationally expensive; however, with advent of the low cost high performance hardware this method can be used for the hybrid vehicle control.
Dissertation/Thesis
Masters Thesis Engineering 2017

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Ong, Yongzhi. "Extension of the Rule-Based Programming Language XL by Concepts for Multi-Scaled Modelling and Level-of-Detail Visualization". Doctoral thesis, 2015. http://hdl.handle.net/11858/00-1735-0000-0022-5FC5-B.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Teses / dissertações sobre o tema "Rule based programming"

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos