Search (1215 results, page 2 of 61)

  • × language_ss:"e"
  1. Marcoux, Y.; Rizkallah, E.: Intertextual semantics : a semantics for information design (2009) 0.09
    0.08917208 = product of:
      0.35668832 = sum of:
        0.35668832 = weight(_text_:hint in 89) [ClassicSimilarity], result of:
          0.35668832 = score(doc=89,freq=2.0), product of:
            0.5661286 = queryWeight, product of:
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.059565883 = queryNorm
            0.6300482 = fieldWeight in 89, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.046875 = fieldNorm(doc=89)
      0.25 = coord(1/4)
    
    Abstract
    In most discussions about information and knowledge management, natural language is described as too fuzzy, ambiguous, and changing to serve as a basis for the development of large-scale tools and systems. Instead, artificial formal languages are developed and used to represent, hopefully in an unambiguous and precise way, the information or knowledge to be managed. Intertextual semantics (IS) adopts an almost exactly opposite point of view: Natural language is the foundation on which information management tools and systems should be developed, and the usefulness of artificial formalisms used in the process lies exclusively in our ability to derive natural language from them. In this article, we introduce IS, its origins, and underlying hypotheses and principles, and argue that even if its basic principles seem remote from current trends in design, IS is actually compatible with - and complementary to - those trends, especially semiotic engineering (C.S. de Souza, [2005a]). We also hint at further possible application areas, such as interface and interaction design, and the design of concrete objects.
  2. Beynon-Davies, P.: Form-ing institutional order : the scaffolding of lists and identifiers (2016) 0.09
    0.08917208 = product of:
      0.35668832 = sum of:
        0.35668832 = weight(_text_:hint in 4156) [ClassicSimilarity], result of:
          0.35668832 = score(doc=4156,freq=2.0), product of:
            0.5661286 = queryWeight, product of:
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.059565883 = queryNorm
            0.6300482 = fieldWeight in 4156, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.046875 = fieldNorm(doc=4156)
      0.25 = coord(1/4)
    
    Abstract
    This paper examines the central place of the list and the associated concept of an identifier within the scaffolding of contemporary institutional order. These terms are deliberately chosen to make strange and help unpack the constitutive capacity of information systems and information technology within and between contemporary organizations. We draw upon the substantial body of work by John Searle to help understand the place of lists and identifiers in the constitution of institutional order. To enable us to ground our discussion of the potentiality and problematic associated with lists we describe a number of significant instances of list-making, situated particularly around the use of identifiers to refer to people, places, and products. The theorization developed allows us to better explain not only the significance imbued within lists and identifiers but the key part they play in form-ing the institutional order. We also hint at the role such symbolic artifacts play within breakdowns in institutional order.
  3. Hawk, J.: OCLC SiteSearch (1998) 0.08
    0.08089594 = product of:
      0.32358375 = sum of:
        0.32358375 = weight(_text_:java in 3079) [ClassicSimilarity], result of:
          0.32358375 = score(doc=3079,freq=4.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.7708211 = fieldWeight in 3079, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0546875 = fieldNorm(doc=3079)
      0.25 = coord(1/4)
    
    Abstract
    Feature on OCLC's SiteSearch suite of software, first introduced in 1992, and how it is helping over 250 libraries integrate and manage their electronic library collections. Describes the new features of version 4.0, released in Apr 1997, which include a new interface, Java based architecture, and an online documentation and training site. Gives an account of how Java is helping the Georgia Library Learning Online (GALILEO) project to keep pace on the WWW; the use of SiteSearch by libraries to customize their interface to electronic resources; and gives details of Project Athena (Assessing Technological Horizons to Educate the Nashville Area), which is using OCLC SiteSearch to allow area library users to search the holdings of public and university libraries simultaneously
  4. Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998) 0.08
    0.08089594 = product of:
      0.32358375 = sum of:
        0.32358375 = weight(_text_:java in 2673) [ClassicSimilarity], result of:
          0.32358375 = score(doc=2673,freq=4.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.7708211 = fieldWeight in 2673, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0546875 = fieldNorm(doc=2673)
      0.25 = coord(1/4)
    
    Abstract
    The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib
  5. Katz, W.A.: Introduction to reference work : Vol.1: Basic information sources; vol.2: Reference services and reference processes (1992) 0.08
    0.07835672 = product of:
      0.15671344 = sum of:
        0.0080933105 = weight(_text_:und in 4364) [ClassicSimilarity], result of:
          0.0080933105 = score(doc=4364,freq=2.0), product of:
            0.13211112 = queryWeight, product of:
              2.217899 = idf(docFreq=13141, maxDocs=44421)
              0.059565883 = queryNorm
            0.061261386 = fieldWeight in 4364, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.217899 = idf(docFreq=13141, maxDocs=44421)
              0.01953125 = fieldNorm(doc=4364)
        0.14862013 = weight(_text_:hint in 4364) [ClassicSimilarity], result of:
          0.14862013 = score(doc=4364,freq=2.0), product of:
            0.5661286 = queryWeight, product of:
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.059565883 = queryNorm
            0.26252007 = fieldWeight in 4364, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.01953125 = fieldNorm(doc=4364)
      0.5 = coord(2/4)
    
    Abstract
    Standardwerk mit Bezug zum anglo-amerikanischen Verständnis von 'Reference work', das zwar Vorbild für viele Betrachtungen in der deutschen Literatur und in deutschen Bibliotheken ist, das aber bis heute keine Entsprechung in der bibliothekarischen Praxis gefunden hat
    Content
    The ten chapters in Volume 11 are divided into 3 parts: Part One, "Information and the Community," contains two chapters to familiarize readers with various groups in the community, their information and reference needs, and how professionals attempt to serve those needs. Part Two, "Interview and Search," devotes Chapters 3 through 6 to the vital task of explaining how to isolate and understand the questions readers put to librarians as well as basic methods of finding the correct answer(s). The emphasis is an practical application of tried and true methods of interviewing and searching. Attention is given to both manual and computer searches. Chapter 6 is a guide to basic information about databases, including CD-ROMS. Part Three, "Library Instruction, Networks, Policies, and Evaluation," is comprised of the last four chapters and covers the activities of reference librarians when not responding to direct questions. This part includes hints an teaching people how to find information as well as the networks that help both librarian and user to discover what is needed. Chapter 10 discusses methods of deciding how well the individual has fulfilled the task of being a reference librarian. Only space and the fact that this text is for beginners limits what information it contains. First, many new developments and potentially important technological changes in the field of information are impossible to cover without turning to technical language and jargon quite beyond the average reader of an introductory textbook. However, basic developments are covered and explained, and there is a guide (via the footnotes and suggested readings) for those who wish to explore the future. Second, this volume is for students and working reference librarians and is intended first, foremost, and always as a pragmatic, practical approach. This is not to discount the importance of research and information science. Leaders and followers in those fields are responsible for much of what is revolutionary in references services today. There are other courses, other places where information science can be considered in depth; all that can be done here is to hint at the joy of the intellectual fields that open up to the information scientist and researcher. Students and teachers alike should be aware that much of the material covered in this book is updated, argued, and dutifully considered in several basic journals. RQ, the official voice of reference librarians of the American Library Association, excels in its coverage of the topics considered in this text. Library Journal, while more general, now offers excellent and timely articles an the new technology and its influence an librarians. The Reference Librarian, edited by the author of this text, offers specific discussions of single topics in each issue, and these have ranged from online reference services, to personnel, to problems of evaluation. And, not to be missed, is the nicely edited, always useful, and sometimes downright inspirational, References Services Review.
  6. Juhne, J.; Jensen, A.T.; Gronbaek, K.: Ariadne: a Java-based guided tour system for the World Wide Web (1998) 0.07
    0.06933937 = product of:
      0.2773575 = sum of:
        0.2773575 = weight(_text_:java in 4593) [ClassicSimilarity], result of:
          0.2773575 = score(doc=4593,freq=4.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.6607038 = fieldWeight in 4593, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.046875 = fieldNorm(doc=4593)
      0.25 = coord(1/4)
    
    Abstract
    Presents a Guided tour system for the WWW, called Ariadne, which implements the ideas of trails and guided tours, originating from the hypertext field. Ariadne appears as a Java applet to the user and it stores guided tours in a database format separated from the WWW documents included in the tour. Itd main advantages are: an independent user interface which does not affect the layout of the documents being part of the tour, branching tours where the user may follow alternative routes, composition of existing tours into aggregate tours, overview map with indication of which parts of a tour have been visited an support for getting back on track. Ariadne is available as a research prototype, and it has been tested among a group of university students as well as casual users on the Internet
  7. Reed, D.: Essential HTML fast (1997) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 6851) [ClassicSimilarity], result of:
          0.26149517 = score(doc=6851,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 6851, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=6851)
      0.25 = coord(1/4)
    
    Abstract
    This book provides a quick, concise guide to the issues surrounding the preparation of a well-designed, professional web site using HTML. Topics covered include: how to plan your web site effectively, effective use of hypertext, images, audio and video; layout techniques using tables and and list; how to use style sheets, font sizes and plans for mathematical equation make up. Integration of CGI scripts, Java and ActiveX into your web site is also discussed
  8. Lord Wodehouse: ¬The Intranet : the quiet (r)evolution (1997) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 171) [ClassicSimilarity], result of:
          0.26149517 = score(doc=171,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 171, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=171)
      0.25 = coord(1/4)
    
    Abstract
    Explains how the Intranet (in effect an Internet limited to the computer systems of a single organization) developed out of the Internet, and what its uses and advantages are. Focuses on the Intranet developed in the Glaxo Wellcome organization. Briefly discusses a number of technologies in development, e.g. Java, Real audio, 3D and VRML, and summarizes the issues involved in the successful development of the Intranet, that is, bandwidth, searching tools, security, and legal issues
  9. Wang, J.; Reid, E.O.F.: Developing WWW information systems on the Internet (1996) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 604) [ClassicSimilarity], result of:
          0.26149517 = score(doc=604,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 604, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=604)
      0.25 = coord(1/4)
    
    Abstract
    Gives an overview of Web information system development. Discusses some basic concepts and technologies such as HTML, HTML FORM, CGI and Java, which are associated with developing WWW information systems. Further discusses the design and implementation of Virtual Travel Mart, a Web based end user oriented travel information system. Finally, addresses some issues in developing WWW information systems
  10. Ameritech releases Dynix WebPac on NT (1998) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 2782) [ClassicSimilarity], result of:
          0.26149517 = score(doc=2782,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 2782, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=2782)
      0.25 = coord(1/4)
    
    Abstract
    Ameritech Library Services has released Dynix WebPac on NT, which provides access to a Dynix catalogue from any Java compatible Web browser. Users can place holds, cancel and postpone holds, view and renew items on loan and sort and limit search results from the Web. Describes some of the other features of Dynix WebPac
  11. OCLC completes SiteSearch 4.0 field test (1998) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 3078) [ClassicSimilarity], result of:
          0.26149517 = score(doc=3078,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 3078, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=3078)
      0.25 = coord(1/4)
    
    Abstract
    OCLC has announced that 6 library systems have completed field tests of the OCLC SiteSearch 4.0 suite of software, paving its way for release. Traces the beta site testing programme from its beginning in November 1997 and notes that OCLC SiteServer components have been written in Java programming language which will increase libraries' ability to extend the functionality of the SiteSearch software to create new features specific to local needs
  12. Robinson, D.A.; Lester, C.R.; Hamilton, N.M.: Delivering computer assisted learning across the WWW (1998) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 4618) [ClassicSimilarity], result of:
          0.26149517 = score(doc=4618,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 4618, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=4618)
      0.25 = coord(1/4)
    
    Abstract
    Demonstrates a new method of providing networked computer assisted learning to avoid the pitfalls of traditional methods. This was achieved using Web pages enhanced with Java applets, MPEG video clips and Dynamic HTML
  13. Bates, C.: Web programming : building Internet applications (2000) 0.07
    0.06537379 = product of:
      0.26149517 = sum of:
        0.26149517 = weight(_text_:java in 130) [ClassicSimilarity], result of:
          0.26149517 = score(doc=130,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.62291753 = fieldWeight in 130, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0625 = fieldNorm(doc=130)
      0.25 = coord(1/4)
    
    Object
    Java
  14. Zschunke, P.: Richtig googeln : Ein neues Buch hilft, alle Möglichkeiten der populären Suchmaschine zu nutzen (2003) 0.07
    0.06513583 = product of:
      0.13027166 = sum of:
        0.09806069 = weight(_text_:java in 55) [ClassicSimilarity], result of:
          0.09806069 = score(doc=55,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = queryNorm
            0.23359407 = fieldWeight in 55, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.0234375 = fieldNorm(doc=55)
        0.03221097 = weight(_text_:und in 55) [ClassicSimilarity], result of:
          0.03221097 = score(doc=55,freq=22.0), product of:
            0.13211112 = queryWeight, product of:
              2.217899 = idf(docFreq=13141, maxDocs=44421)
              0.059565883 = queryNorm
            0.24381724 = fieldWeight in 55, product of:
              4.690416 = tf(freq=22.0), with freq of:
                22.0 = termFreq=22.0
              2.217899 = idf(docFreq=13141, maxDocs=44421)
              0.0234375 = fieldNorm(doc=55)
      0.5 = coord(2/4)
    
    Content
    "Fünf Jahre nach seiner Gründung ist Google zum Herz des weltweiten Computernetzes geworden. Mit seiner Konzentration aufs Wesentliche hat die Suchmaschine alle anderen Anbieter weit zurück gelassen. Aber Google kann viel mehr, als im Web nach Texten und Bildern zu suchen. Gesammelt und aufbereitet werden auch Beiträge in Diskussionsforen (Newsgroups), aktuelle Nachrichten und andere im Netz verfügbare Informationen. Wer sich beim "Googeln" darauf beschränkt, ein einziges Wort in das Suchformular einzutippen und dann die ersten von oft mehreren hunderttausend Treffern anzuschauen, nutzt nur einen winzigen Bruchteil der Möglichkeiten. Wie man Google bis zum letzten ausreizt, haben Tara Calishain und Rael Dornfest in einem bislang nur auf Englisch veröffentlichten Buch dargestellt (Tara Calishain/Rael Dornfest: Google Hacks", www.oreilly.de, 28 Euro. Die wichtigsten Praxistipps kosten als Google Pocket Guide 12 Euro). - Suchen mit bis zu zehn Wörtern - Ihre "100 Google Hacks" beginnen mit Google-Strategien wie der Kombination mehrerer Suchbegriffe und enden mit der Aufforderung zur eigenen Nutzung der Google API ("Application Programming Interface"). Diese Schnittstelle kann zur Entwicklung von eigenen Programmen eingesetzt werden,,die auf die Google-Datenbank mit ihren mehr als drei Milliarden Einträgen zugreifen. Ein bewussteres Suchen im Internet beginnt mit der Kombination mehrerer Suchbegriffe - bis zu zehn Wörter können in das Formularfeld eingetippt werden, welche Google mit dem lo-gischen Ausdruck "und" verknüpft. Diese Standardvorgabe kann mit einem dazwischen eingefügten "or" zu einer Oder-Verknüpfung geändert werden. Soll ein bestimmter Begriff nicht auftauchen, wird ein Minuszeichen davor gesetzt. Auf diese Weise können bei einer Suche etwa alle Treffer ausgefiltert werden, die vom Online-Buchhändler Amazon kommen. Weiter gehende Syntax-Anweisungen helfen ebenfalls dabei, die Suche gezielt einzugrenzen: Die vorangestellte Anweisung "intitle:" etwa (ohne Anführungszeichen einzugeben) beschränkt die Suche auf all diejenigen Web-Seiten, die den direkt danach folgenden Begriff in ihrem Titel aufführen. Die Computer von Google bewältigen täglich mehr als 200 Millionen Anfragen. Die Antworten kommen aus einer Datenbank, die mehr als drei Milliarden Einträge enthält und regelmäßig aktualisiert wird. Dazu Werden SoftwareRoboter eingesetzt, so genannte "Search-Bots", die sich die Hyperlinks auf Web-Seiten entlang hangeln und für jedes Web-Dokument einen Index zur Volltextsuche anlegen. Die Einnahmen des 1998 von Larry Page und Sergey Brin gegründeten Unternehmens stammen zumeist von Internet-Portalen, welche die GoogleSuchtechnik für ihre eigenen Dienste übernehmen. Eine zwei Einnahmequelle ist die Werbung von Unternehmen, die für eine optisch hervorgehobene Platzierung in den GoogleTrefferlisten zahlen. Das Unternehmen mit Sitz im kalifornischen Mountain View beschäftigt rund 800 Mitarbeiter. Der Name Google leitet sich ab von dem Kunstwort "Googol", mit dem der amerikanische Mathematiker Edward Kasner die unvorstellbar große Zahl 10 hoch 100 (eine 1 mit hundert Nullen) bezeichnet hat. Kommerzielle Internet-Anbieter sind sehr, daran interessiert, auf den vordersten Plätzen einer Google-Trefferliste zu erscheinen.
    Da Google im Unterschied zu Yahoo oder Lycos nie ein auf möglichst viele Besuche angelegtes Internet-Portal werden wollte, ist die Suche in der Datenbank auch außerhalb der Google-Web-Site möglich. Dafür gibt es zunächst die "Google Toolbar" für den Internet Explorer, mit der dieser Browser eine eigene Leiste, für die Google-Suche erhält. Freie Entwickler bieten im Internet eine eigene Umsetzung: dieses Werkzeugs auch für den Netscape/ Mozilla-Browser an. Daneben kann ein GoogleSucheingabefeld aber auch auf die eigene WebSeite platziert werden - dazu sind nur vier Zei-len HTML-Code nötig. Eine Google-Suche zu starten, ist übrigens auch ganz ohne Browser möglich. Dazu hat das Unternehmen im Aprilvergangenen Jahres die API ("Application Programming Interface") frei gegeben, die in eigene Programme' eingebaut wird. So kann man etwa eine Google-Suche mit einer E-Mail starten: Die Suchbegriffe werden in die Betreff Zeile einer ansonsten leeren EMail eingetragen, die an die Adresse google@capeclear.com geschickt wird. Kurz danach trifft eine automatische Antwort-Mail mit den ersten zehn Treffern ein. Die entsprechenden Kenntnisse vorausgesetzt, können Google-Abfragen auch in Web-Services eingebaut werden - das sind Programme, die Daten aus dem Internet verarbeiten. Als Programmiertechniken kommen dafür Perl, PHP, Python oder Java in Frage. Calishain und Dornfest stellen sogar eine Reihe von abgedrehten Sites vor, die solche Programme für abstrakte Gedichte oder andere Kunstwerke einsetzen."
  15. Brambilla, M.; Ceri, S.: Designing exploratory search applications upon Web data sources (2012) 0.06
    0.059448052 = product of:
      0.23779221 = sum of:
        0.23779221 = weight(_text_:hint in 1428) [ClassicSimilarity], result of:
          0.23779221 = score(doc=1428,freq=2.0), product of:
            0.5661286 = queryWeight, product of:
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.059565883 = queryNorm
            0.42003214 = fieldWeight in 1428, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              9.504243 = idf(docFreq=8, maxDocs=44421)
              0.03125 = fieldNorm(doc=1428)
      0.25 = coord(1/4)
    
    Abstract
    Search is the preferred method to access information in today's computing systems. The Web, accessed through search engines, is universally recognized as the source for answering users' information needs. However, offering a link to a Web page does not cover all information needs. Even simple problems, such as "Which theater offers an at least three-stars action movie in London close to a good Italian restaurant," can only be solved by searching the Web multiple times, e.g., by extracting a list of the recent action movies filtered by ranking, then looking for movie theaters, then looking for Italian restaurants close to them. While search engines hint to useful information, the user's brain is the fundamental platform for information integration. An important trend is the availability of new, specialized data sources-the so-called "long tail" of the Web of data. Such carefully collected and curated data sources can be much more valuable than information currently available in Web pages; however, many sources remain hidden or insulated, in the lack of software solutions for bringing them to surface and making them usable in the search context. A new class of tailor-made systems, designed to satisfy the needs of users with specific aims, will support the publishing and integration of data sources for vertical domains; the user will be able to select sources based on individual or collective trust, and systems will be able to route queries to such sources and to provide easyto-use interfaces for combining them within search strategies, at the same time, rewarding the data source owners for each contribution to effective search. Efforts such as Google's Fusion Tables show that the technology for bringing hidden data sources to surface is feasible.
  16. Braeckman, J.: ¬The integration of library information into a campus wide information system (1996) 0.06
    0.057202067 = product of:
      0.22880827 = sum of:
        0.22880827 = weight(_text_:java in 729) [ClassicSimilarity], result of:
          0.22880827 = score(doc=729,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = 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
  17. Chang, S.-F.; Smith, J.R.; Meng, J.: Efficient techniques for feature-based image / video access and manipulations (1997) 0.06
    0.057202067 = product of:
      0.22880827 = sum of:
        0.22880827 = weight(_text_:java in 756) [ClassicSimilarity], result of:
          0.22880827 = score(doc=756,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = 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
  18. Lo, M.L.: Recent strategies for retrieving chemical structure information on the Web (1997) 0.06
    0.057202067 = product of:
      0.22880827 = sum of:
        0.22880827 = weight(_text_:java in 3611) [ClassicSimilarity], result of:
          0.22880827 = score(doc=3611,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = 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
  19. Kirschenbaum, M.: Documenting digital images : textual meta-data at the Blake Archive (1998) 0.06
    0.057202067 = product of:
      0.22880827 = sum of:
        0.22880827 = weight(_text_:java in 4287) [ClassicSimilarity], result of:
          0.22880827 = score(doc=4287,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = 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
  20. Priss, U.: ¬A graphical interface for conceptually navigating faceted thesauri (1998) 0.06
    0.057202067 = product of:
      0.22880827 = sum of:
        0.22880827 = weight(_text_:java in 658) [ClassicSimilarity], result of:
          0.22880827 = score(doc=658,freq=2.0), product of:
            0.41979098 = queryWeight, product of:
              7.0475073 = idf(docFreq=104, maxDocs=44421)
              0.059565883 = 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

Authors

Languages

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

Types

  • a 778
  • m 311
  • el 102
  • s 92
  • i 21
  • n 17
  • x 12
  • r 10
  • b 7
  • ? 1
  • v 1
  • More… Less…

Themes

Subjects

Classifications