81 research outputs found

    Lattice-valued intuitionistic preference structures and applications

    Get PDF
    Intuicionistički rasplinuti skupovi su već proučavani i definisani u kontekstu mrežnovrednosnih struktura, ali svaka od postojećih definicija imala je odgovarajuće nedostatke. U ovom radu razvijena je definicija intuicionističkog poset-vrednosnog rasplinutog skupa, kojom se poset predstavlja kao podskup distributivne mreže. Na ovaj način možemo ispitivati funkcije pripadanja i nepripadanja i njihove odnose bez upotrebe komplementiranja na posetu. Takođe, u ovako postavljenim okvirima, svaki poset (a samim tim i mreža) može biti kodomen intuicionističkog rasplinutog skupa (čime se isključuje uslov ograničenosti poseta). Primenom uvedene definicije razmatrane su IP-vrednosne rasplinute relacije, x-blokovi ovih relacija i familije njihovih nivoa.Razvijene su jake poset vrednosne relacije reciprociteta koje  predstavljaju uopštenje relacija reciprociteta sa intervala [0,1]. Pokazano je da ovakve relacije imaju svojstva slična poset-vrednosnim relacijama preferencije. Međutim, postoje velika ograničenja za primenu ovakvih relacija jer su zahtevi dosta jaki. Uvedene su IP-vrednosne relacije reciprociteta koje se mogu definisati za veliku klasu poseta.Ovakve relacije pogodne su za opisivanje preferencija. Posmatrana je intuicionistička poset-vrednosna relacija preferencije, koja je refleksivna rasplinuta relacija, nad skupom alternativa. U samom procesu višekriterijumskog odlučivanja može se pojaviti situacija kada alternative nisu međusobno uporedive u odnosu na relaciju preferencije, kao i nedovoljna određenost samih alternativa. Da bi se prevazišli ovakvi problemi uvodi se intuicionistička poset-vrednosna relacija preferencije kao intuicionistička rasplinuta relacija na skupu alternativa sa vrednostima u uređenom skupu. Analizirana su neka njena svojstva. Ovakav model pogodan je za upoređivanje alternativa koje nisu, nužno, u linearnom poretku. Dato je nekoliko opravdanja za uvodjenje oba tipa definisanih relacija. Jedna od mogućnosti jeste preko mreže intervala elemenata iz konačnog lanca S, a koji predstavljaju ocene određene alternative. Relacije preferencije mogu uzimati vrednosti sa ove mreže i time se može prevazići nedostatak informacija ili neodlučnost donosioca odluke.Intuitionistic fuzzy sets have already been explored in depth and defined in the context of lattice-valued intuitionistic fuzzy sets, however, every existing definition has certain drawbacks. In this thesis, a definition of poset-valued intuitionistic fuzzy sets is developed, which introduces a poset as a subset of a distributive lattice. In this manner, functions of membership and non-membership can be examined as well as  their relations without using complement in the poset. Also, in such framework, each poset (and the lattice) can be a co-domain of an intuitionistic fuzzy set (which excludes the condition of the bounded poset). Introduced definition defines IP-valued fuzzy relations, x-blocks of these relations andfamilies of their levels. Strong IP-valued  reciprocialy relations have been developed as a generalization of reciprocal relations from interval [0,1]. It has been shown that these relations have properties similar to the P-valued preferences relations. However, there are great constraints on the application of these relations because the requirements are quite strong.IP- valued reciprocial relations have been introduced, which can be defined for a large class of posets. Such relations are suitable for describing preferences.An intuitionistic poset-valued preference relation, which is a reflexive fuzzy relation, over the set of  alternatives, has been examined. In the process of a multi-criteria decision making, a situation can occur that the alternatives cannot be compared by the preference relation, as well as insufficient determination of the mentioned alternatives. In order to overcome similar problems, we have introduced an intuitionistic poset-valued preference relation as an intuitionistic fuzzy set over the set of alternatives with values in a certain poset. We have analyzed some its performances. This model is suitable for comparing alternatives which are not necessarily linearly ordered. There are several justifications for the introduction of  both types of defined relations. One of the possibilities is via the lattice of the intervals  of elements from the finite chain S, which represent the preference of a particular alternative. Preferences relations can take values from this lattice and this can overcome the lack of informations or the decisiveness of the decision maker

    RDF Data Indexing and Retrieval: A survey of Peer-to-Peer based solutions

    Get PDF
    The Semantic Web enables the possibility to model, create and query resources found on the Web. Enabling the full potential of its technologies at the Internet level requires infrastructures that can cope with scalability challenges and support various types of queries. The attractive features of the Peer-to-Peer (P2P) communication model such as decentralization, scalability, fault-tolerance seems to be a natural solution to deal with these challenges. Consequently, the combination of the Semantic Web and the P2P model can be a highly innovative attempt to harness the strengths of both technologies and come up with a scalable infrastructure for RDF data storage and retrieval. In this respect, this survey details the research works that adopt this combination and gives an insight on how to deal with the RDF data at the indexing and querying levels.Le Web Sémantique permet de modéliser, créer et faire des requêtes sur les ressources disponibles sur le Web. Afin de permettre à ses technologies d'exploiter leurs potentiels à l'échelle de l'Internet, il est nécessaire qu'elles reposent sur des infrastructures qui puissent passer à l'échelle ainsi que de répondre aux exigences d'expressivité des types de requêtes qu'elles offrent. Les bonnes propriétés qu'offrent les dernières générations de systèmes pair-à- pair en termes de décentralisation, de tolérance aux pannes ainsi que de passage à l'échelle en font d'eux des candidats prometteurs. La combinaison du modèle pair-à-pair et des technologies du Web Sémantique est une tentative innovante ayant pour but de fournir une infrastructure capable de passer à l'échelle et pouvant stocker et rechercher des données de type RDF. Dans ce contexte, ce rapport présente un état de l'art et discute en détail des travaux autour de systèmes pair-à-pair qui traitent des données de type RDF à large échelle. Nous détaillons leurs mécanismes d'indexation de données ainsi que le traitement des divers types de requêtes offerts

    Grammar and Corpora 2016

    Get PDF
    In recent years, the availability of large annotated corpora, together with a new interest in the empirical foundation and validation of linguistic theory and description, has sparked a surge of novel work using corpus methods to study the grammar of natural languages. This volume presents recent developments and advances, firstly, in corpus-oriented grammar research with a special focus on Germanic, Slavic, and Romance languages and, secondly, in corpus linguistic methodology as well as the application of corpus methods to grammar-related fields. The volume results from the sixth international conference Grammar and Corpora (GaC 2016), which took place at the Institute for the German Language (IDS) in Mannheim, Germany, in November 2016.Die Verfügbarkeit großer annotierter und durchsuchbarer Korpora, verbunden mit einem neuerwachten Interesse an der empirischen Grundlegung und Validierung linguistischer Theorie und Beschreibung hat in letzter Zeit zu einer regelrechten Welle interessanter Arbeiten zur Grammatik natürlicher Sprachen geführt. Dieser Band präsentiert zum einen neuere Entwicklungen in der korpusorientierten Forschung zur Grammatik germanischer, romanischer und slawischer Sprachen und zum anderen innovative Ansätze in der einschlägigen korpuslinguistischen Methodologie, die auch Anwendung im Umfeld der Grammatik finden. Der Band fasst die Beiträge der sechsten internationalen Konferenz Grammar and Corpora zusammen, die im November 2016 am Institut für Deutsche Sprache (IDS) in Mannheim stattfand

    Grammar and Corpora 2016

    Get PDF
    In recent years, the availability of large annotated corpora, together with a new interest in the empirical foundation and validation of linguistic theory and description, has sparked a surge of novel work using corpus methods to study the grammar of natural languages. This volume presents recent developments and advances, firstly, in corpus-oriented grammar research with a special focus on Germanic, Slavic, and Romance languages and, secondly, in corpus linguistic methodology as well as the application of corpus methods to grammar-related fields. The volume results from the sixth international conference Grammar and Corpora (GaC 2016), which took place at the Institute for the German Language (IDS) in Mannheim, Germany, in November 2016

    35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France

    Get PDF

    Creating a recommendation model based on similar code segments

    Get PDF
    Käesoleva töö eesmärgiks on luua töövoog soovitusmudeli koostamiseks, mida saaks rakendada staatilises koodianalüüsis kasutajale soovituste tegemisteks. Selleks otsib süsteem sarnaseid koodisegmente avatud lähtekoodiga projektidest ning klasterdab need sarnasuse alusel. See lähenemine põhineb hüpoteesil, et kui arendajad kirjutavad mitu korda sarnast koodi, siis sisaldab see programmeerimismustrit, mida võiks teistelegi soovitada. Töös kontrollitakse lähenemise sobivust ning hinnatakse loodud meetodi kasulikkust staatilises koodianalüüsis. Kokkuvõttes leiti, et sel viisil tehtud soovitused ei arvesta piisavalt analüüsitava projekti eripäradega ega pole rakendatavad selles projektis.The goal of this work is to develop a workflow for the creation of recommendation model which could be used in static code analysis. The system searches for similar code segments from open source projects and clusters them based on their similarity. The hypothesis is that whenever developers write same code multiple times, it would contain an useful pattern that can be recommended to others. The aim of this work is to test this assumption and evaluate the usefulness of the developed process for static code analysis. In conclusion, it was found that the recommendations do not consider the specifics of the analysed project and are therefore not applicable in the project

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum
    corecore