Search (7 results, page 1 of 1)

0.016993519 = product of:
  0.08496759 = sum of:
    0.08496759 = weight(_text_:22 in 4857) [ClassicSimilarity], result of:
      0.08496759 = score(doc=4857,freq=2.0), product of:
        0.18300882 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052260913 = queryNorm
        0.46428138 = fieldWeight in 4857, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.09375 = fieldNorm(doc=4857)
  0.2 = coord(1/5)

Date

8. 7.2000 18:17:22

0.016993519 = product of:
  0.08496759 = sum of:
    0.08496759 = weight(_text_:22 in 5256) [ClassicSimilarity], result of:
      0.08496759 = score(doc=5256,freq=2.0), product of:
        0.18300882 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.052260913 = queryNorm
        0.46428138 = fieldWeight in 5256, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.09375 = fieldNorm(doc=5256)
  0.2 = coord(1/5)

Date

3.10.2000 10:22:59

0.015456363 = product of:
  0.07728181 = sum of:
    0.07728181 = weight(_text_:it in 6215) [ClassicSimilarity], result of:
      0.07728181 = score(doc=6215,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.51128453 = fieldWeight in 6215, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.125 = fieldNorm(doc=6215)
  0.2 = coord(1/5)

0.013524316 = product of:
  0.06762158 = sum of:
    0.06762158 = weight(_text_:it in 6234) [ClassicSimilarity], result of:
      0.06762158 = score(doc=6234,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.44737396 = fieldWeight in 6234, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.109375 = fieldNorm(doc=6234)
  0.2 = coord(1/5)

Abstract

The Catalog of the Air University Library was reformed in 1956. It is an example for reforming.

0.010039202 = product of:
  0.050196007 = sum of:
    0.050196007 = weight(_text_:it in 1654) [ClassicSimilarity], result of:
      0.050196007 = score(doc=1654,freq=6.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.33208904 = fieldWeight in 1654, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.046875 = fieldNorm(doc=1654)
  0.2 = coord(1/5)

Abstract

A classification is a theory of the structure of knowledge. From a discussion of the nature of truth, it is held that scientific knowledge is the only knowledge which can be regarded as true. The method of induction from empirical data is therefore applied to the construction of a classification. Items of knowledge are divided into uniquely definable terms, called isolates, and the relations between them, called operators. It is shown that only four basic operators exist, expressing appurtenance, equivalence, reaction and causation; using symbols for these operators, all subjects can be analysed in a linear form called an analet. With the addition of the permissible permutations of such analets, formed according to simple rules, alphabetical arrangement of the first terms provide a complete, logical subject index. Examples are given, and possible difficulties are considered. A classification can then be constructed by selection of deductive relations, arranged in hierarchical form. The nature of possible classifications is discussed. It is claimed that such an inductively constructed classification is the only true representation of the structure of knowledge, and that these principles provide a simple technique for accurately and fully indexing and classifying any given set of data, with complete flexibility

0.004830113 = product of:
  0.024150565 = sum of:
    0.024150565 = weight(_text_:it in 2472) [ClassicSimilarity], result of:
      0.024150565 = score(doc=2472,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.15977642 = fieldWeight in 2472, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2472)
  0.2 = coord(1/5)

Abstract

A medium-length book, based on lectures, aimed at classificationists, not cataloguers or classifiers. Ranganathan begins with his Five Laws and a definition of classification and its purposes. He gives a list of 108 subjects in "unhelpful alphabetical sequence" and shows how they can be grouped into subjects, and then how each each subject's terms can be organized in a helpful and useful way, thereby demonstrating and building up his basic canons, postulates, and principles of classification. All of that, roughly the first half of the book, will be of interest to anyone starting to make classification systems. It has all of what makes Ranganathan's work so delightful to read: his unending concern for the user, his deep thought, and his warmth, humour, and spirituality. The second half of the book, however, has what can make his work difficult: his unyielding belief that the Colon Classification is the only system worth using. The reader will not be very interested in repeatedly classifying books under various systems and then reversing the process to see how closely the call number matches the subject. However, the reader can take the ideas so clearly presented in the first half of the book and then veer off to build his or her own system, while remembering that if his classification laws are likened to Euclid's laws of geometry, there is no room for a Riemann or Lobachevksy in Ranganathan's strict world.

0.004830113 = product of:
  0.024150565 = sum of:
    0.024150565 = weight(_text_:it in 3369) [ClassicSimilarity], result of:
      0.024150565 = score(doc=3369,freq=2.0), product of:
        0.15115225 = queryWeight, product of:
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.052260913 = queryNorm
        0.15977642 = fieldWeight in 3369, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.892262 = idf(docFreq=6664, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3369)
  0.2 = coord(1/5)

Abstract

In distinction to current Theory of Communication which treats amount of information as a measure of the statistical rarity of a message, a Theory of Semantic Information is outlined, in which the concept of information carried by a sentence within a given language system is treated as synonymous with the content of this sentence, normalized in a certain way, and the concept of amount of semantic information is explicated by various measures of this content, all based on logical probability functions ranging over the contents. Absolute and relative measures are distinguished, so are D-functions suitable for contexts where deductive reasoning alone is relevant and I-functions suitable for contexts where inductive reasoning is adequate. Of the two major types of amount of information investigated, the one, cont, is additive with respect to sentences whose contents are exclusive, the other, inf, with respect to sentences which are inductively independent. The latter turns out to be formally analogous to the customary information measure function. Various estimate functions of amount of information are investigated leading to generalized semantic correlates of concepts and theorems of current Communication Theory. A concept of semantic noise is tentatively defined, so are efficiency and redundancy of the conceptual framework of a language system. It is suggested that semantic information is a concept more readily applicable to psychological and other investigations than its communicational counterpart.