Search (1716 results, page 3 of 86)

  • × language_ss:"e"
  1. Braeckman, J.: ¬The integration of library information into a campus wide information system (1996) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 729) [ClassicSimilarity], result of:
      0.25875127 = score(doc=729,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 729, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=729)
  0.25 = coord(1/4)
    Abstract
    Discusses the development of Campus Wide Information Systems with reference to the work of Leuven University Library. A 4th phase can now be distinguished in the evolution of CWISs as they evolve towards Intranets. WWW technology is applied to organise a consistent interface to different types of information, databases and services within an institution. WWW servers now exist via which queries and query results are translated from the Web environment to the specific database query language and vice versa. The integration of Java will enable programs to be executed from within the Web environment. Describes each phase of CWIS development at KU Leuven
  2. Chang, S.-F.; Smith, J.R.; Meng, J.: Efficient techniques for feature-based image / video access and manipulations (1997) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 756) [ClassicSimilarity], result of:
      0.25875127 = score(doc=756,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 756, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=756)
  0.25 = coord(1/4)
    Abstract
    Describes 2 research projects aimed at studying the parallel issues of image and video indexing, information retrieval and manipulation: VisualSEEK, a content based image query system and a Java based WWW application supporting localised colour and spatial similarity retrieval; and CVEPS (Compressed Video Editing and Parsing System) which supports video manipulation with indexing support of individual frames from VisualSEEK and a hierarchical new video browsing and indexing system. In both media forms, these systems address the problem of heterogeneous unconstrained collections
  3. Lo, M.L.: Recent strategies for retrieving chemical structure information on the Web (1997) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 3611) [ClassicSimilarity], result of:
      0.25875127 = score(doc=3611,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 3611, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3611)
  0.25 = coord(1/4)
    Abstract
    Discusses various structural searching methods available on the Web. some databases such as the Brookhaven Protein Database use keyword searching which does not provide the desired substructure search capabilities. Others like CS ChemFinder and MDL's Chemscape use graphical plug in programs. Although plug in programs provide more capabilities, users first have to obtain a copy of the programs. Due to this limitation, Tripo's WebSketch and ACD Interactive Lab adopt a different approach. Using JAVA applets, users create and display a structure query of the molecule on the web page without using other software. The new technique is likely to extend itself to other electronic publications
  4. Kirschenbaum, M.: Documenting digital images : textual meta-data at the Blake Archive (1998) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 4287) [ClassicSimilarity], result of:
      0.25875127 = score(doc=4287,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 4287, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4287)
  0.25 = coord(1/4)
    Abstract
    Describes the work undertaken by the Wiliam Blake Archive, Virginia University, to document the metadata tools for handling digital images of illustrations accompanying Blake's work. Images are encoded in both JPEG and TIFF formats. Image Documentation (ID) records are slotted into that portion of the JPEG file reserved for textual metadata. Because the textual content of the ID record now becomes part of the image file itself, the documentary metadata travels with the image even it it is downloaded from one file to another. The metadata is invisible when viewing the image but becomes accessible to users via the 'info' button on the control panel of the Java applet
  5. Priss, U.: ¬A graphical interface for conceptually navigating faceted thesauri (1998) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 658) [ClassicSimilarity], result of:
      0.25875127 = score(doc=658,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 658, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=658)
  0.25 = coord(1/4)
    Abstract
    This paper describes a graphical interface for the navigation and construction of faceted thesauri that is based on formal concept analysis. Each facet of a thesaurus is represented as a mathematical lattice that is further subdivided into components. Users can graphically navigate through the Java implementation of the interface by clicking on terms that connect facets and components. Since there are many applications for thesauri in the knowledge representation field, such a graphical interface has the potential of being very useful
  6. Renehan, E.J.: Science on the Web : a connoisseur's guide to over 500 of the best, most useful, and most fun science Websites (1996) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 1211) [ClassicSimilarity], result of:
      0.25875127 = score(doc=1211,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 1211, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1211)
  0.25 = coord(1/4)
    Abstract
    Written by the author of the best-selling 1001 really cool Web sites, this fun and informative book enables readers to take full advantage of the Web. More than a mere directory, it identifies and describes the best sites, guiding surfers to such innovations as VRML3-D and Java. Aside from downloads of Web browsers, Renehan points the way to free compilers and interpreters as well as free online access to major scientific journals
  7. Friedrich, M.; Schimkat, R.-D.; Küchlin, W.: Information retrieval in distributed environments based on context-aware, proactive documents (2002) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 4608) [ClassicSimilarity], result of:
      0.25875127 = score(doc=4608,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 4608, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4608)
  0.25 = coord(1/4)
    Abstract
    In this position paper we propose a document-centric middleware component called Living Documents to support context-aware information retrieval in distributed communities. A Living Document acts as a micro server for a document which contains computational services, a semi-structured knowledge repository to uniformly store and access context-related information, and finally the document's digital content. Our initial prototype of Living Documents is based an the concept of mobile agents and implemented in Java and XML.
  8. Hancock, B.; Giarlo, M.J.: Moving to XML : Latin texts XML conversion project at the Center for Electronic Texts in the Humanities (2001) 0.06 
    0.06468782 = product of:
  0.25875127 = sum of:
    0.25875127 = weight(_text_:java in 5801) [ClassicSimilarity], result of:
      0.25875127 = score(doc=5801,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.5450528 = fieldWeight in 5801, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.0546875 = fieldNorm(doc=5801)
  0.25 = coord(1/4)
    Abstract
    The delivery of documents on the Web has moved beyond the restrictions of the traditional Web markup language, HTML. HTML's static tags cannot deal with the variety of data formats now beginning to be exchanged between various entities, whether corporate or institutional. XML solves many of the problems by allowing arbitrary tags, which describe the content for a particular audience or group. At the Center for Electronic Texts in the Humanities the Latin texts of Lector Longinquus are being transformed to XML in readiness for the expected new standard. To allow existing browsers to render these texts, a Java program is used to transform the XML to HTML on the fly.
  9. Calishain, T.; Dornfest, R.: Google hacks : 100 industrial-strength tips and tools (2003) 0.06 
    0.06451047 = product of:
  0.12902094 = sum of:
    0.092411175 = weight(_text_:java in 134) [ClassicSimilarity], result of:
      0.092411175 = score(doc=134,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.19466174 = fieldWeight in 134, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.01953125 = fieldNorm(doc=134)
    0.036609765 = weight(_text_:und in 134) [ClassicSimilarity], result of:
      0.036609765 = score(doc=134,freq=32.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.24504554 = fieldWeight in 134, product of:
          5.656854 = tf(freq=32.0), with freq of:
            32.0 = termFreq=32.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.01953125 = fieldNorm(doc=134)
  0.5 = coord(2/4)
    Footnote
    Rez. in: nfd - Information Wissenschaft und Praxis 54(2003) H.4, S.253 (D. Lewandowski): "Mit "Google Hacks" liegt das bisher umfassendste Werk vor, das sich ausschließlich an den fortgeschrittenen Google-Nutzer wendet. Daher wird man in diesem Buch auch nicht die sonst üblichen Anfänger-Tips finden, die Suchmaschinenbücher und sonstige Anleitungen zur Internet-Recherche für den professionellen Nutzer in der Regel uninteressant machen. Mit Tara Calishain hat sich eine Autorin gefunden, die bereits seit nahezu fünf Jahren einen eigenen Suchmaschinen-Newsletter (www.researchbuzz.com) herausgibt und als Autorin bzw. Co-Autorin einige Bücher zum Thema Recherche verfasst hat. Für die Programmbeispiele im Buch ist Rael Dornfest verantwortlich. Das erste Kapitel ("Searching Google") gibt einen Einblick in erweiterte Suchmöglichkeiten und Spezifika der behandelten Suchmaschine. Dabei wird der Rechercheansatz der Autorin klar: die beste Methode sei es, die Zahl der Treffer selbst so weit einzuschränken, dass eine überschaubare Menge übrig bleibt, die dann tatsächlich gesichtet werden kann. Dazu werden die feldspezifischen Suchmöglichkeiten in Google erläutert, Tips für spezielle Suchen (nach Zeitschriftenarchiven, technischen Definitionen, usw.) gegeben und spezielle Funktionen der Google-Toolbar erklärt. Bei der Lektüre fällt positiv auf, dass auch der erfahrene Google-Nutzer noch Neues erfährt. Einziges Manko in diesem Kapitel ist der fehlende Blick über den Tellerrand: zwar ist es beispielsweise möglich, mit Google eine Datumssuche genauer als durch das in der erweiterten Suche vorgegebene Auswahlfeld einzuschränken; die aufgezeigte Lösung ist jedoch ausgesprochen umständlich und im Recherchealltag nur eingeschränkt zu gebrauchen. Hier fehlt der Hinweis, dass andere Suchmaschinen weit komfortablere Möglichkeiten der Einschränkung bieten. Natürlich handelt es sich bei dem vorliegenden Werk um ein Buch ausschließlich über Google, trotzdem wäre hier auch ein Hinweis auf die Schwächen hilfreich gewesen. In späteren Kapiteln werden durchaus auch alternative Suchmaschinen zur Lösung einzelner Probleme erwähnt. Das zweite Kapitel widmet sich den von Google neben der klassischen Websuche angebotenen Datenbeständen. Dies sind die Verzeichniseinträge, Newsgroups, Bilder, die Nachrichtensuche und die (hierzulande) weniger bekannten Bereichen Catalogs (Suche in gedruckten Versandhauskatalogen), Froogle (eine in diesem Jahr gestartete Shopping-Suchmaschine) und den Google Labs (hier werden von Google entwickelte neue Funktionen zum öffentlichen Test freigegeben). Nachdem die ersten beiden Kapitel sich ausführlich den Angeboten von Google selbst gewidmet haben, beschäftigt sich das Buch ab Kapitel drei mit den Möglichkeiten, die Datenbestände von Google mittels Programmierungen für eigene Zwecke zu nutzen. Dabei werden einerseits bereits im Web vorhandene Programme vorgestellt, andererseits enthält das Buch viele Listings mit Erläuterungen, um eigene Applikationen zu programmieren. Die Schnittstelle zwischen Nutzer und der Google-Datenbank ist das Google-API ("Application Programming Interface"), das es den registrierten Benutzern erlaubt, täglich bis zu 1.00o Anfragen über ein eigenes Suchinterface an Google zu schicken. Die Ergebnisse werden so zurückgegeben, dass sie maschinell weiterverarbeitbar sind. Außerdem kann die Datenbank in umfangreicherer Weise abgefragt werden als bei einem Zugang über die Google-Suchmaske. Da Google im Gegensatz zu anderen Suchmaschinen in seinen Benutzungsbedingungen die maschinelle Abfrage der Datenbank verbietet, ist das API der einzige Weg, eigene Anwendungen auf Google-Basis zu erstellen. Ein eigenes Kapitel beschreibt die Möglichkeiten, das API mittels unterschiedlicher Programmiersprachen wie PHP, Java, Python, usw. zu nutzen. Die Beispiele im Buch sind allerdings alle in Perl geschrieben, so dass es sinnvoll erscheint, für eigene Versuche selbst auch erst einmal in dieser Sprache zu arbeiten.
    Das sechste Kapitel enthält 26 Anwendungen des Google-APIs, die teilweise von den Autoren des Buchs selbst entwickelt wurden, teils von anderen Autoren ins Netz gestellt wurden. Als besonders nützliche Anwendungen werden unter anderem der Touchgraph Google Browser zur Visualisierung der Treffer und eine Anwendung, die eine Google-Suche mit Abstandsoperatoren erlaubt, vorgestellt. Auffällig ist hier, dass die interessanteren dieser Applikationen nicht von den Autoren des Buchs programmiert wurden. Diese haben sich eher auf einfachere Anwendungen wie beispielsweise eine Zählung der Treffer nach der Top-Level-Domain beschränkt. Nichtsdestotrotz sind auch diese Anwendungen zum großen Teil nützlich. In einem weiteren Kapitel werden pranks and games ("Streiche und Spiele") vorgestellt, die mit dem Google-API realisiert wurden. Deren Nutzen ist natürlich fragwürdig, der Vollständigkeit halber mögen sie in das Buch gehören. Interessanter wiederum ist das letzte Kapitel: "The Webmaster Side of Google". Hier wird Seitenbetreibern erklärt, wie Google arbeitet, wie man Anzeigen am besten formuliert und schaltet, welche Regeln man beachten sollte, wenn man seine Seiten bei Google plazieren will und letztlich auch, wie man Seiten wieder aus dem Google-Index entfernen kann. Diese Ausführungen sind sehr knapp gehalten und ersetzen daher keine Werke, die sich eingehend mit dem Thema Suchmaschinen-Marketing beschäftigen. Allerdings sind die Ausführungen im Gegensatz zu manch anderen Büchern zum Thema ausgesprochen seriös und versprechen keine Wunder in Bezug auf eine Plazienung der eigenen Seiten im Google-Index. "Google Hacks" ist auch denjenigen zu empfehlen, die sich nicht mit der Programmierung mittels des APIs beschäftigen möchten. Dadurch, dass es die bisher umfangreichste Sammlung von Tips und Techniken für einen gezielteren Umgang mit Google darstellt, ist es für jeden fortgeschrittenen Google-Nutzer geeignet. Zwar mögen einige der Hacks einfach deshalb mit aufgenommen worden sein, damit insgesamt die Zahl von i00 erreicht wird. Andere Tips bringen dafür klar erweiterte Möglichkeiten bei der Recherche. Insofern hilft das Buch auch dabei, die für professionelle Bedürfnisse leider unzureichende Abfragesprache von Google ein wenig auszugleichen." - Bergische Landeszeitung Nr.207 vom 6.9.2003, S.RAS04A/1 (Rundschau am Sonntag: Netzwelt) von P. Zschunke: Richtig googeln (s. dort)
  10. Chudy, S.: ¬The net is here! (1994) 0.06 
    0.06446948 = product of:
  0.25787792 = sum of:
    0.25787792 = weight(_text_:here in 7945) [ClassicSimilarity], result of:
      0.25787792 = score(doc=7945,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.71243626 = fieldWeight in 7945, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.09375 = fieldNorm(doc=7945)
  0.25 = coord(1/4)
  11. Rothenberg, J.: NEDLIB experiment using emulation to preserve digital publications (2001) 0.06 
    0.06287701 = product of:
  0.12575401 = sum of:
    0.018304883 = weight(_text_:und in 14) [ClassicSimilarity], result of:
      0.018304883 = score(doc=14,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.12252277 = fieldWeight in 14, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.0390625 = fieldNorm(doc=14)
    0.10744913 = weight(_text_:here in 14) [ClassicSimilarity], result of:
      0.10744913 = score(doc=14,freq=2.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.29684845 = fieldWeight in 14, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.0390625 = fieldNorm(doc=14)
  0.5 = coord(2/4)
    Abstract
    The increasing use of digital technology to produce documents, records, databases, and publications has a serious flaw: there are no proven techniques for ensuring that digital information will remain accessible, readable, and usable in the future. Unless libraries, archives, government agencies, and other recordkeeping organizations find ways to ensure the longevity of digital artifacts, considerable amounts of valuable information may be lost forever. The library and archives communities now generally recognize that digital information must be copied to new storage media quite frequently, since such media become physically unreadable or obsolete within a few short years. But there is also a deeper problem: A digital document can be made intelligible and usable only by running appropriate software to correctly interpret and >>render<< the document's logical format. Without such software, trying to read a digital document is like trying to read hieroglyphics without a Rosetta Stone. But software - along with the hardware on which it runs - becomes obsolete at least as quickly as the media on which digital documents are stored. This paper discusses the results of a small study undertaken by RAND-Europe for the Koninklijke Bibliotheek (the National Library of the Netherlands, referred to here as the >>KB<<) to investigate one possible solution to this problem. Within the context oft he KB's role in the Networked European Deposit Library (NEDLIB) effort,' this study experimented with the feasibility of using emulation as a means of preserving digital publications in accessible, authentic, and usable form within a deposit library. That is, the study attempted to show that emulating obsolete computer hardware on future computer hardware can be used to confer longevity on digital publications by allowing their obsolete software to be run on future platforms
    Source
    Zeitschrift für Bibliothekswesen und Bibliographie. 48(2001) H.3/4, S.200-204
  12. Fischer, D.H.: Converting a thesaurus to OWL : Notes on the paper "The National Cancer Institute's Thesaurus and Ontology" (2004) 0.06 
    0.059591316 = product of:
  0.11918263 = sum of:
    0.012813417 = weight(_text_:und in 3362) [ClassicSimilarity], result of:
      0.012813417 = score(doc=3362,freq=2.0), product of:
        0.14939985 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.067360975 = queryNorm
        0.085765935 = fieldWeight in 3362, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.02734375 = fieldNorm(doc=3362)
    0.10636921 = weight(_text_:here in 3362) [ClassicSimilarity], result of:
      0.10636921 = score(doc=3362,freq=4.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.29386497 = fieldWeight in 3362, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.02734375 = fieldNorm(doc=3362)
  0.5 = coord(2/4)
    Abstract
    The paper analysed here is a kind of position paper. In order to get a better under-standing of the reported work I used the retrieval interface of the thesaurus, the so-called NCI DTS Browser accessible via the Web3, and I perused the cited OWL file4 with numerous "Find" and "Find next" string searches. In addition the file was im-ported into Protégé 2000, Release 2.0, with OWL Plugin 1.0 and Racer Plugin 1.7.14. At the end of the paper's introduction the authors say: "In the following sections, this paper will describe the terminology development process at NCI, and the issues associated with converting a description logic based nomenclature to a semantically rich OWL ontology." While I will not deal with the first part, i.e. the terminology development process at NCI, I do not see the thesaurus as a description logic based nomenclature, or its cur-rent state and conversion already result in a "rich" OWL ontology. What does "rich" mean here? According to my view there is a great quantity of concepts and links but a very poor description logic structure which enables inferences. And what does the fol-lowing really mean, which is said a few lines previously: "Although editors have defined a number of named ontologic relations to support the description-logic based structure of the Thesaurus, additional relation-ships are considered for inclusion as required to support dependent applications."
    Theme
    Konzeption und Anwendung des Prinzips Thesaurus
  13. Losee, R.M.: Term dependence : a basis for Luhn and Zipf models (2001) 0.06 
    0.055832207 = product of:
  0.22332883 = sum of:
    0.22332883 = weight(_text_:here in 976) [ClassicSimilarity], result of:
      0.22332883 = score(doc=976,freq=6.0), product of:
        0.36196628 = queryWeight, product of:
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.067360975 = queryNorm
        0.61698794 = fieldWeight in 976, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.373531 = idf(docFreq=559, maxDocs=44421)
          0.046875 = fieldNorm(doc=976)
  0.25 = coord(1/4)
    Abstract
    There are regularities in the statistical information provided by natural language terms about neighboring terms. We find that when phrase rank increases, moving from common to less common phrases, the value of the expected mutual information measure (EMIM) between the terms regularly decreases. Luhn's model suggests that midrange terms are the best index terms and relevance discriminators. We suggest reasons for this principle based on the empirical relationships shown here between the rank of terms within phrases and the average mutual information between terms, which we refer to as the Inverse Representation- EMIM principle. We also suggest an Inverse EMIM term weight for indexing or retrieval applications that is consistent with Luhn's distribution. An information theoretic interpretation of Zipf's Law is provided. Using the regularity noted here, we suggest that Zipf's Law is a consequence of the statistical dependencies that exist between terms, described here using information theoretic concepts.
  14. Gibson, P.: Professionals' perfect Web world in sight : users want more information on the Web, and vendors attempt to provide (1998) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 2656) [ClassicSimilarity], result of:
      0.22178681 = score(doc=2656,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 2656, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=2656)
  0.25 = coord(1/4)
    Abstract
    Many information professionals feel that the time is still far off when the WWW can offer the combined funtionality and content of traditional online and CD-ROM databases, but there have been a number of recent Web developments to reflect on. Describes the testing and launch by Ovid of its Java client which, in effect, allows access to its databases on the Web with full search functionality, and the initiative of Euromonitor in providing Web access to its whole collection of consumer research reports and its entire database of business sources. Also reviews the service of a newcomer to the information scene, Information Quest (IQ) founded by Dawson Holdings which has made an agreement with Infonautics to offer access to its Electric Library database thus adding over 1.000 reference, consumer and business publications to its Web based journal service
  15. Nieuwenhuysen, P.; Vanouplines, P.: Document plus program hybrids on the Internet and their impact on information transfer (1998) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 2893) [ClassicSimilarity], result of:
      0.22178681 = score(doc=2893,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 2893, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=2893)
  0.25 = coord(1/4)
    Abstract
    Examines some of the advanced tools, techniques, methods and standards related to the Internet and WWW which consist of hybrids of documents and software, called 'document program hybrids'. Early Internet systems were based on having documents on one side and software on the other, neatly separated, apart from one another and without much interaction, so that the static document can also exist without computers and networks. Documentation program hybrids blur this classical distinction and all components are integrated, interwoven and exist in synergy with each other. Illustrates the techniques with particular reference to practical examples, including: dara collections and dedicated software; advanced HTML features on the WWW, multimedia viewer and plug in software for Internet and WWW browsers; VRML; interaction through a Web server with other servers and with instruments; adaptive hypertext provided by the server; 'webbots' or 'knowbots' or 'searchbots' or 'metasearch engines' or intelligent software agents; Sun's Java; Microsoft's ActiveX; program scripts for HTML and Web browsers; cookies; and Internet push technology with Webcasting channels
  16. Mills, T.; Moody, K.; Rodden, K.: Providing world wide access to historical sources (1997) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 3697) [ClassicSimilarity], result of:
      0.22178681 = score(doc=3697,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 3697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=3697)
  0.25 = coord(1/4)
    Abstract
    A unique collection of historical material covering the lives and events of an English village between 1400 and 1750 has been made available via a WWW enabled information retrieval system. Since the expected readership of the documents ranges from school children to experienced researchers, providing this information in an easily accessible form has offered many challenges requiring tools to aid searching and browsing. The file structure of the document collection was replaced by an database, enabling query results to be presented on the fly. A Java interface displays each user's context in a form that allows for easy and intuitive relevance feedback
  17. Maarek, Y.S.: WebCutter : a system for dynamic and tailorable site mapping (1997) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 3739) [ClassicSimilarity], result of:
      0.22178681 = score(doc=3739,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 3739, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=3739)
  0.25 = coord(1/4)
    Abstract
    Presents an approach that integrates searching and browsing in a manner that improves both paradigms. When browsing is the primary task, it enables semantic content-based tailoring of Web maps in both the generation as well as the visualization phases. When search is the primary task, it enables contextualization of the results by augmenting them with the documents' neighbourhoods. This approach is embodied in WebCutter, a client-server system fully integrated with Web software. WebCutter consists of a map generator running off a standard Web server and a map visualization client implemented as a Java applet runalble from any standard Web browser and requiring no installation or external plug-in application. WebCutter is in beta stage and is in the process of being integrated into the Lotus Domino application product line
  18. Pan, B.; Gay, G.; Saylor, J.; Hembrooke, H.: One digital library, two undergraduate casses, and four learning modules : uses of a digital library in cassrooms (2006) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 907) [ClassicSimilarity], result of:
      0.22178681 = score(doc=907,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 907, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=907)
  0.25 = coord(1/4)
    Abstract
    The KMODDL (kinematic models for design digital library) is a digital library based on a historical collection of kinematic models made of steel and bronze. The digital library contains four types of learning modules including textual materials, QuickTime virtual reality movies, Java simulations, and stereolithographic files of the physical models. The authors report an evaluation study on the uses of the KMODDL in two undergraduate classes. This research reveals that the users in different classes encountered different usability problems, and reported quantitatively different subjective experiences. Further, the results indicate that depending on the subject area, the two user groups preferred different types of learning modules, resulting in different uses of the available materials and different learning outcomes. These findings are discussed in terms of their implications for future digital library design.
  19. Mongin, L.; Fu, Y.Y.; Mostafa, J.: Open Archives data Service prototype and automated subject indexing using D-Lib archive content as a testbed (2003) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 2167) [ClassicSimilarity], result of:
      0.22178681 = score(doc=2167,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 2167, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=2167)
  0.25 = coord(1/4)
    Abstract
    The Indiana University School of Library and Information Science opened a new research laboratory in January 2003; The Indiana University School of Library and Information Science Information Processing Laboratory [IU IP Lab]. The purpose of the new laboratory is to facilitate collaboration between scientists in the department in the areas of information retrieval (IR) and information visualization (IV) research. The lab has several areas of focus. These include grid and cluster computing, and a standard Java-based software platform to support plug and play research datasets, a selection of standard IR modules and standard IV algorithms. Future development includes software to enable researchers to contribute datasets, IR algorithms, and visualization algorithms into the standard environment. We decided early on to use OAI-PMH as a resource discovery tool because it is consistent with our mission.
  20. Song, R.; Luo, Z.; Nie, J.-Y.; Yu, Y.; Hon, H.-W.: Identification of ambiguous queries in web search (2009) 0.06 
    0.055446703 = product of:
  0.22178681 = sum of:
    0.22178681 = weight(_text_:java in 3441) [ClassicSimilarity], result of:
      0.22178681 = score(doc=3441,freq=2.0), product of:
        0.47472697 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.067360975 = queryNorm
        0.46718815 = fieldWeight in 3441, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.046875 = fieldNorm(doc=3441)
  0.25 = coord(1/4)
    Abstract
    It is widely believed that many queries submitted to search engines are inherently ambiguous (e.g., java and apple). However, few studies have tried to classify queries based on ambiguity and to answer "what the proportion of ambiguous queries is". This paper deals with these issues. First, we clarify the definition of ambiguous queries by constructing the taxonomy of queries from being ambiguous to specific. Second, we ask human annotators to manually classify queries. From manually labeled results, we observe that query ambiguity is to some extent predictable. Third, we propose a supervised learning approach to automatically identify ambiguous queries. Experimental results show that we can correctly identify 87% of labeled queries with the approach. Finally, by using our approach, we estimate that about 16% of queries in a real search log are ambiguous.

Authors

Years

Languages

  • d 32
  • m 3
  • nl 1
  • More… Less…

Types

  • a 1206
  • m 353
  • el 152
  • s 104
  • i 23
  • n 18
  • x 13
  • r 12
  • b 7
  • p 2
  • ? 1
  • l 1
  • v 1
  • More… Less…

Themes

Subjects

Classifications