Search (4919 results, page 2 of 246)

0.08648322 = product of:
  0.17296644 = sum of:
    0.17296644 = sum of:
      0.13810499 = weight(_text_:network in 4189) [ClassicSimilarity], result of:
        0.13810499 = score(doc=4189,freq=12.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.6026149 = fieldWeight in 4189, product of:
            3.4641016 = tf(freq=12.0), with freq of:
              12.0 = termFreq=12.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=4189)
      0.034861445 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
        0.034861445 = score(doc=4189,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 4189, 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=4189)
  0.5 = coord(1/2)

Abstract

Effective patent management is essential for organizations to maintain their competitive advantage. The classification of patents is a critical part of patent management and industrial analysis. This study proposes a hybrid-patent-classification approach that combines a novel patent-network-based classification method with three conventional classification methods to analyze query patents and predict their classes. The novel patent network contains various types of nodes that represent different features extracted from patent documents. The nodes are connected based on the relationship metrics derived from the patent metadata. The proposed classification method predicts a query patent's class by analyzing all reachable nodes in the patent network and calculating their relevance to the query patent. It then classifies the query patent with a modified k-nearest neighbor classifier. To further improve the approach, we combine it with content-based, citation-based, and metadata-based classification methods to develop a hybrid-classification approach. We evaluate the performance of the hybrid approach on a test dataset of patent documents obtained from the U.S. Patent and Trademark Office, and compare its performance with that of the three conventional methods. The results demonstrate that the proposed patent-network-based approach yields more accurate class predictions than the patent network-based approach.

Date

22. 1.2011 13:04:21

0.085542485 = sum of:
  0.06811176 = product of:
    0.20433527 = sum of:
      0.20433527 = weight(_text_:3a in 3577) [ClassicSimilarity], result of:
        0.20433527 = score(doc=3577,freq=2.0), product of:
          0.43628904 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.05146125 = queryNorm
          0.46834838 = fieldWeight in 3577, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.0390625 = fieldNorm(doc=3577)
    0.33333334 = coord(1/3)
  0.017430723 = product of:
    0.034861445 = sum of:
      0.034861445 = weight(_text_:22 in 3577) [ClassicSimilarity], result of:
        0.034861445 = score(doc=3577,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 3577, 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=3577)
    0.5 = coord(1/2)

Content

1. Agrarwissenschaften 1981. - 3. Allgemeine Geographie 2.1972. - 3a. Allgemeine Naturwissenschaften 1.1973. - 4. Allgemeine Sprachwissenschaft, Allgemeine Literaturwissenschaft 2.1971. - 6. Allgemeines. 5.1983. - 7. Anglistik 3.1976. - 8. Astronomie, Geodäsie 4.1977. - 12. bio Biologie, bcp Biochemie-Biophysik, bot Botanik, zoo Zoologie 1981. - 13. Bremensien 3.1983. - 13a. Buch- und Bibliothekswesen 3.1975. - 14. Chemie 4.1977. - 14a. Elektrotechnik 1974. - 15 Ethnologie 2.1976. - 16,1. Geowissenschaften. Sachteil 3.1977. - 16,2. Geowissenschaften. Regionaler Teil 3.1977. - 17. Germanistik 6.1984. - 17a,1. Geschichte. Teilsystematik hil. - 17a,2. Geschichte. Teilsystematik his Neuere Geschichte. - 17a,3. Geschichte. Teilsystematik hit Neueste Geschichte. - 18. Humanbiologie 2.1983. - 19. Ingenieurwissenschaften 1974. - 20. siehe 14a. - 21. klassische Philologie 3.1977. - 22. Klinische Medizin 1975. - 23. Kunstgeschichte 2.1971. - 24. Kybernetik. 2.1975. - 25. Mathematik 3.1974. - 26. Medizin 1976. - 26a. Militärwissenschaft 1985. - 27. Musikwissenschaft 1978. - 27a. Noten 2.1974. - 28. Ozeanographie 3.1977. -29. Pädagogik 8.1985. - 30. Philosphie 3.1974. - 31. Physik 3.1974. - 33. Politik, Politische Wissenschaft, Sozialwissenschaft. Soziologie. Länderschlüssel. Register 1981. - 34. Psychologie 2.1972. - 35. Publizistik und Kommunikationswissenschaft 1985. - 36. Rechtswissenschaften 1986. - 37. Regionale Geograpgie 3.1975. - 37a. Religionswissenschaft 1970. - 38. Romanistik 3.1976. - 39. Skandinavistik 4.1985. - 40. Slavistik 1977. - 40a. Sonstige Sprachen und Literaturen 1973. - 43. Sport 4.1983. - 44. Theaterwissenschaft 1985. - 45. Theologie 2.1976. - 45a. Ur- und Frühgeschichte, Archäologie 1970. - 47. Volkskunde 1976. - 47a. Wirtschaftswissenschaften 1971 // Schlüssel: 1. Länderschlüssel 1971. - 2. Formenschlüssel (Kurzform) 1974. - 3. Personenschlüssel Literatur 5. Fassung 1968

0.08454613 = product of:
  0.16909225 = sum of:
    0.16909225 = sum of:
      0.090209804 = weight(_text_:network in 8191) [ClassicSimilarity], result of:
        0.090209804 = score(doc=8191,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.3936264 = fieldWeight in 8191, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0625 = fieldNorm(doc=8191)
      0.07888245 = weight(_text_:22 in 8191) [ClassicSimilarity], result of:
        0.07888245 = score(doc=8191,freq=4.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.4377287 = fieldWeight in 8191, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=8191)
  0.5 = coord(1/2)

Abstract

On 19 Aug 94 a group of readers' advisers met to discuss their problems in Utrecht Provincial Central Library in the Netherlands. The panel felt that too much emphasis had been placed on libraries' information role and that more effort should be devoted to recreational reading through organising lectures and reading groups. It was felt that training sessions should be organised and a network created for the exchange of ideas

Source

Bibliotheek en samenleving. 22(1994) no.11, S.22-23

0.08454613 = product of:
  0.16909225 = sum of:
    0.16909225 = sum of:
      0.090209804 = weight(_text_:network in 6609) [ClassicSimilarity], result of:
        0.090209804 = score(doc=6609,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.3936264 = fieldWeight in 6609, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0625 = fieldNorm(doc=6609)
      0.07888245 = weight(_text_:22 in 6609) [ClassicSimilarity], result of:
        0.07888245 = score(doc=6609,freq=4.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.4377287 = fieldWeight in 6609, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=6609)
  0.5 = coord(1/2)

Abstract

Argues that current discussion on management of and training in networking is technocratic in nature and that it is the duty of public policy to foster personality development and present individuals with new intellectual challenges. Suggests that libraries are nodes in a communal network fulfilling the task of pathfinder, providing information, transferring knowledge, fostering cultural heritage and providing areas for communications and social integration

Date

22. 2.1999 13:35:25

Source

Bibliothek: Forschung und Praxis. 22(1998) H.1, S.97-101

0.081734106 = product of:
  0.16346821 = sum of:
    0.16346821 = product of:
      0.49040464 = sum of:
        0.49040464 = weight(_text_:3a in 973) [ClassicSimilarity], result of:
          0.49040464 = score(doc=973,freq=2.0), product of:
            0.43628904 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05146125 = queryNorm
            1.1240361 = fieldWeight in 973, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.09375 = fieldNorm(doc=973)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: http%3A%2F%2Fcreativechoice.org%2Fdoc%2FHansJonas.pdf&usg=AOvVaw1TM3teaYKgABL5H9yoIifA&opi=89978449.

0.08046674 = product of:
  0.16093348 = sum of:
    0.16093348 = sum of:
      0.12607203 = weight(_text_:network in 2753) [ClassicSimilarity], result of:
        0.12607203 = score(doc=2753,freq=10.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.5501096 = fieldWeight in 2753, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2753)
      0.034861445 = weight(_text_:22 in 2753) [ClassicSimilarity], result of:
        0.034861445 = score(doc=2753,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 2753, 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=2753)
  0.5 = coord(1/2)

Abstract

Social networks evolve over time with the addition and removal of nodes and links to survive and thrive in their environments. Previous studies have shown that the link-formation process in such networks is influenced by a set of facilitators. However, there have been few empirical evaluations to determine the important facilitators. In a research partnership with law enforcement agencies, we used dynamic social-network analysis methods to examine several plausible facilitators of co-offending relationships in a large-scale narcotics network consisting of individuals and vehicles. Multivariate Cox regression and a two-proportion z-test on cyclic and focal closures of the network showed that mutual acquaintance and vehicle affiliations were significant facilitators for the network under study. We also found that homophily with respect to age, race, and gender were not good predictors of future link formation in these networks. Moreover, we examined the social causes and policy implications for the significance and insignificance of various facilitators including common jails on future co-offending. These findings provide important insights into the link-formation processes and the resilience of social networks. In addition, they can be used to aid in the prediction of future links. The methods described can also help in understanding the driving forces behind the formation and evolution of social networks facilitated by mobile and Web technologies.

Date

22. 3.2009 18:50:30

0.08046674 = product of:
  0.16093348 = sum of:
    0.16093348 = sum of:
      0.12607203 = weight(_text_:network in 57) [ClassicSimilarity], result of:
        0.12607203 = score(doc=57,freq=10.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.5501096 = fieldWeight in 57, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=57)
      0.034861445 = weight(_text_:22 in 57) [ClassicSimilarity], result of:
        0.034861445 = score(doc=57,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 57, 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=57)
  0.5 = coord(1/2)

Abstract

Webometric network analyses have been used to map the connectivity of groups of websites to identify clusters, important sites or overall structure. Such analyses have mainly been based upon hyperlink counts, the number of hyperlinks between a pair of websites, although some have used title mentions or URL citations instead. The ability to automatically gather hyperlink counts from Yahoo! ceased in April 2011 and the ability to manually gather such counts was due to cease by early 2012, creating a need for alternatives. This article assesses URL citations and title mentions as possible replacements for hyperlinks in both binary and weighted direct link and co-inlink network diagrams. It also assesses three different types of data for the network connections: hit count estimates, counts of matching URLs, and filtered counts of matching URLs. Results from analyses of U.S. library and information science departments and U.K. universities give evidence that metrics based upon URLs or titles can be appropriate replacements for metrics based upon hyperlinks for both binary and weighted networks, although filtered counts of matching URLs are necessary to give the best results for co-title mention and co-URL citation network diagrams.

Date

6. 4.2012 18:16:22

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 3100) [ClassicSimilarity], result of:
        0.11162894 = score(doc=3100,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 3100, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3100)
      0.048806023 = weight(_text_:22 in 3100) [ClassicSimilarity], result of:
        0.048806023 = score(doc=3100,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = 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

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 6560) [ClassicSimilarity], result of:
        0.11162894 = score(doc=6560,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 6560, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=6560)
      0.048806023 = weight(_text_:22 in 6560) [ClassicSimilarity], result of:
        0.048806023 = score(doc=6560,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 6560, 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=6560)
  0.5 = coord(1/2)

Abstract

The National Information on Software and Services (NISS) is a centrally funded initiative for the provision of information services to the UK academic community via the JANET X.25 and IP (JIPS) network utilizing both Wide Area Networking protocols. The key NISS services include: the NISS Gateway; the NISS Bulletin Board; the NISS Public Access Collections (NISSPAC); NISSWAIS; NISS-EP; and NISS-ALEX. The NISS-ALEX service makes it possible for any user to access data on the Internet without having to connect manually to the remote site and gather the information

Pages

S.22-27

Source

Information networking 93: using the network. Proceedings of the 1st Annual Conference on Information Networking, London, May 1993

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 8471) [ClassicSimilarity], result of:
        0.11162894 = score(doc=8471,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 8471, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=8471)
      0.048806023 = weight(_text_:22 in 8471) [ClassicSimilarity], result of:
        0.048806023 = score(doc=8471,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 8471, 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=8471)
  0.5 = coord(1/2)

Abstract

A national multi-gigabyte-per-second research and education network known as the NREN is to be established by 1996, according to the High Performance Computing Act of 1991 passed in Dec 1991. NREN, referred to as the information highway is expected to provide scientific, educational, and economic benefits for the US, and to serve as the basis for an all-encompassing National Information Infrastructure available to all citizens. An annotated bibliography presenting a representation of the literature that provides a history of the NREN as well as a sense of the evolving concerns and visions of this exciting revolution of the Information Age. Includes items that offer general and specific background information, and visions, viewpoints, and issues related to the NREN

Source

Reference services review. 22(1994) no.2, S.63-78,96

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 2173) [ClassicSimilarity], result of:
        0.11162894 = score(doc=2173,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 2173, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2173)
      0.048806023 = weight(_text_:22 in 2173) [ClassicSimilarity], result of:
        0.048806023 = score(doc=2173,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 2173, 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=2173)
  0.5 = coord(1/2)

Abstract

Reports on a study assessing statewide electronic network initiatives using the Maryland Sailor network as a case study. Aims to develop assessment techniques and indicators for the evaluation of statewide electronic networks. Defines key components of the statewide networked environment. Develops and operationalizes performance measures for networked information technologies and services provided through statewide networks. Explores several methods of evaluating statewide electronic networks. Identifies and discusses key issues and preliminary findings that affect the successful evaluation of statewide networked services

Date

7.11.1998 20:27:22

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 3012) [ClassicSimilarity], result of:
        0.11162894 = score(doc=3012,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 3012, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3012)
      0.048806023 = weight(_text_:22 in 3012) [ClassicSimilarity], result of:
        0.048806023 = score(doc=3012,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 3012, 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=3012)
  0.5 = coord(1/2)

Abstract

Library computerization in the Czech Republic was launched in 1987 with UNESCO's system CDS/ISIS. Currently, the Israeli system ALEPH and the english system TINLIB are being used most often, besides some domestic ones. ALEPH became the framework for the Czech and Slovak Library Information Network (CASLIN). CALIN is the proposed Czech Agricultural Library Information Network, but it has yet to be realized. Library access to the Internet has been available in the Czech Republic since 1992

Date

22. 2.1999 12:58:36

0.08021748 = product of:
  0.16043496 = sum of:
    0.16043496 = sum of:
      0.11162894 = weight(_text_:network in 1452) [ClassicSimilarity], result of:
        0.11162894 = score(doc=1452,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.48708782 = fieldWeight in 1452, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1452)
      0.048806023 = weight(_text_:22 in 1452) [ClassicSimilarity], result of:
        0.048806023 = score(doc=1452,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.2708308 = fieldWeight in 1452, 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=1452)
  0.5 = coord(1/2)

Abstract

The paper addresses knowledge promotion and the importance of acquiring the proper, reliable and up-to-date knowledge and information to help specialists in their research and practical work. Foreign data could be very important and international cooperation should be broadly developed. The example of broad international cooperation in promoting OSH knowledge is described and in it - the world network of 150 OSH institutions in 110 countries (CIS network), with a focal point of Polish contribution.

Source

Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik

0.07950986 = product of:
  0.15901972 = sum of:
    0.15901972 = sum of:
      0.11718599 = weight(_text_:network in 3013) [ClassicSimilarity], result of:
        0.11718599 = score(doc=3013,freq=6.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.51133573 = fieldWeight in 3013, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=3013)
      0.041833732 = weight(_text_:22 in 3013) [ClassicSimilarity], result of:
        0.041833732 = score(doc=3013,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = 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

0.07950986 = product of:
  0.15901972 = sum of:
    0.15901972 = sum of:
      0.11718599 = weight(_text_:network in 825) [ClassicSimilarity], result of:
        0.11718599 = score(doc=825,freq=6.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.51133573 = fieldWeight in 825, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.046875 = fieldNorm(doc=825)
      0.041833732 = weight(_text_:22 in 825) [ClassicSimilarity], result of:
        0.041833732 = score(doc=825,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.23214069 = fieldWeight in 825, 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=825)
  0.5 = coord(1/2)

Abstract

Relevance Feedback consists in automatically formulating a new query according to the relevance judgments provided by the user after evaluating a set of retrieved documents. In this article, we introduce several relevance feedback methods for the Bayesian Network Retrieval ModeL The theoretical frame an which our methods are based uses the concept of partial evidences, which summarize the new pieces of information gathered after evaluating the results obtained by the original query. These partial evidences are inserted into the underlying Bayesian network and a new inference process (probabilities propagation) is run to compute the posterior relevance probabilities of the documents in the collection given the new query. The quality of the proposed methods is tested using a preliminary experimentation with different standard document collections.

Date

22. 3.2003 19:30:19

0.078933574 = product of:
  0.15786715 = sum of:
    0.15786715 = product of:
      0.3157343 = sum of:
        0.3157343 = weight(_text_:network in 3792) [ClassicSimilarity], result of:
          0.3157343 = score(doc=3792,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            1.3776923 = fieldWeight in 3792, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.21875 = fieldNorm(doc=3792)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Object

MSN -> Microsoft Network

0.07397786 = product of:
  0.14795572 = sum of:
    0.14795572 = sum of:
      0.078933574 = weight(_text_:network in 2747) [ClassicSimilarity], result of:
        0.078933574 = score(doc=2747,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.3444231 = fieldWeight in 2747, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2747)
      0.06902214 = weight(_text_:22 in 2747) [ClassicSimilarity], result of:
        0.06902214 = score(doc=2747,freq=4.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.38301262 = fieldWeight in 2747, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2747)
  0.5 = coord(1/2)

Abstract

The Digital Object Identifier (DOI) has been developed by the academic technical and medical publishing sectors to enable the management of access rights to information published electronically. The DOI system has evolved from the physical documentary unit identifiers developed in the 1970, physical and document logical unit identifiers developed in the 1980s and recently modified to meet the needs of electronic distribution. This experience is integrated into the standardization, currently in progress on the Internet network, of the identification of resources and their localization. The DOI system is potentially the object of an international standard as the ISBN and the ISSN have been

Date

22. 1.1999 19:29:22

0.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 2743) [ClassicSimilarity], result of:
        0.11276226 = score(doc=2743,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 2743, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2743)
      0.034861445 = weight(_text_:22 in 2743) [ClassicSimilarity], result of:
        0.034861445 = score(doc=2743,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 2743, 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=2743)
  0.5 = coord(1/2)

Abstract

In this article, we performed a comparative study to investigate the performance of methods for detecting emerging research fronts. Three types of citation network, co-citation, bibliographic coupling, and direct citation, were tested in three research domains, gallium nitride (GaN), complex network (CNW), and carbon nanotube (CNT). Three types of citation network were constructed for each research domain, and the papers in those domains were divided into clusters to detect the research front. We evaluated the performance of each type of citation network in detecting a research front by using the following measures of papers in the cluster: visibility, measured by normalized cluster size, speed, measured by average publication year, and topological relevance, measured by density. Direct citation, which could detect large and young emerging clusters earlier, shows the best performance in detecting a research front, and co-citation shows the worst. Additionally, in direct citation networks, the clustering coefficient was the largest, which suggests that the content similarity of papers connected by direct citations is the greatest and that direct citation networks have the least risk of missing emerging research domains because core papers are included in the largest component.

Date

22. 3.2009 17:52:50

0.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 664) [ClassicSimilarity], result of:
        0.11276226 = score(doc=664,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 664, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=664)
      0.034861445 = weight(_text_:22 in 664) [ClassicSimilarity], result of:
        0.034861445 = score(doc=664,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 664, 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=664)
  0.5 = coord(1/2)

Abstract

A new challenge, accessing multiple relevant entities, arises from the availability of linked heterogeneous data. In this article, we address more specifically the problem of accessing relevant entities, such as publications and authors within a bibliographic network, given an information need. We propose a novel algorithm, called BibRank, that estimates a joint relevance of documents and authors within a bibliographic network. This model ranks each type of entity using a score propagation algorithm with respect to the query topic and the structure of the underlying bi-type information entity network. Evidence sources, namely content-based and network-based scores, are both used to estimate the topical similarity between connected entities. For this purpose, authorship relationships are analyzed through a language model-based score on the one hand and on the other hand, non topically related entities of the same type are detected through marginal citations. The article reports the results of experiments using the Bibrank algorithm for an information retrieval task. The CiteSeerX bibliographic data set forms the basis for the topical query automatic generation and evaluation. We show that a statistically significant improvement over closely related ranking models is achieved.

Date

22. 3.2013 19:34:49

0.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 1365) [ClassicSimilarity], result of:
        0.11276226 = score(doc=1365,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 1365, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1365)
      0.034861445 = weight(_text_:22 in 1365) [ClassicSimilarity], result of:
        0.034861445 = score(doc=1365,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 1365, 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=1365)
  0.5 = coord(1/2)

Abstract

The paper aims to present the relations of network theory and terminology. The model of scale-free networks, which has been recently developed and widely applied since, can be effectively used in terminology research as well. Operation based on the principle of networks is a universal characteristic of complex systems. Networks are governed by general laws. The model of scale-free networks can be viewed as a statistical-probability model, and it can be described with mathematical tools. Its main feature is that "everything is connected to everything else," that is, every node is reachable (in a few steps) starting from any other node; this phenomena is called "the small world phenomenon." The existence of a linguistic network and the general laws of the operation of networks enable us to place issues of language use in the complex system of relations that reveal the deeper connection s between phenomena with the help of networks embedded in each other. The realization of the metaphor that language also has a network structure is the basis of the classification methods of the terminological system, and likewise of the ways of creating terminology databases, which serve the purpose of providing easy and versatile accessibility to specialised knowledge.

Date

2. 9.2014 21:22:48