Search (1318 results, page 4 of 66)

  • × language_ss:"e"
  1. 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.06209181 = product of:
  0.24836724 = sum of:
    0.24836724 = weight(_text_:java in 5801) [ClassicSimilarity], result of:
      0.24836724 = score(doc=5801,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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.
  2. Calishain, T.; Dornfest, R.: Google hacks : 100 industrial-strength tips and tools (2003) 0.06 
    0.061921578 = product of:
  0.123843156 = sum of:
    0.08870259 = weight(_text_:java in 134) [ClassicSimilarity], result of:
      0.08870259 = score(doc=134,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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.035140567 = weight(_text_:und in 134) [ClassicSimilarity], result of:
      0.035140567 = score(doc=134,freq=32.0), product of:
        0.14340423 = queryWeight, product of:
          2.217899 = idf(docFreq=13141, maxDocs=44421)
          0.06465769 = 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)
  3. Lou, J.; Fang, Y.; Lim, K.H.; Peng, J.Z.: Contributing high quantity and quality knowledge to online Q&A communities (2013) 0.06 
    0.060223047 = product of:
  0.24089219 = sum of:
    0.24089219 = weight(_text_:helping in 1615) [ClassicSimilarity], result of:
      0.24089219 = score(doc=1615,freq=4.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.539506 = fieldWeight in 1615, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0390625 = fieldNorm(doc=1615)
  0.25 = coord(1/4)
    Abstract
    This study investigates the motivational factors affecting the quantity and quality of voluntary knowledge contribution in online Q&A communities. Although previous studies focus on knowledge contribution quantity, this study regards quantity and quality as two important, yet distinct, aspects of knowledge contribution. Drawing on self-determination theory, this study proposes that five motivational factors, categorized along the extrinsic-intrinsic spectrum of motivation, have differential effects on knowledge contribution quantity versus quality in the context of online Q&A communities. An online survey with 367 participants was conducted in a leading online Q&A community to test the research model. Results show that rewards in the reputation system, learning, knowledge self-efficacy, and enjoy helping stand out as important motivations. Furthermore, rewards in the reputation system, as a manifestation of the external regulation, is more effective in facilitating the knowledge contribution quantity than quality. Knowledge self-efficacy, as a manifestation of intrinsic motivation, is more strongly related to knowledge contribution quality, whereas the other intrinsic motivation, enjoy helping, is more strongly associated with knowledge contribution quantity. Both theoretical and practical implications are discussed.
  4. Sheldon, M.A.: Discover : a resource discovery system based on content routing (1995) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 2300) [ClassicSimilarity], result of:
      0.2384711 = score(doc=2300,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 2300, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2300)
  0.25 = coord(1/4)
    Abstract
    An HTTP based resource discovery system called Discover has been built that provides a single point of access to over 500 WAIS servers. Discover provides 2 key services: query refinement and query routing. Query refinement helps a user improve a query fragment to describe the user's interests more precisely. Once a query has been refined and describes a manageable result set, query routing automatically forewards the query to the WAIS servers that contain relevant documents. Abbreviated descriptions of WAIS sites called content lables are used by the query routing provides an effective way to discover resources in a large universe of documents. Expansion of query fragments is essential in helping one use a large, dynamically changing, heterogenous distributed information system
  5. Condon, P.: ¬The end of an era? : the forces marshalling against cataloguing (1995) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 5818) [ClassicSimilarity], result of:
      0.2384711 = score(doc=5818,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 5818, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=5818)
  0.25 = coord(1/4)
    Abstract
    Challenges the mind sets that exist about cataloguing in libraries today by offereing arguments for new priorities based on a formula of blending the users' needs with the need for libraries to take a more proactive role in helping users find and use information relevant to their learning needs in a world of rapid and complex change. Argues that inhouse cataloguing is in decline due to the explosion of technological innovations and a high demand for new services pushing for a new order of priorities to ensure effective management at a time of shrinking resources. Focuses on examples from the university environment
  6. Palmquist, R.A.; Sokoll, S.P.: Visual maps of the World Wide Web : helping the user find the way (1998) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 3369) [ClassicSimilarity], result of:
      0.2384711 = score(doc=3369,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 3369, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3369)
  0.25 = coord(1/4)
  7. Vizine-Goetz, D.: From book classification to knowledge organization : improving resource description and discovery (1997) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 3531) [ClassicSimilarity], result of:
      0.2384711 = score(doc=3531,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 3531, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=3531)
  0.25 = coord(1/4)
    Abstract
    OCLC's NetFirst Internet database includes DDC numbers and LoC subject headings to facilitate access to resources. 3 OCLC research projects are helping explore the potential of DDC as a knowledge-structuring tool for large collections of electronic documents. The Scorpion system explores indexing and cataloguing of electronic resources, with emphasis on building tools for automatic subject recognition using schemes like the DDC. Dewey ETC Trees and Wordsmith are concerned with expanding the Deqey knowledge based and enhancing the vocabulary and terminology of the DDC
  8. Lundgren, L.: Helping children to help themselves (1998) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 4705) [ClassicSimilarity], result of:
      0.2384711 = score(doc=4705,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 4705, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=4705)
  0.25 = coord(1/4)
  9. Lin, X.: Designing a visual interface for online searching (1999) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 687) [ClassicSimilarity], result of:
      0.2384711 = score(doc=687,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 687, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=687)
  0.25 = coord(1/4)
    Abstract
    MedLine Search Assistant is a new interface for MEDLINE searching. The interface is designed to (1) visualize boolean query building process, (2) extract descriptors (MeSH terms) automatically from the retrieved documents and list them in the order of their occurrence frequencies, (3) guide the user's query modification process through the display of the number of hits, and (4) allow the user to "pick-and-choose" from a list of related MeSH terms to construct search queries. MedLine Search Assistant improves both search precision and recall by helping the user convert a free text search to a controlled vocabulary-based search in a visual environment
  10. Ding, C.; Patra, J.C.: User modeling for personalized Web search with Self-Organizing Map (2007) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 1429) [ClassicSimilarity], result of:
      0.2384711 = score(doc=1429,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 1429, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=1429)
  0.25 = coord(1/4)
    Abstract
    The widely used Web search engines index and recommend individual Web pages in response to a few keywords queries to assist users in locating relevant documents. However, the Web search engines give different users the same answer set, although the users may have different preferences. A personalized Web search would carry out the search for each user according to his or her preferences. To conduct the personalized Web search, the authors provide a novel approach to model the user profile with a self-organizing map (SOM). Their results indicate that SOM is capable of helping the user to find the related category for each query used in the Web search to make a personalized Web search effective.
  11. Soergel, D.: Knowledge organization for learning (2014) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 2400) [ClassicSimilarity], result of:
      0.2384711 = score(doc=2400,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 2400, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2400)
  0.25 = coord(1/4)
    Abstract
    This paper discusses and illustrates through examples how meaningful or deep learning can be supported through well-structured presentation of material, through giving learners schemas they can use to organize knowledge in their minds, and through helping learners to understand knowledge organization principles they can use to construct their own schemas. It is a call to all authors, educators and information designers to pay attention to meaningful presentation that expresses the internal structure of the domain and facilitates the learner's assimilation of concepts and their relationships.
  12. Thomas, B.: Name disambiguation : learning from more user-friendly models (2011) 0.06 
    0.059617776 = product of:
  0.2384711 = sum of:
    0.2384711 = weight(_text_:helping in 2890) [ClassicSimilarity], result of:
      0.2384711 = score(doc=2890,freq=2.0), product of:
        0.4465051 = queryWeight, product of:
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.06465769 = queryNorm
        0.5340837 = fieldWeight in 2890, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.905677 = idf(docFreq=120, maxDocs=44421)
          0.0546875 = fieldNorm(doc=2890)
  0.25 = coord(1/4)
    Abstract
    Library catalogs do not provide catalog users with the assistance they need to easily and confidently select the person they are interested in. Examples are provided of Web services that do a better job of helping information seekers differentiate the person they are seeking from those with similar names. Some of the reasons for this failure in library catalogs are examined. This article then looks at how much information is necessary to help users disambiguate names, how that information could be captured and shared, and some ways the information could be displayed in library catalogs.
  13. Gibson, P.: Professionals' perfect Web world in sight : users want more information on the Web, and vendors attempt to provide (1998) 0.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 2656) [ClassicSimilarity], result of:
      0.21288621 = score(doc=2656,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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
  14. Nieuwenhuysen, P.; Vanouplines, P.: Document plus program hybrids on the Internet and their impact on information transfer (1998) 0.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 2893) [ClassicSimilarity], result of:
      0.21288621 = score(doc=2893,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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
  15. Mills, T.; Moody, K.; Rodden, K.: Providing world wide access to historical sources (1997) 0.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 3697) [ClassicSimilarity], result of:
      0.21288621 = score(doc=3697,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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
  16. Maarek, Y.S.: WebCutter : a system for dynamic and tailorable site mapping (1997) 0.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 3739) [ClassicSimilarity], result of:
      0.21288621 = score(doc=3739,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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
  17. 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.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 907) [ClassicSimilarity], result of:
      0.21288621 = score(doc=907,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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.
  18. 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.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 2167) [ClassicSimilarity], result of:
      0.21288621 = score(doc=2167,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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.
  19. Song, R.; Luo, Z.; Nie, J.-Y.; Yu, Y.; Hon, H.-W.: Identification of ambiguous queries in web search (2009) 0.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 3441) [ClassicSimilarity], result of:
      0.21288621 = score(doc=3441,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = 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.
  20. Croft, W.B.; Metzler, D.; Strohman, T.: Search engines : information retrieval in practice (2010) 0.05 
    0.053221554 = product of:
  0.21288621 = sum of:
    0.21288621 = weight(_text_:java in 3605) [ClassicSimilarity], result of:
      0.21288621 = score(doc=3605,freq=2.0), product of:
        0.45567554 = queryWeight, product of:
          7.0475073 = idf(docFreq=104, maxDocs=44421)
          0.06465769 = queryNorm
        0.46718815 = fieldWeight in 3605, 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=3605)
  0.25 = coord(1/4)
    Abstract
    For introductory information retrieval courses at the undergraduate and graduate level in computer science, information science and computer engineering departments. Written by a leader in the field of information retrieval, Search Engines: Information Retrieval in Practice, is designed to give undergraduate students the understanding and tools they need to evaluate, compare and modify search engines. Coverage of the underlying IR and mathematical models reinforce key concepts. The book's numerous programming exercises make extensive use of Galago, a Java-based open source search engine. SUPPLEMENTS / Extensive lecture slides (in PDF and PPT format) / Solutions to selected end of chapter problems (Instructors only) / Test collections for exercises / Galago search engine

Authors

Years

Languages

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

Types

  • a 865
  • m 323
  • el 108
  • s 94
  • i 21
  • n 17
  • x 12
  • r 10
  • b 7
  • ? 1
  • v 1
  • More… Less…

Themes

Subjects

Classifications