Search (5 results, page 1 of 1)

  • × type_ss:"el"
  • × theme_ss:"Auszeichnungssprachen"
  1. Pott, O.; Wielage, G.: XML Praxis und Referenz (2000) 0.01
    0.011398626 = product of:
      0.08738946 = sum of:
        0.04874661 = weight(_text_:buch in 6985) [ClassicSimilarity], result of:
          0.04874661 = score(doc=6985,freq=6.0), product of:
            0.109575786 = queryWeight, product of:
              4.64937 = idf(docFreq=1149, maxDocs=44218)
              0.023567878 = queryNorm
            0.4448666 = fieldWeight in 6985, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.64937 = idf(docFreq=1149, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6985)
        0.023930011 = weight(_text_:und in 6985) [ClassicSimilarity], result of:
          0.023930011 = score(doc=6985,freq=28.0), product of:
            0.052235067 = queryWeight, product of:
              2.216367 = idf(docFreq=13101, maxDocs=44218)
              0.023567878 = queryNorm
            0.45812157 = fieldWeight in 6985, product of:
              5.2915025 = tf(freq=28.0), with freq of:
                28.0 = termFreq=28.0
              2.216367 = idf(docFreq=13101, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6985)
        0.014712838 = weight(_text_:im in 6985) [ClassicSimilarity], result of:
          0.014712838 = score(doc=6985,freq=4.0), product of:
            0.066621356 = queryWeight, product of:
              2.8267863 = idf(docFreq=7115, maxDocs=44218)
              0.023567878 = queryNorm
            0.22084267 = fieldWeight in 6985, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              2.8267863 = idf(docFreq=7115, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6985)
      0.13043478 = coord(3/23)
    
    Abstract
    Mit wohl einem der faszinierendsten und innovativsten Themen der Gegenwart und allernächsten Zukunft des Internet befasst sich dieses Buch: XML. Nie als HTML-Ersatz gedacht, erweitert es das Spektrum möglicher Anwendungen im Internet einerseits und schließt andererseits klaffende Lücken und technische Unzulänglichkeiten. Keine Frage: Wer sich als Web-Administrator, Autor eines privaten oder geschäftlichen Internet-Auftritts, Intranet-Verantwortlicher oder -Anwender mit HTML auseinandergesetzt hat, wird in Zukunft auch um XML nicht umhinkommen. Auch außerhalb der Online-Szene hat sich XML bereits heute als richtungsweisender Standard des Dokumentenmanagements etabliert. Dieses Buch bietet das komplette XML- und XSL-Wissen auf praxisnahem und hohem Niveau. Neben einer fundierten Einführung finden Sie das komplette Know-how, stets belegt und beschrieben durch Praxisanwendungen, das Sie für die Arbeit mit XML benötigen. Mit viel Engagement und Zeitaufwand haben uns Firmen, Freunde, Mitarbeiter und der Markt & Technik-Verlag unterstützt. Unser Dank gilt daher all jenen, die ihren Anteil am Gelingen dieses Buches hatten und noch haben werden. In der zweiten völlig aktualisierten und stark erweiterten Ausgabe dieses Buches konnten wir zahlreiche positive Rückmeldungen von Leserinnen und Lesern berücksichtigen. So greift dieses Buch jetzt auch neueste Entwicklungen aus der XML-Entwicklung auf. Dazu gehören beispielsweise SMIL und WML (WAP) oder die erst im Dezember 1999 veröffentlichte X-HTML Empfehlung.
  2. Mayo, D.; Bowers, K.: ¬The devil's shoehorn : a case study of EAD to ArchivesSpace migration at a large university (2017) 0.00
    3.5022903E-4 = product of:
      0.008055268 = sum of:
        0.008055268 = product of:
          0.016110536 = sum of:
            0.016110536 = weight(_text_:29 in 3373) [ClassicSimilarity], result of:
              0.016110536 = score(doc=3373,freq=2.0), product of:
                0.08290443 = queryWeight, product of:
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.023567878 = queryNorm
                0.19432661 = fieldWeight in 3373, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5176873 = idf(docFreq=3565, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=3373)
          0.5 = coord(1/2)
      0.04347826 = coord(1/23)
    
    Date
    31. 1.2017 13:29:56
  3. Lee, M.; Baillie, S.; Dell'Oro, J.: TML: a Thesaural Markpup Language (200?) 0.00
    3.3368162E-4 = product of:
      0.007674677 = sum of:
        0.007674677 = weight(_text_:und in 1622) [ClassicSimilarity], result of:
          0.007674677 = score(doc=1622,freq=2.0), product of:
            0.052235067 = queryWeight, product of:
              2.216367 = idf(docFreq=13101, maxDocs=44218)
              0.023567878 = queryNorm
            0.14692576 = fieldWeight in 1622, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.216367 = idf(docFreq=13101, maxDocs=44218)
              0.046875 = fieldNorm(doc=1622)
      0.04347826 = coord(1/23)
    
    Theme
    Konzeption und Anwendung des Prinzips Thesaurus
  4. Christophides, V.; Plexousakis, D.; Scholl, M.; Tourtounis, S.: On labeling schemes for the Semantic Web (2003) 0.00
    2.0495258E-4 = product of:
      0.0047139092 = sum of:
        0.0047139092 = product of:
          0.0094278185 = sum of:
            0.0094278185 = weight(_text_:1 in 3393) [ClassicSimilarity], result of:
              0.0094278185 = score(doc=3393,freq=2.0), product of:
                0.057894554 = queryWeight, product of:
                  2.4565027 = idf(docFreq=10304, maxDocs=44218)
                  0.023567878 = queryNorm
                0.16284466 = fieldWeight in 3393, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  2.4565027 = idf(docFreq=10304, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3393)
          0.5 = coord(1/2)
      0.04347826 = coord(1/23)
    
    Abstract
    This paper focuses on the optimization of the navigation through voluminous subsumption hierarchies of topics employed by Portal Catalogs like Netscape Open Directory (ODP). We advocate for the use of labeling schemes for modeling these hierarchies in order to efficiently answer queries such as subsumption check, descendants, ancestors or nearest common ancestor, which usually require costly transitive closure computations. We first give a qualitative comparison of three main families of schemes, namely bit vector, prefix and interval based schemes. We then show that two labeling schemes are good candidates for an efficient implementation of label querying using standard relational DBMS, namely, the Dewey Prefix scheme [6] and an Interval scheme by Agrawal, Borgida and Jagadish [1]. We compare their storage and query evaluation performance for the 16 ODP hierarchies using the PostgreSQL engine.
  5. Miller, E.; Schloss. B.; Lassila, O.; Swick, R.R.: Resource Description Framework (RDF) : model and syntax (1997) 0.00
    1.19555676E-4 = product of:
      0.0027497804 = sum of:
        0.0027497804 = product of:
          0.005499561 = sum of:
            0.005499561 = weight(_text_:1 in 5903) [ClassicSimilarity], result of:
              0.005499561 = score(doc=5903,freq=2.0), product of:
                0.057894554 = queryWeight, product of:
                  2.4565027 = idf(docFreq=10304, maxDocs=44218)
                  0.023567878 = queryNorm
                0.09499271 = fieldWeight in 5903, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  2.4565027 = idf(docFreq=10304, maxDocs=44218)
                  0.02734375 = fieldNorm(doc=5903)
          0.5 = coord(1/2)
      0.04347826 = coord(1/23)
    
    Content
    RDF Data Model At the core of RDF is a model for representing named properties and their values. These properties serve both to represent attributes of resources (and in this sense correspond to usual attribute-value-pairs) and to represent relationships between resources. The RDF data model is a syntax-independent way of representing RDF statements. RDF statements that are syntactically very different could mean the same thing. This concept of equivalence in meaning is very important when performing queries, aggregation and a number of other tasks at which RDF is aimed. The equivalence is defined in a clean machine understandable way. Two pieces of RDF are equivalent if and only if their corresponding data model representations are the same. Table of contents 1. Introduction 2. RDF Data Model 3. RDF Grammar 4. Signed RDF 5. Examples 6. Appendix A: Brief Explanation of XML Namespaces