Thèses : « Induction (Logic) »

1

Wedin, Hanna. "Mathematical Induction." Thesis, Uppsala universitet, Algebra och geometri, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-414099.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

2

Hill, Alexandra. "Reasoning by analogy in inductive logic." Thesis, University of Manchester, 2013. https://www.research.manchester.ac.uk/portal/en/theses/reasoning-by-analogy-in-inductive-logic(039622d8-ab3f-418f-b46c-4d4e7a9eb6c1).html.

Texte intégral

Résumé :

This thesis investigates ways of incorporating reasoning by analogy into Pure (Unary) Inductive Logic. We start with an analysis of similarity as distance, noting that this is the conception that has received most attention in the literature so far. Chapter 4 looks in some detail at the consequences of adopting Hamming Distance as our measure of similarity, which proves to be a strong requirement. Chapter 5 then examines various adaptations of Hamming Distance and proposes a subtle modification, further-away-ness, that generates a much larger class of solutions.

Styles APA, Harvard, Vancouver, ISO, etc.

3

Lapointe, Stéphane. "Induction of recursive logic programs." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7467.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Rowan, Michael. "Hume, probability and induction." Title page, contents and abstract only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phr877.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Caldon, Patrick Computer Science &amp Engineering Faculty of Engineering UNSW. "Limiting programs for induction in artificial intelligence." Awarded by:University of New South Wales, 2008. http://handle.unsw.edu.au/1959.4/37484.

Texte intégral

Résumé :

This thesis examines a novel induction-based framework for logic programming. Limiting programs are logic programs distinguished by two features, in general they contain an infinite data stream over which induction will be performed, and in general it is not possible for a system to know when a solution for any program is correct. These facts are characteristic of some problems involving induction in artificial intelligence, and several problems in knowledge representation and logic programming have exactly these properties. This thesis presents a specification language for problems with an inductive nature, limiting programs, and a resolution based system, limiting resolution, for solving these problems. This framework has properties which guarantee that the system will converge upon a particular answer in the limit. Solutions to problems which have such an inductive property by nature can be implemented using the language, and solved with the solver. For instance, many classification problems are inductive by nature. Some generalized planning problems also have the inductive property. For a class of generalized planning problems, we show that identifying a collection of domains where a plan reaches a goal is equivalent to producing a plan. This thesis gives examples of both. Limiting resolution works by a generate-and-test strategy, creating a potential solution and iteratively looking for a contradiction with the growing stream of data provided. Limiting resolution can be implemented by modifying conventional PROLOG technology. The generateand- test strategy has some inherent inefficiencies. Two improvements have arisen from this work; the first is a tabling strategy which records previously failed attempts to produce a solution and thereby avoids redundant test steps. The second is based on the heuristic observation that for some problems the size of the test step is proportional to the closeness of the generated potential-solution to the real solution, in a suitable metric. The observation can be used to improve the performance of limiting resolution. Thus this thesis describes, from theoretical foundations to implementation, a coherent methodology for incorporating induction into existing general A.I. programming techniques, along with examples of how to perform such tasks.

Styles APA, Harvard, Vancouver, ISO, etc.

6

Tappert, Peter M. "Damage identification using inductive learning." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-05092009-040651/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Kimber, Timothy. "Learning definite and normal logic programs by induction on failure." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9961.

Texte intégral

Résumé :

This thesis presents two novel inductive logic programming (ILP) approaches, based on the notion of a connected theory. A connected theory contains clauses that depend on one another, either directly or via clauses in the background knowledge. Generalisation of such a theory is proved to be a sound and complete method for learning definite ILP hypotheses. The Induction on Failure (IOF) proof procedure, based on the connected theory generalisation method, adds secondary examples into the hypothesis, and generates auxiliary clauses to explain them. These concepts, novel to IOF, address the issues of incompleteness present in previous definite ILP methods. The concept of the connected theory is also applied to the non-monotonic, normal program setting. Thus, the method of generalisation of a normal connected theory is presented. Fundamental to this is the assertion that a partial non-monotonic hypothesis must include both positive and negative information, which the general hypothesis should preserve. This has resulted in, as far as the author is aware, the most complete semantic characterisation available of non-monotonic ILP using a bridge formula. It is proved that generalisation of such a formula to a set of completed definitions is a sound method of generating normal program hypotheses. In the course of establishing a completeness result for this latter approach, the semantics of the supported consequences of a normal program are defined, and the support tree method is presented and shown to be a sound and complete proof procedure for supported consequences. Using these results, it is shown that, for function-free programs, any correct hypothesis for which the examples are supported consequences of the learned program can be derived via a normal connected theory.

Styles APA, Harvard, Vancouver, ISO, etc.

8

Barnes, Valerie Elizabeth. "The quality of human judgment : an alternative perspective /." Thesis, Connect to this title online; UW restricted, 1985. http://hdl.handle.net/1773/9139.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

9

Syed, Altaf Ahmad. "Applied Fuzzy Logic Controls for Improving Dynamic Response of Induction Machines." Connect to resource online, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1219671348.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Barker, Gillian Abernathy. "Abstraction, analogy and induction : toward a general account of ampliative inference /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1997. http://wwwlib.umi.com/cr/ucsd/fullcit?p9820857.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

Snyder, Thomas D. "The effects of variability on damage identification with inductive learning." Thesis, Virginia Tech, 1994. http://hdl.handle.net/10919/42160.

Texte intégral

Résumé :

This work discusses the effects of inherent variabilities on the damage identification problem. The goal of damage identification is to detect structural damage before it reaches a level which will detrimentally affect the structure’s performance. Inductive learning is one tool which has been proposed as an effective method to perform damage identification. There are many variabilities which are inherent in damage identification and can cause problems when attempting to detect damage. Temperature fluctuation and manufacturing variability are specifically addressed. Temperature is shown to be a cause-effect variability which has a measurable effect on the damage identification problem. The inductive learning method is altered to accommodate temperature and shown experimentally to be effective in identifying added mass damage at several locations on an aluminum plate. Manufacturing variability is shown to be a non-quantifiable variability. The inductive learning method is shown to be able to accommodate this variability through careful examination of statistical significances in dynamic response data. The method is experimentally shown to be effective in detecting hole damage in randomly selected aluminum plates from a manufactured batch. Master of Science

Styles APA, Harvard, Vancouver, ISO, etc.

12

Silvestrini, Luiz Henrique da Cruz. "Tableaux e indução na lógica do plausível /." Marília : [s.n.], 2005. http://hdl.handle.net/11449/91404.

Texte intégral

Résumé :

Orientador: Hércules de Araújo Feitosa Banca: Maria Cláudia Cabrini Grácio Banca: Ítala Maria Loffredo DOttaviano Resumo: Em 1999, Grácio introduziu a Lógica do Plausível como uma particularização de uma família de sistemas lógicos, caracterizados pela inclusão de um quantificador generalizado na sintaxe da lógica clássica de predicados, a saber, as Lógicas Moduladas, cuja formalização semântica é dada por um subconjunto do conjunto das partes do universo. Nesta particularização de lógica modulada, é incluído o quantificador do Plausível P, que engendra a formalização de um raciocínio indutivo de maneira que "uma 'boa parte' dos indivíduos possui determinada propriedade". O presente trabalho introduz um novo sistema dedutivo para a Lógica do Plausível, denominado TLP, construído seguindo os princípios de tableaux semânticos clássicos. Na elaboração do sistema de tableaux TLP, há uma forma original de localizar pontos nos ramos de um dado tableau. Ademais, por meio do raciocínio indutivo engendrado por esta lógica, discussões sucederam acerca da indução ser considerada um processo genuinamente lógico, tendo por ponto de partida o problema epistemológico da indução. Abstract: The Logic of the Plausible was introduced in 1999 by Grácio as a particularization of a family of logical systems characterized by the inclusion of a generalized quantifier in the syntax of the classical logic of predicates, denominated the Modulated Logics, whose semantical interpretation is given by a subset of the power set of the universe. In this particularization of modulated logics, it is included the quantifier of Plausible P that engenders the formalization of a type of inductive reasoning so that "a 'good' number of individuals possesses certain property ". This work introduces a new deductive system for the Logic of the Plausible, denominated TLP, built according to the principles of the classical semantical tableaux. In the construction of the tableaux system TLP, an original form of locating points in the branches of any tableaux is presented. Besides, through the inductive reasoning engendered by this logic, the work also promotes discussions concerning the consideration of the induction as a genuinely logical process, beginning from the epistemological problem of the induction. Mestre

Styles APA, Harvard, Vancouver, ISO, etc.

13

Nurwati, Tri. "Contribution to fuzzy logic controller of six-phase induction generator for wind turbine application." Electronic Thesis or Diss., Amiens, 2019. http://www.theses.fr/2019AMIE0064.

Texte intégral

Résumé :

La génératrice à induction à cage d'écureuil joue un rôle important dans diverses applications éoliennes. Dans cette thèse, une génératrice à induction à six phases à cage d'écureuil présentant 24 pôles a été étudiée. Cette génératrice peut continuer de fonctionner même lorsque 1, 2 ou 3 phases statoriques ou bras d'onduleur sont défaillants. Un modèle de la génératrice à induction dit macroscopique est proposé basé sur les équations standard de tension de la machine et des équations générales du couple et de la vitesse rotorique dans le repère abcdef. Ses paramètres sont similaires à ceux des modèles αβ et dq. Lors de l'ouverture d'un enroulement statorique, ce modèle peut fonctionner comme un modèle à circuit interne équivalent en ouvrant ou en fermant un commutateur tout en nécessitant beaucoup moins de temps de calcul. Associé au système de commande indirecte du champ rotorique, ce modèle a été simulé avec succès. Un système de contrôle par logique floue des courants basé sur la matrice MacVicar-Whelan a été mis au point pour éliminer les oscillations de puissance apparaissant lors de l'ouverture d'une phase statorique. Pour valider la méthode proposée préalablement simulée, des tests ont été effectués sur un banc d'essais constitué d'un prototype de machine à induction hexaphasée de 24 kW The squirrel cage induction generator plays a significant role in various wind turbine applications. In this dissertation, the squirrel cage six-phase induction generator (SC6PIG) with 24 poles has been studied. This generator can operate even 1, 2 or 3 phases of the stator windings or inverter legs are lost. The proposed model of the SC6PIG is arranged based on the basic voltage equations of the induction machine and the general torque and rotor speed equations which use axis abcdef. Its parameters use similar to the parameters of αβ and dq models to apply the model in healthy and faulty conditions. When a stator winding opens, this model can work as an internal circuit-oriented model by opening or closing a switch but requires less computation time. Associated to the indirect rotor field oriented control (IRFOC), this model has been simulated successfully. Then a fuzzy logic control (FLC) system which uses MacVicar-Whelan matrix has been established in order to eliminate the power ripples that occur when one phase is missing. To validate the proposed method that has been previously simulated, tests have been carried out on the 24 kW prototype induction generator of the wind turbine

Styles APA, Harvard, Vancouver, ISO, etc.

14

Chen, Youming. "The Problem of Induction, Ordinary Language Dissolution, and Evidence." Scholarship @ Claremont, 2017. http://scholarship.claremont.edu/scripps_theses/989.

Texte intégral

Résumé :

The problem of induction is most famously discussed by David Hume, though he himself has never resorted to the notion of “induction.” As part of Hume’s overall project of identifying the logical fallacy of causal relations, the problem of induction is identified as the problem of “the unobservable matters of fact.“ Hume argues that, as empirical beings, we can believe in two types of knowledge with confidence: relations of ideas and observable matters of facts. We can be certain about the relations of ideas, since by analyzing the relation itself we can come to necessarily true conclusions about such relations. On the other hand, we do not need to question observable matters of fact, since such are the content of our experience, and empirical matters such as “tables” and “chairs” are not subject to truth or falsity: it would be quite meaningless to argue that “it is true that table.” Though our perceptive experience easily invites another interesting philosophical discussion - most famously discusses by Descartes - that is, the external world scepticism, that is not something that this paper would address. Hume’s point, in the end, is to show that when we infer any unobservable matters of fact - that is, inductive inferences - from observable matters of facts, we are committing to a logical fallacy where the true premises of the inference does not guarantee the truth of the conclusion.

Styles APA, Harvard, Vancouver, ISO, etc.

15

Olson, Charles. "Similarity, properties and concepts." Thesis, University of Oxford, 2004. http://ora.ox.ac.uk/objects/uuid:02e158df-0445-4380-9ef8-bf488d00a889.

Texte intégral

Résumé :

This thesis argues that one can fruitfully think of Nelson Goodman's New Riddle of Induction as a reductio ad absurdum of a certain set of views of the relationship between similarities, on the one hand, and properties, concepts, or predicates, on the other. It argues that any view which takes similarities between particulars to be most fundamentally explained by those objects' sharing a property, satisfying a concept, or falling under a predicate leaves itself without the resources to provide a satisfying answer to a Goodmanian sceptic who proposes that inductive inferences using "grue" are equally as warranted as those using "green". I argue for an alternative view of similarity and inductive warrant which holds that the content of perceptual experience includes non-conceptual content the satisfaction conditions of which include that concept-independent similarities obtain. I argue further that it is only on the basis of that non-conceptual content that we are able satisfactorily to distinguish predicates like "grue" from those like "green." We must make such a distinction if we are to provide an acceptable account of inductive warrant. In the course of developing this view, I critique a range of mainstream, contemporary accounts of the relationship between similarities, concepts and properties, and of the role of perceptual experience in justifying empirical beliefs. Chapter 1 argues for a realist view of similarities between particulars which takes our concepts of properties to spring from our observations of those similarities. This view is contrasted with David Armstrong's universal realism, which is rejected. Chapter 2 argues that Goodman's approach to his New Riddle based on entrenchment fails, and argues that if and only if one embraces the view of similarity and concepts that I favor then the New Riddle can be reduced to traditional Humean concerns about induction. Chapters 3 through 5 discuss difficulties for Donald Davidson's approach to the New Riddle, his account of the justification of empirical belief, and his rejection of the very idea of a conceptual scheme, tracing each of these difficulties to Davidson's view that similarities must always be understood in terms of concepts under which particulars fall. Using John McDowell's Mind and World as an example, Chapter 6 argues that any account of perceptual justification of empirical belief according to which the content of perception is limited to conceptual content will fall into the New Riddle, while accounts which permit non-conceptual content can avoid this problem.

Styles APA, Harvard, Vancouver, ISO, etc.

16

Florez, Restrepo Jorge Alejandro. "CONNECTIONS BETWEEN THE PHILOSOPHIES OF ARISTOTLE AND PEIRCE WITH REGARD TO NON-DEDUCTIVE INFERENCES AND TO THEORY OF COGNITION." OpenSIUC, 2013. https://opensiuc.lib.siu.edu/dissertations/673.

Texte intégral

Résumé :

This dissertation inaugurates a study on the connections between the philosophies of Aristotle and Charles S. Peirce. It discusses, first, Peirce's reading of Aristotle's works and philosophy, with an emphasis on three studies by Peirce of a translation of Aristotle's Categories, a study on Aristotle's notion of priority, and a study on the current situation of the Corpus Aristotelicum. Secondly, this dissertation deals with logic, particularly induction, abduction, and analogy. In the case of induction, Peirce claimed that Aristotle stated perfectly the form of induction in Prior Analytics II 23. However, Aristotle's concept of induction is not univocal, but, I argue, it stands for six different notions. Peirce seemed to neglect such diversity in Aristotle's concept of induction, even though his own concept of induction is also diverse. Aristotle's six concepts of induction and Peirce's kinds of induction do not match each other, and therefore, the chapter on induction closes with a comparison between these notions in order to determine to what extent they resemble or differ from each other. With regard to abduction, Peirce claimed that it originated in Prior Analytics II, 25. I argue that Peirce was mistaken in focusing on this passage. This does not mean that Aristotle did not have an idea of abduction. As I will show, there are other passages in Aristotle's Posterior Analytics, neglected by Peirce, in which it is possible to find such an analysis of this kind of reasoning. In the case of analogy, both philosophers have a similar and clear account of it as a compound or composite. However, whereas Aristotle claimed it to be composed of induction and deduction, Peirce included abduction too. Thirdly, I explore and compare their theories of cognition. Peirce did not feel indebted to Aristotle and, on the contrary, criticized the positions of the Greek philosopher. However, I will argue that their theories of cognition agree in their general features, namely, empiricism, realism, and synechism. Peirce's critiques of Aristotle are in part due to a misinterpretation of Aristotle's philosophy that took Aristotle to be, in modern terms, a dualist and a rationalist. In sum, I aim to show through these three features, the ways in which Peirce's philosophy is ‒and is not‒ aligned with that of Aristotle.

Styles APA, Harvard, Vancouver, ISO, etc.

17

Silvestrini, Luiz Henrique da Cruz [UNESP]. "Tableaux e indução na lógica do plausível." Universidade Estadual Paulista (UNESP), 2005. http://hdl.handle.net/11449/91404.

Texte intégral

Résumé :

Made available in DSpace on 2014-06-11T19:25:19Z (GMT). No. of bitstreams: 0 Previous issue date: 2005-09-27Bitstream added on 2014-06-13T18:26:17Z : No. of bitstreams: 1 silvestrini_lhc_me_mar.pdf: 390849 bytes, checksum: 3e56bcae7fb7fbdc04cda1eb30e5f1ea (MD5) Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) Em 1999, Grácio introduziu a Lógica do Plausível como uma particularização de uma família de sistemas lógicos, caracterizados pela inclusão de um quantificador generalizado na sintaxe da lógica clássica de predicados, a saber, as Lógicas Moduladas, cuja formalização semântica é dada por um subconjunto do conjunto das partes do universo. Nesta particularização de lógica modulada, é incluído o quantificador do Plausível P, que engendra a formalização de um raciocínio indutivo de maneira que uma 'boa parte' dos indivíduos possui determinada propriedade. O presente trabalho introduz um novo sistema dedutivo para a Lógica do Plausível, denominado TLP, construído seguindo os princípios de tableaux semânticos clássicos. Na elaboração do sistema de tableaux TLP, há uma forma original de localizar pontos nos ramos de um dado tableau. Ademais, por meio do raciocínio indutivo engendrado por esta lógica, discussões sucederam acerca da indução ser considerada um processo genuinamente lógico, tendo por ponto de partida o problema epistemológico da indução. The Logic of the Plausible was introduced in 1999 by Grácio as a particularization of a family of logical systems characterized by the inclusion of a generalized quantifier in the syntax of the classical logic of predicates, denominated the Modulated Logics, whose semantical interpretation is given by a subset of the power set of the universe. In this particularization of modulated logics, it is included the quantifier of Plausible P that engenders the formalization of a type of inductive reasoning so that a 'good' number of individuals possesses certain property . This work introduces a new deductive system for the Logic of the Plausible, denominated TLP, built according to the principles of the classical semantical tableaux. In the construction of the tableaux system TLP, an original form of locating points in the branches of any tableaux is presented. Besides, through the inductive reasoning engendered by this logic, the work also promotes discussions concerning the consideration of the induction as a genuinely logical process, beginning from the epistemological problem of the induction.

Styles APA, Harvard, Vancouver, ISO, etc.

18

Zhao, Jibo. "An Efficient Wide-Speed Direct Torque Control Based on Fuzzy Logic Technique." University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1352922315.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

19

Yonge, Katherine Chandler. "Criminal profile accuracy following training in inductive and deductive approaches." Master's thesis, Mississippi State : Mississippi State University, 2008. http://library.msstate.edu/etd/show.asp?etd=etd-03312008-194642.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

JÃnior, AntÃnio Barbosa de Souza. "Hybrid position controller for an field-oriented induction motor drive." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=13468.

Texte intégral

Résumé :

CoordenaÃÃo de AperfeÃoamento de Pessoal de NÃvel Superior This work describes the study and implementation of a hybrid control technique applied to the positioning of the rotor shaft in a three-phase induction motor (IM). The machine has been modeled using the field oriented control (FOC) strategy. In additional, it is used three controllers to obtain the design of the position loop, each one with different operating characteristics. Initially, two constant gain controllers are associated with the position loop diagram in the FOC technique in order to obtain a fastest response, with disturbance rejection and without overshoot. Therefore, it used a Proportional (P) controller based on Ziegler-Nichols tuning method so that a faster system response is achieved and a predictive control strategy called Generalized Predictive Control (GPC), based on Proportional â Integral controller tuning form, to smooth the overshoot caused by the P controller. Subsequently, seeking a more efficient performance of the position control in the IM, It used a control strategy based on fuzzy logic that takes into account the weighting of P and GPC controllers together. For purposes of validation, simulations and experimental results of the P, GPC and hybrid control strategies are presented. The simulation was set up in Matlab/Simulink and the experimental plant was implemented with a Digital Signal Controller (DSC), manufactured by Texas Instruments TMS320F2812. Analyzing the results, the Proportional demonstrated the fastest reference tracking, among the others techniques, with a settling time of 0.25 seconds, however with overshoot. The GPC controller presented a longer accommodation time, about 2 seconds and without overshoot. The application of the hybrid proposed technique combine the fast tracking reference of the P controller, about 1 second to reach the reference, and without overshoot as in the GPC controller results. Besides, the robust characteristic of both controllers was maintained in the hybridization proposed technique. Este trabalho descreve o estudo e implementaÃÃo de uma tÃcnica de controle hÃbrida aplicada ao posicionamento do eixo de um motor de induÃÃo trifÃsico (MIT). O motor de induÃÃo foi modelado usando-se a estratÃgia de controle de campo orientado a fim de projetar para a malha de posiÃÃo trÃs controladores, cada um com diferentes caracterÃsticas de operaÃÃo. Neste caso, incorporou-se inicialmente Ã malha de posiÃÃo da estratÃgia de controle de campo orientado a aÃÃo de dois controladores de ganho constante com o objetivo de posicionar o eixo de forma rÃpida, com pouco sobressinal e com rejeiÃÃo Ã perturbaÃÃo. Desta forma, utilizou-se um controlador Proporcional (P) com sintonia baseada em Ziegler-Nichols de modo a se obter uma caracterÃstica mais rÃpida do sistema e, uma estratÃgia de controle preditivo denominada de GPC (Generalized Predictive Control) com o objetivo de suavizar a aÃÃo do controlador P em termos de elevado sobressinal considerando a sintonia do controlador GPC baseada em um controlador Proporcional-Integral (PI). Posteriormente, para se obter um desempenho mais eficiente do controle de posiÃÃo do MIT, utilizou-se uma estratÃgia de controle baseada em lÃgica fuzzy de modo a se levar em conta a ponderaÃÃo dos controladores P e GPC, conjuntamente. Para fins de validaÃÃo sÃo apresentados resultados da aplicaÃÃo das estratÃgias de controle P, GPC e hÃbrida no controle de posiÃÃo do MIT a partir de simulaÃÃes em ambiente Matlab/Simulink e atravÃs da implementaÃÃo do sistema de controle de posiÃÃo utilizando-se um processador digital de sinais, o DSP TMS320F2812 fabricado pela Texas Instruments. A partir dos resultados encontrados, o Proporcional demonstrou um rÃpido seguimento de referÃncia, dentre as tÃcnicas utilizadas, com tempo de acomodaÃÃo experimental de 0,25 segundos, porÃm com sobressinal. O controlador GPC apresentou um tempo de acomodaÃÃo maior, cerca de 2 segundos e sem sobressinal. A aplicaÃÃo da tÃcnica hÃbrida proposta conseguiu combinar o rÃpido seguimento de referÃncia do Proporcional, levando cerca de 1 segundo para alcanÃar a referÃncia, e sem sobressinal como o controlador GPC. AlÃm do que, como os controladores possuem uma caracterÃstica robusta tambÃm se garantiu essa propriedade para o hibridismo proposto.

Styles APA, Harvard, Vancouver, ISO, etc.

21

Pereira, Ricardo Gentil de Ara?jo. "Interpreta??o e an?lise do problema da indu??o sob uma vis?o fundamentada em teorias de conjuntos e teoria de probabilidades." Universidade Federal do Rio Grande do Norte, 2012. http://repositorio.ufrn.br:8080/jspui/handle/123456789/16503.

Texte intégral

Résumé :

Made available in DSpace on 2014-12-17T15:12:16Z (GMT). No. of bitstreams: 1 RicardoGAP_DISSERT.pdf: 757603 bytes, checksum: bfeae294ee68b7c0f314886fbbd624fb (MD5) Previous issue date: 2012-10-02 Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior The following work is to interpret and analyze the problem of induction under a vision founded on set theory and probability theory as a basis for solution of its negative philosophical implications related to the systems of inductive logic in general. Due to the importance of the problem and the relatively recent developments in these fields of knowledge (early 20th century), as well as the visible relations between them and the process of inductive inference, it has been opened a field of relatively unexplored and promising possibilities. The key point of the study consists in modeling the information acquisition process using concepts of set theory, followed by a treatment using probability theory. Throughout the study it was identified as a major obstacle to the probabilistic justification, both: the problem of defining the concept of probability and that of rationality, as well as the subtle connection between the two. This finding called for a greater care in choosing the criterion of rationality to be considered in order to facilitate the treatment of the problem through such specific situations, but without losing their original characteristics so that the conclusions can be extended to classic cases such as the question about the continuity of the sunrise O seguinte trabalho consiste na interpreta??o e an?lise do problema da indu??o sob uma vis?o fundamentada em teoria de conjuntos e teoria de probabilidades como base para a solu??o de suas implica??es filos?ficas negativas relativas aos sistemas de l?gica indutiva de maneira geral. Devido ? import?ncia do problema e aos desenvolvimentos recentes nos referidos campos de conhecimento (in?cio do s?culo 20), bem como ?s rela??es vis?veis entre eles e o processo de infer?ncia indutivo, tem-se aberto um campo de possibilidades relativamente inexplorado e promissor. O ponto-chave para o estudo consiste na modelagem do processo de aquisi??o de informa??o usando conceitos de teoria de conjuntos, seguido por um tratamento usando teoria de probabilidades. Ao longo do estudo foi poss?vel identificar, como obst?culos principais ? justifica??o probabil?stica, tanto o problema da defini??o do conceito de probabilidade quanto do de racionalidade, al?m da sutil conex?o entre ambos. Essa constata??o permitiu um maior cuidado na escolha do crit?rio de racionalidade a ser considerado no intuito de viabilizar o tratamento do problema por meio de situa??es-exemplo espec?ficas, mas sem a perda de suas caracter?sticas originais, de modo que as conclus?es obtidas possam ser estendidas a casos cl?ssicos como o relativo ? d?vida sobre a continuidade do nascer do sol

Styles APA, Harvard, Vancouver, ISO, etc.

22

Karanayil, Baburaj Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Parameter identification for vector contolled induction motor drives using artificial neural networks and fuzzy principles." Awarded by:University of New South Wales. Electrical Engineering and Telecommunications, 2005. http://handle.unsw.edu.au/1959.4/21999.

Texte intégral

Résumé :

This thesis analyses, develops and implements a very fast on-line parameter identification algorithm for both rotor and stator resistances of a rotor flux oriented induction motor drive, with the best possible convergence results using artificial neural networks and fuzzy logic systems. The thesis focuses mainly on identifying the rotor resistance, which is the most critical parameter for RFOC. Limitations of PI and fuzzy logic based estimators were identified. Artificial neural network based estimators were found to track the rotor and stator resistances of the drive accurately and fast. The rotor flux of the induction motor estimated with a classical voltage model was the key input of the rotor resistance estimator. Because, pure digital integrators were unable to play this role, an alternative rotor flux synthesizer using a programmable cascaded filter was developed. This rotor flux synthesizer has been used for all of the resistance estimators. It was found that the error in rotor resistance estimation using an ANN was contributed to by error in the stator resistance (caused by motor heating). Several stator resistance estimators using the stator current measurements were developed. The limitations of a PI and a fuzzy estimator for stator resistance estimation were also established. A new stator resistance identifier using an ANN was found to be much superior to the PI and fuzzy estimators, both in terms of dynamic estimation times and convergence problems. The rotor resistance estimator developed for this thesis used a feedforward neural network and the stator resistance estimator used a recurrent neural network. Both networks exhibited excellent learning capabilities; the stator resistance estimator network was very fast as it had a feedback input. A speed estimator was also developed with the state estimation principles, with the updated motor parameters supplied by the ANN estimators. Analysis for speed sensorless operation has shown that the stator and rotor resistances could be updated on-line.

Styles APA, Harvard, Vancouver, ISO, etc.

23

Bradley, William J. "Current Based Fault Detection and Diagnosis of Induction Motors. Adaptive Mixed-Residual Approach for Fault Detection and Diagnosis of Rotor, Stator, Bearing and Air-Gap Faults in Induction Motors Using a Fuzzy Logic Classifier with Voltage and Current Measurement only." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/7265.

Texte intégral

Résumé :

Induction motors (IM) find widespread use in modern industry and for this reason they have been subject to a significant amount of research interest in recent times. One particular aspect of this research is the fault detection and diagnosis (FDD) of induction motors for use in a condition based maintenance (CBM) strategy; by effectively tracking the condition of the motor, maintenance action need only be carried out when necessary. This type of maintenance strategy minimises maintenance costs and unplanned downtime. The benefits of an effective FDD for IM is clear and there have been numerous studies in this area but few which consider the problem in a practical sense with the aim of developing a single system that can be used to monitor motor condition under a range of different conditions, with different motor specifications and loads. This thesis aims to address some of these problems by developing a general FDD system for induction motor. The solution of this problem involved the development and testing of a new approach; the adaptive mixed-residual approach (AMRA). The main aim of the AMRA system is to avoid the vast majority of unplanned failures of the machine and therefore as opposed to tackling a single induction motor fault, the system is developed to detect all four of the most statistically prevalent induction motor fault types; rotor fault, stator fault, air-gap fault and bearing fault. The mixed-residual fault detection algorithm is used to detect these fault types which includes a combination of spectral and model-based techniques coupled with particle swarm optimisation (PSO) for automatic identification of motor parameters. The AMRA residuals are analysed by a fuzzy-logic classifier and the system requires only current and voltage inputs to operate. Validation results indicate that the system performs well under a range of load torques and different coupling methods proving it to have significant potential for use in industrial applications. The full-text was made available at the end of the embargo period on 29th Sept 2017.

Styles APA, Harvard, Vancouver, ISO, etc.

24

Bradley, William John. "Current based fault detection and diagnosis of induction motors : adaptive mixed-residual approach for fault detection and diagnosis of rotor, stator, bearing and air-gap faults in induction motors using a fuzzy logic classifier with voltage and current measurement only." Thesis, University of Bradford, 2013. http://hdl.handle.net/10454/7265.

Texte intégral

Résumé :

Induction motors (IM) find widespread use in modern industry and for this reason they have been subject to a significant amount of research interest in recent times. One particular aspect of this research is the fault detection and diagnosis (FDD) of induction motors for use in a condition based maintenance (CBM) strategy; by effectively tracking the condition of the motor, maintenance action need only be carried out when necessary. This type of maintenance strategy minimises maintenance costs and unplanned downtime. The benefits of an effective FDD for IM is clear and there have been numerous studies in this area but few which consider the problem in a practical sense with the aim of developing a single system that can be used to monitor motor condition under a range of different conditions, with different motor specifications and loads. This thesis aims to address some of these problems by developing a general FDD system for induction motor. The solution of this problem involved the development and testing of a new approach; the adaptive mixed-residual approach (AMRA). The main aim of the AMRA system is to avoid the vast majority of unplanned failures of the machine and therefore as opposed to tackling a single induction motor fault, the system is developed to detect all four of the most statistically prevalent induction motor fault types; rotor fault, stator fault, air-gap fault and bearing fault. The mixed-residual fault detection algorithm is used to detect these fault types which includes a combination of spectral and model-based techniques coupled with particle swarm optimisation (PSO) for automatic identification of motor parameters. The AMRA residuals are analysed by a fuzzy-logic classifier and the system requires only current and voltage inputs to operate. Validation results indicate that the system performs well under a range of load torques and different coupling methods proving it to have significant potential for use in industrial applications.

Styles APA, Harvard, Vancouver, ISO, etc.

25

Fisher, Anna Valeryevna. "Inductive generalization underlying mechanisms and developmental course /." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1117039741.

Texte intégral

Résumé :

Thesis (Ph.D.)--Ohio State University, 2005. Title from first page of PDF file. Document formatted into pages; contains xii, 110 p.; also includes graphics. Includes bibliographical references (p. 103-110). Available online via OhioLINK's ETD Center

Styles APA, Harvard, Vancouver, ISO, etc.

26

Ventura, Pedro Paulo Ramos. "A racionalidade indutiva: em que consiste?" Universidade do Vale do Rio dos Sinos, 2015. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4959.

Texte intégral

Résumé :

Submitted by Silvana Teresinha Dornelles Studzinski (sstudzinski) on 2015-11-24T11:08:18Z No. of bitstreams: 1 Pedro Paulo Ramos Ventura_.pdf: 550481 bytes, checksum: 6aef3b27d08345e9e4d1968a0d4eee14 (MD5) Made available in DSpace on 2015-11-24T11:08:18Z (GMT). No. of bitstreams: 1 Pedro Paulo Ramos Ventura_.pdf: 550481 bytes, checksum: 6aef3b27d08345e9e4d1968a0d4eee14 (MD5) Previous issue date: 2015-09-29 CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior O objeto geral dessa dissertação consiste em investigar a natureza dos raciocínios indutivos partindo da análise que David Hume faz das inferências indutivas, que dependem, para ele, da capacidade humana de estabelecer inferências a partir de princípios da natureza humana. Os raciocínios relativos às noções de causa e efeito são fundados nas experiências (e na nossa capacidade natural de perceber semelhanças, contiguidade, e de nos habituarmos àquilo que nos aparece em conjunção constante). Em contrapartida, Stuart Mill desenvolve em seu livro A System of Logic (1960) - ((1900)), os cinco métodos de indução que viriam a ser conhecidos como Os Métodos de Mill. Portanto, o papel da capacidade racional indutiva será o motor desta dissertação. O presente trabalho tem como finalidade examinar a proposta de Stuart mil sobre racionalidade indutiva, bem como responder se a indução é uma inferência racional, determinar que tipo de racionalidade está por trás da indução e explicar as várias inferências indutivas que Mill apresenta, com seus exemplos. O principal intuito é fazer um contraponto entre a distinção que Hume estabelece entre ideias, instintos, hábitos, semelhança, contiguidade, causalidade e inferência, e os métodos indutivos de Mill. The general objectof this dissertation is to investigate the nature of inductive reasoning based on the analysis of David Hume about inductive inferences, which depend, for him, on the human ability to establish inferences from principles of human nature. The reasoning concerning the cause and effect notions are founded on experience (and on our natural ability to perceive similarities, contiguity, and being familiarized to what appears to us as a constant conjunction). On the other hand, Stuart Mill develops in his book A System of Logic (1960) - ((1900)), the five methods of induction that would become known as Mill’s Methods. The role of inductive reasoning capacity will be the guideline of this dissertation. This paper aims to examine Stuart Mill’s proposal of inductive rationality, as well asunderstand if the induction is a rational inference, determine what kind of rationality is behind the induction and explain the various inductive inferences that Mill presents, through his examples. The main purpose is to perform a contrast between the distinction that Hume established between ideas, instincts, habits, similarity, contiguity, causality and inference and Mill’s inductive methods.

Styles APA, Harvard, Vancouver, ISO, etc.

27

Baker, Carolyn Denise. "The use of Ned Flanders' interaction analysis to shape an inductive teaching model for a Native American classroom." Theological Research Exchange Network (TREN), 1995. http://www.tren.com.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

28

Menna, Sergio Hugo. "Máquinas, gênios e homens na construção do conhecimento = uma interpretação heurística do método indutivo de Francis Bacon." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280455.

Texte intégral

Résumé :

Orientador: José Carlos Pinto de Oliveira Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas Made available in DSpace on 2018-08-18T06:04:22Z (GMT). No. of bitstreams: 1 Menna_SergioHugo_D.pdf: 2716382 bytes, checksum: 6142783b3c83d2ad782502cfe287dbb6 (MD5) Previous issue date: 2011 Resumo: A historiografia contemporânea da metodologia herdou vários 'enigmas' a serem resolvidos sobre as ideias e contribuições de Francis Bacon. Qual é a estrutura do seu método de indução, qual é a natureza de sua 'lógica da descoberta', qual o valor que ele concedeu às hipóteses e conjeturas na investigação científica, qual o papel de Bacon na história da metodologia, qual sua dívida com seus predecessores, qual a influência que exerceu sobre os pensadores que o sucederam etc. Na presente Tese farei uso de estudos históricos e críticos contemporâneos a fim de analisar a obra metodológica de Bacon e determinar a influência das 'artes' heurísticas antigas e medievais no seu método indutivo. Em particular, tentarei mostrar que ainda que Bacon tenha ampliado o 'poder criativo' das 'artes' da invenção, e tenha estendido seu raio de aplicação ao domínio científico, não as formalizou nem substituiu o caráter falível das mesmas. Também, e destacando o importante papel criativo concedido por Bacon e outros autores da Modernidade a 'virtudes' ou 'desiderata' como, por exemplo, a analogia ou a simplicidade, argumentarei contra as principais interpretações rivais existentes sobre a estrutura e dinâmica do método baconiano. Especificamente, me situarei em oposição à interpretação 'geracionista mecânica' -que afirma que o método de Bacon funciona como uma máquina que produz teorias de forma automática- e à interpretação 'hipotetista' -que entende que o método de Bacon funciona só no processo de avaliação de teorias, deixando a tarefa de descoberta ao gênio criativo. Tentarei defender que Bacon esteve particularmente interessado em fornecer heurísticas -isto é, guias ou máximas criativas e avaliativas- para que os homens, trabalhando metodologicamente, e reunidos em comunidades de pesquisa, pudessem construir hipóteses científicas de qualidade. Esta argumentação supõe fazer observações sobre a natureza das regras no século XVII, sobre as relações entre experiência e teoria, e introduzir precisões dentro do domínio das inferências ampliativas, além de esclarecer a posição de Bacon com relação a termos chaves como 'verdade', 'hipótese' e 'conhecimento'. Por último, com esta concepção heurística da indução baconiana, examinarei as interpretações clássicas sobre o papel desempenhado por Bacon na Revolução científica e sua importância na difusão da ideia de progresso. Esta interpretação da herança e da metodologia de Bacon, e de sua recepção e influência em autores posteriores, tal como defenderei, permite compreender e avaliar melhor o significado desse autor para o pensamento científico da Modernidade, e possibilita reavaliar de maneira mais adequada as categorias estabelecidas para a metodologia da descoberta de Bacon por alguns de seus críticos passados e contemporâneos Abstract: The contemporary historiography of methodology inherited various 'puzzles' to be solved about the ideas and contributions of Francis Bacon, such as: What is the structure of his method of induction?; what is the nature of his 'logic of discovery'?; what value did he attach to hypotheses and conjectures in scientific research?; what is the role of Bacon in the history of methodology?; what are his debts to his predecessors?; what is the influence he had upon the thinkers that followed him? and so on. In this thesis I will make use of contemporary historical and critical studies in order to analyze the methodological work of Bacon and the influence of the ancient and medieval heuristic 'arts' on his inductive method. In particular, I will try to show that although Bacon extended the 'creative power' of the 'arts' of invention, and extended their scope of application to the scientific field, he did not formalize nor replace the fallible nature of them. Also, by highlighting the importance of the creative role given by Bacon and other authors of Modernity to 'virtues' or 'desiderata' as, for example, analogy or simplicity, I will argue against major rival interpretations that exist on the structure and dynamics of the Baconian method. Specifically, I will situate my position in opposition to the 'mechanical-generative' interpretation -which claims that Bacon's method works like a machine that produces theories automatically-, and the 'hypothetist' interpretation -which holds that Bacon's method works only in the process of evaluating theories, leaving the task of discovering to the creative genius. I will try to argue that Bacon was particularly interested in providing heuristics -in other words, creative and evaluative guides or principles- so that men, working methodically, could build high-quality scientific hypotheses. This argumentation presupposes the need to make remarks on the nature of rules in the seventeenth century, on the relationship between experience and theory, and also presupposes the provision of more details within the domain of the ampliative inferences, besides clarifying the position in the light of key terms used by Bacon, such as 'truth', 'hypothesis' and 'knowledge'. Finally, on the basis of this heuristic conception of Baconian induction, I will examine the classic interpretations of the role played by Bacon in the Scientific Revolution and his importance in spreading the idea of progress. This interpretation of Bacon's heritage and methodology, and Bacon, and their reception by, and influence on later writers, I will set out to argue, allows us to understand and evaluate in the best way the significance of this author for the scientific thought of Modernity, and enables us, in the most appropriate way, to reassess the categories established for Bacon's methodology of discovery by some of his critics, both past and contemporary Doutorado Epistemologia Doutor em Filosofia

Styles APA, Harvard, Vancouver, ISO, etc.

29

Motta, Carlos Jacinto Nascimento. "Francis Bacon e a nova indução: reforma do entendimento e restauração do homem." Pontifícia Universidade Católica de São Paulo, 2015. https://tede2.pucsp.br/handle/handle/11694.

Texte intégral

Résumé :

Made available in DSpace on 2016-04-27T17:27:12Z (GMT). No. of bitstreams: 1 Carlos Jacinto Nascimento Motta.pdf: 1413752 bytes, checksum: 466d45d754b40761f382c04cc0cb65a4 (MD5) Previous issue date: 2015-10-23 The PhD. thesis here offered has as its aim the presentation of the Baconian conception of induction, understood as an essential element for the realization of Francis Bacon s project of a Restauration of by means of a reform of learning and sciences. In his most important and influente work, the Instauratio Magna, Bacon highlights the need for a wide survey of both the knowledge and sciences already established in order to know which of these should be abandoned, which perfected and which still are in need of implementation. Once this is achieved, and with due governamental support, a new scientifical era was supposed to begin and many advancements would also be achieved by Humankind. Notwithstanding, as Bacon points out, the reformation of sciences demands a change in the proceedings used by the investigator, which, in turn, results in a reformulation of both the idea of experience and the pattern of inference. It also indicates that the new scientifical era demands the establishment of investigative communities instead of isolated researchers, so that common mistakes to human nature should be avoided. This change, however, could only be realized in a mind duly cleansed of prejudices caused by both the philosophical tradition and by the natural characteristics of Humankind. The first were supposed to be corrected by means of the purging of idols, i.e. false notions which inhabit our mind and are imposed by culture; the latter, being these the greatest impediments on account of having to do with human nature itself, would be corrected by means of three different modalities of help, which combined form the novum organum (the new induction) or the new pattern of Bacon s scientific inference. This new induction must be understood in the contexto of the need for reformulations which promote the necessary aid to the investigator, being the histories the aids to the senses, the tables of presentation of instances the aids to memory and the new induction (Novum Organum) the aid to reason. Thus, we understand that the best interpretative key as regards the Baconian epistemology is the proposal of a reform of human understanding, and not merely the reformation of the logic used in investigations. Such reform would possibilitate the emergence of a new man, gifted with new logical tools and which would cooperate with other researchers towards the aim of assembling a type of inferential device, a collective investigative machine A tese de doutorado aqui apresentada tem por objetivo apresentar a concepção baconiana de indução entendida como elemento essencial para a efetivação do projeto de Francis Bacon de uma Restauração da humanidade por meio da reforma do conhecimento e das ciências. Em sua mais significativa e influente obra, a Instauratio Magna, Bacon estabelece a necessidade de uma ampla avaliação dos saberes e ciências já constituídos a fim de saber quais devem ser abandonados, quais aprimorados e quais ainda necessitam implantação. De posse desse inventário, e com o devido apoio governamental, uma nova era científica teria início e muitos avanços seriam alcançados pela humanidade. Contudo, observa Bacon, a reforma das ciências exige uma alteração dos procedimentos adotados pelo investigador, o que leva a uma reformulação da ideia de experiência e do padrão de inferência utilizados. Também indica que a nova era científica exige que sejam constituídas comunidades investigativas, em lugar dos pesquisadores, a fim de se evitarem os erros comuns à natureza humana. Mas, isso somente poderia ser efetivado em uma mente devidamente purificada dos prejuízos causados pela tradição filosófica e pelas características naturais do homem. Os primeiros seriam corrigidos por meio da eliminação dos Ídolos, as falsas noções que habitam nossa mente impostas pela cultura. As segundas, os maiores impedimentos por se tratarem da própria natureza humana, seriam corrigidos por meio de três diferentes modalidades de ajuda, que juntas formam o novum organum (ou nova indução), o novo padrão de inferência científica de Bacon. Esta nova indução deve ser entendida no contexto da necessidade de reformas que promovam os auxílios necessários ao investigador, sendo as histórias os auxílios aos sentidos, as tábuas de organização das instâncias os auxílios à memória e a nova indução (ou novum organum) o auxílio à razão. Assim, nosso entendimento é que a melhor chave interpretativa para a epistemologia baconiana é a proposta de uma reforma do entendimento humano, não meramente a reforma da lógica utilizada nas investigações, da qual emergiriam um outro homem, dotado de novas ferramentas lógicas, trabalhando em cooperação, formando uma espécie de dispositivo inferencial, ou uma máquina investigativa coletiva

Styles APA, Harvard, Vancouver, ISO, etc.

30

Azcue, Puma José Luis 1981. "Estratégias de controle direto de torque para motores de indução trifásicos usando controladores fuzzy tipo Takagi-Sugeno e controladores por modos deslizantes." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260745.

Texte intégral

Résumé :

Orientador: Ernesto Ruppert Filho, Alfeu Joãozinho Sguarezi Filho Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação Made available in DSpace on 2018-08-22T11:09:49Z (GMT). No. of bitstreams: 1 AzcuePuma_JoseLuis_D.pdf: 5829554 bytes, checksum: 6f4467c529a778cc79e42550a272a6b3 (MD5) Previous issue date: 2013 Resumo: Na presente tese de doutorado propõe estratégias de controle por orientação direta de campo (FOC direto) e de controle direto de torque (CDT) com emprego de controladores fuzzy do tipo Takagi-Sugeno (fuzzy T-S). Propõe-se também, uma estratégia de CDT baseado no controle do ¿angulo de carga com o emprego do controle por modos deslizantes (CDT-CMD). As estratégias de controle vetorial propostas são utilizadas para o controle de alto desempenho do motor de indução trifásico. O controlador fuzzy T-S proposto utiliza uma única base de regras para gerar as componentes de eixo direto e de quadratura do vetor espacial da tensão do estator. Isto simplifica a estrutura do controlador fuzzy T-S e em consequência diminui o custo computacional e seu tempo de processamento. Na estratégia de CDT com o controle por modos deslizantes o esforço de controle é sempre o máximo possível no sentido de reduzir os erros do torque e do fluxo. Assim, é possível obter uma resposta rápida no controle do fluxo e do torque. Os resultados de simulação e experimentais são apresentados para validarem as propostas desta tese de doutorado. Os controladores apresentaram um desempenho dinâmico satisfatório pois as referências de torque e de fluxo foram atendidas. Todos os resultados obtidos mostraram-se compatíveis com os resultados apresentados na literatura, validando as estratégias de CDT e de FOC direto propostas Abstract: This thesis proposes a direct field oriented control (D-FOC) and direct torque control (DTC) strategies with Takagi-Sugeno fuzzy controllers (T-S fuzzy). Also it proposes a DTC strategy based on load angle control with the use of sliding mode control (DTC-SMC). The proposed vector control strategies are used for high performance control of three-phase induction motor. The proposed T-S fuzzy controller uses a single rule base to generate the direct-axis and quadrature-axis components of the stator voltage space vector. This simplifies the structure of the T-S fuzzy controller and consequently it reduces the computational cost and its processing time. However, in the sliding mode control the control effort is always the maximum possible in order to reduce the errors of the torque and the flux. Hence, it is possible to get a fast response in the control of the torque and the flux. The proposed controllers showed a good dynamic performance because the references were achieved. The experimental and simulation results of the vector control strategies were presented to validate the proposed controllers. All the obtained results were consistent with the results reported in the literature, validating the proposed DTC and D-FOC strategies Doutorado Energia Eletrica Doutor em Engenharia Elétrica

Styles APA, Harvard, Vancouver, ISO, etc.

31

Azcue, Puma José Luis 1981. "Controle direto de torque do motor de indução trifásico usando controlador Fuzzy tipo PI autoajustável." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/258996.

Texte intégral

Résumé :

Orientador: Ernesto Ruppert Filho Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação Made available in DSpace on 2018-08-16T21:19:34Z (GMT). No. of bitstreams: 1 AzcuePuma_JoseLuis_M.pdf: 8979349 bytes, checksum: a4b6502489a503823c332031a587452b (MD5) Previous issue date: 2010 Resumo: Neste trabalho apresenta-se o desempenho de um controlador fuzzy tipo PI autoajustável (FPIA) para o uso no esquema de controle direto de torque com modulação por vetores espaciais apresentado por J. Rodriguez e outros em 2004. Apresenta-se também um estudo comparativo da resposta dinâmica de vários esquemas de controle direto de torque (DTC) para o motor de indução trifásico. O controlador FPIA determina dinâmicamente o ângulo de carga existente entre os vetores espaciais dos fluxos do estator e do rotor e, em consequência, o torque eletromagnético necessário para suprir a carga do motor. A base de regras para o controlador proposto é definida em função do erro "e" e da variação do erro "??" do torque eletromagnético usando funções de pertinência triangulares e trapezoidais. O controle é realizado em frequência de chaveamento constante e apresenta baixa ondulação de torque usando modulação em largura de pulsos por vetores espaciais. O desempenho do DTC com o controlador proposto é comparado com o desempenho do mesmo esquema usando o controlador PI através de várias medidas de desempenho tais como tempo de acomodação, tempo de subida e o índice integral do tempo multiplicado pelo valor absoluto do erro (ITAE). Foram realizadas simulações em diferentes condições de operação que mostram que o controlador proposto assegura uma resposta rápida com baixa ondulação do torque em comparação com o controlador PI, ambos aplicados ao mesmo esquema DTC Abstract: This dissertation presents the performance of a self-tuning PI type fuzzy controller (STPIF) for the direct torque control (DTC) with space vector modulation (SVM) scheme presented by J. Rodriguez et al. in 2004. It is also presented a comparative study of the dynamic response of various DTC schemes for the three-phase induction motor. The STPIF controller determines dynamically the load angle between the stator and rotor flux space vectors and, consequently, the electromagnetic torque necessary to supply the motor load. The rule base for the proposed controller is defined in terms of error "e" and the change of the error "??" of electromagnetic torque using triangular and trapezoidal membership functions. Constant switching frequency and low torque ripple are obtained using SVM. The performance of the DTC-SVM with the proposed controller is compared with the performance of the same scheme but using PI controller in terms of several performance indexes such as settling time, rise time and integral-of-time multiplied by the absolute magnitude of the error index (ITAE). The simulation results show that the proposed controller ensures fast torque response and low torque ripple when compared to the PI controller, both implemented in the same DTC-SVM scheme Mestrado Energia Eletrica Mestre em Engenharia Elétrica

Styles APA, Harvard, Vancouver, ISO, etc.

32

Cruz, Amanda Guerra de Araújo. "Sistema híbrido para diagnóstico de falhas em motores de indução trifásicos com base no método vibracional, corrente de armadura e lógica fuzzy." Universidade Federal da Paraíba, 2015. http://tede.biblioteca.ufpb.br:8080/handle/tede/8962.

Texte intégral

Résumé :

Submitted by Maike Costa (maiksebas@gmail.com) on 2017-05-24T12:51:24Z No. of bitstreams: 1 arquivototal.pdf: 2705219 bytes, checksum: cb06011410866630871a99b2788703f1 (MD5) Made available in DSpace on 2017-05-24T12:51:24Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 2705219 bytes, checksum: cb06011410866630871a99b2788703f1 (MD5) Previous issue date: 2015-10-26 The three-phase induction motors are the most important way for electromechanical conversion, being present in almost every industrial process. Because of their importance, it is crucial that these devices have a proper predictive maintenance, avoiding lost production and operational accidents in the event of unexpected failures. In this scenario several researchers have conducted studies to detect incipient faults. About the sensing method used, the most common techniques are related to measuring the vibration levels using accelerometers and measuring electrical motor signals. The choice of technique involves factors such as invasiveness, drive motor type and the sensitivity to failure. The purpose of this work involves the development of a hybrid system that uses data collected by vibration and current sensors for fault detection in induction motors, earlier and more efficiently. The current and vibration signals were processed in the frequency domain and through the multiresolution analysis, serving as inputs of a fuzzy logic system, allowing to increase the sensitivity and efficiency in fault detection techniques in relation to the individual. The unbalance failure was investigated on a workbench with the motor coupled to a propeller and broken bars with another bench with DC motor to apply the load, the best methods being chosen in each case. The system was developed in Matlab software and was validated with correct detection for both failures, being able to detect the unbalance failure on the shaft or propeller as broken bars in different load conditions. O motor de indução trifásico é o principal meio de conversão eletromecânica existente, estando presente em praticamente todos os processos industriais. Devido à sua importância, é fundamental que estes equipamentos tenham uma correta manutenção preditiva, evitando perda de produção e acidentes operacionais em caso de falhas inesperadas. Diante deste cenário vários pesquisadores têm realizado estudos para detecção de falhas incipientes. Quanto ao método sensor utilizado, as técnicas mais comuns estão relacionadas a medição dos níveis de vibração utilizando acelerômetros e medição de sinais elétricos do motor. A escolha da técnica envolve fatores como a invasividade, tipo de acionamento do motor e a sensibilidade à falha. A proposta deste trabalho envolve o desenvolvimento de um sistema híbrido que utilize dados coletados por sensores de vibração e de corrente para detecção de falhas incipientes em motores de indução trifásicos de maneira mais precoce e eficiente. Os sinais de corrente e de vibração foram processados no domínio da frequência pela transformada de Fourier e através da análise multiresolução, servindo como entrada para sistemas de lógica Fuzzy, permitindo que se aumente a eficiência na detecção da falha em relação às técnicas individuais. Foi investigada a falha de desbalanceamento em uma bancada com o motor acoplado a uma hélice e barras quebradas em outra bancada com motor de corrente contínua acoplado para aplicar a carga, sendo escolhidos os melhores métodos em cada caso. O sistema foi desenvolvido no software Matlab e foi validado através de diagnósticos corretos para ambas as falhas, sendo capaz de detectar a falha de desbalanceamento tanto na hélice quanto no eixo e de barras quebradas em diferentes condições de carga.

Styles APA, Harvard, Vancouver, ISO, etc.

33

Aleman, Anca. "Recherches sur la pensée musicale de Glenn Gould : l’empreinte de l’héritage schoenbergien." Thesis, Paris 4, 2011. http://www.theses.fr/2011PA040123.

Texte intégral

Résumé :

Cette thèse se propose de démontrer que, au-delà de son image d’interprète de la musique de Jean-Sébastien Bach, le pianiste Glenn Gould a développé, à travers ses nombreux écrits, une véritable pensée musicologique, qui surprend par sa cohérence et dont les racines sont à chercher en réalité du côté d’Arnold Schoenberg, le compositeur qui l’aura le plus influencé. Nous nous attachons donc ici à l’observation et à l’analyse de cette pensée à travers les écrits du musicien canadien, l’objectif étant la mise en évidence du rapport existant avec la pensée de Schoenberg. L’analyse comparative menée ici repose sur les principes que Gould avait lui-même placés au fondement de sa pensée : le raisonnement justifiable, l’esprit de re-création, le concept inductif et la musicologie scientifique. Pour ce faire, nous avons adopté un cheminement logique passant successivement par les domaines suivants : méthode, création musicale, interprétation, critique, pédagogie et enregistrement This research tends to demonstrate that, beyond the picture of the performer of Johann Sebastian Bach’s music, Glenn Gould, the pianist, has developed through his numerous writings a real musicological thought which is distinguished by a strong coherence ; its roots are in fact to be found in Arnold Schoenberg’s thought, the composer whose influence was the most important for Gould. We intend here to propose an analytical and critical observation of Glenn Gould’s musicological thought by using the principles upon which he had himself set his thought, which are : justified reasoning, re-creation spirit, inductive concept and scientific musicology. With that aim, we used a logical progression examining successively the following themes : the method, the musical creation, the musical performance, the criticism, the pedagogy and finally the recording

Styles APA, Harvard, Vancouver, ISO, etc.

34

Lima, Fábio. "Estimador neuro-fuzzy de velocidade aplicado ao controle vetorial sem sensores de motores de indução trifásicos." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3143/tde-20092011-150232/.

Texte intégral

Résumé :

Este trabalho apresenta uma alternativa ao controle vetorial de motores de indução, sem a utilização de sensores para realimentação da velocidade mecânica do motor. Ao longo do tempo, diversas técnicas de controle vetorial têm sido propostas na literatura. Dentre elas está a técnica de controle por orientação de campo (FOC), muito utilizada na indústria e presente também neste trabalho. A principal desvantagem do FOC é a sua grande sensibilidade às variações paramétricas da máquina, as quais podem invalidar o modelo e as ações de controle. Nesse sentido, uma estimativa correta dos parâmetros da máquina, torna-se fundamental para o acionamento. Este trabalho propõe o desenvolvimento e implementação de um estimador baseado em um sistema de inferência neuro-fuzzy adaptativo (ANFIS) para o controle de velocidade do motor de indução trifásico em um acionamento sem sensores. Pelo fato do acionamento em malha fechada admitir diversas velocidades de regime estacionário para o motor, uma nova metodologia de treinamento por partição de frequência é proposta. Ainda, faz-se a validação do sistema utilizando a orientação de campo magnético no referencial de campo de entreferro da máquina. Simulações para avaliação do desempenho do estimador mediante o acionamento vetorial do motor foram realizadas utilizando o programa Matlab/Simulink. Para a validação prática do modelo, uma bancada de testes foi implementada; o acionamento do motor foi realizado por um inversor de frequência do tipo fonte de tensão (VSI) e o controle vetorial, incluindo o estimador neuro-fuzzy, foi realizado pelo pacote de tempo real do programa Matlab/Simulink, juntamente com uma placa de aquisição de dados da National Instruments. This work presents an alternative sensorless vector control of induction motors. Several techniques for induction motor control have been proposed in the literature. Among these is the field oriented control (FOC), strongly used in industries and also in this work. The main drawback of the FOC technique is its sensibility to deviations of the parameters of the machine, which can deteriorate the control actions. Therefore, an accurate determination of the machines parameters is mandatory to the drive system. This work proposes the development of an adaptive neuro-fuzzy inference system (ANFIS) estimator to control the angular speed of a three-phase induction motor in a sensorless drive. In a closed loop configuration, several speed commands can be imposed to the motor. Thus, a new frequency partition training of ANFIS is proposed. Moreover, the ANFIS speed estimator is validated in a magnetizing flux oriented control scheme. Simulations to evaluate the performance of the estimator considering the vector drive system were done by the Matlab/Simulink. To determine the benefits of the proposed model a practical system was implemented using a voltage source inverter (VSI) and the vector control including the ANFIS estimator, carried out by the Real Time Toolbox from Matlab/Simulink and a data acquisition card from National Instruments.

Styles APA, Harvard, Vancouver, ISO, etc.

35

Groves, Teddy. "Let's reappraise Carnapian inductive logic!" Thesis, University of Kent, 2015. https://kar.kent.ac.uk/54023/.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

36

Chen, Guiming. "Fuzzy FOIL: A fuzzy logic based inductive logic programming system." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9621.

Texte intégral

Résumé :

In many domains, characterizations of a given attribute are imprecise, uncertain and incomplete in the available learning examples. The definitions of classes may be vague. Learning systems are frequently forced to deal with such uncertainty. Traditional learning systems are designed to work in the domains where imprecision and uncertainty in the data are absent. Those learning systems are limited because of their impossibility to cope with uncertainty--a typical feature of real-world data. In this thesis, we developed a fuzzy learning system which combines inductive learning with a fuzzy approach to solve problems arising in learning tasks in the domains affected by uncertainty and vagueness. Based on Fuzzy Logic, rather than pure First Order Logic used in FOIL, this system extends FOIL with learning fuzzy logic relation from both imprecise examples and background knowledge represented by Fuzzy Prolog. The classification into the positive and negative examples is allowed to be a degree (of positiveness or negativeness) between 0 and 1. The values of a given attribute in examples need not to be the same type. Symbolic and continuous data can exist in the same attribute, allowing for fuzzy unification (inexact matching). An inductive learning problem is formulated as to find a fuzzy logic relation with a degree of truth, in which a fuzzy gain calculation method is used to guide heuristic search. The Fuzzy FOIL's ability of learning the required fuzzy logic relations and dealing with vague data enhances FOIL's usefulness.

Styles APA, Harvard, Vancouver, ISO, etc.

37

Bordon, Mario Eduardo. "Controlador nebuloso de arquitetura simplificada estudo de caso : acionamento de motor de indução trifasico." [s.n.], 2004. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260291.

Texte intégral

Résumé :

Orientador: Oseas Valente de Avilez Filho Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação Made available in DSpace on 2018-08-04T00:32:30Z (GMT). No. of bitstreams: 1 Bordon_MarioEduardo_D.pdf: 1470672 bytes, checksum: e05feebeca9a1ab481716d9a42b1a8f5 (MD5) Previous issue date: 2004 Resumo: O objetivo deste trabalho foi o desenvolvimento de um controlador digital simples e eficiente, utilizando conceitos de lógica nebulosa, aplicado no acionamento de um motor de indução trifásico. Trata-se de um trabalho de engenharia aplicada, que apresenta o projeto de um controlador nebuloso de arquitetura simplificada, que emprega uma estrutura padronizada para representação das funções de pertinência e permite efetuar a ponderação dos termos lingüísticos. Para avaliar o desempenho deste controlador, foi implementado um sistema para acionamento do motor de indução, com freqüência de operação controlada e limitação de corrente, capaz de gerar em tempo real, um perfil de freqüência adequado, sempre que um novo valor para freqüência de operação seja estabelecido. No projeto deste controlador, optou-se pela utilização de um sistema digital de baixo custo, baseado em microcontroladores de 8 bits, mesmo assim, os resultados obtidos superaram as expectativas, comprovando a viabilidade operacional deste controlador nebuloso de arquitetura simplificada, para acionamento do motor de indução, evitando que a corrente ultrapasse o limite estipulado e impedindo o desligamento desnecessário do sistema Abstract: This work presents a new approach of a simple and efficient digital controller, which uses the fuzzy logic concepts to drive a three-phase induction motor in a practical engineering application. In order to represent the membership functions and carry out the weighting up of linguistic terms a custom structure was used in the fuzzy logic controller. The performance evaluation of the digital controller was verified using a new strategy of induction motor drive for speed control and input current restriction. This fuzzy logic controller with simplified architecture applied in a real time speed control assures the current restriction and the normal operation of the induction motor. The control strategy operates in closed loop and has a dynamic gain adjustment that provides the soft start requirements. The closed loop frequency control allows to adjust the desired value of the rotation frequency, while the closed loop current control assures that current doesn't cross the limit stipulated for motor drive. The versatility of this digital controller based on low cost 8 bits microcontrollers can be verified from the results presented. The accuracy and time response could be compared to the other conventional systems using scalar or vector techniques Doutorado Eletrônica, Microeletrônica e Optoeletrônica Doutor em Engenharia Elétrica

Styles APA, Harvard, Vancouver, ISO, etc.

38

Pinheiro, H?lio Henrique Cunha. "Sistema para detec??o e diagn?stico de falhas em motores el?tricos de indu??o utilizando l?gica fuzzy." Universidade Federal do Rio Grande do Norte, 2011. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15388.

Texte intégral

Résumé :

Made available in DSpace on 2014-12-17T14:55:56Z (GMT). No. of bitstreams: 1 HelioHCP_DISSERT.pdf: 2649090 bytes, checksum: 4af294fb0fbf94f5f1ce08428f01d668 (MD5) Previous issue date: 2011-12-22 Induction motors are one of the most important equipment of modern industry. However, in many situations, are subject to inadequate conditions as high temperatures and pressures, load variations and constant vibrations, for example. Such conditions, leaving them more susceptible to failures, either external or internal in nature, unwanted in the industrial process. In this context, predictive maintenance plays an important role, where the detection and diagnosis of faults in a timely manner enables the increase of time of the engine and the possibiity of reducing costs, caused mainly by stopping the production and corrective maintenance the motor itself. In this juncture, this work proposes the design of a system that is able to detect and diagnose faults in induction motors, from the collection of electrical line voltage and current, and also the measurement of engine speed. This information will use as input to a fuzzy inference system based on rules that find and classify a failure from the variation of thess quantities Os motores de indu??o constituem-se em um dos equipamentos mais importantes da ind?stria moderna. Contudo, em muitas situa??es, ficam sujeitos a condi??es inadequadas como temperaturas e press?es elevadas, varia??es de carga e vibra??es constantes, por exemplo. Tais condi??es, os deixam mais suscept?veis a falhas, seja de natureza externa ou interna, indesejadas no processo industrial. Neste contexto, a manuten??o preditiva desempenha um papel relevante, onde a detec??o e o diagn?stico de falhas conseguidos em tempo h?bil possibilita o aumento do tempo de uso do motor e a possibilidade de diminui??o de custos, causados principalmente, com a parada da produ??o e com a manuten??o corretiva do motor. Diante desta conjuntura, este trabalho prop?e a concep??o de um sistema que seja capaz de detectar e de diagnosticar falhas em motores de indu??o a partir da leitura e da interpreta??o de diagramas fasoriais de tens?o e de corrente de linha e da velocidade do motor, executados por um sistema inteligente baseado em l?gica fuzzy

Styles APA, Harvard, Vancouver, ISO, etc.

39

Sazonau, Viachaslau. "General terminology induction in description logics." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/general-terminology-induction-in-description-logics(63142865-d610-4041-84fa-764af1759554).html.

Texte intégral

Résumé :

In computer science, an ontology is a machine-processable representation of knowledge about some domain. Ontologies are encoded in ontology languages, such as the Web Ontology Language (OWL) based on Description Logics (DLs). An ontology is a set of logical statements, called axioms. Some axioms make universal statements, e.g. all fathers are men, while others record data, i.e. facts about specific individuals, e.g. Bob is a father. A set of universal statements is called TBox, as it encodes terminology, i.e. schema-level conceptual relationships, and a set of facts is called ABox, as it encodes instance-level assertions. Ontologies are extensively developed and widely used in domains such as biology and medicine. Manual engineering of a TBox is a difficult task that includes modelling conceptual relationships of the domain and encoding those relationships in the ontology language, e.g. OWL. Hence, it requires the knowledge of domain experts and skills of ontology engineers combined together. In order to assist engineering of TBoxes and potentially automate it, acquisition (or induction) of axioms from data has attracted research attention and is usually called Ontology Learning (OL). This thesis investigates the problem of OL from general principles. We formulate it as General Terminology Induction that aims at acquiring general, expressive TBox axioms (called general terminology) from data. The thesis addresses and investigates in depth two main questions: how to rigorously evaluate the quality of general TBox axioms and how to efficiently construct them. We design an approach for General Terminology Induction and implement it in an algorithm called DL-Miner. We extensively evaluate DL-Miner, compare it with other approaches, and run case studies together with domain experts to gain insight into its potential applications. The thesis should be of interest to ontology developers seeking automated means to facilitate building or enriching ontologies. In addition, as our experiments show, DL-Miner can deliver valuable insights into the data, i.e. can be useful for data analysis and debugging.

Styles APA, Harvard, Vancouver, ISO, etc.

40

Wang, Yu. "Parallel inductive logic in data mining." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0019/MQ54492.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

41

Hill, Carla. "Mass assignments for inductive logic programming." Thesis, University of Bristol, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.325748.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Ronel, Tahel. "Symmetry principles in polyadic inductive logic." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/symmetry-principles-in-polyadic-inductive-logic(6bd9665b-b236-435c-9aad-7edb3cfc399e).html.

Texte intégral

Résumé :

We investigate principles of rationality based on symmetry in Polyadic Pure Inductive Logic. The aim of Pure Inductive Logic (PIL) is to determine how to assign probabilities to sentences of a language being true in some structure on the basis of rational considerations. This thesis centres on principles arising from instances of symmetry for sentences of first-order polyadic languages. We begin with the recently introduced Permutation Invariance Principle (PIP), and find that it is determined by a finite number of permutations on a finite set of formulae. We test the consistency of PIP with established principles of the subject and show, in particular, that it is consistent with Super Regularity. We then investigate the relationship between PIP and the two main polyadic principles thus far, Spectrum Exchangeability and Language Invariance, and discover there are close connections. In addition, we define the key notion of polyadic atoms as the building blocks of polyadic languages. We explore polyadic generalisations of the unary principle of Atom Exchangeability and prove that PIP is a natural extension of Atom Exchangeability to polyadic languages. In the second half of the thesis we investigate polyadic approaches to the unary version of Constant Exchangeability as invariance under signatures. We first provide a theory built on polyadic atoms (for binary and then general languages). We introduce the notion of a signature for non-unary languages, and principles of invariance under signatures, independence, and instantial relevance for this context, as well as a binary representation theorem. We then develop a second approach to these concepts using elements as alternative building blocks for polyadic languages. Finally, we introduce the concepts of homomorphisms and degenerate probability functions in Pure Inductive Logic. We examine which of the established principles of PIL are preserved by these notions, and present a method for reducing probability functions on general polyadic languages to functions on binary languages.

Styles APA, Harvard, Vancouver, ISO, etc.

43

Lin, Dianhuan. "Logic programs as declarative and procedural bias in inductive logic programming." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24553.

Texte intégral

Résumé :

Machine Learning is necessary for the development of Artificial Intelligence, as pointed out by Turing in his 1950 article ``Computing Machinery and Intelligence''. It is in the same article that Turing suggested the use of computational logic and background knowledge for learning. This thesis follows a logic-based machine learning approach called Inductive Logic Programming (ILP), which is advantageous over other machine learning approaches in terms of relational learning and utilising background knowledge. ILP uses logic programs as a uniform representation for hypothesis, background knowledge and examples, but its declarative bias is usually encoded using metalogical statements. This thesis advocates the use of logic programs to represent declarative and procedural bias, which results in a framework of single-language representation. We show in this thesis that using a logic program called the top theory as declarative bias leads to a sound and complete multi-clause learning system MC-TopLog. It overcomes the entailment-incompleteness of Progol, thus outperforms Progol in terms of predictive accuracies on learning grammars and strategies for playing Nim game. MC-TopLog has been applied to two real-world applications funded by Syngenta, which is an agriculture company. A higher-order extension on top theories results in meta-interpreters, which allow the introduction of new predicate symbols. Thus the resulting ILP system Metagol can do predicate invention, which is an intrinsically higher-order logic operation. Metagol also leverages the procedural semantic of Prolog to encode procedural bias, so that it can outperform both its ASP version and ILP systems without an equivalent procedural bias in terms of efficiency and accuracy. This is demonstrated by the experiments on learning Regular, Context-free and Natural grammars. Metagol is also applied to non-grammar learning tasks involving recursion and predicate invention, such as learning a definition of staircases and robot strategy learning. Both MC-TopLog and Metagol are based on a 'top'-directed framework, which is different from other multi-clause learning systems based on Inverse Entailment, such as CF-Induction, XHAIL and IMPARO. Compared to another 'top'-directed multi-clause learning system TAL, Metagol allows the explicit form of higher-order assumption to be encoded in the form of meta-rules.

Styles APA, Harvard, Vancouver, ISO, etc.

44

Athakravi, Duangtida. "Inductive logic programming using bounded hypothesis space." Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/33798.

Texte intégral

Résumé :

Inductive Logic Programming (ILP) systems apply inductive learning to an inductive learning task by deriving a hypothesis which explains the given examples. Applying ILP systems to real applications poses many challenges as they require large search space, noise is present in the learning task, and in domains such as software engineering hypotheses are required to satisfy domain specific syntactic constraints. ILP systems use language biases to define the hypothesis space, and learning can be seen as a search within the defined hypothesis space. Past systems apply search heuristics to traverse across a large hypothesis space. This is unsuitable for systems implemented using Answer Set Programming (ASP), for which scalability is a constraint as the hypothesis space will need to be grounded by the ASP solver prior to solving the learning task, making them unable to solve large learning tasks. This work explores how to learn using bounded hypothesis spaces and iterative refinement. Hypotheses that explain all examples are learnt by refining smaller partial hypotheses. This improves the scalability of ASP based systems as the learning task is split into multiple smaller manageable refinement tasks. The thesis presents how syntactic integrity constraints on the hypothesis space can be used to strengthen hypothesis selection criteria, removing hypotheses with undesirable structure. The notion of constraint-driven bias is introduced, where hypotheses are required to be acceptable with respect to the given meta-level integrity constraints. Building upon the ILP system ASPAL, the system RASPAL which learns through iterative hypothesis refinement is implemented. RASPAL's algorithm is proven, under certain assumptions, to be complete and consistent. Both systems have been applied to a case study in learning user's behaviours from data collected from their mobile usage. This demonstrates their capability for learning with noise, and the difference in their efficiency. Constraint-driven bias has been implemented for both systems, and applied to a task in specification revision, and in learning stratified programs.

Styles APA, Harvard, Vancouver, ISO, etc.

45

Howarth, Elizabeth. "New rationality principles in pure inductive logic." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/new-rationality-principles-in-pure-inductive-logic(e23d028f-c3e9-47b1-a5a0-289027f4d97f).html.

Texte intégral

Résumé :

We propose and investigate several new principles of rational reasoning within the framework of Pure Inductive Logic, PIL, where probability functions defined on the sentences of a first-order language are used to model an agent's beliefs. The Elephant Principle is concerned with how learning, modelled by conditioning, may be uniquely `remembered'. The Perspective Principle requires that, from a given prior, conditioning on statistically similar experiences should result in similar assignments, and is found to be a necessary condition for Reichenbach's Axiom to hold. The Abductive Inference Principle and some variations are proposed as possible formulations of a restriction of C.S. Peirce's notion of hypothesis in the context of PIL, though characterization results obtained for these principles suggest that they may be too strong. The Finite Values Property holds when a probability function takes only finitely many values when restricted to sentences containing only constant symbols from some fixed finite set. This is shown to entail a certain systematic method of assigning probabilities in terms of possible worlds, and it is considered in this light as a possible principle of inductive reasoning. Classification results are given, stating which members of certain established families of probability functions satisfy each of these new principles. Additionally, we define the theory of a principle P of PIL to be the set of those sentences which are assigned probability 1 by every probability function which satisfies P. We investigate the theory of the established principle of Spectrum Exchangeability by finding separately the theories of heterogeneous and homogeneous functions. The theory of Spectrum Exchangeability is found to be equal to the theory of finite structures. The theory of Johnson's Sufficientness Postulate is also found. Consequently, we find that Spectrum Exchangeability, Johnson's Sufficientness Postulate and the Finite Values Property are all inconsistent with the principle of Super-Regularity: that any consistent sentence should be assigned non-zero probability.

Styles APA, Harvard, Vancouver, ISO, etc.

46

Corapi, Domenico. "Nonmonotonic inductive logic programming as abductive search." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9814.

Texte intégral

Résumé :

Inductive Logic Programming (ILP) is a machine learning technique that relies on logic programs as a representation language. Most of the effort in the field of ILP has concentrated on a restricted class of problems, providing solutions that do not fully support negation. On the other hand, integration of negation and nonmonotonic reasoning in logic programming is common and important for a number of problems. This thesis presents an approach to nonmonotonic ILP that is based on a transformation of the original problem to a problem that can be solved by employing abductive reasoning. In particular we present a general framework for the transformation that can be used as reference for concrete implementations. We instantiate the transformation to derive two alternative implementations that are rooted in the two dominant computational logic paradigms: Prolog and Answer Set Programming (ASP). In the first case, we derive an implementation, called TAL, that is based on the abductive proof procedure SLDNFA and uses a customisable best-first search on the space of abductive solutions. In the second case the transformation is further refined in order to exploit the computational properties of available ASP solvers. In the proposed system called ASPAL, a theory is constructed from a set of mode declarations and used to extend the search of the underlying solver, so enabling the derivation of inductive hypotheses. We provide completeness and soundness results for the framework and the ILP systems presented and show how, as a consequence of this, it is possible to induce complex multi-predicate hypotheses involving negation, recursion and the definition of elements of the domain that are not directly observed. We validate the framework on established ILP benchmark problems, on some nonmonotonic ILP problems proposed in the literature. Furthermore we demonstrate the approach on a novel application of nonmonotonic ILP to the revision of normative frameworks.

Styles APA, Harvard, Vancouver, ISO, etc.

47

Lukac, Martin. "Quantum Inductive Learning and Quantum Logic Synthesis." PDXScholar, 2009. https://pdxscholar.library.pdx.edu/open_access_etds/2319.

Texte intégral

Résumé :

Since Quantum Computer is almost realizable on large scale and Quantum Technology is one of the main solutions to the Moore Limit, Quantum Logic Synthesis (QLS) has become a required theory and tool for designing Quantum Logic Circuits. However, despite its growth, there is no any unified aproach to QLS as Quantum Computing is still being discovered and novel applications are being identified. The intent of this study is to experimentally explore principles of Quantum Logic Synthesis and its applications to Inductive Machine Learning. Based on algorithmic approach, I first design a Genetic Algorithm for Quantum Logic Synthesis that is used to prove and verify the methods proposed in this work. Based on results obtained from the evolutionary experimentation, I propose a fast, structure and cost based exhaustive search that is used for the design of a novel, least expensive universal family of quantum gates. The results form both the evolutionary and heuristic search are used to formulate an Inductive Learning Approach based on Quantum Logic Synthesis with the intended application being the humanoid behavioral robotics. The presented approach illustrates a successful algorithmic approach, where the search algorithm was able to invent/discover novel quantum circuits as well as novel principles in Quantum Logic Synthesis.

Styles APA, Harvard, Vancouver, ISO, etc.

48

Lamim, Filho Paulo Cezar Monteiro. "Monitoramento permanente de motores de indução trifasicos." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/265206.

Texte intégral

Résumé :

Orientador: Robson Pederiva Tese (doutorado) - Universidade Estadual de Campinas. Faculdade de Engenharia Mecanica Made available in DSpace on 2018-08-09T22:58:42Z (GMT). No. of bitstreams: 1 LamimFilho_PauloCezarMonteiro_D.pdf: 3058410 bytes, checksum: b3139213ab7f18f3ff80772b9e063ab3 (MD5) Previous issue date: 2007 Resumo: Um programa de manutenção preditiva deve englobar várias técnicas de monitoramento a condição do motor elétrico. Dentre elas, pode-se citar como clássicas, a análise de corrente elétrica e análise de vibrações. Entretanto, existe um grande número de dificuldades associadas com estas técnicas e, conseqüentemente, com suas aplicações in loco no parque fabril. Isto ocorre devido ao largo espectro de possíveis defeitos, tais como: curto circuito entre espiras, desequilíbrio de fase e falhas de barras rotativas do rotor. Este trabalho propõe a implementação de um transdutor (bobina de fluxo) sensível às ondas eletromagnéticas dentro dos motores de indução trifásicos para a detecção, diagnóstico e monitoramento on-line. Foi obtida uma relação entre as principais falhas de origem elétrica (curto circuito entre espiras, desequilíbrio de fase e barras quebradas) com os sinais de fluxo magnético, sendo estabelecidas as freqüências características de falhas. No trabalho é proposto o uso da lógica fuzzy para o monitoramento online. A condição do motor é descrita através de variáveis lingüísticas. Uma base de regras foi construída para ser usada pelo método de inferência fuzzy. O motor de indução é diagnosticado pela composição do conjunto de regras do método de inferência. Os resultados experimentais comprovaram a eficiência do sensor proposto e da estratégia de detecção, diagnóstico e monitoramento on-line, podendo ser futuramente incluídos em Programas de Manutenção Preditiva Abstract: A predictive maintenance program must include several techniques of monitoring of the electric motor¿s conditions. Among these techniques, probably the two most classic ones are related to electric current and vibration analysis. Unfortunately, in both cases inherent drawbacks make difficult their use in loco on industry plants. As there is a large range of possible fault sources and abnormal machine use conditions (such as inter-turn short circuits, unbalanced voltage supplies and broken rotor bars) the determination of the real machine problem is difficult. This work presents the implementation of a special sensor developed (flux coil sensor) inside three-phase induction motors used as experimental platforms. This sensor is sensitive to electromagnetic waves and they are used for detection, diagnosis, and on-line monitoring of electrical faults. It was established a relation between the main electrical faults (inter-turn short circuits, unbalanced voltage supplies and broken rotor bars) and the signals of magnetic flux, that were identified the characteristic frequencies of these faults. In this work, it is proposed the use of fuzzy logic for the on-line monitoring. The motor operational conditions are described by using fuzzy linguistic variables. A knowledge base, comprising fuzzy rules and databases, was built to support the fuzzy inference process. The conditions of the induction motors used during the test phase are diagnosed using a compositional rule and fuzzy inference procedures. The experimental results shown the efficiency of the flux coil sensor developed and the strategies for detection, diagnosis, and on-line monitoring tasks. The results were undoubtedly impressive and in a near future the system developed can be adapted and used in real predictive maintenance programs in industries Doutorado Mecanica dos Sólidos e Projeto Mecanico Doutor em Engenharia Mecânica

Styles APA, Harvard, Vancouver, ISO, etc.

49

Landes, Juergen. "The principle of spectrum exchangeability within inductive logic." Thesis, University of Manchester, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.496260.

Texte intégral

Résumé :

We investigate the consequences of the principle of Spectrum Exchangeability m inductive logic over the polyadic fragment of first order logic. This principle roughly states that the probability of a possible world should only depend on how the inhabitants of this world behave with respect to indistinguishability. This principle is a natural generahzation of exchangeability principles that have long been investigated over the monadic predicate fragment of first order logic. It is grounded in our deep conviction that in the state of total ignorance all possible worlds that can be obtained from each other by basic symmetric transformations should have the same a priori probability.

Styles APA, Harvard, Vancouver, ISO, etc.

50

NGUEMBANG, FADJA Arnaud. "Scalable Probabilistic Inductive Logic Programming for Big Data." Doctoral thesis, Università degli studi di Ferrara, 2020. http://hdl.handle.net/11392/2487879.

Texte intégral

Résumé :

The size of the data available on the Internet and in various fields is constantly increasing. This lead to the phenomenon called big data. Since these data come from different sources and are heterogeneous, they are intrinsically characterized by incompleteness and/or uncertainty. In order to manage such data, systems have to be not only able to represent uncertainty but also scalable enough to deal with ever-increasing data. Systems based on logic provide powerful tools for representing, reasoning and learning from data characterized by uncertainty. The Distributions Semantics (DS) is a well known formalism for representing data characterized by uncertainty. It provides a powerful tool for combining logic and probability. Programs following this formalism are called Probabilistic Logic Programs (PLPs). Many languages follow the DS, such as Logic Program with Annotated Disjunctions (LPADs) and ProbLog. Moreover, state of the art systems for learning either the parameters, EMBLEM and LFI-ProbLog, or the structure, SLIPCOVER and ProbFOIL+, have been implemented. These systems provide good performance in terms of accuracy but still suffer from scalability problems. In this thesis, we address these problems by proposing two languages under the DS in which reasoning and learning are cheaper. We first present a language, Liftable Probabilistic Logic Programs (LPLPs), in which inference is performed at a lifted level, i.e groups of individuals are considered as a whole instead of one by one. Then we propose the algorithm, LIFTCOVER for LIFTed slipCOVER, that learns the structure of LPLPs from data. Two versions of LIFTCOVER are proposed: the first, LIFTCOVER- EM, uses the Expectation Maximization (EM) algorithm as a sub-routine for parameter learning and the second, LIFTCOVER-LBFGS, uses an optimization method called Limited memory BFGS. In the second part we present an extension of the language of LPLPs, called Hierarchical Probabilistic Logic Programs (HPLPs), in which clauses and predicates are hierarchically organized. A program in this language can be converted to a set of Arithmetic Circuits (ACs) or deep neural networks and inference is done by evaluating the ACs. We describe how to perform inference and learning in HPLPs. To learn the parameters of HPLPs from data, we propose the algorithm, Parameter learning for HIerarchical probabilistic Logic programs (PHIL). Two variants of PHIL, Deep PHIL (DPHIL) and EM PHIL (EMPHIL), and their regularized versions are presented. We also propose an algorithm, SLEAHP for Structure LEArning of Hierarchical Probabilistic logic programming, for learning both the structure and the parameters of HPLPs from data. All these algorithms were tested on real world problems and their perfor- mances, in terms of time, were better than the state of the art while obtaining solutions of comparable quality. La dimensione dei dati disponibili su Internet e in vari campi è in costante aumento. Questo porta al fenomeno cosidetto big data. Poiché questi dati provengono da fonti diverse e sono eterogenei, sono intrinsecamente caratter- izzati da incompletezza e/o incertezza. Per gestire tali dati, i sistemi devono essere non solo in grado di rappresentare l’incertezza, ma anche abbastanza scalabili per gestire dati in costante aumento. I sistemi basati sulla logica forniscono potenti strumenti per rappresentare, ragionare e apprendere dai dati caratterizzati da incertezza. La Semantica distribuzionale (SD) è un formal- ismo ben noto per rappresentare dati caratterizzati da incertezza. Fornisce un potente strumento per combinare logica e probabilità. Programmi che seguono questo formalismo sono chiamati Programmi Logici Probabilistici (PLP). Molti linguaggi seguono la SD, come i Programmi Logici con Disgiunzioni Annotate (PLDA) e ProbLog. Inoltre, sono stati implementati sistemi all’avanguardia per l’apprendimento dei parametri, EMBLEM e LFI-ProbLog, e della struttura, SLIPCOVER e ProbFOIL+ di programmi in tali linguaggi. Questi sistemi offrono buone prestazioni in termini di accuratezza ma soffrono ancora di prob- lemi di scalabilità. In questa tesi, affrontiamo questi problemi proponendo due linguaggi sotto la SD in cui il ragionamento e l’apprendimento sono veloci. Innanzitutto proponiamo un linguaggio, chiamato Liftable Probabilistic Logic Programs (LPLP), in cui l’inferenza è eseguita ad alto livello, cioè gruppi di individui sono considerati complessivamente anziché uno per uno. Poi proponiamo l’algoritmo, LIFTCOVER per LIFTed slipCOVER, che apprende la struttura di LPLP dai dati. Due versioni di LIFTCOVER sono state proposte: il primo, LIFTCOVER-EM, utilizza l’algoritmo Expectation Maximization (EM) come sub-routine per l’apprendimento dei parametri e il secondo, LIFTCOVER- LBFGS, utilizza un metodo di ottimizzazione chiamato BFGS a memoria limitata. Nella seconda parte presentiamo un’estensione del linguaggio LPLP, chiam- ato Hierarchical Probabilistic Logic Programs (HPLP), in cui le clausole e i predicati sono organizzati gerarchicamente. Un programma in questa linguaggio può essere convertito in una serie di Circuiti Aritmetici (CA) o reti neurali profonde e l’inferenza viene fatta valutando gli CA. La tesi descrive come eseguire l’inferenza e l’apprendimento negli HPLP. Per apprendere i parametri degli HPLP dai dati, abbiamo proposto l’algoritmo, Parameter learning for HIerarchical probabilistic Logic programs (PHIL). Due varianti di PHIL, Deep PHIL (DPHIL) ed EM PHIL (EMPHIL) e le loro versioni regolarizzate sono state presentate. Inoltre, abbiamo proposto l’algoritmo SLEAHP, per Structure LEArning of Hierarchical Probabilistic logic programming, per apprendere sia la struttura che i parametri di HPLP dai dati. Tutti questi algoritmi sono stati esperimentati su problemi del mondo reale e le loro prestazioni, in termini di tempo, sono migliori dello stato dell’arte ottenendo soluzioni di qualità paragonabile.

Styles APA, Harvard, Vancouver, ISO, etc.

Thèses sur le sujet « Induction (Logic) »

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres