Search (8 results, page 1 of 1)

  • × author_ss:"Liu, S."
  1. Liu, S.: Decomposing DDC synthesized numbers (1997) 0.01
    0.006258954 = product of:
      0.05007163 = sum of:
        0.05007163 = weight(_text_:computer in 5968) [ClassicSimilarity], result of:
          0.05007163 = score(doc=5968,freq=4.0), product of:
            0.1461475 = queryWeight, product of:
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.039991006 = queryNorm
            0.34261024 = fieldWeight in 5968, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.046875 = fieldNorm(doc=5968)
      0.125 = coord(1/8)
    
    Abstract
    Some empirical studies have explored the direct use of traditional classification schemes in the online environment; none has manipulated these manual classifications in such a way as to take full advantage of the power of both the classification and computer. It has been suggested that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. Looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decompositions for informational retrieval. 1.701 sythesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer). 600 were randomly selected for examination by 3 judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development and other important areas of cataloguing and classification
  2. Liu, S.: Decomposing DDC synthesized numbers (1996) 0.01
    0.0052157952 = product of:
      0.041726362 = sum of:
        0.041726362 = weight(_text_:computer in 5969) [ClassicSimilarity], result of:
          0.041726362 = score(doc=5969,freq=4.0), product of:
            0.1461475 = queryWeight, product of:
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.039991006 = queryNorm
            0.28550854 = fieldWeight in 5969, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5969)
      0.125 = coord(1/8)
    
    Abstract
    Much literature has been written speculating upon how classification can be used in online catalogs to improve information retrieval. While some empirical studies have been done exploring whether the direct use of traditional classification schemes designed for a manual environment is effective and efficient in the online environment, none has manipulated these manual classifications in such a w ay as to take full advantage of the power of both the classification and computer. It has been suggested by some authors, such as Wajenberg and Drabenstott, that this power could be realized if the individual components of synthesized DDC numbers could be identified and indexed. This paper looks at the feasibility of automatically decomposing DDC synthesized numbers and the implications of such decomposition for information retrieval. Based on an analysis of the instructions for synthesizing numbers in the main class Arts (700) and all DDC Tables, 17 decomposition rules were defined, 13 covering the Add Notes and four the Standard Subdivisions. 1,701 DDC synthesized numbers were decomposed by a computer system called DND (Dewey Number Decomposer), developed by the author. From the 1,701 numbers, 600 were randomly selected fo r examination by three judges, each evaluating 200 numbers. The decomposition success rate was 100% and it was concluded that synthesized DDC numbers can be accurately decomposed automatically. The study has implications for information retrieval, expert systems for assigning DDC numbers, automatic indexing, switching language development, enhancing classifiers' work, teaching library school students, and providing quality control for DDC number assignments. These implications were explored using a prototype retrieval system.
  3. Wu, S.; Liu, S.; Wang, Y.; Timmons, T.; Uppili, H.; Bedrick, S.; Hersh, W.; Liu, H,: Intrainstitutional EHR collections for patient-level information retrieval (2017) 0.00
    0.0044614105 = product of:
      0.035691284 = sum of:
        0.035691284 = product of:
          0.07138257 = sum of:
            0.07138257 = weight(_text_:resources in 3925) [ClassicSimilarity], result of:
              0.07138257 = score(doc=3925,freq=6.0), product of:
                0.14598069 = queryWeight, product of:
                  3.650338 = idf(docFreq=3122, maxDocs=44218)
                  0.039991006 = queryNorm
                0.48898637 = fieldWeight in 3925, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  3.650338 = idf(docFreq=3122, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=3925)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Abstract
    Research in clinical information retrieval has long been stymied by the lack of open resources. However, both clinical information retrieval research innovation and legitimate privacy concerns can be served by the creation of intrainstitutional, fully protected resources. In this article, we provide some principles and tools for information retrieval resource-building in the unique problem setting of patient-level information retrieval, following the tradition of the Cranfield paradigm. We further include an analysis of parallel information retrieval resources at Oregon Health & Science University and Mayo Clinic that were built on these principles.
  4. Liu, S.; Shen, Z.: ¬The development of cataloging in China (2002) 0.00
    0.004425749 = product of:
      0.035405993 = sum of:
        0.035405993 = weight(_text_:computer in 5486) [ClassicSimilarity], result of:
          0.035405993 = score(doc=5486,freq=2.0), product of:
            0.1461475 = queryWeight, product of:
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.039991006 = queryNorm
            0.24226204 = fieldWeight in 5486, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.046875 = fieldNorm(doc=5486)
      0.125 = coord(1/8)
    
    Abstract
    With a long history, cataloging has evolved with changes in society, economy, and technology in China. This paper presents Chinese cataloging history in four parts, with emphasis on the last two parts: the founding of the People's Republic of China in 1949 and the development of cataloging after 1979 when China opened its doors to the world. Particularly important has been the rapid growth of online cataloging in recent years. The China Academic Library and Information System (CALIS), as a successful online cataloging model, is emphasized. Through investigation of the entire history of Chinese cataloging, three distinct features can be stated: (1) Standardization- switching from the Chinese traditional way to aligning with international standards, (2) Cooperation-from decentralized and self-supporting systems to sharing systems, (3) Computerization and networking-from manual operation to computer-based online operation. At the end of this paper, a set of means by which to enhance online cataloging and resource sharing is suggested.
  5. Cao, N.; Sun, J.; Lin, Y.-R.; Gotz, D.; Liu, S.; Qu, H.: FacetAtlas : Multifaceted visualization for rich text corpora (2010) 0.00
    0.0036881242 = product of:
      0.029504994 = sum of:
        0.029504994 = weight(_text_:computer in 3366) [ClassicSimilarity], result of:
          0.029504994 = score(doc=3366,freq=2.0), product of:
            0.1461475 = queryWeight, product of:
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.039991006 = queryNorm
            0.20188503 = fieldWeight in 3366, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6545093 = idf(docFreq=3109, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3366)
      0.125 = coord(1/8)
    
    Source
    IEEE Transactions on Visualization and Computer Graphics. InfoVis 2010. [http://systemg.research.ibm.com/apps/facetatlas/cao_infovis10_paper.pdf]
  6. Liu, S.; Svenonius, E.: DORS: DDC online retrieval system (1991) 0.00
    0.0029437675 = product of:
      0.02355014 = sum of:
        0.02355014 = product of:
          0.04710028 = sum of:
            0.04710028 = weight(_text_:resources in 1155) [ClassicSimilarity], result of:
              0.04710028 = score(doc=1155,freq=2.0), product of:
                0.14598069 = queryWeight, product of:
                  3.650338 = idf(docFreq=3122, maxDocs=44218)
                  0.039991006 = queryNorm
                0.32264733 = fieldWeight in 1155, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.650338 = idf(docFreq=3122, maxDocs=44218)
                  0.0625 = fieldNorm(doc=1155)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Source
    Library resources and technical services. 35(1991), S.359-375
  7. Svenonius, E.; Liu, S.; Subrahmanyam, B.: Automation of chain indexing (1992) 0.00
    0.0022078257 = product of:
      0.017662605 = sum of:
        0.017662605 = product of:
          0.03532521 = sum of:
            0.03532521 = weight(_text_:resources in 2114) [ClassicSimilarity], result of:
              0.03532521 = score(doc=2114,freq=2.0), product of:
                0.14598069 = queryWeight, product of:
                  3.650338 = idf(docFreq=3122, maxDocs=44218)
                  0.039991006 = queryNorm
                0.2419855 = fieldWeight in 2114, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.650338 = idf(docFreq=3122, maxDocs=44218)
                  0.046875 = fieldNorm(doc=2114)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Abstract
    The last several years have seen the evolution of prototype systems exploiting the use of the Dewey Decimal Classification (DDC) as an interface to online catalogs. One such system, calles DORS (Dewy Online Retrieval System) was developed at the University of California, Los Angeles by the authors. The feature distinguishing this system is an automatically generated chain index, in particular the algorithms that were created for its automatic generation and the problems that were encountered. The problems were of three kinds: those that were overcome, but were not for lack of time and resources and those that we believe cannot be overcome. The paper concludes with suggestions for future resaerch and possible formatting changes to the DDC feature headings that would facilitate chain-index generation
  8. Liu, S.; Chen, C.: ¬The differences between latent topics in abstracts and citation contexts of citing papers (2013) 0.00
    0.0016931967 = product of:
      0.013545574 = sum of:
        0.013545574 = product of:
          0.027091147 = sum of:
            0.027091147 = weight(_text_:22 in 671) [ClassicSimilarity], result of:
              0.027091147 = score(doc=671,freq=2.0), product of:
                0.1400417 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.039991006 = queryNorm
                0.19345059 = fieldWeight in 671, 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=671)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Date
    22. 3.2013 19:50:00