Search (6 results, page 1 of 1)

  • × author_ss:"Lazinger, S.S."
  • × year_i:[1990 TO 2000}
  1. Lazinger, S.S.: To merge or not to merge : Israel's Union List of Monographs in the context of merging algorithms (1994) 0.03
    0.026575929 = product of:
      0.053151857 = sum of:
        0.053151857 = sum of:
          0.009471525 = weight(_text_:a in 3100) [ClassicSimilarity], result of:
            0.009471525 = score(doc=3100,freq=8.0), product of:
              0.053105544 = queryWeight, product of:
                1.153047 = idf(docFreq=37942, maxDocs=44218)
                0.046056706 = queryNorm
              0.17835285 = fieldWeight in 3100, product of:
                2.828427 = tf(freq=8.0), with freq of:
                  8.0 = termFreq=8.0
                1.153047 = idf(docFreq=37942, maxDocs=44218)
                0.0546875 = fieldNorm(doc=3100)
          0.043680333 = weight(_text_:22 in 3100) [ClassicSimilarity], result of:
            0.043680333 = score(doc=3100,freq=2.0), product of:
              0.16128273 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.046056706 = queryNorm
              0.2708308 = fieldWeight in 3100, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.0546875 = fieldNorm(doc=3100)
      0.5 = coord(1/2)
    
    Abstract
    ALEPH, Israel's research library network, was implemented as a highly decentralized network consisting of nearly 30 different files and no union catalogue. To solve the problem of searching these separate files, the Union List of Monographs was implemented in 1991. In reality, neither a union list nor confined to monographs, the Union List of Monographs is, in effect, a union index for locating bibliographic items by author or title, in order to ascertain where they can be found without searching each library's file separately. Reviews the literature of merging files and records, and describes the development of an algorithm for producing the Union List of Monographs
    Date
    22. 2.1999 13:00:54
    Type
    a
  2. Lazinger, S.S.; Peritz, B.C.: Reader use of a nationwide research library network : local OPAC vs. remote files (1991) 0.02
    0.022779368 = product of:
      0.045558736 = sum of:
        0.045558736 = sum of:
          0.008118451 = weight(_text_:a in 3013) [ClassicSimilarity], result of:
            0.008118451 = score(doc=3013,freq=8.0), product of:
              0.053105544 = queryWeight, product of:
                1.153047 = idf(docFreq=37942, maxDocs=44218)
                0.046056706 = queryNorm
              0.15287387 = fieldWeight in 3013, product of:
                2.828427 = tf(freq=8.0), with freq of:
                  8.0 = termFreq=8.0
                1.153047 = idf(docFreq=37942, maxDocs=44218)
                0.046875 = fieldNorm(doc=3013)
          0.037440285 = weight(_text_:22 in 3013) [ClassicSimilarity], result of:
            0.037440285 = score(doc=3013,freq=2.0), product of:
              0.16128273 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.046056706 = queryNorm
              0.23214069 = fieldWeight in 3013, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.046875 = fieldNorm(doc=3013)
      0.5 = coord(1/2)
    
    Abstract
    The primary objective of the present study was to exmine whether readers conducting bibliographic searches in ALEPH - Israel's research library network - tend to search only within the OPAC of the library within which they are working or whether they access the remote OPACs of other libraries. The ALEPH network has a dezentralized database. Therefore, it was possible to examine this question because each library has its own access code and each database can be searched separately. The data were collected by means of a one-page questionnaire lefr beside each terminal in the library of the Graduate School of Library and Archive Studies of the Hebrew University of Jerusalem during an entire academic years. results of analysis of the data collected in this survey are presented in 6 tables
    Date
    22. 2.1999 13:06:18
    Type
    a
  3. Lazinger, S.S.; Peritz, B.C.; Bar-Ilan, J.: Using a local area network as an interface to wide area networks in library and information science education (1993) 0.00
    0.0028703054 = product of:
      0.005740611 = sum of:
        0.005740611 = product of:
          0.011481222 = sum of:
            0.011481222 = weight(_text_:a in 7125) [ClassicSimilarity], result of:
              0.011481222 = score(doc=7125,freq=4.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.2161963 = fieldWeight in 7125, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.09375 = fieldNorm(doc=7125)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Type
    a
  4. Shoham, S.; Lazinger, S.S.: ¬The no-main-entry principle and the automated catalog (1991) 0.00
    0.0026849252 = product of:
      0.0053698504 = sum of:
        0.0053698504 = product of:
          0.010739701 = sum of:
            0.010739701 = weight(_text_:a in 507) [ClassicSimilarity], result of:
              0.010739701 = score(doc=507,freq=14.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.20223314 = fieldWeight in 507, product of:
                  3.7416575 = tf(freq=14.0), with freq of:
                    14.0 = termFreq=14.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046875 = fieldNorm(doc=507)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    The No-Main-Entry Principle and the accompanying Description-Idependent System of cataloging, described in a 1989 article by Takawashi, Shihota and Oshiro, is analyzed in relation to the online catalog. The development of the main entry concept, from the time of the single entry catalog to the advent of the automated catalog is described. The relation between the available technologies of the time and the main entry concept is explored. Although the necessity for a main entry, or full cataloging record, in a single entry catalog is acknowledged, it is suggested that in an automated catalog it is no longer relevant. A recommendation that libraries with online catalogs explore the possibilities of cataloging according to the no-main-entry principle is accompanied by a stateement of the advantage of such a system and suggestions for implementing it.
    Type
    a
  5. Lazinger, S.S.; Bar-Ilan, J.; Peritz, B.C.: Internet use by faculty members in various disciplines : a comparative case study (1997) 0.00
    0.0023678814 = product of:
      0.0047357627 = sum of:
        0.0047357627 = product of:
          0.009471525 = sum of:
            0.009471525 = weight(_text_:a in 390) [ClassicSimilarity], result of:
              0.009471525 = score(doc=390,freq=8.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.17835285 = fieldWeight in 390, product of:
                  2.828427 = tf(freq=8.0), with freq of:
                    8.0 = termFreq=8.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=390)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Examines and compares the use of the Internet among various sectors of the faculty at the Hebrew University of Jerusalem, Israel, in order to verify the influence of a number of parameters on this use. Questionnaires were sent to faculty members in all departments and professional schools of the Hebrew University of Jerusalem, a total population of 918 for both the pilot project and the main study. Results indicated that Internet use is consistently higher among faculty members in the sciences and agriculture than among those in the humanities or social sciences. Makes suggestions for training the level of Internet use among the various disciplines of the faculty
    Type
    a
  6. Meir, D.D.; Lazinger, S.S.: Measuring the performance of a merging algorithm : mismatches, missed-matches, and overlap in Israel's union list (1998) 0.00
    0.002269176 = product of:
      0.004538352 = sum of:
        0.004538352 = product of:
          0.009076704 = sum of:
            0.009076704 = weight(_text_:a in 3382) [ClassicSimilarity], result of:
              0.009076704 = score(doc=3382,freq=10.0), product of:
                0.053105544 = queryWeight, product of:
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046056706 = queryNorm
                0.1709182 = fieldWeight in 3382, product of:
                  3.1622777 = tf(freq=10.0), with freq of:
                    10.0 = termFreq=10.0
                  1.153047 = idf(docFreq=37942, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3382)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Reports results of a survey, undertaken in 1996, to measure the performance of the merging algorithm used to generate the now defunct ALEPH ULM (Union List of Monographs) file. Results showed that although the algorithm created almost no mismatches that would have led to the loss of information, it had a greater proportion of missed matches than was anticipated, especially when matching Hebrew bibliographic records. Discusses the central issues inherent in automatic detection and merging of duplicate records, as well as the main methodologies for measuring the performance of merging algorithms. Recommendations include integrating testing procedures into the initial specifications for any future algorithms and deciding on a performance threshold that the algorithm must exceed in order to be put to use
    Type
    a