Browsing around a Digital Library: Today and Tomorrow
Identifieur interne : 000482 ( Istex/Corpus ); précédent : 000481; suivant : 000483Browsing around a Digital Library: Today and Tomorrow
Auteurs : Ian H. WittenSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2000.
Abstract
Abstract: What will it be like to work in tomorrow’s digital library? We begin by browsing around an experimental digital library of the present, glancing at some collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.
Url:
DOI: 10.1007/3-540-45123-4_3
Links to Exploration step
ISTEX:D92801AD2F81264360629779EB14816C120943F9Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Browsing around a Digital Library: Today and Tomorrow</title><author><name sortKey="Witten, Ian H" sort="Witten, Ian H" uniqKey="Witten I" first="Ian H." last="Witten">Ian H. Witten</name><affiliation><mods:affiliation>Department of Computer Science, University of Waikato, Hamilton, New Zealand</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ihw@cs.waikato.ac.nz</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D92801AD2F81264360629779EB14816C120943F9</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/3-540-45123-4_3</idno><idno type="url">https://api.istex.fr/document/D92801AD2F81264360629779EB14816C120943F9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000482</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000482</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Browsing around a Digital Library: Today and Tomorrow</title><author><name sortKey="Witten, Ian H" sort="Witten, Ian H" uniqKey="Witten I" first="Ian H." last="Witten">Ian H. Witten</name><affiliation><mods:affiliation>Department of Computer Science, University of Waikato, Hamilton, New Zealand</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ihw@cs.waikato.ac.nz</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2000</date></imprint><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">D92801AD2F81264360629779EB14816C120943F9</idno><idno type="DOI">10.1007/3-540-45123-4_3</idno><idno type="ChapterID">3</idno><idno type="ChapterID">Chap3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: What will it be like to work in tomorrow’s digital library? We begin by browsing around an experimental digital library of the present, glancing at some collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Ian H. Witten</name><affiliations><json:string>Department of Computer Science, University of Waikato, Hamilton, New Zealand</json:string><json:string>E-mail: ihw@cs.waikato.ac.nz</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: What will it be like to work in tomorrow’s digital library? We begin by browsing around an experimental digital library of the present, glancing at some collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.</abstract><qualityIndicators><score>6.26</score><pdfVersion>1.3</pdfVersion><pdfPageSize>431 x 666 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>678</abstractCharCount><pdfWordCount>5617</pdfWordCount><pdfCharCount>33104</pdfCharCount><pdfPageCount>15</pdfPageCount><abstractWordCount>105</abstractWordCount></qualityIndicators><title>Browsing around a Digital Library: Today and Tomorrow</title><chapterId><json:string>3</json:string><json:string>Chap3</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><title>Lecture Notes in Computer Science</title><copyrightDate>2000</copyrightDate></serie><host><editor><json:item><name>Raffaele Giancarlo</name><affiliations><json:string>Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy</json:string></affiliations></json:item><json:item><name>David Sankoff</name><affiliations><json:string>Centre de recherches mathématiques, Université de Montréal, succursale Centre-Ville, CP 6128, H3C 3J7, Montréal, Québec, Canada</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Pattern Recognition</value></json:item><json:item><value>Document Preparation and Text Processing</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Combinatorics</value></json:item></subject><isbn><json:string>978-3-540-67633-1</json:string></isbn><language><json:string>unknown</json:string></language><title>Combinatorial Pattern Matching</title><bookId><json:string>3-540-45123-4</json:string></bookId><volume>1848</volume><pages><last>26</last><first>12</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-45123-5</json:string></eisbn><copyrightDate>2000</copyrightDate><doi><json:string>10.1007/3-540-45123-4</json:string></doi></host><publicationDate>2002</publicationDate><copyrightDate>2000</copyrightDate><doi><json:string>10.1007/3-540-45123-4_3</json:string></doi><id>D92801AD2F81264360629779EB14816C120943F9</id><score>0.064160496</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/D92801AD2F81264360629779EB14816C120943F9/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/D92801AD2F81264360629779EB14816C120943F9/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/D92801AD2F81264360629779EB14816C120943F9/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Browsing around a Digital Library: Today and Tomorrow</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2000</p></availability><date>2000</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Browsing around a Digital Library: Today and Tomorrow</title><author xml:id="author-1"><persName><forename type="first">Ian</forename><surname>Witten</surname></persName><email>ihw@cs.waikato.ac.nz</email><affiliation>Department of Computer Science, University of Waikato, Hamilton, New Zealand</affiliation></author></analytic><monogr><title level="m">Combinatorial Pattern Matching</title><title level="m" type="sub">11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings</title><idno type="pISBN">978-3-540-67633-1</idno><idno type="eISBN">978-3-540-45123-5</idno><idno type="pISSN">0302-9743</idno><idno type="DOI">10.1007/3-540-45123-4</idno><idno type="book-ID">3-540-45123-4</idno><idno type="book-title-ID">62906</idno><idno type="book-sequence-number">1848</idno><idno type="book-volume-number">1848</idno><idno type="book-chapter-count">34</idno><editor><persName><forename type="first">Raffaele</forename><surname>Giancarlo</surname></persName><affiliation>Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy</affiliation></editor><editor><persName><forename type="first">David</forename><surname>Sankoff</surname></persName><affiliation>Centre de recherches mathématiques, Université de Montréal, succursale Centre-Ville, CP 6128, H3C 3J7, Montréal, Québec, Canada</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2002-11-07"></date><biblScope unit="volume">1848</biblScope><biblScope unit="page" from="12">12</biblScope><biblScope unit="page" to="26">26</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Utrecht University, The Netherlands</affiliation></editor><biblScope><date>2000</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="series-Id">558</idno></series><idno type="istex">D92801AD2F81264360629779EB14816C120943F9</idno><idno type="DOI">10.1007/3-540-45123-4_3</idno><idno type="ChapterID">3</idno><idno type="ChapterID">Chap3</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2000</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: What will it be like to work in tomorrow’s digital library? We begin by browsing around an experimental digital library of the present, glancing at some collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16021</label><label>I2203X</label><label>I21033</label><label>I18032</label><label>M17009</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Pattern Recognition</term></item><item><term>Document Preparation and Text Processing</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Combinatorics</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2002-11-07">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/D92801AD2F81264360629779EB14816C120943F9/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45123-4</BookID><BookTitle>Combinatorial Pattern Matching</BookTitle><BookSubTitle>11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings</BookSubTitle><BookVolumeNumber>1848</BookVolumeNumber><BookSequenceNumber>1848</BookSequenceNumber><BookDOI>10.1007/3-540-45123-4</BookDOI><BookTitleID>62906</BookTitleID><BookPrintISBN>978-3-540-67633-1</BookPrintISBN><BookElectronicISBN>978-3-540-45123-5</BookElectronicISBN><BookChapterCount>34</BookChapterCount><BookHistory><OnlineDate><Year>2002</Year><Month>11</Month><Day>7</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2000</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I2203X" Priority="2" Type="Secondary">Pattern Recognition</BookSubject><BookSubject Code="I21033" Priority="3" Type="Secondary">Document Preparation and Text Processing</BookSubject><BookSubject Code="I18032" Priority="4" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="M17009" Priority="5" Type="Secondary">Combinatorics</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Raffaele</GivenName><FamilyName>Giancarlo</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Sankoff</FamilyName></EditorName></Editor><Affiliation ID="Aff4"><OrgDivision>Dipartimento di Matematica ed Applicazioni</OrgDivision><OrgName>Universitá die Palermo</OrgName><OrgAddress><Street>Via Archirafi 34</Street><Postcode>90123</Postcode><City>Palermo</City><Country>Italy</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>Centre de recherches mathématiques</OrgDivision><OrgName>Université de Montréal</OrgName><OrgAddress><Postbox>CP 6128</Postbox><Street>succursale Centre-Ville</Street><City>Montréal</City><State>Québec</State><Country>Canada</Country><Postcode>H3C 3J7</Postcode></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part1"><PartInfo TocLevels="0"><PartID>1</PartID><PartSequenceNumber>1</PartSequenceNumber><PartTitle>Invited Lectures</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-45123-4</BookID><BookTitle>Combinatorial Pattern Matching</BookTitle></PartContext></PartInfo><Chapter ID="Chap3" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>3</ChapterID><ChapterDOI>10.1007/3-540-45123-4_3</ChapterDOI><ChapterSequenceNumber>3</ChapterSequenceNumber><ChapterTitle Language="En">Browsing around a Digital Library: Today and Tomorrow</ChapterTitle><ChapterFirstPage>12</ChapterFirstPage><ChapterLastPage>26</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2000</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2002</Year><Month>11</Month><Day>6</Day></RegistrationDate><OnlineDate><Year>2002</Year><Month>11</Month><Day>7</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>1</PartID><BookID>3-540-45123-4</BookID><BookTitle>Combinatorial Pattern Matching</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Ian</GivenName><GivenName>H.</GivenName><FamilyName>Witten</FamilyName></AuthorName><Contact><Email>ihw@cs.waikato.ac.nz</Email></Contact></Author><Affiliation ID="Aff6"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Waikato</OrgName><OrgAddress><City>Hamilton</City><Country>New Zealand</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>What will it be like to work in tomorrow’s digital library? We begin by browsing around an experimental digital library of the present, glancing at some collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Browsing around a Digital Library: Today and Tomorrow</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Browsing around a Digital Library: Today and Tomorrow</title></titleInfo><name type="personal"><namePart type="given">Ian</namePart><namePart type="given">H.</namePart><namePart type="family">Witten</namePart><affiliation>Department of Computer Science, University of Waikato, Hamilton, New Zealand</affiliation><affiliation>E-mail: ihw@cs.waikato.ac.nz</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2002-11-07</dateIssued><copyrightDate encoding="w3cdtf">2000</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: What will it be like to work in tomorrow’s digital library? We begin by browsing around an experimental digital library of the present, glancing at some collections and showing how they are organized. Then we look to the future. Although present digital libraries are quite like conventional libraries, we argue that future ones will feel qualitatively different. Readers—and writers—will work in the library using a kind of context-directed browsing. This will be supported by structures derived from automatic analysis of the contents of the library—not just the catalog, or abstracts, but the full text of the books and journals—using new techniques of text mining.</abstract><relatedItem type="host"><titleInfo><title>Combinatorial Pattern Matching</title><subTitle>11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Raffaele</namePart><namePart type="family">Giancarlo</namePart><affiliation>Dipartimento di Matematica ed Applicazioni, Universitá die Palermo, Via Archirafi 34, 90123, Palermo, Italy</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">David</namePart><namePart type="family">Sankoff</namePart><affiliation>Centre de recherches mathématiques, Université de Montréal, succursale Centre-Ville, CP 6128, H3C 3J7, Montréal, Québec, Canada</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2000</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I2203X">Pattern Recognition</topic><topic authority="SpringerSubjectCodes" authorityURI="I21033">Document Preparation and Text Processing</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="M17009">Combinatorics</topic></subject><identifier type="DOI">10.1007/3-540-45123-4</identifier><identifier type="ISBN">978-3-540-67633-1</identifier><identifier type="eISBN">978-3-540-45123-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">62906</identifier><identifier type="BookID">3-540-45123-4</identifier><identifier type="BookChapterCount">34</identifier><identifier type="BookVolumeNumber">1848</identifier><identifier type="BookSequenceNumber">1848</identifier><identifier type="PartChapterCount">3</identifier><part><date>2000</date><detail type="part"><title>Invited Lectures</title></detail><detail type="volume"><number>1848</number><caption>vol.</caption></detail><extent unit="pages"><start>12</start><end>26</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2000</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2000</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2000</recordOrigin></recordInfo></relatedItem><identifier type="istex">D92801AD2F81264360629779EB14816C120943F9</identifier><identifier type="DOI">10.1007/3-540-45123-4_3</identifier><identifier type="ChapterID">3</identifier><identifier type="ChapterID">Chap3</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2000</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2000</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Agronomie/explor/SisAgriV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000482 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000482 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Agronomie
|area= SisAgriV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:D92801AD2F81264360629779EB14816C120943F9
|texte= Browsing around a Digital Library: Today and Tomorrow
}}
| This area was generated with Dilib version V0.6.28. |  |