Dissertations / Theses on the topic 'Ruleset'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Ruleset.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Haq, Ikram. "Fraud detection for online banking for scalable and distributed data." Thesis, Federation University Australia, 2020. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/171977.
Full textDoctor of Philosophy
Von, Drasek Nathan James. "Return to Earth: Decayed Rulesets in VR." Miami University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=miami1626166928722007.
Full textMcNair, Lynn Jacqueline. "'Rules, rules, rules and we're not allowed to skip'." Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/22942.
Full textFigueira, Lucas Baggio. "Sobre o modelo neural RuleNet e suas características simbólica e cooperativa." Universidade Federal de São Carlos, 2004. https://repositorio.ufscar.br/handle/ufscar/566.
Full textFinanciadora de Estudos e Projetos
Machine learning is an area of Artificial Intelligence that deals with methods and techniques for implementing automatic learning in computational systems. This research work investigates a machine learning neural model called RuleNet and its extension for fuzzy domains named Fuzzy RuleNet. Among the advantages of the RuleNet proposal are its simplicity, easiness and fast training as well as the way it represents the induced concept, which can be characterized as symbolic. This aspect makes RuleNet suitable for participating in cooperative systems. This research work investigates both the contribution of the RuleNet model as a stand alone learning technique as well as part of a cooperative system. It presents and discusses the results obtained in several experiments, evaluating RuleNet as a stand alone machine learning (versus two other machine learning methods, the ID3 and the NGE) and as part of a cooperative system, articulated to ID3 and to NGE.
Aprendizado de máquina é uma área da Inteligência Artificial que investe na pesquisa de métodos e técnicas para viabilizar o aprendizado automático em sistemas computacionais. Este trabalho de pesquisa investiga um modelo neural de aprendizado de máquina chamado RuleNet e sua extensão Fuzzy RuleNet, para domínios fuzzy. Dentre as vantagens da proposta RuleNet estão sua simplicidade, facilidade e rapidez no treinamento bem como a maneira como representa o conceito induzido, que pode ser caracterizada como simbólica. Esse aspecto torna o RuleNet adequado a ser incorporado a sistemas cooperativos de aprendizado. O trabalho de pesquisa investiga a contribuição do modelo RuleNet tanto como uma técnica de aprendizado stand-alone quanto como parte de um sistema cooperativo. O trabalho apresenta e discute os resultados obtidos em vários experimentos que avaliam o RuleNet como método de aprendizado stand-alone (versus dois outros métodos de aprendizado de máquina, o ID3 e o NGE) e como parte de um sistema cooperativo, articulado tanto ao ID3 quanto ao NGE.
Soto, Raymond. "First Rules." Digital Commons at Loyola Marymount University and Loyola Law School, 1991. https://digitalcommons.lmu.edu/etd/636.
Full textBjöörn, Christopher, and Jacob Johnsson. "Universe-defining rules." Thesis, Blekinge Tekniska Högskola, Institutionen för teknik och estetik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4938.
Full textDetta är en reflektionsdel till en digital medieproduktion.
Anderson, Grant. "Random Relational Rules." The University of Waikato, 2008. http://hdl.handle.net/10289/2562.
Full textLinnik, Y. N. "Sales promotion rules." Thesis, Вид-во СумДУ, 2005. http://essuir.sumdu.edu.ua/handle/123456789/19899.
Full textNalenz, Malte. "Horseshoe RuleFit : Learning Rule Ensembles via Bayesian Regularization." Thesis, Linköpings universitet, Statistik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-130249.
Full textZhang, Haoning. "Indexed semantic mapping rules." Zurich : ETH, Swiss Federal Institut of Technology, Institute of Information Systems, 2009. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=449.
Full textIngalls, Linda Kay. "Feature rules in TOPSS /." Connect to unofficial online version of: Feature rules in TOPSS, 2005. http://minds.wisconsin.edu/bitstream/1793/18757/1/IngallsLinda.pdf.
Full textKoh, Yun Sing, and n/a. "Generating sporadic association rules." University of Otago. Department of Computer Science, 2007. http://adt.otago.ac.nz./public/adt-NZDU20070711.115758.
Full textSecky, Frank Michael. "Wittgenstein, rules, and normativity." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ51796.pdf.
Full textBaldock, Emily. "Rules of non-enforcement." Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.418838.
Full textHsu, L. H. "Ethics and sports rules." Thesis, University of Leeds, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.508932.
Full textBadinger, Harald, and Wolf Heinrich Reuter. "Determinants of fiscal rules." Taylor & Francis, 2017. http://epub.wu.ac.at/5478/1/Manuscript.pdf.
Full textPerry, Adam Drew. "Rules, reasons, and acceptance." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:6df8a999-51b2-49c2-85e9-b40293e5409e.
Full textПугачова, Анна Олегівна. "Rules for graphic design." Thesis, Київський національний університет технологій та дизайну, 2020. https://er.knutd.edu.ua/handle/123456789/15355.
Full textМинюк, Дмитро Іванович. "European Aviation Safety Rules." Thesis, НАУ, 2017. http://er.nau.edu.ua/handle/NAU/26734.
Full textZaenen, Annie E. "Extraction rules in Icelandic." New York : Garland Pub, 1985. http://books.google.com/books?id=ADdcAAAAMAAJ.
Full textXu, Xin. "Flexible monetary policy rules." Thesis, University of East Anglia, 2017. https://ueaeprints.uea.ac.uk/63641/.
Full textAndrade, Rodrigo Bomfim de. "Sequential cost-reimbursement rules." reponame:Repositório Institucional do FGV, 2014. http://hdl.handle.net/10438/11736.
Full textApproved for entry into archive by ÁUREA CORRÊA DA FONSECA CORRÊA DA FONSECA (aurea.fonseca@fgv.br) on 2014-04-30T19:55:08Z (GMT) No. of bitstreams: 1 diss_RodrigoAndrade.pdf: 591074 bytes, checksum: 533c9582d0fd79341698968896535e09 (MD5)
Approved for entry into archive by Marcia Bacha (marcia.bacha@fgv.br) on 2014-05-08T13:35:03Z (GMT) No. of bitstreams: 1 diss_RodrigoAndrade.pdf: 591074 bytes, checksum: 533c9582d0fd79341698968896535e09 (MD5)
Made available in DSpace on 2014-05-08T13:40:17Z (GMT). No. of bitstreams: 1 diss_RodrigoAndrade.pdf: 591074 bytes, checksum: 533c9582d0fd79341698968896535e09 (MD5) Previous issue date: 2014-03-17
This paper studies cost-sharing rules under dynamic adverse selection. We present a typical principal-agent model with two periods, set up in Laffont and Tirole's (1986) canonical regulation environment. At first, when the contract is signed, the firm has prior uncertainty about its efficiency parameter. In the second period, the firm learns its efficiency and chooses the level of cost-reducing effort. The optimal mechanism sequentially screens the firm's types and achieves a higher level of welfare than its static counterpart. The contract is indirectly implemented by a sequence of transfers, consisting of a fixed advance payment based on the reported cost estimate, and an ex-post compensation linear in cost performance.
Este trabalho estuda regras de compartilhamento de custos sob seleção adversa dinâmica. Apresentamos um modelo típico de agente-principal com dois períodos, fundamentado no ambiente canônico de regulação de Laffont e Tirole (1986). De início, quando da assinatura do contrato, a firma possui incerteza prévia sobre seu parâmetro de eficiência. No segundo período, a firma aprende a sua eficiência e escolhe o nível de esforço para reduzir custos. O mecanismo ótimo efetua screening sequencial entre os tipos da firma e atinge um nível de bem-estar superior ao alcançado pelo mecanismo estático. O contrato é implementado indiretamente por uma sequência de transferências, que consiste em um pagamento fixo antecipado, baseado na estimativa de custos reportada pela firma, e uma compensação posterior linear no custo realizado.
Gundavarapu, Madhavi. "RuleGen – A Rule Generation Application Using Multiset Decision Tables." University of Akron / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=akron1140111266.
Full textPalmadottir, Julia. "Extracting ECA rules from UML." Thesis, University of Skövde, Department of Computer Science, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-541.
Full textActive technology in database management systems (DBMS) enables the movement of behaviour dependent on the system’s state, from the application software to a rule base in the DBMS. With active technology in database systems, the problem of how to design active behaviour has become an important issue. Modelling processes do not foresee support for design of active rules which can lead to conflicts between the event-condition-action (ECA) rules representing the active behaviour and the application systems, using the active DBMS. The unified modelling language (UML) is a widely used notation language and is the main subject in this project. Its features will be investigated to acknowledge to what extend UML modelling diagrams provide information that can be used to formulate ECA rules.
To achieve this, two methods where developed. One of the methods was applied on use-case UML modelling diagrams. The use-case models were developed by means of reflecting a real-life organisation. The results from applying the method on the use-case models were that there are features in UML that can be expressed with ECA rules.
Active technology in database management systems (DBMS) enables the movement of behaviour dependent on the system’s state, from the application software to a rule base in the DBMS. With active technology in database systems, the problem of how to design active behaviour has become an important issue. Modelling processes do not foresee support for design of active rules which can lead to conflicts between the event-condition-action (ECA) rules representing the active behaviour and the application systems, using the active DBMS. The unified modelling language (UML) is a widely used notation language and is the main subject in this project. Its features will be investigated to acknowledge to what extend UML modelling diagrams provide information that can be used to formulate ECA rules.
To achieve this, two methods where developed. One of the methods was applied on use-case UML modelling diagrams. The use-case models were developed by means of reflecting a real-life organisation. The results from applying the method on the use-case models were that there are features in UML that can be expressed with ECA rules.
Rohr, Carsten. "Rules of molecular self-organization." Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-138837.
Full textDoray-Demers, Pascal. "The origin of fiscal rules." Thesis, University of British Columbia, 2017. http://hdl.handle.net/2429/62855.
Full textArts, Faculty of
Political Science, Department of
Graduate
Johnston, Colin B. "Rules, truth and linguistic community." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0019/MQ49380.pdf.
Full textBjörk, Ljunggren Viktoria, and Malin Norén. "Rules and regulations in logistics." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-94739.
Full textSaÌnchez, Brigido Rodrigo E. "Groups, rules and legal practice." Thesis, University of Oxford, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.439314.
Full textHahn, Ulrike Elizabeth. "Cases and rules in categorization." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339293.
Full textGreen, Dror. "Ground rules in online psychotherapy." Thesis, City University London, 2006. http://openaccess.city.ac.uk/8508/.
Full textBadinger, Harald, and Wolf Heinrich Reuter. "The Case for Fiscal Rules." WU Vienna University of Economics and Business, 2015. http://epub.wu.ac.at/4629/1/wp204.pdf.
Full textSeries: Department of Economics Working Paper Series
Casta, Maline. "Not Playing By The Rules." Thesis, Konstfack, Grafisk Design & Illustration, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-4776.
Full textTsai, Ming-Chih. "Economics of railway safety rules." Thesis, University College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286895.
Full textHudson, J. "Memory, rules and private language." Thesis, University of Essex, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377486.
Full textZettlemoyer, Luke S. (Luke Sean) 1978. "Learning probabilistic relational planning rules." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/87896.
Full textMushendami, Postrick Lifa. "Essays in monetary policy rules." Thesis, Durham University, 2014. http://etheses.dur.ac.uk/10668/.
Full textChaoran, Sun. "Essays in Fair Allocation Rules." Doctoral thesis, Universitat Autònoma de Barcelona, 2021. http://hdl.handle.net/10803/673865.
Full textEsta tesis estudia las reglas de asignación justa y sus problemas asociados: qué son, cómo implementarlas y cómo aplicarlas en entornos económicos. En el Capítulo 1, presentamos las reducciones sin valor (v-f), que son operadores que asignan un juego de coalición jugado por un conjunto de jugadores a otro juego similar jugado por un subconjunto de esos jugadores. Proponemos propiedades que las reducciones de vf pueden satisfacer, les proporcionamos una teoría de la dualidad y caracterizamos varias reducciones de vf (entre las que se encuentran la versión libre de valor de los juegos reducidos propuestos por Hart y Mas-Colell, 1989, y Oishi et al. ., 2016). A diferencia de los juegos reducidos, introducidos para caracterizar valores en términos de consistencia, las reducciones v-f no se definen en referencia a valores. Sin embargo, una reducción de v-f induce un valor. Caracterizamos las reducciones de v-f que inducen el valor de Shapley, el valor independiente y el valor de Banzhaf. Conectamos nuestro enfoque a la teoría de la implementación. Finalmente, mostramos que nuestro nuevo enfoque es una herramienta útil para proporcionar nuevas caracterizaciones de valores en términos de consistencia, y presentamos nuevas caracterizaciones del Banzhaf y los valores independientes. En el capítulo 2, presentamos dos mecanismos que implementan el valor de Shapley y la plusvalía igual, respectivamente. La característica principal de ambos mecanismos es que varios proponentes presentan planes de asignación simultáneamente. La implementación de un plan requiere tanto el consenso entre los proponentes como la aceptación de los encuestados. En caso de desacuerdo entre los proponentes, utilizamos el procedimiento de licitación introducido por Pérez-Castrillo y Wettstein (J. Econ. Theory 100: 274-294, 2001), que facilita la compra de un proponente en cada ronda. Entonces, la diferencia entre dos valores se reduce a cómo los proponentes negocian con los encuestados. En el Capítulo 3, definimos la solución proporcional ordinal de Shapley (POSh), un concepto ordinal para economías de cambio puras en el espíritu del valor de Shapley. Nuestra construcción está inspirada en la caracterización de Hart y Mas-Colell (1989) del valor de Shapley con la ayuda de una función potencial. El POSh existe y es único y esencialmente de un solo valor para una clase de economías bastante general. Satisface la racionalidad individual, el anonimato y las propiedades similares a las propiedades de jugador nulo y de jugador nulo en los juegos de utilidad transferibles. Además, el POSh es inmune a la manipulación de los agentes de sus dotaciones iniciales: no es manipulable en D y no sufre la paradoja de la transferencia. Finalmente, construimos un mecanismo de licitación al estilo de Pérez-Castrillo y Wettstein (2006) que implementa el POSh en equilibrio de Nash perfecto en subjuegos para economías donde los agentes tienen preferencias homotéticas y dotaciones positivas.
This thesis studies fair allocation rules and its associated problems: what they are, how to implement them, and how to apply them in economic environments. In Chapter 1, we introduce the value-free (v-f) reductions, which are operators that map a coalitional game played by a set of players to another similar game played by a subset of those players. We propose properties that v-f reductions may satisfy, we provide a theory of duality for them, and we characterize several v-f reductions (among which the value-free version of the reduced games proposed by Hart and Mas-Colell, 1989, and Oishi et al., 2016). Unlike reduced games, introduced to characterize values in terms of consistency, v-f reductions are not defined in reference to values. However, a v-f reduction induces a value. We characterize v-f reductions that induce the Shapley value, the stand-alone value, and the Banzhaf value. We connect our approach to the theory of implementation. Finally, we show that our new approach is a useful tool to provide new characterizations of values in terms of consistency, and we present new characterizations of the Banzhaf and the stand-alone values. In Chapter 2, we introduce two mechanisms that implement the Shapley value and the equal surplus value, respectively. The main feature of both mechanisms is that multiple proposers put forth allocation plans simultaneously. The implementation of a plan requires both consensus among proposers and acceptance of respondents. In case of disagreement among proposers, we use the bidding procedure introduced by Perez-Castrillo and Wettstein (J. Econ. Theory 100: 274-294, 2001), which facilitates a buyout of one proposer in each round. Then the difference between two values comes down to how proposers negotiate with respondents. In Chapter 3, we define the proportional ordinal Shapley (the POSh) solution, an ordinal concept for pure exchange economies in the spirit of the Shapley value. Our construction is inspired by Hart and Mas-Colell’s (1989) characterization of the Shapley value with the aid of a potential function. The POSh exists and is unique and essentially single-valued for a fairly general class of economies. It satisfies individual rationality, anonymity, and properties similar to the null-player and null-player out properties in transferable utility games. Moreover, the POSh is immune to agents’ manipulation of their initial endowments: It is not D-manipulable and does not suffer from the transfer paradox. Finally, we construct a bidding mechanism à la Pérez-Castrillo and Wettstein (2006) that implements the POSh in subgame perfect Nash equilibrium for economies where agents have homothetic preferences and positive endowments.
Dari-Mattiacci, Giuseppe, and Francesco Parisi. "Liability Rules: An Economic Taxonomy." IUS ET VERITAS, 2016. http://repositorio.pucp.edu.pe/index/handle/123456789/123385.
Full textEl análisis de la responsabilidad civil extracontractual ha sido unade las aplicaciones más y mejor desarrolladas aplicaciones de la metodología económica en el estudio del Derecho. e n el presente ensayo, ofrecemos un vistazo general de la aproximación económica a la responsabilidad civil extracontractual, analizando los efectos de las reglas de responsabilidad en los incentivos de precaución. Catalogamos una variedad de regímenes de responsabilidad, desglosando sistemáticamente las posibles asignaciones de responsabilidad en términos de reglas primarias y secundarias; asi como describimos como sus transformaciones distribuyen los costos de los accidentes (y los incentivos concomitantes para tomar las medidas precautorias). Consideramos luego que circunstancias empíricas o facticas pueden determinar que un régimen de responsabilidad extracontractual sea preferido sobre otro desde la perspectiva del legislador.
Krasniuk, Maxim, and Svitlana Krasnyuk. "Association rules in finance management." Thesis, Primedia eLaunch & European Scientific Platform, 2021. https://er.knutd.edu.ua/handle/123456789/18974.
Full textКозловська, Ганна Борисівна, Анна Борисовна Козловская, and Hanna Borysivna Kozlovska. "Some rules of document design." Thesis, Суми : ФОП Цьома С. П, 2021. https://essuir.sumdu.edu.ua/handle/123456789/83791.
Full textДизайн документа делает его доступным и легко воспринимается благодаря использованию специфических особенностей его расположения, таких как заголовки/ подзаголовки, визуальные средства, межстрочный интервал, соответствующие типы шрифтов, цвета и многие другие элементы дизайна.
Document design makes it easy to follow and accessible by using the correct characteristic features of its arrangement such as titles, headings/subheadings, visual aids, line spacing, appropriate font types, colors and many other design elements.
Rushton, Brian. "Alternating links and subdivision rules /." Diss., CLICK HERE for online access, 2009. http://contentdm.lib.byu.edu/ETD/image/etd2815.pdf.
Full textFalk, Donald Albert. "Scaling rules for fire regimes." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/290135.
Full textRushton, Brian Craig. "Alternating Links and Subdivision Rules." BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/1840.
Full textHecham, Abdelraouf. "Defeasible reasoning for existential rules." Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS012/document.
Full textKnowledge representation and reasoning on the Semantic Web has recently focused, due to practical rationale, on the subset of first order logic called existential rules. In this thesis we investigate reasoning with existential rules in presence of conflicting information and introduce defeasible existential rule reasoning. We provide three main salient results as follows. First we show that classical defeasible reasoning techniques need to be revisited for existential rules and study their theoretical and implementation related challenges. Second, we provide a new combinatorial structure that allows for diverse variants of defeasible reasoning to be captured together and study its expressivity and versatility. Third we evaluate our work with respect to the state of the art in inconsistency handling in existential rules and investigate the human appeal of such reasoning techniques
Yun, Bruno. "Argumentation techniques for existential rules." Thesis, Montpellier, 2019. http://www.theses.fr/2019MONTS011/document.
Full textIn this thesis, we investigate reasoning techniques with argumentation graphs generated from inconsistent knowledge bases expressed in the existential rules language. The existential rules language is a subset of first-order logic in which a knowledge base is composed of two layers: a fact layer and an ontology layer.The fact layer consists of factual knowledge (usually stored in relational databases) whereas the ontology layer consists of reasoning rules of deduction and negative constraints.Since the classical query answering approaches fail in the presence of inconsistencies, we chose to work with an conflict-tolerant reasoning approach that is based on building graphs with structured arguments and attacks from the deductions of the underlying logical knowledge base.The three main results are the following. First, we study how argumentation graphs are obtained from knowledge bases expressed in existential rules, the structural properties of such graphs and show several insights as to how their generation can be improved. Second, we propose a framework that generates an argumentation graph with a special feature called sets of attacking arguments instead of the regular binary attack relation and show how it improves upon the current state-of-the-art using an empirical analysis. Third, we interest ourselves to ranking-based approaches in both the context of query answering and argumentation reasoning. In the former, we introduce a framework that is based on ranking maximal consistent subsets of facts (repairs) in order to have a more productive query answering. In the latter, we set up the foundation theory for semantics that rank arguments in argumentation graphs with sets of attacking arguments
Brogan, Patrick. "Walter's Rules for Getting By." PDXScholar, 2018. https://pdxscholar.library.pdx.edu/open_access_etds/4343.
Full textTo, Wing-hei. "Does Chinese analogy chunk with culturally relevant rules? : development and validation of new Chinese rules /." View the Table of Contents & Abstract, 2005. http://sunzi.lib.hku.hk/hkuto/record/B31941291.
Full textHuynh, Xuan-Hiep. "Interestingness Measures for Association Rules in a KDD Process : PostProcessing of Rules with ARQAT Tool." Phd thesis, Université de Nantes, 2006. http://tel.archives-ouvertes.fr/tel-00482649.
Full textWood, Timothy J. "On the rules-to-episodes transition in classification : generalization of similarity and rules with practice /." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0001/NQ42888.pdf.
Full text