Search (7 results, page 1 of 1)

  • × classification_ss:"06.70 / Katalogisierung / Bestandserschließung"
  1. Kaushik, S.K.: DDC 22 : a practical approach (2004) 0.01
    0.011533844 = product of:
      0.069203064 = sum of:
        0.069203064 = weight(_text_:22 in 1842) [ClassicSimilarity], result of:
          0.069203064 = score(doc=1842,freq=14.0), product of:
            0.1690115 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04826377 = queryNorm
            0.4094577 = fieldWeight in 1842, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.03125 = fieldNorm(doc=1842)
      0.16666667 = coord(1/6)
    
    Abstract
    A system of library classification that flashed across the inquiring mind of young Melvil Louis Kossuth Dewey (known as Melvil Dewey) in 1873 is still the most popular classification scheme.. The modern library classification begins with Dewey Decimal Classification (DDC). Melvil Dewey devised DDC in 1876. DDC has is credit of 128 years of boudless success. The DDC is being taught as a practical subject throughout the world and it is being used in majority of libraries in about 150 countries. This is the result of continuous revision that 22nd Edition of DDC has been published in July 2003. No other classification scheme has published so many editions. Some welcome changes have been made in DDC 22. To reduce the Christian bias in 200 religion, the numbers 201 to 209 have been devoted to specific aspects of religion. In the previous editions these numbers were devoted to Christianity. to enhance the classifier's efficiency, Table 7 has been removed from DDC 22 and the provision of adding group of persons is made by direct use of notation already available in schedules and in notation -08 from Table 1 Standard Subdivision. The present book is an attempt to explain, with suitable examples, the salient provisions of DDC 22. The book is written in simple language so that the students may not face any difficulty in understanding what is being explained. The examples in the book are explained in a step-by-step procedure. It is hoped that this book will prove of great help and use to the library professionals in general and library and information science students in particular.
    Content
    1. Introduction to DDC 22 2. Major changes in DDC 22 3. Introduction to the schedules 4. Use of Table 1 : Standard Subdivisions 5. Use of Table 2 : Areas 6. Use of Table 3 : Subdivisions for the arts, for individual literatures, for specific literary forms 7. Use to Table 4 : Subdivisions of individual languages and language families 8. Use of Table 5 : Ethic and National groups 9. Use of Table 6 : Languages 10. Treatment of Groups of Persons
    Object
    DDC-22
  2. Traiser, W.: SWD-Sachgruppen : Leitfaden zu ihrer Vergabe (2000) 0.01
    0.008718766 = product of:
      0.052312598 = sum of:
        0.052312598 = weight(_text_:22 in 2280) [ClassicSimilarity], result of:
          0.052312598 = score(doc=2280,freq=2.0), product of:
            0.1690115 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04826377 = queryNorm
            0.30952093 = fieldWeight in 2280, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=2280)
      0.16666667 = coord(1/6)
    
    Date
    22. 3.2008 18:09:52
  3. Satija, M.P.: ¬A dictionary of knowledge organization (2004) 0.01
    0.008005621 = product of:
      0.04803372 = sum of:
        0.04803372 = weight(_text_:problem in 3111) [ClassicSimilarity], result of:
          0.04803372 = score(doc=3111,freq=2.0), product of:
            0.20485485 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.04826377 = queryNorm
            0.23447686 = fieldWeight in 3111, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3111)
      0.16666667 = coord(1/6)
    
    Abstract
    From classification to knowledge organization through subject indexing the field has been so rapidly growing that it is difficult to demarcate its boundaries. Knowledge organization is viewed in the sense of conglomeration of activities to sort and order knowledge, to acquire, ufilize, evaluate, represent and communicate knowledge for problem solving. It has been no simple matter to decide what should be included in and excluded from such a dictionary. Broadly speaking the terms an the following topics are included in the work : Knowledge, Epistemology, Concepts, Terminology and Vocabulary control ; Classification systems, their design, theory and practice of classification, Subject analysis; fundamental categories and facets, Content and Text analysis, Use of classification in online systems and an the web. Subject cataloguing : subject headings, Thesauri and alphabetical indexing languages : Keyword, chain and string indexes, Knowledge representation, Classification for access and retrieval, Cognitive aspects of information- seeking behaviour, Automatic classification, Descriptive cataloguing : Theory, kinds, levels, standards and codes, OPACs, all are covered in this work. Like any other such work of this sort, it is an electic compilation. The work proposes to be descriptive rather than prescriptive. Endeavour is to find brief simple, logical and consensual meaning of terms, and append brief description of a concept or an issue with explanation, examples and comments in a bottom up way. Some current topics denoted by phrases have also been included. At times it may give the look of a concise encyclopaedic dictionary. Terms fully describe concepts and methods, and may evoke some thoughts an current and classic issues in the field.
  4. Sehgal, R.L.: ¬An introduction to Dewey Decimal Classification (2005) 0.01
    0.0077063735 = product of:
      0.04623824 = sum of:
        0.04623824 = weight(_text_:22 in 1467) [ClassicSimilarity], result of:
          0.04623824 = score(doc=1467,freq=4.0), product of:
            0.1690115 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04826377 = queryNorm
            0.27358043 = fieldWeight in 1467, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1467)
      0.16666667 = coord(1/6)
    
    Date
    28. 2.2008 17:22:52
    Object
    DDC-22
  5. Greifeneder, E.: Online-Hilfen in OPACs : Analyse deutscher Universitäts-Onlinekataloge (2007) 0.01
    0.0054492294 = product of:
      0.032695375 = sum of:
        0.032695375 = weight(_text_:22 in 1935) [ClassicSimilarity], result of:
          0.032695375 = score(doc=1935,freq=2.0), product of:
            0.1690115 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04826377 = queryNorm
            0.19345059 = fieldWeight in 1935, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1935)
      0.16666667 = coord(1/6)
    
    Date
    22. 6.2008 13:03:30
  6. Geißelmann, F. (Hrsg.): Sacherschließung in Online-Katalogen (1994) 0.01
    0.005394462 = product of:
      0.03236677 = sum of:
        0.03236677 = weight(_text_:22 in 4360) [ClassicSimilarity], result of:
          0.03236677 = score(doc=4360,freq=4.0), product of:
            0.1690115 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04826377 = queryNorm
            0.19150631 = fieldWeight in 4360, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.02734375 = fieldNorm(doc=4360)
      0.16666667 = coord(1/6)
    
    Date
    15. 7.2018 16:22:16
    Footnote
    Rez. in: Mitteilungen VÖB 48(1995) H.1, S.66-68 (K. Niedermair) - Vgl. auch Lepsky, K. in: Bibliotheksdienst 29(1995) H.3, S.500-519; Bibliothek: Forschung u. Praxis 19(1995) H.2, S.251-254 (G. Hartwieg; auch in: LDV-Forum Bd. 12, Nr. 2, Jg. 1995, S.22-29 [unter: http://www.jlcl.org/1995_Heft2/Rezensionen_19-27.pdf]) .
  7. Langville, A.N.; Meyer, C.D.: Google's PageRank and beyond : the science of search engine rankings (2006) 0.00
    0.0048033725 = product of:
      0.028820235 = sum of:
        0.028820235 = weight(_text_:problem in 6) [ClassicSimilarity], result of:
          0.028820235 = score(doc=6,freq=2.0), product of:
            0.20485485 = queryWeight, product of:
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.04826377 = queryNorm
            0.14068612 = fieldWeight in 6, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.244485 = idf(docFreq=1723, maxDocs=44218)
              0.0234375 = fieldNorm(doc=6)
      0.16666667 = coord(1/6)
    
    Content
    Inhalt: Chapter 1. Introduction to Web Search Engines: 1.1 A Short History of Information Retrieval - 1.2 An Overview of Traditional Information Retrieval - 1.3 Web Information Retrieval Chapter 2. Crawling, Indexing, and Query Processing: 2.1 Crawling - 2.2 The Content Index - 2.3 Query Processing Chapter 3. Ranking Webpages by Popularity: 3.1 The Scene in 1998 - 3.2 Two Theses - 3.3 Query-Independence Chapter 4. The Mathematics of Google's PageRank: 4.1 The Original Summation Formula for PageRank - 4.2 Matrix Representation of the Summation Equations - 4.3 Problems with the Iterative Process - 4.4 A Little Markov Chain Theory - 4.5 Early Adjustments to the Basic Model - 4.6 Computation of the PageRank Vector - 4.7 Theorem and Proof for Spectrum of the Google Matrix Chapter 5. Parameters in the PageRank Model: 5.1 The a Factor - 5.2 The Hyperlink Matrix H - 5.3 The Teleportation Matrix E Chapter 6. The Sensitivity of PageRank; 6.1 Sensitivity with respect to alpha - 6.2 Sensitivity with respect to H - 6.3 Sensitivity with respect to vT - 6.4 Other Analyses of Sensitivity - 6.5 Sensitivity Theorems and Proofs Chapter 7. The PageRank Problem as a Linear System: 7.1 Properties of (I - alphaS) - 7.2 Properties of (I - alphaH) - 7.3 Proof of the PageRank Sparse Linear System Chapter 8. Issues in Large-Scale Implementation of PageRank: 8.1 Storage Issues - 8.2 Convergence Criterion - 8.3 Accuracy - 8.4 Dangling Nodes - 8.5 Back Button Modeling

Languages

Types