Search (1299 results, page 2 of 65)

  • × type_ss:"a"
  • × year_i:[2000 TO 2010}
  1. Vetere, G.; Lenzerini, M.: Models for semantic interoperability in service-oriented architectures (2005) 0.05
    0.047678232 = product of:
      0.095356464 = sum of:
        0.095356464 = product of:
          0.2860694 = sum of:
            0.2860694 = weight(_text_:3a in 306) [ClassicSimilarity], result of:
              0.2860694 = score(doc=306,freq=2.0), product of:
                0.43628904 = queryWeight, product of:
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.05146125 = queryNorm
                0.65568775 = fieldWeight in 306, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=306)
          0.33333334 = coord(1/3)
      0.5 = coord(1/2)
    
    Content
    Vgl.: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5386707&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5386707.
  2. Jouis, C.: Logic of relationships (2002) 0.05
    0.045621287 = product of:
      0.091242574 = sum of:
        0.091242574 = sum of:
          0.05638113 = weight(_text_:network in 1204) [ClassicSimilarity], result of:
            0.05638113 = score(doc=1204,freq=2.0), product of:
              0.22917621 = queryWeight, product of:
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.05146125 = queryNorm
              0.2460165 = fieldWeight in 1204, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.0390625 = fieldNorm(doc=1204)
          0.034861445 = weight(_text_:22 in 1204) [ClassicSimilarity], result of:
            0.034861445 = score(doc=1204,freq=2.0), product of:
              0.18020853 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.05146125 = queryNorm
              0.19345059 = fieldWeight in 1204, 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=1204)
      0.5 = coord(1/2)
    
    Abstract
    A main goal of recent studies in semantics is to integrate into conceptual structures the models of representation used in linguistics, logic, and/or artificial intelligence. A fundamental problem resides in the need to structure knowledge and then to check the validity of constructed representations. We propose associating logical properties with relationships by introducing the relationships into a typed and functional system of specifcations. This makes it possible to compare conceptual representations against the relationships established between the concepts. The mandatory condition to validate such a conceptual representation is consistency. The semantic system proposed is based an a structured set of semantic primitives-types, relations, and properties-based an a global model of language processing, Applicative and Cognitive Grammar (ACG) (Desc16s, 1990), and an extension of this model to terminology (Jouis & Mustafa 1995, 1996, 1997). The ACG postulates three levels of representation of languages, including a cognitive level. At this level, the meanings of lexical predicates are represented by semantic cognitive schemes. From this perspective, we propose a set of semantic concepts, which defines an organized system of meanings. Relations are part of a specification network based an a general terminological scheure (i.e., a coherent system of meanings of relations). In such a system, a specific relation may be characterized as to its: (1) functional type (the semantic type of arguments of the relation); (2) algebraic properties (reflexivity, symmetry, transitivity, etc.); and (3) combinatorial relations with other entities in the same context (for instance, the part of the text where a concept is defined).
    Date
    1.12.2002 11:12:22
  3. Byrum, J.D.: ¬The emerging global bibliographical network : the era of international standardization in the development of cataloging policy (2000) 0.05
    0.045621287 = product of:
      0.091242574 = sum of:
        0.091242574 = sum of:
          0.05638113 = weight(_text_:network in 190) [ClassicSimilarity], result of:
            0.05638113 = score(doc=190,freq=2.0), product of:
              0.22917621 = queryWeight, product of:
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.05146125 = queryNorm
              0.2460165 = fieldWeight in 190, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.0390625 = fieldNorm(doc=190)
          0.034861445 = weight(_text_:22 in 190) [ClassicSimilarity], result of:
            0.034861445 = score(doc=190,freq=2.0), product of:
              0.18020853 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.05146125 = queryNorm
              0.19345059 = fieldWeight in 190, 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=190)
      0.5 = coord(1/2)
    
    Date
    10. 9.2000 17:38:22
  4. Börner, K.; Sanyal, S.; Vespignani, A.: Network science (2007) 0.05
    0.045104902 = product of:
      0.090209804 = sum of:
        0.090209804 = product of:
          0.18041961 = sum of:
            0.18041961 = weight(_text_:network in 5705) [ClassicSimilarity], result of:
              0.18041961 = score(doc=5705,freq=2.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.7872528 = fieldWeight in 5705, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.125 = fieldNorm(doc=5705)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  5. Ortega, J.L.; Aguillo, I.F.: Visualization of the Nordic academic web : link analysis using social network tools (2008) 0.04
    0.044751137 = product of:
      0.089502275 = sum of:
        0.089502275 = product of:
          0.17900455 = sum of:
            0.17900455 = weight(_text_:network in 2114) [ClassicSimilarity], result of:
              0.17900455 = score(doc=2114,freq=14.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.7810782 = fieldWeight in 2114, product of:
                  3.7416575 = tf(freq=14.0), with freq of:
                    14.0 = termFreq=14.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.046875 = fieldNorm(doc=2114)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    The aim of this paper is to study the link relationships in the Nordic academic web space - comprised of 23 Finnish, 11 Danish and 28 Swedish academic web domains with the European one. Through social networks analysis we intend to detect sub-networks within the Nordic network, the position and role of the different university web domains and to understand the structural topology of this web space. Co-link analysis, with asymmetrical matrices and cosine measure, is used to identify thematic clusters. Results show that the Nordic network is a cohesive network, set up by three well-defined sub-networks and it rests on the Finnish and Swedish sub-networks. We conclude that the Danish network has less visibility than other Nordic countries. The Swedish one is the principal Nordic sub-network and the Finland network is a slightly isolated from Europe, with the exception of the University of Helsinki.
  6. Barzilai-Nahon, K.: Toward a theory of network gatekeeping : a framework for exploring information control (2008) 0.04
    0.041431498 = product of:
      0.082862996 = sum of:
        0.082862996 = product of:
          0.16572599 = sum of:
            0.16572599 = weight(_text_:network in 1967) [ClassicSimilarity], result of:
              0.16572599 = score(doc=1967,freq=12.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.72313786 = fieldWeight in 1967, product of:
                  3.4641016 = tf(freq=12.0), with freq of:
                    12.0 = termFreq=12.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.046875 = fieldNorm(doc=1967)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Gatekeeping theories have been a popular heuristic for describing information control for years, but none have attained a full theoretical status in the context of networks. This article aims to propose a theory of network gatekeeping comprised of two components: identification and salience. Network gatekeeping identification lays out vocabulary and naming foundations through the identification of gatekeepers, gatekeeping, and gatekeeping mechanisms. Network gatekeeping salience, which is built on the bases of the network identification theory, utilizes this infrastructure to understand relationships among gatekeepers and between gatekeepers and gated, the entity subjected to a gatekeeping process. Network gatekeeping salience[Note 1][Salience refers to the degree to which gatekeepers give priority to competing gated claims.] proposes identifying gated and their salience to gatekeepers by four attributes: (a) their political power in relation to the gatekeeper, (b) their information production ability, (c) their relationship with the gatekeeper, and (d) their alternatives in the context of gatekeeping.
  7. Mas, S.; Marleau, Y.: Proposition of a faceted classification model to support corporate information organization and digital records management (2009) 0.04
    0.040867053 = product of:
      0.081734106 = sum of:
        0.081734106 = product of:
          0.24520232 = sum of:
            0.24520232 = weight(_text_:3a in 2918) [ClassicSimilarity], result of:
              0.24520232 = score(doc=2918,freq=2.0), product of:
                0.43628904 = queryWeight, product of:
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.05146125 = queryNorm
                0.56201804 = fieldWeight in 2918, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  8.478011 = idf(docFreq=24, maxDocs=44218)
                  0.046875 = fieldNorm(doc=2918)
          0.33333334 = coord(1/3)
      0.5 = coord(1/2)
    
    Footnote
    Vgl.: http://ieeexplore.ieee.org/Xplore/login.jsp?reload=true&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F4755313%2F4755314%2F04755480.pdf%3Farnumber%3D4755480&authDecision=-203.
  8. Yang, C.C.; Luk, J.: Automatic generation of English/Chinese thesaurus based on a parallel corpus in laws (2003) 0.04
    0.04010874 = product of:
      0.08021748 = sum of:
        0.08021748 = sum of:
          0.05581447 = weight(_text_:network in 1616) [ClassicSimilarity], result of:
            0.05581447 = score(doc=1616,freq=4.0), product of:
              0.22917621 = queryWeight, product of:
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.05146125 = queryNorm
              0.24354391 = fieldWeight in 1616, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.02734375 = fieldNorm(doc=1616)
          0.024403011 = weight(_text_:22 in 1616) [ClassicSimilarity], result of:
            0.024403011 = score(doc=1616,freq=2.0), product of:
              0.18020853 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.05146125 = queryNorm
              0.1354154 = fieldWeight in 1616, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.02734375 = fieldNorm(doc=1616)
      0.5 = coord(1/2)
    
    Abstract
    The information available in languages other than English in the World Wide Web is increasing significantly. According to a report from Computer Economics in 1999, 54% of Internet users are English speakers ("English Will Dominate Web for Only Three More Years," Computer Economics, July 9, 1999, http://www.computereconomics. com/new4/pr/pr990610.html). However, it is predicted that there will be only 60% increase in Internet users among English speakers verses a 150% growth among nonEnglish speakers for the next five years. By 2005, 57% of Internet users will be non-English speakers. A report by CNN.com in 2000 showed that the number of Internet users in China had been increased from 8.9 million to 16.9 million from January to June in 2000 ("Report: China Internet users double to 17 million," CNN.com, July, 2000, http://cnn.org/2000/TECH/computing/07/27/ china.internet.reut/index.html). According to Nielsen/ NetRatings, there was a dramatic leap from 22.5 millions to 56.6 millions Internet users from 2001 to 2002. China had become the second largest global at-home Internet population in 2002 (US's Internet population was 166 millions) (Robyn Greenspan, "China Pulls Ahead of Japan," Internet.com, April 22, 2002, http://cyberatias.internet.com/big-picture/geographics/article/0,,5911_1013841,00. html). All of the evidences reveal the importance of crosslingual research to satisfy the needs in the near future. Digital library research has been focusing in structural and semantic interoperability in the past. Searching and retrieving objects across variations in protocols, formats and disciplines are widely explored (Schatz, B., & Chen, H. (1999). Digital libraries: technological advances and social impacts. IEEE Computer, Special Issue an Digital Libraries, February, 32(2), 45-50.; Chen, H., Yen, J., & Yang, C.C. (1999). International activities: development of Asian digital libraries. IEEE Computer, Special Issue an Digital Libraries, 32(2), 48-49.). However, research in crossing language boundaries, especially across European languages and Oriental languages, is still in the initial stage. In this proposal, we put our focus an cross-lingual semantic interoperability by developing automatic generation of a cross-lingual thesaurus based an English/Chinese parallel corpus. When the searchers encounter retrieval problems, Professional librarians usually consult the thesaurus to identify other relevant vocabularies. In the problem of searching across language boundaries, a cross-lingual thesaurus, which is generated by co-occurrence analysis and Hopfield network, can be used to generate additional semantically relevant terms that cannot be obtained from dictionary. In particular, the automatically generated cross-lingual thesaurus is able to capture the unknown words that do not exist in a dictionary, such as names of persons, organizations, and events. Due to Hong Kong's unique history background, both English and Chinese are used as official languages in all legal documents. Therefore, English/Chinese cross-lingual information retrieval is critical for applications in courts and the government. In this paper, we develop an automatic thesaurus by the Hopfield network based an a parallel corpus collected from the Web site of the Department of Justice of the Hong Kong Special Administrative Region (HKSAR) Government. Experiments are conducted to measure the precision and recall of the automatic generated English/Chinese thesaurus. The result Shows that such thesaurus is a promising tool to retrieve relevant terms, especially in the language that is not the same as the input term. The direct translation of the input term can also be retrieved in most of the cases.
  9. Wackerow, J.: ¬The Data Documentation Initiative (DDI) (2008) 0.04
    0.04010874 = product of:
      0.08021748 = sum of:
        0.08021748 = sum of:
          0.05581447 = weight(_text_:network in 2662) [ClassicSimilarity], result of:
            0.05581447 = score(doc=2662,freq=4.0), product of:
              0.22917621 = queryWeight, product of:
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.05146125 = queryNorm
              0.24354391 = fieldWeight in 2662, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.4533744 = idf(docFreq=1398, maxDocs=44218)
                0.02734375 = fieldNorm(doc=2662)
          0.024403011 = weight(_text_:22 in 2662) [ClassicSimilarity], result of:
            0.024403011 = score(doc=2662,freq=2.0), product of:
              0.18020853 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.05146125 = queryNorm
              0.1354154 = fieldWeight in 2662, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.02734375 = fieldNorm(doc=2662)
      0.5 = coord(1/2)
    
    Abstract
    The Data Documentation Initiative (DDI) is an international effort to establish an XML-based standard for the compilation, presentation, and exchange of documentation for datasets in the social and behavioral sciences. The most recent version 3.0 of the DDI supports a rich and structured set of metadata elements that not only fully informs a potential data analyst about a given dataset but also facilitates computer processing of the data. Moreover, data producers will find that by adopting the DDI standard they can produce better and more complete documentation as a natural step in designing and fielding computer-assisted interviewing. DDI 3.0 embraces the full life cycle of the data from conception, through development of the data collection instrument, collection and cleaning of data, production of data products, distribution, preservation, and reuse or analysis of the data. DDI 3.0 is designed to facilitate sharing schemes for concepts, questions, coding, and variables within organizations or throughout the social science research community. Comparison through direct inheritance as in the case of comparisonby- design or through the mapping of items like variables or categories allow capture of the harmonization processes used in creating integrated files in an uniform and machine-actionable way. DDI 3.0 is providing the structural support needed to facilitate comparative survey work in a way that was previously unavailable in an open, non-proprietary system. A specific DDI module allows for the capture and expression of native Dublin Core elements (DCMES), used either as references or as descriptions of a particular set of metadata. This module uses the simple Dublin Core namespace represented as XML Schema following the guidelines for implementing Dublin Core in XML. In DDI, the Dublin Core is not used as the primary citation mechanism - this module is included to support applications which understand the Dublin Core XML, but which do not understand DDI. This module is used wherever citations are permitted within DDI 3.0 (like citations of a study description or of other material). DDI 3.0 is aligned with other metadata standards as well: with SDMX (time-series data) for exchanging aggregate data, with ISO/IEC 11179 (metadata registry) for building data registries such as question, variable, and concept banks, and with FGDC and ISO 19115 (geographic standards) for supporting GIS users. DDI 3.0 is described in a conceptual model which is also expressed in the Universal Modeling Language (UML). Modular XML Schemas are derived from the conceptual model. Many elements support computer processing - that is, it will go beyond being "human readable", and move toward the goal of being "machine-actionable". The final release of DDI 3.0 has been published on April 28th 2008. The standard was developed by the DDI Alliance, an international group encompassing data archives and research institutions from several countries in Western Europe and North America. Earlier versions of DDI provide examples of institutions and applications: the Inter-university Consortium for Political and Social Research (ICPSR) Data Catalog, the Council of European Social Science Data Services (CESSDA) Data Portal, the Dataverse Network, the International Household Survey Network (IHSN), NESSTAR Software for publishing data on the Web and online analysis, and the Microdata Management Toolkit (by the World Bank Data Group for IHSN).
    Source
    Metadata for semantic and social applications : proceedings of the International Conference on Dublin Core and Metadata Applications, Berlin, 22 - 26 September 2008, DC 2008: Berlin, Germany / ed. by Jane Greenberg and Wolfgang Klas
  10. Kawamura, S.; Otake, Y.-H.; Suzuki, T.: ¬The structure of the hyperlink network formed by the Web pages of Japanese public libraries (2009) 0.04
    0.03986748 = product of:
      0.07973496 = sum of:
        0.07973496 = product of:
          0.15946992 = sum of:
            0.15946992 = weight(_text_:network in 2845) [ClassicSimilarity], result of:
              0.15946992 = score(doc=2845,freq=16.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.69583976 = fieldWeight in 2845, product of:
                  4.0 = tf(freq=16.0), with freq of:
                    16.0 = termFreq=16.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=2845)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    This article analyzes the structure of the hyperlink network formed by the Web pages of Japanese public libraries and its relationship with the network formed by Inter-Library Loans (ILLs), the traditional system of cooperation among public libraries. Our results indicate that (a) the hyperlink network is effectively connected in the sense that each library is reachable from other libraries by clicking a few links and (b) the network has many groups of libraries that cooperate with each other. Most of the cliques consist of prefectural libraries or libraries in the same prefecture. The hyperlink network shows two of the same tendencies as the ILL network: (a) The connection among libraries that are geographically close to each other or in the same administrative unit is strong, and (b) prefectural libraries occupy the central position. There are differences between them, however, in terms of the amount of ILLs and cliques. We conclude that Japanese public libraries have formed a network on the Web that is strongly affected by traditional cooperation, but also incorporates some new types of cooperation from the perspective of cliques.
  11. Park, H.W.; Barnett, G.A.; Nam, I.-Y.: Hyperlink - affiliation network structure of top Web sites : examining affiliates with hyperlink in Korea (2002) 0.04
    0.039466787 = product of:
      0.078933574 = sum of:
        0.078933574 = product of:
          0.15786715 = sum of:
            0.15786715 = weight(_text_:network in 584) [ClassicSimilarity], result of:
              0.15786715 = score(doc=584,freq=8.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.6888462 = fieldWeight in 584, product of:
                  2.828427 = tf(freq=8.0), with freq of:
                    8.0 = termFreq=8.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=584)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    This article argues that individual Web sites form hyperlink-affiliations with others for the purpose of strengthening their individual trust, expertness, and safety. It describes the hyperlink-affiliation network structure of Korea's top 152 Web sites. The data were obtained from their Web sites for October 2000. The results indicate that financial Web sites, such as credit card and stock Web sites, occupy the most central position in the network. A cluster analysis reveals that the structure of the hyperlink-affiliation network is influenced by the financial Web sites with which others are affiliated. These findings are discussed from the perspective of Web site credibility.
  12. Siva, S.: Document identification and classification using transform coding of gray scale projections and neural tree network (2000) 0.04
    0.039466787 = product of:
      0.078933574 = sum of:
        0.078933574 = product of:
          0.15786715 = sum of:
            0.15786715 = weight(_text_:network in 1970) [ClassicSimilarity], result of:
              0.15786715 = score(doc=1970,freq=2.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.6888462 = fieldWeight in 1970, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.109375 = fieldNorm(doc=1970)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  13. Liu, Z.; Wang, C.: Mapping interdisciplinarity in demography : a journal network analysis (2005) 0.04
    0.039466787 = product of:
      0.078933574 = sum of:
        0.078933574 = product of:
          0.15786715 = sum of:
            0.15786715 = weight(_text_:network in 4384) [ClassicSimilarity], result of:
              0.15786715 = score(doc=4384,freq=2.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.6888462 = fieldWeight in 4384, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.109375 = fieldNorm(doc=4384)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
  14. RAK-NBM : Interpretationshilfe zu NBM 3b,3 (2000) 0.04
    0.039441224 = product of:
      0.07888245 = sum of:
        0.07888245 = product of:
          0.1577649 = sum of:
            0.1577649 = weight(_text_:22 in 4362) [ClassicSimilarity], result of:
              0.1577649 = score(doc=4362,freq=4.0), product of:
                0.18020853 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.05146125 = queryNorm
                0.8754574 = fieldWeight in 4362, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.125 = fieldNorm(doc=4362)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    22. 1.2000 19:22:27
  15. Diederichs, A.: Wissensmanagement ist Macht : Effektiv und kostenbewußt arbeiten im Informationszeitalter (2005) 0.04
    0.039441224 = product of:
      0.07888245 = sum of:
        0.07888245 = product of:
          0.1577649 = sum of:
            0.1577649 = weight(_text_:22 in 3211) [ClassicSimilarity], result of:
              0.1577649 = score(doc=3211,freq=4.0), product of:
                0.18020853 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.05146125 = queryNorm
                0.8754574 = fieldWeight in 3211, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.125 = fieldNorm(doc=3211)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    22. 2.2005 9:16:22
  16. Hawking, D.; Robertson, S.: On collection size and retrieval effectiveness (2003) 0.04
    0.039441224 = product of:
      0.07888245 = sum of:
        0.07888245 = product of:
          0.1577649 = sum of:
            0.1577649 = weight(_text_:22 in 4109) [ClassicSimilarity], result of:
              0.1577649 = score(doc=4109,freq=4.0), product of:
                0.18020853 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.05146125 = queryNorm
                0.8754574 = fieldWeight in 4109, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.125 = fieldNorm(doc=4109)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    14. 8.2005 14:22:22
  17. Na, J.-C.; Neoh, H.L.: Effectiveness of UMLS semantic network as a seed ontology for building a medical domain ontology (2008) 0.04
    0.037292615 = product of:
      0.07458523 = sum of:
        0.07458523 = product of:
          0.14917046 = sum of:
            0.14917046 = weight(_text_:network in 1910) [ClassicSimilarity], result of:
              0.14917046 = score(doc=1910,freq=14.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.6508985 = fieldWeight in 1910, product of:
                  3.7416575 = tf(freq=14.0), with freq of:
                    14.0 = termFreq=14.0
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=1910)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Purpose - The purpose of this article is to examine the effectiveness of the unified medical language system (UMLS) semantic network as a seed ontology for building a medical field ontology. Design/methodology/approach - The information extraction process known as the knowledge engineering approach was used to extract concepts and their semantic relations from documents on "colon cancer treatment". The UMLS semantic network was used as a seed ontology, and was extended and enriched with the extracted concepts and semantic relations using Protégé. Findings - Only half of the semantic relations extracted manually were defined (or inferable) in the UMLS semantic network. The remaining half could be added to the network to extend its coverage. In addition, two semantic types in the network were found to be too general and four new sublevel semantic types were proposed to make them more specific. Research limitations/implications - Since only 109 research paper abstracts in the "colon cancer treatment" domain were analyzed in this study, more abstracts from the colon cancer treatment domain as well as from other cancer treatment domains (such as breast cancer treatment) can be analyzed to give a better generalization of our findings. Originality/value - This study shares our findings on the effectiveness of the UMLS semantic network as a seed ontology for building a medical domain ontology, and also provides the basic guidelines for building or extending a medical domain ontology using the UMLS.
  18. Buzydlowski, J.W.; White, H.D.; Lin, X.: Term Co-occurrence Analysis as an Interface for Digital Libraries (2002) 0.04
    0.036229078 = product of:
      0.072458155 = sum of:
        0.072458155 = product of:
          0.14491631 = sum of:
            0.14491631 = weight(_text_:22 in 1339) [ClassicSimilarity], result of:
              0.14491631 = score(doc=1339,freq=6.0), product of:
                0.18020853 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.05146125 = queryNorm
                0.804159 = fieldWeight in 1339, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.09375 = fieldNorm(doc=1339)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    22. 2.2003 17:25:39
    22. 2.2003 18:16:22
  19. Polanco, X.: Clusters, graphs, and networks for analyzing Internet-Web-supported communication within a virtual community (2003) 0.03
    0.034526248 = product of:
      0.069052495 = sum of:
        0.069052495 = product of:
          0.13810499 = sum of:
            0.13810499 = weight(_text_:network in 2737) [ClassicSimilarity], result of:
              0.13810499 = score(doc=2737,freq=12.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.6026149 = fieldWeight in 2737, 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=2737)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    The proposal is to use clusters, graphs and networks as models in order to analyse the Web structure. Clusters, graphs and networks provide knowledge representation and organization. Clusters were generated by co-site analysis. The sample is a set of academic Web sites from the countries belonging to the European Union. These clusters are here revisited from the point of view of graph theory and social network analysis. This is a quantitative and structural analysis. In fact, the Internet is a computer network that connects people and organizations. Thus we may consider it to be a social network. The set of Web academic sites represents an empirical social network, and is viewed as a virtual community. The network structural properties are here analysed applying together cluster analysis, graph theory and social network analysis. This is a work having taken place in the EICSTES project. EICSTES means European Indicators, Cyberspace, and the Science-Technology-Economy System. It is a research project supported by the Fifth Framework Program of R&D of the European Commission (IST-1999-20350)
  20. Cacheda, F.; Carneiro, V.; Plachouras, V.; Ounis, I.: Performance analysis of distributed information retrieval architectures using an improved network simulation model (2007) 0.03
    0.034526248 = product of:
      0.069052495 = sum of:
        0.069052495 = product of:
          0.13810499 = sum of:
            0.13810499 = weight(_text_:network in 903) [ClassicSimilarity], result of:
              0.13810499 = score(doc=903,freq=12.0), product of:
                0.22917621 = queryWeight, product of:
                  4.4533744 = idf(docFreq=1398, maxDocs=44218)
                  0.05146125 = queryNorm
                0.6026149 = fieldWeight in 903, 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=903)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    The increasing number of documents that have to be indexed in different environments, particularly on the Web, and the lack of scalability of a single centralised index lead to the use of distributed information retrieval systems to effectively search for and locate the required information. In this study, we present several improvements over the two main bottlenecks in a distributed information retrieval system (the network and the brokers). We extend a simulation network model in order to represent a switched network. The new simulation model is validated by comparing the estimated response times with those obtained using a real system. We show that the use of a switched network reduces the saturation of the interconnection network, especially in a replicated system, and some improvements may be achieved using multicast messages and faster connections with the brokers. We also demonstrate that reducing the partial results sets will improve the response time of a distributed system by 53%, with a negligible probability of changing the system's precision and recall values. Finally, we present a simple hierarchical distributed broker model that will reduce the response times for a distributed system by 55%.

Languages

Types

Themes