To see the other types of publications on this topic, follow the link: Datamol.
Dissertations / Theses on the topic 'Datamol'
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 'Datamol.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Stüber, Torsten. "Multioperator Weighted Monadic Datalog." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-68116.
Full textAbstract:
In this thesis we will introduce multioperator weighted monadic datalog (mwmd), a formal model for specifying tree series, tree transformations, and tree languages. This model combines aspects of multioperator weighted tree automata (wmta), weighted monadic datalog (wmd), and monadic datalog tree transducers (mdtt). In order to develop a rich theory we will define multiple versions of semantics for mwmd and compare their expressiveness. We will study normal forms and decidability results of mwmd and show (by employing particular semantic domains) that the theory of mwmd subsumes the theory of both wmd and mdtt. We conclude this thesis by showing that mwmd even contain wmta as a syntactic subclass and present results concerning this subclass.
2
Schwandtner, Goetz. "Datalog on infinite structures." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2008. http://dx.doi.org/10.18452/15836.
Full textAbstract:
Datalog ist die relationale Variante der logischen Programmierung und ist eine Standard-Abfragesprache in der Datenbankentheorie geworden. Die Programmkomplexität von Datalog im bisherigen Hauptanwendungsgebiet, auf endlichen Strukturen, ist bekanntermassen in EXPTIME. Wir untersuchen die Komplexität von Datalog auf unendlichen Strukturen, motiviert durch mögliche Anwendungen von Datalog auf unendlichen Strukturen (z.B. linearen Ordnungen) im zeitlichen und räumlichen Schliessen, aber auch durch das aufkommende Interesse an unendlichen Strukturen bei verwandten theoretischen Problemen, wie Constraint Satisfaction Problems (CSP): Im Gegensatz zu endlichen Strukturen können Datalog-Berechnungen auf unendlichen Strukturen unendlich lange dauern, was zur Unentscheidbarkeit von Datalog auf unendlichen Strukturen führen kann. Aber auch in den entscheidbaren Fällen kann die Komplexität von Datalog auf unendlichen Strukturen beliebig hoch sein. Im Hinblick auf dieses Ergebnis widmen wir uns dann unendlichen Strukturen mit der niedrigsten Komplexität von Datalog: Wir zeigen, dass Datalog auf linearen Ordnungen (auch dichte und diskrete, mit oder ohne Konstanten und sogar gefärbte) und Baumordnungen EXPTIME-vollständig ist. Für die Bestimmung der oberen Schranke werden Werkzeuge für Datalog auf Ordnungen eingeführt: Ordnungstypen, Abstandstypen und typdisjunkte Programme. Die Typkonzepte liefern eine endliche Beschreibung der unendlichen Programmergebnisse und könnten auch für praktische Anwendungen von Interesse sein. Wir erzeugen spezielle typdisjunkte Programme, die sich ohne Rekursion lösen lassen. Ein Transfer unserer Methoden auf CSPs zeigt, dass CSPs auf unendlichen Strukturen mit beliebig hoher Zeitkomplexität vorkommen, wie Datalog.Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal and spatial reasoning on one hand and the upcoming interest in infinite structures in problems related to datalog, like constraint satisfaction problems: Unlike datalog on finite databases, on infinite structures the computations may take infinitely long, leading to the undecidability of datalog on some infinite structures. But even in the decidable cases datalog on infinite structures may have arbitrarily high complexity, and because of this result, we research some structures with the lowest complexity of datalog on infinite structures: Datalog on linear orders (also dense or discrete, with and without constants, even colored) and tree orders has EXPTIME-complete complexity. To achieve the upper bound on these structures, we introduce a tool set specialized for datalog on orders: Order types, distance types and type disjoint programs. The type concept yields a finite representation of the infinite program results, which could also be of interest for practical applications. We create special type disjoint versions of the programs allowing to solve datalog without the recursion inherent in each datalog program. A transfer of our methods shows that constraint satisfaction problems on infinite structures occur with arbitrarily high time complexity, like datalog.
3
Hajiyev, Elnar. "Datalog as a pointcut language." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.496905.
Full text
4
Chen, Liming. "Extension du langage logique datalog." Paris 6, 1989. http://www.theses.fr/1989PA066099.
Full textAbstract:
La premiere extension proposee, notee datalog+adt, integre dans datalog les fonctions, sous forme de types abstraits de donnees, qui sont decrits par des systemes de reecriture de termes. La deuxieme extension, notee datalog+agreg, consiste a integrer les fonctions d'agregats dans datalog. Une semantique canonique est definie a l'aide des techniques de stratification et du point fixe. Enfin, une restriction de langage datalog+agreg est proposee
5
Grumbach, Stéphane. "Ensembles et fonctions en Datalog." Paris 11, 1990. http://www.theses.fr/1990PA112003.
Full text
6
Wassell, Mark P. "Semantic optimisation in datalog programs." Master's thesis, University of Cape Town, 1990. http://hdl.handle.net/11427/13556.
Full textAbstract:
Bibliography: leaves 138-142.Datalog is the fusion of Prolog and Database technologies aimed at producing an efficient, logic-based, declarative language for databases. This fusion takes the best of logic programming for the syntax of Datalog, and the best of database systems for the operational part of Datalog. As is the case with all declarative languages, optimisation is necessary to improve the efficiency of programs. Semantic optimisation uses meta-knowledge describing the data in the database to optimise queries and rules, aiming to reduce the resources required to answer queries. In this thesis, I analyse prior work that has been done on semantic optimisation and then propose an optimisation system for Datalog that includes optimisation of recursive programs and a semantic knowledge management module. A language, DatalogiC, which is an extension of Datalog that allows semantic knowledge to be expressed, has also been devised as an implementation vehicle. Finally, empirical results concerning the benefits of semantic optimisation are reported.
7
Lifschitz, Sérgio. "Stratégies d'évaluation parallèle de requêtes Datalog récursives /." Paris : Ecole nationale supérieure des télécommunications, 1994. http://catalogue.bnf.fr/ark:/12148/cb357262340.
Full text
8
Szabó, Tamás [Verfasser]. "Incrementalizing Static Analyses in Datalog / Tamás Szabó." Mainz : Universitätsbibliothek der Johannes Gutenberg-Universität Mainz, 2021. http://d-nb.info/1227578350/34.
Full text
9
Azambuja, Fábio Melo de. "A problemática do cheque pós-datado." Pontifícia Universidade Católica do Rio Grande do Sul, 2007. http://hdl.handle.net/10923/2535.
Full textAbstract:
Made available in DSpace on 2013-08-07T18:48:39Z (GMT). No. of bitstreams: 1
000397639-Texto+Parcial-0.pdf: 91565 bytes, checksum: 5d2c8877bf9ab375f20569bd4542ef7b (MD5)
Previous issue date: 2007This thesis studies the posted-dated cheque, its origin, its use by Brazilian society, its legal previsions, tenets and jurisprudence. Considering its growing use and the lack of legal regulation, giving rise to a lack of judicial security, the legal solutions to be found in other countries were analysed. Proposed legislation currently being evaluated by the Federal Chamber and the Senate that seek the regulation of post-dated cheques were also analysed. The thesis arrives at its conclusion demonstrating that the proposed legislation would not alter the structure of the Law of the Cheque, which is fruit of an international agreement, approved by the the National Congress, indicating that the security analysed should emerge as a new security by way of specific legislation.
A presente dissertação versa sobre o cheque pós-datado, a sua origem, a sua utilização pela sociedade brasileira, a sua previsão legal, a doutrina e a jurisprudência sobre o assunto. Considerando-se a sua crescente utilização e a falta de regulamentação legal, ocorre uma insegurança jurídica. Comenta-se, também, a solução legal encontrada por outros países. Analisam-se, ainda, os projetos de lei em tramitação na câmara federal e senado que buscam a regulamentação do cheque pós-datado. A dissertação encerra, demonstrando que os projetos de lei não poderão alterar a estrutura da lei do cheque, pois a referida lei é fruto de acordo internacional aprovado pelo congresso nacional, concluindo que o titulo de credito analisado devera surgir como um novo titulo de credito, através de lei própria.
10
Seipel, Dietmar. "Practical Applications of Extended Deductive Databases in DATALOG*." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4145/.
Full textAbstract:
A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible.
Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an extensible set of user–defined built–in predicates. Moreover, they often need function symbols for building complex data structures, and the stratified fixpoint iteration has to be extended by aggregation operations.
We present an new language Datalog*, which extends Datalog by stratified meta–predicates (including default negation), function symbols, and user–defined built–in predicates, which are implemented and evaluated top–down in Prolog. All predicates are subject to the same backtracking mechanism. The bottom–up fixpoint iteration can aggregate the derived facts after each iteration based on user–defined Prolog predicates.
11
Egri, László. "The complexity of constraint satisfaction problems and symmetric Datalog /." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101843.
Full textAbstract:
Constraint satisfaction problems (CSPs) provide a unified framework for studying a wide variety of computational problems naturally arising in combinatorics, artificial intelligence and database theory. To any finite domain D and any constraint language Γ (a finite set of relations over D), we associate the constraint satisfaction problem CSP(Γ): an instance of CSP(Γ) consists of a list of variables x1, x2,..., x n and a list of constraints of the form "(x 7, x2,..., x5) ∈ R" for some relation R in Γ. The goal is to determine whether the variables can be assigned values in D such that all constraints are simultaneously satisfied. The computational complexity of CSP(Γ) is entirely determined by the structure of the constraint language Γ and, thus, one wishes to identify classes of Γ such that CSP(Γ) belongs to a particular complexity class.In recent years, logical and algebraic perspectives have been particularly successful in classifying CSPs. A major weapon in the arsenal of the logical perspective is the database-theory-inspired logic programming language called Datalog. A Datalog program can be used to solve a restricted class of CSPs by either accepting or rejecting a (suitably encoded) set of input constraints. Inspired by Dalmau's work on linear Datalog and Reingold's breakthrough that undirected graph connectivity is in logarithmic space, we use a new restriction of Datalog called symmetric Datalog to identify a class of CSPs solvable in logarithmic space. We establish that expressibility in symmetric Datalog is equivalent to expressibility in a specific restriction of second order logic called Symmetric Restricted Krom Monotone SNP that has already received attention for its close relationship with logarithmic space.
We also give a combinatorial description of a large class of CSPs lying in L by showing that they are definable in symmetric Datalog. The main result of this thesis is that directed st-connectivity and a closely related CSP cannot be defined in symmetric Datalog. Because undirected st-connectivity can be defined in symmetric Datalog, this result also sheds new light on the computational differences between the undirected and directed st-connectivity problems.
12
East, Deborah J. "DATALOG WITH CONTRAINTS: A NEW ANSWER-SET PROGRAMMING FORMALISM." UKnowledge, 2001. http://uknowledge.uky.edu/gradschool_diss/322.
Full textAbstract:
Knowledge representation and search are two fundamental areas of artificial intelligence. Knowledge representation is the area of artificial intelligence which deals with capturing, in a formal language, the properties of objects and the relationships between objects. Search is a systematic examination of all possible candidate solutions to a problem that is described as a theory in some knowledge representation formalism. We compare traditional declarative programming formalisms such as PROLOG and DATALOG with answer-set programming formalisms such as logic programming with stable model semantic. In this thesis we develop an answer-set formalism we can DC. The logic of DC is based on the logic of prepositional schemata and a version of Closed World Assumption. Two important features of the DC logic is that it supports modeling of the cardinalities of sets and Horn clauses. These two features facilitate modeling of search problems. The DC system includes and implementation of a grounder and a solver. The grounder for the DC system grounds instances of problems retaining the structure of the cardinality of sets. The resulting theories are thus more concise. In addition, the solver for the DC system utilizes the structure of cardinality of sets to perform more efficient search. The second feature, Horn clauses, are used when transitive closure will eliminate the need for additional variables. The semantics of the Horn clauses are retained in the grounded theories. This also results in more concise theories. Our goal in developing DC is to provide the computer science community with a system which facilitates modeling of problems, is easy to use, is efficient and captures the class of problems in NP-search. We show experimental results comparing DC to other systems. These results show that DC is always competitive with state-of-the-art answer-set programming systems and for many problems DC is more efficient.
13
East, Deborah Jeanine. "Datalog with constraints a new answer-set programming formalism /." Lexington, Ky. : [University of Kentucky Libraries], 2001. http://lib.uky.edu/ETD/ukycosc2001d00017/deast-06-01.pdf.
Full textAbstract:
Thesis (Ph. D.)--University of Kentucky, 2001.Title from document title page. Document formatted into pages; contains vii, 75 p. : ill. Includes abstract. Includes bibliographical references (p. 70-72).
14
Frochaux, André. "Static analysis of monadic datalog on finite labeled trees." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://dx.doi.org/10.18452/17719.
Full textAbstract:
Die vorliegende Dissertation beinhaltet eine umfassende Untersuchung der Entscheidbarkeit und Komplexität der Probleme, die sich durch eine statische Analyse von monadischem Datalog auf endlichen gefärbten Bäumen stellen. Statische Analyse bedeutet hierbei Anfrageoptimierung ohne Blick auf konkrete Instanzen, aber mit Rücksicht auf deren zugrunde liegende Struktur. Im Kern beinhaltet dies die Lösung der drei folgenden Probleme: das Leerheitsproblem (die Frage, ob eine Anfrage auf jeder Instanz ein leeres Ergebnis liefert), das Äquivalenzproblem (die Frage, ob zwei Anfragen auf jeder Instanz das gleiche Ergebnis liefern) und das Query-Containment-Problem (die Frage, ob das Ergebnis der einen Anfrage auf jeder Datenbank im Ergebnis der anderen Anfrage enthalten ist). Von Interesse ist dabei, ob die Fragen für eine gegebene Anfragesprache entscheidbar sind und wenn ja, welche Komplexität ihnen innewohnt. Wir betrachten diese Probleme für monadisches Datalog auf unterschiedlichen Repräsentationen für endliche gefärbte Bäume. Hierbei unterscheiden wir zwischen ungeordneten und geordneten Bäumen, welche die Achsen child bzw. firstchild und nextsibling und deren Erweiterung um die descendant-Achse nutzen. Außerdem unterscheiden wir Alphabete mit und ohne Rang. Monadisches Datalog ist eine Anfragesprache, die in Abhängigkeit vom gewählten Schema die Ausdrucksstärke der monadischen Logik zweiter Stufe (MSO) erreicht und dennoch effizient ausgewertet werden kann. Wir zeigen, dass unter in der Datenbanktheorie üblichen Mengensemantik die drei genannten Probleme für alle Schemata ohne descendant-Achse EXPTIME-vollständig sind und lösbar in 2EXPTIME, falls die descendant-Achse involviert ist. Eine passende untere Schranke wird für fast alle Schemata gezeigt. Unter Multimengensemantik lassen sich die obigen Ergebnisse für das Leerheitsproblem übertragen, während das Query-Containment-Problem für alle betrachteten Schemata unentscheidbar ist.This thesis provides a comprehensive investigation into the decidability and complexity of the fundamental problems entailed by static analysis of monadic datalog on finite labeled trees. Static analysis is used for optimizing queries without considering concrete database instances but exploiting information about the represented structure. Static analysis relies on three basic decision problems. First, the emptiness problem, whose task is to decide whether a query returns the empty result on every database. Second, the equivalence problem asking if the result of two given queries always coincides on every database. And finally, the query containment problem where it is to decide whether on every database a given query produces a subset of the results of a second given query. We are interested in finding out whether these problems are decidable and, if so, what their complexity is. We consider the aforementioned problems for monadic datalog on different representations of finite labeled trees. We distinguish unordered and ordered trees which use the axis child, as well as the axes firstchild and nextsibling, respectively. An extension of the schemas by the descendant-axis is also considered. Furthermore, we distinguish ranked and unranked labeling alphabets. Depending on the schema, the query language monadic datalog can reach the expressive power of monadic second order logic but remains efficiently evaluable. Under set semantics, we show EXPTIME-completness for all used schemas where the descendant-axis is omitted. If the descendant-axis is involved, we present an algorithm that solves the problem within 2-fold exponential time. A matching lower bound is proven for virtually all schemas. Finally, we prove that the complexity of the emptiness problem of monadic datalog on finite trees under bag semantics is the same as under set semantics. Furthermore, we show that the query containment problem of monadic datalog under bag semantics is undecidable in general.
15
EL, BOUSSARGHINI RACHID. "Mise en oeuvre de datalog sur une architecture parallele." Rennes 1, 1989. http://www.theses.fr/1989REN10084.
Full textAbstract:
Definition d'une methode d'interpretation parallele pour un sous ensemble de prolog, appele datalog. Ce langage est considere comme reference pour les systemes de gestion de bases de donnees deductifs. La methode d'interpretation proposee permet d'associer a un programme datalog un reseau de processus determine statiquement
16
Azambuja, F?bio Melo de. "A problem?tica do cheque p?s-datado." Pontif?cia Universidade Cat?lica do Rio Grande do Sul, 2007. http://tede2.pucrs.br/tede2/handle/tede/3998.
Full textAbstract:
Made available in DSpace on 2015-04-14T14:33:17Z (GMT). No. of bitstreams: 1
397639.pdf: 91565 bytes, checksum: 5d2c8877bf9ab375f20569bd4542ef7b (MD5)
Previous issue date: 2007-12-19A presente disserta??o versa sobre o cheque p?s-datado, a sua origem, a sua utiliza??o pela sociedade brasileira, a sua previs?o legal, a doutrina e a jurisprud?ncia sobre o assunto. Considerando-se a sua crescente utiliza??o e a falta de regulamenta??o legal, ocorre uma inseguran?a jur?dica. Comenta-se, tamb?m, a solu??o legal encontrada por outros pa?ses. Analisam-se, ainda, os projetos de lei em tramita??o na c?mara federal e senado que buscam a regulamenta??o do cheque p?s-datado. A disserta??o encerra, demonstrando que os projetos de lei n?o poder?o alterar a estrutura da lei do cheque, pois a referida lei ? fruto de acordo internacional aprovado pelo congresso nacional, concluindo que o titulo de credito analisado devera surgir como um novo titulo de credito, atrav?s de lei pr?pria.
17
Arioua, Abdallah. "Formalisation et étude des explications dialectiques dans les bases de connaissances incohérentes." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT261/document.
Full textAbstract:
Les bases de connaissances sont des bases de données déductives où la logique est utilisée pour représenter des connaissances de domaine sur des données existantes. Dans le cadre des règles existentielles, une base de connaissances est composée de deux couches : la couche de données qui représentent les connaissances factuelle et la couche ontologique qui incorpore des règles de déduction et des contraintes négatives. L’interrogation de données à l’aide des ontologies est la fonction de raisonnement principale dans ce contexte. Comme dans la logique classique, les contradictions posent un problème à l’interrogation car « d'une contradiction, on peut déduire ce qu'on veut (ex falso quodlibet) ».Récemment, des approches d’interrogation tolérantes aux incohérences ont été proposées pour faire face à ce problème dans le cadre des règles existentielles. Elles déploient des stratégies dites de réparation pour restaurer la cohérence. Cependant, ces approches sont parfois inintelligibles et peu intuitives pour l'utilisateur car elles mettent souvent en œuvre des stratégies de réparation complexes. Ce manque de compréhension peut réduire l’utilisabilité de ces approches car elles réduisent la confiance entre l'utilisateur et les systèmes qui les utilisent. Par conséquent, la problématique de recherche que nous considérons est comment rendre intelligible à l’utilisateur l’interrogation tolérantes aux incohérences. Pour répondre à cette question de recherche, nous proposons d’utiliser deux formes d’explication pour faciliter la compréhension des réponses retournées par une interrogation tolérante aux incohérences. La première est dite de niveau méta et la seconde de niveau objet. Ces deux types d’explication prennent la forme d'un dialogue entre l'utilisateur et le raisonneur au sujet des déductions retournées comme réponses à une requête donnée. Nous étudions ces explications dans le double cadre de l'argumentation fondée sur la logique et de la dialectique formelle, comme nous étudions leurs propriétés et leurs impacts sur les utilisateurs en termes de compréhension des résultatsKnowledge bases are deductive databases where the machinery of logic is used to represent domain-specific and general-purpose knowledge over existing data. In the existential rules framework a knowledge base is composed of two layers: the data layer which represents the factual knowledge, and the ontological layer that incorporates rules of deduction and negative constraints. The main reasoning service in such framework is answering queries over the data layer by means of the ontological layer. As in classical logic, contradictions trivialize query answering since everything follows from a contradiction (ex falso quodlibet). Recently, inconsistency-tolerant approaches have been proposed to cope with such problem in the existential rules framework. They deploy repairing strategies on the knowledge base to restore consistency and overcome the problem of trivialization. However, these approaches are sometimes unintelligible and not straightforward for the end-user as they implement complex repairing strategies. This would jeopardize the trust relation between the user and the knowledge-based system. In this thesis we answer the research question: ``How do we make query answering intelligible to the end-user in presence of inconsistency?''. The answer that the thesis is built around is ``We use explanations to facilitate the understanding of query answering''. We propose meta-level and object-level dialectical explanations that take the form of a dialogue between the user and the reasoner about the entailment of a given query. We study these explanations in the framework of logic-based argumentation and dialectics and we study their properties and their impact on users
18
FOUSTOUCOS, EUGENIE. "Une approche algebrique des methodes d'evaluation de requetes datalog simplement lineaires." Paris 11, 1996. http://www.theses.fr/1996PA112454.
Full textAbstract:
Nous introduisons un raffinement de la resolution sld, la resolution sldal-scindee ensembliste qui permet de suivre la propagation des liaisons et surtout de rendre compte du traitement ensembliste des requetes et des reponses, specifique aux bases de donnees. Nous construisons un modele algebrique de calcul de la methode d'evaluation requete-sousrequete par abstraction a partir d'un type particulier d'arbres sldal-scindes ensemblistes. Dans notre modele, construit pour les programmes simplement lineaires (au plus un atome intensionnel dans le corps), les ensembles de substitutions sont manipules par des operateurs algebriques et les pre-ordres de powerdomains utilises permettent de simuler la technique al (tabulation). Ceci permet d'integrer dans un cadre unique les principes de tabulation et de resolution et la gestion des substitutions. Nous montrons que les deux suites convergentes de notre espace d'evaluation expriment egalement la semantique de la methode des ensembles magiques. Ce qui nous permet de demontrer l'equivalence entre cette methode et la methode requete-sousrequete pour la classe des programmes simplement lineaires. Nous indiquons egalement comment etendre notre modele a des programmes datalog quelconques (sans negation)
19
Zhou, Yujiao. "PAGOdA : pay-as-you-go ontology query answering using a datalog reasoner." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:2fbbc6d6-299b-43ae-836d-ae1e0f025a26.
Full textAbstract:
Answering conjunctive queries over ontology-enriched datasets is a core reasoning task for many applications of semantic technologies. Conjunctive query answering is, however, computationally very expensive, which has led to the development of query answering procedures that sacrifice either the expressive power of ontology languages, or the completeness of query answers in order to improve scalability. This thesis describes a hybrid approach to query answering over OWL 2 ontologies that combines a datalog reasoner with a fully-fledged OWL 2 reasoner in order to provide scalable "pay-as-you-go" performance. The key feature of this hybrid approach is that it delegates the bulk of the computation to the datalog reasoner and resorts to expensive OWL 2 reasoning only as necessary to fully answer the query. Although the main goal of this thesis is to efficiently answer queries over OWL 2 ontologies, the technical results are more general and the approach is applicable to first-order knowledge representation languages that can be captured by rules allowing for existential quantification and disjunction in the head; the only assumption is the availability of a datalog reasoner and a fully-fledged reasoner for the language of interest, both of which are used as "black boxes". All techniques proposed in this thesis are implemented in the PAGOdA system, which combines the datalog reasoner RDFox and the OWL 2 reasoner HermiT. An extensive evaluation shows that PAGOdA succeeds in providing scalable pay-as-you-go query answering for a wide range of OWL 2 ontologies, datasets and queries.
20
Tadisetty, Mohan Rao. "On the design and implementation of a top-down Datalog interpreter in C++." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0004/MQ40235.pdf.
Full text
21
Stüber, Torsten [Verfasser], Heiko [Akademischer Betreuer] Vogler, and Zoltán [Akademischer Betreuer] Fülöp. "Multioperator Weighted Monadic Datalog / Torsten Stüber. Gutachter: Heiko Vogler ; Zoltán Fülöp. Betreuer: Heiko Vogler." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://d-nb.info/1067188630/34.
Full text
22
Dumbravă, Ştefania-Gabriela. "Formalisation en Coq de Bases de Données Relationnelles et Déductives -et Mécanisation de Datalog." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS525/document.
Full textAbstract:
Cette thèse présente une formalisation en Coq des langages et des algorithmes fondamentaux portant sur les bases de données. Ainsi, ce fourni des spécifications formelles issues des deux approches différentes pour la définition des modèles de données: une basée sur l’algèbre et l'autre basée sur la logique.A ce titre, une première contribution de cette thèse est le développement d'une bibliothèque Coq pour le modèle relationnel. Cette bibliothèque contient les modélisations de l’algèbre relationnelle et des requêtes conjonctives. Il contient aussi une mécanisation des contraintes d'intégrité et de leurs procédures d'inférence. Nous modélisons deux types de contraintes: les dépendances, qui sont parmi les plus courantes: les dépendances fonctionnelles et les dépendances multivaluées, ainsi que leurs axiomatisations correspondantes. Nous prouvons formellement la correction de leurs algorithmes d'inférence et, pour le cas de dépendances fonctionnelles, aussi la complétude.Ces types de dépendances sont des instances de contraintes plus générales : les dépendances génératrices d'égalité (equality generating dependencies, EGD) et, respectivement, les dépendances génératrices de tuples (tuple generating dependencies, TGD), qui appartiennent a une classe encore plus large des dépendances générales (general dependencies). Nous modélisons ces dernières et leur procédure d'inférence, i.e, "the chase", pour lequel nous établissons la correction. Enfin, on prouve formellement les théorèmes principaux des bases de données, c'est-à-dire, les équivalences algébriques, la théorème de l' homomorphisme et la minimisation des requêtes conjonctives.Une deuxième contribution consiste dans le développement d'une bibliothèque Coq/ssreflect pour la programmation logique, restreinte au cas du Datalog. Dans le cadre de ce travail, nous donnons la première mécanisations d'un moteur Datalog standard et de son extension avec la négation. La bibliothèque comprend une formalisation de leur sémantique en theorie des modelés ainsi que de leur sémantique par point fixe, implémentée par une procédure d'évaluation stratifiée. La bibliothèque est complétée par les preuves de correction, de terminaison et de complétude correspondantes. Cette plateforme ouvre la voie a la certification d' applications centrées donnéesThis thesis presents a formalization of fundamental database theories and algorithms. This furthers the maturing state of the art in formal specification development in the database field, with contributions stemming from two foundational approches to database models: relational and logic based.As such, a first contribution is a Coq library for the relational model. This contains a mechanization of integrity constraints and of their inference procedures. We model two of the most common dependencies, namely functional and multivalued, together with their corresponding axiomatizations. We prove soundness of their inference algorithms and, for the case of functional ones, also completeness. These types of dependencies are instances of equality and, respectively, tuple generating dependencies, which fall under the yet wider class of general dependencies. We model these and their inference procedure,i.e, the chase, for which we establish soundness.A second contribution consists of a Coq/Ssreflect library for logic programming in the Datalog setting. As part of this work, we give (one of the) first mechanizations of the standard Datalog language and of its extension with negation. The library includes a formalization of their model theoretical semantics and of their fixpoint semantics, implemented through bottom-up and, respectively, through stratified evaluation procedures. This is complete with the corresponding soundness, termination and completeness proofs. In this context, we also construct a preliminary framework for dealing with stratified programs. This work paves the way towards the certification of data-centric applications
23
Vernoux, Christian. "Fabrication and optical characterization of long-range plasmonic waveguide interconnects for Tb/s datacom links." Thesis, Bourgogne Franche-Comté, 2019. http://www.theses.fr/2019UBFCK001/document.
Full textAbstract:
Depuis les années 1980, les chercheurs essayent de concevoir des ordinateurs dits « optiques », au sein desquels les signaux électriques seraient remplacés par des signaux photoniques. Pour cela, il est nécessaire de s’intéresser aux problèmes d’interconnexions entre les composants. Cette thèse porte sur la problématique de l’interconnexion optique entre composants électroniques. Afin de proposer une solution à cette problématique, nous étudierons deux types de structures plasmoniques, une première structure d’un seul bloc solide où l’onde d’information est réfléchie sur un prisme d’air, cette structure est composée d’un guide d’onde métallique recouverte d’une couche de photoresist et elle est nommée « guide plasmonique à ultra longue distance » (ULR-SPP). La seconde structure est basée sur une interconnexion flexible où l’information circule le longue d’un guide souple, ce type d’onde est qualifié de « PlasArc ». Au travers d’un chapitre de simulation numérique, nous déterminerons les caractéristiques dimensionnelles afin de minimiser les pertes d’énergies par propagations de nos guides d’ondes dans chacune des structures. Toutes nos simulations sont effectuées dans la gamme d’ondes des signaux télécoms. Puis, nous présentons la fabrication de nos deux types de guides d'ondes ainsi que leurs spécificités de réalisation à savoir une gravure profonde sèche de 60 µm pour les structures ULRSPP et le retrait d’un substrat solide pour les guides « PlasArc ». La caractérisation de nos structures seront réalisées par des méthodes distinctes (réduction successive de la longueur des échantillons, mesures de la perte par propagation le long du guide, taille du mode obtenu en bout de guide, …) sur des tailles d’échantillons pouvant aller de 5 mm à plusieurs centimètres de longueurs. Une étude de la perte selon le rayon de courbure est établie sur les guides d’ondes plasmoniques de type « PlasArc »Since the 1980s, researchers have been trying to design so-called "optical" computers, in which electrical signals would be replaced by photonic signals. For this, it is necessary to look at interconnection problems between components. This thesis deals with the problem of optical interconnection between electronic components. In order to propose a solution to this problem, we will study two types of plasmonic structures, a first structure of a single solid block where the information wave is reflected on an air prism, this structure is composed of a guide of metal wave covered with a layer of photoresist and it is named "ultra-long-distance plasmonic guide" (ULR-SPP). The second structure is based on a flexible interconnection where the information flows along a flexible guide, this type of wave is called "PlasArc". Through a numerical simulation chapter, we will determine the dimensional characteristics in order to minimize the energy losses by propagation of our waveguides in each of the structures. All our simulations are performed in the waveband of telecom signals. Then, we present the fabrication of two types of plasmonic waveguides as well as their specificities of realization namely a deep etching of 60 μm for ULRSPP structures and the removal of a solid substrate for waveguide named "PlasArc". The characterization of structures will be realized by distinct methods (cut-back, measurements of the loss by propagation along the guide, size of the mode obtained at the end of the guide, ...) on sizes of samples that can go from 5 mm to several centimeters in length. A study of the loss according to the radius of curvature is established on plasmonic waveguides of "PlasArc" type
24
Blesz, Junior Attila Elöd. "Proposta de sistemática para orientar a implantação de softwares integrados de gestão : o caso Datasul." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2004. http://hdl.handle.net/10183/4720.
Full text
25
Perselli, Ann-Katrin. "Från datasal till en-till-en : En studie av lärares erfarenheter av digitala resurser i undervisningen." Doctoral thesis, Mittuniversitetet, Avdelningen för utbildningsvetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-22695.
Full textAbstract:
In this thesis a study upper secondary school teachers’ experiences from using digital resources is presented. The study was carried out in two upper secondary schools where the students had each recently been given their own laptop, a so-called one-to-one computer. The purpose of the study was to describe and analyse the teachers’ experiences of using digital resources in teaching. Four teachers, three men and one woman, from two upper secondary schools in a Swedish municipality, participated in the study. Empirical material was collected during autumn 2010 and spring 2012. The methods used in the collection were interviews and participatory observations, so-called go-along observations. The study’s theoretical approach has its foundation in phenomenological philosophy. In the result care, time and teachers’ lived experiences of didactic work emerge as important for the utilisation of digital resources in teaching. In the teaching, the teachers’ experiences and knowledge of their subjects, teaching, digital resources, and life experiences and knowledge seemed to interact. This interaction between experiences and knowledge is described in the study as lived experiences of didactic work. The study shows that teachers dealt with the new digital technology and designed learning environments for the students with the starting point of their lived experiences of didactic work and assumptions about the students’ interest for digital resources. The teachers’ care with relationship building and creation of trust and confidence was shown to have importance for how, and to what extent, digital resources could be used in teaching. Both similarities and differences in the teachers’ experiences of, and knowledge about, how teaching is carried out with one-to-one computers emerged in the study. Two of the teachers were more experienced users of digital resources in comparison with the two others. The teachers’ experiences of digital resources are often related to their own interest in these, but their experiences are also related to the lack of time for learning to use digital resources as pedagogical tools.På omslaget har en liten felaktighet i titeln smugit sig in. Titeln på omslaget ska lyda: Från datasal till en-till-en
26
SANTOS, LEVI F. DOS. "Caracterização química inorgânica de perfis de sedimento do Pantanal da Nhecolândia - MS, datados pelo método do 210Pb." reponame:Repositório Institucional do IPEN, 2016. http://repositorio.ipen.br:8080/xmlui/handle/123456789/27136.
Full textAbstract:
Submitted by Maria Eneide de Souza Araujo (mearaujo@ipen.br) on 2017-03-10T16:25:16Z
No. of bitstreams: 0Made available in DSpace on 2017-03-10T16:25:16Z (GMT). No. of bitstreams: 0
O Pantanal da Nhecolândia, localizado no estado do Mato Grosso do Sul, é parte do Pantanal Brasileiro e possui características específicas, dentre elas a existência de lagos salinos, comumente conhecidos como Salinas. Para se estimar uma possível influência humana no Pantanal da Nhecolândia quatro perfis de sedimento foram coletados, em 2010, nas Salinas A, 6, M e V com o objetivo de se fazer a caracterização química inorgânica dos sedimentos determinando os elementos As, Ba, Ca, Ce, Co, Cr, Cs, Eu, Fe, Hf, K, La, Lu, Na, Nd, Rb, Sb, Sc, Sm, Ta, Tb, Th, U, Yb e Zn pela técnica de análise por ativação com nêutrons instrumental nas frações fina (silte + argila) e grossa (areia média + areia fina) do sedimento e também determinar as taxas de sedimentação e idade do sedimento pelo método do 210Pb. Para auxiliar na interpretação dos resultados determinou-se a composição granulométrica e o conteúdo de água das amostras de sedimento. A análise granulométrica indicou que as Salinas possuem um percentual da fração fina oscilando entre 3,5 % na Salina M a 70 % na Salina A, o que é característico dessa região. Os quatro perfis de sedimento apresentaram diferentes taxas de sedimentação, o que está provavelmente relacionado aos períodos de seca e enchentes. Os resultados obtidos de concentração dos elementos químicos foram comparados com os valores da Upper Continental Crust UCC e da North American Shale Composite NASC, e alguns elementos, como As, Hf, Rb e Sb, apresentaram valores acima destes nas duas frações granulométricas do sedimento, sugereindo à existência de depósitos naturais destes elementos nas quatro Salinas estudadas. Os resultados de concentração dos elementos estudados indicam a não existência de influência antrópica na região. Calculou-se também o fator de enriquecimento - FE dos elementos químicos usando como valores de referência os valores da UCC, NASC, e os valores da base do perfil-FEB, concluindo-se que o FEB foi a melhor metodologia para se avaliar o enriquecimento dos elementos.
Dissertação (Mestrado em Tecnologia Nuclear)
IPEN/D
Instituto de Pesquisas Energeticas e Nucleares - IPEN-CNEN/SP
27
Santos, Levi Francisco dos. "Caracterização química inorgânica de perfis de sedimento do Pantanal da Nhecolândia - MS, datados pelo método do 210Pb." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/85/85131/tde-15122016-141305/.
Full textAbstract:
O Pantanal da Nhecolândia, localizado no estado do Mato Grosso do Sul, é parte do Pantanal Brasileiro e possui características específicas, dentre elas a existência de lagos salinos, comumente conhecidos como Salinas. Para se estimar uma possível influência humana no Pantanal da Nhecolândia quatro perfis de sedimento foram coletados, em 2010, nas Salinas A, 6, M e V com o objetivo de se fazer a caracterização química inorgânica dos sedimentos determinando os elementos As, Ba, Ca, Ce, Co, Cr, Cs, Eu, Fe, Hf, K, La, Lu, Na, Nd, Rb, Sb, Sc, Sm, Ta, Tb, Th, U, Yb e Zn pela técnica de análise por ativação com nêutrons instrumental nas frações fina (silte + argila) e grossa (areia média + areia fina) do sedimento e também determinar as taxas de sedimentação e idade do sedimento pelo método do 210Pb. Para auxiliar na interpretação dos resultados determinou-se a composição granulométrica e o conteúdo de água das amostras de sedimento. A análise granulométrica indicou que as Salinas possuem um percentual da fração fina oscilando entre 3,5 % na Salina M a 70 % na Salina A, o que é característico dessa região. Os quatro perfis de sedimento apresentaram diferentes taxas de sedimentação, o que está provavelmente relacionado aos períodos de seca e enchentes. Os resultados obtidos de concentração dos elementos químicos foram comparados com os valores da Upper Continental Crust UCC e da North American Shale Composite NASC, e alguns elementos, como As, Hf, Rb e Sb, apresentaram valores acima destes nas duas frações granulométricas do sedimento, sugereindo à existência de depósitos naturais destes elementos nas quatro Salinas estudadas. Os resultados de concentração dos elementos estudados indicam a não existência de influência antrópica na região. Calculou-se também o fator de enriquecimento - FE dos elementos químicos usando como valores de referência os valores da UCC, NASC, e os valores da base do perfil-FEB, concluindo-se que o FEB foi a melhor metodologia para se avaliar o enriquecimento dos elementos.Nhecolândia Pantanal, geographically located in the state of Mato Grosso do Sul, is part of the Brazilian Pantanal, and has it specific characteristics, one being the existence of saline lakes, commonly known as Salinas. Therefore, to estimate a possible human influence, a study was initiated in the Nhecolândia Pantanal in 2010, where four sediment cores were collected in Salinas A, 6, M e V. The elements As, Ba, Ca, Ce, Co, Cr, Cs, Eu, Fe, Hf, K, La, Lu, Na, Nd, Rb, Sb, Sc, Sm, Ta, Tb, Th, U, Yb and Zn were determined using instumental neutron activation analysis (INAA), in the fine (silt + clay) and coarse (medium sand + fine sand) fraction of the sediment. The sedimentation rates and age of the sediments were determined using the 210Pb method. The grain size analysis and the water content of the sediment samples were also determined to assist in the interpretation of the results. The four sediment cores showed different sedimentation rates, which is probably related to drought and flood periods. The grain size analysis showed that the Salinas have a percentage of the fine fraction oscilating from 3,5 % in Salina M to 70 % in Salina A, which is characteristic of this region. The results were compared with the values of the Upper Continental Crust - UCC and the North American Shale Composite - NASC, and some elements showed values above these, including the elements As, Hf, Rb and Sb, in the two frations of the sediment, these results of concentration of the elements in the four Salinas suggest the existence of natural deposits of these elements. The results of concentration of the studied elements in the present work suggest that there is no anthropogenic influence in the region. To evaluate these concentration values the enrichment factor - EF was calculated using reference values from the UCC, NASC and values of the core basis - BEF. It was possible to conclude that the best methodology to evaluate the elements enrichment in the Pantanal, for the present study, was the BEF.
28
Rocher, Swan. "Querying existential rule knowledge bases : decidability and complexity." Thesis, Montpellier, 2016. http://www.theses.fr/2016MONTT291/document.
Full textAbstract:
Dans cette thèse, nous nous intéressons au problème d'interrogation de bases de connaissances composées de données et d'une ontologie, qui représente des connaissances générales sur le domaine d'application. Parmi les différents formalismes permettant de représenter les connaissances ontologiques, nous considérons ici un fragment de la logique du premier ordre appelé règles existentielles (aussi connues sous le nom de ``tuple generating dependencies'' et Datalog+/-). Le problème fondamental de conséquence logique au cœur de cette thèse demande si une requête conjonctive est conséquence d'une base de connaissances. Les règles existentielles étant très expressives, ce problème est indécidable. Toutefois, différentes restrictions sur les ensembles de règles ont été proposées afin d'obtenir sa décidabilité.La contribution de cette thèse est double. Premièrement, nous proposons un outil qui nous permet d'unifier puis d'étendre la plupart des classes de règles connues reposant sur des notions d'acyclicité assurant la finitude du chaînage avant. Deuxièmement, nous étudions la compatibilité des classes décidables de règles existentielles connues avec un type de connaissance souvent nécessaire dans les ontologies: la transitivité de relations binaires. Nous aidons à clarifier le paysage des résultats positifs et négatifs liés à cette question et fournissons une approche permettant de combiner la transitivité avec les règles existentielles linéairesIn this thesis we investigate the issue of querying knowledge bases composed of data and general background knowledge, called an ontology. Ontological knowledge can be represented under different formalisms and we consider here a fragment of first-order logic called existential rules (also known as tuple-generating dependencies and Datalog+/-).The fundamental entailment problem at the core of this thesis asks if a conjunctive query is entailed by an existential rule knowledge base. General existential rules are highly expressive, however at the cost of undecidability. Various restrictions on sets of rules have been proposed to regain the decidability of the entailment problem.Our specific contribution is two-fold. First, we propose a new tool that allows to unify and extend most of the known existential rule classes that rely on acyclicity conditions to tame infinite forward chaining, without increasing the complexity of the acyclicity recognition. Second, we study the compatibility of known decidable rule classes with a frequently required modeling construct, namely transitivity of binary relations. We help clarifying the picture of negative and positive results on this question, and provide a technique to safely combine transitivity with one of the simplest, yet useful, decidable rule classes, namely linear rules
29
Frochaux, André [Verfasser], Nicole [Gutachter] Schweikardt, Isolde [Gutachter] Adler, and Johannes [Gutachter] Köbler. "Static analysis of monadic datalog on finite labeled trees / André Frochaux ; Gutachter: Nicole Schweikardt, Isolde Adler, Johannes Köbler." Berlin : Mathematisch-Naturwissenschaftliche Fakultät, 2017. http://d-nb.info/1127628283/34.
Full text
30
Yang, Jitao. "Un modèle de données pour bibliothèques numériques." Thesis, Paris 11, 2012. http://www.theses.fr/2012PA112085.
Full textAbstract:
Les bibliothèques numériques sont des systèmes d'information complexes stockant des ressources numériques (par exemple, texte, images, sons, audio), ainsi que des informations sur les ressources numériques ou non-numériques; ces informations sont appelées des métadonnées. Nous proposons un modèle de données pour les bibliothèques numériques permettant l'identification des ressources, l’utilisation de métadonnées et la réutilisation des ressources stockées, ainsi qu’un langage de requêtes pour l’interrogation de ressources. Le modèle que nous proposons est inspiré par l'architecture du Web, qui forme une base solide et universellement acceptée pour les notions et les services attendus d'une bibliothèque numérique. Nous formalisons notre modèle comme une théorie du premier ordre, afin d’exprimer les concepts de bases de la bibliothèque numérique, sans aucune contrainte technique. Les axiomes de la théorie donnent la sémantique formelle des notions du modèle, et en même temps fournissent une définition de la connaissance qui est implicite dans une bibliothèque numérique. La théorie est traduite en un programme Datalog qui, étant donnée une bibliothèque numérique, permet de la compléter efficacement avec les connaissances implicites. Le but de notre travail est de contribuer à la technologie de gestion des informations des bibliothèques numériques. De cette façon, nous pouvons montrer la faisabilité théorique de notre modèle, en montrant qu'il peut être efficacement appliqué. En outre, nous démontrons la faisabilité pratique du modèle en fournissant une traduction complète du modèle en RDF et du langage de requêtes en SPARQL.Nous fournissons un calcul sain et complet pour raisonner sur les graphes RDF résultant de la traduction. Selon ce calcul, nous prouvons la correction de ces deux traductions, montrant que les fonctions de traduction préservent la sémantique de la bibliothèque numérique et de son langage de requêtesDigital Libraries are complex information systems, storing digital resources (e.g., text, images, sound, audio), as well as knowledge about digital or non-digital resources; this knowledge is referred to as metadata. We propose a data model for digital libraries supporting resource identification, use of metadata and re-use of stored resources, as well as a query language supporting discovery of resources. The model that we propose is inspired by the architecture of the Web, which forms a solid, universally accepted basis for the notions and services expected from a digital library. We formalize our model as a first-order theory, in order to be able to express the basic concepts of digital libraries without being constrained by any technical considerations. The axioms of the theory give the formal semantics of the notions of the model, and at the same time, provide a definition of the knowledge that is implicit in a digital library. The theory is then translated into a Datalog program that, given a digital library, allows to efficiently complete the digital library with the knowledge implicit in it. The goal of our research is to contribute to the information management technology of digital libraries. In this way, we are able to demonstrate the theoretical feasibility of our digital library model, by showing that it can be efficiently implemented. Moreover, we demonstrate our model’s practical feasibility by providing a full translation of the model into RDF and of the query language into SPARQL. We provide a sound and complete calculus for reasoning on the RDF graphs resulting from translation. Based on this calculus, we prove the correctness of both translations, showing that the translation functions preserve the semantics of the digital library and of the query language
31
Mansouri, Farouk. "Integration des objets et des contraintes : cadre base sur les logiques terminologiques." Lyon, INSA, 1998. http://www.theses.fr/1998ISAL0079.
Full textAbstract:
C e travail porte sur l'étude de l'intégration des objets et des contraintes pour la modélisation des données spatiales. Le cadre de cette intégration est basé sur les logiques terminologiques. Dans la première partie de ce travail, nous présentons des notions de base utilisées dans le cadre des bases de données spatiales. Sont également présentés, les travaux qui ont utilisé les contraintes pour spécifier les données spatiales. Enfin, les logiques terminologiques et leur utilisation dans des applications de bases de données sont présentées. Dans la seconde partie, nous proposons le formalisme LCS qui est une logique terminologique étendue par de nouveaux constructeurs basés sur les contraintes pour la modélisation des données spatiales. Le formalisme LCS, est utilisé par la suite, pour la spécification de bases de connaissances spatiales. Un algorithme qui teste la satisfiabilité d'une base décrite à l'aide de LCS est présenté. Da ns la troisième parie, nous proposons un langage de règles basé su r une intégration du formalisme LCS et du langage 0atalog avec contraintes. Ce langage permet de faire du raisonnement spatial en permettant le calcul de relations spatiales qui existent entre les objets. Il est également utilisé pour la formulation de requêtes adressées à une base de connaissances LCSWe study the problem of integrating objects and constraints for modeling spatial data. The framework presented here rests on terminological logics. In the first part of this work, we present basic notions regarding spatial databases, research works dealing with constraints for modeling spatial data, and the use of terminological logics for database applications. In the second part, we propose formalism called Lcs, as an extension of description logic for capturing spatial dimension of data. Lcs is used for specifying spatial knowledge bases. An algorithm for checking the satisfiability of knowledge bases described by mean of LCs is presented. In the third part, we present a rule-based query language for querying such knowledge bases. The query language is a hybrid one in the sense that it integrates rule and constraint paradigms
32
Lagemann, Gerson Volney. "RBC para o problema de suporte ao cliente nas empresas de prestação de serviço de software :: o caso Datasul /." Florianópolis, SC, 1998. http://repositorio.ufsc.br/xmlui/handle/123456789/77875.
Full textAbstract:
Dissertação (Mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico.Made available in DSpace on 2012-10-17T08:18:34Z (GMT). No. of bitstreams: 0Bitstream added on 2016-01-08T23:59:27Z : No. of bitstreams: 1 147120.pdf: 3193617 bytes, checksum: 0783a524d3ddff7a77cfab976b79f4e9 (MD5)
33
Galland, Alban. "Distributed data management with access control : social Networks and Data of the Web." Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00640725.
Full textAbstract:
The amount of information on the Web is spreading very rapidly. Users as well as companies bring data to the network and are willing to share with others. They quickly reach a situation where their information is hosted on many machines they own and on a large number of autonomous systems where they have accounts. Management of all this information is rapidly becoming beyond human expertise. We introduce WebdamExchange, a novel distributed knowledge-base model that includes logical statements for specifying information, access control, secrets, distribution, and knowledge about other peers. These statements can be communicated, replicated, queried, and updated, while keeping track of time and provenance. The resulting knowledge guides distributed data management. WebdamExchange model is based on WebdamLog, a new rule-based language for distributed data management that combines in a formal setting deductiverules as in Datalog with negation, (to specify intensional data) and active rules as in Datalog:: (for updates and communications). The model provides a novel setting with a strong emphasis on dynamicity and interactions(in a Web 2.0 style). Because the model is powerful, it provides a clean basis for the specification of complex distributed applications. Because it is simple, it provides a formal framework for studying many facets of the problem such as distribution, concurrency, and expressivity in the context of distributed autonomous peers. We also discuss an implementation of a proof-of-concept system that handles all the components of the knowledge base and experiments with a lighter system designed for smartphones. We believe that these contributions are a good foundation to overcome theproblems of Web data management, in particular with respect to access control.
34
Kellner, Jony Roberto. "O processo de adaptação estratégica de uma empresa brasileira de software integrado de gestão empresarial : o estudo de caso da DATASUL." Universidade do Estado de Santa Catarina, 2007. http://tede.udesc.br/handle/handle/2134.
Full textAbstract:
Made available in DSpace on 2016-12-12T20:32:03Z (GMT). No. of bitstreams: 1
jony.pdf: 2214867 bytes, checksum: 61f4f2db4cd17a1187ea74d5a6acb987 (MD5)
Previous issue date: 2007-06-25Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
No presente trabalho de dissertação o autor descreve, analisa e conclui sobre a predominância dos tipos de adaptações estratégicas vivenciadas pela organização pesquisada ao longo de sua existência. Como estudo de caso de um único indivíduo, no formato de pesquisa-ação, foi pesquisada uma empresa brasileira de desenvolvimento e comercialização de softwares integradas de gestão empresarial: a Datasul, no período de 1978 a 2006, segundo o modelo de adaptações estratégicas de Herebenik e Joyce (1985). Fundada em 1978, a empresa pesquisada atua no setor de tecnologia de software, e está exposta continuamente a novas tendências tecnológicas e a ambientes competitivos agressivos a mundiais. Para efetuar a pesquisa, foi adotada a coleta de dados primários e secundários, com mais de uma técnica de coleta de dados, para avaliar, sem testes prévios, as convergências das observações feitas, por meio de observação participante e entrevistas semi-estruturadas com executivos de nível estratégico, pesquisas documentais e registros de arquivos. Com base na tabulação final, a vista do modelo escolhido, foram classificadas as diversas adaptações estratégicas adotadas pela empresa pesquisada, o que permitiu identificar a tipologia predominante das adaptações adotadas. A predominância encontrada foi a de adaptações estratégicas denominadas de seleção natural , na quais existe alto determinismo ambiental e baixa escolha estratégica. Como resultado final da pesquisa, ficou comprovado que, em empresas como a que foi foco da pesquisa, as escolhas estratégicas costumam ser mínimas e as adaptações ao ambiente são necessárias para que não ocorra a alienação competitiva.
35
Waller, Emmanuel. "Méthodes et bases de données." Paris 11, 1993. http://www.theses.fr/1993PA112481.
Full text
36
Antoine, Emilien. "Distributed data management with a declarative rule-based language webdamlog." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00933808.
Full textAbstract:
Our goal is to enable aWeb user to easily specify distributed data managementtasks in place, i.e. without centralizing the data to a single provider. Oursystem is therefore not a replacement for Facebook, or any centralized system,but an alternative that allows users to launch their own peers on their machinesprocessing their own local personal data, and possibly collaborating with Webservices.We introduce Webdamlog, a datalog-style language for managing distributeddata and knowledge. The language extends datalog in a numberof ways, notably with a novel feature, namely delegation, allowing peersto exchange not only facts but also rules. We present a user study thatdemonstrates the usability of the language. We describe a Webdamlog enginethat extends a distributed datalog engine, namely Bud, with the supportof delegation and of a number of other novelties of Webdamlog such as thepossibility to have variables denoting peers or relations. We mention noveloptimization techniques, notably one based on the provenance of facts andrules. We exhibit experiments that demonstrate that the rich features ofWebdamlog can be supported at reasonable cost and that the engine scales tolarge volumes of data. Finally, we discuss the implementation of a Webdamlogpeer system that provides an environment for the engine. In particular, a peersupports wrappers to exchange Webdamlog data with non-Webdamlog peers.We illustrate these peers by presenting a picture management applicationthat we used for demonstration purposes.
37
Thomazo, Michaël. "Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms." Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2013. http://tel.archives-ouvertes.fr/tel-00925722.
Full textAbstract:
L'objectif du problème appelé "Ontology-based data access" (OBDA) est d'améliorer la réponse à des requêtes en prenant en compte des connaissances d'ordre général durant l'évaluation des requêtes. Ces connaissances générales sont représentées à l'aide d'une ontologie, qui est exprimée dans cette thèse grâce à des formules logiques du premier ordre, appelées règles existentielles, et aussi connues sous le nom de "tuple-generating dependencies" et Datalog+/-. L'expressivité des formules utilisées est telle que l'évaluation de requêtes devient un problème indécidable, et cela a conduit la communauté à définir de nombreux cas décidables, c'est-à-dire des restrictions sur les ensembles de règles existentielles considérés. La contribution de cette thèse est double : tout d'abord, nous proposons une vue unifiée sur une grande fraction des cas décidables connus, et fournissons par là même une analyse de complexité et un algorithme optimal dans le pire des cas. Nous considérons également l'approche couramment utilisée de réécriture de requêtes, et proposons un algorithme générique qui permet de surmonter certaines causes évidentes d'explosion combinatoire qui rendent les approches classiques pratiquement inapplicables.
38
Lima, Sergio dos Santos. "Sistema de monitoramento de transformadores de distribuiÃÃo utilizando modelos tÃrmicos e tecnologias Java e Bluetooth." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=10132.
Full textAbstract:
FundaÃÃo Cearense de Apoio ao Desenvolvimento Cientifico e TecnolÃgicoEste trabalho apresenta o desenvolvimento e avaliaÃÃo de um sistema de monitoramento com tecnologia Java e Bluetooth para o auxilio no gerenciamento da condiÃÃo de transformadores de distribuiÃÃo a partir de modelos tÃrmicos. Sabe-se que monitorar a condiÃÃo dos transformadores tem sido objeto de preocupaÃÃo no que diz respeito a evitar as perdas econÃmicas causadas por falhas no equipamento e a consequente descontinuidade do serviÃo. à possÃvel, atravÃs da gestÃo do sistema: maximizar a vida Ãtil dos equipamentos monitorados; melhorar a confiabilidade da rede; reduzir os custos de manutenÃÃo. AtravÃs do levantamento bibliogrÃfico de sistemas de monitoramento atuais, de suas funcionalidades, em funÃÃo de recentes tecnologias de software e hardware, e do estudo de modelos tÃrmicos aplicados a transformadores, foi desenvolvido um sistema de coleta de dados e uma interface para anÃlise de dados. Este trabalho traz uma contribuiÃÃo para o desenvolvimento desses sistemas, propondo o uso de dispositivos mÃveis como uma estratÃgia economicamente viÃvel para coletar dados de transformadores de distribuiÃÃo, e a utilizaÃÃo dos dados coletados por estes dispositivos para gerar modelos tÃrmicos (das temperaturas do topo do Ãleo e do ponto quente) que permitam: (i) estabelecer limites mÃximos de carga para o equipamento, e (ii) estimar sua perda de vida Ãtil. Estas informaÃÃes fornecidas pelo sistema de monitoramento proposto devem servir como suporte à implementaÃÃo de planos de aÃÃo da concessionÃria de energia elÃtrica para: (i) a eventual substituiÃÃo de equipamentos, (ii) a adequaÃÃo na distribuiÃÃo das cargas, (iii) a priorizaÃÃo no caso de necessidade de atuaÃÃo do sistema de proteÃÃo.
This paper presents the development and evaluation of a monitoring system with Bluetooth and Java technology to aid managing the condition of distribution transformers through thermal models. It is well known that monitor the condition of transformers has been the subject of concern in relation to avoid economic losses caused by equipment failure. It is possible, through the system management: (i) maximize the life time of the monitored equipment, (ii) improve the reliability of the electrical grid and (iii) reduce its maintenance costs. Through a bibliographical survey of transformer condition monitoring systems and study of thermal models applied to transformers, was developed a system for data acquisition and an interface for data analysis. This work brings a contribution to the development of these systems, proposing the use of mobile devices as a viable strategy to collect data of distribution transformers and using data collected by those devices for generating thermal models (to estimate top-oil and hotspot temperature) that will let us: (i) establish maximum load for the equipment, and (ii) estimate the loss of life. The information provided by the condition monitoring system proposed should serve as support to electric utility company to implement action plans to help possible exchange of equipment, do a more balanced load in their distribution transformers and help prioritizing, in case of any necessary actuation of the system protection.
39
Andersson, Bengt, and Charlie Jarl. "Undervisningsmiljöer för IKT : En fallstudie av en specifik undervisningsmiljö för utbildning i informations och kommunikationsteknologi på gymnasienivå." Thesis, Högskolan Dalarna, Pedagogiskt arbete, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4626.
Full textAbstract:
Vi, två gymnasielärare, skriver denna fallstudie i syfte att klargöra hur vi tänkt, hur vi förändrat studiemiljön och studiesättet på ett datortekniskt program under åren 2005 till 2008. Vår ursprungliga tanke var att förbättra elevernas möjlighet att studera datortekniska ämnen. Dessa är ofta svåra att studera därför att man i normala fall inte alltid kan överblicka den kunskap man som elev behöver för att gå vidare. Vi har arbetat med mycket integration mellan olika tekniska ämnen och en stor frihet för eleverna att själva styra sitt sätt att arbeta. Vi har också ändrat den fysiska arbetsmiljön för eleverna på så sätt att de arbetar i en öppen kontorsliknande miljö med arbetsplatserna ställda i grupper. Eleverna har haft stor möjlighet att byta samarbetspartners och grupperingar. De har kunnat flytta runt på ett ganska fritt sätt. Även raster och pauser har hanterats på ett liknande fritt sätt. Vi har använt oss av andra pedagogers olika tankar och försökt att få en fungerande strategi för IKT-undervisning på elevernas egna villkor. Det klassrum som använts har i grunden förändrats för att erbjuda en så öppen och flexibel studiemiljö som möjligt. Ett urval frivilliga elever har därefter samarbetat i intervjuform för att hjälpa oss i vår utvärdering.
40
Stevens, Renaud. "Modulation Properties of Vertical Cavity Light Emitters." Doctoral thesis, Stockholm : Tekniska högsk, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3240.
Full text
41
Lacoste, Thierry. "Lois de convergence et lois 0-1 dans les structures aléatoires finies : une approche logique et finitiste." Paris 7, 1996. http://www.theses.fr/1996PA077080.
Full textAbstract:
La théorie des modèles finis est devenue un enjeu important de l'informatique. Les probabilités y jouent un rôle central, comme objet d'étude et comme méthode de preuve. En effet, elles conduisent aux notions de loi 0-1 et de convergence et autorisent des preuves d'existence particulièrement concises. Nous répondons à une question de Kolaitis et Vardi en donnant deux preuves finitistes de la loi 0-1 pour les énoncés de Bernays-Schönfinkel et Ackermann quantifiés existentiellement au second ordre. Nous établissons aussi la conjecture de ces auteurs sur l'incomparabilité du pouvoir d'expression de ces deux langages. Nous montrons que le problème de la frontière des lois 0-1 dans la logique du second ordre est intéressant. Nous formulons une conjecture donnant la position de cette frontière, et la prouvons en partie pour le deuxième niveau de la hiérarchie du second ordre. Nous fournissons aussi le tableau complet des lois 0-1 et de convergence de l'ensemble des propriétés monotones dans les graphes aléatoires pour la classe des probabilités d'arêtes la plus étudiée d'un point de vue logique. Nos résultats montrent que ces propriétés sont sensibles au double saut découvert par Erdös et Rényi, mais insensibles à la curieuse dichotomie rationnel / irrationnel obtenue par Shelah et Spencer pour la logique du premier ordre. Nous ouvrons ainsi l'étude des phénomènes de convergence de langages préservés par extension, comme DATALOG, pour des structures aléatoires peu denses, susceptibles de rendre compte de situations concrètes en informatique.
42
Bodirsky, Manuel. "Constraint satisfaction with infinite domains." Doctoral thesis, [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=973605413.
Full text
43
Oros, Hernandez Miguel Angel. "Conception, implantation et optimisation d'un langage à objets logiques." Bordeaux 1, 1995. http://www.theses.fr/1995BOR10599.
Full textAbstract:
En partant d'approches declaratives au probleme de l'extension de prolog a des objets, telles que les psi-termes de ait-kaci ou les termes a traits de backofen et smolka, nous proposons un nouveau langage d'acces logique incremental a des objets, qui est essentiellement une extension de datalog a des contraintes traduisant l'aspect objet. Nous etudions certains aspects d'optimisation, symbolique au niveau des contraintes, par rapport a une signature, physique au niveau des acces. Une restriction d'un langage ideal propose est implantee en common lisp sous le nom de u-log 3. Nous abordons egalement le probleme de la classification de predicats datalog, dans la perspective de pouvoir utiliser dans les contraintes des sortes ou des traits definis en logique, et pas simplement interpretes dans une base. Une methode exacte, basee sur la deduction naturelle, est proposee pour attaquer ce probleme indecidable, et implantee en prolog iii dans le prototype concept
44
Pavlacký, Tomáš. "VYPLNĚNÍ PRÁZDNA." Master's thesis, Vysoké učení technické v Brně. Fakulta výtvarných umění, 2017. http://www.nusl.cz/ntk/nusl-295734.
Full textAbstract:
I CREATED A SCULPTURE, WHICH IS A MATERIALISATION OF A DIGITAL MISTAKE, THAT IS CALLED DATAMOSH. FOR THE CREATION I USED CURRENT 3D TECHNOLOGIES. THE RESULT IS A SCULPTURE MADE OF PLASTER, POLYSTYRENE AND WOOD.
45
Arvedal, David. "Analyzing network monitoring systems and objects for a telecommunications company." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-35610.
Full textAbstract:
The goal with this thesis work has been to identify what a telecommunications company should monitor and to find a network monitoring system that can monitor these identified objects on two different platforms: Windows and Linux. The network monitoring system has been implemented in a telecommunications company’s environment and this thesis presents how the system monitors their environment. The subject for this thesis work is within network monitoring. The problem formulation has been answered by conducting a literature study and by testing network monitoring systems’ features in a lab environment. The sources used in the literature study consists of scientific articles and other articles found on the web. The lab environment consisted of virtual machines that runs Linux or Windows as an operating system. The purpose of the work was to enlighten Cellip in what objects they should monitor and to help the company to monitor them by implementing a network monitoring system. Cellip is a telecommunications company that provides IP-telephony services through Session Initiation Protocol. The limits of this thesis work are based on what their environment supports in terms of monitoring. Cellip’s environment consists of Linux and Windows servers, Cisco switches and firewalls, and Sonus Session Border Controllers. In summary, the result of this thesis gives the reader information about what a telecommunications company with a similar environment to Cellip should monitor, what three systems that can monitor these objects, which of the three systems that has most automatized features and finally how the chosen system Datadog monitors and presents the objects. Some of the objects that are important to monitor is: memory, disk storage, latency, packet loss. In conclusion, this thesis presents a monitoring baseline for telecommunication companies with a similar environment to Cellip.
46
Čelka, Marek. "Návrh a implementace informačního systému pro dohled." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2020. http://www.nusl.cz/ntk/nusl-417660.
Full textAbstract:
The main goal of the master thesis is design and implementation of information system for monitoring purposes. The implemented monitoring system will be able to automatically monitor devices of a certain company. This goal is preceded by strategic analysis using PEST and 7S methods for examination of current state of the company. Another part is the analysis of the efficiency of service processes using the HOS method together with the selection of a suitable monitoring system. An enhancement of service processes is designed by the Lewin model. Finally, the selected information system for monitoring was designed, implemented and tested. A deployment of the system should provide simplification of devices supervision, to save costs as well as to speed-up the response-time to unexpected situations.
47
Pattnaik, Aliva. "Fault propagation analysis of large-scale, networked embedded systems." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42918.
Full textAbstract:
In safety-critical, networked embedded systems, it is important that the way in which a fault(s) in one component of the system can propagate throughout the system to other components is analyzed correctly. Many real-world systems, such as modern aircrafts and automobiles, use large-scale networked embedded systems with complex behavior. In this work, we have developed techniques and a software tool, FauPA, that uses those techniques to automate fault-propagation analysis of large-scale, networked embedded systems such as those used in modern aircraft. This work makes three main contributions.
1. Fault propagation analyses. We developed algorithms for two types of analyses: forward analysis and backward analysis. For backward analysis, we developed two techniques: a naive algorithm and an algorithm that uses Datalog.
2. A system description language. We developed a language that we call Communication System Markup Language (CSML) based on XML. A system can be specified concisely and at a high-level in CSML.
3. A GUI-based display of the system and analysis results. We developed a GUI to visualize the system that is specified in CSML. The GUI also lets the user visualize the results of fault-propagation analyses.
48
Feliú, Gabaldón Marco Antonio. "Logic-based techniques for program analysis and specification synthesis." Doctoral thesis, Universitat Politècnica de València, 2013. http://hdl.handle.net/10251/33747.
Full textAbstract:
La Tesis investiga técnicas ágiles dentro del paradigma declarativo para dar solución a dos problemas: el análisis de programas y la inferencia de especificaciones a partir de programas escritos en lenguajes multiparadigma y en lenguajes imperativos con tipos, objetos, estructuras y punteros. Respecto al estado actual de la tesis, la parte de análisis de programas ya está consolidada, mientras que la parte de inferencia de especificaciones sigue en fase de desarrollo activo.
La primera parte da soluciones para la ejecución de análisis de punteros especificados en Datalog. En esta parte se han desarrollado dos técnicas de ejecución de especificaciones en dicho lenguaje Datalog: una de ellas utiliza resolutores de sistemas de ecuaciones booleanas, y la otra utiliza la lógica de reescritura implementada eficientemente en el lenguaje Maude.
La segunda parte desarrolla técnicas de inferencia de especificaciones a partir de programas. En esta parte se han desarrollado dos métodos de inferencia de especificaciones. El primer método se desarrolló para el lenguaje lógico-funcional Curry y permite inferir especificaciones ecuacionales mediante interpretación abstracta de los programas. El segundo método está siendo desarrollado para lenguajes imperativos realistas, y se ha aplicado a un subconjunto del lenguaje de programación C. Este método permite inferir especificaciones en forma de reglas que representan las distintas relaciones entre las propiedades que el estado de un programa satisface antes y después de su ejecución. Además, estas propiedades son expresables en términos de las abstracciones funcionales del propio programa, resultando en una especificación de muy alto nivel y, por lo tanto, de más fácil comprensión.Feliú Gabaldón, MA. (2013). Logic-based techniques for program analysis and specification synthesis [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/33747
TESIS
49
Antoine, Émilien. "Gestion des données distribuées avec le langage de règles: Webdamlog." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00908155.
Full textAbstract:
Notre but est de permettre à un utilisateur du Web d'organiser la gestion de ses données distribuées en place, c'est à dire sans l'obliger à centraliser ses données chez un unique hôte. Par conséquent, notre système diffère de Facebook et des autres systèmes centralisés, et propose une alternative permettant aux utilisateurs de lancer leurs propres pairs sur leurs machines gérant localement leurs données personnelles et collaborant éventuellement avec des services Web externes. Dans ma thèse, je présente Webdamlog, un langage dérivé de datalog pour la gestion de données et de connaissances distribuées. Le langage étend datalog de plusieurs manières, principalement avec une nouvelle propriété la délégation, autorisant les pairs à échanger non seulement des faits (les données) mais aussi des règles (la connaissance). J'ai ensuite mené une étude utilisateur pour démontrer l'utilisation du langage. Enfin je décris le moteur d'évaluation de Webdamlog qui étend un moteur d'évaluation de datalog distribué nommé Bud, en ajoutant le support de la délégation et d'autres innovations telles que la possibilité d'avoir des variables pour les noms de pairs et des relations. J'aborde de nouvelles techniques d'optimisation, notamment basées sur la provenance des faits et des règles. Je présente des expérimentations qui démontrent que le coût du support des nouvelles propriétés de Webdamlog reste raisonnable même pour de gros volumes de données. Finalement, je présente l'implémentation d'un pair Webdamlog qui fournit l'environnement pour le moteur. En particulier, certains adaptateurs permettant aux pairs Webdamlog d'échanger des données avec d'autres pairs sur Internet. Pour illustrer l'utilisation de ces pairs, j'ai implémenté une application de partage de photos dans un réseau social en Webdamlog.
50
Rissons, Angélique. "Caractérisation et modélisation optoélectronique de diodes laser à cavité verticale émettant par la surface (VCSEL)." École nationale supérieure de l'aéronautique et de l'espace (Toulouse ; 1972-2007), 2003. http://www.theses.fr/2003ESAE0011.
Full textAbstract:
Ce travail a consisté à étudier le comportement de VCSELs en régime statique et dynamique. Après avoir présenté la structure du VCSEL, nous avons établi un système d’équations d’évolution du nombre de porteurs et de photons incluant la contribution de l’émission verticale et des puits quantiques. Ces équations ont été résolues pour obtenir le nombre de photons et de porteurs en fonction d’un minimum de paramètres intrinsèques. La première étape expérimentale a porté sur la caractérisation statique de la diode laser afin de déterminer sa zone de fonctionnement. Nous nous sommes ensuite intéressés à la modélisation dynamique du VCSEL. Inspirés du schéma électrique équivalent petit signal d’une diode laser conventionnelle, nous avons établi celui d’un VCSEL en représentant ses particularités telles que la contribution des miroirs de Bragg et des puits quantiques sous forme de cellules RC parallèles. Le modèle a été élaboré en comparant les équations du circuit électrique équivalent et les équations d'évolution linéarisées. Les éléments parasites dus à la connectique et au support de test ont été ajoutés à ce modèle intrinsèque de puce laser. Finalement, la validation a été effectuée grâce aux mesures du paramètre S11 et du paramètre S21. Après avoir cherché à valider le modèle sur des VCSELs en boîtier, des résultats concluants ont été obtenus grâce a des mesures sous pointes sur des barrettes de VCSELs en structure implantée ou à diaphragme d’oxyde, ce qui nous a permis d’extraire des valeurs convenables pour les paramètres intrinsèques.