Shown here are the raw source texts and contents (with titles simulated) of a sampling of HTML files spanning in time from January 23, 1991 through November 23, 1992, and which was the first version of HTML to have been documented to any degree. This is the much more familiar early HTML period, during which many new tags were introduced to round out the language. In mid-1991, a draft was begun of a document (online, HTML-text) to describe HTML as it existed at that point. Though the files to describe HTML have been slightly modified since then, the basic content is little changed from that time, and is as shown below. Four of the five files that carry details of HTML as it existed during that time were actually written in that version of HTML and are shown here first, after extracts from the fifth and main file which introduces HTML and serves as a Table of Contents to the other four files (but itself complies with the next version of HTML). By late November 1992, the documentation for this version of HTML would be modified for the last time, and would result in the following information:
The WWW system uses marked-up text to represent a hypertext document for transmision over the network. The hypertext mark-up language is an SGML format. WWW parsers should ignore tags which they do not understand, and ignore attributes which they do not understand of tags which they do understand.
To find out how to write HTML, or to write a program to generate it, read the following sections:-
The following does not form part of the specifciation.
HyperText Mark-up Language - Windows Internet Explorer
Unless otherwise defined by elements and entities, HTML text is interpreted as follows.
The text consists of a stream of lines. The division of the stream of characters into lines is arbitrary, and only made in order to allow the text to be passed through systems which can only handle text with a limited line length. The recommended line length for transmission is 80 characters, but htis is a recommendation only.
The division into lines has no significance (except in the case of example sections and PLAINTEXT ) apart from indicating a word end. Line breaks between tags have no significance.
<TITLE>HyperText Mark-up Language</TITLE> <NEXTID 24> <DL> <DT> </DL> <H1>Default text</H1>Unless otherwise defined by elements and entities, <A NAME=23 HREF=MarkUp.html>HTML</A> text is interpreted as follows.<P> The text consists of a stream of lines. The division of the stream of characters into lines is arbitrary, and only made in order to allow the text to be passed through systems which can only handle text with a limited line length. The recommended line length for transmission is 80 characters, but htis is a recommendation only.<P> The division into lines has no significance (except in the case of <A NAME=6 HREF=Tags.html#8>example sections</A> and <A NAME=5 HREF=Tags.html#7>PLAINTEXT</A> ) apart from indicating a word end. Line breaks between tags have no significance.<P>
Tags used in HTML - Windows Internet Explorer
This is a list of tags used in the HTML language. Each tag starts with a tag opener (a less than sign) and ends with a tag closer (a greater than sign). Many tags have corresponding closing tags which identical except for a slash after the tag opener. (For example, the TITLE tag).
Some tags take parameters, called attributes. The attributes are given after the tag, separated by spaces. Certain attributes have an effect simply by their presence, others are followed by an equals sign and a value. (See the Anchor tag, for example). The names of tags and attributes are not case sensitive: they may be in lower, upper, or mixed case with exactly the same meaning. (In this document they are generally represented in upper case.)
Currently HTML documents are transmitted without the normal SGML framing tags, but if these are included parsers will ignore them.
The title of a document is given between title tags:
<TITLE> ... </TITLE>
The text between the opening and the closing tags is a title for the hypertext node. There should only be one title in any node. It should identify the content of the node in a fairly wide context, and should ideally fit on one line.
The title is not strictly part of the text of the document, but is an attribute of the node. It may not contain anchors, paragraph marks, or highlighting. the title may be used to identify the node in a history list, to label the window displaying the node, etc. It is not normally displayed in the text of a document itself. Contrast titles with headings.
Obsolete: NeXT Browser only. May be ignored. This tag takes a single attribute which is the number of the next document-wide numeric identifier to be allocated (not good SGML). Note that when modifying a document, old anchor ids should not be reused, as there may be references stored elsewhere which point to them. This is read and generated by hypertext editors. Human writers of HTML usually use mnemonic alpha identifiers. Browser software may ignore this tag. Example of use:
<NEXTID 27>
Anchors specify addresses of other documents, in a from relative to the address of the current document. Normally, the address of a document is known to the browser because it was used to access the document. However, is a document is mailed, or is somehow visible with more than one address (for example, via its filename and also via its library name server catalogue number), then the browser needs to know the base address in order to correctly deduce external document addresses.
The format of this tag is not yet specified. NOT CURRENTLY USED
The format of an anchor is as follows:
<A NAME=xxx HREF=XXX> ... </A>
The text between the opening tag and the closing tag is either the start or destination (or both) of a link. Attributes of the anchor tag are as follows.
All attributes are optional, although one of NAME and HREF is necessary for the anchor to be useful.
This tag informs the reader that the document is an index document. As well as reading it, the reader may use a keyword search.
Format:
<ISINDEX>
The node may be queried with a keyword search by suffixing the node address with a question mark, followed by a list of keywords separated by plus signs. See the network address format .
This tag indicates that all following text is to be taken litterally, up to the end of the file. Plain text is designed to be represented in the same way as example XMP text, with fixed width character and significant line breaks. Format:
<PLAINTEXT>
This tag allows the rest of a file to be read efficiently without parsing. Its presence is an optimisation. There is no closing tag.
These styles allow text of fixed-width characters to be embedded absolutely as is into the document. The format is:
<LISTING> ... </LISTING>
The text between these tags is to be portrayed in a fixed width font, so that any formatting done by character spacing on successive lines will be maintained. Between the opening and closing tags:
The LISTING tag is portrayed so that at least 132 characters will fit on a line. The XMP tag is portrayed in a font so that at least 80 characters will fit on a line but is otherwise identical to LISTING. The examples of markup are here given using the XMP tag.
This tag indicates a new paragraph. The exact representation of this (indentation, leading, etc) is not defined here, and may be a function of other tags, style sheets etc. The format is simply
<P>
(In SGML terms, paragraph elements are transmitted in minimised form).
Several levels (at least six) of heading are supported. Note that a hypertext document tends to need less levels of heading than a normal document whose only structure is given by the nesting of headings. H1 is the highest level of heading, and is recommened for the start of a hypertext node. It is suggested that the first heading be one suitable for a reader who is already browsing in related information, in contrast to the title tag which should identify the node in a wider context.
<H1>, <H2>, <H3>, <H4>, <H5>, <H6>
These tags are kept as defined in the CERN SGML guide. Their definition is completely historical, deriving from the AAP tag set. A difference is that HTML documents allow headings to be terminated by closing tags:
<H2>Second level heading</h2>
This tag is for address information, signatures, etc, normally at the top or bottom of a document. typically, it is italic and/or right justified or indented. The format is:
<ADDRESS> text ... </ADDRESS>
The highlighted phrase tags may occur in normal text, and may be nested. For each opening tag there must follow a corresponding closing tag. NOT CURRENTLY USED.
<HP1>...</HP1> <HP2>... </HP2> etc.
A glosary (or definition list) is a list of paragraphs each of which has a short title alongside it. Apart from glossaries, this format is useful for presenting a set of named elements to the reader. The format is as follows:
<DL> <DT>Term<DD>definition pagagraph <DT>Term2<DD>Definition of term2 </DL>
A list is a sequence of paragraphs, each of which is preceded by a special mark or sequence number. The format is:
<UL> <LI> list element <LI> another list element ... </UL>
The opening list tag must be immediately followed by the first list element. The representation of the list is not defined here, but a bulleted list for unordered lists, and a sequence of numbered paragraphs for an ordered list would be quite appropriate. Other possibilities for interactive display include embedded scrollable browse panels.
Opening list tags are:
the closing tag must obviously match the opening tag.
<TITLE>Tags used in HTML</TITLE> <NEXTID 22> <H1>HTML Tags</H1>This is a list of tags used in the <A NAME=0 HREF=MarkUp.html#4>HTML</A> language. Each tag starts with a tag opener (a less than sign) and ends with a tag closer (a greater than sign). Many tags have corresponding closing tags which identical except for a slash after the tag opener. (For example, the<A NAME=3 HREF=#2> TITLE</A> tag).<P> Some tags take parameters, called attributes. The attributes are given after the tag, separated by spaces. Certain attributes have an effect simply by their presence, others are followed by an equals sign and a value. (See the <A NAME=5 HREF=#4>Anchor</A> tag, for example). The names of tags and attributes are not case sensitive: they may be in lower, upper, or mixed case with exactly the same meaning. (In this document they are generally represented in upper case.)<P> Currently HTML documents are transmitted without the normal SGML framing tags, but if these are included parsers will ignore them. <H2><A NAME=2>Title</A></H2>The title of a document is given between title tags: <XMP> <TITLE> ... </TITLE> </XMP>The text between the opening and the closing tags is a title for the hypertext node. There should only be one title in any node. It should identify the content of the node in a fairly wide context, and should ideally fit on one line.<P> The title is not strictly part of the text of the document, but is an attribute of the node. It may not contain anchors, paragraph marks, or highlighting. the title may be used to identify the node in a history list, to label the window displaying the node, etc. It is not normally displayed in the text of a document itself. Contrast titles with <A NAME=16 HREF=#15>headings</A> . <H2>Next ID</H2>Obsolete: NeXT Browser only. May be ignored. This tag takes a single attribute which is the number of the next document-wide numeric identifier to be allocated (not good SGML). Note that when modifying a document, old anchor ids should not be reused, as there may be references stored elsewhere which point to them. This is read and generated by hypertext editors. Human writers of HTML usually use mnemonic alpha identifiers. Browser software may ignore this tag. Example of use: <XMP> <NEXTID 27> </XMP> <H2><A NAME=11>Base Address</A></H2><A NAME=9 HREF=#4>Anchors</A> specify addresses of other documents, in a from relative to the address of the current document. Normally, the address of a document is known to the browser because it was used to access the document. However, is a document is mailed, or is somehow visible with more than one address (for example, via its filename and also via its library name server catalogue number), then the browser needs to know the base address in order to correctly deduce external document addresses.<P> The format of this tag is not yet specified. NOT CURRENTLY USED <H2><A NAME=4>Anchors</A></H2>The format of an anchor is as follows: <XMP> <A NAME=xxx HREF=XXX> ... </A> </XMP>The text between the opening tag and the closing tag is either the start or destination (or both) of a link. Attributes of the anchor tag are as follows. <DL> <DT><A NAME=13>HREF</A> <DD> If the HREF attribute is present, the anchor is senstive text: the start of a link. If the reader selects this text, he should be presented with another document whose network address is defined by the value of the HREF attribute . The format of the network address is specified <A NAME=10 HREF=../Addressing/Addressing.html>elsewhere</A> . This allows for the form HREF=#identifier to refer to another anchor in the same document. If the anchor is in another document, the atribute is a <A NAME=14 HREF=../Addressing/Relative.html>relative name</A> , relative to the documents address (or specified <A NAME=12 HREF=#11>base address</A> if any). <DT>NAME <DD> The attribute NAME allows the anchor to be the destination of a link. The value of the parameter is that part of a hypertext address which follows the <A NAME=19 HREF=../Addressing/BNF.html#21>hash sign</A> . <DT><A NAME=21>TYPE</A> <DD> An attribute TYPE may give the relationship described by the hyertext link. The type is expressed by a string for extensibility. Strings for types with particular semantics will be registered by the W3 team. The default relationship if none other is given is void. </DL> All attributes are optional, although one of NAME and HREF is necessary for the anchor to be useful. <H2><A NAME=18>IsIndex</A></H2>This tag informs the reader that the document is an index document. As well as reading it, the reader may use a keyword search.<P> Format: <XMP> <ISINDEX> </XMP>The node may be queried with a keyword search by suffixing the node address with a question mark, followed by a list of keywords separated by plus signs. See the <A NAME=1 HREF=../Addressing/Search.html>network address format</A> . <H2><A NAME=7>Plaintext</A></H2>This tag indicates that all following text is to be taken litterally, up to the end of the file. Plain text is designed to be represented in the same way as example XMP text, with fixed width character and significant line breaks. Format: <XMP> <PLAINTEXT> </XMP>This tag allows the rest of a file to be read efficiently without parsing. Its presence is an optimisation. There is no closing tag. <H2><A NAME=8>Example sections</A></H2>These styles allow text of fixed-width characters to be embedded absolutely as is into the document. The format is: <XMP> <LISTING> ... </LISTING> </XMP>The text between these tags is to be portrayed in a fixed width font, so that any formatting done by character spacing on successive lines will be maintained. Between the opening and closing tags: <UL> <LI>The text may contain any ISO Latin printable characters, including the tag opener, so long as it does not contain the closing tag in full. <LI>Line boundaries are significant, and are to be interpreted as a move to the start of a new line. <LI>The ASCII Horizontal Tab (HT) character should be interpreted as the smallest positive nonzero number of spaces which will leave the number of characters so far on the line as a multiple of 8. Its use is not recommended however. </UL>The LISTING tag is portrayed so that at least 132 characters will fit on a line. The XMP tag is portrayed in a font so that at least 80 characters will fit on a line but is otherwise identical to LISTING. The examples of markup are here given using the XMP tag. <H2>Paragraph</H2>This tag indicates a new paragraph. The exact representation of this (indentation, leading, etc) is not defined here, and may be a function of other tags, style sheets etc. The format is simply <XMP> <P> </XMP>(In SGML terms, paragraph elements are transmitted in minimised form). <H2><A NAME=15>Headings</A></H2>Several levels (at least six) of heading are supported. Note that a hypertext document tends to need less levels of heading than a normal document whose only structure is given by the nesting of headings. H1 is the highest level of heading, and is recommened for the start of a hypertext node. It is suggested that the first heading be one suitable for a reader who is already browsing in related information, in contrast to the <A NAME=6 HREF=#2>title</A> tag which should identify the node in a wider context. <XMP> <H1>, <H2>, <H3>, <H4>, <H5>, <H6> </XMP>These tags are kept as defined in the CERN SGML guide. Their definition is completely historical, deriving from the <A NAME=17 HREF=AAP.html>AAP</A> tag set. A difference is that HTML documents allow headings to be terminated by closing tags: <XMP> <H2>Second level heading</h2> </XMP> <H2><A NAME=20>Address</A></H2>This tag is for address information, signatures, etc, normally at the top or bottom of a document. typically, it is italic and/or right justified or indented. The format is: <XMP> <ADDRESS> text ... </ADDRESS> </XMP> <H2>Highlighting</H2>The highlighted phrase tags may occur in normal text, and may be nested. For each opening tag there must follow a corresponding closing tag. NOT CURRENTLY USED. <XMP> <HP1>...</HP1> <HP2>... </HP2> etc. </XMP> <H2>Glossaries</H2>A glosary (or definition list) is a list of paragraphs each of which has a short title alongside it. Apart from glossaries, this format is useful for presenting a set of named elements to the reader. The format is as follows: <XMP> <DL> <DT>Term<DD>definition pagagraph <DT>Term2<DD>Definition of term2 </DL> </XMP> <H2>Lists</H2>A list is a sequence of paragraphs, each of which is preceded by a special mark or sequence number. The format is: <XMP> <UL> <LI> list element <LI> another list element ... </UL> </XMP>The opening list tag must be immediately followed by the first list element. The representation of the list is not defined here, but a bulleted list for unordered lists, and a sequence of numbered paragraphs for an ordered list would be quite appropriate. Other possibilities for interactive display include embedded scrollable browse panels.<P> Opening list tags are: <DL> <DT>UL <DD> A list multi-line paragraphs, typically separated by some white space. <DT>MENU <DD> A list of smaller paragraphs. Typically one line per item, with a style more compact than UL. <DT>DIR <DD> A list of short elements, less than one line. Typical style is to arrange in four columns or provide a browser, etc. </DL> the closing tag must obviously match the opening tag.
The nine errors found upon validating this file are all caused by the inclusion of closing tags within example
<XMP> sections, namely for TITLE, A, LISTING, H2, ADDRESS, HP1, HP2, DL, and UL. This
therefore demonstrates the reasoning behind replacing XMP with PRE, since in that case the entities described in
the next file could have been used to display the closing tags. This file would otherwise have been valid.
Entities -- /MarkUp - Windows Internet Explorer
The following entity names are used in HTML, prefixed by ampersand and followed by a semicolon. They represent particular graphic characters which have special meanings in the markup, or are not part of the allowed character set.
<TITLE>Entities -- /MarkUp</TITLE> <NEXTID 2> <H1>Entities</H1>The following entity names are used in <A NAME=1 HREF=MarkUp.html>HTML</A>, prefixed by ampersand and followed by a semicolon. They represent particular graphic characters which have special meanings in the markup, or are not part of the allowed character set. <DL> <DT>lt <DD> The less than sign < <DT>gt <DD> The "greater than" sign > <DT>amp <DD> The ampersand sign & itself. </DL> <ADDRESS><A NAME=0 HREF=http://info.cern.ch./hypertext/TBL_Disclaimer.html>Tim BL</A></A> </ADDRESS>
Hypertext HTML formatting example - Windows Internet Explorer
This is an example bit of hypertext - compare the formatted version with the original HTML source. Let's try introducing an initial paragrpah between the H1 and the H2 headings.
This file contains a test set of HTML mark-up, as a test of hypertext browsers and an example of the syntax of the tags. See also:
That is the end of the list.
Anchors come in two forms: whole nodes or parts of nodes. The line mode browser can't currently (Nov 91) jump to a part of a node: it always jumps to the top.
Here is an anchor which leads to the VM FIND command. Note the nested highlighting (hp2) within the anchor. If you want to click on this, you will go to the system default page.
Now THIS leads to anchor #2 in this file, and if you want to click on THIS, you should go to the system default page with anchor #2 selected. Now the word "destination" is a named destination anchor, connected to the word "source" . Clicking on the destination shouldn't do anything. Selecting the source should lead to the destination.
Now let's go through the limited set of markup tags which we accept. The title, "Hypertext HTML formatting example" was between TITLE tags. "Test Dataset" at the top of this page was a Level One Heading (H1). The quick brown fox jumps over the lazy dog. In Hertford, Hereford and hampshire, hurricanes hardly happen.
Here is some text which follows the heading. The quick brown fox jumps over the lazy dog. In Hertford, Hereford and hampshire, hurricanes hardly happen.
Here is some text which follows the heading. The quick brown fox jumps over the lazy dog. In Hertford, Hereford and hampshire, hurricanes hardly happen.
This is a test paragraph. It is separated from the previous one by a P paragraph mark.
This new paragraph was separated from the previous one by a blank line, a horrible leftover from SCRIPT, which violates the free format of the text.
This was delimited in the same way in the source. The blank line should have the same effect as a paragraph mark. We have included in HTML some tags from the SGML tagset used at and once supported at CERN by quite a lot of documentation and SGML examples. The HTML parser will ignore tags which it does not understand, and will ignore attributes which it does not understand of CERN-SGML tags. Of course, the HTML parser will not accept any commands in the SCRIPT language.
Now for an example section, in monospaced font:
_-_
[o,o]
\-/
This text is laid out using fixed-width characters
-----------
It uses the <XMP> tag, and can contain embedded < and > signs. It has
tabs every eight columns like good old simple systems we know and love.
12345678123456781234567812345678123456781234567812345678123456781234567812345678
! ! ! ! ! ! ! ! ! !
Column: First Second Third Fourth Fifth Sixth Seventh Eighth Ninth
Index: 1 2 3 4 5 6 7 8 9
Junk: The Quick brown fox jumps over the lazy dog.
After the example text, we revert to the default again.
Now lets us try out a glossary. A glossary has a large hanging indent aligned with a first tab stop.
And after that dazzling display of formatting, how about an unordered list:
Now let's try a "MENU" section. It's the same as a list but intended for single-line sized entities, not too spaced out. It could be a browser panel.
Now let's try a "DIR" section. It's the same, but elements are expected to be smaller and to be arranged in columns.
Now let's try a "LISTING" section. The tabs should be every 8 spaces.
123456781234567812345678123456781234567812345678123456781234567812345678123456781234567 ! ! ! ! ! ! ! ! ! ! ! Column: First Second Third Fourth Fifth Sixth Seventh Eighth Ninth Tenth Index: 1 2 3 4 5 6 7 8 9 10 Junk: The Quick borwn fox jumps over the lazy dog again!
This is the end of the test file.
<TITLE>Hypertext HTML formatting example</TITLE>
<NEXTID 11>
<H1>Test Dataset</H1>This is an example bit of hypertext - compare the formatted version
with the <A NAME=10 HREF=test_source.txt>original HTML source</A>. Let's try introducing an initial paragrpah
between the H1 and the H2 headings.
<H2>Introduction</H2>This file contains a test set of HTML mark-up, as a test of hypertext
browsers and an example of the syntax of the tags. See also:
<UL>
<LI><A NAME=0 HREF=news:1990Oct17.231522.17662@midway.uchicago.edu>An arbitrary news article</A>
<LI><A NAME=1 HREF=news:alt.hypertext>The newsgroup on hypertext</A>
<LI><A NAME=2 HREF=../TheProject.html>More details about the WWW project.</A>
</UL>That is the end of the list.
<H2>Some anchors</H2>Anchors come in two forms: whole nodes or parts of nodes. The line
mode browser can't currently (Nov 91) jump to a part of a node: it
always jumps to the top.
<H3>Leading to whole nodes</H3>Here is an anchor which leads to <A NAME=3 HREF=http://crnvmc.cern.ch/FIND/PUB.P.HELPCMS.FIND(X,G)>the VM FIND command.</A> Note the nested
highlighting (hp2) within the anchor. If you want to click on <A NAME=4 HREF=http://info.cern.ch/hypertext/WWW/LineMode/Defaults/default.html>this,</A>
you will go to the system default page.
<H3>Leading to anchors within nodes</H3>Now <A NAME=5 HREF=#2>THIS</A> leads to anchor #2 in this file, and if you want to click
on <A NAME=6 HREF=http://info.cern.ch/hypertext/WWW/LineMode/Defaults/default.html#2>THIS,</A> you should go to the system default page with anchor #2 selected.
Now the word <A NAME=dest1>"destination"</A> is a named destination anchor, connected
to the word <A NAME=7 HREF=#dest1>"source"</A> . Clicking on the destination shouldn't do anything.
Selecting the source should lead to the destination.<P>
Now let's go through the limited set of markup tags which we accept.
The title, "Hypertext HTML formatting example" was between TITLE tags.
"Test Dataset" at the top of this page was a Level One Heading (H1).
The quick brown fox jumps over the lazy dog. In Hertford, Hereford
and hampshire, hurricanes hardly happen.
<H2>Level two heading</H2>Here is some text which follows the heading. The quick brown fox jumps
over the lazy dog. In Hertford, Hereford and hampshire, hurricanes
hardly happen.
<H3>Level 3 heading</H3>Here is some text which follows the heading. The quick brown fox jumps
over the lazy dog. In Hertford, Hereford and hampshire, hurricanes
hardly happen.<P>
This is a test paragraph. It is separated from the previous one by
a P paragraph mark.<P>
This new paragraph was separated from the previous one by a blank
line, a horrible leftover from SCRIPT, which violates the free format
of the text.<P>
This was delimited in the same way in the source. The blank line should
have the same effect as a paragraph mark. We have included in HTML
some tags from the SGML tagset used at and once supported at CERN
by<A NAME=8 HREF=http://crnvmc.cern.ch./FIND?SGML> quite a lot of documentation and SGML examples.</A> The HTML parser
will ignore tags which it does not understand, and will ignore attributes
which it does not understand of CERN-SGML tags. Of course, the HTML
parser will not accept any commands in the<A NAME=9 HREF=http://crnvmc.cern.ch./FIND/pub.p.helpcms.xscript> SCRIPT</A> language.<P>
Now for an example section, in monospaced font:
<XMP>
_-_
[o,o]
\-/
This text is laid out using fixed-width characters
-----------
It uses the <XMP> tag, and can contain embedded < and > signs. It has
tabs every eight columns like good old simple systems we know and love.
12345678123456781234567812345678123456781234567812345678123456781234567812345678
! ! ! ! ! ! ! ! ! !
Column: First Second Third Fourth Fifth Sixth Seventh Eighth Ninth
Index: 1 2 3 4 5 6 7 8 9
Junk: The Quick brown fox jumps over the lazy dog.
</XMP>After the example text, we revert to the default again.
<H3>Glossary</H3>Now lets us try out a glossary. A glossary has a large hanging indent
aligned with a first tab stop.
<DL>
<DT>Glossary
<DD> A list of definitions of terms. Each term is given in a left-hand
column, with a longer textual definition being given in a right-hand
column.
<DT>Term
<DD> A word or phrase being defined.
<DT>Definition
<DD> A sentences or sentences which define the term. the definition
can wrap around in the second column, but the term can't wrap around
in the second column.
</DL>
And after that dazzling display of formatting, how about an unordered
list:
<UL>
<LI>This is the first element of an unordered list
<LI>This is the 2nd element of an unordered list
<LI>This is the 3rd element of an unordered list
<LI>This is the 4th element of an unordered list
</UL>
Now let's try a "MENU" section. It's the same as a list but intended for single-line sized entities, not too spaced out. It could be a browser panel.
<MENU>
<LI>This is the first element of a menu
<LI>This is the 2nd element of a menu
<LI>This is the 3rd element of a menu
<LI>This is the 4th element of a menu
</MENU>
Now let's try a "DIR" section. It's the same, but elements are expected to be smaller and to be arranged in columns.
<DIR>
<LI>First element of directory
<LI>This is the 2nd element
<LI>Third<li>fouth<li>fifth<li>sixth element of a directory
<LI>This is the 7th element of directory
</DIR>
Now let's try a "LISTING" section. The tabs should be every 8 spaces.
<LISTING>
123456781234567812345678123456781234567812345678123456781234567812345678123456781234567
! ! ! ! ! ! ! ! ! ! !
Column: First Second Third Fourth Fifth Sixth Seventh Eighth Ninth Tenth
Index: 1 2 3 4 5 6 7 8 9 10
Junk: The Quick borwn fox jumps over the lazy dog again!
</LISTING>This is the end of the test file.
The following selected files are provided as samples of other HTML files written
in this particular version of HTML. One of the unexpected things one finds is that the
entities described in files near the end of this period (seen above) seem to be pretty
much the first appearences of the use of character entities. There are several occurrences
of the "&" character as simply the naked raw character, so either
it was not yet seen as the first character of an HTML entity or else it was expected that
browsers even back then would be smart enough to recognize the raw character as itself
when not followed by any valid letters of a known HTML entity.
The DTD I have constructed for validating these files, namely "html0.c.dtd," is
used for checking most of these files. Click on the "(Validate)" link at the end
of each to see how they fared as files, as best as one can discern regarding the
"standards" of this early period. For this validation, I have prepared local
copies of each file to which I have added the <!DOCTYPE> declaration to each to
link it to that DTD. In addition, many of these files contain / and #
characters that force me to add quotation marks around the link pointer fields, so as to
prevent the rise of spurious errors. No other changes have been done to these files, so
any other errors found (apart from the two standard warnings about not knowing whether to
parse by XML or SGML and about document level character encoding) indeed point to actual
errors in the files themselves.
<XMP> Countries & number of participants: Austria 1 Belgium 5 Brasil 6 Canada 5 Denmark 16 Finland 4 France 85 Germany 34 Ireland 2 Israel 1 Italy 41 Japan 13 Luxembourg 1 Netherlands 9 Norway 3 Portugal 4 Sierra Leone 1 Singapore 1 South Africa 2 Spain 2 Sweden 4 Switzerland 15 UK 37 USA 31 total number of participants: 323 List by name: name first name organisation country ABBOU Andre LA TRIBUNE DES INDUSTRIES France ADAMS Carol IBM USA AHARI Parviz ERICSSON TELECOM Sweden AKSCYN Robert KNOWLEDGE SYSTEMS USA ALBUQUERQUE Eduardo UNIV. FEDERAL DE PERNAMBUCO Brasil ANDERSEN Peter Bogh UNIV. OF AARUS Denmark ANDRE Jacques INRI RENNES France ANSCHUTZ Hans TRIUMPH ADLER Germany ANSEL Bettina ZURICH UNIVERSITY Switzerland ANTINUCCI Francesco ISTITUTO Dl PSICOLOGIA Italy ARENTS Hans C. CATHOLIC UNIV. LEUVEN Belgium ARGENTESI Flavio C.E.C. Italy ASSELIN Yves UNIV. DE QUEBEC Canada BAIRD Patricia UNIV. OF STRATHCLYDE UK BANDEIRA Rogerio TECH. UNIV. OF LISBON Portugal BARATTELLI Giovanni AGENCE ANSA France BARONE Richard NORTHWESTERN UNIVERSITY USA BECHTEL Brian APPLE COMPUTER USA BELMONTE Josep Lluis I.T.C. Spain BERNERS-LEE Tim C.E.R.N. Switzerland BERNSTEIN Mark EASTGATE SYSTEMS USA BEYOU Claire UNIVERSITE DU MAINE France BIEBER Michael BOSTON COLLEGE USA BIENNIER Frederique INSA LYON France BINDING Angelika SPINGER-VERLAG Germany BLAVIER Andre INFORMATIQUE CDC France BLOCH Annie ENPC-CERAS France BLUM Jorg INOVIS GmbH & Co Germany BOECKEL Katrin SATZ-RECHEN-ZENTRUM Germany BOISSON Jean-Francois BULL sa France BORNES Christian INRIA France BOTHMA Theo J.D. UNIV. OF SOUTH AFRICA South Africa BRAFFORT Paul CIMA France BRANDELAND Asbjorn UNIV. OF OSLO Norway BRANDSMA Ewout PHILIPS RESEARCH Netherlands BRIATTE Katell UNIV. DE LILLE 111 France BRIGGS Jonathan SCHOOL OF INFORMATION SYSTEMS UK BROADY Donald ROYAL INST. OF TECHNOLOGY Sweden BROUN Peter UNIV. OF KENT UK BROWN Heather UNIV. OF KENT UK BRUANDET Marie-France I.M.A.G. France BRUZA Peter UNIV. OF NIJMEGEN Netherlands BURR Barbara UNIV. DE STUTTGART Germany BUZZETTI Dino UNIVERSITA DI BOLOGNA Italy CABRE Hervé UNIVERSITE DE LILLE France CAGNAZZO Maria Rosaria UNIV. DEGLI STUDI Italy CAILLIAU Robert C.E.R.N. Switzerland CALOINI Andrea POLITECNICO DI MILANO Italy CAMICI Alessandro INTELS SISTEMI Italy CAMPANIIE Benedetta UNIVERSITA BARI Italy CANALS Isidre INST. D'ESTADISTICA DE CATALUNYA Spain CANGIA Caterina UNIVERSITA SALESIANA Italy CARRICO Luis INESC Portugal CATENAZZI Nadia C.E.C. Italy CATLIN Karen HITACHI EUROPE LTD UK CAUDILLO Ruben I.N.T. France CESARENI Maria-Donata UNIVERSITA DI ROMA Italy CLEMENT Daniele UNIVERSITE DE LILLE France COEZ Jean-Claude IBM FRANCE France COHEN Atika ULB Belgium COL ZZO Luigi UNIV. DI TRENTO Italy COLIN Beatrice BULL sa France COLIN DE CASAUBON Didier LAROUSSE France COLORIO Massimo IBM Semea S.r.l Italy COMEAU Jean-Marie UNIV. DE QUEBEC Canada CORDES Ralf TELENORMA Germany COVO Jacqueline SYMBOLlCS INC. USA CREHANGE Marion CRIN/CNRS/UR 262 France CROFT Bruce UNIV. OF MASSACHUSETTS USA DACHELET Roland I .N.R. I .A. France DAVI S Monica France DAVIES Edwards Sierra Leone DE BRA Paul EINDHOVEN UNIV. OF TECHNOLOGY Netherlands DE VRIES A. Erica EINDHOVEN TECHN. UNIV. Netherlands DE YOUNG Laura PRICE WATERHOUSE USA DELACENSERIE Dominique EDF/ISDM France DELAVAL Marcel C.E.C. Italy DEMEVER Serge V.U.B. Belgium DESARMENIEN Anne GROUPE ESIEE France DETER Renee CLEMSON UNIV. USA DIENG Moussa France DOIG Jeremy UNIV. AT KENT UK DONOVAN Kevin DIGITAL EOUIPMENT FRANCE France DROUHARD Jean-Philippe INRP/DPS France DU Xiang Ru BULL sa France DUPOIRIER Gérard RANK XEROX France DYKIEL Richard BULL sa France ECHOLM Kai TAMPERE UNIVERSITY Finland ENGEL Juliette U.I.C.F. France FACHE Guy INSEE D.G. France FACQ Jean-Remy MATRA MS21 France FAFIOTTE Georges I.M.A.G.-GET France FEDRIZZI Mario UNIVERSITA DI TRENTO Italy FERRI Henri INFORMATlQUE CDC France FODALE Daniel BOEING COMPUTER SERVICES USA FONSECA Decio UNIV. FEDERAL DE PERNAMBUCO Brasil FOUNTAIN Andre UNIV. OF SOUTHAMPTON UK FRANENSTEIN Thomas Germany FURUTA Richard UNIV. OF MARYLAND USA GADOMSKA Magdalena C.E.C. Italy GAGLIARDI Roberto UNIVERSITA DI CAMERINO Italy GAMMELGAARD Jacob DANISH EMPLOYERS Denmark GARDNER Lesley LONDON SCHOOL OF ECONOMICS UK GARZOTTO Franca POLITECNICO Dl MILANO Italy GEFFRAY Thierry GECI INTERNATIONAL France GEHR Christoph SIA Switzerland GENTHON Philippe INP IPSI France GERSTENDORFER Monika IBM-GERMANY Germany GIANESINI Paolo CERVED S.A. Italy GIANNOTTI Elena UNIVERSITA DI GENOVA Italy GIBRAT T. HATIER LOGICIELS France GIORGETTI Roberto IBM SEMEA S.r.l Italy GLOOR Peter MIT UK GRINDORF Helle PROLOG DEVELOPMENT CENTER Denmark GROTEN Ludwig DAIMLER-BENZ AG Germany GUICHARD Marc FRANCE TELECOM France GUIMARAES Nuno INESC Portugal GUINAN Catherine DUBLIN CITY UNIV. Ireland GUITTET Christian C.C.E. Luxembourg HAITTO Hasse ROYAL INST. OF TECHNOLOGY Sweden HALL Wendy UNIV. OF SOUTHAMPTON UK HANNON Donald.C. ROKE MANOR RESEARCH LTD UK HARDI Christian France HARDMAN Lynda OFFICE WORKSTATIONS LIMITED Netherlands HARGROVE Jeffrey Univ. Paris 7-6 France HAUSER Herman Active Book Company UK HEATH lan UNIV. OF SOUTHAMPTON UK HEIMBURGER Anneli T.R.C. OF FINLAND Finland HEKANAHO Jukkapekka ABO AKADEMI UNIV. Finland HERAUD Christian France HEROLD Christine Switzerland HILBIG Wolfgang SATZ-RECHEN-ZENTRUM Germany HIRAI Yoshimitsu JIPDEC Japan HJORTH RASMUSSEN Lise-Hotte UK HOFMANN Martin TECHN.UNIV. BRAUNSCHUEIG Germany HOUBEN Geert-Jan EINDHOVEN UNIV. OF TECHNOLOGY Netherlands HUBY Danielle I.F.P. France IPPOLITO Giacomo C.R.E.S. Italy IRLER Wolfgang UNIV. DI TRENTO Italy ISENMANN Severin UNIVERSITAT ULM Germany JANKO Wolfgang UNIVERSITY OF ECONOMICS Austria JENSEN Michael Voel DANISH EMPLOYERS Denmark JUCQUOIS-DELPIERRE Monique HEINRICH-HEINE-UNIV. DUSSELDORF Germany KACMAR Charles Chuck RENSSELAER POLY. INST. USA KAHN Paul BROWN UNIV. USA KANJI Anise INST. of ISMAILI STUDIES Ltd UK KATO Shigenobu TOPPAN PRINTING Japan KESHAVJEE Rafique INST. of ISMAILI STUDIES Ltd UK KIBBY Michaël UNIV. OF STRATHCLYDE UK KIKUCHI Kiyoshi TOSHIB CORPORATION Japan KIKUCHI Schunichi Japan Information Japan KLEBERG Stephan TECHNISCHE UNIV. BERLIN Germany KNUTH Randy INDIANA UNIV. USA KOHLER Niklaus E.P.F.L. Switzerland KOMMERS Piet TWENTE UNIVERSITY Netherlands KORHONEN Timo Antero Finland KORNATZKY Yoram THE HEBREW UNIVERSITY Israel KRUGER Frank UNIV. DES SAARLANDES Germany KULHEN Rainer UNIVERSITAT KONSTANZ Germany KUWAYAMA Etsuo INST.for PERS.INFO.ENVIRONMENT Japan LACOMBE Eric CEDROM TECHNOLOGIES France LACQUANTI Alessandro CERVED S.A. Italy LAFFITTE Monique C.S.I. France LAMBERT Jerry CLEMSON UNIV. USA LANDOLT Thomas U.B.S. Switzerland LANDONI Monica C.E.C. Italy LANESTEDT Jon UNIV. OF OSLO Norway LANGE Dieter T.B.Z. HAMBURG Denmark LE BORGNE Herve Fed. Credit Mutuel France LE DAIN Jean-Michel I.U.A. France LE MOUEL Jacques SIT France LEGGETT John TEXAS A&M UNIV. USA LENOEL Bernard EDF-DER France LEPERS Jean-Marc UNIVERSITE PARIS 8 France LEROUX Dominique EDF-DER France LESSING Casper POTCHEFSTROOM UNIV. South Africa LEVY Remy SFGL France LIESTOL Gunnar UNIV. OF OSLO Norway LIGUORO Gennaro C.R.E.S. Italy LINDEN Andre UNIV. GENEVE Switzerland Ll Zhuo Xun UNIV. OF SOUTHAMPTON UK LUCARELLA Dario UNIV. OF MILAN Italy MABROUK M'Bark BULL sa France MAC MORROW Noreen UNIV. OF STRATHCLYDE UK MACLEOD lan GECI INTERNATIONAL France MAIOLI Cesare UNIV. OF BOLOGNA Italy MAKIMURA Nobuyuki FUJITSU LIMITED Japan MANGIARACINA Silvana ISTITUTO Dl TECNOLOGIE Italy MASSON Francine ECOLE POLYTECHNIQUE France Mc ARTHUR Richard PIRA UK McALEESE Ray HERIOT WATT UNlVERSlTY UK McBRlDE Nicole POLYTECHNlC OF NORTH LONDON UK McCALL Raymond UNIV.OF COLORADO USA McKNlGHT Cliff LOUGHBOROUGH UNIV. UK MEIRA Silvio UNIV. FEDERAL DE PERNAMBUCO Brasil MEMBRADO Miguel ERGOSUM France MEUNIER Herve SFGL France MEYROWlTZ Norman IRIS/BROWN UNIV. USA MICELLI Vita Lia Italy MICH Luisa UNIVERSITA DI TRENTO Italy MIDORO Vittorio C.N.R. Italy MINIO Roberto PIRA UK MIWA Michio MATSUSHITA ELECTRIC Japan MORETTI Lorenzo ISTITUTO Dl LINGUISTICA Italy MUHLHAUSER Max UNIV. OF KAISERSLAUTERN Germany MUNCH Klaus C.R.I. A/S Denmark MURALI N.S. Research Centre for Plant Protection Denmark MYHRVOLD Nathan MICROSOFT CORPORATION USA MYLONAS Elli HARVARD UNlVERSlTY USA NANARD Marc UNIVERSITE DE MONTPELLIER France NELSON Gerald C. UNIV. OF ILLIONOIS USA NONOGAKI Hajime FUJITSU LIMITED Japan NOZAWA Shuji MITSUBISHI ELECTRIC Co Japan O TES Nicholas ST. MARY'S HOSP. MEDICAL SCHOOL UK O'BRIEN Paul BRITISH TELECOM UK OGAUA Ryuichi NEC Corporation Japan OREN Tim APPLE COMPUTER USA OSTERBYE Kasper UNIV. OF AALBORG Denmark PAGANI Daniele POLITECNICO Dl MILANO Italy PAOLINI Paolo POLITECNICO Dl MILANO Italy PAQUET Gael GRAPHAEL USA PATUREAU Jean-Pierre BERTIN ET CIE France PERCIVAL Mark UNIV. OF STRATHCLYDE UK PETERSEN Anette SCAITECH A/S Denmark PHELPS Robert SWIFT Belgium PIMENTEL Maria Da Graca Campo UNIV. OF KENT UK PINTADO Xavier UNIV. GENEVE Switzerland PIRELLI Giuliano C.E.C./JRC Italy PLUTINO Antonio SFGL France POLZONETTI Alberto UNIVERSITA DI CAMERINO Italy PUTRESS John AT&T BELL LABORATORIES USA PUZIN Martine I.N.R.S. France QUESNEL Gilles A. UNIV. DE QUEBEC Canada QUINT Vincent INRIA France RADA Roy UNIV. OF LIVERPOOL UK RAIM Marty GECI INTERNATIONAL France RAMAIAH Kodanda LOUGHBOROUGH UNIV. UK RASMUSSEN Kurt DANISH EMPLOYERS Denmark RAULT Andre PSA/DITA France RAYNER Douglas DIGITAL EOUIPMENT FRANCE France RHINER Mathias Switzerland RICCI Franca UNIVERSITA DI GENOVA Italy RICHARD Pascal MATRA ESPACE France RICHARTZ Martin UNIV. OF KAISERSLAUTERN Germany RIEHM Ulrich KERNFORSCHUNGSZENTRUM KARLSRUHE Denmark RITCHIE lan OWL INTERNATIONAL UK RITTBERGER Marc UNIVERSITAT KONSTANZ Germany RIZK Antoine INRIA France RlCHY Helene INRIA France RONY-SINNO Sandra BPI/CENTRE POMPIDOU France ROUET Jean-FranSois URA CNRS France ROZEBOOM Christian DIGITAL EQUlPMENT FRANCE France SANSON Jean-Luc EDF-DER/IPN France SANTOS Cassio UNIV. FEDERAL DE PERNAMBUCO Brasil SCAVETTA Domenico UNIVERSITE PARIS 8 France SCHAPER Joachim DIGITAL EQUIPMENT Germany SCHEIDT Michael Leibniz-Rechenzentrum Germany SCHIFF Jack SIEMENS AG Germany SCHNEIDER Raymond IUT STRASBOURG SUD France SCHUKAT Horst SIEMENS AG Germany SCHULER Wolfgang GMD-IPSI Germany SCHULZ Angelika UNIV. DES SAARLANDES Germany SCHUTT Helge GMD-IPSI Germany SCHWABE Daniel Pontificia Universidade Catolica Brasil SCHWANENBERG Peter Fachhochschule Koln Germany SCHWARTZ Richard BORLAND France SHAH Dipak STC TECHNOLOGY LTD UK SHEPHERD Michael DALHOUSIE UNIVERSITY Canada SHERMAN Mark CARNEGIE MELLON UNIV. USA SHNEIDERMAN Ben UNIV. OF MARYLAND USA SILVA Roger ILTEC Portugal SINGER Danco GOLEM-NEUSLETTER Italy SKOGVOLD Stein E.S.A. Italy SKOV Flemming DANISH RESEARCH SERVICE Denmark SMITH John B. UNIV. OF NORTH CAROLINA USA SMITH lan E.P.F.L. Switzerland SPIRO David BULL sa France STEFFENSEN Lars Bo Denmark STOTTS David UNIV. OF MARYLAND USA STREITZ Norbert GMD-IPSI Germany SWEATON Alan DUBLIN CITY UNIV. Ireland SYLVESTRE Jean SDC INFORMATIQUE France TAKASHIMA Yosuke NEC Corporation Japan TAMURA Koichiro ELECTROTECHNICAL LABORATORY Japan TEPEDINE Fernande UNIV. FEDERAL DE PERNAMBUCO Brasil TERRAVAZZI Giovanna MOZART-LUCREZIO LAB Italy THEVOZ Jacques TRIBUNAL FEDERAL SUISSE Switzerland THOBANI Shiraz INST. of ISMAILI STUDIES Ltd UK THOREL Francois BULL sa France TISSOT Marie-Claire UNIV. FRIBOURG Switzerland TRIGG Randall UNIV. OF AARUS Denmark TUCKER Mark PHILIPS RESEARCH Netherlands UEDA Michio FUJI XEROX Co Japan ULRICH Helmut SCHERING AG Germany VAINIO-LARSSON Arja LINKOPING UNIVERSITY Sweden VAN ZIJL Herbert ELSEVIER Netherlands VASSART Michel TRACTEBEL Belgium VENTURA Andrea U.B.S. Switzerland VERCOUSTRE Anne-Marie INRIA France VERROUST Gerard UNIVERSITE PARIS 8 France VIEVILLE Claude UNIVERSITE DE LILLE France VILLEMOT Luc PSA/DITA France VITALI Fabio UNIV. OF BOLOGNA Italy VULDY Jean-Louis EDF-DER France WAGNER Olaf Germany WALKER Janet DIGITAL EQUIPMENT CO USA WALLISER Dorothee AGENCE ANSA France WARNKE Martin UNIVERSITAT LUNEBURG Germany WATERWORTH John A. Nal UNIV. SINGAPORE Singapore WATTERS Carolyn DALHOUSIE UNlVERSlTY Canada WEISKE Thomas TECHNISCHE UNIV. MUNCHEN Germany WENDT Holger SPINGER-VERLAG Germany WENTLAND-ROZENMOLL Marie O.M.P.P. Switzerland WHALL Dick COVENTRY POLYTECHNIC UK WICH Norbert Germany WIIL Uffe Kock UNIV. OF AALBORG Denmark WILLIAMS lan OWL/FRAME France WILSON Eve UNIV. OF KENT UK WRIGHT Patricia MRC UK YOKOYAMA Shigetoshi MIT USA ZABICKI Mark CEDROM TECHNOLOGIES France ZANGENBERG Henrik Denmark ZHENG Yi UNIV. OF KENT UK List by country: name first name organisation country JANKO Wolfgang UNIVERSITY OF ECONOMICS Austria ARENTS Hans C. CATHOLIC UNIV. LEUVEN Belgium PHELPS Robert SWIFT Belgium VASSART Michel TRACTEBEL Belgium COHEN Atika ULB Belgium DEMEVER Serge V.U.B. Belgium SCHWABE Daniel Pontificia Universidade Catolica Brasil ALBUQUERQUE Eduardo UNIV. FEDERAL DE PERNAMBUCO Brasil FONSECA Decio UNIV. FEDERAL DE PERNAMBUCO Brasil MEIRA Silvio UNIV. FEDERAL DE PERNAMBUCO Brasil SANTOS Cassio UNIV. FEDERAL DE PERNAMBUCO Brasil TEPEDINE Fernande UNIV. FEDERAL DE PERNAMBUCO Brasil SHEPHERD Michael DALHOUSIE UNIVERSITY Canada WATTERS Carolyn DALHOUSIE UNlVERSlTY Canada ASSELIN Yves UNIV. DE QUEBEC Canada COMEAU Jean-Marie UNIV. DE QUEBEC Canada QUESNEL Gilles A. UNIV. DE QUEBEC Canada MUNCH Klaus C.R.I. A/S Denmark GAMMELGAARD Jacob DANISH EMPLOYERS Denmark JENSEN Michael Voel DANISH EMPLOYERS Denmark RASMUSSEN Kurt DANISH EMPLOYERS Denmark SKOV Flemming DANISH RESEARCH SERVICE Denmark RIEHM Ulrich KERNFORSCHUNGSZENTRUM KARLSRUHE Denmark GRINDORF Helle PROLOG DEVELOPMENT CENTER Denmark MURALI N.S. Research Centre for Plant Protection Denmark PETERSEN Anette SCAITECH A/S Denmark LANGE Dieter T.B.Z. HAMBURG Denmark OSTERBYE Kasper UNIV. OF AALBORG Denmark WIIL Uffe Kock UNIV. OF AALBORG Denmark ANDERSEN Peter Bogh UNIV. OF AARUS Denmark TRIGG Randall UNIV. OF AARUS Denmark STEFFENSEN Lars Bo Denmark ZANGENBERG Henrik Denmark HEKANAHO Jukkapekka ABO AKADEMI UNIV. Finland HEIMBURGER Anneli T.R.C. OF FINLAND Finland ECHOLM Kai TAMPERE UNIVERSITY Finland KORHONEN Timo Antero Finland BARATTELLI Giovanni AGENCE ANSA France WALLISER Dorothee AGENCE ANSA France PATUREAU Jean-Pierre BERTIN ET CIE France SCHWARTZ Richard BORLAND France RONY-SINNO Sandra BPI/CENTRE POMPIDOU France BOISSON Jean-Francois BULL sa France COLIN Beatrice BULL sa France DU Xiang Ru BULL sa France DYKIEL Richard BULL sa France MABROUK M'Bark BULL sa France SPIRO David BULL sa France THOREL Francois BULL sa France LAFFITTE Monique C.S.I. France LACOMBE Eric CEDROM TECHNOLOGIES France ZABICKI Mark CEDROM TECHNOLOGIES France BRAFFORT Paul CIMA France CREHANGE Marion CRIN/CNRS/UR 262 France DONOVAN Kevin DIGITAL EOUIPMENT FRANCE France RAYNER Douglas DIGITAL EOUIPMENT FRANCE France ROZEBOOM Christian DIGITAL EQUlPMENT FRANCE France MASSON Francine ECOLE POLYTECHNIQUE France LENOEL Bernard EDF-DER France LEROUX Dominique EDF-DER France VULDY Jean-Louis EDF-DER France SANSON Jean-Luc EDF-DER/IPN France DELACENSERIE Dominique EDF/ISDM France BLOCH Annie ENPC-CERAS France MEMBRADO Miguel ERGOSUM France LE BORGNE Herve Fed. Credit Mutuel France GUICHARD Marc FRANCE TELECOM France GEFFRAY Thierry GECI INTERNATIONAL France MACLEOD lan GECI INTERNATIONAL France RAIM Marty GECI INTERNATIONAL France DESARMENIEN Anne GROUPE ESIEE France GIBRAT T. HATIER LOGICIELS France DACHELET Roland I .N.R. I .A. France HUBY Danielle I.F.P. France BRUANDET Marie-France I.M.A.G. France FAFIOTTE Georges I.M.A.G.-GET France PUZIN Martine I.N.R.S. France CAUDILLO Ruben I.N.T. France LE DAIN Jean-Michel I.U.A. France COEZ Jean-Claude IBM FRANCE France BLAVIER Andre INFORMATIQUE CDC France FERRI Henri INFORMATlQUE CDC France GENTHON Philippe INP IPSI France ANDRE Jacques INRI RENNES France BORNES Christian INRIA France QUINT Vincent INRIA France RIZK Antoine INRIA France RlCHY Helene INRIA France VERCOUSTRE Anne-Marie INRIA France DROUHARD Jean-Philippe INRP/DPS France BIENNIER Frederique INSA LYON France FACHE Guy INSEE D.G. France SCHNEIDER Raymond IUT STRASBOURG SUD France ABBOU Andre LA TRIBUNE DES INDUSTRIES France COLIN DE CASAUBON Didier LAROUSSE France RICHARD Pascal MATRA ESPACE France FACQ Jean-Remy MATRA MS21 France WILLIAMS lan OWL/FRAME France RAULT Andre PSA/DITA France VILLEMOT Luc PSA/DITA France DUPOIRIER Gérard RANK XEROX France SYLVESTRE Jean SDC INFORMATIQUE France LEVY Remy SFGL France MEUNIER Herve SFGL France PLUTINO Antonio SFGL France LE MOUEL Jacques SIT France ENGEL Juliette U.I.C.F. France BRIATTE Katell UNIV. DE LILLE 111 France HARGROVE Jeffrey Univ. Paris 7-6 France CABRE Hervé UNIVERSITE DE LILLE France CLEMENT Daniele UNIVERSITE DE LILLE France VIEVILLE Claude UNIVERSITE DE LILLE France NANARD Marc UNIVERSITE DE MONTPELLIER France BEYOU Claire UNIVERSITE DU MAINE France LEPERS Jean-Marc UNIVERSITE PARIS 8 France SCAVETTA Domenico UNIVERSITE PARIS 8 France VERROUST Gerard UNIVERSITE PARIS 8 France ROUET Jean-FranSois URA CNRS France DAVI S Monica France DIENG Moussa France HARDI Christian France HERAUD Christian France GROTEN Ludwig DAIMLER-BENZ AG Germany SCHAPER Joachim DIGITAL EQUIPMENT Germany SCHWANENBERG Peter Fachhochschule Koln Germany SCHULER Wolfgang GMD-IPSI Germany SCHUTT Helge GMD-IPSI Germany STREITZ Norbert GMD-IPSI Germany JUCQUOIS-DELPIERRE Monique HEINRICH-HEINE-UNIV. DUSSELDORF Germany GERSTENDORFER Monika IBM-GERMANY Germany BLUM Jorg INOVIS GmbH & Co Germany SCHEIDT Michael Leibniz-Rechenzentrum Germany BOECKEL Katrin SATZ-RECHEN-ZENTRUM Germany HILBIG Wolfgang SATZ-RECHEN-ZENTRUM Germany ULRICH Helmut SCHERING AG Germany SCHIFF Jack SIEMENS AG Germany SCHUKAT Horst SIEMENS AG Germany BINDING Angelika SPINGER-VERLAG Germany WENDT Holger SPINGER-VERLAG Germany HOFMANN Martin TECHN.UNIV. BRAUNSCHUEIG Germany KLEBERG Stephan TECHNISCHE UNIV. BERLIN Germany WEISKE Thomas TECHNISCHE UNIV. MUNCHEN Germany CORDES Ralf TELENORMA Germany ANSCHUTZ Hans TRIUMPH ADLER Germany BURR Barbara UNIV. DE STUTTGART Germany KRUGER Frank UNIV. DES SAARLANDES Germany SCHULZ Angelika UNIV. DES SAARLANDES Germany MUHLHAUSER Max UNIV. OF KAISERSLAUTERN Germany RICHARTZ Martin UNIV. OF KAISERSLAUTERN Germany KULHEN Rainer UNIVERSITAT KONSTANZ Germany RITTBERGER Marc UNIVERSITAT KONSTANZ Germany WARNKE Martin UNIVERSITAT LUNEBURG Germany ISENMANN Severin UNIVERSITAT ULM Germany FRANENSTEIN Thomas Germany WAGNER Olaf Germany WICH Norbert Germany GUINAN Catherine DUBLIN CITY UNIV. Ireland SWEATON Alan DUBLIN CITY UNIV. Ireland KORNATZKY Yoram THE HEBREW UNIVERSITY Israel ARGENTESI Flavio C.E.C. Italy CATENAZZI Nadia C.E.C. Italy DELAVAL Marcel C.E.C. Italy GADOMSKA Magdalena C.E.C. Italy LANDONI Monica C.E.C. Italy PIRELLI Giuliano C.E.C./JRC Italy MIDORO Vittorio C.N.R. Italy IPPOLITO Giacomo C.R.E.S. Italy LIGUORO Gennaro C.R.E.S. Italy GIANESINI Paolo CERVED S.A. Italy LACQUANTI Alessandro CERVED S.A. Italy SKOGVOLD Stein E.S.A. Italy SINGER Danco GOLEM-NEUSLETTER Italy COLORIO Massimo IBM Semea S.r.l Italy GIORGETTI Roberto IBM SEMEA S.r.l Italy CAMICI Alessandro INTELS SISTEMI Italy MORETTI Lorenzo ISTITUTO Dl LINGUISTICA Italy ANTINUCCI Francesco ISTITUTO Dl PSICOLOGIA Italy MANGIARACINA Silvana ISTITUTO Dl TECNOLOGIE Italy TERRAVAZZI Giovanna MOZART-LUCREZIO LAB Italy CALOINI Andrea POLITECNICO DI MILANO Italy GARZOTTO Franca POLITECNICO Dl MILANO Italy PAGANI Daniele POLITECNICO Dl MILANO Italy PAOLINI Paolo POLITECNICO Dl MILANO Italy CAGNAZZO Maria Rosaria UNIV. DEGLI STUDI Italy COL ZZO Luigi UNIV. DI TRENTO Italy IRLER Wolfgang UNIV. DI TRENTO Italy MAIOLI Cesare UNIV. OF BOLOGNA Italy VITALI Fabio UNIV. OF BOLOGNA Italy LUCARELLA Dario UNIV. OF MILAN Italy CAMPANIIE Benedetta UNIVERSITA BARI Italy BUZZETTI Dino UNIVERSITA DI BOLOGNA Italy GAGLIARDI Roberto UNIVERSITA DI CAMERINO Italy POLZONETTI Alberto UNIVERSITA DI CAMERINO Italy GIANNOTTI Elena UNIVERSITA DI GENOVA Italy RICCI Franca UNIVERSITA DI GENOVA Italy CESARENI Maria-Donata UNIVERSITA DI ROMA Italy FEDRIZZI Mario UNIVERSITA DI TRENTO Italy MICH Luisa UNIVERSITA DI TRENTO Italy CANGIA Caterina UNIVERSITA SALESIANA Italy MICELLI Vita Lia Italy TAMURA Koichiro ELECTROTECHNICAL LABORATORY Japan UEDA Michio FUJI XEROX Co Japan MAKIMURA Nobuyuki FUJITSU LIMITED Japan NONOGAKI Hajime FUJITSU LIMITED Japan KUWAYAMA Etsuo INST.for PERS.INFO.ENVIRONMENT Japan KIKUCHI Schunichi Japan Information Japan HIRAI Yoshimitsu JIPDEC Japan MIWA Michio MATSUSHITA ELECTRIC Japan NOZAWA Shuji MITSUBISHI ELECTRIC Co Japan OGAUA Ryuichi NEC Corporation Japan TAKASHIMA Yosuke NEC Corporation Japan KATO Shigenobu TOPPAN PRINTING Japan KIKUCHI Kiyoshi TOSHIB CORPORATION Japan GUITTET Christian C.C.E. Luxembourg DE VRIES A. Erica EINDHOVEN TECHN. UNIV. Netherlands DE BRA Paul EINDHOVEN UNIV. OF TECHNOLOGY Netherlands HOUBEN Geert-Jan EINDHOVEN UNIV. OF TECHNOLOGY Netherlands VAN ZIJL Herbert ELSEVIER Netherlands HARDMAN Lynda OFFICE WORKSTATIONS LIMITED Netherlands BRANDSMA Ewout PHILIPS RESEARCH Netherlands TUCKER Mark PHILIPS RESEARCH Netherlands KOMMERS Piet TWENTE UNIVERSITY Netherlands BRUZA Peter UNIV. OF NIJMEGEN Netherlands BRANDELAND Asbjorn UNIV. OF OSLO Norway LANESTEDT Jon UNIV. OF OSLO Norway LIESTOL Gunnar UNIV. OF OSLO Norway SILVA Roger ILTEC Portugal CARRICO Luis INESC Portugal GUIMARAES Nuno INESC Portugal BANDEIRA Rogerio TECH. UNIV. OF LISBON Portugal DAVIES Edwards Sierra Leone WATERWORTH John A. Nal UNIV. SINGAPORE Singapore LESSING Casper POTCHEFSTROOM UNIV. South Africa BOTHMA Theo J.D. UNIV. OF SOUTH AFRICA South Africa BELMONTE Josep Lluis I.T.C. Spain CANALS Isidre INST. D'ESTADISTICA DE CATALUNYA Spain AHARI Parviz ERICSSON TELECOM Sweden VAINIO-LARSSON Arja LINKOPING UNIVERSITY Sweden BROADY Donald ROYAL INST. OF TECHNOLOGY Sweden HAITTO Hasse ROYAL INST. OF TECHNOLOGY Sweden BERNERS-LEE Tim C.E.R.N. Switzerland CAILLIAU Robert C.E.R.N. Switzerland KOHLER Niklaus E.P.F.L. Switzerland SMITH lan E.P.F.L. Switzerland WENTLAND-ROZENMOLL Marie O.M.P.P. Switzerland GEHR Christoph SIA Switzerland THEVOZ Jacques TRIBUNAL FEDERAL SUISSE Switzerland LANDOLT Thomas U.B.S. Switzerland VENTURA Andrea U.B.S. Switzerland TISSOT Marie-Claire UNIV. FRIBOURG Switzerland LINDEN Andre UNIV. GENEVE Switzerland PINTADO Xavier UNIV. GENEVE Switzerland ANSEL Bettina ZURICH UNIVERSITY Switzerland HEROLD Christine Switzerland RHINER Mathias Switzerland HAUSER Herman Active Book Company UK O'BRIEN Paul BRITISH TELECOM UK WHALL Dick COVENTRY POLYTECHNIC UK McALEESE Ray HERIOT WATT UNlVERSlTY UK CATLIN Karen HITACHI EUROPE LTD UK KANJI Anise INST. of ISMAILI STUDIES Ltd UK KESHAVJEE Rafique INST. of ISMAILI STUDIES Ltd UK THOBANI Shiraz INST. of ISMAILI STUDIES Ltd UK GARDNER Lesley LONDON SCHOOL OF ECONOMICS UK McKNlGHT Cliff LOUGHBOROUGH UNIV. UK RAMAIAH Kodanda LOUGHBOROUGH UNIV. UK GLOOR Peter MIT UK WRIGHT Patricia MRC UK RITCHIE lan OWL INTERNATIONAL UK Mc ARTHUR Richard PIRA UK MINIO Roberto PIRA UK McBRlDE Nicole POLYTECHNlC OF NORTH LONDON UK HANNON Donald.C. ROKE MANOR RESEARCH LTD UK BRIGGS Jonathan SCHOOL OF INFORMATION SYSTEMS UK O TES Nicholas ST. MARY'S HOSP. MEDICAL SCHOOL UK SHAH Dipak STC TECHNOLOGY LTD UK DOIG Jeremy UNIV. AT KENT UK BROUN Peter UNIV. OF KENT UK BROWN Heather UNIV. OF KENT UK PIMENTEL Maria Da Graca Campo UNIV. OF KENT UK WILSON Eve UNIV. OF KENT UK ZHENG Yi UNIV. OF KENT UK RADA Roy UNIV. OF LIVERPOOL UK FOUNTAIN Andre UNIV. OF SOUTHAMPTON UK HALL Wendy UNIV. OF SOUTHAMPTON UK HEATH lan UNIV. OF SOUTHAMPTON UK Ll Zhuo Xun UNIV. OF SOUTHAMPTON UK BAIRD Patricia UNIV. OF STRATHCLYDE UK KIBBY Michaël UNIV. OF STRATHCLYDE UK MAC MORROW Noreen UNIV. OF STRATHCLYDE UK PERCIVAL Mark UNIV. OF STRATHCLYDE UK HJORTH RASMUSSEN Lise-Hotte UK BECHTEL Brian APPLE COMPUTER USA OREN Tim APPLE COMPUTER USA PUTRESS John AT&T BELL LABORATORIES USA FODALE Daniel BOEING COMPUTER SERVICES USA BIEBER Michael BOSTON COLLEGE USA KAHN Paul BROWN UNIV. USA SHERMAN Mark CARNEGIE MELLON UNIV. USA DETER Renee CLEMSON UNIV. USA LAMBERT Jerry CLEMSON UNIV. USA WALKER Janet DIGITAL EQUIPMENT CO USA BERNSTEIN Mark EASTGATE SYSTEMS USA PAQUET Gael GRAPHAEL USA MYLONAS Elli HARVARD UNlVERSlTY USA ADAMS Carol IBM USA KNUTH Randy INDIANA UNIV. USA MEYROWlTZ Norman IRIS/BROWN UNIV. USA AKSCYN Robert KNOWLEDGE SYSTEMS USA MYHRVOLD Nathan MICROSOFT CORPORATION USA YOKOYAMA Shigetoshi MIT USA BARONE Richard NORTHWESTERN UNIVERSITY USA DE YOUNG Laura PRICE WATERHOUSE USA KACMAR Charles Chuck RENSSELAER POLY. INST. USA COVO Jacqueline SYMBOLlCS INC. USA LEGGETT John TEXAS A&M UNIV. USA NELSON Gerald C. UNIV. OF ILLIONOIS USA FURUTA Richard UNIV. OF MARYLAND USA SHNEIDERMAN Ben UNIV. OF MARYLAND USA STOTTS David UNIV. OF MARYLAND USA CROFT Bruce UNIV. OF MASSACHUSETTS USA SMITH John B. UNIV. OF NORTH CAROLINA USA McCALL Raymond UNIV.OF COLORADO USA </XMP>
This has the distinction of being the oldest file available in the second
version of HTML (the first version of HTML to be documented). It is with this
file the new <XMP> tag/element is first being seen in
actual use instead of merely as a demonstration. Since all of this file's
contents (apart from the new tag) are meant to be as raw text I only show the
source of it here. <TITLE> was obviously still seen as
being optional, but examples of this second type of HTML without a
<TITLE> are rare and this is the only one I have included
here. Here is the oldest surviving occurrence of "&"
in an HTML file, and this is plainly meant to be merely the raw character
itself. Several of the persons listed here used non-ASCII letters in their
names, two wanting the "é" character and one wanting the "ë"
character. The extra characters appear to be derived from an old Macintosh
standard. I have corrected them here.
Authors - Windows Internet Explorer
CERN is the European Particle Physics Laboratory, and is in Geneva, Switzerland. The authors point out that the opinions expressed in this suite of information are their own, and do not necessarily express any view of their employer.
Currently in CN division. Before comming to CERN, Tim worked on. among other things, document production and text processing. He developped his first hypertext system, "Enquire", in 1980 for his own use (although unaware of the existence of the term HyperText). With a background in real-time software and communications, Tim decided that CERN needed a networked hypertext system and was an ideal site for the development of hypertext ideas. Tim started the WorldWideWeb project at CERN in 1990.
Currently in ECP division, Programming Techniques group. Robert has been interested in document production since 1975. He ran the Office Computing Systems group from 87 to 89. He is a long-time user of Hypercard, which he used to such diverse ends as writing trip reports, games, bookkeeping software, and budget preparation forms.
<TITLE>Authors</TITLE> <NEXTID 1> <H1>Authors</H1>CERN is the European Particle Physics Laboratory, and is in Geneva, Switzerland. The authors point out that the opinions expressed in this suite of information are their own, and do not necessarily express any view of their employer. <H2><A NAME=BernersLee> Tim Berners-Lee</A></H2>Currently in CN division. Before comming to CERN, Tim worked on. among other things, document production and text processing. He developped his first hypertext system, "Enquire", in 1980 for his own use (although unaware of the existence of the term HyperText). With a background in real-time software and communications, Tim decided that CERN needed a networked hypertext system and was an ideal site for the development of hypertext ideas. Tim started the <A NAME=0 HREF=../../WWW/TheProject.html>WorldWideWeb</A> project at CERN in 1990. <H2><A NAME=Cailliau> Robert Cailliau</A></H2>Currently in ECP division, Programming Techniques group. Robert has been interested in document production since 1975. He ran the Office Computing Systems group from 87 to 89. He is a long-time user of Hypercard, which he used to such diverse ends as writing trip reports, games, bookkeeping software, and budget preparation forms.
This is the second oldest HTML file found written in this first documented form
of HTML. This is also the oldest surviving instance of the <NEXTID>
tag. Notice in this and the following files how every <A> tag
now comes with a NAME attribute, regardless of whether it also
features a HREF attribute or not.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap10.html - Windows Internet Explorer
Book computers will take over in the 1990s cordless connections, GSM, DECT WStations laptop pocket PC
DT publishing CD rom Hypermedia
telephone telefax modem e mail
calculator diary phonebook typewriter
Diary probably most important part RIS technology Unix in the ROm ABC will make an attempt SmallTalk for productivity interfacing to existing standards software is the key to any new development user interface: pen and paper. 2Q1991
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap10.html</TITLE> <H1><A NAME=pap10>Book computers: the fourth wave</A></H1> <ADDRESS>Herman Hauser: the active book company (ABC). </ADDRESS> <H1></H1>Book computers will take over in the 1990s cordless connections, GSM, DECT WStations laptop pocket PC<P> DT publishing CD rom Hypermedia<P> telephone telefax modem e mail<P> calculator diary phonebook typewriter<P> Diary probably most important part RIS technology Unix in the ROm ABC will make an attempt SmallTalk for productivity interfacing to existing standards software is the key to any new development user interface: pen and paper. 2Q1991</A>
This file is unusual for this period in its lack of a <NEXTID>. This
seems to be the case because it contains no links and so the value would have been zero,
the same as NeXT would assume with a file from somewhere else where there is no running
NEXTID value. This file also contains the oldest surviving instance of the
<ADDRESS> tag.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap09.html - Windows Internet Explorer
Building Hypertext applications
A. Fountain, W. Hall , I. Heath, H. Davis
This was for us the most interesting talk.
Links are separate from the contents, allowing for the manipulation and cataloguing of information about the links. The link information is stored in a knowledge base. It is thus possible to have specific links (linking one place in one document to one place in another) but also generic links.
Generic links: suppose you have a colour image of a parrot. You can specify a generic link into this image, base on the word "parrot" as the generic anchor. Any new text put into Microcosm that contains the word "parrot" will now automatically have the link to this image.
Microcosm has possibilities for parallellism in its searches. It can link to documents in other systems. Work is going on on Microcosm 2. It runs on Windows 3.0
B. Bechtel Presentation of the CD rom version of the five volumes of the Macintosh technical manuals. An impressively big Hypercard application, but with no special features. They do have useful feedback from 142 users, 65% of whom use the CD rom hypertext version more than 50% of the time they have to look up information.
E. Mylonas , S. Heath
PERSEUS is a hypertext about classical Greece, containing not only texts and translations but also maps, pictures, dictionaries and glossaries. Links are dynamic as well as statis, ie. the user sees no difference between following a specific link from a picture to a map and looking up a word in a glossary, except for the possibility that the response to a glossary lookup may result in a "not found" message.
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap09.html</TITLE> <NEXTID 6><A NAME=pap09>Building Hypertext applications</A> <H1>Microcosm: an open model for Hypermedia with dynamic linking</H1>A. Fountain, <A NAME=0 HREF=/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/People.html#Hall>W. Hall</A> , I. Heath, H. Davis<P> This was for us the most interesting talk.<P> Links are separate from the contents, allowing for the manipulation and cataloguing of information about the links. The link information is stored in a knowledge base. It is thus possible to have specific links (linking one place in one document to one place in another) but also generic links.<P> <A NAME=4 HREF=/private/Net/cernvax/userd/tbl/hypertext/Conferences/../Products/Microcosm/Microcosm.html#GenericLinking>Generic links</A>: suppose you have a colour image of a parrot. You can specify a generic link into this image, base on the word "parrot" as the generic anchor. Any new text put into Microcosm that contains the word "parrot" will now automatically have the link to this image. <P> <A NAME=3 HREF=/private/Net/cernvax/userd/tbl/hypertext/Conferences/../Products/Microcosm/Microcosm.html>Microcosm</A> has possibilities for parallellism in its searches. It can link to documents in other systems. Work is going on on Microcosm 2. It runs on Windows 3.0 <H1>"Inside Macintosh" as Hypertext</H1><A NAME=1 HREF=/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/People.html#Bechtel>B. Bechtel</A> Presentation of the CD rom version of the five volumes of the Macintosh technical manuals. An impressively big Hypercard application, but with no special features. They do have useful feedback from 142 users, 65% of whom use the CD rom hypertext version more than 50% of the time they have to look up information. <H1>Hypertext from the Data point of view: Paths and links in the PERSEUS project</H1><A NAME=2 HREF=/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/People.html#Mylonas>E. Mylonas</A> , S. Heath<P> <A NAME=5 HREF=/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Perseus.html>PERSEUS</A> is a hypertext about classical Greece, containing not only texts and translations but also maps, pictures, dictionaries and glossaries. Links are dynamic as well as statis, ie. the user sees no difference between following a specific link from a picture to a map and looking up a word in a glossary, except for the possibility that the response to a glossary lookup may result in a "not found" message.
In this file, there is both the title (only a path name as was current at the time; it is now located in a different place in the W3C historical archives) and a node name.
Products at the Exhibition at ECHT90 - Windows Internet Explorer
The ECT90 exhibition was on an intermediate floor, sandwiched vertically between the paper sessions and the panel sessions. It was also the site of the coffee and cocktails, and so was well attended. There were a number of booksellers - I (TBL) bought Nielsen's book among others. The products on display included
<TITLE>Products at the Exhibition at ECHT90</TITLE> <NEXTID 8> <H1>At the exhibition</H1>The <A NAME=0 HREF=Introduction.html>ECT90</A> exhibition was on an intermediate floor, sandwiched vertically between the paper sessions and the panel sessions. It was also the site of the coffee and cocktails, and so was well attended. There were a number of booksellers - I <A NAME=7 HREF=Authors.html#BernersLee>(TBL)</A> bought <A NAME=1 HREF=People.html#nielsen>Nielsen's</A> book among others. The products on display included <DL> <DT><A NAME=2 HREF=../../Products/Guide/Guide.html>Guide</A> <DD> This was on the stand of its French distributors, Frame. They had various demonstrations, including an Edinburgh city guide not as complete as <A NAME=3 HREF=GlasgowOnline.html>Glasgow Online</A> but perhaps clearer to read on a big screen in colour. Guide looked extremely useable, and had a high profile at the conference owing to the active participation of its <A NAME=4 HREF=People.html#pbrown>inventor</A> and of the <A NAME=5 HREF=../../Products/Guide/OWL.html>OWL</A> personel. Guide was the next most quoted hypertext system after Hypercard, which noone really considered as a present-generation product. <DT>Hyperdoc <DD> This is a French product who showed a very impresive inclusion of video into a Jaguar maintenance guide. The video technology largely came free with the VideoCard product, including moving and resizing of the video window within a containing frame. I have a brochure. <DT>KMS <DD> I <A NAME=6 HREF=Authors.html#BernersLee>(TBL)</A> saw Knowledge Management System's "KMS". Personally, I found the limitations it imposes rather anoying. These included a fixed size of frame, and the requirement that an anchor must be a paragraph. KMS was running on a Sun (it has to). </DL> </A>
This file marks the oldest surviving instance of the dictionary tags in actual use instead of
as merely demonstrations in a test set file (<DL>, <DT>, and
<DD>). These tags have changed very little since then, apart from various added
features, all optional.
Tutorial 6 - ECHT90 - Windows Internet Explorer
I have a paper copy of the transparencies to this tutorial.
The conclusion of this talk was the presentation of a software architecture for the next generation of hypertext systems. This differed in some ways from the WorldWideWeb architecture, and was therefore interesting. The architecure was designed to handle Inter-network hypermedia ("an up-and-coming area of research"). The model was that:-
<TITLE>Tutorial 6 - ECHT90</TITLE>
<NEXTID 5>
<H1>Advanced Tutorial in Hypermedia Research</H1>
<ADDRESS><A NAME=0 HREF=People.html#meyrowitz>Norman Meyrowitz</A> , <A NAME=1 HREF=../../Products/Intermedia/IRIS.html>IRIS</A>
</ADDRESS>
<H2>Overview</H2><A NAME=4 HREF=Authors.html#BernersLee>I </A>have a paper copy of the transparencies to this tutorial.
<UL>
<LI>An overview of terminology, aimed at getting perople to use the same terms. His were basically the same as <A NAME=2 HREF=#../../WWW/Terms.html>ours</A> .
<LI>Multi-User Hypermedia
<LI>Inter-Network Hypermedia
<LI>Information Retrieval and Hypermedia
<LI>HyperText and text Markup
<LI>Links to and from temporal media
<LI>The structural model vs. the programming model.
</UL>
<H2><A NAME=architecture>Architecture</A></H2>The conclusion of this talk was the presentation of a software architecture for the next generation of hypertext systems. This differed in some ways from the WorldWideWeb architecture, and was therefore interesting. The architecure was designed to handle Inter-network hypermedia ("an up-and-coming area of research"). The model was that:-
<UL>
<LI>The operating system should include link services which all applications will be encouraged to use, so that inter-application jumps will be possible.
<LI>The link information will be stored separately from the documents in a database in each filesystem.
<LI>Details of each link will be stored by both the source and destination link servers.
<LI>There will be a common file system which will allow remote applications to access the document when they follow a link.
<LI>There will be common document formats, so that common access to files is all that is needed for document interchange.
</UL>
Notice that there is no "NAME=3" in this file, but perhaps it was
changed to the one named anchor, "NAME=architecture." There is a
NAME=4 and <NEXTID> is set to 5 in preparation
for whatever next link is generated by the NeXT Editor, should this file be opened by it
again for modification.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pan4.html - Windows Internet Explorer
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pan4.html</TITLE> <H1><A NAME=pan4>The advantages of hypertext for large information spaces: where are the big systems?</A></H1> <H2>Speaker from OWL international:</H2> <UL> <LI>The critical mass is important: if a hypertext base does not contain enough information bulk, then it is not interesting as a hypertext. <LI>integration tools are important: linking text and images and data from other applications such as spreadsheets and CAD programs. <LI>Data bases must be accessible. <LI>Conversion of existing text should be based on SGML markup. <LI>the US DoD CALS initiative is important, as well as the EEC integration in 1992. </UL></A>
An extraneous trailing closing </A> tag (as found on this file) seems
to be a common error in these early files. This was noted as a bug in the NeXT Editor in
that it generates these excess closing tags, perhaps by failing to delete the closing tag
with the opening tag and element contents. Its falsely repeated closure would be regarded
as an error by the W3C (and other) validating engines, were this type of HTML definable in
SGML. Notice again that <NEXTID> is missing, as the only actual
<A> element has a human-entered NAME, so the
NEXTID value would still be 0 and so the tag is not needed.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pan5.html - Windows Internet Explorer
Mostly about what sort of product to offer the customer. To my surprise, knowbots were absent from the discussion. Agreement that information finding should be automated and dynamic. The name space, identification of a hypertext in a unique fashion all over the world, was considered important, but also considered a solved problem (ISBN numbers?) by some.
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pan5.html</TITLE> <NEXTID 1> <H2><A NAME=pan5>Hypertext and Electronic Publishing</A></H2>Mostly about what sort of product to offer the customer. To <A NAME=0 HREF=Authors.html#Cailliau>my</A> surprise, knowbots were absent from the discussion. Agreement that information finding should be automated and dynamic. The name space, identification of a hypertext in a unique fashion all over the world, was considered important, but also considered a solved problem (ISBN numbers?) by some.
Programme - ECHT'90 - Windows Internet Explorer
This is a summary of the ECHT90 conference program. The conference consisted of a day of tutorial sessions, then two days of paper presentations with parallel track of panel sessions and an exhibition of products and posters. The content of most of these are are available in the proceedings, which were distributed in paper book form at registration time (the proceedings include the question/answers of the panel sessions, surely a world first!). The working language was English. The term Hypertext should now certainly be replaced by hypermedia: all products I (RC) saw that were remotely interesting included not only text and graphics, but also the possibility of animation (eg. video) and sound (eg. voice). The overall attendence was around 450.
These were around 3 hours each in length, and given by invited experts in the field.
Except for the first two sessions and the last, these ran in parallel with the panel sessions.
The panel sessions were held in a smaller room than the papers, with a panel of 3 to 5 people entertaining an audience which varied between 50 and 300. The sessions each started with a (short) presentation by each of the panellists, after which the floor was opened for discussion. The panels were nominally on the following subjects:-
<TITLE>Programme - ECHT'90</TITLE> <NEXTID 9> <H1>Programme</H1>This is a summary of the <A NAME=0 HREF=Introduction.html>ECHT90</A> conference program. The conference consisted of a day of<A NAME=1 HREF=#tut> tutorial</A> sessions, then two days of <A NAME=2 HREF=#pap>paper</A> presentations with parallel track of <A NAME=3 HREF=#pan>panel</A> sessions and an<A NAME=4 HREF=Exhibition.html> exhibition</A> of products and posters. The content of most of these are are available in the proceedings, which were distributed in paper book form at registration time (the proceedings include the question/answers of the panel sessions, surely a world first!). The working language was English. The term Hypertext should now certainly be replaced by hypermedia: all products I <A NAME=5 HREF=Authors.html#Cailliau>(RC)</A> saw that were remotely interesting included not only text and graphics, but also the possibility of animation (eg. video) and sound (eg. voice). The overall attendence was around 450. <H2><A NAME=tut>Tutorials</A></H2>These were around 3 hours each in length, and given by invited experts in the field. <UL> <LI><A NAME=tut1>Introduction to HyperText and Hypermedia</A> Roberto Minio, GMD_IPSI (FRG) <LI><A NAME=tut2>Introduction and Overview of HyperText systems and Hypermedia Applications.</A> Paul D. Khan, IRIS - Brown University (USA) <LI><A NAME=tut3>Hypertexts and Databases</A> P. Paolini, Politechnico di Milano (I), R. Schwartz, Borland Int. (CA, USA) <LI><A NAME=tut4>Education uses of hypermedia</A> D.M.Russel, Xerox PARC <LI><A NAME=tut5>Hypertext writing for technical documentation</A> M. Bernstein, Eastgate Cambridge (USA) <LI><A NAME=tut6 HREF=Tutorial6.html>"Advanced tutorial in Hypermedia Research"</A> by <A NAME=6 HREF=People.html#meyrowitz>Norman Meyrowitz</A> , IRIS - Brown University (USA) <LI><A NAME=tut7>User Interface Metaphors in Hypertext</A> Janet Walker, Digital Research Center, Boston (MA, USA) <LI><A NAME=tut8>Automatic and machine aided construction of hypertext bases</A> R. Kuhlen, Univ. of Constance, FRG </UL> <H2><A NAME=pap>Paper Sessions</A></H2>Except for the first two sessions and the last, these ran in parallel with the panel sessions. <UL> <LI><A NAME=pap1 HREF=Pap01.html>Prof. Peter Brown (Univ. Kent, UK) gave the opening keynote address, on Assessing the quality of HyperDocuments . He discussed his experience refereeing hypertext documents produced by his students, and warned that active books were a very nutritious substrate for viruses.</A> <LI><A NAME=pap02 HREF=Pap02.html>Toolkits for hypermedia applications</A> <LI><A NAME=pap03 HREF=Pap03.html>Formal models and query languages</A> <LI><A NAME=pap04 HREF=Pap04.html>Databases, Indices, and normative knowledge</A> <LI><A NAME=pap05 HREF=Pap05.html>Argumentation, design and knowledge acquisition</A> <LI><A NAME=pap06 HREF=Pap06.html>Turning Text into Hypertext</A> <LI><A NAME=pap07 HREF=Pap07.html>Designing and reading hyperdocuments</A> <LI><A NAME=pap08 HREF=Pap08.html>Navigation and Browsing</A> <LI><A NAME=pap09 HREF=Pap09.html>Building hypertext applications</A> <LI><A NAME=pap10 HREF=Pap10.html>Book Computers: the 4th Wave</A> </UL> <H2><A NAME=pan>Panel Sessions</A></H2>The panel sessions were held in a smaller room than the papers, with a panel of 3 to 5 people entertaining an audience which varied between 50 and 300. The sessions each started with a (short) presentation by each of the panellists, after which the floor was opened for discussion. The panels were nominally on the following subjects:- <UL> <LI><A NAME=pan3>What should hypermedia authoring systems for computer aided instruction look like?</A> <LI><A NAME=pan4 HREF=Pan4.html>The advantages of hypertext for large information spaces: where are the big systems?</A> <LI><A NAME=pan5 HREF=Pan5.html>Hypertext and Electronic Publishing</A> This was the panel which was to have had a discussion of standardisation, and should have included <A NAME=7 HREF=People.html#Newcombe>Steve Newcombe</A> who in the end couldn't come. There was a discussion of the desirability of <A NAME=8 HREF=Structured.html>structured documents</A> . <LI><A NAME=pan6 HREF=Pan6.html>What is specific about user interfaces for hypertext systems?</A> <LI><A NAME=pan7 HREF=HTandIR.html>Hypertext and Information retrieval: What are the fundamental concepts?</A> <LI><A NAME=pan8>Strategic issues in European HyperText Research and Development</A> </UL>
This is the main page for the ECHT Conference, November 27-30, 1990.
The Intermedia product - Windows Internet Explorer
I have some stuff on this on paper. See also IRIS .
<TITLE>The Intermedia product</TITLE> <NEXTID 2> <H1>Intermedia</H1><A NAME=1 HREF=Intermedia.html>I </A>have some stuff on this on paper. See also <A NAME=0 HREF=IRIS.html>IRIS</A> .
(No title)
Date: Thu, 14 Feb 91 15:37:36 +0100 From: dimou@cernvax.cern.ch (maria dimou) To: timbl@nxoc01.cern.ch The following short note was prepared by M. Dimou on request by J. Richards and A. Silverman. It was read and commented by D. Wiegandt and it is sent to the mintlist for information. 24/1/91 --------------- Email policy for unix/ultrix workstations ----------------- - The owner or the manager of a newly installed workstation, which is supposed to be able to send and receive Email should update the sendmail configuration file with: . The complete domain information of the node. In ultrix systems for example this is represented by the value of the $D macro i.e. DDcern.ch . The name of the general purpose relay machine. Again in the example of ultrix systems this is represented by the $R macro and it should have the value 'dxmint', with the alternative of 'cernvax', as a backup relay, i.e. DRdxmint #DRcernvax . Arrange in ruleset zero (S0) for all foreign Email traffic to be routed via the 'tcplocal' mailer to the major relay machine (defined in $R in the case of ultrix and others) and for Email to local users to be delivered with the 'local' mailer. The reason for adopting this 'restricted' routing is to profit from the sophistication built in the sendmail configuration of the central gateway machines (dxmint and cernvax), which modifies bogus addresses, giving them a canonical RFC 822 format (i.e. user@host.domain). In case of a group of workstations, installed and operated as a 'cluster': . To avoid the risk of some of them being unavailable for incoming SMTP for extended time periods (for high incoming traffic a few hours are already a problem) it is advised to fake the hostname on the "From" address of outgoing messages, replacing the name of the individual workstation by the name of a well supported 'server' node. This is how Apollo's at CERN are organized, i.e. they are all addressed as 'user@cernapo.cern.ch' due to appropriate facilities in their sendmail. . For other types of workstations, where such a possibility doesnot exist, it is sufficient for the 'server' node to have the usernames of all 'client' workstations' users defined as aliases. . The other advantage that such a centralised management provides, is the availability of disk space for storing and forwarding the messages to the 'client' workstations. --------------- Email policy for VAX/VMS workstations ----------------- Unfortunately VMS mail is rather 'primitive', giving little possibility of protection against system management problems. As a minimum, owners of VAX/VMS workstations are advised to: . Publicise their Email address on a 'bigger' machine (which has a system manager watching on its availability and the users' disk space). . Set an autoforward on that node pointing to the VAXstation This autoforward should be cancelled when the station is shut down. M. Dimou CS/EN
<TITLE>(No title)</TITLE> <NEXTID 1> <H1>Dimou on mail configuartions</H1> <XMP>Date: Thu, 14 Feb 91 15:37:36 +0100 From: dimou@cernvax.cern.ch (maria dimou) To: timbl@nxoc01.cern.ch The following short note was prepared by M. Dimou on request by J. Richards and A. Silverman. It was read and commented by D. Wiegandt and it is sent to the mintlist for information. 24/1/91 --------------- Email policy for unix/ultrix workstations ----------------- - The owner or the manager of a newly installed workstation, which is supposed to be able to send and receive Email should update the sendmail configuration file with: . The complete domain information of the node. In ultrix systems for example this is represented by the value of the $D macro i.e. DDcern.ch . The name of the general purpose relay machine. Again in the example of ultrix systems this is represented by the $R macro and it should have the value 'dxmint', with the alternative of 'cernvax', as a backup relay, i.e. DRdxmint #DRcernvax . Arrange in ruleset zero (S0) for all foreign Email traffic to be routed via the 'tcplocal' mailer to the major relay machine (defined in $R in the case of ultrix and others) and for Email to local users to be delivered with the 'local' mailer. The reason for adopting this 'restricted' routing is to profit from the sophistication built in the sendmail configuration of the central gateway machines (dxmint and cernvax), which modifies bogus addresses, giving them a canonical RFC 822 format (i.e. user@host.domain). In case of a group of workstations, installed and operated as a 'cluster': . To avoid the risk of some of them being unavailable for incoming SMTP for extended time periods (for high incoming traffic a few hours are already a problem) it is advised to fake the hostname on the "From" address of outgoing messages, replacing the name of the individual workstation by the name of a well supported 'server' node. This is how Apollo's at CERN are organized, i.e. they are all addressed as 'user@cernapo.cern.ch' due to appropriate facilities in their sendmail. . For other types of workstations, where such a possibility doesnot exist, it is sufficient for the 'server' node to have the usernames of all 'client' workstations' users defined as aliases. . The other advantage that such a centralised management provides, is the availability of disk space for storing and forwarding the messages to the 'client' workstations. --------------- Email policy for VAX/VMS workstations ----------------- Unfortunately VMS mail is rather 'primitive', giving little possibility of protection against system management problems. As a minimum, owners of VAX/VMS workstations are advised to: . Publicise their Email address on a 'bigger' machine (which has a system manager watching on its availability and the users' disk space). . Set an autoforward on that node pointing to the VAXstation This autoforward should be cancelled when the station is shut down. M. Dimou CS/EN </XMP>
(No title)
Here are a few things necessary for the proper working of the mail at CERN. The files are all in the directory /etc/sendmail/.
If you don't log in as root much, you may way to change in the aliases file the alias of "Postmaster" from "root" to your login name.
This seems to be fine as delivered from NeXT, so long as you never turn your machine off (and the sendmail daemon does not stop due to an error such as an overloaded machine). If you do turn your machine off, the mail gateway machines will get clogged with any mail sent to you in your absence, which is not what they were designed for. The default configuration works because it looks up the name "mailhost" in the name server whose address you have already defined using the NetManager.
If you have a large number of workstations, however, then you should set up one of them as a mail server. In this case, that machine will buffer mail for any of its clients which are not running when the mail comes in. You should in this case talk to Maria about how to edit the sendmail.cf (using sendmail.mailhost.cf as a template perhaps) on the server machine.
(See mail from Maria dimou )
__________________________________________________________
Tim BL<TITLE>(No title)</TITLE> <NEXTID 3> <H1>Configuring your mail files</H1>Here are a few things necessary for the proper working of the mail at CERN. The files are all in the directory /etc/sendmail/. <H2>Aliases</H2>If you don't log in as root much, you may way to change in the aliases file the alias of "Postmaster" from "root" to your login name. <H2>Configuration file.</H2>This seems to be fine as delivered from NeXT, so long as you never turn your machine off (and the sendmail daemon does not stop due to an error such as an overloaded machine). If you do turn your machine off, the mail gateway machines will get clogged with any mail sent to you in your absence, which is not what they were designed for. The default configuration works because it looks up the name "mailhost" in the name server whose address <A NAME=2 HREF=Network.html>you have already defined</A> using the NetManager.<P> If you have a large number of workstations, however, then you should set up one of them as a mail server. In this case, that machine will buffer mail for any of its clients which are not running when the mail comes in. You should in this case talk to Maria about how to edit the sendmail.cf (using sendmail.mailhost.cf as a template perhaps) on the server machine.<P> (See <A NAME=1 HREF=Mail-Dimou.html>mail from Maria dimou</A> )<P> __________________________________________________________ <ADDRESS><A NAME=0 HREF=../WWW/disclaimer.html>Tim BL</A> </ADDRESS></A>
Notice here the oldest surviving instance of the use of a dividing line to separate
one part of the page from another. In time, this would lead to the introduction of
the <HR> tag/element.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap02.html - Windows Internet Explorer
J. Puttress & N. Guimaraes They have big hypertexts for program annotation: 2000 people, 2Mslocs of code. This needs other tools and networking, but they must be modified to suit the specific needs. Linking should be like cut-and-paste: a part of the operating system.
R. Ogawa , H. Harada, A. Kaneko Honest speaker, started out as follows: "Why did I do this research? Well, because I wanted to come to Paris." Interesting treatment of the time dimension: how do you browse if the hypertext includes video scenes? For example, can you click on the (moving) image of a person and thereby get his name? How to handle interruptions to follow links to other info and then come back and continue, etc.
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap02.html</TITLE> <NEXTID 3> <H1><A NAME=pap02>Toolkits for hypermedia applications</A></H1> <H2>Building hypertext on a multimedia toolkit</H2> <H1></H1><A NAME=0 HREF=People.html#Sherman>Mark Sherman</A> <H2>The toolkit approach to Hypermedia</H2> <H1></H1><A NAME=1 HREF=People.html#Puttress>J. Puttress</A> & N. Guimaraes They have big hypertexts for program annotation: 2000 people, 2Mslocs of code. This needs other tools and networking, but they must be modified to suit the specific needs. Linking should be like cut-and-paste: a part of the operating system. <H2>Scenario-based hypermedia: amodel and a system</H2> <H1></H1><A NAME=2 HREF=People.html#Ogawa>R. Ogawa</A> , H. Harada, A. Kaneko Honest speaker, started out as follows: "Why did I do this research? Well, because I wanted to come to Paris." Interesting treatment of the time dimension: how do you browse if the hypertext includes video scenes? For example, can you click on the (moving) image of a person and thereby get his name? How to handle interruptions to follow links to other info and then come back and continue, etc.</A>
Note again the use of a node name (now contained in the first header) and
the spurious closing </A> tag at the end of the file. Here
is another occurrence of "&" and again, it is merely intended
to stand for the raw character itself. Another odd thing is the occurrence of an empty
header 1 element (<H1></H1>), perhaps intended to put some
additional space around the name.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap07.html - Windows Internet Explorer
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap07.html</TITLE> <NEXTID 3> <H1><A NAME=pap07>Designing and reading hyperdocuments</A></H1> <H2>Towards an aesthetics of hypertexts systems. A semiotic approach</H2> <H1></H1><A NAME=0 HREF=People.html#Andersen>P. Andersen</A> <H2>Linking considered harmful</H2> <H1></H1><A NAME=1 HREF=People.html#DeYoung>L. De Young</A> <H2>Interactive text proccessing by inexperienced (Hyper-) readers</H2> <H1></H1><A NAME=2 HREF=People.html#Rouet>J.F. Rouet</A>
Note again the use of the empty header 1 element. This time the closing
</A> tag makes sense.
/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap05.html - Windows Internet Explorer
W. Schuler & J. Smith
R. McCall et al.
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/Conferences/ECHT90/Pap05.html</TITLE> <NEXTID 3> <H1><A NAME=pap05>Argumentation, design and knowledge acquisition</A></H1> <H2>Author's argumentation assistant (AAA)</H2> <H1></H1><A NAME=0 HREF=People.html#Schuler>W. Schuler</A> & J. Smith <H2>PHIDIAS: integrating CAD graphics into dynamic hypertext</H2> <H1></H1>R. McCall et al. <H2>An integrated Approach of knowledge acquisition by the Hypertext system Concorde</H2> <H1></H1>
Note another occurrence of the "&" character.
Electronic Book Technology - Windows Internet Explorer
Mail:1, Richmond Square, Providence, Rhode Island, USA
No direct connection with IRIS , but the director has a Brown mail address, and EBT use IRIS's full index search technology. Brown have a user licence for DynaText as part of the deal. EBT have signed up a distributor in France, and will have one in Germany shortly (March 91).
People include:
I have some paper documents about DynaText. (-TBL)
<TITLE>Electronic Book Technology</TITLE> <NEXTID 10> <H1>Electronic Book Technology</H1>Mail:1, Richmond Square, Providence, Rhode Island, USA<P> No direct connection with <A NAME=1 HREF=/private/Net/cernvax/userd/tbl/hypertext/Products/Intermedia/IRIS.html>IRIS</A> , but the <A NAME=8 HREF=#7>director</A> has a Brown mail address, and EBT use IRIS's full index search technology. Brown have a user licence for <A NAME=3 HREF=Overview.html>DynaText</A> as part of the deal. EBT have signed up a distributor in France, and will have one in Germany shortly (March 91).<P> People include: <DL> <DT><A NAME=7>Louis Reynolds</A> <DD> President. Email:lrr@iris.brown.edu. ex-Cadre (the Teamwork people). See <A NAME=4 HREF=Mail>mail</A> . <DT><A NAME=5>Andy van Dam</A> <DD> ex-CERN, Apollo. Professor at Brown, and consultant to EBT. (<A NAME=9 HREF=../../Conferences/ECHT90/People.html#VanDam>More...</A>) <DT>Pierre Schmidt <DD> Representative in Europe happens to be in Geneva.Tel: 692424 or Fax: 692425. Knows <A NAME=6 HREF=#5>Andy</A> from Apollo days. </DL> I have some paper documents about DynaText. (-TBL)</A>
Once again here, note an extra trailing closing </A> tag.
IRIS - Brown University - Windows Internet Explorer
Institute for Research in Information and Scholarship
Brown University, 155 George Street, Box 1946, Providence, Rhode Island 02912, USA
IRIS is a 20-strong institute which is part of Brown University. It is funded by external grants, although its members are salaried staff of the university. IRIS developed the Intermedia product as a research tool, and now sell it in versions to run on Apple A/UX version 1 only. They are not pursuing Intermedia as a product. They have their own unix version for research, which is available to sponsors.
IRIS have discussed hypermedia with several manufacturers, encouraging them to adopt certain architectures for hypermedia. They have developped a system of remote objects under C++ (at least, remote method calling, not remote objects. Protocol compatible with Sun RPC).
They have a full text indexer, used by EBT .
IRIS would be interested in collaborative work, if they could find some funding through it.
"IRIS has run out funding & gone fut." - Chris Jones April 91.
<TITLE>IRIS - Brown University</TITLE> <NEXTID 3> <H1>I.R.I.S.</H1>Institute for Research in Information and Scholarship<P> Brown University, 155 George Street, Box 1946, Providence, Rhode Island 02912, USA<P> IRIS is a 20-strong institute which is part of Brown University. It is funded by external grants, although its members are salaried staff of the university. IRIS developed the <A NAME=0 HREF=../../../../Products/Intermedia/Intermedia.html>Intermedia</A> product as a research tool, and now sell it in versions to run on Apple A/UX version 1 only. They are not pursuing Intermedia as a product. They have their own unix version for research, which is available to sponsors.<P> IRIS have discussed hypermedia with several manufacturers, encouraging them to adopt certain <A NAME=1 HREF=../../Conferences/ECHT90/Tutorial6.html#architecture>architectures</A> for hypermedia. They have developped a system of remote objects under C++ (at least, remote method calling, not remote objects. Protocol compatible with Sun RPC).<P> They have a full text indexer, used by <A NAME=2 HREF=../Dynatext/EBT.html>EBT</A> .<P> IRIS would be interested in collaborative work, if they could find some funding through it.<P> "IRIS has run out funding & gone fut." - Chris Jones April 91.</A>
Once again here, note an extra trailing closing </A> tag.
Introduction - ECHT90 - Windows Internet Explorer
The first European Conference on HyperText took place at the Palais de Congres de Versailles from the 27th to the 30th November 1990. The information linked to this note contains a summary biased by the personal views of Tim Berners-Lee and Robert Cailliau who attended from CERN.
The conference was structured into a day of tutorials (4 parallel in the morning, four in the afternoon) and three days of paper sessions parallel with panel sessions. The site was obviously chosen because of the strong influence of INRIA (Institut National de Recherche en Informatique et Automatique) which is located in nearby Rocquencourt. The proceedings were already printed and available at registration time. They include the question/answers of the panel sessions, surely a world first!
See also:
ECHT90 will be followed by HT91 , sponsored by the ACM, in San Antonio, Texas, from December 15th-18th 1991.
<TITLE>Introduction - ECHT90</TITLE> <NEXTID 8> <H1>ECHT90</H1>The first European Conference on <A NAME=7 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/../../WWW/WhatIs.html>HyperText</A> took place at the Palais de Congres de Versailles from the 27th to the 30th November 1990. The information linked to this note contains a summary biased by the personal views of <A NAME=0 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/Authors.html#BernersLee>Tim Berners-Lee</A> and <A NAME=1 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/Authors.html#Cailliau>Robert Cailliau</A> who attended from CERN.<P> The conference was structured into a day of tutorials (4 parallel in the morning, four in the afternoon) and three days of paper sessions parallel with panel sessions. The site was obviously chosen because of the strong influence of INRIA (Institut National de Recherche en Informatique et Automatique) which is located in nearby Rocquencourt. The proceedings were already printed and available at registration time. They include the question/answers of the panel sessions, surely a world first!<P> See also: <UL> <LI><A NAME=2 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/Programme.html>The conference programme.</A> <LI><A NAME=3 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/People.html>People at the conference.</A> <LI><A NAME=4 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/Points.html>Technical issues raised.</A> <LI><A NAME=5 HREF=//cernvax/userd/tbl/hypertext/Conferences/ECHT90/Journals.html>Journals on hypertext mentioned.</A> </UL>ECHT90 will be followed by <A NAME=6 HREF=../HT91/Overview.html>HT91</A> , sponsored by the ACM, in San Antonio, Texas, from December 15th-18th 1991.
This seems to be the main page to the ECHT90 Conference.
Microcosm from Southampton University - Windows Internet Explorer
This is a practical hypertext product developped by a team at Southampton university. It was well presented in the penultimate paper session at ECHT90, along with an application in which the memoirs and document collection of Lord Louis Mountbatten were saved in digital hypermedia form.
The software runs currently on MSDOS/Windows3. It comprises a number of viewers for different types of information, such as text, graphics, still video and moving video. As far as we could tell, the viewers will not nest - that is, text cannot contain graphics or video.
A feature of Microcosm is that links are made using keywords in the following way. Within a certain region (for example, a set of documents), a keyword is connected to a particular destination. This means that a large number of links may be declared rapidly, and markup in the document itself is not needed. This is particularly useful when converting existing data into hypertext. The links are similar to glossary items. A disadvantage seemed to me to be that it is not obvious which words take one to particularly important new material, but I imagine that one could indicate that in the text.
Generic linking seemed to bridge the gap between full text indexing and hypertext links . In the WWW context, one could imagine a document having an associated search list of related indexes, generic links being early on the search list, a full text document index being near the middle, and the dictionary being at the end.
<TITLE>Microcosm from Southampton University</TITLE> <NEXTID 2> <H1>Microcosm</H1>This is a practical hypertext product developped by a team at Southampton university. It was well presented in the penultimate <A NAME=0 HREF=../../Conferences/ECHT90/Programme.html#pap9>paper session</A> at ECHT90, along with an application in which the memoirs and document collection of Lord Louis Mountbatten were saved in digital hypermedia form.<P> The software runs currently on MSDOS/Windows3. It comprises a number of viewers for different types of information, such as text, graphics, still video and moving video. As far as we could tell, the viewers will not nest - that is, text cannot contain graphics or video. <H2><A NAME=GenericLinking>Generic Linking</A></H2>A feature of Microcosm is that links are made using keywords in the following way. Within a certain region (for example, a set of documents), a keyword is connected to a particular destination. This means that a large number of links may be declared rapidly, and markup in the document itself is not needed. This is particularly useful when converting existing data into hypertext. The links are similar to glossary items. A disadvantage seemed to me to be that it is not obvious which words take one to particularly important new material, but I imagine that one could indicate that in the text.<P> Generic linking seemed to bridge <A NAME=1 HREF=../../../../Conferences/ECHT90/HTandIR.html>the gap between full text indexing and hypertext links</A> . In the WWW context, one could imagine a document having an associated search list of related indexes, generic links being early on the search list, a full text document index being near the middle, and the dictionary being at the end.</A>
fax -- /Guide - Windows Internet Explorer
From Tim Berners-LeeTo: Ian Ritchie
Office Workstations Limited
144 Broughton Rd
Edinburg EH7 4LE
Fax +44(31)557 5721
Ian,
At last I get to send this, some time after our phone call. Please send us, for "Guidance" (assuming this to be a superset of Guide)
We have someone who is currently evaluating hypertext products, and so we expect to order an evaluation copy immediately.
Thanks in advance
_________________________________________________________________
Tim BL<TITLE>fax -- /Guide</TITLE> <NEXTID 1> <ADDRESS>From Tim Berners-Lee<P>CN Division, CERN, 1211 Geneva 23, Switzerland<P>31 May 91 </ADDRESS>To: Ian Ritchie<P> Office Workstations Limited<P> 144 Broughton Rd<P> Edinburg EH7 4LE<P> Fax +44(31)557 5721<P> Ian,<P> At last I get to send this, some time after our phone call. Please send us, for "Guidance" (assuming this to be a superset of Guide) <UL> <LI>Price and ordering information for a single evaluation copy, and any indication of larger volume arrangements; <LI>As full documentation as possible; <LI>Details of your HML format, so that we can consider compatibility with our own SGML browsers; <LI>Details of scripts which can be attached to links, so that we can investigate the possibility of interfacing to our own information access tools. </UL>We have someone who is currently evaluating hypertext products, and so we expect to order an evaluation copy immediately.<P> Thanks in advance<P> _________________________________________________________________ <ADDRESS><A NAME=0 HREF=../../../WWW/disclaimer.html>Tim BL</A>
Again, note the use of the line which would lead to <HR>. And
if only they already had the <BR> tag/element so as to keep the
lines of the address together! In this file, we also do something illegal in more
modern forms of HTML, namely include the <P> tag within an
<ADDRESS> element.
People at ECHT90 - Windows Internet Explorer
Although the conference was dominated by American presentations, the Europeans were strongly represented. From the US there were the Hypertext univerities (CMU, Brown, Maryland, Illinois), commercial representations (KMS, Apple, IRIS, DEC, MicroSoft), and users with large projects (AT&T, Apple, Price Waterhouse, Harvard University).
The Europeans came from universities (Aarus (DK), INRIA (F), Konstanz (D), Milano (I), Kent (UK), Southampton (UK), Strathclyde (UK)), from companies (OWL, GipsI, Geci), and from (mostly prospective) users (Renault, Hachette, Xerox(!)).
There were participants from Brasil (6), Canada (5), Israel (1), Japan (13!), Sierra Leone (1), Singapore (1) and South Africa (2), which made the conference into more than a European event (more details in the actual participants list which is available sorted by name and by country).
Following is a very abreviated list of details on people we met or whom we consider to be important in the field (they were present at the ECHT90 conference unless stated otherwise).
<TITLE>People at ECHT90</TITLE> <NEXTID 17> <H1>People</H1>Although the conference was dominated by American presentations, the Europeans were strongly represented. From the US there were the Hypertext univerities (CMU, Brown, Maryland, Illinois), commercial representations (KMS, Apple, IRIS, DEC, MicroSoft), and users with large projects (AT&T, Apple, Price Waterhouse, Harvard University).<P> The Europeans came from universities (Aarus (DK), INRIA (F), Konstanz (D), Milano (I), Kent (UK), Southampton (UK), Strathclyde (UK)), from companies (OWL, GipsI, Geci), and from (mostly prospective) users (Renault, Hachette, Xerox(!)).<P> There were participants from Brasil (6), Canada (5), Israel (1), Japan (13!), Sierra Leone (1), Singapore (1) and South Africa (2), which made the conference into more than a European event (more details in the <A NAME=0 HREF=Participants.html>actual participants list</A> which is available sorted by name and by country).<P> Following is a very abreviated list of details on people we met or whom we consider to be important in the field (they were present at the <A NAME=1 HREF=Introduction.html>ECHT90</A> conference unless stated otherwise). <DL> <DT><A NAME=baird>Patricia Baird</A> <DD> University of Strathclyde, UK. Editor of <A NAME=2 HREF=Journals.html#hypermedia>"Hypermedia"</A> journal, and of the <A NAME=3 HREF=GlasgowOnline.html>Glasgow Online</A> project. <DT><A NAME=pbrown>Peter Brown</A> <DD> University of Kent, UK. Gave the opening <A NAME=4 HREF=Programme.html#pap1>Keynote speech</A> . Married to <A NAME=5 HREF=#hbrown>Heather</A> . Email: pbrown@ukc.ac.uk <DT><A NAME=hbrown>Heather Brown</A> <DD> University of Kent, UK. An ODA expert. Remembers the time "when "markup" was used to show which characters should be lower case". Was on one of the <A NAME=6 HREF=Programme.html#pan5>panels</A> . Married to <A NAME=7 HREF=#pbrown>Peter</A> . <DT><A NAME=Futura>Richard Futura</A> <DD> University of MaryLand, USA. Edits <A NAME=8 HREF=Journals.html#EPodd>Electronic Publishing</A> . Presented a <A NAME=9 HREF=Programme.html#pan5>panel session</A> . <DT><A NAME=Kuhlen>Rainer Kuhlen</A> <DD> University of Konstanz, FRG. Taught <A NAME=10 HREF=tutorial8.html>tutorial 8 </A> on machine aided construction of hypertext bases. <DT><A NAME=meyrowitz>Norman Meyrowitz</A> <DD> Director of <A NAME=11 HREF=../../Products/Intermedia/IRIS.html>I.R.I.S.</A> Gave an <A NAME=12 HREF=Programme.html#tut6>advanced tutorial</A> . Email: nkm@iris.brown.edu <DT><A NAME=Mylonas> Elli Mylonas</A> <DD> Department of Classics, 319 Boylston Hall, Harvard University, Cambridge MA 02138. Editor of the <A NAME=13 HREF=Perseus.html>Perseus Project</A> <DT><A NAME=Newcombe>Steven R Newcombe</A> <DD> (Steve) Chairs the "HyTime" SGML committee standardising formats for exchange of hypermedia including media (such as music) with a time dimension. Unfortunately, Steve could not come due to a "last minute budget freeze". Florida State University , Center for Music Research, Tallahassee FL 32303 srn!cmr@bikini.cis.ufl.edu <DT>Jakob Nielsen <DD> Wrote the book "HyperText and HyperMedia", on sale at the conference. Also Email: neilsen@bellcore.com <DT><A NAME=IanRitchie>Ian Ritchie</A> <DD><A NAME=14 HREF=../../Products/Guide/OWL.html> OWL</A> . Friendly, took part in discussions. <DT><A NAME=IanWilliams>Ian Williams</A> <DD><A NAME=15 HREF=../../Products/Guide/OWL.html> OWL</A> . Experience in consulting with and selling Guide to prospective customers in industry. Suggests CERN should convert some large database to Guide and then convert the rest bit by bit. <DT><A NAME=VanDam>Andy van Dam</A> (not present) <DD> Andries van Dam, avd@cs.brown.edu. Was at CERN once, Co-founder of ACM SIGGRAPH, Now prof of C.S. at Brown, now with <A NAME=16 HREF=../../Products/DynaText/EBT.html>E.B.T.</A> . A Good friend of Chris Jones. "HyperMedia freak" See mail to tbl.</A> </DL>
This list of the key people at the ECHT90 Conference seems to be one of the most referred-to files from the era, and itself helped me find many more of the most ancient HTML files.
History -- /hypertext - Windows Internet Explorer
_________________________________________________________________
RC<TITLE>History -- /hypertext</TITLE> <NEXTID 1> <H1>Short History of Hypertext</H1> <DL> <DT>1945 <DD> Vannevar Bush (Science Advisor to president Roosevelt during WW2) proposes Memex. <DT>1965 <DD> Ted Nelson coins the word "Hypertext" <DT>1967 <DD> Andy van Dam et al build the Hypertext Editing System and FRESS <DT>1968 <DD> Doug Engelbart demos NLS system at FJCC <DT>1975 <DD> ZOG (now KMS) at CMU. <DT>1978 <DD> Aspen Movie Map, first hypermedia videodisc, MIT. <DT>1984 <DD> Filevision from Telos: hypermedia database for Macintosh <DT>1985 <DD> Symbolics Document Examiner, Janet Walker. <DT>1985 <DD> InterMedia, Brown University, N. Meyrowitz <DT>1986 <DD> OWL introduces Guide, first widely available hypertext <DT>1987 <DD> Apple introduces Hypercard, B. Atkinson. <DT>1987 <DD> Hypertext'87 Workshop <DT>1990 <DD> ECHT (European Conference on HyperText) </DL> _________________________________________________________________ <ADDRESS><A NAME=0 HREF=WWW/People.html#Cailliau>RC</A></A> </ADDRESS>
This history ends (rather than begins) with the ECHT90 Conference.
Again, note the use of the line which would lead to <HR>, and
also the extra closing </A> tag at the end.
(No title) - Windows Internet Explorer
If you have NFS access to a machine which has the software already installed, then mounting that disk may be the preferable alternative, as it will save disk space and ease upgrade management.At CERN, the files are currently stored on cernvax. In order to get access, you will need to have the host name of your machine put into a table by the cernvax system manager. When you have done this, su root in your NeXT, and edit /etc/fstab to contain the line with cernvax/userd as in the following example:
# # NOTE: This file is never consulted if NetInfo is running. It is only # used during bootstrap. # /dev/sd0a / 4.3 rw,noquota,noauto 0 1 cernvax:/userd /Net nfs rw,bg,net 0 0
Then, you must give the commands
niload fstab . </etc/fstab mount cernvax:/userd
in order to get access. Your directory browser should now be able to see the directory /private/Net/cernvax/userd/tbl/hypertext/WWW/NeXT/Implementation. In the shell, still as root, you can now link the application and WWW subdirectory across to your own directories omitting the "tar" step. The commands are (omit the mkdir if you already have /LocalApps)
mkdir /LocalApps ln -s /private/Net/cernvax/userd/tbl/hypertext/WWW/NeXT/Implementation/WorldWideWeb.app /LocalApps
Now go on to the personal setup .
__________________________________________________________
Tim BL<TITLE>(No title)</TITLE> <NEXTID 4> <H1>Using NFS</H1>If you have NFS access to a machine which has the software already installed, then mounting that disk may be the preferable alternative, as it will save disk space and ease upgrade management.At CERN, the files are currently stored on cernvax. In order to get access, you will need to have the host name of your machine put into a table by the cernvax system manager. When you have done this, su root in your NeXT, and edit /etc/fstab to contain the line with cernvax/userd as in the following example: <LISTING># # NOTE: This file is never consulted if NetInfo is running. It is only # used during bootstrap. # /dev/sd0a / 4.3 rw,noquota,noauto 0 1 cernvax:/userd /Net nfs rw,bg,net 0 0 </LISTING>Then, you must give the commands <XMP> niload fstab . </etc/fstab mount cernvax:/userd </XMP>in order to get access. Your directory browser should now be able to see the directory /private/Net/cernvax/userd/tbl/hypertext/WWW/NeXT/Implementation. In the shell, still as root, you can now link the <A NAME=1 HREF=Installation.html#4>application</A> and WWW <A NAME=2 HREF=Installation.html#5>subdirectory</A> across to your own directories omitting the "tar" step. The commands are (omit the mkdir if you already have /LocalApps) <LISTING> mkdir /LocalApps ln -s /private/Net/cernvax/userd/tbl/hypertext/WWW/NeXT/Implementation/WorldWideWeb.app /LocalApps </LISTING>Now go on to the <A NAME=3 HREF=Installation.html#6>personal setup</A> . <p> __________________________________________________________ <ADDRESS><A NAME=0 HREF=../../TBL_Disclaimer.html>Tim BL</A> </ADDRESS>
Though there are reports of the <LISTING> tag/element as having been
implemented by some browser as far back as March of 1991, this one file represents the oldest
surviving instance of its actual use (not merely a demonstration).
Hypertext and Information Rerieval - Windows Internet Explorer
There was a panel on this topic at ECHT90. Some (IR) peopele maintained that nothing in HT was substantially new, and some (HT) people maintained that HT was significantly different. This was, in some ways, a fairly pointless discussion. There seemed to be a consensus that both conventional IR techniques (such as full text searches) and hypertext-style linking from sensitive areas would be needed, and many products in fact combine both flavours. The HT people were in general better at making sexy front end systems, while they had nothing much to add to the IR community's back-end algorithms.
However, it is obvious that whatever the underlying indexing and link support, one must make the user interface as consistent as possible. A nice example of this is the generic linking concept of Microcosm, picked up also by the Perseus project .
The WWW project alows many indexes to exist within a hypertext web. It represents the results of an index search as hypertext, so using the a single model
<TITLE>Hypertext and Information Rerieval</TITLE> <NEXTID 4> <H1>HyperText and Information Retrieval</H1>There was a <A NAME=0 HREF=Programme.html#pan7>panel</A> on this topic at ECHT90. Some (IR) peopele maintained that nothing in HT was substantially new, and some (HT) people maintained that HT was significantly different. This was, in some ways, a fairly pointless discussion. There seemed to be a consensus that both conventional IR techniques (such as full text searches) and hypertext-style linking from sensitive areas would be needed, and many products in fact combine both flavours. The HT people were in general better at making sexy front end systems, while they had nothing much to add to the IR community's back-end algorithms.<P> However, it is obvious that whatever the underlying indexing and link support, one must make the user interface as consistent as possible. A nice example of this is the <A NAME=1 HREF=../../Products/Microcosm/Microcosm.html#GenericLinking> generic linking </A>concept of Microcosm, picked up also by the <A NAME=2 HREF=Perseus.html>Perseus project</A> .<P> The WWW project alows <A NAME=3 HREF=../../WWW/DesignIssues/ManyIndexes.html>many indexes</A> to exist within a hypertext web. It represents the results of an index search as hypertext, so using the a single model </A>
Note again the extra closing </A> tag.
ManyIndexes -- /DesignIssues - Windows Internet Explorer
In WWW , an index is a document like any other. An index may be built to cover a certain domain of information. For example, at CERN there is a CERN computer center document index . There is a separate functional telephone book index . Indexes may be built by the original information provider, or by a third party as a value-added service.
Indexes may point to other indexes. An index search on one index may turn up another index in the result hit list. In this case, the following algorithm seems appropriate.
Most index searches nowadays, though some look like intelligent semantically aware searches, are basically associative keyword searches. That is, a document matches a search if there is a large correlation (with or without boolean operations) between the set of words it or its abstract contains and the set of words specified in the search. Let us consider extending these searches to linked indexes.
Each index has a certain context. This may be represented by a set of keywords which may be considered to apply implicitly to everything indexed. For example, in the CERN computer center documentation index, one may imagine that everything in it will be considered as pertaining to the CERN computer center. We might represent the context by the keyword list "CERN computer center documentation physics support".
Suppose we search a general physics index with the keywords "CERN NEWSLETTER". That index may contain an entry with keyword "CERN" pointing to the CERN index. Therefore, a search on the first index will turn up the CERN index. We should then search the CERN index, but looking only for the keyword "NEWSLETTER". The keyword "CERN" is discarded, as it is assumed by the new context. In this simple model, we can assume that the contextwords could be used directly as the keywords for the index itself.
A simple algorithm, then, would be for the server to discard from a search list any keywords matching the index's context -- but is this really what we want to do? Perhaps those keywords have a more refined meaning within the context. For example, if I am looking for documents about document storage schemes at CERN, I might search the index with the keyword "documents". I don't want this to be discarded because it is in the context: I am looking for documents about documents. It is understood that we are already within the context of computer center documentation, so to ask about documentation in this context implies more than that I am looking for a document.
A more refined approach would therefore be to strip from the search those keywords which were used in order to find the index. The keyword list for the entry of one index within anotherthen reflects the change in context.
We have discussed here only a narrowing of context, not a broadening. One can imagine also a reference to a broader context index. In this case, perhaps one should add to the search some keywords which come from the original context but were not expressed. This would be dangerous, and people would not like it as they often feel that they are expressing their request in absolute terms even when they are not. Also, they may have been trying to escape from too restricing a context.
One should also consider a search which traces hypertext links as well as using indexes.
See also: Navigational techniques , Hypertext and IR ,
_________________________________________________________________
Tim BL<TITLE>ManyIndexes -- /DesignIssues</TITLE> <NEXTID 8> <H1>Web of Indexes</H1>In <A NAME=4 HREF=../TheProject.html>WWW</A> , an <A NAME=3 HREF=Navigation.html#8>index</A> is a document like any other. An index may be built to cover a certain domain of information. For example, at CERN there is a <A NAME=1 HREF=http://crnvmc/FIND>CERN computer center document index</A> . There is a separate <A NAME=2 HREF=http://crnvmc/FIND/yellow?>functional telephone book index</A> . Indexes may be built by the original information provider, or by a third party as a value-added service.<P> Indexes may point to other indexes. An index search on one index may turn up another index in the result hit list. In this case, the following algorithm seems appropriate. <H2>Index context</H2>Most index searches nowadays, though some look like intelligent semantically aware searches, are basically associative keyword searches. That is, a document matches a search if there is a large correlation (with or without boolean operations) between the set of words it or its abstract contains and the set of words specified in the search. Let us consider extending these searches to linked indexes.<P> Each index has a certain context. This may be represented by a set of keywords which may be considered to apply implicitly to everything indexed. For example, in the CERN computer center documentation index, one may imagine that everything in it will be considered as pertaining to the CERN computer center. We might represent the context by the keyword list "CERN computer center documentation physics support". <H2>Context narrowing</H2>Suppose we search a general physics index with the keywords "CERN NEWSLETTER". That index may contain an entry with keyword "CERN" pointing to the CERN index. Therefore, a search on the first index will turn up the CERN index. We should then search the CERN index, but looking only for the keyword "NEWSLETTER". The keyword "CERN" is discarded, as it is assumed by the new context. In this simple model, we can assume that the contextwords could be used directly as the keywords for the index itself.<P> A simple algorithm, then, would be for the server to discard from a search list any keywords matching the index's context -- but is this really what we want to do? Perhaps those keywords have a more refined meaning within the context. For example, if I am looking for documents about document storage schemes at CERN, I might search the index with the keyword "documents". I don't want this to be discarded because it is in the context: I am looking for documents about documents. It is understood that we are already within the context of computer center documentation, so to ask about documentation in this context implies more than that I am looking for a document.<P> A more refined approach would therefore be to strip from the search those keywords which were used in order to find the index. The keyword list for the entry of one index within anotherthen reflects the change in context. <H2>Context Broadening</H2>We have discussed here only a narrowing of context, not a broadening. One can imagine also a reference to a broader context index. In this case, perhaps one should add to the search some keywords which come from the original context but were not expressed. This would be dangerous, and people would not like it as they often feel that they are expressing their request in absolute terms even when they are not. Also, they may have been trying to escape from too restricing a context.<P> One should also consider a search which <A NAME=7 HREF=TracingLinks.html>traces hypertext links</A> as well as using indexes.<P> See also: <A NAME=6 HREF=Navigation.html>Navigational techniques</A> , <A NAME=5 HREF=../../Conferences/ECHT90/HTandIR.html>Hypertext and IR</A> , <P> _________________________________________________________________ <ADDRESS><A NAME=0 HREF=http://info.cern.ch./hypertext/TBL_Disclaimer.html>Tim BL</A></A> </ADDRESS>
Note again the <HR> line and the extra closing
</A> tag.
TracingLinks -- /DesignIssues - Windows Internet Explorer
A form of search in a hypertext base involves tracing the links between given nodes. For example, to find a module suitable for connecting a decstation to SCSI, one might try finding paths between a document on decstations and a document on SCSI. This is similar to relevance feedback in index searching.
Tracing is made more powerful by using typed links. In that case, one could perform semantic searches for all document written by people who were part of the same organisation as the author of this one, for example. This can use node typing as well.
When using link tracing, documents take over from keywords.
_________________________________________________________________
Tim BL<TITLE>TracingLinks -- /DesignIssues</TITLE> <NEXTID 3> <H1>Tracing Links</H1>A form of search in a hypertext base involves tracing the links between given nodes. For example, to find a module suitable for connecting a decstation to SCSI, one might try finding paths between a document on decstations and a document on SCSI. This is similar to relevance feedback in index searching.<P> Tracing is made more powerful by using <A NAME=1 HREF=Topology.html#4>typed links</A>. In that case, one could perform semantic searches for all document written by people who were part of the same organisation as the author of this one, for example. This can use node typing as well. <P> When using link tracing, documents take over from keywords.<P> See <A NAME=2 HREF=Preece.html>Scott Preece's vision</A>.<P> _________________________________________________________________ <ADDRESS><A NAME=0 HREF=http://info.cern.ch./hypertext/TBL_Disclaimer.html>Tim BL</A></A> </ADDRESS>
(No title) - Windows Internet Explorer
A conference held in San Antonio, Texas in December 1991. See also
_________________________________________________________________
Tim BL<TITLE>(No title)</TITLE> <NEXTID 7> <H1>HyperText 91</H1>A conference held in San Antonio, Texas in December 1991. See also <UL> <LI><A NAME=3 HREF=../ECHT90/Programme.html>Previous conference - ECHT90 - Trip report</A> <LI>Robert Acksyn's course "Design Tradeoffs for Advanced Hypertext Technology"<A NAME=4 HREF=Courses/C9_Outline.html> outline</A> <LI><A NAME=1 HREF=CallForParticipation>Call for participation</A> , <A NAME=5 HREF=PosterPrep.html>poster preparation</A> . <LI>List of <A NAME=6 HREF=Denoers.html>demonstrators</A> . </UL>_________________________________________________________________ <ADDRESS><A NAME=0 HREF=../../TBL_Disclaimer.html>Tim BL</A></A> </ADDRESS>
Office WorkStations Limited - Windows Internet Explorer
Office Workstations Limited are the company which produced Guide . People we have met at the ECHT90 exhibition are Ian Williams , and Ian Ritchie .
Office Workstations Ltd 144 Broughton Rd Edinburg EH7 4LE Scotland
Phone: +44(31)557 5720
Fax: +44(31)557 5721
OWL International Inc exists.
Owl International Inc. 2800 156th Ave. SE Bellevue, WA 98007 USA 206 747-3203 voice 206 641-9367 FAX
We understand that OWL has been bought out by a large company.
See Fax .
<TITLE>Office WorkStations Limited</TITLE> <NEXTID 5> <H1>OWL</H1>Office Workstations Limited are the company which produced <A NAME=0 HREF=Guide.html>Guide</A> . People we have met at <A NAME=1 HREF=../../Conferences/ECHT90/Exhibition.html>the ECHT90 exhibition</A> are<A NAME=2 HREF=../../Conferences/ECHT90/People.html#IanWilliams> Ian Williams</A> , and<A NAME=3 HREF=../../Conferences/ECHT90/People.html#IanRitchie> Ian Ritchie</A> . <XMP> Office Workstations Ltd 144 Broughton Rd Edinburg EH7 4LE Scotland </XMP>Phone: +44(31)557 5720<P> Fax: +44(31)557 5721 <XMP> </XMP>OWL International Inc exists. <XMP> Owl International Inc. 2800 156th Ave. SE Bellevue, WA 98007 USA 206 747-3203 voice 206 641-9367 FAX </XMP>We understand that OWL has been bought out by a large company.<P> See <A NAME=4 HREF=fax.html>Fax</A> .</A>
This is another file using <XMP> and also a part of the ECHT90
Conference though last updated over a year after the event.
Disclaimer - Windows Internet Explorer
CERN - European Particle Physics Laboratory, 1211 Geneva 23, SwitzerlandThis information is provided in good faith but no warranty can be made for its accuracy. Opinions expressed are entirely those of myself and/or my colleagues and cannot be taken to represent views past present or future of our employers. See also CERN copyright . If you notice something incorrect or have any comment, feel free to mail me.
Tim Berners-Lee<TITLE>Disclaimer</TITLE> <NEXTID 2> <ADDRESS>CERN - European Particle Physics Laboratory, 1211 Geneva 23, Switzerland<P>____________________________________________________________ </ADDRESS> <H1>Disclaimer</H1>This information is provided in good faith but no warranty can be made for its accuracy. Opinions expressed are entirely those of <A NAME=1 HREF=http://crnvmc.cern.ch./WHO/S=BERNERS-LEE;G=Timothy;OU=CN;>myself</A> and/or my colleagues and cannot be taken to represent views past present or future of our employers. See also CERN <A NAME=0 HREF=Copyright.html>copyright</A> . If you notice something incorrect or have any comment, feel free to mail me. <ADDRESS>Tim Berners-Lee<P>____________________________________________________________<P>Tel +44(22)767 3755, Fax +44(22)767 7155, Email: timbl@info.cern.ch
This is the famous "TBL" Disclaimer that appears all over the place.
This file manages to do again what would later become illegal, namely put
multiple paragraphs within the <ADDRESS> element.
Preece -- /DesignIssues - Windows Internet Explorer
(See tracing, Navigation)
My own "vision" of information retrieval models the whole database as
a network of objects. Some of the objects are words, some of them are
index terms (from a controlled vocabulary), some of them are documents some of them are pieces of documents, some of them are authors, etc. There are also typed links between nodes in the graph -- words are connected to documents by occurrence links, words are tied to words by dictionary links, document pieces are tied to documents by "is section of" links, etc. Searching then becomes a process of turning some of the nodes on, then turning on the nodes attached to them by certain kinds of links, and so forth.
So a dictionary expansion of the query works by activating a set of terms and then following all the dictionary links from those terms to other terms; a "search" works by activating a set of terms, then following all the occurrence links to the documents they appear in; relevance feedback works by starting with a set of activated documents and following the links back to the terms that occur in them.
If you use appropriate rules for calculating the level of activation of a node you can implement many of the similarity functions that have been reported in the literature and do a pretty effective job of seaching. For instance, suppose you have a term node which is activated with a
weight of 1. Suppose the spreading rule is that the weight is split among all the occurrence links leading from it to documents and the
combining rule is that all weights coming into a node are summed. Then after one spreading cycle each active document will have a weight equal to the sum of the inverse frequency of the terms in contains, which is a pretty reasonable search strategy. One enhancement is to have each link also weighted -- for term occurrence links it makes sense for that weight to be the number of occurrences of the term in the document.
It is true that doing this effectively requires doubly inverting the database, so that each document points to all its terms as well as vice versa, although you can finesse that by encoding the document as a list of terms rather than as Ascii text, with a slightly higher cost of
rebuilding the text when you need to display the document.
[My dissertation, describing this in excruciating detail, is *A Spreading Activation Model for Information Retrieval*, University of Illinois, 1981. You might be able to get it from University Microfilms if you're really interested. If you're at Thinking Machines, Dave Waltz had a copy once, but may well have shed it in the last decade. The machine readable form, alas, no longer exists (it lived on a long-dead PDP10)]
scott
-- scott preece motorola/mcg urbana design center 1101 e. university, urbana, il 61801 uucp: uunet!uiucuxc!udc!preece, arpa: preece@urbana.mcd.mot.com phone: 217-384-8589 fax: 217-384-8550
<TITLE>Preece -- /DesignIssues</TITLE> <NEXTID 4> <H1>Scott Preece on retrieval</H1> <ADDRESS>3 Oct 91 </ADDRESS>(See <A NAME=1 HREF=TracingLinks.html>tracing</A>, <A NAME=3 HREF=Navigation.html>Navigation</A>)<P> My own "vision" of information retrieval models the whole database as<P> a network of objects. Some of the objects are words, some of them are<P> index terms (from a controlled vocabulary), some of them are documents some of them are pieces of documents, some of them are authors, etc. There are also typed links between nodes in the graph -- words are connected to documents by occurrence links, words are tied to words by dictionary links, document pieces are tied to documents by "is section of" links, etc. Searching then becomes a process of turning some of the nodes on, then turning on the nodes attached to them by certain kinds of links, and so forth.<P> So a dictionary expansion of the query works by activating a set of terms and then following all the dictionary links from those terms to other terms; a "search" works by activating a set of terms, then following all the occurrence links to the documents they appear in; relevance feedback works by starting with a set of activated documents and following the links back to the terms that occur in them.<P> If you use appropriate rules for calculating the level of activation of a node you can implement many of the similarity functions that have been reported in the literature and do a pretty effective job of seaching. For instance, suppose you have a term node which is activated with a<P> weight of 1. Suppose the spreading rule is that the weight is split among all the occurrence links leading from it to documents and the<P> combining rule is that all weights coming into a node are summed. Then after one spreading cycle each active document will have a weight equal to the sum of the inverse frequency of the terms in contains, which is a pretty reasonable search strategy. One enhancement is to have each link also weighted -- for term occurrence links it makes sense for that weight to be the number of occurrences of the term in the document.<P> It is true that doing this effectively requires doubly inverting the database, so that each document points to all its terms as well as vice versa, although you can finesse that by encoding the document as a list of terms rather than as Ascii text, with a slightly higher cost of<P> rebuilding the text when you need to display the document.<P> [My dissertation, describing this in excruciating detail, is *A Spreading Activation Model for Information Retrieval*, University of Illinois, 1981. You might be able to get it from University Microfilms if you're really interested. If you're at Thinking Machines, Dave Waltz had a copy once, but may well have shed it in the last decade. The machine readable form, alas, no longer exists (it lived on a long-dead PDP10)]<P> scott <XMP>-- scott preece motorola/mcg urbana design center 1101 e. university, urbana, il 61801 uucp: uunet!uiucuxc!udc!preece, arpa: preece@urbana.mcd.mot.com phone: 217-384-8589 fax: 217-384-8550 </XMP>
/private/Net/cernvax/userd/tbl/hypertext/WWW/Addressing/Search.html - Windows Internet Explorer
If a given hypertext node is an index, or the server has an index associated with it, then a search may be done on that index by suffixing the name of the index with a list of keywords, after a question mark:
address_of_index ? keywordlist
The address of the index is a normal hypertext address. In the keywordlist, multiple keywords are separated by plus signs (+) . (See BNF syntax description .) The resulting string still does not contain any spaces. It may be considered to be the hypertext address of a document which is the result of making the keyword search on the index. Normally, if the search was successful, the document returned will contain anchors leading to other documents which match the selection criteria.
The search method, and the logical and lexical functions, weights, etc applied to the keywords will depend on the index address. One actual index may have several hypertext addresses, which when searched on will behave in different ways. For example, one may allow a search on author-given keywords only, while another may be a full text search. These things particular to an index should be descibed in the hypertext page for the index node itself (or in linked documents). For example, a server may allow specific boolean search combinations may be represented by the words "and", "or" and "not".
http://cernvm/FIND/?sgml+cms
indicates the result of perfoming a search for keywords "sgml" and "cms" on the index http://cernvm/FIND/.
<TITLE>/private/Net/cernvax/userd/tbl/hypertext/WWW/Addressing/Search.html</TITLE> <NEXTID 1> <H1>Address for an index Search</H1>If a given hypertext node is an index, or the server has an index associated with it, then a search may be done on that index by suffixing the name of the index with a list of keywords, after a question mark: <XMP> address_of_index ? keywordlist </XMP>The address of the index is a normal hypertext address. In the keywordlist, multiple keywords are separated by plus signs (+) . (See <A NAME=0 HREF=BNF.html>BNF syntax description</A> .) The resulting string still does not contain any spaces. It may be considered to be the hypertext address of a document which is the result of making the keyword search on the index. Normally, if the search was successful, the document returned will contain anchors leading to other documents which match the selection criteria. <P> The search method, and the logical and lexical functions, weights, etc applied to the keywords will depend on the index address. One actual index may have several hypertext addresses, which when searched on will behave in different ways. For example, one may allow a search on author-given keywords only, while another may be a full text search. These things particular to an index should be descibed in the hypertext page for the index node itself (or in linked documents). For example, a server may allow specific boolean search combinations may be represented by the words "and", "or" and "not". <H2>Example:</H2> <XMP> http://cernvm/FIND/?sgml+cms </XMP>indicates the result of perfoming a search for keywords "sgml" and "cms" on the index http://cernvm/FIND/.
This file shows an early glimpse of how <ISINDEX> would
pass its entered parameter back to the search engine, though the tag itself
goes unmentioned here.
What is Hypertext? - Windows Internet Explorer
Hypertext is text which is not constrained to be linear.
Hypertext is text which contains links to other texts. The term was coined by Ted Nelson around 1965 (see History ).
HyperMedia is a term used for hypertext which is not constrained to be text: it can include graphics, video and sound , for example. Apparently Ted Nelson was the first to use this term too.
Hypertext and HyperMedia are concepts, not products.
See also:
<TITLE>What is Hypertext?</TITLE> <NEXTID 20> <H1>What is HyperText</H1>Hypertext is text which is not constrained to be linear.<P> Hypertext is text which contains <A NAME=0 HREF=Terms.html#link>links</A> to other texts. The term was coined by <A NAME=1 HREF=Xanadu.html#Nelson>Ted Nelson</A> around 1965 (see <A NAME=12 HREF=../History.html>History</A> ).<P> HyperMedia is a term used for hypertext which is not constrained to be text: it can include graphics, video and <A NAME=9 HREF=Talks/YesWeCan.snd>sound</A> , for example. Apparently Ted Nelson was the first to use this term too.<P> Hypertext and HyperMedia are concepts, not products.<P> See also: <UL> <LI><A NAME=2 HREF=Terms.html>A list of terms</A> used in hypertext litterature. <LI><A NAME=19 HREF=../Conferences/Overview.html>Conferences</A> <LI><A NAME=7 HREF=../Products/Overview.html>Commercial (and academic) products</A> <LI>A newsgroup on hypertext, <A NAME=5 HREF=news:alt.hypertext>"alt.hypertext"</A> . <LI><A NAME=4 HREF=TheProject.html>WorldWideWeb is a project</A> which uses hypertext concepts. <LI><A NAME=10 HREF=../Standards/Overview.html>Standards</A> .</A> </UL>
One can see from the large <NEXTID> value and small number of
links that this file has been modified a great many times since its creation. This
is the file pointed to by the oldest surviving HTML file on the entire internet.
One can also glean a sense of the sequence of the original creation of the various
entries by looking at their NAME= values.
The GNU General Public License Version 2.0 - Windows Internet Explorer
<TITLE>The GNU General Public License Version 2.0</TITLE>
<PLAINTEXT>
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
675 Mass Ave, Cambridge, MA 02139, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
␌
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
␌
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
␌
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
␌
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
␌
Appendix: How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) 19yy <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19yy name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
This file contains the oldest (and only) surviving instance in the W3C
archives of the <PLAINTEXT> tag, not counting those
created for demonstration purposes only. Even so, there are reports of the
<PLAINTEXT> tag having been implemented in one or more
browsers as far back as February, 1991. Since this file has no content apart
from the raw text (and the title) I have only presented here the title and
the raw text source. The file also contained ASCII Form Feed Control
Characters. I have replaced these characters with a Unicode glyph character
that stands for the ASCII Form Feed Control character (␌)
which shows up as ␌ in the above sample.
Hypertext Terms - Windows Internet Explorer
This is a glossary of terms used within the WWW project. In most cases, their use corresponds to converntional use in hypertext circles.
<TITLE>Hypertext Terms</TITLE> <NEXTID 62> <H1>Hypertext Terms</H1>This is a glossary of terms used within the <A NAME=0 HREF=TheProject.html>WWW</A> project. In most cases, their use corresponds to converntional use in hypertext circles. <DL> <DT><A NAME=anchor>Anchor</A> <DD> An area within a the content of a <A NAME=1 HREF=#node>node</A> which is the source or destination of a <A NAME=2 HREF=#link>link</A> . The anchor may be the whole of the node content. Typically, clicking a mouse on an anchor area causes the link to be followed, leaving the anchor at the opposite end of the link displayed. Anchors tend to be highlighted in a special way (always, or when the mouse is over them), or represented by a special symbol. An anchor may, and often does, correspond to the whole node. (also sometimes known as "span", "region", "button", or "extent"). <DT><A NAME=annotation>Annotation</A> <DD> The linking of a new commentary <A NAME=3 HREF=#node>node</A> to an existing node. If readers can annotate nodes, then they can immediately provide feedback if the information is misleading, out of date or plain wrong. Thus the quality of the information in the <A NAME=4 HREF=#web>web</A> can be improved. <A NAME=47 HREF=DesignIssues/Multiuser.html#2>(More...)</A> <DT><A NAME=authoring>Authoring</A> <DD> A term for the process of writing a document. "Authoring" seems to have come into use in order to emphasise that document production involved more than just writing. <DT><A NAME=59>Back link</A> <DD>A link in one direction implied from the existence of an explicit limk in the other direction. See: <A NAME=61 HREF=DesignIssues/BuildingBackLinks.html>Building back-links</A> <DT><A NAME=browser>Browser</A> <DD> A program which allows a <A NAME=5 HREF=#reader>person</A> to read<A NAME=6 HREF=#hypertext> hypertext</A> . The browser gives some means of viewing the contents of <A NAME=7 HREF=#node>nodes</A> , and of <A NAME=8 HREF=#navigation>navigating</A> from one node to another. <DT>Button <DD> An <A NAME=9 HREF=#anchor>anchor</A> which is the source of a <A NAME=10 HREF=#link>link</A> . Often, but not always, represented on screen to look like a push-button. <DT><A NAME=card>Card</A> <DD> An alternative term for a <A NAME=11 HREF=#node>node</A> in a system (e.g. HyperCard, Notecards) in which the node size is limited to a single page of a limited size. <DT><A NAME=client>Client</A> <DD> A program which requests services of another program. Normally, the <A NAME=12 HREF=#browser>browser</A> is a client of a data server. <DT><A NAME=database>Database</A> <DD> We have used this vaguely as a term for a collection of <A NAME=13 HREF=#node>nodes</A> . We imagine management information for one of these being kept in one place and all being accessible by the same <A NAME=14 HREF=#server>server</A> . <A NAME=15 HREF=#link>Links</A> outside this are "external", and those inside are "internal". We do not imply anything about how the information shored be stored. <DT><A NAME=daemon>Daemon</A> <DD> A program which runs independently of, for example the <A NAME=16 HREF=#browser>browser</A> . Daemons may perform various management tasks such as <A NAME=58 HREF=DesignIssues/Navigation.html#9>building indexes</A>, overviews, and <A NAME=60 HREF=#59>back-links</A>. Under unix, "daemon" is used for "<A NAME=56 HREF=#server> server</A> ", because servers normally run independently. <DT><A NAME=Document>Document</A> <DD> A term for a <A NAME=17 HREF=#node>node</A> on some systems (eg Intermedia). Sometimes used by others as a term for a collection of nodes on related topics, possible stored or distributed as one. The prefered term in W3 documentation. <DT><A NAME=domain>Domain</A> <DD> We have used this specifically for a unit of protection. It could possibly correspond to a <A NAME=18 HREF=#database>database</A> , and in that case would be a better (less vague) term for it. <DT>External <DD> A <A NAME=19 HREF=#link>link</A> to a <A NAME=20 HREF=#node>node</A> in a different database. See <A NAME=21 HREF=#database>Database</A> <DT>Host <DD> A computer on a network. We use this term rather than the term "<A NAME=53 HREF=#node> node</A> " which is often used for a document in a hypertext <A NAME=52 HREF=#web>web</A> . <DT><A NAME=hypermedia>Hypermedia</A> <DD> MultiMedia <A NAME=22 HREF=#hypertext>Hypertext</A> . HyperMedia and HyperText tend to be used loosely in place of each other. Media other than text typically include graphics, sound, and video.<A NAME=23 HREF=WhatIs.html> (More...)</A> <DT><A NAME=hypertext>Hypertext</A> <DD> Text which is not constrained to be linear. <A NAME=24 HREF=WhatIs.html>(More...)</A> <DT><A NAME=index>Index</A> <DD> Something which points at other data; a server facility which provides pointers to particular data as a function of a query; a table of contents of a book in hypertext form. (<A NAME=55 HREF=DesignIssues/WhatIsAnIndex.html> More</A> ). <DT><A NAME=internal>Internal</A> <DD> A <A NAME=25 HREF=#link>link</A> to a <A NAME=26 HREF=#node>node</A> in the same <A NAME=27 HREF=#database>database</A> . See <A NAME=28 HREF=#database>database</A> . <DT><A NAME=link>Link</A> <DD> A relationship between two <A NAME=29 HREF=#anchor>anchors</A> , stored in the same or different<A NAME=30 HREF=#database> database</A> . See <A NAME=31 HREF=#internal>"Internal"</A> and <A NAME=32 HREF=external>"External"</A> . <DT><A NAME=navigation>Navigation</A> <DD> The process of moving from one <A NAME=33 HREF=#node>node</A> to another through the hypertext<A NAME=34 HREF=#web> web</A> . This is normally done by following <A NAME=35 HREF=#link>links</A> . Various features of a particular <A NAME=36 HREF=#browser>browser</A> may make this easier. These include keeping a history of where the user has been, and drawing diagrams of links between nearby nodes. <A NAME=45 HREF=DesignIssues/Navigation.html>(More...)</A> <DT><A NAME=node>Node</A> <DD> A unit of information. Also known as a frame (KMS), card (Hypercard, Notecards). Used with this special meaning in hypertext circles: do not confuse with "node" meaning "network host". For user's benefits, we use the term "<A NAME=54 HREF=#Document> document</A> " as this is the nearest term outside the hypertext world. <DT>Protection <DD> The prevention of unauthorized users from reading, or writing, a particular piece of data. Also known as "authentication", "access control", etc. <A NAME=48 HREF=DesignIssues/Multiuser.html#1>(More...)</A> <DT><A NAME=path>Path</A> <DD> An ordered set of nodes or anchors which represent a sequence in which a<A NAME=37 HREF=#web> web</A> can be read. A path may represent the sequence a reader actually used, or may be a sequence recommened to the reader by the author. <DT><A NAME=reader>Reader</A> <DD> We have used this term for the person who browses, to distinguish him/her from the program (<A NAME=38 HREF=#browser> browser</A> ) which (s)he uses. <DT><A NAME=server>Server</A> <DD> A program which provides a service to another, known as the<A NAME=39 HREF=#client> client</A> . In a <A NAME=40 HREF=#hypertext>hypertext</A> system, a server will provide hypertext information to a <A NAME=41 HREF=#browser>browser</A> . See also: <A NAME=57 HREF=#daemon>daemon</A> . <DT>Tracing <DD> The automatic finding of nodes by automatic <A NAME=42 HREF=#navigation>navigation</A> . Examples might be finding all nodes dependent on another node, all people interested in a given node, all modules which use a given module. Another example is a trace starting with more than one node, such as to find a node in common between two groups, or path linking two nodes. <DT><A NAME=50>Topology</A> <DD> The allowable connectivity between nodes, anchors and links: for example, 1-1 or many-1 mappings.<A NAME=49 HREF=DesignIssues/Topology.html> (More...)</A> <DT><A NAME=versioning>Versioning</A> <DD> The storage and management of previous versions of a piece of information, for security, diagnostics, and interest. This is important when many users are allowed to edit the same material. <A NAME=46 HREF=DesignIssues/Versioning.html>(More...)</A> <DT><A NAME=web>Web</A> <DD> A set of <A NAME=43 HREF=#node>nodes</A> interconnected by <A NAME=44 HREF=#link>links</A> . Often, the set of all the nodes which are interconnected. See also <A NAME=51 HREF=#50>Topology</A> .
Though this file is very old, it has been updated some number of times. Many of the early files point to this file.
HyperText Design Issues: Navigational techniques - Windows Internet Explorer
There are a number of ways of accessing the data one is looking for. Navigational access (i.e., following links) is the essence of hypertext, but this can be enhanced with a number of facilities to make life more efficient and less confusing.
It is sometimes nice for a reader to be able to reference a document structure built specifically to enhance his understanding, by the document author. This is especially important when the structure is part of the information the author wishes to convery.
See a separate discussion of this point .
A Graphic overview is useful and could be built automatically. Should it be made by the author, server, browser or an independent daemon?
Can one provide an overview with less granularity than the basic web by grouping nodes in some way? The user could select from link types used to imply the tree structure. (JFG)
I think this depends on how long it will take. It might be interesting to experiment with daemons which will independently make and update maps of the web. This is not essential for a first pilot model.
This allows users to retrace their steps. Typical functions provided can be interpreted in a hypertext web as follows:
In many hypertext systems, a tree structure is forcibly imposed on the data, and these functions are interpreted only with respect to the links in the tree. However, the reader as he browses defines a tree, and it may be more relevant to him to use that tree as a basis for these functions. I would therefore suggest that an explicit tree structure not be enforced.
(If a default tree is needed by the system for some reason, then we can always use the creation order: when a node is created it is always created with a link to an existing node. Such links, whatever their type, may be used to define a tree. If they are deleted, an alternative link must be chosen to become a tree link.)
If authors want to write a tree structure into their documents, then the words "after", "before" and "above" could be used to mean a static structure.
An Index helps new readers of a large database quickly find an obscure node. Keyword schemes I include in the general topic of indexes. The index must, like a graphic overview, be built either by the author, or automatically by one of the server, browser, or a daemon. The index entries may be taken from the titles, a keyword list, or the node content or a combination of these. Note that keywords, if they are specifically created rather than random words, map onto hypertext “concept” nodes, or nodes of special type “keyword”. It is interesting to establish an identity relationship between keywords in two different databases -- this may lead a searcher from one database into another.
Index schemes are important but indexes or keywords should look like normal hypertext nodes. The particular special operation one can do with a good keyword index system which one can't do with a normal hypertext system is to do a fast search on multiple keywords. This must to be provided as an extension to the hypertext navigation scheme. However, it is in fact analogous to a trace starting with more than one node, which is a valid hypertext tracing operation. The difference is that the tracing would normally be done by a browser, but the indexed search done by the server.
When many nodes in a web represent different indexes, then a query search can chain between them (See " Web of indexes ").
See also: HyperText and Information Retrieval
These allow faster access if one knows the name. They allow people to give references to hypertext nodes in other documents, over the telephone, etc. This is very useful. However, in Notecards, where the naming of nodes was enforced, it was found that thinking up names for nodes was a bore for users. KMS thought that being able to jump to a named node was important. The node name allows a command line interface to be used to add new nodes.
I think that naming a node should be optional: perhaps by default the system could provide a number which can be used instead of a name.The system should certainly support the naming of nodes, and access by name.
Regular linkwise navigation may be done with “hotspots” (highlighted anchors) or may be done with a menu. It may be useful to have a menu of all the links from a given node as an alternative way of navigating. Enquire, for example, offers a menu of references as the only way of navigating.
<TITLE>HyperText Design Issues: Navigational techniques</TITLE> <NEXTID 10> <H1>Navigational Techniques and Tools</H1> <ADDRESS><A NAME=5 HREF=../People.html#BernersLee>TBL</A> </ADDRESS>There are a number of ways of accessing the data one is looking for. Navigational access (i.e., following links) is the essence of hypertext, but this can be enhanced with a number of facilities to make life more efficient and less confusing. <H2>Defined structure</H2>It is sometimes nice for a reader to be able to reference a document structure built specifically to enhance his understanding, by the document author. This is especially important when the structure is part of the information the author wishes to convery.<P> See a <A NAME=2 HREF=../../Conferences/ECHT90/Structured.html>separate discussion of this point</A> . <H2><A NAME=6>Graphic Overview</A></H2>A Graphic overview is useful and could be built automatically. Should it be made by the author, server, browser or an independent daemon?<P> Can one provide an overview with less granularity than the basic web by grouping nodes in some way? The user could select from <A NAME=3 HREF=Topology.html#4>link types</A> used to imply the tree structure. <A NAME=4 HREF=../People.html#groff>(JFG)</A><P> I think this depends on how long it will take. It might be interesting to experiment with daemons which will independently make and update maps of the web. This is not essential for a first pilot model. <H2>History mechanism</H2>This allows users to retrace their steps. Typical functions provided can be interpreted in a hypertext web as follows: <DL> <DT>Home <DD> Go to initial node <DT>Back <DD> Go to the node visited before this one in chronological order. Modify the history to remove the current node. <DT>Next <DD> When the current node is one of several nodes linked to the “back” node, go to the next of those nodes. Leave the “Back” node unchanged. Modify the history to remove the current node and replace it with the "next" (new current) node. <DT>Previous <DD> When the current node is one of several nodes linked to the “back” node, go to the preceding one of those nodes. </DL> In many hypertext systems, a tree structure is forcibly imposed on the data, and these functions are interpreted only with respect to the links in the tree. However, the reader as he browses defines a tree, and it may be more relevant to him to use that tree as a basis for these functions. I would therefore suggest that an explicit tree structure not be enforced. <P> (If a default tree is needed by the system for some reason, then we can always use the creation order: when a node is created it is always created with a link to an existing node. Such links, whatever their type, may be used to define a tree. If they are deleted, an alternative link must be chosen to become a tree link.) <P> If authors want to write a tree structure into their documents, then the words "after", "before" and "above" could be used to mean a static structure. <H2><A NAME=8>Index</A></H2>An Index helps new readers of a large database quickly find an obscure node. Keyword schemes I include in the general topic of indexes. <A NAME=9>The index must, like a graphic overview, be built either by the author, or automatically by one of the server, browser, or a daemon</A>. The index entries may be taken from the titles, a keyword list, or the node content or a combination of these. Note that keywords, if they are specifically created rather than random words, map onto hypertext “concept” nodes, or nodes of special type “keyword”. It is interesting to establish an identity relationship between keywords in two different databases -- this may lead a searcher from one database into another.<P> Index schemes are important but indexes or keywords should look like normal hypertext nodes. The particular special operation one can do with a good keyword index system which one can't do with a normal hypertext system is to do a fast search on multiple keywords. This must to be provided as an extension to the hypertext navigation scheme. However, it is in fact analogous to a trace starting with more than one node, which is a valid hypertext tracing operation. The difference is that the tracing would normally be done by a browser, but the indexed search done by the server.<P> When many nodes in a web represent different indexes, then a query search can chain between them (See "<A NAME=7 HREF=ManyIndexes.html> Web of indexes</A> ").<P> See also:<A NAME=1 HREF=../../Conferences/ECHT90/HTandIR.html> HyperText and Information Retrieval</A> <H2>Node Names</H2>These allow faster access if one knows the name. They allow people to give references to hypertext nodes in other documents, over the telephone, etc. This is very useful. However, in Notecards, where the naming of nodes was enforced, it was found that thinking up names for nodes was a bore for users. KMS thought that being able to jump to a named node was important. The node name allows a command line interface to be used to add new nodes.<P> I think that naming a node should be optional: perhaps by default the system could provide a number which can be used instead of a name.The system should certainly support the naming of nodes, and access by name. <H2>Menu of links</H2>Regular linkwise navigation may be done with “hotspots” (highlighted anchors) or may be done with a menu. It may be useful to have a menu of all the links from a given node as an alternative way of navigating. Enquire, for example, offers a menu of references as the only way of navigating.
This file employs two non-ASCII characters (Hex AA and BA, which would appear as the ISO-8859-1 characters "ª" and "º") and which served as left-and-right symmetrical quotation “double quotes”, in whatever computer encoding was considered current then. I have corrected them here to be their opening and closing double quotation marks. These characters are not in the basic ISO-8859-1 list and thus are included here by the use of the character entities for them (introduced with HTML 4).
People involved in the WorldWideWeb project - Windows Internet Explorer
This is a list of some of those who have contributed to the WWW project , and whose work is linked into this web. Unless otherwise stated they are at CERN, Phone +41(22)767 plus the extension given below or look them up in the phone book . Address: 1211 Geneva 23, Switzerland. See also: Wizards at SLAC .
Ported the line-mode browser the PC under PC-NFS; developed a curses version. Email: evas@cs.few.eur.nl.
Carl is at CERN for a six month period during his degree course at Brunel University, UK. Carl will be working on the server side, possibly on client authentication. Tel: 8265. Email: barker@cernnext.cern.ch
Currently in CN division. Before comming to CERN, Tim worked on, among other things, document production and text processing. He developped his first hypertext system, "Enquire", in 1980 for his own use (although unaware of the existence of the term HyperText). With a background in text processing, real-time software and communications, Tim decided that high energy physics needed a networked hypertext system and CERN was an ideal site for the development of wide-area hypertext ideas. Tim started the WorldWideWeb project at CERN in 1989. He wrote the application on the NeXT along with most of the communications software. Phone: 3755, Email: timbl@info.cern.ch
Formerly in programming language design and compiler construction, Robert has been interested in document production since 1975, when he designed and implemented a widely used document markup and formatting system. He ran CERN's Office Computing Systems group from 87 to 89. He is a long-time user of Hypercard, which he used to such diverse ends as writing trip reports, games, bookkeeping software, and budget preparation forms. When he is not doing WWW's public relations, Robert is contributing browser software for the Macintosh platform, and analysing the needs of physics experiments for online data access. Phone: +41 (22) 767 50 05, Email: cailliau@cernnext.cern.ch
An early follower of the project, Dan wrote a private X-Windows editor for his company, and encouraged the use of proper SGML and MIME in the future. He wrote a DTD for HTML and an HTML legalizer for old files. Email: connolly@pixel.convex.com.
While at the DESY lab in Hamburg (DE), Peter did the port of the line-mode browser onto MVS and, indirectly, VM/CMS. These were the most difficult of the ports to date. He also overcame many incidental problems in making a large amount of information in the DESY database available.
Kim Nyberg, Teemu Rantanen, Kati Suominen and Kari Syd{nmaanlakka ('{' is 'a' with two dots above it.. we must get some character set description into HTML!) (under the supervision of Ari Lemmke) are "Erwise". At Helsinki Technical University, they are writing a Motif-based WWW browser (editor? we can hope...) for their undergraduate final year project. The team can be reached as erwise@cs.hut.fi and Ari as arl@cs.hut.fi.
Alain is an undergraduate working with ECP/PT on a browser for Windows on PCs. Phone: 8265, no email yet. In CERN mostly in the afternoons.
With wide experience in networking, and a current conviction information systems and PC/Windows being the way of the future, Dave is having a go at a MS-Windows browser/editor. Dave also has a strong interest in server technology and intelligent information retrieval algorithms.
Provided some useful input in the "design issues". During his stay at CERN as "cooperant", J-F joined the project in September 1991. He wrote the gateway to the VMS Help system , worked on the new modular browser architecure, and helped support and present WWW at all levels. He is now porting the communications code to DECnet in order to set up servers for physics experiments. JF now works for NeXT Europe but continues his interest in the web...( Contact )
Tel: (415) 926 2278, TONYJ@scs.slac.stanford.edu.
Designer of MidasWWW . Boston University, collaborating with SLAC, SSC, etc. A SLAC server expert and a WWWizard .
Paul took the W3 word across to SLAC, installed the clients and inspired the setting up of servers by the WWWizards . Paul spreads enthusiasm for all sort of good ideas such as OO programming, NeXTs, etc...
at NIKHEF, WIllem put up many servers and has provided much useful feedback about the w3 browser code.
With the project from November 1990 to August 1991, and October 1992 to ??. A graduate of Leicester Polytechnic, UK, Nicola wrote the original line mode browser . ( More ) Nicola is now (Oct 92) working on the Mac browser .
Bernd is responsible for the "XFIND" indexes on the CERNVM node, for their operation and, largely, their contents. He is also the editor of the Computer Newsletter (CNL), and has experience in managing large databases of information. Bernd is in the AS group of CN division. He has contributed code for the FIND server which allows hypertext access to this large store of information. Phone: 2407, Office: 513-1-16, Email: bernd@cernvm.cern.ch
A student at CERN during August and September 1992, Arthur wrote the first W3-Oracle gateway .
Online Support group, FNAL. Jonathan put up a VMS server using DCL and later C. He helped debug the Mac browser.
Pei is the author of " Viola", a hypertext browser, and the ViolaWWW variant which is a WWW browser. He was at the University of California at Berkeley, Experimental Computing Facility, now full time with O'Reilly and Associates, Sebastopol, CA, USA. Email: wei@xcf.berkeley.edu
one of the WWWizards at SLAC, Bebo enthusiastically spreads the word. During a short stay at CERN in summer '92, Bebo put up a number of servers for information from the Aleph experiment.
New Jersey Institute of Technology. jim@eies2.njit.edu
<TITLE>People involved in the WorldWideWeb project</TITLE>
<NEXTID 26>
<H1>WWW people</H1>This is a list of some of those who have contributed to the <A NAME=7 HREF=TheProject.html>WWW project</A>
, and whose work is linked into this web. Unless otherwise stated
they are at CERN, Phone +41(22)767 plus the extension given below
or look them up in the <A NAME=14 HREF=http://crnvmc.cern.ch./WHO>phone book</A> . Address: 1211 Geneva 23, Switzerland.
See also: <A NAME=12 HREF=http://slacvm.slac.stanford.edu:80/FIND/wizards.html>Wizards at SLAC</A> .
<H2>Eelco van Asperen</H2>Ported the line-mode browser the PC under PC-NFS; developed a curses
version. Email: evas@cs.few.eur.nl.
<H2><A NAME=11>Carl Barker</A></H2>Carl is at CERN for a six month period during his degree course at
Brunel University, UK. Carl will be working on the server side, possibly
on client authentication. Tel: 8265. Email: barker@cernnext.cern.ch
<H2><A NAME=BernersLee>Tim Berners-Lee</A></H2>Currently in CN division. Before comming to CERN, Tim worked on, among
other things, document production and text processing. He developped
his first hypertext system, "Enquire", in 1980 for his own use (although
unaware of the existence of the term HyperText). With a background
in text processing, real-time software and communications, Tim decided
that high energy physics needed a networked hypertext system and CERN
was an ideal site for the development of wide-area hypertext ideas.
Tim started the <A NAME=0 HREF=TheProject.html>WorldWideWeb</A> project at CERN in 1989. He wrote the<A NAME=2 HREF=NeXT/WorldWideWeb.html>
application on the NeXT</A> along with most of the communications software.
Phone: 3755, Email: timbl@info.cern.ch
<H2><A NAME=Cailliau>Robert Cailliau</A></H2>Formerly in programming language design and compiler construction,
Robert has been interested in document production since 1975, when
he designed and implemented a widely used document markup and formatting
system. He ran CERN's Office Computing Systems group from 87 to 89.
He is a long-time user of Hypercard, which he used to such diverse
ends as writing trip reports, games, bookkeeping software, and budget
preparation forms. When he is not doing WWW's public relations, Robert
is contributing browser software for the Macintosh platform, and analysing
the needs of physics experiments for online data access. Phone: +41
(22) 767 50 05, Email: cailliau@cernnext.cern.ch
<H2>Dan Connolly</H2>An early follower of the project, Dan wrote a private X-Windows editor
for his company, and encouraged the use of proper SGML and MIME in
the future. He wrote a <A NAME=15 HREF=MarkUp/HTML.dtd>DTD for HTML</A> and an <A NAME=16 HREF=Tools/HTMLGeneration/fix-html.pl>HTML legalizer</A> for old
files. Email: connolly@pixel.convex.com.
<H2>Peter Dobberstein</H2>While at the DESY lab in Hamburg (DE), Peter did the port of the
line-mode browser onto MVS and, indirectly, VM/CMS. These were the
most difficult of the ports to date. He also overcame many incidental
problems in making a large amount of information in the <A NAME=6 HREF=http://crnvmc.cern.ch/FIND/DESY?>DESY database</A>
available.
<H2><A NAME=9>"Erwise" team</A></H2>Kim Nyberg, Teemu Rantanen, Kati Suominen and Kari Syd{nmaanlakka
('{' is 'a' with two dots above it.. we must get some character set
description into HTML!) (under the supervision of Ari Lemmke) are
"Erwise". At Helsinki Technical University, they are writing a Motif-based
WWW browser (editor? we can hope...) for their undergraduate final
year project. The team can be reached as erwise@cs.hut.fi and Ari
as arl@cs.hut.fi.
<H2>Alain Favre</H2>Alain is an undergraduate working with ECP/PT on a browser for Windows
on PCs. Phone: 8265, no email yet. In CERN mostly in the afternoons.
<H2>David Foster</H2>With wide experience in networking, and a current conviction information
systems and PC/Windows being the way of the future, Dave is having
a go at a MS-Windows browser/editor. Dave also has a strong interest
in server technology and intelligent information retrieval algorithms.
<H2><A NAME=Groff>Jean-Francois Groff</A></H2>Provided some useful input in the "design issues". During his stay
at CERN as "cooperant", J-F joined the project in September 1991.
He wrote the<A NAME=5 HREF=VMSHelp/Overview.html> gateway to the VMS Help system</A> , worked on the new modular
browser architecure, and helped support and present WWW at all levels.
He is now porting the communications code to DECnet in order to set
up servers for physics experiments. JF now works for NeXT Europe
but continues his interest in the web...(<A NAME=23 HREF=People/Groff.html> Contact</A> )
<H2>Tony Johnson</H2>Tel: (415) 926 2278, TONYJ@scs.slac.stanford.edu.<P>
Designer of <A NAME=21 HREF=Status.html#60>MidasWWW</A> . Boston University, collaborating with SLAC,
SSC, etc. A SLAC server expert and a <A NAME=22 HREF=http://slacvm.slac.stanford.edu:80/FIND/wizards.html>WWWizard</A> .
<H2>Paul Kunz</H2>Paul took the W3 word across to SLAC, installed the clients and inspired
the setting up of servers by the <A NAME=19 HREF=http://slacvm.slac.stanford.edu:80/FIND/wizards.html>WWWizards</A> . Paul spreads enthusiasm
for all sort of good ideas such as OO programming, NeXTs, etc...
<H2>Willem van Leeuwen</H2>at NIKHEF, WIllem put up many <A NAME=10 HREF=http://nic.nikhef.nl./user/a03/www/default/NikhefGuide.html>servers</A> and has provided much useful
feedback about the w3 browser code.
<H2><A NAME=Pellow>Nicola Pellow</A></H2>With the project from November 1990 to August 1991, and October 1992
to ??. A graduate of Leicester Polytechnic, UK, Nicola wrote the
original <A NAME=1 HREF=LineMode/Browser.html>line mode browser</A> . (<A NAME=20 HREF=People/Pellow.html> More </A> ) Nicola is now (Oct 92) working
on the <A NAME=24 HREF=Macintosh/Status.html>Mac browser</A> .
<H2><A NAME=Pollermann>Bernd Pollermann</A></H2>Bernd is responsible for the "XFIND" indexes on the CERNVM node, for
their operation and, largely, their contents. He is also the editor
of the Computer Newsletter (CNL), and has experience in managing large
databases of information. Bernd is in the AS group of CN division.
He has contributed <A NAME=3 HREF=Status.html#17>code</A> for the FIND server which allows hypertext
access to this large store of information. Phone: 2407, Office: 513-1-16,
Email: bernd@cernvm.cern.ch
<H2><A NAME=17>A</A> r<A NAME=17> thur Secret</A></H2>A student at CERN during August and September 1992, Arthur wrote the
first <A NAME=18 HREF=Daemon/Oracle/Overview.html>W3-Oracle gateway</A> .
<H2>Jonthan Streets</H2>Online Support group, FNAL. Jonathan put up a VMS server using DCL
and later C. He helped debug the Mac browser.
<H2>Pei Wei</H2>Pei is the author of " Viola", a hypertext browser, and the ViolaWWW
variant which is a WWW browser. He was at the University of California
at Berkeley, Experimental Computing Facility, now full time with O'Reilly
and Associates, Sebastopol, CA, USA. Email: wei@xcf.berkeley.edu
<H2>Bebo White</H2>one of the <A NAME=25 HREF=http://slacvm.slac.stanford.edu:80/FIND/wizards.html>WWWizards</A> at SLAC, Bebo enthusiastically spreads the word.
During a short stay at CERN in summer '92, Bebo put up a number of
servers for information from the Aleph experiment.
<H2>James Whitescarver</H2>New Jersey Institute of Technology. jim@eies2.njit.edu
Overview -- /Conferences - Windows Internet Explorer
This is a list of conferences, seminars, schools, etc. of interest to High-Energy Physicists. Please mail www-request@info.cern.ch to add your conference here.
<TITLE>Overview -- /Conferences</TITLE> <NEXTID 2> <H1>HEP conferences and schools</H1>This is a list of conferences, seminars, schools, etc. of interest to High-Energy Physicists. Please mail www-request@info.cern.ch to add your conference here. <DL> <DT><A NAME=1 HREF=Caribbean93/Overview.html>Caribbean Spring'93</A> <DD> First Caribbean Spring School of Theoretical Physics and Mathematics, 30 May-13 June 1993 in St-Francois, Guadeloupe, French West Indies. Topics are Infinite Dimensional Geometry, Non-Commutative Geometry, Operator Algebras, Fundamental Interactions. <DT>Computing in HEP 92 <DD>Annecy, France, September 1992 <DT>Physics Computing '92 <DD> Praha, Czechoslovakia, 24-28 August 1992. </DL> <ADDRESS><A NAME=0 HREF=http://info.cern.ch./hypertext/TBL_Disclaimer.html>Tim BL</A> </ADDRESS>
This is the newest file found which was written to this version of HTML in the W3C archives, representing the end of this era of HTML.
This file, "htmlsource0.c.html," is HTML 4.01 Strict
compliant.
This file also validates without error as
CSS level 2.1.