Sökning: "completion"

Visar resultat 1 - 5 av 367 avhandlingar innehållade ordet completion.

1. 1. Completion of Ontologies and Ontology Networks

   Författare :Zlatan Dragisic; Patrick Lambrix; Nahid Shahmehri; Marco Kuhlmann; Fang Wei-Kleiner; Erhard Rahm; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; knowledge representation; ontology; ontology engineering; ontology debugging; ontology completion; ontology matching; description logics;

   Sammanfattning : The World Wide Web contains large amounts of data, and in most cases this data has no explicit structure. The lack of structure makes it difficult for automated agents to understand and use such data. A step towards a more structured World Wide Web is the Semantic Web, which aims at introducing semantics to data on the World Wide Web. LÄS MER

3. 2. Exact completion and type-theoretic structures

   Författare :Jacopo Emmenegger; Erik Palmgren; Alexander Berglund; Maria Emilia Maietti; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; exact completion; type theory; setoid; weak limits; cartesian closure; inductive types; Mathematics; matematik;

   Sammanfattning : This thesis consists of four papers and is a contribution to the study of representations of extensional properties in intensional type theories using, mainly, the language and tools from category theory. Our main focus is on exact completions of categories with weak finite limits as a category-theoretic description of the setoid construction in Martin-Löf's intensional type theory. LÄS MER

4. 3. Colonoscopy : Introduction and development, completion rates, complications and cancer detection

   Författare :George Dafnis; Uppsala universitet; []
   Nyckelord :MEDICIN OCH HÄLSOVETENSKAP; MEDICAL AND HEALTH SCIENCES; Surgery; Colonoscopy; population-based; indications; completion rates; complications; colorectal cancer; sensitivity; Kirurgi; Surgery; Kirurgi; Surgery; kirurgi;

   Sammanfattning : In a population-based study in the county of Södermanland, 6066 colonoscopies performed in 4304 patients from 1979 to 1995 inclusive were evaluated. As indications, bleeding increased and polyps and unclear x-ray findings decreased. Surveillance (cancer, polyps, colitis) was fairly stable. LÄS MER

5. 4. Computational Issues in Calculi of Partial Inductive Definitions

   Författare :Per Kreuger; RISE; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Theory of computation; algorithms; logic; proof-theory; partial inductive defi-nitions; definitional reflection; disunification; closure; completion; negation; constructive negation; quantification; logic programming; meta programming; quantification; skolemization; self-reference; program semantics; declarative control; proof-search; theorem-proving.;

   Sammanfattning : We study the properties of a number of algorithms proposed to explore the computational space generated by a very simple and general idea: the notion of a mathematical definition and a number of suggested formal interpretations ofthis idea. Theories of partial inductive definitions (PID) constitute a class of logics based on the notion of an inductive definition. LÄS MER

7. 5. Rank Reduction with Convex Constraints

   Författare :Christian Grussler; Institutionen för reglerteknik; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; low-rank approximation; model reduction; non-convex optimization; Douglas-Rachford; matrix completion; overlapping norm; k-support norm; atomic norm;

   Sammanfattning : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. LÄS MER