, , , , [, , and . should not be confused with , which is used to designate the spheres of activities that generated the materials, rather than a profession, etc. It should also not be confused with the ROLE attribute on various other names which is used to specify the relationship of that name to the materials, vs. an occupation which features in the materials. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC field 656. NORMAL – not required. Can be used to provide the authority form if the name is being used informally within narrative text, etc. ROLE – not required. May be used to designate the role which the term played in the collection, e.g. “subject.” RULES – not required. May be used to specify the descriptive rules followed when forming the term. SOURCE – not required. The source of the controlled vocabulary, e.g. “lcsh” for Library of Congress Subject Headings. Subelements may contain PCDATA, , , ]
, and . Examples ... ... During this period, she taught math at the Central Mindanao University.
... ... During this period, she taught math at the Central Mindanao University.
Occupations: Peace Corps volunteer Math teacher Linguistics professor Occupations: Peace Corps volunteer Math teacher Linguistics professor EAD tag library entry for . This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-1884 ---- Biography or History | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact Biography or History is an essay or chronology which puts the materials in a historical context. It may contain the information as simple text inside elements or a . It may be nested within itself for complex biographical and historical data (for example, multiple family members). is one of the elements which may be used within , , , through , and .It may also be used in . Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. TYPE – not required. May be used to designate the type of information. Subelements may contain further elements, as well as , , , , , , , , , and
. Note, since PCDATA is not used within this element, it serves as a wrapper, at least of a element containing the actual text. DACS See DACS Section 2.7, Administrative/biographical history. (Page 34 of 2007 edition; page 57 of 2007 edition PDF.) For more on writing this content, see DACS Section 10, Administrative/biographical history. (Page 93 of 2007 edition; page 116 of 2007 edition PDF.) Examples Some examples of how may be used: Biography Sarah J. Bell was born in Hillsboro Ohio in 1945. After graduating from St. John's College in 1963, she joined the recently-formed Peace Corps and was sent to teach math on the island of Mindanao, Philippines. She spent two years teaching math to students and high school teachers at Central Mindanao University in Musuan. After returning to the United States, she worked measuring air pollutants in Ann Arundel County, MD, before obtaining a PhD in Linguistics from MIT. She taught at the University of British Columbia, BC, Canada and studied the language of the Secwepemc (also called Shuswap) people of the interior of British Columbia.
In 1982, she married Bruce B. Kitchin and moved to Delaware, United States. Upon the birth of her first child in 1985, she retired from college-level teaching and instead taught adult literacy classes with Literacy Volunteers. In 2004, she began teaching Latin to middle school students at Towle Institute in Delaware, where she continued to teach until the end of 2009, 7 months before her death from carcinoid cancer.
Biography Sarah J. Bell was born in Hillsboro Ohio in 1945. After graduating from St. John's College in 1963, she joined the recently-formed Peace Corps and was sent to teach math on the island of Mindanao, Philippines. She spent two years teaching math to students and high school teachers at Central Mindanao University in Musuan. After returning to the United States, she worked measuring air pollutants in Ann Arundel County, MD, before obtaining a PhD in Linguistics from MIT. She taught at the University of British Columbia, BC, Canada and studied the language of the Secwepemc (also called Shuswap) people of the interior of British Columbia.
In 1982, she married Bruce B. Kitchin and moved to Delaware, United States. Upon the birth of her first child in 1985, she retired from college-level teaching and instead taught adult literacy classes with Literacy Volunteers. In 2004, she began teaching Latin to middle school students at Towle Institute in Delaware, where she continued to teach until the end of 2009, 7 months before her death from carcinoid cancer.
Let’s make this a chronological list for a particular folder. Chronological Events October 28, 1978 Sam Wossname succeeds John Othername as department head. March 15, 1979 Departmental reorganization. Chronological Events October 28, 1978 Sam Wossname succeeds John Othername as department head. March 15, 1979 Departmental reorganization. EAD tag library entry for . This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-1893 ---- Name | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact Name encodes the proper noun or noun phrase designation for an entity that is difficult to tag more specifically as , , , , or . It should be used when a high degree of precision is not necessary but the name should still be tagged for access. It may be used within <bibref>, <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <origination>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, <repository>, and <unittitle>. Names with major representation in the materials should be listed within <controlaccess> even if they are indicated elsewhere. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC fields. It is comparable to MARC field 720 when it is not from a controlled vocabulary. NORMAL – not required. Can be used to provide the authority form if the name is being used informally within narrative text, etc. ROLE – not required. May be used to designate the role which the name played in the collection, e.g. “compiler,” “creator,” “subject,” etc. RULES – not required. May be used to specify the descriptive rules followed when forming the name. SOURCE – not required. The source of the controlled vocabulary, e.g. “lcsh” for Library of Congress Subject Headings. Subelements <name> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. Examples <bioghist> ... <p>From <date normal="1938/1949">1938 to 1949</date> the <famname normal="Bell family">family</famname> lived in the <name>Holland</name> House <geogname normal="Hillsboro, OH">Hillsboro, Ohio</geogname>. ...</p> </bioghist> <bioghist> ... <p>From <date normal="1938/1949">1938 to 1949</date> the <famname normal="Bell family">family</famname> lived in the <name>Holland</name> House <geogname normal="Hillsboro, OH">Hillsboro, Ohio</geogname>. ...</p> </bioghist> EAD tag library entry for <name>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-1982 ---- <genreform> Genre/Physical Characteristic | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <genreform> Genre/Physical Characteristic <genreform> is a term used to identify the types of materials being described based on their intellectual content, order of information, or object function. Examples may be anything from account books to videotapes. Not all genres/forms need to be tagged, but those for which greater retrieval should be provided may be tagged. The element may be used to tag any function during a paragraph, with the NORMAL attribute supplying the proper form of the term. Genres/forms which make up large amounts of the material should be listed within <controlaccess> even if they are indicated elsewhere. <genreform> may be used in <physdesc> or <physfacet> along with more detailed characteristics. <genreform> may be used within <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, and <unittitle>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC field 655 or 300 (when used with <extent>. NORMAL – not required. Can be used to provide the authority form if the word is being used informally within narrative text>, <etc. RULES – not required. May be used to specify the descriptive rules followed when forming the term. SOURCE – not required. The source of the controlled vocabulary>, <e.g. “lcsh” for Library of Congress Subject Headings. Subelements <genreform> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. DACS See DACS Section 2.5, Extent. (DACS 2013, pp.28-30) Examples <scopecontent> <head>Scope and Content of the Collection</head> <p>The collection primarily consists of <genreform>letters</genreform> but also contains a 5-year <genreform normal="diaries">diary</genreform>, which was kept from <date normal="1968/1972">1968 to 1972</date>.</p> </scopecontent> <scopecontent> <head>Scope and Content of the Collection</head> <p>The collection primarily consists of <genreform>letters</genreform> but also contains a 5-year <genreform normal="diaries">diary</genreform>, which was kept from <date normal="1968/1972">1968 to 1972</date>.</p> </scopecontent> EAD tag library entry for <genreform>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-2508 ---- <unittitle> Title of the Unit | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <unittitle> Title of the Unit <unittitle> encodes the name, either formal or supplied, of the described materials. It can be used in the highest level <did> to encode the highest-level title and within subordinate <c> levels to encode lower-level titles. <unittitle> should not be confused with the general element <title> or the <titleproper> of the finding aid. While <unittitle> is an important element within <did> and <c>, it may also be used within <archref>, <entry>, <event>, <extref>, <extrefloc>, <item>, <label>, <p>, <ref>, and <refloc> to reference the title of any unit. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. LABEL – not required. This can be used when a meaningful display label for an element can’t be derived by the stylesheet from its name. It is available in all <did> subelements. TYPE – not required. May be used to indicate the system from which the title was derived. Subelements <unittitle> will likely PCDATA. It may contain: <abbr>, <archref>, <bibref>, <bibseries>, <corpname>, <date>, <edition>, <emph>, <expan>, <extptr>, <extref>, <famname>, <function>, <genreform>, <geogname>, <imprint>, <lb />, <linkgrp>, <name>, <num>, <occupation>, <persname>, <ptr>, <ref>, <subject>, <title>, and <unitdate>. DACS Use DACS Section 2.3, Title. Required. (DACS 2013, pp.17-23) Our EAD file so far Let’s put in a title for the high-level <did>: <ead> <eadheader> <eadid countrycode="us" mainagencycode="dgwl" url="http://www.eadiva.com/sample/">rkt-01</eadid> <filedesc> <titlestmt> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <sponsor>Encoding thanks to EADiva's donation of her spare time.</sponsor> </titlestmt> <editionstmt><edition>1st ed.</edition> <p>Didn't need to specify since it's first edition, but wanted to use the fields.</p> </editionstmt> <publicationstmt> <date>2012</date> <publisher>EADiva.com</publisher> <address> <addressline>1600 Pennsylvania Ave</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </publicationstmt> <seriesstmt><p>Bell Family Papers</p> </seriesstmt> <notestmt> <note> <p>The materials in this finding aid are based on an actual collection of Sarah J. Bell Kitchin's letters.</p> </note> <note> <p>This finding aid was created as a project for the EADiva.com website.</p> </note> </notestmt> </filedesc> <profiledesc> <creation>This finding aid was encoded by Ruth K. Tillman, on <date normal="20121118">November 18th, 2012</date>, using Notepad++. Material was generated off the top of her head.</creation> <descrules>This finding aid was prepared using Ruth's understanding of EAD and her use of the LOC EAD 2002 official website.</descrules> <langusage>This finding aid is written in <language langcode="eng">English</language>. </langusage> </profiledesc> <revisiondesc> <change> <date normal="20121204">December 4, 2012</date> <item>This finding aid was edited by Ruth Tillman in order to clarify contents in eadheader.</item> </change> </revisiondesc> </eadheader> <frontmatter> <div><head>Preface</head> <p>This inventory was prepared as part of the EADiva website to demonstrate EAD encoding of finding aids. It encodes information about the collection of the papers of Sarah Bell Kitchin as well as made-up information used to make the finding aid use more example elements. Like this one.</p></div> <titlepage> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <publisher>EADiva.com</publisher> </titlepage> </frontmatter> <archdesc level="collection"> <did><head>Overview</head> <abstract label="Abstract">Sarah J. Bell Kitchin, a Peace Corps Volunteer and professor of linguistics at the University of British Columbia. Her letters home from the Philippines (1967-1969) and Russia. Letters from members of the Bell family (1967-2000). </abstract> <langmaterial label="Language">Correspondence in <language langcode="eng">English</language>. </langmaterial> <physdesc label="Extent"><extent type="shelf" unit="feet">0.25 linear feet</extent> <extent type="box">(1 oversize box)</extent>; <extent type="contents">52 letters<extent> written on oversized <dimensions type="width" unit="inches">9 in.</dimensions> x <dimensions type="height" unit="inches">12 in.</dimensions> paper.</extent> <physfacet type="writing">handwritten</physfacet> <physfacet type="writingstyle">cursive</physfact> </physdesc> <physloc label="Location" audience="external">Manuscripts</physloc> <physloc audience="internal">MS-511</physloc> <repository> <corpname>Official Name of Ruth's Repository</corpname> <subarea>Manuscript Division</subarea> <address> <addressline>Main building of Ruth's repository</addressline> <addressline>Archives</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </repository> <unitid countrycode="US" repositorycode="dgwl">sjb</unitid> <unittitle label="Title">Letters of Sarah J. Bell Kitchin</unittitle> </did> </archdesc> </ead> <ead> <eadheader> <eadid countrycode="us" mainagencycode="dgwl" url="http://www.eadiva.com/sample/">rkt-01</eadid> <filedesc> <titlestmt> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <sponsor>Encoding thanks to EADiva's donation of her spare time.</sponsor> </titlestmt> <editionstmt><edition>1st ed.</edition> <p>Didn't need to specify since it's first edition, but wanted to use the fields.</p> </editionstmt> <publicationstmt> <date>2012</date> <publisher>EADiva.com</publisher> <address> <addressline>1600 Pennsylvania Ave</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </publicationstmt> <seriesstmt><p>Bell Family Papers</p> </seriesstmt> <notestmt> <note> <p>The materials in this finding aid are based on an actual collection of Sarah J. Bell Kitchin's letters.</p> </note> <note> <p>This finding aid was created as a project for the EADiva.com website.</p> </note> </notestmt> </filedesc> <profiledesc> <creation>This finding aid was encoded by Ruth K. Tillman, on <date normal="20121118">November 18th, 2012</date>, using Notepad++. Material was generated off the top of her head.</creation> <descrules>This finding aid was prepared using Ruth's understanding of EAD and her use of the LOC EAD 2002 official website.</descrules> <langusage>This finding aid is written in <language langcode="eng">English</language>. </langusage> </profiledesc> <revisiondesc> <change> <date normal="20121204">December 4, 2012</date> <item>This finding aid was edited by Ruth Tillman in order to clarify contents in eadheader.</item> </change> </revisiondesc> </eadheader> <frontmatter> <div><head>Preface</head> <p>This inventory was prepared as part of the EADiva website to demonstrate EAD encoding of finding aids. It encodes information about the collection of the papers of Sarah Bell Kitchin as well as made-up information used to make the finding aid use more example elements. Like this one.</p></div> <titlepage> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <publisher>EADiva.com</publisher> </titlepage> </frontmatter> <archdesc level="collection"> <did><head>Overview</head> <abstract label="Abstract">Sarah J. Bell Kitchin, a Peace Corps Volunteer and professor of linguistics at the University of British Columbia. Her letters home from the Philippines (1967-1969) and Russia. Letters from members of the Bell family (1967-2000). </abstract> <langmaterial label="Language">Correspondence in <language langcode="eng">English</language>. </langmaterial> <physdesc label="Extent"><extent type="shelf" unit="feet">0.25 linear feet</extent> <extent type="box">(1 oversize box)</extent>; <extent type="contents">52 letters<extent> written on oversized <dimensions type="width" unit="inches">9 in.</dimensions> x <dimensions type="height" unit="inches">12 in.</dimensions> paper.</extent> <physfacet type="writing">handwritten</physfacet> <physfacet type="writingstyle">cursive</physfact> </physdesc> <physloc label="Location" audience="external">Manuscripts</physloc> <physloc audience="internal">MS-511</physloc> <repository> <corpname>Official Name of Ruth's Repository</corpname> <subarea>Manuscript Division</subarea> <address> <addressline>Main building of Ruth's repository</addressline> <addressline>Archives</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </repository> <unitid countrycode="US" repositorycode="dgwl">sjb</unitid> <unittitle label="Title">Letters of Sarah J. Bell Kitchin</unittitle> </did> </archdesc> </ead> EAD tag library entry for <unittitle>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-317 ---- <subject> Subject | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <subject> Subject <subject> encodes a topic associated with or covered by the described materials. When the subject is a person, corporation, or geographic region, <persname>, <corpname>, and <geogname> should be used, with their ROLE attribute set to “subject.” Not all subjects in the finding aid need to be tagged, but this element may be used to encode any for which more than keyword searching access should be available. It may be used within <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, and <unittitle>. Subjects with major representation in the materials should be listed within <controlaccess> even if the names are encoded elsewhere. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC fields 650 and 69x. NORMAL – not required. Can be used to provide the authority form if the subject is being used informally within narrative text, etc. RULES – not required. May be used to specify the descriptive rules followed when forming the subject. SOURCE – not required. The source of the controlled vocabulary, e.g. “lcsh” for Library of Congress Subject Headings. Subelements <subject> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. Examples <controlaccess> <head>Subjects</head> <persname source="local" role="subject">Kitchin, Sarah J. Bell</persname> <famname source="local" role="subject">Bell family.</famname> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> <controlaccess> <head>Subjects</head> <persname source="local" role="subject">Kitchin, Sarah J. Bell</persname> <famname source="local" role="subject">Bell family.</famname> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> EAD tag library entry for <subject>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-4800 ---- <dsc> Description of Subordinate Components | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <dsc> Description of Subordinate Components <dsc> is a wrapper element used to bundle information about hierarchical groupings of the described materials. The TYPE attribute is used to specify the forms of combind material, as outlined in Attributes below. <dsc> is one of the elements which may be used within <archdesc>, <archdescgrp>, <c>, <c01> through <c12>, and <descgrp>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. OTHERTYPE – not required. If “othertype” is used in the TYPE attribute below, set its value here. TPATTERN – not required. References one of a set of standard patterns to define specifications of HTML output tables. TYPE – required? (according to the LoC DTD information, this is not required, howeer they state in their text that it is required.) Restricted values for this attribute are: “analyticover,” “combined,” “in-depth,” and “othertype.” The value “analyticover” identifies an overview description of series and subseries, which might be followed by a second <dsc> with the attribute set to “in-depth” and providing a more detailed listing of the content of the materials. The TYPE attribute value “combined” is used when the description of a series is followed immediately by a listing of the contents of that series. If none of these apply, us the value “othertype” and use the OTHERTYPE attribute above to specify it. Subelements <dsc> may contain the following subelements: <address>, <blockquote>, <c>, <c01> (but not further levels), <chronlist>, <dsc>, <head>, <list>, <note>, <p>, <table>, and <thead>. Examples Examples both of “combined” and of “analyticover” and “in-depth” used sequentially. <dsc type="combined"> <c level="series"> <did> <unittitle>Reunions</unittitle> <unitdate normal="2000/2013">2000-2013</unitdate> <physdesc><extent>0.3 linear feet</extent></physdesc> </did> <scopecontent> <p>The reunions collection contains materials distributed to alumni, including <genreform>invitations</genreform>, <genreform>schedules</genreform>, and <genreform>programs</genreform>. Most materials are from <date normal="2002/2006">2002-2006</date>.</p> </scopecontent> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Opening Ceremonies</unittitle> <unitdate>2001-2007</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Activities</unittitle> <unitdate>2000-2013</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Dinners</unittitle> <unitdate>2003-2006</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Lectures</unittitle> <unitdate>2002-2006</unitdate> </did> </c> </c> </dsc> <dsc type="combined"> <c level="series"> <did> <unittitle>Reunions</unittitle> <unitdate normal="2000/2013">2000-2013</unitdate> <physdesc><extent>0.3 linear feet</extent></physdesc> </did> <scopecontent> <p>The reunions collection contains materials distributed to alumni, including <genreform>invitations</genreform>, <genreform>schedules</genreform>, and <genreform>programs</genreform>. Most materials are from <date normal="2002/2006">2002-2006</date>.</p> </scopecontent> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Opening Ceremonies</unittitle> <unitdate>2001-2007</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Activities</unittitle> <unitdate>2000-2013</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Dinners</unittitle> <unitdate>2003-2006</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Lectures</unittitle> <unitdate>2002-2006</unitdate> </did> </c> </c> </dsc> <dsc type="analyticover"> <c level="series"> <did> <unittitle>Reunions</unittitle> <unitdate normal="2000/2013">2000-2013</unitdate> <physdesc><extent>0.3 linear feet</extent></physdesc> </did> <scopecontent> <p>The reunions collection contains materials distributed to alumni, including <genreform>invitations</genreform>, <genreform>schedules</genreform>, and <genreform>programs</genreform>. Most materials are from <date normal="2002/2006">2002-2006</date>.</p> </scopecontent> </c> <c level="series"> <did> <unittitle>Graduation</unittitle> <unitdate normal="2000/2013">1995-2013</unitdate> <physdesc><extent>0.9 linear feet</extent></physdesc> </did> <scopecontent> <p>The graduations collection contains materials distributed at graduation, both to professors and students, including <genreform>invitations</genreform>, <genreform>schedules</genreform>, and <genreform>programs</genreform>. Most materials are from <date normal="2002/2006">2000-2006</date>.</p> </scopecontent> </c> </dsc> <dsc type="in-depth"> <c level="series"> <did> <unittitle>Series 1: Reunions</unittitle> <unitdate type="inclusive" normal="2000/2013">2000-2013</unitdate> </did> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Opening Ceremonies</unittitle> <unitdate>2001-2007</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Activities</unittitle> <unitdate>2000-2013</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Dinners</unittitle> <unitdate>2003-2006</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Lectures</unittitle> <unitdate>2002-2006</unitdate> </did> </c> </c> </dsc> <dsc type="analyticover"> <c level="series"> <did> <unittitle>Reunions</unittitle> <unitdate normal="2000/2013">2000-2013</unitdate> <physdesc><extent>0.3 linear feet</extent></physdesc> </did> <scopecontent> <p>The reunions collection contains materials distributed to alumni, including <genreform>invitations</genreform>, <genreform>schedules</genreform>, and <genreform>programs</genreform>. Most materials are from <date normal="2002/2006">2002-2006</date>.</p> </scopecontent> </c> <c level="series"> <did> <unittitle>Graduation</unittitle> <unitdate normal="2000/2013">1995-2013</unitdate> <physdesc><extent>0.9 linear feet</extent></physdesc> </did> <scopecontent> <p>The graduations collection contains materials distributed at graduation, both to professors and students, including <genreform>invitations</genreform>, <genreform>schedules</genreform>, and <genreform>programs</genreform>. Most materials are from <date normal="2002/2006">2000-2006</date>.</p> </scopecontent> </c> </dsc> <dsc type="in-depth"> <c level="series"> <did> <unittitle>Series 1: Reunions</unittitle> <unitdate type="inclusive" normal="2000/2013">2000-2013</unitdate> </did> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Opening Ceremonies</unittitle> <unitdate>2001-2007</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Activities</unittitle> <unitdate>2000-2013</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Dinners</unittitle> <unitdate>2003-2006</unitdate> </did> </c> <c level="file"> <did> <container label="Box" type="box">1</container> <unittitle>Lectures</unittitle> <unitdate>2002-2006</unitdate> </did> </c> </c> </dsc> EAD tag library entry for <dsc>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-5078 ---- <extent> Extent | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <extent> Extent <extent> is a subelement of <physdesc> used to encode information about the quantity of materials described or an expression of the physical space they occupy. It can include cubic or linear feet, counts of special formats (photographs, letters, etc.), volume of a data file, etc. It may be repeated with the UNIT or TYPE attributes being used to specify the difference between element instances. Note, this does not replace the <dimensions> element, which is used to specify the size of the actual materials. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. LABEL – not required. This can be used when a meaningful display label for an element can’t be derived by the stylesheet from its name. It is available in all <did> subelements. TYPE – not required. Any information which can clarify the type of extent measurement being given. UNIT – not required. Any unit of measurement, used to clarify which unit is being used to describe the materials’ extent–feet, meters, cubic meters, etc.. Subelements <extent> will likely contain PCDATA. It may include itself in a nested form. It may also include the following generic elements:<abbr>, <archref>, <bibref>, <emph>, <expan>, <extptr>, <extref>, <lb />, <linkgrp>, <ptr>, <ref>, and <title>. DACS See DACS Section 2.5, Extent. (DACS 2013, pp.28-30) Our EAD file so far I’ve used the TYPE attribute to distinguish three different kinds of <extent> in the file. These could be specified in a repository’s guidelines. <ead> <eadheader> <eadid countrycode="us" mainagencycode="dgwl" url="http://www.eadiva.com/sample/">rkt-01</eadid> <filedesc> <titlestmt> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <sponsor>Encoding thanks to EADiva's donation of her spare time.</sponsor> </titlestmt> <editionstmt><edition>1st ed.</edition> <p>Didn't need to specify since it's first edition, but wanted to use the fields.</p> </editionstmt> <publicationstmt> <date>2012</date> <publisher>EADiva.com</publisher> <address> <addressline>1600 Pennsylvania Ave</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </publicationstmt> <seriesstmt><p>Bell Family Papers</p> </seriesstmt> <notestmt> <note> <p>The materials in this finding aid are based on an actual collection of Sarah J. Bell Kitchin's letters.</p> </note> <note> <p>This finding aid was created as a project for the EADiva.com website.</p> </note> </notestmt> </filedesc> <profiledesc> <creation>This finding aid was encoded by Ruth K. Tillman, on <date normal="20121118">November 18th, 2012</date>, using Notepad++. Material was generated off the top of her head.</creation> <langusage>This finding aid is written in <language langcode="eng">English</language>. </langusage> <descrules>This finding aid was prepared using Ruth's understanding of EAD and her use of the LOC EAD 2002 official website.</descrules> </profiledesc> <revisiondesc> <change> <date normal="20121204">December 4, 2012</date> <item>This finding aid was edited by Ruth Tillman in order to clarify contents in eadheader.</item> </change> </revisiondesc> </eadheader> <frontmatter> <div><head>Preface</head> <p>This inventory was prepared as part of the EADiva website to demonstrate EAD encoding of finding aids. It encodes information about the collection of the papers of Sarah Bell Kitchin as well as made-up information used to make the finding aid use more example elements. Like this one.</p></div> <titlepage> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <publisher>EADiva.com</publisher> </titlepage> </frontmatter> <archdesc level="collection"> <did><head>Overview</head> <abstract label="Abstract">Sarah J. Bell Kitchin, a Peace Corps Volunteer and professor of linguistics at the University of British Columbia. Her letters home from the Philippines (1967-1969) and Russia. Letters from members of the Bell family (1967-2000). </abstract> <langmaterial label="Language">Correspondence in <language langcode="eng">English</language>. </langmaterial> <physdesc label="Extent"><extent type="shelf" unit="feet">0.25 linear feet</extent> <extent type="box">(1 oversize box)</extent>; <extent type="contents">52 letters<extent> written on oversized <dimensions type="width" unit="inches">9 in.</dimensions> x <dimensions type="width" unit="inches">12 in.</dimensions> paper.</physdesc> </did> </archdesc> </ead> <ead> <eadheader> <eadid countrycode="us" mainagencycode="dgwl" url="http://www.eadiva.com/sample/">rkt-01</eadid> <filedesc> <titlestmt> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <sponsor>Encoding thanks to EADiva's donation of her spare time.</sponsor> </titlestmt> <editionstmt><edition>1st ed.</edition> <p>Didn't need to specify since it's first edition, but wanted to use the fields.</p> </editionstmt> <publicationstmt> <date>2012</date> <publisher>EADiva.com</publisher> <address> <addressline>1600 Pennsylvania Ave</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </publicationstmt> <seriesstmt><p>Bell Family Papers</p> </seriesstmt> <notestmt> <note> <p>The materials in this finding aid are based on an actual collection of Sarah J. Bell Kitchin's letters.</p> </note> <note> <p>This finding aid was created as a project for the EADiva.com website.</p> </note> </notestmt> </filedesc> <profiledesc> <creation>This finding aid was encoded by Ruth K. Tillman, on <date normal="20121118">November 18th, 2012</date>, using Notepad++. Material was generated off the top of her head.</creation> <langusage>This finding aid is written in <language langcode="eng">English</language>. </langusage> <descrules>This finding aid was prepared using Ruth's understanding of EAD and her use of the LOC EAD 2002 official website.</descrules> </profiledesc> <revisiondesc> <change> <date normal="20121204">December 4, 2012</date> <item>This finding aid was edited by Ruth Tillman in order to clarify contents in eadheader.</item> </change> </revisiondesc> </eadheader> <frontmatter> <div><head>Preface</head> <p>This inventory was prepared as part of the EADiva website to demonstrate EAD encoding of finding aids. It encodes information about the collection of the papers of Sarah Bell Kitchin as well as made-up information used to make the finding aid use more example elements. Like this one.</p></div> <titlepage> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <publisher>EADiva.com</publisher> </titlepage> </frontmatter> <archdesc level="collection"> <did><head>Overview</head> <abstract label="Abstract">Sarah J. Bell Kitchin, a Peace Corps Volunteer and professor of linguistics at the University of British Columbia. Her letters home from the Philippines (1967-1969) and Russia. Letters from members of the Bell family (1967-2000). </abstract> <langmaterial label="Language">Correspondence in <language langcode="eng">English</language>. </langmaterial> <physdesc label="Extent"><extent type="shelf" unit="feet">0.25 linear feet</extent> <extent type="box">(1 oversize box)</extent>; <extent type="contents">52 letters<extent> written on oversized <dimensions type="width" unit="inches">9 in.</dimensions> x <dimensions type="width" unit="inches">12 in.</dimensions> paper.</physdesc> </did> </archdesc> </ead> EAD tag library entry for <extent>. This is the EAD 2002 version of this element. This element was deprecated in EAD3. Information on which elements to use in its place can be found on its the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-6889 ---- <controlaccess> Controlled Access Headings | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <controlaccess> Controlled Access Headings <controlaccess> is a wrapper element used to designate key access points for descibed materials. It enables authority-controlled searching across finding aids on a network. It may be used at multiple levels within a finding aid. Higher-level <controlaccess> elements should encode access points which are relevant to larger portions of the collection, whereas lower-level ones may specify access points which only apply to a file or item. <controlaccess> is one of the elements which may be used within <archdesc>, <archdescgrp>, <c>, <c01> through <c12>, and <descgrp>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. Subelements <controlaccess> may contain further <controlaccess> elements, as well as <address>, <blockquote>, <chronlist>, <corpname>, <famname>, <function>, <genreform>, <geogname>, <head>, <list>, <name>, <note>, <occupation>, <p>, <persname>, <subject>, <table>, and <title>. Note, since PCDATA is not used within this element, it serves as a wrapper, at least of a <p> element containing the actual text. Although names and terms from locally-controlled vocabularies are permissible, the <controlaccess> subelements (<corpname>, <famname>, <function>, <genreform>, <geogname>, <occupation>, <persname>, <subject>, and <title>) should come from national or international vocabularies whenever they are available to enable searches in information systems that include multiple finding aids, or finding aids and bibliographic records from many institutions. The subelements mentioned in the previous paragraph all have SOURCE attributes, which should be used to specify the source of the heading (such as source=”lcsh”). Their RULES element may be used to specify the descreptive rules which were used to formulate the heading (such as rules=”AACR2″). The attribute AUTHFILENUMBER may be used to identify the authority file record which provides additional information about the access term. If using AUTHFILENUMBER, SOURCE should also be used. ROLE may be used to specify the heading’s role in the collection—creator, subject, etc. Examples An example of how <controlaccess> may be used: <controlaccess> <head>Personal, Corporate, and Subject Headings</head> <controlaccess> <head>Persons</head> <persname source="local">Bell, Sarah J.</persname> </controlaccess> <controlaccess> <head>Corporate Bodies</head> <corpname source="lcnaf">Central Mindanao University</corpname> <corpname source="lcnaf">Literacy Volunteers of America</corpname> <corpname source="lcnaf">Massachusetts Institute of Technology</corpname> <corpname source="lcnaf">Peace Corps (U.S.)</corpname> <corpname source="lcnaf">St. John's College (Annapolis, MD)</corpname> <corpname source="local">Towle Institute</corpname> <corpname source="lcnaf">University of British Columbia</corpname> </controlaccess> <controlaccess> <head>Subjects</head> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> </controlaccess> <controlaccess> <head>Personal, Corporate, and Subject Headings</head> <controlaccess> <head>Persons</head> <persname source="local">Bell, Sarah J.</persname> </controlaccess> <controlaccess> <head>Corporate Bodies</head> <corpname source="lcnaf">Central Mindanao University</corpname> <corpname source="lcnaf">Literacy Volunteers of America</corpname> <corpname source="lcnaf">Massachusetts Institute of Technology</corpname> <corpname source="lcnaf">Peace Corps (U.S.)</corpname> <corpname source="lcnaf">St. John's College (Annapolis, MD)</corpname> <corpname source="local">Towle Institute</corpname> <corpname source="lcnaf">University of British Columbia</corpname> </controlaccess> <controlaccess> <head>Subjects</head> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> </controlaccess> EAD tag library entry for <controlaccess>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-729 ---- <geogname> Geographic Name | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <geogname> Geographic Name <geogname> is the proper noun designation for a place, natural feature, or political jurisdiction. Not all places need to be tagged, but those for which greater retrieval should be provided may be tagged. The element may be used to tag any function during a paragraph, with the NORMAL attribute supplying the proper form of the term. Geographic names which feature significantly in the material should be listed within <controlaccess> even if they are indicated elsewhere. <geogname> may be used within <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, and <unittitle>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC fields 651 or 752. NORMAL – not required. Can be used to provide the authority form if the name is being used informally within narrative text, etc. ROLE – not required. May be used to designate the role which the name played in the collection, e.g. “subject.” RULES – not required. May be used to specify the descriptive rules followed when forming the name. SOURCE – not required. The source of the controlled vocabulary, e.g. “lcsh” for Library of Congress Subject Headings. Subelements <geogname> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. Examples <bioghist> ... <p>... During this period, she lived in several locations in <geogname normal="Mindanao Island (Philippines)" source="lcsh">Mindanao</geogname> and taught at the <corpname source="lcsh">Central Mindanao University</corpname>.</p> <bioghist> <bioghist> ... <p>... During this period, she lived in several locations in <geogname normal="Mindanao Island (Philippines)" source="lcsh">Mindanao</geogname> and taught at the <corpname source="lcsh">Central Mindanao University</corpname>.</p> <bioghist> <controlaccess> <head>Subjects:</head> <corpname source="lcsh">Central Mindanao University</corpname> <geogname source="lcsh">Mindanao Island (Philippines)</geogname> <corpname source="lcsh">Peace Corps (U.S.)</corpname> </controlaccess> <controlaccess> <head>Subjects:</head> <corpname source="lcsh">Central Mindanao University</corpname> <geogname source="lcsh">Mindanao Island (Philippines)</geogname> <corpname source="lcsh">Peace Corps (U.S.)</corpname> </controlaccess> EAD tag library entry for <geogname>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-7832 ---- <abstract> Abstract | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <abstract> Abstract A very brief summary of the materials being described, used primarily to encode bits of biographical or historical information about the creator and abridged statements about the scope, content, arrangement, or other descriptive details about the archival unit or one of its components. It may be extracted from other fields, such as <bioghist> and <scopecontent>. Within a <c> <did>, it indicates information specific to that component. It may occur within <did> or <archref>. For the purposes of this outline, we’ll be showing it inside <did>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. LABEL – not required. This can be used when a meaningful display label for an element can’t be derived by the stylesheet from its name. It is available in all <did> subelements. LANGCODE – not required. The three-letter code for the language in which the abstract is written. It should come from ISO639-2b. TYPE – not required. This attribute may be used within a number of elements. Its characteristics depend on the element to which it applies. There is no list of specific values for TYPE within <abstract>, but it may be used for encoding information. Subelements <abstract> will contain PCDATA itself and may contain the following generic elements: <abbr>, <archref>, <bibref>, <emph>, <expan>, <lb />, <linkgrp>, <ptr>, <ref>, and <title>. Our EAD file so far Let’s put in a basic abstract and not forget the LABEL attribute: <ead> <eadheader> <eadid countrycode="us" mainagencycode="dgwl" url="http://www.eadiva.com/sample/">rkt-01</eadid> <filedesc> <titlestmt> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <sponsor>Encoding thanks to EADiva's donation of her spare time.</sponsor> </titlestmt> <editionstmt><edition>1st ed.</edition> <p>Didn't need to specify since it's first edition, but wanted to use the fields.</p> </editionstmt> <publicationstmt> <date>2012</date> <publisher>EADiva.com</publisher> <address> <addressline>1600 Pennsylvania Ave</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </publicationstmt> <seriesstmt><p>Bell Family Papers</p> </seriesstmt> <notestmt> <note> <p>The materials in this finding aid are based on an actual collection of Sarah J. Bell Kitchin's letters.</p> </note> <note> <p>This finding aid was created as a project for the EADiva.com website.</p> </note> </notestmt> </filedesc> <profiledesc> <creation>This finding aid was encoded by Ruth K. Tillman, on <date normal="20121118">November 18th, 2012</date>, using Notepad++. Material was generated off the top of her head.</creation> <langusage>This finding aid is written in <language langcode="eng">English</language>. </langusage> <descrules>This finding aid was prepared using Ruth's understanding of EAD and her use of the LOC EAD 2002 official website.</descrules> </profiledesc> <revisiondesc> <change> <date normal="20121204">December 4, 2012</date> <item>This finding aid was edited by Ruth Tillman in order to clarify contents in eadheader.</item> </change> </revisiondesc> </eadheader> <frontmatter> <div><head>Preface</head> <p>This inventory was prepared as part of the EADiva website to demonstrate EAD encoding of finding aids. It encodes information about the collection of the papers of Sarah Bell Kitchin as well as made-up information used to make the finding aid use more example elements. Like this one.</p></div> <titlepage> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <publisher>EADiva.com</publisher> </titlepage> </frontmatter> <archdesc level="collection"> <did><head>Overview</head> <abstract label="Abstract">Sarah J. Bell Kitchin, a Peace Corps Volunteer and professor of linguistics at the University of British Columbia. Her letters home from the Philippines (1967-1969) and Russia. Letters from members of the Bell family (1967-2000). </abstract> </did> </archdesc> </ead> <ead> <eadheader> <eadid countrycode="us" mainagencycode="dgwl" url="http://www.eadiva.com/sample/">rkt-01</eadid> <filedesc> <titlestmt> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <sponsor>Encoding thanks to EADiva's donation of her spare time.</sponsor> </titlestmt> <editionstmt><edition>1st ed.</edition> <p>Didn't need to specify since it's first edition, but wanted to use the fields.</p> </editionstmt> <publicationstmt> <date>2012</date> <publisher>EADiva.com</publisher> <address> <addressline>1600 Pennsylvania Ave</addressline> <addressline>Washington, DC, 20001</addressline> <addressline>Phone: 202-555-1234</addressline> </address> </publicationstmt> <seriesstmt><p>Bell Family Papers</p> </seriesstmt> <notestmt> <note> <p>The materials in this finding aid are based on an actual collection of Sarah J. Bell Kitchin's letters.</p> </note> <note> <p>This finding aid was created as a project for the EADiva.com website.</p> </note> </notestmt> </filedesc> <profiledesc> <creation>This finding aid was encoded by Ruth K. Tillman, on <date normal="20121118">November 18th, 2012</date>, using Notepad++. Material was generated off the top of her head.</creation> <langusage>This finding aid is written in <language langcode="eng">English</language>. </langusage> <descrules>This finding aid was prepared using Ruth's understanding of EAD and her use of the LOC EAD 2002 official website.</descrules> </profiledesc> <revisiondesc> <change> <date normal="20121204">December 4, 2012</date> <item>This finding aid was edited by Ruth Tillman in order to clarify contents in eadheader.</item> </change> </revisiondesc> </eadheader> <frontmatter> <div><head>Preface</head> <p>This inventory was prepared as part of the EADiva website to demonstrate EAD encoding of finding aids. It encodes information about the collection of the papers of Sarah Bell Kitchin as well as made-up information used to make the finding aid use more example elements. Like this one.</p></div> <titlepage> <titleproper>Inventory of Something Useful for Learning EAD <date>2012-2013</date></titleproper> <subtitle>A totally awesome finding aid with a subtitle too</subtitle> <author>Ruth K. Tillman, the EADiva</author> <publisher>EADiva.com</publisher> </titlepage> </frontmatter> <archdesc level="collection"> <did><head>Overview</head> <abstract label="Abstract">Sarah J. Bell Kitchin, a Peace Corps Volunteer and professor of linguistics at the University of British Columbia. Her letters home from the Philippines (1967-1969) and Russia. Letters from members of the Bell family (1967-2000). </abstract> </did> </archdesc> </ead> EAD tag library entry for <abstract>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-8564 ---- <unitdate> Date of a Unit | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <unitdate> Date of a Unit <unitdate> is used to encode the creation year, month, or day of the described materials. It may in the form of text or numbers and either a simple date or range. It is found within <did> and its subelements and is only used to encode creation or relevant dates of described materials. Other types of dates should be encoded within <date>. It is comparable to ISAD(G) element 3.1.3, and MARC fields 245 subfield f for inclusive dates, 245 subfield g for bulk dates, or 260 subfield c. <unitdate> may be used within <archref>, <did>, <entry>, <event>, <extref>, <extrefloc>, <item>, <label>, <p>, <ref>, <refloc>, <unittitle>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. CALENDAR – not required. Default value is “gregorian.” CERTAINTY – not required. May be used to indicate degree of precision used in dating—”circa,” “approximately,” “after,” etc. DATECHAR – not required. May be used to characterize the nature of the dates, such as “creation” or “modification.” ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. ERA – not required. May be used to indicate the era in which the date falls. Default values is “ce” for “Common” or “Christian” era. LABEL – not required. This can be used when a meaningful display label for an element can’t be derived by the stylesheet from its name. It is available in all <did> subelements. NORMAL – not required. A standard numeric form of the date used for machine reading and comparison, i.e. YYYYMMDD, YYYY/YYYY, etc. Should particularly be used if the text within the element is not written out as YYYMMDD. TYPE – not required. May be used to specify whether the date is “bulk” or “inclusive.” Subelements <unitdate> may contain PCDATA, <abbr>, <archref> <bibref>, <emph>, <extptr>, <extref>, <lb />, <linkgrp>, <ptr>, <ref>, and <title>. DACS Use DACS Section 2.4, Date. Required. (DACS 2013, pp.24-27) Examples <did> <head>Overview</head> ... <unittitle label="Title">Letters of Sarah J. Bell Kitchin <unitdate normal="1963/1985">1963 to 1985</unitdate></unittitle> </did> <did> <head>Overview</head> ... <unittitle label="Title">Letters of Sarah J. Bell Kitchin <unitdate normal="1963/1985">1963 to 1985</unitdate></unittitle> </did> <c level="series"> <did> <unitid>SJB1</unitid> <unittitle>Correspondence</unittitle> <unitdate normal="1963/1985" datechar="creation" type="inclusive">1963 to 1985</unitdate> </did> <c level="series"> <did> <unitid>SJB1</unitid> <unittitle>Correspondence</unittitle> <unitdate normal="1963/1985" datechar="creation" type="inclusive">1963 to 1985</unitdate> </did> EAD tag library entry for <unitdate>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-876 ---- <famname> Family Name | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <famname> Family Name <famname> encodes the proper noun designated by a group of persons closely related by blood or forming a household. This could be a single family unit, or an extended family. Not all family names in the finding aid need to be tagged, but this element may be used to encode any for which more than keyword searching access should be available. It may be used within <bibref>, <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <origination>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, <repository>, and <unittitle>. Families with major representation in the materials should be listed within <controlaccess> even if they are indicated elsewhere. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC fields 100, 600, 700. NORMAL – not required. Can be used to provide the authority form if the name is being used informally within narrative text, etc. ROLE – not required. May be used to designate the role which the family played in the collection, e.g. “compiler,” “creator,” “subject,” etc. RULES – not required. May be used to specify the descriptive rules followed when forming the name. SOURCE – not required. The source of the controlled vocabulary, e.g. “lcsh” for Library of Congress Subject Headings. Subelements <famname> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. Examples <controlaccess> <head>Subjects</head> <persname source="local">Kitchin, Sarah J. Bell</persname> <famname source="local">Bell family.</famname> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> <controlaccess> <head>Subjects</head> <persname source="local">Kitchin, Sarah J. Bell</persname> <famname source="local">Bell family.</famname> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> <bioghist> ... <p>Following the death of <persname normal="Bell, Arthur">Arthur Bell</persname>, the <famname normal="Bell family">family</famname> moved to Hillsboro, Ohio. ...</p> </bioghist> <bioghist> ... <p>Following the death of <persname normal="Bell, Arthur">Arthur Bell</persname>, the <famname normal="Bell family">family</famname> moved to Hillsboro, Ohio. ...</p> </bioghist> EAD tag library entry for <famname>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-8938 ---- <scopecontent> Scope and Content | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <scopecontent> Scope and Content <scopecontent> is a wrapper element used to contain a prose summary of the range and topical coverage of the described materials in order to assist researchers in evaluating the relevance of the materials. It can cover form and arrangement, important names, events, places, and subjects. If there are significant gaps in the materials or strengths which may be useful to researchers, these should also be noted. The element may be nested to contain <scopecontent> notes for particular segments of the collection. This element is comparable to ISAD(G) data element 3.3.1 and MARC field 520. <scopecontent> is one of the elements which may be used within <archdesc>, <archdescgrp>, <c>, <c01> through <c12>, and <descgrp>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. ENCODINGANALOG – not required. May contain information to map this tag to a particular element in another schema. Subelements <scopecontent> may contain further <scopecontent> elements, as well as: <address>, <arrangement>, <blockquote>, <chronlist>, <dao>, <daogrp>, <head>, <list>, <note>, <p>, and <table>. DACS See DACS Section 3.1, Scope and content. Required. (DACS 2013, pp.45-48) Examples <scopecontent encodinganalog="520"> <head>Description of the Collection</head> <p>Letters from Sarah J. Bell Kitchin, 1960s-1990s. Mainly letters to her family members, written from her Peace Corps deployment in the Philippines from <date type="inclusive">1967-1969</date>. Topics include living situation of Peace Corps volunteers, teaching strategies, and local cultural events. Later letters are generally written inside Christmas cards.</p> </scopecontent> <scopecontent encodinganalog="520"> <head>Description of the Collection</head> <p>Letters from Sarah J. Bell Kitchin, 1960s-1990s. Mainly letters to her family members, written from her Peace Corps deployment in the Philippines from <date type="inclusive">1967-1969</date>. Topics include living situation of Peace Corps volunteers, teaching strategies, and local cultural events. Later letters are generally written inside Christmas cards.</p> </scopecontent> <scopecontent encodinganalog="520"> <head>Scope and Content</head> <p>Reports of measurements of air pollutants taken throughout Ann Arundel county, Maryland. Each report contains the date, parts per million of type of pollutant detected, variation from the previous reading as numbers and percentage, and the initials of the surveyer who collected the data from the station. Pollutants measured are carbon monoxide (CO), lead (Pb), nitrogen dioxide (NO2), ozone (O3), particulate matter (PM), and sulfur dioxide (SO2). </p> </scopecontent> <scopecontent encodinganalog="520"> <head>Scope and Content</head> <p>Reports of measurements of air pollutants taken throughout Ann Arundel county, Maryland. Each report contains the date, parts per million of type of pollutant detected, variation from the previous reading as numbers and percentage, and the initials of the surveyer who collected the data from the station. Pollutants measured are carbon monoxide (CO), lead (Pb), nitrogen dioxide (NO2), ozone (O3), particulate matter (PM), and sulfur dioxide (SO2). </p> </scopecontent> EAD tag library entry for <scopecontent>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-8996 ---- <famname> Family Name | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <famname> Family Name <famname> encodes the proper noun designated by a group of persons closely related by blood or forming a household. This could be a single family unit, or an extended family. Not all family names in the finding aid need to be tagged, but this element may be used to encode any for which more than keyword searching access should be available. It may be used within <bibref>, <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <origination>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, <repository>, and <unittitle>. Families with major representation in the materials should be listed within <controlaccess> even if they are indicated elsewhere. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC fields 100, 600, 700. NORMAL – not required. Can be used to provide the authority form if the name is being used informally within narrative text, etc. ROLE – not required. May be used to designate the role which the family played in the collection, e.g. “compiler,” “creator,” “subject,” etc. RULES – not required. May be used to specify the descriptive rules followed when forming the name. SOURCE – not required. The source of the controlled vocabulary, e.g. “lcsh” for Library of Congress Subject Headings. Subelements <famname> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. Examples <controlaccess> <head>Subjects</head> <persname source="local">Kitchin, Sarah J. Bell</persname> <famname source="local">Bell family.</famname> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> <controlaccess> <head>Subjects</head> <persname source="local">Kitchin, Sarah J. Bell</persname> <famname source="local">Bell family.</famname> <subject source="lcnaf">Peace Corps (U.S.)</subject> <subject source="lcnaf">Peace Corps (U.S.)--Philippines</subject> </controlaccess> <bioghist> ... <p>Following the death of <persname normal="Bell, Arthur">Arthur Bell</persname>, the <famname normal="Bell family">family</famname> moved to Hillsboro, Ohio. ...</p> </bioghist> <bioghist> ... <p>Following the death of <persname normal="Bell, Arthur">Arthur Bell</persname>, the <famname normal="Bell family">family</famname> moved to Hillsboro, Ohio. ...</p> </bioghist> EAD tag library entry for <famname>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
eadiva-com-9020 ---- <genreform> Genre/Physical Characteristic | EADiva Toggle navigation About Blog Me Contact List of Elements Alphabetical List of Elements Sample EAD Files Submit A Plain-Talking EAD Tag Library Home About List of Elements Alphabetical Element List Sample EAD Files Blog Me Contact <genreform> Genre/Physical Characteristic <genreform> is a term used to identify the types of materials being described based on their intellectual content, order of information, or object function. Examples may be anything from account books to videotapes. Not all genres/forms need to be tagged, but those for which greater retrieval should be provided may be tagged. The element may be used to tag any function during a paragraph, with the NORMAL attribute supplying the proper form of the term. Genres/forms which make up large amounts of the material should be listed within <controlaccess> even if they are indicated elsewhere. <genreform> may be used in <physdesc> or <physfacet> along with more detailed characteristics. <genreform> may be used within <controlaccess>, <entry>, <event>, <extref>, <extrefloc>, <indexentry>, <item>, <label>, <namegrp>, <p>, <physdesc>, <physfacet>, <ref>, <refloc>, and <unittitle>. Attributes ALTRENDER – not required. Use if the content of the element should be displayed or printed differently than the rendering established in a style sheet for other occurrences of the element. AUDIENCE – not required. Use to set whether the element’s contents will be visible to external users or to internal ones. Possible values are: “internal” and “external.” ID – not required. Creates an ID for element. Can be used for linking. AUTHFILENUMBER – not required. A number that identifies the authority file record for an access term drawn from that authority file (the source for this number/the access term should be in SOURCE). ENCODINGANALOG – not required. May contain information to map this tag to MARC field 655 or 300 (when used with <extent>. NORMAL – not required. Can be used to provide the authority form if the word is being used informally within narrative text>, <etc. RULES – not required. May be used to specify the descriptive rules followed when forming the term. SOURCE – not required. The source of the controlled vocabulary>, <e.g. “lcsh” for Library of Congress Subject Headings. Subelements <genreform> may contain PCDATA, <emph>, <extptr>, <lb />, and <ptr>. DACS See DACS Section 2.5, Extent. (DACS 2013, pp.28-30) Examples <scopecontent> <head>Scope and Content of the Collection</head> <p>The collection primarily consists of <genreform>letters</genreform> but also contains a 5-year <genreform normal="diaries">diary</genreform>, which was kept from <date normal="1968/1972">1968 to 1972</date>.</p> </scopecontent> <scopecontent> <head>Scope and Content of the Collection</head> <p>The collection primarily consists of <genreform>letters</genreform> but also contains a 5-year <genreform normal="diaries">diary</genreform>, which was kept from <date normal="1968/1972">1968 to 1972</date>.</p> </scopecontent> EAD tag library entry for <genreform>. This is the EAD 2002 version of this element. If you are looking for the EAD3 element page, please visit the current EADiva.com element page. Search Using the Site Official Library of Congress EAD Links EAD Official Site Introduction to Attributes General Attributes Tabular Attributes Linking Attributes EAD Crosswalks EAD Examples Resources Describing Archives: A Content Standard, Second Edition EAC-CPF Tag Library EAD 2002 Best Practices (LoC) OhioLINK EAD Taskforce pages US Institution Codes List of LANGCODE values Software Archivists’ Toolkit Installing Archivists’ Toolkit on your computer Archon ArchivesSpace The EADiva EAD 2002 Tag Library was created by Ruth Kitchin Tillman. The EAD 2002 Tag Library is copyright © The Society of American Archivists, 2002. Used with permission of the Society of American Archivists. Original design by 801red. Site recoded and redesigned by Ruth Tillman.
ejournals-bc-edu-6281 ---- Information Technology and Libraries Skip to main content Skip to main navigation menu Skip to site footer Current Archives Announcements About About the Journal Editorial Team Submissions Contact Privacy Statement Search Search Register Login Current Issue Vol 40 No 2 (2021) Published: 2021-06-21 Editorials Improving ITAL's Peer Review Letter from the Editor Kenneth J. Varnum PDF Making Room for Change through Rest Margaret Heller PDF Do Space’s Virtual Interview Lab Using Simple Technology to Serve the Public in a Time of Crisis Michael P. Sauers PDF Service Barometers Using Lending Kiosks to Locate Patrons Will Yarbrough PDF Articles The Impact of COVID-19 on the Use of Academic Library Resources Ruth Sara Connell, Lisa C. Wallis, David Comeaux PDF Emergency Remote Library Instruction and Tech Tools A Matter of Equity During a Pandemic Kathia Ibacache, Amanda Rybin, Eric Vance PDF Off-campus Access to Licensed Online Resources through Shibboleth Dr. Francis Jayakanth, Dr. Anand T. Byrappa, Mr. Raja Visvanathan PDF A Framework for Measuring Relevancy in Discovery Environments Blake L. Galbreath, Alex Merrill, Corey M. Johnson PDF Beyond VIAF Wikidata as a Complementary Tool for Authority Control in Libraries Carlo Bianchini, Stefano Bargioni, Camillo Carlo Pellizzari di San Girolamo PDF Algorithmic Literacy and the Role for Libraries Michael Ridley, Danica Pawlick-Potts PDF Persistent URLs and Citations Offered for Digital Objects by Digital Libraries Nicholas Homenda PDF View All Issues Open Journal Systems Information For Readers For Authors For Librarians Current Issue
ejournals-bc-edu-8024 ---- None
eleanoryoumans-blogspot-com-1570 ---- Eleanor Youmans: Synopses and Cover Art Eleanor Youmans Ohio author Eleanor Youmans published a dozen children's novels with Bobbs-Merrill in the 1920s, 30s, and 40s. She also wrote short stories and poetry. This blog is dedicated to preserving her life and work. Pages Home Biography Articles Synopses and Cover Art Book Reviews and Display Ads Synopses and Cover Art Novels Skitter Cat. Indianapolis: Bobbs-Merrill, 1925. 127 pages. Illustrated by Ruth Bennett; Dedicated to W.C.Y. [William Clinton Youmans, her son]. Skitter Cat is the story of a white Persian kitten who comes to live with Mother, Father, and Little Boy—and their Airedale, Major. The story takes place in a small town in Ohio. Skitter gets his name from the sound his claws make skittering across the floor, like a dry leaf. His birthday is 11 March 1914, and the story takes place over the course of the first year of his life. He is a feisty kitten who likes to go after the neighbor’s chickens. In the fall, Mother sends Skitter to live with a friend for a few weeks, until it is too cold for the neighbor to have chickens outside any longer. Skitter, however, escapes from the car taking him to the city, and lives outside for five months. His adventures include encounters with a fox, raccoon, opossum, owl, and skunk, and he survives by sleeping in a hollowed out tree and catching mice, rabbits, and peasants. He also spends a brief time at the city dump, where he is sighted. Father builds a trap and they capture Skitter and bring him home, where he’s older and more dignified now than he had been during his younger, kitten days. Skitter Cat and Little Boy. Indianapolis: Bobbs-Merrill, 1926. 149 pages. Illustrated by Ruth Bennett; Dedicated to My Dear Son William Clinton Youmans. Late in the summer, Father receives an invitation to spend a month camping with a cousin who is spending the summer in the Rocky Mountains. Father, Mother, and Little Boy decide to go, taking Skitter Cat with them, and leaving Major to stay with Aunt Maud. The family travels by train through Chicago to the Rockies. Once at the encampment, there’s much to do, from trout fishing and shooting a popgun at gophers, to visiting waterfalls and going horseback riding. There are also plentiful huckleberries, to later be made into pies and jams. The family visits a trapper, Tim Nolan, and his wife. The Nolan’s Airedales attack a porcupine, and the family must pull out the painful quills from the tender mouths and noses of the dogs. After Skitter has many exciting encounters—with a Mountain Rat, a coyote, and even a couple of bears—the family returns home to a very happy Major, who has missed them. The neighborhood children have newfound respect for Skitter when they learn of his adventures with the bears. Skitter Cat and Major. Indianapolis: Bobbs-Merrill, 1927. 154 pages. Illustrated by Ruth Bennett; Dedicated to William. Skitter and Skeet. Indianapolis: Bobbs-Merrill, 1928. 140 pages. Illustrated by Ruth Bennett; Dedicated to Willem and Helen [Her son and his wife]. Teddy Horse: The Story of a Runaway Pony. Indianapolis: Bobbs-Merrill, 1930. 137 pages. Illustrated by Ruth King; Dedicated to Herbert B. Haskins. Teddy Horse opens with the birth of a tiny Shetland pony, so-named Teddy Horse because his brown coat resembles the teddy bear that once belonged to his owner’s son Bill. Teddy Horse is not to stay for long with his mother Susie, their human family, or the other pets on the farm, however; once his sleek black coat grows in, he is to be trained as a show pony on the farm next door. Even so, his new home is anything but lonely, as Teddy Horse can still see his mother Susie, Bill and all his friends, Nippy the bull terrier, and Buffin the brown tabby cat. His trainer is friendly, patient, and encourages children to praise Teddy Horse with applause and sweets. The pony show—which includes performances by calico pony Spot, brown mule Dynamite, tiny monkey Jimmy, and white collie Snow—goes on circuit tour, leisurely making its way south, then west. On the plains, Teddy Horse is accidentally thrown from a truck, where he learns to fend for himself for several months. He escapes a pack of coyotes, joins a herd of wild Mustangs, befriends a wayward Buckskin mare and her colt, and finally makes his way to his home town when he, the Buckskin, and the Mustangs are rounded up cowboys and sold to a polo horse breeder in the east. Mistaken only momentarily for a colt, the tiny Shetland is of little use to the breeder, and is hardly missed when he makes an unlikely escape by applying his learned pony show antics to make his way toward a familiar looking barn. Buffin and Nippy are the first to greet their long lost companion, followed by a very shocked Bill and his father. It seems that Teddy Horse traveled over a thousand miles to make it back home. His coat, mane, and tail are promptly groomed, and Teddy Horse happily resumes his role in the pony show, safe and sound. Teddy Horse: The Story of a Runaway Pony. London: Elkin Mathews and Marrot, 1931. 114 pages. Illustrated by Ruth King; Dedicated to Herbert B. Haskins. The London-based Elkin Mathews and Marrot edition of Teddy Horse is virtually identical to its American, Bobbs-Merrill predecessor except for smaller font and page sizes, resulting in differences in pagination and text placement, and—more significantly—choice of vernacular. Youmans told the Newark Advocate that “When ‘Teddy Horse’ went on British book shelves….The editors did some blue pencilling and changed certain words, which they referred to as ‘Americanisms.’ Examples of the editing: ‘Sure’ to ‘certainly,’ ‘curb’ to ‘kerb,’ ‘burned gasoline’ to ‘petrol fumes,’ ‘gee, he’s cute,’ to ‘isn’t he topping?’ ‘cunning little colt,’ to ‘jolly little colt.’” Cinder: The Tale of a Black and Tan Toy Terrier. Indianapolis: Bobbs-Merrill, 1933. 132 pages. Illustrated by F. Bernard Shields; Dedicated to Richard A. Youmans [Her grandson]. Cinder is a black and tan toy terrier pup, noted for her white spots on one toe of each foot. Living with her playwright owner, Mr. George, she has many adventures, including a ride down a flooded river, a bout with a mud turtle, and even a role in a stage play. Cinder runs off a few times at the beginning of the story, during which time she is cared for by a little girl named Natalie, and she often wanders into the yard next door belonging to another young girl, Ida, and her black cat, Inky, before returning home to Mr. George and Cinder’s mother, Queenie. At one point, Cinder becomes momentarily jealous of her newborn puppy brother, Budge. The central adventure of the novel, however, is Cinder’s performance in a theater production authored by Mr. George. Cinder becomes depressed when the theater group begins a tour that requires her to travel without her master. The starring actress, apparently famous, takes to Cinder and helps her feel more comfortable in Mr. George’s absence. By the end of the story, Mr. Green and the actress are married, and Cinder makes an unexpected grand entrance into the ceremony. Little Dog Mack: The Story of a Wirehaired Terrier. Indianapolis: Bobbs-Merrill, 1936. 137 pages. Illustrated by Van Trenck; Dedicated to E.H.W. Nine-year-old twins Ralph and Rachel receive Mack, a three-month-old wire-haired fox terrier for Christmas. The little white dog with black and tan spots loves to chase other dogs. One day, he is lured away from home by a dishonest kennel owner who uses his dog, Mitzi, for bait. Mack is unhappy at the kennel, where he is deprived of human companionship and made to eat food he dislikes. He fathers four pups with Mitzi, and while she is busy with her infants, the son of the kennel owner takes Mack along in the car as a guard dog. There is an accident, which enables Mack’s escape. He visits a farm where he saves young Johnny from a bull. Johnny is allowed to keep Mack only until his owner is found. Johnny suspects that Mack doesn’t rightfully belong to the kennel and helps the little dog escape again. On his long trek home, Mack meets other stray dogs and steals a ham bone. Finally, he reaches his real home, after traveling about 100 miles. Ralph and Rachel are ecstatic at his return, and the family cat, Jet, learns to adore him. Waif: The Story of Spe. Indianapolis: Bobbs-Merrill, 1937. 138 pages. Illustrated by Will Rannells. One Christmas Eve, a woman spots Waif—a mongrel puppy, part Spritz, perhaps part Pekinese—in the window of a pet shop in Columbus, Ohio. She decides to purchase the pup as a gift for her brother and sister-in-law. As it turns out, the couple does not want the dog. Rather than taking their new charge to the Humane Society, they simply drop her on the Ohio State University campus, next to Mirror Lake. Despite the couple’s heartless disposal of the defenseless puppy, young Waif enjoys her freedom, fending for herself on campus and its surrounding alleyways. When school is back in session, she begs for scraps at a nearby fraternity house. The Sigma Phi Epsilon brothers adopt the dog as their mascot, calling her “Spe,” an acronym of their Greek letters. Spe is an obedient pet, following the various fraternity members to their classes, where she quietly sits through lectures. She also attends football games, marches on the field with the band, and helps raise money with the Charity Newsies, all the while becoming quite popular with Ohio State students. She spends a few nights in the local animal shelter when two of the frat brothers who dislike dogs try to get rid of her. One night after returning from the shelter, however, Spe wins everyone over when she alerts the house members to a burglar. During school breaks, Spe stays with a university art professor—modeled after Will Rannells—who specializes in dog portraits and owns several dogs and cats. The novel closes with a dinner for dogs at the local Human Society shelter—with Spe as guest of honor, of course—organized by Rosemary and Raymond, the two children who live next to the SigEp house, and who greatly admire Spe. The Great Adventures of Jack, Jock and Funny. Indianapolis: Bobbs-Merrill, 1938. 178 pages. Illustrated by Will Rannells; Dedicated to Charles L. Hirsch, Who owns Funny. Twelve-year-old twins, Charles and Chester Gray, open a kennel on the family’s farm after a stray dog shows up at school. The all-white Collie, Jack, is joined by several other boarders over the summer, including a Scottish Terrier named Jock, two Pointers named Rusty and Sam, and a prissy Cocker Spaniel named Sallie. Charles’s and Chester’s six-year-old sister, Annabel—who already has a pet rooster named Demosthenes—adds Thistle, a stray kitten, to the growing menagerie. As the children tend to their kennel, they anticipate their grandfather’s arrival any day. Grandpa Gray, retiring from his jewelry store business, is coming to live with his son’s family on the farm. Shortly before venturing to the farm, he acquires Funny, a scruffy Poodle who was a former performer in a dog act. Grandpa Gray’s train wrecks on the way into town, and Funny runs away. The twins find the small dog, as the wreck is not far from the farm, but their grandfather develops amnesia and wanders off. The family is puzzled as to Grandpa Gray’s whereabouts, but suspect he might be visiting his brother. Meanwhile, Jock and Funny are stolen, but Jack rescues them. Annabel takes Funny with her to pick blackberries, and the dog leads her to the front porch of the family’s nearest neighbor—an old, unfriendly hermit. On the porch sits Grandpa Gray. Not realizing the grandfather’s identity, the neighbor has been taking care of him. Once Annabel recognizes her grandfather and explains to him that he was in a train accident, Grandpa Gray’s memory returns and he is united with the family on the farm. The Forest Road: Two Boys In the Ozarks. Indianapolis: Bobbs-Merrill, 1939. 158 pages. Illustrated by Alma Wentzel Froderstrom; Dedicated to Emerson Evans [Her cousin, the nephew of her Welsh grandmother, Eleanor Evans]. On a vacation / business venture, eleven-year-old Robert Brown and his father turn down the wrong country road and the trailer they are pulling with their car gets stuck in the mud. Francis Smith—a county boy the same age as Robert—happens across the scene, riding his horse, Ben, on the way home from school. Robert’s cat, Whiskers, runs up a tree, and Francis—with the aid of Ben—rescues him. Being the same age, the two boys become fast friends, and Robert enjoys romping the countryside and resident swap with Francis—and Francis’s beagle, Sounder. Francis doesn’t seem to like his father, Japp. As it turns out, Japp is Francis’s stepfather, as his real father, Mr. Lynn, passed away a year before. His mother is also not his biological parent, but his father’s second wife, his real mother having died when Francis was an infant. Japp doesn’t think Francis should spend time playing music, and takes away his violin. He also insists that Francis use his last name and call him dad, prompting Francis to plan to run away. The boys soon learn, however, that Francis is actually Robert’s cousin, as Robert’s father is the brother of Francis’s real mother. In fact, the purpose of the trip to the country is two-fold; Mr. Brown is there to collect plant specimens from the swamp for the government, but he is also there to see how his son and nephew get along because Francis’s father asked him to adopt his son before he died. Along the way, the boys put on a show for the all of Francis’s country neighbors, involving magic tricks performed by Robert, Sounder singing in accompaniment with Francis’s harmonica, and a lecture on swamp plants by Mr. Brown. The story has a happy ending, with Robert leaving with the Browns, Whiskers, and Sounder, to start a new life where he can freely pursue music. Timmy: The Dog That Was Different. Indianapolis: Bobbs-Merrill, 1941. 191 pages. Illustrated by Will Rannells; Dedicated to the boys and girls who liked Jack, Jock and Funny. In this sequel to The Great Adventures of Jack, Jock and Funny, Annabel and her twin brothers, Charles and Chester, live with their father (an insurance salesman), mother (a homemaker), and grandfather (a retired store owner), on a farm. For a summer job, Charles and Chester decide to run a kennel as they had the previous summer, using the old horse stalls on the property for dogs. Their first client is the old hermit who lives next door, Mr. Smith. His friend has a cocker-spaniel named Timmy that needs boarding, on the condition that he sleep next to someone’s bed. A variety of dogs come to stay at the kennel over the summer, but Timmy stands apart from the others because he is deaf, and there is mystery as to his owner’s relationship to Mr. Smith and their foreign heritage. Annabel believes Timmy belongs to a princess, and in the end, we learn that Timmy in fact belongs to an exiled royal family, making their way from Persia to Canada. Mount Delightful: The Story of Ellen Evans and Her Dog Taffy. Indianapolis: Bobbs-Merrill, 1944.155 pages. Illustrated by Sandra James; Dedicated to Ada Norman Clark [Adah Clark was librarian of Pataskala Public Library]. The Skitter Cat Book. Indianapolis: Bobbs-Merrill, 1947. 261 pages. Illustrated by J. J. Taber; Dedicated to William C. Youmans, The Little Boy of the Story. Short Stories "Hearts By Freight." Boston Daily Globe (5 May 1910): 12. 1243 words. "The Man Who Wanted a Dog That Would Kill." The American Magazine 92.4 (Oct. 1921): 22+. 4583 words. Illustrated by Douglas Duer. Dudley Forrester, appropriately nicknamed “Dud,” marries Zoe Forrester and takes her west after her parents suddenly pass away. He is abusive and goes so far as to shoot her dog, Rover, because the dog is unable to protect the farm animals from mountain lions. Dud replaces Rover with a young Airedale that he calls "Frowsy." Zoe dislikes the name, and refers to the puppy as "Duffy" instead. Duffy is ferocious enough to hold no fear of the mountain lions, yet retains a gentle nature and forms an affectionate bond with Zoe. Despite her love for the dog, Zoe surmises that Dud stole the Airedale from a kennel and confronts her husband with her suspicions. Following her accusation, Dud attempts to kick his wife. In response to Dud’s violent outburst, Duffy lunges at the man in order to protect Zoe. Unable to get a stranglehold on his opponent as the Airedale has been trained to do, the dog is unable to physically harm Zoe’s attacker. Instead, Duffy literally scares Dud to death. The man who wanted a dog to kill has gotten exactly that. The true owner of the dog soon arrives—it is David Moore, Zoe’s cousin. Thus, she is reunited with her family, freed of her abusive husband, and will get to stay with her savior, Duffy. "The Adventures of Skitter Cat." Dinty the Porcupine and Other Stories. True Story Series. Book Three. Eds. Clara B. Baker and Edna D. Baker. Bobbs-Merrill, 1928. 63-90. Illustrated by Vera Stone Norman. "Skitter Cat." Winding Roads. Eds. Wilhelmina Harper and Aymer Jay Hamilton. New York: Macmillan, 1928. 200-216. "Cinder." Child Life 10.6 (June 1931): 270-271. 1528 words. Illustrated by Ruth Eger. “The Kidnapped Pup.” Junior Home 13 (June-July 1932). 18-19. Illustrated by Don Nelson. "Cinder and Inky." Child Life 11.9 (Sept. 1932): 426-427. Illustrated by Ruth Eger. "Cinder and Inky Again." Child Life 12.8 (Aug. 1933): 376-377. 1028 words. Illustrated by Ruth Eger. Inky, a black kitten who is a secondary character in the longer work Cinder, is central protagonist in this short story. Fascinated by the robins nesting in his backyard apple tree, Inky climbs up the limbs to get a closer look. Unfortunately for him, he peers a little too close and the feathered parents attack. Despite the protest from the birds, Inky has climbed too high in the tree and is unable to retreat. Hearing his frantic mews and the robins’ squawking, Cinder—the tan toy terrier who lives next door—comes to her feline friend’s rescue. She barks and jumps at the base of the tree until her owner notices the commotion and rigs a meat-laden basket up into the branches to facilitate a safe landing for the curious kitten. "Camping in the Rocky Mountains." Friends Around the World. The Curriculum Readers, Vol. 3. Eds. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker. Indianapolis: Bobbs-Merrill, 1934. 291-308. "Teddy Horse." Friends Around the World. The Curriculum Readers, Vol. 3. Eds. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker. Indianapolis: Bobbs-Merrill, 1934. 16-25. "Baby Seal." Friends Here and Away. The Curriculum Readers, Vol. 2. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker, Eds. Indianapolis: Bobbs-Merrill, 1938. 214-222. "Skitter in the Well." Friends Here and Away. The Curriculum Readers, Vol. 2. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker, Eds. Indianapolis: Bobbs-Merrill, 1938. 200-213. "Skitter Cat and Major." The Road to Safety Around the Year. Eds. Horace Mann Buckley, Margaret L. White, Alice B. Adams, and Leslie R. Silvernale. New York: American Book Company, 1938. 95-104. Illustrated by Ruth Bennett. Home Subscribe to: Posts (Atom) Eleanor Williams Youmans With black and tan terrier, Jill, and barely visible black and white cat, Whiskers, 1937 Blog Archive ▼ 2011 (1) ▼ March (1) Hearts By Freight ► 2010 (16) ► October (1) ► September (1) ► August (2) ► July (4) ► June (2) ► May (4) ► April (2) Short Stories "Hearts By Freight." Associated Literary Press, McClure Syndicate (1910). “The Man Who Wanted a Dog That Would Kill.” The American Magazine 92.4 (Oct. 1921): 22+. Illustrated by Douglas Duer. "The Adventures of Skitter Cat." Dinty the Porcupine and Other Stories. True Story Series. Book Three. Eds. Clara B. Baker and Edna D. Baker. Indianapolis: Bobbs-Merrill, 1928. 63-90. Illustrated by Vera Stone Norman. "Skitter Cat." Winding Roads. Eds. Wilhelmina Harper and Aymer Jay Hamilton. New York: Macmillan, 1928. 200-216. Illustrated by Maud and Miska Persham. "Cinder." Child Life 10.6 (June 1931): 270-271. Illustrated by Ruth Eger. “The Kidnapped Pup.” Junior Home 13 (June-July 1932): 18-19, 51. "Cinder and Inky." Child Life 11.9 (Sept. 1932): 426-427. Illustrated by Ruth Eger. "Cinder and Inky Again." Child Life 12.8 (Aug. 1933): 376-377. Illustrated by Ruth Eger. "Camping in the Rocky Mountains." Friends Around the World. The Curriculum Readers, Vol. 3. Eds. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker. Indianapolis: Bobbs-Merrill, 1934. 291-308. Illustrated by Vera Stone Norman. "Teddy Horse." Friends Around the World. The Curriculum Readers, Vol. 3. Eds. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker. Indianapolis: Bobbs-Merrill, 1934. 16-25. Illustrated by Vera Stone Norman. "Baby Seal." Friends Here and Away. The Curriculum Readers, Vol. 2. Eds. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker. Indianapolis: Bobbs-Merrill, 1938. 214-222. Illustrated by Vera Stone Norman and Mildred Lyon Hetherington. "Skitter in the Well." Friends Here and Away. The Curriculum Readers, Vol. 2. Clara Belle Baker, Mary Maud Reed, and Edna Dean Baker, Eds. Indianapolis: Bobbs-Merrill, 1938. 200-213. Illustrated by Vera Stone Norman and Mildred Lyon Hetherington. "Skitter Cat and Major." The Road to Safety Around the Year. Eds. Horace Mann Buckley, Margaret L. White, Alice B. Adams, and Leslie R. Silvernale. New York: American Book Company, 1938. 95-104. And other stories appearing in The Cat Courier (1914-15), Mother's Magazine (1911-12), Fur and Feathers (London, 17 Sept. 1915), Junior Home, and The Animals' Magazine (London, before 1937) Novels Skitter Cat. Illustrated by Ruth Bennett. Indianapolis: Bobbs-Merrill, 1925. Skitter Cat and Little Boy. Illustrated by Ruth Bennett. Indianapolis: Bobbs-Merrill, 1926. Skitter Cat and Major. Illustrated by Ruth Bennett. Indianapolis: Bobbs-Merrill, 1927. Skitter and Skeet. Illustrated by Ruth Bennett. Indianapolis: Bobbs-Merrill, 1928. Teddy Horse—The Story of a Runaway Pony. Illustrated by Ruth King. Indianapolis: Bobbs-Merrill, 1930. Teddy Horse—The Story of a Runaway Pony. London: Elkin Mathews and Marrot, 1931. Cinder—The Tale of a Black and Tan Toy Terrier. Illustrated by F. Bernard Shields. Indianapolis: Bobbs-Merrill, 1933. Little Dog Mack—The Story of a Wirehaired Terrier. Illustrated by Van Trenck. Indianapolis: Bobbs-Merrill, 1936. Waif: The Story of Spe. Illustrated by and written in collaboration with Will Rannells. Indianapolis: Bobbs-Merrill, 1937. The Great Adventures of Jack, Jock and Funny. Illustrated by Will Rannells. Indianapolis: Bobbs-Merrill, 1938. The Forest Road: Two Boys In the Ozarks. Illustrated by Alma Wentzel Froderstrom. Indianapolis: Bobbs-Merrill, 1939. Timmy: The Dog That Was Different. Illustrated by Will Rannells. Indianapolis: Bobbs-Merrill, 1941. Mount Delightful: The Story of Ellen Evans and Her Dog Taffy. Illustrated by Sandra James. Indianapolis: Bobbs-Merrill, 1944. The Skitter Cat Book. Illustrated by J. J. Taber. Indianapolis: Bobbs-Merrill, 1947. Poems “The Alward School.” (1924; 1936) Pataskala Standard. Golden Edition. 7 May 1936. “Pussy's Purr.” Skitter Cat. Indianapolis, IN: Bobbs-Merrill, 1925: 8. “A Letter to Major.” Skitter Cat and Little Boy. Indianapolis, IN: Bobbs-Merrill, 1926: 20. “The Long Tryst.” (1933; 1968) Pataskala Standard 17 Oct. 1968: 8A “Little Dog Lost.” Little Dog Mack. Indianapolis, IN: Bobbs-Merrill, 1936: 22-23. And other poems in the Pataskala Standard and Columbus Dispatch, 1920-1924. Essays “How to Make Finger Stalls for A Little Boy’s Sore Fingers Out of Old Kid Gloves.” Mother’s Magazine, 1911-1912. "Manhattan Tour." Berkeley Daily Gazette 5 Dec. 1934: 4. "The Alward School." Pataskala Standard. Golden Edition. 7 May 1936. Unpublished Works Blooming Valley (Novel) The Heart of Ohio (other working titles: No Wolves to Howl; The Sunlit Forest) (Novel) “The House With Six Front Doors.” (Short Story) Tony of Texas (Short Story) About Me Jackie Jaclyn Cruikshank Vogt is Photo Librarian for NEBRASKAland Magazine at the Nebraska Game and Parks Commission. She holds a PhD in English and Women’s and Gender Studies from the University of Nebraska-Lincoln, where she specialized in late twentieth-century American literature, women writers, and violence studies. Jaclyn has worked as a research assistant at the Center for Digital Research in the Humanities, writing center consultant, ESL/ELL tutor, graduate studies coordinator, and taught a variety of composition, literature, and women’s and gender studies courses. She enjoys jewelry making, spending time with her husband and three cats in their 2,000 square foot prairie garden, and recovering the life and work of Ohio children’s author Eleanor Youmans. View my complete profile Awesome Inc. theme. Theme images by enjoynz. Powered by Blogger.
elibtronic-ca-6413 ---- None
elibtronic-ca-7643 ---- None
emailarchivesgrant-library-illinois-edu-4927 ---- Email Archives: Building Capacity and Community – "Email Archives: Building Capacity and Community” is a four-year program seeking to build email archiving capacity in archives, libraries, and museums. The program will fund projects of $25,000 to no more than $100,000 dollars. The goal of this project is to build a broad community of institutions that can preserve email as part of their research collections. We invite you to be a part of this important initiative by submitting a proposal! Skip to content ☰Menu About this Opportunity Overview Funding Ideas FAQs More Information Contact Us Submit a Proposal Instructions Timeline Proposal Evaluation News & Updates Email Archives Task Force Email Archives: Building Capacity and Community "Email Archives: Building Capacity and Community” is a four-year program seeking to build email archiving capacity in archives, libraries, and museums. The program will fund projects of $25,000 to no more than $100,000 dollars. The goal of this project is to build a broad community of institutions that can preserve email as part of their research collections. We invite you to be a part of this important initiative by submitting a proposal! Grant Summary Proposal Submission What are email archives? Funding ideas Latest news Email Archives Task Force Submit your proposal Privacy Policy © University of Illinois Board of Trustees
en-wikipedia-org-1011 ---- Proof of stake - Wikipedia Proof of stake From Wikipedia, the free encyclopedia Jump to navigation Jump to search Proof of stake (PoS) protocols are a class of consensus mechanisms for blockchains that work by selecting validators in proportion to their quantity of holdings in the associated cryptocurrency. Unlike a proof of work (PoW) protocol, PoS systems do not incentivize extreme amounts of energy consumption. The first functioning use of PoS for cryptocurrency was Peercoin in 2012. The biggest proof-of-stake blockchain by "market cap” is Cardano. Contents 1 Description 2 Attacks 3 Variants 3.1 Variations of stake definition 3.2 Delegated proof of stake 4 Implementations 5 References Description For a blockchain transaction to be recognized, it must be appended to the blockchain. Validators carry out this appending; in most protocols, they receive a reward for doing so.[1] For the blockchain to remain secure, it must have a mechanism to prevent a malicious user or group from taking over a majority of validation. PoS accomplishes this by requiring that validators have some quantity of blockchain tokens, requiring potential attackers to acquire a large fraction of the tokens on the blockchain to mount an attack.[2] Proof of work, another commonly used consensus mechanism, uses a validation of computational prowess to verify transactions, requiring a potential attacker to acquire a large fraction of the computational power of the validator network.[2] This incentivizes consuming huge quantities of energy. PoS is tremendously more energy-efficient.[3] In 2021, Elon Musk and Bill Gates were seen as damaging sentiment towards proof-of-work blockchains such as Bitcoin and Ethereum by publicising their massive energy consumption. The efficiency of proof-of-stake coins such as Cardano, EOS, BitGreen and Stellar led to them being described as "green coins".[4][5][6][7] Attacks PoS protocols can suffer from the nothing-at-stake problem, where validator nodes validate conflicting copies of the blockchain because there is minimal cost to doing so, and a smaller chance of losing out on rewards by validating a block on the wrong chain. If this persists, it can allow double-spending.[8] This can be mitigated through penalizing validators who validate conflicting chains[8] or by structuring the rewards so that there is no economic incentive to create conflicts.[1] Variants Variations of stake definition The exact definition of "stake" varies from implementation to implementation. For instance, some cryptocurrencies use the concept of "coin age", the product of the number of tokens with the amount of time that a single user has held them, rather than merely the number of tokens, to define a validator's stake.[2] Delegated proof of stake Delegated proof of stake (DPoS) systems separate the roles of the stake-holders and validators, by allowing stake-holders to delegate the validation role.[8] Implementations The first functioning implementation of a proof-of-stake cryptocurrency was Peercoin, introduced in 2012.[1] Other cryptocurrencies, such as Blackcoin, Nxt, Cardano, and Algorand followed.[1] However, as of 2017[update], PoS cryptocurrencies were still not as widely used as proof-of-work cryptocurrencies.[9] The biggest proof-of-stake blockchains by “market cap” in 2021 were Cardano, Polkadot and Solana. Other prominent PoS platforms include Avalanche,[10] Tron, EOS, Algorand, and Tezos.[11][12][13] There have been repeated proposals for Ethereum to switch from a PoW to PoS mechanism.[14][15] In April 2021, the Ethereum Foundation announced that it planned to switch to a PoS system by the end of 2021.[15] However, switching to a PoS system is a substantial change, and progress has not been steady. William Entriken, an Ethereum developer, said: "You have to switch to proof of stake. Proof of work should be illegal." However, the change has "always been three months away. These things don't just happen immediately."[14] References ^ a b c d Saleh, Fahad (2021-03-01). "Blockchain without Waste: Proof-of-Stake". The Review of Financial Studies. 34 (3): 1156–1190. doi:10.1093/rfs/hhaa075. ISSN 0893-9454. ^ a b c Tasca, Paolo; Tessone, Claudio J. (2019-02-15). "A Taxonomy of Blockchain Technologies: Principles of Identification and Classification". Ledger. 4. doi:10.5195/ledger.2019.140. ISSN 2379-5980. ^ Zhang, Rong; Chan, Wai Kin (Victor) (2020). "Evaluation of Energy Consumption in Block-Chains with Proof of Work and Proof of Stake". Journal of Physics: Conference Series. 1584 (1): 012023. Bibcode:2020JPhCS1584a2023Z. doi:10.1088/1742-6596/1584/1/012023. ISSN 1742-6596. ^ Leyes, Kevin (June 15, 2021). "Elon Musk's Tweet Radically Changed the Crypto Game". Entrepreneur.com. ^ Sorkin, Andrew Ross (March 9, 2021). "Why Bill Gates is worried about Bitcoin". The New York Times. ^ Partridge, Joanna (June 14, 2021). "Bitcoin price back above $40,000 after Elon Musk comments". The Guardian. ^ Kaplan, Ezra (May 25, 2021). "Cryptocurrency goes green: Could 'proof of stake' offer a solution to energy concerns?". NBC News. ^ a b c Xiao, Y.; Zhang, N.; Lou, W.; Hou, Y. T. (2020). "A Survey of Distributed Consensus Protocols for Blockchain Networks". IEEE Communications Surveys and Tutorials. 22 (2): 1432–1465. arXiv:1904.04098. doi:10.1109/COMST.2020.2969706. ISSN 1553-877X. S2CID 102352657. ^ Li, Wenting; Andreina, Sébastien; Bohli, Jens-Matthias; Karame, Ghassan (2017). "Securing Proof-of-Stake Blockchain Protocols". In Garcia-Alfaro, Joaquin; Navarro-Arribas, Guillermo; Hartenstein, Hannes; Herrera-Joancomartí, Jordi (eds.). Data Privacy Management, Cryptocurrencies and Blockchain Technology. Lecture Notes in Computer Science. Cham: Springer International Publishing. pp. 297–315. doi:10.1007/978-3-319-67816-0_17. ISBN 978-3-319-67816-0. ^ Gecgil, Tezcan. "7 Cryptos to Buy for Their Potentially Profitable Partnerships". www.nasdaq.com. Retrieved 2021-07-23. ^ Ashworth, Will (July 13, 2021). "Solana vs. Cardano: Which Is the Better Ethereum Killer?". Investor Place. ^ Hissong, Samantha (July 9, 2021). "The Crypto World Is Getting Greener. Is It Too Little Too Late?". Rolling Stone. ^ Nguyen, Cong T.; Hoang, Dinh Thai; Nguyen, Diep N.; Niyato, Dusit; Nguyen, Huynh Tuong; Dutkiewicz, Eryk (2019). "Proof-of-Stake Consensus Mechanisms for Future Blockchain Networks: Fundamentals, Applications and Opportunities". IEEE Access. 7: 85727–85745. doi:10.1109/ACCESS.2019.2925010. ^ a b Sparkes, Matthew (2021-03-30). "NFT developers say cryptocurrencies must tackle their carbon emissions". New Scientist. doi:10.1016/S0262-4079(21)00548-0. Retrieved 2021-04-07. ^ a b Lau, Yvonne (2021-05-27). "Ethereum founder Vitalik Buterin says long-awaited shift to 'proof-of-stake' could solve environmental woes". Forbes. Retrieved 2021-05-29. v t e Cryptocurrencies Technology Blockchain Cryptocurrency tumbler Cryptocurrency exchange Cryptocurrency wallet Cryptographic hash function Decentralized exchange Decentralized Finance Distributed ledger Fork Lightning Network MetaMask Non-fungible token Smart contract Consensus mechanisms Proof of authority Proof of personhood Proof of space Proof of stake Proof of work Proof of work currencies SHA-256-based Bitcoin Bitcoin Cash Counterparty LBRY MazaCoin Namecoin Peercoin Titcoin Ethash-based Ethereum Ethereum Classic Scrypt-based Auroracoin Bitconnect Coinye Dogecoin Litecoin Equihash-based Bitcoin Gold Zcash RandomX-based Monero X11-based Dash Petro Other AmbaCoin Firo IOTA Primecoin Verge Vertcoin Proof of stake currencies Algorand Cardano EOS.IO Gridcoin Nxt Peercoin Polkadot Steem Tezos TRON ERC-20 tokens Augur Aventus Bancor Basic Attention Token Chainlink Kin KodakCoin Minds The DAO Uniswap Stablecoins Dai Diem Tether USD Coin Other currencies Ankr Chia Filecoin HBAR (Hashgraph) Nano NEO Ripple SafeMoon Stellar WhopperCoin Related topics Airdrop BitLicense Blockchain game Complementary currency Crypto-anarchism Cryptocurrency bubble Cryptocurrency scams Digital currency Distributed ledger technology law Double-spending Hyperledger Initial coin offering Initial exchange offering Initiative Q List of cryptocurrencies Token money Virtual currency Category Commons List Retrieved from "https://en.wikipedia.org/w/index.php?title=Proof_of_stake&oldid=1035170409" Categories: Cryptography Cryptocurrencies Hidden categories: Wikipedia extended-confirmed-protected pages Articles containing potentially dated statements from 2017 All articles containing potentially dated statements Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read View source View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Čeština Deutsch Eesti Español فارسی Français 한국어 Italiano 日本語 Polski Português Русский ไทย Türkçe Українська 中文 Edit links This page was last edited on 24 July 2021, at 03:35 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-1418 ---- Man and Maid - Wikipedia Man and Maid From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 film Man and Maid Suzette (Renée Adorée) makes the tedious hours of the wounded Sir Nicholas Thormonde (Lew Cody) seem less monotonous. Directed by Victor Schertzinger Written by Elinor Glyn Starring Lew Cody Renée Adorée Harriet Hammond Cinematography Chester A. Lyons Distributed by Metro-Goldwyn-Mayer Release date April 20, 1925 (1925-04-20) Running time 60 minutes Country United States Languages Silent English intertitles Man and Maid is a lost[1] 1925 drama film directed by Victor Schertzinger based on a 1922 novel by Elinor Glyn. The film stars Lew Cody, Renée Adorée and Harriet Hammond.[2][3] Contents 1 Plot 2 Cast 3 References 4 External links Plot[edit] Boulevardier Sir Nicholas Thormonde (Lew Cody) has to choose between his mistress Suzette (Renée Adorée) and his virtuous secretary Alathea (Harriet Hammond) in wartime Paris. Cast[edit] Lew Cody - Sir Nicholas Thormonde Renée Adorée - Suzette Harriet Hammond - Alathea Bulteel Paulette Duval - Coralie Alec B. Francis - Burton Crauford Kent - Col. George Harcourt David Mir - Maurice Jacqueline Gadsden - Lady Hilda Buiteel Winston Miller - Little Bobby Jane Mercer - Little Hilda Irving Hartley - Atwood Chester References[edit] ^ The Library of Congress American Silent Feature Film Survival Catalog:Man and Maid ^ Man and Maid at silentera.com ^ The AFI Catalog of Feature Films:Man and Maid External links[edit] Wikimedia Commons has media related to Man and Maid. Man and Maid at IMDb Man and Maid review at AllMovie Guide Man and Maid at the TCM Movie Database v t e Films directed by Victor Schertzinger The Pinch Hitter (1917) The Millionaire Vagrant (1917) The Clodhopper (1917) Sudden Jim (1917) The Son of His Father (1917) His Mother's Boy (1917) The Hired Man (1918) The Family Skeleton (1918) Playing the Game (1918) His Own Home Town (1918) The Claws of the Hun (1918) A Nine O'Clock Town (1918) Coals of Fire (1918) Quicksand (1918) String Beans (1918) Hard Boiled (1919) Extravagance (1919) The Sheriff's Son (1919) The Homebreaker (1919) The Lady of Red Butte (1919) When Doctors Disagree (1919) Other Men's Wives (1919) Upstairs (1919) Jinx (1919) Pinto (1920) The Blooming Angel (1920) The Slim Princess (1920) What Happened to Rosa (1920) The Concert (1921) Beating the Game (1921) Made in Heaven (1921) The Bootlegger's Daughter (1922) The Kingdom Within (1922) Head over Heels (1922) Mr. Barnes of New York (1922) Long Live the King (1923) Dollar Devils (1923) Refuge (1923) The Lonely Road (1923) The Man Next Door (1923) The Scarlet Lily (1923) The Man Life Passed By (1923) Chastity (1923) Bread (1924) A Boy of Flanders (1924) Man and Maid (1925) Thunder Mountain (1925) The Golden Strain (1925) Flaming Love (1925) The Wheel (1925) The Lily (1926) Siberia (1926) The Return of Peter Grimm (1926) Stage Madness (1927) The Heart of Salome (1927) The Secret Studio (1927) The Showdown (1928) Forgotten Faces (1928) Redskin (1929) Nothing but the Truth (1929) Fashions in Love (1929) The Wheel of Life (1929) The Laughing Lady (1929) Paramount on Parade (1930) Safety in Numbers (1930) Heads Up (1930) The Woman Between (1931) Friends and Lovers (1931) Strange Justice (1932) Uptown New York (1932) The Constant Woman (1933) Cocktail Hour (1933) My Woman (1933) One Night of Love (1934) Beloved (1934) Let's Live Tonight (1935) Love Me Forever (1935) The Music Goes 'Round (1936) Something to Sing About (1937) The Mikado (1939) Road to Singapore (1940) Rhythm on the River (1940) Road to Zanzibar (1941) Kiss the Boys Goodbye (1941) Birth of the Blues (1941) The Fleet's In (1942) This article about a silent drama film from the 1920s is a stub. You can help Wikipedia by expanding it. v t e Retrieved from "https://en.wikipedia.org/w/index.php?title=Man_and_Maid&oldid=1007984128" Categories: 1925 films American films Metro-Goldwyn-Mayer films American silent feature films 1925 drama films Lost American films American black-and-white films American drama films Films directed by Victor Schertzinger Lost drama films 1925 lost films 1920s silent drama film stubs Hidden categories: Articles with short description Short description is different from Wikidata Use mdy dates from September 2020 Template film date with 1 release date Commons category link from Wikidata All stub articles Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Català فارسی Italiano Nederlands Português Edit links This page was last edited on 20 February 2021, at 23:29 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-217 ---- National Bank Act - Wikipedia National Bank Act From Wikipedia, the free encyclopedia Jump to navigation Jump to search Primary federal legislation authorizing the creation of national banks in the US The First National Bank in Philadelphia The National Banking Acts of 1863 and 1864 were two United States federal banking acts that established a system of national banks, and created the United States National Banking System. They encouraged development of a national currency backed by bank holdings of U.S. Treasury securities and established the Office of the Comptroller of the Currency as part of the United States Department of the Treasury and a system of nationally chartered banks. The Act shaped today's national banking system and its support of a uniform U.S. banking policy. Contents 1 Background 2 National Bank Acts 2.1 National Bank Act of 1863 2.2 National Bank Act of 1864 2.3 National Bank Acts of 1865 and 1866 3 Resurgence of state banks 4 Legacy 5 See also 6 Notes 7 Further reading 8 External links Background[edit] At the end of the Second Bank of the United States in 1836, the control of banking regimes devolved mostly to the states. Different states adopted policies including a total ban on banking (as in Wisconsin), a single state-chartered bank (as in Indiana and Illinois), limited chartering of banks (as in Ohio), and free entry (as in New York).[1] While the relative success of New York's "free banking" laws led a number of states to also adopt a free-entry banking regime, the system remained poorly integrated across state lines. Though all banknotes were uniformly denominated in dollars, notes would often circulate at a steep discount in states beyond their issue. In the end, there were well-publicized frauds arising in states like Michigan, which had adopted free entry regimes but did not require redeemability of bank issues for specie. The perception of dangerous "wildcat banking”, along with the poor integration of the U.S. banking system, led to increasing public support for a uniform national banking regime. The United States Government, on the other hand, still had limited taxation capabilities, and so had an interest in the seigniorage potential of a national bank. In 1846, the Polk Administration created a United States Treasury system that moved public funds from private banks to Treasury branches in order to fund the Mexican–American War. However, without a national currency, the revenue generated this way was limited. This became more urgent during the Civil War, when Congress and Lincoln were struggling to finance the war efforts.[2] Without a national mechanism for issuing currency, the Lincoln could not exploit the powers and loopholes that, for example, Britain could with its central bank, in order to finance the high expenses involved. Previously, the damage that would be done to state banks by national competition was sufficient to prevent significant national bank chartering. But using the war crisis, Lincoln was able to expand this effort. A "greenback" note issued during the Civil War One of the first attempts to issue a national currency came in the early days of the Civil War when Congress approved the Legal Tender Act of 1862, allowing the issue of $150 million in national notes known as greenbacks and mandating that paper money be issued and accepted in lieu of gold and silver coins. The bills were backed only by the national government's promise to redeem them and their value was dependent on public confidence in the government as well as the ability of the government to give out specie in exchange for the bills in the future. Many thought this promise backing the bills was about as good as the green ink printed on one side, hence the name "greenbacks."[3] The Second Legal Tender Act,[4] enacted July 11, 1862, a Joint Resolution of Congress,[5] and the Third Legal Tender Act,[6] enacted March 3, 1863, expanded the limit to $450 million. The largest amount of greenbacks outstanding at any one time was calculated as $447,300,203.10.[7] The National Bank Act (ch. 58, 12 Stat. 665; February 25, 1863), originally known as the National Currency Act, was passed in the Senate by a 23–21 vote, and was supplemented a year later by the National Banking Act of 1864. The goals of these acts was to create a single national currency, a nationalized bank chartering system, and to raise money for the Union war effort. The Act established national banks that could issue notes which were backed by the United States Treasury and printed by the government itself. The quantity of notes that a bank was allowed to issue was proportional to the bank's level of capital deposited with the Comptroller of the Currency at the Treasury. To further control the currency, the Act taxed notes issued by state and local banks, essentially pushing non-federally issued paper out of circulation.[8] Since the establishment of the Republic, state governments had held authority to regulate banks. Before the act, state legislatures typically issued bank charters on a case-by-case basis, taking into consideration whether the area needed a new bank, and if the applicant was of good moral standing. As this system could be subject to corruption, states began passing "free banking" laws in 1837, which meant that any applicant who filled out the correct paperwork and deposited an in-kind payment to the state would be granted a charter. By the 1860s, over half of states had such a law on the books. However, the National Banking Act of 1864 (ch. 106, 13 Stat. 99; June 3, 1864) brought a close to the issue by establishing federally-issued bank charters, which took banking out of the hands of state governments.[3][8] The first bank to receive a national charter was the First National Bank of Philadelphia, Pennsylvania (Charter #1).[9] The first new national bank to open was The First National Bank of Davenport, Iowa (Charter #15).[citation needed] Additionally, the new Act converted more than 1,500 state banks to national banks.[citation needed] National Bank Acts[edit] $1000 National Bank Note National Bank Act of 1863[edit] The National Bank Act of 1863 was passed on February 25th, 1863, and was the first attempt to establish a federal banking system after the failures of the First and Second Banks of the United States, and served as the predecessor to the Federal Reserve Act of 1913.[10][11] The act allowed the creation of national banks, set out a plan for establishing a national currency backed by government securities held by other banks, and gave the federal government the ability to sell war bonds and securities (in order to help the war effort). National banks were chartered by the federal government, and were subject to stricter regulation; they had higher capital requirements and were not allowed to loan more than 10% of their holdings. A high tax on state banks was levied to discourage competition, and by 1865 most state banks had either received national charters or collapsed. [10] National Bank Act of 1864[edit] The 1864 act, based on a New York State law, brought the federal government into active supervision of commercial banks. It established the Office of the Comptroller of the Currency with the responsibility of chartering, examining and supervising all national banks. National Bank Acts of 1865 and 1866[edit] Further acts passed in 1865 and 1866 imposed a tax to speed the adoption of the system. All banks (national or otherwise) had to pay a 10% tax on payments that they made in currency notes other than national bank notes. The tax rate was intentionally set so high as to effectively prohibit further circulation of state bank and private notes. By this time the conversion from state banks to national banks was well underway. The constitutionality of the tax came before the Supreme Court in Veazie Bank v. Fenno, a case by a state-chartered Maine bank and the collector of internal revenue. The Court ruled 7–2 in favor of the government. State banks declined until the 1870s, when the growing popularity of checks and the declining profitability of national bank currency issues caused a resurgence. Resurgence of state banks[edit] The granting of charters led to the creation of many national banks and a national banking system which grew at a fast pace. The number of national banks rose from 66 immediately after the Act to 7,473 in 1913.[citation needed] Initially, this rise in national banking came at the expense of state banking—the number of state banks dwindled from 1,466 in 1863 to 247 in 1868.[citation needed] Though state banks were no longer allowed to issue notes, local bankers took advantage of less strict capital requirements ($10,000 for state banks vs. $50,000–200,000 for national banks) and opened new branches en masse. These new state banks then served as competition for national banks, growing to 15,526 in number by 1913.[citation needed] The years leading up to the passing of the 10% tax on banknotes consisted of events surrounding the National Banking Act of 1864. During this time period, Hugh McCulloch was determined to "fight against the national banking legislation, which he rightly perceived as a threat to state-chartered banking. Although he tried to block the system's creation, he [McCulloch] was not determined to be its champion."[citation needed] Part of his plans to revamp this portion of the banking system included hiring a new staff, being hands-on with several aspects such as "personally evaluating applications for bank charters and consoled prospective bankers", and "assisting in the design of the new national bank notes, and arranged for their engraving, printing, and distribution." As an end result of McCulloch's efforts, many banks were just not willing to conform to his system of operations. This prompted Congress to pass "a 10 percent tax on the notes of state banks, signaling its determination that national banks would triumph and the state banks would fade away." A later act, passed on March 3, 1865, imposed a tax of 10 percent on the notes of state banks to take effect on July 1, 1866. Similar to previous taxes, this effectively forced all non-federal currency from circulation. It also resulted in the creation of demand deposit accounts, and encouraged banks to join the national system, increasing the number of national banks substantially.[3] Legacy[edit] The National Banking Acts served to create the (federal-state) dual structure that is now a defining characteristic of the U.S. banking system and economy. The Comptroller of the Currency continues to have significance in the U.S. economy and is responsible for administration and supervision of national banks as well as certain activities of bank subsidiaries (per the Gramm-Leach-Bliley Act of 1999).[3] In 2004 the Act was used by John D. Hawke, Jr., Comptroller of the Currency, to effectively bar state attorneys general from national bank oversight and regulatory roles. Many blame the resulting lack of oversight and regulation for the late-2000s recession, the bailout of the U.S. financial system and the subprime mortgage crisis.[12] See also[edit] Banks portal US banking law Cuomo v. Clearing House Ass'n, L.L.C. Notes[edit] ^ Dowd, Kevin (1992). "US Banking in the 'Free Banking' Period". In Dowd, Kevin (ed.). The Experience of Free Banking. ISBN 9780415048088. ^ Lincoln and the Founding of the National Banking System ^ a b c d Gale Encyclopedia of U.S. Economic History. Detroit: Gale, 2000. ^ ch. 142, 12 Stat. 532 ^ United States Congress. Resolution of January 17, 1863, No. 9. Washington D.C.: 1863 ^ ch. 73, 12 Stat. 709 ^ Backus, Charles K. (1878), The Contraction of the Currency, Chicago, Ill.: The Honest Money League of the Northwest – via Google Books ^ a b Grossman, Richard S. (2010), U.S. Banking History, Civil War to WWII, Economic History Services, archived from the original on 2012-09-01 ^ The North American (1891). Philadelphia and Popular Philadelphians. Philadelphia: The American Printing House. p. 67 – via Google Books. ^ a b Dieterle, David A.; Simmons, Katherine M. (2014). Government and the Economy: An Encyclopedia. ABC-CLIO. pp. 249–250. ISBN 9781440829048. Retrieved 15 May 2016. ^ Mason, James E. (2013). The Transformation of Commercial Banking in the United States, 1956-1991. Routledge. p. 24. ISBN 9781136747250. ^ Berner, Robert & Grow, Brian (October 9, 2008). "They Warned Us About the Mortgage Crisis". Business Week. Further reading[edit] Allen, Larry (2009). The Encyclopedia of Money (2nd ed.). Santa Barbara, CA: ABC-CLIO. pp. 298–299. ISBN 978-1598842517. Friedman, Milton; Schwartz, Anna J. (1963). A Monetary History of the United States, 1867–1960. pp. 3–7. ISBN 978-0691003542. Niven, John (1995). Samuel P. Chase: A Biography. New York: Oxford University Press. pp. 330–331. ISBN 978-0195046533. External links[edit] National-Bank Act as Amended, the Federal Reserve Act and Other Laws Relating to National Banks. February, 1920: Document compiled under the direction of the Comptroller of the Currency for the use of the Senate, providing dates of acts relating to national banks, 1863–1920, text of the acts and amendments, and indexes. An Act to Provide a National Currency, Secured by a Pledge of United States Bonds, and to Provide for the Circulation and Redemption Thereof, Act of June 3, 1864, National Bank Act of 1864, National Banking Act of 1864 An Act to Provide for a National Currency, Secured by a Pledge of United States Stocks, and to Provide for the Circulation and Redemption Thereof, Act of February 25, 1863, National Bank Act, National Banking Act, National Currency Act The Library of Congress History of the Office of the Comptroller of the Currency History of banking at About.com v t e Bank regulation in the United States Federal authorities Consumer Financial Protection Bureau Farm Credit Administration Federal Deposit Insurance Corporation Federal Financial Institutions Examination Council Federal Housing Finance Agency Federal Reserve Board of Governors Financial Stability Oversight Council National Credit Union Administration Office of the Comptroller of the Currency Major federal legislation Independent Treasury Act National Bank Act Federal Reserve Act McFadden Act 1933 Banking Act Glass–Steagall Act Federal Credit Union Act Bank Holding Company Act Interest Rate Control Act of 1966 Truth in Lending Act Bank Secrecy Act Fair Credit Reporting Act Home Mortgage Disclosure Act Community Reinvestment Act Electronic Fund Transfer Act Financial Institutions Regulatory and Interest Rate Control Act of 1978 Monetary Control Act Depository Institutions Act Competitive Equality Banking Act of 1987 FIRREA FDICIA Truth in Savings Act Riegle-Neal IBBEA Gramm–Leach–Bliley Act Fair and Accurate Credit Transactions Act Emergency Economic Stabilization Act Credit CARD Act Dodd-Frank Federal Reserve Board regulations Extensions of Credit by Federal Reserve Banks (Reg A) Equal Credit Opportunity (Reg B) Home Mortgage Disclosure (Reg C) Reserve Requirements for Depository Institutions (Reg D) Electronic Fund Transfer (Reg E) Limitations on Interbank Liabilities (Reg F) International Banking Operations (Reg K) Consumer Leasing (Reg M) Loans to Insiders (Reg O) Privacy of Consumer Financial Information (Reg P) Prohibition Against the Paying of Interest on Demand Deposits (Reg Q) Credit by Brokers and Dealers (Reg T) Credit by Banks and Persons Other Than Brokers or Dealers for the Purpose of Purchasing or Carrying Margin Stock (Reg U) Transactions Between Member Banks and Their Affiliates (Reg W) Borrowers of Securities Credit (Reg X) Truth in Lending (Reg Z) Unfair or Deceptive Acts or Practices (Reg AA) Community Reinvestment (Reg BB) Availability of Funds and Collection of Checks (Reg CC) Truth in Savings (Reg DD) Types of bank charter Credit union Federal savings association National bank State bank State authorities California Colorado Florida Illinois Maryland Michigan New Jersey New York Ohio Oklahoma Oregon Pennsylvania Tennessee Virginia Terms Call report CAEL Rating CAMELS rating system Thrift Financial Report Other topics Banking in the United States Fair debt collection History of central banking in the United States Wildcat banking Category Economics portal Banks portal v t e Federal Reserve System Federal Open Market Committee (FOMC) Chair Vice Chair Governors Federal Reserve Banks Banknotes Federal Reserve Note Federal Reserve Bank Note Reports Beige Book Federal Reserve Statistical Release Monetary Policy Report to the Congress Federal funds Discount window Bank rate Federal funds Federal funds rate Overnight rate Primary dealer History (Antecedents) 1914–1939 Aldrich–Vreeland Act (1908) Federal Reserve Act (1913) Pittman Act (1918) Post–World War I recession (1918–1919) 1920–1921 depression Roaring Twenties (1921–1929) Wall Street Crash of 1929 Great Depression (1929–1933) Regulation D (c. 1930) Panic of 1930 Emergency Banking Act (1933) Regulation Q (1933) Glass–Steagall Act (1933) Gold Reserve Act (1934) 1937–1938 recession 1945–1973 Bretton Woods system (1944–1971) Employment Act of 1946 1949 recession U.S. Treasury Department Accord (1951) 1953 recession Bank Holding Company Act (1956) 1958 recession 1960–1961 recession FOMC actions (1961–present) Kennedy Slide of 1962 Truth in Lending Act (1968) 1969–1970 recession Nixon shock (1971) Smithsonian Agreement (1971) 1973–1982 1973–1974 stock market crash 1973–1975 recession Equal Credit Opportunity Act (1974) Home Mortgage Disclosure Act (1975) Community Reinvestment Act (1977) Federal Reserve Reform Act (1977) Electronic Fund Transfer Act (1978) Humphrey–Hawkins Full Employment Act (1978) DIDMC Act (1980) Early 1980s recession (1980; 1981–1982) Federal Reserve v. Investment Co. Institute (1981) 1982–2007 Northeast Bancorp v. Federal Reserve (1985) Savings and loan crisis (1986–1995) Black Monday (1987) Greenspan put Expedited Funds Availability Act (1987) FIRRE Act (1989) Friday the 13th mini-crash (1989) Early 1990s recession (1990–1991) FDIC Improvement Act (1991) 1990s U.S. economic expansion (1991–2001) Dot-com bubble (1994–2004) 1997 mini-crash Gramm–Leach–Bliley Act (1999) 2001 recession 9/11 stock market crash (2001) 2002 stock market downturn U.S. housing market correction (2006–2007) 2007– Great Recession (2007–2009) 2007–2009 U.S. bear market 2007–2008 financial crisis Subprime mortgage crisis responses (2007–2010) Emergency Economic Stabilization Act (2008) Unfair or Deceptive Acts or Practices (2008) Commercial Paper Funding Facility (2008–2010) Primary Dealer Credit Facility (2008–2010) Bloomberg v. Federal Reserve (2009) 2009 Supervisory Capital Assessment Program Term Asset-Backed Securities Loan Facility (2009–2010) Public–Private Investment Program for Legacy Assets (2009–) 2010 flash crash Dodd–Frank Act (2010) August 2011 stock markets fall 2015–2016 stock market selloff COVID-19 economic impact (2020) 2020 stock market crash Commercial Paper Funding Facility (2020–2021) Chairs Charles S. Hamlin (1914–1916) William P. G. Harding (1916–1922) Daniel R. Crissinger (1923–1927) Roy A. Young (1927–1930) Eugene Meyer (1930–1933) Eugene R. Black (1933–1934) Marriner S. Eccles (1934–1948) Thomas B. McCabe (1948–1951) William M. Martin (1951–1970) Arthur F. Burns (1970–1978) G. William Miller (1978–1979) Paul Volcker (1979–1987) Alan Greenspan (1987–2006) Ben Bernanke (2006–2014) Janet Yellen (2014–2018) Jerome Powell (2018–present) Current governors Jerome Powell (Chair) Richard Clarida (Vice Chair) Randal Quarles (Vice Chair for Supervision) Lael Brainard Michelle Bowman Christopher Waller 1 seat vacant Current presidents (by district) Eric S. Rosengren (Boston) John C. Williams (New York) Patrick T. Harker (Philadelphia) Loretta J. Mester (Cleveland) Thomas Barkin (Richmond) Raphael Bostic (Atlanta) Charles L. Evans (Chicago) James B. Bullard (St. Louis) Neel Kashkari (Minneapolis) Esther George (Kansas City) Robert Steven Kaplan (Dallas) Mary C. Daly (San Francisco) Related Central bank Criticism of the Federal Reserve Fed model Fedspeak Retrieved from "https://en.wikipedia.org/w/index.php?title=National_Bank_Act&oldid=1037574408" Categories: 1863 in American politics 1863 in law 37th United States Congress United States federal banking legislation Hidden categories: Articles with short description Short description is different from Wikidata All articles with unsourced statements Articles with unsourced statements from March 2013 Articles with unsourced statements from August 2013 Articles with unsourced statements from October 2019 Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Português Русский Svenska Edit links This page was last edited on 7 August 2021, at 11:38 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-2551 ---- Etsu Inagaki Sugimoto - Wikipedia Etsu Inagaki Sugimoto From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Etsu Inagaki Sugimoto" – news · newspapers · books · scholar · JSTOR (September 2014) (Learn how and when to remove this template message) A photograph of Sugimoto from A Daughter of the Samurai, published 1925 Etsuko Sugimoto (杉本 鉞子, Sugimoto Etsuko, 1874 – June 20, 1950), also known as Etsu Inagaki Sugimoto, was a Japanese American autobiographer and novelist.[1] She was born Nagaoka in Echigo Province (which means "Behind the Mountains")[2] in Japan, now part of Niigata Prefecture. Her father had once been a high-ranking samurai official in Nagaoka, but with the breakdown of the feudal system shortly before her birth, the economic situation of her family took a turn for the worse. Although originally destined to be a priestess, she became engaged, through an arranged marriage, to a Japanese merchant living in Cincinnati, Ohio. Etsu attended a Methodist school in Tokyo in preparation for her life in the USA, and became a Christian. In 1898 she journeyed to the USA, where she married her fiancé and became mother of two daughters. After her husband's death she returned to Japan, but later went back to the United States to complete the education of her daughters there. Later she lived in New York City, where she turned to literature and taught Japanese language, culture and history at Columbia University. She also wrote for newspapers and magazines. She died in 1950. Works[edit] Sugimoto's signature A Daughter of the Samurai (1925) With Taro and Hana in Japan (in cooperation with Nancy Virginia Austen 1926-09-23) A Daughter of the Narikin (1932) In memoriam: Florence Mills Wilson (1933) A Daughter of the Nohfu (1935) Grandmother O Kyo (1940) But the Ships Are Sailing (1959, by Etsu's daughter Chiyono Sugimoto Kiyooka; the work contains biographical details of the last years of Etsu Sugimoto's life) References[edit] ^ Huang, Guiyou (2001). Asian American Autobiographers: A Bio-Bibliographical Critical Sourcebook. Greenwood. p. 329. ISBN 9780313314087. ^ Sugimoto, Etsu (1925). A Daughter of the Samurai . p. 2. ISBN 9780313314087 – via Wikisource. Authority control General Integrated Authority File (Germany) ISNI 1 VIAF 1 WorldCat National libraries United States Japan Czech Republic Netherlands Poland Scientific databases CiNii (Japan) Other Faceted Application of Subject Terminology Social Networks and Archival Context SUDOC (France) 1 This article about a Japanese writer, poet, or screenwriter is a stub. You can help Wikipedia by expanding it. v t e This Asian American–related article is a stub. You can help Wikipedia by expanding it. v t e Retrieved from "https://en.wikipedia.org/w/index.php?title=Etsu_Inagaki_Sugimoto&oldid=1038493154" Categories: Japanese women writers 20th-century Japanese novelists 1874 births 1950 deaths 20th-century American novelists American women writers American writers of Japanese descent English-language writers from Japan Japanese emigrants to the United States American novelists of Asian descent American women novelists Columbia University faculty 20th-century American women writers People from Nagaoka, Niigata American women academics Converts to Christianity Japanese writer stubs Asian American stubs Hidden categories: Articles needing additional references from September 2014 All articles needing additional references Articles containing Japanese-language text Wikipedia articles with GND identifiers Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with NDL identifiers Wikipedia articles with NKC identifiers Wikipedia articles with NTA identifiers Wikipedia articles with PLWABN identifiers Wikipedia articles with CINII identifiers Wikipedia articles with FAST identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with WORLDCATID identifiers All stub articles Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Wikisource Languages العربية Deutsch Français 日本語 Edit links This page was last edited on 12 August 2021, at 21:58 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-2580 ---- Jacques Maritain - Wikipedia Jacques Maritain From Wikipedia, the free encyclopedia Jump to navigation Jump to search French philosopher This article includes a list of general references, but it remains largely unverified because it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (November 2010) (Learn how and when to remove this template message) Jacques Maritain Maritain in the 1930s Born (1882-11-18)18 November 1882 Paris, France Died 28 April 1973(1973-04-28) (aged 90) Toulouse, France Alma mater University of Paris Spouse(s) Raïssa Maritain (m. 1904; died 1960) Era 20th-century philosophy Region Western philosophy School Existential Thomism Main interests Philosophy of religion political theory philosophy of science metaphysics Influences Thomas Aquinas Aristotle Charles Baudelaire Étienne Gilson Charles Maurras John of St. Thomas Influenced Mortimer J. Adler Yves Congar Jean Daujat John Haddox Ivan Illich John F. X. Knasas Emmanuel Mounier[1] Yves Simon Part of a series on Christian democracy Organizations List of Christian democratic parties Centrist Democrat International Christian Democrat Organization of America European People's Party European Christian Political Movement Konrad Adenauer Foundation Conservative Christian Fellowship Centre for European Studies Center for Public Justice Ideas Catholic social teaching Christian corporatism Christian ethics Communitarianism Consistent life ethic Cultural mandate Culture of life Dignity of labor Distributism Gremialismo Just war theory Liberation theology Neo-Calvinism Neo-scholasticism Popolarismo Progressive conservatism Social conservatism Social democracy Social Gospel Social market economy Solidarity Sphere sovereignty Stewardship Subsidiarity Welfare / Welfare state Documents Rerum novarum Kuyper's Stone Lectures on Calvinism Graves de communi re Quadragesimo anno Laborem exercens Sollicitudo rei socialis Centesimus annus Laudato si' People Guillaume Groen van Prinsterer Herman Dooyeweerd Konrad Adenauer Giulio Andreotti Alcide De Gasperi Eduardo Frei Montalva Keith Joseph Wilhelm Emmanuel von Ketteler Helmut Kohl Abraham Kuyper Pope Leo XIII Jacques Maritain Pope Pius XI Robert Schuman Luigi Sturzo José María Arizmendiarrieta Related topics Christian left Christian anarchism Christian communism Christian socialism Christian right Christian libertarianism Christian nationalism Theoconservatism Liberal democracy Religious democracy Buddhist Islamic Jewish Mormon Social democracy Ethical socialism Politics portal Christianity portal v t e Part of a series on Catholic philosophy Aquinas, Scotus, and Ockham Ethics Cardinal virtues Just price Just war Probabilism Natural law Personalism Social teaching Virtue ethics Schools Augustinianism Cartesianism Molinism Occamism Salamanca Scholasticism Neo-scholasticism Scotism Thomism Philosophers Ancient Ambrose Athanasius the Great Augustine of Hippo Clement of Alexandria Cyprian of Carthage Cyril of Alexandria Gregory of Nyssa Irenaeus of Lyons Jerome John Chrysostom John of Damascus Justin Martyr Origen Paul the Apostle Tertullian Postclassical Pseudo-Dionysius Boethius Isidore of Seville Scotus Eriugena Bede Anselm of Canterbury Hildegard of Bingen Peter Abelard Symeon the New Theologian Bernard of Clairvaux Hugh of Saint Victor Thomas Aquinas Benedict of Nursia Pope Gregory I Peter Lombard Bonaventure Albertus Magnus Duns Scotus Roger Bacon Giles of Rome James of Viterbo Giambattista Vico Gregory of Rimini William of Ockham Catherine of Siena Paul of Venice Modern Baltasar Gracián Erasmus of Rotterdam Thomas Cajetan Nicholas of Cusa Luis de Molina Teresa of Ávila Thomas More Francis de Sales Francisco de Vitoria Domingo de Soto Martín de Azpilcueta Tomás de Mercado Antoine Arnauld René Descartes Robert Bellarmine Ignacy Krasicki Hugo Kołłątaj François Fénelon Alphonsus Liguori Nicolas Malebranche Blaise Pascal Francisco Suárez Giovanni Botero Félicité de La Mennais Antonio Rosmini John Henry Newman Contemporary Pope Benedict XVI Pope John Paul II G. E. M. Anscombe Hans Urs von Balthasar Maurice Blondel G. K. Chesterton Yves Congar Henri de Lubac John Finnis Reginald Garrigou-Lagrange Étienne Gilson René Girard Nicolás Gómez Dávila Romano Guardini John Haldane Dietrich von Hildebrand Bernard Lonergan Marshall McLuhan Alasdair MacIntyre Gabriel Marcel Jean-Luc Marion Jacques Maritain Emmanuel Mounier Josef Pieper Karl Rahner Edith Stein Charles Taylor Catholicism portal Philosophy portal v t e Jacques Maritain (French: [maʁitɛ̃]; 18 November 1882 – 28 April 1973) was a French Catholic philosopher. Raised Protestant, he was agnostic before converting to Catholicism in 1906. An author of more than 60 books, he helped to revive Thomas Aquinas for modern times, and was influential in the development and drafting of the Universal Declaration of Human Rights. Pope Paul VI presented his "Message to Men of Thought and of Science" at the close of Vatican II to Maritain, his long-time friend and mentor. The same pope had seriously considered making him a lay cardinal, but Maritain rejected it.[2] Maritain's interest and works spanned many aspects of philosophy, including aesthetics, political theory, philosophy of science, metaphysics, the nature of education, liturgy and ecclesiology. Contents 1 Life 2 Sainthood cause 3 Work 4 Metaphysics and epistemology 5 Ethics 6 Political theory 6.1 Integral Humanism 6.2 Criticism 7 Sayings 8 Writings 8.1 Significant works in English 8.2 Other works in English 8.3 Original works in French 9 See also 10 Notes 11 References 12 Further reading 13 External links Life[edit] Maritain was born in Paris, the son of Paul Maritain, who was a lawyer, and his wife Geneviève Favre, the daughter of Jules Favre, and was reared in a liberal Protestant milieu. He was sent to the Lycée Henri-IV. Later, he attended the Sorbonne, studying the natural sciences: chemistry, biology and physics. At the Sorbonne, he met Raïssa Oumançoff, a Russian Jewish émigré. They married in 1904. A noted poet and mystic, she participated as his intellectual partner in his search for truth. Raïssa's sister, Vera Oumançoff, lived with Jacques and Raïssa for almost all their married life. At the Sorbonne, Jacques and Raïssa soon became disenchanted with scientism, which could not, in their view, address the larger existential issues of life. In 1901, in light of this disillusionment, they made a pact to commit suicide together if they could not discover some deeper meaning to life within a year. They were spared from following through on this because, at the urging of Charles Péguy, they attended the lectures of Henri Bergson at the Collège de France. Bergson's critique of scientism dissolved their intellectual despair and instilled in them "the sense of the absolute." Then, through the influence of Léon Bloy, they converted to the Catholic faith in 1906.[3] In the fall of 1907 the Maritains moved to Heidelberg, where Jacques studied biology under Hans Driesch. Hans Driesch's theory of neo-vitalism attracted Jacques because of its affinity with Henri Bergson. During this time, Raïssa fell ill, and during her convalescence, their spiritual advisor, a Dominican friar named Humbert Clérissac, introduced her to the writings of Thomas Aquinas. She read them with enthusiasm and, in turn, exhorted her husband to examine the saint's writings. In Thomas, Maritain found a number of insights and ideas that he had believed all along. He wrote: Thenceforth, in affirming to myself, without chicanery or diminution, the authentic value of the reality of our human instruments of knowledge, I was already a Thomist without knowing it ... When several months later I came to the Summa Theologiae, I would construct no impediment to its luminous flood. From the Angelic Doctor (the honorary title of Aquinas), he was led to "The Philosopher", as Aquinas called Aristotle. Still later, to further his intellectual development, he read the neo-Thomists. Beginning in 1912, Maritain taught at the Collège Stanislas. He later moved to the Institut Catholique de Paris. For the 1916–1917 academic year, he taught at the Petit Séminaire de Versailles. In 1930 Maritain and Étienne Gilson received honorary doctorates in philosophy from the Pontifical University of Saint Thomas Aquinas, Angelicum.[4] In 1933, he gave his first lectures in North America in Toronto at the Pontifical Institute of Mediaeval Studies. He also taught at Columbia University; at the Committee on Social Thought, University of Chicago; at the University of Notre Dame, and at Princeton University. From 1945 to 1948, he was the French ambassador to the Holy See. Afterwards, he returned to Princeton University where he achieved the "Elysian status" (as he put it) of a professor emeritus in 1956. Raïssa Maritain died in 1960. After her death, Jacques published her journal under the title "Raïssa's Journal." For several years Maritain was an honorary chairman of the Congress for Cultural Freedom, appearing as a keynote speaker at its 1960 conference in Berlin.[5] From 1961, Maritain lived with the Little Brothers of Jesus in Toulouse, France. He had an influence on the order since its foundation in 1933. He became a Little Brother in 1970.[6] In a 1938 interview published by the Commonweal magazine, they asked if he was a freemason. Maritain replied: That question offends me, for I should have a horror of belonging to Freemasonry. So much the worse for well-intentioned people whose anxiety and need for explanations would have been satisfied by believing me to be one.[7] Tomb of Raïssa and Jacques Maritain Jacques and Raïssa Maritain are buried in the cemetery of Kolbsheim, a little French village in Alsace where he had spent many summers at the estate of his friends, Antoinette and Alexander Grunelius.[8] Sainthood cause[edit] A cause for beatification of him and his wife Raïssa is being planned.[9] Work[edit] The foundation of Maritain's thought is Aristotle, Aquinas, and the Thomistic commentators, especially John of St. Thomas. He is eclectic in his use of these sources. Maritain's philosophy is based on evidence accrued by the senses and acquired by an understanding of first principles. Maritain defended philosophy as a science against those who would degrade it and promoted philosophy as the "queen of sciences". In 1910, Jacques Maritain completed his first contribution to modern philosophy, a 28-page article titled, "Reason and Modern Science" published in Revue de Philosophie (June issue). In it, he warned that science was becoming a divinity, its methodology usurping the role of reason and philosophy. Science was supplanting the humanities in importance.[10] In 1917, a committee of French bishops commissioned Jacques to write a series of textbooks to be used in Catholic colleges and seminaries. He wrote and completed only one of these projects, titled Elements de Philosophie (Introduction of Philosophy) in 1920. It has been a standard text ever since in many Catholic seminaries. He wrote in his introduction: If the philosophy of Aristotle, as revived and enriched by Thomas Aquinas and his school, may rightly be called the Christian philosophy, both because the church is never weary of putting it forward as the only true philosophy and because it harmonizes perfectly with the truths of faith, nevertheless it is proposed here for the reader's acceptance not because it is Christian, but because it is demonstrably true. This agreement between a philosophic system founded by a pagan and the dogmas of revelation is no doubt an external sign, an extra-philosophic guarantee of its truth; but from its own rational evidence, that it derives its authority as a philosophy During the Second World War, Jacques Maritain protested the policies of the Vichy government while teaching at the Pontifical Institute for Medieval Studies in Canada. "Moving to New York, Maritain became deeply involved in rescue activities, seeking to bring persecuted and threatened academics, many of them Jews, to America. He was instrumental in founding the École Libre des Hautes Études, a kind of university in exile that was, at the same time, the center of Gaullist resistance in the United States". After the war, in a papal audience on 16 July 1946, he tried unsuccessfully to have Pope Pius XII officially denounce anti-semitism.[11] Many of his American papers are held by the University of Notre Dame, which established The Jacques Maritain Center in 1957. The Cercle d'Etudes Jacques & Raïssa Maritain is an association founded by the philosopher himself in 1962 in Kolbsheim (near Strasbourg, France), where the couple is also buried. The purpose of these centers is to encourage study and research of Maritain's thought and expand upon them. It is also absorbed in translating and editing his writings. Metaphysics and epistemology[edit] Maritain's philosophy is based on the view that metaphysics is prior to epistemology. Being is first apprehended implicitly in sense experience, and is known in two ways. First, being is known reflexively by abstraction from sense experience. One experiences a particular being, e.g. a cup, a dog, etc. and through reflexion ("bending back") on the judgement, e.g. "this is a dog", one recognizes that the object in question is an existent. Second, in light of attaining being reflexively through apprehension of sense experience one may arrive at what Maritain calls "an Intuition of Being". For Maritain this is the point of departure for metaphysics; without the intuition of being one cannot be a metaphysician at all. The intuition of being involves rising to the apprehension of ens secundum quod est ens (being insofar as it is a being). In Existence and the Existent he explains: "It is being, attained or perceived at the summit of an abstractive intellection, of an eidetic or intensive visualization which owes its purity and power of illumination only to the fact that the intellect, one day, was stirred to its depths and trans-illuminated by the impact of the act of existing apprehended in things, and because it was quickened to the point of receiving this act, or hearkening to it, within itself, in the intelligible and super-intelligible integrity of the tone particular to it." (p. 20) In view of this priority given to metaphysics, Maritain advocates an epistemology he calls "Critical Realism". Maritain's epistemology is not "critical" in Kant's sense, which held that one could only know anything after undertaking a thorough critique of one's cognitive abilities. Rather, it is critical in the sense that it is not a naive or non-philosophical realism, but one that is defended by way of reason. Against Kant's critical project Maritain argues that epistemology is reflexive; you can only defend a theory of knowledge in light of knowledge you have already attained. Consequently, the critical question is not the question of modern philosophy – how do we pass from what is perceived to what is. Rather, "Since the mind, from the very start, reveals itself as warranted in its certitude by things and measured by an esse[clarification needed] independent of itself, how are we to judge if, how, on what conditions, and to what extent it is so both in principle and in the various moments of knowledge?" In contrast idealism inevitably ends up in contradiction, since it does not recognize the universal scope of the first principles of identity, contradiction, and finality. These become merely laws of thought or language, but not of being, which opens the way to contradictions being instantiated in reality. Maritain's metaphysics ascends from this account of being to a critique of the philosophical aspects of modern science, through analogy to an account of the existence and nature of God as it is known philosophically and through mystical experience. Ethics[edit] Maritain was a strong defender of a natural law ethics. He viewed ethical norms as being rooted in human nature. For Maritain the natural law is known primarily, not through philosophical argument and demonstration, but rather through "Connaturality". Connatural knowledge is a kind of knowledge by acquaintance. We know the natural law through our direct acquaintance with it in our human experience. Of central importance, is Maritain's argument that natural rights are rooted in the natural law. This was key to his involvement in the drafting of the UN's Universal Declaration of Human Rights. Another important aspect of his ethics was his insistence upon the need for moral philosophy to be conducted in a theological context. While a Christian could engage in speculative thought about nature or metaphysics in a purely rational manner and develop an adequate philosophy of nature of metaphysics, this is not possible with ethics. Moral philosophy must address the actual state of the human person, and this is a person in a state of grace. Thus, "moral philosophy adequately considered" must take into account properly theological truths. It would be impossible, for instance, to develop an adequate moral philosophy without giving consideration to properly theological facts such as original sin and the supernatural end of the human person in beatitude. Any moral philosophy that does not take into account these realities that are only known through faith would be fundamentally incomplete.[12] Political theory[edit] Maritain corresponded with, and was a friend of[13] the American radical community organizer Saul Alinsky[14] and French Prime Minister Robert Schuman.[15] In the study The Radical Vision of Saul Alinsky, author P. David Finks noted that "For years Jacques Maritain had spoken approvingly to Montini of the democratic community organizations built by Saul Alinsky". Accordingly, in 1958 Maritain arranged for a series of meetings between Alinsky and Archbishop Montini in Milan. Before the meetings, Maritain had written to Alinsky: "the new cardinal was reading Saul’s books and would contact him soon".[16] In an interview from 2016, Pope Francis praised Maritain among a small list of French liberal thinkers.[17] Integral Humanism[edit] Part of a series on Christian democracy Organizations List of Christian democratic parties Centrist Democrat International Christian Democrat Organization of America European People's Party European Christian Political Movement Konrad Adenauer Foundation Conservative Christian Fellowship Centre for European Studies Center for Public Justice Ideas Catholic social teaching Christian corporatism Christian ethics Communitarianism Consistent life ethic Cultural mandate Culture of life Dignity of labor Distributism Gremialismo Just war theory Liberation theology Neo-Calvinism Neo-scholasticism Popolarismo Progressive conservatism Social conservatism Social democracy Social Gospel Social market economy Solidarity Sphere sovereignty Stewardship Subsidiarity Welfare / Welfare state Documents Rerum novarum Kuyper's Stone Lectures on Calvinism Graves de communi re Quadragesimo anno Laborem exercens Sollicitudo rei socialis Centesimus annus Laudato si' People Guillaume Groen van Prinsterer Herman Dooyeweerd Konrad Adenauer Giulio Andreotti Alcide De Gasperi Eduardo Frei Montalva Keith Joseph Wilhelm Emmanuel von Ketteler Helmut Kohl Abraham Kuyper Pope Leo XIII Jacques Maritain Pope Pius XI Robert Schuman Luigi Sturzo José María Arizmendiarrieta Related topics Christian left Christian anarchism Christian communism Christian socialism Christian right Christian libertarianism Christian nationalism Theoconservatism Liberal democracy Religious democracy Buddhist Islamic Jewish Mormon Social democracy Ethical socialism Politics portal Christianity portal v t e Maritain advocated what he called "Integral Humanism" (or "Integral Christian Humanism").[18] He argued that secular forms of humanism were inevitably anti-human in that they refused to recognize the whole person. Once the spiritual dimension of human nature is rejected, we no longer have an integral, but merely partial humanism, one which rejects a fundamental aspect of the human person. Accordingly, in Integral Humanism he explores the prospects for a new Christendom, rooted in his philosophical pluralism, in order to find ways Christianity could inform political discourse and policy in a pluralistic age. In this account he develops a theory of cooperation, to show how people of different intellectual positions can nevertheless cooperate to achieve common practical aims. Maritain's political theory was extremely influential, and was a primary source behind the Christian Democratic movement. Criticism[edit] Major criticisms of Maritain have included: Santiago Ramírez[who?] argued that Maritain's moral philosophy adequately considered could not be distinguished in any meaningful way from moral theology as such.[19] Tracey Rowland, a theologian at the University of Notre Dame (Australia) has argued that the lack of a fully developed philosophy of culture in Maritain and others (notably Rahner) was responsible for an inadequate notion of culture in the documents of Vatican II and thereby for much of the misapplication of the conciliar texts in the life of the church following the council.[20] Maritain's political theory has been criticized for a democratic pluralism that appeals to something very similar to the later liberal philosopher John Rawls' conception of an overlapping consensus of reasonable views. It is argued that such a view illegitimately presupposes the necessity of pluralistic conceptions of the human good.[21] Sayings[edit] "Vae mihi si non Thomistizavero" [Woe to me if I do not Thomisticize].[22] "Je n’adore que Dieu" [I adore only God]. "The artist pours out his creative spirit into a work; the philosopher measures his knowing spirit by the real." "I do not know if Saul Alinsky knows God. But I assure you that God knows Saul Alinsky." "We do not need a truth to serve us, we need a truth that we can serve" Writings[edit] Significant works in English[edit] Introduction to Philosophy, Christian Classics, Inc., Westminster, MD, 1st. 1930, 1991. The Degrees of Knowledge, orig. 1932 Integral Humanism, orig. 1936 An Introduction to Logic (1937) A Preface To Metaphysics (1939) (1939) Education at the Crossroads, engl. 1942 The Person and the Common Good, fr. 1947 Art and Scholasticism with other essays, Sheed and Ward, London, 1947 Existence and the Existent, (fr. 1947) trans. by Lewis Galantiere and Gerald B. Phelan, Image Books division of Doubleday & Co., Inc., Garden City, NY, 1948, Image book, 1956. ISBN 978-0-8371-8078-6 Philosophy of Nature (1951) The Range of Reason, engl. 1952 Approaches to God, engl. 1954 Creative Intuition in Art and Poetry, engl. 1953 Man and The State, (orig.) University of Chicago Press, Chicago, ILL, 1951. A Preface to Metaphysics, engl. 1962 God and the Permission of Evil, trans. Joseph W. Evans, The Bruce Publishing Company, Milwaukee, WI, 1966 (orig. 1963). Moral Philosophy, 1964 The Peasant of the Garonne, An Old Layman Questions Himself about the Present Time, trans. Michael Cuddihy and Elizabeth Hughes, Holt, Rinehart and Winston, NY, 1968; orig. 1966. The Education of Man, The Educational Philosophy of Jacques Maritain., ed. D./I. Gallagher, Notre Dame/Ind. 1967 Other works in English[edit] Religion and Culture (1931) The Things that are Not Caesar's (1931) Theonas; Conversations of a Sage (1933) Freedom in the Modern World (1935) True Humanism (1938) (Integral Humanism, 1968) A Christian Looks at the Jewish Question (1939) The Twilight of Civilization (1939) Scholasticism and Politics, New York 1940 Science and Wisdom (1940) Religion and the Modern World (1941) France, My Country Through the Disaster (1941) The Living Thoughts of St. Paul (1941) France, My Country, Through the Disaster (1941) Ransoming the Time (1941) Christian Humanism (1942) Saint Thomas and the problem of evil, Milwaukee 1942; Essays in Thomism, New York 1942; The Rights of Man and Natural Law (1943) Prayer and Intelligence (1943) Give John a Sword (1944) The Dream of Descartes (1944) Christianity and Democracy (1944) Messages 1941–1944, New York 1945; A Faith to Live by (1947) The Person and the Common Good (1947) Art & Faith (with Jean Cocteau 1951) The Pluralist Principle in Democracy (1952) Creative Intuition in Art and History (1953) An Essay on Christian Philosophy (1955) The Situation of Poetry with Raïssa Maritain, 1955) Bergsonian Philosophy (1955) Reflections on America (1958) St. Thomas Aquinas (1958) The Degrees of Knowledge (1959) The Sin of the Angel: An Essay on a Re-interpretation of some Thomistic Positions (1959) Liturgy and Contemplation (1960) The Responsibility of the Artist (1960) On the Use of Philosophy (1961) God and the Permission of Evil (1966) Challenges and Renewals, ed. J.W. Evans/L.R. Ward, Notre Dame/Ind. 1966 On the Grace and Humanity of Jesus (1969) On the Church of Christ: The Person of the Church and her Personnel (1973) Notebooks (1984) Natural Law: reflections on theory and practice (ed. with Introductions and notes, by William Sweet), St. Augustine's Press [distributed by University of Chicago Press], 2001; Second printing, corrected, 2003. Original works in French[edit] La philosophie bergsonienne, 1914 (1948) Eléments de philosophie, 2 volumes, Paris 1920/23 Art et scolastique, 1920 Théonas ou les entretiens d’un sage et de deux philosophes sur diverses matières inégalement actuelles, Paris, Nouvelle librairie nationale, 1921 Antimoderne, Paris, Édition de la Revue des Jeunes, 1922 Réflexions sur l’intelligence et sur sa vie propre, Paris, Nouvelle librairie nationale, 1924. Trois réformateurs : Luther, Descartes, Rousseau, avec six portraits, Paris [Plon], 1925 Réponse à Jean Cocteau, 1926 Une opinion sur Charles Maurras et le devoir des catholiques, Paris [Plon], 1926 Primauté du spirituel, 1927 Pourquoi Rome a parlé (coll.), Paris, Spes, 1927 Quelques pages sur Léon Bloy, Paris 1927 Clairvoyance de Rome (coll.), Paris, Spes, 1929 Le docteur angélique, Paris, Paul Hartmann, 1929 Religion et culture, Paris, Desclée de Brouwer, 1930 (1946) Le thomisme et la civilisation, 1932 Distinguer pour unir ou Les degrés du savoir, Paris 1932 Le songe de Descartes, Suivi de quelques essais, Paris 1932 De la philosophie chrétienne, Paris, Desclée de Brouwer, 1933 Du régime temporel et de la liberté, Paris, DDB, 1933 Sept leçons sur l'être et les premiers principes de la raison spéculative, Paris 1934 Frontières de la poésie et autres essais, Paris 1935 La philosophie de la nature, Essai critique sur ses frontières et son objet, Paris 1935 (1948) Lettre sur l’indépendance, Paris, Desclée de Brouwer, 1935. Science et sagesse, Paris 1935 Humanisme intégral. Problèmes temporels et spirituels d'une nouvelle chrétienté; zunächst spanisch 1935), Paris (Fernand Aubier), 1936 (1947) Les Juifs parmi les nations, Paris, Cerf, 1938 Situation de la Poesie, 1938 Questions de conscience : essais et allocutions, Paris, Desclée de Brouwer, 1938 La personne humaine et la societé, Paris 1939 Le crépuscule de la civilisation, Paris, Éd. Les Nouvelles Lettres, 1939 Quattre essais sur l'ésprit dans sa condition charnelle, Paris 1939 (1956) De la justice politique, Notes sur le présente guerre, Paris 1940 A travers le désastre, New York 1941 (1946) Conféssion de foi, New York 1941 La pensée de St.Paul, New York 1941 (Paris 1947) Les Droits de l'Homme et la Loi naturelle, New York 1942 (Paris 1947) Christianisme et démocratie, New York 1943 (Paris 1945) Principes d'une politique humaniste, New York 1944 (Paris 1945); De Bergson à Thomas d'Aquin, Essais de Métaphysique et de Morale, New York 1944 (Paris 1947) A travers la victoire, Paris 1945; Pour la justice, Articles et discours 1940–1945, New York 1945; Le sort de l'homme, Neuchâtel 1945; Court traité de l'existence et de l'existant, Paris 1947; La personne et le bien commun, Paris 1947; Raison et raisons, Essais détachés, Paris 1948 La signification de l'athéisme contemporain, Paris 1949 Neuf leçons sur les notions premières de la philosophie morale, Paris 1951 Approaches de Dieu, Paris 1953. L'Homme et l'Etat (engl.: Man and State, 1951) Paris, PUF, 1953 Pour une philosophie de l'éducation, Paris 1959 Le philosophe dans la Cité, Paris 1960 La philosophie morale, Vol. I: Examen historique et critique des grands systèmes, Paris 1960 Dieu et la permission du mal, 1963 Carnet de notes, Paris, DDB, 1965 L'intuition créatrice dans l'art et dans la poésie, Paris, Desclée de Brouwer, 1966 (engl. 1953) Le paysan de la Garonne. Un vieux laïc s’interroge à propos du temps présent, Paris, DDB, 1966 De la grâce et de l'humanité de Jésus, 1967 De l'Église du Christ. La personne de l'église et son personnel, Paris 1970 Approaches sans entraves, posthum 1973. La loi naturelle ou loi non écrite, texte inédit, établi par Georges Brazzola. Fribourg, Suisse: Éditions universitaires, 1986. [Lectures on Natural Law. Tr. William Sweet. In The Collected Works of Jacques Maritain, Vol. VI, Notre Dame, IN: University of Notre Dame Press, (forthcoming).] Oeuvres complètes de Jacques et Raïssa Maritain, 16 Bde., 1982–1999. See also[edit] Personalism Notes[edit] ^ Deweer, Dries (2013). "The Political Theory of Personalism: Maritain and Mounier on Personhood and Citizenship" (PDF). International Journal of Philosophy and Theology. 74 (2): 115. doi:10.1080/21692327.2013.809869. ISSN 2169-2335. S2CID 153676163. ^ Donald DeMarco. "The Christian Personalism of Jacques Maritain". EWTN. Archived from the original on 5 December 2000. ^ Hanna 1996, p. 39 ^ Piero Viotto, Grandi amicizie: i Maritain e i loro contemporanei, 38, https://books.google.com/books?id=aonOg8KLOdIC&pg=PA38 Accessed 28 February 2016. Jean Leclercq, Di grazia in grazia: memorie, 60. https://books.google.com/books?id=jxKnMfTj81AC&pg=PA60 Accessed 28 February 2016 ^ "What was the Congress for Cultural Freedom?". www.newcriterion.com. ^ Picón, María Laura (2009). ""Jacques Maritain y los Pequeños Hermanos de Jesús"". Studium Filosofía y Teología (in Spanish). T.12, Fasc. 24: 403–414. ISSN 0329-8930. ^ "An Interview with Jacques Maritain | Commonweal Magazine". www.commonwealmagazine.org. Retrieved 21 November 2019. ^ The most comprehensive biography of the Maritians is: Jean-Luc Barre, "Jacques And Raissa Maritain: Beggars For Heaven", University of Notre Dame Press. ^ Beatification process for Jacques and Raissa Maritain could begin on YouTube (8 February 2011) ^ Hanna 1996, p. 40 ^ Richard Francis Crane (2011). "Heart-Rending Ambivalence: Jacques Maritain and the Complexity of Postwar Catholic Philosemitism". Studies in Christian-Jewish Relations. 6: 8–9. ^ Maritain, An Essay on Christian Philosophy, (NY: Philosophical Library, 1955), pp. 38 ff. ^ "Wolfe, C.J. "Lessons from the Friendship of Jacques Maritain with Saul Alinsky" he Catholic Social Science Review 16 (2011): 229–240" (PDF). Archived from the original (PDF) on 26 April 2014. ^ Doering, Bernard E. (1987). "Jacques Maritain and His Two Authentic Revolutionaries" (PDF). In Kennedy, Leonard A (ed.). Thomistic Papers. 3. Houston, Tex.: Center for Thomistic Studies. pp. 91–116. ISBN 0-268-01865-0. OCLC 17307550. ^ Fimister, Alan Paul (2008). Robert Schuman: Neo-Scholastic Humanism and the Reunification of Europe. p. 131. ISBN 978-90-5201-439-5. OCLC 244339575. ^ Ferrara, Christopher A. "Saul Alinsky and 'Saint' Pope Paul VI: Genesis of the Conciliar Surrender to the World". The Remnant Newspaper. Retrieved 21 November 2019. ^ "INTERVIEW Pope Francis". La Croix (in French). 17 May 2016. ISSN 0242-6056. Retrieved 21 November 2019. ^ Sweet, William (2019). "Jacques Maritain". The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University. ^ Denis J. M. Bradley. Aquinas on the Twofold Human Good: Reason and Human Happiness in Aquinas's Moral Science. Washington: The Catholic University of America Press, 1997. ^ Tracey Rowland, "Culture and the Thomist Tradition: After Vatican II" (Routledge Radical Orthodoxy) ^ Thaddeus J. Kozinski, The Political Problem of Religious Pluralism: And Why Philosophers Can't Solve It, (Lexington Books, 2013) ^ Maritain, Jacques (1946). St. Thomas Aquinas: Angel of the Schools. J. F. Scanlan (trans.). London: Sheed & Ward. p. viii. References[edit] G. B. Phelan, Jacques Maritain, NY, 1937. J.W. Evans in Catholic Encyclopaedia Vol XVI Supplement 1967–1974. Michael R. Marrus, "The Ambassador & The Pope; Pius XII, Jacques Maritain & the Jews", Commonweal, 22 October 2004 H. Bars, Maritain en notre temps, Paris, 1959. D. and I. Gallagher, The Achievement of Jacques and Raïssa Maritain: A Bibliography, 1906–1961, NY, 1962. J. W. Evans, ed., Jacques Maritain: The Man and His Achievement, NY, 1963. C. A. Fecher, The Philosophy of Jacques Maritain, Westminster, MD, 1963. Jude P. Dougherty, Jacques Maritain: An Intellectual Profile, Catholic University of America Press, 2003 Ralph McInerny, The Very Rich Hours of Jacques Maritain: A Spiritual Life, University of Notre Dame Press, 2003 Hanna, Martha (1996). The Mobilization of Intellect: French Scholars and Writers During the Great War. Harvard University Press. ISBN 0674577558. Further reading[edit] The Social and Political Philosophy of Jacques Maritain (1955) W. Herberg (ed.), Four Existentialist Theologians (1958) The Philosophy of Jacques Maritain (1953) Jacques Maritain, Antimodern or Ultramodern?: An Historical Analysis of His Critics, His Thought, and His Life (1974) External links[edit] Quotations related to Jacques Maritain at Wikiquote Études maritainiennes-Maritain Studies Maritain Center, Kolbsheim (in French) Cercle d'Etudes J. & R. Maritain at Kolbsheim (France). Jacques Maritain Center at the University of Notre Dame. Stanford Encyclopedia of Philosophy: Jacques Maritain by William Sweet. International Jacques Maritain Institute. どんな効果がある？ – 健康食品として知られるフコイダンとは of the primary and secondary literatures on Jacques Maritain. Works by or about Jacques Maritain in libraries (WorldCat catalog) Jacques Maritain, Man and the State (1951) v t e Aesthetics topics Philosophers Abhinavagupta Theodor W. Adorno Leon Battista Alberti Thomas Aquinas Hans Urs von Balthasar Alexander Gottlieb Baumgarten Clive Bell Bernard Bosanquet Edward Bullough R. G. Collingwood Ananda Coomaraswamy Arthur Danto John Dewey Denis Diderot Hubert Dreyfus Curt John Ducasse Thierry de Duve Roger Fry Nelson Goodman Clement Greenberg Georg Hegel Martin Heidegger David Hume Immanuel Kant Paul Klee Susanne Langer Theodor Lipps György Lukács Jean-François Lyotard Joseph Margolis Jacques Maritain Thomas Munro Friedrich Nietzsche José Ortega y Gasset Dewitt H. Parker Stephen Pepper David Prall Jacques Rancière Ayn Rand Louis Lavelle George Lansing Raymond I. A. Richards George Santayana Friedrich Schiller Arthur Schopenhauer Roger Scruton Irving Singer Rabindranath Tagore Giorgio Vasari Morris Weitz Johann Joachim Winckelmann Richard Wollheim more... Theories Classicism Evolutionary aesthetics Historicism Modernism New Classical Postmodernism Psychoanalytic theory Romanticism Symbolism more... Concepts Aesthetic emotions Aesthetic interpretation Art manifesto Avant-garde Axiology Beauty Boredom Camp Comedy Creativity Cuteness Disgust Ecstasy Elegance Entertainment Eroticism Fun Gaze Harmony Judgement Kama Kitsch Life imitating art Magnificence Mimesis Perception Quality Rasa Recreation Reverence Style Sthayibhava Sublime Taste Work of art Related Aesthetics of music Applied aesthetics Architecture Art Arts criticism Feminist aesthetics Gastronomy History of painting Humour Japanese aesthetics Literary merit Mathematical beauty Mathematics and architecture Mathematics and art Medieval aesthetics Music theory Neuroesthetics Painting Patterns in nature Philosophy of design Philosophy of film Philosophy of music Poetry Sculpture Theory of painting Theory of art Tragedy Visual arts Index Outline Category Philosophy portal v t e Social and political philosophy Ancient philosophers Aristotle Augustine Chanakya Cicero Confucius Han Fei Lactantius Laozi Mencius Mozi Origen Philo Plato Plutarch Polybius Shang Socrates Sun Tzu Tertullian Thucydides Valluvar Xenophon Xunzi Medieval philosophers Accursius Alpharabius Augustinus Triumphus Avempace Averroes Baldus Bartholomew Bartolus Bruni Dante Engelbert Gelasius al-Ghazali Giles Godfrey Gratian Gregory Hostiensis Ibn Khaldun Ibn Tufail John of Paris John of Salisbury Latini Maimonides Marsilius Nizam al-Mulk Photios Remigio Thomas Aquinas Wang William of Ockham Early modern philosophers Ammirato Beza Boétie Bodin Bossuet Botero Buchanan Calvin Cumberland Duplessis-Mornay Erasmus Filmer Grotius Guicciardini Harrington Hayashi Hobbes Hotman Huang James Leibniz Locke Luther Machiavelli Malebranche Mariana Milton Montaigne More Müntzer Naudé Pufendorf Rohan Sansovino Sidney Spinoza Suárez 18th–19th-century philosophers Bakunin Bentham Bolingbroke Bonald Bosanquet Burke Comte Condorcet Constant Cortés Emerson Engels Fichte Fourier Franklin Godwin Hamann Hegel Herbert Herder Hume Jefferson Justi Kant political philosophy Kierkegaard Le Bon Le Play Madison Maistre Marx Mazzini Mill Montesquieu Möser Nietzsche Novalis Paine Renan Rousseau Royce Sade Schiller Smith Spencer Spedalieri Stirner Taine Thoreau Tocqueville Vico Vivekananda Voltaire 20th–21st-century philosophers Adorno Ambedkar Arendt Aurobindo Aron Azurmendi Badiou Baudrillard Bauman Benoist Berlin Bernstein Butler Camus Chomsky De Beauvoir Debord Dewey Dmowski Du Bois Durkheim Dworkin Foucault Gandhi Gauthier Gehlen Gentile Gramsci Habermas Hayek Heidegger Irigaray Kautsky Kirk Koneczny Kropotkin Laclau Lenin Luxemburg Manent Mansfield Mao Marcuse Maritain Michels Mises Mou Mouffe Negri Niebuhr Nozick Nursî Oakeshott Ortega Pareto Pettit Plamenatz Polanyi Popper Qutb Radhakrishnan Rand Rawls Rothbard Russell Santayana Sartre Scanlon Schmitt Scruton Searle Shariati Shklar Simmel Simonović Skinner Sombart Sorel Spann Spooner Spirito Strauss Sun Taylor Tucker Walzer Weber Žižek Social theories Anarchism Authoritarianism Collectivism Communism Communitarianism Conflict theories Confucianism Consensus theory Conservatism Contractualism Cosmopolitanism Culturalism Fascism Feminist political theory Gandhism Hindu nationalism (Hindutva) Individualism Islam Islamism Legalism Liberalism Libertarianism Mohism National liberalism Republicanism Social constructionism Social constructivism Social Darwinism Social determinism Socialism Utilitarianism Related articles Jurisprudence Philosophy and economics Philosophy of education Philosophy of history Philosophy of love Philosophy of sex Philosophy of social science Political ethics Social epistemology Index Category v t e History of Catholic theology Key figures General History of the Catholic Church Timeline History of the papacy Papal primacy Ecumenical councils Catholic Bible Vulgate Biblical canon History of Christian theology Early Church Paul Clement of Rome First Epistle of Clement Didache Ignatius of Antioch Polycarp Epistle of Barnabas The Shepherd of Hermas Aristides of Athens Justin Martyr Epistle to Diognetus Irenaeus Montanism Tertullian Origen Antipope Novatian Cyprian Constantine to Pope Gregory I Eusebius Athanasius of Alexandria Arianism Pelagianism Nestorianism Monophysitism Ephrem the Syrian Hilary of Poitiers Cyril of Jerusalem Basil of Caesarea Gregory of Nazianzus Gregory of Nyssa Ambrose John Chrysostom Jerome Augustine of Hippo John Cassian Orosius Cyril of Alexandria Peter Chrysologus Pope Leo I Boethius Pseudo-Dionysius the Areopagite Pope Gregory I Early Middle Ages Isidore of Seville John Climacus Maximus the Confessor Monothelitism Ecthesis Bede John of Damascus Iconoclasm Transubstantiation dispute Predestination disputes Paulinus II of Aquileia Alcuin Benedict of Aniane Rabanus Maurus Paschasius Radbertus John Scotus Eriugena High Middle Ages Roscellinus Gregory of Narek Berengar of Tours Peter Damian Anselm of Canterbury Joachim of Fiore Peter Abelard Decretum Gratiani Bernard of Clairvaux Peter Lombard Anselm of Laon Hildegard of Bingen Hugh of Saint Victor Dominic de Guzmán Robert Grosseteste Francis of Assisi Anthony of Padua Beatrice of Nazareth Bonaventure Albertus Magnus Boetius of Dacia Henry of Ghent Thomas Aquinas Siger of Brabant Thomism Roger Bacon Mysticism and reforms Ramon Llull Duns Scotus Dante Alighieri William of Ockham Richard Rolle John of Ruusbroec Catherine of Siena Bridget of Sweden Meister Eckhart Johannes Tauler Walter Hilton The Cloud of Unknowing Heinrich Seuse Geert Groote Devotio Moderna Julian of Norwich Thomas à Kempis Nicholas of Cusa Marsilio Ficino Girolamo Savonarola Giovanni Pico della Mirandola Reformation Counter-Reformation Erasmus Thomas Cajetan Thomas More John Fisher Johann Eck Francisco de Vitoria Thomas of Villanova Ignatius of Loyola Francisco de Osuna John of Ávila Francis Xavier Teresa of Ávila Luis de León John of the Cross Peter Canisius Luis de Molina (Molinism) Robert Bellarmine Francisco Suárez Lawrence of Brindisi Francis de Sales Baroque period to French Revolution Tommaso Campanella Pierre de Bérulle Pierre Gassendi René Descartes Mary of Jesus of Ágreda António Vieira Jean-Jacques Olier Louis Thomassin Jacques-Bénigne Bossuet François Fénelon Cornelius Jansen (Jansenism) Blaise Pascal Nicolas Malebranche Giambattista Vico Alphonsus Liguori Louis de Montfort Maria Gaetana Agnesi Alfonso Muzzarelli Johann Michael Sailer Clement Mary Hofbauer Bruno Lanteri 19th century Joseph Görres Félicité de La Mennais Luigi Taparelli Antonio Rosmini Ignaz von Döllinger John Henry Newman Henri Lacordaire Jaime Balmes Gaetano Sanseverino Giovanni Maria Cornoldi Wilhelm Emmanuel Freiherr von Ketteler Giuseppe Pecci Joseph Hergenröther Tommaso Maria Zigliara Matthias Joseph Scheeben Émile Boutroux Modernism Neo-scholasticism Léon Bloy Désiré-Joseph Mercier Friedrich von Hügel Vladimir Solovyov Marie-Joseph Lagrange George Tyrrell Maurice Blondel Thérèse of Lisieux 20th century G. K. Chesterton Reginald Garrigou-Lagrange Joseph Maréchal Pierre Teilhard de Chardin Jacques Maritain Étienne Gilson Ronald Knox Dietrich von Hildebrand Gabriel Marcel Marie-Dominique Chenu Romano Guardini Edith Stein Fulton Sheen Henri de Lubac Daniel-Rops Jean Guitton Josemaría Escrivá Nouvelle théologie Karl Rahner Yves Congar Bernard Lonergan Emmanuel Mounier Jean Daniélou Hans Urs von Balthasar Alfred Delp Thomas Merton René Girard Johann Baptist Metz Jean Vanier Henri Nouwen 21st century Carlo Maria Martini Pope Benedict XVI Walter Kasper Raniero Cantalamessa Michał Heller Peter Kreeft Jean-Luc Marion Tomáš Halík Scott Hahn Catholicism portal Authority control General Integrated Authority File (Germany) ISNI 1 VIAF 1 WorldCat National libraries Norway Spain France (data) Catalonia Italy United States Latvia Japan Czech Republic Australia Greece Israel 2 3 Korea Croatia Netherlands Poland Vatican Art research institutes Artist Names (Getty) Scientific databases CiNii (Japan) Other Faceted Application of Subject Terminology MusicBrainz artist RERO (Switzerland) 1 2 Social Networks and Archival Context SUDOC (France) 1 Trove (Australia) 1 Retrieved from "https://en.wikipedia.org/w/index.php?title=Jacques_Maritain&oldid=1029580901" Categories: 1882 births 1973 deaths Writers from Paris Lycée Henri-IV alumni French political philosophers French Roman Catholic writers French Roman Catholics Catholic philosophers Epistemologists Metaphysicians Thomist philosophers Virtue ethicists 20th-century French philosophers Benedictine oblates Christian humanists Ambassadors of France to the Holy See Converts to Roman Catholicism from atheism or agnosticism Committee on Social Thought French male writers Critics of atheism Corresponding Fellows of the Medieval Academy of America Hidden categories: CS1: long volume value CS1 Spanish-language sources (es) CS1 French-language sources (fr) Articles with short description Short description matches Wikidata Articles lacking in-text citations from November 2010 All articles lacking in-text citations Use dmy dates from December 2019 Articles with hCards Wikipedia articles needing clarification from April 2014 All articles with specifically marked weasel-worded phrases Articles with specifically marked weasel-worded phrases from June 2019 Wikipedia articles with GND identifiers Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BIBSYS identifiers Wikipedia articles with BNE identifiers Wikipedia articles with BNF identifiers Wikipedia articles with CANTIC identifiers Wikipedia articles with ICCU identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with LNB identifiers Wikipedia articles with NDL identifiers Wikipedia articles with NKC identifiers Wikipedia articles with NLA identifiers Wikipedia articles with NLG identifiers Wikipedia articles with NLI identifiers Wikipedia articles with NLK identifiers Wikipedia articles with NSK identifiers Wikipedia articles with NTA identifiers Wikipedia articles with PLWABN identifiers Wikipedia articles with VcBA identifiers Wikipedia articles with ULAN identifiers Wikipedia articles with CINII identifiers Wikipedia articles with FAST identifiers Wikipedia articles with MusicBrainz identifiers Wikipedia articles with RERO identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with Trove identifiers Wikipedia articles with WORLDCATID identifiers AC with 29 elements Wikipedia articles with multiple identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Wikiquote Languages العربية Azərbaycanca Беларуская Català Čeština Cymraeg Deutsch Eesti Español Euskara فارسی Français Galego 한국어 Հայերեն Bahasa Indonesia Italiano Қазақша Kiswahili Latina Magyar മലയാളം مصرى Nederlands 日本語 Norsk bokmål Piemontèis Polski Português Română Русский Slovenčina Slovenščina Suomi Svenska தமிழ் Türkçe Українська Yorùbá 中文 Edit links This page was last edited on 20 June 2021, at 21:19 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-2588 ---- Cardano (blockchain platform) - Wikipedia Cardano (blockchain platform) From Wikipedia, the free encyclopedia Jump to navigation Jump to search Public blockchain platform Cardano Original author(s) Charles Hoskinson Developer(s) Cardano Foundation, IOHK, EMURGO Initial release 27 September 2017 (3 years ago) (2017-09-27)[1] Stable release 1.27.0 / 13 May 2021 (2 months ago) (2021-05-13)[2] Development status Active Written in Haskell Operating system Cross-platform Type Distributed computing License Apache License Active hosts 2,486[3] Website cardano.org Cardano is a public blockchain platform. It is open-source and decentralized, with consensus achieved using proof of stake. It can facilitate peer-to-peer transactions with its internal cryptocurrency, Ada.[4] Cardano was founded in 2015 by Ethereum co-founder Charles Hoskinson. The development of the project is overseen and supervised by the Cardano Foundation based in Zug, Switzerland.[5][6] Contents 1 Background 2 Technical aspects 3 History 4 References 5 External links Background The platform began development in 2015 and was launched in 2017 by Charles Hoskinson, a co-founder of Ethereum.[7][8][9] Hoskinson left Ethereum after a dispute with its co-founder Vitalik Buterin; Hoskinson wanted to accept venture capital and create a for-profit entity while Buterin wanted to keep it running as a nonprofit organization. After leaving he co-founded IOHK, a blockchain engineering company, whose primary business is the development of Cardano, alongside the Cardano Foundation and Emurgo.[9] The platform is named after Gerolamo Cardano and the cryptocurrency after Ada Lovelace.[10] Technical aspects Atypically, Cardano does not have a white paper. Instead, it uses design principles intended to overcome issues faced by other cryptocurrencies, such as scalability, interoperability, and regulatory compliance.[11] Cardano uses a proof-of-stake protocol named Ouroboros[12] in contrast to Bitcoin and Ethereum which use proof-of-work protocols.[13] Proof-of-stake blockchains use significantly less energy than proof-of-work chains.[13] In February 2021, Hoskinson estimated the Cardano network used 6 GWh annually, less than 0.01% of the 110.53 TWh used by the Bitcoin network as estimated by the University of Cambridge.[14][15] Cardano reached a "market cap" of $77 billion in May 2021 and was considered the biggest proof of stake cryptocurrency.[16] [17] Within the Cardano platform, Ada exists on the settlement layer. This layer is similar to Bitcoin and keeps track of transactions. The second layer is the computation layer. This layer is designed to be similar to Ethereum, enabling smart contracts and applications to run on the platform.[18] Cardano expects to implement decentralized finance (DeFi) services in 2021 with an upgrade to enable smart contracts and the ability to build decentralized applicationss (DApps). Also included is Plutus, a Turing-complete smart contract language written in Haskell, and a specialised smart contract language, Marlowe, designed for non-programmers in the financial sector. Cardano's smart contract languages allow developers to run end-to-end tests on their program without leaving the integrated development environment or deploying their code.[19][20] History Cardano was funded through an initial coin offering.[21] The currency debuted with a market cap of $600 million. By the end of 2017, it had a market cap of $10 billion, and reached a value of $33 billion briefly in 2018 before a general tightening of the crypto market dropped its value back to $10 billion. According to Mashable, Cardano claims that it overcomes existing problems in the crypto market: mainly that Bitcoin is too slow and inflexible, and that Ethereum is not safe or scalable.[18] IOHK has partnered with universities for blockchain research. In 2017, IOHK helped the University of Edinburgh launch the Blockchain Technology Laboratory.[22][23][24] In 2020, IOHK donated $500,000 in Ada to the University of Wyoming to support the development of blockchain technology.[25] In 2019, the Ministry of Education in Georgia signed a memorandum of understanding with the Free University of Tbilisi to use Cardano and Atala to build a credential verification system for Georgia.[26] In 2019, footwear manufacturer New Balance announced a pilot program on the Cardano blockchain to track the authenticity of its newest basketball shoe.[27] IOHK announced a partnership with the Ethiopian government in 2018 to deploy their technology in a variety of industries throughout the country.[28] In April 2021, IOHK and the Ethiopia Ministry of Education announced plans to launch an identity and record-keeping system on Cardano for the country's five million students.[29] References ^ "Releases - input-output-hk/cardano-sl". Retrieved 28 October 2020 – via GitHub. ^ "Releases - input-output-hk/cardano-node". Retrieved 14 May 2021 – via GitHub. ^ "Cardano PoolTool". pooltool.io. Retrieved 14 May 2021. ^ "Die Grundlagen der Cardano-Kryptowährung". hamburg-magazin.de (in German). 26 June 2020. Retrieved 2 July 2020. ^ "Bitcoin's Smaller Cousins". Bloomberg L.P. 20 December 2017. Archived from the original on 26 June 2018. Retrieved 25 December 2018. Cardano, backed by the Zug, Switzerland-based Cardano Foundation, is a decentralized public blockchain that aims to protect user privacy, while also allowing for regulation ^ "ZUG: Ex-Tezos-Mann geht zu Cardano". luzernerzeitung.ch (in German). Luzerner Zeitung. 20 February 2018. Retrieved 7 July 2020. ^ "Ethereum Cofounder Says Blockchain Presents 'Governance Crisis'". Fortune. Retrieved 1 April 2020. ^ "ICOs explained". CNBC. 6 October 2017. Retrieved 25 December 2018. ethereum co-founder Charles Hoskinson says it has become increasingly more challenging to regulate this new asset class" and "ICO market could crash ^ a b Au-Yeung, Angel (7 February 2018). "A Fight Over Ethereum Led A Cofounder To Even Greater Crypto Wealth". Forbes Magazine. Retrieved 12 July 2020. IOHK's key project: Cardano, a public blockchain and smart-contract platform which hosts the Ada cryptocurrency. ^ "What is Ada?". Retrieved 23 October 2020. ^ "The Blockchain Galaxy A comprehensive research on distributed ledger technologies" (PDF). Deloitte. 6 May 2020. Retrieved 29 October 2020. The distinctive feature of Cardano is its “research-first” approach to design. ^ Badertscher, Christian; Gaži, Peter; Kiayias, Aggelos; Russell, Alexander; Zikas, Vassilis (15 January 2018). "Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability". Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. CCS '18. Toronto, Canada: Association for Computing Machinery: 913–930. doi:10.1145/3243734.3243848. hdl:20.500.11820/7f97233f-23d4-4568-87bc-254875f7a34c. ISBN 978-1-4503-5693-0. S2CID 44109228. ^ a b Volpicelli, Gian M. "A blockchain tweak could fix crypto's colossal energy problem". Wired UK. ISSN 1357-0978. Retrieved 13 May 2021. ^ "Bitcoin's wild ride renews worries about its massive carbon footprint". CNBC. 9 February 2021. Retrieved 13 February 2021. Bitcoin has a carbon footprint comparable to that of New Zealand ^ Ponciano, Jonathan. "Cardano Surges During $300 Billion Crypto Crash As Musk Eyes Sustainable Bitcoin Alternatives". Forbes. Retrieved 13 May 2021. ^ "What is Cardano? The 'green' crypto that hopes to surpass the tech giants". The Independent. 18 May 2021. Retrieved 6 June 2021. ^ "Cryptocurrency goes green: Could 'proof of stake' offer a solution to energy concerns?". NBC News. Retrieved 6 June 2021. ^ a b "Cardano: a rising cryptocurrency". Mashable. 24 February 2018. Retrieved 25 December 2018. Cardano claims it will solve most of the issues that plague well-established cryptocurrencies such as Bitcoin and Ethereum ^ "Say Hello to IOHK's New Cardano Blockchain Tools, Plutus and Marlowe". Crowdfund Insider. 11 December 2018. Retrieved 18 February 2019. Where programming Ethereum requires coding in two languages, Solidity for the on-chain code and Javascript for the off-chain parts, and other systems suffer a similar split, Plutus is the only system that provides an integrated language for both, based on Haskell ^ Emma Newbery (2021) “Why Cardano Could Be an 'Ethereum Killer'”, The Motley Fool, July 2. https://www.fool.com/the-ascent/cryptocurrency/articles/why-cardano-could-be-an-ethereum-killer/ ^ "Cryptocurrencies and blockchain" (PDF). European Parliament. July 2018. Retrieved 29 October 2020. What distinguishes Cardano from Ethereum, and from many other cryptocurrencies, is that it is (one of the first) blockchain projects to be developed and designed from a scientific philosophy by a team of leading academics and engineers ^ "Beyond Bitcoin - IOHK and University of Edinburgh establish Blockchain Technology Laboratory". The University of Edinburgh. Retrieved 31 March 2020. ^ "IOHK and University of Edinburgh establish Blockchain Technology Laboratory". finextra.com. Retrieved 25 October 2020. ^ "The University of Edinburgh is launching a blockchain research lab with one of the cofounders of Ethereum". www.insider.com. Retrieved 25 October 2020. ^ "UW Receives $500,000 Gift in Ada Cryptocurrency from IOHK". www.uwyo.edu. Retrieved 25 October 2020. ^ "Ministry of Education signs deal with Cardano Atala". Forbes Georgia. 17 June 2019. Retrieved 27 March 2020. ^ "Sneakers meet the blockchain in New Balance shoe authenticity pilot". SiliconANGLE. 17 October 2019. Retrieved 28 March 2020. ^ Phillips, Ruari (11 June 2018). "Ethiopian government-Cardano Technology team up on blockchain". East African Business Week. Retrieved 27 March 2020. ^ Sorkin, Andrew Ross; Karaian, Jason; Kessler, Sarah; Merced, Michael J. de la; Hirsch, Lauren; Livni, Ephrat (27 April 2021). "Tesla Makes Money (Including From Selling Cars)". The New York Times. ISSN 0362-4331. Retrieved 28 April 2021. External links Project website Cardano foundation IOHK website IOHK on YouTube Official Telegram Group v t e Cryptocurrencies Technology Blockchain Cryptocurrency tumbler Cryptocurrency exchange Cryptocurrency wallet Cryptographic hash function Decentralized exchange Decentralized Finance Distributed ledger Fork Lightning Network MetaMask Non-fungible token Smart contract Consensus mechanisms Proof of authority Proof of personhood Proof of space Proof of stake Proof of work Proof of work currencies SHA-256-based Bitcoin Bitcoin Cash Counterparty LBRY MazaCoin Namecoin Peercoin Titcoin Ethash-based Ethereum Ethereum Classic Scrypt-based Auroracoin Bitconnect Coinye Dogecoin Litecoin Equihash-based Bitcoin Gold Zcash RandomX-based Monero X11-based Dash Petro Other AmbaCoin Firo IOTA Primecoin Verge Vertcoin Proof of stake currencies Algorand Cardano EOS.IO Gridcoin Nxt Peercoin Polkadot Steem Tezos TRON ERC-20 tokens Augur Aventus Bancor Basic Attention Token Chainlink Kin KodakCoin Minds The DAO Uniswap Stablecoins Dai Diem Tether USD Coin Other currencies Ankr Chia Filecoin HBAR (Hashgraph) Nano NEO Ripple SafeMoon Stellar WhopperCoin Related topics Airdrop BitLicense Blockchain game Complementary currency Crypto-anarchism Cryptocurrency bubble Cryptocurrency scams Digital currency Distributed ledger technology law Double-spending Hyperledger Initial coin offering Initial exchange offering Initiative Q List of cryptocurrencies Token money Virtual currency Category Commons List Retrieved from "https://en.wikipedia.org/w/index.php?title=Cardano_(blockchain_platform)&oldid=1035442433" Categories: Blockchains Cross-platform software Alternative currencies Cryptocurrencies Hidden categories: CS1 German-language sources (de) Wikipedia extended-confirmed-protected pages Articles with short description Short description is different from Wikidata Use dmy dates from March 2021 Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read View source View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Català الدارجة Deutsch Eesti Ελληνικά Español فارسی Français Italiano Nederlands 日本語 Oʻzbekcha/ўзбекча Polski Português Română Русский Slovenčina Slovenščina Тоҷикӣ Türkçe Українська Edit links This page was last edited on 25 July 2021, at 18:10 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-2597 ---- The Butter and Egg Man - Wikipedia The Butter and Egg Man From Wikipedia, the free encyclopedia Jump to navigation Jump to search The Butter and Egg Man First edition 1926 Written by George S. Kaufman Date premiered September 23, 1925 (1925-09-23) Place premiered Longacre Theatre, New York City, New York, US Original language English Setting Office of Lehmac Productions in New York City; a hotel in Syracuse The Butter and Egg Man is a 1925 play by George S. Kaufman, the only play he wrote without collaborating. It was a Broadway hit during the 1925–26 season at the Longacre Theatre.[1] Adapted to film six times, it is still performed on stages today. Contents 1 Synopsis 2 Production 2.1 Revivals 3 Reception 4 Adaptations 5 References 6 External links Synopsis[edit] Gregory Kelly (center) in a scene from the Broadway production of The Butter and Egg Man (1925) The play's title, of course, is Broadwayese of the moment—a generic name for all those gentlemen who come trustingly to Gotham with bankrolls, bent upon either reckless expenditure or equally reckless investment. — From the dust jacket for the first edition of The Butter and Egg Man (Boni & Liveright, 1926)[2] A 1920s slang term popularized by Texas Guinan,[3] a butter-and-egg man is a traveling businessman eager to spend large amounts of money in the big city[4]—someone wealthy and unwary.[1] A souvenir booklet for the original production of The Butter and Egg Man devoted an entire page to the various claims of origin for the phrase.[5] Peter Jones is a young man who arrives on Broadway from Chillicothe, Ohio, hoping to invest $20,000 in a play and turn a profit sufficient to buy a local hotel back home. He is conned by Joe Lehman and Jack McClure into backing their play with a 49-percent stake. The play opens out-of-town in Syracuse and bombs. Lehman and McClure want out, and Jones buys them out, and revamps the play into a huge hit. Jones then sells back to them at a huge profit after learning of claims that the play was stolen, and returns home to get his hotel.[3] Kaufman's comedy may be seen as a precursor to Mel Brooks' The Producers.[6] Production[edit] James Gleason directed the Broadway production of The Butter and Egg Man, in which his wife Lucile Webster (center) appeared with Gregory Kelly and Sylvia Field. Promotional theatre token for the touring production of The Butter and Egg Man (1926) Gregory Kelly as Peter Jones in The Butter and Egg Man (1925) Scene from the 2003 production of The Butter and Egg Man at Otterbein University Produced by Crosby Gaige, The Butter and Egg Man opened at the Longacre Theatre on September 23, 1925, and played for 243 performances.[7] James Gleason directed the following cast:[8] Gregory Kelly as Peter Jones Sylvia Field as Jane Weston Robert Middlemass as Joe Lehman Lucile Webster as Fanny Lehman John A. Butler as Jack McClure Marion Barney as Mary Martin Tom Fadden as A Waiter Harry Neville as Cecil Benham Harry Stubbs as Bernie Sampson Eloise Stream as Peggy Marlowe Puritan Townsend as Kitty Humphries Denman Maley as Oscar Fritchie George Alison as A.J. Patterson When the Broadway run of the play ended in April 1926, Gregory Kelly starred in its national tour. Kelly had a heart attack in Pittsburgh in February 1927, and the tour was abandoned.[9] Kelly was transferred to a New York City sanitarium by his wife, actress Ruth Gordon, but he was unable to recover and died July 9, 1927, at age 36.[10][11] The London premiere of The Butter and Egg Man took place August 27, 1927, at the Garrick Theatre. Presented by an American company, the play was performed 31 times, closing on September 27, 1927. Robert Middlemass reprised his Broadway role as Joe Lehman.[12] Revivals[edit] Recent stagings of the play include Punch Line Theatre in Manhattan in 1982,[1] and by the Off Broadway Atlantic Theater Company in 2002.[13][14] Reception[edit] New York critics were unanimous in their praise for The Butter and Egg Man.[15] In his review of the play's premiere, Gilbert W. Gabriel wrote in The Sun that it was "the wittiest and liveliest jamboree of the behind-the-scenes ever distilled from the atmosphere of Broadway."[16] Walter Winchell wrote that "first nighters roared at the dialogue". "The audience nearly laughed itself to death", wrote John Anderson of The New York Evening Post. Alexander Woollcott called the play "richly and continuously amusing". "If you like smart, funny, sentimental, satirical comedies, here is a chance to enjoy yourself", wrote Percy Hammond of the New York Herald Tribune.[15] Adaptations[edit] The Butter and Egg Man has been adapted for motion pictures six times:[17] It was first adapted for the screen in 1928 (with the same name), a silent film directed by Richard Wallace.[18] The 1932 American comedy film The Tenderfoot is based on the play.[19] The 1935 British film Hello, Sweetheart is based on the play. The 1937 American film Dance Charlie Dance is based on the play. The 1940 American film An Angel from Texas, which included Ronald Reagan in its cast, is based on the play.[20] The 1953 musical film Three Sailors and a Girl is based on the play P. G. Wodehouse adapted the play for his 1952 novel, Barmy in Wonderland. References[edit] ^ a b c Gussow, Mel (December 29, 1982). "Theatre: The Butter and Egg Man". The New York Times. Retrieved 2018-02-28. ^ "The Butter and Egg Man". Facsimile Dust Jackets LLC. Retrieved 2018-02-26. ^ a b Bordman, Gerald & Thomas S. Hischak. The Oxford Companion to American Theatre, p. 103 (3d ed. 2004) ^ Allen, Irving Lewis (1995). The City in Slang: New York Life and Popular Speech. Oxford University Press. p. 77. ISBN 0-19-509265-1. ^ "Souvenir Book for 'The Butter and Egg Man'" (PDF). Long Island News and Owl. December 10, 1925. p. 10. Retrieved 2018-02-28. ^ "The Butter and Egg Man (1925)". George S. Kaufman. Retrieved 2018-02-28. ^ "The Butter and Egg Man". Internet Broadway Database. Retrieved 2018-02-28. ^ Kaufman, George S. (1957) [1926]. The Butter and Egg Man: A Play in Three Acts. Samuel French. p. 2. ^ "Gregory Kelly Ill; Play Tour Ends". The New York Times. February 27, 1927. Retrieved 2018-02-28. ^ "Gregory Kelly, Actor, Dies at 36". The New York Times. July 10, 1927. Retrieved 2018-02-28. ^ Robinson, Lauren (May 20, 2014). "Untimely Deaths of Stage Performers". MCNY Blog: New York Stories. Museum of the City of New York. Retrieved 2018-03-04. ^ Wearing, J.P. The London Stage 1920-1929: A Calendar of Productions, Performers, and Personnel, p. 535 (2014) ^ Weber, Bruce (4 October 2002). George S. Kaufman's Jet-Paced Solo Flight, The New York Times ^ Isherwood, Charles. (2 Oct 2002) Review: The Butter and Egg Man, Variety ^ a b Crosby Gaige Introduces George S. Kaufman's New Comedy The Butter and Egg Man with Gregory Kelly (1925). Promotional brochure for the original production at the Longacre Theatre, New York City. ^ Gabriel, Gilbert W. (24 Sept 1925). The Drama's Dairy Godfather. Kaufman's "The Butter and Egg Man" Sells a Thousand Laughs at Our Theater's Expense, The Sun, p. 24, col. 1 ^ Goble, Alan. The Complete Index to Literary Sources in Film, p. 252 (1992) (books lists six films based on the play: The Butter and Egg Man (1928), The Tenderfoot (1932), Hello Sweetheart (1937), Dance Charlie Dance (1937), Angel from Texas (1940), and Three Sailors and a Girl (1953) ^ Hall, Mordaunt (28 Aug 1928). The Screen: The Worm That Turned, The New York Times ^ Hall, Mordaunt (23 May 1932). Joe E. Brown in a Boisterous Film Conception of the Stage Comedy, "The Butter and Egg Man.", The New York Times ^ Crowther, Bosley (10 May 1940). An Angel From Texas (Review), The New York Times External links[edit] Wikimedia Commons has media related to The Butter and Egg Man. The Butter and Egg Man at the Internet Broadway Database The Butter and Egg Man at Georgekaufman.com v t e George S. Kaufman Plays and musicals Some One in the House (1918) Dulcy (1921) To the Ladies (1922) The '49ers (1922) Merton of the Movies (1922) Helen of Troy, New York (1923) The Deep Tangled Wildwood (1923) Beggar on Horseback (1924) Be Yourself (1924) Minick (1924) The Butter and Egg Man (1925) The Cocoanuts (1925) The Good Fellow (1926) The Royal Family (1927) Animal Crackers (1928) June Moon (1929) The Channel Road (1929) Once in a Lifetime (1930) The Band Wagon (1931) Of Thee I Sing (1931) Dinner at Eight (1932) Let 'Em Eat Cake (1933) The Dark Tower (1933) Merrily We Roll Along (1934) First Lady (1935) Stage Door (1936) You Can't Take It with You (1936) I'd Rather Be Right (1937) The Fabulous Invalid (1938) The American Way (1939) The Man Who Came to Dinner (1939) George Washington Slept Here (1940) The Land Is Bright (1941) The Late George Apley (1944) Seven Lively Arts (1944) Hollywood Pinafore (1945) Bravo! (1948) The Small Hours (1951) Fancy Meeting You Again (1952) The Solid Gold Cadillac (1953) Silk Stockings (1955) Musicals based on his plays Sherry! (1967) Merrily We Roll Along (1981) Films Someone Must Pay (1919) Someone in the House (1920) Dulcy (1923) To the Ladies (1923) Merton of the Movies (1924) Welcome Home (1925) Beggar on Horseback (1925) The Butter and Egg Man (1928) The Cocoanuts (1929) Not So Dumb (1930) Animal Crackers (1930) The Royal Family of Broadway (1930) June Moon (1931) The Expert (1932) The Tenderfoot (1932) Make Me a Star (1932) Once in a Lifetime (1932) Dinner at Eight (1933) Roman Scandals (1933) The Man with Two Faces (1934) You Can't Take It with You (1938) Films as a director The Senator Was Indiscreet (1947) Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Butter_and_Egg_Man&oldid=992446180" Categories: Broadway plays 1925 plays American plays adapted into films Plays by George S. Kaufman Hidden categories: CS1: Julian–Gregorian uncertainty Commons category link is on Wikidata Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Add links This page was last edited on 5 December 2020, at 09:00 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-2820 ---- A Modest Proposal - Wikipedia A Modest Proposal From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1729 satirical essay by Jonathan Swift A Modest Proposal Author Jonathan Swift Genre Satirical essay Publication date 1729 A Modest Proposal For preventing the Children of Poor People From being a Burthen to Their Parents or Country, and For making them Beneficial to the Publick,[1] commonly referred to as A Modest Proposal, is a Juvenalian satirical essay written and published anonymously by Jonathan Swift in 1729. The essay suggests that the impoverished Irish might ease their economic troubles by selling their children as food to rich gentlemen and ladies. This satirical hyperbole mocked heartless attitudes towards the poor, as well as British policy toward the Irish in general. In English writing, the phrase "a modest proposal" is now conventionally an allusion to this style of straight-faced satire. Contents 1 Synopsis 2 Population solutions 3 Rhetoric 4 Influences 4.1 Tertullian's Apology 4.2 Defoe's The Generous Projector 4.3 Mandeville's Modest Defence of Publick Stews 4.4 John Locke's First Treatise of Government 5 Economic themes 5.1 "People are the riches of a nation" 6 The public's reaction 7 Modern usage 8 Notes 9 References 10 External links Synopsis[edit] Swift's essay is widely held to be one of the greatest examples of sustained irony in the history of the English language. Much of its shock value derives from the fact that the first portion of the essay describes the plight of starving beggars in Ireland, so that the reader is unprepared for the surprise of Swift's solution when he states: "A young healthy child well nursed, is, at a year old, a most delicious nourishing and wholesome food, whether stewed, roasted, baked, or boiled; and I make no doubt that it will equally serve in a fricassee, or a ragout."[1] Swift goes to great lengths to support his argument, including a list of possible preparation styles for the children, and calculations showing the financial benefits of his suggestion. He uses methods of argument throughout his essay which lampoon the then-influential William Petty and the social engineering popular among followers of Francis Bacon. These lampoons include appealing to the authority of "a very knowing American of my acquaintance in London" and "the famous Psalmanazar, a native of the island Formosa" (who had already confessed to not being from Formosa in 1706). In the tradition of Roman satire, Swift introduces the reforms he is actually suggesting by paralipsis: Therefore let no man talk to me of other expedients: Of taxing our absentees at five shillings a pound: Of using neither clothes, nor household furniture, except what is of our own growth and manufacture: Of utterly rejecting the materials and instruments that promote foreign luxury: Of curing the expensiveness of pride, vanity, idleness, and gaming in our women: Of introducing a vein of parsimony, prudence and temperance: Of learning to love our country, wherein we differ even from Laplanders, and the inhabitants of Topinamboo: Of quitting our animosities and factions, nor acting any longer like the Jews, who were murdering one another at the very moment their city was taken: Of being a little cautious not to sell our country and consciences for nothing: Of teaching landlords to have at least one degree of mercy towards their tenants. Lastly, of putting a spirit of honesty, industry, and skill into our shop-keepers, who, if a resolution could now be taken to buy only our native goods, would immediately unite to cheat and exact upon us in the price, the measure, and the goodness, nor could ever yet be brought to make one fair proposal of just dealing, though often and earnestly invited to it. Therefore I repeat, let no man talk to me of these and the like expedients, 'till he hath at least some glympse of hope, that there will ever be some hearty and sincere attempt to put them into practice. Population solutions[edit] George Wittkowsky argued that Swift's main target in A Modest Proposal was not the conditions in Ireland, but rather the can-do spirit of the times that led people to devise a number of illogical schemes that would purportedly solve social and economic ills.[2] Swift was especially attacking projects that tried to fix population and labour issues with a simple cure-all solution.[3] A memorable example of these sorts of schemes "involved the idea of running the poor through a joint-stock company".[3] In response, Swift's Modest Proposal was "a burlesque of projects concerning the poor"[4] that were in vogue during the early 18th century. A Modest Proposal also targets the calculating way people perceived the poor in designing their projects. The pamphlet targets reformers who "regard people as commodities".[5] In the piece, Swift adopts the "technique of a political arithmetician"[6] to show the utter ridiculousness of trying to prove any proposal with dispassionate statistics. Critics differ about Swift's intentions in using this faux-mathematical philosophy. Edmund Wilson argues that statistically "the logic of the 'Modest proposal' can be compared with defence of crime (arrogated to Marx) in which he argues that crime takes care of the superfluous population".[6] Wittkowsky counters that Swift's satiric use of statistical analysis is an effort to enhance his satire that "springs from a spirit of bitter mockery, not from the delight in calculations for their own sake".[7] Rhetoric[edit] Author Charles K. Smith argues that Swift's rhetorical style persuades the reader to detest the speaker and pity the Irish. Swift's specific strategy is twofold, using a "trap"[8] to create sympathy for the Irish and a dislike of the narrator who, in the span of one sentence, "details vividly and with rhetorical emphasis the grinding poverty" but feels emotion solely for members of his own class.[9] Swift's use of gripping details of poverty and his narrator's cool approach towards them create "two opposing points of view" that "alienate the reader, perhaps unconsciously, from a narrator who can view with 'melancholy' detachment a subject that Swift has directed us, rhetorically, to see in a much less detached way."[9] Swift has his proposer further degrade the Irish by using language ordinarily reserved for animals. Lewis argues that the speaker uses "the vocabulary of animal husbandry"[10] to describe the Irish. Once the children have been commodified, Swift's rhetoric can easily turn "people into animals, then meat, and from meat, logically, into tonnage worth a price per pound".[10] Swift uses the proposer's serious tone to highlight the absurdity of his proposal. In making his argument, the speaker uses the conventional, textbook-approved order of argument from Swift's time (which was derived from the Latin rhetorician Quintilian).[11] The contrast between the "careful control against the almost inconceivable perversion of his scheme" and "the ridiculousness of the proposal" create a situation in which the reader has "to consider just what perverted values and assumptions would allow such a diligent, thoughtful, and conventional man to propose so perverse a plan".[11] Influences[edit] Scholars have speculated about which earlier works Swift may have had in mind when he wrote A Modest Proposal. Tertullian's Apology[edit] James William Johnson argues that A Modest Proposal was largely influenced and inspired by Tertullian's Apology: a satirical attack against early Roman persecution of Christianity. Johnson believes that Swift saw major similarities between the two situations.[12] Johnson notes Swift's obvious affinity for Tertullian and the bold stylistic and structural similarities between the works A Modest Proposal and Apology.[13] In structure, Johnson points out the same central theme, that of cannibalism and the eating of babies as well as the same final argument, that "human depravity is such that men will attempt to justify their own cruelty by accusing their victims of being lower than human".[12] Stylistically, Swift and Tertullian share the same command of sarcasm and language.[12] In agreement with Johnson, Donald C. Baker points out the similarity between both authors' tones and use of irony. Baker notes the uncanny way that both authors imply an ironic "justification by ownership" over the subject of sacrificing children—Tertullian while attacking pagan parents, and Swift while attacking the English mistreatment of the Irish poor.[14] Defoe's The Generous Projector[edit] It has also been argued that A Modest Proposal was, at least in part, a response to the 1728 essay The Generous Projector or, A Friendly Proposal to Prevent Murder and Other Enormous Abuses, By Erecting an Hospital for Foundlings and Bastard Children by Swift's rival Daniel Defoe.[15] Mandeville's Modest Defence of Publick Stews[edit] Bernard Mandeville's Modest Defence of Publick Stews asked to introduce public and state controlled bordellos. The 1726 paper acknowledges women's interests and – while not being a completely satirical text – has also been discussed as an inspiration for Jonathan Swift's title.[16][17] Mandeville had by 1705 already become famous for the Fable of The Bees and deliberations on private vices and public benefits. John Locke's First Treatise of Government[edit] John Locke commented: "Be it then as Sir Robert says, that Anciently, it was usual for Men to sell and Castrate their Children. Let it be, that they exposed them; Add to it, if you please, for this is still greater Power, that they begat them for their Tables to fat and eat them: If this proves a right to do so, we may, by the same Argument, justifie Adultery, Incest and Sodomy, for there are examples of these too, both Ancient and Modern; Sins, which I suppose, have the Principle Aggravation from this, that they cross the main intention of Nature, which willeth the increase of Mankind, and the continuation of the Species in the highest perfection, and the distinction of Families, with the Security of the Marriage Bed, as necessary thereunto". (First Treatise, sec. 59). Economic themes[edit] Robert Phiddian's article "Have you eaten yet? The Reader in A Modest Proposal" focuses on two aspects of A Modest Proposal: the voice of Swift and the voice of the Proposer. Phiddian stresses that a reader of the pamphlet must learn to distinguish between the satirical voice of Jonathan Swift and the apparent economic projections of the Proposer. He reminds readers that "there is a gap between the narrator's meaning and the text's, and that a moral-political argument is being carried out by means of parody".[18] While Swift's proposal is obviously not a serious economic proposal, George Wittkowsky, author of "Swift's Modest Proposal: The Biography of an Early Georgian Pamphlet", argues that to understand the piece fully it is important to understand the economics of Swift's time. Wittowsky argues that not enough critics have taken the time to focus directly on the mercantilism and theories of labour in 18th century England. "If one regards the Modest Proposal simply as a criticism of condition, about all one can say is that conditions were bad and that Swift's irony brilliantly underscored this fact".[19] "People are the riches of a nation"[edit] At the start of a new industrial age in the 18th century, it was believed that "people are the riches of the nation", and there was a general faith in an economy that paid its workers low wages because high wages meant workers would work less.[20] Furthermore, "in the mercantilist view no child was too young to go into industry". In those times, the "somewhat more humane attitudes of an earlier day had all but disappeared and the laborer had come to be regarded as a commodity".[18] Louis A. Landa composed a conducive analysis when he noted that it would have been healthier for the Irish economy to more appropriately utilize their human assets by giving the people an opportunity to "become a source of wealth to the nation" or else they "must turn to begging and thievery".[21] This opportunity may have included giving the farmers more coin to work for, diversifying their professions, or even consider enslaving their people to lower coin usage and build up financial stock in Ireland. Landa wrote that, "Swift is maintaining that the maxim—people are the riches of a nation—applies to Ireland only if Ireland is permitted slavery or cannibalism"[22] Landa presents Swift's A Modest Proposal as a critique of the popular and unjustified maxim of mercantilism in the 18th century that "people are the riches of a nation".[21] Swift presents the dire state of Ireland and shows that mere population itself, in Ireland's case, did not always mean greater wealth and economy.[22] The uncontrolled maxim fails to take into account that a person who does not produce in an economic or political way makes a country poorer, not richer.[22] Swift also recognises the implications of this fact in making mercantilist philosophy a paradox: the wealth of a country is based on the poverty of the majority of its citizens.[22] Swift however, Landa argues, is not merely criticising economic maxims but also addressing the fact that England was denying Irish citizens their natural rights and dehumanising them by viewing them as a mere commodity.[22] The public's reaction[edit] Swift's essay created a backlash within the community after its publication. The work was aimed at the aristocracy, and they responded in turn. Several members of society wrote to Swift regarding the work. Lord Bathurst's letter intimated that he certainly understood the message, and interpreted it as a work of comedy: 12 February 1729–30: "I did immediately propose it to Lady Bathurst, as your advice, particularly for her last boy, which was born the plumpest, finest thing, that could be seen; but she fell in a passion, and bid me send you word, that she would not follow your direction, but that she would breed him up to be a parson, and he should live upon the fat of the land; or a lawyer, and then, instead of being eat himself, he should devour others. You know women in passion never mind what they say; but, as she is a very reasonable woman, I have almost brought her over now to your opinion; and having convinced her, that as matters stood, we could not possibly maintain all the nine, she does begin to think it reasonable the youngest should raise fortunes for the eldest: and upon that foot a man may perform family duty with more courage and zeal; for, if he should happen to get twins, the selling of one might provide for the other. Or if, by any accident, while his wife lies in with one child, he should get a second upon the body of another woman, he might dispose of the fattest of the two, and that would help to breed up the other. The more I think upon this scheme, the more reasonable it appears to me; and it ought by no means to be confined to Ireland; for, in all probability, we shall, in a very little time, be altogether as poor here as you are there. I believe, indeed, we shall carry it farther, and not confine our luxury only to the eating of children; for I happened to peep the other day into a large assembly [Parliament] not far from Westminster-hall, and I found them roasting a great fat fellow, [Walpole again] For my own part, I had not the least inclination to a slice of him; but, if I guessed right, four or five of the company had a devilish mind to be at him. Well, adieu, you begin now to wish I had ended, when I might have done it so conveniently".[23] Modern usage[edit] A Modest Proposal is included in many literature courses as an example of early modern western satire. It also serves as an introduction to the concept and use of argumentative language, lending itself to secondary and post-secondary essay courses. Outside of the realm of English studies, A Modest Proposal is included in many comparative and global literature and history courses, as well as those of numerous other disciplines in the arts, humanities, and even the social sciences.[original research?] The essay's approach has been copied many times. In his book A Modest Proposal (1984), the evangelical author Francis Schaeffer emulated Swift's work in a social conservative polemic against abortion and euthanasia, imagining a future dystopia that advocates recycling of aborted embryos, fetuses, and some disabled infants with compound intellectual, physical and physiological difficulties. (Such Baby Doe Rules cases were then a major concern of the US anti-abortion movement of the early 1980s, which viewed selective treatment of those infants as disability discrimination.) In his book A Modest Proposal for America (2013), statistician Howard Friedman opens with a satirical reflection of the extreme drive to fiscal stability by ultra-conservatives. In the 1998 edition of The Handmaid's Tale by Margaret Atwood there is a quote from A Modest Proposal before the introduction.[24] A Modest Video Game Proposal is the title of an open letter sent by activist/former attorney Jack Thompson on 10 October 2005. He proposed that someone should "create, manufacture, distribute, and sell a video game" that would allow players to act out a scenario in which the game character kills video game developers.[25][26] Hunter S. Thompson's Fear and Loathing in America: The Brutal Odyssey of an Outlaw Journalist includes a letter in which he uses Swift's approach in connection with the Vietnam War. Thompson writes a letter to a local Aspen newspaper informing them that, on Christmas Eve, he is going to use napalm to burn a number of dogs and hopefully any humans they find. The letter protests against the burning of Vietnamese people occurring overseas. The 2013 horror film Butcher Boys, written by the original The Texas Chain Saw Massacre scribe Kim Henkel, is said to be an updating of Jonathan Swift's A Modest Proposal. Henkel imagined the descendants of folks who actually took Swift up on his proposal. [27] The film opens with a quote from J. Swift. [28] On 30 November 2017, Jonathan Swift's 350th birthday, The Washington Post published a column entitled "Why Alabamians should consider eating Democrats' babies", by Alexandra Petri.[29] In July 2019, E. Jean Carroll published a book titled What Do We Need Men For?: A Modest Proposal, discussing problematic behaviour of male humans.[30][31] On 3 October 2019, a satirist spoke up at an event for Alexandria Ocasio-Cortez, claiming that a solution to the climate crisis was "we need to eat the babies".[32] The individual also wore a T-shirt saying "Save The Planet, Eat The Children". This stunt was understood by many[33] as a modern application of A Modest Proposal. Notes[edit] ^ a b A Modest Proposal, by Dr. Jonathan Swift. Project Gutenberg. 27 July 2008. Retrieved 10 January 2012. ^ Wittkowsky, Swift’s Modest Proposal, p. 76 ^ a b Wittkowsky, Swift’s Modest Proposal, p. 85 ^ Wittkowsky, Swift's Modest Proposal, p. 88 ^ Wittkowsky, Swift's Modest Proposal, p. 101 ^ a b Wittkowsky, Swift's Modest Proposal, p. 95 ^ Wittkowsky, Swift's Modest Proposal, p. 98 ^ Smith, Toward a Participatory Rhetoric, p. 135 ^ a b Smith, Toward a Participatory Rhetoric, p. 136 ^ a b Smith, Toward a Participatory Rhetoric, p. 138 ^ a b Smith, Toward a Participatory Rhetoric, p. 139 ^ a b c Johnson, Tertullian and A Modest Proposal, p. 563 ^ Johnson, Tertullian and A Modest Proposal, p. 562 ^ Baker, Tertullian and Swift's A Modest Proposal, p. 219 ^ Waters, Juliet (19 February 2009). "A modest but failed proposal". Montreal Mirror. Archived from the original on 27 July 2020. Retrieved 10 January 2012. ^ Eine Streitschrift…, Essay von Ursula Pia Jauch. Carl Hanser Verlag, München 2001. ^ Primer, I. (15 March 2006). Bernard Mandeville's "A Modest Defence of Publick Stews": Prostitution and Its Discontents in Early Georgian England. Springer. ISBN 9781403984609. ^ a b Phiddian, Have You Eaten Yet?, p. 6 ^ Phiddian, Have You Eaten Yet?, p. 3 ^ Phiddian, Have You Eaten Yet?, p. 4 ^ a b Landa, A Modest Proposal and Populousness, p. 161 ^ a b c d e Landa, A Modest Proposal and Populousness, p. 165 ^ Swift, Jonathan; Scott, Sir Walter (1814). The Works of Jonathan Swift: Containing Additional Letters, Tracts, and Poems Not Hitherto Published; with Notes and a Life of the Author. A. Constable. ^ Atwood, Margaret. "The Handmaid's Tale". www.goodreads.com. ^ Saunderson, Matt (10 October 2005). "Attorney Proposes Violent Game". GameCube Advanced. Advanced Media Network. Archived from the original on 30 October 2005. ^ Gibson, Ellie (18 October 2005). "Thompson refuses to make $10k donation to charity". Eurogamer. Retrieved 2 March 2021. ^ O'Connell, Joe. "A 'Texas Chain Saw' Pedigree". www.austinchronicle.com. ^ Barton, Steve. "Exclusive: Kim Henkel Talks Butcher Boys". www.dreadcentral.com. ^ Petri, Alexandra (30 November 2017). "Why Alabamians should consider eating Democrats' babies". The Washington Post. Retrieved 30 November 2017. ^ Carroll, E. Jean (21 June 2019). "Donald Trump Assaulted Me, But He's Not Alone on My List of Hideous Men". The Cut. Retrieved 5 October 2019. ^ "What Do We Need Men For?: A Modest Proposal | IndieBound.org". www.indiebound.org. Retrieved 5 October 2019. ^ ‘We Need to Eat the Babies!’ Climate Activist Confronts AOC at New York Town Hall, retrieved 4 October 2019 ^ Malaea, Marika (4 October 2019). "'Eat the babies!': Twitter reacts to a surprise ending to the Alexandria Ocasio-Cortez town hall meeting". Newsweek. Retrieved 4 October 2019. References[edit] Baker, Donald C (1957), "Tertullian and Swift's A Modest Proposal", The Classical Journal, 52: 219–220 Johnson, James William (1958), "Tertullian and A Modest Proposal", Modern Language Notes, The Johns Hopkins University Press, 73 (8): 561–563, doi:10.2307/3043246, JSTOR 3043246 (subscription needed) Landa, Louis A (1942), "A Modest Proposal and Populousness", Modern Philology, 40 (2): 161–170, doi:10.1086/388567 Phiddian, Robert (1996), "Have You Eaten Yet? The Reader in A Modest Proposal", SEL: Studies in English Literature 1500–1900, Rice University, 36 (3): 603–621, doi:10.2307/450801, hdl:2328/746, JSTOR 450801 Smith, Charles Kay (1968), "Toward a Participatory Rhetoric: Teaching Swift's Modest Proposal", College English, National Council of Teachers of English, 30 (2): 135–149, doi:10.2307/374449, JSTOR 374449 Wittkowsky, George (1943), "Swift's Modest Proposal: The Biography of an Early Georgian Pamphlet", Journal of the History of Ideas, University of Pennsylvania Press, 4 (1): 75–104, doi:10.2307/2707237, JSTOR 2707237 External links[edit] Wikisource has original text related to this article: A Modest Proposal A Modest Proposal (CELT) A Modest Proposal (Gutenberg) A Modest Proposal – Annotated text aligned to Common Core Standards A Modest Proposal public domain audiobook at LibriVox A Modest Proposal BBC Radio 4 In Our Time with Melvyn Bragg 'A modest proposal For preventing the children of poor people From being a Burthen to their Parents or the Country, And for making them Beneficial to the publick. The Third Edition, Dublin, Printed: And Reprinted at London, for Weaver Bickerton, in Devereux-Court near the Middle-Temple, 1730. Proposal to eat the children a short movie based upon Swift's novel. v t e Jonathan Swift Sermons Sermons of Jonathan Swift Satires Meditation Upon a Broomstick (1701) A Tale of a Tub (1704) The Battle of the Books (1704) Gulliver's Travels (1726–1727, 1735) Essays Thoughts on Various Subjects, Moral and Diverting (1706) An Argument Against Abolishing Christianity (1708) The Conduct of the Allies (1711) Drapier's Letters (1724/25) A Modest Proposal (1729) Directions to Servants (published 1745) Miscellany The Examiner newspaper (1710–1714) "Cadenus and Vanessa" (1713 poem) "The Lady's Dressing Room" (1732 poem) A Complete Collection of Genteel and Ingenious Conversation (1738) A Journal to Stella (published posthumously – 1766) Related Esther Johnson Esther Vanhomrigh Scriblerus Club Swift crater The House That Swift Built (1982 film) v t e Global human population Major topics Biocapacity Demographics of the world Human overpopulation Malthusian catastrophe Human population planning One-child policy Two-child policy Optimum population Population Population ethics Population growth Population momentum Sustainable development Sustainable population Women's reproductive rights Zero population growth Biological and related topics Family planning Pledge two or fewer Population biology Population decline Population density Physiological density Population dynamics Population model Population pyramid Projections of population growth Human impact on the environment Deforestation Desalination Desertification Environmental impact of agriculture of aviation of biodiesel of concrete of electricity generation of the energy industry of fishing of irrigation of mining of off-roading of oil shale industry of palm oil of paper of the petroleum industry of reservoirs of shipping of war Industrialisation Land degradation Land reclamation Overconsumption Pollution Quarrying Urbanization Loss of green belts Urban sprawl Waste Water scarcity Overdrafting Population ecology Deep ecology Earth's energy budget Food security Habitat destruction I = P × A × T Kaya identity Malthusian growth model Overshoot (population) World energy consumption World energy resources World3 model Literature A Modest Proposal Observations Concerning the Increase of Mankind, Peopling of Countries, etc. An Essay on the Principle of Population "How Much Land Does a Man Need?" Operating Manual for Spaceship Earth Population Control: Real Costs, Illusory Benefits The Limits to Growth The Population Bomb The Skeptical Environmentalist The Ultimate Resource Publications Population and Environment Population and Development Review Lists Population and housing censuses by country Metropolitan areas by population Population milestone babies Events and organizations 7 Billion Actions Extinction Rebellion International Conference on Population and Development Population Action International Population Connection Population Matters Population Research Institute United Nations Population Fund Voluntary Human Extinction Movement World Population Day World Population Foundation Related topics Classic Maya collapse Fertility and intelligence Green Revolution Holocene extinction Migration Commons Human overpopulation Human activities with impact on the environment Human migration Retrieved from "https://en.wikipedia.org/w/index.php?title=A_Modest_Proposal&oldid=1031556057" Categories: Essays by Jonathan Swift Satirical essays Pamphlets 18th-century essays Works published anonymously British satire 1729 in Great Britain Cannibalism in fiction 1729 books Hidden categories: Articles with short description Short description is different from Wikidata Use British English from October 2017 Use dmy dates from October 2017 All articles that may contain original research Articles that may contain original research from February 2021 Articles with LibriVox links AC with 0 elements Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Brezhoneg Català Deutsch Español فارسی Français Italiano עברית Nederlands 日本語 Norsk bokmål Polski Português Русский Simple English Suomi Svenska 中文 Edit links This page was last edited on 2 July 2021, at 08:06 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-2966 ---- Lovers in Quarantine - Wikipedia Lovers in Quarantine From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 film by Frank Tuttle Lovers in Quarantine Lobby card Directed by Frank Tuttle Written by Townsend Martin (scenario) Luther Reed (scenario) Based on Quarantine by F. Tennyson Jesse Produced by Adolph Zukor Jesse Lasky Starring Bebe Daniels Cinematography J. Roy Hunt Distributed by Paramount Pictures Release date October 11, 1925 (1925-10-11) Running time 7 reels; 6,570 feet Country United States Language Silent (English intertitles) Lovers in Quarantine is an extant 1925 American silent comedy film starring Bebe Daniels and directed by Frank Tuttle. It was produced by Famous Players-Lasky and distributed by Paramount Pictures. The film is based on a 1924 Broadway play Quarantine by F. Tennyson Jesse.[1][2][3] The film entered the public domain on January 1, 2021.[4] Contents 1 Cast 2 Preservation 3 References 4 External links Cast[edit] Bebe Daniels as Diana Harrison Ford as Anthony Blunt Alfred Lunt as Mackintosh Josephs Eden Gray as Pamela Gordon Edna May Oliver as Amelia Pincent Diana Kane as Lola Ivan F. Simpson as The Silent Passenger Marie Shotwell as Mrs. Borroughs Gunboat Smith as Minor Role (uncredited) Preservation[edit] A print of Lovers in Quarantine is preserved at the Library of Congress.[5][6] References[edit] ^ The American Film Institute Catalog Feature Films: 1921-30 by The American Film Institute, c.1971 ^ The AFI Catalog of Feature Films: Lovers in Quarantine(Wayback) ^ Progressive Silent Film List: Lovers in Quarantine at silentera.com ^ Duke University 2021 Public Domain Day ^ Catalog of Holdings The American Film Institute Collection and The United Artists Collection at The Library of Congress by The American Film Institute, c.1978 ^ The Library of Congress American Silent Feature Film Survival Catalog: Lovers in Quarantine External links[edit] Wikimedia Commons has media related to Category:Lovers in Quarantine. Lovers in Quarantine at IMDb Synopsis at AllMovie Lobby card v t e Films directed by Frank Tuttle The Cradle Buster (1922) Second Fiddle (1923) Youthful Cheaters (1923) Puritan Passions (1923) Grit (1924) Dangerous Money (1924) A Kiss in the Dark (1925) Miss Bluebeard (1925) The Manicure Girl (1925) The Lucky Devil (1925) Lovers in Quarantine (1925) The American Venus (1926) The Untamed Lady (1926) Love 'Em and Leave 'Em (1926) Kid Boots (1926) Blind Alleys (1927) One Woman to Another (1927) Time to Love (1927) The Spotlight (1927) Love and Learn (1928) Something Always Happens (1928) Easy Come, Easy Go (1928) Varsity (1928) His Private Life (1928) Marquis Preferred (1929) The Canary Murder Case (1929) The Studio Murder Mystery (1929) The Greene Murder Case (1929) Sweetie (1929) Only the Brave (1930) Men Are Like That (1930) The Benson Murder Case (1930) Paramount on Parade (1930) True to the Navy (1930) Love Among the Millionaires (1930) Her Wedding Night (1930) It Pays to Advertise (1931) No Limit (1931) Dude Ranch (1931) This Reckless Age (1932) This Is the Night (1932) The Big Broadcast (1932) Dangerously Yours (1933) Pleasure Cruise (1933) Roman Scandals (1933) Ladies Should Listen (1934) Springtime for Henry (1934) Here is My Heart (1934) All the King's Horses (1935) The Glass Key (1935) Two for Tonight (1935) College Holiday (1936) Waikiki Wedding (1937) Doctor Rhythm (1938) Paris Honeymoon (1939) I Stole a Million (1939) Charlie McCarthy, Detective (1939) Lucky Jordan (1942) This Gun for Hire (1942) Hostages (1943) The Hour Before the Dawn (1944) Don Juan Quilligan (1945) The Great John L. (1945) Suspense (1946) Swell Guy (1946) Gunman in the Streets (1950) The Magic Face (1951) Hell on Frisco Bay (1955) A Cry in the Night (1956) Island of Lost Women (1959) This article about a silent comedy film from the 1920s is a stub. You can help Wikipedia by expanding it. v t e Retrieved from "https://en.wikipedia.org/w/index.php?title=Lovers_in_Quarantine&oldid=1038642515" Categories: 1925 films American silent feature films American films based on plays Films directed by Frank Tuttle 1926 comedy films 1926 films American comedy films American films American black-and-white films Surviving American silent films 1925 comedy films 1920s silent comedy film stubs Hidden categories: Articles with short description Short description matches Wikidata Use mdy dates from September 2020 Template film date with 1 release date Commons category link is locally defined All stub articles Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Bahasa Indonesia Norsk bokmål Edit links This page was last edited on 13 August 2021, at 20:01 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-3269 ---- Export of cryptography from the United States - Wikipedia Export of cryptography from the United States From Wikipedia, the free encyclopedia Jump to navigation Jump to search Transfer from the United States to another country of devices and technology related to cryptography This article's lead section may be too long for the length of the article. Please help by moving some material from it into the body of the article. Please read the layout guide and lead section guidelines to ensure the section will still be inclusive of all essential details. Please discuss this issue on the article's talk page. (February 2010) Export-restricted RSA encryption source code printed on a T-shirt made the T-shirt an export-restricted munition, as a freedom of speech protest against U.S. encryption export restrictions (Back side).[1] Changes in the export law means that it is no longer illegal to export this T-shirt from the U.S., or for U.S. citizens to show it to foreigners. Export of cryptographic technology and devices from the United States was severely restricted by U.S. law until 1992. The law gradually became eased until around 2000, but some restrictions still remain today. Since World War II, many governments, including the U.S. and its NATO allies, have regulated the export of cryptography for national security reasons, and, as late as 1992, cryptography was on the U.S. Munitions List as an Auxiliary Military Equipment.[2] Due to the enormous impact of cryptanalysis in World War II, these governments saw the military value in denying current and potential enemies access to cryptographic systems. Since the U.S. and U.K. believed they had better cryptographic capabilities than others, their intelligence agencies tried to control all dissemination of the more effective crypto techniques. They also wished to monitor the diplomatic communications of other nations, including those emerging in the post-colonial period and whose position on Cold War issues was vital.[3] The First Amendment made controlling all use of cryptography inside the U.S. illegal, but controlling access to U.S. developments by others was more practical — there were no constitutional impediments. Accordingly, regulations were introduced as part of munitions controls which required licenses to export cryptographic methods (and even their description); the regulations established that cryptography beyond a certain strength (defined by algorithm and length of key) would not be licensed for export except on a case-by-case basis. This policy was also adopted elsewhere for various reasons. The development and public release of Data Encryption Standard (DES) and asymmetric key techniques in the 1970s, the rise of the Internet, and the willingness of some to risk and resist prosecution, eventually made this policy impossible to enforce, and by the late 1990s it was being relaxed in the U.S., and to some extent elsewhere (e.g., France). As late as 1997, NSA officials in the US were concerned that the widespread use of strong encryption will frustrate their ability to provide SIGINT regarding foreign entities, including terrorist groups operating internationally. NSA officials anticipated that the American encryption software backed by an extensive infrastructure, when marketed, was likely to become a standard for international communications.[4] In 1997, Louis Freeh, then the Director of the FBI, said For law enforcement, framing the issue is simple. In this time of dazzling telecommunications and computer technology where information can have extraordinary value, the ready availability of robust encryption is essential. No one in law enforcement disputes that. Clearly, in today's world and more so in the future, the ability to encrypt both contemporaneous communications and stored data is a vital component of information security. As is so often the case, however, there is another aspect to the encryption issue that if left unaddressed will have severe public safety and national security ramifications. Law enforcement is in unanimous agreement that the widespread use of robust non-key recovery encryption ultimately will devastate our ability to fight crime and prevent terrorism. Uncrackable encryption will allow drug lords, spies, terrorists and even violent gangs to communicate about their crimes and their conspiracies with impunity. We will lose one of the few remaining vulnerabilities of the worst criminals and terrorists upon which law enforcement depends to successfully investigate and often prevent the worst crimes. For this reason, the law enforcement community is unanimous in calling for a balanced solution to this problem.[5] Contents 1 History 1.1 Cold War era 1.2 PC era 1.3 Current status 2 U.S. export rules 2.1 Terminology 2.2 Classification 3 See also 4 References 5 External links History[edit] Cold War era[edit] In the early days of the Cold War, the U.S. and its allies developed an elaborate series of export control regulations designed to prevent a wide range of Western technology from falling into the hands of others, particularly the Eastern bloc. All export of technology classed as 'critical' required a license. CoCom was organized to coordinate Western export controls. Two types of technology were protected: technology associated only with weapons of war ("munitions") and dual use technology, which also had commercial applications. In the U.S., dual use technology export was controlled by the Department of Commerce, while munitions were controlled by the State Department. Since in the immediate post WWII period the market for cryptography was almost entirely military, the encryption technology (techniques as well as equipment and, after computers became important, crypto software) was included as "Category XI - Miscellaneous Articles" and later "Category XIII - Auxiliary Military Equipment" item into the United States Munitions List on November 17, 1954. The multinational control of the export of cryptography on the Western side of the cold war divide was done via the mechanisms of CoCom. By the 1960s, however, financial organizations were beginning to require strong commercial encryption on the rapidly growing field of wired money transfer. The U.S. Government's introduction of the Data Encryption Standard in 1975 meant that commercial uses of high quality encryption would become common, and serious problems of export control began to arise. Generally these were dealt with through case-by-case export license request proceedings brought by computer manufacturers, such as IBM, and by their large corporate customers. PC era[edit] Encryption export controls became a matter of public concern with the introduction of the personal computer. Phil Zimmermann's PGP cryptosystem and its distribution on the Internet in 1991 was the first major 'individual level' challenge to controls on export of cryptography. The growth of electronic commerce in the 1990s created additional pressure for reduced restrictions. VideoCipher II also used DES to scramble satellite TV audio. In 1989, non-encryption use of cryptography (such as access control and message authentication) was removed from export control with a Commodity Jurisdiction. [1] In 1992, an exception was formally added in the USML for non-encryption use of cryptography (and satellite TV descramblers) and a deal between NSA and the Software Publishers Association made 40-bit RC2 and RC4 encryption easily exportable using a Commodity Jurisdiction with special "7-day" and "15-day" review processes (which transferred control from the State Department to the Commerce Department). At this stage Western governments had, in practice, a split personality when it came to encryption; policy was made by the military cryptanalysts, who were solely concerned with preventing their 'enemies' acquiring secrets, but that policy was then communicated to commerce by officials whose job was to support industry. Shortly afterward, Netscape's SSL technology was widely adopted as a method for protecting credit card transactions using public key cryptography. Netscape developed two versions of its web browser. The "U.S. edition" supported full size (typically 1024-bit or larger) RSA public keys in combination with full size symmetric keys (secret keys) (128-bit RC4 or 3DES in SSL 3.0 and TLS 1.0). The "International Edition" had its effective key lengths reduced to 512 bits and 40 bits respectively (RSA_EXPORT with 40-bit RC2 or RC4 in SSL 3.0 and TLS 1.0).[6] Acquiring the 'U.S. domestic' version turned out to be sufficient hassle that most computer users, even in the U.S., ended up with the 'International' version,[7] whose weak 40-bit encryption can currently be broken in a matter of days using a single computer. A similar situation occurred with Lotus Notes for the same reasons. Legal challenges by Peter Junger and other civil libertarians and privacy advocates, the widespread availability of encryption software outside the U.S., and the perception by many companies that adverse publicity about weak encryption was limiting their sales and the growth of e-commerce, led to a series of relaxations in US export controls, culminating in 1996 in President Bill Clinton signing the Executive Order 13026 transferring the commercial encryption from the Munition List to the Commerce Control List. Furthermore, the order stated that, "the software shall not be considered or treated as 'technology'" in the sense of Export Administration Regulations. The Commodity Jurisdiction process was replaced with a Commodity Classification process, and a provision was added to allow export of 56-bit encryption if the exporter promised to add "key recovery" backdoors by the end of 1998. In 1999, the EAR was changed to allow 56-bit encryption (based on RC2, RC4, RC5, DES or CAST) and 1024-bit RSA to be exported without any backdoors, and new SSL cipher suites were introduced to support this (RSA_EXPORT1024 with 56-bit RC4 or DES). In 2000, the Department of Commerce implemented rules that greatly simplified the export of commercial and open source software containing cryptography, including allowing the key length restrictions to be removed after going through the Commodity Classification process (to classify the software as "retail") and adding an exception for publicly available encryption source code.[8] Current status[edit] This section needs to be updated. Please help update this article to reflect recent events or newly available information. (October 2016) As of 2009[update], non-military cryptography exports from the U.S. are controlled by the Department of Commerce's Bureau of Industry and Security.[9] Some restrictions still exist, even for mass market products, particularly with regard to export to "rogue states" and terrorist organizations. Militarized encryption equipment, TEMPEST-approved electronics, custom cryptographic software, and even cryptographic consulting services still require an export license[9](pp. 6–7). Furthermore, encryption registration with the BIS is required for the export of "mass market encryption commodities, software and components with encryption exceeding 64 bits" (75 FR 36494). In addition, other items require a one-time review by, or notification to, BIS prior to export to most countries.[9] For instance, the BIS must be notified before open-source cryptographic software is made publicly available on the Internet, though no review is required.[10] Export regulations have been relaxed from pre-1996 standards, but are still complex.[9] Other countries, notably those participating in the Wassenaar Arrangement,[11] have similar restrictions.[12] U.S. export rules[edit] U.S. non-military exports are controlled by Export Administration Regulations (EAR), a short name for the U.S. Code of Federal Regulations (CFR) Title 15 chapter VII, subchapter C. Encryption items specifically designed, developed, configured, adapted or modified for military applications (including command, control and intelligence applications) are controlled by the Department of State on the United States Munitions List. Terminology[edit] Encryption export terminology is defined in EAR part 772.1.[13] In particular: Encryption Component is an encryption commodity or software (but not the source code), including encryption chips, integrated circuits etc. Encryption items include non-military encryption commodities, software, and technology. Open cryptographic interface is a mechanism which is designed to allow a customer or other party to insert cryptographic functionality without the intervention, help or assistance of the manufacturer or its agents. Ancillary cryptography items are the ones primarily used not for computing and communications, but for digital right management; games, household appliances; printing, photo and video recording (but not videoconferencing); business process automation; industrial or manufacturing systems (including robotics, fire alarms and HVAC); automotive, aviation and other transportation systems. Export destinations are classified by the EAR Supplement No. 1 to Part 740 into four country groups (A, B, D, E) with further subdivisions;[14] a country can belong to more than one group. For the purposes of encryption, groups B, D:1, and E:1 are important: B is a large list of countries that are subject to relaxed encryption export rules D:1 is a short list of countries that are subject to stricter export control. Notable countries on this list include China and Russia E:1 is a very short list of "terrorist-supporting" countries (as of 2009, includes five countries; previously contained six countries and was also called "terrorist 6" or T-6) The EAR Supplement No. 1 to Part 738 (Commerce Country Chart) contains the table with country restrictions.[15] If a line of table that corresponds to the country contains an X in the reason for control column, the export of a controlled item requires a license, unless an exception can be applied. For the purposes of encryption, the following three reasons for control are important: NS1 National Security Column 1 AT1 Anti-Terrorism Column 1 EI Encryption Items is currently same as NS1 Classification[edit] For export purposes each item is classified with the Export Control Classification Number (ECCN) with the help of the Commerce Control List (CCL, Supplement No. 1 to the EAR part 774). In particular:[9] 5A002 Systems, equipment, electronic assemblies, and integrated circuits for "information security. Reasons for Control: NS1, AT1. 5A992 "Mass market" encryption commodities and other equipment not controlled by 5A002. Reason for Control: AT1. 5B002 Equipment for development or production of items classified as 5A002, 5B002, 5D002 or 5E002. Reasons for Control: NS1, AT1. 5D002 Encryption software. Reasons for control: NS1, AT1. used to develop, produce, or use items classified as 5A002, 5B002, 5D002 supporting technology controlled by 5E002 modeling the functions of equipment controlled by 5A002 or 5B002 used to certify software controlled by 5D002 5D992 Encryption software not controlled by 5D002. Reasons for control: AT1. 5E002 Technology for the development, production or use of equipment controlled by 5A002 or 5B002 or software controlled by 5D002. Reasons for control: NS1, AT1. 5E992 Technology for the 5x992 items. Reasons for control: AT1. An item can be either self-classified, or a classification ("review") requested from the BIS. A BIS review is required for typical items to get the 5A992 or 5D992 classification. See also[edit] Bernstein v. United States Denied trade screening Junger v. Daley Restrictions on the import of cryptography FREAK Crypto wars References[edit] ^ "Munitions T-shirt". ^ Department of State -- International Traffic in Arms Regulations, April 1, 1992, Sec 121.1 ^ Kahn, The Codebreakers, Ch. 19 ^ The encryption debate: Intelligence aspects. See reference below, p. 4 ^ Statement of Louis J. Freeh, Director, Federal Bureau of Investigation before the Senate Judiciary Committee. July 9, 1997 ^ "Fortify for Netscape". www.fortify.net. Retrieved 1 Dec 2017. ^ "January 25, 1999 archive of the Netscape Communicator 4.61 download page showing a more difficult path to download 128-bit version". Archived from the original on September 16, 1999. Retrieved 2017-03-26.CS1 maint: bot: original URL status unknown (link) ^ "Revised U.S. Encryption Export Control Regulations". EPIC copy of document from U.S. Department of Commerce. January 2000. Retrieved 2014-01-06. ^ a b c d e Commerce Control List Supplement No. 1 to Part 774 Category 5 Part 2 - Info. Security ^ "U. S. Bureau of Industry and Security - Notification Requirements for "Publicly Available" Encryption Source Code". Bis.doc.gov. 2004-12-09. Archived from the original on 2002-09-21. Retrieved 2009-11-08. ^ Participating States Archived 2012-05-27 at archive.today The Wassenaar Arrangement ^ Wassenaar Arrangement on Export Controls for Conventional Arms and Dual-Use Goods and Technologies: Guidelines & Procedures, including the Initial Elements The Wassenaar Arrangement, December 2009 ^ "EAR Part 772" (PDF). Archived from the original (PDF) on 2009-05-09. Retrieved 2009-06-27. ^ "EAR Supplement No. 1 to Part 740" (PDF). Archived from the original (PDF) on 2009-06-18. Retrieved 2009-06-27. ^ "EAR Supplement No. 1 to Part 738" (PDF). Archived from the original (PDF) on 2009-05-09. Retrieved 2009-06-27. External links[edit] Crypto law survey Bureau of Industry and Security — An overview of the US export regulations can be found in the licensing basics page. Whitfield Diffie and Susan Landau, The Export of Cryptography in the 20th and the 21st Centuries. In Karl de Leeuw, Jan Bergstra, ed. The history of information security. A comprehensive handbook. Elsevier, 2007. p. 725 Encryption Export Controls. CRS Report for Congress RL30273. Congressional Research Service, ˜The Library of Congress. 2001 The encryption debate: Intelligence aspects. CRS Report for Congress 98-905 F. Congressional Research Service, ˜The Library of Congress. 1998 Encryption Technology: Congressional Issues CRS Issue Brief for Congress IB96039. Congressional Research Service, ˜The Library of Congress. 2000 Cryptography and Liberty 2000. An International Survey of Encryption Policy. Electronic Privacy Information Center. Washington, DC. 2000 National Research Council, Cryptography's Role in Securing the Information Society. National Academy Press, Washington, D.C. 1996 (full text link is available on the page). The Evolution of US Government Restrictions on Using and Exporting Encryption Technologies (U), Micheal Schwartzbeck, Encryption Technologies, circa 1997, formerly Top Secret, approved for release by NSA with redactions September 10, 2014, C06122418 v t e TLS and SSL Protocols and technologies Transport Layer Security / Secure Sockets Layer (TLS/SSL) Datagram Transport Layer Security (DTLS) Server Name Indication (SNI) Application-Layer Protocol Negotiation (ALPN) DNS-based Authentication of Named Entities (DANE) DNS Certification Authority Authorization (CAA) HTTPS HTTP Strict Transport Security (HSTS) HTTP Public Key Pinning (HPKP) OCSP stapling Opportunistic TLS Perfect forward secrecy Public-key infrastructure Automated Certificate Management Environment (ACME) Certificate authority (CA) CA/Browser Forum Certificate policy Certificate revocation list (CRL) Domain-validated certificate (DV) Extended Validation Certificate (EV) Online Certificate Status Protocol (OCSP) Public key certificate Public-key cryptography Public key infrastructure (PKI) Root certificate Self-signed certificate See also Domain Name System Security Extensions (DNSSEC) Internet Protocol Security (IPsec) Secure Shell (SSH) History Export of cryptography from the United States Server-Gated Cryptography Implementations Bouncy Castle BoringSSL Botan BSAFE cryptlib GnuTLS JSSE LibreSSL MatrixSSL mbed TLS NSS OpenSSL S2n SChannel SSLeay stunnel wolfSSL Notaries Certificate Transparency Convergence HTTPS Everywhere Perspectives Project Vulnerabilities Theory Man-in-the-middle attack Padding oracle attack Cipher Bar mitzvah attack Protocol BEAST BREACH CRIME DROWN Logjam POODLE (in regards to SSL 3.0) Implementation Certificate authority compromise Random number generator attacks FREAK goto fail Heartbleed Lucky Thirteen attack POODLE (in regards to TLS 1.0) Kazakhstan MITM attack Retrieved from "https://en.wikipedia.org/w/index.php?title=Export_of_cryptography_from_the_United_States&oldid=1000739211" Categories: Computer law Export and import control of cryptography United States trade policy Transport Layer Security Hidden categories: CS1 maint: bot: original URL status unknown Webarchive template archiveis links Articles with short description Short description matches Wikidata Wikipedia introduction cleanup from February 2010 All pages needing cleanup Articles covered by WikiProject Wikify from February 2010 All articles covered by WikiProject Wikify Wikipedia articles in need of updating from October 2016 All Wikipedia articles in need of updating Articles containing potentially dated statements from 2009 All articles containing potentially dated statements Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages 日本語 中文 Edit links This page was last edited on 16 January 2021, at 13:36 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-3674 ---- Philip Agre - Wikipedia Philip Agre From Wikipedia, the free encyclopedia (Redirected from Philip E. Agre) Jump to navigation Jump to search Internet researcher and educator This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article needs additional or more specific categories. Please help out by adding categories to it so that it can be listed with similar articles. (June 2020) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Philip Agre" – news · newspapers · books · scholar · JSTOR (March 2021) (Learn how and when to remove this template message) (Learn how and when to remove this template message) Philip E. Agre is an AI researcher turned humanities professor, formerly a faculty member at the University of California, Los Angeles. He is known for his critiques of technology.[1] He was successively the publisher of The Network Observer (TNO) and The Red Rock Eater News Service (RRE). TNO ran from January 1994 to July 1996. RRE, an influential mailing list he started in the mid-1990s, ran for around a decade. A mix of news, Internet policy and politics, RRE served as a model for many of today's political blogs and online newsletters. Agre was reported missing on October 16, 2009. He was found on January 16, 2010, but never returned to public life.[1] Contents 1 Biography 2 "Surveillance and Capture" 3 Disappearance 4 Publications 4.1 Books and chapters 4.2 Selected academic works 4.3 Other articles in the media 5 References 6 External links Biography[edit] Agre grew up in Maryland and attended college early.[1] Agre and his collaborator David Chapman started their PhDs under the supervision of Michael Brady at the MIT AI Lab. Upon Brady's departure for Oxford, they switched to a then-recent arrival at the laboratory, Rodney Brooks. Brooks gave the two young scientists relatively free rein, but together the three were seen as early major researchers in Nouvelle AI, an approach to artificial intelligence emphasizing behavior as emerging in interaction with the environment rather than the entire codification of behavior. This is illustrated by Agre and Chapman's 1989 article, "What are plans for?"[2] This work is considered seminal to reactive planning, though neither researcher approved of the term. Agre went on to receive his doctorate in Electrical Engineering and Computer Science from MIT in 1989.[3] He went on to take up a position in the University of Chicago Department of Computer Science, later joining the School of Cognitive and Computing Sciences (now the School of Informatics) at the University of Sussex and finally the Department of Communication at the University of California, San Diego. "Surveillance and Capture"[edit] Agre's essay "Surveillance and Capture" deals with privacy and surveillance issues made possible by our constantly evolving technological age. Influential works preceding this essay include George Orwell's Nineteen Eighty-Four (1949), Hans Magnus Enzensberger's Constituents of a Theory of the Media (1970), and Michel Foucault's works surrounding the concept of panopticism.[4] Foucault argues that a constant exercise of such surveillance is not necessary, since its mere possibility induces self-restrained action among the inmates.[4] Disappearance[edit] On October 16, 2009, Agre's sister filed a missing persons report for Agre.[5] She indicated that she had not seen him since the spring of 2008 and became concerned when she learned that he had abandoned his apartment and job sometime between December 2008 and May 2009.[5] Agre was found by the LA County Sheriff's Department on January 16, 2010, and was deemed in good health and self-sufficient.[6] Publications[edit] Books and chapters[edit] Agre, Philip E. (2004). "Social Skills and the Progress of Citizenship". In Feenberg, Andrew; Barney, Darin (eds.). Community in the Digital Age: Philosophy and Practice. Lanham: Rowman & Littlefield. ISBN 978-0-7425-2959-5. —————— (2004). "Internet Research: For and Against". In Consalvo, Mia; Baym, Nancy; Hussinger, Jeremy; Jensen, Klaus Bruhn; Logie, John; Murero, Monica; Shade, Leslie Regan (eds.). Internet Research Annual: Selected Papers from the Association of Internet Researchers Conferences, 2000-2002. 1. New York: Peter Lang. ISBN 978-0-8204-6840-2. —————— (2003). "Information and Institutional Change: The Case of Digital Libraries". In Bishop, Ann P.; Van House, Nancy A.; Buttenfield, Barbara P. (eds.). Digital Library Use: Social Practice in Design and Evaluation. Cambridge: MIT Press. ISBN 978-0-262-02544-7. —————— (2003). "Writing and Representation". In Mateas, Michael; Sengers, Phoebe (eds.). Narrative Intelligence. Amsterdam: John Benjamins Publishing Company. ISBN 978-90-272-5171-8. —————— (2002). "The Practical Logic of Computer Work". In Scheutz, Matthias (ed.). Computationalism: New Directions. Cambridge: MIT Press. ISBN 978-0-262-19478-5. —————— (1998). "Designing Genres for New Media: Social, Economic, and Political Contexts". In Jones, Steven G. (ed.). Cybersociety 2.0: Revisiting Computer-Mediated Communication and Community. Thousand Oaks: SAGE Publications. pp. 69–100. doi:10.4135/9781452243689.n3. ISBN 978-0-7619-1462-4. —————— (1997). Computation and Human Experience. Cambridge: Cambridge University Press. ISBN 978-0-521-38603-6. —————— (1997). "Living Math: Lave and Walkerdine on the Meaning of Everyday Arithmetic". In Kirshner, David; Whitson, James A. (eds.). Situated Cognition: Social, Semiotic, and Psychological Perspectives. Mahwah: Lawrence Erlbaum Associates, Publishers. ISBN 978-0-8058-2037-9. . —————— (1997). "Introduction: Computing as a Social Practice". In Agre, Philip E.; Schuler, Douglas (eds.). Reinventing Technology, Rediscovering Community: Critical Explorations of Computing as a Social Practice. Greenwich: Ablex Publishing. ISBN 978-1-56750-258-9. —————— (1997). "Beyond the Mirror World: Privacy and the Representational Practices of Computing". In Agre, Philip E.; Rotenberg, Marc (eds.). Technology and Privacy: The New Landscape. Cambridge: MIT Press. ISBN 978-0-262-01162-4. —————— (1997). "Toward a Critical Technical Practice: Lessons Learned in Trying to Reform AI". In Bowker, Geoffrey C; Gasser, Les; Star, Susan Leigh; Turner, William (eds.). Bridging the Great Divide: Social Science, Technical Systems, and Cooperative Work. Mahwah: Lawrence Erlbaum Associates, Publishers. ISBN 978-0-8058-2403-2. —————— (1996). "Introduction: Computational Theories of Interaction and Agency". In Agre, Philip E.; Rosenschein, Stanley J. (eds.). Computational Theories of Interaction and Agency. Cambridge: MIT Press. ISBN 978-0-2625-1090-5. Selected academic works[edit] Agre, Philip E. (2003). "Hierarchy and History in Simon's "Architecture of Complexity"". Journal of the Learning Sciences. 12 (3): 413–426. doi:10.1207/S15327809JLS1203_4 – via Taylor & Francis Online. —————— (2003). "P2P and the Promise of Internet Equality". Communications of the ACM. 46 (2): 39–42. doi:10.1145/606272.606298 – via ACM Digital Library. —————— (2002). "Real-Time Politics: The Internet and the Political Process". The Information Society. 18 (5): 311–331. doi:10.1080/01972240290075174 – via Taylor & Francis Online. —————— (2002). "Cyberspace As American Culture". Science as Culture. 11 (2): 171–189. doi:10.1080/09505430220137234 – via Taylor & Francis Online. —————— (2001). "Changing Places: Contexts of Awareness in Computing". Human-Computer Interaction. 16 (2–4): 177–192. doi:10.1207/S15327051HCI16234_04 – via Taylor & Francis Online. —————— (2001). "Supporting the Intellectual Life of a Democratic Society". Ethics and Information Technology. 3 (4): 289–298. doi:10.1023/A:1013837409419 – via SpringerLink. —————— (2000). "The Market Logic of Information". Knowledge, Technology & Policy. 13 (3): 67–77. doi:10.1007/s12130-000-1021-y – via SpringerLink. —————— (2000). "Commodity and Community: Institutional Design for the Networked University". Planning for Higher Education. 29 (2): 5–14 – via Society for College and University Planning. —————— (2000). "Infrastructure and Institutional Change in the Networked University". Information, Communication & Society. 3 (4): 494–507. doi:10.1080/13691180010002323 – via Taylor & Francis Online. —————— (1999). "The Distances of Education". Academe. 85 (5): 37–41 – via University of California, Los Angeles. —————— (1999). "Information Technology in Higher Education: The "Global Academic Village" and Intellectual Standardization". On the Horizon. 7 (5): 8–11. ISSN 1074-8121 – via University of California, Los Angeles. —————— (1999). "The Architecture of Identity: Embedding Privacy in Market Institutions". Information, Communication & Society. 2 (1): 1–25. doi:10.1080/136911899359736 – via Taylor & Francis Online. ——————; Horswill, Ian (1997). "Lifeworld analysis" (PDF). Journal of Artificial Intelligence Research. 6 (1): 111–145 – via Google Scholar. —————— (1995). "Institutional Circuitry: Thinking About the Forms and Uses of Information". Information Technology and Libraries. 14 (4): 225–230 – via University of California, Los Angeles. —————— (1995). Guzeldere, Guven; Franchi, Stefano (eds.). "Constructions of the Mind: Artificial Intelligence and the Humanities". Stanford Humanities Review. 4 (2): 1–19 – via University of California, Los Angeles. —————— (1982). "The Assq Chip and Its Progeny". MIT Artificial Intelligence Laboratory Working Papers (WP-225). MIT Artificial Intelligence Laboratory: 1–25 – via MIT Libraries. Cite journal requires |journal= (help) Other articles in the media[edit] Agre, Philip E. (December 2006). "Welcome to the Always-On World". IEEE Spectrum. pp. 10, 13. Archived from the original on December 6, 2006. —————— (Winter 2001). "Your Face Is Not a Bar Code: Arguments Against Automatic Face Recognition in Public Places". Whole Earth Review. No. 106. pp. 74–77. —————— (1999). "Life After Cyberspace". EASST Review. Vol. 18 no. 2/3. European Association for the Study of Science and Technology. pp. 3–5. —————— (July 3, 1998). "Yesterday's Tomorrow". Times Literary Supplement. News UK. pp. 3–4. ISSN 0307-661X. References[edit] ^ a b c "He predicted the dark side of the Internet 30 years ago. Why did no one listen?". Washington Post. ISSN 0190-8286. Retrieved 2021-08-12. ^ Agre, Phil; Chapman, David (1990). "What are plans for?". Robotics and Autonomous Systems. 6 (1–2): 17–34. doi:10.1016/S0921-8890(05)80026-0. hdl:1721.1/6487 – via ScienceDirect. ^ "The dynamic structure of everyday life". dspace.mit.edu. Massachusetts Institute of Technology. hdl:1721.1/14422. Archived from the original on September 12, 2015. Retrieved 2013-11-08. ^ a b Montfort, Nick, and Noah Wardrip-Fruin. "Surveillance and Capture: Two Models of Privacy." The New Media Reader. Cambridge, Mass.: MIT, 2003. 737-760. Print. ^ a b Pescovitz, David (November 24, 2009). "Missing: Phil Agre, internet scholar". Boing Boing. Retrieved January 30, 2013. ^ Carvin, Andy (January 30, 2010). "Missing Internet Pioneer Phil Agre Is Found Alive". NPR. Retrieved January 30, 2013. External links[edit] former Home Page for Agre at UCLA Authority control General VIAF 1 WorldCat National libraries United States Netherlands Scientific databases DBLP (computer science) Retrieved from "https://en.wikipedia.org/w/index.php?title=Philip_Agre&oldid=1038653423" Categories: Artificial intelligence researchers Cognitive scientists Computer scientists Human–computer interaction researchers Living people UCLA Graduate School of Education and Information Studies faculty Hidden categories: Articles with short description Short description is different from Wikidata Articles needing additional categories from June 2020 Articles needing additional references from March 2021 All articles needing additional references Articles with multiple maintenance issues CS1 errors: missing periodical Wikipedia articles with VIAF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with NTA identifiers Wikipedia articles with DBLP identifiers Wikipedia articles with WORLDCATID identifiers Year of birth missing (living people) Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Add links This page was last edited on 13 August 2021, at 21:33 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-3771 ---- Unicorn (finance) - Wikipedia Unicorn (finance) From Wikipedia, the free encyclopedia Jump to navigation Jump to search Startup company valued at over $1 billion In business, a unicorn is a privately held startup company valued at over $1 billion.[1]:1270[2] The term was coined in 2013 by venture capitalist Aileen Lee, choosing the mythical animal to represent the statistical rarity of such successful ventures.[3][4][5][6] Decacorn is a word used for those companies over $10 billion,[7] while hectocorn is used for such a company valued over $100 billion. According to CB Insights, there are more than 700 unicorns as of June 2021[update].[8] The largest unicorns included ByteDance, Stripe and SpaceX. According to CB Insights, there are now 30 decacorns in the world, including Stripe, SpaceX, and Klarna.[8] Contents 1 History 2 Reasons behind the rapid growth of unicorns 2.1 Fast-growing strategy 2.2 Company buyouts 2.3 Increase of private capital available 2.4 Prevent IPO 2.5 Technological advancements 3 Valuation 3.1 Valuation of high-growth companies 3.1.1 Market sizing 3.1.2 Estimation of finances 3.1.3 Working back to the present 4 Trends 4.1 Sharing economy 4.2 E-commerce 4.3 Innovative business model 5 Data 5.1 Data as of March 13, 2018 6 See also 7 References 8 External links History[edit] When Aileen Lee originally coined the term "unicorn" in 2013, there were only thirty-nine companies that were considered unicorns.[9] In a different study done by the Harvard Business Review, it was determined that startups founded between 2012 and 2015 were growing in valuation twice as fast as companies from startups founded between 2000 and 2013.[10] In 2018, 16 U.S. companies became unicorns, resulting in 119 private companies worldwide valued at $1 billion or more.[11] Reasons behind the rapid growth of unicorns[edit] Fast-growing strategy[edit] According to academics in 2007, investors and venture capital firms are adopting the get big fast (GBF) strategy for startups, also known as Blitzscaling. GBF is a strategy where a startup tries to expand at a high rate through large funding rounds and price cutting to gain an advantage on market share and push away rival competitors as fast as possible.[12] The rapid returns through this strategy seems to be attractive to all parties involved. However, there is always the cautionary note of the dot-com bubble of 2000 and the lack of long-term sustainability in value creation of the companies born from the Internet age. Company buyouts[edit] Many unicorns were created through buyouts from large public companies. In a low-interest-rate and slow-growth environment, many companies like Apple, Facebook, and Google focus on acquisitions instead of focusing on capital expenditures and development of internal investment projects.[13] Some large companies would rather bolster their businesses through buying out established technology and business models rather than creating it themselves. Increase of private capital available[edit] The average age of a technology company before it goes public is 11 years, as opposed to an average life of four years back in 1999.[14] This new dynamic stems from the increased amount of private capital available to unicorns and the passing of the U.S.'s Jumpstart Our Business Startups (JOBS) Act in 2012, which increased by a factor of four the number of shareholders a company can have before it has to disclose its financials publicly. The amount of private capital invested in software companies has increased three-fold from 2013 to 2015.[15] Prevent IPO[edit] Through many funding rounds, companies do not need to go through an initial public offering (IPO) to obtain a capital or a higher valuation; they can just go back to their investors for more capital. IPOs also run the risk of devaluation of a company if the public market thinks a company is worth less than its investors.[15] A few recent examples of this situation were Square, best known for its mobile payments and financial services business, and Trivago, a popular German hotel search engine, both of which were priced below their initial offer prices by the market.[16][17] This was because of the severe over-valuation of both companies in the private market by investors and venture capital firms. The market did not agree with both companies' valuations, and therefore, dropped the price of each stock from their initial IPO range. Investors and startups also do not want to deal with the hassle of going public because of increased regulations. Regulations like the Sarbanes–Oxley Act have implemented more stringent regulations following several bankruptcy cases in the U.S. market that many of these companies want to avoid.[13] Technological advancements[edit] Startups are taking advantage of the flood of new technology of the last decade to obtain Unicorn status. With the explosion of social media and access to millions utilizing this technology to gain massive economies of scale, startups have the ability to expand their business faster than ever.[13] New innovations in technology including mobile smartphones, P2P platforms, and cloud computing with the combination of social media applications has aided in the growth of unicorns. Valuation[edit] The valuations that lead these start-up companies to become unicorns and decacorns are unique compared to more established companies. A valuation for an established company stems from past years' performances, while a start-up company's valuation is derived from its growth opportunities and its expected development in the long term for its potential market.[18] Valuations for unicorns usually come from funding rounds of large venture capital firms investing in these start-up companies. Another significant final valuation of start-ups is when a much larger company buys out a unicorn and gives them that valuation. Recent examples are when Unilever bought Dollar Shave Club[19] and when Facebook bought Instagram[20] for $1 billion, effectively turning Dollar Shave Club and Instagram into unicorns. Bill Gurley, a partner at venture capital firm Benchmark predicted in March 2015 and earlier that the rapid increase in the number of unicorns may "have moved into a world that is both speculative and unsustainable", that will leave in its wake what he terms "dead unicorns".[21][22][23] Also he said that the main reason of Unicorns' valuation is the "excessive amount of money" available for them.[24] Similarly, in 2015 William Danoff who manages the Fidelity Contrafund said unicorns might be "going to lose a bit of luster" due to their more frequent occurrence and several cases of their stock price being devalued.[25] Research by Stanford professors published in 2018 suggests that unicorns are overvalued by an average of 48%.[26][27] Valuation of high-growth companies[edit] For high-growth companies looking for the highest valuations possible, it comes down to potential and opportunity. When investors of high-growth companies are deciding on whether they should invest in a company or not, they look for signs of a home run to make exponential returns on their investment along with the right personality that fits the company.[28] To give such high valuations in funding rounds, venture capital firms have to believe in the vision of both the entrepreneur and the company as a whole. They have to believe the company can evolve from its unstable, uncertain present standing into a company that can generate and sustain moderate growth in the future.[18] Market sizing[edit] To judge the potential future growth of a company, there needs to be an in-depth analysis of the target market.[18] When a company or investor determines its market size, there are a few steps they need to consider to figure out how large the market really is:[29] Defining the sub-segment of the market (no company can target 100% market share, also known as monopolization) Top-Down market sizing[30] Bottom-Up analysis[30] Competitor analysis After the market is reasonably estimated, a financial forecast can be made based on the size of the market and how much a company thinks it can grow in a certain time period. Estimation of finances[edit] To properly judge the valuation of a company after the revenue forecast is completed, a forecast of the operating margin, analysis of needed capital investments, and return on invested capital needs to be completed to judge the growth and potential return to investors of a company.[18] Assumptions of where a company can grow to needs to be realistic, especially when trying to get venture capital firms to give the valuation a company wants. Venture capitalists know the payout on their investment will not be realized for another five to ten years, and they want to make sure from the start that financial forecasts are realistic.[28] Working back to the present[edit] With the financial forecasts set, investors need to know what the company should be valued in the present day. This is where more established valuation methods become more relevant. This includes the three most common valuation methods:[31] Discounted cash flow analysis Market comparable method Comparable transactions Investors can derive a final valuation from these methods and the amount of capital they offer for a percentage of equity within a company becomes the final valuation for a startup. Competitor financials and past transactions also play an important part when providing a basis for valuing a startup and finding a correct valuation for these companies. Trends[edit] Sharing economy[edit] The sharing economy, also known as "collaborative consumption" or "on-demand economy", is based on the concept of sharing personal resources. This trend of sharing resources has made three of the top five largest unicorns (Uber, DiDi, and Airbnb) become the most valuable startups in the world. The economic trends of the 2010s powered consumers to learn to be more conservative with spending and the sharing economy reflected this.[32] E-commerce[edit] E-commerce and the innovation of the online marketplace have been slowly taking over the needs for physical locations of store brands. A prime example of this is the decline of malls within the United States, the sales of which declined from $87.46 billion in 2005 to $60.65 billion in 2015.[33] The emergence of e-commerce companies like Amazon and Alibaba (both unicorns before they went public) has decreased the need for physical locations to buy consumer goods. Many large corporations have seen this trend for a while and have tried to adapt to the e-commerce trend. Walmart in 2016 bought Jet.com, an American e-commerce company, for $3.3 billion to try to adapt to consumer preferences.[34] Innovative business model[edit] In support of the sharing economy, unicorns and successful startups have built an operating model defined as "network orchestrators".[35] In this business model, there is a network of peers creating value through interaction and sharing. Network orchestrators may sell products/services, collaborate, share reviews, and build relations through their businesses. Examples of network orchestrators include all sharing economy companies (i.e. Uber, Airbnb), companies that let consumers share information (i.e. TripAdvisor, Yelp), and peer-to-peer or business-to-person selling platforms (i.e. Amazon, Alibaba). Data[edit] Data as of March 13, 2018[edit] Number of unicorns: 279 Total combined valuation of unicorns: $1 trillion Total amount of capital raised: $205.8 billion Number of new tech unicorns in 2016: 25 (down 68% YoY) Total number of new unicorns in 2016: 51[8][36] See also[edit] List of unicorn startup companies List of venture capital firms Unicorn bubble Valuation (finance) Venture capital financing References[edit] ^ Hirst, Scott; Kastiel, Kobi (2019-05-01). "Corporate Governance by Index Exclusion". Boston University Law Review. 99 (3): 1229. ^ Cristea, Ioana A.; Cahan, Eli M.; Ioannidis, John P. A. (April 2019). "Stealth research: Lack of peer‐reviewed evidence from healthcare unicorns". European Journal of Clinical Investigation. 49 (4): e13072. doi:10.1111/eci.13072. ISSN 0014-2972. PMID 30690709. ^ Rodriguez, Salvador (September 3, 2015). "The Real Reason Everyone Calls Billion-Dollar Startups 'Unicorns'". International Business Times. IBT Media Inc. Retrieved January 3, 2017. ^ Lee, Aileen (2013). "Welcome To The Unicorn Club: Learning From Billion-Dollar Startups". TechCrunch. Retrieved 26 December 2015. 39 companies belong to what we call the 'Unicorn Club' (by our definition, U.S.-based software companies started since 2003 and valued at over $1 billion by public or private market investors)... about .07 percent of venture-backed consumer and enterprise software startups ^ Griffith, Erin & Primack, Dan (2015). "The Age of Unicorns". Fortune. Retrieved 26 December 2015. Subtitle: The billion-dollar tech startup was supposed to be the stuff of myth. Now they seem to be... everywhere. ^ Chohan, Usman (2016). "It's Hard to Hate a Unicorn, Until it Gores You". The Conversation. Retrieved 26 October 2016. ^ Roberts, Daniel & Nusca, Andrew (2015). "The Unicorn List". Fortune. Retrieved 26 December 2015. ^ a b c "The Global Unicorn Club". CB Insights. Retrieved 2021-07-01. ^ Fan, Jennifer S. "Regulating Unicorns: Disclosure and the New Private Economy." BCL Rev. 57 (2016): 583. ^ "How Unicorns Grow". Harvard Business Review. Retrieved 2017-03-30. ^ Levi Sumagaysay (October 9, 2018). "Venture capital: Bay Area's Lucid Motors, Zoox, Uber scored the most in third quarter". Mercury News. Retrieved October 15, 2018. ^ Sterman, J. D., Henderson, R., Beinhocker, E. D., & Newman, L. I. (2007). Getting big too fast: Strategic dynamics with increasing returns and bounded rationality. Management Science, 53(4), 683-696. ^ a b c Howe, Neil. "What's Feeding The Growth Of The Billion-Dollar 'Unicorn' Startups?". Forbes. Retrieved 2017-03-30. ^ "To fly, to fall, to fly again". The Economist. 2015-07-25. ISSN 0013-0613. Retrieved 2017-03-30. ^ a b "Grow fast or die slow: Why unicorns are staying private". McKinsey & Company. Retrieved 2017-03-30. ^ Demos, Telis; Driebusch, Corrie (2015-11-19). "Square's $9-a-Share Price Deals Blow to IPO Market". Wall Street Journal. ISSN 0099-9660. Retrieved 2017-03-31. ^ Balakrishnan, Anita (2016-12-16). "Trivago IPO opens at $11.20 after pricing at $11, below its expected range". CNBC. Retrieved 2017-03-31. ^ a b c d "Valuing high-tech companies". McKinsey & Company. Retrieved 2017-03-30. ^ "Unilever Buys Dollar Shave Club for $1 Billion". Fortune. Retrieved 2017-03-30. ^ Raice, Shayndi; Ante, Spencer E. (2012-04-10). "Insta-Rich: $1 Billion for Instagram". Wall Street Journal. ISSN 0099-9660. Retrieved 2017-03-30. ^ Winkler, Rolfe (2015). "Bill Gurley Sees Silicon Valley on a Dangerous Path". The Wall Street Journal. Retrieved 26 December 2015. Subtitle: Subtitle: Venture capitalist says companies hurt themselves by trying to delay going public ^ Blodget, Henry (2008). "Tech: How To Survive Great Depression 2.0 Without Firing Everyone". Business Insider. Retrieved 26 December 2015. It seems every serious venture capital firm has now had a chat with its portfolio companies about how it[']s time to fire people... VC-extraordinaire Bill Gurley's Benchmark has had the same chat with its companies, but Bill tells peHUB that there's actually an alternative to canning half your company: Move to San Jose ^ Griffith, Erin (2015). "Bill Gurley Predicts 'Dead Unicorns' in Startup-Land this Year". Fortune. Retrieved 26 December 2015. Subtitle: A crash would affect more than just startups. ... Bill Gurley, the prominent investor behind Uber and Snapchat, has been sounding the tech bubble alarm for months now. He's preached about the dangerous appetite for risk in the market, the alarmingly high burn rates and the excess of capital sloshing around in Silicon Valley. “There is no fear in Silicon Valley right now,” he said. “A complete absence of fear.” He added that more people are employed by money-losing companies in Silicon Valley than ever before. Will there be a crash? “I do think you’ll see some dead unicorns this year,” he said, using the term used to describe startups with valuations higher than $1 billion. ^ Rob Price (2018). "Legendary investor Bill Gurley says that there's a 'systematic problem in Silicon Valley' because it's too easy to get cash". Business Insider. Retrieved 12 March 2018. There's so much easy money in the tech industry, entrepreneurs can afford not to be accountable to their investors. That "excessive amount of money," he says, can inflate a startup's valuation — even if they don't deserve it. ^ Reuters (01 December 2015). Fidelity star Danoff grows cautious about unicorn phenomenon, CNBC.com, accessed 31 Jan 2020 ^ Gornall and Strebulaev (2018). "Squaring Venture Capital Valuations with Reality". Stanford University Working Paper. SSRN 2955455. We develop a valuation model for venture capital-backed companies and apply it to 135 U.S. unicorns -- private companies with reported valuations above $1 billion. We value unicorns using financial terms from legal filings and find reported unicorn post-money valuations average 48% above fair value, with 13 being more than 100% above. ^ Sorkin, Andrew (2017). "How Valuable Is a Unicorn? Maybe Not as Much as It Claims to Be". New York Times. Retrieved 11 March 2018. The average unicorn is worth half the headline price tag that is put out after each new valuation. ^ a b MacMillan, I. C., Siegel, R., & Narasimha, P. S. (1985). Criteria used by venture capitalists to evaluate new venture proposals. Journal of Business venturing, 1(1), 119-128. ^ Zhuo, Tx (2016-03-07). "5 Strategies to Effectively Determine Your Market Size". Entrepreneur. Retrieved 2017-03-30. ^ a b "Market Sizing: Is There A Market Size Formula? | B2B International". B2B International. Retrieved 2017-03-30. ^ "Valuation methods | Venture Valuation". www.venturevaluation.com. Retrieved 2017-03-30. ^ Newlands, Murray (July 17, 2015). "The Sharing Economy: Why it Works and How to Join". Forbes. Retrieved March 31, 2017. ^ Ho, Ky Trang. "How To Profit From The Death Of Malls In America". Forbes. Retrieved 2017-03-31. ^ Nassauer, Sarah (2016-08-08). "Wal-Mart to Acquire Jet.com for $3.3 Billion in Cash, Stock". Wall Street Journal. ISSN 0099-9660. Retrieved 2017-03-31. ^ "Rise of the Unicorns". Zinnov Thoughts. 2015-08-27. Retrieved 2017-04-01. ^ Lunden, Ingrid. "CB Insights: 3,358 tech exits in 2016, 'unicorn births' down 68%". TechCrunch. Retrieved 2018-03-06. External links[edit] "The Complete List of Unicorn Companies". CB Insights. Retrieved from "https://en.wikipedia.org/w/index.php?title=Unicorn_(finance)&oldid=1031424026" Categories: Valuation (finance) Neologisms 2010s neologisms Hidden categories: Articles with short description Short description matches Wikidata Articles containing potentially dated statements from June 2021 All articles containing potentially dated statements Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Afrikaans العربية Deutsch Español فارسی Français 한국어 Bahasa Indonesia עברית Lietuvių Bahasa Melayu Nederlands 日本語 Polski Português Svenska Türkçe Українська Tiếng Việt 中文 Edit links This page was last edited on 1 July 2021, at 14:49 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-412 ---- Chocolate Kiddies 1925 European tour - Wikipedia Chocolate Kiddies 1925 European tour From Wikipedia, the free encyclopedia Jump to navigation Jump to search Chocolate Kiddies 1925 European tour The Chocolate Kiddies is a three-act Broadway-styled revue that, in its inaugural production – from May to September 1925 – toured Berlin, Hamburg, Stockholm, and Copenhagen. The show never actually performed on Broadway,[1] but was conceived, assembled, and rehearsed there. Chocolate Kiddies commissioned new works, but was also an amalgamation and adaptation of several leading African American acts in New York, specifically Harlem, intended to showcase exemplary jazz and African American artistry of the Harlem Renaissance. Early jazz was uniquely American; and, while New Orleans enjoys popularity for being its birthplace, the jazz emerging from Harlem during the Renaissance had, on its own merits, captured international intrigue.[2] Contents 1 History 1.1 1925 Departure 1.2 Arrival and tour 1.3 La Revue Nègre 1925 opening in Paris 2 Production personnel and cast 2.1 Production 2.2 Cast 3 Selected songs 4 Gallery 5 Selected subsequent tours 5.1 Bibliography 6 Notes and references 6.1 Notes 6.2 References History[edit] See also: History of the Jews in Russia and Russian Civil War The impetus for producing the Chocolate Kiddies was partly a culmination or outgrowth of (i) the success of a Harlem (and Atlantic City) jazz band led by Sam Wooding (1895–1985) and a floor show, initially developed for the 1923 opening of the Nest Club and (ii) the success of Eubie Blake and Noble Sissle's Broadway musical, The Chocolate Dandies, which, after 96 performances, closed November 22, 1924 ... leaving some of the cast available, from which, the Chocolate Kiddies picked up choreographer Charlie Davis and singer Lottie Gee. The cast included singer Adelaide Hall, who came from the Miller and Lyles Broadway production Runnin' Wild, The Three Eddies, Rufus Greenlee and Thaddeus Drayton, Bobbie and Babe Goins, Charles Davis and Sam Wooding and his Orchestra. Leoni Leonidoff[1] (né Leonid Davydovich Leonidoff-Bermann; born abt. 1886) became the owner-producer of the Chocolate Kiddies tour. He was a Russian-Jewish exile living in Berlin as a theatrical impresario. Leonidoff's introduction to Wooding was possibly influenced by a Russian-Jewish-born American impresario living in New York, Morris Gest (1875–1942)[3] and his brother and partner, Sam Gest (1889–1960), an impresario living in Berlin. Leonidoff, in 1925, signed Wooding to take his band on a European tour, provided that a musical revue was added.[4] Russian-born Jewish American impresario Arthur Seymour Lyons[5] (1895–1964) staged an adaptation and, for several weeks prior to departure, rehearsed the company at Bryant Hall.[6] Before settling on the name Chocolate Kiddies, the show had been billed as the Club Alabam Revue and Club Alabam Fantasies.[Note 1] Duke Ellington, with Jo Trent as lyricist, composed four songs for the production – his first work for a musical revue genre.[7] 1925 Departure[edit] After a farewell reception at the Bamville Club in Harlem two days earlier, over 500 theatrical professionals swarmed the White Star Line Pier (either Pier 59 or 60; current site of Chelsea Piers) on May 6, 1925, as Wooding, his band, and the revue performers boarded the SS Arabic and departed for Hamburg.[6] Members of the revue who did not travel aboard the SS Arabic included Helen Miles, Willie Robbins, Arthur Robbins, Ruth Williams, and Evelyn Dove, who traveled from London.[8] Lottie Gee was aboard as Lottie Kyer – she had been married from 1913 to 1924 to pianist "Peaches" Kyer (né Wilson Harrison Kyer; 1888–1982).[9] Arrival and tour[edit] The company arrived in Hamburg May 17, 1925, and traveled to Berlin, arriving May 18 and opened May 25 at the Admiralspalast, where they performed 8 weeks. One of the audience members, 17-year-old Berliner Alfred Lion, later said, "It was the first time I saw colored musicians and heard the music. I was flabbergasted . . . – It was something brand new, but it registered with me right away." Thirteen years later, in 1938, Lions co-founded Blue Note Records in New York.[4] The Chocolate Kiddies Orchestra also did a recording sessions in Berlin June 5–10, 1925, at Vox Records. On July 28, Chocolate Kiddies opened in Hamburg at the Thalia Theater for 32 performances, ending August 24. Then Stockholm, opening August 25 and closing September 14. The Stockholm performances included a benefit for the Swedish Red Cross, for the brother of the King.[10] Then they performed in Copenhagen in the Circus Building,[11] opening September 15, closing September 25.[12][8][13] La Revue Nègre 1925 opening in Paris[edit] Hotsy Totsy, a tab dance revue backed by The Charleston Jazz Band, led by Claude Hopkins, renamed La Revue Nègre, opened in Paris October 2, 1925. The cast included Will Marion Cook and Josephine Baker. At least one Chocolate Kiddies cast member, Lydia Jones, joined the production.[14] Production personnel and cast[edit] Production[edit] Book and staging: Arthur Seymour Lyons Music: Joe Trent (né Joseph Hannibal Trent; 1892–1954), lyrics Duke Ellington, music "Deacon Jazz" – prior to the 1925 debut of the Chocolate Kiddies, Jo Trent and the Deacons recorded "Deacon Jazz" c. November 1924 in New York; Jo Trent (vocals); Otto Hardwick (C-melody sax); Duke Ellington (piano); George Francis (banjo); Sonny Greer (drums) – discographer Brian Rust lists Fred Guy on banjo; Matrix T-2007-1; Jazz Panorama JPLP12 "Jig Walk," Charleston "Jim Dandy" "With You"[15] Orchestration: Arthur Johnston (1898–1954) Choreographer: Charles Davis (né Charles Columbus Davis; 1894–1963) ‡ [Note 2][16] Set design and costumes: Willy Pogany (1882–1955) Publisher: Robbins-Engel; OCLC 498586615 Cast[edit] Sam Wooding's Orchestra from Club Alabam Sam Wooding, piano, leader Willie Lewis (1905–1971), clarinet Eugene Sedric (1907–1963), clarinet, tenor sax Garvin Bushell (1902–1991), clarinet, alto sax, oboe, bassoon Tommy Ladnier (1900–1939), trumpet Bobby Martin (1903–1983), trumpet Maceo Elmer Edwards (1900–1988), trumpet Herb Flemming (1898–1976), trombone John Warren, tuba Johnny Mitchell, banjo George Howe (1892–1936),[Note 3] drums Huvudroller (Swedish) (leading roles): Greenlee & Drayton Rufus Greenlee (1893–1963)[Note 4] Thaddeus "Teddy" Drayton (1893–1964)[17] The Three Eddies Shakey Beasley (né Clarence Beasley; born abt. 1898) Earle "Tiny" Ray (1887–1963) Chick Horsey (1903–1933)[Note 5] Leading roles (continued) Evelyn Dove (1902–1987) Margaret Sims (maiden 1903–1974)[Note 6][11][18][19] Bobby and Babe Goins (acrobatic dancers)[20][21][22][Note 7] Robert Goins (né Walter Robert Goins; 1902–1986) Mary Goins (née Mary or Marie Hall; 1906) Leading roles (continued) Arthur "Strut" Payne (né Arthur Henry Payne; 1878–1937), baritone Adelaide Hall (1901–1993)[23] Lottie Gee (1886–1973) Charles Davis (1894–1963)[Note 2] George Staton (né George Franklin Staten; 1904–1967) Willy Robbins – In one segment, Robbins and Chick Horsey performed "Two Happy Boys" in blackface. According to recollections of Garvin Bushell, "They sang a song, then they went 'Wah wah, wah wah,' and Bobby Martin emulated their speech with his trumpet. That was a big hit. They were trying to do Johnny Hudgins's act."[24][25] Jessie Crawford Arabella Fields (1879–1931) Lydia Jones[Note 8] Helen Miles Ruth Williams Prisbelönta dansöser från New Yorks största Neger teatrar (Award Winning Dance Shows From New York's Greatest Black Theaters) Allegritta Anderson (1898–1944)[Note 9] Viola ("Jap") Branch Pearl Brown Marie Bushell (née Marie Roberts; 1902–1971)[Note 10] Thelma Green (1900–1990), wife of Rufus Greenlee[Note 11] Bernice Miles (née Bernice M. Miles; 1907–1931) Rita Walker (1905–1983)[Note 12] Thelma Watkins (maiden; 1906–1954)[Note 13] Mamie Savoy Bobbie Vincent (1906–1978)[Note 14][26][27] Arthur Robbins Selected songs[edit] From Act 1 "Night Life in a Negro Cafe in Harlem in New York" "Deacon Jazz," sang by Adelaide Hall with chorus From Act 2 "Symphonic Concert Jazz Concert by the Sam Wooding Orchestra of the Club Alabam, New York" "Indian Love Call" "St. Louis Blues" "Medley of American Hits" "Shanghai Shuffle" – Vox (audio) (1925 recording) "Alabamy Bound" – Vox (audio) (1925 recording) "O Katharina," L. Wolfe Gilbert (1886–1970) (words), Richard Fall (1882–1945) (music) – Vox 01882; re-released on Jazz Panorama (vinyl) LP 20 (audio) (1925 recording) "By the Waters of Minnetonka," Thurlow Lieurance (1878–1963) (w&m) – Vox; re-released on Jazz Oracle (sv) BDW 8070 (CD Vol. 1 of 3) (audio) From Act 3 "Jim Dandy," a strut dance "With You," sung by Lottie Gee "Jig Walk," Charleston, to which an ensemble danced the Charleston Gallery[edit] While in Berlin, the band, recorded several selections for the Berlin-based Vox label. Sam Wooding and His Orchestra aka The Chocolate Kiddies 1925 photo taken at the Vox Phonograph Studio — Sam Wooding and his Orchestra; Seated, left to right: Tommy Ladnier (trumpet), John Warren (tuba) (behind), Sam Wooding (piano/leader), Willie Lewis (reeds), George Howe (1892–1936) (drums). Standing, left to right: Herb Flemming (trombone), Eugene Sedric (reeds), Johnny Mitchell (banjo), Bobby Martin (trumpet), Garvin Bushell (reeds), Maceo Elmer Edwards (1900–1988) (trumpet).[28] Not pictured: Arthur Lange (1889–1956), Arthur Johnston (1898–1954), arrangers Selected subsequent tours[edit] 1926 – Chocolate Kiddies 1926 Russian tour 1927 – Sam Wooding and the Chocolate Kiddies, with much of the 1925 cast performed in Argentina in 1927 for six months, returning to New York December 3, 1927, aboard the Voltaire (de). 1929 – Sam Wooding and His Orchestra, billed as the "Chocolate Kiddies Orchestra," toured Spain in 1929, without the chorus and dancers. They performed in San Sebastián, Madrid, and Barcelona. The tour has been chronicled as Spain's first live jazz performances by Americans. On July 3, 1929, while in Barcelona, the orchestra recorded ten songs for Parlophon. Eight of the songs were recorded twice, to accommodate different record formats. Musicians: Bobby Martin (1903–1983) (trumpet, vocals), Doc Cheatham (1905–1997) (trumpet, vocals, arranger), Albert Wynn (1907–1973) (trombone), Billy Burns (1904–1963) (trombone), Willie Lewis (1905–1971) (clarinet, alto sax, bari sax, vocals), Jerry Blake (1908–1961) (clarinet, alto sax, vocals), Gene Sedric (1907–1963) (clarinet, tenor sax, vocals), Freddy Johnson (1904–1961) (piano, vocals, arranger), Johnny Mitchell (banjo, guitar), Sumner Leslie "King" Edwards (1894–1957) (tuba, bass), Ted Fields (né Edward Fields; 1905–1959) (drums), Sam Wooding (director) Bibliography[edit] Williams, Iain Cameron Underneath a Harlem Moon: The Harlem to Paris Years of Adelaide Hall Archived 2021-02-26 at the Wayback Machine. Bloomsbury Publishers, ISBN 0-8264-5893-9. Chapter 6: The Chocolate Kiddies Come to Town - is devoted to the 1925 Chocolate Kiddies tour. Notes and references[edit] Notes[edit] ^ Club Alabam was a Broadway after-theater jazz club set in a rathskeller of the now bygone 44th Street Theatre at 216 West 44th Street. The club endured since the theater's inception in 1912, originally known as the "Little Club," but became known as "Club Alabam" in 1924 and henceforth flourished with jazz. Following the Prohibition, the bar closed and remained vacant for years. On March 2, 1942 — 2 months and 19 days after the United States officially entered World War II — the American Theatre Wing opened it back up as the Stage Door Canteen for American and Allied servicemen. The property, as of 2019, was owned and managed by the Kushner Companies. ^ a b Charles Davis aka C. Columbus Davis (1894–1963), when he died, was living in Englewood, New Jersey, at 111 Reis Avenue. His big break came as a principal dancer in Shuffle Along, after which, he rapidly rose to notability as a choreographer at the Apollo and Lafayette Theatres in Harlem. Davis also did the choreography for the 1927 Broadway musical, Rang Tang. He and his wife, Cecile (1898–1975), had two daughters, Meta J. Davis (1919–2012) and Anna L. Davis (1921–2016) (Duke Ellington's Music for the Theatre, by John Childs Franceschina, McFarland & Company, 2000, p. 14; OCLC 469316674) ^ George Howe (aka George Washington Howe; né Robert Washington Howe; 1892–1936), drummer, led the house band at the Nest Club beginning 1927, when Teddy Hill was in the band. Luis Russell replaced Howe in 1928. Howe had been the drummer for Sam Wooding. Howe and fellow musician George E. Dyer (1884–1936), both, in the mid-1930s, living in Glens Falls, drowned November 23, 1936, in the Champlain Canal, near Fort Ann, after a car driven by Howe submerged in the canal as a result of side-swiping a 10-ton truck (U.S. Class 6) towing another 10-ton truck on Comstock Road. They were returning from a gig at a nightclub operated by Maxie Gordon (né Maxime Godon Gordon; 1891–1956) – two miles from Whitehall. They had left Hudson Falls at 1:30 am and were followed by Jimmie Gillespie and banjoist Percy Richardson. Trombonist Benny Morton (1907–1985), also at the gig, decided at the last minute not to ride with Howe and Dyer. Howe was buried at Cypress Hills National Cemetery, Brooklyn. ^ Rufus Greenlee (né Rufus Edward Greenlee; 1893–1963), born in Asheville, North Carolina, became a native of New Haven, Connecticut. From about 1924-1925 to about 1930, he was married to cast member Thelma Greene (see Greene's brief bio in Notes). In Greenlee's post-vaudeville days, beginning in the mid-1930s, until is death, he owned and operated the Monterey Cafe, a jazz venue in New Haven at 265–167 Dixwell Avenue in the Dixwell neighborhood. Johnny "Hammond" Smith's 1962 album, Black Coffee, was recorded there. As a side note, his grand nephew, Lou Jones (1932–2006), was an Olympic Gold Medalist in the 4 × 400 metres relay in the 1956 Summer Games. ^ Chick Horsey (né Layburn Horsey; 1903–1933), born in Chester, Pennsylvania, died July 19, 1933, in Naples, Italy, at the Hotel Diana. ^ Margaret Sims (maiden; 1903–1974), born in Washington, D.C., was a blues singer. In 1935, the New York Age stated that she epitomized the complete metamorphosis of the blues singer. She married Broadway producer Irvin Colloden Miller (1884–1975). Her sister, Edith G. Sims (1905–1973), was the second of three wives of actor Jimmy Baskett (1904–1948). ^ Philadelphia-born Bobby Goins (né Walter Robert Goins; 1902–1986) and Babe (aka "Baby") Goins (née Mary or Marie Hall; born 1906) were a husband-and-wife acrobatic dance team who, with productions, toured Europe several times. Bobby and Babe married April 19, 1925, in Manhattan – seventeen days prior to embarking on the 1925 European tour. That tour, incidentally, was Babe's first break as a performer. Babe, who toured Europe three more times, won celebrated acclaim on all tours. According to an article published by the New York Age (May 18, 1932), Babe was born in Havana, Cuba; tho', some sources give Washington, D.C., as her place of birth. At age three Babe moved to Washington, D.C. Bobby and Babe divorced around 1930. Bobby – on January 13, 1933, in Manhattan – married again to Irene Winifred Bennett (maiden; 1914–1986). Babe – on May 10, 1936, in Manhattan – married again to William F. Joyce, Jr. However, a 1932 article in the New York Age (May 28) stated that Babe and Joyce were married (in 1932). Bobby went on to dance as a member of the Crackerjacks, a dance team that influenced the next-generation of professional dancers in Harlem. Bobby became a member of the American Guild of Variety Artists. Bobby – on January 13, 1933, in Manhattan – married again to Irene Winifred Bennett (maiden; 1914–1986). ^ Lydia Jones was portrayed in a one-woman off-Broadway play, The Sensational Josephine Baker, by Cheryl Howard (née Cheryl Gay Alley; born 1953), wife of Ron Howard ^ Allegretta Anderson (née Alegretta Summers; 1898–1944) was a Chicago-born actress who – on May 29, 1916, in Chicago – married Julian Kirby Anderson (1895–1954). She later was married to Agaton H. Magboo. She acted in the 1930 film, Georgia Rose. ^ Marie Bushell (née Marie Roberts; 1902–1971) was the first of two wives of Garvin Bushell. They married July 24, 1923, in Manhattan. ^ Thelma Greene (née Thelma M. Contee; 1900–1990) was, from about 1924 to about 1929, married to cast member Rufus Greenlee. Her stage surname was that of her ex-husband, Jesse Warren Greene (born 1898), who she married around 1918, and with whom she had a daughter, Jessica Iris Greene (1918–2007), who, in 1939, married Edward D. Julian Austin. Thelma, between 1942 and 1946, married Leonard G. Hyman (né Leonard Grimke Hyman; born 1894), who, from 1927 to 1932, had been Head of the Photography Division and Official Photographer at the Tuskegee Institute. Leonard Hyman's predecessors and successors there were distinguished photographers, notably Frances Benjamin Johnston (1862–1952) and C. M. Battey (1873–1927), who he replaced. P. H. Polk (1898–1984) was, at the time, one of Hyman's assistants, and in 1933, succeeded him as Head of Photography. ^ Rita Walker (maiden 1905–1983) – on April 9, 1945, in Manhattan – married Dennis Ragland (1896–1971). ^ Thelma Watkins (maiden; 1906–1954) was born in Philadelphia. At some point, she married James Adrian McDaniel (born c. 1917). The date-of-birth on her birth certificate – November 11, 1906 – differs from the date listed on two ship manifests: SS Arabic, which departed New York May 6, 1925, and arrived in Hamburg May 17, 1925 (Storyville, Vol. 60, August–September 1975, p. 218) SS Nieuw Amsterdam, which departed Boulogne-sur-Mer February 24, 1926, and arrived in New York March 6, 1926 (Ancestry.com) ^ Bobbie Vincent (née Bobbye Vincson; 1906–1978), born in Kansas City, Missouri, went on to perform with other companies, including 37 performances in Buenos Aires in 1938 with Clarence Robinson's Cotton Club Revue Company, booked by B and B Artists Bureau of Harlem, headed by William B. Cohen and B.L. Burtt (né Bernard Lamberson Burtt; 1884–1944). More than two decades later, she was an official of the X-Glamour Girls revue, composed of former entertainers from the Cotton Club. The company performed in October 26, 1962, at the Riviera Ballroom in New York at Broadway and 53rd Street. One of her older sisters, Flash Amber Vincson (1902–1975), married – on August 23, 1927, in Chicago – vaudeville entertainer Buck Washington (1903–1955) of Buck and Bubbles. References[edit] ^ a b "Jazz as Deliverance: The Reception and Institution of American Jazz during the Weimar Republic," by Susan Carol Cook, PhD, American Music (peer-reviewed journal published by the University of Illinois Press), Vol. 7, No. 1, Special Jazz Issue, Spring 1989, pps. 30-47; OCLC 6733332917, 7376634279 (article), ISSN 0734-4392 (publication) (accessible via JSTOR at www.jstor.org/stable/3052048; subscription required) ^ Traveling Blues: The Life and Music of Tommy Ladnier, by Bo Lindström (born 1939) and Daniel Vernhettes (born 1942), Paris: Jazz'Edit (2009); OCLC 471874599, 1010079957 ^ "Berlin Colored Revue," Billboard, May 2, 1925 ^ a b The Jazz Republic: Music, Race, and American Culture in Weimar Germany, by Jonathan O. Wipplinger, University of Michigan Press (2017), pps. 56–58; OCLC 960969189 ^ "Colored Show Scores Big in Berlin – Chocolate Kiddies With Russian Owner, Opens at Admiral Palast," Variety, Vol. 79, No. 2, May 27, 1925, p. 3 ^ a b "'Chocolate Kiddies Company Sails for Germany – Over 500 Professionals Swarm White Star Line Pier as S.S. Arabic Leaves – Hundreds of Co-Theatrical Celebrities Attend 'Farewell' as Guest of Colored Vaudeville Comedy Club," by Floyd G. Snelson, Jr. (né Floyd Grant Snelson, Jr.; 1891–1956), Pittsburgh Courier, May 16, 1925, p. 10 (accessible via Newspapers.com; subscription required) ^ The Biographical Encyclopedia of Jazz, Leonard Feather (posthumous ed.) and Ira Gitler (ed.), Oxford University Press (2007), p. 445 ^ a b "Sam Wooding and the Chocolate Kiddies at the Thalia-Theater in Hamburg 28th July, 1925 to 24th August, 1925," by Berhard H. Behncke, Storyville, Vol. 60, August–September 1975, p. 217–219 (accessible via National Jazz Archive at link) ^ An Encyclopedia of South Carolina Jazz and Blues Musicians (re: "William Harrison 'Peaches' Kyer"), by Benjamin Franklin, University of South Carolina Press (2016); OCLC 1023325702 ^ Voices of the Jazz Age: Profiles of Eight Vintage Jazzmen, by Chip Deffaa, University of Illinois Press (1990, 1992), p. 17; OCLC 985530584 ^ a b "The Chocolate Kiddies in Copenhagen," by Hans Larsen, The Record Changer, No. 67, April 1965, pps. 3–5 ^ "Denne Bande Frække Sorte Slubberter – Sam Wooding i København, 1925" (in Swedish), by Erik Wiedemann (de) (1930–2001), Musik und Forskning, 3, København 1977, pps. 113–127; ISSN 0903-188X ^ "Staging the Great Migration: The Chocolate Kiddies and the German Experience of the New Negro Renaissance," by Paul J. Edwards, Modernism/modernity (Johns Hopkins University Press ), Vol. 4, Cycle 3, August 27, 2019; OCLC 8302193446 ^ "Will Marion Cook and the Tab Show, with particular emphasis on Hotsy Totsy and La revue nègre (1925)," by Peter M. Lefferts, University of Nebraska-Lincoln (2018) ^ Chocolate Kiddies, coloured revue (sic), presented by Arthur S. Lyons, Robbins-Engel; European distributor – Berlin: Victor Alberti of the Musikalienhandlung Graphisches Kabinett (©1925); OCLC 498586615Note: Alberti's (born abt. 1885 in Miskolc, Hungary) music shop, until 1933, was in Berlin on Rankestrasse (de). He was a music publisher and distributor, well-known for distributing jazz sheet music and recordings. By 1930, he was partners with Armin L. Robinson (de) (1900–1985) ^ "Obituary: Charlie Davis," New York Daily News, September 24, 1963, p. 40, col. 3 (accessible via Newspapers.com; subscription required) ^ Thaddeus Drayton collection; 1926–1960 at Schomburg Center for Research in Black Culture, Manuscripts, Archives and Rare Books Division at the New York Public Library OCLC 144682722 ^ "Pleases Galleryites," New York Age, June 1, 1935, p. 4 (accessible via Newspapers.com; subscription required) ^ "Margaret Sims Dies in New York," Pittsburgh Courier, March 9, 1974, p. 13 (accessible via Newspapers.com; subscription required) ^ "Death Notices: Goins, Walter Robert, Sr.," New York Daily News, December 22, 1986, p. 22, col. 4 (accessible via Newspapers.com; subscription required) ^ "On The Spot – Baby Goins," by Dean Glynn, New York Age, May 28, 1932, p. 7 (accessible via Newspapers.com; subscription required) ^ Jazz Dance: The Story of American Vernacular Dance, Marshall Stearns and Jean Stearns (1994 ed.) Collier-Macmillan (1968); OCLC 655466715 Macmillan (1971); OCLC 900269 Schirmer (1979); OCLC 720681903, 1069868504; ISBN 978-0-0287-2510-9 Da Capo Press (paperback) (1994); OCLC 610972997; ISBN 978-0-3068-0553-0 ^ Underneath a Harlem Moon: The Harlem to Paris Years of Adelaide Hall (Chapter 6: "The Chocolate Kiddies Come to Town"), by Iain Cameron Williams, Continuum (2002), pps. 68–87 & 289; OCLC 51780394, ISBN 978-0-8264-6536-8 ^ Black People: Entertainers of African Descent in Europe and Germany, by Rainer Erich Lotz (de) (re: "Chocolate Kiddies"), Birgit Lotz Verlag (1997), pps. 327 & 244 ^ "Louis Armstrong, Eccentric Dance, and the Evolution of Jazz on the Eve of Swing," by Brian Harker, Journal of the American Musicological Society, Vol. 61, No. 1, Spring 2008, p. 78 (of pps. 67–121) (accessible via JSTOR at www.jstor.org/stable/10.1525/jams.2008.61.1.67) ^ "Blues is My Business," by Victoria Spivey (1906–1976), Record Research, Robert Colton & Len Kunstadt, eds., Issue 46, October 1962, begins on p. 12; ISSN 0034-1592 ^ "Pretty Manicurist" (photo of Vincson), Topeka Plain Dealer, Vol. 45, No. 44, November 22, 1930, p. 4 (accessible via GenealogyBank.com at www.genealogybank.com/nbshare/AC01110112104856097231589504979; subscription required) ^ "Chocolate Kiddies: The Show That Brought Jazz to Europe and Russia in 1925," by Björn Englund (sv) (born 1942), Storyville, December 1975–January 1976, pps. 44–50 Retrieved from "https://en.wikipedia.org/w/index.php?title=Chocolate_Kiddies_1925_European_tour&oldid=1032682981" Categories: 1920s in music 1920s-related lists Harlem Renaissance Harlem Hidden categories: Articles with short description Short description matches Wikidata Webarchive template wayback links AC with 0 elements Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Add links This page was last edited on 9 July 2021, at 00:37 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-4225 ---- The Dying Swan - Wikipedia The Dying Swan From Wikipedia, the free encyclopedia Jump to navigation Jump to search The Dying Swan Anna Pavlova in costume for The Dying Swan, Buenos Aires, Argentina, c. 1928 Choreographer Mikhail Fokine Music Camille Saint-Saëns, (Le cygne from Le Carnaval des animaux) Premiere 1907 St. Petersburg, Russia Created for Anna Pavlova Genre Romantic Type Classical ballet The Dying Swan (originally The Swan) is a solo dance choreographed by Mikhail Fokine to Camille Saint-Saëns's Le Cygne from Le Carnaval des animaux as a pièce d'occasion for the ballerina Anna Pavlova, who performed it about 4,000 times. The short ballet (4 minutes) follows the last moments in the life of a swan, and was first presented in St. Petersburg, Russia in 1905. The ballet has since influenced modern interpretations of Odette in Tchaikovsky's Swan Lake and has inspired non-traditional interpretations as well as various adaptations. Contents 1 Background 2 Plot summary 3 Performances and critical commentary 4 Legacy 5 See also 6 References 7 External links Background[edit] Inspired by swans that she had seen in public parks and by Lord Tennyson's poem "The Dying Swan", Anna Pavlova, who had just become a ballerina at the Mariinsky Theatre, asked Michel Fokine to create a solo dance for her for a 1905 gala concert being given by artists from the chorus of the Imperial Mariinsky Opera. Fokine suggested Saint-Saëns's cello solo, Le Cygne, which Fokine had been playing at home on a mandolin to a friend's piano accompaniment, and Pavlova agreed. A rehearsal was arranged and the short dance was completed quickly.[1] Fokine remarked in Dance Magazine (August 1931): It was almost an improvisation. I danced in front of her, she directly behind me. Then she danced and I walked alongside her, curving her arms and correcting details of poses. Prior to this composition, I was accused of barefooted tendencies and of rejecting toe dancing in general. The Dying Swan was my answer to such criticism. This dance became the symbol of the New Russian Ballet. It was a combination of masterful technique with expressiveness. It was like a proof that the dance could and should satisfy not only the eye, but through the medium of the eye should penetrate the soul.[2] In 1934, Fokine told dance critic Arnold Haskell: Small work as it is, [...] it was 'revolutionary' then, and illustrated admirably the transition between the old and the new, for here I make use of the technique of the old dance and the traditional costume, and a highly developed technique is necessary, but the purpose of the dance is not to display that technique but to create the symbol of the everlasting struggle in this life and all that is mortal. It is a dance of the whole body and not of the limbs only; it appeals not merely to the eye but to the emotions and the imagination.[3] Plot summary[edit] Le cygne (from Le Carnaval des Animaux) Performed by John Mitchel Problems playing this file? See media help. The ballet was first titled The Swan but then acquired its current title, following Pavlova's interpretation of the work's dramatic arc as the end of life. The dance is composed principally of upper body and arm movements and tiny steps called pas de bourrée suivi.[4] French critic André Levinson wrote: Arms folded, on tiptoe, she dreamily and slowly circles the stage. By even, gliding motions of the hands, returning to the background from whence she emerged, she seems to strive toward the horizon, as though a moment more and she will fly—exploring the confines of space with her soul. The tension gradually relaxes and she sinks to earth, arms waving faintly as in pain. Then faltering with irregular steps toward the edge of the stage—leg bones quiver like the strings of a harp—by one swift forward-gliding motion of the right foot to earth, she sinks on the left knee—the aerial creature struggling against earthly bonds; and there, transfixed by pain, she dies.[3] Performances and critical commentary[edit] The Dying Swan was first performed by Pavlova at a gala at the Noblemen's Hall in Saint Petersburg, Russia on Friday, December 22, 1907.[5] It was first performed in the United States at the Metropolitan Opera House in New York City on March 18, 1910. American dance critic and photographer Carl Van Vechten noted that the ballet was "the most exquisite specimen of [Pavlova's] art which she has yet given to the public."[1] Pavlova performed the piece approximately 4,000 times,[6] and on her deathbed in The Hague, reportedly cried, "Prepare my swan costume."[6][7] Fokine's granddaughter, Isabelle, notes that the ballet does not make "enormous technical demands" on the dancer but it does make "enormous artistic ones because every movement and every gesture should signify a different experience," which is "emerging from someone who is attempting to escape death." She notes that modern performances are significantly different from her grandfather's original conception and that the dance today is often made to appear to be a variation of Swan Lake, which she describes as "Odette at death's door." Isabelle says that the ballet is not about a ballerina being able to transform herself into a swan, but about death, with the swan as a metaphor.[8] Legacy[edit] The Dying Swan by Anna Pavlova (7 sec), ~1907; Yvette Chauvire (10 sec), ~1937; Natalia Makarova (14 sec) Pavlova was recorded dancing The Dying Swan in a 1925 silent film, to which sound is often added. The short ballet has influenced interpretations of Odette in Tchaikovsky's Swan Lake, particularly during the parting of the lovers in the first lakeside scene.[4] The dance was almost immediately adapted by various ballerinas internationally. As a result, Fokine published an official version of the choreography in 1925, highlighted with 36 photographs of his wife Vera Fokina demonstrating the ballet's sequential poses. At a later date, Kirov-trained Natalia Makarova commented: Of Fokine's original choreography [...] only scattered fragments remain [...] he created only the bourrées [a walking or running ballet step usually executed on the points of the toes] for Pavlova. Subsequently, every performer [...] has used the piece at her own taste and at her own risk [...] In Russia I had danced Dudinskaya's version and [...] experienced a certain discomfort [...] from all the sentimental stuff—the rushing around the stage, the flailing of the arms [...] to the contemporary eye, its conventions look almost ludicrous [...] the dance needs total emotional abandon, conveying the image of a struggle with death or a surrender to it [...] As for the emotional content, I was helped by Pavlova, whose film of the work I saw. Even today, her Swan is striking—the flawless feeling for style, the animated face—although certain melodramatic details seem superfluous.[9] The ballet has been variously interpreted and adapted. The 1917 Russian film The Dying Swan by director Yevgeni Bauer is the story of an artist who strangles a ballerina.[10] Maya Plisetskaya interpreted the swan as elderly and stubbornly resisting the effects of aging, much like herself. Eventually, the piece came to be considered one of Pavlova's trademarks.[11] More recently, Les Ballets Trockadero de Monte Carlo has performed a parody version that emphasizes every excess dormant in the choreography.[12] In 2000, street theatre artist Judith Lanigan created a hula hoop adaptation that has been performed at international street theatre festivals, comedy and burlesque events, and in traditional and contemporary circuses.[13] Several figure skaters have performed The Dying Swan with skate-choreography inspired by the ballet. 1936 Olympic bronze medallist Maribel Vinson reviewed Sonja Henie's 1936 professional debut for The New York Times, noting: The crowd settled quickly into a receptive mood for Sonja's famous interpretation of the Dying Swan of Saint-Saëns. With spotlights giving the ice the effect of water at night, Miss Henie, outlined in a blue light, performed the dance made immortal by Pavlova. Whether one agrees that such posturing is suited to the medium of ice, there is no doubt that Miss Henie's rendition is a lovely thing. Too much toe work at the start leaves the feeling that this does not belong to skating, but when she glides effortlessly back and forth, she is free as a disembodied spirit and there is an ease of movement that ballet never can produce.[14] Some ballerinas, including Ashley Bouder of New York City Ballet and Nina Ananiashvili, formerly of American Ballet Theatre and The Bolshoi Ballet, have used Dying Swan arms in Swan Lake when making Odette's exit at the end of Act II (the first lakeside scene).[15] Ogden Nash, in his "Verses for Camille Saint-Saëns' 'Carnival of the Animals'", mentions Pavlova: The swan can swim while sitting down, For pure conceit he takes the crown, He looks in the mirror over and over, And claims to have never heard of Pavlova. In response to impact of the 2019–20 coronavirus pandemic on the performing arts, Carlos Acosta, artistic director of the Birmingham Royal Ballet, adapted Fokine's choreography with the ballerina raising her head at the end instead, and with Céline Gittens, principal dancer of the company, and the musicians performing in their respective homes.[16] Misty Copeland, principal dancer with the American Ballet Theatre, invited 31 other dancers to dance The Swan to raise fund for the relief fund of the participating dancers' companies and other related funds.[17] See also[edit] Alicia Markova "The Dying Swan" (painting) References[edit] Notes ^ a b Balanchine & Mason 1975, p. 137. ^ Balanchine & Mason 1975, pp. 137–138. ^ a b , Balanchine & Mason 1975, p. 138. ^ a b Gerskovic 2005, p. 251. ^ Oxford Dictionary of Dance. ^ a b McCauley 1997, p. 156. ^ Gerskovic 2005, p. 62. ^ Carter 2004, p. 40. ^ Aloff 2006, pp. 56–57. ^ Youngblood 1999, p. 99. ^ Garafola 2005, pp. 155–156. ^ Les Ballets Trockadero de Monte Carlo. ^ Judith Lanigan. ^ Skate Web's Historical Skating Pictures. ^ Smodyrev biography. ^ Winship, Lyndsey (9 April 2020). "The Swan: three minutes of dance to soothe the soul in lockdown". The Guardian. ^ Stahl, Jennifer (6 May 2020). "32 Ballerinas From Around the World Perform "The Dying Swan" for COVID-19 Relief". Dance Magazine. References Aloff, Mindy (2006). Dance Anecdotes: Stories from the World of Ballet, Broadway, the Ballroom, and Modern Dance. Oxford: Oxford University Press. ISBN 978-0-19-505411-8. Balanchine, George; Mason, Francis (1975). 101 Stories of the Great Ballets. New York: Anchor Books. ISBN 978-0-385-03398-5. Carter, Alexandra (2004). Rethinking Dance History: A Reader. London: Routledge. ISBN 978-0-415-28746-3. Garafola, Lynn (2005). Legacies of Twentieth-Century Dance. New York: Wesleyan University Press. ISBN 978-0-8195-6674-4. Gerskovic, Robert (2005) [1998]. Ballet 101: A Complete Guide to Learning and Loving the Ballet. Pompton Plains, NJ: Limelight Editions. ISBN 978-0-87910-325-5. McCauley, Martin (1997). Who's Who in Russia since 1900. London and New York: Routledge. ISBN 978-0-415-13897-0. Youngblood, Denise Jeanne (1999). The Magic Mirror: Moviemaking in Russia, 1908–1918. Madison, WI: University of Wisconsin Press. ISBN 978-0-299-16230-6. Further reading "The Dying Swan". Oxford Dictionary of Dance. Oxford University Press. Retrieved August 10, 2012. "Les Ballets Trockadero de Monte Carlo". glbtq, Inc. 2002. Archived from the original on July 1, 2012. Retrieved August 10, 2012. "Judith Lanigan". Judith Lanigan. 2009. Retrieved August 10, 2012. "Sonja Henie Does the Swan Thing". SkateWeb's Historical Skating Pictures. SkateWeb. 1994–2009. Retrieved August 10, 2012. Smodyrev, Mikhail; Translated by Anna Korisch. "Nina Ananiashvili's Biography and Repertory". Retrieved August 10, 2012. External links[edit] Wikimedia Commons has media related to Le Cygne. "Pas de bourrée". Merriam-Webster Online. Merriam-Webster. 2009. Retrieved August 10, 2012. "The Dying Swan" by Tennyson (complete text) Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Dying_Swan&oldid=1016396399" Categories: 1905 ballet premieres Ballets by Michel Fokine Ballets to the music of Camille Saint-Saëns Hidden categories: Articles with hAudio microformats Commons category link is on Wikidata Good articles Articles containing video clips Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Deutsch Español Français Italiano മലയാളം Nederlands 日本語 Norsk nynorsk ਪੰਜਾਬੀ Русский Svenska Edit links This page was last edited on 6 April 2021, at 23:25 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-4394 ---- Team America: World Police - Wikipedia Team America: World Police From Wikipedia, the free encyclopedia Jump to navigation Jump to search 2004 film directed by Trey Parker Team America: World Police Theatrical release poster Directed by Trey Parker Written by Trey Parker Matt Stone Pam Brady Produced by Scott Rudin Trey Parker Matt Stone Starring Trey Parker Matt Stone Kristen Miller Masasa Daran Norris Phil Hendrie Maurice LaMarche Chelsea Marguerite Jeremy Shada Fred Tatasciore Cinematography Bill Pope Edited by Thomas M. Vogt Music by Harry Gregson-Williams Production companies Scott Rudin Productions Braniff Productions Distributed by Paramount Pictures Release date October 14, 2004 (2004-10-14) (Denver Film Festival) October 15, 2004 (2004-10-15) (United States) Running time 98 minutes[1][2] Countries Germany United States[1][3] Language English Budget $32 million[4] Box office $51 million[4] Team America: World Police is a 2004 black comedy action film directed by Trey Parker and written by Parker, Matt Stone and Pam Brady, all of whom are also known for the popular animated television series South Park. Starring Parker, Stone, Kristen Miller, Masasa, Daran Norris, Phil Hendrie, Maurice LaMarche, Chelsea Marguerite, Jeremy Shada and Fred Tatasciore, the film is a satire of big-budget action films and their associated clichés and stereotypes, with particular humorous emphasis on the global implications of the politics of the United States. The title is derived from domestic and international political criticisms that the foreign policy of the United States frequently and unilaterally tries to "police the world". Team America follows the fictional titular paramilitary police force and their recruitment of a Broadway actor in an attempt to save the world from North Korean dictator Kim Jong-il, who is leading a conspiracy of Islamic terrorists and liberal Hollywood actors in a bid for global destruction. Instead of live actors, the film uses a style of puppetry based on Supermarionation, known for its use in the British TV series Thunderbirds, although Stone and Parker were not fans of that show. The duo worked on the script with former South Park writer Brady for nearly two years. The film had a troubled time in production, with various problems regarding the marionettes, as well as the scheduling extremes of having the film come out in time. In addition, the filmmakers fought with the Motion Picture Association of America, who returned the film over nine times with an NC-17 rating due to an explicit sex scene in the film. The film was cut by less than a minute and rated R for "graphic crude and sexual humor, violent images and strong language – all involving puppets". The film premiered at the Denver Film Festival on October 14, 2004, and was released theatrically in the United States the following day on October 15, 2004, by Paramount Pictures. It has received mostly positive reviews from critics and grossed over $51 million worldwide against its $32 million budget.[4] Contents 1 Plot 2 Cast 3 Production 3.1 Development 3.2 Writing 3.3 Filming 3.4 Editing 3.5 Music 4 Individuals parodied in the film 5 Release 5.1 Home media 6 Reception 6.1 Critical response 6.2 Box office 6.3 Filmmakers' response 6.4 Awards 7 Soundtrack 8 Legacy 9 See also 10 References 11 Further reading 12 External links Plot[edit] Team America, a paramilitary counter-terrorist police force, eliminates a gang of terrorists in Paris, accidentally destroying the Eiffel Tower, Arc de Triomphe, and the Louvre in the process. The team includes Lisa, an idealistic psychologist; her love interest Carson; Sarah, a psychic; Joe, a jock who is in love with Sarah; and Chris, a martial arts expert who harbors a phobia towards actors. Carson proposes to Lisa, but a terrorist shoots him dead as he is doing it. Team America leader Spottswoode brings Broadway actor Gary Johnston to Team America's base in Mount Rushmore and asks him to use his acting skills to infiltrate a terrorist cell. Unbeknownst to the team, North Korean dictator and gangster Kim Jong-il is supplying international terrorists with weapons of mass destruction. Gary infiltrates a terrorist group in Cairo. The team is discovered and a chase ensues, with the team killing the terrorists. However, the city is left in ruins, drawing criticism from the Film Actors Guild (often shown as "F.A.G." in the film), a union of liberal Hollywood actors led by Alec Baldwin. At the base, Gary tells Lisa that, as a child, his acting talent caused his brother to be savagely killed by gorillas. While the two grow close and have sex, terrorists blow up the Panama Canal in retaliation for the Cairo operation, which the Film Actors Guild blame on Team America, as well as Kim chastising the terrorists for detonating one bomb too early. Gary, feeling his acting talents have again resulted in innocent people dying, resigns from Team America. The remaining members depart for the Middle East, but are defeated and captured by North Korean forces while Michael Moore blows up Team America's base in a suicide attack. In North Korea, Kim invites the Film Actors Guild and world leaders to a peace ceremony, planning to detonate a series of bombs around the globe while they are distracted. Succumbing to depression, Gary is reminded of his responsibility by a speech from a drunken tramp. Returning to the team's base, he finds Spottswoode has survived the bomb attack. After regaining Spottswoode's trust by giving him a blowjob and undergoing one-day training, Gary goes to North Korea, where he uses his acting skills to infiltrate the base and free the team, although Lisa is held hostage by Kim. The team are confronted by members of the Film Actors Guild and engage them in a fight in which most of the actors are killed. After Gary uses his acting skills to save Chris from Susan Sarandon, Chris confesses to Gary that the reason he dislikes actors is because he was gang-raped by the cast of the musical Cats when he was 19 years old. The team crash the peace ceremony and Gary goes on stage where he convinces the world's leaders to unite, using the tramp's speech. Alec Baldwin can't counter Gary's arguments, so Kim betrays and kills Baldwin, but is kicked over a balcony by Lisa and impaled on a Pickelhaube, exposing his true form as an enormous extraterrestrial cockroach, which flees in a spaceship, promising to return. Gary and Lisa happily begin a relationship and the team reunites, preparing to fight the world's terrorists once again. Cast[edit] Trey Parker as Gary Johnston / Joe Smith / Carson / Kim Jong-il / Hans Blix / Matt Damon / Tim Robbins / Sean Penn / Michael Moore / Helen Hunt / Peter Jennings / Susan Sarandon / Drunk in Bar / Liv Tyler / Janeane Garofalo Matt Stone as Chris Roth / George Clooney / Danny Glover / Ethan Hawke / Martin Sheen Kristen Miller as Lisa Jones Masasa as Sarah Wong Daran Norris as Spottswoode Phil Hendrie as I.N.T.E.L.L.I.G.E.N.C.E. / Chechen terrorist Maurice LaMarche as Alec Baldwin Chelsea Marguerite as French mother Jeremy Shada as Jean Francois Fred Tatasciore as Samuel L. Jackson Scott Land, Tony Urbano, and Greg Ballora as Lead puppeteers The film also features a man dressed as a giant statue of Kim Il-sung, two black cats, two nurse sharks, and a cockroach, with the difference in size with the marionettes played for humorous effect. A poster of the Barbi Twins was featured on the billboard in Times Square, making the Twins the only non-marionette humans in the film. Production[edit] Creators Trey Parker (left) and Matt Stone (right) were exhausted with production on Team America and its scheduling extremes. Development[edit] The film's origins involve Parker and Stone watching Gerry and Sylvia Anderson's Thunderbirds on television while bored. Parker found that the series was unable to hold his interest as a child because "the dialogue was so expository and slow, and it took itself really seriously".[5] The duo inquired about the rights to the series and found out that Universal Studios was doing a Thunderbirds film directed by Jonathan Frakes. "We said, 'What? Jonathan Frakes is directing puppets?' and then we found out it was a live-action version, and we were disappointed," said Parker.[6] The two then read that The Day After Tomorrow had been sold to 20th Century Fox due to a one-line pitch regarding global warming, which Parker and Stone found "hilarious" and "insane". Parker recalled Stone running up to him during work at South Park holding the paper, who sat down and read the synopsis regarding "sudden global warming attacking the earth". The two were in tears from laughing.[7] The two got a copy of the script, and they soon realized that The Day After Tomorrow was the "greatest puppet script ever written".[8] Originally intending to do a shot-for-shot puppet parody of The Day After Tomorrow, Parker and Stone were advised by their lawyers that there could be legal repercussions.[9] The spoof would have been called The Day After the Day After Tomorrow, and been released a day later than The Day After Tomorrow.[7] News broke of the duo signing on to create the film on October 17, 2002, with Stone revealing that it would be a homage to Anderson.[10] The news was confirmed in June 2003, with Variety quoting Stone as saying "What we wanted was to do a send-up of these super important huge action movies that Jerry Bruckheimer makes."[11] Before production began, Team America was championed at Paramount Pictures by Scott Rudin, who had been the executive producer for Parker and Stone's previous film, South Park: Bigger, Longer & Uncut. After the "hassle" of producing the South Park film, Parker and Stone had vowed never to create another movie.[6] Other studio executives were initially unenthusiastic about the project: the studio was in favor of the film's lack of political correctness, but were confused by the use of puppets. The executives explained that they could not make profit from an R-rated puppet feature, and Parker countered that similar things had been said about the South Park film, an R-rated animated musical which had become a box-office hit.[8] Tom Freston, who was co-president of Viacom, Paramount's parent company, also supported the film, feeling that Paramount should make more lower-budget films that appeal to children and young adults after the studio's failures with adult-oriented films such as The Stepford Wives.[9] According to Parker and Stone, executives were finally won over after they saw the dailies from the film's production.[5] Writing[edit] Parker, Stone, and longtime writing partner Pam Brady spent nearly two years perfecting the Team America script. For influences, they studied scores of popular action and disaster films, such as Alien, Top Gun, and S.W.A.T.[12] The duo watched Pearl Harbor to get the nuances of the puppets just right when they were staring at each other, and also used Ben Affleck as a model.[8] To help shape the film's archetypal heroes (from the true believer to the reluctant hero to the guy who sells out his friends for greater glory), they read the books of Joseph Campbell. "On one level, it's a big send-up," Brady said. "But on another, it's about foreign policy".[12] The first draft of the script was turned in well before the Iraq War.[8] The film takes aim at various celebrities, many of whom came out in opposition to the Iraq War in 2003. Brady explained that the film's treatment of celebrities was derived from her annoyance at the screen time given to celebrities in the beginning of the Iraq War, in lieu of foreign policy experts.[12] Filming[edit] The film's central concept was easier to conceive than to execute.[12] Team America was produced using a crew of about 200 people, which sometimes required four people at a time to manipulate a marionette. The duo were forced to constantly rewrite the film during production due to the limited nature of the puppets. The 270 puppet characters were created by the Chiodo Brothers, who previously designed puppets for films such as Elf and Dinosaur. The costumers of the crew were responsible for making sure the over 1,000 costumes remained in cohesive order and were realistic. Production began on May 23, 2004.[6] The project was interrupted multiple times early on in production.[8] As soon as filming began, Parker and Stone labored to find the right comic tone; the original script for the film contained many more jokes. After shooting the very first scene, the two realized the jokes were not working, and that the humor instead came from the marionettes.[13] "Puppets doing jokes is not funny," Stone found. "But when you see puppets doing melodrama, spitting up blood and talking about how they were raped as children, that's funny."[12] Filming was done by three units shooting different parts at the same time. Occasionally, the producers had up to five cameras set up to capture the scene.[5] The film was mainly based on the 1982 cult classic action film Megaforce, of which Parker and Stone had been fans. Many ideas had been copied such as the flying motorcycle sequence. The film was painstakingly made realistic, which led to various shots being re-done throughout the process due to Parker and Stone's obsession with detail and craftsmanship. For example, a tiny Uzi cost $1,000 to construct, and Kim Jong-il's eyeglasses were made with hand-ground prescription lenses.[12] Although the filmmakers hired three dozen marionette operators, simple performances from the marionettes were nearly impossible; a simple shot such as a character drinking might take a half-day to complete successfully.[12] Parker and Stone agreed during production of Team America that it was "the hardest thing [they'd] ever done." Rather than rely on computer-generated special effects added in post-production, the filmmakers vied to capture every stunt live on film.[12] Parker likened each shot to a complicated math problem.[14] The late September 2004 deadline for the film's completion[5][12] took a toll on both filmmakers, as did various difficulties in working with puppets, with Stone, who described the film as "the worst time of [my] life," resorting to coffee to work 20-hour days, and sleeping pills to go to bed.[15] The film was barely completed in time for its October 15 release date. At a press junket in Los Angeles on October 5, journalists were only shown a 20-minute reel of highlights because there was no finished print.[16] Many of the film's producers had not seen the entire film with the sound mix until the premiere.[13] Editing[edit] "It's a back-and-forth with the board. They said it can't be as many positions, so we cut out a couple of them. We love the golden shower, but I guess they said no to that. But I just love that they have to watch it. Seriously, can you imagine getting a videotape with just a close-up of a puppet asshole, and you have to watch it?" —Trey Parker on the clashes between him and Stone and the MPAA[14] Even before the scene's submission to the Motion Picture Association of America, Parker planned to "have fun" pushing the limits by throwing in the graphic sex scene.[6] The duo knew the racy film would be met with some opposition, but were outraged when the film came back with their harshest rating, NC-17. The original cut's minute-and-a-half sex scene with Gary and Lisa was cut down to 50 seconds. The original scene also featured the two puppets urinating and defecating on one another,[14] which was based on what children do humorously with dolls such as Barbie and Ken. At least nine edits of the puppet love scene were shown to the MPAA before the board accepted that it had been toned down enough to qualify for an R rating.[17] Parker contrasted the MPAA's reluctance for the sex scene to their acceptance of the violence: "Meanwhile, we're taking other puppets and, you know, blowing their heads off, they're covered with blood and stuff, and the MPAA didn't have a word to say about that."[18] In addition to the sex scene, the MPAA also objected to the scene in which the Hans Blix puppet is eaten by sharks.[19] Stone and Parker had faced a similar conflict with their previous film South Park: Bigger, Longer & Uncut in 1999.[20] Music[edit] Harry Gregson-Williams – "Team America March" Main theme of the 2004 film Team America: World Police. Problems playing this file? See media help. The film's score was composed by Harry Gregson-Williams. The soundtrack also contains "Magic Carpet Ride" performed by Steppenwolf, "Battle Without Honor or Humanity" performed by Tomoyasu Hotei, "Forbidden Bitter-Melon Dance" performed by Jeff Faustman, "Bu Dunyada Askindan Olmek" performed by Kubat, and songs by Trey Parker including "Everyone Has AIDS", "Freedom Isn't Free", "America, Fuck Yeah", "America, Fuck Yeah (Bummer Remix)", "Derka Derk (Terrorist Theme)", "Only a Woman", "I'm So Ronery", "The End of an Act", "Montage" and "North Korean Melody". Individuals parodied in the film[edit] Famous people depicted as puppets, and lampooned, in the film include Michael Moore, Alec Baldwin, Sean Penn, Tim Robbins, Helen Hunt, George Clooney, Liv Tyler, Martin Sheen, Susan Sarandon, Janeane Garofalo, Matt Damon, Samuel L. Jackson, Danny Glover, Ethan Hawke, Kim Jong-il, Muammar Gaddafi, Tony Blair, Queen Elizabeth II, Sultan Qaboos of Oman, Fidel Castro, Peter Jennings and Hans Blix. Almost all of them are killed in gory and violent ways. North Korean leader Kim Jong-il was parodied in the film, and the Democratic People's Republic of Korea asked the Czech Republic to ban it.[21] Reactions from those parodied were mixed; Baldwin found the project "so funny",[22] and expressed interest in lending his voice to his character.[23] In a 2008 video interview with Time, Baldwin related how his daughter's classmates would recite Kim Jong-il's line to him, "You are useress to me, Arec Bardwin. [sic]"[22] Sean Penn, who is portrayed making outlandish claims about how happy and utopian Iraq was before Team America showed up, sent Parker and Stone an angry letter inviting them to tour Iraq with him, ending with the words "fuck you".[24] Both George Clooney and Matt Damon are said to be friends with Stone and Parker, and Clooney has stated that he would have been insulted had he not been included in the film.[25] Damon is portrayed as a simpleton who can only say his own name. When asked about the film in 2016, Damon stated that he was confused by the portrayal, given that he was already known as both "a screenwriter and an actor": I was always bewildered by that, and I never talked to Trey and Matt about that. And incidentally, I believe those two are geniuses, and I don't use that word lightly. I think they are absolute geniuses, and what they've done is awesome and I'm a big fan of theirs, but I never quite understood that one.[26] Stone and Parker had earlier stated in an interview that they were inspired to give the Damon character that personality only after seeing the puppet that was made for him, which "looked kind of mentally deficient".[27] Kim Jong-il, a noted film buff,[28] never commented publicly about his depiction in Team America: World Police, although shortly after its release North Korea asked the Czech Republic to ban the film; the country refused saying that North Koreans had been rebuffed in their effort to undermine the Czech Republic's post-Communist-era freedom.[21] The filmmakers acknowledged this in a DVD extra and jokingly suggested he sing "I'm So Ronery". Michael Moore is depicted as a fat, hot dog–eating glutton who partakes in suicide bombing and is referred to as a "giant socialist weasel" by I.N.T.E.L.L.I.G.E.N.C.E. Stone explained the reason for this portrayal in an MSNBC interview: We have a very specific beef with Michael Moore, […] I did an interview, and he didn't mischaracterize me or anything I said [in Bowling for Columbine]. But what he did do was put this cartoon [titled "A Brief History of the United States of America", written by Moore, animated and directed by Harold Moss] right after me that made it look like we did that cartoon.[29] A deleted scene also shows Meryl Streep and Ben Affleck (who is portrayed with a real-life hand replacing his head). Release[edit] The world premiere of Team America: World Police took place on October 11, 2004 in Hollywood, California. The United States premiere was on October 14, 2004 at the Denver Film Festival. Paramount Pictures released the film in the United States on October 15, 2004. Home media[edit] The film was released on DVD and VHS in the United States on May 17, 2005 by Paramount Home Entertainment, available in both R-rated and unrated versions. The film was released on Blu-ray Disc on August 1, 2017 in the United States.[30] Reception[edit] Critical response[edit] On Rotten Tomatoes, the film has a 77% approval rating based on 198 reviews and an average score of 7.00/10. The site's consensus states, "Team America will either offend you or leave you in stitches. It'll probably do both."[31] On Metacritic the film has a score of 64 out of 100 based on reviews from 38 critics, indicating "generally favorable reviews".[32] Audiences surveyed by CinemaScore gave the film a "B" grade on an A+-to-F scale.[33] Peter Travers of Rolling Stone praised the film calling it "A ruthlessly clever musical, a punchy political parody and the hottest look ever at naked puppets."[34] Kirk Honeycutt of The Hollywood Reporter wrote: "Team America: World Police is to political commentary what lap dancing is to ballet. There is no room for subtlety. Aiming a rude, foul-mouthed political satire everywhere -- left, right and center -- Trey Parker and Matt Stone blow up a good deal of the world, not to mention the egos of many Hollywood personalities."[35] Brian Lowry of Variety was positive about the satire, saying the film "goes the extra mile to piss off everybody — which includes gleefully destroying renowned Hollywood liberals, literally and figuratively" but less positive about other aspects of the film "All told, the clever visual bits and hilarious songs don't entirely compensate for the many flat or beyond-over-the-top spells." Lowry praised the songs saying they "deliver the movie's biggest highlights" and he also praised the production design calling it a " true technical achievement, recreating a dizzying array of sets and costumes at one-third scale and clearly having plenty of fun doing so — down to using housecats as stand-ins for terrifying panthers."[36] Richard Corliss of Time also highlighted the production "The real kick, however, is in the grandeur and detail of the production design, by Jim Dultz and David Rockwell."[37] Kim Newman of Empire magazine called it "a patchy comedy that's stronger as a genre-mocker than a political satire."[38] Roger Ebert gave the film 1 out of 4 stars and wrote: "I wasn't offended by the movie's content so much as by its nihilism", and was critical of the film's "sneer at both sides" approach, comparing it to "a cocky teenager who's had a couple of drinks before the party, they don't have a plan for who they want to offend, only an intention to be as offensive as possible."[39] National Review Online has named the film #24 in its list of "The Best Conservative Movies". Brian C. Anderson wrote, "the film's utter disgust with air-headed, left-wing celebrity activism remains unmatched in popular culture."[40][better source needed] Political and social commentator Andrew Sullivan considers the film brilliant in its skewering of both the left and right's approach on terrorism.[citation needed] Sullivan (a fan of Stone and Parker's other work, as well) popularized the term "South Park Republican" to describe himself and other like-minded fiscal conservatives/social libertarians. Parker himself is a registered Libertarian.[41] Before the film's release, it was criticized by Matt Drudge and conservative group Move America Forward for mocking the War on Terror.[9] Before Team America was released, statements were released by a "senior Bush administration official" condemning the film. Upon receiving the news, the duo called and found it was instead a "junior staffer," causing Stone to quip "What is it – junior or senior? What are we talking about here? Who knows? It might have been the janitor." The two eventually decided it was free publicity, with which they were fine.[5] Some media outlets interpreted the film's release on October 15 to be in theaters before the November elections. Parker said the release date had nothing to do with the elections, and the date was pushed back as far as possible due to production delays, but they had to return to South Park by October 20.[5] Thunderbirds creator Gerry Anderson was supposed to have met Parker before production, but they cancelled the meeting, acknowledging he would not like the film's expletives. Anderson saw the completed film and felt "there are good, fun parts [in the film] but the language wasn't to my liking."[42] Box office[edit] Team America earned $12,120,358 in its opening U.S. weekend, ranking number three behind Shark Tale and Friday Night Lights. The film eventually grossed a total of $50,946,640, with $32,886,074 in U.S. domestic receipts and $18,160,566 in international proceeds.[4] Filmmakers' response[edit] In an interview with Matt Stone following the film's release,[43] Anwar Brett of the BBC asked the following question. "For all the targets you choose to take pot-shots at," he asked, "George W. Bush isn't one of them. How come?" Matt Stone replied, "If you want to see Bush-bashing in America you only have to walk about 10 feet to find it. Trey and I are always attracted to what other people aren't doing. Frankly that wasn't the movie we wanted to make." In another interview, Parker and Stone further clarified the end of the film which seems to justify the role of the United States as the "World Police."[44] Because that's the thing that we realized when we were making the movie. It was always the hardest thing. We wanted to deal with this emotion of being hated as an American. That was the thing that was intriguing to us, and having Gary the main character deal with that emotion. And so, him becoming ashamed to be a part of Team America and being ashamed of himself, he comes to realize that, just as he got his brother killed by gorillas—he didn't kill his brother; he was a dick, he wasn't an asshole—so too does America have this role in the world as a dick. Cops are dicks, you fucking hate cops, but you need 'em. Awards[edit] In a worldwide survey of comedians by The Guardian the film was ranked seventh on a list of the fifty funniest films.[45] In 2010, The Guardian listed the film as the 4th greatest comedy film of all time.[46] In 2019 The Guardian ranked the film tenth on its list of 100 best films of the 21st Century.[47] Director Quentin Tarantino counted Team America: World Police in his list of top 20 films released since 1992, when his career as a filmmaker began and Director Edgar Wright named it as one of his 1,000 favorite films.[48][49] Award Category Nominee Result Empire Award Best Comedy Team America: World Police Won Golden Schmoes Best Comedy of the Year Best Music in a Movie Most Memorable Scene in a Movie Team America: World Police Nominated Golden Trailer Best Comedy Team America: World Police Nominated IFMCA Award Best Original Score for a Comedy Film Harry Gregson-Williams Nominated Golden Reel Award Best Sound Editing in Feature Film – Animated Bruce Howell (supervising sound editor) Beth Sterner (supervising sound editor) Thomas W. Small (supervising foley editor) Lydia Quidilla (supervising dialogue editor) Robert Ulrich (supervising adr editor) Chuck Michael (sound effects editor) Peter Zinda (sound effects editor) Jon Title (sound effects editor) Michael Kamper (sound effects editor) Doug Jackson (sound effects editor) Cary Butler (sound effects editor/dialogue editor) Fred Burke (foley editor) Scott Curtis (foley editor) Nic Ratner (music editor) Nominated MTV Movie Award Best Action Sequence Team America: World Police Nominated OFCS Award Best Animated Feature Team America: World Police Nominated People's Choice Award Favorite Animated Movie Team America: World Police Nominated Golden Satellite Award Best Motion Picture, Animated or Mixed Media Team America: World Police Nominated Teen Choice Award Choice Movie: Animated/Computer Generated Team America: World Police Nominated Soundtrack[edit] Team America: World Police - Music from the Motion Picture Soundtrack album by Various artists Released October 19, 2004 January 10, 2005 (CD) Recorded 2004 Genre Musical film score Length 47:00 Label Atlantic Producer Trey Parker Matt Stone Executive Producers: Scott Rudin Scott Aversano Anne Garefino Harry Gregson-Williams film scores chronology Return to Sender (2004) Team America: World Police - Music from the Motion Picture (2004) Bridget Jones: The Edge of Reason (2004) The film's soundtrack was released on October 19, 2004 and on CD on January 10, 2005 by Atlantic Records. All songs are written and performed by Trey Parker, except where indicated. No. Title Writer(s) Artist Length 1. "Everyone Has AIDS" Trey Parker Marc Shaiman 1:15 2. "Freedom Isn't Free" 2:36 3. "America, Fuck Yeah" 2:07 4. "Derka Derk (Terrorist Theme)" 0:47 5. "Only a Woman" 2:56 6. "I'm So Ronery" 1:55 7. "America, Fuck Yeah (Bummer Remix)" 0:55 8. "The End of an Act" 2:20 9. "Montage" 2:03 10. "North Korea Melody" 1:45 11. "The Team America March" Stephen Barton Harry Gregson-Williams James McKee Smith Harry Gregson-Williams 5:31 12. "Lisa & Gary" Gregson-Williams Smith Gregson-Williams 6:14 13. "F.A.G." Gregson-Williams Steve Jablonsky Gregson-Williams 2:34 14. "Putting a Jihad on You" Gregson-Williams Jablonsky Gregson-Williams 3:44 15. "Kim Jong-il" Gregson-Williams Jablonsky Smith Gregson-Williams 5:58 16. "Mount, Rush, More" Barton Gregson-Williams Gregson-Williams 4:21 Total length: 47:00 Featured songs not included in the soundtrack: Name Artist "Magic Carpet Ride" Steppenwolf "Battle Without Honor or Humanity" Tomoyasu Hotei "Forbidden Bitter-Melon Dance" Jeff Faustman "Bu Dünyada Aşkından Ölmek" Kubat (singer Legacy[edit] In the aftermath of the December 2014 terrorism threats by Guardians of Peace on showings of the film The Interview, which resulted in Sony Pictures pulling the film from release,[50] several theatres, including Alamo Drafthouse Cinema in Austin, Texas, protested the loss by scheduling free showings of Team America: World Police.[51] However, Paramount pulled distribution of Team America from theaters, including those in Cleveland, Atlanta, and New Orleans.[52][53][54] This action was seen by President Barack Obama as an attack on freedom of speech by Hollywood studios,[55] and others as an act of pure cowardice.[56] Snippets of the film mocking Kim Jong-il are reportedly set to be included, alongside copies of The Interview, in helium-filled balloons launched by North Korean defectors into their home country in an effort to inspire education on the Western world's views on it.[57] See also[edit] List of films set in or about North Korea List of live-action puppet films References[edit] ^ a b "Catalog – Team America: World Police". American Film Institute. Retrieved December 18, 2019. Duration (in mins): 98 […] Countries: Germany, United States ^ "Team America – World Police". British Board of Film Classification. November 3, 2004. Retrieved June 19, 2013. Approved Running time 97m 49s ^ "Team America World Police (2004)". British Film Institute. Retrieved June 3, 2016. Countries: Germany, USA ^ a b c d "Team America: World Police". Box Office Mojo. Retrieved December 15, 2014. ^ a b c d e f "Puppetry of the Meanest". In Focus. October 4, 2004. Archived from the original on July 27, 2011. Retrieved June 12, 2011. ^ a b c d "Trey and Matt String Together Team America". Zap2It. August 23, 2004. Archived from the original on July 27, 2011. Retrieved June 12, 2011. ^ a b Parker, Trey (March 2007). South Park: The Complete Ninth Season: "Two Days Before the Day After Tomorrow" (DVD audio commentary). Paramount Home Entertainment. ^ a b c d e "Interview: Matt Stone/Trey Parker". Mediasharx. October 13, 2005. Archived from the original on March 2, 2016. Retrieved June 12, 2014. ^ a b c Bowles, Scott (October 11, 2004). "Parker, Stone pull Team strings, yank a few chains". USA Today. Retrieved June 12, 2011. ^ Friedman, Roger (October 17, 2002). "South Park Creators Pull the Strings". Fox News Channel. Retrieved June 12, 2011. ^ Sauriol, Patrick (June 25, 2003). "'South Park Creators Prepare Team America'". Mania.com (source: Variety). Archived from the original on October 18, 2012. Retrieved June 12, 2011. ^ a b c d e f g h i JOHN HORN (September 12, 2004). "Launching a small-scale offensive". Los Angeles Times. Retrieved June 15, 2020. ^ a b Havrilesky, Heather (October 12, 2004). "Puppet masters". Salon. Retrieved June 12, 2011. ^ a b c "Puppetmasters". Rolling Stone. October 6, 2004. Archived from the original on July 27, 2011. Retrieved June 12, 2011. ^ "Stone says Team America was 'lowest point'". The Guardian. December 31, 2004. Retrieved June 12, 2011. ^ Friedman, Roger (October 5, 2004). "Team America: Sex, Puppets & Controversy". Fox News Channel. Retrieved June 12, 2011. ^ "R Sex for Team America Puppets". E!. October 8, 2004. Archived from the original on July 27, 2011. Retrieved June 12, 2011. ^ "Hollywood's new puppetmasters". Columbia Chronicle. October 11, 2004. Archived from the original on July 27, 2011. Retrieved June 12, 2011. ^ "South Park Stars Upset Over Puppet Sex Censorship". ContactMusic. October 7, 2004. Retrieved June 12, 2011. ^ Weinraub, Bernard (June 29, 1999). "Loosening a Strict Film Rating for South Park". The New York Times. Retrieved March 7, 2011. ^ a b "'Team America' unsettles Team Kim in Pyongyang". Worldtribune.com. Retrieved November 20, 2010. ^ a b "Alec Baldwin on Tracy Morgan and Kim Jong-Il". Live 10 Questions Event. TIME Magazine Official YouTube Channel. Retrieved June 17, 2011. ^ "Team America speaks!". MovieWeb. October 12, 2004. Retrieved July 7, 2010. ^ "Letter by Sean Penn". DrudgeReport Archives. October 8, 2004. Retrieved September 14, 2009. ^ "Clooney Supports Team America Duo". January 31, 2006. […] the Hollywood big-hitters all insist they would have been offended to be left out of the film. ^ I am Matt Damon, Ask Me Anything!, Reddit, July 19, 2016 ^ Shepherd, Jack (July 21, 2016). "Matt Damon reveals why he's cool with Team America". The Independent. ^ "North Korean leader loves Hennessey, Bond movies", CNN, January 8, 2003 ^ "Team America takes on moviegoers". Today.com. October 15, 2004. ^ "Team America: World Police Blu-ray". Blu-ray.com. Archived from the original on August 17, 2012. Retrieved May 20, 2017. ^ "Team America: World Police (2004)". Rotten Tomatoes. Retrieved May 2, 2021. ^ "Team America: World Police". Metacritic. Retrieved May 4, 2020. ^ "TEAM AMERICA: WORLD POLICE (2004) B". CinemaScore. Archived from the original on December 20, 2018. ^ Travers, Peter (October 14, 2004). "Team America: World Police". Rolling Stone. ^ "'Team America: World Police': THR's 2004 Review". The Hollywood Reporter. ^ Lowry, Brian (October 10, 2004). "Team America: World Police". Variety. ^ "When Puppets Get Political - TIME". June 18, 2008. Archived from the original on June 18, 2008. Retrieved December 12, 2020. ^ Kim Newman (January 1, 2000). "Team America: World Police". Empire (film magazine). ^ Ebert, Roger (October 14, 2004). "Team America: World Police movie review (2004)". Chicago Sun-Times. ^ Miller, John (February 23, 2009). "The Best Conservative Movies". National Review. Retrieved August 19, 2009. ^ Winter, Bill. "Trey Parker – Libertarian". Advocates for Self-Government. Archived from the original on January 13, 2008. Retrieved December 13, 2008. When asked to describe his politics, Parker said he was "a registered Libertarian." ^ Hassan, Genevieve (October 7, 2008). "Talking Shop: Gerry Anderson". BBC News. Retrieved December 13, 2008. ^ "Interview with Matt Stone". BBC. ^ "Puppet Masters – Interview with Matt Stone and Trey Parker". Salon. Archived from the original on December 24, 2007. ^ Guardian Staff (December 18, 2016). "The 50 funniest films… chosen by comedians". the Guardian. Retrieved December 12, 2020. ^ "Team America: World Police: No 4 best comedy film of all time". the Guardian. October 18, 2010. Retrieved June 19, 2021. ^ "The 100 best films of the 21st century". The Guardian. Retrieved September 17, 2019. ^ Brown, Lane. "Team America, Anything Else Among the Best Movies of the Past Seventeen Years, Claims Quentin Tarantino". Vulture. New York Media LLC. Retrieved September 13, 2016. ^ Sam DiSalle. "Edgar Wright's 1000 Favorite Movies". Mubi. Retrieved July 7, 2017. ^ Humphries, Rusty (December 17, 2014). "Sony needs 'Team America: World Police'". Washington Times. ^ Burlingame, Russ (December 18, 2014). "The Interview To Be Replaced By Team America: World Police At Alamo Drafthouse". ComicBook.com. ^ Lieberman, David (December 18, 2014). "Paramount Cancels Team America Showings, Theaters Say". Deadline Hollywood. ^ "Paramount pulls screenings of 'Team America: World Police,' theaters say." Los Angeles Times. Retrieved December 19, 2014. ^ "Team America: World Police screenings canceled in wake of controversy over The Interview." The Times-Picayune (NOLA.com). Retrieved December 19, 2014. ^ Weigel, David (December 18, 2014). "First 'The Interview,' Now Theaters Cancel Protest Screenings of 'Team America'". Bloomberg Politics. ^ "Cave! 'Team America' Screenings To Replace 'The Interview' Pulled By Paramount". The Inquisitor. December 18, 2014. ^ Bond, Paul (April 20, 2015). "'The Interview' Sequel: Inside the Frightening Battle Raging on the North Korean Border". The Hollywood Reporter. Moriarty Visits Matt & Trey On The Team America Set! – set report from AintItCool.com Team America: World Police – synopsis, clips and images from LatinoReview.com (October 2004). Play: South Park's Puppet Regime. Wired 12.10. Retrieved October 6, 2004. BBC Interview with Matt Stone Team America – Guy In Bar Philosophy by composer M.Regtien Further reading[edit] Dubowsky, Jack Curtis (2017). "Team America: World Police: Duplicitous Voices of the Socio-political Spy Musical". In Donnelly, Kevin J.; Carroll, Beth (eds.). Contemporary Musical Film. Edinburgh: Edinburgh University Press. pp. 40–57. ISBN 978-1-4744-1313-8. External links[edit] Wikiquote has quotations related to: Team America: World Police Team America: World Police at IMDb Team America: World Police at the Big Cartoon DataBase Team America: World Police at Box Office Mojo v t e Trey Parker and Matt Stone Parker filmography Stone filmography Feature films Cannibal! The Musical (1993) Orgazmo (1997) BASEketball (1998) South Park: Bigger, Longer & Uncut (1999) Team America: World Police (2004) Television Time Warped (1995) South Park (since 1997) That's My Bush! (2001) Sassy Justice (2020) Music Chef Aid: The South Park Album South Park: Bigger, Longer & Uncut soundtrack "Blame Canada" "Timmy and the Lords of the Underworld" The Book of Mormon: Original Broadway Cast Recording Theatre The Book of Mormon (since 2011) Video games South Park: The Stick of Truth (2014) South Park: The Fractured but Whole (2017) Characters Parker Stan Marsh Eric Cartman Jimmy Valmer Randy Marsh Mr. Garrison Stone Kyle Broflovski Kenny McCormick Butters Stotch Gerald Broflovski See also The Spirit of Christmas Your Studio and You Princess 6 Days to Air v t e Empire Award for Best Comedy Team America: World Police (2006) Little Miss Sunshine (2007) Hot Fuzz (2008) Son of Rambow (2009) In the Loop (2010) Four Lions (2011) The Inbetweeners Movie (2012) Ted (2013) Alan Partridge: Alpha Papa (2014) Paddington (2015) Spy (2016) The Greasy Strangler (2017) The Death of Stalin (2018) Retrieved from "https://en.wikipedia.org/w/index.php?title=Team_America:_World_Police&oldid=1038606366" Categories: 2004 films English-language films 2004 action comedy films 2000s adventure comedy films 2004 black comedy films 2000s parody films 2000s satirical films American action comedy films American adventure comedy films American aviation films American black comedy films American films American parody films American political satire films Cultural depictions of Kim Jong-il Films about terrorism Films directed by Trey Parker Films featuring puppetry Films produced by Scott Rudin Films scored by Harry Gregson-Williams Films set in Egypt Films set in New York City Films set in North Korea Films set in Panama Films set in Paris Films set in South Dakota Films set in Washington, D.C. Films with screenplays by Pam Brady HIV/AIDS in film Marionette films Paramount Pictures films Works by Trey Parker and Matt Stone 2004 comedy films Hidden categories: Articles with short description Short description is different from Wikidata Use mdy dates from May 2018 Template film date with 2 release dates Articles using Infobox film with incorrectly placed links Articles with hAudio microformats All articles lacking reliable references Articles lacking reliable references from June 2020 All articles with unsourced statements Articles with unsourced statements from June 2020 Album infoboxes lacking a cover Album articles lacking alt text for covers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikiquote Languages العربية Català Deutsch Español فارسی Français Galego 한국어 Italiano עברית Magyar Bahasa Melayu Nederlands 日本語 Norsk bokmål Norsk nynorsk Oʻzbekcha/ўзбекча Polski Português Русский Српски / srpski Suomi Svenska ไทย Türkçe Edit links This page was last edited on 13 August 2021, at 15:21 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-4576 ---- The Unholy Three (1925 film) - Wikipedia The Unholy Three (1925 film) From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 film The Unholy Three (1925) 1925 The Unholy Three, theatrical release poster Directed by Tod Browning Written by Waldemar Young (scenario) Based on The Unholy Three 1917 novel by Tod Robbins Produced by Tod Browning Irving Thalberg (uncredited) Starring Lon Chaney Victor McLaglen Cinematography David Kesson Edited by Daniel Gray Irving Thalberg (uncredited) Production company Metro-Goldwyn-Mayer Distributed by Metro-Goldwyn-Mayer[nb 1] Release date August 16, 1925 (1925-08-16) Running time 86 minutes Country United States Language Silent with English intertitles The Unholy Three is a 1925 American silent crime melodrama involving a trio of circus conmen, directed by Tod Browning and starring Lon Chaney. The supporting cast features Mae Busch, Matt Moore, Victor McLaglen and Harry Earles. The Unholy Three marks the establishment of the notable artistic alliance between director Browning and actor Chaney that would deliver eight outstanding films to M-G-M studios during the late silent film era.[2][3][4] The film was remade in 1930 as a talkie directed by Sam Conway. Chaney and Earles repeated their performances as Professor Echo and Tweedledee.[5] Contents 1 Plot 2 Cast 3 Production 4 Release and reception 5 Themes 6 Notes 7 Footnotes 8 References 9 External links Plot[edit] The Unholy Three (1925 film) L to R: Victor McLaglen, Harry Earles, Mae Busch, Lon Chaney. Three performers leave a sideshow after Tweedledee (Harry Earles), a midget performer, assaults a young heckler and sparks a melee. The three join together in an "unholy" plan to become wealthy. Prof. Echo, the ventriloquist, assumes the role of Mrs. O'Grady, a kindly old grandmother, who runs a pet shop, while Tweedledee plays her grandchild. Hercules (Victor McLaglen), the strongman, works in the shop along with the unsuspecting Hector McDonald (Matt Moore). Echo's girlfriend, pickpocket Rosie O'Grady (Mae Busch), pretends to be his granddaughter. Using what they learn from delivering pets, the trio later commit burglaries, with their wealthy buyers as victims. On Christmas Eve, John Arlington (an uncredited Charles Wellesley) telephones to complain that the "talking" parrot (aided by Echo's ventriloquism) he bought will not speak. When "Granny" O'Grady visits him to coax the bird into performing, "she" takes along grandson "Little Willie". While there, they learn that a valuable ruby necklace is in the house. They decide to steal it that night. As Echo is too busy, the other two grow impatient and decide to go ahead without him. The next day, Echo is furious to read in the newspaper that Arlington was killed and his three-year-old daughter badly injured in the robbery. Hercules shows no remorse whatsoever, relating how Arlington pleaded for his life. When a police investigator shows up at the shop, the trio become fearful and decide to frame Hector, hiding the jewelry in his room. Meanwhile, Hector proposes to Rosie. She turns him down, but he overhears her crying after he leaves. To his joy, she confesses she loves him, but was ashamed of her shady past. When the police take him away, Rosie tells the trio that she will exonerate him, forcing them to abduct her and flee to a mountain cabin. Echo takes along his large pet ape (who terrifies Hercules). In the spring, Hector is brought to trial. Rosie pleads with Echo to save Hector, promising to stay with him if he does. After Echo leaves for the city, Tweedledee overhears Hercules asking Rosie to run away with him (and the loot). Tweedledee releases the ape. Hercules kills Tweedledee right before the ape gets him. At the trial, Echo agonizes over what to do, but finally rushes forward and confesses all. Both he and Hector are set free. When Rosie goes to Echo to keep her promise, he lies and says he was only kidding. He tells her to go to Hector. Echo returns to the sideshow, giving his spiel to the customers: "That's all there is to life, friends, ... a little laughter ... a little tear." Cast[edit] Lon Chaney as Prof. Echo, a.k.a. Mrs. O'Grady or "Granny" Mae Busch as Rosie O'Grady Matt Moore as Hector McDonald Victor McLaglen as Hercules, a.k.a. "Son-in-Law" Harry Earles as Tweedledee, a.k.a. Baby "Little Willie" Matthew Betz as Detective Regan Edward Connelly as the Judge William Humphrey as Defense Attorney E. Alyn Warren as Prosecuting Attorney Production[edit] Paris Cinélux poster for M-G-M's 1925 The Unholy Three. In 1924, Universal’s vice-president Irving Thalberg departed to join Metro-Goldwyn-Mayer studios as production manager. Director Tod Browning followed him to M-G-M after producing a number of unimpressive independent films.[6][7] At M-G-M he proposed adapting author Tod Robbins’ The Unholy Three and Thalberg accommodated Browning by purchasing the rights and enlisting Lon Chaney to play the lead; Chaney may have requested that Browning direct, having worked with him effectively in 1921 on Universal’s Outside the Law starring Priscilla Dean.[8] With The Unholy Three, Thalberg, Browning and Chaney established a highly creative and profitable collaborative trio that produced seven more films at M-G-M, marking the zenith of both Browning’s and Chaney’s careers.[9][10] Browning arrived at M-G-M well-versed in the techniques of “trick photography.”[11] The "ape" that dispatches the strongman Hector (Victor McLaglen) was actually a three-foot-tall chimpanzee who was made to appear gigantic with camera trickery and perspective shots. When Echo removes the ape from his cage, the shot shows Echo (with his back turned to the camera) unlocking the cage and walking the ape to the truck. The ape appears to be roughly the same size as Echo. This effect was achieved by having Harry Earles (who played "Tweedledee" in the film) play Echo for these brief shots, and then cutting to Chaney, making it seem as though the ape is gigantic. (In the 1930 remake, the ape was played by Charles Gemora.) [12] Release and reception[edit] Play media The Unholy Three The Unholy Three enjoyed tremendous success, adding luster to Chaney’s reputation as “The Man of a Thousand Faces” and revealing Browning’s as a remarkable film stylist.[13][14] On August 15, 1925 The Billboard published a list of five short reviews for the movie. This featured such critics as Mordaunt Hall (Times), George Gerhard (Evening World), Richard Watts Jr. (Herald-Tribune), and W.R. (World).[15] The movie was such a success upon its debut that at its release at the New York Capitol Theater, it maintained a strong audience attendance for at least two weeks.Major Edward Bowes, who was the managing director at the time, took steps to ensure everyone who didn’t get to see the movie the first week of its viewing would get to by extending the movie's stay. An article written about this event noted the movie as “acclaimed as the best crook drama on the screen and one of the most entertaining motion pictures ever made”, which speaks, along with its apparent popularity, for the movie’s quality.[16] Sherwood of Life magazine praised the movie for its photography and providing a more psychological horror film rather than relying on movie effects to scare its audience. Noted by Sherwood is how the film was shot great attention given to scenes as individual pieces rather than as parts of one greater project, causing continuity errors. This is explained by the writer as an acceptable outcome considering the overall quality. The review is concluded with Sherwood declaring The Unholy Three to be "the best picture of its kind since The Miracle Man."[17] The Unholy Three was released for the first time on DVD by Warner Bros. Digital Distribution on October 26, 2010. The company would later re-release the film as a part of its 6-disc Lon Chaney: The Warner Archive Classics Collection on November 22, 2011, and on June 23, 2015.[18] On Rotten Tomatoes, the film holds an approval rating of 83% based on 6 reviews, with a weighted average rating of 6.8/10.[19] Author and film critic Leonard Maltin gave the film two and a half out of four stars. Although Maltin noted that the film contained aspects that were less satisfactory, he commended its strong basic idea and Chaney's performance.[20] Themes[edit] As is common of a Tod Browning film, circus life and unusual bodies play a central role in this movie along with great use of trompe-l'œil optical illusion.[21] Trompe-l'œil is exercised and played with as the illusion of Dr. Echo as "Mrs. O’Grady" and Tweedledee as "Little Willie". The main plot of the movie revolves around the character’s abilities to pass themselves off convincingly as something they are not, an illusion the movie peels back and reasserts for both the other characters and for the audience themselves. Contrary to the usual use of this effect, Browning makes it a point to disillusion the audience and display the workings of the illusion to create a different sort of viewing stimulation.[22] In most Browning films, his opinion of the deformed and different becomes evident. The Unholy Three's plot plays directly with another of Browning’s favorite topics, dealing with identity, doubles, dual roles, and deformity. This film is unique in that the character Tweedledee is the only one of this group of that is played by a deformed character and is malicious in nature.[21] Notes[edit] ^ Loews was the parent company of MGM.[1] Footnotes[edit] ^ Gomery, Douglas; Pafort-Overduin, Clara (2011). Movie History: A Survey (2nd ed.). Taylor & Francis. p. 144. ISBN 9781136835254. ^ Sobchack, 2006 p. 35: “Lon Chaney’s influence on Browning seems considerable...their significant collaboration began at MGM and with The Unholy Three.” ^ Rosenthal, 1975 p. 19: “The ten films that Browning and Chaney make together [eight of which made at MGM] were the most successful of either’s career. In these films one can sense a personal rapport between the actor and the director which must have been deeper than a mere professional respect. “ ^ "Progressive Silent Film List: The Unholy Three". Silent Era. Retrieved March 2, 2010. ^ Eaker, 2016: “Chaney died shortly after filming the [1930 remake]...the only film to feature the actor’s voice...Under Conway, who had no feel or vision for the eccentric, the remaining cast in the sound remake are sanitized, hack versions of the far more eccentric and genuine cast in the Tod Browning directed silent film.” ^ Sobchack, 2006 p. 34: “Browning had been drinking heavily for two years prior to coming to MGM, and, during that time had directed only a few films for independent production companies.” ^ Eaker, 2016: “Browning had languished for ten years as an assignment director who rarely had a feel for the mostly banal material handed him.” ^ Sobchack, 2006 p. 34: Sobchack, reports that Browning (who produced the film for MGM), convinced Thalberg that the story by Tod Robbins was suitable for adaption, and Thalberg purchased the rights. And: The Unholy Three “the first film at MGM for both Browning and Chaney.” ^ Robinson, 1968 p. 125: “In 1925 he was taken on by Metro-Goldwyn-Mayer and began a series of films with Lon Chaney that must rank among the most extraordinary pictures ever made.” ^ Sobchack, 2006 p. 34: “Certainly, Browning’s best work was for MGM...all his films for Universal were made before 1924 and his maturity as a filmmaker...some credit must go to Irving Thalberg who, a vice-president at Universal while Browning was there” brought Browning along “when he [Thalberg] left in 1925 to join the newly-formed MGM.” ^ Sobchack, 2006: p. 34 ^ Blyn, 2006 p. 124-125: “Of all the strange elements in this film, the chimp is perhaps the most bizarre...when he transforms into a gorilla.” ^ Eaker, 2016: “The original, silent Unholy Three (1925) catapulted Browning into star director status.” Sobshack, 2006 p. 34: “The film was , of course, a huge success.” ^ Rosenthal, 1975 p. 19-20: “...only in Browning's films is [Chaney] endowed with substantial human complexity...Chaney demonstrated great sensitively to the feelings and drives of the characters that Browning devise for him to play.” And p. 7: Browning’s “style”. Eaker, 2016: “The Unholy Three is not, on the surface, as macabre as later Browning-Chaney films, it has retained its delirious edge well into the 21st century.” Robinson, 1968 p. 125: “In 1925 he was taken on by M-G-M and began a series of films with Lon Chaney that must rank among the most extraordinary pictures ever made.” ^ "AS THE N. Y. REVIEWERS SEE THE FILMS: "The Unholy Three"." August 25, 1925. ProQuest. The Billboard. Retrieved October 24, 2018. ^ ""The Unholy Three" to Remain at the Capitol." August 9, 1925. ProQuest. The New York Herald, The New York Tribune. Retrieved October 24, 2018. ^ Sherwood, R E. "The SILENT DRAMA." August 27 (1883-1936). ProQuest. Web. Retrieved October 24, 2018. ^ "The Unholy Three (1925) - Tod Browning". Allmovie.com. AllMovie. Retrieved March 13, 2018. ^ "The Unholy Three (1925) - Rotten Tomatoes". Rotten Tomatoes.com. Flixer. Retrieved March 12, 2018. ^ Leonard Maltin; Spencer Green; Rob Edelman (January 2010). Leonard Maltin's Classic Movie Guide. Plume. p. 715. ISBN 978-0-452-29577-3. ^ a b Thomas, Randal Kerry. "Symbolic Structure of the Circus in the Films of Tod Browning." June 1977. ProQuest. Retrieved October 24, 2018. ^ Rosenthal, 1975 p. 14; “The ability to assume control of another being is vital to The Unholy Three. Echo the ventriloquist delivers testimony in court through the mouth of Hector....as the words pour from the witness stand, Browning repeatedly dissolves Echo onto Hector and vise-versa, establishing the performers complete responsibility for what is being said.” Manon, Hugh S. "Seeing Through Seeing Through: The "Trompe l'Oeil" Effect and Bodily Difference in the Cinema of Tod Browning." 2006. ProQuest. Retrieved October 24, 2018. References[edit] Blyn, Robin. 2006. Between Silence and Sound: Ventriloquism and the Advent of the Voice in The Unholy Three in The Films of Tod Browning, in The Films of Tod Browning, ed. Bernd Herzogenrath, 2006 Black Dog Publishing. London. pp. 117-127 ISBN 1-904772-51-X Eaker, Alfred. 2016. Tod Browning Retrospective https://alfredeaker.com/2016/01/26/todd-browning-director-retrospective/ Retrieved 26 February, 2021. Herzogenrath, Bernd. 2006. The Films of Tod Browning. Black Dog Publishing. London. ISBN 1-904772-51-X Sobchack, Vivian. 2006. The Films of Tod Browning: An Overview Long Past in The Films of Tod Browning in The Films of Tod Browning, editor Bernd Herzogenrath, 2006 Black Dog Publishing. London. pp. 21-39. ISBN 1-904772-51-X Rosenthal, Stuart. 1975. Tod Browning: The Hollywood Professionals, Volume 4. The Tantivy Press. ISBN 0-498-01665-X External links[edit] Wikiquote has quotations related to: The Unholy Three (1925 film) The Unholy Three at IMDb The Unholy Three at the TCM Movie Database The Unholy Three at AllMovie The Unholy Three at the American Film Institute Catalog The Unholy Three at Rotten Tomatoes v t e Films directed by Tod Browning 1910s The Lucky Transfer (1915) The Slave Girl (1915) An Image of the Past (1915) The Highbinders (1915) The Story of a Story (1915) The Spell of the Poppy (1915) The Electric Alarm (1915) The Living Death (1915) The Burned Hand (1915) The Woman from Warren's (1915) Little Marie (1915) The Fatal Glass of Beer (1916) Everybody's Doing It (1916) Puppets (1916) Jim Bludso (1917) A Love Sublime (1917) Hands Up! (1917) Peggy, the Will O' the Wisp (1917) The Jury of Fate (1917) The Legion of Death (1918) The Eyes of Mystery (1918) Revenge (1918) Which Woman? (1918) The Deciding Kiss (1918) The Brazen Beauty (1918) Set Free (1918) The Wicked Darling (1919) The Exquisite Thief (1919) The Unpainted Woman (1919) The Petal on the Current (1919) Bonnie, Bonnie Lassie (1919) 1920s The Virgin of Stamboul (1920) Outside the Law (1920) No Woman Knows (1921) The Wise Kid (1922) Man Under Cover (1922) Under Two Flags (1922) Drifting (1923) The Day of Faith (1923) White Tiger (1923) The Dangerous Flirt (1924) Silk Stocking Sal (1924) The Unholy Three (1925) The Mystic (1925) Dollar Down (1925) The Blackbird (1926) The Road to Mandalay (1926) The Show (1927) The Unknown (1927) London After Midnight (1927) The Big City (1928) West of Zanzibar (1928) Where East Is East (1929) The Thirteenth Chair (1929) 1930s Outside the Law (1930) Dracula (1931) Iron Man (1931) Freaks (1932) Fast Workers (1933) Mark of the Vampire (1935) The Devil-Doll (1936) Miracles for Sale (1939) v t e Irving Thalberg Producer The Hunchback of Notre Dame (1923) Merry-Go-Round (1923) His Hour (1924) He Who Gets Slapped (1924) The Unholy Three (1925) The Merry Widow (1925) The Tower of Lies (1925) The Big Parade (1925) Ben-Hur: A Tale of the Christ (1925) Torrent (1926) La Bohème (1926) Brown of Harvard (1926) The Road to Mandalay (1926) The Temptress (1926) Valencia (1926) Flesh and the Devil (1926) Twelve Miles Out (1927) The Student Prince in Old Heidelberg (1927) London After Midnight (1927) The Crowd (1928) Laugh, Clown, Laugh (1928) White Shadows in the South Seas (1928) Show People (1928) West of Zanzibar (1928) The Broadway Melody (1929) The Trial of Mary Dugan (1929) Voice of the City (1929) Where East Is East (1929) The Last of Mrs. Cheyney (1929) The Hollywood Revue of 1929 (1929) Hallelujah (1929) His Glorious Night (1929) The Kiss (1929) Anna Christie (1930) Redemption (1930) The Divorcee (1930) The Rogue Song (1930) The Big House (1930) The Unholy Three (1930) Let Us Be Gay (1930) Billy the Kid (1930) Way for a Sailor (1930) A Lady's Morals (1930) Inspiration (1931) Trader Horn (1931) The Secret Six (1931) A Free Soul (1931) Just a Gigolo (1931) The Sin of Madelon Claudet (1931) The Guardsman (1931) The Champ (1931) Possessed (1931) Private Lives (1931) Mata Hari (1931) Freaks (1932) Tarzan the Ape Man (1932) Grand Hotel (1932) Letty Lynton (1932) As You Desire Me (1932) Red-Headed Woman (1932) Smilin' Through (1932) Red Dust (1932) Rasputin and the Empress (1932) Strange Interlude (1932) Tugboat Annie (1933) Bombshell (1933) Eskimo (1933) Riptide (1934) The Barretts of Wimpole Street (1934) The Merry Widow (1934) What Every Woman Knows (1934) No More Ladies (1935) China Seas (1935) Mutiny on the Bounty (1935) A Night at the Opera (1935) Riffraff (1936) Romeo and Juliet (1936) Camille (1936) Maytime (1937) A Day at the Races (1937) Broadway Melody of 1938 (1937) The Good Earth (1937) Marie Antoinette (1938) Writer The Trap (1922) People Norma Shearer (wife) Irving Thalberg Jr. (son) Related The Love of the Last Tycoon Authority control General VIAF 1 WorldCat (via VIAF) National libraries France (data) United States Poland Other SUDOC (France) 1 Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Unholy_Three_(1925_film)&oldid=1024353177" Categories: 1925 films 1925 crime drama films American films American crime drama films American silent feature films American black-and-white films Cross-dressing in American films Films based on American novels Films directed by Tod Browning Films produced by Irving Thalberg Metro-Goldwyn-Mayer films Hidden categories: Articles with short description Short description is different from Wikidata Use mdy dates from April 2020 Template film date with 1 release date Wikipedia articles with VIAF identifiers Wikipedia articles with BNF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with PLWABN identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with WorldCat-VIAF identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikiquote Languages Català Deutsch Español Français Bahasa Indonesia Italiano Nederlands Português Română Русский Srpskohrvatski / српскохрватски Türkçe Українська Edit links This page was last edited on 21 May 2021, at 16:05 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-4821 ---- The Professor's House - Wikipedia The Professor's House From Wikipedia, the free encyclopedia Jump to navigation Jump to search The Professor's House First edition Author Willa Cather Cover artist C. B. Falls Country United States Language English Publisher Alfred A. Knopf Publication date 1925 Media type Print (Hardcover, Paperback) The Professor's House is a novel by American novelist Willa Cather. Published in 1925, the novel was written over the course of several years. Cather first wrote the centerpiece, “Tom Outland's Story,” and then later wrote the two framing chapters “The Family” and “The Professor.”[1] Contents 1 Plot summary 2 Characters 3 Major themes 3.1 Nationalism 4 Critical trends and reception 4.1 Form 4.2 Queer readings 5 References 6 External links Plot summary[edit] This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (March 2014) (Learn how and when to remove this template message) When Professor Godfrey St. Peter and wife move to a new house, he becomes uncomfortable with the route his life is taking. He keeps on his dusty study in the old house in an attempt to hang on to his old life. The marriages of his two daughters have removed them from the home and added two new sons-in-law, precipitating a mid-life crisis that leaves the Professor feeling as though he has lost the will to live because he has nothing to look forward to. The novel initially addresses the Professor's interactions with his new sons-in-law and his family, while continually alluding to the pain they all feel over the death of Tom Outland in the Great War. Outland was not only the Professor's student and friend, but the fiancé of his elder daughter, who is now living off the wealth created by the "Outland vacuum." The novel's central section turns to Outland, and recounts in first-person the story of his exploration of an ancient cliff city in New Mexico. The section is a retrospective narrative remembered by the professor. In the final section, the professor, left alone while his family takes an expensive European tour, narrowly escapes death due to a gas leak in his study; and finds himself strangely willing to die. He is rescued by the old family seamstress, Augusta, who has been his staunch friend throughout. He resolves to go on with his life. Characters[edit] Godfrey St. Peter - Also known as the professor, the novel's protagonist. He is a fifty-two-year-old man of mixed descent “Canadian French on one side, and American farmers on the other”.[2] He is described by his wife as growing “better-looking and more intolerant all the time”.[3] He is a professor of history at Hamilton University and his book is entitled Spanish Adventures in North America. Godfrey's name comes from Godfrey of Boulogne, the conqueror who took Jerusalem:[4] St. Peter is the rock on which the Roman church was built: St. Peter is writing about pioneers, when he himself is an intellectual pioneer and every bit of his name comes from famous pioneers in history. Lillian St. Peter - The professor's status-oriented wife. She is described as “occupied with the future” and adaptable.[5] Most of her involvement in the novel is to act as contrast to the professor and show the distance between his interests and his family. Their relationship is described as happy but dependent on her inheritance. She tells the professor “'One must go on living, Godfrey. But it wasn't the children who came between us.' There was something lonely and forgiving in her voice, something that spoke of an old wound, healed and hardened and hopeless”.[5] Augusta - The family seamstress and friend of St. Peter. She is described as being “a reliable, methodical spinster, a German Catholic and very devout”.[6] Rosamond - St. Peter's elder daughter and wife of Louie Marsellus. She was originally engaged to Tom Outland and he left everything to her when he died. She is now obsessed with her appearance and having all the finest things, likely because Louie showers her with extravagance. The professor admits that “he didn't in the least understand” her.[7] Kathleen - St. Peter's younger daughter and wife of Scott McGregor. She is sweet and honest and is one of the more genuine characters in the novel. The professor says that “the only unusual thing about Kitty … is that she doesn't think herself a bit unusual” and that she “has a spark of something different”.[8] Louie Marsellus - Rosamond's husband and executor of Tom Outland's patents from which he massed a fortune and is now building a house and memorial to Tom where he and Rosamond will live called Outland. He is generous and very loving to Rosamond. The professor says that he is “perfectly consistent. He's a great deal more generous and public-spirited than I am, and my preferences would be enigmatical to him”.[9] Nevertheless Marsellus is named after the French monarch, and the Roman general who fought Hannibal, and the last part of his name, 'sellus' corroborates (mainly) Scott's idea that Louie is only interested in materialism. Scott McGregor - Kathleen's husband. They became engaged soon after Rosamond's engagement to Louie. He is a journalist and writes a daily prose poem for the two to live off of. The professor describes him as “having a usual sort of mind” but that “he trusted him”.[8] Scott and Kathleen are portrayed as truly loving each other. Tom Outland - Once St. Peter's student and Rosamond's fiancé before his death, the story focuses on his memory. The central piece of the chapter “Tom Outland's Story” is Tom's own account of his adventures in the American Southwest investigating a cliff city's remains in the desert while working as a rancher. It is through these stories and his goodness that the St. Peter family fell in love with him and remembers him fondly. Major themes[edit] The novel explores many contrasting ideas. Indeed in many respects, the novel deals in opposites, variously conceived: Marsellus vs. Outland, Kitty vs. Rosamond, the quixotic vs. the pragmatic, the old vs. the new, the idea of the Professor as a scholar vs. his family relations, Indian tribes vs. the contemporary world of the 1920s, and the opposing social poles of the Professor vs. Lillian. Those opposites are not always clear-cut. Considering the ending, the novel can be viewed as devoid of a clear moral imperative. Similarly, the comparisons between the modern world of sections III and I contrast with Tom Outland’s natural world in section II. Yet the confused judgments of the characters block these comparisons and obscure clear morals: Tom’s both elevates and appropriates nature, and the unsupported conclusions of Father Duchene pervert the true historical facts of the mesa culture. He assumes ‘Mother Eve’ was murdered for infidelity to her husband, but this would sharply contrast Tom’s view of the mesa as an idyllic space away from ‘the dirty devices of the world’.[10] Accordingly The Professor’s House is generally analyzed as a critique of modernity—the Marselluses are consumed by the latest fashions, Mrs. St. Peter transfers her old love for her husband to a passion for her sons-in-law, science and the modern world corrupt St. Peter’s ideals of history and nature. Yet it is a failure to embrace modernity that nearly kills the Professor and brings him to the realization of his need for change. In his own speech, the knowledgeable professor puts forth numerous contradictions. He criticizes science for only making humans comfortable in front of his lecture hall students, yet with his daughter he lauds the promise of what science can do for man (Crane), and its superior value to money: “In Hamilton the correspondence between inner and outer has been completely destroyed: the dress-forms are deceptive; Rosamond's physical beauty clothes a spiritual emptiness; Louie's loud exterior covers an inner capacity for love and generosity. In Hamilton the failure of inner and outer to cohere leads to misunderstandings and to the characters' inability to make meaningful contact with one another".[10] Nationalism[edit] The Professor's House was written in 1925, in post-war America. In a similar fashion to F. Scott Fitzgerald's The Great Gatsby, Cather narrates a story about the moral decline of a money-driven society. Tom displays an Emersonian understanding of national identity. His sense of Americanness is connected to the land and its beauty, and he believes in a collective possession of this land and all of its history for all Americans. His anger at Roddy’s sale of the Native American artifacts to the German stems from a belief that they were a piece of American history, that they were of the land, and therefore nobody had the right to sell them, much less to a non-American. Tom’s ultimate experience of connection to an American identity comes during his night on the mesa alone after his confrontation with Roddy, when he discovers “the mesa was no longer an adventure, but a religious emotion” and, “It was possession”.[11] Louie’s sense of national identity in contrast centers on money and the economic greatness of the country. He spends liberally the income derived from Tom’s advances in engineering. Louie wears the source of his wealth proudly—the fact that his livelihood is derived from his wife’s deceased fiancé does not create tension between husband and wife nor between the couple and society. His announcement, “We have named our place for Tom Outland, a brilliant young American scientist and inventor, who was killed in Flanders, fighting with the Foreign Legion, the second year of the war, when he was barely thirty years of age,” displays his pride in and respect for his benefactor, and his recognition that Tom’s loyalty to the nation has brought Louie the monetary success he enjoys is representative of his understanding that America's economic success now takes precedence in defining the country and its people.[12] The professor is caught between the worldviews of Tom Outland and Louie Marsellus. He is resistant to change, idealistically holding onto Tom’s memory and an Emersonian ideality that impugnes material acquisitiveness. As Outland’s good friend and mentor, St. Peter feels it is his responsibility to make sure Tom’s will is properly executed. In this endeavor, he is torn between his love for Tom and his love for his daughter Rosamond, both of whom, the professor believes, have different views on how the money should be spent. When Mrs. Crane asks for his help in obtaining compensation for her husband for the patent on which he worked intimately with Outland, the professor says, “Heaven knows I’d like to see Crane get something out of it, but how? How? I’ve thought a great deal about this matter, and I’ve blamed Tom for making that kind of will”.[13] On the one hand, he is digging his heels into the ground, resisting the shift from a love of the land to a love of its fruits, but he also has a sense of obligation which makes it difficult for him to ignore the role money, particularly Tom’s money, plays in his relationships and social life. Cather’s endorsement of one worldview over another is debatable, as has been demonstrated by various critics. Walter Benn Michaels suggests that Cather sides with Tom Outland, in that the poetry of “the ‘picture’ of the cliff-dwellers’ tower, ‘rising strong, with calmness and courage’…marks in Cather the emergence of culture not only as an aspect of American identity but as one of its determinants”.[14] From this perspective, Outland is Cather’s voice in the novel, advocating the close ties to the landscape as an expression of national identity. Contrarily, Sarah Wilson posits that Cather is instead critical of Tom’s nostalgia. “The cliff dwellings of the Blue Mesa once belonged to a now vanished culture, and no living Native American population has an indisputable claim on them…How, the novel queries, can a nation or individuals engage the history of a culturally and temporally other people?” However, Wilson does concede “the America of which Tom Outland speaks, the nation that treasures its ancient Southwestern heritage, at least allows for unique ways of being American”.[15] Critical trends and reception[edit] While critically neglected for the better part of the 20th century, interest in Willa Cather was aroused in the 1980s with the rise of the feminist movement. Although many of her novels have been subsequently incorporated into the canon, critics have largely ignored The Professor’s House, passing it over as “morally and psychologically unachieved”.[10] As a reason for this disparagement, critics often cite the “broken” format of the book, rebuking its structure as unnecessary. Or, they cite the ambivalent depiction of the Professor’s psyche. The reader is unsure of how to consider the Professor’s demands for solitude and his entrapment in the past. He’s a family man and a university man, but the Professor’s conflict reaches its crux when he surrenders "local community for the nostalgic national ideal".[16] A.S. Byatt calls The Professor's House Cather's "masterpiece... almost perfectly constructed, peculiarly moving, and completely original".[4] Form[edit] The Professor’s House has been criticized as “fragmentary and inconclusive” because of the way the middle section, “Tom Outland’s Story,” fractures the surrounding narrative. J. Schroeter presents the most common critical view regarding the structural meaning of the novel in his essay “Willa Cather and The Professor’s House”: "Book II is the 'turquoise' and Books I and III are the 'dull silver'. The whole novel, in other words, is constructed like the Indian bracelet. It is not hard to see that Willa Cather wants to draw an ironic contrast not only between two pieces of jewelry but between two civilizations, between two epochs, and between two men, Marcellus [sic] and Outland, who symbolize these differences".[17] Some critics, however, have analyzed the novel’s structure in light of the sonata—equating the novel with either a complete, three-movement sonata, or a single sonata, broken up into exposition, development and recapitulation.[18] Other critics, such as Sarah Wilson, cite the Dutch painting style, which Cather references in her correspondence, as a way of explaining the novel’s theme and layout. Dutch paintings provide a sense of the context beyond the actual objects presented. They consist of crowded interiors and, in Cather’s words, “a square window, open…The feeling of the sea that one got through those square windows was remarkable, and gave me a sense of the fleets of Dutch ships that ply quietly on all the waters of the globe—to Java, etc.’’ Applied to The Professor’s House, Books I and III serve as the overstuffed Dutch interior, while “Tom Outland’s Story, with its more open setting and voice, functions as the open window.[19] Queer readings[edit] In recent years a queer reading of The Professor’s House has emerged. This reading centers on the professor’s relationship with Tom, as well as Tom’s relationship with his idolized friend Roddy. Through Tom’s youthful influence, the professor achieves a sort of procreation—his work comes forth more easily and fluidly. “Tom represents the Professor’s need to live with delight.” For the professor, Tom’s loss also represents the professor’s forgoing of homoerotic desire and along with it, a life “without delight... without joy, without passionate grief”.[20] Tom and Roddy share a deeply intimate experience of discovery. Tom views Roddy’s selling of the find as a betrayal, and they experience a split with characteristics of a romantic rift.[21][22] References[edit] ^ Thacker, Robert. Willa Cather: Leading American Author 1922-1933 Archived 2009-12-28 at the Wayback Machine. 2005. December 15, 2009. ^ Cather, Willa. The Professor's House. Vintage Classics: New York, 1925. 4. ^ Cather, 24. ^ a b Byatt, A. S. (December 9, 2006). "American Pastoral". The Guardian. Retrieved May 10, 2018. ^ a b Cather, 98. ^ Cather, 8. ^ Cather, 59. ^ a b Cather, 53. ^ Cather, 58. ^ a b c Hart, Clive. "The Professor's House": A Shapely Story". The Modern Language Review, vol. 67, no. 2 (April, 1972), pp. 271-281. ^ Cather, 226. ^ Cather, 30. ^ Cather, 118. ^ Michaels, Walter Benn. "The Vanishing American." American Literary History 2.2 (1990): 220-241. Web. 16 Dec 2009. ^ Wilson, Sarah. "Fragmentary and Inconclusive Violence: National History and Literary Form in The Professor’s House". American Literature, vol. 75, no. 3 (September 2003): pp. 571-599. ^ Wilson, 584. ^ Schroeter, J., 'Willa Gather and The Professor's House', Yale Review, 54, 1965, 494-512. ^ Giannone, Richard, Music in Willa Cather’s Fiction, University of Nebraska Press, 1968 ^ Wilson, 573. ^ Cather, 282 ^ Anders, John P., Willa Cather’s Sexual Aesthetics and the Male Homosexual Literary Tradition (Lincoln: University of Nebraska Press, 1999) ^ Wilson, “Canonical Relations: Willa Cather, America, and The Professor’s House”, Texas Studies in Literature and Language, Vol. 47, No. 1, Spring 2005, University of Texas Press. External links[edit] The Professor's House at the Internet Archive v t e Willa Cather Novels Alexander's Bridge O Pioneers! The Song of the Lark My Ántonia One of Ours A Lost Lady The Professor's House My Mortal Enemy Death Comes for the Archbishop Shadows on the Rock Lucy Gayheart Sapphira and the Slave Girl Hard Punishments Short stories "Peter" "Lou, the Prophet" "The Elopement of Allen Poole" "A Tale of the White Pyramid" "A Son of the Celestial" "The Clemency of the Court" "The Fear That Walks by Noonday" "On the Divide" "A Night at Greenway Court" "Tommy, the Unsentimental" "The Princess Baladina – Her Adventure" "The Count of Crow's Nest" "The Burglar's Christmas" "The Strategy of the Were-Wolf Dog" "A Resurrection" "The Prodigies" "Nanette: An Aside" "The Way of the World" "The Westbound Train" "Eric Hermannson's Soul" "The Dance at Chevalier's" "The Sentimentality of William Tavener" "The Affair at Grover Station" "A Singer's Romance" "The Conversion of Sum Loo" "Jack-a-Boy" "El Dorado: A Kansas Recessional" "The Professor's Commencement" "The Treasure of Far Island" "A Death in the Desert" "A Wagner Matinee" "The Sculptor's Funeral" "Flavia and Her Artists" "The Garden Lodge" "The Marriage of Phaedra" "Paul's Case" "The Namesake" "The Profile" "The Willing Muse" "Eleanor's House" "On the Gulls' Road" "The Enchanted Bluff" "The Joy of Nelly Deane" "Behind the Singer Tower" "The Bohemian Girl" "Consequences" "The Bookkeeper's Wife" "The Diamond Mine" "A Gold Slipper" "Ardessa" "Scandal" "Her Boss" "Coming, Eden Bower!" "Uncle Valentine" "Double Birthday" "Neighbour Rosicky" "Two Friends" "The Old Beauty" "Before Breakfast" "The Best Years" Short story collections The Troll Garden Youth and the Bright Medusa Obscure Destinies The Old Beauty and Others Five Stories Collection of poems April Twilights Collaborations The Life of Mary Baker G. Eddy and the History of Christian Science Adaptations A Lost Lady (1934 film) O Pioneers! (1992 film) My Antonia (1995 film) The Song of the Lark (2001 film) O Pioneers! (2009 opera) Related Willa Cather Birthplace Willa Cather House Edith Lewis Willa Cather Foundation WILLA Literary Award Authority control General Integrated Authority File (Germany) VIAF 1 WorldCat (via VIAF) National libraries France (data) Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Professor%27s_House&oldid=1003429178" Categories: Novels by Willa Cather 1925 American novels Campus novels Alfred A. Knopf books Novels set in New Mexico Hidden categories: Webarchive template wayback links Articles needing additional references from March 2014 All articles needing additional references Articles with Internet Archive links Wikipedia articles with GND identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BNF identifiers Wikipedia articles with WorldCat-VIAF identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Русский Edit links This page was last edited on 28 January 2021, at 23:16 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-4862 ---- Computer Professionals for Social Responsibility - Wikipedia Computer Professionals for Social Responsibility From Wikipedia, the free encyclopedia Jump to navigation Jump to search Computer Professionals for Social Responsibility Abbreviation CPSR Formation 1983 Dissolved 2013 Type NGO Purpose Promote responsible use of computer technology Headquarters Seattle, Washington Website cpsr.org Computer Professionals for Social Responsibility (CPSR) was a global organization promoting the responsible use of computer technology. CPSR was incorporated in 1983 following discussions and organizing that began in 1981.[1] It educated policymakers and the public on a wide range of issues. CPSR incubated numerous projects such as Privaterra, the Public Sphere Project, the Electronic Privacy Information Center, the 21st Century Project, the Civil Society Project, and the Computers, Freedom and Privacy Conference. Founded by U.S. computer scientists at Stanford University and Xerox PARC, CPSR had members in over 30 countries on six continents. CPSR was a non-profit 501.c.3 organization registered in California. When CPSR was established, it was concerned solely about the use of computers in warfare. It was focused on the Strategic Computing Initiative, a US Defense project to use artificial intelligence in military systems, but added opposition to the Strategic Defense Initiative (SDI) shortly after the program was announced. The Boston chapter helped organize a debate related to the software reliability of SDI systems which drew national attention ("Software Seen as Obstacle in Developing 'Star Wars', Philip M. Boffey, (The New York Times, September 16, 1986) to these issues. Later, workplace issues, privacy, and community networks were added to CPSR's agenda. CPSR began as a chapter-based organization and had chapters in Palo Alto, Boston, Seattle, Austin, Washington DC, Portland (Oregon) and other US locations as well as a variety of international chapters including Peru and Spain. The chapters often developed innovative projects including a slide show about the dangers of launch on warning (Boston chapter) and the Seattle Community Network (Seattle chapter). CPSR sponsored two conferences: the Participatory Design Conferences which was held biennially[2] and the Directions and Implications of Advanced Computing (DIAC) symposium series which was launched in 1987 in Seattle. The DIAC symposia have been convened roughly every other year since that time in conjunction with the Community Information Research Network (CIRN) annual conference. Four books (Directions and Implications of Advanced Computing; Reinventing Technology, Rediscovering Community; Community Practice in the Network Society; Shaping the Network Society; "Liberating Voices: A Pattern Language for Communication Revolution") and two special sections in the Communications of the ACM ("Social Responsibility" and "Social Computing") resulted from the DIAC symposia. CPSR awarded the Norbert Wiener Award for Social and Professional Responsibility. Some notable recipients include David Parnas, Joseph Weizenbaum, Kristen Nygaard, Barbara Simons, Antonia Stone, Peter G. Neumann, Marc Rotenberg, Mitch Kapor, and Douglas Engelbart. The final award in 2013 went posthumously to the organisation's first executive director, Gary Chapman.[3] The organisation was dissolved in May 2013.[3] References[edit] ^ History ^ Participatory Design Conference, listing 1996–2012, University of Trier ^ a b "CPSR Dissolution and Gary Chapman, Winner of CPSR's Norbert Wiener Award" by Douglas Schuler, Public Sphere Project, May 2013 External links[edit] Computer Professionals for Social Responsibility Documentary film about Norbert Wiener Award winner, Joseph Weizenbaum ("Weizenbaum. Rebel at Work." ) Computer Professionals for Social Responsibility Records, 1983–1991. Charles Babbage Institute, University of Minnesota. Oral history interview with Severo Ornstein and Laura Gould, Charles Babbage Institute, University of Minnesota. Oral history interview by Bruce Bruemmer, 1994, discussing the formation and activities of Computer Professionals for Social Responsibility. v t e Privacy Principles Expectation of privacy Right to privacy Right to be forgotten Post-mortem privacy Privacy laws Australia Canada Denmark England European Union Germany Ghana New Zealand Singapore Switzerland United States Data protection authorities Australia Denmark European Union France Germany Ireland Isle of Man Norway Philippines Poland Spain Sweden Switzerland Turkey Thailand United Kingdom Areas Consumer Medical Workplace Information privacy Law Financial Internet Personal data Personal identifier Privacy-enhancing technologies Social networking services Privacy engineering Secret ballot Advocacy organizations American Civil Liberties Union Center for Democracy and Technology Computer Professionals for Social Responsibility Future of Privacy Forum Electronic Privacy Information Center Electronic Frontier Foundation European Digital Rights Global Network Initiative International Association of Privacy Professionals NOYB Privacy International See also Anonymity Carding Cellphone surveillance Cyberstalking Data security Eavesdropping Global surveillance Electronic harassment Mass surveillance Privacy engineering Telephone tapping Human rights Identity theft Panopticon Personality rights Search warrant Authority control General Integrated Authority File (Germany) ISNI 1 VIAF 1 WorldCat National libraries Norway United States Australia Other Microsoft Academic Retrieved from "https://en.wikipedia.org/w/index.php?title=Computer_Professionals_for_Social_Responsibility&oldid=1010137156" Categories: Computing and society Information technology organizations Organizations established in 1981 Organizations disestablished in 2013 Privacy in the United States Hidden categories: Pages using infobox organization with motto or pledge Wikipedia articles with GND identifiers Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BIBSYS identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with NLA identifiers Wikipedia articles with MA identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Català Español 日本語 Polski Edit links This page was last edited on 4 March 2021, at 00:01 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-5016 ---- AOL - Wikipedia AOL From Wikipedia, the free encyclopedia Jump to navigation Jump to search American web portal and online service provider For other uses, see AOL (disambiguation). AOL AOL headquarters, 770 Broadway, New York City Formerly Control Video Corporation (1983–1985) Quantum Computer Services (1985–1991) America Online (1991–2009) AOL Time Warner (2001–2009) Type Subsidiary Founded 1983; 38 years ago (1983) (as Control Video Corporation) 2009 (2009) (as AOL Inc.) Founders Marc Seriff Steve Case Jim Kimsey William von Meister Headquarters 770 Broadway, New York City , United States Area served Worldwide Services Web portal and online services Number of employees 5,600 Parent AOL Time Warner (2001–2009) Verizon Communications (2015–2017) Oath (2017–2019) Verizon Media (2019–present) Website www.aol.com AOL (stylized as Aol., formerly a company known as AOL Inc. and originally known as America Online) is an American web portal and online service provider based in New York City. It is a brand marketed by Verizon Media. The service traces its history to an online service known as PlayNET. PlayNET licensed its software to Quantum Link (Q-Link), who went online in November 1985. A new IBM PC client launched in 1988, eventually renamed as America Online in 1989. AOL grew to become the largest online service, displacing established players like CompuServe and The Source. By 1995, AOL had about three million active users.[1] AOL was one of the early pioneers of the Internet in the mid-1990s, and the most recognized brand on the web in the United States. It originally provided a dial-up service to millions of Americans, as well as providing a web portal, e-mail, instant messaging and later a web browser following its purchase of Netscape. In 2001, at the height of its popularity, it purchased the media conglomerate Time Warner in the largest merger in U.S. history. AOL rapidly shrank thereafter, partly due to the decline of dial-up and rise of broadband.[2] AOL was eventually spun off from Time Warner in 2009, with Tim Armstrong appointed the new CEO. Under his leadership, the company invested in media brands and advertising technologies. On June 23, 2015, AOL was acquired by Verizon Communications for $4.4 billion.[3][4] On May 3, 2021, Verizon announced it would sell Yahoo and AOL to Apollo for $5 billion.[5] Contents 1 History 1.1 1983–1991: Early years 1.2 1991–2006: Internet age, Time Warner merger 1.3 2006–2009: Rebranding and decline 1.4 2009–2015: As a digital media company 1.5 2015–2021: Division of Verizon 1.6 2021–present: Division of Apollo 2 Products and services 2.1 Content 2.2 Advertising 2.3 Membership 2.4 AOL Desktop 3 Criticism 3.1 Community leaders 3.2 Billing disputes 3.3 Account cancellation 3.4 Direct marketing of disks 3.5 Software 3.6 Usenet newsgroups 3.7 Terms of Service (TOS) 3.8 Certified email 3.9 Search data 3.10 User list exposure 3.11 AOL's Computer Checkup "scareware" 3.12 NSA Prism program 3.13 Hosting of user profiles changed, then discontinued 4 See also 5 References 6 External links History 1983–1991: Early years AOL began in 1983, as a short-lived venture called Control Video Corporation (or CVC), founded by William von Meister. Its sole product was an online service called GameLine for the Atari 2600 video game console, after von Meister's idea of buying music on demand was rejected by Warner Bros.[6] Subscribers bought a modem from the company for US$49.95 and paid a one-time US$15 setup fee. GameLine permitted subscribers to temporarily download games and keep track of high scores, at a cost of US$1 per game.[7] The telephone disconnected and the downloaded game would remain in GameLine's Master Module and playable until the user turned off the console or downloaded another game. In January 1983, Steve Case was hired as a marketing consultant for Control Video on the recommendation of his brother, investment banker Dan Case. In May 1983, Jim Kimsey became a manufacturing consultant for Control Video, which was near bankruptcy. Kimsey was brought in by his West Point friend Frank Caufield, an investor in the company.[6] In early 1985, von Meister left the company.[8] On May 24, 1985, Quantum Computer Services, an online services company, was founded by Jim Kimsey from the remnants of Control Video, with Kimsey as chief executive officer, and Marc Seriff as chief technology officer. The technical team consisted of Marc Seriff, Tom Ralston, Ray Heinrich, Steve Trus, Ken Huntsman, Janet Hunter, Dave Brown, Craig Dykstra, Doug Coward, and Mike Ficco. In 1987, Case was promoted again to executive vice-president. Kimsey soon began to groom Case to take over the role of CEO, which he did when Kimsey retired in 1991.[8] Kimsey changed the company's strategy, and in 1985, launched a dedicated online service for Commodore 64 and 128 computers, originally called Quantum Link ("Q-Link" for short).[7] The Quantum Link software was based on software licensed from PlayNet, Inc, (founded in 1983 by Howard Goldberg and Dave Panzl). The service was different from other online services as it used the computing power of the Commodore 64 and the Apple II rather than just a "dumb" terminal. It passed tokens back and forth and provided a fixed price service tailored for home users. In May 1988, Quantum and Apple launched AppleLink Personal Edition for Apple II[9] and Macintosh computers. In August 1988, Quantum launched PC Link, a service for IBM-compatible PCs developed in a joint venture with the Tandy Corporation. After the company parted ways with Apple in October 1989, Quantum changed the service's name to America Online.[10][11] Case promoted and sold AOL as the online service for people unfamiliar with computers, in contrast to CompuServe, which was well established in the technical community.[8] From the beginning, AOL included online games in its mix of products; many classic and casual games were included in the original PlayNet software system. In the early years of AOL the company introduced many innovative online interactive titles and games, including: Graphical chat environments Habitat (1986–1988) and Club Caribe (1988) from LucasArts. The first online interactive fiction series QuantumLink Serial by Tracy Reed (1988). Quantum Space, the first fully automated play-by-mail game (1989–1991). 1991–2006: Internet age, Time Warner merger First AOL logo as "America Online", used from 1991 to 2005. In February 1991, AOL for DOS was launched using a GeoWorks interface followed a year later by AOL for Windows.[7] This coincided with growth in pay-based online services, like Prodigy, CompuServe, and GEnie. 1991 also saw the introduction of an original Dungeons & Dragons title called Neverwinter Nights from Stormfront Studios; which was one of the first Multiplayer Online Role Playing Games to depict the adventure with graphics instead of text.[12] During the early 1990s, the average subscription lasted for about 25 months and accounted for $350 in total revenue. Advertisements invited modem owners to "Try America Online FREE", promising free software and trial membership.[13] AOL discontinued Q-Link and PC Link in late 1994. In September 1993, AOL added Usenet access to its features.[14] This is commonly referred to as the "Eternal September", as Usenet's cycle of new users was previously dominated by smaller numbers of college and university freshmen gaining access in September and taking a few weeks to acclimate. This also coincided with a new "carpet bombing" marketing campaign by CMO Jan Brandt to distribute as many free trial AOL trial disks as possible through nonconventional distribution partners. At one point, 50% of the CDs produced worldwide had an AOL logo.[15] AOL quickly surpassed GEnie, and by the mid-1990s, it passed Prodigy (which for several years allowed AOL advertising) and CompuServe.[8] Over the next several years, AOL launched services with the National Education Association, the American Federation of Teachers, National Geographic, the Smithsonian Institution, the Library of Congress, Pearson, Scholastic, ASCD, NSBA, NCTE, Discovery Networks, Turner Education Services (CNN Newsroom), NPR, The Princeton Review, Stanley Kaplan, Barron's, Highlights for Kids, the U.S. Department of Education, and many other education providers. AOL offered the first real-time homework help service (the Teacher Pager—1990; prior to this, AOL provided homework help bulletin boards), the first service by children, for children (Kids Only Online, 1991), the first online service for parents (the Parents Information Network, 1991), the first online courses (1988), the first omnibus service for teachers (the Teachers' Information Network, 1990), the first online exhibit (Library of Congress, 1991), the first parental controls, and many other online education firsts.[16] AOL purchased search engine WebCrawler in 1995, but sold it to Excite the following year; the deal made Excite the sole search and directory service on AOL.[17] After the deal closed in March 1997, AOL launched its own branded search engine, based on Excite, called NetFind. This was renamed to AOL Search in 1999.[18] America Online 2.0 software for Microsoft Windows (1994) AOL charged its users an hourly fee until December 1996,[19] when the company changed to a flat monthly rate of $19.95.[7] During this time, AOL connections were flooded with users trying to connect, and many canceled their accounts due to constant busy signals. A commercial was made featuring Steve Case telling people AOL was working day and night to fix the problem. Within three years, AOL's user base grew to 10 million people. In 1995 AOL was headquartered at 8619 Westwood Center Drive in the Tysons Corner CDP in unincorporated Fairfax County, Virginia,[20][21] near the Town of Vienna.[22] AOL was quickly running out of room in October 1996 for its network at the Fairfax County campus. In mid-1996, AOL moved to 22000 AOL Way in Dulles, unincorporated Loudoun County, Virginia to provide room for future growth.[23] In a five-year landmark agreement with the most popular operating system, AOL was bundled with Windows software.[24] On March 31, 1996, the short-lived eWorld was purchased by AOL. In 1997, about half of all U.S. homes with Internet access had it through AOL.[25] During this time, AOL's content channels, under Jason Seiken, including News, Sports, and Entertainment, experienced their greatest growth as AOL become the dominant online service internationally with more than 34 million subscribers. In November 1998, AOL announced it would acquire Netscape, best known for their web browser, in a major $4.2 billion deal.[7] The deal closed on March 17, 1999. Another large acquisition in December 1999 was that of MapQuest, for $1.1 billion.[26] In January 2000, as new broadband technologies were being rolled out around NYC metropolitan area, and the U.S., AOL and Time Warner announced plans to merge, forming AOL Time Warner, Inc. The terms of the deal called for AOL shareholders to own 55% of the new, combined company. The deal closed on January 11, 2001. The new company was led by executives from AOL, SBI, and Time Warner. Gerald Levin, who had served as CEO of Time Warner, was CEO of the new company. Steve Case served as chairman, J. Michael Kelly (from AOL) was the chief financial officer, Robert W. Pittman (from AOL) and Dick Parsons (from Time Warner) served as co-chief operating officers.[27] In 2002, Jonathan Miller became CEO of AOL.[28] The following year, AOL Time Warner dropped the "AOL" from its name. It was the largest merger in history when completed with the combined value of the companies at $360 billion. This value fell sharply, as low as $120 billion as markets repriced AOL's valuation as a pure internet firm more modestly when combined with the traditional media and cable business. This state didn't last long, and the company's value rose again within 3 months. By the end of that year, the tide had turned against "pure" internet companies, with many collapsing under falling stock prices, and even the strongest companies in the field losing up to 75% of their market value. The decline continued though 2001, but even with the losses, AOL was among the internet giants that continued to outperform brick and mortar companies.[29] In 2004, along with the launch of AOL 9.0 Optimized, AOL also made available the option of personalized greetings which would enable the user to hear his or her name while accessing basic functions and mail alerts, or while logging in or out. In 2005, AOL broadcast the Live 8 concert live over the Internet, and thousands of users downloaded clips of the concert over the following months.[30] In late 2005, AOL released AOL Safety & Security Center, a bundle of McAfee Antivirus, CA anti-spyware, and proprietary firewall and phishing protection software.[31] News reports in late 2005 identified companies such as Yahoo!, Microsoft, and Google as candidates for turning AOL into a joint venture.[32] Those plans were abandoned when it was revealed on December 20, 2005, that Google would purchase a 5% share of AOL for $1 billion. 2006–2009: Rebranding and decline Former AOL logo, used from 2005 to 2009 On April 3, 2006, AOL announced it was retiring the full name America Online; the official name of the service became AOL, and the full name of the Time Warner subdivision became AOL LLC.[33] On June 8, 2006,[34] AOL offered a new program called AOL Active Security Monitor, a diagnostic tool which checked the local PC's security status, and recommended additional security software from AOL or Download.com. The program rated the computer on a variety of different areas of security and general computer health. Two months later,[35] AOL released AOL Active Virus Shield. This software was developed by Kaspersky Lab. Active Virus Shield software was free and did not require an AOL account, only an internet email address. The ISP side of AOL UK was bought by Carphone Warehouse in October 2006 to take advantage of their 100,000 LLU customers, making Carphone Warehouse the biggest LLU provider in the UK.[36] Decline in AOL U.S. subscribers Q2 2001 – Q2 2009, with a significant drop from Q2 2006 onward. In August 2006, AOL announced they would give away email accounts and software previously available only to its paying customers provided the customer accessed AOL or AOL.com through a non-AOL-owned access method (otherwise known as "third party transit", "bring your own access", or "BYOA"). The move was designed to reduce costs associated with the "Walled Garden" business model by reducing usage of AOL-owned access points and shifting members with high-speed internet access from client-based usage to the more lucrative advertising provider, AOL.com.[37] The change from paid to free was also designed to slow the rate of members canceling their accounts and defecting to Microsoft Hotmail, Yahoo!, or other free email providers. The other free services included:[38] AIM (AOL Instant Messenger) AOL Video[39] featured professional content and allowed users to upload videos as well. AOL Local, comprising its CityGuide,[40] Yellow Pages[41] and Local Search[42] services to help users find local information like restaurants, local events, and directory listings. AOL News AOL My eAddress, a custom domain name for email addresses. These email accounts could be accessed in a manner similar to other AOL and AIM email accounts. Xdrive, which was a service offered by AOL, allowed users to back up their files over the Internet.[43] It was acquired by AOL on August 4, 2005[44] and closed on December 31, 2008.[45] It offered a free 5 GB account (free online file storage) to anyone with an AOL screenname.[43] Xdrive also provided remote backup services and 50 GB of storage for a $9.95 per month fee.[43] Also that month, AOL informed its US customers it would be increasing the price of its dial-up access to US$25.90. The increase was part of an effort to migrate the service's remaining dial-up users to broadband, as the increased price was the same price they had been charging for monthly DSL access.[46] However, AOL has since started offering their services for $9.95 a month for unlimited dial-up access.[47] On November 16, 2006, Randy Falco succeeded Jonathan Miller as CEO.[48] In December 2006, AOL closed their last remaining call center in the United States, "taking the America out of America Online" according to industry pundits. Service centers based in India and the Philippines continue to this day to provide customer support and technical assistance to subscribers.[49] An AOL Mobile sign at GSMA Barcelona, Spain, 2008 On September 17, 2007, AOL announced it was moving one of its corporate headquarters from Dulles, Virginia, to New York City[50] and combining its various advertising units into a new subsidiary called Platform A. This action followed several advertising acquisitions, most notably Advertising.com, and highlighted the company's new focus on advertising-driven business models. AOL management stressed "significant operations" will remain in Dulles, which included the company's access services and modem banks. In October 2007, AOL announced it would move one of its other headquarters from Loudoun County, Virginia, to New York City; it would continue to operate its Virginia offices.[51] As part of the impending move to New York and the restructuring of responsibilities at the Dulles headquarters complex after the Reston move, AOL CEO Randy Falco announced on October 15, 2007, plans to lay off 2,000 employees worldwide by the end of 2007, beginning "immediately".[52] The end result was a near 40% layoff across the board at AOL. Most compensation packages associated with the October 2007 layoffs included a minimum of 120 days of severance pay, 60 of which were given in lieu of the 60-day advance notice requirement by provisions of the 1988 Federal WARN Act.[52] By November 2007, AOL's customer base had been reduced to 10.1 million subscribers,[53] just narrowly ahead of Comcast and AT&T Yahoo!. According to Falco, as of December 2007, the conversion rate of accounts from paid access to free access was over 80%.[54] On January 3, 2008, AOL announced the closing of one of its three Northern Virginia data centers, Reston Technology Center, and sold it to CRG West.[55] On February 6, Time Warner CEO Jeff Bewkes announced Time Warner would split AOL's internet access and advertising businesses in two, with the possibility of later selling the internet access division.[56] On March 13, 2008, AOL purchased the social networking site Bebo for $850m (£417m).[57] On July 25, AOL announced it was shedding Xdrive, AOL Pictures, and BlueString to save on costs and focus on its core advertising business.[58] AOL Pictures was terminated on December 31. On October 31, AOL Hometown (a web hosting service for the websites of AOL customers) and the AOL Journal blog hosting service were eliminated.[59] 2009–2015: As a digital media company The AOL 'eraser' logo, in use since 2009 On March 12, 2009, Tim Armstrong, formerly with Google, was named chairman and CEO of AOL.[60] Shortly thereafter, on May 28, Time Warner announced it would spin off AOL as an independent company once Google's shares ceased at the end of the fiscal year.[61] On November 23, AOL unveiled a sneak preview of a new brand identity which has the wordmark "Aol." superimposed onto canvases created by commissioned artists. The new identity, designed by Wolff Olins,[62] was enacted onto all of AOL's services on December 10, the date AOL traded independently for the first time since the Time Warner merger on the New York Stock Exchange under the symbol AOL.[63] On April 6, 2010, AOL announced plans to shut down or sell Bebo;[64] on June 16, the property was sold to Criterion Capital Partners for an undisclosed amount, believed to be around $10 million.[65] In December, AIM eliminated access to AOL chat rooms noting a marked decline of patronage in recent months.[66] Under Armstrong's leadership, AOL began taking steps in a new business direction, marked by a series of acquisitions. On June 11, 2009, AOL had already announced the acquisition of Patch Media, a network of community-specific news and information sites which focuses on individual towns and communities.[67] On September 28, 2010, at the San Francisco TechCrunch Disrupt Conference, AOL signed an agreement to acquire TechCrunch to further its overall strategy of providing premier online content.[68][69] On December 12, 2010, AOL acquired about.me, a personal profile and identity platform, four days after that latter's public launch.[70] On January 31, 2011, AOL announced the acquisition of European video distribution network, goviral.[71] In March 2011, AOL acquired HuffPost for $315 million.[72][73] Shortly after the acquisition was announced, Huffington Post co-founder Arianna Huffington replaced AOL content chief David Eun, assuming the role of president and editor-in-chief of the AOL Huffington Post Media Group.[74] On March 10, AOL announced it would cut around 900 workers due to the HuffPost acquisition.[75] On September 14, 2011, AOL formed a strategic ad selling partnership with two of its largest competitors, Yahoo and Microsoft. According to the new partnership, the three companies would begin selling inventory on each other's sites. The strategy was designed to help them compete with Google and ad networks.[76] On February 28, 2012, AOL partnered with PBS to launch MAKERS, a digital documentary series focusing on high-achieving women in male-dominated industries such as war, comedy, space, business, Hollywood and politics.[77][78][79] Subjects for MAKERS episodes have included Oprah Winfrey, Hillary Clinton, Sheryl Sandberg, Martha Stewart, Indra Nooyi, Lena Dunham, and Ellen DeGeneres. On March 15, 2012, AOL announced the acquisition of Hipster, a mobile photo-sharing app for an undisclosed amount.[80] On April 9, 2012, AOL announced a deal to sell 800 patents to Microsoft for $1.056 billion. The deal includes a "perpetual" license for AOL to use these patents.[81] In April, AOL took several steps to expand its ability to generate revenue through online video advertising. The company announced it would offer gross rating point (GRP) guarantee for online video, mirroring the TV ratings system and guaranteeing audience delivery for online video advertising campaigns bought across its properties.[82] This announcement came just days before the Digital Content NewFront (DCNF) a two-week event held by AOL, Google, Hulu, Microsoft, Vevo and Yahoo to showcase the participating sites' digital video offerings. The Digital Content NewFront were conducted in advance of the traditional television upfronts in hopes of diverting more advertising money into the digital space.[83] On April 24, the company launched the AOL On network, a single website for its video output.[84] In February 2013, AOL reported its fourth quarter revenue of $599.5 million, its first growth in quarterly revenue in 8 years.[85] In August 2013, Armstrong announced Patch Media would scale back or sell hundreds of its local news sites.[86] Not long afterwards, layoffs began, with up to 500 out of 1,100 positions initially impacted.[87] On January 15, 2014, Patch Media was spun off, with majority ownership being held by Hale Global.[88] By the end of 2014, AOL controlled 0.74% of the global advertising market, well behind industry leader Google's 31.4%.[89] On January 23, 2014, AOL acquired Gravity, a software startup that tracked users' online behavior and tailored ads and content based on their interests, for $83 million.[90] The deal, which included roughly 40 Gravity employees and their personalization technology, was CEO Tim Armstrong's fourth largest deal since taking over the company in 2009. Later that year, AOL also acquired Vidible, which developed technology to help websites run video content from other publishers, and help video publishers sell their content to these websites. The deal, which was announced December 1, 2014, was reportedly worth roughly $50 million.[91] On July 16, 2014, AOL earned an Emmy nomination for the AOL original series, The Future Starts Here, in the News and Documentary category.[92] This came days after AOL earned its first Primetime Emmy Award nomination for Park Bench with Steve Buscemi in the Outstanding Short Form Variety Series category, which later won the award.[93] Created and hosted by Tiffany Shlain, the series focused on human's relationship with technology and featured episodes such as The Future of Our Species, Why We Love Robots, and A Case for Optimism. 2015–2021: Division of Verizon AOL's Silicon Valley branch office. On May 12, 2015, Verizon announced plans to buy AOL for $50 per share in a deal valued at $4.4 billion. The transaction was completed on June 23. Armstrong, who continued to lead the firm following regulatory approval, called the deal the logical next step for AOL. "If you look forward five years, you're going to be in a space where there are going to be massive, global-scale networks, and there's no better partner for us to go forward with than Verizon." he said. "It's really not about selling the company today. It's about setting up for the next five to 10 years."[3] Analyst David Bank said he thought the deal made sense for Verizon.[3] The deal will broaden Verizon's advertising sales platforms and increase its video production ability through websites such as HuffPost, TechCrunch, and Engadget.[89] However, Craig Moffett said it was unlikely the deal would make a big difference to Verizon's bottom line.[3] AOL had about two million dial-up subscribers at the time of the buyout.[89] The announcement caused AOL's stock price to rise 17%, while Verizon's stock price dropped slightly.[3] Shortly before the Verizon purchase, on April 14, 2015, AOL launched ONE by AOL, a digital marketing programmatic platform that unifies buying channels and audience management platforms to track and optimize campaigns over multiple screens.[94] Later that year, on September 15, AOL expanded the product with ONE by AOL: Creative, which is geared towards creative and media agencies to similarly connect marketing and ad distribution efforts.[95] On May 8, 2015, AOL reported its first-quarter revenue of $625.1 million, $483.5 million of which came from advertising and related operations, marking a 7% increase from Q1 2014. Over that year, the AOL Platforms division saw a 21% increase in revenue, but a drop in adjusted OIBDA due to increased investments in the company's video and programmatic platforms.[96] On June 29, 2015, AOL announced a deal with Microsoft to take over the majority of its digital advertising business. Under the pact, as many as 1,200 Microsoft employees involved with the business will be transferred to AOL, and the company will take over the sale of display, video, and mobile ads on various Microsoft platforms in nine countries, including Brazil, Canada, the United States, and the United Kingdom. Additionally, Google Search will be replaced on AOL properties with Bing—which will display advertising sold by Microsoft. Both advertising deals are subject to affiliate marketing revenue sharing.[97][98] On July 22, 2015, AOL received two News and Documentary Emmy nominations, one for MAKERS in the Outstanding Historical Programming category, and the other for True Trans With Laura Jane Grace, which documented the story of Laura Jane Grace, a transgender musician best known as the founder, lead singer, songwriter and guitarist of the punk rock band Against Me!, and her decision to come out publicly and overall transition experience.[99] On September 3, 2015, AOL agreed to buy Millennial Media for US$238 million.[100] On October 23, 2015, AOL completed the acquisition.[101] On October 1, 2015, Go90, a free ad-supported mobile video service aimed at young adult and teen viewers that Verizon owns and AOL oversees and operates launched its content publicly after months of beta testing.[102][103] The initial launch line-up included content from Comedy Central, HuffPost, Nerdist News, Univision News, Vice, ESPN and MTV.[102] On January 25, 2016, AOL expanded its ONE platform by introducing ONE by AOL: Publishers, which combines six previously separate technologies to offer various publisher capabilities such as customizing video players, offering premium ad experience to boost visibility, and generating large video libraries.[104] The announcement was made in tandem with AOL's acquisition of AlephD, a Paris-based startup focused on publisher analytics of ad price tracking based on historical data.[105] AOL announced AlephD would be a part of the ONE by AOL: Publishers platform.[106] On April 20, 2016, AOL acquired virtual reality studio RYOT to bring immersive 360 degree video and VR content to HuffPost's global audience across desktop, mobile, and apps.[107] In July 2016, Verizon Communications announced its intent to purchase the core internet business of Yahoo!. Verizon tentatively plans to merge AOL with Yahoo into a new company called "Oath Inc." Which in January 2019 rebranded itself as Verizon Media.[108] In April 2018, Oath Inc. sold Moviefone to MoviePass Parent Helios and Matheson Analytics.[109][110][111] In November 2020 the Huffington Post was sold to BuzzFeed in a stock deal.[112] 2021–present: Division of Apollo On May 3, 2021, Verizon announced it would sell AOL and Yahoo to Apollo for $5 billion.[5] Products and services Content This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (April 2017) (Learn how and when to remove this template message) As of 2019, the following media brands became subsidiary of AOL's parent Verizon Media.[113] HuffPost[72][114] (sold to Buzzfeed in November 2020) Engadget[115] Autoblog[116] TechCrunch[117] Cambio[118] AOL's content contributors consists of over 20,000 bloggers, including politicians, celebrities, academics, and policy experts, who contribute on a wide range of topics making news.[119] In addition to mobile-optimized web experiences, AOL produces mobile applications for existing AOL properties like Autoblog, Engadget, The Huffington Post, TechCrunch, and products such as Alto, Pip, and Vivv. Advertising AOL has a global portfolio of media brands and advertising services across mobile, desktop, and TV. Services include brand integration and sponsorships through its in-house branded content arm, Partner Studio by AOL, as well as data and programmatic offerings through ad technology stack, ONE by AOL. AOL acquired a number of businesses and technologies help to form ONE by AOL. These acquisitions included AdapTV in 2013 and Convertro, Precision Demand, and Vidible in 2014.[120] ONE by AOL is further broken down into ONE by AOL for Publishers (formerly Vidible, AOL On Network and Be On for Publishers) and ONE by AOL for Advertisers, each of which have several sub-platforms.[121][122] On September 10, 2018, AOL's parent company Oath consolidated Yahoo BrightRoll, One by AOL and Yahoo Gemini to 'simplify' adtech service by launching a single advertising proposition dubbed Oath Ad Platforms.[123] Membership AOL offers a range of integrated products and properties including communication tools, mobile apps and services and subscription packages. Dial-up Internet access – According to AOL quarterly earnings report May 8, 2015, 2.1 million people still use AOL's dial-up service.[124] AOL Mail – AOL Mail is AOL's proprietary email client. It is fully integrated with AIM and links to news headlines on AOL content sites. AOL Instant Messenger (AIM) – was AOL's proprietary instant-messaging tool. It was released in 1997. It lost market share to competition in the instant messenger market such as Google Chat, Facebook Messenger, and Skype.[125] It also included a video-chat service, AV by AIM. On December 15, 2017, AOL discontinued AIM.[126] AOL Plans – AOL Plans offers three online safety and assistance tools: ID protection, data security and a general online technical assistance service.[127] AOL Desktop AOL Desktop Developer(s) AOL Initial release December 8, 2007; 13 years ago (2007-12-08)[128] Stable release 9.8[129](Windows) 1.7 (macOS) / August 10, 2015 Preview release 11.0.2535 / January 23, 2020.[130] Written in C++ Operating system Microsoft Windows XP or later, Mac OS X 10.4.8 or later Type Internet Suite License Proprietary Website help.aol.com/articles/aol-desktop-downloading-and-installing AOL Desktop is an internet suite produced by AOL from 2007[131][132] that integrates a web browser, a media player and an instant messenger client.[129] Version 10.X was based on AOL OpenRide,[133] it is an upgrade from such.[134] The macOS version is based on WebKit. AOL Desktop version 10.X was different from previous AOL browsers and AOL Desktop versions. Its features are focused on web browsing as well as email. For instance, one does not have to sign into AOL in order to use it as a regular browser. In addition, non-AOL email accounts can be accessed through it. Primary buttons include "MAIL", "IM", and several shortcuts to various web pages. The first two require users to sign in, but the shortcuts to web pages can be used without authentication. AOL Desktop version 10.X was late marked as unsupported in favor of supporting the AOL Desktop 9.X versions. Version 9.8 was released, replacing the Internet Explorer components of the internet browser with CEF[135] (Chromium Embedded Framework) to give users an improved web browsing experience closer to that of Chrome Version 11 of AOL Desktop, currently in Beta, is a total rewrite but maintains a similar user interface to the previous 9.8.X series of releases.[130] In 2017, a new paid version called AOL Desktop Gold was released, available for $4.99 per month after trial. It replaced the previous free version.[136] After the shutdown of AIM in 2017, AOL's original chat rooms continued to be accessible through AOL Desktop Gold, and some rooms remained active during peak hours. That chat system was shut down on December 15, 2020.[137] In addition to AOL Desktop, the company also offered AOL Toolbar as a browser toolbar for several web browsers that provided quick access to AOL services. The toolbar was available from 2007 until 2018. Criticism AOL CDs sent to a student dormitory in Germany, 2002 In its earlier incarnation as a "walled garden" community and service provider, AOL received criticism for its community policies, terms of service, and customer service. Prior to 2006, AOL was known for its direct mailing of CD-ROMs and 3.5-inch floppy disks containing its software. The disks were distributed in large numbers; at one point, half of the CDs manufactured worldwide had AOL logos on them.[138] The marketing tactic was criticized for its environmental cost, and AOL CDs were recognized as PC World's most annoying tech product.[139][140] Community leaders AOL used a system of volunteers to moderate its chat rooms, forums and user communities. The program dated back to AOL's early days, when it charged by the hour for access and one of its highest billing services was chat. AOL provided free access to community leaders in exchange for moderating the chat rooms, and this effectively made chat very cheap to operate, and more lucrative than AOL's other services of the era. There were 33,000 community leaders in 1996.[141] All community leaders received hours of training and underwent a probationary period. While most community leaders moderated chat rooms, some ran AOL communities and controlled their layout and design, with as much as 90% of AOL's content being created or overseen by community managers until 1996.[142] By 1996, ISPs were beginning to charge flat rates for unlimited access, which they could do at a profit because they only provided internet access. Even though AOL would lose money with such a pricing scheme, it was forced by market conditions to offer unlimited access in October 1996. In order to return to profitability, AOL rapidly shifted its focus from content creation to advertising, resulting in less of a need to carefully moderate every forum and chat room to keep users willing to pay by the minute to remain connected.[143] After unlimited access, AOL considered scrapping the program entirely, but continued it with a reduced number of community leaders, with scaled-back roles in creating content.[142] Although community leaders continued to receive free access, after 1996 they were motivated more by the prestige of the position and the access to moderator tools and restricted areas within AOL.[141][142] By 1999, there were over 15,000 volunteers in the program.[144] In May 1999, two former volunteers filed a class-action lawsuit alleging AOL violated the Fair Labor Standards Act by treating volunteers like employees. Volunteers had to apply for the position, commit to working for at least three to four hours a week, fill out timecards and sign a non-disclosure agreement.[145] On July 22, AOL ended its youth corps, which consisted of 350 underage community leaders.[141] At this time, the United States Department of Labor began an investigation into the program, but it came to no conclusions about AOL's practices.[145] AOL ended its community leader program on June 8, 2005. The class action lawsuit dragged on for years, even after AOL ended the program and AOL declined as a major internet company. In 2010, AOL finally agreed to settle the lawsuit for $15 million.[146] The community leader program was found to be an example of co-production in a 2009 article in International Journal of Cultural Studies.[142] Billing disputes AOL has faced a number of lawsuits over claims that it has been slow to stop billing customers after their accounts have been canceled, either by the company or the user. In addition, AOL changed its method of calculating used minutes in response to a class action lawsuit. Previously, AOL would add 15 seconds to the time a user was connected to the service and round up to the next whole minute (thus, a person who used the service for 12 minutes and 46 seconds would be charged for 14 minutes). AOL claimed this was to account for sign on/sign off time, but because this practice was not made known to its customers, the plaintiffs won (some also pointed out that signing on and off did not always take 15 seconds, especially when connecting via another ISP). AOL disclosed its connection-time calculation methods to all of its customers and credited them with extra free hours. In addition, the AOL software would notify the user of exactly how long they were connected and how many minutes they were being charged. AOL was sued by the Ohio Attorney General in October 2003 for improper billing practices. The case was settled on June 8, 2005. AOL agreed to resolve any consumer complaints filed with the Ohio AG's office. In December 2006, AOL agreed to provide restitution to Florida consumers to settle the case filed against them by the Florida Attorney General.[147] Account cancellation Many customers complained that AOL personnel ignored their demands to cancel service and stop billing. In response to approximately 300 consumer complaints, the New York Attorney General's office began an inquiry of AOL's customer service policies.[citation needed] The investigation revealed that the company had an elaborate scheme for rewarding employees who purported to retain or "save" subscribers who had called to cancel their Internet service. In many instances, such retention was done against subscribers' wishes, or without their consent. Under the scheme, customer service personnel received bonuses worth tens of thousands of dollars if they could successfully dissuade or "save" half of the people who called to cancel service.[citation needed] For several years, AOL had instituted minimum retention or "save" percentages, which consumer representatives were expected to meet. These bonuses, and the minimum "save" rates accompanying them, had the effect of employees not honoring cancellations, or otherwise making cancellation unduly difficult for consumers. On August 24, 2005, America Online agreed to pay $1.25 million to the state of New York and reformed its customer service procedures. Under the agreement, AOL would no longer require its customer service representatives to meet a minimum quota for customer retention in order to receive a bonus.[147] However the agreement only covered people in the state of New York.[148] On June 13, 2006, Vincent Ferrari documented his account cancellation phone call in a blog post,[149] stating he had switched to broadband years earlier. In the recorded phone call, the AOL representative refused to cancel the account unless the 30-year-old Ferrari explained why AOL hours were still being recorded on it. Ferrari insisted that AOL software was not even installed on the computer. When Ferrari demanded that the account be canceled regardless, the AOL representative asked to speak with Ferrari's father, for whom the account had been set up. The conversation was aired on CNBC. When CNBC reporters tried to have an account on AOL cancelled, they were hung up on immediately and it ultimately took more than 45 minutes to cancel the account.[150] On July 19, 2006, AOL's entire retention manual was released on the Internet.[151] On August 3, 2006, Time Warner announced that the company would be dissolving AOL's retention centers due to its profits hinging on $1 billion in cost cuts. The company estimated that it would lose more than six million subscribers over the following year.[152] Direct marketing of disks Some promotional CD-ROMs distributed in Canada. CD in original mailer Prior to 2006, AOL was infamous for the unsolicited mass direct mail of 31⁄2" floppy disks and CD-ROMs containing their software. They were the most frequent user of this marketing tactic, and received criticism for the environmental cost of the campaign.[153] According to PC World, in the 1990s "you couldn't open a magazine (PC World included) or your mailbox without an AOL disk falling out of it".[148] The mass distribution of these disks was seen as wasteful by the public and led to protest groups. One such was No More AOL CDs, a web-based effort by two IT workers[154] to collect one million disks with the intent to return the disks to AOL.[155] The website was started in August 2001, and an estimated 410,176 CDs were collected by August 2007 when the project was shut down.[155] Software In 2000, AOL was served with an $8 billion lawsuit alleging that its AOL 5.0 software caused significant difficulties for users attempting to use third-party Internet service providers. The lawsuit sought damages of up to $1000 for each user that had downloaded the software cited at the time of the lawsuit. AOL later agreed to a settlement of $15 million, without admission of wrongdoing.[156] The AOL software then was given a feature called AOL Dialer, or AOL Connect on Mac OS X. This feature allowed users to connect to the ISP without running the full interface. This allowed users to use only the applications they wish to use, especially if they do not favor the AOL Browser. AOL 9.0 was once identified by Stopbadware as being under investigation[157] for installing additional software without disclosure, and modifying browser preferences, toolbars, and icons. However, as of the release of AOL 9.0 VR (Vista Ready) on January 26, 2007, it was no longer considered badware due to changes AOL made in the software.[158] Usenet newsgroups When AOL gave clients access to Usenet in 1993, they hid at least one newsgroup in standard list view: alt.aol-sucks. AOL did list the newsgroup in the alternative description view, but changed the description to "Flames and complaints about America Online". With AOL clients swarming Usenet newsgroups, the old, existing user base started to develop a strong distaste for both AOL and its clients, referring to the new state of affairs as Eternal September.[159] AOL discontinued access to Usenet on June 25, 2005.[160] No official details were provided as to the cause of decommissioning Usenet access, except providing users the suggestion to access Usenet services from a third-party, Google Groups. AOL then provided community-based message boards in lieu of Usenet. Terms of Service (TOS) AOL has a detailed set of guidelines and expectations for users on their service, known as the Terms of Service (TOS, also known as Conditions of Service, or COS in the UK). It is separated into three different sections: Member Agreement, Community Guidelines and Privacy Policy.[161][162] All three agreements are presented to users at time of registration and digital acceptance is achieved when they access the AOL service. During the period when volunteer chat room hosts and board monitors were used, chat room hosts were given a brief online training session and test on Terms of Service violations. There have been many complaints over rules that govern an AOL user's conduct. Some users disagree with the TOS, citing the guidelines are too strict to follow coupled with the fact the TOS may change without users being made aware. A considerable cause for this was likely due to alleged censorship of user-generated content during the earlier years of growth for AOL.[163][164][165][166] Certified email In early 2005, AOL stated its intention to implement a certified email system called Goodmail, which will allow companies to send email to users with whom they have pre-existing business relationships, with a visual indication that the email is from a trusted source and without the risk that the email messages might be blocked or stripped by spam filters. This decision drew fire from MoveOn, which characterized the program as an "email tax", and the Electronic Frontier Foundation (EFF), which characterized it as a shakedown of non-profits.[167] A website called Dearaol.com[168] was launched, with an online petition and a blog that garnered hundreds of signatures from people and organizations expressing their opposition to AOL's use of Goodmail. Esther Dyson defended the move in an editorial in The New York Times, saying "I hope Goodmail succeeds, and that it has lots of competition. I also think it and its competitors will eventually transform into services that more directly serve the interests of mail recipients. Instead of the fees going to Goodmail and AOL, they will also be shared with the individual recipients."[169] Tim Lee of the Technology Liberation Front[170] posted an article that questioned the Electronic Frontier Foundation's adopting a confrontational posture when dealing with private companies. Lee's article cited a series of discussions[171] on Declan McCullagh's Politechbot mailing list on this subject between the EFF's Danny O'Brien and antispammer Suresh Ramasubramanian, who has also compared[172] the EFF's tactics in opposing Goodmail to tactics used by Republican political strategist Karl Rove. SpamAssassin developer Justin Mason posted some criticism of the EFF's and Moveon's "going overboard" in their opposition to the scheme. The dearaol.com campaign lost momentum and disappeared, with the last post to the now defunct dearaol.com blog—"AOL starts the shakedown" being made on May 9, 2006. Comcast, who also used the service, announced on its website that Goodmail had ceased operations and as of February 4, 2011, they no longer used the service.[173] Search data Main article: AOL search data scandal On August 4, 2006, AOL released a compressed text file on one of its websites containing 20 million search keywords for over 650,000 users over a 3-month period between March 1, 2006 and May 31, intended for research purposes. AOL pulled the file from public access by August 7, but not before its wide distribution on the Internet by others. Derivative research, titled A Picture of Search[174] was published by authors Pass, Chowdhury and Torgeson for The First International Conference on Scalable Information Systems.[175] The data were used by websites such as AOLstalker[176] for entertainment purposes, where users of AOLstalker are encouraged to judge AOL clients based on the humorousness of personal details revealed by search behavior. User list exposure In 2003, Jason Smathers, an AOL employee, was convicted of stealing America Online's 92 million screen names and selling them to a known spammer. Smathers pled guilty to conspiracy charges in 2005.[177][178] Smathers pled guilty to violations of the US CAN-SPAM Act of 2003.[179] He was sentenced in August 2005 to 15 months in prison; the sentencing judge also recommended Smathers be forced to pay $84,000 in restitution, triple the $28,000 that he sold the addresses for.[180] AOL's Computer Checkup "scareware" On February 27, 2012, a class action lawsuit was filed against Support.com, Inc. and partner AOL, Inc. The lawsuit alleged Support.com and AOL's Computer Checkup "scareware" (which uses software developed by Support.com) misrepresented that their software programs would identify and resolve a host of technical problems with computers, offered to perform a free "scan," which often found problems with users' computers. The companies then offered to sell software—for which AOL allegedly charged $4.99 a month and Support.com $29—to remedy those problems.[181] Both AOL, Inc. and Support.com, Inc. settled on May 30, 2013, for $8.5 million. This included $25.00 to each valid class member and $100,000 each to Consumer Watchdog and the Electronic Frontier Foundation.[182] Judge Jacqueline Scott Corley wrote: "Distributing a portion of the [funds] to Consumer Watchdog will meet the interests of the silent class members because the organization will use the funds to help protect consumers across the nation from being subject to the types of fraudulent and misleading conduct that is alleged here," and "EFF's mission includes a strong consumer protection component, especially in regards to online protection."[181] AOL continues to market Computer Checkup.[183] NSA Prism program Following media reports about PRISM, NSA's massive electronic surveillance program, in June 2013, several technology companies were identified as participants, including AOL. According to leaks of said program, AOL joined the PRISM program in 2011.[184] Hosting of user profiles changed, then discontinued At one time, most AOL users had an online "profile" hosted by the AOL Hometown service. When AOL Hometown was discontinued, users had to create a new profile on Bebo. This was an unsuccessful attempt to create a social network that would compete with Facebook. When the value of Bebo decreased to a tiny fraction of the $850 million AOL paid for it, users were forced to recreate their profiles yet again, on a new service called AOL Lifestream. AOL took the decision to shut down Lifestream on February 24, 2017, and gave users one month's notice to save off photos and videos that had been uploaded to Lifestream.[185] Following the shutdown, AOL no longer provides any option for hosting user profiles. During the Hometown/Bebo/Lifestream era, another user's profile could be displayed by clicking the "Buddy Info" button in the AOL Desktop software. After the shutdown of Lifestream, clicking "Buddy Info" does something that provides no information whatsoever about the selected buddy: it causes the AIM home page (www.aim.com) to be displayed. See also Adrian Lamo – Inside-AOL.com AOHell Comparison of webmail providers David Shing Dot-com bubble List of acquisitions by AOL List of S&P 400 companies Live365 Sessions@AOL Truveo References ^ Nollinger, Matt (September 1, 1995). "America, Online!". Wired. Retrieved October 25, 2018. ^ "Verizon buys faded Internet pioneer AOL for $4.4 bn". ^ a b c d e Imbert, Fred (May 12, 2015). "Verizon to buy AOL for $4.4B; AOL shares soar". CNBC. Retrieved May 12, 2015. ^ Sawers, Paul (June 23, 2015). "Verizon completes $4.4B acquisition of AOL". VentureBeat. Retrieved June 23, 2015. ^ a b Business, Jordan Valinsky, CNN. "Verizon offloads Yahoo and AOL in $5 billion deal". CNN. Retrieved May 3, 2021. ^ a b Klein, Alec (2003). Stealing Time: Davin, Quinton, and the Collapse of AOL Time Warner. New York: Simon & Schuster. ISBN 978-0-7432-5984-2. ^ a b c d e David Lumb (May 12, 2015). "A Brief History of AOL". Fast Company. Retrieved May 12, 2015. ^ a b c d Charles Warner (2011). Media Selling: Television, Print, Internet, Radio. John Wiley & Sons. ISBN 978-1-4443-5927-5. ^ Peter Friedman interviewed on the TV show Triangulation on the TWiT.tv network ^ "History of Computing Industrial Era (1985–1990)". The History of Computing Project. March 20, 2006. Archived from the original on November 3, 2005. Retrieved September 24, 2005. ^ "Apple II history chapter 22". December 31, 2002. Archived from the original on August 28, 2005. Retrieved September 24, 2005. ^ "The Original Neverwinter Nights 1991–1997". bladekeep.com. ^ "Own a Modem?". Computer Gaming World. August 1994. pp. 117–118. ^ Catb.org. Catb.org. Retrieved on July 8, 2011. ^ Siegler, MG (December 27, 2010). "How Much Did It Cost AOL To Send Us Those CDs In The 90s? "A Lot!," Says Steve Case". TechCrunch. Retrieved March 4, 2017. ^ Michael Wolff (1997). Netstudy. Dell Publishing. ^ "AOL gets Excited – Nov. 25, 1996". ^ "History of AOL Search". July 5, 2007. ^ "For $19.95 a month, unlimited headaches for AOL". January 27, 1997. Archived from the original on January 20, 2016. ^ "Encyclopedia.com". The Washington Post. April 17, 2005. Archived from the original on November 19, 2009. Retrieved May 7, 2009. ^ "Tysons Corner CDP, Virginia." United States Census Bureau. Retrieved on May 7, 2009. Archived November 10, 2011, at the Wayback Machine ^ Sugawara, Sandra. "America Online to Reduce Rates; Firm Faces Subscriber Boycott, Pressure From Competitors." The Washington Post. October 13, 1994. Financial B09. Retrieved on May 7, 2009. ^ "Company Overview". corp.aol.com. AOL. February 8, 2008. Archived from the original on February 8, 2008. ^ David Bank (2001). Breaking Windows: How Bill Gates Fumbled the Future of Microsoft. Simon and Schuster. p. 105. ISBN 978-0-7432-0315-9. ^ "The Fall of Facebook". (December 2014). The Atlantic, pp. 35. ^ "AOL acquires MapQuest – Dec. 22, 1999". ^ Tim Arango (January 10, 2010). "How the AOL-Time Warner Merger Went So Wrong". The New York Times. ^ Henry, Shannon (August 7, 2002). "At AOL, New Boss Largely Unknown; 'Who's Jon Miller?' Employees Ask At Dulles Offices". Wash. Post. Archived from the original on March 29, 2015 – via HighBeam Research. Note: only the beginning of the news article was available, the remainder behind a paywall. ^ Bryer, Lanning; Seminsky, Melvin (2002). Intellectual Property Assets in Mergers and Acquisitions. Wiley. ^ "Live 8". Billboard: 22. July 29, 2006. ^ Jeff Bertolucci (July 2007). "Protect your PC". Kiplinger's Personal Finance. ^ Yang, Catherine (November 11, 2005). "Has AOL Met Its Match?". BusinessWeek. Archived from the original on January 2, 2013. Retrieved August 1, 2006. ^ "America Online Changes Its Name to AOL". April 3, 2006. Archived from the original on July 15, 2006. Retrieved July 24, 2006. ^ AOL Launches Free Software To Improve PC Security For All Internet Users. Time Warner. Retrieved on July 8, 2011. ^ "AOL News and Broadcast Center". Press.aol.com. November 11, 2010. Archived from the original on June 23, 2007. Retrieved July 8, 2011. ^ "Carphone Warehouse buying AOL UK". BBC News. October 11, 2006. Retrieved April 25, 2010. ^ AOL scraps fees in bid to keep users. USA Today. Retrieved on April 9, 2012. ^ "AOL Uses Refurbished Software to Woo Customers". The Money Times. October 4, 2006. Archived from the original on November 10, 2006. Retrieved November 11, 2006. ^ Video.aol.com. Video.aol.com (November 11, 2010). Retrieved on July 8, 2011. ^ "Cityguide.aol.com". Cityguide.aol.com. Archived from the original on January 12, 2010. Retrieved April 25, 2014. ^ Yellowpages.aol.com Archived July 28, 2010, at the Wayback Machine. Yellowpages.aol.com. Retrieved on July 8, 2011. ^ "Local.aol.com". Archived from the original on June 12, 2009. Retrieved July 8, 2011. ^ a b c Pogue, David (January 6, 2007). "Fewer excuses for not doing a PC backup". The New York Times. Retrieved January 6, 2007. Quote: "Online backups, where files are shuttled off to the Internet for safekeeping, are suddenly becoming effortless, capacious and even free." ^ "America Online, Inc. Announces Acquisition of Xdrive, Inc". Retrieved July 14, 2018. ^ "AOL Begins Shutdown Of AOL Pictures, BlueString And Xdrive". TechCrunch. Retrieved July 14, 2018. ^ Mills, Elinor (February 28, 2006). "AOL hanging up on dial-up customers?". CNET. Retrieved February 13, 2021. ^ "AOL price plans". Archived from the original on November 1, 2006. Retrieved November 1, 2006. ^ "Randy Falco is the new CEO of AOL". TechWhack. ^ Stafford, Jim (December 2, 2006). "America Online to close city call center". The Oklahoman. ^ Steel, Emily (September 17, 2007). "AOL Moves Headquarters To New York City". The Wall Street Journal. Retrieved September 17, 2007. ^ Goldfarb, Zachary and Sam Diaz (September 18, 2007). "AOL Moving Executives, Headquarters to New York". The Washington Post. Retrieved May 7, 2009. ^ a b Hansell, Saul (October 15, 2007). "Tuesday is Layoff Day at AOL". The New York Times. Archived from the original on October 17, 2007. Retrieved October 17, 2007. ^ Rosencrance, Linda (November 8, 2007). "AOL revenue, subscribers plummet". ComputerWorld. Archived from the original on November 17, 2007. Retrieved November 12, 2007. ^ "AOL (TWX): Randy Falco's Year-End Love Note to AOLers". Archived from the original on December 18, 2007. Retrieved December 18, 2007. ^ "CRG West accounces the acquisition of Data Center in Reston, Virginia" (PDF). January 3, 2008. Archived (PDF) from the original on December 17, 2008. Retrieved November 16, 2008. ^ "Time Warner Will Split AOL: Financial News – Yahoo! Finance". biz.yahoo.com. Archived from the original on February 7, 2008. ^ BBC NEWS | Business AOL acquires Bebo social network ^ "AOL Begins Shutdown Of AOL Pictures, BlueString And Xdrive". TechCrunch. Retrieved July 10, 2018. ^ "We're Closing Our Doors". PeopleConnectionBlog.com. AOL. Archived from the original on October 28, 2008. ^ Tim Armstrong Named Chairman and CEO of AOL. AOL Press Release. Retrieved on April 9, 2012. ^ Time Warner walking out on AOL marriage. NBC News (May 28, 2009). Retrieved on July 8, 2011. ^ Public Class. "AOL". Wolff Olins. Archived from the original on November 8, 2011. Retrieved January 30, 2012. ^ AOL Celebrates Day One as an Independent Company. AOL Press Release. Retrieved on April 9, 2012. ^ Barnett, Emma (April 7, 2010). "AOL prepares to shut down Bebo". telegraph.co.uk. London. Retrieved April 6, 2010. ^ AOL sells Bebo for scrap – and a $275 million tax break. CNN Money. Retrieved on April 12, 2011. ^ Why is AIM Chat Closed? Archived October 29, 2013, at the Wayback Machine. AOL Help. Retrieved on April 9, 2012. ^ Swisher, Kara. "Back to the Future: AOL Goes Local With Two Acquisitions (Including CEO's Company)". AllThingsD. Retrieved June 11, 2009. ^ Armstrong, Tim (September 28, 2010). "We Got TechCrunch!". TechCrunch. Archived from the original on October 1, 2010. Retrieved September 29, 2010. ^ Arrington, Michael (September 28, 2010). "Why We Sold TechCrunch to AOL and Where We Go From Here". TechCrunch. Archived from the original on September 29, 2010. Retrieved September 29, 2010. ^ AOL Acquires Personal Profile Startup About.Me. TechCrunch. Retrieved April 9, 2012. ^ ONLINE VIDEO DISTRIBUTION NETWORK GOVIRAL ACQUIRED BY AOL EUROPE. AOL Press Release. Retrieved April 9, 2012. ^ a b Steel, Emily (March 7, 2011). "AOL Completes Purchase of Huffington Post". The Wall Street Journal. ^ AOL buys Huffington Post: the beginning of the end?. Guardian. Retrieved on July 8, 2011. ^ Wired.com. Wired.com. Retrieved on July 8, 2011. ^ Pepitone, Julianne (March 10, 2011). "AOL cuts 900 jobs after HuffPo buy". CNN. ^ "allthingsd.com". allthingsd.com. September 14, 2011. Retrieved January 30, 2012. ^ Dwyer, Kate (March 28, 2016). "How You Can Be in the Music Video for Michelle Obama's Song With Zendaya and Lea Michele". Teen Vogue. ^ "AOL and PBS Announce 'MAKERS: WOMEN WHO MAKE AMERICA'". PBS. February 28, 2012. ^ "AOL and PBS Announce 'MAKERS: Women Who Make America'". AOL Corp. Retrieved January 26, 2016. ^ AOL acquires mobile photo-sharing app Hipster. VentureBeat. Retrieved on April 9, 2012. ^ AOL and Microsoft Announce $1.056 Billion Deal. AOL Press Release. Retrieved on April 9, 2012. ^ Thielman, Sam. "Nielsen, AOL Chase Ads With TV-Like Ratings Web giant issues bold guarantees regarding its online GRP's". AdWeek. Retrieved April 16, 2012. ^ Vega, Tanzia; Elliott, Stuart (April 26, 2012). "Small Screens, Big Dollars". The New York Times. Retrieved July 1, 2017. ^ Coyle, Jake (April 24, 2012). "AOL launches online video network, AOL On". Associated Press. Retrieved May 1, 2012. ^ Hagey, Keach (February 8, 2013). "AOL Quarterly Revenue Rises for First Time in Years". The Wall Street Journal. Retrieved July 1, 2017. ^ Kafka, Peter (August 9, 2013). "400 Patch Sites on the Block, AOL Says". AllThingsD. Retrieved August 22, 2013. ^ Hagey, Keach (August 16, 2013). "AOL Begins Layoffs At Patch". The Wall Street Journal. Retrieved August 22, 2013. ^ Kaufman, Leslie (January 15, 2014). "AOL Finds a Partner to Run Its Troubled Patch Division". New York Times. ^ a b c "Verizon buys AOL for $4.4bn". BBC. May 12, 2015. Retrieved May 12, 2015. ^ MacMillan, Douglas (January 23, 2014). "AOL Buys Software Startup Gravity". WSJ Blogs - Digits. Retrieved January 29, 2016. ^ "AOL Adds More Video Help by Buying Content Syndicator Vidible for Around $50 Million". Re/code. December 2014. Retrieved January 29, 2016. ^ "AOL Original "The Future Starts Here" by @TiffanyShlain Nominated for News And Documentary Emmy Award". ^ "Steve Buscemi Gets Emmy Love for 'Park Bench'". ^ "AOL Corp". AOL Corp. Retrieved January 28, 2016. ^ "AOL Corp". AOL Corp. Retrieved January 28, 2016. ^ "Quarterly Earnings – Investor Relations – AOL". ir.aol.com. Retrieved February 5, 2016. ^ Grandoni, Dino (June 29, 2015). "AOL in Deal With Microsoft to Take Over Display Ad Business". The New York Times. Retrieved June 30, 2015. ^ Shields, Mike; Ovide, Shira (June 29, 2015). "AOL Takes Over Majority of Microsoft's Ad Business, Swaps Google Search For Bing". The Wall Street Journal. Retrieved June 30, 2015. ^ "NOMINEES FOR THE 36th ANNUAL NEWS & DOCUMENTARY EMMY AWARDS ANNOUNCED" (PDF). Archived from the original (PDF) on February 5, 2016. ^ "AOL Confirms It Is Buying Millennial Media In $238M Deal To Expand In Mobile Ads". TechCrunch. ^ "AOL Completes Acquisition of Millennial Media". Nasdaq. ^ a b "Verizon launches go90 mobile video service". USA TODAY. Retrieved January 26, 2016. ^ Roettgers, Janko (October 8, 2015). "Verizon May Strike Partnerships With Other Carriers to Take Go90 International". Variety. Retrieved January 26, 2016. ^ "AOL Introduces New 'All-in-One' Platform for Publishers". adage.com. Retrieved February 5, 2016. ^ Ha, Anthony. "AOL Acquires AlephD To Be Part Of Its Newly Unified Publisher Platform". TechCrunch. Retrieved February 5, 2016. ^ "AOL Buys AlephD to Boost Publisher Support". www.ecommercetimes.com. Retrieved February 5, 2016. ^ "AOL acquires VR content studio Ryot to bring immersive video to the Huffington Post". venturebeat.com. April 20, 2016. Retrieved April 20, 2016. ^ "Verizon is mashing Yahoo and AOL into a new company called Oath". The Verge. April 3, 2017. Retrieved April 3, 2017. ^ Todd Spangler (April 5, 2018). "MoviePass Parent Acquires Moviefone in Deal With Verizon's Oath". Variety. ^ "Helios and Matheson Analytics and MoviePass Acquire Moviefone in Strategic Move". Businesswire. April 5, 2018. ^ Rhett Jones (April 5, 2018). "MoviePass Buys Moviefone as It Presses Forward With Movie Theater Domination". Gizmodo. ^ Hagey, Benjamin Mullin and Keach (November 19, 2020). "BuzzFeed to Acquire HuffPost in Stock Deal With Verizon Media". The Wall Street Journal. ISSN 0099-9660. Retrieved January 19, 2021. ^ "Verizon has sold mapping service MapQuest as the telecom giant continues to trim its media investments". Business Insider. ^ "AOL Agrees To Acquire The Huffington Post". HuffPost. February 7, 2011. ^ "AOL buys blog network Weblogs Inc". msnbc.com. October 6, 2005. Retrieved June 20, 2018. ^ "AOL Buys Huffington Post for $315 Million, Arianna to Head AOL Media". WIRED. Retrieved July 1, 2018. ^ Arrington, Michael. "Why We Sold TechCrunch To AOL, And Where We Go From Here". TechCrunch. Retrieved December 9, 2017. ^ Stelter, Brian. "AOL Teams With Jonas Group for MTV-Style Site". Retrieved June 20, 2018. ^ "AOL Products and Services: Content". Archived from the original on July 17, 2012. Retrieved July 24, 2012. ^ "Overview". AOL Corp. Retrieved February 5, 2016. ^ "ONE BY AOL FOR PUBLISHERS". AOL Platforms. Retrieved February 5, 2016. ^ "ONE BY AOL FOR ADVERTISERS". AOL Platforms. Retrieved February 5, 2016. ^ Cameron Clarke (September 10, 2018). "Oath consolidates BrightRoll, One by AOL and Yahoo Gemini to 'simplify' adtech service. Launches a single advertising proposition dubbed Oath Ad Platforms". The Drum. ^ Matyszczyk, Chris. "More than 2 million people still pay for AOL dial-up". CNET. Retrieved May 8, 2015. ^ "A Going-Away Message: AOL Instant Messenger Is Shutting Down". Retrieved July 12, 2018. ^ Molina, Brett (October 6, 2017). "RIP AIM: AOL Instant Messenger dies in December". USA Today. McLean, Virginia. Retrieved October 6, 2017. ^ "AOL Membership". AOL Corp. Retrieved February 5, 2016. ^ "AOL debuts new desktop software for Windows". BetaNews. December 10, 2007. Retrieved January 24, 2020. ^ a b "AOL Desktop for Windows". Discover AOL. Archived from the original on September 19, 2015. Retrieved September 17, 2015. "We're sorry. This product is not available outside of the US or Canada." ^ a b "AOL Beta Central". Retrieved January 24, 2020. ^ "Free Software From AOL - Discover AOL". December 8, 2007. Archived from the original on December 8, 2007. Retrieved January 24, 2020. ^ "AOL Desktop / AOL Helix". October 12, 2007. Archived from the original on October 12, 2007. Retrieved January 24, 2020. ^ "August 8th Helix Beta Chat". aol.com. Archived from the original on March 4, 2016. Retrieved April 12, 2015. ^ "AOL Heads in New Direction with 'Helix'". BetaNews. July 26, 2007. ^ "Beta – Main". beta.aol.com. Retrieved July 27, 2016. ^ "Free AOL Desktop is being discontinued". ^ "AOL Desktop Gold Chat Rooms to shut down on December 15, 2020". AOL. Retrieved June 17, 2021. ^ Siegler, M (December 27, 2010). "Comment How Much Did It Cost AOL To Send Us Those CDs In The 90s? "A Lot!," Says Steve Case". Tech Crunch. Retrieved June 11, 2013. ^ Dornin, Rusty (October 17, 2002). "CD overload? Send them back to AOL". CNN Tech. Archived from the original on February 24, 2013. Retrieved October 17, 2002. ^ "Your Top 10 Most Annoying Tech Products". PCWorld. April 16, 2007. Retrieved June 26, 2009. ^ a b c "Inside AOL's "Cyber-Sweatshop"". WIRED. Retrieved February 2, 2016. ^ a b c d Postigo, Hector (September 3, 2009). "America Online volunteers: Lessons from an early co-production community". International Journal of Cultural Studies. 12 (5): 451–469. doi:10.1177/1367877909337858. S2CID 144865243. ^ Munk, Nina (2009). Fools Rush In: Steve Case, Jerry Levin, and the Unmaking of AOL Time Warner. HarperCollins. pp. 82–88. ISBN 9780061743740. ^ Napoli, Lisa (May 26, 1999). "Former Volunteers Sue AOL, Seeking Back Pay for Work". The New York Times. p. Section B, Page 10. ^ a b "The Aol Chat Room Monitor Revolt". Priceonomics. Retrieved February 2, 2016. ^ Kirchner, Lauren (February 10, 2011). "AOL Settled with Unpaid "Volunteers" for $15 Million". Columbia Journalism Review. ^ a b "AOL". Better Business Bureau. Archived from the original on July 18, 2010. Retrieved January 22, 2008. ^ a b Tynan, Dan (May 26, 2006). "The 25 Worst Tech Products of All Time". PCWorld. Retrieved April 15, 2012. ^ "Cancelling AOL". insignificantthoughts.com. June 13, 2006. Archived from the original on December 31, 2010. Retrieved November 28, 2010. ^ Wells, Jane (June 21, 2006). "How hard can it be to cancel an AOL account?". CNBC. Retrieved July 24, 2006. ^ Popken, Ben. (July 19, 2006) America Online: AOL Retention Manual Uploaded in Full. Consumerist.com. Retrieved on July 8, 2011. ^ AOL: TimeWarner Dissolves AOL Retention Centers. Consumerist.com (August 3, 2006). Retrieved on July 8, 2011. ^ Rusty Dornin (October 18, 2002). "Campaign: Send AOL CDs back". CNN. ^ What to do with those AOL CDs, a March 2003 CBC News article ^ a b Internet Archive Wayback Machine 2007 Aug 20 archive of NoMoreAOLCDs.com main page. Web.archive.org (August 20, 2007). Retrieved on July 8, 2011. ^ Gardencitygroup.com (PDF). Retrieved on July 8, 2011. ^ "Stopbadware.org". Archived from the original on February 20, 2007. ^ StopBadware.org Archived July 29, 2012, at the Wayback Machine. StopBadware.org (January 26, 2007). Retrieved on July 8, 2011. ^ "The Making of an Underclass: AOL" Archived May 5, 2011, at the Wayback Machine net.wars Chapter 3, Wendy M. Grossman, NYU Press, 1998. ^ AOL Pulls Plug on Newsgroup Service. BetaNews. Retrieved on July 8, 2011. ^ "AOL TERMS OF SERVICE". help.channels.aol.com/. Archived from the original on November 2, 2007. ^ "Conditions of Service". help.aol.co.uk/. Archived from the original on May 1, 2010. ^ Aolwatch.org. Aolwatch.org (July 25, 1996). Retrieved on July 8, 2011. ^ Thetruthseeker.co.uk Archived September 13, 2010, at the Wayback Machine, The Truth Seeker – Internet Censorship ^ Censorship on AOL Late 1998–1999. Fglaysher.com (March 9, 1999). Retrieved on July 8, 2011. ^ "Electronic Frontier Foundation". Electronic Frontier Foundation. Archived from the original on July 6, 2010. ^ Cindy Cohn (February 8, 2006). "AOL, Yahoo and Goodmail: Taxing Your Email for Fun and Profit". EFF. ^ "Stop AOL's Email Tax". dearaol.com. Archived from the original on January 4, 2007. Retrieved November 28, 2010. ^ Dyson, Esther (March 17, 2006). "You've Got Goodmail". The New York Times. Retrieved July 24, 2006. ^ Techliberation.com Archived August 7, 2008, at the Wayback Machine. Techliberation.com. Retrieved on July 8, 2011. ^ "Debate over DearAOL.com between Suresh Ramasubramanian and Danny O'Brien". politechbot.com. Archived from the original on April 25, 2006. Retrieved November 28, 2010. ^ Ramasubramanian, Suresh (May 12, 2006). "EFF and Its Use of Propaganda: Could Karl Rove do better? Probably". CircleID. Retrieved November 28, 2010. ^ Security.comcast.net Archived March 19, 2012, at the Wayback Machine, February 4, 2011 ^ IR.iit.edu Archived August 19, 2006, at the Wayback Machine. (PDF) . Retrieved on July 8, 2011. ^ CS.hku.hk Archived September 27, 2011, at the Wayback Machine. CS.hku.hk. Retrieved on July 8, 2011. ^ "AOLstalker homepage". Archived from the original on September 29, 2017. Retrieved September 28, 2018. ^ "Ex-AOL worker who stole e-mail list sentenced". NBC News., August 17, 2005 ^ "Pair Nabbed in AOL Spam Scheme". TheSmokingGun.com. June 23, 2004. ^ Ex-AOL employee pleads guilty in spam case CNN, February 4, 2005. Retrieved March 7, 2007. ^ "Ex-AOL worker who stole e-mail list sentenced". Associated Press. August 17, 2005. Retrieved August 8, 2016. ^ a b Davis, Wendy (May 20, 2013). "AOL, Support.Com Settle Scareware Lawsuit For $8.5 Million". MediaPost. Retrieved October 7, 2014. ^ "FINAL JUDGMENT ORDER for Lagarde v. Support.com Inc". Justia Dockets & Filings. ^ "AOL Computer Checkup: Clean & Speed Up Your Slow PC – Try It Free". AOL Inc. 2014. Retrieved October 7, 2014. ^ Greenwald, Glenn; MacAskill, Ewen (June 7, 2013). "NSA Prism program taps in to user data of Apple, Google and others". The Guardian. Guardian News and Media Limited. ^ "AOL Lifestream Sunset Notification". Retrieved April 13, 2017. External links Wikimedia Commons has media related to AOL. Official website v t e AOL Websites Aol.com Yahoo! Search Related AOLserver ART image file format Elwood Edwards One by AOL OSCAR protocol TAC Ultravox Verizon Media Yahoo! Acquisitions Former AIM Alto Mail buy.at Community Leader Program CompuServe DMOZ Explorer FanHouse Ficlets Gravity Hometown Neverwinter Nights On Politics Daily press Propeller.com Radio Radio KOL Seed Singingfish Socialthing TOC protocol TV v t e Verizon Media Brands AOL Mail Built By Girls Engadget Flurry Rivals.com RYOT TechCrunch Verizon Digital Media Services Yahoo! Former AIM Alto Mail Flickr go90 HuffPost MapQuest Moviefone Polyvore Tumblr Companies portal Business and economics portal Internet portal New York City portal United States portal Authority control General ISNI 1 Other Microsoft Academic MusicBrainz label Coordinates: 40°43′51″N 73°59′29″W / 40.7308°N 73.9914°W / 40.7308; -73.9914 Retrieved from "https://en.wikipedia.org/w/index.php?title=AOL&oldid=1038024606" Categories: AOL 1983 establishments in the United States 2015 mergers and acquisitions Companies based in Dulles, Virginia Companies based in New York City Companies formerly listed on the New York Stock Exchange Companies in the PRISM network Former WarnerMedia subsidiaries Internet properties established in 1983 Internet properties established in 2009 Internet service providers of the United States Internet services supporting OpenID Pre–World Wide Web online services Telecommunications companies established in 1983 Telecommunications companies established in 2009 Verizon Media Web portals Web service providers Hidden categories: Webarchive template wayback links Articles with short description Short description is different from Wikidata Wikipedia indefinitely semi-protected pages Use mdy dates from May 2021 Articles needing additional references from April 2017 All articles needing additional references All articles with unsourced statements Articles with unsourced statements from April 2012 Commons category link from Wikidata Wikipedia articles with ISNI identifiers Wikipedia articles with MA identifiers Wikipedia articles with MusicBrainz label identifiers Coordinates not on Wikidata Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read View source View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Wikinews Languages العربية Azərbaycanca বাংলা Bân-lâm-gú Беларуская Български Català Čeština Dansk Deutsch Español Esperanto فارسی Français 한국어 हिन्दी Bahasa Indonesia Íslenska Italiano עברית ಕನ್ನಡ ქართული Magyar მარგალური Bahasa Melayu Nederlands 日本語 Norsk bokmål Norsk nynorsk Oʻzbekcha/ўзбекча Polski Português Română Русский Simple English سنڌي Slovenščina کوردی Suomi Svenska ไทย Türkçe Українська Tiếng Việt 吴语 中文 Edit links This page was last edited on 10 August 2021, at 02:32 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-5306 ---- The WELL - Wikipedia The WELL From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article is about the Whole Earth Electronic Link online community. For other uses, see well (disambiguation). Internet community This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "The WELL" – news · newspapers · books · scholar · JSTOR (August 2012) (Learn how and when to remove this template message) Whole Earth 'Lectronic Link Type of site Virtual community Available in English Owner The WELL Group Inc. URL well.com Launched February 1985; 36 years ago (1985-02)[1] The Whole Earth 'Lectronic Link, normally shortened to The WELL, is one of the oldest virtual communities in continuous operation. As of June 2012, it had 2,693 members.[needs update][2] It is best known for its Internet forums, but also provides email, shell accounts, and web pages. The discussion and topics on The WELL range from deeply serious to trivial, depending on the nature and interests of the participants.[3] Contents 1 History 2 Topics of discussion 3 Policy and governance 4 Journalists 5 In the news 6 Virtual community and social network difference 7 Publications about The WELL 8 See also 9 References 10 External links History[edit] The WELL was started by Stewart Brand and Larry Brilliant in 1985, and the name (an acronym for Whole Earth 'Lectronic Link)[4] is partially a reference to some of Brand's earlier projects, including the Whole Earth Catalog. Initially The WELL was owned 50% by The Point Foundation (publishers of the Whole Earth Catalog and Whole Earth Review) and 50% by NETI Technologies Inc. a Vancouver-based company of which Larry Brilliant was at that time the chairman. The WELL began as a dial-up bulletin board system (BBS) influenced by EIES,[5] became one of the original dial-up ISPs in the early 1990s when commercial traffic was first allowed, and changed into its current form as the Internet and web technology evolved. Its original management team—Matthew McClure, soon joined by Cliff Figallo and John Coate—collaborated with its early users to foster a sense of virtual community.[citation needed] Gail Ann Williams was hired by Figallo in 1991, as community manager, and has continued in management roles into the current era. From 1994 to 1999 The WELL was owned by Bruce R. Katz, founder of Rockport, a manufacturer of walking shoes.[6] In April 1999 it was acquired by Salon, several of whose founders such as Scott Rosenberg had previously been regular participants there. In August 2005 Salon announced that it was looking for a buyer for The WELL, in order to concentrate on other business lines. In November 2006, a press release of The WELL said, "As Salon has not found a suitable purchaser, it has determined that it is currently in the best interest of the company to retain this business and has therefore suspended all efforts to sell The WELL."[7] In June 2012 Salon once again announced that it was looking for a buyer for The WELL as its subscriber base "did not bear financial promise". Additionally, it announced that it had entered into discussions with various parties interested in buying the well.com domain name, and that the remaining WELL staff had been laid off at the end of May.[8] The community pledged money to take over The WELL itself and rehire important staff.[9] In September 2012, Salon sold The WELL to a new corporation, The WELL Group Inc., owned by a group of eleven investors, who are all long-time members. The CEO was Earl Crabb, who died on February 20, 2015. The sale price was reported to be $400,000. Members have no official role in the management, but "can ... go back to what they do best: conversation. And complaining about the management."[10][11] Notable items in WELL history include being the forum through which John Perry Barlow, John Gilmore, and Mitch Kapor, the founders of the Electronic Frontier Foundation, first met. Howard Rheingold, an early and very active member, was inspired to write his book The Virtual Community by his experience on The WELL. According to Rheingold's book, The WELL's Usenet feed was for years provided by Apple Computer over UUCP. The WELL was a major online meeting place for fans of the Grateful Dead, especially those who followed the band from concert to concert, in the late 1980s and early 1990s. The WELL also played a role in the book Takedown about the pursuit and capture of Kevin Mitnick. Founded in Sausalito, California, the service is now based in Emeryville. Topics of discussion[edit] The WELL is organized into subject areas known as "conferences". These conferences reflect member interests, and include arts, health, business, regions, hobbies, spirituality, music, politics, games, software and many more. Within conferences, members open separate conversational threads called "topics" for specific items of interest. For example, the Media conference has (or had) topics devoted to The New York Times, media ethics, and the Luann comic strip. An example of a local conference is the one on San Francisco, which has topics on restaurants, the city government, and neighborhood news. "Public" conferences are open to all members, while "private" conferences are restricted to a list of users controlled by the conference hosts, called the "ulist". Some "featured private" or "private independent" conferences (such as "Women on the WELL" and "Recovery") are listed in the WELL's directory, but are access-restricted for privacy or membership-restriction reasons. Members may request admission to such conferences. There are also a large number of unlisted "secret private" conferences. The names of these conferences are public, but the contents, hosts, and members are restricted to members of a particular conference. Membership in private conferences is by invitation. WELL members may open their own new public or private independent conferences. Policy and governance[edit] The directors of The WELL have included Matthew McClure and Cliff Figallo, both veterans of the 1970s commune called The Farm, and Gail Williams, previously known as one of the principals in the political satire group the Plutonium Players. In 2016, The WELL hired Christian Ruzich and Daryl Lynn Johnson, who have over 30 years of combined experience on The WELL, to be the General Managers. The couple, who met on The WELL, will draw on their years of marketing and online community experience to help The WELL become the prime destination for premium online conversation and discussion. The community forums, known as "conferences", are supervised by "conference hosts" who guide conversations and may enforce conference rules on civility and/or appropriateness. Initially all hosts were selected by staff members. In 1995, Gail Williams changed the policies to enable user-created forums. Participants can create their own "independent" personal conferences—either viewable by any WELL member or privately viewable by those members on a restricted membership list—on any subject they please with any rules they like. Overall support and supervision of the conferencing services is handled by several staff members, often referred to collectively as "confteam", the name of the UNIX user account used by staff for conference maintenance. They have more system operational powers than conference hosts, along with the additional social authority of selecting "featured conference" hosts and closing accounts for abuse. WELL members use a consistent login name when posting messages, and a non-fixed pseudonym field alongside it. The "pseud" (in WELL parlance) defaults to the user's real name, but can be changed at will and so often reflects a quotation from another user, or is an in-joke, or may be left blank. The user's real name can be easily looked up using their login name. WELL members are not anonymous. There is a time-honored double meaning to the WELL slogan coined by Stewart Brand, "You Own Your Own Words" or ("YOYOW"): members have both the rights to their posted words and responsibility for those words, too. (Members can also delete their posts at any time, but a placeholder indicates the former location and author of a deleted or "scribbled" post, as well as who deleted it.) Journalists[edit] The WELL was frequently mentioned in the media in the 1980s and 1990s, probably disproportionately to the number of users it had relative to other online systems. This has diminished but not disappeared in recent years, with other online communities becoming commonplace. This early visibility was largely the result of the early policy of providing free accounts for interested journalists and other select members of the media. As a result, for many journalists it was their first experience of online systems and, later, the Internet, even though other systems existed. Although accounts are now seldom provided for free to journalists, there are still a sizable number on The WELL; for example columnist Jon Carroll of the San Francisco Chronicle, Wendy M. Grossman of The Inquirer, and critic Andy Klein of Los Angeles CityBeat. The WELL also received numerous awards in the 1980s and 1990s, including a Webby Award for online community in 1998, and an EFF Pioneer Award in 1994. In the news[edit] In March 2007, The WELL was noted for refusing membership to Kevin Mitnick, and refunding his membership fee.[12] Virtual community and social network difference[edit] This section possibly contains original research. Please improve it by verifying the claims made and adding inline citations. Statements consisting only of original research should be removed. (December 2018) (Learn how and when to remove this template message) There is often confusion between a virtual community and social network. They are similar in some aspects because they both can be used for personal and professional interests. A social network offers an opportunity to connect with people one already knows or is acquainted with. Facebook and Twitter are social networks. Platforms such as LinkedIn and Yammer open up communication channels among coworkers and peers with similar professions in a more relaxed setting. Often social media guidelines are in place for professional usage so that everyone understands what is suitable online behavior.[13][14] Using a social network is an extension of an offline social community. It is helpful in keeping connections among friends and associates as locations change. move. Each user has their own spider web structure which is their social network.[15][16] Virtual communities differ in that users aren't connected through a mutual friend or similar backgrounds. These groups are formed by people who may be complete strangers but have a common interest or ideology.[17][16] Virtual communities connect people who normally wouldn't consider themselves to be in the same group.[18] These groups continue to stay relevant and maintained in the online world because users feel a need to contribute to the community and in return feel empowered when receiving new information from other members. Virtual communities have an elaborate nest structure because they overlap. Yelp, YouTube, and Wikipedia are all examples of a virtual community. Companies like Kaiser Permanente launched virtual communities for members. The community gave members the ability to control their health care decisions and improve their overall experience.[18] Members of a virtual community are able to offer opinions and contribute helpful advice. Again, the difference between virtual communities and social network is the emergence of the relationship. The WELL distinguished itself from the technology of the time by creating a networked community for everyone. Users were responsible and owned the content posted, a rule created to protect the information from being copyrighted and commoditized.[19] Women particularly were able to find community and voice on the WELL. While largely bound to household work at the time, women of the WELL could be participants and contributors on message boards by sharing experiences and information.[19] Publications about The WELL[edit] Howard Rheingold, The Virtual Community (1994) Perennial ISBN 0-06-097643-8 (Hardcover) – ISBN 0-262-68121-8 (2000 revised paperback edition) John Seabrook, Deeper: My Two-Year Odyssey in Cyberspace (1997) Simon & Schuster ISBN 0-684-80175-2 (Hardcover) – ISBN 0-684-83873-7 (Paperback) Katie Hafner, The WELL: A Story of Love, Death and Real Life in the Seminal Online Community (2001) Carroll & Graf Publishers ISBN 0-7867-0846-8 Katie Hafner's book, expanded from a Wired Magazine article, chronicles the odd birth, growing pains, and interpersonal dynamics that make The WELL the unusual, perhaps unique online community that it is. Fred Turner, From Counterculture to Cyberculture: Stewart Brand, the Whole Earth Network, and the Rise of Digital Utopianism (2006) University of Chicago Press ISBN 0-226-81741-5 "Where the Counterculture met the New Economy: The WELL and the Origins of Virtual Community", Technology and Culture, Vol.46, No.3 (July, 2005), pp. 485–512. Tierney, John. "Stewart Brand - John Tierney - An Early Environmentalist, Embracing New 'Heresies'". The New York Times, February 27, 2007, sec. Environment. https://www.nytimes.com/2007/02/27/science/earth/27tier.html. Kirk, Andrew. "Appropriating Technology: The Whole Earth Catalog and Counterculture Environmental Politics". In Environmental History, 374–94, 2001. Counterculture Green: The Whole Earth Catalog and American Environmentalism. Lawrence, Kan: University Press of Kansas, 2007. See also[edit] William H. Calvin CIX Cyberia (book) Hugh Daniel Digerati Brian Eno Global Business Network Michael Gruber (author) Peter Ludlow Tom Mandel Declan McCullagh Douglas Rushkoff John Seabrook Gail Williams References[edit] ^ Pernick, Ron (1995). "A Timeline of the First Ten Years of The WELL". Retrieved 2008-06-28. ^ "The Well, a Pioneering Online Community, Is for Sale Again". The New York Times, June 29, 2012 ^ "WELL, The.". Encyclopædia Britannica Ultimate Reference Suite. Encyclopædia Britannica. 2015. ISBN 9783803266316. ^ Learn About The WELL well.com ^ "IRC History -- Electronic Information Exchange System (EIES)". ^ Markoff, John (January 4, 1994). "COMPANY NEWS; Influential Computer Service Sold". New York Times. Retrieved 27 July 2014. ^ "The Well to Stay With Salon" (Press release). The WELL. November 14, 2006. Retrieved 2007-11-08. ^ "Salon 10K filing, June 2012". 2012. Retrieved 2012-07-02. ^ "Will The WELL Survive? Members Pledge $100K+ to Buy Influential Virtual Community from Corporate Owners". 2012. Retrieved 2012-07-02. ^ Salon Media Group Sells The WELL to The Well Group Archived 2012-11-15 at the Wayback Machine ^ Grossman, Wendy. "Salon sells The WELL to its members". Retrieved 27 July 2014. ^ Kevin Mitnick is Unforgiven Wired, March 21, 2007 ^ Mahlberg, T. (2017). Alter-Identity Work via Social Media in Professional Service Contexts. In Proceedings of the 28th Australasian Conference on Information Systems (ACIS 2017). Chicago ^ "What is social network? - Definition from WhatIs.com". SearchCIO. Retrieved 2018-09-29. ^ Clauset, A. (2005). Finding local community structure in networks. Physical review E, 72(2), 026132. ^ a b "Social Network vs. Online Community: What Is the Difference?". Social Media Today. Retrieved 2018-09-29. ^ Wellman, B., & Gulia, M. (1999). Virtual communities as communities. Communities in cyberspace, 167-194. ^ a b "EXAMPLES OF VIRTUAL COMMUNITIES". encyclopedia.jrank.org. Retrieved 2018-09-29. ^ a b From Counterculture to Cyberculture. Turner, Fred. University of Chicago Press. 2010. ISBN 978-1282894839. OCLC 824162179.CS1 maint: others (link) External links[edit] The WELL "The WELL Gopher". Archived from the original on 2011-09-07. Retained in 2008 as a text museum and served via HTTP till around 2012 Wired news: Salon buys The WELL Wired magazine: "The Epic Saga of the WELL" by Katie Hafner The WELL: Small Town on the Internet Highway System by Cliff Figallo C|net News.com: "The WELL celebrates 20th birthday" at archive.today (archived 2013-01-20) Net Wars at The Inquirer: "You own your own 20th anniversary" C|net News.com: "Salon places The WELL up for sale" at archive.today (archived 2013-01-19) v t e Whole Earth Catalog Editors Stewart Brand Lloyd Kahn Jay Kinney Kevin Kelly Howard Rheingold Anne Herbert Ken Kesey (guest) Community Portola Institute Point Foundation The WELL Other publications CoEvolution Quarterly Whole Earth Software Catalog and Review Whole Earth Review/Whole Earth Related topics Whole Earth Access Whole Internet User's Guide and Catalog Long Now Foundation Wired Buckminster Fuller James Baldwin ATS-3 Earthrise Retrieved from "https://en.wikipedia.org/w/index.php?title=The_WELL&oldid=1032629318" Categories: 1985 establishments in the United States Bulletin board systems Culture of San Francisco Gopher (protocol) Internet forums Pre–World Wide Web online services Shell account providers Webby Award winners Whole Earth Catalog Internet properties established in 1985 Hidden categories: Webarchive template wayback links CS1 maint: others Articles with short description Short description matches Wikidata Articles needing additional references from August 2012 All articles needing additional references Wikipedia articles in need of updating from August 2019 All Wikipedia articles in need of updating All articles with unsourced statements Articles with unsourced statements from July 2016 Articles that may contain original research from December 2018 All articles that may contain original research Webarchive template archiveis links Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Español Euskara Français Italiano 日本語 Русский Svenska Edit links This page was last edited on 8 July 2021, at 16:51 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-5406 ---- Sophie Treadwell - Wikipedia Sophie Treadwell From Wikipedia, the free encyclopedia Jump to navigation Jump to search American playwright This article cites its sources but does not provide page references. You can help to improve it by introducing citations that are more precise. (October 2020) (Learn how and when to remove this template message) Sophie Anita Treadwell (October 3, 1885 – February 20, 1970) was an American playwright and journalist of the first half of the 20th century. She is best known for her play Machinal which is often included in drama anthologies as an example of an expressionist or modernist play. Treadwell wrote dozens of plays, several novels, as well as serial stories and countless articles that appeared in newspapers. In addition to writing plays for the theatre, Treadwell also produced, directed and acted in some of her productions. The styles and subjects of Treadwell's writings are vast, but many present women's issues of her time, subjects of current media coverage, or aspects of Treadwell's Mexican heritage.[1] Sophie Treadwell on U.S. auto tour Contents 1 Heritage and childhood 2 University and early career 3 New York 4 Broadway 5 Later years 6 Plays and novels 6.1 Plays and novels 7 Journalism 8 Contemporaries and context 9 Resources and further reading 10 References 11 External links Heritage and childhood[edit] Sophie Anita Treadwell was born in 1885 in Stockton, California.[2] Between 1890 and 1891, Treadwell's father, Alfred Treadwell, deserted her and her mother, Nettie Fairchild Treadwell, and moved to San Francisco.[2][3] Although Treadwell originally excelled at school, after her father left she struggled, which others have attributed to the frequency with which she and her mother relocated.[1] While Treadwell primarily lived with her mother, occasionally Treadwell would spend summers in San Francisco with her father. During these visits, Treadwell was first exposed to theatre; she witnessed famous actresses Helena Modjeska and Sarah Bernhardt in The Merchant of Venice and Phèdre, respectively. In 1902, Treadwell and her mother moved to San Francisco.[2] Although Treadwell's father was also born in Stockton, CA, he spent most of his formative years in Mexico with his native-born mother.[3] Both Treadwell's paternal grandmother and great-grandmother were Mexican women of Spanish descent.[3] Treadwell's father had a Catholic education and was fluent in five languages.[3] Treadwell's strong female role model was her grandmother Anna Gray Fairchild, a Scottish immigrant, who managed the family's large ranch in Stockton after the death of her husband.[3] Traces of Treadwell's heritage—both Mexican and European can be gleaned from her works, as can references to her parents' troubled marriage and her time spent at the ranch in Stockton.[1] University and early career[edit] Treadwell at UC Berkeley[1] Treadwell received her Bachelor of Letters in French from the University of California at Berkeley, where she studied from 1902 to 1906.[2][3] At Berkeley, Treadwell became very involved with the school's extracurricular drama and journalism activities, serving as the college's correspondent for The San Francisco Examiner.[1] Due to financial pressure, Treadwell had to work several jobs during her studies; receiving additional training in shorthand and typing, teaching English as a second language in the evenings, as well as working in the circulation department of the San Francisco Call.[3] It was also during this time that she first began to write; early drafts of shorter plays, songs, and short fictional stories.[3] During college, Treadwell had her first brushes with mental illness, a variety of nervous conditions that would plague her and lead to several extended hospitalizations throughout her life.[2][3] After college, Treadwell moved to Los Angeles where she worked for a brief time as a vaudeville singer.[1] She then studied acting and was mentored by renowned Polish actress Helena Modjeska, whose memoirs she was hired to write in 1908.[2] In 1910, Treadwell married William O. McGeehan, better known as 'Mac', a beloved sports writer for the San Francisco Bulletin.[1][2] New York[edit] In 1915, Treadwell moved to New York,[2] following her husband who had already made the cross-country move for his career.[3] In New York, Treadwell joined the Lucy Stone League of suffragists.[2] Treadwell participated in a 150-mile march with the League, which delivered a petition on women's suffrage to the legislature of New York.[1] Treadwell maintained a separate residence from her husband, an idea encouraged by the League.[1] Her marriage was said to be one of mutual independence and acceptance of differing interests.[1] In New York, Treadwell befriended and became associated with many well known modernist personalities and modern artists of the time, notably Louise and Walter Arensberg who ran a New York Salon, and painter Marcel Duchamp. Congruous with Treadwell's advocacy for sexual independence, birth control rights, and increased sexual freedom for women, Treadwell had a brief affair with the artist Maynard Dixon between 1916 and 1919.[1][3] Treadwell reached the peak of her professional career in journalism and in theatre in New York in the 1920s.[1] Treadwell attended lectures and completed an extensive study with Richard Boleslavsky of the Moscow Art Theatre which proved to be both influential and motivational for Treadwell's varied theatrical pursuits.[1] Treadwell underwent media controversy in the mid-20s for a drawn out dispute with the famous John Barrymore; Barrymore attempted to produce a play about Edgar Allan Poe supposedly written by his wife Michael Strange, which borrowed heavily from a manuscript that Treadwell had written and shared with him years prior. Treadwell brought a lawsuit against Barrymore for stoppage of the play and won, although she was criticized heavily in the media.[1] Treadwell lectured and advocated openly for authors rights and was the first American playwright to win royalty payments for a play production from the Soviet Union.[1] In addition to her accomplishments, Treadwell traveled often with 'Mac' across the United States, Europe, and Northern Africa. Treadwell's husband died in 1933 due to heart complications, while they were on vacation in the state of Georgia.[1] Broadway[edit] Treadwell set herself apart from many female writers of her day, by pursuing commercial productions of her works on Broadway. Seven of Treadwell's plays, listed below, appeared on the Great White Way between 1922 and 1941.[4] Gringo was Treadwell's first play to be produced on Broadway.[2] Most of these plays were only written by Treadwell, but she also produced Lone Valley and O, Nightingale, the later of which she even staged.[4] New York became the setting for the majority of Treadwell's plays.[5] Gringo O Nightingale Machinal Ladies Leave Lone Valley Plumes in the Dust Hope for a Harvest Critics often negatively judged Treadwell's plays as having poorly developed plots, unsympathetic characters, or objectionable themes.[3] Treadwell was also known for having tense relationships with producers because she was reluctant to accept their feedback and edit her work.[1] Later years[edit] In the 1950s and 60's Treadwell turned to writing mostly fiction in the form of short stories and novels, which may be influenced by the lack of success from her Broadway ventures.[1][3] Treadwell lived for a time as an expatriate in Vienna, Austria as well as in Torremolinos in Southern Spain.[3] When Sophie returned to the U.S. she lived in Newton, Connecticut, but also spent time in Mexico and Stockton. In 1949, Treadwell adopted a young German boy, whom she named William. Sophie retired in the mid-60s to Tucson, Arizona where she spent her final years.[1][3] After a brief hospital stay, Treadwell died on February 20, 1970.[1] Plays and novels[edit] Treadwell is credited with writing at least 39 plays,[3] numerous serials and journalistic articles, short stories, and several novels. The subjects of her writings are as diverse as the mediums she was writing in. Many of Treadwell's works are difficult to obtain and the majority of her plays have not previously been produced. Many of Treadwell's plays follow the traditional late nineteenth century well-made play structure, but some share the more modern style and feminist concerns Treadwell is known for, including her often anthologized Machinal.[3] Although Treadwell's plays primarily feature lead female characters, the women presented vary greatly in their behavior, beliefs, and social status.[3] Some of Treadwell's plays contain hints of autobiography from Treadwell's heritage to her extra-marital affair.[3] Below is a chronological chart of her known works. Plays and novels[edit] Title Year Background A Man's Own 1905 one-act written when Treadwell was only 20 years old; this play is set in an office in Chicago, IL and concerns economics and family matters[5] Le Grand Prix 1907 Sophie's first full-length play[2] The Right Man 1908[2] The Settlement 1911 unpublished[2][3] The High Cost 1911[2] begun in 1908 under the title Constance Darrow[3] An Unwritten Chapter 1915 a one-act later renamed Sympathy, it is a stage adaptation of the serial How I Got My Husband and How I Lost Him.[3] Sympathy was the first of Treadwell's plays to be produced, in San Francisco.[2] This 3-character one-act is set in an apartment and the characters are Jean Traig, a performer and Mori, her servant, and a Man; the play has romantic and economic themes.[5] Guess Again 1915–1918 2-character one-act[2] romance set in a New York apartment To Him who Waits 1915–1918 one-act[2][3] His Luck 1915–1918 one-act[2] La Cachucha 1915–1918 one-act[2] set in a NY apartment and the characters are dancer Seniorita Viviana Ybarra y De La Guerra, businessman John S. Watkins, and musician Senor Alvaredos. The subject matter of the play is both domestic and romantic[5] John Doane 1915–1918 a one-act,[2] featuring six characters with an abstract setting and family, romantic, and social subject matter[5] Claws 1916–1918[3] Ms Treadwell wrote, produced, and acted in this play's first production[2] Trance 1918 3-character comedic one-act[2] set in a house London, England. The subject is listed as family and the characters are Madame de Vere, Charlie, and John Randolphe[5] Madame Bluff 1918 Comedy[3] The Answer 1918 3-act, 6-character play set in an apartment in New York City. The subject matter of the play is war and domestic matters and several of the characters in the play represent military personnel[5] The Eye of the Beholder 1919 one-act, previously titled Mrs. Wayne.[2][3] Treadwell copyrighted this drama in 1919, a historical accolade for a female playwright at this time.[2] This 7-character drama is set in a rural house and the play's subject matter revolves around family matters and romance.[5] Produced in 2007 at The American Century Theater in Arlington, VA[3] Rights 1921 based on the life of Mary Wollstonecraft[2] Gringo 1922 Ran on Broadway December 1922-January 1923,[4] this 3-act drama is set in a mine and camp in Mexico and if loaded with subject matter of: violence, interracial romance (white and Hispanic), family, and intellectual matters. Occupations listed for this 20-character play include: journalist, miner, servant, homemaker, criminal, laborer, and musician.[5] Treadwell drew heavily from her recent interview with Pancho Villa for the content of this play.[1] O Nightingale 1925 a comedy, originally titled Loney Lee starred Helen Hayes and ran on Broadway April 1925-May 1925.[1][4] Treadwell also produced the shows transfer to Broadway and played a supporting role onstage under the pseudonym Constance Elliot.[1] Machinal 1928 titled The Life Machine in the London premiere,[3] premiered on Broadway September 1928-November 1928 and was revived on Broadway January 2014-March 2014.[4] The story of Machinal is told over 9 scenes by 29 identifies characters.[5] Six distinct settings appear in the play: office, house, hotel, hospital, bar, courtroom, prison,[5] The main character in the play is the 'young woman,' played in the 2014 Broadway production by Rebecca Hall.[4] None of the characters are named, but identified by their station or occupation. The story is loosely based on the murder trial of Ruth Snyder. This play has also been revived off Broadway and on television and is, by far, Treadwell's best known work.[3] Ladies Leave 1929 a comedy, ran on Broadway in October 1929.[4] A 6 character play in 3-acts that is set in a NYC apartment which deals with the subjects of family, domestic, and social matter, as well as romance. Occupations represented in the play include doctor, servant, publisher, and editor[5] The Island 1930 A comedy set in rural Mexico with subject matter of mostly romantic and socially centered content. A writer, servant, and military personnel are represented among the eight characters in the play[5] Lusita 1931 A novel with a focus on Women in the Mexican Revolution, informed by Treadwell's interview with Pancho Villa almost a decade prior.[1] Lone Valley 1933 written, staged, and produced by Treadwell, ran on Broadway March 1933,[4] after six years of work-shopping and edits by Treadwell[1] Intimations For Saxophone 1934 Produced in 2004 at Arena Stage in Washington, D.C.[3] Plumes in the Dust 1936 ran on Broadway in November 1936[5] starring Henry Hull portraying Edgar Allan Poe[1] Hope for a Harvest 1941 An unpublished novel and a play; the play was later adapted for TV broadcast in 1953.[1] Harvest was Treadwell's last play to premier on Broadway during her lifetime, it ran November–December 1941 at the Guild Theatre featuring Fredric March and Florence Eldridge.[1][4] The genre is noted as drama, and the play is set in a rural house in Treadwell's own San Joaquin Valley California. There are 17 characters in the play and the subjects range from economics and social issues, to family and romance.[5] This play is largely autobiographical, and discusses the loss of the American work ethic and problems of racism during World War II.[1] The attack on Pearl Harbor just ten days after Harvest's opening, is believed to have severely affected American audiences' ability to sympathyzie with the plays message, leading to the play closing shortly thereafter.[1] Highway 1944 A 2-act comedy set in a restaurant in rural Texas. The play features 16 characters of white, Hispanic, and American Indian races with a myriad of occupations with subject matter ranging from economics and family, to health and romance.[5] Highway was produced originally in Pasadena, California and remade for television broadcast in the mid-50s.[1] The Last Border 1944 this play is set in the federal district of Mexico City, and the 13 characters are White or Hispanic. The play's subjects include violence, romance, and social issues[5] Judgement in the Morning 1952 A 3-act play set both in the upper-east side and an upper-west side of New York City, with a multiracial cast who portray a range of socioeconomically divided characters from a lawyer and politician—to a laborer and a criminal[5] Gary 1954 A 2-act drama set in an Upper West Side apartment in New York City including topics of socioeconomic and family matters, romance, and violence . The four character are labeled as Wilma a laborer, Peggy a prostitute, Garry a criminal, and Dave a journalist; the abstract notes that the characters feature both heterosexual and bisexual orientations[5] The world Premiere of this play will be presented at the White Bear Theatre in London from June 4–22, 2019. One Fierce Hour and Sweet 1956 A novel published by Appleton-Century-Crofts[1] Woman with Lilies 1967[2] Treadwell's final play, produced under the title Now He Doesn't Want to Play at the University of Arizona.[1] Journalism[edit] Treadwell's first job as a journalist was with the San Francisco Bulletin, where she was hired in 1908 as a feature writer and theatre critic.[2] She interviewed celebrities, such as Jack London, and covered several high-profile murder trials.[2] Later, when living in New York, Treadwell covered the murder trials of Ruth Snyder and Judd Gray whose stories influenced subsequent plays.[2][3] Treadwell also wrote two popular serial stories for the Bulletin, one based on Treadwell's under cover research about charity available to women in need for which Treadwell disguised herself as a homeless prostitute, the other was a fiction titled How I Got My Husband and How I Lost Him which provided the source material for her later play Sympathy.[1] Treadwell traveled to France to cover the First World War; she was only female foreign correspondent writing from overseas at that time, accredited by the State Department.[1][3] Because Treadwell was not permitted access to the front lines, she volunteered as a nurse and focused her writing on the effect the war was having on the women in Europe. In 1915, Harper's Weekly published her feature Women in Black.[1] When Sophie returned to New York, she was hired by the New York American, later renamed New York Herald Tribune where she wrote as a journalist and served as an expert on Mexican-American relations and Mexico.[1][2] In 1920, Sophie covered the end of the Mexican revolution and wrote a front page piece on the flight of Mexican President Don Venustiano Carranza.[1][2] In 1921, she was the only foreign journalist permitted to interview Pancho Villa.[2] That two-day interview gained Treadwell notoriety in the journalism field as well as provided a basis for Sophie's first Broadway play Gringo and her later novel Lusita.[1] In 1941, Sophie spent ten months in Mexico City as a correspondent for the Tribune. Years later, Treadwell wrote for the Tribune about her visit to post-war Germany.[2][3] Contemporaries and context[edit] Although Treadwell was writing during the height of the Little Theatre Movement in the United States, her desire to produce her works on Broadway for mainstream audiences set her apart from her contemporaries. Treadwell was only peripherally involved in the movement through her work at the Provincetown Players during their early existence.[3] Noteworthy women playwrights writing in the same era as Treadwell are:[3][6] Zoe Akins Djuna Barnes Rachel Crothers Zona Gale Alice Gerstenberg Susan Glaspell Georgia Douglas Johnson Edna St. Vincent Millay Gertrude Stein Through the use of various 'isms' these playwrights explored new and alternative ways of presenting women's lives in their plays.[3] Treadwell remained widely unknown and un-talked about in the world of theatre scholarship until select feminist scholars resuscitated interest in her works following revivals of Machinal in 1990 by the New York Shakespeare Festival and in 1993 by the Royal National Theatre in London.[3] Resources and further reading[edit] The majority of Treadwell's works are stored at the University of Arizona Library Special Collections and the rest at The Billy Rose Theatre Collection at the New York Public Library. The rights to Treadwell's works were passed on in her will to the Roman Catholic Diocese of Tucson: A Corporation Sole.[2][3] One who wishes to obtain the rights to Treadwell's plays can address an enquiry to: Fiscal and Administrative Services, Diocese of Tucson, PO Box 31, Tucson, AZ 85702. Proceeds earned from the production or printing of Treadwell's works are used to benefit Native American children in Arizona. Further biographical information and critical analysis about Treadwell may be found in: "Broadway's Bravest Woman: Selected Writings of Sophie Treadwell". Edited and with introductions by Jerry Dickey and Miriam Lopez-Rodiriguez. Southern Illinois University Press, 2006. "Susan Glaspell and Sophie Treadwell". Barbara Ozieblo and Jerry Dickey. Routledge, 2008. Dickey, Jerry (1999). "The expressionist movement: Sophie Treadwell". In Murphy, Brenda (ed.). The Cambridge Companion to American Women Playwrights. Cambridge University Press. pp. 66–81. ISBN 9780521576802. All of Treadwell's plays are published electronically in "North American Women's Drama" through the academic database publisher Alexander Street Press. Access to this resource is available by purchase directly through ASP's website, or through library access at many academic institutions that have purchased a license to the database. In addition, Machinal is (or was) included in the following anthologies:[3] Twenty-Five Best Plays of the Modern American Theatre by John Glassner- now out of print, originally published in 1949 Plays by American Women: 1900–1930 Judith Barlow's anthology, published in 1981 Norton Anthology of Drama North American women's Drama The Routledge Drama Anthology and Sourcebook Plays and performance texts by women 1880-1930 Manchester University Press References[edit] ^ a b c d e f g h i j k l m n o p q r s t u v w x y z aa ab ac ad ae af ag ah ai aj ak al am "The Sophie Treadwell Collection". The Sophie Treadwell Collection. Special Collections, University of Arizona Library. Retrieved May 1, 2015. ^ a b c d e f g h i j k l m n o p q r s t u v w x y z aa ab ac ad ae af ag ah Dickey, Jerry; Lopez-Rodriguez, Miriam (2006). Broadway's Bravest Woman. Southern Illinois University. ISBN 0-8093-2675-2. ^ a b c d e f g h i j k l m n o p q r s t u v w x y z aa ab ac ad ae af ag ah ai aj ak al am Ozieblo, Barbara; Dickey, Jerry (2008). Susan Glaspell and Sophie Treadwell. Routledge. ISBN 0-415-40485-1. ^ a b c d e f g h i "Sophie Treadwell". Internet Broadway Database. The Broadway League. Retrieved March 25, 2015. ^ a b c d e f g h i j k l m n o p q r s t "North American Women's Drama". Alexander Street Press. Missing or empty |url= (help) ^ Brockett, Oscar G.; Hildy, Franklin J. (2007). History of the Theatre (Foundation ed.). Boston: Allyn and Bacon. p. 406. ISBN 0-205-47360-1. External links[edit] Wikimedia Commons has media related to Sophie Treadwell. The Sophie Treadwell Collection North American Women's Drama, Alexander Street The Literary Encyclopedia Article, Sophie Treadwell Authority control General Integrated Authority File (Germany) ISNI 1 VIAF 1 WorldCat National libraries France (data) United States Israel Korea Other Faceted Application of Subject Terminology Social Networks and Archival Context SUDOC (France) 1 Retrieved from "https://en.wikipedia.org/w/index.php?title=Sophie_Treadwell&oldid=1037089348" Categories: Expressionist dramatists and playwrights Modernist theatre 1885 births 1970 deaths Writers from Stockton, California American women dramatists and playwrights 20th-century American actresses American people of Mexican descent American people of Spanish descent American people of Scottish descent American women journalists 20th-century American dramatists and playwrights 20th-century American women writers Journalists from California People from Newtown, Connecticut 20th-century American non-fiction writers Hidden categories: CS1 errors: requires URL Articles with short description Short description is different from Wikidata Articles lacking page references from October 2020 Use mdy dates from October 2019 Commons category link is on Wikidata Wikipedia articles with GND identifiers Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BNF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with NLI identifiers Wikipedia articles with NLK identifiers Wikipedia articles with FAST identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Afrikaans עברית مصرى Русский Edit links This page was last edited on 4 August 2021, at 13:03 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-5736 ---- Low-code development platform - Wikipedia Low-code development platform From Wikipedia, the free encyclopedia Jump to navigation Jump to search A low-code development platform (LCDP) provides a development environment used to create application software through a graphical user interface instead of traditional hand-coded computer programming. A low-coded platform may produce entirely operational applications, or require additional coding for specific situations. Low-code development platforms reduce the amount of traditional hand coding, enabling accelerated delivery of business applications. A common benefit is that a wider range of people can contribute to the application's development—not only those with coding skills. LCDPs can also lower the initial cost of setup, training, deployment and maintenance.[1] Low-code development platforms trace their roots back to fourth-generation programming language and the rapid application development tools of the 1990s and early 2000s. Similar to these predecessor development environments, LCDPs are based on the principles of model-driven design, automatic code generation, and visual programming.[2] The concept of end-user development also existed previously, although LCDPs brought some new ways of approaching this development. The low-code development platform market traces its origins back to 2011.[3] The specific name "low-code" was not put forward until 9 June, 2014,[1] when it was used by the industry analyst Forrester Research. Along with no-code development platforms, low-code was described as "extraordinarily disruptive" in Forbes magazine in 2017.[4] Contents 1 Use 2 Reception 3 Security and compliance concerns 4 Analyst coverage and crowd evaluation 5 Criticisms 6 Low-code vs. no-code 7 See also 8 References 9 External links Use[edit] As a result of the micro computer revolution businesses have deployed computers widely across their employee bases, enabling widespread automation of business processes using software. The need for software automation and new applications for business processes places demands on software developers to create custom applications in volume, tailoring them to organizations' unique needs.[5] Low-code development platforms have been and are developed as a means to allow for quick creation and use of working applications that can address the specific process- and data needs of the organization.[6] Reception[edit] Research firm Forrester estimated in 2016 that the total market for low-code development platforms would grow to $15.5 billion by 2020.[7] Segments in the market include database, request handling, mobile, process and general purpose low-code platforms.[8] Low-code development's market growth can be attributed to its flexibility and ease.[9] Low-code development platforms are shifting focus towards general purpose of applications, with the ability to add in custom code when needed or desired.[3] Mobile accessibility is one of the driving factors of using low-code development platforms.[5] Instead of developers having to spend time creating multi-device software, Low-code packages typically come with that feature standard.[5] Because they require less coding knowledge, nearly anyone in a software development environment can learn to use a low-code development platform. Features like drag and drop interfaces help users visualize and build the application[7] Security and compliance concerns[edit] Concerns over low-code development platform security and compliance are growing, especially for apps that use consumer data. There can be concerns over the security of apps built so quickly and possible lack of due governance leading to compliance issues.[9] However, low-code apps do also fuel security innovations. With continuous app development in mind, it becomes easier to create secure data workflows. Still the fact remains that low-code development platforms that do not apply and strictly adhere to Normalized Systems Theory[10] do not solve the challenge of increasing complexity due to changes.[9] Analyst coverage and crowd evaluation[edit] A Forrester report about low-code development platforms ("The Forrester Wave™: Low-code Development Platforms, Q2 2016") featured a 26-criteria evaluation of low-code development platform providers.[11] An updated Forrester report charting the growth of the low-code market was published in July 2017 (Vendor Landscape: A Fork In The Road For Low-Code Development Platforms) highlighting 3 industry trends:[12] Growth - the low-code market is forecast to increase to over $21 billion over the next five years. Diversification - Two major developing market segments focus on the needs of business ("citizen") developers and of AD&D (App Dev) Professionals. Integration - As adoption of low-code expands and businesses look towards technologies like AI, robotics and machine learning, solutions must grow to offer these capabilities. A G2Crowd report about low-code development platforms evaluated market share and user reviews for 46 products.[13] Forrester published an updated report in August 2018. The report covers key trends including the continuing adoption of low code platforms by enterprise companies and the merging of low code platforms with existing developer tools into a broader application development ecosystem.[14] Criticisms[edit] Some IT professionals question whether low-code development platforms are suitable for large-scale and mission-critical enterprise applications.[15] Others have questioned whether these platforms actually make development cheaper or easier.[16] Additionally, some CIOs have expressed concern that adopting low-code development platforms internally could lead to an increase in unsupported applications built by shadow IT.[17] Low-code vs. no-code[edit] Main article: No-code development platform No-code development platforms are similar to low-code development platforms but require no coding at all.[18] The line between the two is not sharp. However, there are a number of key differences: App Creator - No-code platforms are accessible to any end-business user while low-code platforms require professional developers who can work within the platform's constraints. Core Design - No-code platforms tend to function off a model-driven, declarative approach where the end user dictates an app's design through drag and drop manipulation or simple expressions. Low-code platforms depend more on hand coding to specify an application's core architecture.[4] User Interface - No-code platforms most often rely on a preset user interface layer which simplifies and streamlines an app's design. Low-code platforms may provide greater flexibility in UI options at the cost of additional coding and complexity requirements.[19] See also[edit] DRAKON End-user computing End-user development Flow-based programming List of online database creator apps List of low-code development platforms Visual programming language References[edit] ^ a b Richardson, Clay (June 9, 2014). "New Development Platforms Emerge For Customer-Facing Applications". www.forrester.com. Retrieved 18 November 2016. ^ Lonergan, Kevin (29 July 2015). "On the down low: Why CIOs should care about Low-code - Information Age". Information Age. Information Age. Archived from the original on 2 February 2017. Retrieved 22 January 2017. ^ a b Marvin, Rob (12 August 2014). "How low-code development seeks to accelerate software delivery - SD Times". SD Times. San Diego Times. Retrieved 18 November 2016. ^ a b Bloomberg, Jason. "The Low-Code/No-Code Movement: More Disruptive Than You Realize". www.forbes.com. Retrieved 20 August 2018. ^ a b c Marvin, Rob. "Building an App With No Coding: Myth or Reality?". PCMAG. PC Mag. Retrieved 18 November 2016. ^ http://www.zdnet.com/article/developers-were-on-board-with-low-code-tools/ ^ a b Richardson, Clay. "Vendor Landscape: The Fractured, Fertile Terrain Of Low-code Application Platforms" (PDF). Forrester Research. Archived from the original (PDF) on 2017-08-09. Retrieved 2017-01-25. ^ Hammond, Jeffrey. "The Forrester Wave™: Mobile Low-Code Platforms For Business Developers, Q3 2018". www.forrester.com. Forrester Research. Archived from the original on 15 August 2018. Retrieved 8 August 2018. ^ a b c Rubens, Paul. "Use Low-code Platforms to Develop the Apps Customers Want". CIO. CIO Magazine. ^ Mannaert, Herwig; Verelst, Jan; De Bruyn, Peter (2016). Normalized Systems Theory: From Foundations for Evolvable Software Toward a General Theory for Evolvable Design. ISBN 9789077160091. ^ Richardson, Clay. "The Forrester Wave™: Low-code Development Platforms, Q2 2016". www.forrester.com. Forrester Research. Archived from the original on 13 November 2019. Retrieved 18 November 2016. ^ Rymer, John (31 July 2017). "Vendor Landscape: A Fork In The Road For Low-Code Development Platforms". Forrester Research. Archived from the original on 16 February 2018. Retrieved 19 September 2017. ^ "Archived copy". Archived from the original on 2019-03-30. Retrieved 2017-03-03.CS1 maint: archived copy as title (link) ^ Hammond, Jeffrey. "The Forrester Wave™: Mobile Low-Code Platforms For Business Developers, Q3 2018". www.forrester.com. Forrester Research. Archived from the original on 15 August 2018. Retrieved 8 August 2018. ^ Rymer, John. "Low-Code Platforms Deliver Customer Facing Apps Fast, But Can They Scale Up?". Forrester Research. Archived from the original on 2 February 2017. Retrieved 22 January 2016. ^ Reselman, Bob. "Why the promise of low-code software platforms is deceiving". TechTarget. Archived from the original on 1 May 2019. Retrieved 1 May 2019. ^ Shore, Joel (31 July 2015). "How no-code development tools can benefit IT". Search Cloud Applications. TechTarget Magazine. Archived from the original on 31 March 2017. Retrieved 22 January 2017. ^ Rouse, Margaret. "low-code/no-code development platform (LCNC platform)". www.techtarget.com. Retrieved 20 August 2018. ^ Woods, Dan. "When No Code Makes Sense for Legacy App Migration". www.forbes.com. Retrieved 20 August 2018. External links[edit] Pattani, Aneri (16 November 2016) "A coding revolution in the office cube sends message of change to IT". CNBC. Retrieved 15 November 2017. Retrieved from "https://en.wikipedia.org/w/index.php?title=Low-code_development_platform&oldid=1038101108" Categories: Enterprise architecture Software development Hidden categories: CS1 maint: archived copy as title Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Deutsch فارسی Italiano עברית Nederlands 日本語 Polski 中文 Edit links This page was last edited on 10 August 2021, at 14:38 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6107 ---- Roach Motel - Wikipedia Roach Motel From Wikipedia, the free encyclopedia Jump to navigation Jump to search For other uses, see Roach motel. Roach Motel Product type Insect trap Owner Black Flag Country United States Introduced 1976; 45 years ago (1976) Registered as a trademark in United States Tagline Roaches check in, but they don't check out! Roach Motel is a brand of a roach bait device designed to catch cockroaches. Although the term is the subject of a trademark registration by the insect control brand Black Flag, the phrase roach motel has come to be used as a reference to all traps that use a scent or other form of bait to lure cockroaches into a compartment in which a sticky substance causes them to become trapped. Introduced in late 1976 in response to the success of d-CON's roach trap, the Roach Motel quickly became a successful entrant in the industry. By 1979, New York magazine reported, "On the strength of its whimsical packaging and an aggressive ad campaign, the Roach Motel now dominates the market, outselling the closest competition by as much as three to one in some cities."[1] Early versions of the Roach Motels used food-based bait, but later designs incorporated pheromones. The widely known tagline of the Roach Motel was, "Roaches check in, but they don't check out!" This phrase has also been applied to information technology systems such as enterprise resource planning, which readily capture transactions data but make it difficult for organizations to access, report and analyze the data stored in the system.[2] Black Flag also marketed a related insect trap, the "Flyport," designed to deal with unwanted flying insects like houseflies, with the tagline, "Lots of arrivals, but no departures!" It was less successful than the Roach Motel. "Roach Motel" is United States federal trademark No. 1,059,314, for which Black Flag claims a date of earliest use of May 7, 1976.[3][4] References[edit] ^ Scot Haller, "Checkout Time at the Roach Motel," New York (Jul 9-16, 1979), v. 12, no. 28, p. 71. ^ Vizard, Michael (24 August 1998). "Are ERP Apps Really Worth All the Trouble?". IDG. Retrieved 22 November 2016. ^ "Am. Home Products v. Johnson Chemical Co., 589 F. 2d 103, 104 (2nd Cir., 1978)". Google Scholar. Retrieved 2015-04-19. ^ U.S. Trademark 73,087,941 External links[edit] Look up roach motel in Wiktionary, the free dictionary. Information at Black Flag website This product article is a stub. You can help Wikipedia by expanding it. v t e Retrieved from "https://en.wikipedia.org/w/index.php?title=Roach_Motel&oldid=1038194481" Categories: Insecticide brands Products introduced in 1976 Trademarks American brands Brand name products stubs Hidden categories: All stub articles Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages 日本語 粵語 中文 Edit links This page was last edited on 11 August 2021, at 02:34 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6159 ---- Oh, How I Miss You Tonight - Wikipedia Oh, How I Miss You Tonight From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 single by Jeanne Black "Oh, How I Miss You Tonight" Single by Jeanne Black B-side "A Little Bit Lonely" Released December 1960 Genre Pop Length 2:56 Label Capitol Songwriter(s) Benny Davis, Joe Burke, Mark Fisher Jeanne Black singles chronology "You'll Find Out" (1960) "Oh, How I Miss You Tonight" (1960) "Don't Speak to Me" (1961) "Oh, How I Miss You Tonight" is a popular song, published in 1925, written by Benny Davis, Joe Burke, and Mark Fisher. Popular recordings of the song in 1925 were by Ben Selvin, Benson Orchestra of Chicago, Lewis James and Irving Kaufman.[1] Other notable recordings[edit] 1941 Bing Crosby - recorded July 5, 1941 for Decca Records with John Scott Trotter and His Orchestra.[2] 1947 Perry Como - recorded on November 20, 1947 for RCA Victor with Russ Case and His Orchestra.[3] 1960 Jeanne Black released a version of the song as a single which reached #63 on the U.S. pop chart.[4] 1961 Jim Reeves[5] 1961 Glenda Collins - Decca F11321 1962 Frank Sinatra - included in his album All Alone. 1962 Nat King Cole - for his album Dear Lonely Hearts. 1963 Frank Fontaine ABC-Paramount 45 RPM Single 1964 Burl Ives - for the album My Gal Sal[6] 1967 Doris Day - included in her album The Love Album. References[edit] ^ Whitburn, Joel (1986). Joel Whitburn's Pop Memories 1890-1954. Wisconsin, USA: Record Research Inc. p. 560. ISBN 0-89820-083-0. ^ "A Bing Crosby Discography". BING magazine. International Club Crosby. Retrieved August 20, 2017. ^ "Perry Como Discography". kokomo.ca/. Retrieved August 20, 2017. ^ "Jeanne Black, "Oh, How I Miss You Tonight" Chart Position". Retrieved November 25, 2016. ^ "45cat.com". 45cat.com. Retrieved August 20, 2017. ^ "Discogs.com". Discogs.com. Retrieved August 20, 2017. v t e Deborah Allen Studio albums Trouble in Paradise Cheat the Night Let Me Be the First Delta Dreamland Notable singles "Let's Stop Talkin' About It" "Baby I Lied" "I've Been Wrong Before" "I Hurt for You" Related articles Discography "Can I See You Tonight" "Don't Worry 'bout Me Baby" "I'm Only in It for the Love" "Hurt Me Bad (In a Real Good Way)" Authority control MusicBrainz work Retrieved from "https://en.wikipedia.org/w/index.php?title=Oh,_How_I_Miss_You_Tonight&oldid=1031163862" Categories: 1925 songs 1960 singles Songs with music by Joe Burke (composer) Songs written by Benny Davis Songs written by Mark Fisher (songwriter) Jeanne Black songs Jim Reeves songs Deborah Allen songs Capitol Records singles Hidden categories: Articles with short description Short description is different from Wikidata Articles with hAudio microformats Wikipedia articles with MusicBrainz work identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Nederlands Edit links This page was last edited on 30 June 2021, at 04:08 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6260 ---- Go West (1925 film) - Wikipedia Go West (1925 film) From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 film by Buster Keaton Go West Directed by Buster Keaton Written by Buster Keaton Lex Neal Produced by Buster Keaton Joseph M. Schenck Starring Buster Keaton Kathleen Myers Howard Truesdale Ray Thompson Cinematography Bert Haines Elgin Lessley Music by Konrad Elfers Distributed by Metro-Goldwyn-Mayer Release date November 1, 1925 (1925-11-01) Running time 69 minutes Country United States Language Silent (English intertitles) Go West is an American silent comedy film directed by and starring Buster Keaton.[1][2][3] Keaton portrays Friendless, who travels west to try to make his fortune. Once there, he tries his hand at bronco-busting, cattle wrangling and dairy farming, eventually forming a bond with a cow named "Brown Eyes." Eventually he finds himself leading a herd of cattle through Los Angeles. Seventy years after the release of the film guitarist Bill Frisell recorded a soundtrack accompaniment Go West: Music for the Films of Buster Keaton (1995). The Rats & People Motion Picture Orchestra premiered its new score for the film in 2007. Contents 1 Plot 2 Cast 3 References 4 External links Plot[edit] A drifter identified only as "Friendless" (Keaton) sells the last of his possessions, keeping only a few trinkets and a picture of his mother. The money buys him only some bread and a sausage then is gone. Unable to find a job in the city, he stows away on a train. He thinks it is going to New York but it is heading west. He sleeps in a barrel but the barrel rolls of the train. He manages to get a job at a cattle ranch despite having no experience. Meanwhile, a neglected cow named Brown Eyes fails to give milk and is sent out to the field along with the other cattle intended for slaughter. As Friendless tries to figure out how to milk a cow, he's told to go out and help the other ranch hands bring in the cattle. Unsuccessful in riding a horse, he falls off and sees Brown Eyes. Noticing her limp, Friendless examines her hoof and removes the rock that had been hurting her. Brown Eyes proceeds to follow Friendless around, saving him from a bull attack. Realizing that he's finally found a companion, Friendless strikes up a friendship with the cow, giving her his blanket at night and attempting to protect her from wild dogs. The next day, Brown Eyes follows Friendless everywhere, much to the chagrin of the other ranch hands. Friendless accidentally sets two steers loose after they'd been corralled in, but on the joking suggestion of the other hands, brings them back in by waving his red bandanna. The ranch owner (Truesdale) and his daughter (Myers) are preparing to sell the cattle to a stockyard, though another rancher wants to hold out for a higher price. The owner, no longer wanting to wait, prepares to ship the whole herd out. Friendless, shocked to hear that Brown Eyes will go to a slaughterhouse, refuses to let her go. The ranch owner fires him and gives him his wages. Friendless tries to buy his friend back with his earnings, but is told that it's not enough. After failing to get more money from a card game, he joins Brown Eyes in the cattle car and tries to find a way to free her. The train is ambushed by the other rancher and his men. Friendless and the ranch owner's other hands manage to drive off the attackers, but only Friendless makes it back to the train as the others chase away the rancher. Arriving in Los Angeles, Friendless frees Brown Eyes and leads her away, using his red bandana once more to guide the other thousand steers to the stockyard. The townspeople are terrified of the cattle as some of the cows break away and begin entering the stores, but Friendless manages to corral them together. Friendless ties Brown Eyes up before going back to retrieve the other cattle, leaving his red bandana with her in order to keep her cool. Realizing his mistake, he enters a masquerade store to find something red to attract the cows. Deciding on a red devil's outfit, he exits the store and the cattle begin to chase him. The police attempt to arrest him, but are mistakenly sprayed with hoses from the fire department, who flee once they see the cattle coming. The ranch owner, realizing his ruin if the cattle are not sold, drives with his daughter to the stockyard. The owner tells him that no cattle have arrived yet. Defeated, the ranch owner prepares to leave when he sees Friendless leading the herd into the stockyard. Overjoyed, the ranch owner tells Friendless that his house and anything he owns is his to ask for. Friendless says that he only wants "her," gesturing behind him to where the ranch owner's daughter is. The owner is surprised and the daughter flattered, but they quickly realize that it's Brown Eyes that he's referring to. The three drive back to the ranch, with Brown Eyes beside Friendless in the back seat. Cast[edit] Buster Keaton as Friendless Howard Truesdale as Ranch owner Kathleen Myers as Ranch owner's daughter Ray Thompson as Ranch foreman Brown Eyes as The Cow 'Brown Eyes' Roscoe 'Fatty' Arbuckle as Woman in department store (uncredited) Joe Keaton as Man in Barber Shop (uncredited) Gus Leonard as General store owner (uncredited) Babe London as Woman in department store (uncredited) References[edit] ^ "GO WEST! BUSTER KEATON IN GOOD FORM". The Register (Adelaide). XCI (26, 627). South Australia. December 20, 1926. p. 10. Retrieved January 6, 2019 – via National Library of Australia. ^ Keaton, Buster, 1895-1966; Shephard, David; Kino International Corporation (2001), The Art of Buster Keaton, Kino International Corp, retrieved January 6, 2019CS1 maint: multiple names: authors list (link) ^ Prod Co: Metro Goldwyn Productions; Keaton, Buster, 1895-1966. (Actor); Schenck, Joseph M., 1877-1961. (Producer); Lessley, Elgin. (Photographer); Haines, Bert. (Photographer); Cannon, Raymond. (Writer of accompanying material); Neal, Lex. (Director); Metro Goldwyn Productions (1925), Go west, A Metro Goldwyn production, retrieved January 6, 2019CS1 maint: multiple names: authors list (link) External links[edit] Wikimedia Commons has media related to Go West (1925 film). "Go West" Full Movie at archive.org Go West at IMDb Go West at AllMovie Go West at the International Buster Keaton Society v t e Films directed by Buster Keaton Shorts (1917–1923) The Rough House One Week Convict 13 The Scarecrow Neighbors The Haunted House Hard Luck The High Sign The Goat The Playhouse The Boat The Paleface Cops My Wife's Relations The Blacksmith The Frozen North The Electric House Day Dreams The Balloonatic The Love Nest Feature films Three Ages Our Hospitality Sherlock Jr. The Navigator Seven Chances Go West Battling Butler The General College Steamboat Bill, Jr. The Cameraman Spite Marriage Shorts (1934–1937) (for Educational Pictures) The Gold Ghost Allez Oop Tars and Stripes Grand Slam Opera Blue Blazes Mixed Magic Love Nest on Wheels Authority control General Integrated Authority File (Germany) VIAF 1 WorldCat (via VIAF) National libraries United States Retrieved from "https://en.wikipedia.org/w/index.php?title=Go_West_(1925_film)&oldid=1036151460" Categories: 1925 films 1920s Western (genre) comedy films American films American silent feature films American Western (genre) comedy films American black-and-white films Metro-Goldwyn-Mayer films Films directed by Buster Keaton Films produced by Joseph M. Schenck Films with screenplays by Buster Keaton 1925 comedy films Films set in Los Angeles Hidden categories: CS1 maint: multiple names: authors list Use mdy dates from September 2020 Articles with short description Short description matches Wikidata Template film date with 1 release date Commons category link is on Wikidata Wikipedia articles with GND identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with WorldCat-VIAF identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية Deutsch فارسی Français Italiano Русский Svenska Українська Edit links This page was last edited on 29 July 2021, at 20:19 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6297 ---- Yes Sir, That's My Baby (song) - Wikipedia Yes Sir, That's My Baby (song) From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 song by Walter Donaldson (music) and Gus Kahn (lyrics) "Yes Sir, That's My Baby" Song Written 1925 Composer(s) Walter Donaldson Lyricist(s) Gus Kahn "Yes Sir, That's My Baby" is a popular U.S. song from 1925. The music was written by Walter Donaldson and the lyrics by Gus Kahn. It is now in the public domain. Contents 1 Background 2 1925 recordings 3 Later recordings 4 International re-recordings 5 Film appearances 6 References Background[edit] Opening line of the chorus: "Yes sir, that's my ba - by, no sir, don't mean may - be, Yes sir, that's my ba - by now...." According to one source, the song was written when Donaldson and Kahn were visiting Eddie Cantor. Cantor's daughter Marjorie brought out one of her favorite toys, a walking mechanical pig. She wound it up and it started walking in rhythm while two notes kept coming from the little creature. Kahn was inspired and started working lyrics to these notes in rhythm with the pig, coming up with the title and opening line of the chorus in short order.[1] 1925 recordings[edit] It was introduced by Margaret Young and other successful recordings in 1925 were by: Ace Brigode Gene Austin Blossom Seeley Ben Bernie Coon-Sanders Original Nighthawk Orchestra (vocal by Carleton Coon).[2] Lee Morse Later recordings[edit] The song has become a standard that has been recorded by over 100 artists in genres from jazz to rock, marimba and country. Among the later recordings: Eddie Cantor recorded the song in 1930. Harry Stewart's mock-Japanese novelty cover of the song earned a notorious reputation as one of the worst records ever made upon its release in 1953.[3] Although, some define the recording as a stylized Japanese parody. Bing Crosby recorded the song in 1956[4] for use on his radio show and it was subsequently included in the box set The Bing Crosby CBS Radio Recordings (1954-56) issued by Mosaic Records (catalog MD7-245) in 2009.[5] Also in 1956, The Sensations reached #15 on the Best Sellers in Stores chart.[6] It was later a hit for Ricky Nelson in 1960. This recording reached #34 on the Hot 100.[7] The Four Aces recorded the song in 1957. It's the opening track on Etta Jones' Don't Go to Strangers (1960). Frank Sinatra recorded it in 1966 for his Strangers in the Night LP. James Booker covered the song on his album Classified: Remixed & Expanded.[8] International re-recordings[edit] A Yiddish version entitled "Yes Sir, Iz May Kalleh" (Yes Sir, That's My Bride) was recorded by Peisachke Burstein. In German, the song was titled "Küss' mich, Schnucki-Putzi". The song was also sung by Jason Robards and Barry Gordon in the 1965 feature film A Thousand Clowns.[9] Bram Morrison and young singer Debbie Fruitman sing together on Sharon, Lois & Bram's album One Elephant, Deux Éléphants.[10] The song was sung in Italian by Duo Fasano (Fasano sisters duo)[11] and the famous Italian singer Raffaella Carrà in 1973. The song was titled "Lola" and talks about a girl (Lola) that the singer is convincing to dance the Charleston.[12] It was also remade by a Czech group Verona in 2011 with completely new lyrics and named "Hey Boy", becoming a holiday hit on local radio stations. Czech and Slovak listeners know the song from the traffic-information program "Pozor, zákruta" (Watch out, turning), which has been broadcast since 1966 by Czechoslovak Radio, which took the instrumental version of that song as its signature.[13] With older Czech lyrics titled "Že se nestydíte" by Jan Werich this song was performed by the Karel Vlach orchestra in the Rokoko theatre (Prague, 1963).[14] The Swedish band Onkel Kånkel recorded a version of the song called "Spetälske Leffe" (Leprous Leffe) for their 1990 album Kalle Anka Suger Pung. The song's title is the name of a spaceship in the John Scalzi book The Collapsing Empire, often referred to as "the Yes, Sir". Film appearances[edit] 1942 Broadway 1944 Once Upon a Time – played often throughout the film 1949 Yes Sir, That's My Baby – sung during the montage with the kids. 1951 I'll See You in My Dreams 1953 The Eddie Cantor Story – sung by Eddie in the Midnight Frolics 1965 A Thousand Clowns – sung and played on ukuleles by Jason Robards and Barry Gordon. 1974 The Great Gatsby 1975 Smile – sung by Michael Chain 1979 Agatha 1986 Heartburn – performed by Meryl Streep and Jack Nicholson. 1998 Dancing at Lughnasa References[edit] ^ Yes Sir, That's My Baby by Eddie Cantor Songfacts ^ Whitburn, Joel (1986). Joel Whitburn's Pop Memories 1890-1954. Wisconsin, USA: Record Research Inc. p. 615. ISBN 0-89820-083-0. ^ Ewald, William (1953-06-08). "Song Writers Guarantee New Record Worst". Oxnard Press-Courier. United Press. p. 9. Retrieved 11 February 2011. ^ "A Bing Crosby Discography". BING magazine. International Club Crosby. Retrieved December 10, 2017. ^ "allmusic.com". allmusic.com. Retrieved December 10, 2017. ^ Whitburn, Joel (2004). Top R&B/Hip-Hop Singles: 1942-2004. Record Research. p. 516. ^ Whitburn, Joel (2013). Joel Whitburn's Top Pop Singles, 14th Edition: 1955-2012. Record Research. p. 605. ^ James Booker: Classified Remixed & Expanded, Rounder, 2013-10-15, retrieved 2018-09-17 ^ That's My Baby - YouTube[dead link]. ^ Yes Sir, You're My Baby by Sharon, Lois, and Bram on YouTube. ^ Lola, Duo Fasano on YouTube. ^ Lola, Italian version lyric. ^ Tenkrát v rozhlase - 1966 ^ Darek Vostřel & Jiří Šašek - Že se nestydíte [1963 Vinyl Records 45rpm] on YouTube. Authority control MusicBrainz work Retrieved from "https://en.wikipedia.org/w/index.php?title=Yes_Sir,_That%27s_My_Baby_(song)&oldid=1038680738" Categories: Songs with music by Walter Donaldson Songs with lyrics by Gus Kahn Pop standards 1925 songs Ricky Nelson songs Eddie Cantor songs Jazz compositions in G major Hidden categories: All articles with dead external links Articles with dead external links from January 2019 Articles with short description Short description is different from Wikidata Articles containing Slovak-language text Articles containing Czech-language text Articles containing Swedish-language text Wikipedia articles with MusicBrainz work identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Deutsch Français Nederlands Norsk bokmål Русский Edit links This page was last edited on 14 August 2021, at 01:51 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6360 ---- Jean Leon Gerome Ferris - Wikipedia Jean Leon Gerome Ferris From Wikipedia, the free encyclopedia Jump to navigation Jump to search American painter Jean Leon Gerome Ferris The First Thanksgiving 1621 Born (1863-08-08)August 8, 1863 Philadelphia, Pennsylvania Died March 18, 1930(1930-03-18) (aged 66) Philadelphia, Pennsylvania Nationality American Education Pennsylvania Academy of the Fine Arts Known for Painting Writing the Declaration of Independence, 1776, Ferris's idealized 1900 depiction of (left to right) Benjamin Franklin, John Adams, and Thomas Jefferson of the Committee of Five working on the Declaration, was widely reprinted. The Landing of William Penn Jean Leon Gerome Ferris (August 8, 1863 – March 18, 1930[1]) was an American painter best known for his series of 78 scenes from American history, entitled The Pageant of a Nation, the largest series of American historical paintings by a single artist.[2] Life and career[edit] Ferris was born in Philadelphia, Pennsylvania, the son of Stephen James Ferris, a portrait painter who was a devotee of Jean-Léon Gérôme (after whom he was named) and also an admirer of Mariano Fortuny.[3] He grew up around art; he was trained by his father[2] and his uncles Edward Moran and Thomas Moran were both acclaimed painters.[4] Ferris enrolled in the Pennsylvania Academy of the Fine Arts in 1879 and trained further at the Académie Julian beginning in 1883 under William-Adolphe Bouguereau.[2] He also met his namesake Jean-Léon Gérôme, who greatly influenced his decision to paint scenes from American history. Ferris wrote, "[Gérôme's] axiom was that one would paint best that with which he is most familiar".[4] His early subjects were Orientalist in nature since that movement was in vogue when he was young. In 1882, he exhibited a painting entitled Feeding the Ibis which was valued at $600.[5] By 1895, he had gained a reputation as a historical painter, and he embarked on his dream of creating a series of paintings that told a historical narrative. In 1898, he sold General Howe's Levee, 1777, but he later realized that such a series could not be complete if the separate paintings could not be kept together. Consequently, he never sold another, but he did sell the reproduction rights to various publishing companies. This had the effect of greatly popularizing his work, as these companies made prints, postcards, calendars, and blank-backed trade cards to use in advertisements. Laminated cards of these works were still being sold as late as 1984.[2] Ferris married Annette Amelia Ryder in 1894, and the couple had a daughter named Elizabeth Mary.[6] He died in Philadelphia in 1930. The paintings showed idealized portrayals of famous moments from American history. The complete series was shown at Independence Hall in Philadelphia from 1913 to 1930, then moved next door to Congress Hall. In later years, it was shown in a number of locations, including the Smithsonian Institution, before being returned to the Ferris family.[5] His works were widely popular for many years, but modern critics are far less generous in their praise. The American Philosophical Society claims that his historical paintings confuse "verity with verisimilitude",[7] and art historian Gerald Ackerman describes them as "splendid in the accuracy of accessories, clothing and especially in the details of land conveyances and ships", but "extremely dry in execution and rather monotonous in composition."[5] References[edit] ^ Sponsel, Rudolf. "J.L.G. Ferris (1863–1930)" (in German). Allgemeine und Integrative Psychotherapie. Retrieved 2010-08-01. ^ a b c d Nuhn, Roy (April 2007). "J. L. G. Ferris". The Antique Shoppe Newspaper. Retrieved 2010-08-01. ^ "The Ferris Collection". Building a National Collection. Smithsonian Institution. Retrieved 2010-08-01. ^ a b Mitnick, Barbara J. (1993). "Paintings for the People". In Ayres, William (ed.). Picturing History: American Painting 1770–1930. Rizzoli International Publications. pp. 167–8. ISBN 0-8478-1745-8. ^ a b c Ackerman, Gerald M. (1994). American Orientalists. ACR Edition. pp. 82–3. ISBN 2-86770-078-7. ^ The National cyclopaedia of American biography, Volume 13. J. T. White Co. 1906. p. 403. ^ Fanelli, Doris Devine; Diethorn, Karie (2001). History of the portrait collection, Independence National Historical Park. American Philosophical Society. p. 55. ISBN 0-87169-242-2. External links[edit] Media related to Jean Leon Gerome Ferris at Wikimedia Commons Authority control General ISNI 1 VIAF 1 WorldCat National libraries United States Art research institutes Artist Names (Getty) Other Faceted Application of Subject Terminology Social Networks and Archival Context Retrieved from "https://en.wikipedia.org/w/index.php?title=Jean_Leon_Gerome_Ferris&oldid=1034314129" Categories: 1863 births 1930 deaths 19th-century American painters 20th-century American painters Alumni of the Académie Julian American male painters Artists from Philadelphia Orientalist painters Pennsylvania Academy of the Fine Arts alumni Hidden categories: CS1 German-language sources (de) Articles with short description Short description is different from Wikidata Articles with hCards Commons category link from Wikidata Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with ULAN identifiers Wikipedia articles with FAST identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Azərbaycanca Esperanto فارسی Français Nederlands Português Русский Simple English Svenska Edit links This page was last edited on 19 July 2021, at 04:54 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6367 ---- Washboard Blues - Wikipedia Washboard Blues From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1926 single by Paul Whiteman and his Concert Orchestra "Washboard Blues" 1927 recording by Paul Whiteman and His Concert Orchestra. Single by Paul Whiteman and his Concert Orchestra A-side "Among My Souvenirs" Written 1926 Released 1927 (1927) Recorded November 18, 1927 Genre Blues Label Victor Songwriter(s) Hoagy Carmichael Fred B. Callahan Irving Mills "Washboard Blues" is a 1926 popular song written by Hoagy Carmichael, Fred B. Callahan and Irving Mills. On November 18, 1927, it was recorded in Chicago by Paul Whiteman and his Concert Orchestra, featuring piano and lead vocals by Carmichael, and was released as Victor 35877-B (the B-side of "Among My Souvenirs")[1] The song is an evocative washerwoman's lament. Though the verse, chorus, and bridge pattern is present, the effect of the song is of one long, cohesive melodic line with a dramatic shifting of tempo. The cohesiveness of the long melody perfectly matches the lyrical description of the crushing fatigue resulting from the repetitious work of washing clothes under primitive conditions.[2] Credits[edit] A copy of the lyrics from the Indiana University archives of the Hoagy Carmichael collection credits F. B. Callahan with the words to "Washboard Blues".[3] References[edit] ^ Greenwald, Matthew. "Washboard Blues". AllMusic. Retrieved 7 March 2010. ^ Wilder, Alec (1990). American Popular Song: The Great Innovators 1900-1950. New York & Oxford: Oxford University Press. p. 374. ISBN 0-19-501445-6. ^ "Hoagy Carmichael Collection". Webapp1.dlib.indiana.edu. Retrieved 2009-09-30. External links[edit] "Washboard Blues", Paul Whiteman (1927)—Internet Archive. "Paul Whiteman and His Concert Orchestra* - Among My Souvenirs / Washboard Blues (Shellac)". Discogs.com. Retrieved 2016-07-26. Authority control MusicBrainz work Retrieved from "https://en.wikipedia.org/w/index.php?title=Washboard_Blues&oldid=1004012583" Categories: Songs with music by Hoagy Carmichael Blues songs 1926 songs Songs with lyrics by Irving Mills Hidden categories: Articles with short description Short description is different from Wikidata Wikipedia articles with MusicBrainz work identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Suomi Edit links This page was last edited on 31 January 2021, at 18:40 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6447 ---- MIT License - Wikipedia MIT License From Wikipedia, the free encyclopedia Jump to navigation Jump to search Permissive free software license MIT License Publisher Massachusetts Institute of Technology SPDX identifier MIT (see list for more)[1] Debian FSG compatible Yes[2] FSF approved Yes[3][4] OSI approved Yes[5] GPL compatible Yes[3][4] Copyleft No[3][4] Linking from code with a different licence Yes The MIT License is a permissive free software license originating at the Massachusetts Institute of Technology (MIT)[7] in the late 1980s.[8] As a permissive license, it puts only very limited restriction on reuse and has, therefore, high license compatibility.[9][10] The Wikipedia and Wikimedia Commons projects use the alternative name Expat License. The MIT license is compatible with many copyleft licenses, such as the GNU General Public License (GPL); MIT licensed software can be re-licensed as GPL software, and integrated with other GPL software, but not the other way around.[11] The MIT license also permits reuse within proprietary software, provided that either all copies of the licensed software include a copy of the MIT License terms and the copyright notice, or the software is re-licensed to remove this requirement. MIT-licensed software can also be re-licensed as proprietary software,[10][12] which distinguishes it from copyleft software licenses. As of 2020[update], MIT was the most popular software license found in one analysis,[13] continuing from reports in 2015 that MIT was the most popular software license on GitHub, ahead of any GPL variant and other free and open-source software (FOSS) licenses.[14] Notable projects that use the MIT License include the X Window System, Ruby on Rails, Nim, Node.js, Lua and jQuery. Notable companies using the MIT License include Microsoft (.NET Core), Google (Angular) and Facebook (React). Contents 1 License terms 2 Variations 2.1 X11 2.2 Other variations 3 Minor ambiguity and variants 4 Comparison to other licenses 4.1 BSD 4.2 GNU GPL 5 Relation to patents 6 Origins 7 Reception 8 See also 9 References 10 Further reading 11 External links License terms[edit] The MIT license has the identifier MIT in the SPDX License List.[15][16] It is also known as the "Expat License".[17] It has the following terms:[18] Copyright (c) <year> <copyright holders> Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Variations[edit] X11[edit] The X11 license, a variation of the MIT license, has the identifier X11 in the SPDX License List.[19][20] It is also known as the "MIT/X Consortium License" by the X Consortium (for X11).[21] It has the following terms:[22] Copyright (C) <date> X Consortium Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of the X Consortium shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization from the X Consortium. X Window System is a trademark of X Consortium, Inc. Other variations[edit] The SPDX License List contains extra MIT license variations. Examples include:[1] MIT-0, a variation with the attribution paragraph removed. MIT-advertising, a variation with an additional advertising clause. Minor ambiguity and variants[edit] Massachusetts Institute of Technology has been using many licenses for software since its creation, so the phrase "the MIT License" is theoretically ambiguous.[23] For example, MIT offers four licensing options for the FFTW[24] C source code library, one of which is the GPL v2.0 and the other three of which are not open-source. "MIT License" may refer to the Expat License (used for the XML parsing library Expat)[17] or to the X11 License (also called "MIT/X Consortium License"; used for X Window System by the MIT X Consortium).[20] The "MIT License" published by the Open Source Initiative[16] is the same as the "Expat License". The X Consortium was dissolved late in 1996, and its assets transferred to The Open Group,[25] which released X11R6 initially under the same license. The X11 License[20] and the X11R6 "MIT License" chosen for ncurses by the Free Software Foundation[26] both include the following clause, absent in the Expat License:[17] Except as contained in this notice, the name(s) of the above copyright holders shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization. As of 2020, the successor to the X Window System is the X.Org Server, which is licensed under what is effectively the common MIT license, according to the X.org licensing page: The X.Org Foundation has chosen the following format of the MIT License as the preferred format for code included in the X Window System distribution. This is a slight variant of the common MIT license form published by the Open Source Initiative The "slight variant" is the addition of the phrase "(including the next paragraph)". Some ignore this history, referring to only one MIT license, as illustrated by GitHub's licensing advice and the legal text for the MIT License at GitHub's service choosealicense.com. Comparison to other licenses[edit] BSD[edit] The original BSD license also includes a clause requiring all advertising of the software to display a notice crediting its authors. This "advertising clause" (since disavowed by UC Berkeley[27]) is present in the modified MIT License used by XFree86. The University of Illinois/NCSA Open Source License combines text from both the MIT and BSD licenses; the license grant and disclaimer are taken from the MIT License. The ISC license contains similarities to both the MIT and simplified BSD licenses, the biggest difference being that language deemed unnecessary by the Berne Convention is omitted.[28][29] GNU GPL[edit] The GNU GPL is explicit about the patent grant an author would be giving when the code (or derivative work) is distributed,[30] the MIT license does not discuss patents. Moreover, the GPL license impacts "derivative works", but the MIT license does not. Relation to patents[edit] Like the BSD license, the MIT license does not include an express patent license although some commentators[31][32] state that the grant of rights covers all potential restrictions including patents. Both the BSD and the MIT licenses were drafted before the patentability of software was generally recognized under US law.[33] The Apache License version 2.0[3] is a similarly permissive license that includes an explicit contributor's patent license. Of specific relevance to US jurisdictions, the MIT license uses the terms "sell" and "use" that are also used in defining the rights of a patent holder in Title 35 of the United States Code section 154. This has been construed by some commentators[34][35] as an unconventional but implicit license in the US to use any underlying patents. Origins[edit] One of the originators of the MIT license, computer scientist Jerry Saltzer, has published his recollections of its early development, along with documentary evidence.[36] See also.[8] Reception[edit] As of 2020[update], according to WhiteSource Software[13] the MIT license was used in 27% of four million open source packages. As of 2015[update], according to Black Duck Software[37][better source needed] and a 2015 blog[14] from GitHub, the MIT license was the most popular free software license, with the GNU GPLv2 coming second in their sample of repositories. See also[edit] Free and open-source software portal Comparison of free and open-source software licenses ISC license – similar to the MIT license, but with language deemed unnecessary removed Category:Software using the MIT license References[edit] ^ a b "SPDX License List". spdx.org. SPDX Working Group. ^ "License information". The Debian Project. Software in the Public Interest (published July 12, 2017). 1997–2017. Archived from the original on July 20, 2017. Retrieved July 20, 2017. ... This page presents the opinion of some debian-legal contributors on how certain licenses follow the Debian Free Software Guidelines (DFSG). ... Licenses currently found in Debian main include: ... Expat/MIT-style licenses ... ^ a b c d "Various Licenses and Comments about Them". The GNU Project. Free Software Foundation (published April 4, 2017). 2014–2017. Expat License. Archived from the original on July 20, 2017. Retrieved July 20, 2017. ... This is a lax, permissive non-copyleft free software license, compatible with the GNU GPL. It is sometimes ambiguously referred to as the MIT License. ... ^ a b c "Various Licenses and Comments about Them". The GNU Project. Free Software Foundation (published April 4, 2017). 2014–2017. X11 License. Archived from the original on July 20, 2017. Retrieved July 20, 2017. ... This is a lax permissive non-copyleft free software license, compatible with the GNU GPL. ... This license is sometimes called the MIT license, but that term is misleading, since MIT has used many licenses for software. ... ^ "Licenses by Name". Open Source Initiative. n.d. Archived from the original on July 20, 2017. Retrieved July 20, 2017. ... The following licenses have been approved by the OSI. ... ... MIT License (MIT) ... ^ Certified Copyfree Licenses ^ Lawrence Rosen, OPEN SOURCE LICENSING, p.85 (Prentice Hall PTR, 1st ed. 2004) ^ a b "The mysterious history of the MIT License". opensource.com. opensource.com. Retrieved July 30, 2019. The date? The best single answer is probably 1987. But the complete story is more complicated and even a little mysterious. [...] Precursors from 1985. The X Consortium or X11 License variant from 1987. Or the Expat License from 1998 or 1999. ^ Hanwell, Marcus D. (January 28, 2014). "Should I use a permissive license? Copyleft? Or something in the middle?". opensource.com. Retrieved May 30, 2015. Permissive licensing simplifies things One reason the business world, and more and more developers [...], favor permissive licenses is in the simplicity of reuse. The license usually only pertains to the source code that is licensed and makes no attempt to infer any conditions upon any other component, and because of this there is no need to define what constitutes a derived work. I have also never seen a license compatibility chart for permissive licenses; it seems that they are all compatible. ^ a b "Licence Compatibility and Interoperability". Open-Source Software - Develop, share, and reuse open source software for public administrations. joinup.ec.europa.eu. Archived from the original on June 17, 2015. Retrieved May 30, 2015. The licences for distributing free or open source software (FOSS) are divided in two families: permissive and copyleft. Permissive licences (BSD, MIT, X11, Apache, Zope) are generally compatible and interoperable with most other licences, tolerating to merge, combine or improve the covered code and to re-distribute it under many licences (including non-free or 'proprietary'). ^ "Various Licenses and Comments about Them". Free Software Foundation. Retrieved July 17, 2013. ^ "Paid software includes MIT licensed library, does that put my app under MIT too?". stackexchange.com. Retrieved July 21, 2021. ^ a b "Open Source Licenses in 2020: Trends and Predictions". May 3, 2020. Archived from the original on May 3, 2020. Retrieved May 3, 2020. ^ a b Balter, Ben (March 9, 2015). "Open source license usage on GitHub.com". github.com. Retrieved November 21, 2015. 1 MIT 44.69%, 2 Other 15.68% ^ "MIT License". spdx.org. SPDX Working Group. ^ a b "Open Source Initiative OSI – The MIT License:Licensing". Open Source Initiative. Retrieved December 5, 2010. ^ a b c "Various Licenses and Comments about Them#Expat License". Free Software Foundation. Retrieved December 5, 2010. ^ "MIT License Explained in Plain English - TLDRLegal". tldrlegal.com. Retrieved July 7, 2021. ^ "X11 License". spdx.org. SPDX Working Group. ^ a b c "Various Licenses and Comments about Them#X11 License". Free Software Foundation. Retrieved December 5, 2010. ^ "3.3. X Consortium", 3. X/MIT Licenses, The XFree86 Project, March 2004 ^ "X11 License Explained in Plain English - TLDRLegal". tldrlegal.com. Retrieved March 26, 2021. ^ "Various Licenses and Comments about Them". GNU Project. Retrieved July 17, 2020. ^ "FFTW - Fastest Fourier Transform in the West". Massachusetts Institute of Technology. Retrieved July 17, 2020. ^ Dickey, Thomas E. "Copyrights/comments". Retrieved October 6, 2020. ^ Dickey, Thomas E. "NCURSES — Frequently Asked Questions (FAQ)". ^ "To All Licensees, Distributors of Any Version of BSD". University of California, Berkeley. July 22, 1999. Retrieved November 15, 2006. ^ "Copyright Policy". OpenBSD. Retrieved June 6, 2016. The ISC copyright is functionally equivalent to a two-term BSD copyright with language removed that is made unnecessary by the Berne convention. ^ de Raadt, Theo (March 21, 2008). "Re: BSD Documentation License?". openbsd-misc (Mailing list). ^ "Patents and GPLv3 - FSFE". FSFE - Free Software Foundation Europe. Retrieved December 1, 2020. ^ "Why so little love for the patent grant in the MIT License?". January 23, 2021. Archived from the original on January 23, 2021. Retrieved January 23, 2021. ^ "Free and open source software and your patents". May 3, 2020. Archived from the original on May 3, 2020. Retrieved May 3, 2020. ^ Stern and Allen, Open Source Licensing, p. 495 in Understanding the Intellectual Property License 2013 (Practicing Law Institute 2013) ^ "The MIT License, Line by Line". May 3, 2020. Archived from the original on May 3, 2020. Retrieved May 3, 2020. ^ Christian H. Nadan (2009), "Closing the Loophole: Open Source Licensing & the Implied Patent License", The Computer & Internet Lawyer, Aspen Law & Business, 26 (8), By using patent terms like "deal in", "use", and "sell", the MIT license grant is more likely to be deemed to include express patent rights than the BSD license. ^ Saltzer, Jerome H (November 18, 2020). "The origin of the "MIT license"". IEEE Annals of the History of Computing. 42 (4): 94–98. doi:10.1109/MAHC.2020.3020234. ISSN 1934-1547. Retrieved November 28, 2020. ^ "Top 20 licenses". Black Duck Software. November 19, 2015. Archived from the original on September 4, 2013. Retrieved November 19, 2015. 1. MIT license 24%, 2. GNU General Public License (GPL) 2.0 23% Further reading[edit] Mitchell, Kyle E. (September 21, 2016). "The MIT License, Line by Line". /dev/lawyer. Archived from the original on September 28, 2016. Retrieved September 28, 2016. External links[edit] MIT License variants The MIT License template (Open Source Initiative official site) Expat License X11 License v t e Free and open-source software General Alternative terms for free software Comparison of open-source and closed-source software Comparison of source-code-hosting facilities Free software Free software project directories Gratis versus libre Long-term support Open-source software Open-source software development Outline Timeline Software packages Audio Bioinformatics Codecs Configuration management Drivers Graphics Wireless Geophysics Health Mathematics Office Suites Operating systems Programming languages Routing Television Video games Web applications E-commerce Android apps iOS apps Commercial Trademarked Formerly proprietary Formerly open-source Community Free software movement History Open-source-software movement Organizations Events Licenses AFL Apache APSL Artistic Beerware BSD Creative Commons CDDL EPL Free Software Foundation GNU GPL GNU LGPL ISC MIT MPL Python Python Software Foundation License Shared Source Initiative Sleepycat Unlicense WTFPL zlib Types and standards Comparison of licenses Contributor License Agreement Copyleft Debian Free Software Guidelines Definition of Free Cultural Works Free license The Free Software Definition The Open Source Definition Open-source license Permissive software license Public domain Viral license Challenges Digital rights management Hardware restrictions License proliferation Mozilla software rebranding Proprietary device drivers Proprietary firmware Proprietary software SCO/Linux controversies Software patents Software security Trusted Computing Related topics Forking GNU Manifesto Microsoft Open Specification Promise Open-core model Open-source hardware Shared Source Initiative Source-available software The Cathedral and the Bazaar Revolution OS Portal Category Retrieved from "https://en.wikipedia.org/w/index.php?title=MIT_License&oldid=1037570390" Categories: Free and open-source software licenses Permissive software licenses Massachusetts Institute of Technology software X Window System Massachusetts Institute of Technology Hidden categories: Articles with short description Short description is different from Wikidata Use American English from March 2021 All Wikipedia articles written in American English Use mdy dates from March 2021 Articles containing potentially dated statements from 2020 All articles containing potentially dated statements Articles containing potentially dated statements from 2015 All articles lacking reliable references Articles lacking reliable references from November 2016 Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages العربية Bân-lâm-gú Български Català Čeština Dansk Deutsch Español Esperanto فارسی Français Galego 한국어 Bahasa Indonesia Italiano עברית Кыргызча Latviešu മലയാളം Bahasa Melayu Nederlands 日本語 Norsk bokmål Polski Português Русский Shqip Simple English Slovenčina Slovenščina Српски / srpski Suomi Svenska ไทย Türkçe Українська Tiếng Việt 中文 Edit links This page was last edited on 7 August 2021, at 10:57 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-661 ---- GNU Affero General Public License - Wikipedia GNU Affero General Public License From Wikipedia, the free encyclopedia Jump to navigation Jump to search Free software license based on the AGPLv1 and GPLv3 This article is about the license published by Free Software Foundation. For the licenses published by Affero Inc., see Affero General Public License. GNU Affero General Public License Author Free Software Foundation Latest version 3 Publisher Free Software Foundation, Inc. Published November 19, 2007 SPDX identifier AGPL-3.0-or-later AGPL-3.0-only Debian FSG compatible Yes[1] FSF approved Yes[2] OSI approved Yes[3][4] GPL compatible Yes (permits linking with GPLv3)[5] Copyleft Yes[2] Linking from code with a different licence Only with GPLv3; AGPL terms will apply for the AGPL part in a combined work.[2][5] Website gnu.org/licenses/agpl.html The GNU Affero General Public License is a free, copyleft license published by the Free Software Foundation in November 2007, and based on the GNU General Public License, version 3 and the Affero General Public License. The Free Software Foundation has recommended that the GNU AGPLv3 be considered for any software that will commonly be run over a network.[2] The Free Software Foundation explains the need for the license in the case when a free program is run on a server:[6] The GNU Affero General Public License is a modified version of the ordinary GNU GPL version 3. It has one added requirement: if you run a modified program on a server and let other users communicate with it there, your server must also allow them to download the source code corresponding to the modified version running there. The purpose of the GNU Affero GPL is to prevent a problem that affects developers of free programs that are often used on servers. The Open Source Initiative approved the GNU AGPLv3[3] as an open source license in March 2008 after the company Funambol submitted it for consideration through its CEO Fabrizio Capobianco.[7] Contents 1 Compatibility with the GPL 2 Examples of applications under GNU AGPL 3 Criticism 4 See also 5 References 6 External links Compatibility with the GPL[edit] GNU AGPLv3 and GPLv3 licenses each include clauses (in section 13 of each license) that together achieve a form of mutual compatibility for the two licenses. These clauses explicitly allow the "conveying" of a work formed by linking code licensed under the one license against code licensed under the other license,[8] despite the licenses otherwise not allowing relicensing under the terms of each other.[2] In this way, the copyleft of each license is relaxed to allow distributing such combinations.[2] Examples of applications under GNU AGPL[edit] Main article: List of software under the GNU AGPL Stet was the first software system known to be released under the GNU AGPL, on November 21, 2007,[9] and is the only known program to be used mainly for the production of its own license. Flask developer Armin Ronacher noted in 2013 that the GNU AGPL is a "terrible success, especially among the startup community" as a "vehicle for dual commercial licensing", and gave Humhub, MongoDB, Odoo, RethinkDB, Shinken, Slic3r, SugarCRM, and WURFL as examples.[10] MongoDB dropped the AGPL in late-2018 in favor of the "Server Side Public License" (SSPL), a variation of GPLv3 that requires those who provide "the program as a service", accessible to third-parties, must make the entire source code of all software used to facilitate the service available under the same license.[11] The SSPL has been rejected by the Open Source Initiative and banned by both Debian and the Fedora Project, who state that the license's intent is to discriminate against cloud computing providers offering services based on the software without purchasing its commercial license.[12][13] Criticism[edit] Héctor Martín Cantero has criticized the Affero GPL for being an EULA and causing side effects.[14] See also[edit] List of software under the GNU AGPL Free Software licensing GNU General Public License GNU Lesser General Public License GNAT Modified General Public License GPL linking exception GNU Free Documentation License List of software licenses Comparison of free and open-source software licenses References[edit] ^ Jaspert, Joerg (November 28, 2008). "ftp.debian.org: Is AGPLv3 DFSG-free?". The Debian Project. Retrieved December 1, 2008. ^ a b c d e f List of free-software licences on the FSF website: "We recommend that developers consider using the GNU AGPL for any software which will commonly be run over a network." ^ a b "OSI approved licenses". Open Source initiative. ^ "OSI approved", Licenses, TL;DR legal. ^ a b "Licenses section 13", GNU AGPLv3, GNU Project. ^ "Why the Affero GPL". The GNU Project. ^ "Funambol Helps New AGPLv3 Open Source License Gain Formal OSI Approval" (Press release). Funambol. Mar 13, 2008. Archived from the original on 2013-06-07. ^ The GNU General Public License v3 – GNU Project – Free Software Foundation (FSF) ^ Kuhn, Bradley M. (November 21, 2007). "stet and AGPLv3". Software Freedom Law Center. Archived from the original on March 15, 2008. Retrieved June 14, 2008. ^ Ronacher, Armin (2013-07-23). "Licensing in a Post Copyright World". lucumr.pocoo.org. Retrieved 2015-11-18. The AGPLv3 was a terrible success, especially among the startup community that found the perfect base license to make dual licensing with a commercial license feasible. MongoDB, RethinkDB, OpenERP, SugarCRM as well as WURFL all now utilize the AGPLv3 as a vehicle for dual commercial licensing. The AGPLv3 makes that generally easy to accomplish as the original copyright author has the rights to make a commercial license possible but nobody who receives the sourcecode itself through the APLv3 inherits that right. I am not sure if that was the intended use of the license, but that's at least what it's definitely being used for now. ^ "Server Side Public License (SSPL)". MongoDB. Retrieved 2021-01-25. ^ Vaughan-Nichols, Steven J. "MongoDB "open-source" Server Side Public License rejected". ZDNet. Retrieved 2019-01-17. ^ "MongoDB's licensing changes led Red Hat to drop the database from the latest version of its server OS". GeekWire. 2019-01-16. Retrieved 2019-01-17. ^ "Twitter profile of Hector Martin". Twitter. Retrieved 2021-05-19. External links[edit] Official website for GNU Affero General Public License (GNU AGPL). Smith, Brett (November 19, 2007). "Free Software Foundation Releases GNU Affero General Public License Version 3" (Press release). Smith, Brett (March 29, 2007), GPLv3 and Software as a Service – also includes info on version 2 of the Affero GPL. Kuhn, Bradley M. (March 19, 2002). "Free Software Foundation Announces Support of the Affero General Public License, the First Copyleft License for Web Services" (Press release). v t e GNU Project History GNU Manifesto Free Software Foundation Europe India Latin America History of free software Licenses GNU General Public License linking exception font exception GNU Lesser General Public License GNU Affero General Public License GNU Free Documentation License Software GNU (variants) Hurd Linux-libre glibc Bash coreutils findutils Build System GCC binutils GDB GRUB GNOME GNUstep GIMP Jami GNU Emacs GNU TeXmacs GNU Octave GNU Taler GNU R GSL GMP GNU Electric GNU Archimedes GNUnet GNU Privacy Guard Gnuzilla (IceCat) GNU Health GNUmed GNU LilyPond GNU Go GNU Chess Gnash Guix more... Contributors Alexandre Oliva Benjamin Mako Hill Bradley M. Kuhn Brian Fox Federico Heinz Frédéric Couchet Georg C. F. Greve John Sullivan José E. Marchesi Joshua Gay Kefah T. Issa Loïc Dachary Nagarjuna G. Peter Heath Richard M. Stallman Other topics GNU/Linux naming controversy Revolution OS Free Software Foundation anti-Windows campaigns Defective by Design v t e Free Software Foundation People Richard M. Stallman GNU Project GNU General Public License GNU Lesser General Public License GNU Affero General Public License Other projects Free Software Directory FSF Free Software Awards Free Software Foundation anti-Windows campaigns Defective by Design Sister organizations FSF Europe FSF Latin America FSF India League for Programming Freedom See also Comparison of Linux distributions Retrieved from "https://en.wikipedia.org/w/index.php?title=GNU_Affero_General_Public_License&oldid=1029973333" Categories: Free Software Foundation Free and open-source software licenses Copyleft software licenses Hidden categories: Articles with short description Short description matches Wikidata Official website different in Wikidata and Wikipedia Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية Català Čeština Deutsch Español Esperanto Euskara فارسی Français 한국어 Italiano עברית Nederlands 日本語 Polski Português Русский Simple English Slovenčina Svenska Türkçe Українська Tiếng Việt 中文 Edit links This page was last edited on 23 June 2021, at 04:01 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6682 ---- Platform cooperative - Wikipedia Platform cooperative From Wikipedia, the free encyclopedia Jump to navigation Jump to search Business structure type A platform cooperative, or platform co-op, is a cooperatively owned, democratically governed business that establishes a computing platform, and uses a website, mobile app or a protocol to facilitate the sale of goods and services. Platform cooperatives are an alternative to venture capital-funded platforms insofar as they are owned and governed by those who depend on them most—workers, users, and other relevant stakeholders. Contents 1 Typology 2 Examples 3 Platform co-operativism 3.1 History of the term 3.1.1 Roots in criticism of the sharing economy 4 Public policy 4.1 Spain 4.1.1 Barcelona 4.2 United States 4.3 United Kingdom 5 Advocacy 5.1 Organizations 5.2 Campaigns 6 Criticisms of the viability of platform cooperatives 6.1 Dominance of established players 6.2 Difficulty securing early-stage capital 7 See also 8 References Typology[edit] While there is no commonly accepted typology of platform cooperatives, researchers often ontologize platform cooperatives by industry. Some potential categories include: transportation, on-demand labor, journalism, music, creative projects, timebank, film, home health care, photography, data cooperatives, marketplaces.[1] Other typologies differentiate platform cooperatives by their governance or ownership structures. Platform cooperatives have been contrasted with platform capitalism. Companies that try to focus on fairness and sharing, instead of just profit motive, are described as cooperatives, whereas more traditional and common companies that focus solely on profit, like Airbnb and Uber, are platform capitalists (or cooperativist platforms vs capitalist platforms). In turn, projects like Wikipedia, which rely on unpaid labor of volunteers, can be classified as commons-based peer-production initiatives.[2]:31, 36 Examples[edit] Many platform co-operatives use business models similar to better-known apps or web services, but with a cooperative structure. For example, there are numerous driver-owned taxi apps that allow customers to submit trip requests and notify the nearest driver, similar to Uber.[3][4] The Internet of Ownership website includes a directory of the platform co-op "ecosystem".[5] Eva [6] is a ride-sharing application that offers a service similar to Uber, but in line with its cooperative members priorities: cheaper for rider members and better wages for driver members.[7] Fairbnb.coop [8] is an online marketplace and hospitality service for people to lease or rent short-term lodging. Foremost, it is also a community of activists, coders, researchers and designers working to create the platform to enable hosts and guests to connect for travel and cultural exchange, while minimizing the cost to communities. It is an alternative to commercial platforms.[9] Fairmondo is an online marketplace for ethical goods and services, that originated from Germany and has expanded to the UK. Joining as a stakeholder is open for all and the minimum share is limited to an affordable amount, with stakeholders exercising a democratic control through one-member-one-vote principle.[10] It is a cooperative alternative to Amazon and eBay.[11] Green Taxi Cooperative is the largest taxi company in the Denver metro area.[12] Organized by the Communications Workers of America Local 7777, its members buy into the cooperative for a one-time membership fee of $2000 and then pay fees amounting to a "fraction" of what large companies charge drivers.[13] Despite having a mobile application through which riders can schedule pickups, and thus competing directly with ride-hailing applications like Uber and Lyft, as of November 2016 the Green Taxi Cooperative reportedly held 37% market share in Denver.[14] Meet.coop is an open source meeting and conferencing tool.[15] Midata is a cooperatively owned, Zurich-based, online platform that seeks to serve as an exchange for members' medical data. Using an open-source application, members are able to securely share their medical data with doctors, friends, and researchers, and are provided access to "data analysis, visualization and interpretation tools". Members can also consent to their data's use in medical research and clinical trials. In a pilot project, post-bariatric-surgery patients are able to upload data to the platform, including their weight and daily step count, and follow their own post-surgery progress.[16] Savvy Cooperative is a multi-stakeholder patient-owned research insights cooperative that seeks to match patients with patient engagement leaders, digital health companies, and clinical innovation leads, enabling industry and start-up tech companies to easily conduct user research with patients to ensure the products that go-to-market are patient-centric and focused on patient needs. Using Savvy's platform, patients can find and apply for gigs that match their conditions, get reimbursed for their participation, and qualify for dividends based on their co-op participation. Savvy is majority patient-owned.[17] Stocksy United is a platform cooperative headquartered in Victoria, British Columbia. It is a "highly curated collection of royalty-free stock photography and video footage that is 'beautiful, distinctive, and highly usable.'"[18] In 2015, Stocksy earned $7.9 million in sales—doubling its revenues from the year prior—and paid a dividend of $200,000 to its members.[18] Up & Go is a digital marketplace for professional home services that allows users to schedule services such as house cleaning, dog walking, and handywork with worker-owned businesses that have fair work practices.[19][20] Resonate [21] is music streaming coop [22] similar to Spotify. Collective Tools is a cooperatively owned cloud service that offers storage, communication and canvas boards to organisations as well as storage and email to private persons.[23] Platform co-operativism[edit] Platform Cooperativism is an intellectual framework and movement which advocates for the global development of platform cooperatives. Its advocates object to the techno-solutionist claim that technology is, by default, the answer to all social problems.[24][25][26] Rather, proponents of the movement claim that ethical commitments such as the building of the global commons, support of inventive unions, and promotion of ecological and social sustainability as well as social justice, are necessary to shape an equitable and fair social economy.[27] Platform cooperativism advocates for the coexistence of cooperatively owned business models and traditional, extractive models with the goal of a more diversified digital labor landscape respecting fair working conditions.[28] Platform cooperativism draws upon other attempts at digital disintermediation, including the peer-to-peer production movement, led by Michel Bauwens, Vasilis Kostakis and the P2P Foundation,[29] which advocates for "new kinds of democratic and economic participation"[30] that rest "upon the free participation of equal partners, engaged in the production of common resources", as well as the radically distributed, non-market mechanisms of networked peer-production promoted by Yochai Benkler.[31] Marjorie Kelly's book Owning Our Future contributed the distinction between democratic and extractive ownership design to this discussion.[32] While platform cooperatives are structured as cooperatives, granting democratic control to workers, customers, users, or other key stakeholders, companies and initiatives that support the ecosystem of the cooperative platform economy are considered a part of the platform cooperativism movement insofar as they attempt to encourage, develop, and sustain its development. It has also been argued that, as the spread of platform cooperativism "will require a different kind of ecosystem -- with appropriate forms of finance, law, policy, and culture -- to support the development of democratic online enterprises", any person or business associated with the development of this ecosystem can be considered a proponent of platform cooperativism.[33] History of the term[edit] The term "platform cooperativism" was coined by New School professor Trebor Scholz in a 2014 article titled, "Platform Cooperativism vs. the Sharing Economy", in which he criticized popular sharing economy platforms and called for the creation of democratically controlled cooperative alternatives that "allow workers to exchange their labor without the manipulation of the middleman".[31] Shortly thereafter, journalist Nathan Schneider published an article, "Owning Is the New Sharing", which documented a variety of projects using cooperative models for digitally mediated commerce, as well as online, distributed funding-models which hoped to replace the venture capital model predominant in the technology sector.[34] Both Scholz and Schneider would later credit the work and provocations of other researchers and digital-labor advocates as their inspiration, including, among others, lawyer Janelle Orsi of the Sustainable Economies Law Center, who had "called on technology companies in the sharing economy to share ownership and profits with their users", and Amazon Mechanical Turk organizer Kristy Milland who had proposed a worker-owned alternative to the platform at the "Digital Labor: Sweatshops, Picket Lines, Barricades" conference in November 2014.[35][36] There are several other precursors to platform cooperativism. In 2012, the Italian cooperative federation Legacoop promulgated a manifesto on the "Cooperative Commons", which called for bringing the lessons of the cooperative movement to control over online data.[37] The same year Mayo Fuster Morell published an article named "horizons of digital commons" in which she pointed to the evolution of commons-based peer production merging with cooperatives and the social economy.[38] The article reflects on an event named Building Digital commons, which took place in October 2011. It was the goal of the event to further connect the cooperative tradition and collaborative production. Other previous similar terms on new forms of cooperativism such as "open cooperativism"[39] and also studies of how the digital environment opens up new possibilities for the cooperative tradition[40] are of relevance to the new term platform cooperativism. In 2015, Scholz published a primer on platform cooperativism, "Platform Cooperativism: Challenging the Corporate Sharing Economy", which was published in five languages[41] and helped to internationalize the concept.[42] In 2016, he published Uberworked and Underpaid: How Workers Are Disrupting the Digital Economy,[43] which further developed the concept. Together, Scholz and Schneider went on to convene an event on the subject, "Platform Cooperativism. The Internet. Ownership. Democracy", at The New School in November 2015,[44] and edit a book, Ours to Hack and to Own: The Rise of Platform Cooperativism, a New Vision for the Future of Work and a Fairer Internet.[45] Roots in criticism of the sharing economy[edit] Proponents of platform cooperativism claim that, by ensuring the financial and social value of a platform circulate among these participants, platform cooperatives will bring about a more equitable and fair digitally mediated economy in contrast with the extractive models of corporate intermediaries. The concept of platform cooperativism emerged from the discourse surrounding digital labor, popular in the late 2000s and early 2010s, which critiqued the use of digitally mediated labor markets to evade traditional labor protections.[46] Early studies of digital labor, using the theories of Italian Workerists, focused on the "free" or "immaterial" labor performed by users of Web 2.0 platforms (sometimes referred to as "playbor"), while later analyses served to critique the "crowd fleecing"[47][48] of digital laborers by microtask labor-brokerages such as Amazon Mechanical Turk and Crowdflower.[49] In 2014, the digital labor discourse shifted to the so-called "sharing economy", resulting in an increase in both academic and media attention to the practices and policies of online markets for labor, services, and goods.[50] Researchers and labor advocates argued that platforms such as Uber and TaskRabbit were unfairly classifying full-time workers as independent contractors rather than employees, thus avoiding legally granted labor protections such as minimum-wage laws[51][52][53] and the right to join a union with which to engage in collective bargaining,[54] as well as different benefits offered to workers with employee status, including time off, unemployment insurance, and healthcare.[55] Other research focused on the automated management of the digital workplace by algorithms, without worker recourse. For example, the wage-per-mile by drivers on the Uber platform is controlled moment-to-moment by a surge pricing algorithm,[56][57] and its drivers can lose their jobs if they fall behind any one of a number of metrics logged by the platform including ride-acceptance percentage (minimum 90%) and customer-rating (4.7 out of 5).[57] Sharing economy workers who complained about this algorithmic management were often ignored, (e.g. a TaskRabbit discussion forum was shut down in response to worker unrest)[58] and sometimes told that, insofar as the platform owners do not employ their contracted labor force, they were not actually being managed by the technology companies behind the platforms on which they worked.[59][60] Insofar as platform cooperatives offer worker-owners a more robust degree of control of the platforms they use, the model was seen as offering an ethical alternative to existing sharing economy platforms.[61] As these early critiques of the sharing economy remain relevant, platform cooperatives tend to highlight their efforts to provide their worker-owners with a living wage or a fair share of revenues, benefits, control over the platform's design, and democratic influence over the management of the cooperative business. Public policy[edit] The platform cooperativism movement has seen a number of global policy proposals and successes. Spain[edit] Barcelona[edit] Barcelona has a long tradition of connecting cooperativism and collaborative production.[62] As long ago as 30 of October 2011, an event was held to "Promote dialogue between the cooperative tradition and digital commons".[63] The Social Economy and Consumption Commission of Barcelona City Council in 2015 started a program on platform cooperativism.[64] The program includes the provision of match-funding to support entrepreneurship and "La Communificadora", an entrepreneurship training and support course, among others.[65] A March 2016 international event by BarCola (node about Collaborative Economy and Commons-Based Peer Production in Barcelona) produced a set of 120 policy proposals for European governments. Integrated as concrete actions for the Municipal Action Plan of the Barcelona City Council, following a consultative online participatory process, as well as aiming at other local authorities in Spain and the Government of Catalonia, the resulting document criticized the organizational rationale of "multinational corporations based in Silicon Valley" which, though similar to collaborative-Commons economic models, "behave in the style of the prevailing globalized capitalist economic model, based on extracting profits through networked collaboration". That joint statement of public policies for the collaborative economy, which integrates a Commons-oriented vision in such an emerging paradigm, claimed that by privatizing certain aspects of the collaborative Commons model these companies created "severe inequalities and loss of rights". The organization and participants at the event proposed the creation of favorable regulations for truly collaborative economic models, with measures like the funding of an incubator of new projects in the collaborative economy, including platform cooperativism, as well as the reassigning of public spaces for jointly managed working and manufacturing spaces. Embedded in a wider framework of action research for the co-design of public policies, some of these policy proposals have been met with support by members of the Barcelona city government. Outputs from that process have resulted in specific measures like the incubation of new collaborative economy initiatives following a cooperativist model, or the possibility of new funding schemes for civic projects via transparent "match-funding". United States[edit] NYC Council Member Brad Lander of Brooklyn's 39th District, founding co-chair of the Council's Progressive Caucus, released a report in 2016 entitled, "Raising the Floor for Workers in the Gig Economy: Tools for NYC & Beyond",[66] which analyzes the contingent work sector in New York City and "presents policy tools for cities seeking to protect gig workers from wage theft and discrimination, provide access to portable benefits, and establish new frameworks for worker organizing".[67] Under his leadership, the NYC Council unanimously passed the "Freelance Isn't Free Act", which provides freelance workers with a right to full and timely payment, along with new tools for enforcement, and amendments to the NYC Human Rights law to clarify that employment protections apply to independent and contingent workers.[68] In his report, NYC Council Member Brad Lander presented platform cooperativism as a model to help laborers in the digital economy.[67][66] The US Department of Agriculture appeared to offer its support for the platform cooperativism movement with a feature story in the September/October 2016 issue of its magazine, Rural Cooperatives.[69] "Rural Americans have been organizing cooperatives to develop countervailing economic power against larger investor-owned corporations for more than a century. This cooperative movement has now moved into the sharing economy that has been developing throughout the country. Wherever investor-owners of software platforms are satisfying the needs of rural asset owners and users, the sharing economy will be welcomed. However, when the need arises, cooperatively-owned software platforms are proving to be a viable alternative." United Kingdom[edit] In 2016, Jeremy Corbyn, leader of the Labour Party and the Opposition in the United Kingdom, released a digital democracy manifesto calling for, among other policies, the fostering of "the cooperative ownership of digital platforms for distributing labour and selling services". He proposed that the National Investment Bank, as well as regional banks, would "finance social enterprises whose websites and apps are designed to minimise the costs of connecting producers with consumers in the transport, accommodation, cultural, catering and other important sectors of the British economy".[70] Advocacy[edit] Organizations[edit] Platform Cooperativism Consortium (PCC) The Platform Cooperativism Consortium is a "think-and-do tank"[71] for the platform cooperativism movement based at The New School in New York City.[72] As a "global network of researchers, platform co-ops, independent software developers, artists, designers, lawyers, activists, publishing outlets, and funders",[73] it engages in research, advocacy, education, and technology-based projects. It was launched in November 2016 at the occasion of the "Building the Cooperative Internet" conference.[74] The Internet of Ownership The Internet of Ownership is a website which maintains a global directory of platform cooperatives[75] and a calendar of events[76] concerning the platform cooperativism movement. It is maintained by Nathan Schneider and Devin Balkind.[75] Campaigns[edit] In September 2016, Nathan Schneider wrote the article "Here's my plan to save Twitter: let's buy it" [77] in which he asked "What if users were to band together and buy Twitter for themselves?" Once in users' hands, Schneider suggested, Twitter could be turned into a platform co-op. Criticisms of the viability of platform cooperatives[edit] Dominance of established players[edit] Some critics of platform cooperativism claim that platform cooperatives will have trouble challenging established, venture-capital-funded platforms. Nick Srnicek writes that, due to "the monopolistic nature of platforms, the dominance of network effects, and the vast resources behind these companies … even if all that software would be made open-source, a platform like Facebook would still have the weight of its existing data, network effects, and financial resources to fight off any co-op arrival."[78] Rufus Pollock expresses similar concerns that platform coops will face major challenges reaching adequate scale, particularly given their inability to raise traditional equity capital.[79] In addition, he argues that coops often have slow and inefficient decision-making processes which will hamper them in their ability to compete successfully. Finally, he points out there is the risk that platform coops will go "bad" becoming an exclusive club for their members (for example, a ride-sharing coop might end up controlled only by drivers who then exploit consumers). Evgeny Morozov writes that "Efforts at platform cooperativism are worthwhile; occasionally, they do produce impressive and ethical local projects. There is no reason why a cooperative of drivers in a small town cannot build an app to help them beat Uber locally. But there is also no good reason to believe that this local cooperative can actually build a self-driving car: this requires massive investment and a dedicated infrastructure to harvest and analyze all of the data. One can, of course, also create data ownership cooperatives but it's unlikely they will scale to a point of competing with Google or Amazon."[80] While this may be true in certain sectors, Arun Sundararajan claims that, "Economic theory suggests that worker cooperatives are more efficient than shareholder corporations when there isn't a great deal of diversity in the levels of contribution across workers, when the level of external competition is low, and when there isn't the need for frequent investments in response to technological change." Using Uber as an example of a dominant platform, he continues: "Cab drivers, after all, offer a more or less uniform service in an industry with a limited amount of competition. Once the technology associated with 'e-hail' is commoditized, the potential for a worker cooperative appears to be in place, since each local market is contestable."[81] Regardless, the possibility of dominant platforms turning the flows of data they receive from their larger user-bases into market-securing technological innovations remains a challenge. For example, Uber seeks to use the data they currently collect from drivers using their app to automate the taxi industry, thus eliminating the need for their workforce altogether and likely dropping the value of a ride below that on which a human laborer can survive. Difficulty securing early-stage capital[edit] Though Sundararajan believes there are markets in which platform cooperatives might thrive, he finds their primary barrier to entry to be the initial securing of funds, especially given their ideological devaluation of the need to generate profits for investor-stakeholders. He does note, however, that a number of alternative fundraising models may pave the way for the widespread market-entry of platform cooperatives. Among those he mentions is Fairshare, a stakeholder model that differentiates between founders, workers, users, and investors, each with distinct voting rights, payouts, and permissions to trade shares on the open market. Other models he mentions include crypto-coin crowdfunding, philanthropic investment, and "provider stock ownership programs" that mimic the traditional joint-ownership form of the "employee stock ownership program".[82] See also[edit] Commons-based peer production Cooperative Sharing economy Solidarity economy Unionized cooperative Workers' self-management References[edit] ^ Scholz, Trebor (4 December 2016). "The Prospects of Platform Cooperativism". Slideshare. Retrieved 10 December 2016. ^ Dariusz Jemielniak; Aleksandra Przegalinska (18 February 2020). Collaborative Society. MIT Press. ISBN 978-0-262-35645-9. ^ "Profile of People's Ride: a co-operative, driver-owned alternative to Uber". 10 August 2016. Retrieved 25 November 2016. ^ Schneider, Nathan. "Denver Taxi Drivers Are Turning Uber's Disruption on Its Head". The Nation. Retrieved 25 November 2016. ^ "The Internet of Ownership: Directory". ^ "Eva". Retrieved 15 March 2020. ^ "Eva". eva.coop. Retrieved 2020-03-15. ^ "Fairbnb.coop". Retrieved 19 March 2019. ^ "A smart and fair solution for community-powered tourism". fairbnb.coop. Retrieved 2018-09-01. ^ "Welcome to Fairmondo". Fairmondo. Retrieved 10 December 2016. ^ Scholz, Trebor (2016). Platform Cooperativism: Challenging the Sharing Economy (PDF). New York: Rosa Luxemburg Stiftung. ^ Schneider, Nathan (7 September 2016). "Denver Taxi Drivers Are Turning Uber's Disruption on Its Head". The Nation. Retrieved 10 December 2016. ^ Kenny, Andrew (8 December 2016). "A third of Denver's taxi drivers have joined Green Taxi Cooperative to fight Uber". Denverite. Retrieved 10 December 2016. ^ "Archived copy". Green Taxi Co-op. Archived from the original on 5 February 2018. Retrieved 10 December 2016.CS1 maint: archived copy as title (link) ^ "Meet Coop". ^ MIDATA https://www.midata.coop/. Retrieved 10 December 2016. Missing or empty |title= (help) ^ "This co-op wants to put money back into patients' hands". TechCrunch. Retrieved 2021-06-25. ^ a b Pontefract, Dan (1 October 2016). "Platform Cooperatives Like Stocksy Have A Purpose Uber And Airbnb Never Will". Forbes. Retrieved 10 December 2016. ^ Up & Go http://www.upandgo.coop/. Retrieved 10 December 2016. Missing or empty |title= (help) ^ "Archived copy". Archived from the original on 23 October 2017. Retrieved 10 December 2016.CS1 maint: archived copy as title (link) ^ "Resonate". Retrieved 19 March 2019. ^ "FairShares Association: The association for multi-stakeholder co-operation in member-owned social enterprises". Retrieved 19 March 2019. ^ "collective.tools | Everything you need to get organised – in one place". collective.tools. Retrieved 2020-10-01. ^ Scholz, Trebor (5 April 2015). "Think Outside the Boss: Cooperative Alternatives to the Sharing Economy". Public Seminar. Retrieved 10 December 2016. ^ Schneider, Nathan (7 December 2016). "An Internet of ownership: democratic design for the online economy". The Internet of Ownership. Archived from the original on 6 December 2016. Retrieved 10 December 2016. ^ O'Dwyer, Rachel (2016). Scholz, Trebor; Schneider, Nathan (eds.). Ours To Hack and Own: The Rise of Platform Cooperativism, a New Vision for the Future of Work and a Fairer Internet. New York: OR Books. p. 237. ^ "Mission". Platform Cooperativism Consortium. Retrieved 10 December 2016. ^ Scholz, Trebor (2016). Uberworked and Underpaid: How Workers Are Disrupting the Digital Economy. New York City: Polity. Part II. ^ "P2P Foundation". P2P Foundation. Retrieved 10 December 2016. ^ "Our Story". P2P Foundation. Archived from the original on 7 February 2018. Retrieved 10 December 2016. ^ a b Scholz, Trebor (5 December 2014). "Platform Cooperativism vs. the Sharing Economy". Medium. Retrieved 10 December 2016. ^ Kelly, Marjorie (2012). Owning Our Future. Berrett-Koehler Publishers. ISBN 978-1605093109. ^ Schneider, Nathan; Scholz, Trebor (2016). "Introduction". In Scholz, Trebor; Schneider, Nathan (eds.). Ours To Hack and Own: The Rise of Platform Cooperativism, a New Vision for the Future of Work and a Fairer Internet. New York: OR Books. ^ Schneider, Nathan (21 December 2014). "Owning is the New Sharing". Shareable. Retrieved 10 December 2016. ^ Schneider, Nathan (2016). "The Meanings of Words". In Scholz, Trebor; Schneider, Nathan (eds.). Ours To Hack and Own: The Rise of Platform Cooperativism, a New Vision for the Future of Work and a Fairer Internet. New York: OR Books. ^ Sifry, Micah L. (25 October 2016). "A Conversation with Trebor Scholz on the Rise of Platform Cooperativism". Civic Hall. Retrieved 10 December 2016. ^ "Digital Commons: Manifesto". Legacoop. 2012. Archived from the original on 2017-03-13. Retrieved 2017-03-12. ^ Fuster Morell, Mayo (September 2012). "Horizontes del procomún digital" (PDF). Archived from the original (PDF) on 13 April 2016. Retrieved 25 April 2017. ^ Bauwens, M., Kostakis, V. (2014). "From the communism of capital to capital for the commons: Towards an open co-operativism". TripleC. 12 (1): 356–361. doi:10.31269/triplec.v12i1.561. ^ De Peuter & Dyer-Witheford, G. (2010). "Commons and cooperatives". Affinities: A Journal of Radical Theory, Culture, and Action. 4 (1). ^ "The Platform Cooperativism Primer". platform.coop. Archived from the original on 13 March 2017. Retrieved 10 December 2016. ^ "Contributors". Platform Cooperativism Consortium. Retrieved 10 December 2016. ^ Scholz, Trebor (2016). Uberworked and Underpaid: How Workers Are Disrupting the Digital Economy. New York City: Polity. ^ "Platform Cooperativism. The Internet. Ownership. Democracy". platform.coop. Retrieved 10 December 2016.[permanent dead link] ^ Scholz, Trebor; Schneider, Nathan, eds. (2016). Ours To Hack and Own: The Rise of Platform Cooperativism, a New Vision for the Future of Work and a Fairer Internet. New York: OR Books. ^ Sifry, Micah L. (25 October 2016). "A Conversation with Trebor Scholz on the Rise of Platform Cooperativism". Civic Hall. Retrieved 10 December 2016. ^ Scholz, Trebor (2016). "Chapter 4". Uberworked and Underpaid: How Workers Are Disrupting the Digital Economy. New York City: Polity. ^ Terranova, Tiziana (2004). Network Culture: Politics for the Information Age. Pluto Press. ISBN 0-7453-1748-0. ^ Scholz, Trebor (2016). "How Platform Cooperativism Can Unleash the network". In Scholz, Trebor; Schneider, Nathan (eds.). Ours To Hack and Own: The Rise of Platform Cooperativism, a New Vision for the Future of Work and a Fairer Internet. New York: OR Books. p. 23. ^ Scholz, Trebor (5 December 2014). "Platform Cooperativism vs. the Sharing Economy". Medium. Retrieved 10 December 2016. ^ Cheng, Denise (October 2014). Is sharing really caring? A nuanced introduction to the peer economy (PDF). ^ "Sharing Economy 2.0: Can Innovation and Regulation Work Together?". Knowledge@Wharton. 5 November 2014. Retrieved 10 December 2016. ^ Bauwens, Michel (29 October 2014). "How Uber drivers, making less than the minimum wage, are organizing with assistance of taxi drivers". P2P Foundation. Retrieved 10 December 2016. ^ Smith, Rebecca; Leberstein, Sarah (September 2015). Rights on Demand: Ensuring Workplace Standards and Worker Security In the On-Demand Economy (PDF). National Employment Law Project. p. 5. Archived from the original (PDF) on 2017-04-27. Retrieved 2017-03-12. ^ Smith, Rebecca; Leberstein, Sarah (September 2015). Rights on Demand: Ensuring Workplace Standards and Worker Security In the On-Demand Economy (PDF). National Employment Law Project. p. 4. Archived from the original (PDF) on 2017-04-27. Retrieved 2017-03-12. ^ Rosenblat, Alex; Stark, Luke (15 October 2015). Uber's Drivers: Information Asymmetries and Control in Dynamic Work (PDF). Data & Society. p. 5.[permanent dead link] ^ a b Slee, Tom (26 November 2014). "Why Canada should de-activate Uber". Tom Slee. Retrieved 10 December 2016. ^ Weber, Harrison (10 July 2014). "TaskRabbit users revolt as the company shuts down its bidding system". Venture Beat. Retrieved 10 December 2016. ^ Biddle, Sam (23 July 2014). "If TaskRabbit Is the Future of Employment, the Employed Are Fucked". Gawker. Retrieved 10 December 2016. ^ Claburn, Thomas (2 August 2016). "Uber Drivers Under Algorithmic Management: Study". Information Week. Retrieved 10 December 2016. ^ Scholz, Trebor (2016). Platform Cooperativism: Challenging the Sharing Economy (PDF). New York: Rosa Luxemburg Stiftung. ^ Fuster, Mayo (2012). "Horizontes de procomún digital". Barcelona: Caritas. ^ "Digital commons event, 30 October 2011, Barcelona". Archived from the original on 2011-10-09. ^ Fuster, Mayo. "Presentation Barcelona Collaborative Economy Action Plan - Platform Cooperativism action". Archived from the original on 2017-01-10. Retrieved 2017-03-12. ^ Barcelona Collaborative Economy Action Plan. http://emprenedoria.barcelonactiva.cat/emprenedoria/es/edit.do?codiIdioma=2&id=789313&id_activitat_mestre=789313&dia=18&mes=10&any=2016. Missing or empty |title= (help) ^ a b "Raising the Floor For Workers In The Gig Economy: Tools for NYC & Beyond". Brad Lander. 5 September 2016. Archived from the original on 3 March 2018. Retrieved 10 December 2016. ^ a b "Brad Lander". Platform Cooperativism. Archived from the original on 1 December 2016. Retrieved 10 December 2016. ^ Lee, Adaline (22 November 2016). "Hack the Union talks the passage of Freelance Isn't Free". Freelancer's Union. Retrieved 10 December 2016. ^ Borst, Alan (October 2016). "'Platform co-ops' gaining traction" (PDF). Rural Cooperatives Magazine. Washington D.C.: US Department of Agriculture. ^ "Digital democracy manifesto". Jeremy Corbyn. Archived from the original on 2 August 2017. Retrieved 10 December 2016. ^ "10 Areas of Activities". Platform Cooperativism Consortium. Retrieved 10 December 2016. ^ Platform Cooperativism Consortium http://platformcoop.newschool.edu/. Retrieved 10 December 2016. Missing or empty |title= (help) ^ Sharp, Darren (16 November 2016). "International Consortium Launched at Second Platform Cooperativism Conference". Shareable. Retrieved 10 December 2016. ^ Sharp, Darren (16 November 2016). "Contributors - Platform Cooperativism Consortium". Shareable. Retrieved 10 December 2016. ^ a b "Directory". The Internet of Ownership. Archived from the original on 26 November 2016. Retrieved 10 December 2016. ^ "Events". The Internet of Ownership. Archived from the original on 25 October 2016. Retrieved 10 December 2016. ^ Schneider, Nathan (29 September 2016). "Here's my plan to save Twitter: let's buy it". The Guardian. Retrieved 12 December 2016. ^ Srnicek, Nick (2017). Platform Capitalism. New York City: Polity. p. 127. ^ Information Coops: Collective Funding of Information Goods from Software to Medicines ^ Morozov, Evgeny (3 December 2016). "Data populists must seize our information – for the benefit of us all". The Guardian. Retrieved 12 December 2016. ^ Sundararajan, Arun (2016). The Sharing Economy: The End of Employment and the Rise of Crowd-Based Capitalism. Cambridge: MIT Press. p. 197. ^ Sundararajan, Arun (2016). The Sharing Economy: The End of Employment and the Rise of Crowd-Based Capitalism. Cambridge: MIT Press. p. 198. v t e Sharing economy Companies Transportation AloPeyk BlaBlaCar Beat Bolt Bykea DiDi 99 Fasten Free Now Gett Gojek Grab inDriver KakaoTaxi Lyft Ola Cabs Snapp Swvl Turo Uber Careem Via Wingly Waymo Yourdrive Pathao Yandex.Taxi TAPSI Hospitality For-profit Airbnb CouchSurfing Non-profit BeWelcome Pasporta Servo Servas International Trustroots Warm Showers Project funding GoFundMe Indiegogo Kickstarter Patreon Retail Craigslist MercadoLibre Vinted Kijiji Music and film Sofar Sounds Tudou Services and freelancing Pickle TaskRabbit Thumbtack Swap and renting Erento The Freecycle Network Streetbank Tourism ToursByLocals Withlocals Concepts Social peer-to-peer processes Peer-to-peer banking Peer-to-peer carsharing Peer-to-peer lending Peer-to-peer ridesharing Barter Bicycle-sharing system Blockchain Book swapping Borrowing center Decentralization Carpool Carsharing Clothing swap Co-living Collaborative consumption Crowdfunding Crowdsourcing Expert network Flight sharing Garden sharing Home exchange Homestay Open innovation Platform cooperative Platform economy Product-service system Reuse Ridesharing company Scooter-sharing system Tool library Two-sided market Uberisation Upcycling Wiki Labour India Indian Federation of App-based Transport Workers United States National Taxi Workers' Alliance (NY) Rideshare Drivers United (CA) Retrieved from "https://en.wikipedia.org/w/index.php?title=Platform_cooperative&oldid=1038686735" Categories: Cooperatives Sharing economy Business models Hidden categories: CS1 maint: archived copy as title CS1 errors: missing title CS1 errors: bare URL All articles with dead external links Articles with dead external links from May 2020 Articles with permanently dead external links Articles with short description Short description matches Wikidata Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Ελληνικά Español Français Bahasa Indonesia Italiano Português Suomi Edit links This page was last edited on 14 August 2021, at 02:53 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-6889 ---- The Duchess of Duke Street - Wikipedia The Duchess of Duke Street From Wikipedia, the free encyclopedia Jump to navigation Jump to search Television series This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "The Duchess of Duke Street" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this template message) The Duchess of Duke Street Genre Drama Created by John Hawkesworth Starring Gemma Jones Christopher Cazenove Victoria Plucknett John Cater John Welsh Richard Vernon Theme music composer Alexander Faris Country of origin United Kingdom No. of series 2 No. of episodes 31 Production Running time 50 minutes Release Original network BBC1 Original release 4 September 1976 (1976-09-04) – 24 December 1977 (1977-12-24) The Duchess of Duke Street is a BBC television drama series set in London between 1900 and 1925. It was created by John Hawkesworth, previously the producer of the ITV period drama Upstairs, Downstairs.[1] It starred Gemma Jones as Louisa Leyton Trotter, the eponymous "Duchess" who works her way up from servant to renowned cook to proprietrix of the upper-class Bentinck Hotel in Duke Street, St. James's, in London.[2] The story is loosely based on the real-life career of Rosa Lewis (née Ovenden), the "Duchess of Jermyn Street", who ran the Cavendish Hotel in London, which still stands, at the corner of Duke St, St. James’s'.[3] When the show first aired, there were many people who still remembered her, as she lived until 1952.[4] According to census returns, she was born in Leyton, Essex, to a watchmaker. In the series, Louisa's family name is Leyton, and her father is a clockmaker. The programme lasted for two series totalling 31 episodes, shown in 1976 and 1977. Shown later on PBS in the United States, it was nominated for an Emmy Award for Outstanding Limited Series in 1980.[5] The theme music was composed by Alexander Faris.[6] Contents 1 Plot summary 2 Cast 3 Episodes 3.1 Series 1 3.2 Series 2 4 References 5 External links Plot summary[edit] Beautiful but low-born Louisa Leyton (Gemma Jones) has one driving ambition: to become a great cook. She finds employment as a cook in the household of Lord Henry Norton (Bryan Coleman). His handsome, wealthy, aristocratic nephew, Charlie Tyrrell (Christopher Cazenove), attempts to seduce her, but she rebuffs him, refusing to be sidetracked from her ambition to become the best cook in London. Louisa manages to convince Lord Norton's sexist French chef, Monsieur Alex (George Pravda), into accepting her as his apprentice. The main characters (from left to right): Charles Tyrrell, Louisa Trotter, Major Smith-Barton, Merriman, Starr, Mary. When Louisa is unexpectedly called upon to prepare a dinner by herself, she catches the eye of one of the guests, Edward, the Prince of Wales (Roger Hammond), who admires both her cooking and her appearance. After the dinner, Louisa is pressured into becoming Edward's mistress. Against her own wishes, she agrees to marry Lord Norton's head butler, Augustus 'Gus' Trotter (Donald Burton), to maintain the appearance of respectability and to protect the royal reputation. Gus and Louisa are given a house, and her involvement with the prince commences. In time, Edward's mother, Queen Victoria, dies leaving Edward to assume the throne as King Edward VII and causing him to end his relationship with Louisa. Louisa's shaky marriage to Gus becomes strained, both from her affair with the prince and her great success as a chef. In an effort to help him recover his pride, Louisa purchases the Bentinck Hotel and talks a reluctant Gus into managing it. Before long, abetted by his sister, he lets the authority go to his head. His arrogance alienates the staff and, more importantly, the guests. Once Louisa discovers that he has lavishly entertained his friends and driven away the guests, she throws both him and his meddling sister out. Then she discovers, to her horror, the mountain of bills he has left unpaid. With only Mary, one of Lord Norton's servants, to assist her, she sets to work to pay the debts, taking any and all cooking jobs, however humble, but finally she collapses, exhausted from overwork, in the street very early one morning. Charlie Tyrrell is passing by (leaving a late-night assignation) and takes her back to the Bentinck. Once he learns of Louisa's financial woes, he convinces her to allow him to help her to the extent that he becomes a silent partner in the hotel. Louisa keeps one of the Bentinck's previous employees, the elderly head waiter Merriman (John Welsh). She hires the brisk, soldierly Starr (John Cater), who is always accompanied by his dog Fred, as the porter. From their former employer, Louisa takes along her loyal Welsh assistant and friend Mary (Victoria Plucknett). (In the final episode, Starr and Mary get engaged.) Rounding out the principal cast is Major Toby Smith-Barton (Richard Vernon), an upper-class, retired Army officer. The Major enjoys wagering on the horse races and ends up unable to pay his hotel bill. Reluctant to "toss him out on the street" and liking the man, Louisa offers the Major a position: general adviser, bellhop and greeter. Charlie and Louisa eventually have a very passionate romance. Infatuated with Charlie, Louisa begins to neglect both the hotel and her cooking. Recognizing what is happening, the Major steps in and has a discreet word with Charles. Knowing how much the establishment means to Louisa, Charlie leaves for an extended stay in America, giving Louisa a chance to refocus on her business. Grief-stricken at first, Louisa eventually regains her balance and makes the Bentinck a great success, only to discover that she is pregnant. Eventually, Louisa secretly gives birth to their illegitimate daughter Lottie (Lalla Ward). Louisa accepts Charlie's suggestion that Lottie be discreetly adopted by a young couple who work on his estate. Later, Charlie and Louisa agree it is best they remain friends, not lovers. Upon the death of his father, Charlie inherits the family fortune and the title of Lord Haslemere. With Louisa's approval, Charlie marries another woman. He tells Louisa that if his marriage has any hope of working, he will have to be away from her. However, when Charlie's wife later dies, he and Louisa renew their relationship. They decide to postpone their wedding until the end of the First World War. Tragically, Charlie dies of a head injury received while fighting in the trenches. Louisa is grief-stricken, but gradually recovers. Louisa informs the teenage Lottie the identity of her true parents. Lottie accepts her mother's offer to take her to London. Louisa, not quite knowing what to do with her, eventually sends her to a Swiss finishing school to become a lady. When Lottie returns, she has her heart set on being a singer instead. Louisa's parents occasionally make an appearance. She is on very good terms with her ineffectual, but loving father (John Rapley), but not with her critical, abrasively selfish mother (June Brown). Late in the series, Louisa's father dies, but not before giving his modest savings to his granddaughter to help her pursue her singing career. Louisa becomes reconciled to Lottie's career choice. Cast[edit] Gemma Jones as Louisa Trotter (née Leyton) Victoria Plucknett as Mary John Welsh as Merriman John Cater as Starr Richard Vernon as Major Smith-Barton Christopher Cazenove as Charles "Charlie" Tyrrell, later Lord Haslemere Mary Healey as Mrs. Cochrane, Louisa's head cook at the Bentinck Doreen Mantle as Mrs Catchpole, Lord Henry's housekeeper Sammie Winmill as Ethel, a maid at the Bentinck Holly De Jong as Violet, another maid Donald Burton as Augustus Trotter June Brown as Mrs. Violet Leyton John Rapley as Mr. Ernest Leyton Lalla Ward as Lottie, Louisa's daughter. (Ward is only eight years and six months younger than Gemma Jones. Philippa Shackleton played Lottie as a child in one episode.) Bryan Coleman as Lord Henry Norton, Louisa's employer for part of the first series, beginning in the first episode Christine Pollon as Aunt Gwyneth, Mary's aunt and occasional seamstress at the Bentinck George Pravda as Monsieur Alex Roger Hammond as the Prince of Wales, later King Edward VII Martin Shaw as Arthur, Louisa's brother Joanna David as Lady Margaret Hazlemere Episodes[edit] Series 1[edit] No. in series No. in season Title Directed by Written by Original air date 1 1 "A Present Sovereign" Bill Bain John Hawkesworth 4 September 1976 (1976-09-04) Wishing to learn to be an excellent cook, outspoken and ambitious Louisa Leyton is hired as assistant to Monsieur Alex, a French chef working in the London home of Lord Henry Norton. Resented by other kitchen staff, Louisa bonds with Mary, the target of their frequent malice, forms a friendship with head butler Gus Trotter, and fends off the attentions of the aristocratic Charlie Tyrrell. When Lord Henry unexpectedly returns during Monsieur Alex's holiday, she must cook dinner for a group that includes the Prince of Wales. 2 2 "Honour and Obey" Cyril Coke John Hawkesworth and Jeremy Paul 11 September 1976 (1976-09-11) When the Prince of Wales asks to borrow Louisa's services as a cook, it turns out that more than her cooking appeals to him. To preserve appearances, she is pressured into marrying Gus Trotter, who has fallen in love with her, even though she does not return his feelings. The newly married couple leave the Nortons' service for the house provided for them. 3 3 "A Nice Class of Premises" Bill Bain David Butler and John Hawkesworth 18 September 1976 (1976-09-18) The death of Queen Victoria ends Louisa's relationship with the Prince, now King Edward VII, forcing the Trotters to face their future together. Under the influence of his resentful sister, Nora, Gus wants to take in lodgers to make ends meet. Instead, over his objections, Louisa sets out to rebuild her career as a chef, taking on Mary as her assistant. When Gus's drinking begins leading him into indiscretion, Louisa buys the Bentinck Hotel in Duke Street and installs him as manager, with disastrous results. 4 4 "The Bargain" Cyril Coke John Hawkesworth and Jack Rosenthal 25 September 1976 (1976-09-25) After throwing Gus and Nora out of the hotel, Louisa sets to work to repay the debts they have allowed to accumulate with the assistance of Mary and the hotel's long-serving, aged head waiter, Merriman. When Louisa collapses from overwork, Charlie Tyrrell steps in and becomes a silent investor in the hotel in return for a permanent private suite. 5 5 "A Bed of Roses" Bill Bain John Hawkesworth 2 October 1976 (1976-10-02) Equipped with hall porter Starr and his dog, Fred, the newly refurbished Bentinck reopens and, under Louisa's management, becomes a success as long-term guests such as the Major take up residence until her developing friendship with Charlie begins to put the Bentinck at risk. When Charlie leaves for America to see his dying father, Louisa regains her focus on the business - only to discover she is pregnant. Leaving Mary in charge, she goes into hiding to have the baby, a girl she names Charlotte. Charlie, now Lord Haslemere, finds the baby a place with a childless couple on his estate. 6 6 "For Love or Money" Raymond Menmuir John Hawkesworth 9 October 1976 (1976-10-09) A visiting German baron claiming to be a friend of Lord Haslemere's creates trouble at the Bentinck with some of the other guests. 7 7 "A Lady of Virtue" Cyril Coke John Hawkesworth and Jeremy Paul 16 October 1976 (1976-10-16) When the Liberals celebrate a by-election result at the Bentinck, a politically ambitious MP at the party sets out to seduce a visiting artist believed to be incorruptibly devoted to her husband. 8 8 "Trouble and Strife" Raymond Menmuir John Hawkesworth and Jeremy Paul 23 October 1976 (1976-10-23) While Louisa takes a holiday in France, Starr's estranged former common-law wife, Lizzie, blackmails him into helping her get a job as laundry maid at the Bentinck. Starr finally confides in the Major after money is found missing from a hotel guest's room. 9 9 "The Outsiders" Simon Langton John Hawkesworth and Rosemary Anne Sisson 30 October 1976 (1976-10-30) Charlie pushes Louisa to accept as a hotel guest an obviously mismatched unassuming man. Seeing that Charlie is at loose ends, Louisa arranges for an art dealer to include his paintings in a gallery show, where he discovers the difference between being an amateur and being a genuine talent. 10 10 "Lottie's Boy" Cyril Coke John Hawkesworth and Julia Jones 6 November 1976 (1976-11-06) Mary's disapproving Aunt Gwyneth, the servants' ball, and attentive guest Marcus Carrington sow dissent between Louisa and Mary, whose abrupt departure leaves the hotel in a muddle. Louisa and the Major give their money to Carrington, a risk-taking City whizkid and the son of an old friend of the Major's, to invest in the stock market. 11 11 "No Letters, No Lawyers" Simon Langton Bill Craig and John Hawkesworth 13 November 1976 (1976-11-13) A discontented departing guest's refusal to pay his bill lands him in court and the hotel in the newspapers, to the displeasure of both Louisa and his newspaper publisher uncle, who sends a journalist to work undercover at the hotel. The publicity gives the Bentinck's owners ammunition for their demand to renegotiate Louisa's lease now that the hotel is successful. With the hotel at risk, Louisa is forced to sue the paper for libel, pushing the journalist to unearth the details of her earlier life. 12 12 "A Matter of Honour" Bill Bain Julian Bond and John Hawkesworth 20 November 1976 (1976-11-20) Insufficient staff and a row over a racing result nearly derail a special dinner that the King's newly married former equerry asks Louisa to cook at his Ascot home for a group of guests that includes Charlie Haslemere. 13 13 "One Night's Grace" Cyril Coke John Hawkesworth and Ken Taylor 27 November 1976 (1976-11-27) A mysterious young woman causes dissent between Charlie and Louisa, speculation among the staff, and a visit from the police when she comes to stay with Charlie for a few days. 14 14 "Plain Sailing" Raymond Menmuir John Hawkesworth and Jeremy Paul 4 December 1976 (1976-12-04) Charlie is caught in the middle when Louisa buys a house at Cowes to move her entire operation to the seaside for a few weeks' summer vacation, upsetting the stuffy sailing club next door. Among Louisa's guests is the professional dancer Irene Baker, who develops a close friendship with Charlie. 15 15 "A Test of Love" Bill Bain John Hawkesworth 11 December 1976 (1976-12-11) The funeral of King Edward VII provides the occasion for a visit from Louisa's former employer, Lord Henry Norton. As Charlie Haslemere's sole surviving relative, he tells Louisa it's time for Charlie to marry - and he thinks he's found the right woman. One snag: as soon as Charlie's engagement to Margaret Wormold is announced, Irene Baker sues him for breach of promise of marriage. In the ensuing court case, Louisa and Mertiman are required to testify. Series 2[edit] No. in series No. in season Title Directed by Written by Original air date 16 1 "Family Matters" Bill Bain Julia Jones 3 September 1977 (1977-09-03) When Louisa's brother returns from his travels after a long time away, his doting mother talks her reluctant daughter into hiring him, as the hotel is short-staffed. Arthur soon antagonises the longtime servants, precipitating an ugly family quarrel after Louisa discharges him. 17 2 "Poor Catullus" Cyril Coke Jeremy Paul 10 September 1977 (1977-09-10) Two young men play a prank, sending Louisa love letters purportedly from their Oxford University professor. Louisa and Professor Stubbs soon turn the tables on the tricksters, but she is tempted by his somewhat inebriated offer to take her to America to start a new life. The next morning, however, he remembers nothing of the previous night. Charlie's wife, Margaret, seeks Louisa's help in searching for a house in London. 18 3 "A Lesson in Manners" Cyril Coke Rosemary Anne Sisson 17 September 1977 (1977-09-17) When an elderly but vibrant Bentinck regular guest dies unexpectedly, she surprises everyone by leaving nearly all of her considerable wealth to her attentive chauffeur Prince rather than her indifferent, spendthrift nephew Eddie Sturgess. When Prince considers entering British society, Louisa decides it would be fun to pass him off as a gentleman, under Eddie and the Major's tutelage, despite the latter's warning. The Major is proved right in the end. 19 4 "Winter Lament" Simon Langton Maggie Wadey 24 September 1977 (1977-09-24) Louisa visits the Haslemeres at their country estate and finds that Margaret's strange behaviour is putting a great strain on the marriage. Louisa also sees her daughter Lottie for the first time since giving her up as a baby. Louisa tries her best to help Margaret, but in the end, the disturbed, emaciated woman wanders outside one night and is found dead the next morning. 20 5 "The Passing Show" Bill Bain John Hawkesworth 1 October 1977 (1977-10-01) Louisa rouses Charlie out of his depression after Margaret's death. Meanwhile, Sir Martin Mallory, a famous but aging actor, seduces Violet. When Louisa finds out, she sacks her chambermaid without a reference, forcing the poor girl to try to take up streetwalking. An understanding police inspector persuades Louisa to relent a little and provide a reference and assistance finding more respectable employment. 21 6 "Your Country Needs You" Simon Langton John Hawkesworth 8 October 1977 (1977-10-08) When Great Britain enters the First World War, Louisa is ultra-patriotic, until Charlie joins the Coldstream Guards. The Major returns to active duty. In exchange for getting Starr reinstated in the Army (it was established in Season 1, episode 8 that when Starr was a sergeant in the Sudan Campaign, he caught his young wife with another soldier, and was imprisoned and dishonourably discharged for his subsequent actions), the Major gets Louisa to hire Gaspard, a Belgian refugee. 22 7 "The Patriots" Bill Bain Bill Craig and John Hawkesworth 15 October 1977 (1977-10-15) Autumn 1915. Louisa is cold to shirkers who avoid military service, particularly Bentinck resident Mr. Appleby. A naval intelligence lieutenant uncovers an espionage ring which is reading the correspondence of high-ranking officers who frequent the Bentinck. Gaspard commits suicide to avoid arrest. His confederate, American hotel guest Brewster, is not so quick. Louisa is embarrassed to learn Appleby is also a spy, but for the British. 23 8 "The Reluctant Warrior" Simon Langton John Hawkesworth and Rosemary Anne Sisson 22 October 1977 (1977-10-22) Winter 1916. The hotel sustains minor damage from a Zeppelin bomb attack. Some soldiers are assigned to deal with what may be a buried unexploded bomb very near the Bentinck. Ethel is attracted to one of them, a conscientious objector ("conshie") despised by everyone else. Among Louisa's guests are an 18-year-old and the officer with whom she has eloped. Tired of waiting for a demolitions expert and fed up with the sneers aimed at him, the conshie Clive digs around and finds there is no bomb. He also discovers the body of Fred, Starr's dog. Before Clive leaves, Ethel accepts his engagement ring. (In a later episode, Ethel is a bereaved widow who just wants her Clive back.) 24 9 "Tea and a Wad" Cyril Coke John Hawkesworth 29 October 1977 (1977-10-29) Spring 1917. The hotel is empty as repairs are being made. The Major persuades Louisa to set up a canteen in Boulogne for troops with no place to go while waiting for transportation back to Britain. A helpful soldier eventually confesses to Mary that he is a deserter. She consults the Major, who comes up with a plan to get him out of his predicament. A rival do-gooder creates trouble for Louisa. The general in charge turns out to be a Bentinck regular. Louisa agrees to marry Charlie after the war ends. 25 10 "Shadows" Bill Bain John Hawkesworth and Jeremy Paul 5 November 1977 (1977-11-05) Summer 1918. Louisa opens the Bentinck to recuperating soldiers. Mary is attracted to Brian, one of the convalescents. Charlie receives a head wound and returns to the hotel for a rest. The wound takes a turn for the worse, and he begins to go blind. An eminent brain surgeon advises against surgery so soon after the previous operation. Charlie suddenly dies while sitting Louisa's parlour as she is talking to him. 26 11 "Where There's A Will" Cyril Coke John Hawkesworth and Julia Jones 12 November 1977 (1977-11-12) Louisa is in dire financial straits, but stubbornly refuses to cash the cheques of the soldiers who stayed at her hotel. Grief-stricken over Charlie's death, she decides to sell up the Bentinck. Her father makes her read a letter from Charlie, which gives her renewed resolve to go on. With the money he left her in his will, she sets about restoring the hotel to its former glory. 27 12 "The Legion of the Living" Gerry Mill John Hawkesworth and Maggie Wadey 19 November 1977 (1977-11-19) Louisa returns to the Haslemeres' estate for a memorial service, and the truth of Lottie's parentage is exposed. Louisa offers to take Lottie back to London. 28 13 "Lottie" Bill Bain John Hawkesworth and Jeremy Paul 3 December 1977 (1977-12-03) Louisa tells Mary, Starr, and Merriman Lottie is her daughter. She has the Major show the young woman the sights of London, but inevitably, rumours swirl around her. Brian returns, embittered by the war and irritated by Mary's attempts to help him. He leaves, breaking Mary's heart. Finally, Louisa decides to send her daughter to a Swiss finishing school. 29 14 "Blossom Time" Gerry Mill John Hawkesworth and Jeremy Paul 10 December 1977 (1977-12-10) Lottie returns on a school holiday, bringing with her one of her teachers, Miss Olive Bradford. The Major and Miss Bradford fall in love and become engaged. Lottie falls for a handsome young man, but when she incautiously reveals who her parentage, his interest in her vanishes. 30 15 "Poor Little Rich Girl" Cyril Coke John Hawkesworth and Julia Jones 17 December 1977 (1977-12-17) Louisa and Lottie clash over her future. Lottie is determined to become a singer. She meets her grandfather for the first time. He becomes her ally, giving her his meagre life savings before he dies. Lottie moves in with her grandmother, who tells Louisa she understands Lottie, whereas she could never fathom Louisa. 31 16 "Ain't We Got Fun" Bill Bain John Hawkesworth 24 December 1977 (1977-12-24) Louisa permits an American woman to write her biography, though she insists on final approval of the result. Merriman wins a newspaper contest and samples life, even sauntering into the Bentinck for a drink, before his money runs out and he returns to his usual post. Mary and Starr inform Louisa that they have become engaged. Louisa is furious at first, as she has a policy of not employing married people, but eventually gives in. References[edit] ^ "John Hawkesworth - Telegraph". The Daily Telegraph. London: TMG. 31 October 2003. ISSN 0307-1235. OCLC 49632006. ^ "BFI Screenonline: Hawkesworth, John (1920-2003) Biography". www.screenonline.org.uk. ^ "Rosa Lewis, Cavendish Hotel London, Duchess of Duke Street, Rosa Lewis Hotel London". thecavendish-london.co.uk. 2014. Retrieved 15 May 2014. ^ "4 Reasons To Watch The Duchess of Duke Street - The Duchess of Duke Street - Drama Channel". drama.uktv.co.uk. ^ "The Duchess of Duke Street II Masterpiece Theatre | Television Academy". emmys.com. 2014. Retrieved 15 May 2014. ^ "Alexander Faris, composer of TV theme tunes, obituary". The Independent. 2 October 2015. External links[edit] The Duchess of Duke Street at IMDb v t e Edward VII Family Alexandra of Denmark (wife) Albert Victor, Duke of Clarence and Avondale (son) George V (son) Louise, Princess Royal (daughter) Princess Victoria (daughter) Maud, Queen of Norway (daughter) Queen Victoria (mother) Albert, Prince Consort (father) Events Royal baccarat scandal Coronation Honours Medal Police Medal Coronation cases State funeral Reign Edwardian era Edwardian architecture Prime Ministers Emperor of India Household Namesakes King Edward VII Land King Edward VII-class battleship HMS King Edward VII Hospitals London Falkland Islands Sheffield Schools King Edward VII Academy King Edward VII and Queen Mary School King Edward VII School, Sheffield King Edward VII School, Melton Mowbray King Edward VII School, Johannesburg King Edward VII School, Taiping Eduardo VII Park Prince Albert King Edward VII Stakes Depictions Film and Television The Coronation of Edward VII (1902) "Guest of Honour" (1972) Fall of Eagles (1974) Jennie: Lady Randolph Churchill (1974) Edward the Seventh (1975) The Duchess of Duke Street (1976) Lillie (1978) Mrs Brown (1997) The Lost Prince (2003) Victoria & Abdul (2017) Statues and Memorials King Edward VII Memorial Edward VII Monument Bangalore statue Bootle statue Books The Edwardians (1930) And Having Writ... (1978) Flashman and the Tiger (1999) Stamps Edward VII 2d Tyrian plum Mistresses Agnes Keyser Alice Keppel Daisy Greville Hortense Schneider Lady Susan Vane-Tempest Lillie Langtry Nellie Clifden Patsy Cornwallis-West Honours Royal Family Order Knights Grand Cross of the Royal Victorian Order Knights Commander of the Royal Victorian Order Related Arthur Sassoon Olga de Meyer Lady Randolph Churchill Sarah Bernhardt Homburg hat Caesar (dog) King Edward VII's Town Coach Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Duchess_of_Duke_Street&oldid=1032188786" Categories: BBC television dramas Television series set in the 1900s Television series set in the 1910s Television series set in the 1920s 1976 British television series debuts 1977 British television series endings 1970s British drama television series English-language television shows Television shows set in London Hidden categories: Articles with short description Short description matches Wikidata Use dmy dates from March 2021 Use British English from August 2012 Articles needing additional references from December 2009 All articles needing additional references Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Galego Italiano עברית Edit links This page was last edited on 6 July 2021, at 00:29 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7355 ---- Willie Sutton - Wikipedia Willie Sutton From Wikipedia, the free encyclopedia Jump to navigation Jump to search For the American football player, see Will Sutton. American bank robber Willie Sutton FBI Ten Most Wanted Fugitive Charges Bank robbery Description Born William Francis Sutton Jr. (1901-06-30)June 30, 1901 Brooklyn, New York Died November 2, 1980(1980-11-02) (aged 79) Spring Hill, Florida Status Added March 20, 1950 Caught February 1952 Number 11 Captured William Francis Sutton Jr. (June 30, 1901 – November 2, 1980) was an American bank robber.[1] During his forty-year robbery career he stole an estimated $2 million, and he eventually spent more than half of his adult life in prison and escaped three times. For his talent at executing robberies in disguises, he gained two nicknames, "Willie the Actor" and "Slick Willie". Sutton is also known as the namesake of the so-called Sutton's law, although he denied originating it.[2] Contents 1 Early life 2 Career in crime 3 Personal life and death 4 "Sutton's law" 5 References 6 Further reading 7 External links Early life[edit] Sutton was born into an Irish-American family on June 30, 1901 in Brooklyn, New York to William Francis Sutton Sr., a blacksmith, and Mary Ellen Bowles.[3] His family lived on the corner of Gold and Nassau Streets in the neighborhood of Irishtown, Brooklyn, now called Vinegar Hill. According to his biography, Where the Money Was, at the age of three the family relocated to High Street. His mother was, according to the biography, born in Ireland; however, according to the 1910 U.S. Census, she was born in Maryland and her parents were born in Ireland. By 1910, she had given birth to five children, of whom three were still alive. According to the 1910 Census, his maternal grandfather, James Bowles, and his two maternal uncles were also living with the family. Sutton was the fourth of five children, and did not attend school after the 8th grade.[4][5] Career in crime[edit] Sutton became a criminal at an early age, though throughout his professional criminal career, he did not kill anyone. He was described by Mafioso Donald Frankos as "a little bright-eyed guy, just 5'7" and always talking, chain-smoking ... cigarettes with Bull Durham tobacco." Frankos stated also that Sutton "dispensed mounds of legal advice" to any convict willing to listen. Inmates considered Sutton a "wise old head" in the prison population. When incarcerated at "The Tombs" (Manhattan House of Detention) he did not have to worry about assault because Mafia friends protected him. In conversation with Donald Frankos he would sadly reminisce about the 1920s and 1930s when he was most active in robbing banks and would always tell fellow convicts that in his opinion, during the days of Al Capone and Charles Luciano, better known as Lucky Luciano, the criminals were the bloodiest. Gangsters from the time period, and many incarcerated organized crime inmates, enjoyed having Sutton for companionship. He was witty and non-violent. Frankos declared that Sutton made legendary bank thieves Jesse James and John Dillinger seem like amateurs.[6] Sutton was an accomplished bank robber. He usually carried a pistol or a Thompson submachine gun. "You can't rob a bank on charm and personality," he once observed. In an interview in the Reader's Digest published shortly before his death, Sutton was asked if the guns that he used in his robberies were loaded. He responded that he never carried a loaded gun because somebody might get hurt. He stole from the rich and kept it, though public opinion later made him into a type of gentleman thief, like Robin Hood. He allegedly never robbed a bank when a woman screamed or a baby cried.[7] Sutton was captured and recommitted in June 1931, charged with assault and robbery. He failed to complete his 30-year sentence however, escaping on December 11, 1932, using a smuggled gun and holding a prison guard hostage. With the guard as leverage, Sutton acquired a 45-ft (13.5 meter) ladder to scale the 30-ft (9 meter) wall of the prison grounds.[8] On February 15, 1933, Sutton attempted to rob the Corn Exchange Bank and Trust Company in Philadelphia, Pennsylvania. He came in disguised as a postman, but an alert passerby foiled the crime. Sutton escaped. On January 15, 1934, he and two companions broke into the same bank through a skylight.[citation needed] The FBI record observes: Sutton also conducted a Broadway jewelry store robbery in broad daylight, impersonating a postal telegraph messenger. Sutton's other disguises included a police officer, messenger and maintenance man. He usually arrived at banks or stores shortly before they opened for business. Sutton was apprehended on February 5, 1934, and was sentenced to serve 25 to 50 years in the Eastern State Penitentiary in Philadelphia, Pennsylvania, for the machine gun robbery of the Corn Exchange Bank. On April 3, 1945, Sutton was one of 12 convicts who escaped the institution through a tunnel. The convicts broke through to the other side during daylight hours, and were spotted immediately by a passing police patrol. The 12 men were forced to quickly flee the scene, with all being quickly apprehended.[9] Sutton was recaptured the same day by Philadelphia police officer Mark Kehoe. Sentenced to life imprisonment as a fourth time offender, Sutton was transferred to the Philadelphia County Prison, Holmesburg section of Philadelphia, Pennsylvania. On February 10, 1947, Sutton and other prisoners dressed as prison guards carried two ladders across the prison yard to the wall after dark. When the prison's searchlights hit him, Sutton yelled, "It's all right!" No one stopped him.[2] On March 20, 1950, Sutton was the eleventh listed of the FBI's FBI Ten Most Wanted Fugitives, created only a week earlier, on March 14.[citation needed] During February 1952, Sutton was captured by police after having been recognized on a subway and followed by Arnold Schuster, a 24-year-old Brooklyn clothing salesman and amateur detective. Schuster later appeared on television and described how he had assisted in Sutton's apprehension. Albert Anastasia, Mafia boss of the Gambino crime family, disliked Schuster because he was a "rat" and a "squealer". According to Mafia renegade and first major government informant, Joe Valachi, Anastasia ordered the murder of Schuster, who was then shot dead outside his home on March 9, 1952. Judge Peter T. Farrell presided over a 1952 trial in which Sutton was convicted of the 1950 robbery of $63,942 (equal to $687,797 presently) from a bank of the Manufacturers Trust Company in Sunnyside, Queens. He received a sentence of 30 to 120 years in Attica State Prison.[10] Sutton in 1966 In December of 1969, Farrell ruled that Sutton's good behavior, along with his deteriorating health, justified commuting his sentence to time served. At the hearing Sutton responded, "Thank you, your Honor. God bless you," and wept as he was led out of the court building. During 1970, a separate 30-years-to-life sentence given in Brooklyn during 1952[clarify][11] After his release, Sutton delivered lectures on prison reform and consulted with banks on theft-deterrent techniques. He made a television commercial for New Britain Bank and Trust Company in Connecticut for their credit card with picture identification on it. His lines were, "They call it the 'face card.' Now when I say I'm Willie Sutton, people believe me."[12] Personal life and death[edit] Sutton married Louise Leudemann in 1929. She divorced him while he was in jail. Their daughter Jeanie was born the next year. His second wife was Olga Kowalska, whom he married during 1933. His longest period of (legal) employment lasted for 18 months.[citation needed] A series of decisions by the United States Supreme Court during the 1960s resulted in his release on Christmas Eve, 1969, from Attica State Prison. He was in ill health at the time, suffering from emphysema and in need of an operation on the arteries of his legs.[citation needed] Sutton died in 1980 at the age of 79; before this, he had spent his last years with his sister in Spring Hill, Florida.[13] He frequented the Spring Hill Restaurant where he kept to himself. After Sutton's death, his family arranged a quiet burial in Brooklyn in the family plot. "Sutton's law"[edit] Main article: Sutton's law A famous apocryphal story is that Sutton was asked by reporter Mitch Ohnstad why he robbed banks. According to Ohnstad, he replied, "Because that's where the money is". The quote evolved into Sutton's law, which is often invoked to medical students as a metaphor for emphasizing the most likely diagnosis, rather than wasting time and money investigating every conceivable possibility. In his autobiography, Sutton denied originating the pithy rejoinder: The irony of using a bank robber's maxim as an instrument for teaching medicine is compounded, I will now confess, by the fact that I never said it. The credit belongs to some enterprising reporter who apparently felt a need to fill out his copy. I can't even remember where I first read it. It just seemed to appear one day, and then it was everywhere. If anybody had asked me, I'd have probably said it. That's what almost anybody would say ... it couldn't be more obvious. However, he also said: Why did I rob banks? Because I enjoyed it. I loved it. I was more alive when I was inside a bank, robbing it, than at any other time in my life. I enjoyed everything about it so much that one or two weeks later I'd be out looking for the next job. But to me the money was the chips, that's all.[2] The Redlands Daily Facts published the earliest documented example of Sutton's law on March 15, 1952 in Redlands, California.[14] A corollary, the "Willie Sutton rule," used in management accounting, stipulates that activity-based costing (in which activities are prioritized by necessity, and budgeted accordingly) should be applied where the greatest costs occur, because that is where the greatest savings can be found.[15] References[edit] ^ "Willie Sutton". Federal Bureau of Investigation. Retrieved 2020-10-12. ^ a b c Sutton W, Linn E: Where the Money Was: The Memoirs of a Bank Robber. Viking Press (1976), p. 160. ISBN 067076115X ^ Henstell, Bruce (1999). "Sutton, Willie (1901-1980), bank robber". American National Biography (online ed.). New York: Oxford University Press. doi:10.1093/anb/9780198606697.article.2001447. (subscription required) ^ 1905 N.Y.S. Census ^ 1910 U.S. Census ^ Hoffman, William; Headley, Lake (1992). Contract Killer: The Explosive Story of the Mafia's Most Notorious Hitman -- Donald "Tony the Greek" Frankos. New York City: Thunder's Mouth Press. pp. 116–118. ISBN 9781560250456. ^ Walsh, Anthony; Jorgensen, Cody (2017). Criminology: The Essentials. SAGE Publications. ISBN 9781506372020. ^ "Sing Sing's notorious escapes". ^ Linn, Edward; Sutton, William (2004). Where the Money Was: The Memoirs of a Bank Robber (Library of Larceny). Broadway Books. ISBN 9780767916325. ^ Pace, Eric (November 10, 1992). "Peter T. Farrell, 91; Judge Who Presided At the Sutton Trial". The New York Times. Accessed October 11, 2009. ^ Staff (December 2, 1969). "A Jail Term Lifted, Sutton Cries In Joy". The New York Times. ^ "Business: Willie Sutton, Bankers' Friend". Time. October 26, 1970. ^ Lawrence Block (2004). Gangsters, Swindlers, Killers, and Thieves: The Lives and Crimes of Fifty American Villains. OUP USA. p. 219. ISBN 0195169522. ^ Mikkelson, David (November 14, 2008). "Willie Sutton – 'That's Where the Money Is'". Snopes. Retrieved July 28, 2015. ^ Cost and Effect, Kaplan, R.S. and Cooper, R., Harvard Business School Press, Boston MA, 1998, ISBN 0-87584-788-9 Further reading[edit] Hoffman, William; Headley, Lake (1992). Contract Killer: The Explosive Story of the Mafia's Most Notorious Hitman -- Donald "Tony the Greek" Frankos. New York City: Thunder's Mouth Press. ISBN 9781560250456. Moehringer, JR. Sutton. Thorndike Press (2012). ISBN 1410451119. (Biography) Duffy, Peter (February 17, 2002). "Willie Sutton, Urbane Scoundrel". New York Times. External links[edit] FBI website entry on William Sutton 'Willie Sutton Is Dead At 79', New York Times obituary, November 19, 1980 Authority control General ISNI 1 VIAF 1 WorldCat National libraries United States Netherlands Other Faceted Application of Subject Terminology Retrieved from "https://en.wikipedia.org/w/index.php?title=Willie_Sutton&oldid=1035998138" Categories: FBI Ten Most Wanted Fugitives 1901 births 1980 deaths 20th-century American criminals American bank robbers American people convicted of assault American people convicted of robbery American people of Irish descent Bank robbers Criminals from New York (state) Deaths from emphysema Disease-related deaths in Florida Fugitives People from Brooklyn People from Spring Hill, Florida Sing Sing Hidden categories: Pages containing links to subscription-only content Articles with short description Short description matches Wikidata All articles with unsourced statements Articles with unsourced statements from March 2014 All Wikipedia articles needing clarification Wikipedia articles needing clarification from December 2020 Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with NTA identifiers Wikipedia articles with FAST identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Deutsch Español עברית Русский Tiếng Việt Edit links This page was last edited on 28 July 2021, at 21:52 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7577 ---- In Our Time (short story collection) - Wikipedia In Our Time (short story collection) From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 Ernest Hemingway collection 1924 Three Mountains Press Paris edition of in our time 1925 Boni & Liveright New York edition of In Our Time In Our Time is Ernest Hemingway's first collection of short stories, published in 1925 by Boni & Liveright, New York. Its title is derived from the English Book of Common Prayer, "Give peace in our time, O Lord". The collection's publication history was complex. It began with six prose vignettes commissioned by Ezra Pound for a 1923 edition of The Little Review; Hemingway added twelve more and in 1924 compiled the in our time edition (with a lower-case title), which was printed in Paris. To these were added fourteen short stories for the 1925 edition, including "Indian Camp" and "Big Two-Hearted River", two of his best-known Nick Adams stories. He composed "On the Quai at Smyrna" for the 1930 edition. The stories' themes – of alienation, loss, grief, separation – continue the work Hemingway began with the vignettes, which include descriptions of acts of war, bullfighting and current events. The collection is known for its spare language and oblique depiction of emotion, through a style known as Hemingway's "theory of omission" (iceberg theory). According to his biographer Michael Reynolds, among Hemingway's canon, "none is more confusing ... for its several parts – biographical, literary, editorial, and bibliographical – contain so many contradictions that any analysis will be flawed."[1] Hemingway's writing style attracted attention, with literary critic Edmund Wilson saying it was "of the first distinction";[2] the 1925 edition of In Our Time is considered one of Hemingway's early masterpieces.[3] Contents 1 Background and publication history 1.1 The Little Review 1.2 in our time 1.3 In Our Time 2 Contents 2.1 1924 edition 2.2 1925 edition 3 Structure 4 Themes 5 Style 6 Reception and legacy 7 References 8 Sources 9 External links Background and publication history[edit] E. O. Hoppé's 1920 photograph of Ezra Pound, taken two years before the poet taught Hemingway to write in the imagist style Hemingway was 19 years old when in 1918, shortly after he was posted to the Italian Front as a Red Cross ambulance driver, he sustained a severe wound from mortar fire. For the next six months, he recuperated in a Milan hospital, where he fell in love with nurse Agnes von Kurowsky. Shortly after his return to the US, she informed him that she was engaged to an Italian officer. Soon after, he turned to journalism.[4] A few months after marrying Hadley Richardson in 1921, he was posted to Paris as international correspondent for the Toronto Star, reporting on the Greco-Turkish War and sporting events in Spain and Germany.[5] In Paris he befriended Gertrude Stein, Ezra Pound, F. Scott Fitzgerald, James Joyce, Ford Madox Ford, and John Dos Passos,[6] establishing a particularly strong friendship with Pound.[7] Pound's influence extended to promoting the young author, placing six of Hemingway's poems in the magazine Poetry.[7] In August he asked Hemingway to contribute a small volume to the modernist series he was editing, and Bill Bird was publishing for his Three Mountains Press, which Pound envisioned as the "Inquest into the state of the modern English language".[7] Pound's commission turned Hemingway's attention toward fiction, and had profound consequences on his development as a writer.[7] Hemingway and his wife Hadley on winter holiday in Chamby (Montreux), 1922 On December 2, 1922, nearly all of Hemingway's early writing – his juvenilia and apprentice fiction, including the duplicates – was lost.[8][9] He had been sent on assignment to cover the Conference of Lausanne, leaving Hadley, who was sick with a cold, behind in Paris. In Lausanne he spent days covering the conference, and the evenings drinking with Lincoln Steffens.[10] Before setting off to meet him in Switzerland, thinking he would want to show his work to Steffens, Hadley packed all his manuscripts into a valise which was subsequently stolen at Gare de Lyon train station.[11] Although angry and upset, Hemingway went with Hadley to Chamby (Montreux) to ski, and apparently did not post a reward for the recovery of the valise.[9] An early story, "Up in Michigan", survived the loss because Gertrude Stein had told him it was unprintable (in part because of a seduction scene), and he had stuffed it in a drawer.[12] A month later in a letter to Pound, he mentioned that "You, naturally, would say, "Good" etc. But don't say it to me. I ain't reached that mood."[13] In his reply, Pound pointed out that Hemingway had only lost "the time it will ... take you to rewrite the parts you can remember ... If the middle, i.e., FORM, of the story is right then one ought to be able to reassemble it from memory ... If the thing wobbles and won't reform ... then it never wd. have been right."[14] Critics are uncertain whether he took Pound's advice and re-created existing stories or whether everything he wrote after the loss of the suitcase was new.[8] The Little Review[edit] In February 1923, Hemingway and Hadley visited Italy; in Rapallo they met Pound, who almost certainly commissioned the prose pieces for the literary magazine The Little Review during their visit.[7] Still upset at the loss of his work, Hemingway had not written since the previous December,[8] but he slowly wrote six new paragraphs, submitting them for the March deadline.[7][15] Hemingway scholar Milton Cohen says at that point Hemingway knew the pieces for The Little Review would "govern the remainder of the book that Pound had commissioned."[16] The six prose pieces ranged from 75 to 187 words and were about war and bullfighting.[17] The battle scenes came from the experiences of Hemingway's friend Chink Dorman-Smith who was at the Battle of Mons; the matador story originated from another friend, Mike Strater. Hemingway himself witnessed the events which inspired the story about the Greco-Turkish War. The last of the series was taken from news of the execution of six Greek cabinet ministers during the Trial of the Six.[18] The Little Review's "Exiles" edition, scheduled to be published in the spring, was finally released in October 1923, leading with Hemingway's work. It featured pieces from modernists such as Gertrude Stein, George Antheil, E. E. Cummings and Jean Cocteau. Hemingway's vignettes were titled "In Our Time", suggesting a cohesive set.[19] in our time[edit] In June 1923, Hemingway took Hadley, with Robert McAlmon and Bird, to Spain where he found a new passion with his first visits to the bullfights.[20] During the summer he wrote five new vignettes (chapters 12–16), all about bullfighting,[21] finishing the last two on his return to Paris in August.[22] That summer he also honed new narrative techniques in chapters 7–11.[20] In August he reported to Pound that he was about to begin the last two pieces (chapters 17 and 18),[21] implemented revisions that Pound suggested, and sent the manuscript to Bill Bird. Then he left Paris with Hadley (who was pregnant with their first child) for Toronto,[23] where he was living when Bird finished producing the book.[24] Hemingway's 1923 passport photograph The pieces he submitted to Bird were at first untitled (Pound called the submission Blank);[25] later the title in our time – from the Book of Common Prayer – was chosen.[26] Bird printed the volume on a hand-press with handmade paper, telling Hemingway, "I'm going to pull something really fancy with your book".[23] The book contained eighteen vignettes[27] and only thirty-one pages; each one was laid out with plenty of white space, highlighting the brevity of the prose. According to Cohen, the "visual suddenness intensifies its narrative abruptness, heightens the shock of violence, and the chillingly matter-of-fact tone".[28] The book's presentation was intended as unconventional, with its use of lowercase throughout and lack of quotation marks.[28] When challenged by American editors over the use of lowercase in the titles, Hemingway admitted that it could be seen as "silly and affected".[29] Bird designed the distinctive dust jacket – a collage of newspaper articles in four languages[30] – to highlight that the vignettes carried a sense of journalism or news.[31] The frontispiece is a woodcut portrait of the author, which during the printing process bled through to the next page, ruining more than half the print run so that only 170 of the 300 copies printed were deemed suitable to sell. The rest were sent to reviewers and friends.[24] In Our Time[edit] A year later Hemingway was back in Paris, where he wrote some of his best short stories and told Scott Fitzgerald that, of the new material, "Indian Camp" and "Big Two-Hearted River" were superior.[32] Over the next six months, one of his most productive periods according to critic Jackson Benson, he wrote eight short stories.[33] The stories were combined with the earlier vignettes and sent to Boni & Liveright in New York toward the end of the year.[25] In March he was in Schruns, Austria when the acceptance cable and $100 advance arrived, with a request to option his next two books. Directly afterward, he received a letter from Max Perkins of Scribner's, who had read Bird's Paris edition and thought it lacked commercial appeal, and queried whether the young writer had stories to offer to bolster the collection. In his reply, Hemingway explained that he had already entered a contract with Boni & Liveright.[34] When he received the contract for the book, Boni & Liveright requested that "Up in Michigan" be dropped for fear it might be censored; in response Hemingway wrote "The Battler" to replace the earlier story.[35] The 1925 New York edition contained the fourteen short stories with the vignettes interwoven as "interchapters".[8] Boni & Liveright published the book on October 5, 1925,[36] with a print-run of 1335 copies, costing $2 each,[17] which saw four reprints.[37] The firm designed a "modish" dust jacket, similar to the Paris edition, and elicited endorsements from Ford Madox Ford, Gilbert Seldes, John Dos Passos, and Donald Ogden Stewart. Boni & Liveright claimed American copyright for the works published in France.[38] Hemingway was disappointed with the publisher's marketing efforts,[39] and that December he complained to Boni & Liveright about their handling of the book, citing a lack of advertising, claiming they could have had "20,000 in sales" and that he should have requested a $1000 advance.[40] He later broke his contract with the firm, signing with Max Perkins at Scribner's the following year.[39] Scribner's bought the rights from Boni & Liveright,[41] releasing the second American edition on October 24, 1930, which saw one reprint.[37] The Scribner's edition included an introduction by Edmund Wilson and Hemingway's "Introduction by the Author", which was renamed as "On the Quai at Smyrna" in the 1938 publication of The Fifth Column and the First Forty-Nine Stories.[42] When In Our Time was re-issued in 1955, "On the Quai at Smyrna" replaced "Indian Camp" as the first story.[43] Contents[edit] 1924 edition[edit] Nick sat against the wall of the church where they had dragged him to be clear of machine-gun fire in the street. Both legs stuck out awkwardly. He had been hit in the spine. The day was very hot. Rinaldi, big-backed, his equipment sprawling, lay face downward against the wall ... The pink wall of the house opposite had fallen out from the roof ... Two Austrian dead lay in the rubble in the shade of the house. Up the street were other dead. Things were getting forward in the town. —Ernest Hemingway, "Chapter 7", in our time[44] The 1924 in our time collection consists of eighteen vignettes.[17] Five center on World War I (Chapters 1, 4, 5, 7, 8), and six on bullfighting (Chapters 2 and 12 to 16); the others center around news stories.[45] Chapter 10 is the longest; it details a soldier's affair with a Red Cross nurse,[46] and is based on Hemingway's relationship with Agnes von Kurowsky.[47] The piece about a robbery and murder in Kansas City originated in a newspaper story Hemingway covered as a cub reporter at The Kansas City Star;[45] it is followed by the story of the public hanging of the Chicago mobster Sam Cardinelli. The last, "L'Envoi", is about the King of Greece and Sophia of Prussia giving an interview in the palace garden during the Revolution.[22] 1925 edition[edit] The 1925 New York edition begins with the short stories "Indian Camp" and "The Doctor and the Doctor's Wife". The two are linked thematically; they are set in Michigan and introduce Nick Adams. Nick witnesses an emergency caesarean section and a suicide in the first; the tension between his parents in the second. The next story, "The End of Something", is also set in Michigan, and details Nick's break-up with his girlfriend; "The Three-Day Blow" follows, where Nick and a friend get drunk. "The Battler" is about Nick's chance encounter with a prize-fighter. "A Very Short Story", which was the longest vignette in the previous edition, comes next and is followed by "Soldier's Home", set in Oklahoma, and "The Revolutionist", set in Italy. The next three are set in Europe and detail unhappy marriages: "Mr. and Mrs. Elliot", "Cat in the Rain" and "Out of Season". They are placed before Nick's reappearance in "Cross Country Snow", which takes place in Switzerland. The penultimate "My Old Man" concerns horse-racing in Italy and Paris, and the volume ends with the two-part Nick Adams story "Big Two-Hearted River", set in Michigan. The vignettes were re-ordered and placed between the short stories as interchapters.[45] Structure[edit] Whether the collection has a unified structure has been a source of debate among Hemingway critics. According to Reynolds the collection should be "read as a predictable step in any young author's career" and the pieces considered as "discrete units".[1] Yet he admits that Hemingway's remarks, and the complexity of the structure, suggests the stories and vignettes were meant to be an interconnected whole.[6] In a letter to Pound in August 1923, Hemingway told him he had finished the full set of eighteen vignettes, saying of them, "When they are read together, they all hook up ... The bulls start, then reappear, then finish off. The war starts clear and noble just like it did ... gets close and blurred and finished with the feller who goes home and gets clap."[48] He went on to say of "in our time" that "it has form all right".[49] On October 18, 1924, he wrote to Edmund Wilson, "Finished the book of 14 stories with a chapter of 'In Our Time' between each story – that is the way they are meant to go – to give the picture of the whole before examining it in detail".[50] Benson notes that all the fiction Hemingway had produced was included in the collection, that the connection between stories and vignettes is tenuous at best, and that Pound had an influence in editing the final product.[51] Benson calls the work a "prose poem of terror", where looking for connections is meaningless.[52] Conversely, Linda Wagner-Martin suggests the unrelenting tone of horror and somber mood unify the separate pieces.[53] One of its early reviewers, D. H. Lawrence, referred to it as a "fragmentary novel".[54] Ernest Hemingway in a Milan hospital, 1918. The 19-year-old author is recovering from World War I shrapnel wounds. Hemingway scholar Wendolyn Tetlow says that from its inception the collection was written with a rhythmic and lyrical unity reminiscent of Pound's "Hugh Selwyn Mauberley" and T.S. Eliot's The Waste Land.[55] The carefully crafted sequence continues in the 1925 edition, beginning with the first five Nick Adams stories, which are about violence and doom, empty relationships and characters lacking self-awareness.[56] The first two stories, "Indian Camp" and "The Doctor and the Doctor's Wife", can be read as an exercise in counterpoint, where feelings of loss, anger, and evil are ignored and repressed. "The End of Something" and "The Three-Day Blow" also form a pair; in the first Nick breaks up with his girlfriend, in the second he gets drunk and denies the relationship has ended, convincing himself that it will all work out. This state of denial continues in "The Battler", the fifth story; when faced with violence Nick will not recognize that he is in danger.[57] "A Very Short Story", about betrayal, and wounding, ends the sequence according to Tetlow, who suggests these are stories in which Hemingway writes about the "most bitter feelings of loss and disillusionment". The characters face loss with inner strength, stoicism and a sense of acceptance; they build strength in the stories that come after,[58] gaining self-awareness as they accept the futility and pain of life.[59] The collection ends with "Big Two-Hearted River", in which Nick finds tranquility, perhaps even happiness, in solitude. Wagner-Martin notes that "it is this essential tranquility that in retrospect heightens the tension and sorrow of the preceding pieces."[53] Another Hemingway scholar, Jim Berloon, disagrees with Tetlow,[60] writing that its only unity consists of similarities in tone and style and the recurrence of the Nick Adams character. Although the first vignettes share a common thread about the war, each is distinctly framed, weakening any structural unity that might have existed.[61] He blames the war, saying that it was too hard for Hemingway to write about it cohesively, that it was "too large, terrible, and mentally overwhelming to grasp in its entirety".[62] Instead, he says, Hemingway wrote fragments, "discrete glimpses into hell ... like the wreckage of battle lit up from a shell burst at night."[60] The structure apparent in the 1924 collection of vignettes is lost in the later edition because the short stories seem to bear little if any relationship to the interchapters, shattering the carefully constructed order.[63] The sense of discordance is intensified because the action is about unnamed men and soldiers, only referred to with pronouns, and unspecified woundings.[61] The characters are transformed through circumstances and settings, where danger exists overtly, on the battlefield, or, in one case, by a chance sexual encounter in a Chicago taxi.[63] Critic E. R. Hageman notes the 1924 in our time vignettes are linked chronologically, spanning ten years from 1914 to 1923, and the choices were deliberate. World War I and the aftermath were "the experience of his generation, the experience that dumped his peers and his elders into graves, shell-holes, hospitals, and onto gallows. These were 'in our time', Hemingway is saying, and he remarks the significant and the insignificant."[64] Themes[edit] T. S. Eliot, shown in a 1923 photograph, influenced Hemingway's style. The stories contain themes Hemingway was to revisit over the course of his career. He wrote about initiation rites, early love, marriage problems, disappointment in family life and the importance of male comradeship.[65] The collection conjures a world of violence and war, suffering, executions; it is a world stripped of romance, where even "the hero of the bullfight chapter pukes".[18] Hemingway's early-20th century is a time "out of season", where war, death, and tangled, unfulfilling relationships reign.[66] Alienation in the modern world is particularly evident in "Out of Season", which bears similarities to Eliot's The Waste Land.[66] Eliot's Waste Land motif exists throughout much of Hemingway's early fiction, but is most notable in this collection, The Sun Also Rises (1926), and A Farewell to Arms (1929). He borrowed Eliot's device of using imagery to evoke feeling.[67] Benson attributes similarities between Hemingway and Eliot to Pound, who edited both.[68] Motifs and themes reappear, the most obvious being the juxtaposition of life and death. There are some recurring images such as water and darkness – places of safety.[69] Benson notes how, after reading the first few vignettes and stories, readers "realize we are in hell." Hemingway conjures a world where "the weak are pitilessly exploited by the strong, and ... all functions of life ... promise only pain."[70] Hemingway's semi-autobiographical character Nick Adams is "vital to Hemingway's career", writes Mellow,[3] and generally his character reflects Hemingway's experiences.[71] Nick, who features in eight of the stories,[55] is an alter ego, a means for Hemingway to express his own experiences, from the first story '"Indian Camp" which features Nick as a child.[65] According to critic Howard Hannum, the trauma of birth and suicide Hemingway paints in "Indian Camp" rendered a leitmotif that gave Hemingway a unified framework for the Nick Adams stories.[72] It is followed by "The Doctor and the Doctor's Wife", which Mellows says is written with a sense of "hostility and resignation", and sheds a rare light on Hemingway's childhood. In the story, 12-year-old Nick hides from his angry and violent father; the mother, a Christian Scientist, is distanced, withdrawn in her bedroom, reading Science and Health.[73] "Big Two-Hearted River", the concluding and climactic piece, details Nick's return from war.[74] In it Nick knows he has left his needs behind; Debra Moddelmog highlights how all of the Nick storylines, and most of the others in the collection, are about a "flight from pain".[75] She believes that Gertrude Stein's definition of the Lost Generation applies to In Our Time as much, if not more so, as to The Sun Also Rises; that "Nick seems to believe that the things most worth having and caring about – life, love, ideals, companions, peace, freedom – will be lost sooner or later, and he is not sure how to cope with this assurance, except through irony, bitterness, and, sometimes, wishful thinking."[76] In the last story he learns to come to terms with the loss of his friends, and acknowledges "all the loss he has experienced in the last few years and, equally important, the loss he has come to expect."[77] Style[edit] Biographer Mellow believes that In Our Time is Hemingway's most experimental book, particularly with its unusual narrative form.[3] The vignettes have no traditional sense of narrative; they begin in the middle.[18] Shifting points-of-view and narrative perspectives disguise autobiographical details.[20] Pound taught Hemingway to write sparingly.[78] Pound wrote to him that "anything put on top of the subject is BAD ... The subject is always interesting enough without blankets."[55] Hemingway would write in A Moveable Feast (published posthumously in 1964), "If I started to write elaborately, like someone presenting or introducing something, I found that I could cut that scrollwork or ornament out and throw it away and start with the first true simple declarative sentence I had written."[15] In Our Time was written during the author's experimentation phase, his first attempts towards a minimalist style.[79] The prose in "Indian Camp" and "Big Two-Hearted River" is sharper and more abstract than in other stories, and by employing simple sentences and diction – techniques he learned writing for newspapers – the prose is timeless with an almost mythic quality, explains Benson.[80] The tightly compressed sentence structure emulates and reflects Pound's imagist style, bringing to prose narrative the stripped-down style Pound famously established in 1913 with poems such as "In a Station of the Metro". Thomas Strychacz compares Hemingway's prose to Pound's poetry, writing, "Hemingway's terse, tight-lipped, tightly wound fragments are equally extraordinary in their dramatic intensity."[81] The taut style is apparent from the first vignette,[78] in which a brigade of drunken soldiers march to Champagne. With supreme understatement he alludes to the Second Battle of Champagne, an offensive lasting from September to December 25, 1915, in which 120,000 French troops were killed in the first three weeks:[82] Everybody was drunk. The whole battery was drunk going along the road in the dark. We were going to Champagne. The lieutenant kept riding his horse out into the fields and saying to him, "I'm drunk, I tell you, mon vieux. Oh I am so soused." We went along the road all night in the dark and the adjutant kept riding up alongside my kitchen and saying, "You must put it out. It is dangerous. It will be observed." We were fifty kilometers from the front but the adjutant worried about the fire in my kitchen. It was funny going along that road. That was when I was a kitchen corporal. — Ernest Hemingway, "Chapter 1", in our time.[83] The vignette opening with the words "We were in a garden at Mons" is equally understated; the narrator writes, "The first German I saw climbed up over the garden wall. We waited till he got one leg over then potted him. He ... looked awfully surprised".[84] The description repeats images, is dispassionate and warps logic, according to Strychacz.[85] These set the model for flash fiction – fiction that is condensed without unnecessary descriptive detail.[86] In A Moveable Feast Hemingway wrote that "Out of Season", written in 1924, was the first story where he applied the theory of omission, known as his Iceberg Theory. He explained that the stories in which he left out the most important parts, such as not writing about the war in "Big Two-Hearted River", are the best of his early fiction.[32] As Carlos Baker describes the technique, the hard facts float above water while the supporting structure, including the symbolism, operates out of sight.[87] Hemingway wrote in the preface to Death in the Afternoon, a writer may choose what to include and what to omit from a story.[32] If a writer of prose knows enough of what he is writing about he may omit things that he knows and the reader, if the writer is writing truly enough, will have a feeling of those things as strongly as though the writer had stated them. The dignity of movement of an ice-berg is due to only one-eighth of it being above water. A writer who omits things because he does not know them only makes hollow places in his writing. — Ernest Hemingway, Death in the Afternoon[88] Reception and legacy[edit] Hemingway's bullfighting scenes were compared to Francisco Goya's art.[89] Hemingway's writing style attracted attention after the release of the Parisian edition of in our time in 1924. Edmund Wilson described the writing as "of the first destinction",[2] writing that the bullfight scenes were like Francisco Goya paintings, that the author "had almost invented a form of his own", and it had "more artistic dignity than any written by an American about the period of the war."[89] The 1925 edition of In Our Time is considered one of Hemingway's masterpieces.[3] Reviewers and critics noticed, and the collection received positive reviews on its publication.[36] The New York Times described the language as "fibrous and athletic, colloquial and fresh, hard and clean, his very prose seems to have an organic being of its own". A reviewer for Time wrote, "Ernest Hemingway is somebody; a new honest un-'literary' transcriber of life – a Writer."[36] Reviewing if for The Bookman, F. Scott Fitzgerald wrote Hemingway was an "augury" of the age and that the Nick Adams stories were "temperamentally new" in American fiction.[90] His parents, however, described the book as "filth", disturbed by the passage in "A Very Short Story" which tells of a soldier contracting gonorrhea after a sexual encounter with a sales girl in a taxicab.[91] Bird sent five copies to them which were promptly returned, eliciting a letter from Hemingway, who complained, "I wonder what was the matter, whether the pictures were too accurate and the attitude toward life not sufficiently distorted to please who ever bought the book or what?"[91] In Our Time was ignored and forgotten by literary critics for decades. Benson attributes the neglect to various factors. The Sun Also Rises, published the next year, is considered the more important book followed fairly rapidly by the popular A Farewell to Arms two years after in 1928; critics' general assumption seemed to be that Hemingway's talent lay in writing prose rather than "sophisticated, complex design";[92] and In Our Time stories were combined with subsequent collections in the publication of The Fifth Column and the First Forty-Nine Stories in 1938, drawing the critics' attention away from the book as an entity, toward the individual stories. In 1962, when Scribner's released the paperback edition of In Our Time, it began to be taught in American universities, and by the end of the decade, the first critical study of the collection appeared. Benson describes the collection as the author's first "major achievement";[93] Wagner-Martin as "his most striking work, both in terms of personal involvement and technical innovation."[94] References[edit] ^ a b Reynolds (1995), 35 ^ a b quoted in Wagner-Martin (2002), 4 ^ a b c d Mellow (1992), 266 ^ Putnam, Thomas (2006). "Hemingway on War and Its Aftermath". Prologue Magazine. Vol. 38, No. 1. Retrieved November 30, 2011 ^ Desnoyers, Megan Floyd. "Ernest Hemingway: A Storyteller's Legacy" JFK Library. Retrieved September 30, 2011 ^ a b Reynolds (1995), 36 ^ a b c d e f Cohen (2003), 107–108 ^ a b c d Smith (1996), 40–42 ^ a b Reynolds (2000), 26 ^ Mellow (1992), 205 ^ Mellow (1992), 208 ^ Smith (1996), 40 ^ Cohen (2012), 35 ^ Smith (1996), 41 ^ a b Cohen (2012), 36 ^ Cohen (2012), 40 ^ a b c Oliver (1999), 168–169 ^ a b c Cohen (2012), 37 ^ Cohen (2003), 106 ^ a b c Cohen (2012), 41–42 ^ a b Cohen (2012), 44 ^ a b Cohen (2012), 45 ^ a b Cohen (2012), 48 ^ a b Baker (1972), 17 ^ a b Mellow (1992), 188 ^ Mellow (1992), 239 ^ Reynolds (1995), 40 ^ a b Cohen (2012), 59 ^ Waldhorn (2002), 259 ^ Tetlow (1992), 46 ^ Meyers (1985), 141 ^ a b c Smith (1983), 271–272 ^ Benson (1983), 105 ^ Mellow (1992), 282–283 ^ Reynolds (1995), 43 ^ a b c Mellow (1992), 314 ^ a b Hagemann (1983), 39 ^ Leff (1999), 22 ^ a b Mellow (1992), 317–318 ^ Mellow (1992), 320 ^ Hagemann (1983), 46 ^ Hagemann (1983), 43 ^ Reynolds (1995), 49 ^ Hemingway (1925), 63 ^ a b c Oliver (1999), 52–53 ^ Oliver (1999), 342 ^ Mellow (1992), 97, 81 ^ Tetlow (1992), 23 ^ quoted in Mellow (1992), 240 ^ Hemingway (1981), 128 ^ Benson (1983), 104, 108 ^ Benson (1983), 104, 118 ^ a b Wagner-Martin (1983), 121 ^ Moddelmog (1988), 608 ^ a b c Tetlow (1992), 14 ^ Tetlow (1992), 48 ^ Tetlow (1992), 65 ^ Tetlow (1992), 68 ^ Tetlow (1992), 70 ^ a b Barloon (2005), 7 ^ a b Barloon (2005), 8 ^ Barloon (2005), 6 ^ a b Barloon (2005), 9 ^ Hagemann (1983), 52 ^ a b Mellow (1992), 266–268 ^ a b Bickford (1992), 75–76 ^ Tetlow (1992), 16 ^ Benson (1983), 106 ^ Benson (1983), 113 ^ Benson (1983), 113, 118 ^ Moddelmog (1988), 593 ^ Hannum (2001), 93–94 ^ Mellow (1992), 269 ^ Mellow (1992), 272 ^ Moddelmog (1988), 595–598 ^ Moddelmog (1988), 599 ^ Moddelmog (1988), 600 ^ a b Tetlow (1992), 20 ^ Smith (1996), 45 ^ Benson (1975), 285–287 ^ Strychacz (1996), 58 ^ Tetlow (1992), 18 ^ Hemingway (1925), 13 ^ quoted in Stychacz (1996), 58 ^ Strychacz (1996), 59 ^ Hlinak (2010), 18 ^ Baker (1972), 117 ^ quoted in Smith (1983), 273 ^ a b Reynolds (1989), 243 ^ Mellow (1992), 316 ^ a b Mellow (1992), 255 ^ Benson (1983), 103 ^ Benson (1983), 103–104 ^ Wagner-Martin (1983), 120 Sources[edit] Baker, Carlos. (1972). Hemingway: The Writer as Artist. (4th edition). Princeton: Princeton University Press. ISBN 978-0-691-01305-3 Barloon, Jim. (2005). "Very Short Stories: The Miniaturization of War in Hemingway's 'In Our Time'". The Hemingway Review. Vol. 24, No. 2. Benson, Jackson. (1983). "Patterns of Connections and their development in Hemingway's In Our Time". In Reynolds, Michael. (ed). Critical essays on Ernest Hemingway's In Our Time. Boston: G. K. Hall. ISBN 978-0-8161-8637-2 Benson, Jackson (1975). "Ernest Hemingway as Short Story Writer". In Benson, Jackson. (ed). The Short Stories of Ernest Hemingway: Critical Essays. Durham NC: Duke University Press. ISBN 978-0-8223-0320-6 Bickford, Sylvester. (1992). "Hemingway's Italian Waste Land: The Complex Unity of 'Out of Season'". In Beegel, Susan F. (ed). Hemingway's Neglected Short Fiction. Tuscaloosa: Alabama University Press. ISBN 978-0-8173-0586-4 Cohen, Milton. (2012). Hemingway's Laboratory: The Paris 'In our Time'. Tuscaloosa: Alabama University Press. ISBN 978-0-8173-5728-3 Cohen, Milton. (2003). "Who Commissioned The Little Review's 'In Our Time'?". The Hemingway Review. Vol. 23, No. 1. Hagemann, E. R. (1983). "'Only Let the Story End as Soon as Possible': Time-and-History in Ernest Hemingway's In Our Time". In Reynolds, Michael. (ed) Critical essays on Ernest Hemingway's In Our Time. Boston: G. K. Hall. ISBN 978-0-8161-8637-2 Hannum, Howard. (2001). "'Scared sick looking at it': A Reading of Nick Adams in the Published Stories". Twentieth Century Literature. Vol. 47, No. 1. Hemingway, Ernest. (1925/1930) In Our Time. (1996 ed). New York: Scribner. ISBN 978-0-684-82276-1 Hemingway, Ernest. (1981). Ernest Hemingway Selected Letters 1917–1961. In Baker, Carlos. (ed). New York: Charles Scribner's Sons. ISBN 978-0-684-16765-7 Hlinak, Matt. (2010). "Hemingway's Very Short Experiment: From 'A Very Short Story' to a A Farewell to Arms". The Journal of the Midwest Modern Language Association. Vol. 43, No. 1. Leff, Leonard (1999). Hemingway and His Conspirators: Hollywood, Scribner's and the making of American Celebrity Culture. Lanham, MD: Rowman & Littlefield. ISBN 978-0-8476-8545-5 Mellow, James. (1992) Hemingway: A Life Without Consequences. New York: Houghton Mifflin. ISBN 978-0-395-37777-2 Meyers, Jeffrey. (1985). Hemingway: A Biography. New York: Macmillan. ISBN 978-0-8223-1067-9 Moddelmog, Debra. (1988). "The Unifying Consciousness of a Divided Conscience: Nick Adams as Author of 'In Our Time'". American Literature. Vol. 60, No. 4. Oliver, Charles. (1999). Ernest Hemingway A to Z: The Essential Reference to the Life and Work. New York: Checkmark Publishing. ISBN 978-0-8160-3467-3. Reynolds, Michael (2000). "Ernest Hemingway, 1899–1961: A Brief Biography". In Wagner-Martin, Linda. (ed). A Historical Guide to Ernest Hemingway. New York: Oxford University Press. ISBN 978-0-19-512152-0 Reynolds, Michael. (1995). Hemingway's 'In Our Time': The biography of a Book. In Kennedy, Gerald J. (ed). Modern American Short Story Sequences. Cambridge: Cambridge University Press. ISBN 978-0-521-43010-4 Reynolds, Michael. (1989). Hemingway: The Paris Years. New York: Norton. ISBN 978-0-393-31879-1 Smith, Paul. (1996). "1924: Hemingway's Luggage and the Miraculous Year". In Donaldson, Scott (ed). The Cambridge Companion to Ernest Hemingway. New York: Cambridge University Press. ISBN 978-0-521-45479-7 Smith, Paul. (1983). "Hemingway's Early Manuscripts: The Theory and Practice of Omission". Journal of Modern Literature. Vol. 10, No. 2. Strychacz, Thomas. (1996). ''In Our Time, Out of Season". In Donaldson, Scott (ed). The Cambridge Companion to Ernest Hemingway. New York: Cambridge University Press. ISBN 978-0-521-45479-7 Tetlow, Wendolyn E. (1992). Hemingway's "In Our Time": Lyrical Dimensions. Cranbury NJ: Associated University Presses. ISBN 978-0-8387-5219-7 Wagner-Martin, Linda. (2002). "Introduction". In Wagner-Martin, Linda (ed). Ernest Hemingway's The Sun Also Rises: A Casebook. New York: Oxford University Press. ISBN 978-0-19-514573-1 Wagner-Martin, Linda. (1983). "Juxtaposition in Hemingway's In Our Time". In Reynolds, Michael. (ed). Critical essays on Ernest Hemingway's In Our Time. Boston: G. K. Hall. ISBN 978-0-8161-8637-2 Waldhorn, Arthur. (2002 edition). A reader's guide to Ernest Hemingway. Syracuse, NY: Syracuse University Press. ISBN 978-0-8156-2950-4 External links[edit] in our time (1924 edition) at Project Gutenberg Ernest Hemingway Collection, JFK Library v t e Ernest Hemingway Bibliography Novels The Torrents of Spring (1926) The Sun Also Rises (1926) A Farewell to Arms (1929) To Have and Have Not (1937) For Whom the Bell Tolls (1940) Across the River and into the Trees (1950) The Old Man and the Sea (1952) Non-fiction Death in the Afternoon (1932) Green Hills of Africa (1935) Posthumous A Moveable Feast (1964) Islands in the Stream (1970) The Dangerous Summer (1985) The Garden of Eden (1986) True at First Light (1999) Under Kilimanjaro (2005) Short stories "Indian Camp" (1925) "The Doctor and the Doctor's Wife" (1925) "The End of Something" (1925) "The Three-Day Blow" (1925) "The Battler" (1925) "A Very Short Story" (1925) "Soldier's Home" (1925) "The Revolutionist" (1925) "Mr. and Mrs. Elliot" (1925) "Cat in the Rain" (1925) "Out of Season" (1925) "Cross Country Snow" (1925) "My Old Man" (1925) "Big Two-Hearted River" (1925) "A Clean, Well-Lighted Place" (1926) "A Canary for One" (1926) "Fifty Grand" (1927) "Hills Like White Elephants" (1927) "The Killers" (1927) "The Undefeated" (1927) "Che Ti Dice La Patria?" (1927) "In Another Country" (1927) "On the Quai at Smyrna" (1930) "Fathers and Sons" (1932) "A Day's Wait" (1933) "The Gambler, the Nun, and the Radio" (1933) "A Way You'll Never Be" (1933) "The Snows of Kilimanjaro" (1936) "The Capital of the World" (1936) "The Short Happy Life of Francis Macomber" (1936) Short story collections Three Stories and Ten Poems (1923) In Our Time (1925) Men Without Women (1927) Winner Take Nothing (1933) The Fifth Column and the First Forty-Nine Stories (1938) The Snows of Kilimanjaro (1961) The Fifth Column and Four Stories of the Spanish Civil War (1969) The Nick Adams Stories (1972) The Complete Short Stories of Ernest Hemingway (1987) Ernest Hemingway: The Collected Stories (1995) Story fragments "On Writing" Poetry 88 Poems (1979) Complete Poems Screenplays The Spanish Earth (1937 film) Letters and journalism By-Line: Ernest Hemingway (1967) Ernest Hemingway Selected Letters 1917–1961 (1981) Dateline: Toronto (1985) The Cambridge Edition of the Letters of Ernest Hemingway (2011) Adaptations The Sun Also Rises 1957 film 1984 film Opera The Select (The Sun Also Rises) Ballet "The Killers" 1946 film 1956 film 1964 film Bukowski short story A Farewell to Arms 1932 film 1957 film 1966 TV series To Have and Have Not 1944 film The Breaking Point (1950) The Gun Runners (1958) Captain Khorshid (1987) For Whom the Bell Tolls 1943 film 1959 TV play 1965 TV series 1984 song The Old Man and the Sea 1958 film 1990 film 1999 animated film Other film adaptations The Macomber Affair (1947) Under My Skin (1950) The Snows of Kilimanjaro (1952) Hemingway's Adventures of a Young Man (1962) Islands in the Stream (1977) Soldier's Home (1977) My Old Man (1979) After the Storm (2001) The Garden of Eden (2008) Across the River and Into the Trees (upcoming) Homes Birthplace and boyhood home Michigan cottage Hemingway-Pfeiffer House Key West home Hotel Ambos Mundos, Havana home Finca Vigía, Cuba home Idaho home Depictions Bacall to Arms (1946 cartoon) Hemingway: On the Edge (1987 play) In Love and War (1996 film) Midnight in Paris (2011 film) Hemingway & Gellhorn (2012 film) Cooper & Hemingway: The True Gen (2013 documentary) Papa: Hemingway in Cuba (2015 film) Hemingway (2021 documentary series) Related Nick Adams Pilar (boat) Iceberg theory Ernest Hemingway International Billfishing Tournament Maxwell Perkins Adriana Ivancich Hemingway Foundation/PEN Award Hello Hemingway (1990 film) Michael Palin's Hemingway Adventure (1999 documentary) Hemingway crater Kennedy Library Hemingway collection Family Elizabeth Hadley Richardson (first wife) Jack Hemingway (son) Pauline Pfeiffer (second wife) Patrick Hemingway (son) Gregory Hemingway (son) Martha Gellhorn (third wife) Mary Welsh Hemingway (fourth wife) Lorian Hemingway (granddaughter) Margaux Hemingway (granddaughter) John Hemingway (grandson) Mariel Hemingway (granddaughter) Grace Hall Hemingway (mother) Leicester Hemingway (brother) Authority control General Integrated Authority File (Germany) VIAF 1 2 WorldCat (via VIAF) National libraries France (data) United States Other SUDOC (France) 1 Retrieved from "https://en.wikipedia.org/w/index.php?title=In_Our_Time_(short_story_collection)&oldid=956391276" Categories: 1925 short story collections Short story collections by Ernest Hemingway Hidden categories: Articles with short description Short description is different from Wikidata Featured articles Articles with Project Gutenberg links Wikipedia articles with GND identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BNF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with WorldCat-VIAF identifiers Wikipedia articles with multiple identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية বাংলা Deutsch Español Français Bahasa Indonesia Nederlands Norsk bokmål Polski Українська 中文 Edit links This page was last edited on 13 May 2020, at 03:06 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7678 ---- Serious Money - Wikipedia Serious Money From Wikipedia, the free encyclopedia Jump to navigation Jump to search satirical play by Caryl Churchill Serious Money Written by Caryl Churchill Music by Ian Dury Date premiered 1987 Place premiered Royal Court Theatre London, England Original language English Subject The world of arbitrageurs, junk bonds and greenmail, white knights and corporate raiders Genre Comedy, satire Setting 1980s, London and New York Serious Money is a satirical play written by Caryl Churchill first staged in London in 1987. Its subject is the British stock market, specifically the London International Financial Futures and Options Exchange (LIFFE). Often considered one of Churchill's finest plays along with Cloud 9 (1979) and Top Girls (1982), it is notable for being largely written in rhyming couplets. Contents 1 Plot summary 2 Productions 3 Awards and nominations 4 Notes 5 References 6 Further reading 7 External links Plot summary[edit] The plot follows Scilla and Jake who are enjoying the pleasures and the comforts of the upper class. But the story climaxes when Jake Todd turns up murdered during the first few scenes due to his underground trading. Scilla takes it upon herself to find her brother's killer and the money he was dealing. She later finds out that he was being investigated by the Department of Trade and Industry. Though she does not find the killer, she finds the American business woman Marylou Banes with whom Jake was dealing. Marylou Banes offers her a fresh start. The story takes place around the stock market troubles in Britain. Aside from that a second story follows Billy Corman's and Zac Zackerman's attempt to take over the Albion company from Duckett. In between this takeover Corman attempts to get Jacinta Condor and Nigel Ajibala [who are the foreigners with an interest in his takeover] to buy shares in his company. They support Corman but decide to give their bid to Duckett in the end. The plot ends with Greville Todd in jail, Corman appointed as a Lord, and Scilla happily working for Marylou Banes. Productions[edit] Serious Money was developed at the Royal Court Theatre in London, directed by Max Stafford Clark. It opened in March 1987 and was an immediate hit. After its initial engagement it transferred to Wyndham's Theatre in the West End, where it enjoyed an extended run. Serious Money was produced on Broadway, opening on February 9, 1988 at the Royale Theatre. Some changes were made for the Broadway run, including a reference to the stock market crash of 1987. The show closed after 21 previews and 15 performances. The play has fared better at American regional companies, such as the Berkeley Repertory Theatre in California. A successful revival was given at the U.K.'s Birmingham Repertory Theatre in 2009. On July 31, 2010 Serious Money opened at the Shaw Festival in Niagara-on-the-Lake, ON, directed by Eda Holmes.[1] A run of Serious Money was put on by students of Bristol Old Vic Theatre School at Circomedia, Portland Square from 7 November 2013 until 16 November 2013. Awards and nominations[edit] Awards 1987 Laurence Olivier Award for Best New Play 1988 Obie Awards Best New American Play Notes[edit] ^ "Archived copy". Archived from the original on 2010-07-24. Retrieved 2010-07-30.CS1 maint: archived copy as title (link) References[edit] Gussow, Mel (10 February 1988). "The Stage: Serious Money". New York Times. Retrieved 2008-09-21. Rich, Frank (4 December 1987). "The Stage: Serious Money". New York Times. Retrieved 2008-09-21. Further reading[edit] Churchill, Caryl (1987). Serious Money: A City Comedy (First ed.). London: Methuen. ISBN 0-413-16660-0. External links[edit] Serious Money at the Internet Broadway Database Serious Money at the Internet Broadway Database Serious Money at the Internet Off-Broadway Database Awards for Serious Money v t e Laurence Olivier Award for Best New Play 1976–2000 Dear Daddy (1976) The Fire that Consumes (1977) Whose Life Is It Anyway? (1978) Betrayal (1979) The Life and Adventures of Nicholas Nickleby (1980) Children of a Lesser God (1981) Another Country (1982) Glengarry Glen Ross (1983) Benefactors (1984) Red Noses (1985) Les Liaisons Dangereuses (1986) Serious Money (1987) Our Country's Good (1988) Racing Demon (1989/1990) Dancing at Lughnasa (1991) Death and the Maiden (1992) Six Degrees of Separation (1993) Arcadia (1994) Broken Glass (1995) Skylight (1996) Stanley (1997) Closer (1998) The Weir (1999) Goodnight Children Everywhere (2000) 2001–present Blue/Orange (2001) Jitney (2002) Vincent in Brixton (2003) The Pillowman (2004) The History Boys (2005) On the Shore of the Wide World (2006) Blackbird (2007) A Disappearing Number (2008) Black Watch (2009) The Mountaintop (2010) Clybourne Park (2011) Collaborators (2012) The Curious Incident of the Dog in the Night-Time (2013) Chimerica (2014) King Charles III (2015) Hangmen (2016) Harry Potter and the Cursed Child (2017) The Ferryman (2018) The Inheritance (2019) Leopoldstadt (2020) v t e Obie Award for Best New American Play The Blacks (1961) Who'll Save the Plowboy? (1962) Six Characters in Search of an Author (1963) Home Movies (1964) The Old Glory (1965) The Indian Wants the Bronx (1968) What the Butler Saw (1970) The Basic Training of Pavlo Hummel (1971) Bad Habits / The Hot l Baltimore / When You Comin' Back, Red Ryder? (1973) Short Eyes (1974) For Colored Girls Who Have Considered Suicide / When the Rainbow Is Enuf (1975) Sister Mary Ignatius Explains It All For You (1979) FOB (1980) Cloud 9 (1982) Spunk (1989) Floyd Collins / Love! Valour! Compassion! (1995) How I Learned to Drive / Rent / The Vagina Monologues (1996) Golden Child / Hedwig and the Angry Inch (1998) Bug / The Romance of Magno Rubio (2003) A Very Merry Unauthorized Children's Scientology Pageant (2004) Ruined (2009) Circle Mirror Transformation and The Aliens (2010) The Elaborate Entrance of Chad Deity (2011) 4000 Miles (2012) Detroit / Grimly Handsome (2013) Appropriate / An Octoroon (2014) Hamilton (2015) Guards at the Taj (2016) Underground Railroad Game / Oslo (2017) Describe the Night (2018) What the Constitution Means to Me (2019) Retrieved from "https://en.wikipedia.org/w/index.php?title=Serious_Money&oldid=991673843" Categories: 1987 plays English plays Broadway plays Plays by Caryl Churchill West End plays Off-Broadway plays Obie Award-winning plays Laurence Olivier Award-winning plays Hidden categories: CS1 maint: archived copy as title Articles with short description Short description is different from Wikidata Articles with IBDb links Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Français Italiano Edit links This page was last edited on 1 December 2020, at 07:05 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7805 ---- Bulletin board system - Wikipedia Bulletin board system From Wikipedia, the free encyclopedia Jump to navigation Jump to search Computer server Not to be confused with Internet forum software. This article includes a list of general references, but it remains largely unverified because it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (April 2020) (Learn how and when to remove this template message) A welcome screen for the Free-net bulletin board, from 1994 A bulletin board system or BBS (also called Computer Bulletin Board Service, CBBS[1]) is a computer server running software that allows users to connect to the system using a terminal program. Once logged in, the user can perform functions such as uploading and downloading software and data, reading news and bulletins, and exchanging messages with other users through public message boards and sometimes via direct chatting. In the early 1980s, message networks such as FidoNet were developed to provide services such as NetMail, which is similar to internet-based email. Many BBSes also offer online games in which users can compete with each other. BBSes with multiple phone lines often provide chat rooms, allowing users to interact with each other. Bulletin board systems were in many ways a precursor to the modern form of the World Wide Web, social networks, and other aspects of the Internet. Low-cost, high-performance asynchronous modems drove the use of online services and BBSes through the early 1990s. InfoWorld estimated that there were 60,000 BBSes serving 17 million users in the United States alone in 1994, a collective market much larger than major online services such as CompuServe. The introduction of inexpensive dial-up internet service and the Mosaic web browser offered ease of use and global access that BBS and online systems did not provide, and led to a rapid crash in the market starting in 1994. Over the next year, many of the leading BBS software providers went bankrupt and tens of thousands of BBSes disappeared. Today, BBSing survives largely as a nostalgic hobby in most parts of the world, but it is still an extremely popular form of communication for Taiwanese youth (see PTT Bulletin Board System).[2] Most surviving BBSes are accessible over Telnet and typically offer free email accounts, FTP services, IRC and all the protocols commonly used on the Internet. Some offer access through packet switched networks or packet radio connections.[1] Contents 1 History 1.1 Precursors 1.2 The first BBSes 1.3 Smartmodem 1.4 Higher speeds, commercialization 1.5 GUIs 1.6 Rise of the Internet and decline of BBS 1.7 Estimating numbers 2 Software and hardware 3 Presentation 4 Content and access 5 Networks 6 Shareware and freeware 7 Features 8 See also 9 Notes 10 References 10.1 Citations 10.2 Sources 11 External links History[edit] Precursors[edit] A precursor to the public bulletin board system was Community Memory, started in August 1973 in Berkeley, California. Useful microcomputers did not exist at that time, and modems were both expensive and slow. Community Memory therefore ran on a mainframe computer and was accessed through terminals located in several San Francisco Bay Area neighborhoods.[3][4] The poor quality of the original modem connecting the terminals to the mainframe prompted Community Memory hardware person, Lee Felsenstein, to invent the Pennywhistle modem, whose design was highly influential in the mid-1970s. Community Memory allowed the user to type messages into a computer terminal after inserting a coin, and offered a "pure" bulletin board experience with public messages only (no email or other features). It did offer the ability to tag messages with keywords, which the user could use in searches. The system acted primarily in the form of a buy and sell system with the tags taking the place of the more traditional classifications. But users found ways to express themselves outside these bounds, and the system spontaneously created stories, poetry and other forms of communications. The system was expensive to operate, and when their host machine became unavailable and a new one could not be found, the system closed in January 1975. Similar functionality was available to most mainframe users, which might be considered a sort of ultra-local BBS when used in this fashion. Commercial systems, expressly intended to offer these features to the public, became available in the late 1970s and formed the online service market that lasted into the 1990s. One particularly influential example was PLATO, which had thousands of users by the late 1970s, many of whom used the messaging and chat room features of the system in the same way that would become common on BBSes. The first BBSes[edit] Ward Christensen holds an expansion card from the original CBBS S-100 host machine. Early modems were generally either expensive or very simple devices using acoustic couplers to handle telephone operation. The user would first pick up the phone, dial a number, then press the handset into rubber cups on the top of the modem. Disconnecting at the end of a call required the user to pick up the handset and return it to the phone. Examples of direct-connecting modems did exist, and these often allowed the host computer to send it commands to answer or hang up calls, but these were very expensive devices used by large banks and similar companies. With the introduction of microcomputers with expansion slots, like the S-100 bus machines and Apple II, it became possible for the modem to communicate instructions and data on separate lines. These machines typically only supported asynchronous communications, and synchronous modems were much more expensive than asynchronous modems. A number of modems of this sort were available by the late 1970s. This made the BBS possible for the first time, as it allowed software on the computer to pick up an incoming call, communicate with the user, and then hang up the call when the user logged off. The first public dial-up BBS was developed by Ward Christensen and Randy Suess. According to an early interview, when Chicago was snowed under during the Great Blizzard of 1978, the two began preliminary work on the Computerized Bulletin Board System, or CBBS. The system came into existence largely through a fortuitous combination of Christensen having a spare S-100 bus computer and an early Hayes internal modem, and Suess's insistence that the machine be placed at his house in Chicago where it would be a local phone call for more users. Christensen patterned the system after the cork board his local computer club used to post information like "need a ride". CBBS officially went online on 16 February 1978.[5][6] CBBS, which kept a count of callers, reportedly connected 253,301 callers before it was finally retired.[citation needed] Smartmodem[edit] The 300 baud Smartmodem led to an initial wave of early BBS systems. A key innovation required for the popularization of the BBS was the Smartmodem manufactured by Hayes Microcomputer Products. Internal modems like the ones used by CBBS and similar early systems were usable, but generally expensive due to the manufacturer having to make a different modem for every computer platform they wanted to target. They were also limited to those computers with internal expansion, and could not be used with other useful platforms like video terminals. External modems were available for these platforms but required the phone to be dialed using a conventional handset.[a] Internal modems could be software-controlled to perform both outbound and inbound calls, but external modems had only the data pins to communicate with the host system. Hayes' solution to the problem was to use a small microcontroller to implement a system that examined the data flowing into the modem from the host computer, watching for certain command strings. This allowed commands to be sent to and from the modem using the same data pins as all the rest of the data, meaning it would work on any system that could support even the most basic modems. The Smartmodem could pick up the phone, dial numbers, and hang up again, all without any operator intervention. The Smartmodem was not necessary for BBS use but made overall operation dramatically simpler. It also improved usability for the caller, as most terminal software allowed different phone numbers to be stored and dialed on command, allowing the user to easily connect to a series of systems. The introduction of the Smartmodem led to the first real wave of BBS systems. Limited in both speed and storage capacity, these systems were normally dedicated solely to messaging, both private email and public forums. File transfers were extremely slow at these speeds, and file libraries were typically limited to text files containing lists of other BBS systems. These systems attracted a particular type of user who used the BBS as a unique type of communications medium, and when these local systems were crowded from the market in the 1990s, their loss was lamented for many years.[citation needed] Higher speeds, commercialization[edit] Speed improved with the introduction of 1200 bit/s asynchronous modems in the early 1980s, giving way to 2400 bit/s fairly rapidly. The improved performance led to a substantial increase in BBS popularity. Most of the information was displayed using ordinary ASCII text or ANSI art, but a number of systems attempted character-based graphical user interfaces which began to be practical at 2400 bit/s. There was a lengthy delay before 9600 bit/s models began to appear on the market. 9600 bit/s was not even established as a strong standard before V.32bis at 14.4 kbit/s took over in the early 1990s. This period also saw the rapid rise in capacity and a dramatic drop in the price of hard drives. By the late 1980s, many BBS systems had significant file libraries, and this gave rise to leeching – users calling BBSes solely for their files. These users would use the modem for some time, leaving less time for other users, who got busy signals. The resulting upheaval eliminated many of the pioneering message-centric systems.[7] This also gave rise to a new class of BBS systems, dedicated solely to file upload and downloads. These systems charged for access, typically a flat monthly fee, compared to the per-hour fees charged by Event Horizons BBS and most online services. Many third-party services were developed to support these systems, offering simple credit card merchant account gateways for the payment of monthly fees, and entire file libraries on compact disk that made initial setup very easy. Early 1990s editions of Boardwatch were filled with ads for single-click install solutions dedicated to these new sysops. While this gave the market a bad reputation, it also led to its greatest success. During the early 1990s, there were a number of mid-sized software companies dedicated to BBS software, and the number of BBSes in service reached its peak. Towards the early 1990s, BBS became so popular that it spawned three monthly magazines, Boardwatch, BBS Magazine, and in Asia and Australia, Chips 'n Bits Magazine which devoted extensive coverage of the software and technology innovations and people behind them, and listings to US and worldwide BBSes.[8] In addition, in the US, a major monthly magazine, Computer Shopper, carried a list of BBSes along with a brief abstract of each of their offerings. GUIs[edit] Through the late 1980s and early 1990s, there was considerable experimentation with ways to improve the BBS experience from its command-line interface roots.[colloquialism?] Almost every popular system improved matters somewhat by adding ANSI-based color menus to make reading easier, and most also allowed cursor commands to offer command-line recall and similar features. Another common feature was the use of autocomplete to make menu navigation simpler, a feature that would not re-appear on the Web until decades later. A number of systems also made forays into GUI-based interfaces, either using character graphics sent from the host, or using custom GUI-based terminal systems. The latter initially appeared, unsurprisingly, on the Macintosh platform, where TeleFinder and FirstClass became very popular. FirstClass offered a host of features that would be difficult or impossible under a terminal-based solution, including bi-directional information flow and non-blocking operation that allowed the user to exchange files in both directions while continuing to use the message system and chat, all in separate windows. Skypix featured on Amiga a complete markup language. It used a standardized set of icons to indicate mouse driven commands available online and to recognize different filetypes present on BBS storage media. It was capable of transmitting data like images, audio files, and audio clips between users linked to the same BBS or off-line if the BBS was in the circuit of the FidoNet organization. On the PC, efforts were more oriented to extensions of the original terminal concept, with the GUI being described in the information on the host. One example was the Remote Imaging Protocol, essentially a picture description system, which remained relatively obscure. Probably the ultimate development of this style of operation was the dynamic page implementation of the University of Southern California BBS (USCBBS) by Susan Biddlecomb, which predated the implementation of the HTML Dynamic web page. A complete Dynamic web page implementation was accomplished using TBBS with a TDBS add-on presenting a complete menu system individually customized for each user. Rise of the Internet and decline of BBS[edit] The demand for complex ANSI and ASCII screens and larger file transfers taxed available channel capacity, which in turn increased demand for faster modems. 14.4 kbit/s modems were standard for a number of years while various companies attempted to introduce non-standard systems with higher performance – normally about 19.2 kbit/s. Another delay followed due to a long V.34 standards process before 28.8 kbit/s was released, only to be quickly replaced by 33.6 kbit/s, and then 56 kbit/s. These increasing speeds had the side effect of dramatically reducing the noticeable effects of channel efficiency. When modems were slow, considerable effort was put into developing the most efficient protocols and display systems possible. Running a general-purpose protocol like TCP/IP over a 1200 bit/s modem was a painful experience.[tone] With 56 kbit/s modems, however, the overhead was so greatly reduced as to be unnoticeable. Dial-up Internet service became widely available in 1994, and a must-have option for any general-use operating system by 1995. These developments together resulted in the sudden obsolescence of bulletin board technology in 1995 and the collapse of its supporting market. Technically, Internet service offered an enormous advantage over BBS systems, as a single connection to the user's Internet service provider allowed them to contact services around the world. In comparison, BBS systems relied on a direct point-to-point connection, so even dialing multiple local systems required multiple phone calls. Moreover, Internet protocols allowed that same single connection to be used to contact multiple services at the same time; for example, downloading files from an FTP library while checking the weather on a local news website. In comparison, a connection to a BBS allowed access only to the information on that system. Estimating numbers[edit] According to the FidoNet Nodelist, BBSes reached their peak usage around 1996, which was the same period that the World Wide Web and AOL became mainstream. BBSes rapidly declined in popularity thereafter, and were replaced by systems using the Internet for connectivity. Some of the larger commercial BBSes, such as MaxMegabyte and ExecPC BBS, evolved into Internet service providers. The website textfiles.com serves as an archive that documents the history of the BBS. The historical BBS list on textfiles.com contains over 105,000 BBSes that have existed over a span of 20 years in North America alone.[9] The owner of textfiles.com, Jason Scott, also produced BBS: The Documentary, a DVD film that chronicles the history of the BBS and features interviews with well-known people (mostly from the United States) from the heyday BBS era. In the 2000s, most traditional BBS systems migrated to the Internet using Telnet or SSH protocols. Between 700 and 800 are thought to be active in 2020 – fewer than 30 of these being of the traditional "dial-up" (modem) variety. Software and hardware[edit] Amiga 3000 running a two-line BBS Unlike modern websites and online services that are typically hosted by third-party companies in commercial data centers, BBS computers (especially for smaller boards) were typically operated from the system operator's home. As such, access could be unreliable, and in many cases, only one user could be on the system at a time. Only larger BBSes with multiple phone lines using specialized hardware, multitasking software, or a LAN connecting multiple computers, could host multiple simultaneous users. The first BBSes used homebrew[clarification needed] software,[b] quite often written or customized by the system operators themselves, running on early S-100 bus microcomputer systems such as the Altair 8800, IMSAI 8080 and Cromemco under the CP/M operating system. Soon after, BBS software was being written for all of the major home computer systems of the late 1970s era – the Apple II, Atari 8-bit family, Commodore and TRS-80 being some of the most popular. A few years later, in 1981, IBM introduced the first DOS based IBM PC, and due to the overwhelming popularity of PCs and their clones, DOS soon became the operating system on which the majority of BBS programs were run. RBBS-PC, ported over from the CP/M world, and Fido BBS, developed by Tom Jennings (who later founded FidoNet) were the first notable DOS BBS programs. Many successful commercial BBS programs were developed for DOS, such as PCBoard BBS, RemoteAccess BBS, and Wildcat! BBS. Some popular freeware BBS programs for DOS included Telegard BBS and Renegade BBS, which both had early origins from leaked WWIV BBS source code. There were several dozen other BBS programs developed over the DOS era, and many were released under the shareware concept, while some were released as freeware including iniquity. BBS systems on other systems remained popular, especially home computers, largely because they catered to the audience of users running those machines. The ubiquitous Commodore 64 (introduced in 1982) was a common platform in the 1980s. Popular commercial BBS programs were Blue Board, Ivory BBS, Color64 and CNet 64. In the early 1990s, a small number of BBSes were also running on the Commodore Amiga. Popular BBS software for the Amiga were ABBS, Amiexpress, C-Net, StormforceBBS, Infinity and Tempest. There was also a small faction of devoted Atari BBSes that used the Atari 800, then the 800XL, and eventually the 1040ST. The earlier machines generally lacked hard drive capabilities, which limited them primarily to messaging. MS-DOS continued to be the most popular operating system for BBS use up until the mid-1990s, and in the early years, most multi-node BBSes were running under a DOS based multitasker such as DESQview or consisted of multiple computers connected via a LAN. In the late 1980s, a handful of BBS developers implemented multitasking communications routines inside their software, allowing multiple phone lines and users to connect to the same BBS computer. These included Galacticomm's MajorBBS (later WorldGroup), eSoft The Bread Board System (TBBS), and Falken. Other popular BBS's were Maximus and Opus, with some associated applications such as BinkleyTerm being based on characters from the Berkley Breathed cartoon strip of Bloom County. Though most BBS software had been written in BASIC or Pascal (with some low-level routines written in assembly language), the C language was starting to gain popularity. By 1995, many of the DOS-based BBSes had begun switching to modern multitasking operating systems, such as OS/2, Windows 95, and Linux. One of the first graphics-based BBS applications was Excalibur BBS with low-bandwidth applications that required its own client for efficiency. This led to one of the earliest implementations of Electronic Commerce in 1996 with replication of partner stores around the globe. TCP/IP networking allowed most of the remaining BBSes to evolve and include Internet hosting capabilities. Recent BBS software, such as Synchronet, Mystic BBS, EleBBS, DOC or Wildcat! BBS, provide access using the Telnet protocol rather than dialup, or by using legacy DOS-based BBS software with a FOSSIL-to-Telnet redirector such as NetFoss. Presentation[edit] Welcome screen of Neon#2 BBS (Tornado) BBSes were generally text-based, rather than GUI-based, and early BBSes conversed using the simple ASCII character set. However, some home computer manufacturers extended the ASCII character set to take advantage of the advanced color and graphics capabilities of their systems. BBS software authors included these extended character sets in their software, and terminal program authors included the ability to display them when a compatible system was called. Atari's native character set was known as ATASCII, while most Commodore BBSes supported PETSCII. PETSCII was also supported by the nationwide online service Quantum Link.[c] The use of these custom character sets was generally incompatible between manufacturers. Unless a caller was using terminal emulation software written for, and running on, the same type of system as the BBS, the session would simply fall back to simple ASCII output. For example, a Commodore 64 user calling an Atari BBS would use ASCII rather than the native character set of either. As time progressed, most terminal programs began using the ASCII standard, but could use their native character set if it was available. COCONET, a BBS system made by Coconut Computing, Inc., was released in 1988 and only supported a GUI (no text interface was initially available but eventually became available around 1990), and worked in EGA/VGA graphics mode, which made it stand out from text-based BBS systems. COCONET's bitmap and vector graphics and support for multiple type fonts were inspired by the PLATO system, and the graphics capabilities were based on what was available in the Borland Graphics Interface library. A competing approach called Remote Imaging Protocol (RIP) emerged and was promoted by Telegrafix in the early to mid-1990s but it never became widespread. A teletext technology called NAPLPS was also considered, and although it became the underlying graphics technology behind the Prodigy service, it never gained popularity in the BBS market. There were several GUI-based BBSes on the Apple Macintosh platform, including TeleFinder and FirstClass, but these were mostly confined to the Mac market. In the UK, the BBC Micro based OBBS software, available from Pace for use with their modems, optionally allowed for color and graphics using the Teletext based graphics mode available on that platform. Other systems used the Viewdata protocols made popular in the UK by British Telecom's Prestel service, and the on-line magazine Micronet 800 whom were busy giving away modems with their subscriptions. Over time, terminal manufacturers started to support ANSI X3.64 in addition to or instead of proprietary terminal control codes, e.g., color, cursor positioning. The most popular form of online graphics was ANSI art, which combined the IBM Extended ASCII character set's blocks and symbols with ANSI escape sequences to allow changing colors on demand, provide cursor control and screen formatting, and even basic musical tones. During the late 1980s and early 1990s, most BBSes used ANSI to make elaborate welcome screens, and colorized menus, and thus, ANSI support was a sought-after feature in terminal client programs. The development of ANSI art became so popular that it spawned an entire BBS "artscene" subculture devoted to it. BBS ANSI Login Screen example The Amiga Skyline BBS software was the first in 1987 featuring a script markup language communication protocol called Skypix which was capable of giving the user a complete graphical interface, featuring rich graphics, changeable fonts, mouse-controlled actions, animations and sound.[10] Today, most BBS software that is still actively supported, such as Worldgroup, Wildcat! BBS and Citadel/UX, is Web-enabled, and the traditional text interface has been replaced (or operates concurrently) with a Web-based user interface. For those more nostalgic for the true BBS experience, one can use NetSerial (Windows) or DOSBox (Windows/*nix) to redirect DOS COM port software to telnet, allowing them to connect to Telnet BBSes using 1980s and 1990s era modem terminal emulation software, like Telix, Terminate, Qmodem and Procomm Plus. Modern 32-bit terminal emulators such as mTelnet and SyncTerm include native telnet support. Content and access[edit] Since most early BBSes were run by computer hobbyists, they were typically technical in topic, with user communities revolving around hardware and software discussions. As the BBS phenomenon grew, so did the popularity of special interest boards. Bulletin Board Systems could be found for almost every hobby and interest. Popular interests included politics, religion, music, dating, and alternative lifestyles. Many system operators also adopted a theme in which they customized their entire BBS (welcome screens, prompts, menus, and so on) to reflect that theme. Common themes were based on fantasy, or were intended to give the user the illusion of being somewhere else, such as in a sanatorium, wizard's castle, or on a pirate ship. In the early days, the file download library consisted of files that the system operators obtained themselves from other BBSes and friends. Many BBSes inspected every file uploaded to their public file download library to ensure that the material did not violate copyright law. As time went on, shareware CD-ROMs were sold with up to thousands of files on each CD-ROM. Small BBSes copied each file individually to their hard drive. Some systems used a CD-ROM drive to make the files available. Advanced BBSes used Multiple CD-ROM disc changer units that switched 6 CD-ROM disks on demand for the caller(s). Large systems used all 26 DOS drive letters with multi-disk changers housing tens of thousands of copyright-free shareware or freeware files available to all callers. These BBSes were generally more family-friendly, avoiding the seedier side of BBSes. Access to these systems varied from single to multiple modem lines with some requiring little or no confirmed registration. Some BBSes, called elite, WaReZ or pirate boards, were exclusively used for distributing cracked software, phreaking, and other questionable or unlawful content. These BBSes often had multiple modems and phone lines, allowing several users to upload and download files at once. Most elite BBSes used some form of new user verification, where new users would have to apply for membership and attempt to prove that they were not a law enforcement officer or a lamer. The largest elite boards accepted users by invitation only. Elite boards also spawned their own subculture and gave rise to the slang known today as leetspeak. Another common type of board was the support BBS run by a manufacturer of computer products or software. These boards were dedicated to supporting users of the company's products with question and answer forums, news and updates, and downloads. Most of them were not a free call. Today, these services have moved to the Web. Some general-purpose Bulletin Board Systems had special levels of access that were given to those who paid extra money, uploaded useful files or knew the system operator personally. These specialty and pay BBSes usually had something unique to offer their users, such as large file libraries, warez, pornography, chat rooms or Internet access. Pay BBSes such as The WELL and Echo NYC (now Internet forums rather than dial-up), ExecPC, PsudNetwork and MindVox (which folded in 1996) were admired for their tight-knit[colloquialism] communities and quality discussion forums. However, many free BBSes also maintained close knit communities, and some even had annual or bi-annual events where users would travel great distances to meet face-to-face with their on-line friends. These events were especially popular with BBSes that offered chat rooms. Some of the BBSes that provided access to illegal content faced opposition. On July 12, 1985, in conjunction with a credit card fraud investigation, the Middlesex County, New Jersey Sheriff's department raided and seized The Private Sector BBS, which was the official BBS for grey hat hacker quarterly 2600 Magazine at the time.[11] The notorious Rusty n Edie's BBS, in Boardman, Ohio, was raided by the FBI in January 1993 for trading unlicensed software, and later sued by Playboy for copyright infringement in November 1997. In Flint, Michigan, a 21-year-old man was charged with distributing child pornography through his BBS in March 1996.[12] Networks[edit] Most early BBSes operated as individual systems. Information contained on that BBS never left the system, and users would only interact with the information and user community on that BBS alone. However, as BBSes became more widespread, there evolved a desire to connect systems together to share messages and files with distant systems and users. The largest such network was FidoNet. As is it was prohibitively expensive for the hobbyist system operator to have a dedicated connection to another system, FidoNet was developed as a store and forward network. Private email (Netmail), public message boards (Echomail) and eventually even file attachments on a FidoNet-capable BBS would be bundled into one or more archive files over a set time interval. These archive files were then compressed with ARC or ZIP and forwarded to (or polled by) another nearby node or hub via a dialup Xmodem session. Messages would be relayed around various FidoNet hubs until they were eventually delivered to their destination. The hierarchy of FidoNet BBS nodes, hubs, and zones was maintained in a routing table called a Nodelist. Some larger BBSes or regional FidoNet hubs would make several transfers per day, some even to multiple nodes or hubs, and as such, transfers usually occurred at night or in the early morning when toll rates were lowest. In Fido's heyday, sending a Netmail message to a user on a distant FidoNet node, or participating in an Echomail discussion could take days, especially if any FidoNet nodes or hubs in the message's route only made one transfer call per day. FidoNet was platform-independent and would work with any BBS that was written to use it. BBSes that did not have integrated FidoNet capability could usually add it using an external FidoNet front-end mailer such as SEAdog, FrontDoor, BinkleyTerm, InterMail or D'Bridge, and a mail processor such as FastEcho or Squish. The front-end mailer would conduct the periodic FidoNet transfers, while the mail processor would usually run just before and just after the mailer ran. This program would scan for and pack up new outgoing messages, and then unpack, sort and "toss" the incoming messages into a BBS user's local email box or into the BBS's local message bases reserved for Echomail. As such, these mail processors were commonly called "scanner/tosser/packers". Many other BBS networks followed the example of FidoNet, using the same standards and the same software. These were called FidoNet Technology Networks (FTNs). They were usually smaller and targeted at selected audiences. Some networks used QWK doors, and others such as RelayNet (RIME) and WWIVnet used non-Fido software and standards. Before commercial Internet access became common, these networks of BBSes provided regional and international e-mail and message bases. Some even provided gateways, such as UFGATE, by which members could send and receive e-mail to and from the Internet via UUCP, and many FidoNet discussion groups were shared via gateway to Usenet. Elaborate schemes allowed users to download binary files, search gopherspace, and interact with distant programs, all using plain-text e-mail. As the volume of FidoNet Mail increased and newsgroups from the early days of the Internet became available, satellite data downstream services became viable for larger systems. The satellite service provided access to FidoNet and Usenet newsgroups in large volumes at a reasonable fee. By connecting a small dish and receiver, a constant downstream of thousands of FidoNet and Usenet newsgroups could be received. The local BBS only needed to upload new outgoing messages via the modem network back to the satellite service. This method drastically reduced phone data transfers while dramatically increasing the number of message forums. FidoNet is still in use today, though in a much smaller form, and many Echomail groups are still shared with Usenet via FidoNet to Usenet gateways. Widespread abuse of Usenet with spam and pornography has led to many of these FidoNet gateways to cease operation completely. Shareware and freeware[edit] Main article: Shareware Much of the shareware movement was started via user distribution of software through BBSes. A notable example was Phil Katz's PKARC (and later PKZIP, using the same ".zip" algorithm that WinZip and other popular archivers now use); also other concepts of software distribution like freeware, postcardware like JPEGview and donationware like Red Ryder for the Macintosh first appeared on BBS sites. Doom from id Software and nearly all Apogee Software games were distributed as shareware (Apogee is, in fact, credited for adding an order form to a shareware demo).[citation needed] The Internet has largely erased the distinction of shareware – most users now download the software directly from the developer's website rather than receiving it from another BBS user 'sharing' it. Today shareware is commonly used to mean electronically-distributed software from a small developer. Many commercial BBS software companies that continue to support their old BBS software products switched to the shareware model or made it entirely free. Some companies were able to make the move to the Internet and provide commercial products with BBS capabilities. Features[edit] A classic BBS had: A computer One or more modems One or more phone lines, with more allowing for increased concurrent users A BBS software package A sysop – system operator A user community The BBS software usually provides: Menu systems One or more message bases Uploading and downloading of message packets in QWK format using XMODEM, YMODEM or ZMODEM File areas Live viewing of all caller activity by the system operator Voting – opinion booths Statistics on message posters, top uploaders / downloaders Online games (usually single player or only a single active player at a given time) A doorway to third-party online games Usage auditing capabilities Multi-user chat (only possible on multi-line BBSes) Internet email (more common in later Internet-connected BBSes) Networked message boards Most modern BBSes allow telnet access over the Internet using a telnet server and a virtual FOSSIL driver. A "yell for SysOp" page caller side menu item that sounded an audible alarm to the system operator. If chosen, the system operator could then initiate a text-to-text chat with the caller. Primitive social networking features, such as leaving messages on a user's profile See also[edit] Internet portal ANSI art BBS: The Documentary Computer magazine Free-net Imageboard Internet forum Internet Relay Chat KOM (BBS) List of BBS software List of bulletin board systems Minitel Online magazine PODSnet Shell account Terminal emulator Textboard User-generated content Usenet Warez Notes[edit] ^ Technically they could have used an Automatic Calling Unit, but that was not economically viable.[citation needed] ^ CBBS Chicago (which Ward Christensen programmed) was about 20,000 lines of 8080 assembler. ^ Quantum Link and parts of AppleLink went on to become America Online. References[edit] Citations[edit] ^ a b Frank 1. Derfler. Jr. (1980-04-01). "Dial Up Directory". Kilobaud Microcomputing Magazine. Retrieved 2018-02-20. ^ "Thinking Chinese - Chinese BBS – The Social Activity that Never Grows Old". thinkingchinese.com. Retrieved 14 April 2018. ^ Crosby, Kip (November 1995). "CONVIVIAL CYBERNETIC DEVICES: From Vacuum Tube Flip-Flops to the Singing Altair - An Interview with Lee Felsenstein (Part 1)" (PDF). The Analytical Engine. Computer History Association of California. 3 (1): 2. ISSN 1071-6351. ^ Crosby, Kip (February 1996). "COMPUTERS FOR THEIR OWN SAKE: From the Dompier Music to the 1980 Computer Faire - An Interview with Lee Felsenstein (Part 2)" (PDF). The Analytical Engine. Computer History Association of California. 3 (2): 8. ISSN 1071-6351. ^ Christensen, Ward; Suess, Randy (November 1978). "Hobbyist Computerized Bulletin Board System" (PDF). Byte. Vol. 3 no. 11. Peterborough, NH: Byte Publications. pp. 150–157. Archived (PDF) from the original on January 28, 2018. Retrieved February 16, 2019. The Computerized Hobbyist Bulletin Board System ... was conceived, designed, built, programmed, tested, and installed in a 30 day period (January 16, 1978 to February 16, 1978) by the two of us. Alt URL ^ Collection of Memories of writing and running the first BBS by Ward Christensen (Circa 1992), BBSDocumentary.com, retrieved June 30, 2007 ^ "File Sponges, the BBS nightmare" Archived 2015-01-20 at the Wayback Machine, Chips 'n Bits ^ Chips 'n' Bits : the Northern Territory Computer Users' newsletter, catalogue.nla.gov.au, retrieved March 15, 2009 ^ "The TEXTFILES.COM BBS List". bbslist.textfiles.com. Retrieved 2021-07-01. ^ Scott Lee. "BBSDocumentary, An Overview of BBS Programs". Jason Scott for Wired Magazine (?). Retrieved 2017-04-06. ^ This Day in Geek History: July12, thegreatgeekmanual.com, retrieved March 26, 2009 ^ Doran, Tim (1996-03-20). "Man Says Kiddie Porno Made Computer Site Popular". The Flint Journal. Sources[edit] Jones, Steve (2003). Encyclopedia of New Media: An Essential Reference to Communication and Technology. ISBN 0-7619-2382-9. Gross, Larry P.; Woods, James D.; Woods, Professor James D. (1999). The Columbia Reader on Lesbians and Gay Men in Media, Society, and Politics. ISBN 0-231-10446-4. Rathbone, Tina (1993). Modems for Dummies. ISBN 1-56884-001-2. Haas, Lou (1984). Going On-Line with Your Micro. Tab Books. ISBN 0-8306-0746-3. University of Michigan (October 1989 – September 1994). "Compute". Compute! Publications. Cite journal requires |journal= (help) Cane, Mike (1986). The Computer Phone Book. New American Library. Christians in a .Com World: Getting Connected Without Being Consumed. ISBN 1-58134-218-7. Pippen, Patrick (July 2004). Beam Me Up Scottie. ISBN 1-4116-0987-5. External links[edit] Bulletin board systemat Wikipedia's sister projects Definitions from Wiktionary Media from Wikimedia Commons Data from Wikidata The BBS Corner The BBS Documentary – (Video Collection) BBSmates community and resource site (archive from 2013) The Telnet BBS Guide Textfiles.com – Collection of historical BBS documents, files and history The BBS organization (longest running bbs services site) The Lost Civilization of Dial-Up Bulletin Board Systems (The Atlantic, 2016) Bulletin Board Systems at Curlie v t e Bulletin board systems List of bulletin board systems List of BBS software List of BBS door games Culture ANSI art Chat room File sharing Protocols Timeline MUD Sysop Virtual community Technologies ANSI escape code BBS door Internet outdial Remote Imaging Protocol Skypix Networks FidoNet RelayNet WWIVnet Media coverage BBS: The Documentary Boardwatch Computer Shopper textfiles.com People Ward Christensen Randy Suess Chuck Forsberg Tom Jennings Steve Punter Jason Scott v t e Computer-mediated communication Online chat Online discussion Communication software Collaborative software Social network service Virtual learning environment Asynchronous conferencing Email Electronic mailing list FidoNet Usenet Internet forum Textboard Imageboard Shoutbox Bulletin board system Online guestbook Synchronous conferencing Data conferencing Instant messaging Internet Relay Chat LAN messenger Talker Videoconferencing Voice over IP Voice chat in online gaming Web chat Web conferencing Publishing Blog Microblogging Wiki Authority control National libraries United States Japan Other Microsoft Academic Retrieved from "https://en.wikipedia.org/w/index.php?title=Bulletin_board_system&oldid=1031936879" Categories: American inventions Bulletin board systems Online chat Pre–World Wide Web online services Internet forums Virtual communities Computer-mediated communication Telephony Telnet Computer-related introductions in 1978 Hidden categories: All articles with unsourced statements Articles with unsourced statements from July 2021 Webarchive template wayback links Articles with short description Short description matches Wikidata Articles lacking in-text citations from April 2020 All articles lacking in-text citations Articles with unsourced statements from November 2010 Wikipedia articles with style issues from July 2021 All articles with style issues Wikipedia articles needing clarification from July 2021 Articles with unsourced statements from December 2012 CS1 errors: missing periodical Pages using Sister project links with hidden wikidata Pages using Sister project links with default search Articles with Curlie links Wikipedia articles with LCCN identifiers Wikipedia articles with NDL identifiers Wikipedia articles with MA identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية বাংলা Català Čeština Dansk Deutsch Eesti Español Esperanto فارسی Français 한국어 Hrvatski Bahasa Indonesia Italiano עברית Lietuvių Lombard Magyar Nederlands 日本語 Norsk bokmål Polski Português Română Русский Slovenčina Slovenščina Српски / srpski Srpskohrvatski / српскохрватски Suomi Svenska ไทย Türkçe Українська 中文 Edit links This page was last edited on 4 July 2021, at 15:55 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7906 ---- Arthur J. Cramp - Wikipedia Arthur J. Cramp From Wikipedia, the free encyclopedia Jump to navigation Jump to search British-born American medical doctor, researcher, and writer (1872–1951) Arthur J. Cramp Born 10 September 1872 London, England Died 25 November 1951 (aged 79) Hendersonville, North Carolina Nationality English Alma mater Wisconsin College of Physicians and Surgeons Occupation Medical Researcher and Writer Known for Director of the Bureau of Investigation of the American Medical Association Spouse(s) Lillian Torrey Children Torrey Arthur Joseph Cramp (September 10, 1872 – November 25, 1951) was a medical doctor, researcher, and writer. He served as director of the American Medical Association's (AMA) Propaganda for Reform Department (later, the Bureau of Investigation and, then the Department of Investigation)[1] from 1906 to 1936. He was a regular contributor to the Journal of the American Medical Association (JAMA).[2] Cramp was "a bitter opponent of proprietary and medicinal abuses."[3] His three volume series on 'Nostrums and Quackery', along with his public lectures to schools, professional groups, and civic organizations across the country,[1] helped bring awareness to the problem of patent medicines or nostrums, by subjecting the claims (made by predominantly non-medical people) to scientific analysis. He was critical the 1906 Pure Food and Drug Act, and advocated stronger regulation of product labeling and advertising.[1] In an article announcing his death, the AMA called him "a pioneer in the fight against quackery and fraud in the healing arts."[2] Contents 1 Early life and education 2 Career 3 Nostrums and quackery 4 Memberships 5 Personal life 6 Death 7 Selected articles 8 Books 9 References 10 Further reading Early life and education[edit] Arthur Joseph Cramp was born in London, England.[4] His father was a blacksmith. He received his "preliminary education" in England[4] before moving to the United States in his late teens,[5] around 1891.[2] Cramp, purportedly, decided to enter medical school after his infant daughter became ill and was treated by a quack. She subsequently died.[5][1] Cramp received his training as a medical doctor from the Wisconsin College of Physicians and Surgeons at Milwaukee, where he graduated in 1906.[6][5][4] Career[edit] Cramp taught science at the high school level in Milwaukee, Wisconsin[5][2] and at the Seminary and the Maryville, Missouri high school.[7] He also worked at the Wisconsin Industrial School for Boys, a reformatory high school in Waukesha, Wisconsin before entering medical school.[1] While at the Wisconsin College of Physicians and Surgeons, Cramp worked as an assistant in chemistry.[2] Cramp joined the American Medical Association staff in 1906 as an editorial assistant.[5] He then became the Director for the newly-formed Propaganda for Reform Department.[8] Cramp made it his mission to correspond with professionals and members of the public regarding medical treatments, products, and the business practices of individuals and companies involved in marketing them.[1] His office also maintained a laboratory for testing various products.[4] He wrote about many of these interactions and investigations in the Journal of the American Medical Association and Hygeia, a health magazine.[2][9] By 1910, Cramp's "Fake File," listing "products, firms, and names of promoters", contained over 12,000 entries. He kept a "Testimonial File" for doctors who endorsed proprietary drugs through testimonials; over 13,000 American doctors and 3,000 foreign doctors.[5] His office became a clearing house for information regarding untested and, sometimes, dangerous practices. His department was aware of the health risks, as well as the financial losses to consumers who were duped by fake medicine vendors.[10] Cramp advocated truth in advertising, particularly for general consumption (patent) medicines containing "secret formulas,"[5][11] including alcohol.[12] He and his office called for the standardization of medicines (ingredients and dosages) and educating the public on appropriate use. He wrote, "When the public is properly informed, so that it knows what preparations to call for in order to treat its simpler ailments, advertising of secret remedies will be entirely unnecessary."[5] He considered the emotive nature of radio advertisements of quack medicine more harmful than newspaper advertisements. According to Cramp, unlike radio, newspapers had "developed standards of decency and censorship" when determining whether or not to run the advertisements.[13] The Pure Food and Drugs Act of 1906, followed by the 1912 Sherley Amendment, was an attempt to address these issues.[1] However, Cramp warned that federal legislation attempting to address false advertising and interstate trafficking of products did not fully protect the public.[14] "No man has any moral right to so advertise as to make well persons think they are sick and sick persons thing they are very sick. Such advertising is an offense against the public health." — Arthur J. Cramp[15][1] In 1936, Cramp retired from the Bureau due to ill health, after suffering from a heart attack in 1934.[1] Upon hearing of his retirement, the British Medical Journal published this statement: "The quack nostrum trade is international in its activities, and the British medical profession owes a great debt to Dr. Cramp for providing it with the information necessary for combating both home-produced and imported frauds. We can only state our thanks and express the hope that he will enjoy the leisure he has earned by his many years of strenuous combat."[8] Nostrums and quackery[edit] In 1911, Cramp published the first of three volumes called Nostrums and Quackery,[3] which would become "a veritable encyclopedia on the nostrum evil and quackery."[1] The first volume contained the educational materials, case histories, and testimonials his department had been collecting.[5] Nostrums and Quackery, Volume II, published in 1921, was a collection of legal reports of case law involving nostrums and patent medicine reprinted from the Journal of the American Medical Association meant to educate the general public. As reviewer Joseph MacQueen stated, "The matter that appears has been prepared and written in no spirit of malice, and with no object except that of laying before the public certain facts, the knowledge of which is essential to a proper concept of community health."[16] Cramp's Nostrums and Quackery and Pseudo-Medicine, Volume III, foreword by George H. Simmons, Editor Emeritus of the Journal of the American Medical Association,[8] was published in 1936. As described in The Science News-Letter, the book contained "terse, simple and factual accounts of hundreds of nostrums and the ways of pseudo-medical practitioners."[17] This volume, more condensed than the first two volumes, indexed 1,500 "remedies."[8] W.A. Evans, in his review, wrote "When you have read this book you will consider credulity based on fiction rather drab."[18] A sampling of "quack cures" which Cramp included in his books and lectures: deafness "cures" (subjecting individuals with hearing loss to airplane nose-dives),[19] beauty "cures" (hair dyes, freckle removers, and reducing lotions containing harmful ingredients or promoted with false claims about their efficacy),[19]{ obesity "cures" (including tapeworms, products containing dinitrophenol, arsenic, and other dangerous substances),[20] cancer "quackery" (alternate cancer therapies),[21] "consumption cure quackery" (elixirs from a bottle whose "alleged cures for consumption are born weekly"),[22] and the Wilshire I-ON-A-CO (a magnetic belt purported to cure cancer, Bright's disease and paralysis, pernicious anemia to health, deafness, muteness, and St. Vitus' dance).[23][24] "The remedy for the menace of the fake consumption cure is education - and more education. People are gullible not because they lack brains, but because they lack knowledge. Iteration and reiteration of the fundamental facts regarding the prevention and cure of tuberculosis is the only way of overcoming the present toll of human life taken by the consumption quack cure." — Arthur J. Cramp[22] Memberships[edit] As reported in JAMA,[2] Cramp was a member of the following: Associate Fellow of the American Medical Association Indiana State Medical Association Society of Medical History of Chicago Institute of Medicine of Chicago Royal Institute of Public Health Chicago Ornithology Society Phi Rho Sigma Chicago Library Club Personal life[edit] Cramp was married to Lilly Torrey of Skidmore, Missouri,[7] daughter of L.N. Torrey.[25] They had a daughter, Torrey, who died on January 2, 1900. The infant's death was caused by seizures related to meningitis.[1] Death[edit] Cramp died on November 25, 1951, in Hendersonville, North Carolina. He was 79. The cause of death was, reportedly, arteriosclerosis and urema.[2] Selected articles[edit] Modern Advertising and the Nostrum (1918)[26] The Nostrum and the Public Health (1919)[27] Self-Doctoring (1920)[28] Patent Medicines: What is a 'Patent Medicine' and Why? (1923) [29] Patent Medicines: What Protection Does the National Food and Drugs Act Give? (1923)[30] Therapeutic Thaumaturgy (1924)[31] I-ON-A-CO - The Magic Horse Collar? (1927)[32] The Nostrum and the Public Health (1929)[33] The Bureau of Investigation of the American Medical Association (1931)[34] The Work of the Bureau of Investigation (1933)[11] Salts and Crystals Quackery (1935)[35] Books[edit] Nostrums and Quackery: Articles on the Nostrum Evil, Quackery and Allied Matters Affecting the Public Health, Volume 1 (1912) Nostrums and Quackery: Articles on the Nostrum Evil, Quackery and Allied Matters Affecting the Public Health, Volume 2 (1921) Nostrums and Quackery and Pseudo-Medicine, Volume 3 (1936) References[edit] ^ a b c d e f g h i j k Blaskiewicz, Robert; Jarsulic, Mike (November 2018). "Arthur J. Cramp: The Quackbuster Who Professionalized American Medicine". Skeptical Inquirer. 42 (6): 45–50. Retrieved 17 December 2018. ^ a b c d e f g h "Deaths. Cramp, Arthur Joseph". JAMA. 147 (17): 1773. December 29, 1951. doi:10.1001/jama.1951.03670350053022. ^ a b Jackson, Charles O. (1970). "Through the Looking Glass". Food and Drug Legislation in the New Deal. Princeton University Press. pp. 19–20. JSTOR j.ctt13x1b4x.4. ^ a b c d "Dr. Cramp to Speak Here". Dubuque Telegraph Herald and Times Journal. Dubuque, Iowa. November 12, 1933. p. 12. ^ a b c d e f g h i Young, James Harvey (1967). "The New Muckrackers". The Medical Messiahs: A Social History of Medical Quackery in 20th Century America. Princeton University Press. pp. 66–87. JSTOR j.ctt13x1dp5.11. ^ Fishbein, Morris (December 1933). "The Protection of the Consumer of Food and Drugs: A Symposium". Law and Contemporary Problems. Duke University School of Law. 1 (1): 50–51. JSTOR 1189451. ^ a b "Dr. Arthur J. Cramp". The Maryville Daily Forum (42 (140)). November 28, 1951. p. 1. ^ a b c d "The Work of Dr. Cramp". The British Medical Journal. BMJ. 1 (3975): 565. March 13, 1937. JSTOR 25356046. ^ "Medical News". The British Journal. BMJ. 1 (3250): 665. April 14, 1923. JSTOR 20423157. ^ Gibbons, Roy J. (March 6, 1926). "Pink Pills and Quacks cost Americans millions". Iowa City Press Citizen. Iowa City, Iowa. p. 3. ^ a b Cramp, Arthur J. (December 1933). "The Work of the Bureau of Investigation". Law and Contemporary Problems. 1 (1): 51–54. doi:10.2307/1189452. JSTOR 1189452. ^ "Alky in Medicine Defeats Dry Law: Chicago doctors say prohibition won't be success until it's removed". Mitchell Evening Republic. South Dakota. May 9, 1929. p. 6. ^ "Would bar 'Quacks' from radio talks: Doctors urge federal commission and broadcasters to revise programs". New York Times. May 16, 1935. p. 32. ^ "Health Notes". Santa Ana Register. Santa Ana, California. April 27, 1923. p. 22. ^ "Dr. Cramp Declares Promoting Sale of "Patent Medicines" Denounces Advertising of So-Called Cures". The Ogden Standard. Ogden, Utah. October 18, 1918. p. 8. ^ MacQueen, Joseph (January 22, 1922). "Books". Oregonian. Portland, Oregon: Morning Oregonian. p. 3. ^ "First Glances at New Books". The Science News-Letter. 31 (837): 271–272. April 24, 1937. JSTOR 3913679. ^ Evans, Dr. W.A. (March 14, 1922). "How to Keep Well". Times-Picayune. New Orleans, Louisiana. p. 8. ^ a b "Ridicules flying as deafness cure: Dr. Cramp tells association for hard of hearing air stunts may be harmful". New York Times. June 18, 1930. p. 34. Retrieved 18 December 2018. ^ Farrell, Amy Edman (2011). "Fat, Modernity, and the Problem of Excess". Fat Shame: Stigma and the Fat Body in American Culture. NYU Press. pp. 24–58. JSTOR j.ctt9qg7v0.5. ^ Clow, Barbara (2001). "The Contours of Legitimate Medicine: Doctors, Alternative Practitioners, and Cancer". Negotiating Disease: Power and Cancer Care, 1900-1950. McGill-Queen's University Press. JSTOR j.ctt80vkn.7. ^ a b "Quackery Cure for TB Scored". The Daily Herald. Biloxi, Mississippi. September 14, 1928. p. 14. ^ Fishbein, Morris (October 1927). "The Month in Midical Science". Scientific American. 137 (4): 314–315. Bibcode:1927SciAm.137..314F. doi:10.1038/scientificamerican1027-314. JSTOR 26121489. ^ Davis, Jr., Donald G. (December 1967). "The Ionaco of Gaylord Wilshire". Southern California Quarterly. 49 (4): 425–453. doi:10.2307/41170129. JSTOR 41170129. ^ "Mrs. Cramp Visits Here". Maryville Daily Democrat Forum. Maryville, Missouri. August 16, 1924. ^ Cramp, Arthur J. (October 1, 1918). "Modern Advertising and the Nostrum". American Journal of Public Health. 8 (10): 756–58. doi:10.2105/AJPH.8.10.756. PMC 1362341. PMID 18009965. ^ Cramp, Arthur J. (May 24, 1919). "The Nostrum and the Public Health". JAMA. 72 (21): 1531. doi:10.1001/jama.1919.02610210026008. Retrieved 17 December 2018. ^ Cramp, Arthur J. (May 19, 1920). "Self-Doctoring". New Castle News. New Castle, Pennsylvania. ^ Cramp, Arthur J. (April 1923). "Patent Medicines: What is a 'Patent Medicine' and Why?". Hygeia. Chicago, IL: American Medical Association. 1 (1): 43–45. ^ Cramp, Arthur J. (May 1923). "Patent Medicines: What Protection Does the National Food and Drugs Act Give?". Hygeia. 1 (2): 106. ^ Cramp, Arthur J. (1924). "Therapeutic Thaumaturgy". American Mercury. 3: 423–30. ^ Cramp, Arthur J. (February 1927). "I-ON-A-CO - The Magic Horse Collar?". Hygeia. V: 70. ^ Cramp, Arthur J. (December 26, 1929). "The Nostrum and the Public Health". New England Journal of Medicine. 201 (26): 1297–1300. doi:10.1056/NEJM192912262012611. ^ Cramp, Arthur J. (July–August 1931). "The Bureau of Investigation of the American Medical Association". The American Journal of Police Science. 2 (4): 285–289. doi:10.2307/1147355. JSTOR 1147355. ^ Cramp, Arthur J. (July 1935). "Salts and Crystals Quackery". Hygeia. 13: 617. Further reading[edit] Eric W. Boyle. (2013). Quack Medicine: A History of Combating Health Fraud in Twentieth-century America. Praeger. pp. 63-86. ISBN 978-0-313-38567-4 Harvey Young, James (1995). "Arthur Cramp: Quackery Foe". Pharmacy in History. 37 (4): 176–182. Retrieved from "https://en.wikipedia.org/w/index.php?title=Arthur_J._Cramp&oldid=1021812723" Categories: 1872 births 1951 deaths 19th-century American physicians American skeptics American medical writers American people of English descent Critics of alternative medicine Hidden categories: CS1: Julian–Gregorian uncertainty Articles with short description Short description is different from Wikidata Articles with hCards Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Add links This page was last edited on 6 May 2021, at 20:30 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7908 ---- No-code development platform - Wikipedia No-code development platform From Wikipedia, the free encyclopedia Jump to navigation Jump to search Software development services No-code development platform (NCDPs) allow programmers and non-programmers to create application software through graphical user interfaces and configuration instead of traditional computer programming. No-code development platforms are closely related to low-code development platforms as both are designed to expedite the application development process. These platforms have both increased in popularity as companies deal with the parallel trends of an increasingly mobile workforce and a limited supply of competent software developers.[1] A typical low-code development environment consists of these characteristics: Drag and drop interfaces allow for easy development processes. A visual modelling tool that allows you to create the UIs, data models, and functionality with the option to add in hand-written code when needed. Connectors that handle the data structures, retrieval, and storage. Out of the box functionality allows you to skip having to build your core modules from scratch, and instead focus on building new code. Automated application lifecycle manager that allows for building, deploying, debugging, and the staging and production process. While low-code tools generally follow these guidelines, no two low-code tools are alike, and they are all designed to cater to specific functionality. Platforms vary widely in their functionality, integrations, and market niche. Some applications may focus solely on a specific business function such as data capture or workflow while others may seek to integrate entire enterprise resource planning tools into a mobile form factor.[2] No-code development platforms are closely related to Visual programming languages.[3] Contents 1 Use 2 No-Code vs. Low-Code 3 Security concerns 4 Criticisms 5 Notable no-code development platforms 6 See also 7 References 8 External links Use[edit] NCDPs are used to meet the needs of companies that are seeking to digitize processes through cloud-based mobile applications. No-code tools are often designed with line of business users in mind as opposed to traditional IT. This shift in focus is meant to help accelerate the development cycle by bypassing traditional IT development constraints of time, money, and scarce software development human capital resources to allow teams to align their business strategy with a rapid development process.[4] NCDPs also often leverage enterprise-scale APIs and web service catalogs, open data sets, and tested and proven template galleries, to help integrate existing business systems while adding a practical layer of user functionality. [5] The transition from traditional enterprise software to a lean development methodology is also changing the role of traditional IT leaders and departments. Whereas IT once provided not only approval of new technology but procurement and development of new tools, IT's role is now increasingly one of governance over line of business who develop niche tools for their work stream.[6] The potential benefits of utilizing a NCDP include: Access - By 2018, it has been estimated that over than half of all B2E (business-to-employee) mobile apps would be created by enterprise business analysts using codeless tools. This ongoing shift is increasing the number of potential app creators from individuals with coding skills to anyone with internet access and functional business acumen. [7] Agility - NCDPs typically provide some degree of templated user-interface and user experience functionality for common needs such as forms, workflows, and data display allowing creators to expedite parts of the app creation process. [8] Richness - NCDPs which at one point were limited to more basic application functions increasingly provide a level of feature-richness and integrations that allows users to design, develop, and deploy apps that meet specific business needs. [9] The common worker is becoming busier/working longer hours on average [13] and with the proliferation of low code software tools and more access to business APIs, there is a clear opportunity for workers to automate their current tasks using these new no-code development platforms. There are thousands of platforms out there with enterprises, on average, having deployed over 288 different SaaS apps in their business. No-Code vs. Low-Code[edit] The distinction between no-code and low-code development platforms can seem blurry depending on the nature of an app platform's full set of functionality. However, there are a number of key distinctions that set apart the design and use cases for each type of platform. App Creator - No-code platforms are accessible to any end-business user while low-code platforms require developers with knowledge of coding languages who can work within a platform's constraints to streamline the development process. Core Design - No-code platforms tend to function off a model-driven, declarative approach where the end user dictates an app's design through drag and drop manipulation or simple logic. Low-code platforms often employ a similar development model with a greater dependence on hand coding for dictating an application's core architecture. User Interface - No-code platforms most often rely on a preset User Interface layer which simplifies and streamlines an app's design. Low-code platforms may provide greater flexibility in UI options at the cost of additional coding requirements.[2] Security concerns[edit] As no-code development platforms continue to gain in popularity, concerns over platform security have risen as well, particularly for apps that handle consumer data. A common assumption is that NCDPs are more vulnerable to security threats as these apps are often built by nontechnical business users. In reality, custom code is often a greater security risk than platform code which has been validated by its consistent use across multiple applications.[10] No-code solutions allow platforms to hide what happens behind the scenes from users, so that end-users can change or modify a field without manipulating the functionality of the app and compromising security. [11] You should check the following features of low code platforms on their website: Platform security audits and compliance. Single sign on and authentication. Platform access control. Application access control and audits. Secure code using plugins. Secure API endpoints. Low-code platforms keep security at the forefront of their design process. They are able to consider all avenues of protection including application protection, data protection, policies and procedures, application protection, and infrastructure protection. This covers web and mobile apps as well as CRM and ERP systems. Additionally, built-in security controls are able to automatically mitigate risks that derive from common vulnerabilities such as SQL injection or cross-site scripting (XSS). Vulnerability can open up with the addition of custom code, so that it must always be considered carefully prior to its addition. Criticisms[edit] Skills gap - Some IT professionals have questioned whether empowering ordinary business users who cannot debug code is a sustainable endeavor. Trend vs Fad - NCDPs have also been compared to other coding waves such as fourth-generation programming languages and rapid application development which promised to revolutionize software development.[12] Notable no-code development platforms[edit] Airtable Appery.io AppSheet Google Brandcast Bubble Clappia Creatio DaDaBIK DronaHQ Studio FileMaker HyperCard Kintone monday.com Podio PWCT QuickBase, Inc. Aquafadas Salesforce.com Lightning Platform Shopify Silex website builder Unqork Webflow Wix.com WordPress Zapier See also[edit] Flow-based programming List of online database creator apps Low-code development platforms Rapid application development Lean software development Platform as a service References[edit] ^ Rouse, Margaret. "low-code/no-code development platform (LCNC platform)". www.techtarget.com. Retrieved 20 August 2018. ^ a b Ciot, Thierry. "What is a Low-Code/No-Code Platform?". www.cioreview.com. Retrieved 20 August 2018. ^ https://spectrum.ieee.org/tech-talk/computing/software/programming-without-code-no-code-software-development ^ Satell, Greg. "The Future of Software Is No-Code". www.inc.com. Retrieved 20 August 2018. ^ Tolido, Ron. "App Maker Movement". Cap Gemeni. Retrieved 5 December 2018. ^ Weiss, Todd. "No-Code, Low-Code Development Platforms Help Organizations Meet Growing App Demand". www.itprotoday.com. Retrieved 20 August 2018. ^ Rivera, Janessa. "Gartner Says By 2018, More Than 50 Percent of Users Will Use a Tablet or Smartphone First for All Online Activities". Gartner. Retrieved 28 January 2019. ^ Harris, Richard. "Low code and no code app development benefits". App Developer Magazine. Retrieved 28 January 2019. ^ Shrivastava, Anubhuti. "How Zero-Code Platforms Are Becoming A Boon For Enterprises". Trend in Tech. Retrieved 28 January 2019. ^ Shore, Joel. "How no-code development tools can benefit IT". www.techtarget.com. Retrieved 20 August 2018. ^ Rubinstein, David. "Industry Spotlight: No-code solutions help developers help themselves". SD Times. Retrieved 5 December 2018. ^ Reselman, Bob. "Why the promise of low-code software platforms is deceiving". www.techtarget.com. Forrester Research. Archived from the original on 1 May 2019. Retrieved 20 August 2018. External links[edit] Pattani, Aneri (16 November 2016) "A coding revolution in the office cube sends message of change to IT". CNBC. Retrieved 15 November 2017. Retrieved from "https://en.wikipedia.org/w/index.php?title=No-code_development_platform&oldid=1038550296" Categories: Enterprise architecture Software development Hidden categories: Articles with short description Short description matches Wikidata Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Deutsch עברית 日本語 Português 中文 Edit links This page was last edited on 13 August 2021, at 07:11 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7917 ---- Floyd Collins - Wikipedia Floyd Collins From Wikipedia, the free encyclopedia Jump to navigation Jump to search Floyd Collins Born (1887-07-20)July 20, 1887 Auburn, Kentucky United States Died c. February 13, 1925(1925-02-13) (aged 37) Cave City, Kentucky, United States Resting place Mammoth Cave Baptist Church Cemetery, Mammoth Cave, Kentucky Occupation Cave owner, cave explorer Known for Cave exploration in Central Kentucky; being trapped in Sand Cave and dying before a rescue party could get to him William Floyd Collins (July 20, 1887 – c. February 13, 1925), better known as Floyd Collins, was an American cave explorer, principally in a region of Central Kentucky that houses hundreds of miles of interconnected caverns within Mammoth Cave National Park, the longest cave system in the world. In the early 20th century, in an era known as the Kentucky Cave Wars,[1] commercial cave owners and explorers in Kentucky entered into a bitter competition to exploit the bounty of caves for commercial profit from tourists, who paid to see the caves. In 1917, Collins had discovered and commercialized Crystal Cave on Flint Ridge (now part of the Mammoth Cave System but at the time an isolated cave). But the cave was remote and visitors were few. Collins had an ambition to find another cave he could open to the public closer to the main roads, and entered into an agreement with a neighbor to open up Sand Cave, a small cave on the neighbor's property. On January 30, 1925, while working to enlarge the small passage in Sand Cave, Collins became trapped in a narrow crawlway 55 feet (17 m) below ground. The rescue operation to save Collins became a national newspaper sensation and one of the first major news stories to be reported using the new technology of broadcast radio. After four days, during which time rescuers were able to bring water and food to Collins, a rock collapse in the cave closed the entrance passageway, stranding him in the cave, except for voice contact, for more than two weeks. Collins died of thirst and hunger compounded by exposure through hypothermia after being isolated for 14 days, just three days before a rescue shaft reached his position. Collins' body was recovered two months later. Although Collins was an unknown figure in his lifetime, the fame he gained from his death led to him being memorialized on his tombstone as the "Greatest Cave Explorer Ever Known". [2] Contents 1 Early life 2 Crystal Cave 3 1925 cave accident 3.1 Media attention 3.2 Burial and exhibition of body 4 Later exploration 5 In popular culture 6 See also 7 References 8 External links Early life[edit] This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (September 2017) (Learn how and when to remove this template message) William Floyd Collins was born in Auburn, Logan County, Kentucky, the son and third child of Leonidas Collins and Martha Jane Burnett. Collins had five brothers, James, Floyd (a brother with same name), Andy Lee, Marshall Everett and Homer Larkin, as well as two sisters, Anna and Nellie. Crystal Cave[edit] Sand Cave, in the "Cave Country", of Central Kentucky This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (September 2017) (Learn how and when to remove this template message) In the period of Kentucky history known as the "Cave Wars," the Floyd Collins family owned their own cave called Crystal Cave, a tourist show cave in the karst region of Mammoth Cave. Crystal Cave attracted a low number of tourists due to its remote location. Collins hoped to find another entrance to the Mammoth Cave or possibly an unknown cave along the road to Mammoth Cave and draw more visitors and greater profits. He made an agreement with three farmers, who owned land closer to the main highway. If he found a cave, they would form a business partnership and share in the responsibilities of operating this tourist attraction. Working alone, within three weeks, he had explored and expanded a hole that would later be called "Sand Cave" by the news media. 1925 cave accident[edit] This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2017) (Learn how and when to remove this template message) On January 30, 1925, after several hours of work, Floyd Collins managed to squeeze through several narrow passageways; he claimed he had discovered a large grotto chamber, though this was never verified. Because his lamp was dying, he had to leave quickly before losing all light to the chamber, but became trapped in a small passage on his way out. Collins accidentally knocked over his lamp, putting out the light, and was caught by a rock from the cave ceiling, pinning his left leg. The falling rock weighed 26 pounds; rescuers were unable to reach the rock to remove it. Floyd Collins was trapped 150 feet (50 m) from the entrance. After being found the next day by a friend, crackers were sent to him and an electric light was run down the passage to provide him lighting and some warmth. Collins survived for more than a week while rescue efforts were organized. On February 4, the cave passage collapsed in two places. Rescue leaders, led by Henry St. George Tucker Carmichael, determined the cave impassable and too dangerous and began to dig a shaft to reach the chamber behind Collins.[3] The 55-foot (18 m) shaft and subsequent lateral tunnel intersected the cave just above Collins, but when he was finally reached on February 17, he was already dead from exposure. Because he could not be reached from behind, the rescuers could not free his leg. They left his body in place and filled the shaft with debris. A doctor estimated he had died three or four days before he was reached, with February 13 the most likely date. Media attention[edit] Newspaper reporter William Burke "Skeets" Miller from The Courier-Journal in Louisville reported on the rescue efforts from the scene. Miller, of small stature, was able to remove a lot of earth from around Collins. He also interviewed Collins in the cave, receiving a Pulitzer Prize for his coverage[4] and playing a part in Collins' attempted rescue. Miller's reports were distributed by telegraph and were printed by newspapers across the country and abroad, and the rescue attempts were followed by regular news bulletins on the new medium of broadcast radio (the first broadcast radio station KDKA having been established in 1920). Shortly after the media arrived, the publicity drew crowds of tourists to the site, at one point numbering in the tens of thousands. Vendors set up stalls to sell food and souvenirs, creating a circus-like atmosphere. The Sand Cave rescue attempt grew to become the third-biggest media event between the world wars. (The biggest media events of that time both involved Charles Lindbergh — the trans-Atlantic flight and his son's kidnapping — and Lindbergh actually had a minor role in the Sand Cave rescue, too, having been hired to fly photographic negatives from the scene for a newspaper.)[4] Since the nearest telegraph station was in Cave City, some miles from the cave, two amateur radio operators with the callsigns 9BRK and 9CHG provided the link to pass messages to the authorities and the press.[5] Burial and exhibition of body[edit] Floyd Collins' grave, with epitaph With Collins's body remaining in the cave, funeral services were held on the surface. Homer Collins was not pleased with Sand Cave as his brother's grave, and two months later, he and some friends reopened the shaft. They dug a new tunnel to the opposite side of the cave passage and recovered Floyd Collins's remains on April 23, 1925.[4] The following day, the body was buried in the burial ground of the Collins family's farm,[4] near Crystal Cave, now known as "Floyd Collins Crystal Cave." In 1927, Floyd Collins' father, Lee Collins, sold the homestead and cave. The new owner placed Collins' body in a glass-topped coffin and exhibited it in Crystal Cave for many years.[4][6] On the night of March 18–19, 1929, the body was stolen. The body was later recovered, having been found in a nearby field, but the injured left leg was missing.[4][6] After this desecration, the remains were kept in a secluded portion of Crystal Cave in a chained casket. In 1961, Crystal Cave was purchased by Mammoth Cave National Park and closed to the public.[6] The Collins family had objected to Collins' body being displayed in the cave and, at their request, the National Park Service re-interred him at Mammoth Cave Baptist Church Cemetery, Mammoth Cave, Kentucky in 1989.[4][6] It took a team of 15 men three days to remove the casket and tombstone from the cave. Later exploration[edit] This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (September 2017) (Learn how and when to remove this template message) The attention over the rescue attempt of Collins created interest in the creation of Mammoth Cave National Park, of which Sand Cave is now a part. Fear and superstition kept cavers away from Sand Cave for decades. The National Park Service has sealed the entrance with a steel grate for public safety. Expeditions into Mammoth Cave showed that portions of Mammoth actually run under Sand Cave, but no connection has ever been discovered. In the 1970s, cave explorer and author Roger Brucker and a small group entered Sand Cave to conduct research for a book about Collins. The team surveyed Sand and discovered an opening in the collapsed tunnel through which a smaller caver can crawl, showing that it would have been possible to feed and heat Collins after February 4, 1925. They proceeded as far as the passage where Collins was trapped; it was choked with gravel and unsafe to excavate. In April 1983, George Crothers led an archaeological investigation that documented many 1925 artifacts in the cave. These were removed for future preservation. In popular culture[edit] This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2017) (Learn how and when to remove this template message) The life and death of Collins inspired the musical Floyd Collins by Adam Guettel and Tina Landau,[7] as well as one film documentary, several books, a museum and many short songs. Ace in the Hole (alternative title, The Big Carnival) is a 1951 film by Billy Wilder based on the media circus surrounding the attempted rescue of a man stuck in a cave. The film depicts a fictional incident, but Collins is mentioned by name in the dialogue. He is mentioned in two novels by Kentucky writers Robert Penn Warren and James Still: The Cave and River of Earth. In 2006, actor Billy Bob Thornton optioned the film rights to Trapped! The Story of Floyd Collins and a screenplay was adapted by Thornton's writing partner, Tom Epperson. However, Thornton's option expired and the film rights were acquired by producer Peter R. J. Deyell in 2011.[8] Fiddlin' John Carson and Vernon Dalhart recorded "The Death of Floyd Collins"[9] in 1925. Kentucky-based rock band Black Stone Cherry has a song titled "The Ghost of Floyd Collins" on their 2008 album, Folklore and Superstition. John Prine and Mac Wiseman released a song titled "Death of Floyd Collins," written by Andrew Jenkins, on their 2007 album Standard Songs For Average People. Floyd Collins is mentioned in Mark Z. Danielewski's postmodern novel House of Leaves (p 334 of the Pantheon Books 2nd edition). The story of Floyd Collins is also included in the novel Supernatural: The Usual Sacrifices by Yvonne Navarro.[10] The poet Clark Coolidge's 1978 book Own Face (United Artists) features a photo of Floyd Collins on the cover and a number of poems in the book make reference to Collins, caving, and related matters. Sun & Moon Press published an edition of Own Face in 1993. The story of Floyd Collins' death is mentioned on the television show The Blacklist. See also[edit] 1920s portal Moose River Disaster, mine cave-in covered extensively on radio in 1936 References[edit] ^ Cave Wars - Mammoth Cave National Park (U.S. National Park Service) ^ Murray & Brucker, Robert & Roger (1979). Trapped. G.P. Putnams Sons. ISBN 0399123202. ^ "Cave floor expands and entombs Collins". Journal and Courier. February 5, 1925. p. 1. Retrieved December 28, 2017 – via Newspapers.com. ^ a b c d e f g Bukro, Casey (March 26, 1989). "Folk hero's burial ends 3 generations of anguish". Chicago Tribune. p. 19. Retrieved December 28, 2017 – via Newspapers.com. ^ DeSotto, Clinton: 200 Meters & Down - The Story of Amateur Radio, 1936 - American Radio relay League p.162 ISBN 978-0-87259-001-4 ^ a b c d Bukro, Casey (March 26, 1989). "Folk hero's burial ends 3 generations of anguish 2". Chicago Tribune. p. 20. Retrieved December 28, 2017 – via Newspapers.com. ^ "Blackfriars goes undergrsound for new musical". Democrat and Chronicle. May 3, 2002. p. 19. Retrieved December 28, 2017 – via Newspapers.com. ^ "Floyd Collins Book Acquired by Producer Peter R.J. Deyell". Broadway World. 2011-04-26. Retrieved 2011-06-26. ^ "The Death of Floyd Collins (Edison Blue Amberol: 5049)". 1925. ^ Navarro, Yvonne (2017). Supernatural: The Usual Sacrifices. Titan Books. p. 194. ISBN 978-1-7832-9857-0. Brucker, R. and Murray, R. Trapped! the Story of Floyd Collins, University Press of Kentucky, 1983. ISBN 0-8131-0153-0 Collins, Homer. The Life and Death of Floyd Collins, as told to Jack Lehrberger, Cave Books, 2009. ISBN 0-9397-4847-9 "Supernatural: The Usual Sacrifices" By Yvonne Navarro, Titan Books, 2017 ISBN 9781783298570 External links[edit] Wikimedia Commons has media related to Floyd Collins. Tragedy at Sand Cave (U.S. National Park Service) Cave Wars - Mammoth Cave National Park (U.S. National Park Service) The Tragedy of History's Smallest Underground War Authority control General VIAF 1 WorldCat National libraries United States Other Faceted Application of Subject Terminology Social Networks and Archival Context Retrieved from "https://en.wikipedia.org/w/index.php?title=Floyd_Collins&oldid=1032302604" Categories: 1887 births 1925 deaths Accidental deaths in Kentucky American cavers American explorers Burials in Kentucky Caving incidents and rescues People from Logan County, Kentucky Hidden categories: CS1: Julian–Gregorian uncertainty Articles with hCards Articles needing additional references from September 2017 All articles needing additional references Articles needing additional references from December 2017 Commons category link from Wikidata Wikipedia articles with VIAF identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with FAST identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية Polski Српски / srpski Suomi Edit links This page was last edited on 6 July 2021, at 16:24 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-7947 ---- Ma Rainey - Wikipedia Ma Rainey From Wikipedia, the free encyclopedia Jump to navigation Jump to search African-American singer Ma Rainey Rainey in 1917 Background information Birth name Gertrude Pridgett Born (1886-04-26)April 26, 1886 Columbus, Georgia, U.S. Died December 22, 1939(1939-12-22) (aged 53) Columbus, Georgia, U.S. Genres Blues classic female blues Occupation(s) Vocalist Years active 1899–1939 Labels Paramount Associated acts Rainey and Rainey Assassinators of the Blues Rabbit Foot Minstrels Bessie Smith Louis Armstrong Thomas Dorsey Musical artist Gertrude "Ma" Rainey (née Pridgett; April 26, 1886 – December 22, 1939)[1][2][3] was an influential American blues singer and early blues recording artist.[4] Dubbed the "Mother of the Blues", she bridged earlier vaudeville and the authentic expression of southern blues, influencing a generation of blues singers.[5] Gertrude Pridgett began performing as a teenager and became known as "Ma" Rainey after her marriage to Will "Pa" Rainey in 1904. They toured with the Rabbit Foot Minstrels and later formed their own group, Rainey and Rainey, Assassinators of the Blues. Her first recording was made in 1923. In the following five years, she made over 100 recordings, including "Bo-Weevil Blues" (1923), "Moonshine Blues" (1923), "See See Rider Blues" (1924), "Ma Rainey's Black Bottom" (1927), and "Soon This Morning" (1927).[6] Rainey was known for her powerful vocal abilities, energetic disposition, majestic phrasing, and a "moaning" style of singing. Her qualities are present and most evident in her early recordings "Bo-Weevil Blues" and "Moonshine Blues". Rainey recorded with Thomas Dorsey and Louis Armstrong, and she toured and recorded with the Georgia Jazz Band. She toured until 1935, when she largely retired from performing and continued as a theater impresario in her hometown of Columbus, Georgia, until her death four years later.[1] Contents 1 Early life 2 Early career 3 Recording career 4 Personal life and death 5 Legacy and honors 6 In popular culture 7 Recordings 8 Notes 9 References 9.1 Footnotes 9.2 Sources 10 Further reading 11 External links Early life[edit] There is uncertainty about the birth date of Gertrude Pridgett. Some sources indicate that she was born in 1882, while most sources assert that she was born on April 26, 1886.[2] Pridgett claimed to have been born on April 26, 1886 (beginning with the 1910 census, taken April 25, 1910), in Columbus, Georgia.[7] However, the 1900 census indicates that she was born in September 1882 in Alabama, and researchers Bob Eagle and Eric LeBlanc suggest that her birthplace was in Russell County, Alabama.[8][9] She was the second of five children of Thomas and Ella (née Allen) Pridgett, from Alabama. She had at least two brothers and a sister, Malissa Pridgett Nix.[7] In February 1904, Ma Rainey married William "Pa" Rainey.[10] She took on the stage name "Ma Rainey", which was "a play on her husband’s nickname, 'Pa'".[11] Early career[edit] Pridgett began her career as a performer at a talent show in Columbus, Georgia, when she was approximately 12 to 14 years old.[1][12] A member of the First African Baptist Church, she began performing in black minstrel shows. She later claimed that she was first exposed to blues music around 1902.[13] She formed the Alabama Fun Makers Company with her husband, Will Rainey, but in 1906 they both joined Pat Chappelle's much larger and more popular Rabbit's Foot Company, where they were billed together as "Black Face Song and Dance Comedians, Jubilee Singers [and] Cake Walkers".[14] In 1910, she was described as "Mrs. Gertrude Rainey, our coon shouter".[14] She continued with the Rabbit's Foot Company after it was taken over by a new owner, F. S. Wolcott, in 1912.[1] Rainey said she found "Blues Music" when she was in Missouri one night performing, and a girl introduced her to a sad song about a man leaving a woman. Rainey said she learned the lyrics of the song and added it to her performances. Rainey claimed she created the term "blues" when asked what kind of song she was singing.[10] Beginning in 1914, the Raineys were billed as Rainey and Rainey, Assassinators of the Blues. Wintering in New Orleans, she met numerous musicians, including Joe "King" Oliver, Louis Armstrong, Sidney Bechet and Pops Foster. As the popularity of blues music increased, she became well known.[15] Around this time, she met Bessie Smith, a young blues singer who was also making a name for herself.[A] A story later developed that Rainey kidnapped Smith, forced her to join the Rabbit's Foot Minstrels, and taught her to sing the blues; the story was disputed by Smith's sister-in-law Maud Smith.[16] Recording career[edit] Rainey and the band From the late 1910s, there was an increasing demand for recordings by black musicians.[17] In 1920, Mamie Smith was the first black woman to be recorded.[18] In 1923, Rainey was discovered by Paramount Records producer J. Mayo Williams. She signed a recording contract with Paramount, and in December she made her first eight recordings in Chicago,[19] including "Bad Luck Blues", "Bo-Weevil Blues" and "Moonshine Blues". She made more than 100 other recordings over the next five years, which brought her fame beyond the South.[1][20] Paramount marketed her extensively, calling her the "Mother of the Blues", the "Songbird of the South", the "Gold-Neck Woman of the Blues" and the "Paramount Wildcat".[21] In 1924, Rainey recorded with Louis Armstrong, including on "Jelly Bean Blues", "Countin' the Blues" and "See, See Rider".[22] In the same year, she embarked on a tour of the Theater Owners Booking Association (TOBA) in the South and Midwest of the United States, singing for black and white audiences.[23] She was accompanied by the bandleader and pianist Thomas Dorsey and the band he assembled, the Wildcats Jazz Band.[24] They began their tour with an appearance in Chicago in April 1924 and continued, on and off, until 1928.[25] Dorsey left the group in 1926 because of ill health and was replaced as pianist by Lillian Hardaway Henderson, the wife of Rainey's cornetist Fuller Henderson, who became the band's leader.[26] Although most of Rainey's songs that mention sexuality refer to love affairs with men, some of her lyrics contain references to lesbianism or bisexuality,[27] such as the 1928 song "Prove It on Me": They said I do it, ain't nobody caught me. Sure got to prove it on me. Went out last night with a crowd of my friends. They must've been women, 'cause I don't like no men. It’s true I wear a collar and tie. Makes the wind blow all the while.[28] According to the website queerculturalcenter.org, the lyrics refer to an incident in 1925 in which Rainey was "arrested for taking part in an orgy at [her] home involving women in her chorus".[29] The political activist and scholar Angela Y. Davis noted that "'Prove It on Me' is a cultural precursor to the lesbian cultural movement of the 1970s, which began to crystallize around the performance and recording of lesbian-affirming songs."[30] At the time, an ad for the song embraced the genderbending outlined in the lyrics and featured Rainey in a three-piece suit, mingling with women while a police officer lurks nearby.[31] Unlike many blues singers of her day, Rainey wrote at least a third of the songs she sang including many of her most famous works such as "Moonshine Blues" and "Ma Rainey's Black Bottom" which would become standards of the "classic blues" genre.[31] Throughout the 1920s, Ma Rainey had a reputation for being one of the most dynamic performers in the United States due in large part to her songwriting, showmanship and voice.[31] She and her band could fetch earnings of $350 a week on tour with the Theater Owners’ Booking Association which was double that of Bessie Brown and George Williams while a little over half what Bessie Smith would ultimately command.[32] Toward the end of the 1920s, live vaudeville went into decline, being replaced by radio and recordings.[26] Rainey's career was not immediately affected; she continued recording for Paramount and earned enough money from touring to buy a bus with her name on it.[33] In 1928, she worked with Dorsey again and recorded 20 songs, before Paramount terminated her contract.[34] Her style of blues was no longer considered fashionable by the label.[35] It is unclear if she maintained the royalties to her songs after she was fired from Paramount.[31] Personal life and death[edit] Ma Rainey and Pa Rainey adopted a son named Danny who later joined his parents' musical act. Rainey developed a relationship with Bessie Smith. They became so close that rumors circulated that their relationship was possibly also romantic in nature.[10] It was also rumored that Smith once bailed Ma Rainey out of jail.[29] The Raineys separated in 1916.[36][3] In 1935, Rainey returned to her home town, Columbus, Georgia, and became the proprietor[37] of three theatres, the Liberty in Columbus, and the Lyric and the Airdrome in Rome, Georgia,[38] until her death. She died of a heart attack in 1939.[39][40][3] Legacy and honors[edit] Ma Rainey created what is now known as "classic blues" while also portraying black life like never before. As a musical innovator she built on the minstrelsy and vaudeville performative traditions with comedic timing and a hybrid of American blues traditions she encountered in her vast tours across the country. She helped to pioneer a genre that appealed to North and South, rural and urban audiences.[31] Her signature low and gravelly voice sung with Rainey's gusto and authoritative style inspired imitators from Louis Armstrong, Janis Joplin and Bonnie Raitt among others.[31] In her lyrics, Rainey portrayed the black female experience like few others of the time reflecting a wide range of emotions and experiences. In her 1999 book Blues Legacies and Black Feminism, Angela Davis wrote that Rainey's songs are full of women who “explicitly celebrate their right to conduct themselves as expansively and even as undesirably as men".[41] In her songs, she and other black women sleep around for revenge, drink and party all night and generally live lives that "transgressed these ideas of white middle class female respectability".[42] The portrayals of black female sexuality, including those bucking heteronormative standards, fought ideas of what a woman should be and inspired Alice Walker in developing her characters for The Color Purple.[43] Bragging about sexual escapades was popular in men's songs at the time but her use of these themes in her works established her as both fiercely independent and fearless and many have drawn connections between her use of these themes and their modern use in Hip-Hop.[44] Rainey was also a fashion icon who pioneered flashy, expensive costuming in her performances, wearing ostrich plumes, satin gowns, sequins, gold necklaces, diamond tiaras, and gold teeth.[31] Rainey was inducted into the Blues Foundation's Hall of Fame in 1983 and the Rock and Roll Hall of Fame in 1990.[45] In 1994, the U.S. Post Office issued a 29-cent commemorative postage stamp honoring her. In 2004, "See See Rider Blues" (performed in 1924) was inducted into the Grammy Hall of Fame and was added to the National Recording Registry by the National Recording Preservation Board of the Library of Congress.[46] There was also a small museum opened in Columbus in 2007 to honor Ma Rainey's legacy. It is in the very house that she had built for her mother and later lived in from 1935 until her death in 1939.[47] The first annual Ma Rainey International Blues Festival was held in April 2016 in Columbus, Georgia, near the home that Rainey owned and lived in at the time of her death.[48][49] In 2017, the Rainey-McCullers School of the Arts opened in Columbus, Georgia, named in honor of Rainey and author Carson McCullers.[50] In popular culture[edit] Sterling A. Brown wrote the poem "Ma Rainey" in 1932, about how "When Ma Rainey / comes to town" people everywhere would hear her sing. In 1981, Sandra Lieb wrote the first full-length book about Rainey, Mother of the Blues: A Study of Ma Rainey.[51] Ma Rainey's Black Bottom, a 1982 play by August Wilson, is a fictionalized account of a recording of her song of the same title set in 1927. Theresa Merritt and Whoopi Goldberg starred as Rainey in the Original and Revival Broadway productions, respectively. Viola Davis portrayed Rainey in the 2020 film adaptation of the play and was nominated for the Academy Award for Best Actress.[52] Mo'Nique played Rainey in the 2015 television film Bessie about the life of Bessie Smith, for which she earned a nomination for Primetime Emmy Award for Outstanding Supporting Actress in a Limited Series or Movie.[53] Recordings[edit] This sortable table presents all 94 titles recorded by Rainey.[54] The recording dates are approximated. The classification, by Sandra Lieb, is almost entirely by form. Blues songs which are only partly of twelve-bar structure are classified as mixtures of blues and popular song forms. Songs without any twelve-bar or eight-bar structure are classified as non-blues.[55] The JSP and DOCD columns refer to the two complete CD reissues.[56][57] Click any label to sort. To return to chronological order, click #. # Matrix Recording date Title Accompaniment Paramount issue no. Sandra Lieb classification JSP 77933 Document DOCD Notes 01 1596 1923/12 "Bad Luck Blues" Lovie Austin Blues Serenaders 12081 Twelve-bar blues A 5581 02 1597 1923/12 "Bo-Weavil Blues" Lovie Austin Blues Serenaders 12080 Mixture of blues and popular song forms A 5581 Another take on JSP & DOCD 03 1598 1923/12 "Barrel House Blues" Lovie Austin Blues Serenaders 12082 Twelve-bar blues A 5581 04 1599 1923/12 "Those All Night Long Blues" Lovie Austin Blues Serenaders 12081 Non-blues A 5581 Another take on JSP & DOCD 05 1608 1923/12 "Moonshine Blues" Lovie Austin Blues Serenaders 12083 Mixture of blues and popular song forms A 5581 06 1609 1923/12 "Last Minute Blues" Lovie Austin Blues Serenaders 12080 Twelve-bar blues A 5581 07 1612 1923/12 "Southern Blues" Lovie Austin Blues Serenaders 12083 Twelve-bar blues A 5581 08 1613 1923/12 "Walking Blues" Lovie Austin Blues Serenaders 12082 Twelve-bar blues A 5581 09 1698 1924/03 "Lost Wandering Blues" Pruit Twins 12098 Twelve-bar blues A 5581 10 1699 1924/03 "Dream Blues" Pruit Twins 12098 Twelve-bar blues A 5581 11 1701 1924/03 "Honey Where You Been So Long?" Lovie Austin Blues Serenaders 12200 Non-blues A 5581 12 1702 1924/03 "Ya-Da-Do" Her Georgia Jazz Band 12257 Non-blues A 5581 Another take on JSP & DOCD 13 1703 1924/03 "Those Dogs of Mine" "(Famous Cornfield Blues)" Lovie Austin Blues Serenaders 12215 Non-blues A 5581 14 1704 1924/03 "Lucky Rock Blues" Lovie Austin Blues Serenaders 12215 Mixture of blues and popular song forms A 5581 15 1741 1924/04 "South Bound Blues" Her Georgia Jazz Band 12227 Non-blues A 5581 16 1758 1924/05 "Lawd Send Me a Man Blues" Her Georgia Jazz Band 12227 Non-blues A 5581 17 1759 1924/05 "Ma Rainey's Mystery Record" Lovie Austin Blues Serenaders 12200 Twelve-bar blues A 5581 18 1824 1924/08 "Shave 'Em Dry Blues" Two unknown guitars 12222 Eight-bar blues B 5581 19 1825 1924/08 "Farewell Daddy Blues" Unknown guitar 12222 Twelve-bar blues B 5581 20 1922 1924/10 "Booze and Blues" Her Georgia Jazz Band 12242 Twelve-bar blues B 5582 21 1923 1924/10 "Toad Frog Blues" Her Georgia Jazz Band 12242 Twelve-bar blues B 5582 22 1924 1924/10 "Jealous Hearted Blues" Her Georgia Jazz Band 12252 Twelve-bar blues B 5582 23 1925 1924/10 "See See Rider Blues" Her Georgia Jazz Band 12252 Mixture of blues and popular song forms B 5582 With Louis Armstrong; another take on JSP & DOCD 24 1926 1924/10 "Jelly Bean Blues" Her Georgia Jazz Band 12238 Mixture of blues and popular song forms B 5582 With Louis Armstrong 25 1927 1924/10 "Countin' the Blues" Her Georgia Jazz Band 12238 Twelve-bar blues B 5582 With Louis Armstrong; another take on JSP & DOCD 26 10001 1924/11 "Cell Bound Blues" Her Georgia Jazz Band 12257 Mixture of blues and popular song forms B 5582 27 2136 1925/05 "Army Camp Harmony Blues" Her Georgia Jazz Band 12284 Twelve-bar blues B 5582 Another take on JSP & DOCD 28 2137 1925/05 "Explaining the Blues" Her Georgia Jazz Band 12284 Twelve-bar blues B 5582 Another take on JSP & DOCD 29 2138 1925/05 "Louisiana Hoo Doo Blues" Her Georgia Jazz Band 12290 Twelve-bar blues B 5582 30 2138 1925/05 "Goodbye Daddy Blues" Her Georgia Jazz Band 12290 Mixture of blues and popular song forms B 5582 31 2209 1925/05 "Stormy Seas Blues" Her Georgia Band 12295 Twelve-bar blues B 5582 Another take on DOCD5625 32 2210 1925/08 "Rough and Tumble Blues" Her Georgia Band 12311 Twelve-bar blues B 5582 33 2211 1925/08 "Night Time Blues" Her Georgia Band 12303 Twelve-bar blues B 5582 Another take on JSP & DOCD 34 2212 1925/08 "Levee Camp Moan" Her Georgia Band 12295 Non-blues B 5582 35 2213 1925/08 "Four Day Honorary Scat" Her Georgia Band 12303 Non-blues B 5582 Misprint for "'Fore Day"; another take on JSP & DOCD 36 2214 1925/08 "Memphis Bound Blues" Her Georgia Band 12311 Twelve-bar blues B 5582 37 2369 1925/12 "Slave to the Blues" Her Georgia Band 12332 Twelve-bar blues C 5583 38 2370 1925/12 "Yonder Come the Blues" Her Georgia Band 12357 Non-blues C 5583 39 2371 1925/12 "Titanic Man Blues" Her Georgia Band 12374 Mixture of blues and popular song forms C 5583 Another take on JSP & DOCD 40 2372 1925/12 "Chain Gang Blues" Her Georgia Band 12338 Twelve-bar blues C 5583 41 2373 1925/12 "Bessemer Bound Blues" Her Georgia Jazz Band 12374 Twelve-bar blues C 5583 Another take on JSP & DOCD 42 2374 1925/12 "Oh My Babe Blues" Her Georgia Band 12332 Non-blues C 5583 43 2375 1925/12 "Wringing and Twisting Blues" Her Georgia Band 12338 Non-blues C 5583 44 2369 1925/12 "Stack O'Lee Blues" Her Georgia Band 12357 Ballad C 5583 45 2448 1926/03 "Broken Hearted Blues" Her Georgia Band 12364 Twelve-bar blues C 5583 Another take on DOCD5625 46 2451 1926/03 "Jealousy Blues" Her Georgia Band 12364 Non-blues C 5583 Another take on DOCD5660 47 2452 1926/03 "Seeking Blues" Her Georgia Band 12352 Mixture of blues and popular song forms C 5583 Another take on JSP & DOCD 48 2466 1926/03 "Mountain Jack Blues" Jimmy Blythe (piano) 12352 Twelve-bar blues C 5583 Another take on JSP & DOCD 49 2627 1926/06 "Down in the Basement" Her Georgia Band 12395 Non-blues C 5583 50 2628 1926/06 "Sissy Blues" Her Georgia Band 12384 Twelve-bar blues C 5583 51 2629 1926/06 "Broken Soul Blues" Her Georgia Band 12384 Non-blues C 5583 52 2631 1926/06 "Trust No Man" Lillian Henderson (piano) 12395 Non-blues C 5583 53 405 1926/11 "Morning Hour Blues" Jimmy Blythe (piano) Blind Blake (guitar) 12455 Twelve-bar blues D 5584 54 407 1926/11 "Weepin' Woman Blues" Her Georgia Boys 12455 Twelve-bar blues D 5584 55 408 1926/11 "Soon This Morning" Her Georgia Band 12438 Twelve-bar blues D 5584 56 4019 1926/12 "Little Low Mamma Blues" Blind Blake (guitar) possibly Leroy Picket (violin) 12419 Twelve-bar blues D 5584 57 4020 1926/12 "Grievin Hearted Blues" Blind Blake (guitar) possibly Leroy Picket (violin) 12419 Mixture of blues and popular song forms D 5584 58 4021 1926/12 "Don't Fish in My Sea" Jimmy Blythe (piano) 12438 Twelve-bar blues D 5584 59 4082 1927/08 "Big Boy Blues" Her Georgia Band 12548 Twelve-bar blues D 5584 60 4083 1927/08 "Blues Oh Blues" Her Georgia Band 12566 Non-blues D 5584 61 4090 1927/08 "Damper Down Blues" Her Georgia Band 12548 Twelve-bar blues D 5584 62 4091 1927/08 "Gone Daddy Blues" Her Georgia Band 12526 Mixture of blues and popular song forms D 5584 63 4092 1927/08 "Oh Papa Blues" Her Georgia Band 12566 Non-blues D 5584 64 4707 1927/08 "Misery Blues" Her Georgia Band 12508 Non-blues D 5584 65 4708 1927/08 "Dead Drunk Blues" Her Georgia Band 12508 Twelve-bar blues D 5584 66 4709 1927/08 "Slow Driving Moan" Her Georgia Band 12526 Mixture of blues and popular song forms D 5584 67 20228 1927/12 "Blues the World Forgot—Part 1" Her Georgia Band 12647 Comedy D 5584 68 20229 1927/12 "Ma Rainey's Black Bottom" Her Georgia Band 12590 Non-blues D 5584 69 20230 1927/12 "Blues the World Forgot—Part 2" Her Georgia Band 12647 Comedy D 5584 70 20231 1927/12 "Hellish Rag" Her Georgia Band 12612 Non-blues D 5584 71 20232 1927/12 "Georgia Cake Walk" Her Georgia Band 12590 Comedy D 5584 72 20233 1927/12 "New Bo-Weavil Blues" Her Georgia Band 12603 Mixture of blues and popular song forms D 5584 73 20232 1927/12 "Moonshine Blues" Her Georgia Band 12603 Mixture of blues and popular song forms D 5584 74 20233 1927/12 "Ice Bag Papa" Her Georgia Band 12612 Non-blues D 5584 75 20661 1928/06 "Black Cat Hoot Owl Blues" Her Tub Jug Washboard Band 12687 Twelve-bar blues E 5156 Band led by Georgia Tom 76 20662 1928/06 "Log Camp Blues" Her Tub Jug Washboard Band 12804 Twelve-bar blues E 5156 Band led by Georgia Tom 77 20663 1928/06 "Hear Me Talking to You" Her Tub Jug Washboard Band 12668 Twelve-bar blues E 5156 Band led by Georgia Tom 78 20664 1928/06 "Hustlin' Blues" Her Tub Jug Washboard Band 12804 Twelve-bar blues E 5156 Band led by Georgia Tom 79 20665 1928/06 "Prove It on Me Blues" Her Tub Jug Washboard Band 12668 Non-blues E 5156 Band led by Georgia Tom 80 20666 1928/06 "Victim of the Blues" Her Tub Jug Washboard Band 12687 Twelve-bar blues E 5156 Band led by Georgia Tom 81 20667 1928/06 "Traveling Blues" Her Tub Jug Washboard Band 12707 Twelve-bar blues E 5156 Band led by Georgia Tom; another take on JSP and DOCD5216 82 20668 1928/06 "Deep Moaning Blues Blues" Her Tub Jug Washboard Band 12707 Twelve-bar blues E 5156 Band led by Georgia Tom another take on JSP & DOCD 83 20878 1928/09 "Daddy Goodbye Blues" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12963 Eight-bar blues E 5156 84 20879 1928/09 "Sleep Talking Blues" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12760 Twelve-bar blues E 5156 Another take on JSP & DOCD 85 20880 1928/09 "Tough Luck Blues" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12735 Twelve-bar blues E 5156 86 20881 1928/09 "Blame It on the Blues" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12760 Twelve-bar blues E 5156 87 20882 1928/09 "Sweet Rough Man" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12926 Twelve-bar blues E 5156 88 20883 1928/09 "Runaway Blues" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12902 Twelve-bar blues E 5156 89 20885 1928/09 "Screech Owl Blues" Eddie Miller (piano) 12735 Twelve-bar blues E 5156 90 20886 1928/09 "Black Dust Blues" Eddie Miller (piano) 12926 Twelve-bar blues E 5156 91 20897 1928/09 "Leaving This Morning" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12902 Twelve-bar blues E 5156 92 20898 1928/09 "Black Eye Blues" Georgia Tom Dorsey (piano) Tampa Red (guitar) 12963 Twelve-bar blues E 5156 Another take on JSP & DOCD 93 20921 1928/10 "Ma and Pa Poorhouse Blues" Papa Charlie Jackson (duet & banjo) 12718 Twelve-bar blues E 5156 94 20144 1928/10 "Big Feeling Blues" Papa Charlie Jackson (duet & banjo) 12718 Twelve-bar blues E 5156 Notes[edit] ^ Sources are unclear on the exact date and circumstances under which Rainey and Smith met, but it was probably sometime between 1912 and 1916.[16] References[edit] Footnotes[edit] ^ a b c d e Oliver, Paul, "Rainey, Ma (née Pridgett, Gertrude)", Grove Dictionary of Music and Musicians, Oxford University Press, retrieved 20 April 2010 ^ a b "Ma Rainey | Biography, Songs, & Facts". Encyclopedia Britannica. ^ a b c s (December 18, 2020). "The True Story Of Ma Rainey From Netflix's 'Ma Rainey's Black Bottom'". Women's Health. ^ Southern, Eileen (1997). The Music of Black Americans: A History (3rd ed.). W. W. Norton. ISBN 0-393-97141-4. ^ Russonello, Giovanni (2019-06-12). "Overlooked No More: Ma Rainey, the 'Mother of the Blues'". The New York Times. ISSN 0362-4331. Retrieved 2020-09-06. ^ Lieb, Sandra (1983). Mother of the Blues: A Study of Ma Rainey (3rd ed.). University of Massachusetts Press. ISBN 0-87023-394-7. ^ a b Lieb, p. 2 ^ Eagle, Bob; LeBlanc, Eric S. (2013). Blues: A Regional Experience. Santa Barbara, California: Praeger Publishers. p. 87. ISBN 978-0313344237. ^ 1900 Census for Columbus Ward 5, Muscogee, Georgia, District 4, Enumeration district 91, Sheet 16A, line 20, 'Prigett, Gertrude, Sept 1882, 17. ^ a b c Ma Rainey. Women in World History: A Biographical Encyclopedia. Encyclopedia.com. Updated 2020. Retrieved November 22, 2020. ^ Jaxson, The. "Ma Rainey: The Mother of the Blues". www.thejaxsonmag.com. ^ Lieb, p. 3 ^ Robert Palmer (1981). Deep Blues. Penguin Books. p. 44. ISBN 978-0-14-006223-6. ^ a b Abbott, Lynn; Seroff, Doug (2009). Ragged but Right: Black Traveling Shows, Coon Songs, and the Dark Pathway to Blues and Jazz. University Press of Mississippi. p. 261. ^ Lieb, p. 5 ^ a b Lieb, p. 15 ^ Lieb, p. 19 ^ Lieb, p. 20 ^ Lieb, p. 21 ^ Lieb, p. 23 ^ Lieb, p. 25 ^ Lieb, p. 26 ^ Lieb, p. 27 ^ Lieb, p. 28 ^ Lieb, p. 35 ^ a b Lieb, p. 37 ^ Friederich, Brandon (June 7, 2017). "Ma Rainey's Lesbian Lyrics: 5 Times She Expressed Her Queerness in Song". Billboard. Retrieved June 9, 2017. ^ Ellison, Marvin M.; Brown Douglas, Kelly, eds. (2010). Sexuality and the Sacred: Sources for Theological Reflection (2nd ed.). Westminster John Knox Press. p. 54. ISBN 978-0664233662. ^ a b "Gladys Bentley". queerculturalcenter.org. Archived from the original on November 10, 2013. Retrieved December 22, 2013. ^ Davis, Angela Y. (1999). Blues Legacies and Black Feminism: Gertrude "Ma" Rainey, Bessie Smith, and Billie Holiday. Vintage. pp. 40, 238. ISBN 978-0679771265. ^ a b c d e f g "Ma Rainey Is Best Known as a Pioneer of the Blues. But She Broke More Than Musical Barriers". Time. Retrieved 2020-12-23. ^ Abbott, Lynn (2017). The Original Blues: The Emergence of the Blues in African American Vaudeville. University Press of Mississippi. ISBN 9781496810038. ^ Lieb, p. 39 ^ Lieb, p. 40 ^ Lieb, p. 90 ^ "Who Is Ma Rainey? How the 'Mother of the Blues' Became an Icon". Entertainment Tonight. ^ "Overlooked No More: Ma Rainey, the 'Mother of the Blues' (Published 2019)". The New York Times. 2019-06-12. ISSN 0362-4331. Retrieved 2021-03-04. ^ Lieb, p. 1 ^ Santelli, Robert. The Big Book of Blues. Penguin Books. p. 387. ^ "Ma Rainey". Britannica.com. 1939-12-22. Retrieved 2011-12-30. ^ Davis, Angela (2011). Blues Legacies and Black Feminism: Gertrude "Ma" Rainey, Bessie Smith, and Billie Holiday. Penguin Random House. ISBN 978-0679450054. ^ Mack, Kimberly (2020). Fictional Blues: Narrative Self-Invention from Bessie Smith to Jack White. University of Massachusetts Press. ISBN 9781625345493. ^ Freedman, Samuel G. (1984-10-14). "What Black Writers Owe to Music". The New York Times. ISSN 0362-4331. Retrieved 2020-12-23. ^ Jones, DaLyah (2020-08-23). ""Let's Have A Sex Talk": The Eras of Sex Talk By Black Women In Hip-Hop". Okayplayer. Retrieved 2020-12-23. ^ Ma Rainey Induction Year: 1990. Rockhall.com. Accessed February 26, 2014. ^ 2004 National Recording Registry Choices. Loc.gov/rr. A ccessed February 26, 2014. ^ "Ma Rainey | Biography, Songs, & Facts". Encyclopedia Britannica. Retrieved 2021-03-04. ^ "Ma Rainey International Blues Festival - Mad About Ma Blues Society". Retrieved 6 July 2018. ^ "Ma Rainey International Blues Festival". 29 January 2016. Archived from the original on 29 January 2016. Retrieved 6 July 2018. ^ "Rainey-McCullers School of the Arts opens as 2017-18 classes begin". Ledger-enquirer.com. Retrieved 6 July 2018. ^ Lieb, Sandra (1981). Mother of the Blues: A Study of Ma Rainey. University of Massachusetts. ISBN 9780870233340. ^ Lee, Benjamin (18 October 2020). "Netflix releases trailer for Chadwick Boseman's final movie". The Guardian. Retrieved 24 October 2020. ^ "Mo'Nique on Emmy Nomination for 'Bessie,' Lee Daniels' 'Empire' Snub: 'What You Put Out Is What You Get Back'". The Wrap. 2015-07-16. Retrieved 2020-12-04. ^ Dixon, Robert M. W.; Godrich, John; and Rye, Howard W. (compilers) (1997). Blues and Gospel Records 1890–1943. Oxford University Press. ISBN 978-0198162391. ^ Lieb, pp. 189–191. ^ Ma Rainey. Mother of the Blues. 5-CD box set. JSP Records JSP7793 (A–E). ^ Ma Rainey. Complete Recorded Works in Chronological Order, vol. 1: December 1923 to c. August 1924, Document Records DOCD5581. Complete Recorded Works in Chronological Order, vol. 2: c. 15 October 1924 to c. August 1925, Document DOCD5582. Complete Recorded Works in Chronological Order, vol. 3: c. December 1925 to c. June 1926, Document DOCD5583. Complete Recorded Works in Chronological Order, vol. 4: c. November 1925 to c. December 1927, Document DOCD5584. The Complete 1928 Sessions in Chronological Order, Document DOCD5156. Too Late, Too Late, vol. 2: 1897–1935, Document DOCD5216. Too Late, Too Late, vol. 11: 1924–1939, Document DOCD5625. Too Late, Too Late, vol. 13: 1921–1940, Document DOCD5660. Sources[edit] Lieb, Sandra (1983). Mother of the Blues: A Study of Ma Rainey. University of Massachusetts Press. ISBN 0-87023-334-3. Davis, Angela Y. (1998). Blues Legacies and Black Feminism. Pantheon. ISBN 0-679-45005-X. Further reading[edit] Ma Rainey and the Classic Blues Singers by Derrick Stewart-Baxter (Stein and Day, 1970) ISBN 978-0812813210 External links[edit] Ma Rainey Blues Festival official website Gertrude “Ma” Rainey at the New Georgia Encyclopedia Ma Rainey discography at Discogs Ma Rainey at AllMusic Ma Rainey at IMDb Ma Rainey (1886-1939) at Red Hot Jazz Archive Ma Rainey at Find a Grave Awards for Ma Rainey v t e Georgia Women of Achievement 1990s 1992 Martha Berry Lucy Craft Laney Juliette Gordon Low Flannery O'Connor 1993 Dicksie Bradley Bandy Mary Musgrove Cassandra Pickett Durham Viola Ross Napier Ma Rainey 1994 Julia Flisch Carson McCullers Margaret Mitchell Ruth Hartley Mosley Emily Harvie Thomas Tubman 1995 Selena Sloan Butler Anna Colquitt Hunter Hazel Jane Raines 1996 Susan Cobb Milton Atkinson Nellie Peters Black Ellen Craft Corra Harris Lugenia Burns Hope 1997 Rebecca Latimer Felton Mary Ann Harris Gay Nancy Hart Lucy Barrow McIntire 1998 Lettie Pate Whitehead Evans Julia Collier Harris Rhoda Kaufman Carrie Steele Logan 1999 Moina Michael Lillian Smith 2000s 2000 Sallie Ellis Davis Laura Askew Haygood Ellen Axson Wilson 2001 Julia L. Coleman Catherine Evans Whitener 2002 Wessie Gertrude Connell Lula Dobbs McEachern Alice Harrell Strickland 2003 Madeleine Kiker Anthony Helena Maud Brown Cobb Julia Lester Dillon Leila Ross Wilburn 2004 Mathilda Beasley Louise Frederick Hays Helen Dortch Longstreet Sarah McLendon Murphy Emily Barnelia Woodward 2005 Alice Woodby McKane Nina Anderson Pape Jeannette Rankin 2006 Eliza Frances Andrews Grace Towns Hamilton Sarah Porter Hillhouse 2007 Margaret O. Bynum Edith Lenora Foster Helen Douglas Mankin Sara Branham Matthews 2008 Elfrida De Renne Barrow Amilee Chastain Graves Susan Dowdell Myrick 2009 Caroline Pafford Miller Jane Hurt Yarn Harriet Powers 2010s 2010 Mary Ann Lipscomb Celestine Sibley Madrid Williams 2011 Lillian Gordy Carter Mary Francis Hill Coley May duBignon Stiles Howard 2012 Sarah Randolph Bailey Beulah Rucker Oliver Ethel Harpst 2013 Lollie Belle Wylie Mary Gregory Jewett Henrietta Stanley Dull 2014 Rebecca Stiles Taylor Ella Gertrude Clanton Thomas Bazoline Estelle Usher 2015 Allie Carroll Hart Frances Freeborn Pauley Nell Kendall Hodgson Woodruff 2016 Sarah Harper Heard Ellamae Ellis League Katie Hall Underwood 2017 Carolyn Mackenzie Carter Clermont Huger Lee Lucile Nix 2018 Ludie Clay Andrews Susie Baker King Taylor Mamie George S. Williams 2019 Leila Denmark Mary Dorothy Lyndon 2020s 2020 Clarice Cross Bagwell Katharine DuPre Lumpkin Juanita Marsh Jean Elizabeth Geiger Wright 2021 Ruby M. Anderson Mary G. Bryan Laura Pope Forester Allie Murray Smith v t e Rock and Roll Hall of Fame – Class of 1990 Performers Hank Ballard Bobby Darin The Four Seasons Tom DeVito, Bob Gaudio, Nick Massi, Frankie Valli Four Tops Renaldo Benson, Abdul "Duke" Fakir, Lawrence Payton, Levi Stubbs The Kinks Mick Avory, Dave Davies, Ray Davies, Pete Quaife The Platters David Lynch, Herb Reed, Paul Robi, Zola Taylor, Tony Williams Simon & Garfunkel Art Garfunkel, Paul Simon The Who Roger Daltrey, John Entwistle, Keith Moon, Pete Townshend Early influences Louis Armstrong Charlie Christian Ma Rainey Non-performers (Ahmet Ertegun Award) Gerry Goffin and Carole King Holland–Dozier–Holland Authority control General Integrated Authority File (Germany) ISNI 1 VIAF 1 WorldCat National libraries Norway Spain France (data) Italy United States Czech Republic Australia Israel Netherlands Poland Other Faceted Application of Subject Terminology MusicBrainz artist RERO (Switzerland) 1 Social Networks and Archival Context SUDOC (France) 1 Trove (Australia) 1 ." Women in World History: A Biographical Encyclopedia. . Encyclopedia.com. 16 Oct. 2020 . (2020, November 22). Retrieved November 22, 2020, from Rainey, Ma (1886–1939) | Encyclopedia.com Retrieved from "https://en.wikipedia.org/w/index.php?title=Ma_Rainey&oldid=1026581926" Categories: 1880s births 1939 deaths 20th-century American singers 20th-century American women singers Age controversies American blues singers American street performers African-American female singers Baptists from Georgia (U.S. state) Bisexual musicians Bisexual women Classic female blues singers LGBT African Americans LGBT people from Georgia (U.S. state) LGBT people from Alabama Musicians from Columbus, Georgia Paramount Records artists People from Rome, Georgia Vaudeville performers LGBT singers from the United States 20th-century Baptists Hidden categories: Articles with short description Short description is different from Wikidata Articles with hCards Infobox musical artist with missing or invalid Background field Wikipedia articles with GND identifiers Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BIBSYS identifiers Wikipedia articles with BNE identifiers Wikipedia articles with BNF identifiers Wikipedia articles with ICCU identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with NKC identifiers Wikipedia articles with NLA identifiers Wikipedia articles with NLI identifiers Wikipedia articles with NTA identifiers Wikipedia articles with PLWABN identifiers Wikipedia articles with FAST identifiers Wikipedia articles with MusicBrainz identifiers Wikipedia articles with RERO identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with Trove identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية تۆرکجه Català Deutsch Ελληνικά Español Esperanto فارسی Français Frysk Galego Հայերեն Bahasa Indonesia Italiano עברית Magyar مصرى Nederlands Norsk bokmål Norsk nynorsk Polski Português Русский Simple English Српски / srpski Suomi Svenska Українська Edit links This page was last edited on 3 June 2021, at 03:21 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-8174 ---- IBM RT PC - Wikipedia IBM RT PC From Wikipedia, the free encyclopedia (Redirected from IBM 6150 RT) Jump to navigation Jump to search Early RISC workstation from IBM This article includes a list of general references, but it remains largely unverified because it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (November 2017) (Learn how and when to remove this template message) IBM RT PC (RISC Technology Personal Computer) Developer IBM / IBM Research Manufacturer IBM Type Workstation computers Release date 1986; 35 years ago (1986) Discontinued May 1991 Operating system AIX operating system, Academic Operating System (AOS), or Pick operating system CPU IBM ROMP Memory 1 MB RAM, expandable to 16 MB Successor IBM RS/6000 The IBM RT PC (RISC Technology Personal Computer) is a family of workstation computers from IBM introduced in 1986. These were the first commercial computers from IBM that were based on a reduced instruction set computer (RISC) architecture. The RT PC used IBM's proprietary ROMP microprocessor, which commercialized technologies pioneered by IBM Research's 801 experimental minicomputer (the 801 was the first RISC). The RT PC ran three operating systems: AIX, the Academic Operating System (AOS), or Pick. The RT PC's performance was relatively poor compared to other contemporary workstations and it had little commercial success as a result; IBM responded by introducing the RS/6000 workstations in 1990, which used a new IBM-proprietary RISC processor, the POWER1. All RT PC models were discontinued by May 1991. Contents 1 Hardware 1.1 6152 Academic System 2 Software 3 Sales and market reception 4 As part of the NSFNET backbone 5 References 6 Further reading 7 External links Hardware[edit] Two basic types were produced: a floor-standing desk-side tower, and a table-top desktop. Both types featured a special board slot for the processor card, as well as machine-specific RAM cards. Each machine had one processor slot, one co-processor slot, and two RAM slots. There were three versions of the processor card: The Standard Processor Card or 032 card had a 5.88 MHz clock rate (170 ns cycle time), 1 MB of standard memory (expandable via 1, 2, or 4 MB memory boards). It could be accompanied by an optional Floating-Point Accelerator (FPA) board, which contained a 10 MHz National Semiconductor NS32081 floating point coprocessor. This processor card was used in the original RT PC models (010, 020, 025, and A25) announced on January 21, 1986.[1][2] The Advanced Processor Card had a 10 MHz clock (100 ns) and either 4 MB memory on the processor card, or external 4 MB ECC memory cards, and featured a built-in 20 MHz Motorola 68881 floating-point processor. The Advanced Processor Card could be accompanied by an optional Advanced Floating-Point Accelerator (AFPA) board, which was based around the Analog Devices ADSP-3220 FP multiplier and ADSP-3221 FP ALU. Models 115, 125, and B25 used these cards. These models were announced on February 17, 1987.[3] The Enhanced Advanced Processor Card sported a 12.5 MHz clock (80 ns), 16 MB on-board memory, while an enhanced advanced floating point accelerator was standard. The models 130, 135, and B35 used these cards. They were announced on July 19, 1988.[4] All RT PCs supported up to 16 MB of memory. Early models were limited to 4 MB of memory because of the capacity of the DRAM ICs used, later models could have up to 16 MB. I/O was provided by eight ISA bus slots. Storage was provided by a 40 or 70 MB hard drive, upgradeable to 300 MB. External SCSI cabinets could be used to provide more storage. Also standard were a mouse and either a 720×512 or 1024×768 pixel-addressable display, and a 4 Mbit/s Token Ring network adapter or 10BASE2 Ethernet adapter. For running CADAM, a computer-aided design (CAD) program, an IBM 5080 or 5085 graphics processor could be attached. The 5080 and 5085 were contained in a large cabinet that would have been positioned alongside the RT PC. The 5080 was used with a 1,024- by 1,024-pixel IBM 5081 display.[5][6] 6152 Academic System[edit] Main article: IBM Personal System/2 § 6152 Academic System The 6152 Academic System was a PS/2 Model 60 with a RISC Adapter Card, a Micro Channel board containing a ROMP, its support ICs, and up to 8 MB of memory. It allowed the PS/2 to run ROMP software compiled for the AOS. AOS was downloaded from a RT PC running AOS, via a LAN TCP/IP interface. Software[edit] One of the novel aspects of the RT design was the use of a microkernel. The keyboard, mouse, display, disk drives and network were all controlled by a microkernel, called Virtual Resource Manager (VRM), which allowed multiple operating systems to be booted and run at the same time. One could "hotkey" from one operating system to the next using the Alt-Tab key combination. Each OS in turn would get possession of the keyboard, mouse and display. Both AIX version 2 and the Pick operating system were ported to this microkernel. Pick was unique in being a unified operating system and database, and ran various accounting applications. It was popular with retail merchants, and accounted for about 4,000 units of sales. The primary operating system for the RT was AIX version 2. Much of the AIX v2 kernel was written in a variant of the PL/I programming language, which proved troublesome during the migration to AIX v3. AIX v2 included full TCP/IP networking support, as well as SNA, and two networking file systems: NFS, licensed from Sun Microsystems, and IBM Distributed Services (DS). DS had the distinction of being built on top of SNA, and thereby being fully compatible with DS on the IBM midrange AS/400 and mainframe systems. For the graphical user interfaces, AIX v2 came with the X10R3 and later the X10R4 and X11 releases of the X Window System from MIT, together with the Athena widget set. Compilers for C and Fortran programming languages were available. Some RT PCs were also shipped with the Academic Operating System (AOS), an IBM port of 4.3BSD Unix to the RT PC. It was offered as an alternative to AIX, the usual RT PC operating system, to US universities eligible for an IBM educational discount. AOS added a few extra features to 4.3BSD, notably NFS, and an almost ANSI C-compliant C compiler. A later version of AOS existed that was derived from 4.3BSD-Reno, but it was not widely distributed. The RT forced an important stepping-stone in the development of the X Window System, when a group at Brown University ported X version 9 to the system. Problems with reading unaligned data on the RT forced an incompatible protocol change, leading to version 10 in late 1985. Sales and market reception[edit] The IBM RT had a varied life even from its initial announcement. Most industry watchers considered the RT as "not enough power, too high a price, and too late."[citation needed] Many thought that the RT was part of IBM's Personal Computer line of computers. This confusion started with its initial name, "IBM RT PC". Initially, it seemed that even IBM thought that it was a high-end Personal Computer given the initially stunning lack of support that it received from IBM. This could be explained by the sales commission structure the IBM gave the system: salesmen received commissions similar to those for the sale of a PC. With typically configured models priced at $20,000, it was a hard sell, and the lack of any reasonable commission lost the interest of IBM's sales force.[citation needed] Both MIT's Project Athena and Brown University's Institute for Research in Information and Scholarship found the RT inferior to other computers.[7] The performance of the RT, in comparison with other contemporaneous Unix workstations, was not outstanding. In particular, the floating point performance was poor,[citation needed] and was scandalized mid-life with the discovery of a bug in the floating point square root routine.[citation needed] With the RT system's modest processing power (when first announced), and with announcements later that year by some other workstation vendors, industry analysts questioned IBM's directions. AIX for the RT was IBM's second foray into UNIX (its first was PC/IX for the IBM PC in September 1984.) The lack of software packages and IBM's sometimes lackluster support of AIX, in addition to sometimes unusual changes from traditional, de facto UNIX operating system standards, caused most software suppliers to be slow in embracing the RT and AIX. The RT found its home mostly in the CAD/CAM and CATIA markets, with some inroads into the scientific and educational areas, especially after the announcement of AOS and substantial discounts for the educational community. The RT running the Pick OS also found use as shopping store control systems, given the strong database, accounting system and general business support in the Pick OS. The RT also did well as an interface system between IBM's larger mainframes, due to its SNA and DS support, and some of its point-of-sale terminals, store control systems, and machine shop control systems. Approximately 23,000 RTs were sold over its lifetime, with some 4,000 going into IBM's development and sales organizations. Pick OS sales accounted for about 4,000 units. When the RT PC was introduced in January 1986, it competed with several workstations from established providers: the Apollo Computer Domain Series 3000, the DEC MicroVAX II, and Sun Microsystems Sun-3.[8] As part of the NSFNET backbone[edit] In 1987, "The NSF starts to implement its T1 backbone between the supercomputing centers with 24 RT-PCs in parallel implemented by IBM as ‘parallel routers’. The T1 idea is so successful that proposals for T3 speeds in the backbone begin. Internet History of 1980s The National Science Foundation Network (NSFNET) was the forerunner of the Internet. From July 1988 to November 1992, the NSFNET's T1 backbone network used routers built from multiple RT PCs (typically nine) interconnect by a Token Ring LAN.[9] References[edit] ^ https://www-01.ibm.com/common/ssi/ShowDoc.wss?docURL=/common/ssi/rep_ca/6/897/ENUS186-006/index.html&lang=en ^ Sager, Ira (27 January 1986). "IBM Retargets Tech Market with RISC-based UNIX System". Electronic News. ^ https://www-01.ibm.com/common/ssi/ShowDoc.wss?docURL=/common/ssi/rep_ca/1/897/ENUS187-021/index.html&lang=en ^ https://www-01.ibm.com/common/ssi/ShowDoc.wss?docURL=/common/ssi/rep_ca/0/897/ENUS188-120/index.html&lang=en ^ Derfler, Jr., Frank J. (10 June 1986). "Is There a Workstation in Your Future?". PC Magazine. pp. 110–113, 115. ^ Peddie, Jon (2013). The History of Visual Magic in Computers. Springer. pp. 172–173. ^ Garfinkel, Simson L. (May–June 1989). "Ripples Across the Academic Market" (PDF). Technology Review. pp. 9–13. Retrieved 25 January 2016. ^ Seymour, Jim (10 June 1986). "Marketing the IBM RT PC". PC Magazine. p. 114. ^ Claffy, Kimberly C.; Braun, Hans-Werner; Polyzos, George C. (August 1994). "Tracking long-term growth of the NSFNET". Communications of the ACM. 37 (8). doi:10.1145/179606.179616. Further reading[edit] Simpson, R.O. (1986). "The IBM RT Personal Computer". Byte, Extra Edition. pp. 43, 76. Hoffman, Thomas V. (1986). "PC Tech Journal: December, 1986 A Significant departure". Ziff-Davis. Cite magazine requires |magazine= (help) — Contains 4 significant technical articles about the Machine, processor and architecture. Waters, Frank; Henry, G Glen (1986). IBM RT Personal Computer Technology. IBM Engineering System Products. — IBM Pub SA23-1057-00 Duntemann, Jeff; Pronk, Ron (1994). Inside the PowerPC Revolution. Coriolis Group Books. — Chapter 5 describes the origins of the PowerPC architecture in the IBM 801 and RT PC. [1] Ferguson, Charles H.; Morris, Charles R. (1993). Computer Wars: How the West Can Win in a Post-IBM World. Random House. ISBN 0812921569. — Contains an in-depth description of the origins of the RT PC, its development, and subsequent commercial failure. External links[edit] IBM RT PC-page The IBM RT Information Page JMA Systems's FAQ Archive video in operation "IBM joins 32-bit fray with RT line". Computerworld. 27 January 1986. p. 8. ISSN 0010-4841. AOS FAQ at the Wayback Machine (archived March 12, 2007) This entry incorporates text from the RT/PC FAQ . v t e IBM History History of IBM Mergers and acquisitions Think (motto) Operating Systems Products Hardware Mainframe IBM Z Power Systems IBM storage FlashSystem DS8000 Tape storage IBM Q System One Notable historical: IBM Blue Gene Cell microprocessor Personal Computer IBM ThinkPad IBM Cloud IBM Cognos Analytics IBM Planning Analytics Watson Information Management Software Lotus Software Rational Software SPSS ILOG Tivoli Software: Service Automation Manager WebSphere alphaWorks Criminal Reduction Utilising Statistical History Mashup Center PureQuery Redbooks Fortran Connections IBM Quantum Experience Carbon Design System Business entities Center for The Business of Government Global Services Red Hat Kenexa International subsidiaries jStart Research The Weather Company (Weather Underground) Facilities Towers 1250 René-Lévesque, Montreal, QC One Atlantic Center, Atlanta, GA Software Labs Rome Software Lab Toronto Software Lab IBM Buildings 330 North Wabash, Chicago, IL Johannesburg Seattle Facilities Thomas J. Watson Research Center Hakozaki Facility Yamato Facility Cambridge Scientific Center IBM Hursley Canada Head Office Building IBM Rochester Initiatives Academy of Technology Deep Thunder IBM Fellow The Great Mind Challenge Developer: Develothon Linux Technology Center IBM Virtual Universe Community Smarter Planet World Community Grid Inventions Automated teller machine Electronic keypunch Hard disk drive Floppy disk DRAM Relational model Selectric typewriter Financial swaps Universal Product Code Magnetic stripe card Sabre airline reservation system Scanning tunneling microscope Terminology Globally integrated enterprise Commercial Processing Workload Consumability e-business CEOs Thomas J. Watson (1914–1956) Thomas Watson Jr. (1956–1971) T. Vincent Learson (1971–1973) Frank T. Cary (1973–1981) John R. Opel (1981–1985) John Fellows Akers (1985–1993) Louis V. Gerstner Jr. (1993–2002) Samuel J. Palmisano (2002–2011) Ginni Rometty (2012–2020) Arvind Krishna (2020–present) Board of directors Thomas Buberl Michael L. Eskew David Farr Alex Gorsky Michelle J. Howard Arvind Krishna Andrew N. Liveris Martha E. Pollack Virginia M. Rometty Joseph R. Swedish Sidney Taurel Peter R. Voser Other A Boy and His Atom Common Public License/IBM Public License Customer engineer Deep Blue Deep Thought Dynamic infrastructure GUIDE International IBM and the Holocaust IBM international chess tournament IBM worker organization Lucifer cipher Mathematica IBM Plex SHARE computing ScicomP Q Experience Sports teams American football Rugby union GlobalFoundries Retrieved from "https://en.wikipedia.org/w/index.php?title=IBM_RT_PC&oldid=1035466909" Categories: IBM workstations Computer-related introductions in 1986 Hidden categories: Articles with short description Short description matches Wikidata Articles lacking in-text citations from November 2017 All articles lacking in-text citations All articles with unsourced statements Articles with unsourced statements from August 2016 CS1 errors: missing periodical Webarchive template wayback links Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Deutsch Español Italiano Magyar 日本語 Norsk bokmål Русский Српски / srpski Suomi Edit links This page was last edited on 25 July 2021, at 21:11 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-847 ---- Netscape Navigator - Wikipedia Netscape Navigator From Wikipedia, the free encyclopedia Jump to navigation Jump to search Web browser This article is about the original Netscape Navigator product (versions 1 to 4.08). For the final 2007 release, see Netscape Navigator 9. For a full list of Netscape software releases, see Netscape (web browser). Netscape Navigator Netscape Navigator 1.22 Developer(s) Netscape Initial release 15 December 1994; 26 years ago (1994-12-15)[1] Final release 9.0.0.6 / 21 February 2008; 13 years ago (2008-02-21) ➔ Back to article "Netscape Navigator" Type Web browser Website archive.netscape.com Netscape Navigator was a proprietary web browser, and the original browser of the Netscape line, from versions 1 to 4.08, and 9.x. It was the flagship product of the Netscape Communications Corp and was the dominant web browser in terms of usage share in the 1990s, but by around 2003 its use had almost disappeared.[2] This was partly because the Netscape Corporation (later purchased by AOL) did not sustain Netscape Navigator's technical innovation in the late 1990s.[3] The business demise of Netscape was a central premise of Microsoft's antitrust trial, wherein the Court ruled that Microsoft's bundling of Internet Explorer with the Windows operating system was a monopolistic and illegal business practice. The decision came too late for Netscape, however, as Internet Explorer had by then become the dominant web browser in Windows. The Netscape Navigator web browser was succeeded by the Netscape Communicator suite in 1997. Netscape Communicator's 4.x source code was the base for the Netscape-developed Mozilla Application Suite, which was later renamed SeaMonkey.[4] Netscape's Mozilla Suite also served as the base for a browser-only spinoff called Mozilla Firefox. The Netscape Navigator name returned in 2007 when AOL announced version 9 of the Netscape series of browsers, Netscape Navigator 9. On 28 December 2007, AOL canceled its development but continued supporting the web browser with security updates until 1 March 2008. AOL allows downloading of archived versions of the Netscape Navigator web browser family. AOL maintains the Netscape website as an Internet portal.[5] Contents 1 History and development 1.1 Origin 1.2 Rise of Netscape 1.3 Decline 2 Legacy 3 See also 4 References 5 External links History and development[edit] Origin[edit] Mosaic Netscape 0.9, a pre-1.0 version, with image of the Mozilla mascot, and the Mosaic logo in the top-right corner. Netscape Navigator was inspired by the success of the Mosaic web browser, which was co-written by Marc Andreessen, a part-time employee of the National Center for Supercomputing Applications at the University of Illinois. After Andreessen graduated in 1993, he moved to California and there met Jim Clark, the recently departed founder of Silicon Graphics. Clark believed that the Mosaic browser had great commercial possibilities and provided the seed money. Soon Mosaic Communications Corporation was in business in Mountain View, California, with Andreessen as a vice-president. Since the University of Illinois was unhappy with the company's use of the Mosaic name, the company changed its name to Netscape Communications (suggested by product manager Greg Sands[6]) and named its flagship web browser Netscape Navigator. Netscape announced in its first press release (13 October 1994) that it would make Navigator available without charge to all non-commercial users, and beta versions of version 1.0 and 1.1 were indeed freely downloadable in November 1994 and March 1995, with the full version 1.0 available in December 1994. Netscape's initial corporate policy regarding Navigator claimed that it would make Navigator freely available for non-commercial use in accordance with the notion that Internet software should be distributed for free.[7] However, within two months of that press release, Netscape apparently reversed its policy on who could freely obtain and use version 1.0 by only mentioning that educational and non-profit institutions could use version 1.0 at no charge.[8] The reversal was complete with the availability of version 1.1 beta on 6 March 1995, in which a press release states that the final 1.1 release would be available at no cost only for academic and non-profit organizational use. Gone was the notion expressed in the first press release that Navigator would be freely available in the spirit of Internet software. Some security experts and cryptographers found out that all released Netscape versions had major security problems with crashing the browser with long URLs and 40 bits encryption keys.[9][10] The first few releases of the product were made available in "commercial" and "evaluation" versions; for example, version "1.0" and version "1.0N". The "N" evaluation versions were completely identical to the commercial versions; the letter was there to remind people to pay for the browser once they felt they had tried it long enough and were satisfied with it. This distinction was formally dropped within a year of the initial release, and the full version of the browser continued to be made available for free online, with boxed versions available on floppy disks (and later CDs) in stores along with a period of phone support. During this era, "Internet Starter Kit" books were popular, and usually included a floppy disk or CD containing internet software, and this was a popular means of obtaining Netscape's and other browsers.[11] Email support was initially free and remained so for a year or two until the volume of support requests grew too high. During development, the Netscape browser was known by the code name Mozilla, which became the name of a Godzilla-like cartoon dragon mascot used prominently on the company's web site. The Mozilla name was also used as the User-Agent in HTTP requests by the browser. Other web browsers claimed to be compatible with Netscape's extensions to HTML and therefore used the same name in their User-Agent identifiers so that web servers would send them the same pages as were sent to Netscape browsers. Mozilla is now a generic name for matters related to the open source successor to Netscape Communicator and is most identified with the browser Firefox. Rise of Netscape[edit] When the consumer Internet revolution arrived in the mid-1990s, Netscape was well-positioned to take advantage of it. With a good mix of features and an attractive licensing scheme that allowed free use for non-commercial purposes, the Netscape browser soon became the de facto standard, particularly on the Windows platform. Internet service providers and computer magazine publishers helped make Navigator readily available. An innovation that Netscape introduced in 1994 was the on-the-fly display of web pages, where text and graphics appeared on the screen as the web page downloaded. Earlier web browsers would not display a page until all graphics on it had been loaded over the network connection; this meant a user might have only a blank page for several minutes. With Netscape, people using dial-up connections could begin reading the text of a web page within seconds of entering a web address, even before the rest of the text and graphics had finished downloading. This made the web much more tolerable to the average user. Through the late 1990s, Netscape made sure that Navigator remained the technical leader among web browsers. New features included cookies, frames,[12] proxy auto-config,[13] and JavaScript (in version 2.0). Although those and other innovations eventually became open standards of the W3C and ECMA and were emulated by other browsers, they were often viewed as controversial. Netscape, according to critics, was more interested in bending the web to its own de facto "standards" (bypassing standards committees and thus marginalizing the commercial competition) than it was in fixing bugs in its products. Consumer rights advocates were particularly critical of cookies and of commercial web sites using them to invade individual privacy. In the marketplace, however, these concerns made little difference. Netscape Navigator remained the market leader with more than 50% usage share. The browser software was available for a wide range of operating systems, including Windows (3.1, 95, 98, NT), Macintosh, Linux, OS/2,[14] and many versions of Unix including OSF/1, Sun Solaris, BSD/OS, IRIX, AIX, and HP-UX, and looked and worked nearly identically on every one of them. Netscape began to experiment with prototypes of a web-based system, known internally as "Constellation", which would allow a user to access and edit his or her files anywhere across a network no matter what computer or operating system he or she happened to be using.[15] Industry observers forecast the dawn of a new era of connected computing. The underlying operating system, it was believed, would not be an important consideration; future applications would run within a web browser. This was seen by Netscape as a clear opportunity to entrench Navigator at the heart of the next generation of computing, and thus gain the opportunity to expand into all manner of other software and service markets. Decline[edit] This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Netscape Navigator" – news · newspapers · books · scholar · JSTOR (December 2020) (Learn how and when to remove this template message) Usage share of Netscape Navigator, 1994–2007 With the success of Netscape showing the importance of the web (more people were using the Internet due in part to the ease of using Netscape), Internet browsing began to be seen as a potentially profitable market. Following Netscape's lead, Microsoft started a campaign to enter the web browser software market. Like Netscape before them, Microsoft licensed the Mosaic source code from Spyglass, Inc. (which in turn licensed code from University of Illinois). Using this basic code, Microsoft created Internet Explorer (IE). The competition between Microsoft and Netscape dominated the Browser Wars. Internet Explorer, Version 1.0 (shipped in the Internet Jumpstart Kit in Microsoft Plus! For Windows 95[16]) and IE, Version 2.0 (the first cross-platform version of the web browser, supporting both Windows and Mac OS[17]) were thought by many to be inferior and primitive when compared to contemporary versions of Netscape Navigator. With the release of IE version 3.0 (1996) Microsoft was able to catch up with Netscape competitively, with IE Version 4.0 (1997) further improvement in terms of market share. IE 5.0 (1999) improved stability and took significant market share from Netscape Navigator for the first time. There were two versions of Netscape Navigator 3.0, the Standard Edition and the Gold Edition. The latter consisted of the Navigator browser with e-mail, news readers, and a WYSIWYG web page compositor; however, these extra functions enlarged and slowed the software, rendering it prone to crashing. This Gold Edition was renamed Netscape Communicator starting with version 4.0; the name change diluted its name-recognition and confused users. Netscape CEO James L. Barksdale insisted on the name change because Communicator was a general-purpose client application, which contained the Navigator browser. The aging Netscape Communicator 4.x was slower than Internet Explorer 5.0. Typical web pages had become heavily illustrated, often JavaScript-intensive, and encoded with HTML features designed for specific purposes but now employed as global layout tools (HTML tables, the most obvious example of this, were especially difficult for Communicator to render). The Netscape browser, once a solid product, became crash-prone and buggy; for example, some versions re-downloaded an entire web page to re-render it when the browser window was re-sized (a nuisance to dial-up users), and the browser would usually crash when the page contained simple Cascading Style Sheets, as proper support for CSS never made it into Communicator 4.x. At the time that Communicator 4.0 was being developed, Netscape had a competing technology called JavaScript Style Sheets. Near the end of the development cycle, it became obvious that CSS would prevail, so Netscape quickly implemented a CSS to JSSS converter, which then processed CSS as JSSS (this is why turning JavaScript off also disabled CSS). Moreover, Netscape Communicator's browser interface design appeared dated in comparison to Internet Explorer and interface changes in Microsoft and Apple's operating systems. By the end of the decade, Netscape's web browser had lost dominance over the Windows platform, and the August 1997 Microsoft financial agreement to invest one hundred and fifty million dollars in Apple required that Apple make Internet Explorer the default web browser in new Mac OS distributions. The latest IE Mac release at that time was Internet Explorer version 3.0 for Macintosh, but Internet Explorer 4 was released later that year. Microsoft succeeded in having ISPs and PC vendors distribute Internet Explorer to their customers instead of Netscape Navigator, mostly due to Microsoft using its leverage from Windows OEM licenses, and partly aided by Microsoft's investment in making IE brandable, such that a customized version of IE could be offered. Also, web developers used proprietary, browser-specific extensions in web pages. Both Microsoft and Netscape did this, having added many proprietary HTML tags to their browsers, which forced users to choose between two competing and almost incompatible web browsers. In March 1998, Netscape released most of the development code base for Netscape Communicator under an open source license.[18] Only pre-alpha versions of Netscape 5 were released before the open source community decided to scrap the Netscape Navigator codebase entirely and build a new web browser around the Gecko layout engine which Netscape had been developing but which had not yet incorporated. The community-developed open source project was named Mozilla, Netscape Navigator's original code name. America Online bought Netscape; Netscape programmers took a pre-beta-quality form of the Mozilla codebase, gave it a new GUI, and released it as Netscape 6. This did nothing to win back users, who continued to migrate to Internet Explorer. After the release of Netscape 7 and a long public beta test, Mozilla 1.0 was released on 5 June 2002. The same code-base, notably the Gecko layout engine, became the basis of independent applications, including Firefox and Thunderbird. On 28 December 2007, the Netscape developers announced that AOL had canceled development of Netscape Navigator, leaving it unsupported as of 1 March 2008.[19][20] Archived and unsupported versions of the browser remain available for download. Legacy[edit] Netscape's contributions to the web include JavaScript, which was submitted as a new standard to Ecma International. The resultant ECMAScript specification allowed JavaScript support by multiple web browsers and its use as a cross-browser scripting language, long after Netscape Navigator itself had dropped in popularity. Another example is the FRAME tag, which is widely supported today, and that has been incorporated into official web standards such as the "HTML 4.01 Frameset" specification. In a 2007 PC World column, the original Netscape Navigator was considered the "best tech product of all time" due to its impact on the Internet.[21] See also[edit] Timeline of web browsers Comparison of web browsers List of web browsers Netscape Mosaic Mozilla Lou Montulli References[edit] ^ "NETSCAPE CEO BARKSDALE'S DEPOSITION IN MICROSOFT SUIT (Text)". Bloomberg.com. 21 October 1998. Retrieved 12 December 2020. ^ "Roads and Crossroads of the Internet History". NetValley.com. Archived from the original on 6 February 2015. Retrieved 8 September 2014. ^ Netscape's Brief History Archived 16 February 2009 at the Wayback Machine Retrieved on 02-16-2009 ^ Clark, Jim (1999). Netscape Time. St. Martin's Press. ^ Tom Drapeau (28 December 2007). "End of Support for Netscape web browsers". The Netscape Blog. Archived from the original on 29 December 2007. Retrieved 29 December 2007. ^ "Greg Sands". Retrieved 20 February 2019. ^ "NETSCAPE COMMUNICATIONS OFFERS NEW NETWORK NAVIGATOR FREE ON THE INTERNET". AOL.com. Archived from the original on 7 December 2006. Retrieved 5 September 2015. ^ "NETSCAPE COMMUNICATIONS SHIPS RELEASE 1.0 OF NETSCAPE NAVIGATOR AND NETSCAPE SERVERS" (Press release). AOL.com. 15 September 1994. Archived from the original on 26 March 2005. Retrieved 5 September 2015. ^ Demailly, Laurent (22 July 1996). "Netscape (in)Security (problems)". Archived from the original on 29 January 1998. Retrieved 15 October 2011. ^ "Hackers Alert Netscape to Another Flaw". The New York Times. 26 September 1995. p. D19. Archived from the original on 16 January 1999. Retrieved 15 October 2011. ^ Mark Robbin Brown; Steven Forrest Burnett; Tim Evans; Heather Fleming; Galen Grimes; David Gunter; Jerry Honeycutt; Peter Kent; Margaret J. Larson; Bill Nadeau; Todd Stauffer; Ian Stokell; John Williams (1996). Netscape Navigator 3 Starter Kit. Que. ISBN 978-0-7897-1181-6. ^ Ladd, Eric. "Using HTML 3.2, Java 1.1, and CGI; Ch. 13, Frames". Archived from the original on 30 October 2007. ^ "Navigator Proxy Auto-Config File Format". Netscape Navigator Documentation. March 1996. Archived from the original on 18 December 2006. Retrieved 15 January 2011. ^ Watson, Dave (21 July 2001). "A Quick Look at Netscape". The Southern California OS/2 User Group. Archived from the original on 16 July 2011. Retrieved 16 August 2010. ^ Gordon, John (24 December 2008). "Why Google loves Chrome: Netscape Constellation". Gordon's Notes. Retrieved 18 December 2020. ^ "Download Web Browser - Internet Explorer". windows.microsoft.com. Microsoft. Archived from the original on 2 October 2003. Retrieved 5 September 2015. ^ "Microsoft Internet Explorer Web Browser Available on All Major Platforms, Offers Broadest International Support" (Press release). Microsoft. 30 April 1996. Archived from the original on 30 August 2013. Retrieved 8 September 2014. ^ Hamerly, Jim (January 1999). "Freeing the Source: The Story of Mozilla". O'Reilly. Archived from the original on 2 December 2014. Retrieved 8 September 2014. ^ BBC NEWS - Technology - Final goodbye for early web icon BBC News Archived 3 March 2008 at the Wayback Machine retrieved 29 February 2008 ^ "Curtains for Netscape - Tech Bytes". Canadian Broadcasting Company. Archived from the original on 5 July 2015. Retrieved 12 June 2015. ^ "The 50 Best Tech Products of All Time". PCWorld. 2 April 2007. Archived from the original on 6 September 2015. Retrieved 5 September 2015. External links[edit] Notice for Netscape Navigator 2.02 for OS/2 and Netscape Communicator 4.04 for OS/2 Users The hidden features of Netscape Navigator 3.0 Netscape Browser Archive - Early Netscape, SillyDog701 Preceded by first Netscape Navigator (1-4.08) Succeeded by Netscape Communicator (4) v t e Gopher A protocol for document search and retrieval on the Internet Active clients Dooble Lynx W3m WebPositive Discontinued clients Agora Arachne Amaya Arena AT&T Pogo Beonex Communicator Camino Cello Classilla Conkeror Cyberjack ELinks Epiphany Galeon GopherVR IBrowse Internet Explorer Internet Explorer for Mac Kazehakase libwww Line Mode Browser Minimo Minuet Mosaic Mothra Mozilla Application Suite Netscape OmniWeb SlipKnot Songbird tkWWW UdiWWW xB Browser Previously supported Epiphany Firefox Flock Internet Explorer SeaMonkey Server software Bucktooth NetPresenz PyGopherd Squid Synchronet Search engines Jughead Veronica Wide area information server (WAIS) Content AllMusic CCSO Nameserver Gophermap Phlog Hosts SDF Public Access Unix System The WELL People John Goerzen Mark P. McCahill v t e Netscape Browser versions Mosaic Netscape Netscape Navigator 1 2 3 4 Netscape Communicator 4 5 Netscape 6 7 Netscape Browser 8 Netscape Navigator 9 Netscape Plugin Application Programming Interface (NPAPI) E-mail clients Netscape Mail & Newsgroups Netscape Messenger 9 Other components Netscape Composer Server software Netscape Enterprise Server Netscape Application Server Netscape Proxy Server Netscape Directory Server Netscape Server Application Programming Interface (NSAPI) Web services Netscape.com Propeller.com Open Directory Project Netscape ISP People Eric J. Bina James H. Clark Brendan Eich Daniel Glazman Jamie Zawinski Lou Montulli Marc Andreessen Eric A. Meyer Mitchell Baker See also Gecko JSSS Mariner Netscape 5 Netscape Public License Mozilla AOL iPlanet v t e Timeline of web browsers General Comparison lightweight History List for Unix Usage share 1990s 1990 WorldWideWeb (Nexus) 1991 Line Mode Browser libwww 1992 Erwise MacWWW (Samba) MidasWWW tkWWW ViolaWWW 1993 AMosaic Arena Cello Emacs/W3 Lynx 2 NCSA Mosaic VMS Mosaic 1994 AirMosaic Internet in a Box ANT Fresco Argo IBM WebExplorer SlipKnot Minuet Navipress Mosaic/Mosaic Netscape/Netscape Navigator Spyglass Mosaic TCP/Connect II 1995 Agora ALynx AMSD Ariadna Cyberjack eWorld Web Browser Grail Internet Explorer 1 Internet Explorer 2 Netscape Navigator 2 NetShark OmniWeb HotJava UdiWWW WebShark w3m 1996 Cyberdog Arachne AWeb IBrowse Amaya Internet Explorer 3 Netscape Navigator 3 Opera 2 Oracle PowerBrowser tcpCONNECT4 Voyager 1997 Netscape Communicator Internet Explorer 4 Opera 2.1 1998 NeoPlanet Mozilla Application Suite Opera 3–3.21 1999 iCab Internet Explorer 5 Omniweb 3 Opera 3.5–3.62 2000s 2000 Beonex Communicator Galeon K-Meleon MediaBrowser Netscape 6 Opera 4–4.02 2001 iCab 2.5 Internet Explorer 6 Omniweb 4 Opera 5–5.12 2002 Avant Browser 7 Camino Epiphany Netscape 7 Opera 6–6.1 2003 GreenBrowser Maxthon Opera 7–7.3 Safari SlimBrowser 2004 Avant Browser 9 Phoenix/Firebird/Firefox Opera 7.5–7.55 2005 AOL Explorer Deepnet Explorer Firefox 1.5 Opera 8–8.54 Safari 2 2006 Avant Browser 11 Firefox 2 Internet Explorer 7 Opera 9–9.27 2007 Maxthon 2 Opera 9.5–9.64 Safari 3 SeaMonkey 1.1 2008 Chrome Firefox 3 Netscape Browser Netscape Navigator 9 NetSurf 1.2 2009 Avant Browser 11.7 Chrome 2–3 Firefox 3.5 Internet Explorer 8 Opera 10–10.63 Pale Moon Safari 4 SeaMonkey 2.0 2010s 2010 Chrome 4–8 Firefox 3.6 Lunascape 6.0.1 Maxthon 3 NetSurf 2.5 Opera 11–11.64 Safari 5 2011 Chrome 9–16 Firefox 4–9 Internet Explorer 9 Lunascape 6.5 Opera 12–12.17 SeaMonkey 2.1–2.4 Waterfox 2012 Chrome 17–23 Firefox 10–17 Internet Explorer 10 Lunascape 6.7 Maxthon 3.4 NetSurf 2.9 Safari 6 Yandex Browser 2013 Chrome 24–31 Firefox 18–26 Internet Explorer 11 Opera 15–18 Safari 7 SeaMonkey 2.15–2.22 2014 Chrome 32–39 Firefox 27–34 Lunascape 6.9 NetSurf 3.1 Opera 19–26 Safari 8 SeaMonkey 2.23–2.31 2015 Chrome 40–47 Firefox 35–43 Lunascape 6.10–6.12 Microsoft Edge 20, 25 Opera 27–34 Safari 9 SeaMonkey 2.32–2.39 Vivaldi 2016 Blisk 1.0.125–2.0.136 Chrome 48–55 Firefox 44–50 Lunascape 6.13–6.15 Microsoft Edge 38 Opera 35–42 Safari 10 Yandex 15.12–16.9 2017 Chrome 56–63 Firefox 51–57 Microsoft Edge 40, 41 Opera 43–49 Safari 11 SeaMonkey 2.46–2.49 Basilisk Brave Vivaldi 1.7–1.15 2018 Blisk 8.0.201–10.1.262 Chrome 64–71 Firefox 58–64 Microsoft Edge 42–44 Opera 50–57 Safari 12 Waterfox 56.0–56.2 Yandex 17.9–18.10 2019 Blisk 11.0–12.0.92 Chrome 72–79 Firefox 65–71 Opera 58–65 Safari 13 Vivaldi 2.3–2.10 Waterfox 60.1–68.0a2 Whale 1.4–1.5 Yandex 18.11–19.12 2020s 2020 Blisk 13.0 Brave 1.3–1.18 Chrome 80–87 Firefox 72–84 Microsoft Edge 79–87 Opera 66–73 SeaMonkey 2.53 Vivaldi 2.11–3.5 Safari 14 2021 Blisk 14.0.68.304— Brave 1.19— Chrome 88— Firefox 85— Microsoft Edge 88— Opera 74— SeaMonkey 2.53.6 Vivaldi 3.7— Yandex 20.11.5— Related topics 3D Markup Language for Web Aliweb ARPANET ASCII BITNET Browser wars CompuServe Elm Email File Transfer Protocol Gopher HTML HyperCard HyTelnet NCSA Telnet NLS Prodigy Teletext Telnet Usenet UUCP Videotex Viewdata Virtual Reality Markup Language Web page Whole Internet User's Guide and Catalog World Wide Web X.25 Retrieved from "https://en.wikipedia.org/w/index.php?title=Netscape_Navigator&oldid=1038249756" Categories: Latest preview software release templates Netscape 1994 software Cross-platform web browsers Discontinued web browsers Gopher clients History of web browsers OS/2 web browsers POSIX web browsers Hidden categories: Webarchive template wayback links Articles with short description Short description matches Wikidata Use dmy dates from January 2021 Articles needing additional references from December 2020 All articles needing additional references Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages العربية Azərbaycanca Bân-lâm-gú Català Čeština Deutsch Español Esperanto فارسی Français Galego 한국어 हिन्दी Hrvatski Bahasa Indonesia Interlingua Íslenska Italiano עברית ಕನ್ನಡ Latviešu Magyar मराठी Bahasa Melayu Nederlands 日本語 Norsk bokmål Polski Português Română Русский Simple English Slovenčina Slovenščina Српски / srpski Suomi Svenska தமிழ் ไทย Українська Vèneto Tiếng Việt 粵語 中文 Edit links This page was last edited on 11 August 2021, at 11:55 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-8593 ---- Perpetual futures - Wikipedia Perpetual futures From Wikipedia, the free encyclopedia Jump to navigation Jump to search In finance, a perpetual futures contract, also known as a perpetual swap, is an agreement to non-optionally buy or sell an asset at an unspecified point in the future. Perpetual futures are cash-settled, and differ from regular futures in that they lack a pre-specified delivery date, and can thus be held indefinitely without the need to roll over contracts as they approach expiration. Payments are periodically exchanged between holders of the two sides of the contracts, long and short, with the direction and magnitude of the settlement based on the difference between the contract price and that of the underlying asset, as well as, if applicable, the difference in leverage between the two sides. Perpetual futures were first proposed by economist Robert Shiller in 1992, to enable derivatives markets for illiquid assets.[1] However, perpetual futures markets have only developed for cryptocurrencies, following their introduction in 2016 by BitMEX.[2][3] Cryptocurrency perpetuals are characterised by the availability of high leverage, sometimes over 100 times the margin, and by the use of auto-deleveraging, which compels high-leverage, profitable traders to forfeit a portion of their profits to cover the losses of the other side during periods of high market volatility, as well as insurance funds, pools of assets intended to prevent the need for auto-deleveraging. Perpetuals serve the same function as contracts for difference (CFDs), allowing indefinite, leveraged tracking of an underlying asset or flow, but differ in that a single, uniform contract is traded on an exchange for all time-horizons, quantities of leverage, and positions, as opposed to separate contracts for separate quantities of leverage typically traded directly with a broker.[2] Contents 1 History 2 Mechanism 2.1 As used in cryptocurrency markets 2.1.1 Liquidation and Insurance Funds 2.1.2 Auto-deleveraging 3 See also 4 References History[edit] Holding a futures contract indefinitely requires periodically rolling over the contract into a new one before the contract's expiry. However, given that the price of futures typically differs from spot prices, rolling over contracts, particularly repeatedly, creates significant basis risk, leading to inefficiencies when used for hedging or speculation.[4] In an attempt to remedy these ills, the Chinese Gold and Silver Exchange of Hong Kong developed an "undated futures" market, wherein one-day futures would be rolled over automatically, with the difference between future and spot prices settled between the counterparties.[5] In 1992, Robert Shiller proposed perpetual futures, alongside a method for generating asset-price indices using hedonic regression, accounting for unmeasured qualities by adding dummy variables that represent elements of the index, indicating the unique quality of each element, a form of repeated measures design. This was intended to permit the creation of derivatives markets for illiquid, infrequently-priced assets, such as single-family homes, as well as untraded indices and flows of income, such as labour costs or the consumer price index.[1] The first significant uses of perpetual futures came in the form of cryptocurrency contracts, first offered by BitMEX in May 2016, that became popular amongst traders by permitting highly-leveraged trading at different time-horizions in a liquid market without inordinate counterparty risk in the absence of regulated intermediaries. As a result, $1.7T in cryptocurrency derivatives were traded in the third quarter of 2020, with a large majority of that volume consisting of perpetual futures.[6][7] Mechanism[edit] Perpetual futures for the value of a cash flow, dividend or index, as envisioned by Shiller, require the payment of a daily settlement, intended to mirror the value of the flow, from one side of the contract to the other. At any day t, the dividend s t + 1 {\displaystyle s_{t+1}} , paid from shorts to longs, is defined as: s t + 1 = ( f t + 1 − f t ) + ( d t + 1 − r t f t ) {\displaystyle s_{t+1}=(f_{t+1}-f_{t})+(d_{t+1}-r_{t}f_{t})} where f t {\displaystyle f_{t}} is the price of the perpetual at day t, d t {\displaystyle d_{t}} is the dividend paid to owners of the underlying asset on day t, and r t {\displaystyle r_{t}} is the return on an alternative asset (expected to be a short-term, low-risk rate) between time t and t+1.[1] As used in cryptocurrency markets[edit] The perpetual contracts offered by cryptocurrency derivative exchanges are typically priced by versions of the above formula, where the difference in cryptocurrency prices from one day to the other can be thought of as the dividend due to owners of the asset. However, a number of conventions have developed in the cryptocurrency perpetual market, due to greater volatility and the lack of regulatory requirements mandating a particular market structure. Unlike traditional futures, cryptocurrency perpetuals typically use the cryptocurrency as their base currency, making them inverse futures.[2] Settlement between different sides of the trade, known as funding, typically occurs every eight hours. In addition, given the lack of a cryptocurrency repo market and, consequently, an overnight rate, the base interest on cryptocurrency perpetuals is usually a fixed percentage set by the exchange. Liquidation and Insurance Funds[edit] Cryptocurrency derivatives exchanges lack central counterparty clearing, intermediaries in regulated derivatives markets that take collateral and adjust margin requirements in an attempt to eliminate counterparty risk, the risk that holders of one side in the contract will fail to cover their obligations in the event of a margin call after an adverse price move. As a result, liquidation is performed before the one side of the contract reaches bankruptcy, when the contract's remaining margin reaches a pre-specified value (the maintenance margin, which determines the liquidation price). If the exchange is able to close out the contract at a profit, the proceeds are typically inserted into the exchange's insurance fund, which guarantees the profitable side when counterparty margin is insufficient, usually when the price of the asset has moved sharply in one direction and the exchange was unable to liquidate at a profit. Auto-deleveraging[edit] If the exchange's insurance fund is depleted, whether globally or for a particular contract, accounts are ranked according to their profit and leverage. This is used to form an "auto-deleveraging" queue, where the positions of traders at the front of the queue are closed, at the bankruptcy price, to prevent market losers from going into default.[8] Auto-deleveraging is intended to reduce counterparty risk by penalising the riskiest traders, as opposed to the more evenly-spread "mutualised" model used by central clearing, and balance risk in a fully automated manner, requiring no manual discretion by intermediaries.[9] See also[edit] Futures contract Contract for difference References[edit] ^ a b c Shiller, Robert J, 1993. "Measuring Asset Values for Cash Settlement in Derivative Markets: Hedonic Repeated Measures Indices and Perpetual Futures," Journal of Finance, American Finance Association, vol. 48(3), pages 911-931, July. ^ a b c Alexander, Carol; Choi, Jaehyuk; Park, Heungju; Sohn, Sungbin (2019-03-15). "BitMEX Bitcoin Derivatives: Price Discovery, Informational Efficiency and Hedging Effectiveness". Rochester, NY. doi:10.2139/ssrn.3353583. S2CID 219363159. SSRN 3353583. Cite journal requires |journal= (help) ^ Alexander, Carol; Deng, Jun; Zou, Bin (2021-01-04). "Optimal Hedging with Margin Constraints and Default Aversion and its Application to Bitcoin Perpetual Futures". arXiv:2101.01261 [q-fin.RM]. ^ Gardner, B. L. (1989). Rollover hedging and missing long‐term futures markets. American Journal of Agricultural Economics, 71(2), 311-318. ^ Gehr Jr, Adam K. "Undated futures markets." The Journal of Futures Markets (1986-1998) 8, no. 1 (1988): 89. ^ "Derivatives' Disparities: Surveying the Bitcoin Perpetual Swap Market". Coin Metrics. 2020-08-04. Retrieved 2021-01-21. ^ Kraken Intelligence (2020-08-01). "The Tail Wags the Dog: An Evolution of Bitcoin Futures". Cite journal requires |journal= (help) ^ "What is Auto-Deleveraging (ADL)?". Bybit Official Help. Retrieved 2021-01-20. ^ "Auto Deleveraging Examples - BitMEX". www.bitmex.com. Retrieved 2021-01-20. v t e Derivatives market Derivative (finance) Options Terms Credit spread Debit spread Exercise Expiration Moneyness Open interest Pin risk Risk-free interest rate Strike price Synthetic position the Greeks Volatility Vanillas American Bond option Call Employee stock option European Fixed income FX Option styles Put Warrants Exotics Asian Barrier Basket Binary Chooser Cliquet Commodore Compound Forward start Interest rate Lookback Mountain range Rainbow Swaption Strategies Collar Covered call Fence Iron butterfly Iron condor Straddle Strangle Protective put Risk reversal Spreads Back Bear Box Bull Butterfly Calendar Diagonal Intermarket Jelly roll Ratio Vertical Valuation Binomial Black Black–Scholes Finite difference Garman–Kohlhagen Lattices Margrabe Put–call parity MC Simulation Real options Trinomial Vanna–Volga Swaps Amortising Asset Basis Conditional variance Constant maturity Correlation Credit default Currency Dividend Equity Forex Forward Rate Agreement Inflation Interest rate Overnight indexed Total return Variance Volatility Year-on-Year Inflation-Indexed Zero Coupon Inflation-Indexed Zero Coupon Swap Forwards Futures Contango Commodities future Currency future Dividend future Forward market Forward price Forwards pricing Forward rate Futures pricing Interest rate future Margin Normal backwardation Perpetual futures Single-stock futures Slippage Stock market index future Exotic derivatives Commodity derivative Energy derivative Freight derivative Inflation derivative Property derivative Weather derivative Other derivatives Collateralized debt obligation (CDO) Constant proportion portfolio insurance Contract for difference Credit-linked note (CLN) Credit default option Credit derivative Equity-linked note (ELN) Equity derivative Foreign exchange derivative Fund derivative Fund of funds Interest rate derivative Mortgage-backed security Power reverse dual-currency note (PRDC) Market issues Consumer debt Corporate debt Government debt Great Recession Municipal debt Tax policy Retrieved from "https://en.wikipedia.org/w/index.php?title=Perpetual_futures&oldid=1029402236" Categories: Derivatives (finance) Futures markets Hidden categories: CS1 errors: missing periodical Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Add links This page was last edited on 19 June 2021, at 19:15 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-8986 ---- Algorand (cryptocurrency platform) - Wikipedia Algorand (cryptocurrency platform) From Wikipedia, the free encyclopedia Jump to navigation Jump to search Cryptocurrency Algorand Code ALGO Development Original author(s) Silvio Micali White paper https://arxiv.org/abs/1607.01341 Initial release April 2019 Code repository https://github.com/algorand Development status Active Written in Go Developer(s) Algorand, Inc. Website https://www.algorand.com/ Ledger Ledger start June 2019 Block time 4.5 sec Block explorer https://algoexplorer.io/ Circulating supply 5,567,579,354.09 Algo (as 21st Jun 2021) Supply limit 10,000,000,000 Algo Algorand is a blockchain-based cryptocurrency platform that aims to be secure, scalable, and decentralized.[1] The Algorand platform supports smart contract functionality,[2] and its consensus algorithm is based on proof-of-stake principles and a Byzantine Agreement protocol.[1][3][4] Algorand's native cryptocurrency is called Algo.[2] Contents 1 History and development 2 Design 2.1 Consensus algorithm 2.2 Smart contracts 3 Use cases 4 References History and development[edit] The development of the Algorand platform is overseen by Algorand, Inc., a private corporation based in Boston. It was founded in 2017 by Silvio Micali, a professor at MIT.[5][6] The Algorand test network was launched to the public in April 2019,[7] and the main network was launched in June 2019.[8] Design[edit] Consensus algorithm[edit] In the Algorand network, the consensus algorithm is permissionless, and all users who hold an Algo balance can participate. The consensus algorithm works in rounds, with each round made up of two phases. The first phase is the block proposal phase, during which blocks are proposed as the new block; the second phase is the block finalization phase, during which a vote on the proposed blocks is taken.[1] The first phase (the block proposal phase) uses proof of stake principles. During this phase, a committee of users in the system is selected randomly, though in a manner that is weighted, to propose the new block. The selection of the committee is done via a process called “cryptographic sortition.” In cryptographic sortition, there is not a central authority that designates who the members of the committee are and then communicates that information across the network; rather, each user determines whether they are on the committee or not by locally executing a Verifiable Random Function (VRF). If the VRF indicates that the user is chosen, the VRF returns a cryptographic proof that can be used to verify that the user is on the committee. Only a given user knows whether they are on the committee, unless/until they send a message to other users indicating that they are. The likelihood that a given user will be on the committee is influenced by the “stake” (i.e., the number of Algo tokens) held by that user, in proportion to the size of the user's stake.[1][3][4] After determining that they are on the block selection committee, a user builds a proposed block and disseminates it to the network for review/analysis during the second phase. The user includes the cryptographic proof from the VRF in their proposed block, which demonstrates that the user was in fact an eligible committee member.[3][4] In the second phase (the block finalization phase), a Byzantine Agreement protocol (called “BA⋆”) is used to vote on the proposed blocks. In this second phase, cryptographic sortition as described above is again used to determine a committee; this second-phase voting committee will be different from the committee from the first phase, though it is possible that there could be overlap in membership between the two committees. When users have determined that they are in this second-phase voting committee, they analyze the proposed blocks they have received (this will include verifying that they were in fact proposed by users from the first-phase committee) and vote on whether any of the blocks should be adopted or not. If the voting committee achieves consensus on a new block, then the new block is disseminated across the network as the new block.[1][3][4] The Algorand consensus algorithm possess the characteristic of “player replaceability”; i.e., as noted above, membership in the different committees (in both the block proposal and block finalization phase) changes every time the phase is run. This protects users against targeted attacks, as an attacker will not know in advance which users are going to be in a committee.[1] Algorand is resilient against arbitrary partitions, also known as asynchronous safety. Two different blocks cannot reach consensus in the same round, i.e. it is mathematically guaranteed that Algorand will not fork.[9] The asynchronous safety has also been formally verified by Runtime Verification Inc. and compared to their previous verification models, the model also accounts for timing issues and adversary actions, e.g., when the adversary has control over message delivery.[10] Smart contracts[edit] Algorand supports two types of smart contracts: stateless smart contracts and stateful smart contracts. Stateless smart contracts are intended for the purpose of authorizing transactions; stateful smart contracts store data persistently and can be used for broader purposes.[2] Algorand smart contracts can be written in a programming language called Transaction Execution Approval Language (TEAL). TEAL is a bytecode-based stack language, with a programming interface for Python that is called PyTeal. While some smart contract programming models are Turing-complete (for example, Solidity is Turing-complete), the Algorand smart contracts model is not Turing-complete. The Algorand smart contracts model does support transaction atomicity.[2] In some other blockchain systems, smart contracts are used to define user-defined assets; for example, in Ethereum, smart contracts implement the ERC20 and ERC721 interfaces to define new assets. In Algorand, in contrast, user-defined assets are supported natively, and Algorand smart contracts are able to manipulate user-defined assets (for example, by transferring ownership of given amounts of them) using built-in transaction types.[2] Use cases[edit] In March 2021, the Società Italiana degli Autori ed Editori (SIAE), the Italian copyright collecting agency, uploaded over four million non-fungible tokens (NFTs) to the Algorand blockchain, representing copyrights in works produced by SIAE's members.[11] In February 2021, Ditto Music announced the launch of a project on the Algorand network called Opulous; Opulous will be a decentralized finance (DeFi) loan pool, where loans will be guaranteed against artists’ past streaming revenues and artists’ copyrights will be held as collateral.[12] In June 2020, Republic, a company that facilitates crowdfunding campaigns for startups and small-to-medium businesses (SMBs), issued a profit-sharing token on the Algorand platform.[13] In March 2020 there was the announcement that Marshall Islands will issue their "Sovereign" digital currency using the Algorand network as a backbone.[14] In February 2020, PlanetWatch, a spinoff of CERN, announced a program involving the deployment of a global network of air quality sensors, where the sensors record measurement data onto the Algorand blockchain.[15] In 2020, two stablecoins, Tether and USD Coin (USDC), were launched on the Algorand network.[16][17] In May 2021, Securitize, a company that enables investment in private capital markets, launched two cryptocurrency yield funds and announced they would be recorded using Algorand's blockchain.[18] References[edit] ^ a b c d e f Lepore, Cristian; Ceria, Michela; Visconti, Andrea; Rao, Udai Pratap; Shah, Kaushal Arvindbhai; Zanolini, Luca (14 October 2020). "A Survey on Blockchain Consensus with a Performance Comparison of PoW, PoS and Pure PoS". Mathematics. 8 (10): 1782. doi:10.3390/math8101782. ^ a b c d e Bartoletti, Massimo (2020). "A formal model of Algorand smart contracts" (PDF). Financial Cryptography and Data Security 2021. arXiv:2009.12140. ^ a b c d Xiao, Y.; Zhang, N.; Lou, W.; Hou, Y. T. (28 January 2020). "A Survey of Distributed Consensus Protocols for Blockchain Networks". IEEE Communications Surveys and Tutorials. 22 (2): 1432–1465. arXiv:1904.04098. doi:10.1109/COMST.2020.2969706. ISSN 1553-877X. S2CID 102352657. ^ a b c d Wan, Shaohua; Li, Meijun; Liu, Gaoyang; Wang, Chen (2020-11-01). "Recent advances in consensus protocols for blockchain: a survey". Wireless Networks. 26 (8): 5579–5593. doi:10.1007/s11276-019-02195-0. ISSN 1572-8196. ^ Zhao, Helen (2018-02-23). "Bitcoin and blockchain consume an exorbitant amount of energy. These engineers are trying to change that". CNBC. Retrieved 2021-04-03. ^ "MIT professor debuts high-speed blockchain payments platform Algorand". VentureBeat. 2018-02-15. Retrieved 2021-04-03. ^ "Algo VC Fund Raises $200M to Fast-Track Its Own Cryptocurrency". www.bizjournals.com. Retrieved 2021-04-03. ^ "Bahrain's Shariah Review Bureau Certifies Blockchain Firm Algorand As Shariah Compliant". Crowdfund Insider. 2019-10-23. Retrieved 2021-04-03. ^ Chen, Jing; Micali, Silvio (2019-07-19). "Algorand: A secure and efficient distributed ledger". Theoretical Computer Science. 777: 155–183. doi:10.1016/j.tcs.2019.02.001. ISSN 0304-3975. ^ Alturki, Musab A.; Chen, Jing; Luchangco, Victor; Moore, Brandon; Palmskog, Karl; Peña, Lucas; Roşu, Grigore (2020). "Towards a Verified Model of the Algorand Consensus Protocol in Coq". Formal Methods. FM 2019 International Workshops. Lecture Notes in Computer Science. 12232. pp. 362–367. arXiv:1907.05523. doi:10.1007/978-3-030-54994-7_27. ISBN 978-3-030-54993-0. S2CID 196471153. ^ "Il diritto d'autore diventa asset digitale su blockchain". Il Sole 24 ORE (in Italian). Retrieved 2021-04-03. ^ "Ditto launches Opulous platform to help artists access funding without the need for traditional banks". Music Business Worldwide. 2021-02-01. Retrieved 2021-04-03. ^ "Crypto Push by Republic Platform Sparked by New Token". Bloomberg.com. 2020-06-24. Retrieved 2021-04-03. ^ "Unlocking the potential of blockchain technology". MIT News | Massachusetts Institute of Technology. Retrieved 2021-06-20. ^ "Blockchain al servizio dell'ambiente: un registro pubblico di qualità dell'aria". Il Sole 24 ORE (in Italian). Retrieved 2021-04-03. ^ Castillo, Michael del. "Visa Partners With Ethereum Digital-Dollar Startup That Raised $271 Million". Forbes. Retrieved 2021-04-03. ^ Confidential, Crypto. "Stimulus Checks From A Crypto Exchange; Bitcoin Rebound". Forbes. Retrieved 2021-04-03. ^ Dantes, Damanick. "Securitize to Issue Digital Asset Securities for Yield Funds". CoinDesk. v t e Cryptocurrencies Technology Blockchain Cryptocurrency tumbler Cryptocurrency exchange Cryptocurrency wallet Cryptographic hash function Decentralized exchange Decentralized Finance Distributed ledger Fork Lightning Network MetaMask Non-fungible token Smart contract Consensus mechanisms Proof of authority Proof of personhood Proof of space Proof of stake Proof of work Proof of work currencies SHA-256-based Bitcoin Bitcoin Cash Counterparty LBRY MazaCoin Namecoin Peercoin Titcoin Ethash-based Ethereum Ethereum Classic Scrypt-based Auroracoin Bitconnect Coinye Dogecoin Litecoin Equihash-based Bitcoin Gold Zcash RandomX-based Monero X11-based Dash Petro Other AmbaCoin Firo IOTA Primecoin Verge Vertcoin Proof of stake currencies Algorand Cardano EOS.IO Gridcoin Nxt Peercoin Polkadot Steem Tezos TRON ERC-20 tokens Augur Aventus Bancor Basic Attention Token Chainlink Kin KodakCoin Minds The DAO Uniswap Stablecoins Dai Diem Tether USD Coin Other currencies Ankr Chia Filecoin HBAR (Hashgraph) Nano NEO Ripple SafeMoon Stellar WhopperCoin Related topics Airdrop BitLicense Blockchain game Complementary currency Crypto-anarchism Cryptocurrency bubble Cryptocurrency scams Digital currency Distributed ledger technology law Double-spending Hyperledger Initial coin offering Initial exchange offering Initiative Q List of cryptocurrencies Token money Virtual currency Category Commons List Retrieved from "https://en.wikipedia.org/w/index.php?title=Algorand_(cryptocurrency_platform)&oldid=1038649658" Categories: Blockchains Alternative currencies Cryptocurrencies Hidden categories: CS1 Italian-language sources (it) Articles with short description Short description matches Wikidata Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Italiano Edit links This page was last edited on 13 August 2021, at 20:59 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-9005 ---- The Clash of the Wolves - Wikipedia The Clash of the Wolves From Wikipedia, the free encyclopedia Jump to navigation Jump to search 1925 film The Clash of the Wolves Lobby card Directed by Noel M. Smith Written by Charles Logue Story by Charles Logue Starring Rin Tin Tin Charles Farrell June Marlowe Cinematography Edwin B. DuPar Allen Thompson Joseph Walker Edited by Clarence Kolster Production company Warner Bros. Distributed by Warner Bros. Release date November 28, 1925 (1925-11-28) Running time 74 minutes Country United States Language Silent (English intertitles) Budget $89,000[1] Box office $270,000[1] Play media The full film The Clash of the Wolves is a 1925 American silent Western/adventure film produced and distributed by Warner Bros. Directed by Noel M. Smith, the film stars canine actor Rin Tin Tin, Charles Farrell and June Marlowe. It was filmed on location in Chatsworth, California, and at what would later become the Joshua Tree National Park.[2] It was transferred onto 16mm film by Associated Artists Productions[3] in the 1950s and shown on television. A 35mm print of the film was discovered in South Africa and restored in 2003. In 2004, The Clash of the Wolves was deemed "culturally, historically, or aesthetically significant" by the United States Library of Congress and selected for preservation in the National Film Registry.[4][5] Contents 1 Plot 2 Cast 3 Reviews and reception 3.1 Box Office 4 Preservation status 5 Accolades 6 References 7 External links Plot[edit] Lobo, wolfdog leader of a wolf pack, has a price on his head. One day suffering from a thorn in his paw, he is found by Dave Weston, a borax prospector and befriended. The animal returns love and loyalty. Later Lobo saves Dave from attacks of scheming villain William 'Borax' Horton, who has designs on Dave's claim. Once again the villain attacks the young prospector and leaves him for dead on the site of the claim. Lobo arrives and Dave sends him with a message to town for help. In the meantime a posse is hunting Lobo, but he manages to escape them and at the same time, decoy them to Dave. There, they learn that Lobo is man's best friend. Cast[edit] Rin Tin Tin as Lobo Nanette as Lobo's Mate Charles Farrell as Dave Weston June Marlowe as May Barstowe Heinie Conklin as Alkali Bill Will Walling as Sam Barstowe Pat Hartigan as William 'Borax' Horton Reviews and reception[edit] Michael L. Simmons wrote in the Exhibitors Trade Review, that "He (Rin-Tin-Tin) brings to the role of leader of a wolf-pack, an intelligence, a beauty of motion, an impressive cleverness that should find wide favor. He is a spectacle, in my opinion, well worth the price of admission." Simmons went on to say that "It is obvious throughout; every time the human cast stacks up alongside the exploits of the animal players, the latter stands out far ahead in the ability to compel interest."[6] Motion Picture News reviewer George T. Pardy praised the performance of Rin-Tin-Tin, saying; "his work all through is extraordinary and far above that of his average doggish contemporaries in filmland...the thrills are many and pungent, mostly arising from the endeavors to trap or shoot Lobo of folks who know that there is a price set on the head of the kingly wolf."[7] A review in The Film Daily was critical of the film stating, "No doubt the author is chiefly to blame for furnishing a script that is a mixture of dizzy melodrama, burlesque, caricature - anything in fact far removed from reality. Director Noel Smith struggled bravely with it. He deserves credit for getting over the dog sequences with a snap and a punch. The rest of the weak story seemed to have him licked."[8] Box Office[edit] According to Warner Bros records the film earned $232,000 domestically and $38,000 foreign.[1] Preservation status[edit] A 35mm projection print of The Clash of the Wolves was found in South Africa and returned to the United States. It underwent restoration and preservation in 2003.[9][10] Abridged and full versions survive in the Library of Congress Packard Campus for Audio-Visual Conservation.[11] Accolades[edit] In 2004, The Clash of the Wolves was deemed "culturally, historically, or aesthetically significant" by the United States Library of Congress and selected for preservation in the National Film Registry.[12][5] References[edit] ^ a b c Warner Bros financial information in The William Shaefer Ledger. See Appendix 1, Historical Journal of Film, Radio and Television, (1995) 15:sup1, 1-31 p 4 DOI: 10.1080/01439689508604551 ^ "Clash of the Wolves". silentera.com. Retrieved April 1, 2015. ^ 1957 MOVIES FROM AAP Warner Bros Features & Cartoons SALES BOOK DIRECTED AT TV ^ "Librarian of Congress Adds 25 Films to National Film Registry". Library of Congress, Washington, D.C. 20540 USA. Retrieved April 24, 2020. ^ a b "Complete National Film Registry Listing | Film Registry | National Film Preservation Board | Programs at the Library of Congress | Library of Congress". Library of Congress, Washington, D.C. 20540 USA. Retrieved June 1, 2020. ^ Michael L. Simmons (November 1925). "The Clash of the Wolves". Exhibitors Trade Review. 19 (1): 29. ^ George T. Pardy (November 1925). "The Clash of the Wolves". Motion Picture News. 32 (22): 2572. ^ "The Clash of the Wolves". The Film Daily. 34 (44): 6. November 1925. ^ "Clash of the Wolves (motion picture)". Library of Congress. Retrieved November 30, 2015. ^ "Clash of the wolves". UCLA Film and Television Archive. Retrieved November 30, 2015. ^ Catalog of Holdings The American Film Institute Collection and The United Artists Collection at The Library of Congress, p. 31, c.1978 the American Film Institute ^ "News from the Library of Congress". loc.gov. Retrieved July 17, 2015. External links[edit] Wikimedia Commons has media related to The Clash of the Wolves. The Clash of the Wolves essay by Susan Orlean at National Film Registry [1] The Clash of the Wolves essay by Daniel Eagan in America's Film Legacy: The Authoritative Guide to the Landmark Movies in the National Film Registry, A&C Black, 2010 ISBN 0826429777, pages 107-108 [2] The Clash of the Wolves at IMDb The Story of Rin-Tin-Tin is available for free download at the Internet Archive The Clash of the Wolves at the American Film Institute Catalog The Clash of the Wolves at the TCM Movie Database Lobby cards and still at silenthollywood.com Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Clash_of_the_Wolves&oldid=1017942259" Categories: 1925 films 1920s romance films 1920s Western (genre) adventure films United States National Film Registry films American films American romance films American silent feature films American Western (genre) adventure films American black-and-white films Films about dogs Films shot in California Warner Bros. films 1920s rediscovered films Rin Tin Tin Rediscovered American films Surviving American silent films Hidden categories: Use mdy dates from September 2020 Articles with short description Short description is different from Wikidata Template film date with 1 release date Commons category link is on Wikidata Articles with Internet Archive links Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Languages Bahasa Indonesia Italiano Bahasa Melayu Nederlands Polski Edit links This page was last edited on 15 April 2021, at 13:12 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-9479 ---- Wildcat banking - Wikipedia Wildcat banking From Wikipedia, the free encyclopedia Jump to navigation Jump to search Period of banking in U.S. history Notes of the Bank of Singapore, Michigan Wildcat banking was the issuance of paper currency in the United States by poorly capitalized state-chartered banks. These wildcat banks existed alongside more stable state banks during the Free Banking Era from 1836 to 1865, when the country had no national currency. States granted banking charters readily and applied regulations ineffectively, if at all.[1] Bank closures and outright scams regularly occurred, leaving people with worthless money. Operating primarily as banks of issue rather than deposit banks, wildcat banks circulated currency that was formally redeemable in gold or silver coin, but practically based on other assets such as government bonds or real estate notes. The banks were typically located outside the commercial centers in areas where people possessed land but coins were scarce. Instead of depositing coins at the bank for credit, a client could deposit a pledge of his land and receive a loan in notes of the bank that was repayable in cash.[2] Contents 1 Forerunners 1.1 New England country banks 1.2 First federal bank interim 2 Background of free banking 2.1 Jacksonian bank policy 2.2 Prevalence of wildcat banks 3 Free banking in Michigan 4 Railroad banks 5 Late period 6 In popular culture 7 Notes 8 References 9 Further reading 10 External links Forerunners[edit] Andrew Dexter Jr., a wildcat banking pioneer New England country banks[edit] See also: Suffolk Bank and Suffolk System The earliest example of what came to be called wildcat banking began in New England during the 1790s. The banking establishment of Boston was opposed by a greater number of country banks throughout the region. Because the city banks refused the country banks' currency, it came to dominate the commercial activity of Boston, while the city banks' notes were paid directly back to them. Country bankers soon understood that distance from the city was an advantage, since notes that found their way to Boston did not easily return for payment. In the mid-1800s businessman Andrew Dexter Jr. acquired interests in several of these remote banks to support his construction of a central money exchange in Boston. He borrowed extravagantly from the banks and flooded the city with newly issued notes. These included the Farmers' Exchange Bank of Gloucester, located in the isolated village of Chepachet, Rhode Island; the Berkshire Bank, located in Pittsfield at the other end of Massachusetts; and even the Detroit Bank, which Dexter's associates had established more than 600 miles (970 km) away in the newly organized Michigan Territory.[3] When the scheme unraveled in 1809, the Berkshire Bank received more notes for payment in one day than the entire amount outstanding on its books.[4] Farmers' Exchange Bank made history as the first American bank to fail, with $86 on hand to pay $580,000 in notes.[3] First federal bank interim[edit] Another period of credit expansion by state banks occurred after the expiration of the First Bank of the United States in 1811, culminating in the Panic of 1819. The Bank's prompt collection of state bank notes had enforced a degree of responsibility that soon faded. The burning of Washington in late 1814 during the War of 1812 prompted bank runs across the eastern seaboard and the suspension of specie payments by state governments. City governments and every sort of business resorted to paying their expenses with notes and shinplasters, and the expansion of money could not easily be reined in after the war had ended.[5] The urgent need to restore coins to circulation was one argument in favor of creating the Second Bank of the United States in 1816.[6] At first the new Bank accommodated the troubled state banks, and the proliferation of new banks continued. In New York, the law prohibited anyone from forming a corporation for the purpose of banking without a state charter, but did not prevent banking as a side business. By the time the legislature closed the loophole in 1818, the businesses exploiting it included aqueduct companies, turnpike companies, tavern-keepers and glass-makers.[5] Unchartered banking associations were created in the western regions of Virginia and Pennsylvania to supply the credit needs of local settlers,[7] as well as in Kentucky and Ohio. A traveler in the latter states observed "much trouble with paper money" at the end of 1818 that could only lead to "penance" and the return to a smaller money stock.[8] By that time a policy shift by the Second Bank was already underway. In response to declining crop prices, it called upon state banks for cash payment of the notes that it held. The Bank's call was followed by a collapse in prices for American agricultural exports. Real estate prices plummeted amid foreclosures, businesses were ruined and a two-year recession followed. The crisis left the Bank in better financial condition and the remaining state banks more accountable, but also left resentment of the Bank's harsh approach.[9][10] Background of free banking[edit] Jacksonian bank policy[edit] In 1833, as part of his effort to break the political power of the Second Bank, President Andrew Jackson ordered the removal of federal funds from the Bank to favored state banks, known as pet banks. He subsequently signed the Deposit Act of 1836, which continued the federal subsidy to state banks and prevented the Secretary of the Treasury from regulating credit expansion by those banks in the manner that the Second Bank had. He also issued the Specie Circular, which required federal land sales to be paid in silver or gold coin and had the effect of drawing those coins from the coast to the developing interior. A collapse in the price of cotton in 1836 led the Bank of England to limit the flow of money to the United States. This, along with the failure of domestic businesses involved in cotton production, produced the Panic of 1837 and an economic depression lasting roughly five years. Businesses, especially in the west, found it difficult to obtain the hard money to which they had been accustomed and turned to creative methods of finance. In subsequent years Democratic Party politicians continued to oppose centralized banking, and the Supreme Court ruled in Briscoe v. Bank of Kentucky that states could issue currency only on the credit of private parties, not that of the state.[2] Prevalence of wildcat banks[edit] The experience of free banking varied across the country. As a system of independent banks chartered by independent legislatures, it suffered from inconsistency, inconvenience and risk, but not every privately organized state bank was a fraudulent or reckless "wildcat." Even relatively well-run banks could fail to pay out if a drop in a state's credit devalued the bonds that secured the bank's notes, or if a crisis such as the outbreak of war shook public confidence.[11][12] Free banking in Michigan[edit] Jacksonian Democrats in Michigan advocated for free banking rather than a state monopoly. The term "wildcat banking" arose in reference to the Michigan banking boom of the late 1830s. Promptly upon becoming a state in 1837, Michigan passed the General Banking Act, which allowed any group of landowners to organize a bank by raising at least $50,000 capital stock and depositing notes on real estate with the government as security for their bank notes. This law was unprecedented in a country where legislatures normally chartered each bank with a separate act. Although it was a regulated system in theory, the commissioners appointed to regulate the banks lacked the resources to do so effectively. A total of 49 banks were established, a surprising number given the capital requirement, and in time several were found to have cheated the law by watering their stock with phony contributions or passing cash from one bank to another ahead of the visiting commissioners.[13][14] The banks issued currency notes that could be redeemed in specie only at rural locations, assuming cash was on hand. Commissioner Alpheus Felch recalled that one bank's "cash reserves" consisted of boxes of nails and glass topped with silver coins. Anyone who received the notes had to discount them according to their expected redemption value. According to a contemporary newspaper report: "Michigan money is thus classed—First quality, Red Dog; second quality, Wild Cat; third quality, Catamount. Of the best quality, it is said, it takes five pecks to make a bushel."[15] Precisely how these terms became associated with the notes is not known.[14] A counterfeit note in the collection of Eric P. Newman that features a mountain lion has become known as the "true wild cat note," but it purports to be an 1828 note of the Catskill Bank in New York, with no apparent connection to the events in Michigan.[16] The common explanation is that the banks located their offices in inaccessible areas where animals outnumbered people.[17] In response to these abuses, Michigan suspended new charters under the act. It attempted to create a single closely regulated state bank modeled on the neighboring Bank of Indiana, but was unable to raise the necessary capital. States continued to experiment with banking regulation in the absence of a federal policy, while Arkansas and Iowa prohibited banks entirely.[citation needed] Railroad banks[edit] A note issued by the banking arm of the Erie & Kalamazoo Railroad The Free Banking Era coincided with the first phase of railroad speculation. Not only did banks sponsor railroads, but railroad companies also entered the banking business to finance their expenses. Although railroads were indeed built, spectacular failures occurred. The Ohio Railroad company, established in 1835 to build along the coast of Lake Erie, immediately used a permissive clause in its charter to begin issuing credit notes, which it redeemed from its state funding. The company's failure left several hundred thousand dollars in worthless currency and an unusable track built upon wooden pilings. Similar episodes played out in southern states, where railroads received explicit authority to operate as banks. An 1830s railroad boom in Mississippi covered the state with speculative routes and railroad bank paper. Robert Y. Hayne organized the South Western Railroad Bank to finance interstate routes from South Carolina to Ohio, with stringent rules to protect its capital, but it ultimately had to suspend payments on its notes when the railroad ran out of funding.[18] One of these institutions, the Georgia Railroad and Banking Company, survived the Free Banking Era, the Civil War and subsequent upheavals, ultimately merging with First Union in 1986.[19] Late period[edit] The Bank of Florence in present-day Omaha The 1850s saw a new wave of free banking laws and outbreaks of wildcat banking in Tennessee, Indiana, Wisconsin and the Nebraska Territory.[20] The laws of Indiana and Wisconsin allowed bankers to start business with minimal capital and accepted discounted state bonds at their face value as a security deposit. A "banker" might even pay for the discounted bonds with the same notes that they backed, draw the interest on the bonds, and circulate the surplus notes as he chose.[21][22] Nebraska declared bank issues a crime in its first legislative session of 1855, but the following year it granted several banking charters, including that of the Bank of Florence. The third year, a new criminal code omitted the banking provision, allowing banks to organize under general business law.[23] The Panic of 1857 wiped out all of the territory's banks, and only one paid all of its notes.[24] In 1863 the federal government passed a National Bank Act that created a national currency based on federal debt. This was not another centralized system. Local private banks issued the new currency, but under uniform rules that prevented confusion about the value of each bank's notes. A heavy tax on the former state bank notes removed them from circulation, bringing the wildcat phenomenon to an end.[25] In popular culture[edit] In the Swedish movie The New Land (1972), the character Robert is paid in wildcat notes, which is later discovered by his brother Karl Oskar. Notes[edit] ^ Krause, Chester L.; Lemke, Robert F. (2003). Standard Catalog of United States Paper Money. ^ a b Conant, Charles A. (1915). A History of Modern Banks of Issue (5th ed.). pp. 373–379. ^ a b Kamensky, Jane (2008). The Exchange Artist. ^ Smith, Joseph Edward A. (1876). The History of Pittsfield. 2. ^ a b Knox 1900, pp. 398-399 ^ McMaster 1916, p. 309 ^ McMaster 1916, pp. 293-309 ^ Flint, James (1822). Letters from America. ^ Wilentz, Sean (2006). The Rise of American Democracy: Jefferson to Lincoln. ^ Catterall, Ralph Charles Henry (1902). The First Six Years of the Second Bank of the United States. ^ Dwyer, Gerald P. "Wildcat Banking, Banking Panics, and Free Banking in the United States". Economic Review, 1996. p. 2. Retrieved 6 December 2013. ^ Rolnick, Arthur J.; Weber, Warner E. (Fall 1982). "Free Banking, Wildcat Banking, and Shinplasters". Federal Reserve Bank of Minneapolis Quarterly Review. 6 (3). Retrieved 17 February 2021. ^ Dunbar, William F. (1995). Michigan: A History of the Wolverine State. p. 223. ^ a b Utley, H. M. (1884), "The Wild Cat Banking System of Michigan", Pioneer Collections, 5 ^ Sumner, William Graham (1896). A History of Banking in the United States. ^ Catskill Bank $5 Contemporary Counterfeit ^ White, Horace (1895). Money and Banking. p. 372. ^ Cleveland, Frederick Albert; Powell, Fred Wilbur (1909). Railroad Promotion and Capitalization in the United States. pp. 167–176. ^ Jones, Robert C. (2017). A History of Georgia Railroads. ^ Knox 1900 ^ Knox 1900, pp. 702–703 ^ Knox 1900, p. 714 ^ Knox 1900, p. 807 ^ Knox 1900, p. 810 ^ Conway, Thomas Jr.; Patterson, Ernest M. (1914). The Operation of the New Bank Act. pp. 1–15. References[edit] Knox, John Jay (1900). A History of Banking in the United States. McMaster, John Bach (1916). A History of the People of the United States. 4. Further reading[edit] Allen, Larry (2009). The Encyclopedia of Money (2nd ed.). Santa Barbara, CA: ABC-CLIO. pp. 436–437. ISBN 978-1598842517. External links[edit] U.S. banks and money Federal Reserve Bank of Atlanta "Wildcat bank". Encyclopædia Britannica. Encyclopædia Britannica Online. Encyclopædia Britannica Inc., 2013. Web. Retrieved 6 December 2013. v t e Money and central banking within the contemporary United States (pre–1913) Clearinghouse bank Bureau de change Central bank Cheque Clearing Cheque clearing Depository institution Bailment Banknote Chattel/movable property Deposit Deposit account Mutual savings bank Possession Promissory note Redemption Safekeeping Savings bank Savings and loan association Mint Coinage Currency Fiat/Token money Medium of exchange Money Store of value Unit of account Treasury Bond Finance minister Government bond Legal tender Standard of deferred payment 1607–1760 Royal Mint (1607–1776) Bank of Amsterdam (1614–1667) Bills of credit (c. 1690–1750) Bank of England (1694–1776) Banque Générale/Banque Royale (1716–1720) Tobacco Inspection Act (1730) Maryland Tobacco Inspection Act of 1747 Currency Acts (1751; 1764) 1760–1840 Second Continental Congress (1776–1780) U.S. dollar banknotes (1775–) Continental currency banknotes (1775–1779) Bank of Pennsylvania (1780–1781) U.S. Finance Superintendent (1781–1785) Bank of North America (1781–1791) Bank of Spain (1782–1898) Article I of the U.S. Constitution 1787–1788; Section VIII Section X U.S. Treasury Department 1789–1913; U.S. Treasury Secretary U.S. Treasury security (1789–present) First Bank of the United States (1791–1811) Coinage Act of 1792 United States Mint (1792–1873) U.S. dollar coins (1792–) Half dime (1792–1873) 1792 half disme Half cent (1793–1857) Large cent (1793–1857) Treasury Note (1812–1913) Second Bank of the United States (1816–1836) Suffolk Bank (1818–1858) Danmarks Nationalbank (1818–1917) Suffolk System (1824–1858) New York Safety Fund System (1829–1842) Bank War (1832–1836) Coinage Act of 1834 1840–1870 Free banking (1836–1865) Wildcat banking (1836–1865) Forstall System (1842–1865) Independent U.S. Treasury (1846–1913) Coinage Act of 1849 Three-cent silver (1851–1873) Coinage Act of 1853 New York Clearing House Association (1853–1863) Coinage Act of 1857 State Bank of the Russian Empire (1860–1867) Demand Note (1861–1862) Legal Tender Act of 1862 United States Note (1862–1971) Fractional currency (1862–1876) National Bank Acts (1863; 1864) Interest bearing note (1863–1865) National Banks system (1863–1913) National Bank Note (1863–c. 1930) Gold certificate (1863–1933) Compound interest treasury note (1863–1864) Coinage Act of 1864 Two-cent piece (1864–1873) Three-cent nickel (1865–1889) Contraction Act of 1866 Public Credit Act of 1869 1870–1914 Legal Tender Cases Hepburn v. Griswold (1870) Currency Act of 1870 National Gold Bank Note (1870–1875) Knox v. Lee (1871) Coinage Act of 1873 Specie Payment Resumption Act (1875) Twenty-cent piece (1875–1878) Bland–Allison Act (1878) Silver certificate (1878–1964) Refunding Certificate (1879–1907) Juilliard v. Greenman (1884) Reichsbank (1884–1919) Sherman Silver Purchase Act (1890) Treasury Note (1890–1891) Gold Standard Act (1900) Aldrich–Vreeland Act (1908) Federal Reserve Act (1913) v t e Bank regulation in the United States Federal authorities Consumer Financial Protection Bureau Farm Credit Administration Federal Deposit Insurance Corporation Federal Financial Institutions Examination Council Federal Housing Finance Agency Federal Reserve Board of Governors Financial Stability Oversight Council National Credit Union Administration Office of the Comptroller of the Currency Major federal legislation Independent Treasury Act National Bank Act Federal Reserve Act McFadden Act 1933 Banking Act Glass–Steagall Act Federal Credit Union Act Bank Holding Company Act Interest Rate Control Act of 1966 Truth in Lending Act Bank Secrecy Act Fair Credit Reporting Act Home Mortgage Disclosure Act Community Reinvestment Act Electronic Fund Transfer Act Financial Institutions Regulatory and Interest Rate Control Act of 1978 Monetary Control Act Depository Institutions Act Competitive Equality Banking Act of 1987 FIRREA FDICIA Truth in Savings Act Riegle-Neal IBBEA Gramm–Leach–Bliley Act Fair and Accurate Credit Transactions Act Emergency Economic Stabilization Act Credit CARD Act Dodd-Frank Federal Reserve Board regulations Extensions of Credit by Federal Reserve Banks (Reg A) Equal Credit Opportunity (Reg B) Home Mortgage Disclosure (Reg C) Reserve Requirements for Depository Institutions (Reg D) Electronic Fund Transfer (Reg E) Limitations on Interbank Liabilities (Reg F) International Banking Operations (Reg K) Consumer Leasing (Reg M) Loans to Insiders (Reg O) Privacy of Consumer Financial Information (Reg P) Prohibition Against the Paying of Interest on Demand Deposits (Reg Q) Credit by Brokers and Dealers (Reg T) Credit by Banks and Persons Other Than Brokers or Dealers for the Purpose of Purchasing or Carrying Margin Stock (Reg U) Transactions Between Member Banks and Their Affiliates (Reg W) Borrowers of Securities Credit (Reg X) Truth in Lending (Reg Z) Unfair or Deceptive Acts or Practices (Reg AA) Community Reinvestment (Reg BB) Availability of Funds and Collection of Checks (Reg CC) Truth in Savings (Reg DD) Types of bank charter Credit union Federal savings association National bank State bank State authorities California Colorado Florida Illinois Maryland Michigan New Jersey New York Ohio Oklahoma Oregon Pennsylvania Tennessee Virginia Terms Call report CAEL Rating CAMELS rating system Thrift Financial Report Other topics Banking in the United States Fair debt collection History of central banking in the United States Wildcat banking Category Economics portal Banks portal Retrieved from "https://en.wikipedia.org/w/index.php?title=Wildcat_banking&oldid=1038664999" Categories: Bank regulation in the United States Hidden categories: Articles with short description Short description matches Wikidata Use American English from March 2019 All Wikipedia articles written in American English Use dmy dates from April 2017 All articles with unsourced statements Articles with unsourced statements from March 2021 Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages Svenska Edit links This page was last edited on 13 August 2021, at 23:26 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-9737 ---- The Hollow Men - Wikipedia The Hollow Men From Wikipedia, the free encyclopedia Jump to navigation Jump to search The Hollow Men by T. S. Eliot Eliot in 1923 Written 1925 Country England Language English Publisher Faber & Faber Publication date 1925 Lines 98 Quote This is the way the world ends This is the way the world ends This is the way the world ends Not with a bang but a whimper.[1] "The Hollow Men" (1925) is a poem by the modernist writer, T. S. Eliot. Like much of his work, its themes are overlapping and fragmentary, concerned with post–World War I Europe under the Treaty of Versailles (which Eliot despised: compare "Gerontion"), hopelessness, religious conversion, redemption and, some critics argue, his failing marriage with Vivienne Haigh-Wood Eliot.[2] It was published two years before Eliot converted to Anglicanism.[3] Divided into five parts, the poem is 98 lines long. Eliot's New York Times obituary in 1965 identified the final four as "probably the most quoted lines of any 20th-century poet writing in English".[4] Contents 1 Theme and context 2 Publication information 3 Influence in culture 3.1 Film 3.2 Literature 3.3 Multimedia 3.4 Video games 3.5 Music 3.6 Television 4 See also 5 References 6 External links Theme and context[edit] Eliot wrote that he produced the title "The Hollow Men" by combining the titles of the romance "The Hollow Land" by William Morris with the poem "The Broken Men" by Rudyard Kipling:[5], but it is possible that this is one of Eliot's many constructed allusions. The title could also be theorized to originate more transparently from Shakespeare's Julius Caesar or from the character Kurtz in Joseph Conrad's Heart of Darkness who is referred to as a "hollow sham" and "hollow at the core". The latter is more likely since Kurtz is mentioned specifically in one of the two epigraphs. The two epigraphs to the poem, "Mistah Kurtz – he dead" and "A penny for the Old Guy", are allusions to Conrad's character and to Guy Fawkes. Fawkes attempted arson of the English Houses of Parliament in 1605 and his straw-man effigy is burned each year in the United Kingdom on Guy Fawkes Night, the 5th of November.[6] Certain quotes from the poem such as "[...] heads filled with straw [...]" and "[...] in our dry cellar [...]"[2] seem to be direct references to the Gun Powder Plot. The Hollow Men follows the otherworldly journey of the spiritually dead. These "hollow men" have the realization, humility, and acknowledgement of their guilt and their status as broken, lost souls. Their shame is seen in lines like "[...] eyes I dare not meet in dreams [...]" calling themselves "[...] sightless, useless [...]" and that that "[...] [death is] the only hope of empty men [...]".[2] The "hollow men" fail to transform their motions into actions, conception to creation, desire to fulfillment. This awareness of the split between thought and action coupled with their awareness of "death's various kingdoms" and acute diagnosis of their hollowness, makes it hard for them to go forward and break through their spiritual sterility.[2] Eliot invokes imagery from the Inferno (Dante), specifically the third and fourth cantos of the Inferno which describes Limbo, the first circle of Hell – showing man in his inability to cross into Hell itself or to even beg redemption, unable to speak with God. He states that the hollow men "[...] grope together and avoid speech, gathered on this beach of the tumid river [...]",[2] and Dante states that at the Gates of Hell, people who did neither good nor evil in their lives have to gather quietly by a river where Charon cannot ferry them across.[7] This is the punishment for those in Limbo according to Dante, people who "[...] lived without infamy or praise [...]"[7] They did not put any good or evil into the world, making them out to be 'hollow' people who can only watch others move on into the afterlife. Eliot reprises this moment in his poem as the hollow men watch "[...] those who have crossed with direct eyes, to death's other kingdom [...]"[2].Eliot describes how they wish to be seen "[...] not as lost/Violent souls, but only/As the hollow men/The stuffed men [...]".[2] As the poem enters section five, there is a complete breakdown of language. The Lord's Prayer and what appears to be a lyric change of "Pop Goes the Weasel" are written while this devolution of style ends with the final stanza, maybe the most quoted of Eliot's poetry: This is the way the world ends This is the way the world ends This is the way the world ends Not with a bang but a whimper.[1] When asked in 1958 if he would write these lines again, Eliot said he would not. According to Henry Hewes: "One reason is that while the association of the H-bomb is irrelevant to it, it would today come to everyone's mind. Another is that he is not sure the world will end with either. People whose houses were bombed have told him they don't remember hearing anything."[8] Publication information[edit] The poem was first published as now known on 23 November 1925, in Eliot's Poems: 1909–1925. [9] Eliot was known to collect poems and fragments of poems to produce new works. This is clear to see in his poems The Hollow Men and "Ash-Wednesday" where he incorporated previously published poems to become sections of a larger work. In the case of The Hollow Men four of the five sections of the poem were previously published: "Poème", published in the Winter 1924 edition of Commerce (with a French translation), became Part I of The Hollow Men[9]. Doris's Dream Songs in the November 1924 issue of Chapbook had the three poems: "Eyes that last I saw in tears", "The wind sprang up at four o'clock", and "This is the dead land." The third poem became Part III of The Hollow Men.[9] Three Eliot poems appeared in the January 1925 issue of his Criterion magazine: "Eyes I dare not meet in dreams", "Eyes that I last saw in tears", and "The eyes are not here". The first poem became Part II of The Hollow Men and the third became Part IV[9]. Additionally, the March 1925 of Dial published The Hollow Men, I-III which was finally transformed to The Hollow Men Parts I, II, and IV in Poems: 1909–1925.[9] Influence in culture[edit] This section appears to contain trivial, minor, or unrelated references to popular culture. Please reorganize this content to explain the subject's impact on popular culture, providing citations to reliable, secondary sources, rather than simply listing appearances. Unsourced material may be challenged and removed. (May 2017) This section needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (May 2017) (Learn how and when to remove this template message) The Hollow Men has had a profound effect on the Anglo-American cultural lexicon—and by a relatively recent extension, world culture—since it was published in 1925. One source states that the last four lines of the poem are "probably the most quoted lines of any 20th-century poet writing in English."[4][10] The sheer variety of references moves some of the questions concerning the poem's significance outside the traditional domain of literary criticism and into the much broader category of cultural studies. Examples of such influences include: Film[edit] Eliot's poem was a strong influence on Francis Ford Coppola and the movie Apocalypse Now (1979), in which antagonist Colonel Kurtz (played by Marlon Brando) is depicted reading parts of the poem aloud to his followers. Furthermore, the Complete Dossier DVD release of the film includes a 17-minute special feature of Kurtz reciting the poem in its entirety. The poem's epigraph, "Mistah Kurtz – he dead", is a quotation from Conrad's Heart of Darkness (1899), upon which the film is loosely based. The final stanza is printed one line at a time at the beginning of the television production of Stephen King's The Stand (1994). The poem is also referenced in part by the character who feels responsible for the deadly "Captain Trips" virus being unleashed. *This is incorrect, the poem referenced is The Second Coming by W.B. Yeats ("And what rough beast ...")* The trailer for the film Southland Tales (2006), directed by Richard Kelly, plays on the poem, stating: "This is the way the world ends, not with a whimper but with a bang." The film also quotes this inverted version of the line a number of times, mostly in voice-overs.[11] Beverly Weston discusses the line "Life is very long" at the beginning of August: Osage County. In George Cukor's classic remake of A Star Is Born (1954), Jack Carson's film studio PR man Matt Libby refers to the death of James Mason's character Norman Maine dismissively, quoting: "This is the way the world ends: not with a bang - with a whimper." In Indiana Jones and the Kingdom of the Crystal Skull, the character Harold Oxley (John Hurt) paraphrases a line from Eliot's 1925 poem "Eyes that I last saw in tears," when he says, "Through eyes that last I saw in tears, here in death's dream kingdom, the golden vision reappears." This poem was part of a series of poems published by Eliot in 1924 and 1925, which referenced either "death's dream kingdom," "death's other kingdom," or "death's twilight kingdom," of which several would later be published as Parts I-IV of "The Hollow Men." "Eyes that I last saw in tears," though ultimately not included by Eliot in his published version of "The Hollow Men," may nevertheless be read alongside the published poem, as a sort of apocryphal text, to provide context regarding the development of the composition of "The Hollow Men." Furthermore, the poem fits neatly within the series of poems which were ultimately collected and published as "The Hollow Men," due to its imagery of "eyes" being encountered by the author in relation to "death's dream kingdom" and "death's other kingdom," as in Parts I, II, and IV of "The Hollow Men." Sator (Kenneth Branagh) says that 'the world will end not with a bang, but a whimper' in reference to his Dead Man's Switch device in Tenet. Literature[edit] Stephen King's The Dark Tower series contains multiple references to "The Hollow Men" (as well as The Waste Land, most prominently The Dark Tower III: The Waste Lands (1991)).[12] King also makes reference to "The Hollow Men" in Pet Sematary (1983) with: "Or maybe someone who had escaped from Eliot's poem about the hollow men. I should have been a pair of ragged claws", the latter sentence of which is taken from Eliot's poem "The Love Song of J. Alfred Prufrock" (1915). There is also a reference in "Under the Dome" (2009), made by the journalist Julia Shumway. Theodore Dalrymple's book, Not With a Bang But A Whimper (2009), takes its title from the last part of the poem.[13] Nevil Shute's novel, On the Beach (1957), takes its name from the second stanza of Part IV of the poem and extracts from the poem, including the passage in which the novel's title appears, have been printed in the front papers of some editions of the book including the 1957 first US edition.[14] Kami Garcia's novel Beautiful Creatures contains this quote. Karen Marie Moning's Fever series novel, Shadowfever, contains quotes from this poem. Tracy Letts's play August: Osage County ends with Johanna quoting, "This is how the world ends, not with a bang but with a whimper" repeatedly. The prologue of N.K. Jemisin's novel The Fifth Season references the last four lines of this poem. V. E. Schwab's Monsters of Verity duology (2016, 2017) quotes the line "not with a bang but with a whimper" throughout the novels. Attia Hosain's Sunlight On a Broken Column borrows its title from Eliot's The Hollow Men Karl Marlantes's novel Matterhorn (2010) of the Vietnam War weaves a quote from Eliot's The Hollow Men into the story: "Between the emotion and the response falls the shadow." Haruki Murakami's novel Kafka On The Shore (2002) mentions the poem as Oshima explain he's most afraid of people lacking imagination, "the kind T.S Eliot called hollow men". Multimedia[edit] Chris Marker created a 19-minute multimedia piece for the Museum of Modern Art in New York City titled Owls At Noon Prelude: The Hollow Men (2005), which was influenced by Eliot's poem.[15] Video games[edit] In the video game Shadow Man, the final boss, Legion, quotes "this is the way the world ends, Michael, not with a bang but with a whimper" just before giving the final blow to the protagonist in the bad ending. The full poem is included in one of the flashbacks in Super Columbine Massacre RPG! In the video game Metal Gear Solid 2: Sons of Liberty, the AI Colonel in the final speech quotes "And this is the way the world ends. Not with a bang, but a whimper".[16] Music[edit] Denis ApIvor wrote a work called The Hollow Men for baritone, male chorus and orchestra around 1939. It had only one performance, in 1950, under the conductor Constant Lambert, and produced by the BBC through the influence of Edward Clark.[17] The American new wave band Devo partially lifted from the poem for the chorus to the song "The Shadow" on their seventh album Total Devo (1988) Australian rock band TISM spoofed the poem's first epigraph for their 1986 song "Mistah Eilot - He Wanker" which mocked Eilot and the concept of Modernism. The song "Hollow Man" appears as the first track on the album Doppelgänger (1983) by the group Daniel Amos; the song is a paraphrase of Eliot's poem spoken over the music of "Ghost of the Heart" played backwards; "Ghost of the Heart" is the last song on the group's previous album ¡Alarma! (1981) Members of the Minneapolis hiphop collective Doomtree have referenced this poem in a number of collective and individual songs, including the single "No Homeowners" on the collective's 2007 album False Hopes, ".38 Airweight" on 2015's All Hands, and in the single "Flash Paper" from member Sims's 2016 album More than Ever. The last line of the poem is referenced in Amanda Palmer's song "Strength Through Music", based on the Columbine High School massacre. Eliot's poem inspired The Hollow Men (1944), a piece for trumpet and string orchestra by composer Vincent Persichetti and one of his most popular works.[18] Jon Foreman of Switchfoot says that the band's song "Meant to Live" is inspired by Eliot's poem.[19] The Gaslamp Killer song In the Dark... has the lyrics "This is the way the world ends" in it. The Greek black metal band Rotting Christ uses excerpts of the poem as lyrics for the song "Thine Is the Kingdom" on their album Sleep of the Angels. The final stanza of the poem is used as the song's chorus. Finnish musical producer Axel Thesleff created a musical interpretation of the poem in form of a five-track LP.[20] British 90s band EMF used the line "this is the way the world ends, this is the way the world ends, this is the way the world ends" using wordplay to add "not with a band" in their song Longtime on the album Schubert Dip[21] The 2011 release by North Carolina-based band Scapegoat, I Am Alien, references the poem in the title track: "So thank you Mr. Elliot for showing us the way the world will end, Not with a bang, but with a whimper on the wind, And I've come to tell all of my friends, That it starts with a bang, but ends with the wind." Frank Turner references The Hollow Men in his song "Sons of Liberty". His song "Anymore" also contains a reference to the last line of the poem. In 2015, American experimental hip hop musician Lil Ugly Mane repeatedly sampled the line “This is the way the world ends” in the song ”Columns”, from his sophomore album Oblivion Access. Wire's song "Comet" (from the 2003 album Send) features a chorus that references the poem: "And the chorus goes ba-ba-ba-ba-bang....then a whimper". Television[edit] Not with a Bang was a short-lived British television sitcom produced by LWT for ITV in 1990. British television series: Doctor Who ("The Lazarus Experiment") and Foyle's War (series 1, episode 3, which also name-drops "Ash Wednesday" and Horizons magazine, to which Eliot contributed) American television shows: 30 Rock, The Big Bang Theory, Northern Exposure, the title of the finale of Dexter's sixth season (in which the protagonist also quotes the titular verse), Dollhouse (on "The Hollow Men" episode), Frasier, Mad Men, and The X-Files (on the "Pusher" episode). "The Haunting Hour" ("Scarecrow") "The Stand" (The Plague), The Odd Couple British television series The Fall references the poem in its title and in series 1 episode 3 serial killer Paul Spector writes the lines 'Between the idea and the reality, Between the motion and the act falls the Shadow' in his journal of his murders. American series Agents of S.H.I.E.L.D., in the finale of season 4 has Holden Radcliffe partially quote the final stanza as he disappears.[22] American crime drama The Sinner has the character Nick recite the lines "Prickly Pear, Prickly Pear, Prickly Pear" from part V. See also[edit] Gunpowder Plot in popular culture References[edit] ^ a b Eliot, T. S. (1927) [1925]. Poems 1909–1925. London: Faber & Faber, 128. ^ a b c d e f g See, for instance, the work of one of Eliot's editors and major critics, Ronald Schuchard. ^ Swarbrick, Andrew (1988). Selected Poems of T. S. Eliot. Basingstoke and London: Macmillan, 45. ^ a b "T.S. Eliot, the Poet, is Dead in London at 76". The New York Times. 5 January 1965. Retrieved 10 December 2013. ^ Eliot, T. S. Inventions of the March Hare: Poems 1909–1917 (Harcourt, 1997) pp.395 ISBN 0-15-100274-6 Christopher Ricks, the editor, cited a letter dated 10 January 1935 to the Times Literary Supplement. ^ "Gunpowder Plot | Definition, Summary, & Facts". Encyclopedia Britannica. Retrieved 20 March 2021. ^ a b "Dante's Inferno". www.gutenberg.org. Retrieved 20 March 2021. ^ 'T. S. Eliot at Seventy, and an Interview with Eliot' in Saturday Review. Henry Hewes. 13 September 1958 in Grant p. 705. ^ a b c d e Gallup, Donald Clifford (1969). T. S. Eliot: a bibliography. Internet Archive. London, Faber. ISBN 978-0-571-08928-4. ^ Murphy, Russell Elliott (2007). Critical companion to T.S. Eliot : a literary reference to his life and work. New York, NY: Facts On File. p. 257. ISBN 978-0816061839. ^ Dargis, Manohla (14 November 2007). "Southland Tales". The New York Times. ^ anon. "T. S .Eliot: Timeless Influence on a Modern Generation". Brushed with mystery. Retrieved 10 December 2013. ^ Not With a Bang But a Whimper: The Politics and Culture of Decline (US edition) (2008) ISBN 1-56663-795-3 ^ Shute, Nevil (1957). On The Beach. NY, NY: William Morrow and Company. ^ "Chris Marker's short film: Owls At Noon, Prelude: The Hollow Men". MOMA.org. 2005. ^ "Metal Gear Solid 2 ending analysis". junkerhq.net. Retrieved 6 February 2016. ^ David Wright, Denis ApIvor ^ Spector, Irwin (14 May 1969). "On Stage at K.U." Lawrence Journal World. Retrieved 10 December 2013. ^ "Switchfoot - Behind the Songs of The Beautiful Letdown". Retrieved 25 March 2017. ^ "The Hollow Men LP by Axel Thesleff". soundcloud.com. Retrieved 3 June 2016. ^ "Lyrics To EMF Longtime". metrolyrics.com. Retrieved 22 June 2016. ^ Freeman, Molly (16 May 2017). "Agents of S.H.I.E.L.D. Season 4 Finale Review & Discussion". Screen Rant. Retrieved 18 May 2017. External links[edit] An omnibus collection of T. S. Eliot's poetry at Standard Ebooks Text of the poem with notes Scans of the 1925 publication of the poem, in a 1934 reprint v t e T. S. Eliot Bibliography Early poems "The Love Song of J. Alfred Prufrock" "Portrait of a Lady" "Preludes" "Whispers of Immortality" "Gerontion" The Waste Land The Hollow Men Ash Wednesday Ariel Poems Journey of the Magi A Song for Simeon Later poems Old Possum's Book of Practical Cats "The Awefull Battle of the Pekes and the Pollicles" "Gus: The Theatre Cat" "Growltiger's Last Stand" "The Naming of Cats" Burnt Norton East Coker The Dry Salvages Little Gidding Four Quartets Plays Sweeney Agonistes The Rock Murder in the Cathedral The Family Reunion The Cocktail Party The Confidential Clerk The Elder Statesman Prose Selected Essays, 1917-1932 "Hamlet and His Problems" "Tradition and the Individual Talent" The Sacred Wood A Choice of Kipling's Verse (1941) "The Frontiers of Criticism" Adaptations Assassinio nella cattedrale (opera) Cats 1981 musical 1998 film 2019 film Publishing The Criterion Faber and Faber T. S. Eliot Prize T. S. Eliot Prize (Truman State University) Related Tom & Viv (1984 play, 1994 film) People Eliot family Vivienne Haigh-Wood Eliot (first wife) Valerie Eliot (second wife) Henry Ware Eliot (father) Charlotte Champe Stearns (mother) William Greenleaf Eliot (grandfather) E. Martin Browne Emily Hale John Davy Hayward Ezra Pound Jean Jules Verdenal William Butler Yeats Authority control MusicBrainz work Retrieved from "https://en.wikipedia.org/w/index.php?title=The_Hollow_Men&oldid=1032897041" Categories: 1925 poems Poetry by T. S. Eliot World War I poems Modernist poems American poems Hidden categories: EngvarB from May 2017 Use dmy dates from May 2017 Articles with trivia sections from May 2017 Articles needing additional references from May 2017 All articles needing additional references Wikipedia articles with MusicBrainz work identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version Languages العربية Deutsch Français Italiano Nederlands Tiếng Việt Edit links This page was last edited on 10 July 2021, at 09:27 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
en-wikipedia-org-9791 ---- Gene Stratton-Porter - Wikipedia Gene Stratton-Porter From Wikipedia, the free encyclopedia Jump to navigation Jump to search Gene Stratton-Porter Born (1863-08-17)August 17, 1863 Lagro, Indiana Died December 6, 1924(1924-12-06) (aged 61) Los Angeles, California Occupation Author naturalist nature photographer film producer Nationality American Period 1900–1920 Genre Natural history Gene Stratton-Porter (August 17, 1863 – December 6, 1924), born Geneva Grace Stratton, was a Wabash County, Indiana, native who became a self-trained American author, nature photographer, and naturalist. In 1917 Stratton-Porter used her position and influence as a popular, well-known author to urge legislative support for the conservation of Limberlost Swamp and other wetlands in the state of Indiana. She was also a silent film-era producer who founded her own production company, Gene Stratton Porter Productions, in 1924. Stratton-Porter wrote several best-selling novels in addition to columns for national magazines, such as McCall's and Good Housekeeping, among others. Her novels have been translated into more than twenty languages, including Braille, and at their peak in the 1910s attracted an estimated 50 million readers. Eight of her novels, including A Girl of the Limberlost, were adapted into moving pictures. Stratton-Porter was also the subject of a one-woman play, A Song of the Wilderness. Two of her former homes in Indiana are state historic sites, the Limberlost State Historical Site in Geneva and the Gene Stratton-Porter State Historic Site on Sylvan Lake, near Rome City, Indiana. Contents 1 Early life and education 2 Marriage and family 3 Major residences 3.1 Limberlost Cabin (Geneva, Indiana) 3.2 Cabin at Wildflower Woods 3.3 California homes 4 Career 4.1 Author 4.1.1 Early years 4.1.2 Novels 4.1.3 Nature books 4.1.4 Magazine articles 4.1.5 Children's stories and poetry 4.2 Nature photographer 4.3 Naturalist and conservationist 4.4 Movie producer 5 Later years 6 Death and legacy 7 Honors and awards 8 Selected published works 8.1 Novels 8.2 Nature studies 8.3 Poetry 8.4 Children's books and collected essays 9 Film adaptations of novels 10 Biographical play 11 References 12 External links Early life and education[edit] Geneva Grace Stratton, the twelfth and last child of Mary (Shallenberger) and Mark Stratton, was born at the family's Hopewell Farm on August 17, 1863, near Lagro in Wabash County, Indiana.[1][2] Mark Stratton, a Methodist minister and farmer of English descent, and Mary Stratton, a homemaker of German-Swiss ancestry,[3] were married in Ohio on December 24, 1835, relocated to Wabash County, Indiana, in 1838, and settled at Hopewell Farm in 1848. Geneva's eleven siblings included Catherine, Mary Ann, Anastasia, Florence, Ada, Jerome, Irvin, Leander, and Lemon, in addition to two sisters, Samira and Louisa Jane, who died at a young age. Geneva's married sister, Mary Ann, died in an accident in February 1872; her teenaged brother, Leander, whom Geneva called Laddie, drowned in the Wabash River on July 6, 1872.[4] In 1874 twelve-year-old Geneva moved to Wabash, Indiana, with her parents and three unmarried siblings. They initially lived in the home of Geneva's married sister, Anastasia, and her husband, Alvah Taylor, a lawyer.[5] Geneva's mother died on February 3, 1875, less than four months after the move to Wabash. Thereafter, Geneva boarded with various relatives in Wabash until her marriage to Charles Porter in 1886. Geneva, who was also called Geneve during her youth, shortened her name to Gene during her courtship with Porter.[6] One of Stratton-Porter's early nature photographs of owls, one of her favorite birds to study and photograph. Gene received little formal schooling early in life; however, she developed a strong interest in nature, especially birds. As a young girl, Gene's father and her brother, Leander, taught her to appreciate nature as she roamed freely around the family farm, observing animals in their natural habitats and caring for various pets.[7] It was said of Stratton-Porter's childhood that she had been "reared by people who constantly pointed out every natural beauty, using it wherever possible to drive home a precept, the child [Stratton-Porter] lived out-of-doors with the wild almost entirely."[8] After the family moved to Wabash in 1874, Gene attended school on a regular basis and became an avid reader. She also began music lessons in banjo, violin, and piano from her sister, Florence, and received private art lessons from a local instructor. Gene finished all but the final term of her senior year at Wabash High School. Because she was failing her classes, she made the decision on her own to quit, later claiming that she had left school to care for Anastasia, who was terminally ill with cancer and receiving treatment in Illinois.[9] Marriage and family[edit] In 1884 thirty-four-year-old Charles Dorwin Porter saw Gene Stratton during her trip to Sylvan Lake, Indiana, where she was attending the Island Park Assembly, a Chautauqua gathering. Porter, a druggist, was thirteen years older than Stratton, who was not yet twenty-one.[10] After ten months of regularly exchanging letters, the couple met at another gathering at Sylvan Lake, during the summer of 1885. They became engaged in October 1885 and were married on August 21, 1886. Gene Stratton-Porter kept her family surname and added her husband's after her marriage.[11] Charles Porter, who had numerous business interests, became a wealthy and successful businessman. Of Scots-Irish descent, he was the son and oldest child of Elizabeth and John P. Porter, a doctor. Charles owned an interest in a drugstore in Fort Wayne, Indiana, which he sold soon after his marriage, and also owned drugstores in Decatur and Geneva. He also owned and operated farms, a hotel, and a restaurant. Porter and other investors organized the Bank of Geneva in 1895. He also became a Trenton Oil Company investor. At one time he had more than sixty oil wells drilled on his land.[12][13] Gene and Charles Porter's only child, a daughter, named Jeannette, was born on August 27, 1887, when the Porters were living in Decatur, Indiana. The family moved to Geneva, in Adams County, Indiana, in 1888. Charles pursued various business interests and traveled extensively, while Gene stayed at home.[14] Gene took pride in her family and maintaining a home, but she opposed the restrictive, traditional marriages of her era and grew bored and restless. She maintained her independence through the pursuit of her lifelong interests in nature and birdlife, and began by writing about these subjects to earn her own income. In time, she became an independently wealthy novelist, nonfiction writer, and film producer.[15] Stratton-Porter had four grandchildren, two granddaughters, and two grandsons. The Porters' daughter, Jeannette, married G. Blaine Monroe in 1909 and had two daughters: Jeannette Helen Monroe was born on November 27, 1911; Gene Stratton Monroe was born on March 22, 1914. The Monroes divorced in 1920, and then Jeannette and her two daughters moved to Los Angeles, California, to live with Stratton-Porter, who had moved there in 1919. On June 6, 1923, Jeannette married James Leo Meehan, a film producer, who was Stratton-Porter's business associate. After the death of her brother, Lemon Stratton, in late 1915, Stratton-Porter became the guardian of his daughter, Leah Mary Stratton. Leah lived with Stratton-Porter for several years after Leah's father's death.[16] Major residences[edit] In 1888 Stratton-Porter persuaded her husband, Charles, to move their family from Decatur to Geneva in Adams County, Indiana, where he would be closer to his businesses. He initially purchased a small home within walking distance of his drugstore;[17] however, when oil was discovered on his land, it provided the financial resources needed to build a larger home.[13] The Limberlost Cabin at Geneva served as Stratton-Porter's home from 1895 to 1913.[18][19] In 1912, with the profits she made from her best-selling novels and successful writing career, Stratton-Porter purchased property along Sylvan Lake, near Rome City in Noble County, Indiana, and built the Cabin at Wildflower Woods estate, which eventually encompassed 120 acres (49 hectares). Both of these properties are preserved as state historic sites.[20] Stratton-Porter moved to southern California in 1919 and made it her year-round residence. She purchased homes in Hollywood and built a vacation home that she named Singing Water on her property on Catalina Island. Floraves, her lavish mountaintop estate in Bel Air, was nearly completed at the time of her death in 1924, but she never lived in it.[21] Limberlost Cabin (Geneva, Indiana)[edit] Main article: Gene Stratton Porter Cabin (Geneva, Indiana) Limberlost State Historic Site, western side Construction on a two-story, 14-room, cedar-log Queen Anne style rustic home in Geneva began in 1894 and was completed in 1895. The Porters named their new home the Limberlost Cabin in reference to its location near the 13,000-acre (5,300-hectare) Limberlost Swamp, where Stratton-Porter liked to explore and found the inspiration for her writing. Stratton-Porter lived in the cabin until 1913.[22][23] While residing in Geneva, Stratton-Porter spent much time exploring, observing nature, sketching, and making photographs at the Limberlost Swamp. She also began writing nature stories and books. The nearby swamp was the setting for two of her most popular novels, Freckles (1904) and A Girl of the Limberlost (1909). In addition, the swamp was the locale for many of her works of natural history. Stratton-Porter became known as "The Bird Lady" and "The Lady of the Limberlost" to friends and readers.[24][25] Between 1888 and 1910, the area's wetlands around Stratton-Porter's home were drained to reclaim the land for agricultural development and the Limberlost Swamp, along with the flora and fauna that Stratton-Porter documented in her books, was destroyed. In 1912 she purchased property for a new home at Sylvan Lake in Noble County, Indiana. The Porters sold the Limberlost Cabin in 1923.[26] In 1947 the Limberlost Conservation Association of Geneva donated it to the State of Indiana. Designated as the Limberlost State Historic Site, the Indiana State Museum and Historic Sites operates the site as a house museum. It was listed in the National Register of Historic Places in 1974.[23][27][28] Cabin at Wildflower Woods[edit] Main article: Gene Stratton-Porter Cabin (Rome City, Indiana) Gene's Cabin at Wildflower Woods is the present-day Gene Stratton-Porter State Historic Site on Sylvan Lake in Rome City, Noble County, Indiana. After the Limberlost Swamp was drained and its natural resources developed for commercial purposes, Stratton-Porter sought alternate locations for inspiration. She initially purchased a small home on the north side of Sylvan Lake, near Rome City, in Noble County, Indiana, as a summer home while she looked for property to build a new residence. In 1912 she purchased lakeside property using her own funds and designed and had a new home built there in 1913. Stratton-Porter named her new home the Cabin at Wildflower Woods, which she also called Limberlost Cabin because of its similarity to the Porters' home in Geneva.[29] While her Sylvan Lake home was under construction, Stratton-Porter found time to write Laddie (1913), her sixth novel. She moved into the large, two-story, cedar-log cabin in February 1914; her husband, Charles, who remained at their home in Geneva, commuted to the lakeside property on weekends.[30] Stratton-Porter assisted in developing the grounds of Wildflower Woods into her private wildlife sanctuary. Its natural setting provided her with the privacy she desired, at least initially; however, her fame attracted too many unwanted visitors and trespassers. The property's increasing lack of privacy was one of the reasons that caused her move to California in 1919. Stratton-Porter offered to sell her property to the State of Indiana in 1923 to establish a state nature preserve, but representatives of the state government did not respond. She retained ownership of Wildflower Woods for the remainder of her life.[31] Scenes from a movie based on Stratton-Porter's book, The Harvester, were filmed there in 1927.[32] In 1940 the Gene Stratton-Porter Association purchased Wildflower Woods from Stratton-Porter's daughter, Jeannette Porter Meehan; in 1946 the association donated the 13-acre (5.3-hectare) property to the State of Indiana, including the cabin, its formal gardens, orchard, and pond. Designated as the Gene Stratton-Porter State Historic Site, the present-day 125-acre (51-hectare) property, including 20 acres (8.1 hectares) that were part of her original purchase, is operated by the Indiana State Museum and Historic Sites and open to the public. The property was listed on the National Register of Historic Places in 1974.[33][34] In addition to the cabin, guests can explore a one-acre formal garden, wooded paths, and a 99-acre (40-hectare) wetland and prairie that is undergoing restoration.[35] The Gene Stratton-Porter State Historic Site is supported by the Gene Stratton-Porter Memorial Society, Inc. California homes[edit] Lack of privacy at her home on Sylvan Lake in Indiana was among the reasons for Stratton-Porter's move to California. She arrived in southern California in the fall of 1919, intending to spend the winter months there, but enjoyed it so much that she decided to make it her year-round home. Stratton-Porter enjoyed an active social life in the Los Angeles area, made new friends, began to publish her poetry, and continued to write novels and magazine articles. In 1924 she also established her own film production company.[2][36] Stratton-Porter initially purchased a small home between Second and Third Streets in Hollywood, not far from where her Stratton relatives lived. (Stratton-Porter's sister, Catherine, and two of Stratton-Porter's nieces were already living in southern California when she moved there. Her brother, Jerome, and his wife later retired nearby.) In 1920, when Stratton-Porter's recently divorced daughter, Jeannette, and Stratton-Porter's two granddaughters relocated to California to live with her, she purchased a larger home at the corner of Serrano and Fourth Street, while Charles remained at Geneva, still active in the town's bank. After the Porters sold the Limberlost Cabin in 1923, he stayed at a Geneva boardinghouse when he was not traveling.[37] In early 1924 Stratton-Porter purchased two lots on Catalina Island to build a 14-room vacation retreat. The grounds of the 5-acre (2.0-hectare) property included a fountain constructed of local stone and seashells. Stratton-Porter moved into the wildlife haven in June 1924 and named it Singing Water because of the sounds emitting from the elaborate fountain. She completed her last novel, The Keeper of the Bees (1925) at Catalina Island in 1924.[38] By March 1924 Stratton-Porter had selected a site for an estate home in southern California in an undeveloped area west of present-day Beverly Hills that became Bel Air. Stratton-Porter was the first to build a residence there. The 22-room, English Tudor-style mansion included approximately 11,000 square feet (1,000 m2) of living space and was set on a small mountaintop. The property also included a 4-car garage with servants' quarters above it, a greenhouse, outdoor ponds, and a tennis court. Stratton-Porter named her estate Floraves for flora (meaning flowers) and aves (meaning birds). She died on December 6, 1924, a few weeks before the home was completed. Her daughter, Jeannette, was the sole heir of her mother's estate.[39] Career[edit] Gene Stratton-Porter While her marriage to Charles Porter provided financial security and personal independence, Gene sought additional roles beyond those of wife and mother. She took up writing in 1895 as an outlet for self-expression and as a means to earn her own income. Stratton-Porter felt that as long as her work did not interfere with the needs of her family, she was free to pursue her own interests. She began her literary career by observing and writing about birdlife of the upper Wabash River valley and the nature she had seen during visits to the Limberlost Swamp, less than a mile from her home in Geneva, Indiana. The Limberlost Swamp, the Limberlost Cabin at Geneva, and after 1913, the Cabin at Wildflower Woods at Sylvan Lake in northeastern Indiana became the laboratories for her nature studies and the inspiration for her short stories, novels, essays, photography, and movies.[40] Stratton-Porter wrote twenty-six books that included twelve novels, eight nature studies, two books of poetry, and four collections of stories and children's books. Of the fifty-five books selling one million or more copies between 1895 and 1945, five of them were novels written by Stratton-Porter. Among Stratton-Porter's best-selling novels were Freckles (1904), A Girl of the Limberlost (1909), The Harvester (1911), Laddie (1913), and Michael O'Halloran (1915).[23][41] Stratton-Porter incorporated every day occurrences and acquaintances into her works of fiction. Many of her works delve into difficult subject matter such as themes of abuse, prostitution, and abandonment. In the case of Her Father's Daughter (1921), the anti-Asian sentiment that her writing reflected was prevalent in the United States during that era. Her other writing also introduced the concept of land and wildlife conservation to her readers.[42] Although Stratton-Porter preferred to focus on nature books, it was her romantic novels that gained her fame and wealth. Although, she often did create an irrefutable link between nature and romance in her plotlines; nature often represents a comfort for her characters, as she felt it was for her as a child. These romantic novels generated the income that allowed her to pursue her nature studies. Her novels have been translated into twenty-three languages, as well as Braille. At its peak in the early 1910s, her readership was estimated at 50 million, with earnings from her literary works estimated at $2 million.[19][41] Author[edit] Early years[edit] Stratton-Porter began her career in 1895, when she sent nature photographs that she had made to Recreation magazine. Her first published article, "A New Experience in Millinery," appeared in the publication's February 1900 issue. The article described her concerns about harming birds in order to use their feathers as hat trims. At the magazine's request, Stratton-Porter also wrote a photography column called "Camera Notes." In July 1901 she switched to doing similar work for Outing, a natural history magazine.[2][43] Stratton-Porter was soon submitting short stories and nature-related material to magazines on a regular basis with increasing success. Her first short story, "Laddie, the Princess, and the Pie," was published in Metropolitan magazine in September 1901.[44] To attract a wider audience Stratton Porter decided to include fictional elements in her nature writing and began writing novels. Stratton-Porter's writing also included poetry and children's stories, in addition to essays and editorials that were published in magazines with nationwide circulation such as McCall's and Good Housekeeping.[45] Novels[edit] Although it was published anonymously in 1893, circumstantial evidence suggests that Stratton-Porter's first book was The Strike at Shane's. However, Stratton-Porter never acknowledged that she had written it and its author was never revealed.[46] Bobbs-Merrill published her first, full-length attributed novel, The Song of the Cardinal (1903), about a red bird living along the Wabash River. The book explained how birds lived in the wild and also included her photographs. Although the novel was a modest commercial success and was warmly received by literary critics, Stratton-Porter's publisher believed that nature stories would not become as popular as romance novels. For her second novel, Stratton-Porter decided to combine nature and romance. Freckles (1904), which was published by Doubleday, Page and Company, became a bestseller. The book's popularity among readers helped to launch her career as a successful novelist, despite its lackluster reviews from critics.[47] Title page A Girl of the Limberlost (1909), which was highly successful and her best-known work, brought her worldwide recognition. Its central character, Elnora Comstock, a lonely, poverty-stricken girl living on a farm in Adams County, goes to the Limberlost Swamp to escape from her troubles and earns money to pay for her education by collecting and selling moth specimens.[48] The main character's strong, individualistic nature are similar to Stratton-Porter's.[49] Literary critics called the novel a "well written" and "wholesome story."[50] Initial sales of her third novel, At the Foot of the Rainbow (1907), about two friends who enjoy fishing and trapping, were "disappointing,"[51] but Stratton-Porter reached the peak of her popularity with the publication of her next novel, The Harvester (1911), which centers around David Langston, who harvests and in turn sells medicinal herbs, and his love interest, Ruth Jameson, who embodies his ideal partner. It reached number one on the best-seller list in 1912.[52] Freckles (1904), A Girl of the Limberlost (1909), and The Harvester (1911) are set in the wooded wetlands and swamps of northeast Indiana. Stratton-Porter loved the area and its wildlife and had documented them extensively.[19] Inexpensive reprints of Freckles and A Girl of the Limberlost brought Stratton-Porter to the public's attention in the United States as well as abroad. Translations of her book into other languages also increased her international audience. In 1910, when Stratton-Porter reached a long-term agreement with Doubleday, Page and Company to publish her books, she agreed to provide one manuscript each year, alternating between novels and nonfiction nature books.[53] Stratton-Porter's next novel, Laddie: A True Blue Story (1913), another of her best-selling novels, included elements that corresponded to her early life. It was written while she supervised construction of her home at Sylvan Lake in Noble County, Indiana, and she described it as her most autobiographical novel. The narrative is told in the first person by the twelfth child of the "Stanton" family. The title character is modeled after Stratton-Porter's deceased older brother, Leander, whom Stratton-Porter nicknamed Laddie. As in Stratton-Porter's own family, Laddie is connected with the land and identifies with their father's vocation of farming.[23][54] Michael O'Halloran (1915), her seventh novel, was inspired by a newsboy she had encountered in Philadelphia, while visiting her daughter, Jeannette, and her family. A Daughter of the Land (1918), her next novel, did not sell as well as her earlier works.[55] Over time, sales of Stratton-Porter's novels had slowly declined and by 1919 her status as a best-selling author began to fade. Undeterred, she continued to write until her death in 1924.[56] Her Father's Daughter (1921), one of Stratton-Porter's last novels, was set in southern California, outside Los Angeles, where she had moved around 1920. The novel is especially biased against immigrants of Asian descent. Judith Reick Long, one of Stratton-Porter's biographers, stated that World War I-era racial prejudice and nativism were prevalent in the United States and it was not unusual to be anti-Asian in southern California at that time. Barbara Olenyik Morrow, another of her biographers, explained that the book was intentionally playing to the era's ethnic prejudices. The Literary Review, ignoring its anti-Asian content, noted its "wholesome charm."[57][58] The White Flag (1923), criticized as an old-fashioned melodrama, failed to make the bestseller list; however, the story was serialized in Good Housekeeping magazine beginning in 1923, in advance of the book's release. By the time of its publication, Stratton-Porter's interests had shifted toward filmmaking.[59] The Keeper of the Bees (1925) and The Magic Garden (1927) were the last of Stratton-Porter's novels completed before her death. Both of them were written at her home on Catalina Island and published posthumously. The Keeper of the Bees is a story about a World War I veteran who regains his heath through the restorative "power and beauty of nature."[60] The story was serialized in McCall's magazine from February through September 1925 and was published in book form later that year. The Magic Garden, about a girl of divorced parents, was written for her two granddaughters, whose parents divorced when they were young. Filmmaker James Leo Meehan, Stratton-Porter's business partner and son-in-law, wrote a screenplay of the novel shortly after Stratton-Porter had completed the manuscript.[61] Millions of copies of Stratton-Porter's novels were sold and most of them became best sellers, but the literary establishment criticized them as "unrealistic," "too virtuous," and "idealistic."[62] Despite the criticisms, she was popular among readers of her novels.[25] Stratton-Porter once claimed, "Time, the hearts of my readers, and the files of my publisher will find me my ultimate place."[63] Nature books[edit] Front cover of Moths of the Limberlost' (1912) Stratton-Porter, a keen observer of nature, wrote eight nonfiction nature books that were moderate sellers compared to her novels. What I Have Done With Birds (1907) first appeared as a six-month illustrated series for the Ladies' Home Journal from April to August 1906. The Bobbs-Merrill Company published the material in book format that also includes Stratton-Porter's photographs.[64] Birds of the Bible (1909), an illustrated reference book published by Jennings and Graham of Cincinnati, included eighty-one of Stratton-Porter's photographs. Both of these nature books were slow sellers. Music of the Wild (1910), also published by Jennings and Graham, warned of the adverse effects that the destruction of trees and swamps would have on rainfall. Her warnings appeared nearly two decades before the Dust Bowl of the 1930s and well in advance of present-day environmental concerns about climate change.[65] Moths of the Limberlost (1912), the nature book of which Stratton-Porter was "most proud," was dedicated to Neltje Blanchan, a fellow nature writer and the wife of her publisher, Frank Nelson Doubleday.[66] Prior to her move to California in 1919, Stratton-Porter completed the manuscript for Homing with the Birds (1919). Praised for its content, it described birdlife using easy-to-understand language for the general public. Wings (1923) was published a year before her death; Tales You Won't Believe (1925) was published posthumously.[67] While literary critics called her novels overly sentimental, academics dismissed her nature writing because they felt that her research methods were unscientific. Stratton-Porter, who was not a trained scientist, centered her field research on her own interests in observing the domestic behavior of wild birds, such as their nest-building, diets, and social behavior. Her writing tried to explain nature in ways that her readers could understand and avoided scientific jargon and tedious, dry statistics.[68] Magazine articles[edit] Stratton-Porter regularly contributed articles and photographs to magazines that included Metropolitan, Recreation, Outing, Country Life in America, and Ladies' Home Journal. After her move to California in 1919, Stratton-Porter wrote articles for the Izaak Walton League's publication, Outdoor America, and a thirteen-part series of nature articles for Good Housekeeping. She also agreed to write a series of editorials for McCall's magazine in a monthly column called the "Gene Stratton-Porter's Page," beginning in January 1922.[69] Tales You Won't Believe (1925), a collection of articles that Stratton-Porter had written for Good Housekeeping, and Let Us Highly Resolve (1927), a collection of essays that had appeared in McCall's magazine, were published after her death.[70] Children's stories and poetry[edit] Morning Face (1916), a collection of children's stories that also included her photographs, was dedicated to her granddaughter, Jeannette Monroe, whom Stratton-Porter had nicknamed "Morning Face."[71] "Symbols," her first poem to appear in a national magazine, was published in Good Housekeeping in January 1921. The Fire Bird (1922), a Native American tragedy, was the first of her long narrative poems to be published in book form. Its sales were weak and it was not well received by literary critics. In 1922 Good Housekeeping published Stratton-Porter's poem, "Euphorbia," in three installments[72] and paid her $12,500, "the most she had ever received for her poetry."[56] Jesus of the Emerald (1923), another of her long narrative poems, describes Tiberius Caesar's search for details of Jesus's works and appearance. Stratton-Porter explains her religious beliefs in the afterword of the book.[73] Nature photographer[edit] In addition to writing, Stratton-Porter was an accomplished artist and wildlife photographer, specializing in the birds and moths that lived in the Limberlost Swamp, one of the last of the wetlands of the lower Great Lakes Basin. She also made sketches of her observations as part of her fieldwork. Stratton-Porter was especially noted for her close-up photographs of wildlife in their natural habitat. In one of her early photographic studies, she documented the development of a black vulture over a period of three months.[74] Stratton-Porter reported in What I Have Done with Birds (1907) that the effort "yielded me the only complete series of Vulture studies ever made."[75] Stratton-Porter began photographing birds in the Limberlost Swamp and along the Wabash River near her home in Geneva, Indiana, after her husband, Charles, and daughter, Jeannette, presented her with a camera as a Christmas gift in 1895. She submitted some of her early photographs to Recreation magazine in the late 1890s and wrote a regular camera column for the publication in 1901. Outing magazine hired her to do similar work in 1902. Unhappy with images the magazine editors suggested to accompany her writing, she began to submit her own photographs as illustrations for her articles. She also preferred to use her own photographs to illustrate her nature books.[76] Thirteen of her wildlife photographs were published in 1900 in the American Annual of Photography, which also included her views on her fieldwork. Many of the photographs in Music of the Wild (1910) were taken at her Sylvan Lake home in northeastern Indiana.[77] Stratton-Porter preferred to photograph wildlife in their natural environment.[42] Although she hired men to help transport her cumbersome camera equipment into the field for photo shoots, she preferred to work alone. Occasionally, her husband accompanied her into the field. As Stratton-Porter gained more experience, she acquired better camera equipment, including a custom-made camera that used eight-by-ten-inch glass photographic plates. Stratton-Porter believed that the larger plates provided her with more detailed photographs of her subjects. She also developed her photographic plates in a darkroom she set up in the bathroom at Limberlost Cabin, her family's home in Geneva, Indiana, and later in her darkroom at the Cabin at Wildflower Woods along Sylvan Lake.[78] Naturalist and conservationist[edit] Through her writing and photography, Stratton-Porter demonstrated "her strong desire to instill her love of nature in others in order to improve their lives and preserve the natural world."[79] She also opposed the destruction of wetlands developed for commercial use. After the turn of the twentieth century, when the Limberlost Swamp's trees were cut for timber and its shrubs and vines were killed, the resulting commercial development, which included oil drilling, destroyed its wildlife. The swamp was drained into the Wabash River.[80] In 1917 Stratton-Porter became more active in the conservation movement when the Indiana General Assembly passed legislation to allow drainage of state-owned swamps in Noble and LaGrange Counties. She joined with others to urge the state legislature to repeal the law that would lead to the destruction of wetlands in northeastern Indiana. Although the law was repealed in 1920, the area's swamps were eventually drained.[48][81] In 1922 Stratton-Porter became a founding member of the Izaak Walton League, a national conservation group, and joined its efforts to save the wild elk at Jackson Hole, Wyoming, from extinction. Stratton-Porter called on the readers of Outdoor America, the league's publication, to take prompt action.[82] She was also a strong advocate of land and wetland conservation. As she wrote in an essay, "All Together, Heave," for Outdoor America in 1922, "If we do not want our land to dry up and blow away, we must replace at least part of our trees" and urged conservation of American waterways.[83] Movie producer[edit] Stratton-Porter, a "pioneer" in the Hollywood film industry, was dissatisfied with the movie adaptation of her novels by movie studios. Because she wanted more control over the production work, Stratton-Porter expanded her business ventures to include her own production studio to make moving pictures based on her novels. Eight of her novels have been made into movies.[84] Paramount Pictures produced Freckles, the first film based on her novels in 1917, but Stratton-Porter was unhappy with the movie because it did not closely follow her novel and decided to make her own.[84] Stratton-Porter's first filmmaking effort was made with Thomas H. Ince on Michael O'Halloran (1923). Stratton-Porter supervised the filming and assisted the principal director, James Leo Meehan. Her daughter, Jeannette, wrote the screenplay.[85] In 1924 Stratton-Porter formed her own movie studio and production company. Gene Stratton-Porter Productions created moving pictures that were closely based on her novels.[86] Before her death in December 1924, Stratton-Porter's production company had produced two films, Michael O'Halloran (1923) and A Girl of the Limberlost (1924), and she had completed her novel The Keeper of the Bees for a third film.[84] Stratton-Porter's studio filmed The Harvester (1927) at her Wildflower Woods estate in northeastern Indiana. Film Booking Offices of America released the movies produced by Stratton-Porter's studio. None of these FBO-released films are known to survive.[87][88] Stratton-Porter's stories remained popular among filmmakers after her death. RKO Pictures, a successor to Film Booking Offices, made Freckles and Laddie in 1935. Monogram Pictures made A Girl of the Limberlost (1934), Keeper of the Bees (1935), and Romance of the Limberlost (1938).[87] Republic Pictures released The Harvester (1936) and Michael O'Halloran (1937). The original negatives and 35mm prints of these early films are unlikely to have survived; however, some 16mm versions created for television have been acquired by private collectors.[89] A Girl of the Limberlost was adapted four times for film. First, as a silent film produced by Stratton-Porter's production company in 1924 with Gloria Grey in the title role. The 1934 version was directed by W. Christy Cabanne and its cast included Marian Marsh in the starring role and silent-era film stars Henry B. Walthall, Betty Blythe, and Louise Dresser, an Indiana native. The 1945 version included Ruth Nelson. The 1990, made-for-television movie starred Joanna Cassidy as Stratton-Porter.[90] Romance of the Limberlost (1938), directed by William Nigh, featured Indiana actress Marjorie Main in the role of the mean stepmother.[91] The Keeper of the Bees was adapted four times as a movie. It was first released a silent film in 1925, starring Robert Frazer; in 1935 as a Monogram film starring Neil Hamilton; in 1942 for Columbia Pictures;[92] and as Keeper of the Bees in a 1947 adaptation that was loosely based on the original novel. Stratton-Porter's granddaughter, Gene Stratton Monroe, appeared 1925 version in the role of Little Scout.[93][94] Later years[edit] In later 1918, after years of years of strenuous work outdoors, battling with the Indiana state government to protect the state's wetlands, and worrying over the events of World War I, fifty-four-year-old Stratton-Porter checked into Clifton Springs Sanitarium and Clinic, a health retreat for the famous in New York. She recuperated at the resort for a month before returning to her home at Wildflower Woods and taking up new challenges as a poet, filmmaker, and editorialist. In 1919, after recovering from a serious bout of influenza and completing Homing with the Birds (1919), she decided to move to Los Angeles, California.[95] Southern California's more temperate climate and increased social activities appealed to her. From her California home, Stratton-Porter continued to write novels and poetry, in addition a series of articles for McCall's magazine. In 1924 she founded Gene Stratton-Porter Productions, Inc., one of the first female-owned studios, and worked with film director, James Leo Meehan, to create films based on her novels. With increased business dealings and enjoying the company of many writers, artists, sculptors, and musicians, Stratton-Porter decided to establish her permanent residence in southern California. Although she retained her home at Sylvan Lake in Indiana, the Porters sold the Limberlost Cabin in Geneva, Indiana, in 1923. At the time of her death in 1924, Stratton-Porter owned Wildflower Woods in Indiana, a year-round home in Los Angeles, a vacation home on Catalina Island, and was constructing a mansion in Bel Air, California.[96] Death and legacy[edit] Stratton-Porter died on December 6, 1924, at the age of sixty-one, in Los Angeles, California, of injuries received in a traffic accident. Her car, driven by her chauffeur, collided with a streetcar while she was en route to visit her brother, Jerome. Stratton-Porter was thrown from the vehicle and died at a nearby hospital less than two hours later of a fractured pelvis and crushed chest. Her private funeral was held on December 11 at her South Serrano Street home in Hollywood, California. Stratton-Porter's remains were held in a temporary burial vault until 1934 and then interred at Hollywood Memorial Park Cemetery.[97] Stratton-Porter's husband, Charles Porter, died in 1926 and was buried in his hometown of Decatur, Indiana; their daughter, Jeannette Porter Meehan, died in California in 1977. In 1999 Stratton-Porter's two grandsons, James and John Meehan, arranged to move Stratton-Porter's remains, along with those of their mother, Jeannette Porter Meehan, to Indiana. The women's remains are interred on the grounds of the Gene Stratton-Porter State Historic Site at Sylvan Lake.[2][98] Stratton-Porter's two former residences in Indiana, the Limberlost Cabin in Geneva and the Cabin at Wildflower Woods near Rome City, have been acquired by the State of Indiana and designated as state historic sites to honor her work and relate the story of her life. The Indiana State Museum and Historic Sites operates the two properties as house museums; both of them are open to the public.[23][99] Because Stratton-Porter wrote in advance of her publishing deadlines, McCall's magazine had enough of her material to continue publishing her monthly column, the "Gene Stratton-Porter Page," in its magazine until December 1927, three years after her death. Good Housekeeping and American Magazine also published posthumously other articles that Stratton-Porter had written. In addition, four of her books were published posthumously: two novels, The Keeper of the Bees (1925) and The Magic Garden (1927), and two collections of her articles and essays, Tales you Won't Believe (1925) and Let Us Highly Resolve (1927).[100] More recently, Indiana University Press reissued eight of Stratton-Porter's novels in the 1980s and 1990s, including A Girl of the Limberlost, which remains "among her best-loved novels";[101] Kent State University Press published a compilation of Stratton-Porter's poetry, Field o’ My Dreams: The Poetry of Gene-Stratton Porter (2007).[102] Stratton-Porter's nature photographs, correspondence, books, and magazine articles, among other materials, are housed at several repositories, including the Indiana State Library, the Indiana State Museum, and the Indiana Historical Society in Indianapolis; the Lilly Library at Indiana University in Bloomington; the Bracken Library at Ball State University in Muncie; and the Geneva branch of the Adams Public Library in Geneva, Indiana, and elsewhere.[56][103] Bertrand F. Richards, a Stratton-Porter biographer, called her "one of the best-selling writers of the first quarter of the twentieth century."[104] She is best known for her novels and nature books; however, her poetry, children's books, and numerous essays, editorials, and monthly columns for magazines such as McCall's and Good Housekeeping are not well known today. After her move to southern California in 1919, Stratton-Porter also became one of Hollywood's first female producers and in 1924 was among the first women to form her own production company.[42][99] Stratton-Porter, who is remembered for her ambition and individualism, was also a passionate nature lover who encouraged people to explore the nature and the outdoors. She especially loved birds and did extensive studies of moths. Among her lasting legacies is her early and outspoken advocacy for nature conservation. Stratton-Porter supported efforts to preserve wetlands, such as the Limberlost Swamp, and saving the wild elk at Jackson Hole, Wyoming, from extinction. She also recognized the impact that cutting down trees would have on climate change and encouraged Americans to preserve the environment. As the Izaak Walton League paid tribute to her work in its publication, Outdoor America, following her death, "if we can write her epitaph in terms of clean rivers, clean outdoor playgrounds, and clean young hearts, we shall have done what she would have asked."[105] Honors and awards[edit] The Adirondack Forest Preserve Service dedicated to Stratton-Porter a memorial grove of 10,000 white pine trees at Tongue Mountain on Lake George, New York, in 1924, shortly after her death.[106] The American Reforestation Association organized memorial tree plantings after her death on the grounds of Los Angeles-area schools.[106] The College Woman's Salon of Los Angeles established an annual poetry award in her honor.[106] R. R. Rowley named a trilobite, Pillipsia Stratton-Porteri, in her honor.[107] The Purdue University Calumet campus's Porter Hall, along with the former elementary school that opened on the site in 1949, was named in her honor.[108] In 2009 Stratton-Porter's portrait was added to the Hoosier Heritage Portrait Collection at the Indiana Statehouse in Indianapolis.[109] In 2009 Stratton-Porter was inducted into the Indiana Natural Resources Foundation's Hall of Fame (inaugural class) as an early conservationist.[110] In 2015 Stratton-Porter was inducted into Wabash High School's Hall of Distinction for her contributions to literature, ecology and photography.[111] Stratton-Porter's two former residences in Indiana, the Limberlost Cabin in Geneva and the Cabin at Wildflower Woods near Rome City were designated state historic sites and listed on the National Register of Historic Places. The Indiana State Museum and Historic Sites operates the two properties as house museums.[112][23] Selected published works[edit] Stratton-Porter's novels, most of them best sellers, became popular in the first quarter of the twentieth century and were widely read.[113] Her twenty-six published books include twelve novels, eight nature studies, two books of poetry, and four collections of stories and children's books.[23][41] Novels[edit] Library resources about Gene Stratton-Porter Online books Resources in your library Resources in other libraries By Gene Stratton-Porter Online books Resources in your library Resources in other libraries The Song of the Cardinal, 1903 Freckles, 1904 At the Foot of the Rainbow, 1907 A Girl of the Limberlost, 1909 The Harvester, 1911 Laddie, 1913 Michael O'Halloran, 1915 A Daughter of the Land, 1918 Her Father's Daughter, 1921 The White Flag, 1923 The Keeper of the Bees, 1925 The Magic Garden, 1927[23] Nature studies[edit] What I Have Done with Birds, 1907 (Revised as Friends in Feathers in 1917.)[114] Birds of the Bible, 1909 Music of the Wild, 1910 Moths of the Limberlost, 1912 Friends in Feathers, 1917 (A revised and expanded edition of What I Have Done with Birds.)[114] Homing with the Birds, 1919 Wings, 1923 Tales You Won't Believe, 1925[23] Poetry[edit] The Fire Bird, 1922 Jesus of the Emerald, 1923 Field o’ My Dreams: The Poetry of Gene-Stratton Porter, 2007[23][115] "Euphorbia", 1923 (Published in Good Housekeeping in three monthly installments from January through March 1923; it was never published in book form.)[116] Children's books and collected essays[edit] After the Flood, 1911 Birds of the Limberlost, 1914 Morning Face, 1916 Let Us Highly Resolve, 1927 Film adaptations of novels[edit] Eight of Stratton-Porter's novels have been made into moving pictures.[92] Freckles, directed by Marshall Neilan (1917, based on the novel Freckles) Michael O'Halloran, directed by James Leo Meehan (1923, based on the novel Michael O'Halloran) A Girl of the Limberlost, directed by James Leo Meehan (1924, based on the novel A Girl of the Limberlost) The Keeper of the Bees, directed by James Leo Meehan (1925, based on the novel The Keeper of the Bees) Laddie, directed by James Leo Meehan (1926, based on the novel Laddie) The Magic Garden, directed by James Leo Meehan (1927, based on the novel The Magic Garden) The Harvester, directed by James Leo Meehan (1927, based on the novel The Harvester) Freckles, directed by James Leo Meehan (1928, based on the novel Freckles) A Girl of the Limberlost, directed by Christy Cabanne (1934, based on the novel A Girl of the Limberlost) Laddie, directed by George Stevens (1935, based on the novel Laddie) The Keeper of the Bees, directed by Christy Cabanne (1935, based on the novel The Keeper of the Bees) Freckles, directed by Edward Killy and William Hamilton (1935, based on the novel Freckles) The Harvester, directed by Joseph Santley (1936, based on the novel The Harvester) Michael O'Halloran, directed by Karl Brown (1937, based on the novel Michael O'Halloran) Romance of the Limberlost, directed by William Nigh (1938, based on the novel A Girl of the Limberlost) Laddie, directed by Jack Hively (1940, based on the novel Laddie) Her First Romance, directed by Edward Dmytryk (1940, based on the novel Her Father's Daughter) Freckles Comes Home, directed by Jean Yarbrough (1942, based on a sequel to the novel Freckles) The Girl of the Limberlost, directed by Mel Ferrer (1945, based on the novel A Girl of the Limberlost) The Keeper of the Bees, directed by John Sturges (1947, based on the novel The Keeper of the Bees) Michael O'Halloran, directed by John Rawlins (1948, based on the novel Michael O'Halloran) Freckles, directed by Andrew V. McLaglen (1960, based on the novel Freckles) A Girl of the Limberlost, directed by Burt Brinckerhoff (1990, TV film, based on the novel A Girl of the Limberlost) City Boy, directed by John Kent Harrison (1992, TV film, based on the novel Freckles) Biographical play[edit] A Song in the Wilderness, a one-woman show written by Larry Gard and first performed in 1993, offers a dramatic exploration of Stratton-Porter's life and experiences.[117] The 40-45 minute play was written for Gard's wife, actress Marcia Quick Gard, and financed by an Indiana Humanities Council grant.[118] The play toured Indiana each spring from 1993 through 1997 and was performed in numerous Indiana towns.[119] In March 2002 the Carpenter Science Theatre Company produced a production of the play at the Eureka Theatre in Richmond, Virginia, directed by Gard and featuring Quick in the title role.[120] A spring 2017 performance of the play had been scheduled in the Rhoda B. Thalhimer Theater at the Science Museum of Virginia in Richmond, but Quick died December 16, 2016.[121][122] Kerrigan Sullivan,[123] a Richmond-based actress, was cast to play the role of Stratton-Porter. Playwright Gard, director Jones, and actress Sullivan dedicated the subsequent performances to Quick's memory. The play was also performed at the Cat Theater at St. Catherine's School for Girls in Richmond[124] and TheaterLab, also in Richmond. In addition, the play was performed at the University of Notre Dame's DeBartolo Performing Arts Center in conjunction with the Notre Dame Shakespeare Festival and the Limberlost Theatre Company in 2017.[125] The Friends of the Limberlost presented the play in Fort Wayne, Indiana, also in 2017.[126] References[edit] ^ "Gene Stratton-Porter and Her Limberlost Swamp". Archived from the original on January 17, 1999. Retrieved January 11, 2010. ^ a b c d "Biographical Sketches" in Gene Stratton Porter Collection, 1843–1999 (Bulk 1910s–1930s) Collection Guide. Indianapolis: Indiana Historical Society. 2016. Retrieved July 11, 2017. ^ Judith Reick Long (1990). Gene Stratton-Porter: Novelist and Naturalist. Indianapolis: Indiana Historical Society. p. 21. ISBN 0871950529. ^ Long, pp. 40–41, 45; Pamela J. Bennett, ed. (September 1996). "Gene Stratton-Porter" (PDF). The Indiana Historian. Indianapolis: Indiana Historial Bureau: 3–4. Retrieved July 21, 2017.CS1 maint: extra text: authors list (link) ^ The likely reasons for sixty-year-old Mark Stratton’s decision to move to Wabash, Indiana, was Leander's untimely death (Mark Stratton had hoped his young son would take over the family's farming operations) and his wife's declining health (she had contracted typhoid fever when Geneva was young). See Long, pp. 45, 69, 73, and Barbara Olenyik Morrow (2010). Nature's Storyteller: The Life of Gene Stratton-Porter. Indianapolis: Indiana Historical Society. p. 28. ISBN 978-0-87195-284-4. ^ Long, p. 109; Morrow, p. 41. ^ Bennett, p. 4; Morrow, pp. 26–28. ^ Stratton-Porter, Gene. “Gene Stratton-Porter: A Little Story of The Life and Work and Ideals of ‘The Bird Woman’ .” Edited by S.F.E and Mary Mark Ockerbloom, A Celebration of Women Writers, Philadelphia: Jas. B. Rodgers Printing Co., digital.library.upenn.edu/women/stratton/gene/gene.html. ^ Long, pp. 80–82, 91–92; Morrow, p. 35. ^ Because etiquette required a formal introduction, Charles did not approach Gene directly. Instead, he got her name and address through a cousin who knew Gene's brother-in-law. Two months later, Charles wrote Gene a letter, inviting her to begin a correspondence with him. She agreed. See Long, pp. 87–88, 94–97; Morrow, pp. 36–38. ^ Long, p. 110; Morrow, pp. 39–41. ^ Long, pp. 103–104, 109; Morrow, pp. 44–45. ^ a b Albert D. Hart Jr. "Our Folk: Porter Family". Albert Hart. Retrieved January 11, 2010. ^ Linda C. Gugin and James E. St. Clair, eds. (2015). Indiana's 200: The People Who Shaped the Hoosier State. Indianapolis: Indiana Historical Society Press. p. 334. ISBN 978-0-87195-387-2.CS1 maint: extra text: authors list (link) ^ Bennett, pp. 2, 4; Long, pp. 117–119, 138. ^ Long, pp. 168, 209–211; Morrow, p. 101. ^ Long, p. 120; Morrow, pp. 41–43; Gugin and St. Clair, eds., p. 335. ^ "Gene Stratton-Porter 'Limberlost', Geneva (Adams County)" (PDF). Travels in Time: Hoosiers and the Arts. Indianapolis: DHPA. Retrieved July 21, 2017. ^ a b c "Gene Stratton Porter Cabin" Archived 2013-05-11 at the Wayback Machine, Indiana State Museum, accessed 11 Jan 2010 ^ Gugin and St. Clair, eds., p. 334; Morrow, pp. 4, 95, 159–62. ^ Bennett, pp. 10–11; Gugin and St. Clair, eds., p. 335; Long, pp. 245–46, 249. ^ Bennett, p. 5; Gugin and St. Clair, eds., pp. 334–35; Long, pp. 131–34. ^ a b c d e f g h i j "Authors: Gene Stratton-Porter". Our Land, Our Literature. Ball State University. Archived from the original on July 8, 2003. Retrieved July 21, 2010.CS1 maint: bot: original URL status unknown (link) ^ Mary E. Gaither (1988). Introduction. Laddie, A True Blue Story. By Gene Stratton-Porter. Bloomington, Indiana: Indiana University Press. pp. ix. ISBN 9780253331137. ^ a b "Notable Hoosiers: Gene Stratton-Porter". Indiana Historical Society. Retrieved July 21, 2017. ^ Bennett, p. 9; Gugin and St. Clair, eds., p. 224. ^ "Indiana State Historic Architectural and Archaeological Research Database (SHAARD)" (Searchable database). Indiana Department of Natural Resources, Division of Historic Preservation and Archaeology. Retrieved July 21, 2017. This includes Thomas Gross. "National Register of Historic Places Inventory Nomination Form: Gene Stratton Porter Cabin" (pdf). Retrieved July 21, 2017. and accompanying photographs ^ In 1992 five cooperating foundations and organizations purchased a 442-acre (179-hectare) section of marshland in Adams and Jay Counties in a portion of the former Limberlost Swamp that they renamed the Loblolly Wetlands and began work to restore the land and its habitat. See "Loblolly Marsh Preserve" (PDF). Retrieved May 15, 2016. Other nearby sites related to Stratton-Porter include the 38-acre (15-hectare) Limberlost Bird Sanctuary; a 67-acre (27-hectare) Music of the Wild prairie and woods; Rainbow Bend Park on the Wabash River; the 25-acre (10-hectare) Munro Nature Preserve, and the 840-acre (340-hectare) Limberlost Swamp Wetland Preserve. See Morrow, pp. 160–61. ^ Long, p. 195–96; Morrow, pp. 159–62. ^ Bennett, pp. 5, 8, 11; Long, pp. 196–97, 199; Morrow, pp. 95, 99. ^ Bennett, pp. 7, 9, 11–12; Gugin and St. Clair, pp. 334–35; Long, p. 241. ^ Eric Grayson (Winter 2007). "Limberlost Found: Indiana's Literary Legacy in Hollywood". Traces of Indiana and Midwestern History. Indianapolis: Indiana Historical Society. 19 (1): 44. Retrieved July 17, 2017. ^ Morrow, pp. 139, 161–62. ^ "Indiana State Historic Architectural and Archaeological Research Database (SHAARD)" (Searchable database). Indiana Department of Natural Resources, Division of Historic Preservation and Archaeology. Retrieved July 21, 2017. This includes Thomas Gross. "National Register of Historic Places Inventory Nomination Form: Gene Stratton-Porter Cabin" (pdf). Retrieved July 21, 2017. and accompanying photographs. ^ "Gene Stratton-Porter State Historic Site Rome City, Indiana". Gene Stratton-Porter State Historic Site Rome City, Indiana. Retrieved November 18, 2015. ^ Gugin and St. Clair, eds, p. 335; Long, pp. 244, 247. ^ Long, pp. 224–25, 243. ^ Bennett, pp. 10–11; Long, pp. 247–49. ^ Bennett, pp. 10–11; Long, pp. 245–46, 249, 253. ^ Bennett, p. 5; Gugin and St. Clair, eds., p. 334; Long, pp. 139, 142. ^ a b c Morrow, p. 15. ^ a b c Gugin and St. Clair, eds., p. 334. ^ Long, pp. 148–49; Morrow, pp. 8, 69–70. ^ Bennett, p. 5; Morrow, p. 70. ^ Morrow, p. 175. ^ Long, p. 124–26. ^ Long, pp. 173–74, 179; Morrow, pp. 72–73. ^ a b Dawn Mitchell (March 17, 2015). "Gene Stratton-Porter, naturalist and author". Indianapolis Star. Indianapolis. Retrieved July 10, 2017. ^ Long, p. 187. ^ Morrow, p. 81–82. ^ Morrow, p. 16. ^ Long, pp. 9, 190. ^ Long, pp. 187–88; Morrow, pp. 81, 85. ^ Long, p. 199; Morrow, p. 98. ^ Morrow, pp. 99–100, 107. ^ a b c Kevin Kilbane (October 29, 2016). "Recently Acquired Collection of Gene Stratton-Porter Letters, Photos Offer More Details of Her Life". News-Sentinel.com. Fort Wayne, Indiana: Fort Wayne Newspapers. Archived from the original on April 4, 2017. Retrieved July 11, 2017. ^ Long, pp. 226–27; Morrow, p. 114. ^ The lead character, Linda Strong, displays an ugly philosophy regarding Japanese immigrants, portraying them as pawns of the Japanese government, sent here to "steal" an American education, even though highly educated in Japan and far too old for the High School she attends. The Japanese are portrayed as copying American inventions, and the Japanese villain Oka Sayye, goes so far as to try to kill a classmate (Donald Whiting) to prevent being bested in the competition for first place. As encouragement to Donald to study harder, Linda describes a terrifying future where the other races, being only capable of imitating the innovations of the white man, will learn all the white man knows by studying harder, and by breeding at a higher rate, will remove the white man from his superior position in the world.[citation needed] ^ Long, p. 241; Morrow, pp. 129–30. ^ Morrow, p. 134. ^ Bennett, pp. 10–11; Long, pp. 247–49; Morrow, p. 135. ^ Long, pp. 7–8. ^ Long, p. 8. ^ Long, pp. 183–84; Morrow, pp. 8, 1475–76. ^ Long, p. 187; Morrow, pp. 79, 83. ^ Morrow, p. 90. ^ Bennett, p. 10; Long, p. 220–21; Morrow, pp. 110, 173–75. ^ Bennett, p. 2; Long, p. 7; Morrow, p. 12. ^ Long, pp. 238, 241–43; Morrow, p. 115. ^ Bennett, p. 10; Morrow, pp. 173–75. ^ Long p. 212; Morrow, p. 101. ^ Long, pp. 225–26; Morrow, p. 124. ^ Although her father was a Methodist minister and she grew up in a Christian household, Stratton-Porter did not regularly attend church as an adult and was not a member of an organized religious congregation. See Long, pp. 53, 234–35; Morrow, p. 125. ^ Long, pp. 157–58; Morrow, pp. 15, 57. ^ Bennett, p. 7. ^ Bennett, p. 6; Long, pp. 138, 142, 149; Morrow, pp. 51, 70. ^ Long, pp. 149, 189. ^ Bennett, p. 6; Long, p. 144; Morrow, pp. 42, 59, 65–67. ^ Bennett, p. 2. ^ Gugin and St. Clair, eds., p. 334; Long, p. 189. ^ Bennett, pp. 8, 12. ^ Morrow, pp. 132–33. ^ Long, pp. 238 and 267, note 1. ^ a b c Gugin and St. Clair, eds., p. 335; Morrow, p. 140. ^ Bennett, pp. 8–9; Long, pp. 22, 214; Morrow, pp. 119–20. ^ Bennett, p. 10. ^ a b Grayson, p. 44. ^ Morrow, p. 140. ^ Grayson, p. 45. ^ A Girl of the Limberlost, retrieved 2019-01-18 ^ Grayson, pp. 46–47. ^ a b Movies based on Books by Gene Stratton-Porter (1863-1924), (Geneva, Indiana: Friends of the Limberlost) ^ Morrow, p. 135. ^ Stratton-Porter had given her granddaughter, Gene Monroe, the nickname of Little Scout. See "The Indiana Historian" (PDF). ^ Bennett, pp. 8, 11–12; Long, pp. 9, 215, 217–18; Morrow, p. 109. ^ Bennett, pp. 9–11; Long, pp. 224–25, 243–49. ^ Long, p. 250; Morrow, pp. 137–39. ^ Bennett, p. 10; Long, p. 253; Morrow, p. 139. ^ a b "New Documents, Letters and Photographs Round Out Gene Stratton-Porter Collection". INPerspective. Indianapolis: Indiana Historical Society. 23 (1): 10. January 2017. ^ Morrow, pp. 173–75. ^ Morrow, p. 141. ^ Morrow, p. 164. ^ Morrow, pp. 165–66. ^ Bennett, p. 3. ^ Morrow, pp. 15–17. ^ a b c Long, pp. 9–11. ^ Long, p. 184. ^ Robin Biesen. "History helps dedicate PUC building". Retrieved August 17, 2016. See also: "Facilities Services, 1950-2002 | Archive Repository". pucarch.purduecal.edu. Archived from the original on December 8, 2015. Retrieved November 29, 2015. ^ Morrow, p. 144. ^ "Indiana Natural Resources Foundation". www.in.gov. Retrieved 2015-11-29. ^ "Hall of Distinction – District – Wabash City Schools". www.apaches.k12.in.us. Retrieved 2019-01-18. ^ "National Register Information System". National Register of Historic Places. National Park Service. July 9, 2010. ^ R. E. Banta and Bruce Rogers (1949). Indiana Authors and Their Books, 1816-1980. Crawfordsville, Indiana: Wabash College. p. 258. OCLC 608852151. ^ a b Morrow, p. 173. ^ Stratton-Porter, Gene, and Mary DeJong Obuchowski (2007). Field o' My Dreams: The Collected Poems of Gene Stratton-Porter. Kent State University. pp. Kent, Ohio. ISBN 9780873389020.CS1 maint: multiple names: authors list (link) ^ Morrow, p. 174. ^ "Touring production brings naturalist and author Gene Stratton-Porter to life : Related Articles | OOYUZ". www.ooyuz.com. Retrieved June 25, 2017. ^ Kilbane, Kevin. "Touring production brings naturalist and author Gene Stratton-Porter to life - News-Sentinel.com". News-Sentinel.com. Archived from the original on May 25, 2017. Retrieved June 25, 2017. ^ Cities included Lafayette, Muncie, Anderson, Calumet, Chesterton, Elkhart, Evansville, Fort Wayne, Frankfort, Franklin, Goshen, Greenfield, Greensburg, Huntington, Kendalville, La Porte, Lawrenceburg, Lebanon, Merrillville, Michigan City, North Manchester, Plymouth, Porter, Wabash, Portland, Rome City, and Terre Haute.[citation needed] ^ Griset, Rich. "After Helping the Science Museum Find Its Voice, the Longtime Artistic Director of the Carpenter Science Theatre Company Retires". Style Weekly. Retrieved 2019-01-18. ^ Times-Dispatch, HOLLY PRESTIDGE Richmond. ""A Song in the Wilderness" goes on without its star". Richmond Times-Dispatch. Retrieved 25 June 2017. ^ The play's director, Jacqueline Jones, assumed that Gard, the actress’s widower, would cancel the performance; however, he asked Jones to hold auditions for the Stratton-Porter role, the play’s only character. See Tribune, Andrew S. Hughes South Bend. "Play about Gene Stratton-Porter staged as tribute to its original star". South Bend Tribune. Retrieved 24 June 2017. ^ "PHOTOS: "A Song in the Wilderness"". Richmond Times-Dispatch. Retrieved 25 June 2017. ^ "A Song in the Wilderness | CAT Theatre". www.cattheatre.com. ^ Tribune, Andrew S. Hughes South Bend. "Play about Gene Stratton-Porter staged as tribute to its original star". South Bend Tribune. Retrieved June 24, 2017. ^ "Friends of the Limberlost present "A Song of the Wilderness"". Decatur Daily Democrat. Retrieved June 25, 2017. External links[edit] Wikimedia Commons has media related to Gene Stratton-Porter. "Our Folk: Porter Family Genealogy", Albert D. Hart Jr. Gene Stratton-Porter Photo, OurFolk Web Works by Gene Stratton-Porter at Project Gutenberg Works by or about Gene Stratton-Porter at Internet Archive Works by Gene Stratton-Porter at LibriVox (public domain audiobooks) Works by Gene Stratton-Porter at Open Library "Gene Stratton-Porter Memorial Society", Gene Stratton-Porter State Historic Site, Rome City, Indiana Gene Stratton-Porter State Historic Site, Facebook page Gene Stratton-Porter, A Girl of the Limberlost, online text "After Limberlost: Gene Stratton-Porter's Life in California" on YouTube (a 2013 short documentary), produced by Almost Fairytales Films "Gene Stratton-Porter" on YouTube (Indiana Bicentennial Minute, 2016), Indiana Historical Society "Gene Stratton-Porter: Voice of the Limberlost" on YouTube (a 1996 documentary; produced by WIPB-TV), Ball State University, Libraries "Historic Footage of Gene Stratton-Porter" on YouTube, Indiana State Museum and Historic Sites "There is a memoir or a biography" on Project Gutenberg. [1] v t e Gene Stratton-Porter Novels The Song of the Cardinal (1903) Freckles (1904) A Girl of the Limberlost (1909) At the Foot of the Rainbow (1907) The Harvester (1911) Laddie: A True Blue Story (1913) Michael O'Halloran (1915) A Daughter of the Land (1918) Her Father's Daughter (1921) The White Flag (1923) The Keeper of the Bees (1925) The Magic Garden (1927) Other works Nature studies Poetry Adaptations Freckles Freckles (1917 film) Freckles (1928 film) Freckles (1935 film) Freckles (1960 film) City Boy (1992 film) A Girl of the Limberlost A Girl of the Limberlost (1924 film) A Girl of the Limberlost (1934 film) Romance of the Limberlost (1938 film) The Girl of the Limberlost (1945 film) A Girl of the Limberlost (1990 film) The Harvester The Harvester (1927 film) The Harvester (1936 film) Laddie: A True Blue Story Laddie (1926 film) Laddie (1935 film) Laddie (1940 film) Michael O'Halloran Michael O'Halloran (1923 film) Michael O'Halloran (1937 film) Michael O'Halloran (1948 film) Her Father's Daughter Her First Romance (1940 film) The Keeper of the Bees The Keeper of the Bees (1925 film) The Keeper of the Bees (1935 film) Keeper of the Bees (1947 film) The Magic Garden The Magic Garden (1927 film) Historic sites Gene Stratton-Porter Cabin (Rome City, Indiana) Limberlost State Historic Site (Geneva, Indiana) Works inspired by Freckles Comes Home (1929 novel) Freckles Comes Home (1942 film) A Song in the Wilderness (biographical play) Authority control General Integrated Authority File (Germany) ISNI 1 VIAF 1 WorldCat National libraries Norway Spain France (data) Catalonia United States Latvia Japan Czech Republic Israel Korea Netherlands Poland Art research institutes Photographers' Identities Scientific databases CiNii (Japan) Other Faceted Application of Subject Terminology Social Networks and Archival Context SUDOC (France) 1 Trove (Australia) 1 Retrieved from "https://en.wikipedia.org/w/index.php?title=Gene_Stratton-Porter&oldid=1026318122" Categories: 1863 births 1924 deaths American naturalists Burials at Hollywood Forever Cemetery Writers from Indiana American women writers Nature photographers People from Wabash County, Indiana People from Adams County, Indiana People from Noble County, Indiana American women film producers Hidden categories: CS1 maint: extra text: authors list Webarchive template wayback links CS1 maint: bot: original URL status unknown All articles with unsourced statements Articles with unsourced statements from July 2017 Articles using NRISref without a reference number CS1 maint: multiple names: authors list Commons category link from Wikidata Articles with Project Gutenberg links Articles with Internet Archive links Articles with LibriVox links Open Library ID different from Wikidata Articles with Open Library links Wikipedia articles with GND identifiers Wikipedia articles with ISNI identifiers Wikipedia articles with VIAF identifiers Wikipedia articles with BIBSYS identifiers Wikipedia articles with BNE identifiers Wikipedia articles with BNF identifiers Wikipedia articles with CANTIC identifiers Wikipedia articles with LCCN identifiers Wikipedia articles with LNB identifiers Wikipedia articles with NDL identifiers Wikipedia articles with NKC identifiers Wikipedia articles with NLI identifiers Wikipedia articles with NLK identifiers Wikipedia articles with NTA identifiers Wikipedia articles with PLWABN identifiers Wikipedia articles with PIC identifiers Wikipedia articles with CINII identifiers Wikipedia articles with FAST identifiers Wikipedia articles with SNAC-ID identifiers Wikipedia articles with SUDOC identifiers Wikipedia articles with Trove identifiers Wikipedia articles with WORLDCATID identifiers Navigation menu Personal tools Not logged in Talk Contributions Create account Log in Namespaces Article Talk Variants Views Read Edit View history More Search Navigation Main page Contents Current events Random article About Wikipedia Contact us Donate Contribute Help Learn to edit Community portal Recent changes Upload file Tools What links here Related changes Upload file Special pages Permanent link Page information Cite this page Wikidata item Print/export Download as PDF Printable version In other projects Wikimedia Commons Wikisource Languages تۆرکجه Español Français مصرى 日本語 Polski Svenska Edit links This page was last edited on 1 June 2021, at 15:43 (UTC). Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. Privacy policy About Wikipedia Disclaimers Contact Wikipedia Mobile view Developers Statistics Cookie statement
epadd-org-4628 ---- <meta http-equiv="refresh" content="0; URL=https://epadd.stanford.edu/'/epadd/"/>
epadd-stanford-edu-331 ---- Working... No Status Toggle navigation Browse Collections Browse Repositories Search User manual User forum About ePADD Contact us × Alert OK × Success OK × Information OK × Warning OK × Error OK × Warning Cancel OK × Warning Cancel OK × Copy Cancel Copy Discovery | About this Collection Summary Institution Stanford University Repository University Archives Collection ID SC0097 Collection Title Donald E. Knuth papers 2 accessions Date Range 1999-01-12 to 2019-01-25 1 message undated Messages:31,997 Sent by Owner:19,910 Attachments:2,621 Images:1,279 Documents:865 Others:477 Contact Email universityarchives@stanford.edu Finding Aid Catalog Record Donald E. Knuth papers Enter Donald Ervin Knuth’s work established the analysis of algorithms as an academic field. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of theTeX computer typesetting system, the related METAFONT font definition language and rendering system, and the ComputerModern family of typefaces. As a writer and scholar, Knuth created the WEB/CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. Scope and Contents This email collection spans messages from January 1999 through January 2019. The messages reflect Knuth's work in the study and teaching of computer programming, computer systems, mathematics, and organ performance. Rights and Conditions All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94305-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner. Such permission must be obtained from the copyright owner, heir(s) or assigns. See: https://library.stanford.edu/spc/using-our-collections Notes This email collection was processed in two parts due to significant technical differences between the email formats Knuth used. Researchers will encounter duplicate messages across both parts. Note that email in RMAIL format (dating from January 1999 through December 2018) consists only of sent messages, while email in MBOX format (November 2010 through January 2019) consists of both sent and received messages. Messages containing financial, medical, and other sensitive information have been restricted for up to 80 years. Accession ID:ARCH 2019-070 MBOX Title: Donald E. Knuth papers Scope and Contents This email collection spans messages from November 2010 through January 2019. The messages reflect Knuth's work in the study and teaching of computer programming, computer systems, mathematics, and organ performance. Rights and Conditions All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94305-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner. Such permission must be obtained from the copyright owner, heir(s) or assigns. See: https://library.stanford.edu/spc/using-our-collections Accession ID:ARCH 2019-070 RMAIL Title: Donald E. Knuth papers Scope and Contents This email collection spans messages from January 1999 through December 2018. The messages reflect Knuth's work in the study and teaching of computer programming, computer systems, mathematics, and organ performance. Rights and Conditions All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94305-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner. Such permission must be obtained from the copyright owner, heir(s) or assigns. See: https://library.stanford.edu/spc/using-our-collections Enter Email messages in the ePADD Discovery Module have been redacted to ensure the privacy of donors and other correspondents. Please contact the host repository if you would like to request access to full messages, including any attachments. × Upload a banner image (11:3 aspect ratio) File Upload
epadd-stanford-edu-3693 ---- Working... No Status Toggle navigation Browse Collections Browse Repositories Search User manual User forum About ePADD Contact us × Alert OK × Success OK × Information OK × Warning OK × Error OK × Warning Cancel OK × Warning Cancel OK × Copy Cancel Copy Discovery | About this Collection Summary Institution Stanford University Repository Special Collections Collection ID M1851 Collection Title Ted Nelson email archive Date Range 2001-10-05 to 2019-03-30 2 messages undated Messages:229,071 Sent by Owner:0 Attachments:34,897 Images:21,915 Documents:3,929 Others:9,053 Contact Email specialcollections@stanford.edu Catalog Record Ted Nelson email archive Enter Theodor Holm "Ted" Nelson (1937-) is an American pioneer of information technology, philosopher, and sociologist. Nelson founded Project Xanadu in 1960, with the goal of creating a computer network with a simple user interface. He coined the terms hypertext and hypermedia in 1963 and published them in 1965. Scope and Contents The Ted Nelson email archive spans the years of 2001 to 2019. The archive contains correspondence related to Ted Nelson’s life and career as an information technology entrepreneur and philosopher. Many of Nelson’s projects are documented through this email collection, including Project Xanadu, XanaduSpace, ZigZag, and his 2010 autobiography, Possiplex: Movies, Intellect, Creative Control, My Computer Life and the Fight for Civilization. The correspondence also documents Nelson’s speaking and teaching engagements at the University of California, Santa Cruz and Chapman University. Other well-known information technology figures found among Ted Nelson’s correspondence include Douglas Engelbart, Steve Wozniak, Harry Mendell, and Laurie Spiegel. Rights and Conditions All requests to reproduce, publish, quote from, or otherwise use collection materials must be submitted in writing to the Head of Special Collections and University Archives, Stanford University Libraries, Stanford, California 94305-6064. Consent is given on behalf of Special Collections as the owner of the physical items and is not intended to include or imply permission from the copyright owner. Such permission must be obtained from the copyright owner, heir(s) or assigns. See: https://library.stanford.edu/spc/using-our-collections Notes The Ted Nelson email archive includes some messages identified by the donor, or Stanford Libraries, as sensitive. These messages may contain financial, medical, legal, and other sensitive information. For this reason, 5,157 messages have been restricted according to federal and state guidelines, and Stanford Libraries policy, for up to 80 years. These email messages are not included in this release of the collection; they will be made available in 2095. Additionally, due to the potentially sensitive nature of their content, 2,721 messages are available only in the full-text version of the collection that is accessible in the Field Reading Room at Green Library. Please contact the host repository if you would like to request access to full messages, including any attachments. Enter Email messages in the ePADD Discovery Module have been redacted to ensure the privacy of donors and other correspondents. Please contact the host repository if you would like to request access to full messages, including any attachments. × Upload a banner image (11:3 aspect ratio) File Upload
epadd-stanford-edu-8065 ---- Working... No Status Toggle navigation Browse Collections Browse Repositories Search User manual User forum About ePADD Contact us × Alert OK × Success OK × Information OK × Warning OK × Error OK × Warning Cancel OK × Warning Cancel OK × Copy Cancel Copy Discovery | About this Collection Summary Institution UC Santa Cruz Repository Special Collections & Archives Collection ID MS 323 Collection Title Hayden White Papers Date Range 2004-10-09 to 2016-06-17 Messages:3,197 Sent by Owner:1,156 Attachments:722 Images:104 Documents:580 Others:38 Contact Email speccoll@library.ucsc.edu Finding Aid Catalog Record Hayden White Papers Enter Hayden V. White (1928-2018) was a literary critic and historical theorist. During his academic career, White made contributions to the study of narrative theory, historiography, and hermeneutics. A central thread of White's research throughout his career was questioning how historical events are constructed through writing and discourse. As a teacher and researcher, White held the distinguished title of University Professor in the University of California system, where he spent most of his career at the University of California, Santa Cruz. He also taught at the University of Rochester, Wesleyan University, University of California Los Angeles, University of California Berkeley, and Stanford University. Scope and Contents This collection contains a selection of emails sent and received by Hayden White between the years of 2005 and 2013. The emails contain conversations surrounding conference and presentation planning, publications, issues at UC Santa Cruz, and teaching of master classes (meister klasses) and other symposia at various universities. Also included are publication drafts by White and his colleagues, often with comments and annotations. White, his colleagues, and his students often shared articles and other texts over email to review and discuss. Major correspondents in this email collection include White's wife and UCSC Professor Margaret Brose, Mark E. Blum, Noah Benninga, Yasushi Xavier Tanaka-Gutiez, and Edward Dimendberg. Rights and Conditions Property rights for this collection reside with the University of California. Literary rights, including copyright, are retained by the creators and their heirs. The publication or use of any work protected by copyright beyond that allowed by fair use for research or educational purposes requires written permission from the copyright owner. Responsibility for obtaining permissions, and for any use rests exclusively with the user. For more information on copyright or to order a reproduction, please visit guides.library.ucsc.edu/speccoll/reproduction-publication. Notes Email messages in the ePADD Discovery Module have been redacted to ensure the privacy of donors and other correspondents. Please contact UCSC Special Collections & Archives if you would like to request access to full messages, including any attachments. The small amount of email files available were captured from White's hard drives. White did not regularly save his email correspondence, so email files were not collected from his email clients. Emails pertaining to finances, medical information, travel, employment, social media notifications, passwords, and other personal identifying information were removed from this collection. Enter Email messages in the ePADD Discovery Module have been redacted to ensure the privacy of donors and other correspondents. Please contact the host repository if you would like to request access to full messages, including any attachments. × Upload a banner image (11:3 aspect ratio) File Upload
eprint-iacr-org-6161 ---- Stake-Bleeding Attacks on Proof-of-Stake Blockchains Peter Gaži IOHK Email: peter.gazi@iohk.io Aggelos Kiayias University of Edinburgh & IOHK Email: aggelos.kiayias@ed.ac.uk Alexander Russell University of Connecticut Email: acr@cse.uconn.edu Abstract—We describe a general attack on proof-of-stake (PoS) blockchains without checkpointing. Our attack leverages transaction fees, the ability to treat transactions “out of context,” and the standard longest chain rule to completely dominate a blockchain. The attack grows in power with the number of honest transactions and the stake held by the adversary, and can be launched by an adversary controlling any constant fraction of the stake. With the present statistical profile of blockchain protocols, the attack can be launched given a few years of prior blockchain operation; hence it is within the realm of feasibility for PoS pro- tocols. Most importantly, it demonstrates how closely transaction fees and rewards are coupled with the security properties of PoS protocols. More broadly, our attack must be reflected and countered in any future PoS design that avoids checkpointing, as well as any effort to remove checkpointing from existing protocols. We describe several mechanisms for protecting against the attack that include context-sensitivity of transactions and chain density statistics. I. INTRODUCTION Proof-of-stake (PoS) blockchain protocols were envisioned as a solution to the immense energy demands of miner nodes in proof-of-work (PoW) based blockchain systems. PoS was proposed in discussions in the bitcoin forum1 and adopts the principle that the right to produce a new blockchain block should be awarded to a stakeholder with probability proportional to their current stake, as documented by the blockchain itself. Conceivably, such a blockchain discipline could yield desirable ledger properties without consuming significant real-world resources: no substantial energy expenditure would have to be invested to run the protocol. Such protocols would naturally replace the assumption of an honest majority of hashing power with the assumption of an honest majority of stake in the system. While the potential virtues of such PoS protocols are substantial, it was argued early on that the design of such schemes could be particularly challenging (see, e.g., [BGM14]) or perhaps even infeasible (see, e.g., [Poe14]). One particularly critical threat in the PoS setting was documented by Buterin [But14] who referred to it as the problem of “long-range attacks” (also related to the concept of “costless-simulation” in, e.g., [Poe15]). This refers to the ability of a minority set of stakeholders to execute the blockchain protocol starting from the genesis block (or any sufficiently old state) and produce a valid alternative history of the system. Confronted with such alternative history and no other outside 1See e.g., the post by user QuantumMechanic https://bitcointalk.org/index. php?topic=27787.0 and the ensuing discussion in 2011. information beyond the genesis block, a freshly joining node would have no ability to reliably distinguish between this alternate history and the actual history. It follows that with such an attack a minority set of stakeholders could double- spend or erase past transactions, violating the fundamental persistence property of the resulting ledger. In the same blog post [But14], however, a glimmer of hope was also provided: it was observed that the blockchains produced by such a minority set of stakeholders may have characteristics that could be used to distinguish them from the actual blockchain maintained by the honest majority. In particular, if timestamps are included in each block, it would be the case that a simple simulation of the protocol by a minority set of stakeholders would result in a blockchain that is more sparse in the time domain and, as a result, a longest chain rule at any particular moment would favor the blockchain produced by the honest parties. A number of PoS protocols were proposed and implemented, e.g., the PPCoin [KN12] and NXT cryptocurrencies [Com14]. Recent efforts have additionally begun to rigorously analyze security in the PoS setting, leading to protocols with formal guarantees such as Algorand [Mic16], Ouroboros [KRDO17], Snow White [BPS16], and Ouroboros Praos [DGKR17]. For the sake of the upcoming exposition, it will be useful to split these protocols into two classes:2 1) Eventual-consensus protocols that apply some form of a longest-chain rule to the blockchain. In this setting the immutability of a block increases gradually with the number of blocks created on top of it. 2) Blockwise-BA protocols that achieve the immutability of every single block via a full execution of a Byzantine Agreement (BA) protocol before moving on to production of any subsequent block. Of the above-listed PoS protocols, Algorand is a blockwise- BA protocol, while all the other protocols aim for eventual consensus. Looking ahead, our investigation proves relevant for the design of eventual-consensus PoS protocols; we mention Algorand here for the sake of comparison. All of these protocols had to confront the problem of long- range attacks, which was eventually understood to be even more serious than originally thought. The additional complication— aptly named “posterior corruption” in [BPS16]—observes that simply examining time stamps will not be sufficient for dealing with long-range attacks. In fact, an attacker can attempt to 2Note that we include only PoS protocols for which a a sufficiently detailed whitepaper exists, cf. Fig. 2. https://bitcointalk.org/index.php?topic=27787.0 https://bitcointalk.org/index.php?topic=27787.0 corrupt the secret keys corresponding to accounts that possessed substantial stake at some past moment in the history of the system. Assuming that such accounts have small (or even zero) stake at the present time, they are highly susceptible to bribery (or simple carelessness) which would expose their secret keys to an attacker. Armed with such a set of (currently low-stake) keys, the attacker can mount the long-range attack and in this case the density of the resulting blockchain in the time domain could be indistinguishable from the honestly generated public blockchain. To address the posterior corruption and other long range attacks, a number of mitigating approaches have been employed (sometimes in conjunction) and can be organised into three types: (i) Introduce some type of frequent checkpointing mechanism, that enables nodes to be introduced to the system by providing them a relatively recent block. (ii) Employ key-evolving cryptography [Fra06] that calls for users to evolve their secret keys so that past signatures cannot be forged, even when a complete exposure of their current secret state takes place. (iii) Enforce strict chain density statistics, where the expected number of participating players at any step of the protocol is known; thus alternative protocol execution histories that exhibit significantly smaller participation can be immediately dismissed as adversarial. Out of the above-mentioned PoS schemes, all eventual- consensus protocols (i.e., NXT, PPCoin, Ouroboros, Snow White, and Ouroboros Praos) employ the first mitigation strategy and assume some form of checkpointing. Ouroboros Praos employs the first and the second approach (key-evolving signatures) to additionally handle adaptive corruptions, while Algorand adopts the second and the third approach (strict chain density statistics) to the same end. It is worth appreciating the distinction between these methods to address posterior corruption and long range attacks. Checkpointing neutralizes the problem entirely by enabling nodes to ignore alternative chains that are not consistent with the most recent checkpoint known to the node. However, this comes with a significant model restriction: for any type of checkpointing to work, nodes must either be frequently online (so they adopt a recent checkpoint block they have received from the network as active participants) or receive reliable (trusted) information when (re)introduced to the system after a long period of being offline (or when they first join). This amounts to an additional trust assumption necessary for secure operation of the system, and as such is clearly undesirable in a decentralized, permissionless setting. Similarly, enforcing strict chain density statistics requires reliably estimating the number of participants at any stage of the protocol and is also model-restricting: the protocol will not be able to operate in an environment permitting an arbitrary number of parties to be invoked for execution. On the other hand, key evolving cryptography is a more algorithmic mitigation that comes with a minimal requirement on the model: nodes should merely have the ability to erase private state. Algorithmic mitigations seem clearly preferable to model-restricting ones whenever available. It is important to observe that key-evolving cryptography, the only algorithmic mitigation listed above, focuses specifically on the issue of posterior corruption; in particular, it is unclear if key evolution can thwart all possible long-range attacks. Thus, our work is motivated by the following question: Is key-evolving cryptography sufficient to prevent all possible long-range attacks, and in this way achieve PoS that does not need to rely on any model- restricting mitigations? A. Our Results We answer the above question in the negative by introducing a new class of long-range attacks against eventual-consensus PoS protocols, called stake-bleeding attacks. Stake-bleeding is an effective strategy for mounting a long-range attack that does not rely on posterior corruption; thus it cannot be prevented by key-evolving cryptographic techniques. The only requirement for the attack is that the underlying blockchain protocol allows transaction fees to be used as rewards for running the protocol, a standard feature in blockchain protocols to incentivize participation in ledger maintenance. The idea of the attack is as follows: an attacking stakeholder minority coalition launches a long-range attack that at the same time includes all transactions that have been posted in the honestly maintained public blockchain. Given that the fees from the transactions will be used to reward the ones that produce the blocks in some way, a large number of the transaction fees in the private attacker blockchain will be collected by the malicious coalition (fees originating from accounts that do not exist in the private chain would have to be forfeited). Assuming the blockchain system has run for a substantial period of time, it is conceivable that the accrued transaction fees will turn the attacking minority coalition into a majority that will be able to advance the private blockchain at a speed faster than the honestly maintained public blockchain. Due to the costless simulation nature of the long-range attack it would be possible to mount a stake-bleeding attack from an arbitrary point in the past (assuming checkpointing is either not used or extends sufficiently back into the past) and thus the attacking coalition could rewrite the history of transactions. We prove that the theoretical bound that the attacker would have to go back in the history of the PoS system to launch the attack is ≈ (2 − 4αA)/f where αA denotes the relative stake of the minority coalition and f is the relative fees that are made available per unit of time. Using the Bitcoin blockchain as a basis for a feasibility evaluation,3 on November 3th, 2017 the 1-day average of trans- action fees per block was 2.28BTC.4 The BTC in circulation on this same day are about 16.66 million,5 giving a relative fee rate of 1.36 · 10−7. It follows that, at the current rate, a hypothetical PoS blockchain with the same fee–currency profile as bitcoin would be of theoretical interest only. Nevertheless, with a 20-fold increase in total transaction fees per unit of 3Note that this is just for the sake of example as the Bitcoin blockchain is immune to long-range attacks. The point to consider is a hypothetical PoS- based blockchain that has the same statistical characteristics as the Bitcoin blockchain. 4https://www.smartbit.com.au/charts/transaction-fees-per-block 5https://blockchain.info/charts/total-bitcoins Attacker Relative Stake Years of Operation 0.1 11.11 0.2 8.33 0.3 5.55 0.4 2.77 Fig. 1: Years of blockchain history needed to launch a stake- bleeding attack assuming a minimum relative transaction fee volume of 2.73 · 10−7 per minute (a 20-fold increase based on recent (3rd of November 2017) values drawn from the Bitcoin blockchain) in a hypothetical PoS blockchain. time6 a stake bleeding attack would be feasible, requiring less than 6 years worth of history for a 30% attacker, cf. Figure 1. In particular, this indicates that stake-bleeding attacks must be a design consideration in the general threat model for long-lived PoS blockchain systems. We then consider possible mitigation strategies for stake bleeding attacks. First, one can observe that stake bleeding attacks would result in a private blockchain that initially exhibits a sparse block density in the time-domain that gradually increases. This may be atypical for honestly maintained blockchains and could be used as part of the chain selection rule. Nevertheless, a different mitigation that is much simpler to implement is to introduce context in each transaction: a context-sensitive transaction is a transaction that includes the hash of the blockchain at some recent prior point. It is easy to see that such transactions cannot be transferred to an alternative blockchain that is privately maintained by a malicious set of stakeholders. We note that this mitigation has been considered before for a different purpose; see [Lar13] where it was employed to prevent an attacker to transfer “coin- age-destroyed” to a secretly maintained blockchain. To conclude we illustrate a systematized presentation of long-range attacks, their requirements and the way they can be mitigated in Figure 2. We observe that stake bleeding attacks would adversely affect all currently proposed eventual- consensus PoS protocols if the checkpointing mechanism was removed. Therefore, it has to be taken into account in any future effort to remove the undesirable checkpointing mechanism from these protocols, as well as when designing new eventual-consensus PoS protocols that do not rely on checkpointing. Introducing context-sensitivity in transactions is a simple “algorithmic” mitigation mechanism that can thus be added to the design arsenal of PoS blockchain protocols in order to relax model assumptions such as negligible transaction fees or frequent checkpointing. II. PRELIMINARIES A. The Computational Model The stake-bleeding attack can be launched even in a generous computational model that affords many advantages 6Note that this does not necessarily mean that the fee per transaction need to increase; it would be sufficient for the blockchain system to process a larger number of transactions per unit of time. Actually a 20-fold increase (from 1MB to 20MB) was among various proposals that were vigorously debated in the period 2015-16, ultimately leading to a hard fork for the Bitcoin blockchain. For the original rationale behind the 20-fold increase see http: //gavintech.blogspot.co.uk/2015/01/twenty-megabytes-testing-results.html. to the blockchain protocol: • The adversary requires no control over message deliv- ery: the attack can be launched in a fully synchronous communication and computation environment, with all messages—including those generated by the adversary— delivered by reliable broadcast. • The adversary requires no dynamic corruptions: the attack can be launched by a fixed collection of adversarial parties determined at the beginning of the execution. • The adversary requires no introduction of new parties or deactivation of honest parties: the attack can be launched with a static population of fully participating parties. Below, we outline a simple, strong computational model reflecting the features mentioned above. The model is obtained by suitably strengthening the framework from [KRDO17], and is sufficient to support our attack. We emphasize that adopting such a strong model only broadens the applicability and strength of the attack, which can be launched in typical blockchain models that provide the adversary significantly more power [GKL15], [PSS17], [BPS16], [DGKR17]. a) Time, slots, and synchrony: We consider a setting where time is unambiguously divided into discrete units called slots; participating parties are equipped with synchronized clocks that indicate the current slot. The model additionally permits reliable, synchronous broadcast: each party may broad- cast, at the beginning of each time slot, a message which is then reliably delivered to all other parties by the end of the slot. b) Adversarial corruption: The model involves a fixed collection of participating parties U. An adversary A in our model is associated with a fixed subset of adversarial parties. We overload the symbol A to denote the subset of adversarial parties; the set of honest parties is denoted H. Honest parties are active at all times, receiving all messages sent by the other parties, and follow the protocol under consideration. The adversary is activated in each slot, and may arbitrarily direct the behavior of adversarial parties. Note that messages sent by adversarial parties are subject to the broadcast constraint—they are synchronously delivered to all honest parties. c) The INIT functionality; initial stake and transactions; the environment: The model is associated with an (idealized) initialization functionality INIT. The INIT functionality is parameterized by an initial stake distribution. This is an assignment of nonnegative numbers to the players which we write as S0 = ( (U1,s1), . . . , (Un,sn) ) . The functionality INITS0 operates as follows: • Prior to any computation of the parties, the functionality determines, for each party U ∈ U, a pair of public and private keys (pkU,skU ). • During the protocol, the functionality responds to a message from the user U of the form key with skU , the secret key skU of the user U. • During the protocol, the functionality responds to any message of the form genesis block with the “genesis block” B0 consisting of the initial stake distribution and the public keys associated with the users. The model introduces a further entity: the environment Z. In our setting, the environment is merely responsible for generating http://gavintech.blogspot.co.uk/2015/01/twenty-megabytes-testing-results.html http://gavintech.blogspot.co.uk/2015/01/twenty-megabytes-testing-results.html Fig. 2: Overview of long-range attacks, the associated attack requirements, possible mitigations and our results. The term “pure longest chain rule” refers to a chain selection rule that considers the length of the blockchain as the sole criterion. A mitigation is classified as algorithmic if it prevents the attack by hardening the protocol without weakening the model; it is model-restricting if it strengthens the model assumptions so as to put the attack outside of the model or to otherwise restrict the execution environment in a significant way that is incongruent with the intended operational setting of decentralised blockchain protocols such as Bitcoin. Note that Algorand is a blockwise-BA protocol, the other depicted protocols are of the eventual-consensus type. We include all PoS protocols for which a sufficiently detailed whitepaper exists (specifically, PPCoin [KN12], NXT [Com14], Algorand [Mic16], Ouroboros [KRDO17], Snow White [BPS16], and Ouroboros Praos [DGKR17]). Others such as Casper and Bitshares are not sufficiently well documented to include in the comparison.∗ ∗ Specifically, the description of Casper [BG17] merely provides a “finality” layer on top of a non-specified PoS system; regarding Bitshares [SL15], the whitepaper for distributed consensus to be found in http://docs.bitshares.org/bitshares/papers/index.html is not available (Checked March 4th, 2018) transactions, which are provided as inputs to the parties. In particular, in each round of the protocol, the environment may provide each party with a collection of transactions; these have the form (U,U′,s) which calls for the transfer of s stake from party U to party U′. (For our attack, it suffices to consider an environment as simply a fixed schedule of transactions delivered to the parties. Note that a typical blockchain security model would imbue the environment with significant further powers: an information channel to the adversary, adaptive choice of transactions, scheduling of message deliveries, etc.) Finally, given an initialization functionality INITS0 and an environment Z, an execution of a protocol consists of the genesis block B0, the secret keys of the parties, the sequence of transactions delivered to the players by the environment, and the entire sequence of messages broadcast by the players. B. Blockchains, Ledgers and Proof-of-stake Protocols a) Transaction ledger properties: A blockchain is a data structure which associates with each time slot (at most) one block. Individual blocks consist of a collection of transactions, in addition to protocol-specific metadata. In the context of the model described above, we assume that the genesis block B0 appears as a default initial block in any blockchain, associated with time 0. A chain also immediately induces a stake distribution, SC, given by applying the transactions in the chain to the stake distribution of the genesis block. For a blockchain C, we let Cb` denote the prefix of C obtained by removing the last ` blocks. Intuitively, a blockchain protocol Π permits a collection of parties to collectively maintain a common ledger. We will focus on protocols that, in fact, maintain an individual ledger for each party (at each point of time); the notion of a common ledger is guaranteed by appropriate persistence and liveness properties of the protocol Π: Persistence. Once a node of the system proclaims a certain transaction tx as stable, the remaining honest nodes, if queried, will either report tx in the same position in the ledger or will not report as stable any transaction in conflict to tx. Here the notion of stability is a predicate that is parameterized by a security parameter k; specifically, a transaction is declared stable (by a party with chain C) if and only if it appears in Cbk. Liveness. If all honest nodes in the system attempt to include a certain transaction, then after the passing of time corre- sponding to u slots (called the transaction confirmation time), all nodes, if queried and responding honestly, will report the transaction as stable. Intuitively speaking, a secure blockchain protocol Π guaran- tees that these properties are possessed by the ledgers (recorded in the blockchains) held by the honest parties, under appropriate constraints on the adversary A. b) Chain selection rules; the longest chain rule: We focus our attention on protocols defined by a chain selection rule: Each step of the protocol calls for certain players to broadcast a blockchain; players then apply a selection rule which may result in replacing their local chain with one of the broadcast chains. We focus on the “longest chain rule”: broadcast blockchains are checked for validity—a protocol- dependent property—following which the longest valid chain, including the one held by the player, is adopted. (Length is simply the number of blocks; for concreteness, we assume ties are broken lexicographically.) c) Proof-of-stake protocols: We focus on ledgers that are maintained via a proof-of-stake protocol Π, which confers the right to extend a chain to a party U with probability proportional to the party’s stake in (a prefix of) the chain. Stake-proportional growth. The probability of a party being allowed to extend a given chain C (an event denoted as ExtendOpportunityΠ) is proportional to the stake under control of this party according to SCb` , the stake distribution induced from Cb`. Here ` is a protocol-specific parameter typically related to the security parameter k discussed above. We are intentionally vague about the details of the proba- bility space in the description above, as this depends on the details of the underlying proof-of-stake protocol. Additionally, we ignore the issue of “persistence depth” in Theorem 1 below, simply setting ` = 0. Accounting for this would change the conclusion by an additive ` factor. d) Relative stake and honest majority: As a matter of notation, for a set of parties X and a stake distribution S, we denote by S(X) the stake held by the parties in X . At a particular moment in the execution of a blockchain protocol (often understood from the context), we let αX ∈ [0, 1] denote the relative stake of the parties in X . Specifically, this is the quantity SC(X)/SC(U) where C is the chain held by the honest users. (Note that due to the broadcast assumption, all honest players hold the same longest valid chain in each slot.) We say that an execution of Π has an honest majority if αA < 1/2 at every step of the protocol. e) Block rewards and transaction fees: Most blockchain protocols involve some form of block rewards and transaction fees. To be able to make generic statements about all the considered protocols, let us introduce the following notation: feesΠ(E, i) denotes the total fees (as a fraction of total stake) of all new transactions that were created by Z in the slot i of execution E. rewardsΠ(C, i) denotes the total amount of coins that were created by the protocol Π and given to the party creating the block in the blockchain C in slot i. transfersX→Y(C, i) denotes the total amount transferred from parties in X to parties in Y on the blockchain C in slot i. III. THE STAKE-BLEEDING ATTACK A. Attack Description We first informally describe how our attack operates in the context of a generic proof-of-stake blockchain defined by a protocol Π. To simplify the presentation, we assume throughout that the attacker controls some moderate proportion of stake αA < 1/2. The adversary A simulates the honest protocol Π and maintains a local copy of the current blockchain (denoted C) as prescribed by this protocol. Additionally, it also maintains an alternative blockchain Ĉ that is initially empty and is kept hidden from honest parties. The adversary checks in every time slot whether it is allowed to extend the chain C or Ĉ according to the rules of the protocol Π. It skips all opportunities to extend C, hence not contributing to its growth at all. On the other hand, whenever an opportunity to extend Ĉ arises, A extends Ĉ with a new block, and inserts into this new block all the transactions from the honest chain Ĉ that are not yet included in Ĉ and are valid in the context of Ĉ (or as many of them as allowed by the rules of Π). This entitles A to receive (on Ĉ) any block-creation reward and any transaction fees coming from the included transactions. As the protocol progresses, with overwhelming probability both C and Ĉ will be growing, with C growing more quickly. While the relative stake of A on C will possibly be decreasing due to the block-creation rewards granted to block creators in C, its relative stake on the chain Ĉ will be growing both due to the block rewards and transaction fees. Under some realistic assumptions on the relative sizes of the transaction fees and block rewards (that are spelled out in Section III-B), the adversarial relative stake in Ĉ will eventually exceed the honest relative stake in C. From this point on, the chain Ĉ grows faster (in expectation) than the chain C and eventually becomes longer. If Π uses the plain longest-chain rule that rejects blocks in the future, A can now easily violate the persistence of the ledger by publishing Ĉ, which will be adopted by all honest parties following Π. Moreover, if A adds a transaction to the end of Ĉ just before publishing it in which it transfers enough stake to honest parties to no longer control the majority, it will not violate the “honest majority” assumption as described in Section II-B. A more concise description of the adversary that executes our attack is given in Figure 3. The description uses a generic ExtendOpportunityΠ(C) predicate that is true whenever A is allowed to extend a given chain C according to the rules of Π. Additionally, length(C) denotes the length of the chain C from the perspective of the adversary. B. Attack Analysis The proof-of-stake protocol Π has to satisfy several prop- erties in order to be susceptible to the attack described in The adversary A maintains its view of the public chain C according to Π and its own, private chain Ĉ; both initially empty. A follows Π with the following exceptions: • Upon ExtendOpportunityΠ(C): Do nothing. • Upon ExtendOpportunityΠ(Ĉ): Extend Ĉ with a new block containing all transactions from C that are not yet in Ĉ and do not compromise the validity of Ĉ according to Π. Keep Ĉ private. • Upon length(Ĉ) > length(C): Transfer stake majority in Ĉ to H. Publish Ĉ according to Π. Adversary A Fig. 3: Adversary A against an eventual-consensus proof-of- stake protocol Π. Section III-A. The main requirements are: (i) No frequent checkpoints. The protocol Π must operate according to the longest-chain rule: out of all valid chains seen by the honest parties, Π prescribes them to adopt the longest one. While some deviations from this requirement are possible, Π must necessarily allow reorganizations long into the past: if a maximum depth of a reorganization is specified and small (i.e., an honest party is not allowed by Π to change its view of the main chain more than several blocks (or slots) into the past even if there was an otherwise-preferable candidate chain), then the attack is not applicable. (ii) Transaction fees. The protocol Π has to involve transac- tion fees, or more broadly, any transfers of coins from transacting parties to the parties maintaining the ledger. In greater detail, the attack only succeeds if Ĉ eventually grows faster than C. Since the growth speed of C (resp. Ĉ) is proportional to the relative stake of honest parties in C (resp. of the adversary in Ĉ), we need that the latter eventually exceeds the former. Observe that the relative stake of the adversary in Ĉ is increased in every slot i when it creates a block by: • the reward for this block rewardsΠ(Ĉ, i); • all transfers from honest to adversarial parties transfersH→A(Ĉ, i); • all the fees i∑ j=i′+1 feesΠ(E,j) for all slots j ≤ i that followed after the slot i′ containing the previous block in Ĉ. On the other hand, the relative stake of the honest parties in C is increased in every slot when a block is created in C by rewardsΠ(C, i) (not by any feesΠ, as all fees in C are paid by honest parties); and decreased by transfersH→A(C, i). We assume transfersA→H(C, i) = transfersA→H(Ĉ, i) = 0 . (iii) Context-oblivious transactions. The valid transactions produced according to Π need to be oblivious to the context in which they are to be used within the blockchain: Π must allow A to take transactions from C and use them in the different context of Ĉ. (iv) Validity of low-growth chains. The protocol Π has to support “sleepy majority” to make sure that the chain Ĉ, which is being extended only by a minority of stakeholders (and hence exhibits small chain growth at its beginning), is still considered valid according to the rules of Π. In the following theorem, we give an estimate of the number of slots that are needed to perform our attack, as a function of the initial adversarial stake αA and the amount of fees that are created in transactions in each slot. For the sake of simplicity, we analyze the case 1/3 < αA < 1/2 even though the attack works for any constant αA > 0 (see the remarks at the end of the section for the explicit bound). Theorem 1. Let Π be a proof-of-stake blockchain protocol with stake-proportional growth satisfying the conditions (i)- (iv) above. Consider an execution of the protocol Π with the adversary A given in Figure 3. Assume that transfersH→A(C, i) = 0 , rewardsΠ(C ′, i) = 0 , and feesΠ(E, i) ≥ f are satisfied in execution E for both C′ ∈ {C,Ĉ} and all i > 0. Let 1/3 < αA < 1/2 denote the initial relative stake of the adversary A. Let T denote the slot in which length(Ĉ) > length(C) occurs. Then we have E[T ] ≤ 3 − 6αA f and T will be tightly concentrated around its expectation. Proof: Let αC ′ P [i] for P ∈ {A,H}, C ′ ∈ {C,Ĉ} and i > 0 denote the relative stake of the set of players P in chain C′ in slot i (recall that A and H denote the adversary and the honest parties, respectively). Additionally, let lengthi(C ′) denote the length of the chain C′ in slot i from the perspective of the adversary. Then the inequality E[lengthT (Ĉ)] > E[lengthT (C)] translates (due to the stake- proportional growth assumption) to T∑ i=1 αĈA[i] > T∑ i=1 αCH[i] . (1) Since rewardsΠ(C′, i) = 0 and the fees in C are all paid (and received) by honest parties, we have αH := αCH[i] = 1 −αA for all i > 0 and hence T∑ i=1 αCH[i] = T(1 −αA) . To lower-bound the sum on the left-hand side of (1), define T1 (respectively T2) to be the minimum slot that satisfies αĈA[T1] ≥ αH (respectively α Ĉ A[T2] ≥ 2αH −αA). Since the relative stake αĈA grows by at least f per slot 7 (as A includes all 7We commit a slight imprecision here by neglecting that the actual stake only grows after the transactions are included in a block, however this has no noticeable impact on our argument. transactions from C into Ĉ), we get αA + (T1−1)f ≤ 1−αA (and similarly for T2), which gives us T1 ≤ 1 − 2αA f + 1 and T2 ≤ 2 − 4αA f + 1 . (2) Note now that αĈA[i] can be lower-bounded by αĈA[i] ≤ αA for i < T1 , 1 −αA for T1 ≤ i < T2 , 2 − 3αA for i ≥ T2 . Therefore, (1) will be satisfied for any T that satisfies αA(T1 − 1) + (1 −αA)(T2 −T1) + (2 − 3αA)(T −T2 + 1) > (1 −αA)T . (3) Using (2) and solving for T gives us the desired bound. The concentration follows from the fact that the length of both C and Ĉ at some slot i are determined by a sum of independent random variables for each slot 1 ≤ j ≤ i. We note that we weakened the statement of Theorem 1 in several ways in order to simplify the presentation of its proof. First, we focus on 1/3 < αA < 1/2 as otherwise the event defining T2 would never occur. Nonetheless, it is easy to see that while our attack benefits from higher (sub-50%) initial adversarial stake, it can be performed also with αA < 1/3 with a slightly modified analysis. Second, Theorem 1 assumes zero block rewards and transfers from H to A. However, recall that transfersH→A(C, i) are completely controlled by the environment, subject only to the restrictions described in Section II-A. (This is to capture that the security of the blockchain protocol does not rely on any particular assumption regarding the transactions that are to be stored in the ledger; rather it must operate securely for any such sequence of transactions.) Hence, for any rewardsΠ(C, i), a situation where the same analysis applies can be simply achieved by setting transfersH→A(C, i) so that the honest stake ratio in C remains constant (as the adversarial stake ratio in Ĉ will keep increasing). On the other hand, non-zero rewardsΠ(Ĉ, i) only make the attack succeed faster. Finally, observe that we are quite pessimistic in the analysis, lower-bounding the values αĈA[i] as if they were not changing except in the slots T1 and T2. By a more careful accounting one can obtain a better bound T ≈ (2 − 4αA)/f. C. Implications for Existing PoS Protocols We now summarize to what extent are the preconditions described in Section III-B satisfied by various PoS protocols, both those coming from academic literature and real-world deployments, implying that stake-bleeding would be a consid- eration for them. We focus primarily on eventual consensus protocols, nevertheless we make a note on the applicability of our attack concept to the blockwise-BA setting.8 All of the eventual consensus protocols employ some form of checkpoint- ing, presumably to prevent posterior corruption attacks; this 8Note that we include only PoS protocols for which a a sufficiently detailed whitepaper exists, cf. Fig.2. general countermeasure prevents the stake bleeding attack (and any other long-range attack) as well in a trivial (and model- restricting) manner. Interestingly, if we remove checkpointing, all of the considered eventual consensus constructions would be susceptible to our attack, as they all satisfy the conditions (ii)- (iv) from Section III-B: they admit transaction fees, their transactions are context-oblivious, and low-growth chains are considered valid. In more detail we have the following. NXT and PPCoin. The NXT protocol only allows to reorga- nize the last 720 blocks, hence forming a so-called moving checkpoint and violating condition (i) from Section III-B. A similar checkpointing mechanism is employed in PPCoin [KN12]. Snow White. The Snow White protocol [BPS16] also uses moving checkpoints to prevent the posterior corruption attack, and would also be susceptible to the stake bleeding attack without it. Ouroboros [KRDO17] uses moving checkpoints as a part of its maxvalid chain-selection rule, neutralizing long- range attacks. Without checkpointing, Ouroboros would be susceptible to both posterior-corruption and stake-bleeding attacks, as it does not employ key-evolving cryptography. Ouroboros Praos [DGKR17] uses the same maxvalid chain- selection rule as Ouroboros, imposing moving checkpoints. Without this countermeasure, Ouroboros Praos would still neutralize posterior corruption attacks thanks to its use of key-evolving signatures for signing blocks; however, it would be susceptible to our stake bleeding attack. Algorand [Mic16], as already discussed, is not an eventual- consensus protocol, but rather follows the blockwise-BA approach. Nonetheless, one can consider the applicability of the core idea of the stake bleeding attack to Algorand, aiming for creating an alternative sequence of blocks and exploiting stake bleeding to gain temporary majority of stake there. However, in the case of Algorand this attack is prevented by requiring a sufficient fraction of stakeholders to certify the outcome of each BA, which can be seen as violating the requirement (iv) in Section III-B. In fact, Algorand enforces a strict participation rule and hence it can always find the correct protocol execution, in a model-restricting fashion. As already indicated, the above results imply that any attempt to remove model-restricting assumptions from these protocols needs to put into play, at minimum, some counter- measure against the stake bleeding attack. We discuss these in the final section. IV. MITIGATIONS A natural way to remedy our attack is to modify the protocol Π to violate at least one of the requirements given in Section III-B. Doing this for requirements (i) or (ii) would lead to the trust assumption of a checkpointing service or to another model-restricting limitation bounding the transaction fees throughout the protocol execution to insignificant amounts. We hence rather focus on two alternative, algorithmic mitigations, aiming to violate the requirements (iii) and (iv). a) Minimum Chain Density in the Time-Domain: A first observation that can be used to mitigate a stake bleeding attack is that a blockchain that is produced by the attack of Section III-A has a period over which the density of the blockchain is rather sparse. We clarify the concept of density next: in all PoS protocols, it is allowed that some of the parties may not be online all the time (despite the fact that they are elected to participate in the protocol). The absence of their participation is something that can be detected by observing the blockchain. For instance, in the case of Ouroboros [KRDO17], there will be a number of “slots” that are left empty without a corresponding block; analogous observable quantities exist in the other protocols as well. This allows the protocol to detect and weed out blockchains with this deficiency that distinguishes them from the correct blockchain produced by honest parties. We do not pursue this direction further here. b) Context Sensitive Transactions: A fundamental feature of a stake bleeding attack is taking a transaction “out of context” so to speak, i.e., copying it from the honestly maintained blockchain to the private blockchain maintained by the attacker. A very simple and effective way to prevent this from happening is to include “context”, i.e., the hash of a recent block, into each transaction. This idea has been discussed in the PoS setting at least as early as Larimer’s work in [Lar13] (see also [Lar18]) who introduced it to ensure that an attacker’s secret chain cannot take advantage of honest parties’ transactions to increase the total “coin-age“ value of the secret-chain they maintain (as “coin-age-destroyed” was a suggested mechanism for PoS that was proposed there). Here we use it for a different objective: to prevent transaction fees to “bleed” to the malicious parties over a period of time in a private chain. Using context sensitivity, the validity of a transaction would require the presence of that hash in the blockchain. This would only allow adversarially generated transactions to be transferable to the private blockchain, hence completely neutralizing the attack (as there would be no “bleeding” of honest stake anymore in the private blockchain). We remark that a seemingly similar mitigation has been proposed in [BPS16], Section 2.2.2, to resolve a different issue where an attacker attempts to fork the blockchain in order to collect transaction fees that have been issued in the last few blocks produced by the honest participants. The mitigation suggested requires the transaction to include a recent block index and is insufficient to protect against stake-bleeding. In contrast, context-sensitivity as defined in this section requires the transaction to include the hash of a recent block. V. CONCLUSIONS We have presented a new class of long-range attacks, called stake-bleeding attacks, that are applicable to all investigated eventual-consensus PoS protocols when operated without any model-restricting assumptions. A stake-bleeding attack would require years of blockchain history to be successful given the current statistical profile of cryptocurrencies and hence they are not of immediate concern. Nevertheless, they point to an important design consideration from the cryptographic perspective. They show how it is possible to mount a long- range attack without relying on posterior corruptions, in fact without exploiting adaptivity of corruptions whatsoever. From this it is also easily inferred that key-evolving cryptography by itself is not a sufficient mitigation for long-range attacks and it is important to investigate additional algorithmic mitigations that thwart long rage attacks in trustless, permissionless environments without the resorting to checkpointing or other model-restricting assumptions. ACKNOWLEDGMENT. Aggelos Kiayias was partly supported by Horizon 2020 research and innovation programme, project PRIVILEDGE, under grant agreement No 780477. Alexander Russell was partly supported by the National Science Foundation under Grant No. 1717432. REFERENCES [BG17] Vitalik Buterin and Virgil Griffith. Casper the friendly finality gadget. CoRR, abs/1710.09437, 2017. [BGM14] Iddo Bentov, Ariel Gabizon, and Alex Mizrahi. Cryptocurrencies without proof of work. CoRR, abs/1406.5694, 2014. [BPS16] Iddo Bentov, Rafael Pass, and Elaine Shi. Snow white: Provably secure proofs of stake. Cryptology ePrint Archive, Report 2016/919, 2016. http://eprint.iacr.org/2016/919. [But14] Vitalik Buterin. Long-range attacks: The serious problem with adaptive proof of work. https://blog.ethereum.org/2014/05/15/ long-range-attacks-the-serious-problem-with-adaptive-proof-of-work/, 2014. [Com14] The NXT Community. NXT whitepaper. https://bravenewcoin. com/assets/Whitepapers/NxtWhitepaper-v122-rev4.pdf, July 2014. [DGKR17] Bernardo David, Peter Gaži, Aggelos Kiayias, and Alexander Rus- sell. Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake protocol. Cryptology ePrint Archive, Report 2017/573, 2017. http://eprint.iacr.org/2017/573. To appear at EUROCRYPT 2018. [Fra06] Matt Franklin. A survey of key evolving cryptosystems. Int. J. Security and Networks, 1(1/2), 2006. [GKL15] Juan A. Garay, Aggelos Kiayias, and Nikos Leonardos. The bitcoin backbone protocol: Analysis and applications. In Elisabeth Oswald and Marc Fischlin, editors, EUROCRYPT 2015, Part II, volume 9057 of LNCS, pages 281–310. Springer, Heidelberg, April 2015. Updated version at http://eprint.iacr.org/2014/765. [KN12] Sunny King and Scott Nadal. Ppcoin: Peer- to-peer crypto-currency with proof-of-stake. https://peercoin.net/assets/paper/peercoin-paper.pdf, August 2012. [KRDO17] Aggelos Kiayias, Alexander Russell, Bernardo David, and Ro- man Oliynykov. Ouroboros: A provably secure proof-of-stake blockchain protocol. In Jonathan Katz and Hovav Shacham, editors, CRYPTO 2017, Part I, volume 10401 of LNCS, pages 357–388. Springer, Heidelberg, August 2017. [Lar13] Dan Larimer. Transactions as proof-of-stake. https://bravenewcoin. com/assets/Uploads/TransactionsAsProofOfStake10.pdf, Novem- ber 2013. [Lar18] Dan Larimer. Delegated proof-of-stake consensus. https:// bitshares.org/technology/delegated-proof-of-stake-consensus/, ac- cessed 21.3.2018, 2018. [Mic16] Silvio Micali. ALGORAND: The efficient and democratic ledger. CoRR, abs/1607.01341, 2016. [Poe14] Andrew Poelstra. Distributed consensus from proof of stake is impossible. https://download.wpsoftware.net/bitcoin/old-pos.pdf, May 2014. [Poe15] Andrew Poelstra. On stake and consensus. https://download.wpsoftware.net/bitcoin/pos.pdf, March 2015. [PSS17] Rafael Pass, Lior Seeman, and Abhi Shelat. Analysis of the blockchain protocol in asynchronous networks. In Jean-Sébastien Coron and Jesper Buus Nielsen, editors, EUROCRYPT 2017, Part II, volume 10211 of LNCS, pages 643–673. Springer, Heidelberg, May 2017. [SL15] Fabian Schuh and Daniel Larimer. Bitshares 2.0: Gen- eral overview. https://bravenewcoin.com/assets/Whitepapers/ bitshares-general.pdf, December 2015. http://eprint.iacr.org/2016/919 https://blog.ethereum.org/2014/05/15/long-range-attacks-the-serious-problem-with-adaptive-proof-of-work/ https://blog.ethereum.org/2014/05/15/long-range-attacks-the-serious-problem-with-adaptive-proof-of-work/ https://bravenewcoin.com/assets/Whitepapers/NxtWhitepaper-v122-rev4.pdf https://bravenewcoin.com/assets/Whitepapers/NxtWhitepaper-v122-rev4.pdf http://eprint.iacr.org/2017/573 http://eprint.iacr.org/2014/765 https://bravenewcoin.com/assets/Uploads/TransactionsAsProofOfStake10.pdf https://bravenewcoin.com/assets/Uploads/TransactionsAsProofOfStake10.pdf https://bitshares.org/technology/delegated-proof-of-stake-consensus/ https://bitshares.org/technology/delegated-proof-of-stake-consensus/ https://bravenewcoin.com/assets/Whitepapers/bitshares-general.pdf https://bravenewcoin.com/assets/Whitepapers/bitshares-general.pdf Introduction Our Results Preliminaries The Computational Model Blockchains, Ledgers and Proof-of-stake Protocols The Stake-Bleeding Attack Attack Description Attack Analysis Implications for Existing PoS Protocols Mitigations Conclusions References
eprint-iacr-org-7873 ---- Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems Sarah Azouvi University College London, Protocol Labs George Danezis University College London, Facebook Novi Valeria Nikolaenko Facebook Novi ABSTRACT Winkle protects any validator-based byzantine fault tolerant con- sensus mechanisms, such as those used in modern Proof-of-Stake blockchains, against long-range attacks where old validators’ sig- nature keys get compromised. Winkle is a decentralized secondary layer of client-based validation, where a client includes a single additional field into a transaction that they sign: a hash of the previ- ously sequenced block. The block that gets a threshold of signatures (confirmations) weighted by clients’ coins is called a “confirmed” checkpoint. We show that under plausible and flexible security assumptions about clients the confirmed checkpoints can not be equivocated. We discuss how client key rotation increases secu- rity, how to accommodate for coins’ minting and how delegation allows for faster checkpoints. We evaluate checkpoint latency ex- perimentally using Bitcoin and Ethereum transaction graphs, with and without delegation of stake. ACM Reference format: Sarah Azouvi, George Danezis, and Valeria Nikolaenko. 2020. Winkle: Foil- ing Long-Range Attacks in Proof-of-Stake Systems. In Proceedings of ACM Advances in Financial Technologies: AFT’20, , October 21–23, 2020 (New-York ’20), 13 pages. https://doi.org/10.1145/nnnnnnn.nnnnnnn 1 INTRODUCTION A number of blockchains are considering proof-of-stake mech- anisms in place of proof-of-work, attracted by faster and deter- ministic finality as well as lower energy costs. In proof-of-stake blockchains a set of validators run a consensus protocol between themselves and agree on the next block of ordered transactions by collectively signing the block. Such protocols rely on the long- term security of validators’ signature keys and a compromise of validators’ past keys threatens full auditability through Long-Range Attacks [11]. A long-range attack is considered successful if an adversary was able to create an alternative chain of transactions, starting with the same genesis block, that can not be distinguished from the real chain. A number of solutions have been proposed to foil long-range attacks such as publishing checkpoints off-chain in software updates or in a reputable archive (such as the front page of a national newspaper). Those solutions are difficult to deploy without introducing a highly unsatisfactory vector of centralization. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. New-York ’20, October 21–23, 2020, © 2020 Association for Computing Machinery. ACM ISBN 978-x-xxxx-xxxx-x/YY/MM...$15.00 https://doi.org/10.1145/nnnnnnn.nnnnnnn Validator key rotations help alleviate the problem, assuming secure destruction of older keys. However, validators might have auxiliary incentives to sell their old keys to an adversary, espe- cially when real-world identities of validators are unknown in a permissionless system and reputation is not at risk. When dishonest behaviour of a validator becomes rational, real-world security of the whole system is at great risk. We notice that corrupting a signif- icant number of coin holders, even after they have no more stake in the system, is far more challenging as they are much more numer- ous than validators (we justify this assumption in Section 4). This observation brings us to introducing Winkle — a novel mechanism that leverages votes from clients creating a decentralized secondary layer of client-based validation to confirm checkpoints (snapshots of the blockchain) and to prevent long-range attacks on proof-of- stake protocols. The voting mechanism is very simple: each client augments their transaction with a single additional field — a hash of a previously sequenced block. Once this transaction gets signed by the client and submitted to the chain, it serves as a vote or a confirmation for a block weighted by the number of coins the client holds under their account. The block that gets a threshold of con- firmations is called a “confirmed” checkpoint. We show that under plausible and flexible security assumptions confirmed checkpoints can not be equivocated and serve as irreversible snapshots of the blockchain. Our contributions. We design Winkle to strengthen consensus protocols with dynamically changing validators against long-range attacks (Sec. 2-3). Though Winkle can secure other systems as well, it is mainly applicable to blockchains based on Byzantine Fault Tolerant (BFT) consensus such as PBFT [29], LibraBFT [33], Tender- mint [7], HotStuff [35], or SBFT [20]. Our solution does not require unincentivized validators to remain honest. Instead, Winkle allows each coin holder to augment a transaction with a vote for a previ- ous block. We prove that after a critical mass of coins has voted for a block, the block becomes a “confirmed checkpoint” and can- not be equivocated even if validators who worked on constructing this block have leaked their keys to the adversary. Furthermore, in systems protected by Winkle, an adversary enacting a long-range attack and building a forking chain cannot freely replicate transac- tions from honest users since those commit to checkpoints on the real chain. In systems with probabilistic finality (not typical proof- of-stake systems) this mechanism also gives protection against replay attacks as was previously observed in [15]. We give plausible and flexible security assumptions (Sec. 4), showing trade-offs between the fraction of byzantine accounts and the quorum size. We notice that the assumptions are far more flex- ible than the byzantine bounds in the BFT protocols, e.g. if the disconnected users constitute a negligible fraction, the quorum size in Winkle can be just slightly above the bound on the byzantine accounts. Our assumptions are also tuned to key rotations, allowing https://doi.org/10.1145/nnnnnnn.nnnnnnn https://doi.org/10.1145/nnnnnnn.nnnnnnn New-York ’20, October 21–23, 2020, Sarah Azouvi, George Danezis, and Valeria Nikolaenko accounts to recover following a compromise. We put up a defini- tion for the long-term security of the validator-based consensus protocol (Sec. 5) and prove that Winkle satisfies the definition over- coming challenges of weighted-by-stake voting in the presence of constantly moving weights. We introduce a delegation mechanism, where less active accounts can delegate their stake to more active accounts, in order to facilitate faster confirmation of checkpoints (e.g. a cold wallet could delegate to a hot wallet). We discuss how to safeguard minting of coins. Finally, we simulate Winkle on the real-world datasets of Bitcoin and Ethereum and evaluate check- pointing delays with and without delegates (Sec. 6) showing that the block can be confirmed within several hours to a few days, allowing validators to safely leak their old keys after a few days of use. We discuss related work, other applications and future research directions (Sec. 7-9). 2 BACKGROUND AND RESEARCH QUESTION An account-based blockchain model. A blockchain maintains an evolving decentralized database that keeps track of the owner- ship of assets, and allows their transfer according to rules encoded in transactions. We represent the database, at any consistent point, as a key-value store, which maps account addresses to account states: DB = {(Aj,statej) | j = 1,2, . . . ,N}, where Aj ∈ {0,1}256 is the account address, statej ∈S is the value under the account, N is the number of accounts. The account state holds the following values: - pk: public key for signature verification, - seq: an incrementing sequence number, that prevents replay attacks, - value: number of coins, that maps to the “voting power”. The account’s state may also hold other meta-data or auxiliary in- formation. To simplify notation we write DB[A] to denote account A’s state and use field notation to represent its values: DB[A].pk, DB[A].seq, DB[A].value. We denote by DB.N the number of ac- counts in the database and by DB.Stot the total number of coins, both numbers may be changing with the modifications to the data- base, i.e. when accounts and coins get created or destroyed. Transactions. The database evolves, from one consistent state to the next, via processing transactions. A transaction (tx) is comprised of the following data: - sender: the address of the transaction’s sender, - seq: sequence number that should match the sender’s account seq plus one, - program: an efficiently computable deterministic function that mutates the state of the database, i.e. program(DB)→ DB′, - σ: a cryptographic signature over the previous fields. To clarify exposition we represent those values as tx.sender,tx.seq, tx.program, tx.σ . Furthermore, we assume that we can derive from tx.program a list of accounts that receive coins, denoted as tx.raddrs, and corresponding amounts. In this work we principally consider programs associated with asset transfers implementing a monetary system, relevant to cryptocurrencies, but we also allow transactions mutating other meta-data of user accounts (e.g. for key rotation and delegation introduced later). Validator Based Consensus with Reconfiguration. We abstract a Validator Based Consensus with Reconfiguration (VBCR) as a mechanism that provides a chain of collectively signed blocks on which consensus has been reached. In this work a block refers to a long sequence of transactions (e.g. a day of activity or an epoch of a different duration), rather than a short-term block within the low-level consensus protocol. The first block (genesis block) determines the initial state of the database: B0 = DB0. A chain of blocks (B1,B2, . . .) modifies the state of the database. Each block Bi for i > 0 is of the form Bi = [hi−1,Ti,σi], where hi−1 is the hash of the previous block, i.e. hi−1 = H(Bi−1); Ti is an ordered list of transactions and σi is a signature over (hi−1,Ti). Given a genesis state DB0 and the chain of blocks, we define recursively DBi = Ti(DBi−1). Here DBi is a result of application of programs in transactions’ list Ti one by one in a given order to DBi−1. The system is governed by the consensus protocol run between the validators. The validator set is determined by the set of veri- fication keys: V = {pkk} |V | k=1 . Each signature key skk is private to k-th validator. We assume there is a function gov(·)on the previous block (or the genesis block initially) 1 , that returns the current set of validators: Vi = gov(Bi−1). Typically, we consider the signature σi in the block Bi = [hi−1,Ti,σi] as being valid if a certain threshold of validators Vi = gov(Bi−1) have contributed to the aggregate signature σi . For each block Bi we define a function seq(·) which returns the height of the block namely the number of blocks preceding it up to the genesis block B0, the function implicitly takes the chain of blocks as input. By convention, we use a subscript of the block to denote the height, e.g. i = seq(Bi). Chain validation. A public verification function validate(·, ·) de- fines a predicate that takes a chain of blocks as a first argument and a new block as a second argument: validate(B,Bi+1). The output in- dicates whether the block Bi+1 can be successfully chained with the previous blocks B = (B0, . . . ,Bi). The predicate encodes the busi- ness logic of the state machine describing the blockchain. A chain of blocks B = (B0,B1, . . . ,Bi) is valid if either B = (B0) or recur- sively computed predicate is true, i.e. ∀i > 0 validate(B,Bi)= true. Auditing any chain of blocks B, would start at block B0, append the blocks one-by-one and test the validity of the chain incremen- tally. The predicate validate checks validators’ signature on the new block, checks transactions’ signatures within the new block and applies transactions one-by-one to the database state, checking the sequence numbers to prevent replay attacks. In more details, taking as input B = (B0, . . . ,Bi) and Bi+1, the predicate assumes that ∀j ≤ i validate((B0, . . . ,Bj−1),Bj) = true and H(Bi−1) = hi . Let the state of the database after applying all the transactions from the chain of blocks B in sequence be DBi . Let Bi+1 = [hi,T,σ]. First, the validators’ public keys are retrieved from the previous block: pki+1 = gov(Bi), the signature σ is verified under that key: verify(pki, (hi,T),σ). If the verification fails, verify outputs false and halts, otherwise it continues. Transactions are processed from the list T = (t1, . . . ,tk) in order. Let DB 0 i = DBi and for j = 1, . . . ,k we verify that: (1) the sequence number is equal to the value under 1 In the VBCR abstraction block’s boundaries capture events of validators’ set change, as those are relevant to long-range attacks. Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems New-York ’20, October 21–23, 2020, the account plus one: tj .seq = DB j−1 i [tj .sender].seq+1, (2) the sig- nature tj .σ verifies under the public key stored under the sender’s account (DBj−1i [tj .sender].pk), (3) additional checks can be applied to validate the transaction depending on the business logic of the blockchain, encoded in the transaction program. If any of the trans- actions fail at least one check then the procedure returns false and halts. If transaction tj passed the checks successfully, it gets applied to the database to advance it’s state: DBji = tj .program(DB j−1 i ), the sequence number under the account is incremented by one. If the transaction was not applied successfully, the procedure outputs false and halts. Safety of VBCRs. We say that the chain validation audit is safe if and only if any two parties that successfully completed the chain validation procedure would have a consistent view of the chain of blocks (i.e., the chains will be equivalent or a chain of one party will be a subchain of another party’s chain). Definition 2.1. (Perpetually honest validator) A perpetually hon- est validator follows the protocol and maintains the secrecy of their signing keys in perpetuity (the adversary may never have access to them), and only signs a single block at each height. If a sufficient number of validators are perpetually honest in keeping all their keys (gov(Bi)) unknown to the adversary in per- petuity, then the verification procedure ensures audit safety. Long-Range Attacks on VBCRs. The safety of chain validation audit described depends on validators being perpetually honest. This imposes a heavy burden on the security of the validators’ signature keys: they need to remain secret forever, otherwise the validity of the sequence cannot be safely audited. This motivates us to define Eventually compromised validators as follows: Definition 2.2. (Eventually compromised validator) An eventu- ally compromised validator after a block Bi , leaks all its previous signature keys {ski′ | 0 < i ′ < i} to the adversary. Any VBCR protocol becomes unauditable under eventually com- promised validators. For block Bi and any block Bi′ in the history of Bi (i′ < i), eventually the adversary will compromise sufficient number of validators and sign an alternative block to follow Bi′ with a different set of transactions, defeating the Audit Safety prop- erty. This problem is referred to in the literature as a long-range attack, and Winkle strengthens Validator Based Consensus with Reconfiguration systems against those types of attack. We note that the assumption that eventually compromised validators provide all signing keys before height i represents a strong adversary, and subsumes any adversary that may have access to a subset of past keys instead. The compromise of the old keys in BFT or proof-of- stake consensus protocols is particularly devastating as creating an alternative chain is computationally inexpensive. 3 THE WINKLE MECHANISM Definitions. Without losing generality we assume that the set of validator keys may change at each block. Each block defines a checkpoint that coin holders can vote to confirm in the future, as illustrated (see Fig. 1). A checkpoint is a binding commitment to a chain of blocks sequenced by the VBCR: ckpti = H(B), where B is the last block the checkpoint points to. We abuse the notation and define the height written as a subscript of a checkpoint as being equal to the height of a block it is committing to. In turn this height defines a global order on all checkpoints referring to a sequence of blocks produced by a secure VBCR. We call two checkpoints ckpti , ckptj consistent if they commit to blocks Bi , Bj such that Bi is an ancestor of Bj (we write ckpti < ckptj)) or vice versa. Checkpoints that are not consistent commit to blocks that are on different sides of a fork and therefore cannot be part of a sequence produced by a safe VBCR. We assume everybody agrees on the genesis checkpoint: ckpt 0 = H(B0). 3.1 Basic Winkle scheme Checkpoint voting. Each account may vote for a checkpoint by including it in a signed transaction, and every coin carries the vote of its sender (we call this the propagation rule). The vote is also associated with the remaining value in the account. For example, if an account A1 has 10 coins and sends 1 coin to an account A2 with a vote for checkpoint ckpt, then there is a system-wide vote with weight of 10 for checkpoint ckpt: 9 of which is associated with A1 and 1 associated with A2. This also means that an account could have different votes for different coins held, e.g., if A2 received one coin from account A1 with a vote for ckpt and one coin from another account A3 that voted for a previous checkpoint ckpt′, then A2 carries one vote for ckpt and one vote for ckpt′. Whenever A2 sends a new vote, then all of the coins in the account will be counted towards that new vote, and the previous votes are over-written. An account sending a transaction has to vote on the latest available checkpoint, otherwise its transaction will not get sequenced. As we show, there cannot be any two inconsistent checkpoints within one account due to new chain validation rules. More formally, we define a weighted vote as a tuple wVote = (ckpt,w), where ckpt is a checkpoint and w is a real positive number. We augment transactions and accounts with additional information: (1) we augment each transaction tx with a parameter tx.vote that we call a checkpoint vote: tx.vote = ckpt; (2) we change the structure of the database: for each account A in place of value DB[A].value we now store a set of weighted votes DB[A].votes. Accounts managed by honest and active users follow some con- straints: (1) all their votes are for pairwise consistent checkpoints; and (2) each of their transactions always contains a vote for the latest available checkpoint. Condition (2) introduces a synchrony assumption, however this should not represent a bottleneck: first of all, we assume blocks are abstractions of long periods of consensus under the same set of validators (e.g. many hours or days); and, second, clients need to be aware of the latest checkpoint since they anyway need to know the latest validator set (from the previous block). The set is required in order to know which entities to direct transactions to, and also to be able to authenticate reads from the latest state of the database. Chain validation. We augment the predicate validate executed on input B = (B0, . . . ,Bi) and Bi+1 with an additional check on each of the transactions in block Bi+1 (see the ‘Chain Validation’ rules in Section 2). Each transaction txj in Bi+1 for j = 1, . . . must contain a vote on ckpti , where ckpti = H(Bi). If the transaction passes the New-York ’20, October 21–23, 2020, Sarah Azouvi, George Danezis, and Valeria Nikolaenko B0 . . . Bi−1 Bi Bi+1 . . . ckpt 0 ckpti−1 ckpti ckpti+1 pk 0 pki−1 pki pki+1 Figure 1: Each block commits the full sequence of previous blocks, and forms a potential checkpoint that clients vote to confirm. Validator membership and keys may change across blocks (but not within them). Block Bi is signed by the key pki−1 = gov(Bi−1), and the key defined in pki = gov(Bi) signs Bi+1. checks, given the previous set of the database DBj−1i (DB 0 i = DBi) the next state of the database is the same, except for the following changes. (1) For each of the receiving accounts A ∈ txj .raddrs that obtain some amount v with transaction txj , if the vote is already in the set: (txj .vote,w) ∈ DB j−1 i [A].votes for some w then v gets added to the weight w of the existing element, otherwise a new tuple (txj .vote,v) is added to the set DB j−1 i [A].votes. (2) For the sending account A: tx.sender = A, the set DBj−1i [A].votes gets squashed into a single element (txj .vote,v), where v is the sum of all the values in the set DBj−1i [A].votes minus the value sent in the transaction txj . We define the highest confirmed checkpoint as a function HighestCkpt(DB) computed over all accounts in a database DB. It represents the highest checkpoint ckptk (k ≤ i) which precedes the checkpoint votes of q fraction of accounts’ (weighted), i.e.∑ A∈DB wVote∈ DB[A].votes I(wVote.ckpt ≥ ckptk) · wVote.w ≥ q×DB.Stot The indicator function I(wVote.ckpt ≥ ckptk) takes value 1 if the vote is for a checkpoint higher than k and consistent with ckptk , and otherwise takes value 0. The highest confirmed checkpoint of the database: HighestCkpt(DB) is the one with the largest height that is supported by a fraction q of the total stake. Validator-free full audit. To validate a confirmed checkpoint, as- sociated with a sequence of transactions T leading to it, a client performs the following steps: the client starts the validation pro- cess at the genesis state DB0, which needs to be known and to be authentic. The client then applies each transaction in the sequence in order, recomputes the state of the database and recomputes the HighestCkpt(·) function, according to votes in each account, to determine the confirmed checkpoint. The client accepts the highest confirmed checkpoint. We show that this audit process ensures safety, in the sense that the confirmed checkpoint returned is guaranteed to be consistent with the state of the honest chain (i.e. the chain of transactions built from the genesis state up to the confirmed checkpoint is guaranteed to be exactly the same as in the honest chain). However, it does not guarantee freshness, in the sense that the checkpoint returned may not be the highest one in existence. Clients can query multiple sources, and pick the highest confirmed checkpoint. Determining the latest confirmed checkpoint is especially impor- tant to determine the latest set of validators currently maintaining the consensus protocol. Once the current set of validators is se- curely determined their (valid for some period) signatures can be used to track updates of the database state starting from the highest known confirmed checkpoint. Validation of the chain built prior to the known confirmed checkpoint does not involve any checks of validators’ signatures. 3.2 Delegation The basic Winkle mechanism requires a mass of account holders to vote for a checkpoint to become the highest confirmed checkpoint. Our experiments (see Section 6), suggest that many accounts within existing blockchains are dormant, and therefore would seldomly vote. In turn this leads to checkpoints being confirmed in months (up to three years for Bitcoin), during which the system is vulner- able to validator old key compromise. To reduce this latency we introduce a simple delegation model. An account may be created with a ‘delegate’ field DB[A].delegate referencing the address of another account Ad with no delegate field. This indicates that the voting power of account A is dele- gated, and therefore contributes, to the weight of account Ad . This mechanism only allows for a single level of delegation. Accounts that delegate still need to include a vote for the latest block when they transact. When computing the highest confirmed checkpoint, only the most recent vote of either the account that delegates or its delegate is counted (i.e., the stake of accounts that delegate are counted only once, either with the delegate or independently if their transaction is more recent than the delegate’s vote). Accounts that delegate may change their choice of delegate through a trans- action. When an account changes its delegate, it also includes a vote and thus our propagation rule stays the same. For security, we assume that honest users delegate to honest delegates only. Note that Winkle compared to the delegated proof-of-stake systems re- quires weaker trust assumptions from the clients. Clients need to trust the delegates which simply confirm checkpoints and are not running consensus protocol between themselves, any client can act as a delegate in Winkle and is not required to setup complex infrastructure in contrast to nodes running consensus. Moreover, the number of delegates can be much higher than the number of validators and each user is free to delegate to itself if he/she does not trust other delegates. Voting accounts act as pools, for accounts that delegate. When pools vote often on behalf of dormant accounts, we expect check- points to be confirmed faster. To further speedup check-pointing a system of economic incentives may be set up to encourage pools to vote often, as well as for other accounts to delegate to those that do—all while preventing over-concentration of stake. Economics of pools & decentralization. A key issue with dele- gation is the tendency towards centralization: delegating votes to Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems New-York ’20, October 21–23, 2020, well operated pools is simpler for a user than voting themselves (which requires sending transactions). At a logical extreme, one pool may emerge with a large amount of voting power, which may later have its key compromised and used to perform long-range attacks. To disincentives such concentration of voting power we use crypto-economic ideas from [6] and design an incentive scheme that should maintain close to a constant number of pools in the system. We define as U > 1 a parameter to affect target number of pools we wish to incentivize in the system. Each pool incurs some fixed cost for operating, which we denote as Ei for pool i. Ei represents the operational pool cost, since it must be online to execute trans- actions and vote in an epoch, as well as an additional fee each pool must provide the system per epoch to vote. We denote as si the weighted vote delegated to a pool i, and as S the total vote weight in Winkle. For each pool i we define its incentive weight as wi = min(si, q·S U ). The value q is the fraction of the vote necessary to confirm a checkpoint. We assume that during an epoch of length T time units some monetary value is set aside to reward users and pools that vote to confirm this checkpoint. We define the rate of reward per unit time for each coin in an epoch as d. When a checkpoint is confirmed we observe which fraction of q votes contribute to its confirmation. We split and assign the total reward, of total value d ·T ·S, to each pool i proportionately to its incentive weight wi . Taking into account the costs advertised by each pool, its ‘profit’ for an epoch it contributed to confirming is: Ri = wi q ·S d ·T ·S −Ei = wi q d ·T −Ei However, if the pool did not contribute a vote to confirm the epoch, then the reward is zero – and for simplicity we assume that the cost Ei for this epoch is also zero. Assuming that a pool manages to participate in a fraction a′ of confirmations then its expected reward per epoch is: R̄i = a′ q wi ·d ·T −a ′ ·Ei During each epoch any reward that is not distributed to pools is kept to reward future epochs (increasing future d values). We assume that each pool keeps a fee Fi for itself, and then distributes the remaining Ri − Fi to the pool participants as an incentive to remain in the pool, according to their contribution in terms of weighted votes. If a pool does not contribute to the vote we assume it does not keep any fee or distributes any incentive to participants. We now determine a number of properties for the incentive scheme above. We assume that both pool operators and users are honest – in that they follow the Winkle protocol correctly – but are however rational in their choice of pools. We therefore stress (in line with recent thinking [2, 16]) that the incentive mechanism is there to protect honest users against perverse incentives creating a more brittle system, rather than argue that the incentive mechanism prevents malicious users from participating (such an argument is impossible without considering external incentives they may have to do so, with potentially unbounded rewards). Equilibrium impliessi ≤ q·S/U . Our first argument is that a user does not have incentive to participate in a pool with voting weight larger than q ·S/U , and in fact a pool operator also has no incentive to operate such a pool. This is a straight forward implication of the incentive weight wi being capped at q · S/U : any additional votes contributed to the pool have a zero marginal rate of return for the pool, and a negative rate of return for users (since distribution of the user incentives Ri −Fi is done per contribution to the pool with no cap). A rational user will always have incentives to defect from a pool with voting weight larger than q ·S/U to a pool with equivalent characteristics Ei , Fi and a ′ with a lower voting weight. Therefore in an equilibrium allocation of user voting weights to pools it must be that si ≤ q · S/U . As a result for the remaining of our analysis we consider that wi = si ≤ a · S/U . The lack of incentive to operate larger pools is a key part for our argument that there will be about U/a pools in the system (the second part involves bounding the number from below). Delay to confirm an epoch. For a pool to participate and vote it should expect at the very least a positive return. Since a vote for a later block also counts as a vote for earlier ones, a pool may chose to vote seldomly to reap high rewards per action. We would instead like pools to vote on each block to ensure blocks are quickly confirmed: To generate a positive return on a single block it should hold that: a′ q wi ·d ·T −a ′ ·Ei ≥ 0, therefore T ≥ q d · Ei si . As the cost Ei of participating as a pool increases, so does the minimum time a pool will wait before it votes in order to guarantee a positive return. On the other hand, the larger the voting power si (subject to the upper bound above) the lower the delay in voting to generate a return. This dynamic establishes a lower bound on the pool delay in voting. Competitive pressures also bound the delay in voting from above. Pools observe the concentration of voting power amongst pools (or their delay in voting). They have to compete to be within the fraction q of voting power to confirm a block in order to generate any returns. Therefore no pool has an incentive to vote any later than the time a fraction q of voting power would have incentives to vote, since it would risk not being included in the reward for the confirmed blocks. Characteristics of pools. Let’s calltm the maximum time at which the fastest set of pools (in terms of Ei and si above) comprising a fraction q of the voting power have incentives to vote. Any pool that finds it unprofitable to participate before this time will be excluded from the rewards systematically, and therefore will receive a zero return (its value a′ will tend to zero). This establishes a couple of constraints in terms of the size of the pools and their costs to operate: Assuming a pool expects to make a rate of return superior to the fee Fi , it must hold that: a′ q si ·d ·Tm −a ′Ei ≥ Fi This constrains the fee pools can charge in relation to their voting power and costs. Obviously the higher the costs they incur the lower the fee; and the larger their voting power the higher the fees New-York ’20, October 21–23, 2020, Sarah Azouvi, George Danezis, and Valeria Nikolaenko they can charge. This dynamic creates an upwards pressure on the size of pools. In fact small pools are simply not viable subject to the constraint (by rewriting the bound above): si ≥ q a′ Fi +a ′Ei d ·Tm Even by setting a fee at Fi = 0, and making no profit, small enough pools are not viable due to the fixed costs to participate Ei . Further, all other things being equal users always have incentives to delegate to larger pools, since those will make more profit and therefore provide a potentially higher rate of user incentive. This competitive pressure will ensure that we expect pools not only to be capped from above to si ≤ q ·S/U but also from below, leading the system to having S/q pools of roughly equal size at equilibrium. Competitions for user voting power. Pools have endogenous incentives to keep their costs Ei down, since any surplus can be turned into a larger profit Fi . Therefore if a pool has the options to lower its cost it will. We assume that the system should require a minimal payment of E to participate as a pool per epoch to ensure those costs do not become zero. However, pools also compete for users, since it is user voting power that ultimately determines their voting power si . Users can change their delegates, and we assume that they will move to pools offering larger user incentives in terms of better rates of return per vote weight delegated. The rate of return for a user delegating one vote to pool i is: ui = R̄i −a ′Fi si = a′ q d ·T −a′ ( Ei +Fi si ) A pool can maintain an equal return to its users by either decreasing its fee Fi or by attracting more users’ voting power to the pool. In a competitive setting users will change their delegation to pools offering higher returns. Therefore at equilibrium, for two pools the rate of return per vote must be equal (ui = uj) for users to not switch. Assuming two pools within the faction that confirms blocks with likelihood a′ = q. Equality of rates of return reduces to the constraint: sj/si = (Ej +Fj)/(Ei +Fi), where each of the pools can control only its own profit F , and can try to attract more user votes s. Attracting more user votes allows a pool to increase F , but the only tool available for doing so is increasing the rate of return per user vote which involves decreasing F (subject to fixed costs E). This puts a downward pressure on the fee F . Finally, for two pools with equal user vote share s = si = sj , it holds that the difference in fees that they are able to charge is: Fi − Fj = (Ei − Ej). Any fee differences are related to the difference in operational and pool participation costs. Therefore if one pool defects from a cartel and charges lower fees, all others will have to charge low fees, subject to their respective costs to ensure they provide a comparable rate of return to users, and to avoid them defecting. This dynamic supports a competitive ecosystem of pools. In order to propose a pool, the leader must deposit some stake, which will be the basis of the voting power in that pool. Given our assumption that the distribution of stake among stake holders is more decentralized than among validators (which we justify in section 4), there cannot be one entity that controls an important number of pools (even though one stake holder could potentially control more than one pool). 3.3 Minting and Stake Bleeding Attacks Another type of a long-range attack are Stake Bleeding Attacks [17]: an adversary, in a forking chain, may accumulate the rewards as- sociated with creation of new blocks in order to inflate its stake until it accumulates enough to confirm an inconsistent checkpoint. To protect against such attacks we require every minting event to take effect only after the block containing it gets confirmed as a checkpoint. Different Proof-of-Stake blockchains use different reward and minting mechanisms, and some also contract the monetary supply. For example, there can be a minting key capable of creating new coins, this key does not have to stay honest and secure in perpe- tuity. Since our mechanism guarantees that without minting an alternative forking block can not be accepted as a checkpoint, even if the old minting key is leaked to the adversary, the alternative minting transaction will never take an effect, as it will have to get checkpointed by the old money supply. The amount of money allowed to get minted or destroyed at a time does not have to be limited as long as the fraction of stake in hands of the adversary remains bounded as per our assumptions (see Section 4). 3.4 Key Rotation and Account Healing Accounts are controlled by signature keys. Key rotation operations shorten the lifetime of keys and prevent obsolete keys from issu- ing new transactions. However, this does not prevent a variant of long-range attacks on Winkle: an adversary that gains access to an account’s old signature key that has been already rotated to a new key, may still use the stolen key to create past transactions, interfering with the safety of Winkle’s audit. It is prudent to expect that any long term active account at some point may fail to protect a historic key. In the purely static compromise model this account would have to be considered under the control of the adversary for ever after, it is then likely that eventually the volume of stake under the control of such accounts would exceed any fractional threshold, threatening the security of Winkle. Therefore we adopt a more appropriate model where an adversary may compromise an account’s key, but after the key is rotated may lose control over the account. Such an adversary may also compromise some old key that is not being currently active. An account holder A may include a special key rotation transaction t within block Bi , updating the public key associated with the account to pk′. The transaction is signed with the public key associated with the account (namely DBi[A].pk). Following the transaction t being applied, the database associates a new public key with account A. We show, in our proof, that Winkle benefits from key rotations. In cases when some historic account key is compromised, but subse- quent keys included in a confirmed checkpoint are not, the account does not have to be considered as contributing to the voting weight that the adversary commands to mount a long-range attack there- after. This provides a forward security property, which we call account healing. Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems New-York ’20, October 21–23, 2020, 4 SECURITY ASSUMPTIONS Eventually Compromised Validators. In our model, we assume that all validators are eventually compromised, and share their keys with the adversary after a confirmed checkpoint has been generated by Winkle. (In Section 6 we evaluate how long each block awaits to become a confirmed checkpoint). The honest chain or database is created by validators while they are honest and an adversarial chain is created by the adversary after the keys have been leaked. Without loss of generality we aggregate all validators into a single validator and we let the concrete instantiation of the consensus protocol to determine the number of validators, the exact form of keys, signatures and the conditions on their validity. Honesty of accounts. Winkle leverages honest account holders for security. We assume account holders are harder to compromise than validators because there are more numerous. For example in Bitcoin, according to our experiments, as of September 2019 there are 889 accounts that hold one third of the total stake (see Fig. 3) compared to four miners that control more than half of the hashrate [5]. Accounts are of four types, and their type may change over time: - active and honest (fA) accounts are connected to the true chain, they receive the latest checkpoint before the next checkpoint be- comes available, - byzantine (fB) accounts share keys with the adversary and arbitrarily deviate from the protocol, - eclipsed (fE) accounts get eclipsed from the honest chain during the long-range attack and may transact on the adversarial chain while the adversary does not control their keys, - dead (fD) accounts that do not transact during the attack and stay idle. Each account belongs to only one category, therefore the fractions representing each category add up to one fA + fB + fD + fE = 1. Those fractions are calculated at the boundary of the blocks, i.e. for any checkpoint ckpt we consider the corresponding state of the database DB and look into the fraction of accounts of each type in DB. As explained later, the fractions are weighted by the amount of stake the accounts hold in database state DB. Winkle operates by accounts voting for checkpoints, which are commitments to blocks in the VBCR. Denote by q the fractional voting power (the quorum) required to create a checkpoint. For safety of the system, the eclipsed accounts and the adversarial accounts should not constitute enough voting power to create a forking chain: fE + fB < q. For liveness byzantine and active users together should constitute a quorum: fA + fB ≥ q (we assume byzantine nodes participate in the honest chain but also equivocate to participate in an adversarial fork). The three equations above can be satisfied in multiple ways, giving a trade-off between liveness and safety of the system. At a high level we want to minimize the voting power needed to advance the checkpoint: q → min and we want to maximize the number of byzantine and/or eclipsable nodes that the system can tolerate: fB, fE → max. We now discuss different solutions to this system. Typical BFT. In BFT systems typically the trade-offs are chosen in the following way: q = 2/3, fA = 1/3 +δ, fB = 1/3 −δ, fE = 1/3 (where δ represents a single user’s fraction). More precisely: N = 3f + 1: q = (2f + 1)/N ; fA = (f + 1)/N ; fB = fE = f /N ; fD = 0. Note that this solution also leads to quorum intersection, where any two q quorums are guaranteed to intersect at some honest node. The solution also maximizes the portion of eclipsable users. Generic trade-off. The BFT assumption is very strong: the adver- sary needs to compromise 1/3 of all the coin holders and eclipse 1/3 of coin holders from the network and make them believe the adversarial fork. It is based on the assumption that the network is adversarial and may separate honest users. In practice, it is quite unlikely that a user will connect to the chain through a fully adver- sarial network, and account holders are far more likely to query multiple validators about the state of the chain. So it is far more difficult to eclipse the accounts from the network [32], therefore we can lower the bound on the eclipsed accounts and get a generic trade-off between the number of byzantine users and the quorum size as illustrated by the yellow-filled area on Fig. 2. The selected points illustrate: Typical BFT solution (point “BFT”, Fig. 2); the relaxed requirement on the quorum size: fB = 1/3 −δ, q = 1/2, fA = 1/2+δ, fE = 1/6 (point #1, Fig. 2); and the increased resilience to byzantine users (assuming those are not incentivised to break liveness): fB = 2/3 −δ, q = 2/3, fA = 1/3 +δ, fE ≈ negl (point #2, Fig.2). Weighting accounts by value. To prevent Sybil attacks, where an adversary creates many empty accounts in order to gain control over more than fB fraction of accounts at no cost, we weight ac- counts by the amount of coins that they hold — which we call stake. For the rest of the paper when we talk about accounts’ fractions (e.g. fB, q), we implicitly assume that those accounts are weighted. Fig. 3 illustrates the number of keys protecting a given fractions of stake for both Bitcoin and Ethereum blockchains: 2/3 of stake in Bitcoin is protected by 14,800 keys and same fraction of stake for Ethereum is protected by 800 keys (snapshot taken on 2019-08-01). Note that the flexibility of the assumption may be used to enlarge the bound on byzantine stake fB thus increasing the number of keys required to be compromised in order to mount the long-range attack. Limiting transfers. Due to transactions being processed the set of users and their stake is in constant flow. The adversary can potentially manipulate this flow in its fork and accumulate more than fB stake in its chain, for example, by including all transactions where it is the recipient but no transactions where it is the sender of coins. To mitigate this risk we additionally assume that at any state of the honest database the adversary controls at most fy of accounts and that the amount of stake moving during any given block is at most fx of the total amount of stake in the system. We then choose fy + fx/2 = fB to make sure that the adversary can not accumulate more than fB coins in his fork (see Section 5 (Lemma 5.3)). For example we could choose fy = 1/4 and fx = 1/6 or fy = 1/6 and fx = 1/3 depending on the power we wish to give to the adversary. For reference, based on measurements on Ethereum, one sixth of the money moves in roughly a week (3 days in Bitcoin) and one third in two weeks (one week for Bitcoin). This is consistent with the block time frames we consider. New-York ’20, October 21–23, 2020, Sarah Azouvi, George Danezis, and Valeria Nikolaenko Figure 2: Generic trade-off between the fraction of byzantine users and the quorum size. Figure 3: The number of keys holding a given fraction of stake in logarithmic scale. Minting. Note that the adversary is only allowed to control fyS stake, where S is the total amount of stake in the system. But once the minting transaction takes an effect and increases the amount of stake to S′ = S + M, the adversary is allowed to control more stake: fyS ′ > fyS. In our mechanism we require that minting happens only after the minting intent gets checkpointed: suppose that the minting intent was issued in block Bi and the block Bi got checkpointed in block Bj , where j > i, then the total stake increases from S to S′ starting in block Bj+1. This means that by the end of block Bj , in state DBj , the adversary is still only allowed to hold at most fyS stake compromised. Delegation. Lastly, our protocol allows for the delegation of stake. In this case, we assume that honest users always delegate to hon- est pools. This strong assumption is necessary to ensure that no adversarial pool leader can control more than fy fraction of stake in a block. Additionally, let’s recall that since Winkle depends on the difficulty of compromising coin-holders, we need to ensure that enough pools are created (this is done using an appropriate delegation scheme as shown in our analysis in Section 3.2). 5 SECURITY DEFINITION AND ARGUMENT We provide a game-based definition for the security of Winkle that closely mimics the interactive nature of the attacks. Without losing generality we assume that there is a single validator, and that they use a fresh key to sign each new block. The adversary may adaptively compromise the users’ accounts even retrospectively, but can not hold more than fy of accounts’ keys (and stake) at any given block, we define this requirement formally below. The adversary can submit transactions to be included in the next block and if the next block advances the confirmed checkpoint, then the adversary gets all the validator’s keys prior to this newly confirmed checkpoint. The adversary wins if it outputs a forking chain of blocks, whose tip, B∗, generates a confirmed checkpoint inconsistent with the honest chain. We now put the game into more formal terms. Definition 5.1. A validator based consensus with reconfiguration VBCR is secure against eventually compromised validators if for any genesis state B0 and for any polynomially bounded challenger who holds all the secret keys in the system and outputs valid answers for adversarial queries, for any probabilistic polynomial-time adversary A , there is a negligible function ν(λ) such that Pr(EXPVBCR,A(λ)= 1) ≤ ν(λ), for λ ∈N. The experiment EXPVBCR,A(λ) is defined as the interaction with a challenger, where the challenger is comprised of two algorithms: key retrieval GetKey and next block creation NextBlock, these are stateful algorithms that implicitly take the chain built up to this point as an input. GetKey(A,i,B) outputs the account key: let DBi be a state of the database built using the first i blocks of B, sk ← DBi[A].sk, Q = Q ∪{(i,A,sk)}, output sk. NextBlock(T∗i ,B) creates and outputs the next block and the secret keys of the validators used prior to the highest confirmed checkpoint: let the next block include adversarial transactions Bi ← [hi−1,Ti ||T∗i ,σ], output Bi and the validator’s keys:{skt <HighestCheckpoint(Bi).seq} EXPVBCR,A(λ)experiment runs as follows starting with an empty state = ∅ and i = 0: 1. the adversary queries the keys for block Bj with j ≤ i and cre- ates transactions to inject: (T∗i ,state)←A GetKey(·,(B1, ···,Bi)) 1 (Bi−1,state), 2. the adversary gets the next block: Bi := NextBlock(T∗i ,state), 3. the adversary decides if his forgery is ready: (b,state) ← A2(Bi,state), 4. IF b = 1, THEN i ← i + 1 and GOTO (1), Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems New-York ’20, October 21–23, 2020, 5. B∗ ←A3(state) and output 1 iff HighestCkpt(B∗) is inconsis- tent with Bi and in the adversarial queries Q the total amount of stake in control of the adversary never exceeds fy . Theorem 5.2. The validator based consensus with reconfiguration VBCR as defined in Section 2 is secure against eventually compro- mised validators as per Definition 3. Informally, the adversary plays the following game: Adversary Challenger B0,i = 1 ←−−−−−−−−−−−−−−−−−−−−−−−−−−−−− A,i′ < i −−−−−−−−−−−−−−−−−−−−−−−−−−−−−→ DBi′[A].sk ←−−−−−−−−−−−−−−−−−−−−−−−−−−−−− Ti −−−−−−−−−−−−−−−−−−−−−−−−−−−−−→ Bi = [hi−1,Ti ||T∗i ,σ] {skvt <HighestCheckpoint(Bi).seq } ←−−−−−−−−−−−−−−−−−−−−−−−−−−−−− B∗ −−−−−−−−−−−−−−−−−−−−−−−−−−−−−→ i += 1 Lemma 5.3. For any fraction f , if an adversary is only allowed to compromise keys that control at most f fraction of coins in each of the two states of the database DB1 and DB2 = T(DB1) (here DB2 is the result of applying the sequence T of transactions to DB1) and T moves at most p amount of stake between the keys, then for any sub-sequence of transactions T∗ ⊆ T the amount of stake in hands of the adversary in DB∗ = T∗(DB1) is at most f +p/2. Proof. Suppose in DB1 the adversary controls f − ∆ of coins for some ∆ ≥ 0. Suppose that in the sequence of transactions T adversarial addresses send S amount of coins and receive R amount of coins. To accumulate the maximum amount of stake in T∗, the adversary needs to include transactions it receives and to drop transactions that it is sending out. Therefore the adversary will be able to accumulate at most maxamount = (f − ∆)+R. We consider two different cases. In the first case let’s assume that the adversary receives less than ∆ stake: R ≤ ∆, then we trivially have maxamount ≤ f ≤ f +p/2. In the second case we assume R > ∆. Let’s write R = ∆ + δ for some δ > 0. In DB2 the adversary cannot hold more than f and thus we have: (f − ∆)+ (∆ + δ) − S ≤ f . Which in turns implies δ −S ≤ 0, adding (∆ +δ) to both parts equivalently get (*) ∆+ 2δ ≤ S+∆+δ. Since no more than p stake can move in T, we have R+S ≤ p, therefore (**) ∆ +δ +S ≤ p. Inequalities (*) and (**) gives us that ∆ + 2δ ≤ p or equivalently δ ≤ p−∆ 2 (***). Now going to maxamount, we have: maxamount = f −∆+∆+δ = f +δ ≤ f + p−∆ 2 ≤ f + p 2 by (***). And hence maxamount ≤ f +p/2, therefore the adversary cannot obtain more than f + p/2 in its sub-sequence of transactions T∗. □ Proof of Theorem 5.2. Suppose that the adversary has won the game and successfully produced a forgery B∗, s.t. ckpt∗ := HighestCkpt(B∗) is inconsistent with Bi . Denote the latest com- mon ancestor block of B∗ and Bi as Bparent. The adversary has the validator’s key for Bparent to sign the conflicting descendant block creating a fork. By definition of the checkpoints at least q of weighted accounts in the adversarial chain has voted for ckpt∗ or some later one. We prove that this event contradicts at least one of our assumptions. We do so by first considering a very simple variant of our system (Case 1) and incrementally adding additional features (i.e. key rotations, minting, delegation) (Case 2-4). Recall some of the important details of Winkle’s design described in Sections 3: - Assumption 1: more than 1 − fy keys are safe in the beginning of the block (the key is safe if all the keys under that account are not compromised within the block), - Assumption 2: at most fx stake moves within a block, - Assumption 3: every transaction is included in some honest block only if it votes for the latest checkpoint (the previous most recent block). We also assume that fy + fx/2 = fB. Case 1. We first consider a simplified variant of our system with no key rotations (accounts never rotate keys and new account are not created), no delegation (no accounts have delegates), no minting (new coins are never minted, the only coins in the system are those created in B0). Denote the first pair of diverging blocks Bparent+1 and B∗ parent+1 . By design of the system (assumption 3), transactions can be se- quenced in the block only if these transactions vote on the previ- ous immediate block, thus only a subset of transactions from non- adversarial accounts in Bparent+1 can be replayed in the fork as only those sign Bparent as a checkpoint, moreover these transactions can only get placed in the block B∗ parent+1 . No other transactions from the honest chain can be replayed in the adversarial fork. Having that under Assumption 1 the adversary can control at most fy keys and eclipse at most fE keys and by Assumption 2 in block Bparent+1 at most fx of stake moves, by applying Lemma 5.3, we get that there are no subset of transactions of the honest block Bparent+1 such that if they are applied to DBparent more than fE + fy + fx/2 = fE + fB of weight gets concentrated jointly under the compromised and eclipsed accounts in the resulting state of the database. Thus since fE + fB < q the adversary will be able to get more than q fraction of stake and thus will not be able to create a new checkpoint on a forking chain. Therefore the forgery is not possible and more- over the eclipsed users can distinguish an adversarial chain from a true chain by the fact that new blocks do not become confirmed checkpoints on an adversarial chain. Case 2: Case 1 + key rotation. We now prove the theorem in the presence of key rotations. Let’s recall that our assumption in that case is that 1− fy of the accounts are safe between two checkpoints, meaning that none of the keys from those accounts are ever leaked to the adversary during any given block. Let’s assume that the adversary has corrupted fy accounts within block Bparent+1 that we note (A1, · · · ,Ay). To corrupt new account, (A′ 1 , · · · ,A′y′), account A ′ i has to perform a key rotation operation in block Bparent+2 otherwise this account would be considered unsafe in block Bparent+1 as well, making the number of unsafe accounts go above the allowed threshold fy . Due to assumption 3, the key rotation for account A′i will include a vote for Bparent+1, making it impossible to replay this key rotation transaction in the adversarial New-York ’20, October 21–23, 2020, Sarah Azouvi, George Danezis, and Valeria Nikolaenko B0 B1 . . . Bparent Bparent+1 . . . Bi B∗ parent+1 . . . B∗ Figure 4: Illustration of an adversarial fork in an attempt to perform a long-range attack fork. With a similar argument, accounts (A1, · · · ,Ay) have to per- form a key rotation in block Bparent+1 (otherwise these accounts would not be safe in block Bparent+2). This ensures the adversary cannot control more than fy in any block since it cannot accumu- late corrupted accounts from multiple blocks (see Figure 5 for a visual illustration). In block Bparent+2 the adversary has the choice of using the new corrupted keys (A′ 1 , · · · ,A′y′) which include the key rotation of accounts (A1, · · · ,Ay)or ommit all the key rotations and keep account (A1, · · · ,Ay) corrupted in the adversarial chain but none of the (A′ 1 , · · · ,A′y′) accounts. In both cases the same ar- gument as in Lemma 5.3 can be made and the maximum amount that the adversary can now hold is still fy +p/2 as the conditions on money spent or received from either accounts are similar. The proof from case 1 is thus still valid. [pkA1 → pkA2,B0]σA . . . [pkB1 → pkB2,B1]σB . . . Block B1 Block B2 Figure 5: The adversary that knowspkA1 andpkB2 cannot use both keys in its forking chain because the second key rota- tion includes a commitment to block B1 which include the first key rotation, healing the compromised key. Case 3: Case 2 + delegation. We now prove the result in the case where delegation is enabled. As a reminder, in the case of dele- gation, we assume that honest users delegate to honest delegates (assumption 4). Additionally, we require that each delegate is active (as they are incentivized to be). The adversary cannot control more than fy in the honest chain by assumption 1 and 4 and cannot receive more than fx/2 of the coins by a similar argument as in Lemma 5.3. The main difference between the previous case is that now, eclipsed users may vote on the adversarial chain, but have their delegate vote on the honest chain and thus equivocate. Even in that case, under the assumption that no more than fE users are eclipsed, we still have that the adversary can get at most fB + fE < q of the vote in its chain. Similarly as in case 2, if the adversary was to corrupt a previously honest delegates, then they will have to make a key rotation that includes a vote for the latest checkpoint, preventing the adversary, as before, from accumulating stake over many blocks. Case 4: Case 3 + Minting. We now prove that an adversary cannot obtain more than fy of the stake in its chain even when money can be minted. As explained in Section 3, the minting transaction is only effective once the block that contains it has been checkpointed. We will thus refer to the mint transaction as a mint-intent transaction. If the minting key has been leaked to the adversary, the adversary can include in its chain a mint intent that creates money for itself. However as per Cases 1-3 of this proof the adversary cannot check- point the alternative minting intent using the old stake. Though the adversary can not create a minting transaction of its own it can potentially take advantage of omitting the minting transaction which we explore next. Note that the adversary is only allowed to control fyS stake, where S is the total amount of stake in the system. But once the minting transaction takes an effect and increases the amount of stake to S′ = S +M, the adversary is allowed to control more stake: fyS ′ > fyS. We now show that the adversary can not leverage this fact, omit the minting transaction and hold compromised more than fyS of stake in its forking chain. Indeed, suppose that the minting intent was issued in block Bi and the block Bi got checkpointed in block Bj , where j > i. If the adversary tries to omit the checkpointing of the minting intent, it has to modify block Bj or an earlier one and therefore can not include any of the transactions from the subsequent blocks B>j of the honest chain, but only those later transactions (e.g. key rotations) actually allow the adversary to compromise more stake, if the adversary can not leverage those, it can not accumulate more than fyS stake. In more details, after the minting intent got checkpointed the adversary can either keep the same accounts compromised (and receive more money on it) or compromise new accounts. In the first case, the additional stake that the adversary receives in order to own more than fyS of the stake must happen after Bj and thus, by assumption 3, this stake includes a vote for checkpoint Bj . This bounds the adversary to mint new coins. Thus if the adversary wants to increase its stake it has to include the minting transac- tions and cannot inflate its relative stake. Similarly, if the adversary compromises new accounts after Bj , then by assumption these new accounts need to be safe at state Bj and thus have operated a key rotation after checkpoint Bj . This is because otherwise these ac- counts would be unsafe in the previous block which contradicts our assumption. Thus these new accounts that the adversary compro- mises also have to include a vote for Bj by a similar argument as before. Therefore, all the new stake that the adversary gets past the block Bj has to include a vote for Bj and therefore the adversary has to include the minting intent and the minting transaction to keep a valid chain. □ 6 EVALUATION OF CHECKPOINTING DELAY The key barrier to reducing Winkle’s checkpoint confirmation delay is users’ idleness, which is encouraged within some cryptocurrency communities 2 . We estimate the checkpoint confirmation delay (the 2 A practice known as HODLing https://en.wikipedia.org/wiki/Hodl https://en.wikipedia.org/wiki/Hodl Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems New-York ’20, October 21–23, 2020, finality time) of Winkle in the “real world”, using workloads from the most popular cryptocurrency projects namely Ethereum and Bitcoin. We pre-process the transactions graph for these projects by assuming that each transaction in a block votes for the block that precedes it; i.e., if a transaction appears in block Bi , we consider that it votes for block Bi−1. For each block we then retroactively determine the confirmed checkpoint as the block that has just received q fraction of the votes. For our simulations we choose q = 2/3 in line with the usual BFT assumptions. The finality time shows how long the block awaits to get checkpointed by q fraction of stake, i.e. the time validators need to stay honest. We use Google BigQuery [19] on the Ethereum and the Bitcoin blockchains to perform simulations. We build a database with all addresses (or accounts) and the date of their last transaction, which corresponds to their latest vote, voteSent. The value under the account right after the last sent transaction is counted towards the vote voteSent. We also list transactions received per account after the last sent transaction, we apply the propagation rule (see Sec. 3.1) and append them to the list of the account’s votes. This gives us a global list of weighted votes. We rank the weighted votes by decreasing checkpoint’s vote (i.e., most recent one first) and retroactively determine the highest confirmed checkpoint. Fig. 6 plots the confirmed checkpoint delays for databases at different times. For Ethereum a checkpoint takes between 50 days and up to a year to be confirmed (with mean 204 days), and for Bitcoin a checkpoint takes between 4 months and up to three years to be confirmed (with mean 601 days). Delegation. As shown in Fig. 6, Winkle without delegation would lead to finality times of months or years. We simulate simple del- egation to estimate the improvement in the finality time. In our delegation scheme, we incentivize the creation of k pools [6] of roughly equal weight. To average out monthly fluctuations, we take 12 measurements, plot the mean as a line and standard deviation as error bars on Fig. 7. For each month between Sep’18 and Jan’20 we choose delegates as the top k accounts that have been the most frequently transacting during that month. More precisely, these are the accounts whose maximum delay between two consecutive transactions in the given month is the smallest. We assume those as our delegates with equal voting power. We retroactively compute the latest checkpoint confirmed on the last day of the month, by taking the vote from the two third of delegates who sent the newest vote. The results, depending on the number of delegates k between a few and one million are presented in Fig. 7. To better understand the x-axis scale, note the number of transacting Ethereum accounts between Sep’18 and Aug’19 is 21 million and transacting distinct Bitcoin addresses is 113 million. As expected, the delegation scheme drastically reduces finality time: for one thousand delegates the finality time is about 4 hours, for 10 thousand delegates it is 20 hours, and for 100 thousand delegates it is 3.5 days. 7 RELATED WORK An abstract VBCR can be instantiated through a Byzantine agree- ment protocol such as PBFT [29], or HotStuff [35]. Systems such as Tendermint [7], SBFT [20], and Libra [33] implement such mecha- nisms and we have designed Winkle to be relevant to those designs. Long-range attacks do not occur in Nakamoto consensus based Figure 6: Checkpoint confirmation delay without delegates Figure 7: Checkpoint confirmation delay with different num- ber of delegates protocols such as Bitcoin [30] or Ethereum [34] that rely on Proof- of-work, instead of validator signatures. However, those only offer probabilistic finality and Winkle may act as a finality layer. Previous approaches to defeating long-range attacks. Two ap- proaches have been proposed in the literature to foil long-range attacks, besides using secure hardware [26]. Software checkpoint- ing [25] periodically includes in client software a ‘checkpoint’. Clients never accept any past contradicting blocks. This relies on centrally trusting the software distribution process and can be modeled as a VBCR system, secured by software developers’ keys. These keys leaking to the adversary allows for long-range attacks. The second approach is based on validators locking deposits [8, 36] that are not returned in case of equivocation. It is difficult to de- termine how long the deposits should be locked, after a validator becomes inactive. And locking deposits for any fixed time cannot prevent validators from losing their key after that period suffering no penalty. New-York ’20, October 21–23, 2020, Sarah Azouvi, George Danezis, and Valeria Nikolaenko Winkle can be interpreted as a refinement of those two tech- niques: it allows all to determine appropriate checkpoints in a highly decentralized manner, and allows validators that were honest to recover their deposits after their blocks become confirmed through a checkpoint. Background and related techniques. The core of Winkle is based on confirming checkpoints using a simplified Byzantine Consistent Broadcast [21] based on stake. This primitive is always safe but may not lead to a checkpoint in case the initiator (the VBCR in our case) provides two equivocating checkpoints — hence we assume that validators are only eventually compromized. Winkle borrows ideas from Proof-of-Stake systems proposed as early as 2012 in the context of the Ppcoin [25], and then Snow White [10] and Ouroboros [24]. Winkle makes similar security assumptions, namely that a fraction of the stake is controlled by honest clients. However, Winkle is not a consensus mechanism but rather a finality layer, similar to Casper [9]. Fantômette [1] and Afgjort [27] are finality layers that resemble Winkle; they rely however on validators rather than general users to provide finality. Ouroboros Genesis [3] has a finality layer that allows new parties to bootstrap the correct blockchain without checkpointing. A number of blockchains employ client-led validation. In Iota [31] clients include references to multiple past transactions. Consensus is secure if honest clients make more transactions than dishonest ones. EOS consensus [14] is based on clients delegating stake to one of a set of validators, and uses ‘Transactions as Proof of Stake (TaPoS)’ similar to Winkle. Winkle differs in that it is a finality layer immune to long-range attacks, rather than a full consensus protocol. 8 DISCUSSION Winkle provides a finality layer based on account stake. Other proof- of-stake protocols [3, 10, 18] allow for more validators than VBCR protocols. A natural question to ask is how using Winkle on top of a VBCR protocol compare to these. First, even though these protocols are open to every coin-holder for participation, they require parties to run sophisticated interactive computations. Some protocols may require participants to lock some of their funds for the duration of the protocol (or more) and in some cases, a substantial amount of stake must be acquired in order to participate (e.g., Ethereum proof-of-stake protocol would require 32 ether = $12,000 3 ). These protocols thus still suffer from a relatively small committee size compared to their user-base and would benefit from additional security against long-range attacks. Furthermore, using Winkle on top of a VBCR protocol provides instant confirmation under the assumption that validators stay honest for at least finality (as defined in this paper) with a smaller committee and hence better efficiency. Snow-white [10] and Ouroboros [3] confirmation times are quite long (on the order of magnitude of hundreds of blocks) hence a VBCR protocol with Winkle provides much better latency. Winkle was inspired by the proof-of-stake literature, but it is very different from running another proof-of-stake protocol as a finality layer to confirm checkpoints. Winkle does not require additional participants to run a second-layer protocol, instead Winkle relies 3 https://www.exodus.io/blog/ethereum-proof-of-stake-date/ on existing non-interactive users that submit transactions in an ordinary (one-way) fashion and only requires minimal changes to the VBCR protocol itself, it is therefore much simpler that the proof- of-stake protocols (it requires no leader elections, no complicated cryptography, like cryptographic sortitions [18], no multiple rounds of voting and no separate special committee). Limitations. One limitation of Winkle is that a client needs to be aware of the latest state of the database, although this could be solved by using some lighter client such as SPV 4 . Furthermore, although Winkle’s security relies on a flexible set of assumptions it remains an open problem to decide how to adjust the thresholds dynamically. Finally, when discussing our security assumptions in Section 4, we relied on the number of accounts used in Bitcoin and Ethereum. We recognize that one user may hold multiple accounts to achieve more privacy [28] and the number of users might be a better parameter for our assumptions. But since this number is unknown and can only be speculated, we rely on the number of keys. Extension. Winkle may also be adapted to provide finality to proof-of-work based blockchains, that otherwise can only achieve probabilistic finality. In such systems blocks are generated through a proof-of-work and a fork choice rule that privileges forks with the most work. Clients vote for the fork they consider authoritative, after sufficient time to constitute an epoch and to ensure they are likely to be correct. This means clients will be voting for a block that has been confirmed in the proof-of-work sense (i.e., after x blocks have been mined on top of it). Once q of stake confirms a checkpoint all clients accept it, and no matter how much work an adversary commits in the future it may never be reverted. It is worth noting that in this case, the set of assumptions must change as proof-of-work requires a majority of the computational power to be honest (as opposed to validators) and Winkle would still require a majority of the coin-holders to be honest. Other protocols have been proposed to achieve finality in proof- of-work systems. Karakostas et al. [22] for example proposed check- pointing mechanisms on top of proof-of-work, but they require a set of additional trusted parties, mitigating byzantine faults among those parties brings significant complexity and interaction to the protocol. Bissias and Levine [4] proposed an approach to stabilize the block interval time, Keller and Böhme [23] built on their work and designed a proof-of-work blockchain with a novel puzzle and a quorum mechanism that brings finality. The solution looks promis- ing but requires a different protocol back-bone which makes it hard to apply to existing blockchains. Lastly, Duong et al. [13] followed by Chepurnoy et al. [12] proposed a blockchain that combines the proof-of-work and the proof-of-stake mechanisms, there in case more than half of the compute power comes to the adversary, the honest stake may still be able to protect the system. They claim to improve scalability of proof-of-stake systems, however the proof- of-stake layer requires active participation from the players, while being registered to participate they need to stay alert, this is very different from Winkle that does not require stake holders to commit to staying online. 4 https://en.bitcoinwiki.org/wiki/Simplified_Payment_Verification https://www.exodus.io/blog/ethereum-proof-of-stake-date/ https://en.bitcoinwiki.org/wiki/Simplified_Payment_Verification Winkle: Foiling Long-Range Attacks in Proof-of-Stake Systems New-York ’20, October 21–23, 2020, Additionally to proof-of-work, Winkle could be used as a finality layer to other proof-of-X-type protocols. For example, proof-of- space such as Filecoin 5 or Chia 6 that are potentially vulnerable to long-range attacks (e.g., some forms of stake-bleeding) unlike proof-of-work cryptocurrencies. A full proof-of-stake system may be bootstrapped through Win- kle. Clients indicate on-chain whether they want to act as validators. At each block, some of them are selected that represent the most stake in the system. Their stake at this point is locked, and they act as validators to produce a block. Once the stake has shifted significantly, or after some number of blocks, they are rotated and a new set is selected. Stake is released once the last checkpoint they facilitated is confirmed by a fraction q of the stake as per Winkle. 9 CONCLUSIONS Proof-of-stake systems based on validators are a promising way to scale up blockchain, but are based on fundamentally different security assumptions to proof-of-work. They are susceptible to validators eventually becoming compromised, and to a long-range attack. Winkle provides a decentralized approach for clients to de- termine and validate checkpoints, that rests only on the short term honesty of validators, and the longer term honesty of a more nu- merous set of all the stake holders. We show that using delegation, and assuming usage similar to Bitcoin or Ethereum, Winkle check- points with a delay of hours or a few days. Thus validators need only to keep their signature keys safe for this short window of time, assuming validators frequently rotate the keys. A stake locking mechanism incentivizing validators to stay honest can unlock stake after a confirmed checkpoint giving tolerable delays. Finally, Winkle as presented, has a key shortcoming: we assume that an honest account votes for the latest checkpoint. However, this creates a boundary race condition between blocks; it represents a challenge for cold wallets; and it makes transactions in mempools invalid between blocks. We took a pragmatic approach and assumed those issues are alleviated by blocks representing periods that are relatively long — in the order of a day or more. However, a key open research question relates to relaxing this condition, while preserving the security and simplicity of the Winkle scheme. Acknowledgements. The authors would like to thank Ben Mau- rer (Facebook Novi) for suggesting naming the system after the popular story of Rip Van Winkle. In contemporary times he would have fallen asleep and missed the cryptocurrency boom, and upon waking up would have to do a full chain validation, subject to Long Range Attacks, to catch up with the world. The authors would also like to thank Kostas Chalkias for useful comments on the idea behind the project. Sarah Azouvi worked on Winkle while being a research intern with Facebook Novi (previously Calibra). REFERENCES [1] S. Azouvi, P. McCorry, and S. Meiklejohn. Betting on blockchain consensus with fantomette. arXiv preprint arXiv:1805.06786, 2018. [2] Sarah Azouvi and Alexander Hicks. Sok: Tools for game theoretic models of security for cryptocurrencies. arXiv preprint arXiv:1905.08595, 2019. 5 https://filecoin.io/ 6 https://www.chia.net/ [3] C. Badertscher, P. Gaži, A. Kiayias, A. Russell, and V. Zikas. Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability. In ACM CCS, 2018. [4] George Bissias and Brian N Levine. Bobtail: Improved blockchain security with low-variance mining. In ISOC NDSS, 2020. [5] Bitcoin pools. https://www.blockchain.com/pools. Accessed: 2019-09-16. [6] L. Brünjes, A. Kiayias, E. Koutsoupias, and A. Stouka. Reward sharing schemes for stake pools. arXiv preprint arXiv:1807.11218, 2018. [7] E. Buchman. Tendermint: Byzantine fault tolerance in the age of blockchains. PhD thesis, 2016. [8] V. Buterin. Slasher: A punitive proof-of-stake algorithm. Ethereum Blog URL: https://blog.ethereum.org/2014/01/15/ slasher-a-punitive-proof-of-stake-algorithm/, 2014. [9] V. Buterin and V. Griffith. Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437, 2017. [10] P. Daian, R. Pass, and E. Shi. Snow white: Robustly reconfigurable consensus and applications to provably secure proof of stake. In International Conference on Financial Cryptography and Data Security. Springer, 2019. [11] Evangelos Deirmentzoglou, Georgios Papakyriakopoulos, and Constantinos Pat- sakis. A survey on long-range attacks for proof of stake protocols. IEEE Access, 7:28712–28725, 2019. [12] Tuyet Duong, Alexander Chepurnoy, Lei Fan, and Hong-Sheng Zhou. Twinscoin: A cryptocurrency via proof-of-work and proof-of-stake. In Proceedings of the 2nd ACM Workshop on Blockchains, Cryptocurrencies, and Contracts, pages 1–13, 2018. [13] Tuyet Duong, Lei Fan, and Hong-Sheng Zhou. 2-hop blockchain: Combining proof-of-work and proof-of-stake securely. Cryptology ePrint Archive, Report 2016/716, 2016. [14] Eos.io technical white paper v2. https://github.com/EOSIO/Documentation/blob/ master/TechnicalWhitePaper.md. [15] Replay attack protection: Include blocklimit and blockhash in each transaction. https://github.com/ethereum/EIPs/issues/134. [16] Bryan Ford and Rainer Böhme. Rationality is self-defeating in permissionless systems. arXiv preprint arXiv:1910.08820, 2019. [17] P. Gaži, A. Kiayias, and A. Russell. Stake-bleeding attacks on proof-of-stake blockchains. In 2018 Crypto Valley Conference on Blockchain Technology (CVCBT). IEEE, 2018. [18] Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th Symposium on Operating Systems Principles, pages 51–68, 2017. [19] Google bigquery. https://console.cloud.google.com/bigquery. [20] G. Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. Reiter, D. Seredinschi, O. Tamir, and A. Tomescu. Sbft: a scalable and decentralized trust infrastructure. In 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, 2019. [21] D. Imbs and M. Raynal. Simple and efficient reliable broadcast in the presence of byzantine processes. arXiv preprint arXiv:1510.06882, 2015. [22] Dimitris Karakostas and Aggelos Kiayias. Securing proof-of-work ledgers via checkpointing. Cryptology ePrint Archive, Report 2020/173, 2020. https://eprint. iacr.org/2020/173. [23] Patrik Keller and Rainer Böhme. Hotpow: Finality from proof-of-work quorums. arXiv preprint arXiv:1907.13531, 2019. [24] A. Kiayias, A. Russell, B. David, and R. Oliynykov. Ouroboros: A provably secure proof-of-stake blockchain protocol. In CRYPTO’17. Springer, 2017. [25] S. King and S. Nadal. Ppcoin: Peer-to-peer crypto-currency with proof-of-stake. https://www.peercoin.net/whitepapers/peercoin-paper.pdf, 2012. [26] W. Li, S. Andreina, J. Bohli, and G. Karame. Securing proof-of-stake blockchain protocols. In Data Privacy Management, Cryptocurrencies and Blockchain Tech- nology. Springer, 2017. [27] B. Magri, C. Matt, J. Nielsen, and D. Tschudi. Afgjort–a semi-synchronous finality layer for blockchains. 2019. [28] Sarah Meiklejohn, Marjori Pomarole, Grant Jordan, Kirill Levchenko, Damon Mc- Coy, Geoffrey M Voelker, and Stefan Savage. A fistful of bitcoins: characterizing payments among men with no names. In Proceedings of the 2013 conference on Internet measurement conference, pages 127–140, 2013. [29] C. Miguel and L. Barbara. Practical byzantine fault tolerance. In OSDI, 1999. [30] Satoshi Nakamoto. Bitcoin: A Peer-to-Peer Electronic Cash System. https: //bitcoin.org/bitcoin.pdf, 2008. [31] S. Popov. The tangle. https://iota.org/IOTA_Whitepaper.pdf. [32] A. Singh, T. Ngan, P. Druschel, and D. S. Wallach. Eclipse attacks on overlay networks: Threats and defenses. In IEEE INFOCOM’06, 2006. [33] The LibraBFT Team. State machine replication in the libra blockchain. https: //developers.libra.org/, 2020. [34] G. Wood. Ethereum: A Secure Decentralised Generalised Transaction Ledger EIP-150 Revision. http://gavwood.com/paper.pdf, 2016. [35] M. Yin, D. Malkhi, M. K Reiter, G. G. Golan, and A. Ittai. Hotstuff: Bft consensus in the lens of blockchain. arXiv preprint arXiv:1803.05069, 2018. [36] V. Zamfir. Introducing casper “the friendly ghost”. Ethereum Blog URL: https: //blog.ethereum.org/2015/08/01/introducing-casper-friendly-ghost, 2015. https://filecoin.io/ https://www.chia.net/ https://www.blockchain.com/pools https://blog.ethereum.org/2014/01/15/slasher-a-punitive-proof-of-stake-algorithm/ https://blog.ethereum.org/2014/01/15/slasher-a-punitive-proof-of-stake-algorithm/ https://github.com/EOSIO/Documentation/blob/master/TechnicalWhitePaper.md https://github.com/EOSIO/Documentation/blob/master/TechnicalWhitePaper.md https://github.com/ethereum/EIPs/issues/134 https://console.cloud.google.com/bigquery https://eprint.iacr.org/2020/173 https://eprint.iacr.org/2020/173 https://www.peercoin.net/whitepapers/peercoin-paper.pdf https://bitcoin.org/bitcoin.pdf https://bitcoin.org/bitcoin.pdf https://iota.org/IOTA_Whitepaper.pdf https://developers.libra.org/ https://developers.libra.org/ http://gavwood.com/paper.pdf https://blog.ethereum.org/2015/08/01/introducing-casper-friendly-ghost https://blog.ethereum.org/2015/08/01/introducing-casper-friendly-ghost Abstract 1 Introduction 2 Background and Research Question 3 The Winkle Mechanism 3.1 Basic Winkle scheme 3.2 Delegation 3.3 Minting and Stake Bleeding Attacks 3.4 Key Rotation and Account Healing 4 Security Assumptions 5 Security Definition and Argument 6 Evaluation of Checkpointing Delay 7 Related Work 8 Discussion 9 Conclusions References
erambler-co-uk-2327 ---- eRambler eRambler home about series tags talks rdm resources a blog about research communication & higher education & open culture & technology & making & librarianship & stuff mxadm: a small CLI Matrix room admin tool Date: 2021-08-04 Tags: [Rust] [Matrix] [Open source] [Communication] I’ve enjoyed learning Rust (the programming language) recently, but having only really used it for solving programming puzzles I’ve been looking for an excuse to use it for something more practical. At the same time, I’ve been using and learning about Matrix (the chat/messaging platform), and running some small rooms there I’ve been a bit frustrated that some pretty common admin things don’t have a good user interface in any of the available clients. Read more... Comments are back Date: 2021-06-29 Tags: [Meta] [Matrix] [Fediverse] I forgot to mention it at the time, but I’ve added “normal” comments back to the site, as you’ll see below and on most other pages. In place of the Disqus comments I had before I’m now using Cactus Comments, which is open source and self-hostable (though I’m currently not doing that). If you’ve read my previous post about Matrix self-hosting, you might be interested to know that Cactus uses Matrix rooms for data storage and synchronisation and I can moderate and reply to comments directly from my Matrix client. Read more... Intro to the fediverse Date: 2021-04-11 Tags: [Fediverse] [Social media] [Twitter] Wow, it turns out to be 10 years since I wrote this beginners guide to Twitter. Things have moved on a loooooong way since then. Far from being the interesting, disruptive technology it was back then, Twitter has become part of the mainstream, the establishment. Almost everyone and everything is on Twitter now, which has both pros and cons. So what’s the problem? It’s now possible to follow all sorts of useful information feeds, from live updates on transport delays to your favourite sports team’s play-by-play performance to an almost infinite number of cat pictures. Read more... Collaborations Workshop 2021: collaborative ideas & hackday Date: 2021-04-07 Series: Collaborations Workshop 2021 Tags: [Technology] [Conference] [SSI] [Research] [Disability] [Equality, diversity & inclusion] My last post covered the more “traditional” lectures-and-panel-sessions approach of the first half of the SSI Collaborations Workshop. The rest of the workshop was much more interactive, consisting of a discussion session, a Collaborative Ideas session, and a whole-day hackathon! The discussion session on day one had us choose a topic (from a list of topics proposed leading up to the workshop) and join a breakout room for that topic with the aim of producing a “speed blog” by then end of 90 minutes. Read more... Collaborations Workshop 2021: talks & panel session Date: 2021-04-05 Series: Collaborations Workshop 2021 Tags: [Technology] [Conference] [SSI] [Research] [Disability] [Equality, diversity & inclusion] I’ve just finished attending (online) the three days of this year’s SSI Collaborations Workshop (CW for short), and once again it’s been a brilliant experience, as well as mentally exhausting, so I thought I’d better get a summary down while it’s still fresh it my mind. Collaborations Workshop is, as the name suggests, much more focused on facilitating collaborations than a typical conference, and has settled into a structure that starts off with with longer keynotes and lectures, and progressively gets more interactive culminating with a hack day on the third day. Read more... Date: 2021-04-03 Tags: [Meta] [Design] I’ve decided to try switching this website back to using Hugo to manage the content and generate the static HTML pages. I’ve been on the Python-based Nikola for a few years now, but recently I’ve been finding it quite slow, and very confusing to understand how to do certain things. I used Hugo recently for the GLAM Data Science Network website and found it had come on a lot since the last time I was using it, so I thought I’d give it another go, and redesign this site to be a bit more minimal at the same time. The theme is still a work in progress so it’ll probably look a bit rough around the edges for a while, but I think I’m happy enough to publish it now. When I get round to it I might publish some more detailed thoughts on the design. Ideas for Accessible Communications Date: 2021-03-20 Tags: [Stuff] [Accessibility] [Ablism] The Disability Support Network at work recently ran a survey on “accessible communications”, to develop guidance on how to make communications (especially internal staff comms) more accessible to everyone. I grabbed a copy of my submission because I thought it would be useful to share more widely, so here it is. Please note that these are based on my own experiences only. I am in no way suggesting that these are the only things you would need to do to ensure your communications are fully accessible. Read more... Matrix self-hosting Date: 2021-03-12 Tags: [Technology] [Matrix] [Communication] [Self-hosting] [DWeb] I started running my own Matrix server a little while ago. Matrix is something rather cool, a chat system similar to IRC or Slack, but open and federated. Open in that the standard is available for anyone to view, but also the reference implementations of server and client are open source, along with many other clients and a couple of nascent alternative servers. Federated in that, like email, it doesn’t matter what server you sign up with, you can talk to users on your own or any other server. Read more... What do you miss least about pre-lockdown life? Date: 2021-02-26 Tags: [Stuff] [Reflection] [Pandemic] @JanetHughes on Twitter: What do you miss the least from pre-lockdown life? I absolutely do not miss wandering around the office looking for a meeting room for a confidential call or if I hadn’t managed to book a room in advance. Let’s never return to that joyless frustration, hey? 10:27 AM · Feb 3, 2021 After seeing Terence Eden taking Janet Hughes' tweet from earlier this month as a writing prompt, I thought I might do the same. Read more... Remarkable blogging Date: 2021-02-06 Tags: [Technology] [Writing] [Gadgets] And the handwritten blog saga continues, as I’ve just received my new reMarkable 2 tablet, which is designed for reading, writing and nothing else. It uses a super-responsive e-ink display and writing on it with a stylus is a dream. It has a slightly rough texture with just a bit of friction that makes my writing come out a lot more legibly than on a slippery glass touchscreen. If that was all there was to it, I might not have wasted my money, but it turns out that it runs on Linux and the makers have wisely decided not to lock it down but to give you full root mess. Read more... 1 of 9 Next Page me elsewhere :: keyoxide | keybase | mastodon | matrix | twitter | github | gitlab | orcid | pypi | linkedin © 2021 Jez Cope | Built by: Hugo | Theme: Mnemosyne Build status: Except where noted, this work is licensed under a Creative Commons Attribution 4.0 International License.
erambler-co-uk-6305 ---- Dueling Generators — Rust — #adventofcode Day 15 eRambler home about series tags talks rdm resources Dueling Generators — Rust — #adventofcode Day 15 Date: 2017-12-15 Series: Advent of Code 2017 Tags: [Technology] [Learning] [Advent of Code] [Rust] Series This post is part of the series Advent of Code 2017 Reflections on #aoc2017 The Halting Problem — Python — #adventofcode Day 25 Electromagnetic Moat — Rust — #adventofcode Day 24 Coprocessor Conflagration — Haskell — #adventofcode Day 23 Sporifica Virus — Rust — #adventofcode Day 22 Fractal Art — Python — #adventofcode Day 21 Particle Swarm — Python — #adventofcode Day 20 A Series of Tubes — Rust — #adventofcode Day 19 Duet — Haskell — #adventofcode Day 18 Spinlock — Rust/Python — #adventofcode Day 17 Permutation Promenade — Julia — #adventofcode Day 16 > Dueling Generators — Rust — #adventofcode Day 15 < Disk Defragmentation — Haskell — #adventofcode Day 14 Packet Scanners — Haskell — #adventofcode Day 13 Digital Plumber — Python — #adventofcode Day 12 Hex Ed — Python — #adventofcode Day 11 Knot Hash — Haskell — #adventofcode Day 10 Stream Processing — Haskell — #adventofcode Day 9 I Heard You Like Registers — Python — #adventofcode Day 8 Recursive Circus — Ruby — #adventofcode Day 7 Memory Reallocation — Python — #adventofcode Day 6 A Maze of Twisty Trampolines — C++ — #adventofcode Day 5 High Entropy Passphrases — Python — #adventofcode Day 4 Spiral Memory — Go — #adventofcode Day 3 Corruption Checksum — Python — #adventofcode Day 2 Inverse Captcha — Coconut — #adventofcode Day 1 Advent of Code 2017: introduction Today’s challenge introduces two pseudo-random number generators which are trying to agree on a series of numbers. We play the part of the “judge”, counting the number of times their numbers agree in the lowest 16 bits. → Full code on GitHub Ever since I used Go to solve day 3, I’ve had a hankering to try the other new kid on the memory-safe compiled language block, Rust. I found it a bit intimidating at first because the syntax wasn’t as close to the C/C++ I’m familiar with and there are quite a few concepts unique to Rust, like the use of traits. But I figured it out, so I can tick another language of my to-try list. I also implemented a version in Python for comparison: the Python version is more concise and easier to read but the Rust version runs about 10× faster. First we include the std::env “crate” which will let us get access to commandline arguments, and define some useful constants for later. use std::env; const M: i64 = 2147483647; const MASK: i64 = 0b1111111111111111; const FACTOR_A: i64 = 16807; const FACTOR_B: i64 = 48271; gen_next generates the next number for a given generator’s sequence. gen_next_picky does the same, but for the “picky” generators, only returning values that meet their criteria. fn gen_next(factor: i64, current: i64) -> i64 { return (current * factor) % M; } fn gen_next_picky(factor: i64, current: i64, mult: i64) -> i64 { let mut next = gen_next(factor, current); while next % mult != 0 { next = gen_next(factor, next); } return next; } duel runs a single duel, and returns the number of times the generators agreed in the lowest 16 bits (found by doing a binary & with the mask defined above). Rust allows functions to be passed as parameters, so we use this to be able to run both versions of the duel using only this one function. fn duel<F, G>(n: i64, next_a: F, mut value_a: i64, next_b: G, mut value_b: i64) -> i64 where F: Fn(i64) -> i64, G: Fn(i64) -> i64, { let mut count = 0; for _ in 0..n { value_a = next_a(value_a); value_b = next_b(value_b); if (value_a & MASK) == (value_b & MASK) { count += 1; } } return count; } Finally, we read the start values from the command line and run the two duels. The expressions that begin |n| are closures (anonymous functions, often called lambdas in other languages) that we use to specify the generator functions for each duel. fn main() { let args: Vec<String> = env::args().collect(); let start_a: i64 = args[1].parse().unwrap(); let start_b: i64 = args[2].parse().unwrap(); println!( "Duel 1: {}", duel( 40000000, |n| gen_next(FACTOR_A, n), start_a, |n| gen_next(FACTOR_B, n), start_b, ) ); println!( "Duel 2: {}", duel( 5000000, |n| gen_next_picky(FACTOR_A, n, 4), start_a, |n| gen_next_picky(FACTOR_B, n, 8), start_b, ) ); } Webmentions You can respond to this post, "Dueling Generators — Rust — #adventofcode Day 15", by: liking, boosting or replying to a tweet or toot that mentions it; or sending a webmention from your own site to https://erambler.co.uk/blog/day-15/ Comments & reactions haven't loaded yet. You might have JavaScript disabled but that's cool 😎. Comments Powered by Cactus Comments 🌵 me elsewhere :: keyoxide | keybase | mastodon | matrix | twitter | github | gitlab | orcid | pypi | linkedin © 2021 Jez Cope | Built by: Hugo | Theme: Mnemosyne Build status: Except where noted, this work is licensed under a Creative Commons Attribution 4.0 International License.
erambler-co-uk-8009 ---- mxadm: a small CLI Matrix room admin tool eRambler home about series tags talks rdm resources mxadm: a small CLI Matrix room admin tool Date: 2021-08-04 Tags: [Rust] [Matrix] [Open source] [Communication] I’ve enjoyed learning Rust (the programming language) recently, but having only really used it for solving programming puzzles I’ve been looking for an excuse to use it for something more practical. At the same time, I’ve been using and learning about Matrix (the chat/messaging platform), and running some small rooms there I’ve been a bit frustrated that some pretty common admin things don’t have a good user interface in any of the available clients. So… I decided to write a little command-line tool to do a few simple tasks, and it’s now released as mxadm! It’s on crates.io, so if you have Rust and cargo available, installing it is as simple as running cargo install mxadm. I’ve only taught it to do a few things so far: List your joined rooms Add/delete a room alias Tombstone a room (i.e. redirect it to a new room) I’ll add more as I need them, and I’m open to suggestions too. It uses matrix-rust-sdk, the Matrix Client-Server SDK for Rust, which is built on the lower-level Ruma library, along with anyhow for error handling. The kind folks in the #matrix-rust-sdk:matrix.org have been particularly kind in helping me get started using it. More details from: Source code on tildegit mxadm on crates.io mxadm on lib.rs Suggestions, code reviews, pull requests all welcome, though it will probably take me a while to act on them. Enjoy! Webmentions You can respond to this post, "mxadm: a small CLI Matrix room admin tool", by: liking, boosting or replying to a tweet or toot that mentions it; or sending a webmention from your own site to https://erambler.co.uk/blog/introducing-mxadm/ Comments & reactions haven't loaded yet. You might have JavaScript disabled but that's cool 😎. Comments Powered by Cactus Comments 🌵 me elsewhere :: keyoxide | keybase | mastodon | matrix | twitter | github | gitlab | orcid | pypi | linkedin © 2021 Jez Cope | Built by: Hugo | Theme: Mnemosyne Build status: Except where noted, this work is licensed under a Creative Commons Attribution 4.0 International License.
erambler-co-uk-8585 ---- eRambler eRambler Recent content on eRambler mxadm: a small CLI Matrix room admin tool I’ve enjoyed learning Rust (the programming language) recently, but having only really used it for solving programming puzzles I’ve been looking for an excuse to use it for something more practical. At the same time, I’ve been using and learning about Matrix (the chat/messaging platform), and running some small rooms there I’ve been a bit frustrated that some pretty common admin things don’t have a good user interface in any of the available clients. So… I decided to write a little command-line tool to do a few simple tasks, and it’s now released as mxadm! It’s on crates.io, so if you have Rust and cargo available, installing it is as simple as running cargo install mxadm. I’ve only taught it to do a few things so far: List your joined rooms Add/delete a room alias Tombstone a room (i.e. redirect it to a new room) I’ll add more as I need them, and I’m open to suggestions too. It uses matrix-rust-sdk, the Matrix Client-Server SDK for Rust, which is built on the lower-level Ruma library, along with anyhow for error handling. The kind folks in the #matrix-rust-sdk:matrix.org have been particularly kind in helping me get started using it. More details from: Source code on tildegit mxadm on crates.io mxadm on lib.rs Suggestions, code reviews, pull requests all welcome, though it will probably take me a while to act on them. Enjoy! Comments are back I forgot to mention it at the time, but I’ve added “normal” comments back to the site, as you’ll see below and on most other pages. In place of the Disqus comments I had before I’m now using Cactus Comments, which is open source and self-hostable (though I’m currently not doing that). If you’ve read my previous post about Matrix self-hosting, you might be interested to know that Cactus uses Matrix rooms for data storage and synchronisation and I can moderate and reply to comments directly from my Matrix client. I’ve still left the webmention code in place too so you can still comment that way either on your own site or via social media. Intro to the fediverse Wow, it turns out to be 10 years since I wrote this beginners guide to Twitter. Things have moved on a loooooong way since then. Far from being the interesting, disruptive technology it was back then, Twitter has become part of the mainstream, the establishment. Almost everyone and everything is on Twitter now, which has both pros and cons. So what’s the problem? It’s now possible to follow all sorts of useful information feeds, from live updates on transport delays to your favourite sports team’s play-by-play performance to an almost infinite number of cat pictures. In my professional life it’s almost guaranteed that anyone I meet will be on Twitter, meaning that I can contact them to follow up at a later date without having to exchange contact details (and they have options to block me if they don’t like that). On the other hand, a medium where everyone’s opinion is equally valid regardless of knowledge or life experience has turned some parts of the internet into a toxic swamp of hatred and vitriol. It’s easier than ever to forget that we have more common ground with any random stranger than we have similarities, and that’s led to some truly awful acts and a poisonous political arena. Part of the problem here is that each of the social media platforms is controlled by a single entity with almost no accountability to anyone other than shareholders. Technological change has been so rapid that the regulatory regime has no idea how to handle them, leaving them largely free to operate how they want. This has led to a whole heap of nasty consequences that many other people have done a much better job of documenting than I could (Shoshana Zuboff’s book The Age of Surveillance Capitalism is a good example). What I’m going to focus on instead are some possible alternatives. If you accept the above argument, one obvious solution is to break up the effective monopoly enjoyed by Facebook, Twitter et al. We need to be able to retain the wonderful affordances of social media but democratise control of it, so that it can never be dominated by a small number of overly powerful players. What’s the solution? There’s actually a thing that already exists, that almost everyone is familiar with and that already works like this. It’s email. There are a hundred thousand email servers, but my email can always find your inbox if I know your address because that address identifies both you and the email service you use, and they communicate using the same protocol, Simple Mail Transfer Protocol (SMTP)1. I can’t send a message to your Twitter from my Facebook though, because they’re completely incompatible, like oil and water. Facebook has no idea how to talk to Twitter and vice versa (and the companies that control them have zero interest in such interoperability anyway). Just like email, a federated social media service like Mastodon allows you to use any compatible server, or even run your own, and follow accounts on your home server or anywhere else, even servers running different software as long as they use the same ActivityPub protocol. There’s no lock-in because you can move to another server any time you like, and interact with all the same people from your new home, just like changing your email address. Smaller servers mean that no one server ends up with enough power to take over and control everything, as the social media giants do with their own platforms. But at the same time, a small server with a small moderator team can enforce local policy much more easily and block accounts or whole servers that host trolls, nazis or other poisonous people. How do I try it? I have no problem with anyone for choosing to continue to use what we’re already calling “traditional” social media; frankly, Facebook and Twitter are still useful for me to keep in touch with a lot of my friends. However, I do think it’s useful to know some of the alternatives if only to make a more informed decision to stick with your current choices. Most of these services only ask for an email address when you sign up and use of your real name vs a pseudonym is entirely optional so there’s not really any risk in signing up and giving one a try. That said, make sure you take sensible precautions like not reusing a password from another account. Instead of… Try… Twitter, Facebook Mastodon, Pleroma, Misskey Slack, Discord, IRC Matrix WhatsApp, FB Messenger, Telegram Also Matrix Instagram, Flickr PixelFed YouTube PeerTube The web Interplanetary File System (IPFS) Which, if you can believe it, was formalised nearly 40 years ago in 1982 and has only had fairly minor changes since then! ↩︎ Collaborations Workshop 2021: collaborative ideas & hackday My last post covered the more “traditional” lectures-and-panel-sessions approach of the first half of the SSI Collaborations Workshop. The rest of the workshop was much more interactive, consisting of a discussion session, a Collaborative Ideas session, and a whole-day hackathon! The discussion session on day one had us choose a topic (from a list of topics proposed leading up to the workshop) and join a breakout room for that topic with the aim of producing a “speed blog” by then end of 90 minutes. Those speed blogs will be published on the SSI blog over the coming weeks, so I won’t go into that in more detail. The Collaborative Ideas session is a way of generating hackday ideas, by putting people together at random into small groups to each raise a topic of interest to them before discussing and coming up with a combined idea for a hackday project. Because of the serendipitous nature of the groupings, it’s a really good way of generating new ideas from unexpected combinations of individual interests. After that, all the ideas from the session, along with a few others proposed by various participants, were pitched as ideas for the hackday and people started to form teams. Not every idea pitched gets worked on during the hackday, but in the end 9 teams of roughly equal size formed to spend the third day working together. My team’s project: “AHA! An Arts & Humanities Adventure” There’s a lot of FOMO around choosing which team to join for an event like this: there were so many good ideas and I wanted to work on several of them! In the end I settled on a team developing an escape room concept to help Arts & Humanities scholars understand the benefits of working with research software engineers for their research. Five of us rapidly mapped out an example storyline for an escape room, got a website set up with GitHub and populated it with the first few stages of the game. We decided to focus on a story that would help the reader get to grips with what an API is and I’m amazed how much we managed to get done in less than a day’s work! You can try playing through the escape room (so far) yourself on the web, or take a look at the GitHub repository, which contains the source of the website along with a list of outstanding tasks to work on if you’re interested in contributing. I’m not sure yet whether this project has enough momentum to keep going, but it was a really valuable way both of getting to know and building trust with some new people and demonstrating the concept is worth more work. Other projects Here’s a brief rundown of the other projects worked on by teams on the day. Coding Confessions Everyone starts somewhere and everyone cuts corners from time to time. Real developers copy and paste! Fight imposter syndrome by looking through some of these confessions or contributing your own. https://coding-confessions.github.io/ CarpenPI A template to set up a Raspberry Pi with everything you need to run a Carpentries (https://carpentries.org/) data science/software engineering workshop in a remote location without internet access. https://github.com/CarpenPi/docs/wiki Research Dugnads A guide to running an event that is a coming together of a research group or team to share knowledge, pass on skills, tidy and review code, among other software and working best practices (based on the Norwegian concept of a dugnad, a form of “voluntary work done together with other people”) https://research-dugnads.github.io/dugnads-hq/ Collaborations Workshop ideas A meta-project to collect together pitches and ideas from previous Collaborations Workshop conferences and hackdays, to analyse patterns and revisit ideas whose time might now have come. https://github.com/robintw/CW-ideas howDescribedIs Integrate existing tools to improve the machine-readable metadata attached to open research projects by integrating projects like SOMEF, codemeta.json and HowFAIRIs (https://howfairis.readthedocs.io/en/latest/index.html). Complete with CI and badges! https://github.com/KnowledgeCaptureAndDiscovery/somef-github-action Software end-of-project plans Develop a template to plan and communicate what will happen when the fixed-term project funding for your research software ends. Will maintenance continue? When will the project sunset? Who owns the IP? https://github.com/elichad/software-twilight Habeas Corpus A corpus of machine readable data about software used in COVID-19 related research, based on the CORD19 dataset. https://github.com/softwaresaved/habeas-corpus Credit-all Extend the all-contributors GitHub bot (https://allcontributors.org/) to include rich information about research project contributions such as the CASRAI Contributor Roles Taxonomy (https://casrai.org/credit/) https://github.com/dokempf/credit-all I’m excited to see so many metadata-related projects! I plan to take a closer look at what the Habeas Corpus, Credit-all and howDescribedIs teams did when I get time. I also really want to try running a dugnad with my team or for the GLAM Data Science network. Collaborations Workshop 2021: talks & panel session I’ve just finished attending (online) the three days of this year’s SSI Collaborations Workshop (CW for short), and once again it’s been a brilliant experience, as well as mentally exhausting, so I thought I’d better get a summary down while it’s still fresh it my mind. Collaborations Workshop is, as the name suggests, much more focused on facilitating collaborations than a typical conference, and has settled into a structure that starts off with with longer keynotes and lectures, and progressively gets more interactive culminating with a hack day on the third day. That’s a lot to write about, so for this post I’ll focus on the talks and panel session, and follow up with another post about the collaborative bits. I’ll also probably need to come back and add in more links to bits and pieces once slides and the “official” summary of the event become available. Updates 2021-04-07 Added links to recordings of keynotes and panel sessions Provocations The first day began with two keynotes on this year’s main themes: FAIR Research Software and Diversity & Inclusion, and day 2 had a great panel session focused on disability. All three were streamed live and the recordings remain available on Youtube: View the keynotes recording; Google-free alternative link View the panel session recording; Google-free alternative link FAIR Research Software Dr Michelle Barker, Director of the Research Software Alliance, spoke on the challenges to recognition of software as part of the scholarly record: software is not often cited. The FAIR4RS working group has been set up to investigate and create guidance on how the FAIR Principles for data can be adapted to research software as well; as they stand, the Principles are not ideally suited to software. This work will only be the beginning though, as we will also need metrics, training, career paths and much more. ReSA itself has 3 focus areas: people, policy and infrastructure. If you’re interested in getting more involved in this, you can join the ReSA email list. Equality, Diversity & Inclusion: how to go about it Dr Chonnettia Jones, Vice President of Research, Michael Smith Foundation for Health Research spoke extensively and persuasively on the need for Equality, Diversity & Inclusion (EDI) initiatives within research, as there is abundant robust evidence that all research outcomes are improved. She highlighted the difficulties current approaches to EDI have effecting structural change, and changing not just individual behaviours but the cultures & practices that perpetuate iniquity. What initiatives are often constructed around making up for individual deficits, a bitter framing is to start from an understanding of individuals having equal stature but having different tired experiences. Commenting on the current focus on “research excellent” she pointed out that the hyper-competition this promotes is deeply unhealthy. suggesting instead that true excellence requires diversity, and we should focus on an inclusive excellence driven by inclusive leadership. Equality, Diversity & Inclusion: disability issues Day 2’s EDI panel session brought together five disabled academics to discuss the problems of disability in research. Dr Becca Wilson, UKRI Innovation Fellow, Institute of Population Health Science, University of Liverpool (Chair) Phoenix C S Andrews (PhD Student, Information Studies, University of Sheffield and Freelance Writer) Dr Ella Gale (Research Associate and Machine Learning Subject Specialist, School of Chemistry, University of Bristol) Prof Robert Stevens (Professor and Head of Department of Computer Science, University of Manchester) Dr Robin Wilson (Freelance Data Scientist and SSI Fellow) NB. The discussion flowed quite freely so the following summary, so the following summary mixes up input from all the panel members. Researchers are often assumed to be single-minded in following their research calling, and aptness for jobs is often partly judged on “time send”, which disadvantages any disabled person who has been forced to take a career break. On top of this disabled people are often time-poor because of the extra time needed to manage their condition, leaving them with less “output” to show for their time served on many common metrics. This can partially affect early-career researchers, since resources for these are often restricted on a “years-since-PhD” criterion. Time poverty also makes funding with short deadlines that much harder to apply for. Employers add more demands right from the start: new starters are typically expected to complete a health and safety form, generally a brief affair that will suddenly become an 80-page bureaucratic nightmare if you tick the box declaring a disability. Many employers claim to be inclusive yet utterly fail to understand the needs of their disabled staff. Wheelchairs are liberating for those who use them (despite the awful but common phrase “wheelchair-bound”) and yet employers will refuse to insure a wheelchair while travelling for work, classifying it as a “high value personal item” that the owner would take the same responsibility for as an expensive camera. Computers open up the world for blind people in a way that was never possible without them, but it’s not unusual for mandatory training to be inaccessible to screen readers. Some of these barriers can be overcome, but doing so takes yet more time that could and should be spent on more important work. What can we do about it? Academia works on patronage whether we like it or not, so be the person who supports people who are different to you rather than focusing on the one you “recognise yourself in” to mentor. As a manager, it’s important to ask each individual what they need and believe them: they are the expert in their own condition and their lived experience of it. Don’t assume that because someone else in your organisation with the same disability needs one set of accommodations, it’s invalid for your staff member to require something totally different. And remember: disability is unusual as a protected characteristic in that anyone can acquire it at any time without warning! Lightning talks Lightning talk sessions are always tricky to summarise, and while this doesn’t do them justice, here are a few highlights from my notes. Data & metadata Malin Sandstrom talked about a much-needed refinement of contributor role taxonomies for scientific computing Stephan Druskat showcased a project to crowdsource a corpus of research software for further analysis Learning & teaching/community Matthew Bluteau introduced the concept of the “coding dojo” as a way to enhance community of practice. A group of coders got together to practice & learn by working together to solve a problem and explaining their work as they go He described 2 models: a code jam, where people work in small groups, and the Randori method, where 2 people do pair programming while the rest observe. I’m excited to try this out! Steve Crouch talked about intermediate skills and helping people take the next step, which I’m also very interested in with the GLAM Data Science network Esther Plomp recounted experience of running multiple Carpentry workshops online, while Diego Alonso Alvarez discussed planned workshops on making research software more usable with GUIs Shoaib Sufi showcased the SSI’s new event organising guide Caroline Jay reported on a diary study into autonomy & agency in RSE during COVID Lopez, T., Jay, C., Wermelinger, M., & Sharp, H. (2021). How has the covid-19 pandemic affected working conditions for research software engineers? Unpublished manuscript. Wrapping up That’s not everything! But this post is getting pretty long so I’ll wrap up for now. I’ll try to follow up soon with a summary of the “collaborative” part of Collaborations Workshop: the idea-generating sessions and hackday! Time for a new look... I’ve decided to try switching this website back to using Hugo to manage the content and generate the static HTML pages. I’ve been on the Python-based Nikola for a few years now, but recently I’ve been finding it quite slow, and very confusing to understand how to do certain things. I used Hugo recently for the GLAM Data Science Network website and found it had come on a lot since the last time I was using it, so I thought I’d give it another go, and redesign this site to be a bit more minimal at the same time. The theme is still a work in progress so it’ll probably look a bit rough around the edges for a while, but I think I’m happy enough to publish it now. When I get round to it I might publish some more detailed thoughts on the design. Ideas for Accessible Communications The Disability Support Network at work recently ran a survey on “accessible communications”, to develop guidance on how to make communications (especially internal staff comms) more accessible to everyone. I grabbed a copy of my submission because I thought it would be useful to share more widely, so here it is. Please note that these are based on my own experiences only. I am in no way suggesting that these are the only things you would need to do to ensure your communications are fully accessible. They’re just some things to keep in mind. Policies/procedures/guidance can be stressful to use if anything is vague or inconsistent, or if it looks like there might be more information implied than is explicitly given (a common cause of this is use of jargon in e.g. HR policies). Emails relating to these policies have similar problems, made worse because they tend to be very brief. Online meetings can be very helpful, but can also be exhausting, especially if there are too many people, or not enough structure. Larger meetings & webinars without agendas (or where the agenda is ignored, or timings are allowed to drift without acknowledgement) are very stressful, as are those where there is not enough structure to ensure fair opportunities to contribute. Written reference documents and communications should: Be carefully checked for consistency and clarity Have all all key points explicitly stated Explicitly acknowledge the need for flexibility where it is necessary, rather than implying or hinting at it Clearly define jargon & acronyms where they are necessary to the point being made, and avoid them otherwise Include links to longer, more explicit versions where space is tight Provide clear bullet-point summaries with links to the details Online meetings should: Include sufficient break time (at least 10 minutes out of every hour) and not allow this to be compromised just because a speaker has misjudged the length of their talk Include initial “settling-in” time in agendas to avoid timing getting messed up from the start Ensure the agenda is stuck to, or that divergence from the agenda is acknowledged explicitly by the chair and updated timing briefly discussed to ensure everyone is clear Establish a norm for participation at the start of the meeting and stick to it e.g. ask people to raise hands when they have a point to make, or have specific time for round-robin contributions Ensure quiet/introverted people have space to contribute, but don’t force them to do so if they have nothing to add at the time Offer a text-based alternative to contributing verbally If appropriate, at the start of the meeting assign specific roles of: Gatekeeper: ensures everyone has a chance to contribute Timekeeper: ensures meeting runs to time Scribe: ensures a consistent record of the meeting Be chaired by someone with the confidence to enforce the above: offer training to all staff on chairing meetings to ensure everyone has the skills to run a meeting effectively Matrix self-hosting I started running my own Matrix server a little while ago. Matrix is something rather cool, a chat system similar to IRC or Slack, but open and federated. Open in that the standard is available for anyone to view, but also the reference implementations of server and client are open source, along with many other clients and a couple of nascent alternative servers. Federated in that, like email, it doesn’t matter what server you sign up with, you can talk to users on your own or any other server. I decided to host my own for three reasons. Firstly, to see if I could and to learn from it. Secondly, to try and rationalise the Cambrian explosion of Slack teams I was being added to in 2019. Thirdly, to take some control of the loss of access to historical messages in some communities that rely on Slack (especially the Carpentries and RSE communities). Since then, I’ve also added a fourth goal: taking advantage of various bridges to bring other messaging network I use (such as Signal and Telegram) into a consistent UI. I’ve also found that my use of Matrix-only rooms has grown as more individuals & communities have adopted the platform. So, I really like Matrix and I use it daily. My problem now is whether to keep self-hosting. Synapse, the only full server implementation at the moment, is really heavy on memory, so I’ve ended up running it on a much bigger server than I thought I’d need, which seems overkill for a single-user instance. So now I have to make a decision about whether it’s worth keeping going, or shutting it down and going back to matrix.org, or setting up on one of the other servers that have sprung up in the last couple of years. There are a couple of other considerations here. Firstly, Synapse resource usage is entirely down to the size of the rooms joined by users of the homeowner, not directly the number of users. So if users have mostly overlapping interests, and thus keep to the same rooms, you can support quite a large community without significant extra resource usage. Secondly, there are a couple of alternative server implementations in development specifically addressing this issue for small servers. Dendrite and Conduit. Neither are quite ready for what I want yet, but are getting close, and when ready that will allow running small homeservers with much more sensible resource usage. So I could start opening up for other users, and at least justify the size of the server that way. I wouldn’t ever want to make it a paid-for service but perhaps people might be willing to make occasional donations towards running costs. That still leaves me with the question of whether I’m comfortable running a service that others may come to rely on, or being responsible for the safety of their information. I could also hold out for Dendrite or Conduit to mature enough that I’m ready to try them, which might not be more than a few months off. Hmm, seems like I’ve convinced myself to stick with it for now, and we’ll see how it goes. In the meantime, if you know me and you want to try it out let me know and I might risk setting you up with an account! What do you miss least about pre-lockdown life? @JanetHughes on Twitter: What do you miss the least from pre-lockdown life? I absolutely do not miss wandering around the office looking for a meeting room for a confidential call or if I hadn’t managed to book a room in advance. Let’s never return to that joyless frustration, hey? 10:27 AM · Feb 3, 2021 After seeing Terence Eden taking Janet Hughes' tweet from earlier this month as a writing prompt, I thought I might do the same. The first thing that leaps to my mind is commuting. At various points in my life I’ve spent between one and three hours a day travelling to and from work and I’ve never more than tolerated it at best. It steals time from your day, and societal norms dictate that it’s your leisure & self-care time that must be sacrificed. Longer commutes allow more time to get into a book or podcast, especially if not driving, but I’d rather have that time at home rather than trying to be comfortable in a train seat designed for some mythical average man shaped nothing like me! The other thing I don’t miss is the colds and flu! Before the pandemic, British culture encouraged working even when ill, which meant constantly coming into contact with people carrying low-grade viruses. I’m not immunocompromised but some allergies and residue of being asthmatic as a child meant that I would get sick 2-3 times a year. A pleasant side-effect of the COVID precautions we’re all taking is that I haven’t been sick for over 12 months now, which is amazing! Finally, I don’t miss having so little control over my environment. One of the things that working from home has made clear is that there are certain unavoidable aspects of working in my shared office that cause me sensory stress, and that are completely unrelated to my work. Working (or trying to work) next to a noisy automatic scanner; trying to find a light level that works for 6 different people doing different tasks; lacking somewhere quiet and still to eat lunch and recover from a morning of meetings or the constant vaguely-distracting bustle of a large shared office. It all takes energy. Although it’s partly been replaced by the new stress of living through a global pandemic, that old stress was a constant drain on my productivity and mood that had been growing throughout my career as I moved (ironically, given the common assumption that seniority leads to more privacy) into larger and larger open plan offices. Remarkable blogging And the handwritten blog saga continues, as I’ve just received my new reMarkable 2 tablet, which is designed for reading, writing and nothing else. It uses a super-responsive e-ink display and writing on it with a stylus is a dream. It has a slightly rough texture with just a bit of friction that makes my writing come out a lot more legibly than on a slippery glass touchscreen. If that was all there was to it, I might not have wasted my money, but it turns out that it runs on Linux and the makers have wisely decided not to lock it down but to give you full root mess. Yes, you read that right: root access. It presents as an ethernet device over USB, so you can SSH in with a password found in the settings and have full control over your own devices. What a novel concept. This fact alone has meant it’s built a small yet devoted community of users who have come up with some clever ways of extending its functionality. In fact, many of these are listed on this GitHub repository. Finally, from what I’ve seen so far, the handwriting recognition is impressive to say the least. This post was written on it and needed only a little editing. I think this is a device that will get a lot of use! GLAM Data Science Network fellow travellers Updates 2021-02-04 Thanks to Gene @dzshuniper@ausglam.space for suggesting ADHO and a better attribution for the opening quote (see comments below for details) See comments & webmentions for details. “If you want to go fast, go alone. If you want to go far, go together.” — African proverb, probably popularised in English by Kenyan church leader Rev. Samuel Kobia (original) This quote is a popular one in the Carpentries community, and I interpret it in this context to mean that a group of people working together is more sustainable than individuals pursuing the same goal independently. That’s something that speaks to me, and that I want to make sure is reflected in nurturing this new community for data science in galleries, archives, libraries & museums (GLAM). To succeed, this work needs to be complementary and collaborative, rather than competitive, so I want to acknowledge a range of other networks & organisations whose activities complement this. The rest of this article is an unavoidably incomplete list of other relevant organisations whose efforts should be acknowledged and potentially built on. And it should go without saying, but just in case: if the work I’m planning fits right into an existing initiative, then I’m happy to direct my resources there rather than duplicate effort. Inspirations & collaborators Groups with similar goals or undertaking similar activities, but focused on a different sector, geographic area or topic. I think we should make as much use of and contribution to these existing communities as possible since there will be significant overlap. code4lib Probably the closest existing community to what I want to build, but primarily based in the US, so timezones (and physical distance for in-person events) make it difficult to participate fully. This is a well-established community though, with regular events including an annual conference so there’s a lot to learn here. newCardigan Similar to code4lib but an Australian focus, so the timezone problem is even bigger! GLAM Labs Focused on supporting the people experimenting with and developing the infrastructure to enable scholars to access GLAM materials in new ways. In some ways, a GLAM data science network would be complementary to their work, by providing people not directly involved with building GLAM Labs with the skills to make best use of GLAM Labs infrastructure. UK Government data science community Another existing community with very similar intentions, but focused on UK Government sector. Clearly the British Library and a few national & regional museums & archives fall into this, but much of the rest of the GLAM sector does not. Artifical Intelligence for Libraries, Archives & Museums (AI4LAM) A multinational collaboration between several large libraries, archives and museums with a specific focus on the Artificial Intelligence (AI) subset of data science UK Reproducibility Network A network of researchers, primarily in HEIs, with an interest in improving the transparency and reliability of academic research. Mostly science-focused but with some overlap of goals around ethical and robust use of data. Museums Computer Group I’m less familiar with this than the others, but it seems to have a wider focus on technology generally, within the slightly narrower scope of museums specifically. Again, a lot of potential for collaboration. Training Several organisations and looser groups exist specifically to develop and deliver training that will be relevant to members of this network. The network also presents an opportunity for those who have done a workshop with one of these and want to know what the “next steps” are to continue their data science journey. The Carpentries, aka: Library Carpentry Data Carpentry Software Carpentry Data Science Training for Librarians (DST4L) The Programming Historian CDH Cultural Heritage Data School Supporters These misson-driven organisations have goals that align well with what I imagine for the GLAM DSN, but operate at a more strategic level. They work by providing expert guidance and policy advice, lobbying and supporting specific projects with funding and/or effort. In particular, the SSI runs a fellowship programme which is currently providing a small amount of funding to this project. Digital Preservation Coalition (DPC) Software Sustainability Institute (SSI) Research Data Alliance (RDA) Alliance of Digital Humanities Organizations (ADHO) … and its Libraries and Digital Humanities Special Interest Group (Lib&DH SIG) Professional bodies These organisations exist to promote the interests of professionals in particular fields, including supporting professional development. I hope they will provide communication channels to their various members at the least, and may be interested in supporting more directly, depending on their mission and goals. Society of Research Software Engineering Chartered Institute of Library and Information Professionals Archives & Records Association Museums Association Conclusion As I mentioned at the top of the page, this list cannot possibly be complete. This is a growing area and I’m not the only or first person to have this idea. If you can think of anything glaring that I’ve missed and you think should be on this list, leave a comment or tweet/toot at me! A new font for the blog I’ve updated my blog theme to use the quasi-proportional fonts Iosevka Aile and Iosevka Etoile. I really like the aesthetic, as they look like fixed-width console fonts (I use the true fixed-width version of Iosevka in my terminal and text editor) but they’re actually proportional which makes them easier to read. https://typeof.net/Iosevka/ Training a model to recognise my own handwriting If I’m going to train an algorithm to read my weird & awful writing, I’m going to need a decent-sized training set to work with. And since one of the main things I want to do with it is to blog “by hand” it makes sense to focus on that type of material for training. In other words, I need to write out a bunch of blog posts on paper, scan them and transcribe them as ground truth. The added bonus of this plan is that after transcribing, I also end up with some digital text I can use as an actual post — multitasking! So, by the time you read this, I will have already run it through a manual transcription process using Transkribus to add it to my training set, and copy-pasted it into emacs for posting. This is a fun little project because it means I can: Write more by hand with one of my several nice fountain pens, which I enjoy Learn more about the operational process some of my colleagues go through when digitising manuscripts Learn more about the underlying technology & maths, and how to tune the process Produce more lovely content! For you to read! Yay! Write in a way that forces me to put off editing until after a first draft is done and focus more on getting the whole of what I want to say down. That’s it for now — I’ll keep you posted as the project unfolds. Addendum Tee hee! I’m actually just enjoying the process of writing stuff by hand in long-form prose. It’ll be interesting to see how the accuracy turns out and if I need to be more careful about neatness. Will it be better or worse than the big but generic models used by Samsung Notes or OneNote. Maybe I should include some stylus-written text for comparison. Blogging by hand I wrote the following text on my tablet with a stylus, which was an interesting experience: So, thinking about ways to make writing fun again, what if I were to write some of them by hand? I mean I have a tablet with a pretty nice stylus, so maybe handwriting recognition could work. One major problem, of course, is that my handwriting is AWFUL! I guess I’ll just have to see whether the OCR is good enough to cope… It’s something I’ve been thinking about recently anyway: I enjoy writing with a proper fountain pen, so is there a way that I can have a smooth workflow to digitise handwritten text without just typing it back in by hand? That would probably be preferable to this, which actually seems to work quite well but does lead to my hand tensing up to properly control the stylus on the almost-frictionless glass screen. I’m surprised how well it worked! Here’s a sample of the original text: And here’s the result of converting that to text with the built-in handwriting recognition in Samsung Notes: Writing blog posts by hand So, thinking about ways to make writing fun again, what if I were to write some of chum by hand? I mean, I have a toldest winds a pretty nice stylus, so maybe handwriting recognition could work. One major problems, ofcourse, is that my , is AWFUL! Iguess I’ll just have to see whattime the Ocu is good enough to cope… It’s something I’ve hun tthinking about recently anyway: I enjoy wilting with a proper fountain pion, soischeme a way that I can have a smooch workflow to digitise handwritten text without just typing it back in by hand? That wouldprobally be preferableto this, which actually scams to work quito wall but doers load to my hand tensing up to properly couldthe stylus once almost-frictionlessg lass scream. It’s pretty good! It did require a fair bit of editing though, and I reckon we can do better with a model that’s properly trained on a large enough sample of my own handwriting. What I want from a GLAM/Cultural Heritage Data Science Network Introduction As I mentioned last year, I was awarded a Software Sustainability Institute Fellowship to pursue the project of setting up a Cultural Heritage/GLAM data science network. Obviously, the global pandemic has forced a re-think of many plans and this is no exception, so I’m coming back to reflect on it and make sure I’m clear about the core goals so that everything else still moves in the right direction. One of the main reasons I have for setting up a GLAM data science network is because it’s something I want. The advice to “scratch your own itch” is often given to people looking for an open project to start or contribute to, and the lack of a community of people with whom to learn & share ideas and practice is something that itches for me very much. The “motivation” section in my original draft project brief for this work said: Cultural heritage work, like all knowledge work, is increasingly data-based, or at least gives opportunities to make use of data day-to-day. The proper skills to use this data enable more effective working. Knowledge and experience thus gained improves understanding of and empathy with users also using such skills. But of course, I have my own reasons for wanting to do this too. In particular, I want to: Advocate for the value of ethical, sustainable data science across a wide range of roles within the British Library and the wider sector Advance the sector to make the best use of data and digital sources in the most ethical and sustainable way possible Understand how and why people use data from the British Library, and plan/deliver better services to support that Keep up to date with relevant developments in data science Learn from others' skills and experiences, and share my own in turn Those initial goals imply some further supporting goals: Build up the confidence of colleagues who might benefit from data science skills but don’t feel they are “technical” or “computer literate” enough Further to that, build up a base of colleagues with the confidence to share their skills & knowledge with others, whether through teaching, giving talks, writing or other channels Identify common awareness gaps (skills/knowledge that people don’t know they’re missing) and address them Develop a communal space (primarily online) in which people feel safe to ask questions Develop a body of professional practice and help colleagues to learn and contribute to the evolution of this, including practices of data ethics, software engineering, statistics, high performance computing, … Break down language barriers between data scientists and others I’ll expand on this separately as my planning develops, but here are a few specific activities that I’d like to be able to do to support this: Organise less-formal learning and sharing events to complement the more formal training already available within organisations and the wider sector, including “show and tell” sessions, panel discussions, code cafés, masterclasses, guest speakers, reading/study groups, co-working sessions, … Organise training to cover intermediate skills and knowledge currently missing from the available options, including the awareness gaps and professional practice mentioned above Collect together links to other relevant resources to support self-led learning Decisions to be made There are all sorts of open questions in my head about this right now, but here are some of the key ones. Is it GLAM or Cultural Heritage? When I first started planning this whole thing, I went with “Cultural Heritage”, since I was pretty transparently targeting my own organisation. The British Library is fairly unequivocally a CH organisation. But as I’ve gone along I’ve found myself gravitating more towards the term “GLAM” (which stands for Galleries, Libraries, Archives, Museums) as it covers a similar range of work but is clearer (when you spell out the acronym) about what kinds of work are included. What skills are relevant? This turns out to be surprisingly important, at least in terms of how the community is described, as they define the boundaries of the community and can be the difference between someone feeling welcome or excluded. For example, I think that some introductory statistics training would be immensely valuable for anyone working with data to understand what options are open to them and what limitations those options have, but is the word “statistics” offputting per se to those who’ve chosen a career in arts & humanities? I don’t know because I don’t have that background and perspective. Keep it internal to the BL, or open up early on? I originally planned to focus primarily on my own organisation to start with, feeling that it would be easier to organise events and build a network within a single organisation. However, the pandemic has changed my thinking significantly. Firstly, it’s now impossible to organise in-person events and that will continue for quite some time to come, so there is less need to focus on the logistics of getting people into the same room. Secondly, people within the sector are much more used to attending remote events, which can easily be opened up to multiple organisations in many countries, timezones allowing. It now makes more sense to focus primarily on online activities, which opens up the possibility of building a critical mass of active participants much more quickly by opening up to the wider sector. Conclusion This is the type of post that I could let run and run without ever actually publishing, but since it’s something I need feedback and opinions on from other people, I’d better ship it! I really want to know what you think about this, whether you feel it’s relevant to you and what would make it useful. Comments are open below, or you can contact me via Mastodon or Twitter. Writing About Not Writing Under Construction Grunge Sign by Nicolas Raymond — CC BY 2.0 Every year, around this time of year, I start doing two things. First, I start thinking I could really start to understand monads and write more than toy programs in Haskell. This is unlikely to ever actually happen unless and until I get a day job where I can justify writing useful programs in Haskell, but Advent of Code always gets me thinking otherwise. Second, I start mentally writing this same post. You know, the one about how the blogger in question hasn’t had much time to write but will be back soon? “Sorry I haven’t written much lately…” It’s about as cliché as a Geocities site with a permanent “Under construction” GIF. At some point, not long after the dawn of ~time~ the internet, most people realised that every website was permanently under construction and publishing something not ready to be published was just pointless. So I figured this year I’d actually finish writing it and publish it. After all, what’s the worst that could happen? If we’re getting all reflective about this, I could probably suggest some reasons why I’m not writing much: For a start, there’s a lot going on in both my world and The World right now, which doesn’t leave a lot of spare energy after getting up, eating, housework, working and a few other necessary activities. As a result, I’m easily distracted and I tend to let myself get dragged off in other directions before I even get to writing much of anything. If I do manage to focus on this blog in general, I’ll often end up working on some minor tweak to the theme or functionality. I mean, right now I’m wondering if I can do something clever in my text-editor (Emacs, since you’re asking) to streamline my writing & editing process so it’s more elegant, efficient, ergonomic and slightly closer to perfect in every way. It also makes me much more likely to self-censor, and to indulge my perfectionist tendencies to try and tweak the writing until it’s absolutely perfect, which of course never happens. I’ve got a whole heap of partly-written posts that are juuuust waiting for the right motivation for me to just finish them off. The only real solution is to accept that: I’m not going to write much and that’s probably OK What I do write won’t always be the work of carefully-researched, finely crafted genius that I want it to be, and that’s probably OK too Also to remember why I started writing and publishing stuff in the first place: to reflect and get my thoughts out onto a (virtual) page so that I can see them, figure out whether I agree with myself and learn; and to stimulate discussion and get other views on my (possibly uninformed, incorrect or half-formed) thoughts, also to learn. In other words, a thing I do for me. It’s easy to forget that and worry too much about whether anyone else wants to read my s—t. Will you notice any changes? Maybe? Maybe not? Who knows. But it’s a new year and that’s as good a time for a change as any. When is a persistent identifier not persistent? Or an identifier? I wrote a post on the problems with ISBNs as persistent identifiers (PIDS) for work, so check it out if that sounds interesting. IDCC20 reflections I’m just back from IDCC20, so here are a few reflections on this year’s conference. You can find all the available slides and links to shared notes on the conference programme. There’s also a list of all the posters and an overview of the Unconference Skills for curation of diverse datasets Here in the UK and elsewhere, you’re unlikely to find many institutions claiming to apply a deep level of curation to every dataset/software package/etc deposited with them. There are so many different kinds of data and so few people in any one institution doing “curation” that it’s impossible to do this for everything. Absent the knowledge and skills required to fully evaluate an object the best that can be done is usually to make a sense check on the metadata and flag up with the depositor potential for high-level issues such as accidental disclosure of sensitive personal information. The Data Curation Network in the United States is aiming to address this issue by pooling expertise across multiple organisations. The pilot has been highly successful and they’re now looking to obtain funding to continue this work. The Swedish National Data Service is experimenting with a similar model, also with a lot of success. As well as sharing individual expertise, the DCN collaboration has also produced some excellent online quick-reference guides for curating common types of data. We had some further discussion as part of the Unconference on the final day about what it would look like to introduce this model in the UK. There was general agreement that this was a good idea and a way to make optimal use of sparse resources. There were also very valid concerns that it would be difficult in the current financial climate for anyone to justify doing work for another organisation, apparently for free. In my mind there are two ways around this, which are not mutually exclusive by any stretch of the imagination. First is to Just Do It: form an informal network of curators around something simple like a mailing list, and give it a try. Second is for one or more trusted organisations to provide some coordination and structure. There are several candidates for this including DCC, Jisc, DPC and the British Library; we all have complementary strengths in this area so it’s my hope that we’ll be able to collaborate around it. In the meantime, I hope the discussion continues. Artificial intelligence, machine learning et al As you might expect at any tech-oriented conference there was a strong theme of AI running through many presentations, starting from the very first keynote from Francine Berman. Her talk, The Internet of Things: Utopia or Dystopia? used self-driving cars as a case study to unpack some of the ethical and privacy implications of AI. For example, driverless cars can potentially increase efficiency, both through route-planning and driving technique, but also by allowing fewer vehicles to be shared by more people. However, a shared vehicle is not a private space in the way your own car is: anything you say or do while in that space is potentially open to surveillance. Aside from this, there are some interesting ideas being discussed, particularly around the possibility of using machine learning to automate increasingly complex actions and workflows such as data curation and metadata enhancement. I didn’t get the impression anyone is doing this in the real world yet, but I’ve previously seen theoretical concepts discussed at IDCC make it into practice so watch this space! Playing games! Training is always a major IDCC theme, and this year two of the most popular conference submissions described games used to help teach digital curation concepts and skills. Mary Donaldson and Matt Mahon of the University of Glasgow presented their use of Lego to teach the concept of sufficient metadata. Participants build simple models before documenting the process and breaking them down again. Then everyone had to use someone else’s documentation to try and recreate the models, learning important lessons about assumptions and including sufficient detail. Kirsty Merrett and Zosia Beckles from the University of Bristol brought along their card game “Researchers, Impact and Publications (RIP)”, based on the popular “Cards Against Humanity”. RIP encourages players to examine some of the reasons for and against data sharing with plenty of humour thrown in. Both games were trialled by many of the attendees during Thursday’s Unconference. Summary I realised in Dublin that it’s 8 years since I attended my first IDCC, held at the University of Bristol in December 2011 while I was still working at the nearby University of Bath. While I haven’t been every year, I’ve been to every one held in Europe since then and it’s interesting to see what has and hasn’t changed. We’re no longer discussing data management plans, data scientists or various other things as abstract concepts that we’d like to encourage, but dealing with the real-world consequences of them. The conference has also grown over the years: this year was the biggest yet, boasting over 300 attendees. There has been especially big growth in attendees from North America, Australasia, Africa and the Middle East. That’s great for the diversity of the conference as it brings in more voices and viewpoints than ever. With more people around to interact with I have to work harder to manage my energy levels but I think that’s a small price to pay. Iosevka: a nice fixed-width-font Iosevka is a nice, slender monospace font with a lot of configurable variations. Check it out: https://typeof.net/Iosevka/ Replacing comments with webmentions Just a quickie to say that I’ve replaced the comment section at the bottom of each post with webmentions, which allows you to comment by posting on your own site and linking here. It’s a fundamental part of the IndieWeb, which I’m slowly getting to grips with having been a halfway member of it for years by virtue of having my own site on my own domain. I’d already got rid of Google Analytics to stop forcing that tracking on my visitors, I wanted to get rid of Disqus too because I’m pretty sure the only way that is free for me is if they’re selling my data and yours to third parties. Webmention is a nice alternative because it relies only on open standards, has no tracking and allows people to control their own comments. While I’m currently using a third-party service to help, I can switch to self-hosted at any point in the future, completely transparently. Thanks to webmention.io, which handles incoming webmentions for me, and webmention.js, which displays them on the site, I can keep it all static and not have to implement any of this myself, which is nice. It’s a bit harder to comment because you have to be able to host your own content somewhere, but then almost no-one ever commented anyway, so it’s not like I’ll lose anything! Plus, if I get Bridgy set up right, you should be able to comment just by replying on Mastodon, Twitter or a few other places. A spot of web searching shows that I’m not the first to make the Disqus -> webmentions switch (yes, I’m putting these links in blatantly to test outgoing webmentions with Telegraph…): So long Disqus, hello webmention — Nicholas Hoizey Bye Disqus, hello Webmention! — Evert Pot Implementing Webmention on a static site — Deluvi Let’s see how this goes! Bridging Carpentries Slack channels to Matrix It looks like I’ve accidentally taken charge of bridging a bunch of The Carpentries Slack channels over to Matrix. Given this, it seems like a good idea to explain what that sentence means and reflect a little on my reasoning. I’m more than happy to discuss the pros and cons of this approach If you just want to try chatting in Matrix, jump to the getting started section What are Slack and Matrix? Slack (see also on Wikipedia), for those not familiar with it, is an online text chat platform with the feel of IRC (Internet Relay Chat), a modern look and feel and both web and smartphone interfaces. By providing a free tier that meets many peoples' needs on its own Slack has become the communication platform of choice for thousands of online communities, private projects and more. One of the major disadvantages of using Slack’s free tier, as many community organisations do, is that as an incentive to upgrade to a paid service your chat history is limited to the most recent 10,000 messages across all channels. For a busy community like The Carpentries, this means that messages older than about 6-7 weeks are already inaccessible, rendering some of the quieter channels apparently empty. As Slack is at pains to point out, that history isn’t gone, just archived and hidden from view unless you pay the low, low price of $1/user/month. That doesn’t seem too pricy, unless you’re a non-profit organisation with a lot of projects you want to fund and an active membership of several hundred worldwide, at which point it soon adds up. Slack does offer to waive the cost for registered non-profit organisations, but only for one community. The Carpentries is not an independent organisation, but one fiscally sponsored by Community Initiatives, which has already used its free quota of one elsewhere rendering the Carpentries ineligible. Other umbrella organisations such as NumFocus (and, I expect, Mozilla) also run into this problem with Slack. So, we have a community which is slowly and inexorably losing its own history behind a paywall. For some people this is simply annoying, but from my perspective as a facilitator of the preservation of digital things the community is haemhorraging an important record of its early history. Enter Matrix. Matrix is a chat platform similar to IRC, Slack or Discord. It’s divided into separate channels, and users can join one or more of these to take part in the conversation happening in those channels. What sets it apart from older technology like IRC and walled gardens like Slack & Discord is that it’s federated. Federation means simply that users on any server can communicate with users and channels on any other server. Usernames and channel addresses specify both the individual identifier and the server it calls home, just as your email address contains all the information needed for my email server to route messages to it. While users are currently tied to their home server, channels can be mirrored and synchronised across multiple servers making the overall system much more resilient. Can’t connect to your favourite channel on server X? No problem: just connect via its alias on server Y and when X comes back online it will be resynchronised. The technology used is much more modern and secure than the aging IRC protocol, and there’s no vender lock-in like there is with closed platforms like Slack and Discord. On top of that, Matrix channels can easily be “bridged” to channels/rooms on other platforms, including, yes, Slack, so that you can join on Matrix and transparently talk to people connected to the bridged room, or vice versa. So, to summarise: The current Carpentries Slack channels could be bridged to Matrix at no cost and with no disruption to existing users The history of those channels from that point on would be retained on matrix.org and accessible even when it’s no longer available on Slack If at some point in the future The Carpentries chose to invest in its own Matrix server, it could adopt and become the main Matrix home of these channels without disruption to users of either Matrix or (if it’s still in use at that point) Slack Matrix is an open protocol, with a reference server implementation and wide range of clients all available as free software, which aligns with the values of the Carpentries community On top of this: I’m fed up of having so many different Slack teams to switch between to see the channels in all of them, and prefer having all the channels I regularly visit in a single unified interface; I wanted to see how easy this would be and whether others would also be interested. Given all this, I thought I’d go ahead and give it a try to see if it made things more manageable for me and to see what the reaction would be from the community. How can I get started? !!! reminder Please remember that, like any other Carpentries space, the Code of Conduct applies in all of these channels. First, sign up for a Matrix account. The quickest way to do this is on the Matrix “Try now” page, which will take you to the Riot Web client which for many is synonymous with Matrix. Other clients are also available for the adventurous. Second, join one of the channels. The links below will take you to a page that will let you connect via your preferred client. You’ll need to log in as they are set not to allow guest access, but, unlike Slack, you won’t need an invitation to be able to join. #general — the main open channel to discuss all things Carpentries #random — anything that would be considered offtopic elsewhere #welcome — join in and introduce yourself! That’s all there is to getting started with Matrix. To find all the bridged channels there’s a Matrix “community” that I’ve added them all to: Carpentries Matrix community. There’s a lot more, including how to bridge your favourite channels from Slack to Matrix, but this is all I’ve got time and space for here! If you want to know more, leave a comment below, or send me a message on Slack (jezcope) or maybe Matrix (@petrichor:matrix.org)! I’ve also made a separate channel for Matrix-Slack discussions: #matrix on Slack and Carpentries Matrix Discussion on Matrix MozFest19 first reflections Discussions of neurodiversity at #mozfest Photo by Jennifer Riggins The other weekend I had my first experience of Mozilla Festival, aka #mozfest. It was pretty awesome. I met quite a few people in real life that I’ve previously only known (/stalked) on Twitter, and caught up with others that I haven’t seen for a while. I had the honour of co-facilitating a workshop session on imposter syndrome and how to deal with it with the wonderful Yo Yehudi and Emmy Tsang. We all learned a lot and hope our participants did too; we’ll be putting together a summary blog post as soon as we can get our act together! I also attended a great session, led by Kiran Oliver (psst, they’re looking for a new challenge), on how to encourage and support a neurodiverse workforce. I was only there for the one day, and I really wish that I’d taken the plunge and committed to the whole weekend. There’s always next year though! To be honest, I’m just disappointed that I never had the courage to go sooner, Music for working Today1 the office conversation turned to blocking out background noise. (No, the irony is not lost on me.) Like many people I work in a large, open-plan office, and I’m not alone amongst my colleagues in sometimes needing to find a way to boost concentration by blocking out distractions. Not everyone is like this, but I find music does the trick for me. I also find that different types of music are better for different types of work, and I use this to try and manage my energy better. There are more distractions than auditory noise, and at times I really struggle with visual noise. Rather than have this post turn into a rant about the evils of open-plan offices, I’ll just mention that the scientific evidence doesn’t paint them in a good light2, or at least suggests that the benefits are more limited in scope than is commonly thought3, and move on to what I actually wanted to share: good music for working to. There are a number of genres that I find useful for working. Generally, these have in common a consistent tempo, a lack of lyrics, and enough variation to prevent boredom without distracting. Familiarity helps my concentration too so I’ll often listen to a restricted set of albums for a while, gradually moving on by dropping one out and bringing in another. In my case this includes: Traditional dance music, generally from northern and western European traditions for me. This music has to be rhythmically consistent to allow social dancing, and while the melodies are typically simple repeated phrases, skilled musicians improvise around that to make something beautiful. I tend to go through phases of listening to particular traditions; I’m currently listening to a lot of French, Belgian and Scandinavian. Computer game soundtracks, which are specifically designed to enhance gameplay without distracting, making them perfect for other activities requiring a similar level of concentration. Chiptunes and other music incorporating it; partly overlapping with the previous category, chiptunes is music made by hacking the audio chips from (usually) old computers and games machines to become an instrument for new music. Because of the nature of the instrument, this will have millisecond-perfect rhythm and again makes for undistracting noise blocking with an extra helping of nostalgia! Purists would disagree with me, but I like artists that combine chiptunes with other instruments and effects to make something more complete-sounding. Retrowave/synthwave/outrun, synth-driven music that’s instantly familiar as the soundtrack to many 90s sci-fi and thriller movies. Atmospheric, almost dreamy, but rhythmic with a driving beat, it’s another genre that fits into the “pleasing but not too surprising” category for me. So where to find this stuff? One of the best resources I’ve found is Music for Programming which provides carefully curated playlists of mostly electronic music designed to energise without distracting. They’re so well done that the tracks move seamlessly, one to the next, without ever getting boring. Spotify is an obvious option, and I do use it quite a lot. However, I’ve started trying to find ways to support artists more directly, and Bandcamp seems to be a good way of doing that. It’s really easy to browse by genre, or discover artists similar to what you’re currently hearing. You can listen for free as long as you don’t mind occasional nags to buy the music you’re hearing, but you can also buy tracks or albums. Music you’ve paid for is downloadable in several open, DRM-free formats for you to keep, and you know that a decent chunk of that cash is going directly to that artist. I also love noise generators; not exactly music, but a variety of pleasant background noises, some of which nicely obscure typical office noise. I particularly like mynoise.net, which has a cornucopia of different natural and synthetic noises. Each generator comes with a range of sliders allowing you to tweak the composition and frequency range, and will even animate them randomly for you to create a gently shifting soundscape. A much simpler, but still great, option is Noisli with it’s nice clean interface. Both offer apps for iOS and Android. For bonus points, you can always try combining one or more of the above. Adding in a noise generator allows me to listen to quieter music while still getting good environmental isolation when I need concentration. Another favourite combo is to open both the cafe and rainfall generators from myNoise, made easier by the ability to pop out a mini-player then open up a second generator. I must be missing stuff though. What other musical genres should I try? What background sounds are nice to work to? Well, you know. The other day. Whatever. ↩︎ See e.g.: Lee, So Young, and Jay L. Brand. ‘Effects of Control over Office Workspace on Perceptions of the Work Environment and Work Outcomes’. Journal of Environmental Psychology 25, no. 3 (1 September 2005): 323–33. https://doi.org/10.1016/j.jenvp.2005.08.001. ↩︎ Open plan offices can actually work under certain conditions, The Conversation ↩︎ Working at the British Library: 6 months in It barely seems like it, but I’ve been at the British Library now for nearly 6 months. It always takes a long time to adjust and from experience I know it’ll be another year before I feel fully settled, but my team, department and other colleagues have really made me feel welcome and like I belong. One thing that hasn’t got old yet is the occasional thrill of remembering that I work at my national library now. Every now and then I’ll catch a glimpse of the collections at Boston Spa or step into one of the reading rooms and think “wow, I actually work here!” I also like having a national and international role to play, which means I get to travel a bit more than I used to. Budgets are still tight so there are limits, and I still prefer to be home more often than not, but there is more scope in this job than I’ve had previously for travelling to conferences, giving talks that change the way people think, and learning in different contexts. I’m learning a lot too, especially how to work with and manage people split across multiple sites, and the care and feeding of budgets. As well as missing mo old team at Sheffield, I do also miss some of the direct contact I had with researchers in HE. I especially miss the teaching work, but also the higher-level influencing of more senior academics to change practices on a wider scale. Still, I get to use those influencing skills in different ways now, and I’m still involved with the Carpentries which should let me keep my hand in with teaching. I still deal with my general tendency to try and do All The Things, and as before I’m slowly learning to recognise it, tame it and very occasionally turn it to my advantage. That also leads to feelings of imposterism that are only magnified by the knowledge that I now work at a national institution! It’s a constant struggle some days to believe that I’ve actually earned my place here through hard work, Even if I don’t always feel that I have, my colleagues here certainly have, so I should have more faith in their opinion of me. Finally, I couldn’t write this type of thing without mentioning the commute. I’ve gone from 90 minutes each way on a good day (up to twice that if the trains were disrupted) to 35 minutes each way along fairly open roads. I have less time to read, but much more time at home. On top of that, the library has implemented flexitime across all pay grades, with even senior managers strongly encouraged to make full use. Not only is this an important enabler of equality across the organisation, it relieves for me personally the pressure to work over my contracted hours and the guilt I’ve always felt at leaving work even 10 minutes early. If I work late, it’s now a choice I’m making based on business needs instead of guilt and in full knowledge that I’ll get that time back later. So that’s where I am right now. I’m really enjoying the work and the culture, and I look forward to what the next 6 months will bring! RDA Plenary 13 reflection Photo by me I sit here writing this in the departure lounge at Philadelphia International Airport, waiting for my Aer Lingus flight back after a week at the 13th Research Data Alliance (RDA) Plenary (although I’m actually publishing this a week or so later at home). I’m pretty exhausted, partly because of the jet lag, and partly because it’s been a very full week with so much to take in. It’s my first time at an RDA Plenary, and it was quite a new experience for me! First off, it’s my first time outside Europe, and thus my first time crossing quite so many timezones. I’ve been waking at 5am and ready to drop by 8pm, but I’ve struggled on through! Secondly, it’s the biggest conference I’ve been to for a long time, both in number of attendees and number of parallel sessions. There’s been a lot of sustained input so I’ve been very glad to have a room in the conference hotel and be able to escape for a few minutes when I needed to recharge. Thirdly, it’s not really like any other conference I’ve been to: rather than having large numbers of presentations submitted by attendees, each session comprises lots of parallel meetings of RDA interest groups and working groups. It’s more community-oriented: an opportunity for groups to get together face to face and make plans or show off results. I found it pretty intense and struggled to take it all in, but incredibly valuable nonetheless. Lots of information to process (I took a lot of notes) and a few contacts to follow up on too, so overall I loved it! Using Pipfile in Binder Photo by Sear Greyson on Unsplash I recently attended a workshop, organised by the excellent team of the Turing Way project, on a tool called BinderHub. BinderHub, along with public hosting platform MyBinder, allows you to publish computational notebooks online as “binders” such that they’re not static but fully interactive. It’s able to do this by using a tool called repo2docker to capture the full computational environment and dependencies required to run the notebook. !!! aside “What is the Turing Way?” The Turing Way is, in its own words, “a lightly opinionated guide to reproducible data science.” The team is building an open textbook and running a number of workshops for scientists and research software engineers, and you should check out the project on Github. You could even contribute! The Binder process goes roughly like this: Do some work in a Jupyter Notebook or similar Put it into a public git repository Add some extra metadata describing the packages and versions your code relies on Go to mybinder.org and tell it where to find your repository Open the URL it generates for you Profit Other than step 5, which can take some time to build the binder, this is a remarkably quick process. It supports a number of different languages too, including built-in support for R, Python and Julia and the ability to configure pretty much any other language that will run on Linux. However, the Python support currently requires you to have either a requirements.txt or Conda-style environment.yml file to specify dependencies, and I commonly use a Pipfile for this instead. Pipfile allows you to specify a loose range of compatible versions for maximal convenience, but then locks in specific versions for maximal reproducibility. You can upgrade packages any time you want, but you’re fully in control of when that happens, and the locked versions are checked into version control so that everyone working on a project gets consistency. Since Pipfile is emerging as something of a standard thought I’d see if I could use that in a binder, and it turns out to be remarkably simple. The reference implementation of Pipfile is a tool called pipenv by the prolific Kenneth Reitz. All you need to use this in your binder is two files of one line each. requirements.txt tells repo2binder to build a Python-based binder, and contains a single line to install the pipenv package: pipenv Then postBuild is used by repo2binder to install all other dependencies using pipenv: pipenv install --system The --system flag tells pipenv to install packages globally (its default behaviour is to create a Python virtualenv). With these two files, the binder builds and runs as expected. You can see a complete example that I put together during the workshop here on Gitlab. What do you think I should write about? I’ve found it increasingly difficult to make time to blog, and it’s not so much not having the time — I’m pretty privileged in that regard — but finding the motivation. Thinking about what used to motivate me, one of the big things was writing things that other people wanted to read. Rather than try to guess, I thought I’d ask! Those who know what I'm about, what would you read about, if it was written by me?I'm trying to break through the blog-writers block and would love to know what other people would like to see my ill-considered opinions on.— Jez Cope (@jezcope) March 7, 2019 I’m still looking for ideas, so please tweet me or leave me a comment below. Below are a few thoughts that I’m planning to do something with. Something taking one of the more techy aspects of Open Research, breaking it down and explaining the benefits for non-techy folks?— Dr Beth 🏳️🌈 🐺 (@PhdGeek) March 7, 2019 Skills (both techy and non techy) that people need to most effectively support RDM— Kate O'Neill (@KateFONeill) March 7, 2019 Sometimes I forget that my background makes me well-qualified to take some of these technical aspects of the job and break them down for different audiences. There might be a whole series in this… Carrying on our conversation last week I'd love to hear more about how you've found moving from an HE lib to a national library and how you see the BL's role in RDM. Appreciate this might be a bit niche/me looking for more interesting things to cite :)— Rosie Higman (@RosieHLib) March 7, 2019 This is interesting, and something I’d like to reflect on; moving from one job to another always has lessons and it’s easy to miss them if you’re not paying attention. Another one for the pile. Life without admin rights to your computer— Mike Croucher (@walkingrandomly) March 7, 2019 This is so frustrating as an end user, but at the same time I get that endpoint security is difficult and there are massive risks associated with letting end users have admin rights. This is particularly important at the BL: as custodian’s of a nation’s cultural heritage, the risk for us is bigger than for many and for this reason we are now Cyber Essentials Plus certified. At some point I’d like to do some research and have a conversation with someone who knows a lot more about InfoSec to work out what the proper approach to this, maybe involving VMs and a demilitarized zone on the network. I’m always looking for more inspiration, so please leave a comment if you’ve got anything you’d like to read my thoughts on. If you’re not familiar with my writing, please take a minute or two to explore the blog; the tags page is probably a good place to get an overview. Ultimate Hacking Keyboard: first thoughts Following on from the excitement of having built a functioning keyboard myself, I got a parcel on Monday. Inside was something that I’ve been waiting for since September: an Ultimate Hacking Keyboard! Where the custom-built Laplace is small and quiet for travelling, the UHK is to be my main workhorse in the study at home. Here are my first impressions: Key switches I went with Kailh blue switches from the available options. In stark contrast to the quiet blacks on the Laplace, blues are NOISY! They have an extra piece of plastic inside the switch that causes an audible and tactile click when the switch activates. This makes them very satisfying to type on and should help as I train my fingers not to bottom out while typing, but does make them unsuitable for use in a shared office! Here are some animations showing how the main types of key switch vary. Layout This keyboard has what’s known as a 60% layout: no number pad, arrows or function keys. As with the more spartan Laplace, these “missing” keys are made up for with programmable layers. For example, the arrow keys are on the Mod layer on the I/J/K/L keys, so I can access them without moving from the home row. I actually find this preferable to having to move my hand to the right to reach them, and I really never used the number pad in any case. Split This is a split keyboard, which means that the left and right halves can be separated to place the hands further apart which eases strain across the shoulders. The UHK has a neat coiled cable joining the two which doesn’t get in the way. A cool design feature is that the two halves can be slotted back together and function perfectly well as a non-split keyboard too, held together by magnets. There are even electrical contacts so that when the two are joined you don’t need the linking cable. Programming The board is fully programmable, and this is achieved via a custom (open source) GUI tool which talks to the (open source) firmware on the board. You can have multiple keymaps, each of which has a separate Base, Mod, Fn and Mouse layer, and there’s an LED display that shows a short mnemonic for the currently active map. I already have a customised Dvorak layout for day-to-day use, plus a standard QWERTY for not-me to use and an alternative QWERTY which will be slowly tweaked for games that don’t work well with Dvorak. Mouse keys One cool feature that the designers have included in the firmware is the ability to emulate a mouse. There’s a separate layer that allows me to move the cursor, scroll and click without moving my hands from the keyboard. Palm rests Not much to say about the palm rests, other than they are solid wood, and chunky, and really add a little something. I have to say, I really like it so far! Overall it feels really well designed, with every little detail carefully thought out and excellent build quality and a really solid feeling. Custom-built keyboard I’m typing this post on a keyboard I made myself, and I’m rather excited about it! Why make my own keyboard? I wanted to learn a little bit about practical electronics, and I like to learn by doing I wanted to have the feeling of making something useful with my own hands I actually need a small, keyboard with good-quality switches now that I travel a fair bit for work and this lets me completely customise it to my needs Just because! While it is possible to make a keyboard completely from scratch, it makes much more sense to put together some premade parts. The parts you need are: PCB (printed circuit board): the backbone of the keyboard, to which all the other electrical components attach, this defines the possible physical locations for each key Switches: one for each key to complete a circuit whenever you press it Keycaps: switches are pretty ugly and pretty uncomfortable to press, so each one gets a cap; these are what you probably think of as the “keys” on your keyboard and come in almost limitless variety of designs (within the obvious size limitation) and are the easiest bit of personalisation Controller: the clever bit, which detects open and closed switches on the PCB and tells your computer what keys you pressed via a USB cable Firmware: the program that runs on the controller starts off as source code like any other program, and altering this can make the keyboard behave in loads of different ways, from different layouts to multiple layers accessed by holding a particular key, to macros and even emulating a mouse! In my case, I’ve gone for the following: PCB Laplace from keeb.io, a very compact 47-key (“40%") board, with no number pad, function keys or number row, but a lot of flexibility for key placement on the bottom row. One of my key design goals was small size so I can just pop it in my bag and have on my lap on the train. Controller Elite-C, designed specifically for keyboard builds to be physically compatible with the cheaper Pro Micro, with a more-robust USB port (the Pro Micro’s has a tendency to snap off), and made easier to program with a built-in reset button and better bootloader. Switches Gateron Black: Gateron is one of a number of manufacturers of mechanical switches compatible with the popular Cherry range. The black switch is linear (no click or bump at the activation point) and slightly heavier sprung than the more common red. Cherry also make a black switch but the Gateron version is slightly lighter and having tested a few I found them smoother too. My key goal here was to reduce noise, as the stronger spring will help me type accurately without hitting the bottom of the keystroke with an audible sound. Keycaps Blank grey PBT in DSA profile: this keyboard layout has a lot of non-standard sized keys, so blank keycaps meant that I wouldn’t be putting lots of keys out of their usual position; they’re also relatively cheap, fairly classy IMHO and a good placeholder until I end up getting some really cool caps on a group buy or something; oh, and it minimises the chance of someone else trying the keyboard and getting freaked out by the layout… Firmware QMK (Quantum Mechanical Keyboard), with a work-in-progress layout, based on Dvorak. QMK has a lot of features and allows you to fully program each and every key, with multiple layers accessed through several different routes. Because there are so few keys on this board, I’ll need to make good use of layers to make all the keys on a usual keyboard available. Dvorak Simplified Keyboard I’m grateful to the folks of the Leeds Hack Space, especially Nav & Mark who patiently coached me in various soldering techniques and good practice, but also everyone else who were so friendly and welcoming and interested in my project. I’m really pleased with the result, which is small, light and fully customisable. Playing with QMK firmware features will keep me occupied for quite a while! This isn’t the end though, as I’ll need a case to keep the dust out. I’m hoping to be able to 3D print this or mill it from wood with a CNC mill, for which I’ll need to head back to the Hack Space! Less, but better “Wenniger aber besser” — Dieter Rams {:.big-quote} I can barely believe it’s a full year since I published my intentions for 2018. A lot has happened since then. Principally: in November I started a new job as Data Services Lead at The British Library. One thing that hasn’t changed is my tendency to try to do too much, so this year I’m going to try and focus on a single intention, a translation of designer Dieter Rams' famous quote above: Less, but better. This chimes with a couple of other things I was toying with over the Christmas break, as they’re essentially other ways of saying the same thing: Take it steady One thing at a time I’m also going to keep in mind those touchstones from last year: What difference is this making? Am I looking after myself? Do I have evidence for this? I mainly forget to think about them, so I’ll be sticking up post-its everywhere to help me remember! How to extend Python with Rust: part 1 Python is great, but I find it useful to have an alternative language under my belt for occasions when no amount of Pythonic cleverness will make some bit of code run fast enough. One of my main reasons for wanting to learn Rust was to have something better than C for that. Not only does Rust have all sorts of advantages that make it a good choice for code that needs to run fast and correctly, it’s also got a couple of rather nice crates (libraries) that make interfacing with Python a lot nicer. Here’s a little tutorial to show you how easy it is to call a simple Rust function from Python. If you want to try it yourself, you’ll find the code on GitHub. !!! prerequisites I’m assuming for this tutorial that you’re already familiar with writing Python scripts and importing & using packages, and that you’re comfortable using the command line. You’ll also need to have installed Rust. The Rust bit The quickest way to get compiled code into Python is to use the builtin ctypes package. This is Python’s “Foreign Function Interface” or FFI: a means of calling functions outside the language you’re using to make the call. ctypes allows us to call arbitrary functions in a shared library1, as long as those functions conform to certain standard C language calling conventions. Thankfully, Rust tries hard to make it easy for us to build such a shared library. The first thing to do is to create a new project with cargo, the Rust build tool: $ cargo new rustfrompy Created library `rustfrompy` project $ tree . ├── Cargo.toml └── src └── lib.rs 1 directory, 2 files !!! aside I use the fairly common convention that text set in fixed-width font is either example code or commands to type in. For the latter, a $ precedes the command that you type (omit the $), and lines that don’t start with a $ are output from the previous command. I assume a basic familiarity with Unix-style command line, but I should probably put in some links to resources if you need to learn more! We need to edit the Cargo.toml file and add a [lib] section: [package] name = "rustfrompy" version = "0.1.0" authors = ["Jez Cope <j.cope@erambler.co.uk>"] [dependencies] [lib] name = "rustfrompy" crate-type = ["cdylib"] This tells cargo that we want to make a C-compatible dynamic library (crate-type = ["cdylib"]) and what to call it, plus some standard metadata. We can then put our code in src/lib.rs. We’ll just use a simple toy function that adds two numbers together: #[no_mangle] pub fn add(a: i64, b: i64) -> i64 { a + b } Notice the pub keyword, which instructs the compiler to make this function accessible to other modules, and the #[no_mangle] annotation, which tells it to use the standard C naming conventions for functions. If we don’t do this, then Rust will generate a new name for the function for its own nefarious purposes, and as a side effect we won’t know what to call it when we want to use it from Python. Being good developers, let’s also add a test: #[cfg(test)] mod test { use ::*; #[test] fn test_add() { assert_eq!(4, add(2, 2)); } } We can now run cargo test which will compile that code and run the test: $ cargo test Compiling rustfrompy v0.1.0 (file:///home/jez/Personal/Projects/rustfrompy) Finished dev [unoptimized + debuginfo] target(s) in 1.2 secs Running target/debug/deps/rustfrompy-3033caaa9f5f17aa running 1 test test test::test_add ... ok test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out Everything worked! Now just to build that shared library and we can try calling it from Python: $ cargo build Compiling rustfrompy v0.1.0 (file:///home/jez/Personal/Projects/rustfrompy) Finished dev [unoptimized + debuginfo] target(s) in 0.30 secs Notice that the build is unoptimized and includes debugging information: this is useful in development, but once we’re ready to use our code it will run much faster if we compile it with optimisations. Cargo makes this easy: $ cargo build --release Compiling rustfrompy v0.1.0 (file:///home/jez/Personal/Projects/rustfrompy) Finished release [optimized] target(s) in 0.30 secs The Python bit After all that, the Python bit is pretty short. First we import the ctypes package (which is included in all recent Python versions): from ctypes import cdll Cargo has tidied our shared library away into a folder, so we need to tell Python where to load it from. On Linux, it will be called lib<something>.so where the “something” is the crate name from Cargo.toml, “rustfrompy”: lib = cdll.LoadLibrary('target/release/librustfrompy.so') Finally we can call the function anywhere we want. Here it is in a pytest-style test: def test_rust_add(): assert lib.add(27, 15) == 42 If you have pytest installed (and you should!) you can run the whole test like this: $ pytest --verbose test.py ====================================== test session starts ====================================== platform linux -- Python 3.6.4, pytest-3.1.1, py-1.4.33, pluggy-0.4.0 -- /home/jez/.virtualenvs/datasci/bin/python cachedir: .cache rootdir: /home/jez/Personal/Projects/rustfrompy, inifile: collected 1 items test.py::test_rust_add PASSED It worked! I’ve put both the Rust and Python code on github if you want to try it for yourself. Shortcomings Ok, so that was a pretty simple example, and I glossed over a lot of things. For example, what would happen if we did lib.add(2.0, 2)? This causes Python to throw an error because our Rust function only accepts integers (64-bit signed integers, i64, to be precise), and we gave it a floating point number. ctypes can’t guess what type(s) a given function will work with, but it can at least tell us when we get it wrong. To fix this properly, we need to do some extra work, telling the ctypes library what the argument and return types for each function are. For a more complex library, there will probably be more housekeeping to do, such as translating return codes from functions into more Pythonic-style errors. For a small example like this there isn’t much of a problem, but the bigger your compiled library the more extra boilerplate is required on the Python side just to use all the functions. When you’re working with an existing library you don’t have much choice about this, but if you’re building it from scratch specifically to interface with Python, there’s a better way using the Python C API. You can call this directly in Rust, but there are a couple of Rust crates that make life much easier, and I’ll be taking a look at those in a future blog post. .so on Linux, .dylib on Mac and .dll on Windows ↩︎ New Years's irresolution Photo by Andrew Hughes on Unsplash I’ve chosen not to make any specific resolutions this year; I’ve found that they just don’t work for me. Like many people, all I get is a sense of guilt when I inevitably fail to live up to the expectations I set myself at the start of the year. However, I have set a couple of what I’m referring to as “themes” for the year: touchstones that I’ll aim to refer to when setting priorities or just feeling a bit overwhelmed or lacking in direction. They are: Contribution Self-care Measurement I may do some blog posts expanding on these, but in the meantime, I’ve put together a handful of questions to help me think about priorities and get perspective when I’m doing (or avoiding doing) something. What difference is this making? I feel more motivated when I can figure out how I’m contributing to something bigger than myself. In society? In my organisation? To my friends & family? Am I looking after myself? I focus a lot on the expectations have (or at least that I think others have) of me, but I can’t do anything well unless I’m generally happy and healthy. Is this making me happier and healthier? Is this building my capacity to to look after myself, my family & friends and do my job? Is this worth the amount of time and energy I’m putting in? Do I have evidence for this? I don’t have to base decisions purely on feelings/opinions: I have the skills to obtain, analyse and interpret data. Is this fact or opinion? What are the facts? Am I overthinking this? Can I put a confidence interval for this? Build documents from code and data with Saga !!! tldr “TL;DR” I’ve made Saga, a thing for compiling documents by combining code and data with templates. What is it? Saga is a very simple command-line tool that reads in one or more data files, runs one or more scripts, then passes the results into a template to produce a final output document. It enables you to maintain a clean separation between data, logic and presentation and produce data-based documents that can easily be updated. That allows the flow of data through the document to be easily understood, a cornerstone of reproducible analysis. You run it like this: saga build -d data.yaml -d other_data.yaml \ -s analysis.py -t report.md.tmpl \ -O report.md Any scripts specified with -s will have access to the data in local variables, and any changes to local variables in a script will be retained when everything is passed to the template for rendering. For debugging, you can also do: saga dump -d data.yaml -d other_data.yaml -s analysis.py which will print out the full environment that would be passed to your template with saga build. Features Right now this is a really early version. It does the job but I have lots of ideas for features to add if I ever have time. At present it does the following: Reads data from one or more YAML files Transforms data with one or more Python scripts Renders a template in Mako format Works with any plain-text output format, including Markdown, LaTeX and HTML Use cases Write reproducible reports & papers based on machine-readable data Separate presentation from content in any document, e.g. your CV (example coming soon) Yours here? Get it! I haven’t released this on PyPI yet, but all the code is available on GitHub to try out. If you have pipenv installed (and if you use Python you should!), you can try it out in an isolated virtual environment by doing: git clone https://github.com/jezcope/sagadoc.git cd sagadoc pipenv install pipenv run saga or you can set up for development and run some tests: pipenv install --dev pipenv run pytest Why? Like a lot of people, I have to produce reports for work, often containing statistics computed from data. Although these generally aren’t academic research papers, I see no reason not to aim for a similar level of reproducibility: after all, if I’m telling other people to do it, I’d better take my own advice! A couple of times now I’ve done this by writing a template that holds the text of the report and placeholders for values, along with a Python script that reads in the data, calculates the statistics I want and completes the template. This is valuable for two main reasons: If anyone wants to know how I processed the data and calculated those statistics, it’s all there: no need to try and remember and reproduce a series of button clicks in Excel; If the data or calculations change, I just need to update the relevant part and run it again, and all the relevant parts of the document will be updated. This is particularly important if changing a single data value requires recalculation of dozens of tables, charts, etc. It also gives me the potential to factor out and reuse bits of code in the future, add tests and version control everything. Now that I’ve done this more than once (and it seems likely I’ll do it again) it makes sense to package that script up in a more portable form so I don’t have to write it over and over again (or, shock horror, copy & paste it!). It saves time, and gives others the possibility to make use of it. Prior art I’m not the first person to think of this, but I couldn’t find anything that did exactly what I needed. Several tools will let you interweave code and prose, including the results of evaluating each code snippet in the document: chief among these are Jupyter and Rmarkdown. There are also tools that let you write code in the order that makes most sense to read and then rearrange it into the right order to execute, so-call literate programming. The original tool for this is the venerable noweb. Sadly there is very little that combine both of these and allow you to insert the results of various calculations at arbitrary points in a document, independent of the order of either presenting or executing the code. The only two that I’m aware of are: Dexy and org-mode. Unfortunately, Dexy currently only works on Legacy Python (/Python 2) and org-mode requires emacs (which is fine but not exactly portable). Rmarkdown comes close and supports a range of languages but the full feature set is only available with R. Actually, my ideal solution is org-mode without the emacs dependency, because that’s the most flexible solution; maybe one day I’ll have both the time and skill to implement that. It’s also possible I might be able to figure out Dexy’s internals to add what I want to it, but until then Saga does the job! Future work There are lots of features that I’d still like to add when I have time: Some actual documentation! And examples! More data formats (e.g. CSV, JSON, TOML) More languages (e.g. R, Julia) Fetching remote data over http Caching of intermediate results to speed up rebuilds For now, though, I’d love for you to try it out and let me know what you think! As ever, comment here, tweet me or start an issue on GitHub. Why try Rust for scientific computing? When you’re writing analysis code, Python (or R, or JavaScript, or …) is usually the right choice. These high-level languages are set up to make you as productive as possible, and common tasks like array manipulation have been well optimised. However, sometimes you just can’t get enough speed and need to turn to a lower-level compiled language. Often that will be C, C++ or Fortran, but I thought I’d do a short post on why I think you should consider Rust. One of my goals for 2017’s Advent of Code was to learn a modern, memory-safe, statically-typed language. I now know that there are quite a lot of options in this space, but two seem to stand out: Go & Rust. I gave both of them a try, and although I’ll probably go back to give Go a more thorough test at some point I found I got quite hooked on Rust. Both languages, though young, are definitely production-ready. Servo, the core of the new Firefox browser, is entirely written in Rust. In fact, Mozilla have been trying to rewrite the rendering core in C for nearly a decade, and switching to Rust let them get it done in just a couple of years. !!! tldr “TL;DR” - It’s fast: competitive with idiomatic C/C++, and no garbage-collection overhead - It’s harder to write buggy code, and compiler errors are actually helpful - It’s C-compatible: you can call into Rust code anywhere you’d call into C, call C/C++ from Rust, and incrementally replace C/C++ code with Rust - It has sensible modern syntax that makes your code clearer and more concise - Support for scientific computing are getting better all the time (matrix algebra libraries, built-in SIMD, safe concurrency) - It has a really friendly and active community - It’s production-ready: Servo, the new rendering core in Firefox, is built entirely in Rust Performance To start with, as a compiled language Rust executes much faster than a (pseudo-)interpreted language like Python or R; the price you pay for this is time spent compiling during development. However, having a compile step also allows the language to enforce certain guarantees, such as type-correctness and memory safety, which between them prevent whole classes of bugs from even being possible. Unlike Go (which, like many higher-level languages, uses a garbage collector), Rust handles memory safety at compile time through the concepts of ownership and borrowing. These can take some getting used to and were a big source of frustration when I was first figuring out the language, but ultimately contribute to Rust’s reliably-fast performance. Performance can be unpredictable in a garbage-collected language because you can’t be sure when the GC is going to run and you need to understand it really well to stand a chance of optimising it if becomes a problem. On the other hand, code that has the potential to be unsafe will result in compilation errors in Rust. There are a number of benchmarks (example) that show Rust’s performance on a par with idiomatic C & C++ code, something that very few languages can boast. Helpful error messages Because beginner Rust programmers often get compile errors, it’s really important that those errors are easy to interpret and fix, and Rust is great at this. Not only does it tell you what went wrong, but wherever possible it prints out your code annotated with arrows to show exactly where the error is, and makes specific suggestions how to fix the error which usually turn out to be correct. It also has a nice suite of warnings (things that don’t cause compilation to fail but may indicate bugs) that are just as informative, and this can be extended even further by using the clippy linting tool to further analyse your code. warning: unused variable: `y` --> hello.rs:3:9 | 3 | let y = x; | ^ | = note: #[warn(unused_variables)] on by default = note: to avoid this warning, consider using `_y` instead Easy to integrate with other languages If you’re like me, you’ll probably only use a low-level language for performance-critical code that you can call from a high-level language, and this is an area where Rust shines. Most programmers will turn to C, C++ or Fortran for this because they have a well established ABI (Application Binary Interface) which can be understood by languages like Python and R1. In Rust, it’s trivial to make a C-compatible shared library, and the standard library includes extra features for working with C types. That also means that existing C code can be incrementally ported to Rust: see remacs for an example. On top of this, there are projects like rust-cpython and PyO3 which provide macros and structures that wrap the Python C API to let you build Python modules in Rust with minimal glue code; rustr does a similar job for R. Nice language features Rust has some really nice features, which let you write efficient, concise and correct code. Several feel particularly comfortable as they remind me of similar things available in Haskell, including: Enums, a super-powered combination of C enums and unions (similar to Haskell’s algebraic data types) that enable some really nice code with no runtime cost Generics and traits that let you get more done with less code Pattern matching, a kind of case statement that lets you extract parts of structs, tuples & enums and do all sorts of other clever things Lazy computation based on an iterator pattern, for efficient processing of lists of things: you can do for item in list { ... } instead of the C-style use of an index2, or you can use higher-order functions like map and filter Functions/closures as first-class citizens Scientific computing Although it’s a general-purpose language and not designed specifically for scientific computing, Rust’s support is improving all the time. There are some interesting matrix algebra libraries available, and built-in SIMD is incoming. The memory safety features also work to ensure thread safety, so it’s harder to write concurrency bugs. You should be able to use your favourite MPI implementation too, and there’s at least one attempt to portably wrap MPI in a more Rust-like way. Active development and friendly community One of the things you notice straight away is how active and friendly the Rust community is. There are several IRC channels on irc.mozilla.org including #rust-beginners, which is a great place to get help. The compiler is under constant but carefully-managed development, so that new features are landing all the time but without breaking existing code. And the fabulous Cargo build tool and crates.io are enabling the rapid growth of a healthy ecosystem of open source libraries that you can use to write less code yourself. Summary So, next time you need a compiled language to speed up hotspots in your code, try Rust. I promise you won’t regret it! Julia actually allows you to call C and Fortran functions as a first-class language feature ↩︎ Actually, since C++11 there’s for (auto item : list) { ... } but still… ↩︎ Reflections on #aoc2017 Trees reflected in a lake Joshua Reddekopp on Unsplash It seems like ages ago, but way back in November I committed to completing Advent of Code. I managed it all, and it was fun! All of my code is available on GitHub if you’re interested in seeing what I did, and I managed to get out a blog post for every one with a bit more commentary, which you can see in the series list above. How did I approach it? I’ve not really done any serious programming challenges before. I don’t get to write a lot of code at the moment, so all I wanted from AoC was an excuse to do some proper problem-solving. I never really intended to take a polyglot approach, though I did think that I might use mainly Python with a bit of Haskell. In the end, though, I used: Python (×12); Haskell (×7); Rust (×4); Go; C++; Ruby; Julia; and Coconut. For the most part, my priorities were getting the right answer, followed by writing readable code. I didn’t specifically focus on performance but did try to avoid falling into traps that I knew about. What did I learn? I found Python the easiest to get on with: it’s the language I know best and although I can’t always remember exact method names and parameters I know what’s available and where to look to remind myself, as well as most of the common idioms and some performance traps to avoid. Python was therefore the language that let me focus most on solving the problem itself. C++ and Ruby were more challenging, and it was harder to write good idiomatic code but I can still remember quite a lot. Haskell I haven’t used since university, and just like back then I really enjoyed working out how to solve problems in a functional style while still being readable and efficient (not always something I achieved…). I learned a lot about core Haskell concepts like monads & functors, and I’m really amazed by the way the Haskell community and ecosystem has grown up in the last decade. I also wanted to learn at least one modern, memory-safe compiled language, so I tried both Go and Rust. Both seem like useful languages, but Rust really intrigued me with its conceptual similarities to both Haskell and C++ and its promise of memory safety without a garbage collector. I struggled a lot initially with the “borrow checker” (the component that enforces memory safety at compile time) but eventually started thinking in terms of ownership and lifetimes after which things became easier. The Rust community seems really vibrant and friendly too. What next? I really want to keep this up, so I’m going to look out some more programming challenges (Project Euler looks interesting). It turns out there’s a regular Code Dojo meetup in Leeds, so hopefully I’ll try that out too. I’d like to do more realistic data-science stuff, so I’ll be taking a closer look at stuff like Kaggle too, and figuring out how to do a bit more analysis at work. I’m also feeling motivated to find an open source project to contribute to and/or release a project of my own, so we’ll see if that goes anywhere! I’ve always found the advice to “scratch your own itch” difficult to follow because everything I think of myself has already been done better. Most of the projects I use enough to want to contribute to tend to be pretty well developed with big communities and any bugs that might be accessible to me will be picked off and fixed before I have a chance to get started. Maybe it’s time to get over myself and just reimplement something that already exists, just for the fun of it! The Halting Problem — Python — #adventofcode Day 25 Today’s challenge, takes us back to a bit of computing history: a good old-fashioned Turing Machine. → Full code on GitHub !!! commentary Today’s challenge was a nice bit of nostalgia, taking me back to my university days learning about the theory of computing. Turing Machines are a classic bit of computing theory, and are provably able to compute any value that is possible to compute: a value is computable if and only if a Turing Machine can be written that computes it (though in practice anything non-trivial is mind-bendingly hard to write as a TM). A bit of a library-fest today, compared to other days! from collections import deque, namedtuple from collections.abc import Iterator from tqdm import tqdm import re import fileinput as fi These regular expressions are used to parse the input that defines the transition table for the machine. RE_ISTATE = re.compile(r'Begin in state (?P<state>\w+)\.') RE_RUNTIME = re.compile( r'Perform a diagnostic checksum after (?P<steps>\d+) steps.') RE_STATETRANS = re.compile( r"In state (?P<state>\w+):\n" r" If the current value is (?P<read0>\d+):\n" r" - Write the value (?P<write0>\d+)\.\n" r" - Move one slot to the (?P<move0>left|right).\n" r" - Continue with state (?P<next0>\w+).\n" r" If the current value is (?P<read1>\d+):\n" r" - Write the value (?P<write1>\d+)\.\n" r" - Move one slot to the (?P<move1>left|right).\n" r" - Continue with state (?P<next1>\w+).") MOVE = {'left': -1, 'right': 1} A namedtuple to provide some sugar when using a transition rule. Rule = namedtuple('Rule', 'write move next_state') The TuringMachine class does all the work. class TuringMachine: def __init__(self, program=None): self.tape = deque() self.transition_table = {} self.state = None self.runtime = 0 self.steps = 0 self.pos = 0 self.offset = 0 if program is not None: self.load(program) def __str__(self): return f"Current: {self.state}; steps: {self.steps} of {self.runtime}" Some jiggery-pokery to allow us to use self[pos] to reference an infinite tape. def __getitem__(self, i): i += self.offset if i < 0 or i >= len(self.tape): return 0 else: return self.tape[i] def __setitem__(self, i, x): i += self.offset if i >= 0 and i < len(self.tape): self.tape[i] = x elif i == -1: self.tape.appendleft(x) self.offset += 1 elif i == len(self.tape): self.tape.append(x) else: raise IndexError('Tried to set position off end of tape') Parse the program and set up the transtion table. def load(self, program): if isinstance(program, Iterator): program = ''.join(program) match = RE_ISTATE.search(program) self.state = match['state'] match = RE_RUNTIME.search(program) self.runtime = int(match['steps']) for match in RE_STATETRANS.finditer(program): self.transition_table[match['state']] = { int(match['read0']): Rule(write=int(match['write0']), move=MOVE[match['move0']], next_state=match['next0']), int(match['read1']): Rule(write=int(match['write1']), move=MOVE[match['move1']], next_state=match['next1']), } Run the program for the required number of steps (given by self.runtime). tqdm isn’t in the standard library but it should be: it shows a lovely text-mode progress bar as we go. def run(self): for _ in tqdm(range(self.runtime), desc="Running", unit="steps", unit_scale=True): read = self[self.pos] rule = self.transition_table[self.state][read] self[self.pos] = rule.write self.pos += rule.move self.state = rule.next_state Calculate the “diagnostic checksum” required for the answer. @property def checksum(self): return sum(self.tape) Aaand GO! machine = TuringMachine(fi.input()) machine.run() print("Checksum:", machine.checksum) Electromagnetic Moat — Rust — #adventofcode Day 24 Today’s challenge, the penultimate, requires us to build a bridge capable of reaching across to the CPU, our final destination. → Full code on GitHub !!! commentary We have a finite number of components that fit together in a restricted way from which to build a bridge, and we have to work out both the strongest and the longest bridge we can build. The most obvious way to do this is to recursively build every possible bridge and select the best, but that’s an O(n!) algorithm that could blow up quickly, so might as well go with a nice fast language! Might have to try this in Haskell too, because it’s the type of algorithm that lends itself naturally to a pure functional approach. I feel like I've applied some of the things I've learned in previous challenges I used Rust for, and spent less time mucking about with ownership, and made better use of various language features, including structs and iterators. I'm rather pleased with how my learning of this language is progressing. I'm definitely overusing `Option.unwrap` at the moment though: this is a lazy way to deal with `Option` results and will panic if the result is not what's expected. I'm not sure whether I need to be cloning the components `Vector` either, or whether I could just be passing iterators around. First, we import some bits of standard library and define some data types. The BridgeResult struct lets us use the same algorithm for both parts of the challenge and simply change the value used to calculate the maximum. use std::io; use std::fmt; use std::io::BufRead; #[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)] struct Component(u8, u8); #[derive(Debug, Copy, Clone, Default)] struct BridgeResult { strength: u16, length: u16, } impl Component { fn from_str(s: &str) -> Component { let parts: Vec<&str> = s.split('/').collect(); assert!(parts.len() == 2); Component(parts[0].parse().unwrap(), parts[1].parse().unwrap()) } fn fits(self, port: u8) -> bool { self.0 == port || self.1 == port } fn other_end(self, port: u8) -> u8 { if self.0 == port { return self.1; } else if self.1 == port { return self.0; } else { panic!("{} doesn't fit port {}", self, port); } } fn strength(self) -> u16 { self.0 as u16 + self.1 as u16 } } impl fmt::Display for BridgeResult { fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { write!(f, "(S: {}, L: {})", self.strength, self.length) } } best_bridge calculates the length and strength of the “best” bridge that can be built from the remaining components and fits the required port. Whether this is based on strength or length is given by the key parameter, which is passed to Iter.max_by_key. fn best_bridge<F>(port: u8, key: &F, components: &Vec<Component>) -> Option<BridgeResult> where F: Fn(&BridgeResult) -> u16 { if components.len() == 0 { return None; } components.iter() .filter(|c| c.fits(port)) .map(|c| { let b = best_bridge(c.other_end(port), key, &components.clone().into_iter() .filter(|x| x != c).collect()) .unwrap_or_default(); BridgeResult{strength: c.strength() + b.strength, length: 1 + b.length} }) .max_by_key(key) } Now all that remains is to read the input and calculate the result. I was rather pleasantly surprised to find that in spite of my pessimistic predictions about efficiency, when compiled with optimisations turned on this terminates in less than 1s on my laptop. fn main() { let stdin = io::stdin(); let components: Vec<_> = stdin.lock() .lines() .map(|l| Component::from_str(&l.unwrap())) .collect(); match best_bridge(0, &|b: &BridgeResult| b.strength, &components) { Some(b) => println!("Strongest bridge is {}", b), None => println!("No strongest bridge found") }; match best_bridge(0, &|b: &BridgeResult| b.length, &components) { Some(b) => println!("Longest bridge is {}", b), None => println!("No longest bridge found") }; } Coprocessor Conflagration — Haskell — #adventofcode Day 23 Today’s challenge requires us to understand why a coprocessor is working so hard to perform an apparently simple calculation. → Full code on GitHub !!! commentary Today’s problem is based on an assembly-like language very similar to day 18, so I went back and adapted my code from that, which works well for the first part. I’ve also incorporated some advice from /r/haskell, and cleaned up all warnings shown by the -Wall compiler flag and the hlint tool. Part 2 requires the algorithm to run with much larger inputs, and since some analysis shows that it's an `O(n^3)` algorithm it gets intractible pretty fast. There are several approaches to this. First up, if you have a fast enough processor and an efficient enough implementation I suspect that the simulation would probably terminate eventually, but that would likely still take hours: not good enough. I also thought about doing some peephole optimisations on the instructions, but the last time I did compiler optimisation was my degree so I wasn't really sure where to start. What I ended up doing was actually analysing the input code by hand to figure out what it was doing, and then just doing that calculation in a sensible way. I'd like to say I managed this on my own (and I ike to think I would have) but I did get some tips on [/r/adventofcode](https://reddit.com/r/adventofcode). The majority of this code is simply a cleaned-up version of day 18, with some tweaks to accommodate the different instruction set: module Main where import qualified Data.Vector as V import qualified Data.Map.Strict as M import Control.Monad.State.Strict import Text.ParserCombinators.Parsec hiding (State) type Register = Char type Value = Int type Argument = Either Value Register data Instruction = Set Register Argument | Sub Register Argument | Mul Register Argument | Jnz Argument Argument deriving Show type Program = V.Vector Instruction data Result = Cont | Halt deriving (Eq, Show) type Registers = M.Map Char Int data Machine = Machine { dRegisters :: Registers , dPtr :: !Int , dMulCount :: !Int , dProgram :: Program } instance Show Machine where show d = show (dRegisters d) ++ " @" ++ show (dPtr d) ++ " ×" ++ show (dMulCount d) defaultMachine :: Machine defaultMachine = Machine M.empty 0 0 V.empty type MachineState = State Machine program :: GenParser Char st Program program = do instructions <- endBy instruction eol return $ V.fromList instructions where instruction = try (regOp "set" Set) <|> regOp "sub" Sub <|> regOp "mul" Mul <|> jump "jnz" Jnz regOp n c = do string n >> spaces val1 <- oneOf "abcdefgh" secondArg c val1 jump n c = do string n >> spaces val1 <- regOrVal secondArg c val1 secondArg c val1 = do spaces val2 <- regOrVal return $ c val1 val2 regOrVal = register <|> value register = do name <- lower return $ Right name value = do val <- many $ oneOf "-0123456789" return $ Left $ read val eol = char '\n' parseProgram :: String -> Either ParseError Program parseProgram = parse program "" getReg :: Char -> MachineState Int getReg r = do st <- get return $ M.findWithDefault 0 r (dRegisters st) putReg :: Char -> Int -> MachineState () putReg r v = do st <- get let current = dRegisters st new = M.insert r v current put $ st { dRegisters = new } modReg :: (Int -> Int -> Int) -> Char -> Argument -> MachineState () modReg op r v = do u <- getReg r v' <- getRegOrVal v putReg r (u `op` v') incPtr getRegOrVal :: Argument -> MachineState Int getRegOrVal = either return getReg addPtr :: Int -> MachineState () addPtr n = do st <- get put $ st { dPtr = n + dPtr st } incPtr :: MachineState () incPtr = addPtr 1 execInst :: Instruction -> MachineState () execInst (Set reg val) = do newVal <- getRegOrVal val putReg reg newVal incPtr execInst (Mul reg val) = do result <- modReg (*) reg val st <- get put $ st { dMulCount = 1 + dMulCount st } return result execInst (Sub reg val) = modReg (-) reg val execInst (Jnz val1 val2) = do test <- getRegOrVal val1 jump <- if test /= 0 then getRegOrVal val2 else return 1 addPtr jump execNext :: MachineState Result execNext = do st <- get let prog = dProgram st p = dPtr st if p >= length prog then return Halt else do execInst (prog V.! p) return Cont runUntilTerm :: MachineState () runUntilTerm = do result <- execNext unless (result == Halt) runUntilTerm This implements the actual calculation: the number of non-primes between (for my input) 107900 and 124900: optimisedCalc :: Int -> Int -> Int -> Int optimisedCalc a b k = sum $ map (const 1) $ filter notPrime [a,a+k..b] where notPrime n = elem 0 $ map (mod n) [2..(floor $ sqrt (fromIntegral n :: Double))] main :: IO () main = do input <- getContents case parseProgram input of Right prog -> do let c = defaultMachine { dProgram = prog } (_, c') = runState runUntilTerm c putStrLn $ show (dMulCount c') ++ " multiplications made" putStrLn $ "Calculation result: " ++ show (optimisedCalc 107900 124900 17) Left e -> print e Sporifica Virus — Rust — #adventofcode Day 22 Today’s challenge has us helping to clean up (or spread, I can’t really tell) an infection of the “sporifica” virus. → Full code on GitHub !!! commentary I thought I’d have another play with Rust, as its Haskell-like features resonate with me at the moment. I struggled quite a lot with the Rust concepts of ownership and borrowing, and this is a cleaned-up version of the code based on some good advice from the folks on /r/rust. use std::io; use std::env; use std::io::BufRead; use std::collections::HashMap; #[derive(PartialEq, Clone, Copy, Debug)] enum Direction {Up, Right, Down, Left} #[derive(PartialEq, Clone, Copy, Debug)] enum Infection {Clean, Weakened, Infected, Flagged} use self::Direction::*; use self::Infection::*; type Grid = HashMap<(isize, isize), Infection>; fn turn_left(d: Direction) -> Direction { match d {Up => Left, Right => Up, Down => Right, Left => Down} } fn turn_right(d: Direction) -> Direction { match d {Up => Right, Right => Down, Down => Left, Left => Up} } fn turn_around(d: Direction) -> Direction { match d {Up => Down, Right => Left, Down => Up, Left => Right} } fn make_move(d: Direction, x: isize, y: isize) -> (isize, isize) { match d { Up => (x-1, y), Right => (x, y+1), Down => (x+1, y), Left => (x, y-1), } } fn basic_step(grid: &mut Grid, x: &mut isize, y: &mut isize, d: &mut Direction) -> usize { let mut infect = 0; let current = match grid.get(&(*x, *y)) { Some(v) => *v, None => Clean, }; if current == Infected { *d = turn_right(*d); } else { *d = turn_left(*d); infect = 1; }; grid.insert((*x, *y), match current { Clean => Infected, Infected => Clean, x => panic!("Unexpected infection state {:?}", x), }); let new_pos = make_move(*d, *x, *y); *x = new_pos.0; *y = new_pos.1; infect } fn nasty_step(grid: &mut Grid, x: &mut isize, y: &mut isize, d: &mut Direction) -> usize { let mut infect = 0; let new_state: Infection; let current = match grid.get(&(*x, *y)) { Some(v) => *v, None => Infection::Clean, }; match current { Clean => { *d = turn_left(*d); new_state = Weakened; }, Weakened => { new_state = Infected; infect = 1; }, Infected => { *d = turn_right(*d); new_state = Flagged; }, Flagged => { *d = turn_around(*d); new_state = Clean; } }; grid.insert((*x, *y), new_state); let new_pos = make_move(*d, *x, *y); *x = new_pos.0; *y = new_pos.1; infect } fn virus_infect<F>(mut grid: Grid, mut step: F, mut x: isize, mut y: isize, mut d: Direction, n: usize) -> usize where F: FnMut(&mut Grid, &mut isize, &mut isize, &mut Direction) -> usize, { (0..n).map(|_| step(&mut grid, &mut x, &mut y, &mut d)) .sum() } fn main() { let args: Vec<String> = env::args().collect(); let n_basic: usize = args[1].parse().unwrap(); let n_nasty: usize = args[2].parse().unwrap(); let stdin = io::stdin(); let lines: Vec<String> = stdin.lock() .lines() .map(|x| x.unwrap()) .collect(); let mut grid: Grid = HashMap::new(); let x0 = (lines.len() / 2) as isize; let y0 = (lines[0].len() / 2) as isize; for (i, line) in lines.iter().enumerate() { for (j, c) in line.chars().enumerate() { grid.insert((i as isize, j as isize), match c {'#' => Infected, _ => Clean}); } } let basic_steps = virus_infect(grid.clone(), basic_step, x0, y0, Up, n_basic); println!("Basic: infected {} times", basic_steps); let nasty_steps = virus_infect(grid, nasty_step, x0, y0, Up, n_nasty); println!("Nasty: infected {} times", nasty_steps); } Fractal Art — Python — #adventofcode Day 21 Today’s challenge asks us to assist an artist building fractal patterns from a rulebook. → Full code on GitHub !!! commentary Another fairly straightforward algorithm: the really tricky part was breaking the pattern up into chunks and rejoining it again. I could probably have done that more efficiently, and would have needed to if I had to go for a few more iterations and the grid grows with every iteration and gets big fast. Still behind on the blog posts… import fileinput as fi from math import sqrt from functools import reduce, partial import operator INITIAL_PATTERN = ((0, 1, 0), (0, 0, 1), (1, 1, 1)) DECODE = ['.', '#'] ENCODE = {'.': 0, '#': 1} concat = partial(reduce, operator.concat) def rotate(p): size = len(p) return tuple(tuple(p[i][j] for i in range(size)) for j in range(size - 1, -1, -1)) def flip(p): return tuple(p[i] for i in range(len(p) - 1, -1, -1)) def permutations(p): yield p yield flip(p) for _ in range(3): p = rotate(p) yield p yield flip(p) def print_pattern(p): print('-' * len(p)) for row in p: print(' '.join(DECODE[x] for x in row)) print('-' * len(p)) def build_pattern(s): return tuple(tuple(ENCODE[c] for c in row) for row in s.split('/')) def build_pattern_book(lines): book = {} for line in lines: source, target = line.strip().split(' => ') for rotation in permutations(build_pattern(source)): book[rotation] = build_pattern(target) return book def subdivide(pattern): size = 2 if len(pattern) % 2 == 0 else 3 n = len(pattern) // size return (tuple(tuple(pattern[i][j] for j in range(y * size, (y + 1) * size)) for i in range(x * size, (x + 1) * size)) for x in range(n) for y in range(n)) def rejoin(parts): n = int(sqrt(len(parts))) size = len(parts[0]) return tuple(concat(parts[i + k][j] for i in range(n)) for k in range(0, len(parts), n) for j in range(size)) def enhance_once(p, book): return rejoin(tuple(book[part] for part in subdivide(p))) def enhance(p, book, n, progress=None): for _ in range(n): p = enhance_once(p, book) return p book = build_pattern_book(fi.input()) intermediate_pattern = enhance(INITIAL_PATTERN, book, 5) print("After 5 iterations:", sum(sum(row) for row in intermediate_pattern)) final_pattern = enhance(intermediate_pattern, book, 13) print("After 18 iterations:", sum(sum(row) for row in final_pattern)) Particle Swarm — Python — #adventofcode Day 20 Today’s challenge finds us simulating the movements of particles in space. → Full code on GitHub !!! commentary Back to Python for this one, another relatively straightforward simulation, although it’s easier to calculate the answer to part 1 than to simulate. import fileinput as fi import numpy as np import re First we parse the input into 3 2D arrays: using numpy enables us to do efficient arithmetic across the whole set of particles in one go. PARTICLE_RE = re.compile(r'p=<(-?\d+),(-?\d+),(-?\d+)>, ' r'v=<(-?\d+),(-?\d+),(-?\d+)>, ' r'a=<(-?\d+),(-?\d+),(-?\d+)>') def parse_input(lines): x = [] v = [] a = [] for l in lines: m = PARTICLE_RE.match(l) x.append([int(x) for x in m.group(1, 2, 3)]) v.append([int(x) for x in m.group(4, 5, 6)]) a.append([int(x) for x in m.group(7, 8, 9)]) return (np.arange(len(x)), np.array(x), np.array(v), np.array(a)) i, x, v, a = parse_input(fi.input()) Now we can calculate which particle will be closest to the origin in the long-term: this is simply the particle with the smallest acceleration. It turns out that several have the same acceleration, so of these, the one we want is the one with the lowest starting velocity. This is only complicated slightly by the need to get the number of the particle rather than its other information, hence the need to use numpy.argmin. a_abs = np.sum(np.abs(a), axis=1) a_min = np.min(a_abs) a_i = np.squeeze(np.argwhere(a_abs == a_min)) closest = i[a_i[np.argmin(np.sum(np.abs(v[a_i]), axis=1))]] print("Closest: ", closest) Now we define functions to simulate collisions between particles. We have to use the return_index and return_counts options to numpy.unique to be able to get rid of all the duplicate positions (the standard usage is to keep one of each duplicate). def resolve_collisions(x, v, a): (_, i, c) = np.unique(x, return_index=True, return_counts=True, axis=0) i = i[c == 1] return x[i], v[i], a[i] The termination criterion for this loop is an interesting aspect: the most robust to my mind seems to be that eventually the particles will end up sorted in order of their initial acceleration in terms of distance from the origin, so you could check for this but that’s pretty computationally expensive. In the end, all that was needed was a bit of trial and error: terminating arbitrarily after 1,000 iterations seems to work! In fact, all the collisions are over after about 40 iterations for my input but there was always the possibility that two particles with very slightly different accelerations would eventually intersect much later. def simulate_collisions(x, v, a, iterations=1000): for _ in range(iterations): v += a x += v x, v, a = resolve_collisions(x, v, a) return len(x) print("Remaining particles: ", simulate_collisions(x, v, a)) A Series of Tubes — Rust — #adventofcode Day 19 Today’s challenge asks us to help a network packet find its way. → Full code on GitHub !!! commentary Today’s challenge was fairly straightforward, following an ASCII art path, so I thought I’d give Rust another try. I’m a bit behind on the blog posts, so I’m presenting the code below without any further commentary. I’m not really convinced this is good idiomatic Rust, and it was interesting turning a set of strings into a 2D array of characters because there are both u8 (byte) and char types to deal with. use std::io; use std::io::BufRead; const ALPHA: &'static str = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; fn change_direction(dia: &Vec<Vec<u8>>, x: usize, y: usize, dx: &mut i32, dy: &mut i32) { assert_eq!(dia[x][y], b'+'); if dx.abs() == 1 { *dx = 0; if y + 1 < dia[x].len() && (dia[x][y + 1] == b'-' || ALPHA.contains(dia[x][y + 1] as char)) { *dy = 1; } else if dia[x][y - 1] == b'-' || ALPHA.contains(dia[x][y - 1] as char) { *dy = -1; } else { panic!("Huh? {} {}", dia[x][y+1] as char, dia[x][y-1] as char); } } else { *dy = 0; if x + 1 < dia.len() && (dia[x + 1][y] == b'|' || ALPHA.contains(dia[x + 1][y] as char)) { *dx = 1; } else if dia[x - 1][y] == b'|' || ALPHA.contains(dia[x - 1][y] as char) { *dx = -1; } else { panic!("Huh?"); } } } fn follow_route(dia: Vec<Vec<u8>>) -> (String, i32) { let mut x: i32 = 0; let mut y: i32; let mut dx: i32 = 1; let mut dy: i32 = 0; let mut result = String::new(); let mut steps = 1; match dia[0].iter().position(|x| *x == b'|') { Some(i) => y = i as i32, None => panic!("Could not find '|' in first row"), } loop { x += dx; y += dy; match dia[x as usize][y as usize] { b'A'...b'Z' => result.push(dia[x as usize][y as usize] as char), b'+' => change_direction(&dia, x as usize, y as usize, &mut dx, &mut dy), b' ' => return (result, steps), _ => (), } steps += 1; } } fn main() { let stdin = io::stdin(); let lines: Vec<Vec<u8>> = stdin.lock().lines() .map(|l| l.unwrap().into_bytes()) .collect(); let result = follow_route(lines); println!("Route: {}", result.0); println!("Steps: {}", result.1); } Duet — Haskell — #adventofcode Day 18 Today’s challenge introduces a type of simplified assembly language that includes instructions for message-passing. First we have to simulate a single program (after humorously misinterpreting the snd and rcv instructions as “sound” and “recover”), but then we have to simulate two concurrent processes and the message passing between them. → Full code on GitHub !!! commentary Well, I really learned a lot from this one! I wanted to get to grips with more complex stuff in Haskell and this challenge seemed like an excellent opportunity to figure out a) parsing with the parsec library and b) using the State monad to keep the state of the simulator. As it turned out, that wasn't all I'd learned: I also ran into an interesting situation whereby lazy evaluation was creating an infinite loop where there shouldn't be one, so I also had to learn how to selectively force strict evaluation of values. I'm pretty sure this isn't the best Haskell in the world, but I'm proud of it. First we have to import a bunch of stuff to use later, but also notice the pragma on the first line which instructs the compiler to enable the BangPatterns language extension, which will be important later. {-# LANGUAGE BangPatterns #-} module Main where import qualified Data.Vector as V import qualified Data.Map.Strict as M import Data.List import Data.Either import Data.Maybe import Control.Monad.State.Strict import Control.Monad.Loops import Text.ParserCombinators.Parsec hiding (State) First up we define the types that will represent the program code itself. data DuetVal = Reg Char | Val Int deriving Show type DuetQueue = [Int] data DuetInstruction = Snd DuetVal | Rcv DuetVal | Jgz DuetVal DuetVal | Set DuetVal DuetVal | Add DuetVal DuetVal | Mul DuetVal DuetVal | Mod DuetVal DuetVal deriving Show type DuetProgram = V.Vector DuetInstruction Next we define the types to hold the machine state, which includes: registers, instruction pointer, send & receive buffers and the program code, plus a counter of the number of sends made (to provide the solution). type DuetRegisters = M.Map Char Int data Duet = Duet { dRegisters :: DuetRegisters , dPtr :: Int , dSendCount :: Int , dRcvBuf :: DuetQueue , dSndBuf :: DuetQueue , dProgram :: DuetProgram } instance Show Duet where show d = show (dRegisters d) ++ " @" ++ show (dPtr d) ++ " S" ++ show (dSndBuf d) ++ " R" ++ show (dRcvBuf d) defaultDuet = Duet M.empty 0 0 [] [] V.empty type DuetState = State Duet program is a parser built on the cool parsec library to turn the program text into a Haskell format that we can work with, a Vector of instructions. Yes, using a full-blown parser is overkill here (it would be much simpler just to split each line on whitespace, but I wanted to see how Parsec works. I’m using Vector here because we need random access to the instruction list, which is much more efficient with Vector: O(1) compared with the O(n) of the built in Haskell list ([]) type. parseProgram applies the parser to a string and returns the result. program :: GenParser Char st DuetProgram program = do instructions <- endBy instruction eol return $ V.fromList instructions where instruction = try (oneArg "snd" Snd) <|> oneArg "rcv" Rcv <|> twoArg "set" Set <|> twoArg "add" Add <|> try (twoArg "mul" Mul) <|> twoArg "mod" Mod <|> twoArg "jgz" Jgz oneArg n c = do string n >> spaces val <- regOrVal return $ c val twoArg n c = do string n >> spaces val1 <- regOrVal spaces val2 <- regOrVal return $ c val1 val2 regOrVal = register <|> value register = do name <- lower return $ Reg name value = do val <- many $ oneOf "-0123456789" return $ Val $ read val eol = char '\n' parseProgram :: String -> Either ParseError DuetProgram parseProgram = parse program "" Next up we have some utility functions that sit in the DuetState monad we defined above and perform common manipulations on the state: getting/setting/updating registers, updating the instruction pointer and sending/receiving messages via the relevant queues. getReg :: Char -> DuetState Int getReg r = do st <- get return $ M.findWithDefault 0 r (dRegisters st) putReg :: Char -> Int -> DuetState () putReg r v = do st <- get let current = dRegisters st new = M.insert r v current put $ st { dRegisters = new } modReg :: (Int -> Int -> Int) -> Char -> DuetVal -> DuetState Bool modReg op r v = do u <- getReg r v' <- getRegOrVal v putReg r (u `op` v') incPtr return False getRegOrVal :: DuetVal -> DuetState Int getRegOrVal (Reg r) = getReg r getRegOrVal (Val v) = return v addPtr :: Int -> DuetState () addPtr n = do st <- get put $ st { dPtr = n + dPtr st } incPtr = addPtr 1 send :: Int -> DuetState () send v = do st <- get put $ st { dSndBuf = (dSndBuf st ++ [v]), dSendCount = dSendCount st + 1 } recv :: DuetState (Maybe Int) recv = do st <- get case dRcvBuf st of (x:xs) -> do put $ st { dRcvBuf = xs } return $ Just x [] -> return Nothing execInst implements the logic for each instruction. It returns False as long as the program can continue, but True if the program tries to receive from an empty buffer. execInst :: DuetInstruction -> DuetState Bool execInst (Set (Reg reg) val) = do newVal <- getRegOrVal val putReg reg newVal incPtr return False execInst (Mul (Reg reg) val) = modReg (*) reg val execInst (Add (Reg reg) val) = modReg (+) reg val execInst (Mod (Reg reg) val) = modReg mod reg val execInst (Jgz val1 val2) = do st <- get test <- getRegOrVal val1 jump <- if test > 0 then getRegOrVal val2 else return 1 addPtr jump return False execInst (Snd val) = do v <- getRegOrVal val send v st <- get incPtr return False execInst (Rcv (Reg r)) = do st <- get v <- recv handle v where handle :: Maybe Int -> DuetState Bool handle (Just x) = putReg r x >> incPtr >> return False handle Nothing = return True execInst x = error $ "execInst not implemented yet for " ++ show x execNext looks up the next instruction and executes it. runUntilWait runs the program until execNext returns True to signal the wait state has been reached. execNext :: DuetState Bool execNext = do st <- get let prog = dProgram st p = dPtr st if p >= length prog then return True else execInst (prog V.! p) runUntilWait :: DuetState () runUntilWait = do waiting <- execNext unless waiting runUntilWait runTwoPrograms handles the concurrent running of two programs, by running first one and then the other to a wait state, then swapping each program’s send buffer to the other’s receive buffer before repeating. If you look carefully, you’ll see a “bang” (!) before the two arguments of the function: runTwoPrograms !d0 !d1. Haskell is a lazy language and usually doesn’t evaluate a computation until you ask for a result, instead carrying around a “thunk” or plan for how to carry out the computation. Sometimes that can be a problem because the amount of memory your program is using can explode unnecessarily as a long computation turns into a large thunk which isn’t evaluated until the very end. That’s not the problem here though. What happens here without the bangs is another side-effect of laziness. The exit condition of this recursive function is that a deadlock has been reached: both programs are waiting to receive, but neither has sent anything, so neither can ever continue. The check for this is (null $ dSndBuf d0') && (null $ dSndBuf d1'). As long as the first program has something in its send buffer, the test fails without ever evaluating the second part, which means the result d1' of running the second program is never needed. The function immediately goes to the recursive case and tries to continue the first program again, which immediately returns because it’s still waiting to receive. The same thing happens again, and the result is that instead of running the second program to obtain something for the first to receive, we get into an infinite loop trying and failing to continue the first program. The bang forces both d0 and d1 to be evaluated at the point we recurse, which forces the rest of the computation: running the second program and swapping the send/receive buffers. With that, the evaluation proceeds correctly and we terminate with a result instead of getting into an infinite loop! runTwoPrograms :: Duet -> Duet -> (Int, Int) runTwoPrograms !d0 !d1 | (null $ dSndBuf d0') && (null $ dSndBuf d1') = (dSendCount d0', dSendCount d1') | otherwise = runTwoPrograms d0'' d1'' where (_, d0') = runState runUntilWait d0 (_, d1') = runState runUntilWait d1 d0'' = d0' { dSndBuf = [], dRcvBuf = dSndBuf d1' } d1'' = d1' { dSndBuf = [], dRcvBuf = dSndBuf d0' } All that remains to be done now is to run the programs and see how many messages were sent before the deadlock. main = do prog <- fmap (fromRight V.empty . parseProgram) getContents let d0 = defaultDuet { dProgram = prog, dRegisters = M.fromList [('p', 0)] } d1 = defaultDuet { dProgram = prog, dRegisters = M.fromList [('p', 1)] } (send0, send1) = runTwoPrograms d0 d1 putStrLn $ "Program 0 sent " ++ show send0 ++ " messages" putStrLn $ "Program 1 sent " ++ show send1 ++ " messages" Spinlock — Rust/Python — #adventofcode Day 17 In today’s challenge we deal with a monstrous whirlwind of a program, eating up CPU and memory in equal measure. → Full code on GitHub (and Python driver script) !!! commentary One of the things I wanted from AoC was an opportunity to try out some popular languages that I don’t currently know, including the memory-safe, strongly-typed compiled languages Go and Rust. Realistically though, I’m likely to continue doing most of my programming in Python, and use one of these other languages when it has better tools or I need the extra speed. In which case, what I really want to know is how I can call functions written in Go or Rust from Python. I thought I'd try Rust first, as it seems to be designed to be C-compatible and that makes it easy to call from Python using [`ctypes`](https://docs.python.org/3.6/library/ctypes.html). Part 1 was another straightforward simulation: translate what the "spinlock" monster is doing into code and run it. It was pretty obvious from the story of this challenge and experience of the last few days that this was going to be another one where the simulation is too computationally expensive for part two, which turns out to be correct. So, first thing to do is to implement the meat of the solution in Rust. spinlock solves the first part of the problem by doing exactly what the monster does. Since we only have to go up to 2017 iterations, this is very tractable. The last number we insert is 2017, so we just return the number immediately after that. #[no_mangle] pub extern fn spinlock(n: usize, skip: usize) -> i32 { let mut buffer: Vec<i32> = Vec::with_capacity(n+1); buffer.push(0); buffer.push(1); let mut pos = 1; for i in 2..n+1 { pos = (pos + skip + 1) % buffer.len(); buffer.insert(pos, i as i32); } pos = (pos + 1) % buffer.len(); return buffer[pos]; } For the second part, we have to do 50 million iterations instead, which is a lot. Given that every time you insert an item in the list it has to move up all the elements after that position, I’m pretty sure the algorithm is O(n^2), so it’s going to take a lot longer than 10,000ish times the first part. Thankfully, we don’t need to build the whole list, just keep track of where 0 is and what number is immediately after it. There may be a closed-form solution to simply calculate the result, but I couldn’t think of it and this is good enough. #[no_mangle] pub extern fn spinlock0(n: usize, skip: usize) -> i32 { let mut pos = 1; let mut pos_0 = 0; let mut after_0 = 1; for i in 2..n+1 { pos = (pos + skip + 1) % i; if pos == pos_0 + 1 { after_0 = i; } if pos <= pos_0 { pos_0 += 1; } } return after_0 as i31; } Now it’s time to call this code from Python. Notice the #[no_mangle] pragmas and pub extern declarations for each function above, which are required to make sure the functions are exported in a C-compatible way. We can build this into a shared library like this: rustc --crate-type=cdylib -o spinlock.so 17-spinlock.rs The Python script is as simple as loading this library, reading the puzzle input from the command line and calling the functions. The ctypes module does a lot of magic so that we don’t have to worry about converting from Python types to native types and back again. import ctypes import sys lib = ctypes.cdll.LoadLibrary("./spinlock.so") skip = int(sys.argv[1]) print("Part 1:", lib.spinlock(2017, skip)) print("Part 2:", lib.spinlock0(50_000_000, skip)) This is a toy example as far as calling Rust from Python is concerned, but it’s worth noting that already we can play with the parameters to the two Rust functions without having to recompile. For more serious work, I’d probably be looking at something like PyO3 to make a proper Python module. Looks like there’s also a very early Rust numpy integration for integrating numerical stuff. You can also do the same thing from Julia, which has a ccall function built in: ccall((:spinlock, "./spinlock.so"), Int32, (UInt64, UInt64), 2017, 377) My next thing to try might be Haskell → Python though… Permutation Promenade — Julia — #adventofcode Day 16 Today’s challenge rather appeals to me as a folk dancer, because it describes a set of instructions for a dance and asks us to work out the positions of the dancing programs after each run through the dance. → Full code on GitHub !!! commentary So, part 1 is pretty straight forward: parse the set of instructions, interpret them and keep track of the dancer positions as you go. One time through the dance. However, part 2 asks for the positions after 1 billion (yes, that’s 1,000,000,000) times through the dance. In hindsight I should have immediately become suspicious, but I thought I’d at least try the brute force approach first because it was simpler to code. So I give it a try, and after waiting for a while, having a cup of tea etc. it still hasn't terminated. I try reducing the number of iterations to 1,000. Now it terminates, but takes about 6 seconds. A spot of arithmetic suggests that running the full version will take a little over 190 years. There must be a better way than that! I'm a little embarassed that I didn't spot the solution immediately (blaming Julia) and tried again in Python to see if I could get it to terminate quicker. When that didn't work I had to think again. A little further investigation with a while loop shows that in fact the dance position repeats (in the case of my input) every 48 times. After that it becomes much quicker! Oh, and it was time for a new language, so I wasted some extra time working out the quirks of [Julia][]. First, a function to evaluate a single move — for neatness, this dispatches to a dedicated function depending on the type of move, although this isn’t really necessary to solve the challenge. Ending a function name with a bang (!) is a Julia convention to indicate that it has side-effects. function eval_move!(move, dancers) move_type = move[1] params = move[2:end] if move_type == 's' # spin eval_spin!(params, dancers) elseif move_type == 'x' # exchange eval_exchange!(params, dancers) elseif move_type == 'p' # partner swap eval_partner!(params, dancers) end end These take care of the individual moves. Parsing the parameters from a string every single time probably isn’t ideal, but as it turns out, that optimisation isn’t really necessary. Note the + 1 in eval_exchange!, which is necessary because Julia is one of those crazy languages where indexes start from 1 instead of 0. These actions are pretty nice to implement, because Julia has circshift as a builtin to rotate a list, and allows you to assign to list slices and swap values in place with a single statement. function eval_spin!(params, dancers) shift = parse(Int, params) dancers[1:end] = circshift(dancers, shift) end function eval_exchange!(params, dancers) i, j = map(x -> parse(Int, x) + 1, split(params, "/")) dancers[i], dancers[j] = dancers[j], dancers[i] end function eval_partner!(params, dancers) a, b = split(params, "/") ia = findfirst([x == a for x in dancers]) ib = findfirst([x == b for x in dancers]) dancers[ia], dancers[ib] = b, a end dance! takes a list of moves and takes the dances once through the dance. function dance!(moves, dancers) for m in moves eval_move!(m, dancers) end end To solve part 1, we simply need to read the moves in, set up the initial positions of the dances and run the dance through once. join is necessary to a) turn characters into length-1 strings, and b) convert the list of strings back into a single string to print out. moves = split(readchomp(STDIN), ",") dancers = collect(join(c) for c in 'a':'p') orig_dancers = copy(dancers) dance!(moves, dancers) println(join(dancers)) Part 2 requires a little more work. We run the dance through again and again until we get back to the initial position, saving the intermediate positions in a list. The list now contains every possible position available from that starting point, so we can find position 1 billion by taking 1,000,000,000 modulo the list length (plus 1 because 1-based indexing) and use that to index into the list to get the final position. dance_cycle = [orig_dancers] while dancers != orig_dancers push!(dance_cycle, copy(dancers)) dance!(moves, dancers) end println(join(dance_cycle[1_000_000_000 % length(dance_cycle) + 1])) This terminates on my laptop in about 1.6s: Brute force 0; Careful thought 1! Dueling Generators — Rust — #adventofcode Day 15 Today’s challenge introduces two pseudo-random number generators which are trying to agree on a series of numbers. We play the part of the “judge”, counting the number of times their numbers agree in the lowest 16 bits. → Full code on GitHub Ever since I used Go to solve day 3, I’ve had a hankering to try the other new kid on the memory-safe compiled language block, Rust. I found it a bit intimidating at first because the syntax wasn’t as close to the C/C++ I’m familiar with and there are quite a few concepts unique to Rust, like the use of traits. But I figured it out, so I can tick another language of my to-try list. I also implemented a version in Python for comparison: the Python version is more concise and easier to read but the Rust version runs about 10× faster. First we include the std::env “crate” which will let us get access to commandline arguments, and define some useful constants for later. use std::env; const M: i64 = 2147483647; const MASK: i64 = 0b1111111111111111; const FACTOR_A: i64 = 16807; const FACTOR_B: i64 = 48271; gen_next generates the next number for a given generator’s sequence. gen_next_picky does the same, but for the “picky” generators, only returning values that meet their criteria. fn gen_next(factor: i64, current: i64) -> i64 { return (current * factor) % M; } fn gen_next_picky(factor: i64, current: i64, mult: i64) -> i64 { let mut next = gen_next(factor, current); while next % mult != 0 { next = gen_next(factor, next); } return next; } duel runs a single duel, and returns the number of times the generators agreed in the lowest 16 bits (found by doing a binary & with the mask defined above). Rust allows functions to be passed as parameters, so we use this to be able to run both versions of the duel using only this one function. fn duel<F, G>(n: i64, next_a: F, mut value_a: i64, next_b: G, mut value_b: i64) -> i64 where F: Fn(i64) -> i64, G: Fn(i64) -> i64, { let mut count = 0; for _ in 0..n { value_a = next_a(value_a); value_b = next_b(value_b); if (value_a & MASK) == (value_b & MASK) { count += 1; } } return count; } Finally, we read the start values from the command line and run the two duels. The expressions that begin |n| are closures (anonymous functions, often called lambdas in other languages) that we use to specify the generator functions for each duel. fn main() { let args: Vec<String> = env::args().collect(); let start_a: i64 = args[1].parse().unwrap(); let start_b: i64 = args[2].parse().unwrap(); println!( "Duel 1: {}", duel( 40000000, |n| gen_next(FACTOR_A, n), start_a, |n| gen_next(FACTOR_B, n), start_b, ) ); println!( "Duel 2: {}", duel( 5000000, |n| gen_next_picky(FACTOR_A, n, 4), start_a, |n| gen_next_picky(FACTOR_B, n, 8), start_b, ) ); } Disk Defragmentation — Haskell — #adventofcode Day 14 Today’s challenge has us helping a disk defragmentation program by identifying contiguous regions of used sectors on a 2D disk. → Full code on GitHub !!! commentary Wow, today’s challenge had a pretty steep learning curve. Day 14 was the first to directly reuse code from a previous day: the “knot hash” from day 10. I solved day 10 in Haskell, so I thought it would be easier to stick with Haskell for today as well. The first part was straightforward, but the second was pretty mind-bending in a pure functional language! I ended up solving it by implementing a [flood fill algorithm][flood]. It's recursive, which is right in Haskell's wheelhouse, but I ended up using `Data.Sequence` instead of the standard list type as its API for indexing is better. I haven't tried it, but I think it will also be a little faster than a naive list-based version. It took a looong time to figure everything out, but I had a day off work to be able to concentrate on it! A lot more imports for this solution, as we’re exercising a lot more of the standard library. module Main where import Prelude hiding (length, filter, take) import Data.Char (ord) import Data.Sequence import Data.Foldable hiding (length) import Data.Ix (inRange) import Data.Function ((&)) import Data.Maybe (fromJust, mapMaybe, isJust) import qualified Data.Set as Set import Text.Printf (printf) import System.Environment (getArgs) Also we’ll extract the key bits from day 10 into a module and import that. import KnotHash Now we define a few data types to make the code a bit more readable. Sector represent the state of a particular disk sector, either free, used (but unmarked) or used and marked as belonging to a given integer-labelled group. Grid is a 2D matrix of Sector, as a sequence of sequences. data Sector = Free | Used | Mark Int deriving (Eq) instance Show Sector where show Free = " ." show Used = " #" show (Mark i) = printf "%4d" i type GridRow = Seq Sector type Grid = Seq (GridRow) Some utility functions to make it easier to view the grids (which can be quite large): used for debugging but not in the finished solution. subGrid :: Int -> Grid -> Grid subGrid n = fmap (take n) . take n printRow :: GridRow -> IO () printRow row = do mapM_ (putStr . show) row putStr "\n" printGrid :: Grid -> IO () printGrid = mapM_ printRow makeKey generates the hash key for a given row. makeKey :: String -> Int -> String makeKey input n = input ++ "-" ++ show n stringToGridRow converts a binary string of ‘1’ and ‘0’ characters to a sequence of Sector values. stringToGridRow :: String -> GridRow stringToGridRow = fromList . map convert where convert x | x == '1' = Used | x == '0' = Free makeRow and makeGrid build up the grid to use based on the provided input string. makeRow :: String -> Int -> GridRow makeRow input n = stringToGridRow $ concatMap (printf "%08b") $ dense $ fullKnotHash 256 $ map ord $ makeKey input n makeGrid :: String -> Grid makeGrid input = fromList $ map (makeRow input) [0..127] Utility functions to count the number of used and free sectors, to give the solution to part 1. countEqual :: Sector -> Grid -> Int countEqual x = sum . fmap (length . filter (==x)) countUsed = countEqual Used countFree = countEqual Free Now the real meat begins! fundUnmarked finds the location of the next used sector that we haven’t yet marked. It returns a Maybe value, which is Just (x, y) if there is still an unmarked block or Nothing if there’s nothing left to mark. findUnmarked :: Grid -> Maybe (Int, Int) findUnmarked g | y == Nothing = Nothing | otherwise = Just (fromJust x, fromJust y) where hasUnmarked row = isJust $ elemIndexL Used row x = findIndexL hasUnmarked g y = case x of Nothing -> Nothing Just x' -> elemIndexL Used $ index g x' floodFill implements a very simple recursive flood fill. It takes a target and replacement value and a starting location, and fills in the replacement value for every connected location that currently has the target value. We use it below to replace a connected used region with a marked region. floodFill :: Sector -> Sector -> (Int, Int) -> Grid -> Grid floodFill t r (x, y) g | inRange (0, length g - 1) x && inRange (0, length g - 1) y && elem == t = let newRow = update y r row newGrid = update x newRow g in newGrid & floodFill t r (x+1, y) & floodFill t r (x-1, y) & floodFill t r (x, y+1) & floodFill t r (x, y-1) | otherwise = g where row = g `index` x elem = row `index` y markNextGroup looks for an unmarked group and marks it if found. If no more groups are found it returns Nothing. markAllGroups then repeatedly applies markNextGroup until Nothing is returned. markNextGroup :: Int -> Grid -> Maybe Grid markNextGroup i g = case findUnmarked g of Nothing -> Nothing Just loc -> Just $ floodFill Used (Mark i) loc g markAllGroups :: Grid -> Grid markAllGroups g = markAllGroups' 1 g where markAllGroups' i g = case markNextGroup i g of Nothing -> g Just g' -> markAllGroups' (i+1) g' onlyMarks filters a grid row and returns a list of (possibly duplicated) group numbers in the row. onlyMarks :: GridRow -> [Int] onlyMarks = mapMaybe getMark . toList where getMark Free = Nothing getMark Used = Nothing getMark (Mark i) = Just i Finally, countGroups puts all the group numbers into a set to get rid of duplicates and returns the size of the set, i.e. the total number of separate groups. countGroups :: Grid -> Int countGroups g = Set.size groupSet where groupSet = foldl' Set.union Set.empty $ fmap rowToSet g rowToSet = Set.fromList . toList . onlyMarks As always, every Haskell program needs a main function to drive the I/O and produce the actual result. main = do input <- fmap head getArgs let grid = makeGrid input used = countUsed grid marked = countGroups $ markAllGroups grid putStrLn $ "Used sectors: " ++ show used putStrLn $ "Groups: " ++ show marked Packet Scanners — Haskell — #adventofcode Day 13 Today’s challenge requires us to sneak past a firewall made up of a series of scanners. → Full code on GitHub !!! commentary I wasn’t really thinking straight when I solved this challenge. I got a solution without too much trouble, but I ended up simulating the step-by-step movement of the scanners. I finally realised that I could calculate whether or not a given scanner was safe at a given time directly with modular arithmetic, and it bugged me so much that I reimplemented the solution. Both are given below, the faster one first. First we introduce some standard library stuff and define some useful utilities. module Main where import qualified Data.Text as T import Data.Maybe (mapMaybe) strip :: String -> String strip = T.unpack . T.strip . T.pack splitOn :: String -> String -> [String] splitOn sep = map T.unpack . T.splitOn (T.pack sep) . T.pack parseScanner :: String -> (Int, Int) parseScanner s = (d, r) where [d, r] = map read $ splitOn ": " s traverseFW does all the hard work: it checks for each scanner whether or not it’s safe as we pass through, and returns a list of the severities of each time we’re caught. mapMaybe is like the standard map in many languages, but operates on a list of Haskell Maybe values, like a combined map and filter. If the value is Just x, x gets included in the returned list; if the value is Nothing, then it gets thrown away. traverseFW :: Int -> [(Int, Int)] -> [Int] traverseFW delay = mapMaybe caught where caught (d, r) = if (d + delay) `mod` (2*(r-1)) == 0 then Just (d * r) else Nothing Then the total severity of our passage through the firewall is simply the sum of each individual severity. severity :: [(Int, Int)] -> Int severity = sum . traverseFW 0 But we don’t want to know how badly we got caught, we want to know how long to wait before setting off to get through safely. findDelay tries traversing the firewall with increasing delay, and returns the delay for the first pass where we predict not getting caught. findDelay :: [(Int, Int)] -> Int findDelay scanners = head $ filter (null . flip traverseFW scanners) [0..] And finally, we put it all together and calculate and print the result. main = do scanners <- fmap (map parseScanner . lines) getContents putStrLn $ "Severity: " ++ (show $ severity scanners) putStrLn $ "Delay: " ++ (show $ findDelay scanners) I’m not generally bothered about performance for these challenges, but here I’ll note that my second attempt runs in a little under 2 seconds on my laptop: $ time ./13-packet-scanners-redux < 13-input.txt Severity: 1900 Delay: 3966414 ./13-packet-scanners-redux < 13-input.txt 1.73s user 0.02s system 99% cpu 1.754 total Compare that with the first, simulation-based one, which takes nearly a full minute: $ time ./13-packet-scanners < 13-input.txt Severity: 1900 Delay: 3966414 ./13-packet-scanners < 13-input.txt 57.63s user 0.27s system 100% cpu 57.902 total And for good measure, here’s the code. Notice the tick and tickOne functions, which together simulate moving all the scanners by one step; for this to work we have to track the full current state of each scanner, which is easier to read with a Haskell record-based custom data type. traverseFW is more complicated because it has to drive the simulation, but the rest of the code is mostly the same. module Main where import qualified Data.Text as T import Control.Monad (forM_) data Scanner = Scanner { depth :: Int , range :: Int , pos :: Int , dir :: Int } instance Show Scanner where show (Scanner d r p dir) = show d ++ "/" ++ show r ++ "/" ++ show p ++ "/" ++ show dir strip :: String -> String strip = T.unpack . T.strip . T.pack splitOn :: String -> String -> [String] splitOn sep str = map T.unpack $ T.splitOn (T.pack sep) $ T.pack str parseScanner :: String -> Scanner parseScanner s = Scanner d r 0 1 where [d, r] = map read $ splitOn ": " s tickOne :: Scanner -> Scanner tickOne (Scanner depth range pos dir) | pos <= 0 = Scanner depth range (pos+1) 1 | pos >= range - 1 = Scanner depth range (pos-1) (-1) | otherwise = Scanner depth range (pos+dir) dir tick :: [Scanner] -> [Scanner] tick = map tickOne traverseFW :: [Scanner] -> [(Int, Int)] traverseFW = traverseFW' 0 where traverseFW' _ [] = [] traverseFW' layer scanners@((Scanner depth range pos _):rest) -- | layer == depth && pos == 0 = (depth*range) + (traverseFW' (layer+1) $ tick rest) | layer == depth && pos == 0 = (depth,range) : (traverseFW' (layer+1) $ tick rest) | layer == depth && pos /= 0 = traverseFW' (layer+1) $ tick rest | otherwise = traverseFW' (layer+1) $ tick scanners severity :: [Scanner] -> Int severity = sum . map (uncurry (*)) . traverseFW empty :: [a] -> Bool empty [] = True empty _ = False findDelay :: [Scanner] -> Int findDelay scanners = delay where (delay, _) = head $ filter (empty . traverseFW . snd) $ zip [0..] $ iterate tick scanners main = do scanners <- fmap (map parseScanner . lines) getContents putStrLn $ "Severity: " ++ (show $ severity scanners) putStrLn $ "Delay: " ++ (show $ findDelay scanners) Digital Plumber — Python — #adventofcode Day 12 Today’s challenge has us helping a village of programs who are unable to communicate. We have a list of the the communication channels between their houses, and need to sort them out into groups such that we know that each program can communicate with others in its own group but not any others. Then we have to calculate the size of the group containing program 0 and the total number of groups. → Full code on GitHub !!! commentary This is one of those problems where I’m pretty sure that my algorithm isn’t close to being the most efficient, but it definitely works! For the sake of solving the challenge that’s all that matters, but it still bugs me. By now I’ve become used to using fileinput to transparently read data either from files given on the command-line or standard input if no arguments are given. import fileinput as fi First we make an initial pass through the input data, creating a group for each line representing the programs on that line (which can communicate with each other). We store this as a Python set. groups = [] for line in fi.input(): head, rest = line.split(' <-> ') group = set([int(head)]) group.update([int(x) for x in rest.split(', ')]) groups.append(group) Now we iterate through the groups, starting with the first, and merging any we find that overlap with our current group. i = 0 while i < len(groups): current = groups[i] Each pass through the groups brings more programs into the current group, so we have to go through and check their connections too. We make several merge passes, until we detect that no more merges took place. num_groups = len(groups) + 1 while num_groups > len(groups): j = i+1 num_groups = len(groups) This inner loop does the actual merging, and deletes each group as it’s merged in. while j < len(groups): if len(current & groups[j]) > 0: current.update(groups[j]) del groups[j] else: j += 1 i += 1 All that’s left to do now is to display the results. print("Number in group 0:", len([g for g in groups if 0 in g][0])) print("Number of groups:", len(groups)) Hex Ed — Python — #adventofcode Day 11 Today’s challenge is to help a program find its child process, which has become lost on a hexagonal grid. We need to follow the path taken by the child (given as input) and calculate the distance it is from home along with the furthest distance it has been at any point along the path. → Full code on GitHub !!! commentary I found this one quite interesting in that it was very quick to solve. In fact, I got lucky and my first quick implementation (max(abs(l)) below) gave the correct answer in spite of missing an obvious not-so-edge case. Thinking about it, there’s only a ⅓ chance that the first incorrect implementation would give the wrong answer! The code is shorter, so you get more words today. ☺ There are a number of different co-ordinate systems on a hexagonal grid (I discovered while reading up after solving it…). I intuitively went for the system known as ‘axial’ coordinates, where you pick two directions aligned to the grid as your x and y axes: note that these won’t be perpendicular. I chose ne/sw as the x axis and se/nw as y, but there are three other possible choices. That leads to the following definition for the directions, encoded as numpy arrays because that makes some of the code below neater. import numpy as np STEPS = {d: np.array(v) for d, v in [('ne', (1, 0)), ('se', (0, -1)), ('s', (-1, -1)), ('sw', (-1, 0)), ('nw', (0, 1)), ('n', (1, 1))]} hex_grid_dist, given a location l calculates the number of steps needed to reach that location from the centre at (0, 0). Notice that we can’t simply use the Manhattan distance here because, for example, one step north takes us to (1, 1), which would give a Manhattan distance of 2. Instead, we can see that moving in the n/s direction allows us to increment or decrement both coordinates at the same time: If the coordinates have the same sign: move n/s until one of them is zero, then move along the relevant ne or se axis back to the origin; in this case the number of steps is greatest of the absolute values of the two coordinates If the coordinates have opposite signs: move independently along the ne and se axes to reduce each to 0; this time the number of steps is the sum of the absolute values of the two coordinates def hex_grid_distance(l): if sum(np.sign(l)) == 0: # i.e. opposite signs return sum(abs(l)) else: return max(abs(l)) Now we can read in the path followed by the child and follow it ourselves, tracking the maximum distance from home along the way. path = input().strip().split(',') location = np.array((0, 0)) max_distance = 0 for step in map(STEPS.get, path): location += step max_distance = max(max_distance, hex_grid_distance(location)) distance = hex_grid_distance(location) print("Child process is at", location, "which is", distance, "steps away") print("Greatest distance was", max_distance) Knot Hash — Haskell — #adventofcode Day 10 Today’s challenge asks us to help a group of programs implement a (highly questionable) hashing algorithm that involves repeatedly reversing parts of a list of numbers. → Full code on GitHub !!! commentary I went with Haskell again today, because it’s the weekend so I have a bit more time, and I really enjoyed yesterday’s Haskell implementation. Today gave me the opportunity to explore the standard library a bit more, as well as lending itself nicely to being decomposed into smaller parts to be combined using higher-order functions. You know the drill by know: import stuff we’ll use later. module Main where import Data.Char (ord) import Data.Bits (xor) import Data.Function ((&)) import Data.List (unfoldr) import Text.Printf (printf) import qualified Data.Text as T The worked example uses a concept of the “current position” as a pointer to a location in a static list. In Haskell it makes more sense to instead use the front of the list as the current position, and rotate the whole list as we progress to bring the right element to the front. rotate :: Int -> [Int] -> [Int] rotate 0 xs = xs rotate n xs = drop n' xs ++ take n' xs where n' = n `mod` length xs The simple version of the hash requires working through the input list, modifying the working list as we go, and incrementing a “skip” counter with each step. Converting this to a functional style, we simply zip up the input with an infinite list [0, 1, 2, 3, ...] to give the counter values. Notice that we also have to calculate how far to rotate the working list to get back to its original position. foldl lets us specify a function that returns a modified version of the working list and feeds the input list in one at a time. simpleKnotHash :: Int -> [Int] -> [Int] simpleKnotHash size input = foldl step [0..size-1] input' & rotate (negate finalPos) where input' = zip input [0..] finalPos = sum $ zipWith (+) input [0..] reversePart xs n = (reverse $ take n xs) ++ drop n xs step xs (n, skip) = reversePart xs n & rotate (n+skip) The full version of the hash (part 2 of the challenge) starts the same way as the simple version, except making 64 passes instead of one: we can do this by using replicate to make a list of 64 copies, then collapse that into a single list with concat. fullKnotHash :: Int -> [Int] -> [Int] fullKnotHash size input = simpleKnotHash size input' where input' = concat $ replicate 64 input The next step in calculating the full hash collapses the full 256-element “sparse” hash down into 16 elements by XORing groups of 16 together. unfoldr is a nice efficient way of doing this. dense :: [Int] -> [Int] dense = unfoldr dense' where dense' [] = Nothing dense' xs = Just (foldl1 xor $ take 16 xs, drop 16 xs) The final hash step is to convert the list of integers into a hexadecimal string. hexify :: [Int] -> String hexify = concatMap (printf "%02x") These two utility functions put together building blocks from the Data.Text module to parse the input string. Note that no arguments are given: the functions are defined purely by composing other functions using the . operator. In Haskell this is referred to as “point-free” style. strip :: String -> String strip = T.unpack . T.strip . T.pack parseInput :: String -> [Int] parseInput = map (read . T.unpack) . T.splitOn (T.singleton ',') . T.pack Now we can put it all together, including building the weird input for the “full” hash. main = do input <- fmap strip getContents let simpleInput = parseInput input asciiInput = map ord input ++ [17, 31, 73, 47, 23] (a:b:_) = simpleKnotHash 256 simpleInput print $ (a*b) putStrLn $ fullKnotHash 256 asciiInput & dense & hexify Stream Processing — Haskell — #adventofcode Day 9 In today’s challenge we come across a stream that we need to cross. But of course, because we’re stuck inside a computer, it’s not water but data flowing past. The stream is too dangerous to cross until we’ve removed all the garbage, and to prove we can do that we have to calculate a score for the valid data “groups” and the number of garbage characters to remove. → Full code on GitHub !!! commentary One of my goals for this process was to knock the rust of my functional programming skills in Haskell, and I haven’t done that for the whole of the first week. Processing strings character by character and acting according to which character shows up seems like a good choice for pattern-matching though, so here we go. I also wanted to take a bash at test-driven development in Haskell, so I also loaded up the Test.Hspec module to give it a try. I did find keeping track of all the state in arguments a bit mind boggling, and I think it could have been improved through use of a data type using record syntax and the `State` monad, so that's something to look at for a future challenge. First import the extra bits we’ll need. module Main where import Test.Hspec import Data.Function ((&)) countGroups solves the first part of the problem, counting up the “score” of the valid data in the stream. countGroups' is an auxiliary function that holds some state in its arguments. We use pattern matching for the base case: [] represents the empty list in Haskell, which indicates we’ve finished the whole stream. Otherwise, we split the remaining stream into its first character and remainder, and use guards to decide how to interpret it. If skip is true, discard the character and carry on with skip set back to false. If we find a “!”, that tells us to skip the next. Other characters mark groups or sets of garbage: groups increase the score when they close and garbage is discarded. We continue to progress the list by recursing with the remainder of the stream and any updated state. countGroups :: String -> Int countGroups = countGroups' 0 0 False False where countGroups' score _ _ _ [] = score countGroups' score level garbage skip (c:rest) | skip = countGroups' score level garbage False rest | c == '!' = countGroups' score level garbage True rest | garbage = case c of '>' -> countGroups' score level False False rest _ -> countGroups' score level True False rest | otherwise = case c of '{' -> countGroups' score (level+1) False False rest '}' -> countGroups' (score+level) (level-1) False False rest ',' -> countGroups' score level False False rest '<' -> countGroups' score level True False rest c -> error $ "Garbage character found outside garbage: " ++ show c countGarbage works almost identically to countGroups, except it ignores groups and counts garbage. They are structured so similarly that it would probably make more sense to combine them to a single function that returns both counts. countGarbage :: String -> Int countGarbage = countGarbage' 0 False False where countGarbage' count _ _ [] = count countGarbage' count garbage skip (c:rest) | skip = countGarbage' count garbage False rest | c == '!' = countGarbage' count garbage True rest | garbage = case c of '>' -> countGarbage' count False False rest _ -> countGarbage' (count+1) True False rest | otherwise = case c of '<' -> countGarbage' count True False rest _ -> countGarbage' count False False rest Hspec gives us a domain-specific language heavily inspired by the rspec library for Ruby: the tests read almost like natural language. I built up these tests one-by-one, gradually implementing the appropriate bits of the functions above, a process known as Test-driven development. runTests = hspec $ do describe "countGroups" $ do it "counts valid groups" $ do countGroups "{}" `shouldBe` 1 countGroups "{{{}}}" `shouldBe` 6 countGroups "{{{},{},{{}}}}" `shouldBe` 16 countGroups "{{},{}}" `shouldBe` 5 it "ignores garbage" $ do countGroups "{<a>,<a>,<a>,<a>}" `shouldBe` 1 countGroups "{{<ab>},{<ab>},{<ab>},{<ab>}}" `shouldBe` 9 it "skips marked characters" $ do countGroups "{{<!!>},{<!!>},{<!!>},{<!!>}}" `shouldBe` 9 countGroups "{{<a!>},{<a!>},{<a!>},{<ab>}}" `shouldBe` 3 describe "countGarbage" $ do it "counts garbage characters" $ do countGarbage "<>" `shouldBe` 0 countGarbage "<random characters>" `shouldBe` 17 countGarbage "<<<<>" `shouldBe` 3 it "ignores non-garbage" $ do countGarbage "{{},{}}" `shouldBe` 0 countGarbage "{{<ab>},{<ab>},{<ab>},{<ab>}}" `shouldBe` 8 it "skips marked characters" $ do countGarbage "<{!>}>" `shouldBe` 2 countGarbage "<!!>" `shouldBe` 0 countGarbage "<!!!>" `shouldBe` 0 countGarbage "<{o\"i!a,<{i<a>" `shouldBe` 10 Finally, the main function reads in the challenge input and calculates the answers, printing them on standard output. main = do runTests repeat '=' & take 78 & putStrLn input <- getContents & fmap (filter (/='\n')) putStrLn $ "Found " ++ show (countGroups input) ++ " groups" putStrLn $ "Found " ++ show (countGarbage input) ++ " characters garbage" I Heard You Like Registers — Python — #adventofcode Day 8 Today’s challenge describes a simple instruction set for a CPU, incrementing and decrementing values in registers according to simple conditions. We have to interpret a stream of these instructions, and to prove that we’ve done so, give the highest value of any register, both at the end of the program and throughout the whole program. → Full code on GitHub !!! commentary This turned out to be a nice straightforward one to implement, as the instruction format was easily parsed by regular expression, and Python provides the eval function which made evaluating the conditions a doddle. Import various standard library bits that we’ll use later. import re import fileinput as fi from math import inf from collections import defaultdict We could just parse the instructions by splitting the string, but using a regular expression is a little bit more robust because it won’t match at all if given an invalid instruction. INSTRUCTION_RE = re.compile(r'(\w+) (inc|dec) (-?\d+) if (.+)\s*') def parse_instruction(instruction): match = INSTRUCTION_RE.match(instruction) return match.group(1, 2, 3, 4) Executing an instruction simply checks the condition and if it evaluates to True updates the relevant register. def exec_instruction(registers, instruction): name, op, value, cond = instruction value = int(value) if op == 'dec': value = -value if eval(cond, globals(), registers): registers[name] += value highest_value returns the maximum value found in any register. def highest_value(registers): return sorted(registers.items(), key=lambda x: x[1], reverse=True)[0][1] Finally, loop through all the instructions and carry them out, updating global_max as we go. We need to be able to deal with registers that haven’t been accessed before. Keeping the registers in a dictionary means that we can evaluate the conditions directly using eval above, passing it as the locals argument. The standard dict will raise an exception if we try to access a key that doesn’t exist, so instead we use collections.defaultdict, which allows us to specify what the default value for a non-existent key will be. New registers start at 0, so we use a simple lambda to define a function that always returns 0. global_max = -inf registers = defaultdict(lambda: 0) for i in map(parse_instruction, fi.input()): exec_instruction(registers, i) global_max = max(global_max, highest_value(registers)) print('Max value:', highest_value(registers)) print('All-time max:', global_max) Recursive Circus — Ruby — #adventofcode Day 7 Today’s challenge introduces a set of processes balancing precariously on top of each other. We find them stuck and unable to get down because one of the processes is the wrong size, unbalancing the whole circus. Our job is to figure out the root from the input and then find the correct weight for the single incorrect process. → Full code on GitHub !!! commentary So I didn’t really intend to take a full polyglot approach to Advent of Code, but it turns out to have been quite fun, so I made a shortlist of languages to try. Building a tree is a classic application for object-orientation using a class to represent tree nodes, and I’ve always liked the feel of Ruby’s class syntax, so I gave it a go. First make sure we have access to Set, which we’ll use later. require 'set' Now to define the CircusNode class, which represents nodes in the tree. attr :s automatically creates a function s that returns the value of the instance attribute @s class CircusNode attr :name, :weight def initialize(name, weight, children=nil) @name = name @weight = weight @children = children || [] end Add a << operator (the same syntax for adding items to a list) that adds a child to this node. def <<(c) @children << c @total_weight = nil end total_weight recursively calculates the weight of this node and everything above it. The @total_weight ||= blah idiom caches the value so we only calculate it once. def total_weight @total_weight ||= @weight + @children.map {|c| c.total_weight}.sum end balance_weight does the hard work of figuring out the proper weight for the incorrect node by recursively searching through the tree. def balance_weight(target=nil) by_weight = Hash.new{|h, k| h[k] = []} @children.each{|c| by_weight[c.total_weight] << c} if by_weight.size == 1 then if target return @weight - (total_weight - target) else raise ArgumentError, 'This tree seems balanced!' end else odd_one_out = by_weight.select {|k, v| v.length == 1}.first[1][0] child_target = by_weight.select {|k, v| v.length > 1}.first[0] return odd_one_out.balance_weight child_target end end A couple of utility functions for displaying trees finish off the class. def to_s "#{@name} (#{@weight})" end def print_tree(n=0) puts "#{' '*n}#{self} -> #{self.total_weight}" @children.each do |child| child.print_tree n+1 end end end build_circus takes input as a list of lists [name, weight, children]. We make two passes over this list, first creating all the nodes, then building the tree by adding children to parents. def build_circus(data) all_nodes = {} all_children = Set.new data.each do |name, weight, children| all_nodes[name] = CircusNode.new name, weight end data.each do |name, weight, children| children.each {|child| all_nodes[name] << all_nodes[child]} all_children.merge children end root_name = (all_nodes.keys.to_set - all_children).first return all_nodes[root_name] end Finally, build the tree and solve the problem! Note that we use String.to_sym to convert the node names to symbols (written in Ruby as :symbol), because they’re faster to work with in Hashes and Sets as we do above. data = readlines.map do |line| match = /(?<parent>\w+) \((?<weight>\d+)\)(?: -> (?<children>.*))?/.match line [match['parent'].to_sym, match['weight'].to_i, match['children'] ? match['children'].split(', ').map {|x| x.to_sym} : []] end root = build_circus data puts "Root node: #{root}" puts root.balance_weight Memory Reallocation — Python — #adventofcode Day 6 Today’s challenge asks us to follow a recipe for redistributing objects in memory that bears a striking resemblance to the rules of the African game Mancala. → Full code on GitHub !!! commentary When I was doing my MSci, one of our programming exercises was to write (in Haskell, IIRC) a program to play a Mancala variant called Oware, so this had a nice ring of nostalgia. Back to Python today: it's already become clear that it's by far my most fluent language, which makes sense as it's the only one I've used consistently since my schooldays. I'm a bit behind on the blog posts, so you get this one without any explanation, for now at least! import math def reallocate(mem): max_val = -math.inf size = len(mem) for i, x in enumerate(mem): if x > max_val: max_val = x max_index = i i = max_index mem[i] = 0 remaining = max_val while remaining > 0: i = (i + 1) % size mem[i] += 1 remaining -= 1 return mem def detect_cycle(mem): mem = list(mem) steps = 0 prev_states = {} while tuple(mem) not in prev_states: prev_states[tuple(mem)] = steps steps += 1 mem = reallocate(mem) return (steps, steps - prev_states[tuple(mem)]) initial_state = map(int, input().split()) print("Initial state is ", initial_state) steps, cycle = detect_cycle(initial_state) print("Steps to cycle: ", steps) print("Steps in cycle: ", cycle) A Maze of Twisty Trampolines — C++ — #adventofcode Day 5 Today’s challenge has us attempting to help the CPU escape from a maze of instructions. It’s not quite a Turing Machine, but it has that feeling of moving a read/write head up and down a tape acting on and changing the data found there. → Full code on GitHub !!! commentary I haven’t written anything in C++ for over a decade. It sounds like there have been lots of interesting developments in the language since then, with C++11, C++14 and the freshly finalised C++17 standards (built-in parallelism in the STL!). I won’t use any of those, but I thought I’d dust off my C++ and see what happened. Thankfully the Standard Template Library classes still did what I expected! As usual, we first include the parts of the standard library we’re going to use: iostream for input & output; vector for the container. We also declare that we’re using the std namespace, so that we don’t have to prepend vector and the other classes with std::. #include <iostream> #include <vector> using namespace std; steps_to_escape_part1 implements part 1 of the challenge: we read a location, move forward/backward by the number of steps given in that location, then add one to the location before repeating. The result is the number of steps we take before jumping outside the list. int steps_to_escape_part1(vector<int>& instructions) { int pos = 0, iterations = 0, new_pos; while (pos < instructions.size()) { new_pos = pos + instructions[pos]; instructions[pos]++; pos = new_pos; iterations++; } return iterations; } steps_to_escape_part2 solves part 2, which is very similar, except that an offset greater than 3 is decremented instead of incremented before moving on. int steps_to_escape_part2(vector<int>& instructions) { int pos = 0, iterations = 0, new_pos, offset; while (pos < instructions.size()) { offset = instructions[pos]; new_pos = pos + offset; instructions[pos] += offset >=3 ? -1 : 1; pos = new_pos; iterations++; } return iterations; } Finally we pull it all together and link it up to the input. int main() { vector<int> instructions1, instructions2; int n; The cin class lets us read data from standard input, which we then add to a vector of ints to give our list of instructions. while (true) { cin >> n; if (cin.eof()) break; instructions1.push_back(n); } Solving the problem modifies the input, so we need to take a copy to solve part 2 as well. Thankfully the STL makes this easy with iterators. instructions2.insert(instructions2.begin(), instructions1.begin(), instructions1.end()); Finally, compute the result and print it on standard output. cout << steps_to_escape_part1(instructions1) << endl; cout << steps_to_escape_part2(instructions2) << endl; return 0; } High Entropy Passphrases — Python — #adventofcode Day 4 Today’s challenge describes some simple rules supposedly intended to enforce the use of secure passwords. All we have to do is test a list of passphrase and identify which ones meet the rules. → Full code on GitHub !!! commentary Fearing that today might be as time-consuming as yesterday, I returned to Python and it’s hugely powerful “batteries-included” standard library. Thankfully this challenge was more straightforward, and I actually finished this before finishing day 3. First, let’s import two useful utilities. from fileinput import input from collections import Counter Part 1 requires simply that a passphrase contains no repeated words. No problem: we split the passphrase into words and count them, and check if any was present more than once. Counter is an amazingly useful class to have in a language’s standard library. All it does is count things: you add objects to it, and then it will tell you how many of a given object you have. We’re going to use it to count those potentially duplicated words. def is_valid(passphrase): counter = Counter(passphrase.split()) return counter.most_common(1)[0][1] == 1 Part 2 requires that no word in the passphrase be an anagram of any other word. Since we don’t need to do anything else with the words afterwards, we can check for anagrams by sorting the letters in each word: “leaf” and “flea” both become “aefl” and can be compared directly. Then we count as before. def is_valid_ana(passphrase): counter = Counter(''.join(sorted(word)) for word in passphrase.split()) return counter.most_common(1)[0][1] == 1 Finally we pull everything together. sum(map(boolean_func, list)) is a common idiom in Python for counting the number of times a condition (checked by boolean_func) is true. In Python, True and False can be treated as the numbers 1 and 0 respectively, so that summing a list of Boolean values gives you the number of True values in the list. lines = list(input()) print(sum(map(is_valid, lines))) print(sum(map(is_valid_ana, lines))) Spiral Memory — Go — #adventofcode Day 3 Today’s challenge requires us to perform some calculations on an “experimental memory layout”, with cells moving outwards from the centre of a square spiral (squiral?). → Full code on GitHub !!! commentary I’ve been wanting to try my hand at Go, the memory-safe, statically typed compiled language from Google for a while. Today’s challenge seemed a bit more mathematical in nature, meaning that I wouldn’t need too many advanced language features or knowledge of a standard library, so I thought I’d give it a “go”. It might have been my imagination, but it was impressive how quickly the compiled program chomped through 60 different input values while I was debugging. I actually spent far too long on this problem because my brain led me down a blind alley trying to do the wrong calculation, but I got there in the end! The solution is a bit difficult to explain without diagrams, which I don't really have time to draw right now, but fear not because several other people have. First take a look at [the challenge itself which explains the spiral memory concept](http://adventofcode.com/2017/day/3). Then look at the [nice diagrams that Phil Tooley made with Python](http://acceleratedscience.co.uk/blog/adventofcode-day-3-spiral-memory/) and hopefully you'll be able to see what's going on! It's interesting to note that this challenge also admits of an algorithmic solution instead of the mathematical one: you can model the memory as an infinite grid using a suitable data structure and literally move around it in a spiral. In hindsight this is a much better way of solving the challenge quickly because it's easier and less error-prone to code. I'm quite pleased with my maths-ing though, and it's much quicker than the algorithmic version! First some Go boilerplate: we have to define the package we’re in (main, because it’s an executable we’re producing) and import the libraries we’ll use. package main import ( "fmt" "math" "os" ) Weirdly, Go doesn’t seem to have these basic mathematics functions for integers in its standard library (please someone correct me if I’m wrong!) so I’ll define them instead of mucking about with data types. Go doesn’t do any implicit type conversion, even between numeric types, and the math builtin package only operates on float64 values. func abs(n int) int { if n < 0 { return -n } return n } func min(x, y int) int { if x < y { return x } return y } func max(x, y int) int { if x > y { return x } return y } This does the heavy lifting for part one: converting from a position on the spiral to a column and row in the grid. (0, 0) is the centre of the spiral. This actually does a bit more than is necessary to calculate the distance as required for part 1, but we’ll use it again for part 2. func spiral_to_xy(n int) (int, int) { if n == 1 { return 0, 0 } r := int(math.Floor((math.Sqrt(float64(n-1)) + 1) / 2)) n_r := n - (2*r-1)*(2*r-1) o := ((n_r - 1) % (2 * r)) - r + 1 sector := (n_r - 1) / (2 * r) switch sector { case 0: return r, o case 1: return -o, r case 2: return -r, -o case 3: return o, -r } return 0, 0 } Now use spiral_to_xy to calculate the Manhattan distance that the value at location n in the spiral memory are carried to reach the “access port” at 0. func distance(n int) int { x, y := spiral_to_xy(n) return abs(x) + abs(y) } This function does the opposite of spiral_to_xy, translating a grid position back to its position on the spiral. This is the one that took me far too long to figure out because I had a brain bug and tried to calculate the value s (which sector or quarter of the spiral we’re looking at) in a way that was never going to work! Fortunately I came to my senses. func xy_to_spiral(x, y int) int { if x == 0 && y == 0 { return 1 } r := max(abs(x), abs(y)) var s, o, n int if x+y > 0 && x-y >= 0 { s = 0 } else if x-y < 0 && x+y >= 0 { s = 1 } else if x+y < 0 && x-y <= 0 { s = 2 } else { s = 3 } switch s { case 0: o = y case 1: o = -x case 2: o = -y case 3: o = x } n = o + r*(2*s+1) + (2*r-1)*(2*r-1) return n } This is a utility function that uses xy_to_spiral to fetch the value at a given (x, y) location, and returns zero if we haven’t filled that location yet. func get_spiral(mem []int, x, y int) int { n := xy_to_spiral(x, y) - 1 if n < len(mem) { return mem[n] } return 0 } Finally we solve part 2 of the problem, which involves going round the spiral writing values into it that are the sum of some values already written. The result is the first of these sums that is greater than or equal to the given input value. func stress_test(input int) int { mem := make([]int, 1) n := 0 mem[0] = 1 for mem[n] < input { n++ x, y := spiral_to_xy(n + 1) mem = append(mem, get_spiral(mem, x+1, y)+ get_spiral(mem, x+1, y+1)+ get_spiral(mem, x, y+1)+ get_spiral(mem, x-1, y+1)+ get_spiral(mem, x-1, y)+ get_spiral(mem, x-1, y-1)+ get_spiral(mem, x, y-1)+ get_spiral(mem, x+1, y-1)) } return mem[n] } Now the last part of the program puts it all together, reading the input value from a commandline argument and printing the results of the two parts of the challenge: func main() { var n int fmt.Sscanf(os.Args[1], "%d", &n) fmt.Printf("Input is %d\n", n) fmt.Printf("Distance is %d\n", distance(n)) fmt.Printf("Stress test result is %d\n", stress_test(n)) } Corruption Checksum — Python — #adventofcode Day 2 Today’s challenge is to calculate a rather contrived “checksum” over a grid of numbers. → Full code on GitHub !!! commentary Today I went back to plain Python, and I didn’t do formal tests because only one test case was given for each part of the problem. I just got stuck in. I did write part 2 out in as nested `for` loops as an intermediate step to working out the generator expression. I think that expanded version may have been more readable. Having got that far, I couldn't then work out how to finally eliminate the need for an auxiliary function entirely without either sorting the same elements multiple times or sorting each row as it's read. First we read in the input, split it and convert it to numbers. fileinput.input() returns an iterator over the lines in all the files passed as command-line arguments, or over standard input if no files are given. from fileinput import input sheet = [[int(x) for x in l.split()] for l in input()] Part 1 of the challenge calls for finding the difference between the largest and smallest number in each row, and then summing those differences: print(sum(max(x) - min(x) for x in sheet)) Part 2 is a bit more involved: for each row we have to find the unique pair of elements that divide into each other without remainder, then sum the result of those divisions. We can make it a little easier by sorting each row; then we can take each number in turn and compare it only with the numbers after it (which are guaranteed to be larger). Doing this ensures we only make each comparison once. def rowsum_div(row): row = sorted(row) return sum(y // x for i, x in enumerate(row) for y in row[i+1:] if y % x == 0) print(sum(map(rowsum_div, sheet))) We can make this code shorter (if not easier to read) by sorting each row as it’s read: sheet = [sorted(int(x) for x in l.split()) for l in input()] Then we can just use the first and last elements in each row for part 1, as we know those are the smallest and largest respectively in the sorted row: print(sum(x[-1] - x[0] for x in sheet)) Part 2 then becomes a sum over a single generator expression: print(sum(y // x for row in sheet for i, x in enumerate(row) for y in row[i+1:] if y % x == 0)) Very satisfying! Inverse Captcha — Coconut — #adventofcode Day 1 Well, December’s here at last, and with it Day 1 of Advent of Code. … It goes on to explain that you may only leave by solving a captcha to prove you’re not a human. Apparently, you only get one millisecond to solve the captcha: too fast for a normal human, but it feels like hours to you. … As well as posting solutions here when I can, I’ll be putting them all on https://github.com/jezcope/aoc2017 too. !!! commentary After doing some challenges from last year in Haskell for a warm up, I felt inspired to try out the functional-ish Python dialect, Coconut. Now that I’ve done it, it feels a bit of an odd language, neither fish nor fowl. It’ll look familiar to any Pythonista, but is loaded with features normally associated with functional languages, like pattern matching, destructuring assignment, partial application and function composition. That makes it quite fun to work with, as it works similarly to Haskell, but because it's restricted by the basic rules of Python syntax everything feels a bit more like hard work than it should. The accumulator approach feels clunky, but it's necessary to allow [tail call elimination](https://en.wikipedia.org/wiki/Tail_call), which Coconut will do and I wanted to see in action. Lo and behold, if you take a look at the [compiled Python version](https://github.com/jezcope/aoc2017/blob/86c8100824bda1b35e5db6e02d4b80890be7a022/01-inverse-captcha.py#L675) you'll see that my recursive implementation has been turned into a non-recursive `while` loop. Then again, maybe I'm just jealous of Phil Tooley's [one-liner solution in Python](https://github.com/ptooley/aocGolf/blob/1380d78194f1258748ccfc18880cfd575baf5d37/2017.py#L8). import sys def inverse_captcha_(s, acc=0): case reiterable(s): match (|d, d|) :: rest: return inverse_captcha_((|d|) :: rest, acc + int(d)) match (|d0, d1|) :: rest: return inverse_captcha_((|d1|) :: rest, acc) return acc def inverse_captcha(s) = inverse_captcha_(s :: s[0]) def inverse_captcha_1_(s0, s1, acc=0): case (reiterable(s0), reiterable(s1)): match ((|d0|) :: rest0, (|d0|) :: rest1): return inverse_captcha_1_(rest0, rest1, acc + int(d0)) match ((|d0|) :: rest0, (|d1|) :: rest1): return inverse_captcha_1_(rest0, rest1, acc) return acc def inverse_captcha_1(s) = inverse_captcha_1_(s, s$[len(s)//2:] :: s) def test_inverse_captcha(): assert "1111" |> inverse_captcha == 4 assert "1122" |> inverse_captcha == 3 assert "1234" |> inverse_captcha == 0 assert "91212129" |> inverse_captcha == 9 def test_inverse_captcha_1(): assert "1212" |> inverse_captcha_1 == 6 assert "1221" |> inverse_captcha_1 == 0 assert "123425" |> inverse_captcha_1 == 4 assert "123123" |> inverse_captcha_1 == 12 assert "12131415" |> inverse_captcha_1 == 4 if __name__ == "__main__": sys.argv[1] |> inverse_captcha |> print sys.argv[1] |> inverse_captcha_1 |> print Advent of Code 2017: introduction It’s a common lament of mine that I don’t get to write a lot of code in my day-to-day job. I like the feeling of making something from nothing, and I often look for excuses to write bits of code, both at work and outside it. Advent of Code is a daily series of programming challenges for the month of December, and is about to start its third annual incarnation. I discovered it too late to take part in any serious way last year, but I’m going to give it a try this year. There are no restrictions on programming language (so of course some people delight in using esoteric languages like Brainf**k), but I think I’ll probably stick with Python for the most part. That said, I miss my Haskell days and I’m intrigued by new kids on the block Go and Rust, so I might end up throwing in a few of those on some of the simpler challenges. I’d like to focus a bit more on how I solve the puzzles. They generally come in two parts, with the second part only being revealed after successful completion of the first part. With that in mind, test-driven development makes a lot of sense, because I can verify that I haven’t broken the solution to the first part in modifying to solve the second. I may also take a literate programming approach with org-mode or Jupyter notebooks to document my solutions a bit more, and of course that will make it easier to publish solutions here so I’ll do that as much as I can make time for. On that note, here are some solutions for 2016 that I’ve done recently as a warmup. Day 1: Python Day 1 instructions import numpy as np import pytest as t import sys TURN = { 'L': np.array([[0, 1], [-1, 0]]), 'R': np.array([[0, -1], [1, 0]]) } ORIGIN = np.array([0, 0]) NORTH = np.array([0, 1]) class Santa: def __init__(self, location, heading): self.location = np.array(location) self.heading = np.array(heading) self.visited = [(0,0)] def execute_one(self, instruction): start_loc = self.location.copy() self.heading = self.heading @ TURN[instruction[0]] self.location += self.heading * int(instruction[1:]) self.mark(start_loc, self.location) def execute_many(self, instructions): for i in instructions.split(','): self.execute_one(i.strip()) def distance_from_start(self): return sum(abs(self.location)) def mark(self, start, end): for x in range(min(start[0], end[0]), max(start[0], end[0])+1): for y in range(min(start[1], end[1]), max(start[1], end[1])+1): if any((x, y) != start): self.visited.append((x, y)) def find_first_crossing(self): for i in range(1, len(self.visited)): for j in range(i): if self.visited[i] == self.visited[j]: return self.visited[i] def distance_to_first_crossing(self): crossing = self.find_first_crossing() if crossing is not None: return abs(crossing[0]) + abs(crossing[1]) def __str__(self): return f'Santa @ {self.location}, heading {self.heading}' def test_execute_one(): s = Santa(ORIGIN, NORTH) s.execute_one('L1') assert all(s.location == np.array([-1, 0])) assert all(s.heading == np.array([-1, 0])) s.execute_one('L3') assert all(s.location == np.array([-1, -3])) assert all(s.heading == np.array([0, -1])) s.execute_one('R3') assert all(s.location == np.array([-4, -3])) assert all(s.heading == np.array([-1, 0])) s.execute_one('R100') assert all(s.location == np.array([-4, 97])) assert all(s.heading == np.array([0, 1])) def test_execute_many(): s = Santa(ORIGIN, NORTH) s.execute_many('L1, L3, R3') assert all(s.location == np.array([-4, -3])) assert all(s.heading == np.array([-1, 0])) def test_distance(): assert Santa(ORIGIN, NORTH).distance_from_start() == 0 assert Santa((10, 10), NORTH).distance_from_start() == 20 assert Santa((-17, 10), NORTH).distance_from_start() == 27 def test_turn_left(): east = NORTH @ TURN['L'] south = east @ TURN['L'] west = south @ TURN['L'] assert all(east == np.array([-1, 0])) assert all(south == np.array([0, -1])) assert all(west == np.array([1, 0])) def test_turn_right(): west = NORTH @ TURN['R'] south = west @ TURN['R'] east = south @ TURN['R'] assert all(east == np.array([-1, 0])) assert all(south == np.array([0, -1])) assert all(west == np.array([1, 0])) if __name__ == '__main__': instructions = sys.stdin.read() santa = Santa(ORIGIN, NORTH) santa.execute_many(instructions) print(santa) print('Distance from start:', santa.distance_from_start()) print('Distance to target: ', santa.distance_to_first_crossing()) Day 2: Haskell Day 2 instructions module Main where data Pos = Pos Int Int deriving (Show) -- Magrittr-style pipe operator (|>) :: a -> (a -> b) -> b x |> f = f x swapPos :: Pos -> Pos swapPos (Pos x y) = Pos y x clamp :: Int -> Int -> Int -> Int clamp lower upper x | x < lower = lower | x > upper = upper | otherwise = x clampH :: Pos -> Pos clampH (Pos x y) = Pos x' y' where y' = clamp 0 4 y r = abs (2 - y') x' = clamp r (4-r) x clampV :: Pos -> Pos clampV = swapPos . clampH . swapPos buttonForPos :: Pos -> String buttonForPos (Pos x y) = [buttons !! y !! x] where buttons = [" D ", " ABC ", "56789", " 234 ", " 1 "] decodeChar :: Pos -> Char -> Pos decodeChar (Pos x y) 'R' = clampH $ Pos (x+1) y decodeChar (Pos x y) 'L' = clampH $ Pos (x-1) y decodeChar (Pos x y) 'U' = clampV $ Pos x (y+1) decodeChar (Pos x y) 'D' = clampV $ Pos x (y-1) decodeLine :: Pos -> String -> Pos decodeLine p "" = p decodeLine p (c:cs) = decodeLine (decodeChar p c) cs makeCode :: String -> String makeCode instructions = lines instructions -- split into lines |> scanl decodeLine (Pos 1 1) -- decode to positions |> tail -- drop start position |> concatMap buttonForPos -- convert to buttons main = do input <- getContents putStrLn $ makeCode input Research Data Management Forum 18, Manchester !!! intro "" Monday 20 and Tuesday 21 November 2017 I’m at the Research Data Management Forum in Manchester. I thought I’d use this as an opportunity to try liveblogging, so during the event some notes should appear in the box below (you may have to manually refresh your browser tab periodically to get the latest version). I've not done this before, so if the blog stops updating then it's probably because I've stopped updating it to focus on the conference instead! This was made possible using GitHub's cool [Gist](https://gist.github.com) tool. Draft content policy I thought it was about time I had some sort of content policy on here so this is a first draft. It will eventually wind up as a separate page. Feedback welcome! !!! aside “Content policy” This blog’s primary purpose is as a reflective learning tool for my own development; my aim in writing any given post is mainly to expose and develop my own thinking on a topic. My reasons for making a public blog rather than a private journal are: 1. If I'm lucky, someone smarter than me will provide feedback that will help me and my readers to learn more 2. If I'm extra lucky, someone else might learn from the material as well Each post, therefore, represents the state of my thinking at the time I wrote it, or perhaps a deliberate provocation or exaggeration; either way, if you don't know me personally please don't judge me based entirely on my past words. This is a request though, not an attempt to excuse bad behaviour on my part. I accept full responsibility for any consequences of my words, whether intended or not. I will not remove comments or ban individuals for disagreeing with me, only for behaving offensively or disrespectfully. I will do my best to be fair and balanced and explain decisions that I take, but I reserve the right to take those decisions without making any explanation at all if it seems likely to further inflame a situation. If I end up responding to anything simply with a link to this policy, that's probably all the explanation you're going to get. It should go without saying, but the opinions presented in this blog are my own and not those of my employer or anyone else I might at times represent. Learning to live with anxiety !!! intro "" This is a post that I’ve been writing for months, and writing in my head for years. For some it will explain aspects of my personality that you might have wondered about. For some it will just be another person banging on self-indulgently about so-called “mental health issues”. Hopefully, for some it will demystify some stuff and show that you’re not alone and things do get better. For as long as I can remember I’ve been a worrier. I’ve also suffered from bouts of what I now recognise as depression, on and off since my school days. It’s only relatively recently that I’ve come to the realisation that these two might be connected and that my ‘worrying’ might in fact be outside the normal range of healthy human behaviour and might more accurately be described as chronic anxiety. You probably won’t have noticed it, but it’s been there. More recently I’ve begun feeling like I’m getting on top of it and feeling “normal” for the first time in my life. Things I’ve found that help include: getting out of the house more and socialising with friends; and getting a range of exercise, outdoors and away from the city (rock climbing is mentally and physically engaging and open water swimming is indescribably joyful). But mostly it’s the cognitive behavioural therapy (CBT) and the antidepressants. Before I go any further, a word about drugs (“don’t do drugs, kids”): I’m on the lowest available dose of a common antidepressant. This isn’t because it stops me being sad all the time (I’m not) or because it makes all my problems go away (it really doesn’t). It’s because the scientific evidence points to a combination of CBT and antidepressants as being the single most effective treatment for generalised anxiety disorder. The reason for this is simple: CBT isn’t easy, because it asks you to challenge habits and beliefs you’ve held your whole life. In the short term there is going to be more anxiety and some antidepressants are also effective at blunting the effect of this additional anxiety. In short, CBT is what makes you better, and the drugs just make it a little bit more effective. A lot of people have misconceptions about what it means to be ‘in therapy’. I suspect a lot of these are derived from the psychoanalysis we often see portrayed in (primarily US) film and TV. The problem with that type of navel-gazing therapy is that you can spend years doing it, finally reach some sort of breakthrough insight, and still not have no idea what the supposed insight means for your actual life. CBT is different in that rather than addressing feelings directly it focuses on habits in your thoughts (cognitive) and actions (behavioural) with feeling better as an outcome (therapy). CBT and related forms of therapy now have decades of clinical evidence showing that they really work. It uses a wide range of techniques to identify, challenge and reduce various common unhelpful thoughts and behaviours. By choosing and practicing these, you can break bad mental habits that you’ve been carrying around, often for decades. For me this means giving fair weight to my successes as well as my failings, allowing flexibility into the rigid rules that I have always, subconsciously, lived by, and being a bit kinder to myself when I make mistakes. It’s not been easy and I have to remind myself to practice this every day, but it’s really helped. !!! aside “More info” If you live in the UK, you might not be aware that you can get CBT and other psychological therapies on the NHS through a scheme called IAPT (improving access to psychological therapies). You can self-refer so you don’t need to see a doctor first, but you might want to anyway if you think medication might help. They also have a progression of treatments, so you might be offered a course of “guided self-help” and then progressed to CBT or another talking therapy if need be. This is what happened to me, and it did help a bit but it was CBT that helped me the most. Becoming a librarian What is a librarian? Is it someone who has a masters degree in librarianship and information science? Is it someone who looks after information for other people? Is it simply someone who works in a library? I’ve been grappling with this question a lot lately because I’ve worked in academic libraries for about 3 years now and I never really thought that’s something that might happen. People keep referring to me as “a librarian” but there’s some imposter feelings here because all the librarians around me have much more experience, have skills in areas like cataloguing and collection management and, generally, have a librarian masters degree. So I’ve been thinking about what it actually means to me to be a librarian or not. NB. some of these may be tongue-in-cheek Ways in which I am a librarian: I work in a library I help people to access and organise information I have a cat I like gin Ways in which I am not a librarian: I don’t have a librarianship qualification I don’t work with books 😉 I don’t knit (though I can probably remember how if pressed) I don’t shush people or wear my hair in a bun (I can confirm that this is also true of every librarian I know) Ways in which I am a shambrarian: I like beer I have more IT experience and qualification than librarianship At the end of the day, I still don’t know how I feel about this or, for that matter, how important it is. I’m probably going to accept whatever title people around me choose to bestow, though any label will chafe at times! Lean Libraries: applying agile practices to library services Kanban board Jeff Lasovski (via Wikimedia Commons) I’ve been working with our IT services at work quite closely for the last year as product owner for our new research data portal, ORDA. That’s been a fascinating process for me as I’ve been able to see first-hand some of the agile techniques that I’ve been reading about from time-to-time on the web over the last few years. They’re in the process of adopting a specific set of practices going under the name “Scrum”, which is fun because it uses some novel terminology that sounds pretty weird to non-IT folks, like “scrum master”, “sprint” and “product backlog”. On my small project we’ve had great success with the short cycle times and been able to build trust with our stakeholders by showing concrete progress on a regular basis. Modern librarianship is increasingly fluid, particularly in research services, and I think that to handle that fluidity it’s absolutely vital that we are able to work in a more agile way. I’m excited about the possibilities of some of these ideas. However, Scrum as implemented by our IT services doesn’t seem something that transfers directly to the work that we do: it’s too specialised for software development to adapt directly. What I intend to try is to steal some of the individual practices on an experimental basis and simply see what works and what doesn’t. The Lean concepts currently popular in IT were originally developed in manufacturing: if they can be translated from the production of physical goods to IT, I don’t see why we can’t make the ostensibly smaller step of translating them to a different type of knowledge work. I’ve therefore started reading around this subject to try and get as many ideas as possible. I’m generally pretty rubbish at taking notes from books, so I’m going to try and record and reflect on any insights I make on this blog. The framework for trying some of these out is clearly a Plan-Do-Check-Act continuous improvement cycle, so I’ll aim to reflect on that process too. I’m sure there will have been people implementing Lean in libraries already, so I’m hoping to be able to discover and learn from them instead of starting froms scratch. Wish me luck! Mozilla Global Sprint 2017 Photo by Lena Bell on Unsplash Every year, the Mozilla Foundation runs a two-day Global Sprint, giving people around the world 50 hours to work on projects supporting and promoting open culture and tech. Though much of the work during the sprint is, of course, technical software development work, there are always tasks suited to a wide range of different skill sets and experience levels. The participants include writers, designers, teachers, information professionals and many others. This year, for the first time, the University of Sheffield hosted a site, providing a space for local researchers, developers and others to get out of their offices, work on #mozsprint and link up with others around the world. The Sheffield site was organised by the Research Software Engineering group in collaboration with the University Library. Our site was only small compared to others, but we still had people working on several different projects. My reason for taking part in the sprint was to contribute to the international effort on the Library Carpentry project. A team spread across four continents worked throughout the whole sprint to review and develop our lesson material. As there were no other Library Carpentry volunteers at the Sheffield site, I chose to work on some urgent work around improving the presentation of our workshops and lessons on the web and related workflows. It was a really nice subproject to work on, requiring not only cleaning up and normalising the metadata we hold on workshops and lessons, but also digesting and formalising our current ad hoc process of lesson development. The largest group were solar physicists from the School of Maths and Statistics, working on the SunPy project, an open source environment for solar data analysis. They pushed loads of bug fixes and documentation improvements, and also mentored a new contributor through their first additions to the project. Anna Krystalli from Research Software Engineering worked on the EchoBurst project, which is building a web browser extension to help people break out of their online echo chambers. It does this by using natural language processing techniques to highlight well-written, logically sound articles that disagree with the reader’s stated views on particular topics of interest. Anna was part of an effort to begin extending this technology to online videos. We had a couple of individuals simply taking the opportunity to break out of their normal work environments to work or learn, including a couple of members of library staff show up for a couple of hours to learn how to use git on a new project! IDCC 2017 reflection For most of the last few years I've been lucky enough to attend the International Digital Curation Conference (IDCC). One of the main audiences attending is people who, like me, work on research data management at universities around the world and it's begun to feel like a sort of "home" conference to me. This year, IDCC was held at the Royal College of Surgeons in the beautiful city of Edinburgh. For the last couple of years, my overall impression has been that, as a community, we're moving away from the "first-order" problem of trying to convince people (from PhD students to senior academics) to take RDM seriously and into a rich set of "second-order" problems around how to do things better and widen support to more people. This year has been no exception. Here are a few of my observations and takeaway points. Everyone has a repository now Only last year, the most common question you'd get asked by strangers in the coffee break would be "Do you have a data repository?" Now the question is more likely to be "What are you using for your data repository?", along with more subtle questions about specific components of systems and how they interact. Integrating active storage and archival systems Now that more institutions have data worth preserving, there is more interest in (and in many cases experience of) setting up more seamless integrations between active and archival storage. There are lessons here we can learn. Freezing in amber vs actively maintaining assets There seemed to be an interesting debate going on throughout the conference around the aim of preservation: should we be faithfully preserving the bits and bytes provided without trying to interpret them, or should we take a more active approach by, for example, migrating obsolete formats to newer alternatives. If the former, should we attempt to preserve the software required to access the data as well? If the latter, how much effort do we invest and how do we ensure nothing is lost or altered in the migration? Demonstrating Data Science instead of debating what it is The phrase "Data Science" was once again one of the most commonly uttered of the conference. However, there is now less abstract discussion about what, exactly, is meant by this "data science" thing; this has been replaced more by concrete demonstrations. This change was exemplified perfectly by the keynote by data scientist Alice Daish, who spent a riveting 40 minutes or so enthusing about all the cool stuff she does with data at the British Museum. Recognition of software as an issue Even as recently as last year, I've struggled to drum up much interest in discussing software sustainability and preservation at events like this; the interest was there, but there were higher priorities. So I was completely taken by surprise when we ended up with 30+ people in the Software Preservation Birds of a Feather (BoF) session, and when very little input was needed from me as chair to keep a productive discussion going for a full 90 minutes. Unashamed promotion of openness As a community we seem to have nearly overthrown our collective embarrassment about the phrase "open data" (although maybe this is just me). We've always known it was a good thing, but I know I've been a bit of an apologist in the past, feeling that I had to "soften the blow" when asking researchers to be more open. Now I feel more confident in leading with the benefits of openness, and it felt like that's a change reflected in the community more widely. Becoming more involved in the conference This year, I took a decision to try and do more to contribute to the conference itself, and I felt like this was pretty successful both in making that contribution and building up my own profile a bit. I presented a paper on one of my current passions, Library Carpentry; it felt really good to be able to share my enthusiasm. I presented a poster on our work integrating our data repository and digital preservation platform; this gave me more of a structure for networking during breaks, as I was able to stand by the poster and start discussions with anyone who seemed interested. I chaired a parallel session; a first for me, and a different challenge from presenting or simply attending the talks. And finally, I proposed and chaired the Software Preservation BoF session (blog post forthcoming). Renewed excitement It's weird, and possibly all in my imagination, but there seemed to be more energy at this conference than at the previous couple I've been to. More people seemed to be excited about the work we're all doing, recent achievements and the possibilities for the future. Introducing PyRefine: OpenRefine meets Python I’m knocking the rust off my programming skills by attempting to write a pure-Python interpreter for OpenRefine “scripts”. OpenRefine is a great tool for exploring and cleaning datasets prior to analysing them. It also records an undo history of all actions that you can export as a sort of script in JSON format. One thing that bugs me though is that, having spent some time interactively cleaning up your dataset, you then need to fire up OpenRefine again and do some interactive mouse-clicky stuff to apply that cleaning routine to another dataset. You can at least re-import the JSON undo history to make that as quick as possible, but there’s no getting around the fact that there’s no quick way to do it from a cold start. There is a project, BatchRefine, that extends the OpenRefine server to accept batch requests over a HTTP API, but that isn’t useful when you can’t or don’t want to keep a full Java stack running in the background the whole time. My concept is this: you use OR to explore the data interactively and design a cleaning process, but then export the process to JSON and integrate it into your analysis in Python. That way it can be repeated ad nauseam without having to fire up a full Java stack. I’m taking some inspiration from the great talk “So you want to be a wizard?" by Julia Evans (@b0rk), who recommends trying experiments as a way to learn. She gives these Rules of Programming Experiments: “it doesn’t have to be good it doesn’t have to work you have to learn something” In that spirit, my main priorities are: to see if this can be done; to see how far I can get implementing it; and to learn something. If it also turns out to be a useful thing, well, that’s a bonus. Some of the interesting possible challenges here: Implement all core operations; there are quite a lot of these, some of which will be fun (i.e. non-trivial) to implement Implement (a subset of?) GREL, the General Refine Expression Language; I guess my undergrad course on implementing parsers and compilers will come in handy after all! Generate clean, sane Python code from the JSON rather than merely executing it; more than anything, this would be a nice educational tool for users of OpenRefine who want to see how to do equivalent things in Python Selectively optimise key parts of the process; this will involve profiling the code to identify bottlenecks as well as tweaking the actual code to go faster Potentially handle contributions to the code from other people; I’d be really happy if this happened but I’m realistic… If you’re interested, the project is called PyRefine and it’s on github. Constructive criticism, issues & pull requests all welcome! Implementing Yesterbox in emacs with mu4e I’ve been meaning to give Yesterbox a try for a while. The general idea is that each day you only deal with email that arrived yesterday or earlier. This forms your inbox for the day, hence “yesterbox”. Once you’ve emptied your yesterbox, or at least got through some minimum number (10 is recommended) then you can look at emails from today. Even then you only really want to be dealing with things that are absolutely urgent. Anything else can wait til tomorrow. The motivation for doing this is to get away from the feeling that we are King Canute, trying to hold back the tide. I find that when I’m processing my inbox toward zero there’s always a temptation to keep skipping to the new stuff that’s just come in. Hiding away the new email until I’ve dealt with the old is a very interesting idea. I use mu4e in emacs for reading my email, and handily the mu search syntax is very flexible so you’d think it would be easy to create a yesterbox filter: maildir:"/INBOX" date:..1d Unfortunately, 1d is interpreted as “24 hours ago from right now” so this filter misses everything that was sent yesterday but less than 24 hours ago. There was a feature request raised on the mu github repository to implement an additional date filter syntax but it seems to have died a death for now. In the meantime, the answer to this is to remember that my workplace observes fairly standard office hours, so that anything sent more than 9 hours ago is unlikely to have been sent today. The following does the trick: maildir:"/INBOX" date:..9h In my mu4e bookmarks list, that looks like this: (setq mu4e-bookmarks '(("flag:unread AND NOT flag:trashed" "Unread messages" ?u) ("flag:flagged maildir:/archive" "Starred messages" ?s) ("date:today..now" "Today's messages" ?t) ("date:7d..now" "Last 7 days" ?w) ("maildir:\"/Mailing lists.*\" (flag:unread OR flag:flagged)" "Unread in mailing lists" ?M) ("maildir:\"/INBOX\" date:..1d" "Yesterbox" ?y))) ;; <- this is the new one Rewarding good practice in research From opensource.com on Flickr Whenever I’m involved in a discussion about how to encourage researchers to adopt new practices, eventually someone will come out with some variant of the following phrase: “That’s all very well, but researchers will never do XYZ until it’s made a criterion in hiring and promotion decisions.” With all the discussion of carrots and sticks I can see where this attitude comes from, and strongly empathise with it, but it raises two main problems: It’s unfair and more than a little insulting to anyone to be lumped into one homogeneous group; and Taking all the different possible XYZs into account, that’s an awful lot of hoops to expect anyone to jump through. Firstly, “researchers” are as diverse as the rest of us in terms of what gets them out of bed in the morning. Some of us want prestige; some want to contribute to a greater good; some want to create new things; some just enjoy the work. One thing I’d argue we all have in common is this: nothing is more offputting than feeling like you’re being strongarmed into something you don’t want to do. If we rely on simplistic metrics, people will focus on those and miss the point. At best people will disengage and at worst they will actively game the system. I’ve got to do these ten things to get my next payrise, and still retain my sanity? Ok, what’s the least I can get away with and still tick them off. You see it with students taking poorly-designed assessments and grown-ups are no difference. We do need to wield carrots as well as sticks, but the whole point is that these practices are beneficial in and of themselves. The carrots are already there if we articulate them properly and clear the roadblocks (don’t you enjoy mixed metaphors?). Creating artificial benefits will just dilute the value of the real ones. Secondly, I’ve heard a similar argument made for all of the following practices and more: Research data management Open Access publishing Public engagement New media (e.g. blogging) Software management and sharing Some researchers devote every waking hour to their work, whether it’s in the lab, writing grant applications, attending conferences, authoring papers, teaching, and so on and so on. It’s hard to see how someone with all this in their schedule can find time to exercise any of these new skills, let alone learn them in the first place. And what about the people who sensibly restrict the hours taken by work to spend more time doing things they enjoy? Yes, all of the above practices are valuable, both for the individual and the community, but they’re all new (to most) and hence require more effort up front to learn. We have to accept that it’s inevitably going to take time for all of them to become “business as usual”. I think if the hiring/promotion/tenure process has any role in this, it’s in asking whether the researcher can build a coherent narrative as to why they’ve chosen to focus their efforts in this area or that. You’re not on Twitter but your data is being used by 200 research groups across the world? Great! You didn’t have time to tidy up your source code for github but your work is directly impacting government policy? Brilliant! We still need convince more people to do more of these beneficial things, so how? Call me naïve, but maybe we should stick to making rational arguments, calming fears and providing low-risk opportunities to learn new skills. Acting (compassionately) like a stuck record can help. And maybe we’ll need to scale back our expectations in other areas (journal impact factors, anyone?) to make space for the new stuff. Software Carpentry: SC Test; does your software do what you meant? “The single most important rule of testing is to do it.” — Brian Kernighan and Rob Pike, The Practice of Programming (quote taken from SC Test page One of the trickiest aspects of developing software is making sure that it actually does what it’s supposed to. Sometimes failures are obvious: you get completely unreasonable output or even (shock!) a comprehensible error message. But failures are often more subtle. Would you notice if your result was out by a few percent, or consistently ignored the first row of your input data? The solution to this is testing: take some simple example input with a known output, run the code and compare the actual output with the expected one. Implement a new feature, test and repeat. Sounds easy, doesn’t it? But then you implement a new bit of code. You test it and everything seems to work fine, except that your new feature required changes to existing code and those changes broke something else. So in fact you need to test everything, and do it every time you make a change. Further than that, you probably want to test that all your separate bits of code work together properly (integration testing) as well as testing the individual bits separately (unit testing). In fact, splitting your tests up like that is a good way of holding on to your sanity. This is actually a lot less scary than it sounds, because there are plenty of tools now to automate that testing: you just type a simple test command and everything is verified. There are even tools that enable you to have tests run automatically when you check the code into version control, and even automatically deploy code that passes the tests, a process known as continuous integration or CI. The big problems with testing are that it’s tedious, your code seems to work without it and no-one tells you off for not doing it. At the time when the Software Carpentry competition was being run, the idea of testing wasn’t new, but the tools to help were in their infancy. “Existing tools are obscure, hard to use, expensive, don’t actually provide much help, or all three.” The SC Test category asked entrants “to design a tool, or set of tools, which will help programmers construct and maintain black box and glass box tests of software components at all levels, including functions, modules, and classes, and whole programs.” The SC Test category is interesting in that the competition administrators clearly found it difficult to specify what they wanted to see in an entry. In fact, the whole category was reopened with a refined set of rules and expectations. Ultimately, it’s difficult to tell whether this category made a significant difference. Where the tools to write tests used to be very sparse and difficult to use they are now many and several options exist for most programming languages. With this proliferation, several tried-and-tested methodologies have emerged which are consistent across many different tools, so while things still aren’t perfect they are much better. In recent years there has been a culture shift in the wider software development community towards both testing in general and test-first development, where the tests for a new feature are written first, and then the implementation is coded incrementally until all tests pass. The current challenge is to transfer this culture shift to the academic research community! Tools for collaborative markdown editing Photo by Alan Cleaver I really love Markdown1. I love its simplicity; its readability; its plain-text nature. I love that it can be written and read with nothing more complicated than a text-editor. I love how nicely it plays with version control systems. I love how easy it is to convert to different formats with Pandoc and how it’s become effectively the native text format for a wide range of blogging platforms. One frustration I’ve had recently, then, is that it’s surprisingly difficult to collaborate on a Markdown document. There are various solutions that almost work but at best feel somehow inelegant, especially when compared with rock solid products like Google Docs. Finally, though, we’re starting to see some real possibilities. Here are some of the things I’ve tried, but I’d be keen to hear about other options. 1. Just suck it up To be honest, Google Docs isn’t that bad. In fact it works really well, and has almost no learning curve for anyone who’s ever used Word (i.e. practically anyone who’s used a computer since the 90s). When I’m working with non-technical colleagues there’s nothing I’d rather use. It still feels a bit uncomfortable though, especially the vendor lock-in. You can export a Google Doc to Word, ODT or PDF, but you need to use Google Docs to do that. Plus as soon as I start working in a word processor I get tempted to muck around with formatting. 2. Git(hub) The obvious solution to most techies is to set up a GitHub repo, commit the document and go from there. This works very well for bigger documents written over a longer time, but seems a bit heavyweight for a simple one-page proposal, especially over short timescales. Who wants to muck around with pull requests and merging changes for a document that’s going to take 2 days to write tops? This type of project doesn’t need a bug tracker or a wiki or a public homepage anyway. Even without GitHub in the equation, using git for such a trivial use case seems clunky. 3. Markdown in Etherpad/Google Docs Etherpad is great tool for collaborative editing, but suffers from two key problems: no syntax highlighting or preview for markdown (it’s just treated as simple text); and you need to find a server to host it or do it yourself. However, there’s nothing to stop you editing markdown with it. You can do the same thing in Google Docs, in fact, and I have. Editing a fundamentally plain-text format in a word processor just feels weird though. 4. Overleaf/Authorea Overleaf and Authorea are two products developed to support academic editing. Authorea has built-in markdown support but lacks proper simultaneous editing. Overleaf has great simultaneous editing but only supports markdown by wrapping a bunch of LaTeX boilerplate around it. Both OK but unsatisfactory. 5. StackEdit Now we’re starting to get somewhere. StackEdit has both Markdown syntax highlighting and near-realtime preview, as well as integrating with Google Drive and Dropbox for file synchronisation. 6. HackMD HackMD is one that I only came across recently, but it looks like it does exactly what I’m after: a simple markdown-aware editor with live preview that also permits simultaneous editing. I’m a little circumspect simply because I know simultaneous editing is difficult to get right, but it certainly shows promise. 7. Classeur I discovered Classeur literally today: it’s developed by the same team as StackEdit (which is now apparently no longer in development), and is currently in beta, but it looks to offer two killer features: real-time collaboration, including commenting, and pandoc-powered export to loads of different formats. Anything else? Those are the options I’ve come up with so far, but they can’t be the only ones. Is there anything I’ve missed? Other plain-text formats are available. I’m also a big fan of org-mode. ↩︎ Software Carpentry: SC Track; hunt those bugs! This competition will be an opportunity for the next wave of developers to show their skills to the world — and to companies like ours. — Dick Hardt, ActiveState (quote taken from SC Track page) All code contains bugs, and all projects have features that users would like but which aren’t yet implemented. Open source projects tend to get more of these as their user communities grow and start requesting improvements to the product. As your open source project grows, it becomes harder and harder to keep track of and prioritise all of these potential chunks of work. What do you do? The answer, as ever, is to make a to-do list. Different projects have used different solutions, including mailing lists, forums and wikis, but fairly quickly a whole separate class of software evolved: the bug tracker, which includes such well-known examples as Bugzilla, Redmine and the mighty JIRA. Bug trackers are built entirely around such requests for improvement, and typically track them through workflow stages (planning, in progress, fixed, etc.) with scope for the community to discuss and add various bits of metadata. In this way, it becomes easier both to prioritise problems against each other and to use the hive mind to find solutions. Unfortunately most bug trackers are big, complicated beasts, more suited to large projects with dozens of developers and hundreds or thousands of users. Clearly a project of this size is more difficult to manage and requires a certain feature set, but the result is that the average bug tracker is non-trivial to set up for a small single-developer project. The SC Track category asked entrants to propose a better bug tracking system. In particular, the judges were looking for something easy to set up and configure without compromising on functionality. The winning entry was a bug-tracker called Roundup, proposed by Ka-Ping Yee. Here we have another tool which is still in active use and development today. Given that there is now a huge range of options available in this area, including the mighty github, this is no small achievement. These days, of course, github has become something of a de facto standard for open source project management. Although ostensibly a version control hosting platform, each github repository also comes with a built-in issue tracker, which is also well-integrated with the “pull request” workflow system that allows contributors to submit bug fixes and features themselves. Github’s competitors, such as GitLab and Bitbucket, also include similar features. Not everyone wants to work in this way though, so it’s good to see that there is still a healthy ecosystem of open source bug trackers, and that Software Carpentry is still having an impact. Software Carpentry: SC Config; write once, compile anywhere Nine years ago, when I first release Python to the world, I distributed it with a Makefile for BSD Unix. The most frequent questions and suggestions I received in response to these early distributions were about building it on different Unix platforms. Someone pointed me to autoconf, which allowed me to create a configure script that figured out platform idiosyncracies Unfortunately, autoconf is painful to use – its grouping, quoting and commenting conventions don’t match those of the target language, which makes scripts hard to write and even harder to debug. I hope that this competition comes up with a better solution — it would make porting Python to new platforms a lot easier! — Guido van Rossum, Technical Director, Python Consortium (quote taken from SC Config page) On to the next Software Carpentry competition category, then. One of the challenges of writing open source software is that you have to make it run on a wide range of systems over which you have no control. You don’t know what operating system any given user might be using or what libraries they have installed, or even what versions of those libraries. This means that whatever build system you use, you can’t just send the Makefile (or whatever) to someone else and expect everything to go off without a hitch. For a very long time, it’s been common practice for source packages to include a configure script that, when executed, runs a bunch of tests to see what it has to work with and sets up the Makefile accordingly. Writing these scripts by hand is a nightmare, so tools like autoconf and automake evolved to make things a little easier. They did, and if the tests you want to use are already implemented they work very well indeed. Unfortunately they’re built on an unholy combination of shell scripting and the archaic Gnu M4 macro language. That means if you want to write new tests you need to understand both of these as well as the architecture of the tools themselves — not an easy task for the average self-taught research programmer. SC Conf, then, called for a re-engineering of the autoconf concept, to make it easier for researchers to make their code available in a portable, platform-independent format. The second round configuration tool winner was SapCat, “a tool to help make software portable”. Unfortunately, this one seems not to have gone anywhere, and I could only find the original proposal on the Internet Archive. There were a lot of good ideas in this category about making catalogues and databases of system quirks to avoid having to rerun the same expensive tests again the way a standard ./configure script does. I think one reason none of these ideas survived is that they were overly ambitions, imagining a grand architecture where their tool provide some overarching source of truth. This is in stark contrast to the way most Unix-like systems work, where each tool does one very specific job well and tools are easy to combine in various ways. In the end though, I think Moore’s Law won out here, making it easier to do the brute-force checks each time than to try anything clever to save time — a good example of avoiding unnecessary optimisation. Add to that the evolution of the generic pkg-config tool from earlier package-specific tools like gtk-config, and it’s now much easier to check for particular versions and features of common packages. On top of that, much of the day-to-day coding of a modern researcher happens in interpreted languages like Python and R, which give you a fully-functioning pre-configured environment with a lot less compiling to do. As a side note, Tom Tromey, another of the shortlisted entrants in this category, is still a major contributor to the open source world. He still seems to be involved in the automake project, contributes a lot of code to the emacs community too and blogs sporadically at The Cliffs of Inanity. Semantic linefeeds: one clause per line I’ve started using “semantic linefeeds”, a concept I discovered on Brandon Rhodes' blog, when writing content, an idea described in that article far better than I could. I turns out this is a very old idea, promoted way back in the day by Brian W Kernighan, contributor to the original Unix system, co-creator of the AWK and AMPL programming languages and co-author of a lot of seminal programming textbooks including “The C Programming Language”. The basic idea is that you break lines at natural gaps between clauses and phrases, rather than simply after the last word before you hit 80 characters. Keeping line lengths strictly to 80 characters isn’t really necessary in these days of wide aspect ratios for screens. Breaking lines at points that make semantic sense in the sentence is really helpful for editing, especially in the context of version control, because it isolates changes to the clause in which they occur rather than just the nearest 80-character block. I also like it because it makes my crappy prose feel just a little bit more like poetry. ☺ Software Carpentry: SC Build; or making a better make Software tools often grow incrementally from small beginnings into elaborate artefacts. Each increment makes sense, but the final edifice is a mess. make is an excellent example: a simple tool that has grown into a complex domain-specific programming language. I look forward to seeing the improvements we will get from designing the tool afresh, as a whole… — Simon Peyton-Jones, Microsoft Research (quote taken from SC Build page) Most people who have had to compile an existing software tool will have come across the venerable make tool (which usually these days means GNU Make). It allows the developer to write a declarative set of rules specifying how the final software should be built from its component parts, mostly source code, allowing the build itself to be carried out by simply typing make at the command line and hitting Enter. Given a set of rules, make will work out all the dependencies between components and ensure everything is built in the right order and nothing that is up-to-date is rebuilt. Great in principle but make is notoriously difficult for beginners to learn, as much of the logic for how builds are actually carried out is hidden beneath the surface. This also makes it difficult to debug problems when building large projects. For these reasons, the SC Build category called for a replacement build tool engineered from the ground up to solve these problems. The second round winner, ScCons, is a Python-based make-like build tool written by Steven Knight. While I could find no evidence of any of the other shortlisted entries, this project (now renamed SCons) continues in active use and development to this day. I actually use this one myself from time to time and to be honest I prefer it in many cases to trendy new tools like rake or grunt and the behemoth that is Apache Ant. Its Python-based SConstruct file syntax is remarkably intuitive and scales nicely from very simple builds up to big and complicated project, with good dependency tracking to avoid unnecessary recompiling. It has a lot of built-in rules for performing common build & compile tasks, but it’s trivial to add your own, either by combining existing building blocks or by writing a new builder with the full power of Python. A minimal SConstruct file looks like this: Program('hello.c') Couldn’t be simpler! And you have the full power of Python syntax to keep your build file simple and readable. It’s interesting that all the entries in this category apart from one chose to use a Python-derived syntax for describing build steps. Python was clearly already a language of choice for flexible multi-purpose computing. The exception is the entry that chose to use XML instead, which I think is a horrible idea (oh how I used to love XML!) but has been used to great effect in the Java world by tools like Ant and Maven. What happened to the original Software Carpentry? “Software Carpentry was originally a competition to design new software tools, not a training course. The fact that you didn’t know that tells you how well it worked.” When I read this in a recent post on Greg Wilson’s blog, I took it as a challenge. I actually do remember the competition, although looking at the dates it was long over by the time I found it. I believe it did have impact; in fact, I still occasionally use one of the tools it produced, so Greg’s comment got me thinking: what happened to the other competition entries? Working out what happened will need a bit of digging, as most of the relevant information is now only available on the Internet Archive. It certainly seems that by November 2008 the domain name had been allowed to lapse and had been replaced with a holding page by the registrar. There were four categories in the competition, each representing a category of tool that the organisers thought could be improved: SC Build: a build tool to replace make SC Conf: a configuration management tool to replace autoconf and automake SC Track: a bug tracking tool SC Test: an easy to use testing framework I’m hoping to be able to show that this work had a lot more impact than Greg is admitting here. I’ll keep you posted on what I find! Changing static site generators: Nanoc → Hugo I’ve decided to move the site over to a different static site generator, Hugo. I’ve been using Nanoc for a long time and it’s worked very well, but lately it’s been taking longer and longer to compile the site and throwing weird errors that I can’t get to the bottom of. At the time I started using Nanoc, static site generators were in their infancy. There weren’t the huge number of feature-loaded options that there are now, so I chose one and I built a whole load of blogging-related functionality myself. I did it in ways that made sense at the time but no longer work well with Nanoc’s latest versions. So it’s time to move to something that has blogging baked-in from the beginning and I’m taking the opportunity to overhaul the look and feel too. Again, when I started there weren’t many pre-existing themes so I built the whole thing myself and though I’m happy with the work I did on it it never quite felt polished enough. Now I’ve got the opportunity to adapt one of the many well-designed themes already out there, so I’ve taken one from the Hugo themes gallery and tweaked the colours to my satisfaction. Hugo also has various features that I’ve wanted to implement in Nanoc but never quite got round to it. The nicest one is proper handling of draft posts and future dates, but I keep finding others. There’s a lot of old content that isn’t quite compatible with the way Hugo does things so I’ve taken the old Nanoc-compiled content and frozen it to make sure that old links should still work. I could probably fiddle with it for years without doing much so it’s probably time to go ahead and publish it. I’m still not completely happy with my choice of theme but one of the joys of Hugo is that I can change that whenever I want. Let me know what you think! License Except where otherwise stated, all content on eRambler by Jez Cope is licensed under a Creative Commons Attribution-ShareAlike 4.0 International license. RDM Resources I occasionally get asked for resources to help someone learn more about research data management (RDM) as a discipline (i.e. for those providing RDM support rather than simply wanting to manage their own data). I’ve therefore collected a few resources together on this page. If you’re lucky I might even update it from time to time! First, a caveat: this is very focussed on UK Higher Education, though much of it will still be relevant for people outside that narrow demographic. My general recommendation would be to start with the Digital Curation Centre (DCC) website and follow links out from there. I also have a slowly growing list of RDM links on Diigo, and there’s an RDM section in my list of blogs and feeds too. Mailing lists Jiscmail is a popular list server run for the benefit of further and higher education in the UK; the following lists are particularly relevant: RESEARCH-DATAMAN DATA-PUBLICATION DIGITAL-PRESERVATION LIS-RESEARCHSUPPORT The Research Data Alliance have a number of Interest Groups and Working Groups that discuss issues by email Events International Digital Curation Conference — major annual conference Research Data Management Forum — roughly every six months, places are limited! RDA Plenary — also every 6 months, but only about 1 in every 3 in Europe Books In no particular order: Martin, Victoria. Demystifying eResearch: A Primer for Librarians. Libraries Unlimited, 2014. Borgman, Christine L. Big Data, Little Data, No Data: Scholarship in the Networked World. Cambridge, Massachusetts: The MIT Press, 2015. Corti, Louise, Veerle Van den Eynden, and Libby Bishop. Managing and Sharing Research Data. Thousand Oaks, CA: SAGE Publications Ltd, 2014. Pryor, Graham, ed. Managing Research Data. Facet Publishing, 2012. Pryor, Graham, Sarah Jones, and Angus Whyte, eds. Delivering Research Data Management Services: Fundamentals of Good Practice. Facet Publishing, 2013. Ray, Joyce M., ed. Research Data Management: Practical Strategies for Information Professionals. West Lafayette, Indiana: Purdue University Press, 2014. Reports ‘Ten Recommendations for Libraries to Get Started with Research Data Management’. LIBER, 24 August 2012. http://libereurope.eu/news/ten-recommendations-for-libraries-to-get-started-with-research-data-management/. ‘Science as an Open Enterprise’. Royal Society, 2 June 2012. https://royalsociety.org/policy/projects/science-public-enterprise/Report/. Mary Auckland. ‘Re-Skilling for Research’. RLUK, January 2012. http://www.rluk.ac.uk/wp-content/uploads/2014/02/RLUK-Re-skilling.pdf. Journals International Journal of Digital Curation (IJDC) Journal of eScience Librarianship (JeSLib) Fairphone 2: initial thoughts on the original ethical smartphone I’ve had my eye on the Fairphone 2 for a while now, and when my current phone, an aging Samsung Galaxy S4, started playing up I decided it was time to take the plunge. A few people have asked for my thoughts on the Fairphone so here are a few notes. Why I bought it The thing that sparked my interest, and the main reason for buying the phone really, was the ethical stance of the manufacturer. The small Swedish company have gone to great lengths to ensure that both labour and materials are sourced as responsibly as possible. They regularly inspect the factories where the parts are made and assembled to ensure fair treatment of the workers and they source all the raw materials carefully to minimise the environmental impact and the use of conflict minerals. Another side to this ethical stance is a focus on longevity of the phone itself. This is not a product with an intentionally limited lifespan. Instead, it’s designed to be modular and as repairable as possible, by the owner themselves. Spares are available for all of the parts that commonly fail in phones (including screen and camera), and at the time of writing the Fairphone 2 is the only phone to receive 10/10 for reparability from iFixit. There are plans to allow hardware upgrades, including an expansion port on the back so that NFC or wireless charging could be added with a new case, for example. What I like So far, the killer feature for me is the dual SIM card slots. I have both a personal and a work phone, and the latter was always getting left at home or in the office or running out of charge. Now I have both SIMs in the one phone: I can recieve calls on either number, turn them on and off independently and choose which account to use when sending a text or making a call. The OS is very close to “standard” Android, which is nice, and I really don’t miss all the extra bloatware that came with the Galaxy S4. It also has twice the storage of that phone, which is hardly unique but is still nice to have. Overall, it seems like a solid, reliable phone, though it’s not going to outperform anything else at the same price point. It certainly feels nice and snappy for everything I want to use it for. I’m no mobile gamer, but there is that distant promise of upgradability on the horizon if you are. What I don’t like I only have two bugbears so far. Once or twice it’s locked up and become unresponsive, requiring a “manual reset” (removing and replacing the battery) to get going again. It also lacks NFC, which isn’t really a deal breaker, but I was just starting to make occasional use of it on the S4 (mostly experimenting with my Yubikey NEO) and it would have been nice to try out Android Pay when it finally arrives in the UK. Overall It’s definitely a serious contender if you’re looking for a new smartphone and aren’t bothered about serious mobile gaming. You do pay a premium for the ethical sourcing and modularity, but I feel that’s worth it for me. I’m looking forward to seeing how it works out as a phone. Wiring my web I’m a nut for automating repetitive tasks, so I was dead pleased a few years ago when I discovered that IFTTT let me plug different bits of the web together. I now use it for tasks such as: Syndicating blog posts to social media Creating scheduled/repeating todo items from a Google Calendar Making a note to revisit an article I’ve starred in Feedly I’d probably only be half-joking if I said that I spend more time automating things than I save not having to do said things manually. Thankfully it’s also a great opportunity to learn, and recently I’ve been thinking about reimplementing some of my IFTTT workflows myself to get to grips with how it all works. There are some interesting open source projects designed to offer a lot of this functionality, such as Huginn, but I decided to go for a simpler option for two reasons: I want to spend my time learning about the APIs of the services I use and how to wire them together, rather than learning how to use another big framework; and I only have a small Amazon EC2 server to pay with and a heavy Ruby on Rails app like Huginn (plus web server) needs more memory than I have. Instead I’ve gone old-school with a little collection of individual scripts to do particular jobs. I’m using the built-in scheduling functionality of systemd, which is already part of a modern Linux operating system, to get them to run periodically. It also means I can vary the language I use to write each one depending on the needs of the job at hand and what I want to learn/feel like at the time. Currently it’s all done in Python, but I want to have a go at Lisp sometime, and there are some interesting new languages like Go and Julia that I’d like to get my teeth into as well. You can see my code on github as it develops: https://github.com/jezcope/web-plumbing. Comments and contributions are welcome (if not expected) and let me know if you find any of the code useful. Image credit: xkcd #1319, Automation Data is like water, and language is like clothing I admit it: I’m a grammar nerd. I know the difference between ‘who’ and ‘whom’, and I’m proud. I used to be pretty militant, but these days I’m more relaxed. I still take joy in the mechanics of the language, but I also believe that English is defined by its usage, not by a set of arbitrary rules. I’m just as happy to abuse it as to use it, although I still think it’s important to know what rules you’re breaking and why. My approach now boils down to this: language is like clothing. You (probably) wouldn’t show up to a job interview in your pyjamas1, but neither are you going to wear a tuxedo or ballgown to the pub. Getting commas and semicolons in the right place is like getting your shirt buttons done up right. Getting it wrong doesn’t mean you’re an idiot. Everyone will know what you meant. It will affect how you’re perceived, though, and that will affect how your message is perceived. And there are former rules2 that some still enforce that are nonetheless dropping out of regular usage. There was a time when everyone in an office job wore formal clothing. Then it became acceptable just to have a blouse, or a shirt and tie. Then the tie became optional and now there are many professions where perfectly well-respected and competent people are expected to show up wearing nothing smarter than jeans and a t-shirt. One such rule IMHO is that ‘data’ is a plural and should take pronouns like ‘they’ and ‘these’. The origin of the word ‘data’ is in the Latin plural of ‘datum’, and that idea has clung on for a considerable period. But we don’t speak Latin and the English language continues to evolve: ‘agenda’ also began life as a Latin plural, but we don’t use the word ‘agendum’ any more. It’s common everyday usage to refer to data with singular pronouns like ‘it’ and ‘this’, and it’s very rare to see someone referring to a single datum (as opposed to ‘data point’ or something). If you want to get technical, I tend to think of data as a mass noun, like ‘water’ or ‘information’. It’s uncountable: talking about ‘a water’ or ‘an information’ doesn’t make much sense, but it uses singular pronouns, as in ‘this information’. If you’re interested, the Oxford English Dictionary also takes this position, while Chambers leaves the choice of singular or plural noun up to you. There is absolutely nothing wrong, in my book, with referring to data in the plural as many people still do. But it’s no longer a rule and for me it’s weakened further from guideline to preference. It’s like wearing a bow-tie to work. There’s nothing wrong with it and some people really make it work, but it’s increasingly outdated and even a little eccentric. or maybe you’d totally rock it. ↩︎ Like not starting a sentence with a conjunction… ↩︎ #IDCC16 day 2: new ideas Well, I did a great job of blogging the conference for a couple of days, but then I was hit by the bug that’s been going round and didn’t have a lot of energy for anything other than paying attention and making notes during the day! I’ve now got round to reviewing my notes so here are a few reflections on day 2. Day 2 was the day of many parallel talks! So many great and inspiring ideas to take in! Here are a few of my take-home points. Big science and the long tail The first parallel session had examples of practical data management in the real world. Jian Qin & Brian Dobreski (School of Information Studies, Syracuse University) worked on reproducibility with one of the research groups involved with the recent gravitational wave discovery. “Reproducibility” for this work (as with much of physics) mostly equates to computational reproducibility: tracking the provenance of the code and its input and output is key. They also found that in practice the scientists' focus was on making the big discovery, and ensuring reproducibility was seen as secondary. This goes some way to explaining why current workflows and tools don’t really capture enough metadata. Milena Golshan & Ashley Sands (Center for Knowledge Infrastructures, UCLA) investigated the use of Software-as-a-Service (SaaS, such as Google Drive, Dropbox or more specialised tools) as a way of meeting the needs of long-tail science research such as ocean science. This research is characterised by small teams, diverse data, dynamic local development of tools, local practices and difficulty disseminating data. This results in a need for researchers to be generalists, as opposed to “big science” research areas, where they can afford to specialise much more deeply. Such generalists tend to develop their own isolated workflows, which can differ greatly even within a single lab. Long-tail research also often struggles from a lack of dedicated IT support. They found that use of SaaS could help to meet these challenges, but with a high cost required to cover the needed guarantees of security and stability. Education & training This session focussed on the professional development of library staff. Eleanor Mattern (University of Pittsburgh) described the immersive training introduced to improve librarians' understanding of the data needs of their subject areas in delivering their RDM service delivery model. The participants each conducted a “disciplinary deep dive”, shadowing researchers and then reporting back to the group on their discoveries with a presentation and discussion. Liz Lyon (also University of Pittsburgh, formerly UKOLN/DCC) gave a systematic breakdown of the skills, knowledge and experience required in different data-related roles, obtained from an analysis of job adverts. She identified distinct roles of data analyst, data engineer and data journalist, and as well as each role’s distinctive skills, pinpointed common requirements of all three: Python, R, SQL and Excel. This work follows on from an earlier phase which identified an allied set of roles: data archivist, data librarian and data steward. Data sharing and reuse This session gave an overview of several specific workflow tools designed for researchers. Marisa Strong (University of California Curation Centre/California Digital Libraries) presented Dash, a highly modular tool for manual data curation and deposit by researchers. It’s built on their flexible backend, Stash, and though it’s currently optimised to deposit in their Merritt data repository it could easily be hooked up to other repositories. It captures DataCite metadata and a few other fields, and is integrated with ORCID to uniquely identify people. In a different vein, Eleni Castro (Institute for Quantitative Social Science, Harvard University) discussed some of the ways that Harvard’s Dataverse repository is streamlining deposit by enabling automation. It provides a number of standardised endpoints such as OAI-PMH for metadata harvest and SWORD for deposit, as well as custom APIs for discovery and deposit. Interesting use cases include: An addon for the Open Science Framework to deposit in Dataverse via SWORD An R package to enable automatic deposit of simulation and analysis results Integration with publisher workflows Open Journal Systems A growing set of visualisations for deposited data In the future they’re also looking to integrate with DMPtool to capture data management plans and with Archivematica for digital preservation. Andrew Treloar (Australian National Data Service) gave us some reflections on the ANDS “applications programme”, a series of 25 small funded projects intended to address the fourth of their strategic transformations, single use → reusable. He observed that essentially these projects worked because they were able to throw money at a problem until they found a solution: not very sustainable. Some of them stuck to a traditional “waterfall” approach to project management, resulting in “the right solution 2 years late”. Every researcher’s needs are “special” and communities are still constrained by old ways of working. The conclusions from this programme were that: “Good enough” is fine most of the time Adopt/Adapt/Augment is better than Build Existing toolkits let you focus on the 10% functionality that’s missing Succussful projects involved research champions who can: 1) articulate their community’s requirements; and 2) promote project outcomes Summary All in all, it was a really exciting conference, and I’ve come home with loads of new ideas and plans to develop our services at Sheffield. I noticed a continuation of some of the trends I spotted at last year’s IDCC, especially an increasing focus on “second-order” problems: we’re no longer spending most of our energy just convincing researchers to take data management seriously and are able to spend more time helping them to do it better and get value out of it. There’s also a shift in emphasis (identified by closing speaker Cliff Lynch) from sharing to reuse, and making sure that data is not just available but valuable. #IDCC16 Day 1: Open Data The main conference opened today with an inspiring keynote by Barend Mons, Professor in Biosemantics, Leiden University Medical Center. The talk had plenty of great stuff, but two points stood out for me. First, Prof Mons described a newly discovered link between Huntingdon’s Disease and a previously unconsidered gene. No-one had previously recognised this link, but on mining the literature, an indirect link was identified in more than 10% of the roughly 1 million scientific claims analysed. This is knowledge for which we already had more than enough evidence, but which could never have been discovered without such a wide-ranging computational study. Second, he described a number of behaviours which should be considered “malpractice” in science: Relying on supplementary data in articles for data sharing: the majority of this is trash (paywalled, embedded in bitmap images, missing) Using the Journal Impact Factor to evaluate science and ignoring altmetrics Not writing data stewardship plans for projects (he prefers this term to “data management plan”) Obstructing tenure for data experts by assuming that all highly-skilled scientists must have a long publication record A second plenary talk from Andrew Sallons of the Centre for Open Science introduced a number of interesting-looking bits and bobs, including the Transparency & Openness Promotion (TOP) Guidelines which set out a pathway to help funders, publishers and institutions move towards more open science. The rest of the day was taken up with a panel on open data, a poster session, some demos and a birds-of-a-feather session on sharing sensitive/confidential data. There was a great range of posters, but a few that stood out to me were: Lessons learned about ISO 16363 (“Audit and certification of trustworthy digital repositories”) certification from the British Library Two separate posters (from the Universities of Toronto and Colorado) about disciplinary RDM information & training for liaison librarians A template for sharing psychology data developed by a psychologist-turned-information researcher from Carnegie Mellon University More to follow, but for now it’s time for the conference dinner! #IDCC16 Day 0: business models for research data management I’m at the International Digital Curation Conference 2016 (#IDCC16) in Amsterdam this week. It’s always a good opportunity to pick up some new ideas and catch up with colleagues from around the world, and I always come back full of new possibilities. I’ll try and do some more reflective posts after the conference but I thought I’d do some quick reactions while everything is still fresh. Monday and Thursday are pre- and post-conference workshop days, and today I attended Developing Research Data Management Services. Joy Davidson and Jonathan Rans from the Digital Curation Centre (DCC) introduced us to the Business Model Canvas, a template for designing a business model on a single sheet of paper. The model prompts you to think about all of the key facets of a sustainable, profitable business, and can easily be adapted to the task of building a service model within a larger institution. The DCC used it as part of the Collaboration to Clarify Curation Costs (4C) project, whose output the Curation Costs Exchange is also worth a look. It was a really useful exercise to be able to work through the whole process for an aspect of research data management (my table focused on training & guidance provision), both because of the ideas that came up and also the experience of putting the framework into practice. It seems like a really valuable tool and I look forward to seeing how it might help us with our RDM service development. Tomorrow the conference proper begins, with a range of keynotes, panel sessions and birds-of-a-feather meetings so hopefully more then! About me I help researchers communicate and collaborate more effectively using technology, mainly focusing on research data management policy, practice, training and advocacy. I currently work at The British Library as Data Services Lead. In my free time, I like to: run; play the accordion; morris dance; climb; cook; read (fiction and non-fiction, mostly scifi & fantasy); write. TBH I barely have time for any of them… Better Science Through Better Data #scidata17 Better Science through Better DoughnutsJez Cope Update: fixed the link to the slides so it works now! Last week I had the honour of giving my first ever keynote talk, at an event entitled Better Science Through Better Data hosted jointly by Springer Nature and the Wellcome Trust. It was nerve-wracking but exciting and seemed to go down fairly well. I even got accidentally awarded a PhD in the programme — if only it was that easy! The slides for the talk, “Supporting Open Research: The role of an academic library”, are available online (doi:10.15131/shef.data.5537269), and the whole event was video’d for posterity and viewable online. I got some good questions too, mainly from the clever online question system. I didn’t get to answer all of them, so I’m thinking of doing a blog post or two to address a few more. There were loads of other great presentations as well, both keynotes and 7-minute lightning talks, so I’d encourage you to take a look at at least some of it. I’ll pick out a few of my highlights. Dr Aled Edwards (University of Toronto) There’s a major problem with science funding that I hadn’t really thought about before. The available funding pool for research is divided up into pots by country, and often by funding body within a country. Each of these pots have robust processes to award funding to the most important problems and most capable researchers. The problem comes because there is no coordination between these pots, so researchers all over the world end up getting funded to research the most popular problems leading to a lot of duplication of effort. Industry funding suffers from a similar problem, particularly the pharmaceutical industry. Because there is no sharing of data or negative results, multiple companies spend billions researching the same dead ends chasing after the same drugs. This is where the astronomical costs of drug development come from. Dr Edwards presented one alternative, modelled by a company called M4K Pharma. The idea is to use existing IP laws to try and give academic researchers a reasonable, morally-justifiable and sustainable profit on drugs they develop, in contrast to the current model where basic research is funded by governments while large corporations hoover up as much profit as they possibly can. This new model would develop drugs all the way to human trial within academia, then license the resulting drugs to companies to manufacture with a price cap to keep the medicines affordable to all who need them. Core to this effort is openness with data, materials and methodology, and Dr Edwards presented several examples of how this approach benefited academic researchers, industry and patients compared with a closed, competitive focus. Dr Kirstie Whitaker (Alan Turing Institute) This was a brilliant presentation, presenting a practical how-to guide to doing reproducible research, from one researcher to another. I suggest you take a look at her slides yourself: Showing your working: a how-to guide to reproducible research. Dr Whitaker briefly addressed a number of common barriers to reproducible research: Is not considered for promotion: so it should be! Held to higher standards than others: reviewers should be discouraged from nitpicking just because the data/code/whatever is available (true unbiased peer review of these would be great though) Publication bias towards novel findings: it is morally wrong to not publish reproductions, replications etc. so we need to address the common taboo on doing so Plead the 5th: if you share, people may find flaws, but if you don’t they can’t — if you’re worried about this you should ask yourself why! Support additional users: some (much?) of the burden should reasonably on the reuser, not the sharer Takes time: this is only true if you hack it together after the fact; if you do it from the start, the whole process will be quicker! Requires additional skills: important to provide training, but also to judge PhD students on their ability to do this, not just on their thesis & papers The rest of the presentation, the “how-to” guide of the title' was a well-chosen and passionately delivered set of recommendations, but the thing that really stuck out for me is how good Dr Whitaker is at making the point that you only have to do one of these things to improve the quality of your research. It’s easy to get the impression at the moment that you have to be fully, perfectly open or not at all, but it’s actually OK to get there one step at a time, or even not to go all the way at all! Anyway, I think this is a slide deck that speaks for itself, so I won’t say any more! Lightning talk highlights There was plenty of good stuff in the lightning talks, which were constrained to 7 minutes each, but a few of the things that stood out for me were, in no particular order: Code Ocean — share and run code in the cloud dat project — peer to peer data syncronisation tool Can automate metadata creation, data syncing, versioning Set up a secure data sharing network that keeps the data in sync but off the cloud Berlin Institute of Health — open science course for students Pre-print paper Course materials InterMine — taking the pain out of data cleaning & analysis Nix/NixOS as a component of a reproducible paper BoneJ (ImageJ plugin for bone analysis) — developed by a scientist, used a lot, now has a Wellcome-funded RSE to develop next version ESASky — amazing live, online archive of masses of astronomical data Coda I really enjoyed the event (and the food was excellent too). My thanks go out to: The programme committee for asking me to come and give my take — I hope I did it justice! The organising team who did a brilliant job of keeping everything running smoothly before and during the event The University of Sheffield for letting me get away with doing things like this! Blog platform switch I’ve just switched my blog over to the Nikola static site generator. Hopefully you won’t notice a thing, but there might be a few weird spectres around til I get all the kinks ironed out. I’ve made the switch for a couple of main reasons: Nikola supports Jupyter notebooks as a source format for blog posts, which will be useful to include code snippets It’s written in Python, a language which I actually know, so I’m more likely to be able to fix things that break, customise it and potentially contribute to the open source project (by contrast, Hugo is written in Go, which I’m not really familiar with) Chat rooms vs Twitter: how I communicate now CC0, Pixabay This time last year, Brad Colbow published a comic in his “The Brads” series entitled “The long slow death of Twitter”. It really encapsulates the way I’ve been feeling about Twitter for a while now. Go ahead and take a look. I’ll still be here when you come back. According to my Twitter profile, I joined in February 2009 as user #20,049,102. It was nearing its 3rd birthday and, though there were clearly a lot of people already signed up at that point, it was still relatively quiet, especially in the UK. I was a lonely PhD student just starting to get interested in educational technology, and one thing that Twitter had in great supply was (and still is) people pushing back the boundaries of what tech can do in different contexts. Somewhere along the way Twitter got really noisy, partly because more people (especially commercial companies) are using it more to talk about stuff that doesn’t interest me, and partly because I now follow 1,200+ people and find I get several tweets a second at peak times, which no-one could be expected to handle. More recently I’ve found my attention drawn to more focussed communities instead of that big old shouting match. I find I’m much more comfortable discussing things and asking questions in small focussed communities because I know who might be interested in what. If I come across an article about a cool new Python library, I’ll geek out about it with my research software engineer friends; if I want advice on an aspect of my emacs setup, I’ll ask a bunch of emacs users. I feel like I’m talking to people who want to hear what I’m saying. Next to that experience, Twitter just feels like standing on a street corner shouting. IRC channels (mostly on Freenode), and similar things like Slack and gitter form the bulk of this for me, along with a growing number of WhatsApp group chats. Although online chat is theoretically a synchronous medium, I find that I can treat it more as “semi-synchronous”: I can have real-time conversations as they arise, but I can also close them and tune back in later to catch up if I want. Now I come to think about it, this is how I used to treat Twitter before the 1,200 follows happened. I also find I visit a handful of forums regularly, mostly of the Reddit link-sharing or StackExchange Q&A type. /r/buildapc was invaluable when I was building my latest box, /r/EarthPorn (very much not NSFW) is just beautiful. I suppose the risk of all this is that I end up reinforcing my own echo chamber. I’m not sure how to deal with that, but I certainly can’t deal with it while also suffering from information overload. Not just certifiable… A couple of months ago, I went to Oxford for an intensive, 2-day course run by Software Carpentry and Data Carpentry for prospective new instructors. I’ve now had confirmation that I’ve completed the checkout procedure so it’s official: I’m now a certified Data Carpentry instructor! As far as I’m aware, the certification process is now combined, so I’m also approved to teach Software Carpentry material too. And of course there’s Library Carpentry too… SSI Fellowship 2020 I’m honoured and excited to be named one of this year’s Software Sustainability Institute Fellows. There’s not much to write about yet because it’s only just started, but I’m looking forward to sharing more with you. In the meantime, you can take a look at the 2020 fellowship announcement and get an idea of my plans from my application video: Talks Here is a selection of talks that I’ve given. {{% template %}} <%! import arrow %> Date Title Location % for talk in post.data("talks"): % if 'date' in talk: ${date.format('ddd d MMM YYYY')} % endif % if 'url' in talk: % endif ${talk['title']} % if 'url' in talk: % endif ${talk.get('location', '')} % endfor {{% /template %}}
erinrwhite-com-1379 ---- Libraries – erin white Libraries – erin white library technology, UX, the web, bikes, #RVA Talk: Using light from the dumpster fire to illuminate a more just digital world This February I gave a lightning talk for the Richmond Design Group. My question: what if we use the light from the dumpster fire of 2020 to see an equitable, just digital world? How can we change our thinking to build the future web we need? Presentation is embedded here; text of talk is below. […] Podcast interview: Names, binaries and trans-affirming systems on Legacy Code Rocks! In February I was honored to be invited to join Scott Ford on his podcast Legacy Code Rocks!. I’m embedding the audio below. View the full episode transcript — thanks to trans-owned Deep South Transcription Services! I’ve pulled out some of the topics we discussed and heavily edited/rearranged them for clarity. Names in systems Legal […] Trans-inclusive design at A List Apart I am thrilled and terrified to say that I have an article on Trans-inclusive design out on A List Apart today. I have read A List Apart for years and have always seen it as The Site for folks who make websites, so it is an honor to be published there. Coming out as nonbinary at work This week, after 10 years of working at VCU Libraries, I have been letting my colleagues know that I’m nonbinary. Response from my boss, my team, and my colleagues has been so positive, and has made this process so incredibly easy. I didn’t really have a template for a coming-out message, so ended up writing […] What it means to stay Seven years ago last month I interviewed for my job at VCU. I started work a few months later, assuming I’d stick around for a couple of years then move on to my Next Academic Library Job. Instead I found myself signing closing papers on a house on my sixth work anniversary, having decided to […] Back-to-school mobile snapshot This week I took a look at mobile phone usage on the VCU Libraries website for the first couple weeks of class and compared that to similar time periods from the past couple years. 2015 Here’s some data from the first week of class through today. Note that mobile is 9.2% of web traffic. To round […] Recruiting web workers for your library In the past few years I’ve created a couple of part-time, then full-time, staff positions on the web team at VCU Libraries. We now have a web designer and a web developer who’ve both been with us for a while, but for a few years it was a revolving door of hires. So let’s just say I’ve hired lots […] Easier access for databases and research guides at VCU Libraries Today VCU Libraries launched a couple of new web tools that should make it easier for people to find or discover our library’s databases and research guides. This project’s goal was to help connect “hunters” to known databases and help “gatherers” explore new topic areas in databases and research guides1. Our web redesign task force […] Why this librarian supports the Ada Initiative This week the Ada Initiative is announcing a fundraising drive just for the library community. I’m pitching in, and I hope you will, too. The Ada Initiative’s mission is to increase the status and participation of women in open technology and culture. The organization holds AdaCamps, ally workshops for men, and impostor syndrome trainings; and […] A new look for search at VCU Libraries This week we launched a new design for VCU Libraries Search (our instance of Ex Libris’ Primo discovery system). The guiding design principles behind this project: Mental models: Bring elements of the search interface in line with other modern, non-library search systems that our users are used to. In our case, we looked to e-commerce websites […]
erinrwhite-com-6386 ---- erin white – library technology, UX, the web, bikes, #RVA erin white library technology, UX, the web, bikes, #RVA Skip to content erinrwhite in Libraries, Richmond | April 16, 2021 Talk: Using light from the dumpster fire to illuminate a more just digital world This February I gave a lightning talk for the Richmond Design Group. My question: what if we use the light from the dumpster fire of 2020 to see an equitable, just digital world? How can we change our thinking to build the future web we need? Presentation is embedded here; text of talk is below. Hi everybody, I’m Erin. Before I get started I want to say thank you to the RVA Design Group organizers. This is hard work and some folks have been doing it for YEARS. Thank you to the organizers of this group for doing this work and for inviting me to speak. This talk isn’t about 2020. This talk is about the future. But to understand the future, we gotta look back. The web in 1996 Travel with me to 1996. Twenty-five years ago! I want to transport us back to the mindset of the early web. The fundamental idea of hyperlinks, which we now take for granted, really twisted everyone’s noodles. So much of the promise of the early web was that with broad access to publish in hypertext, the opportunities were limitless. Technologists saw the web as an equalizing space where systems of oppression that exist in the real world wouldn’t matter, and that we’d all be equal and free from prejudice. Nice idea, right? You don’t need to’ve been around since 1996 to know that’s just not the way things have gone down. Pictured before you are some of the early web pioneers. Notice a pattern here? These early visions of the web, including Barlow’s declaration of independence of cyberspace, while inspiring and exciting, were crafted by the same types of folks who wrote the actual declaration of independence: the landed gentry, white men with privilege. Their vision for the web echoed the declaration of independence’s authors’ attempts to describe the world they envisioned. And what followed was the inevitable conflict with reality. We all now hold these truths to be self-evident: The systems humans build reflect humans’ biases and prejudices. We continue to struggle to diversify the technology industry. Knowledge is interest-driven. Inequality exists, online and off. Celebrating, rather than diminishing, folks’ intersecting identities is vital to human flourishing. The web we have known Profit first: monetization, ads, the funnel, dark patterns Can we?: Innovation for innovation’s sake Solutionism: code will save us Visual design: aesthetics over usability Lone genius: “hard” skills and rock star coders Short term thinking: move fast, break stuff Shipping: new features, forsaking infrastructure Let’s move forward quickly through the past 25 years or so of the web, of digital design. All of the web we know today has been shaped in some way by intersecting matrices of domination: colonialism, capitalism, white supremacy, patriarchy. (Thank you, bell hooks.) The digital worlds where we spend our time – and that we build!! – exist in this way. This is not an indictment of anyone’s individual work, so please don’t take it personally. What I’m talking about here is the digital milieu where we live our lives. The funnel drives everything. Folks who work in nonprofits and public entities often tie ourselves in knots to retrofit our use cases in order to use common web tools (google analytics, anyone?) In chasing innovation™ we often overlook important infrastructure work, and devalue work — like web accessibility, truly user-centered design, care work, documentation, customer support and even care for ourselves and our teams — that doesn’t drive the bottom line. We frequently write checks for our future selves to cash, knowing damn well that we’ll keep burying ourselves in technical debt. That’s some tough stuff for us to carry with us every day. The “move fast” mentality has resulted in explosive growth, but at what cost? And in creating urgency where it doesn’t need to exist, focusing on new things rather than repair, the end result is that we’re building a house of cards. And we’re exhausted. To zoom way out, this is another manifestation of late capitalism. Emphasis on LATE. Because…2020 happened. What 2020 taught us Hard times amplify existing inequalities Cutting corners mortgages our future Infrastructure is essential “Colorblind”/color-evasive policy doesn’t cut it Inclusive design is vital We have a duty to each other Technology is only one piece Together, we rise The past year has been awful for pretty much everybody. But what the light from this dumpster fire has illuminated is that things have actually been awful for a lot of people, for a long time. This year has shown us how perilous it is to avoid important infrastructure work and to pursue innovation over access. It’s also shown us that what is sometimes referred to as colorblindness — I use the term color-evasiveness because it is not ableist and it is more accurate — a color-evasive approach that assumes everyone’s needs are the same in fact leaves people out, especially folks who need the most support. We’ve learned that technology is a crucial tool and that it’s just one thing that keeps us connected to each other as humans. Finally, we’ve learned that if we work together we can actually make shit happen, despite a world that tells us individual action is meaningless. Like biscuits in a pan, when we connect, we rise together. Marginalized folks have been saying this shit for years. More of us than ever see these things now. And now we can’t, and shouldn’t, unsee it. The web we can build together Current state: – Profit first – Can we? – Solutionism – Aesthetics – “Hard” skills – Rockstar coders – Short term thinking – Shipping Future state: – People first: security, privacy, inclusion – Should we? – Holistic design – Accessibility – Soft skills – Teams – Long term thinking – Sustaining So let’s talk about the future. I told you this would be a talk about the future. Like many of y’all I have had a very hard time this year thinking about the future at all. It’s hard to make plans. It’s hard to know what the next few weeks, months, years will look like. And who will be there to see it with us. But sometimes, when I can think clearly about something besides just making it through every day, I wonder. What does a people-first digital world look like? Who’s been missing this whole time? Just because we can do something, does it mean we should? Will technology actually solve this problem? Are we even defining the problem correctly? What does it mean to design knowing that even “able-bodied” folks are only temporarily so? And that our products need to be used, by humans, in various contexts and emotional states? (There are also false binaries here: aesthetics vs. accessibility; abled and disabled; binaries are dangerous!) How can we nourish our collaborations with each other, with our teams, with our users? And focus on the wisdom of the folks in the room rather than assigning individuals as heroes? How can we build for maintenance and repair? How do we stop writing checks our future selves to cash – with interest? Some of this here, I am speaking of as a web user and a web creator. I’ve only ever worked in the public sector. When I talk with folks working in the private sector I always do some amount of translating. At the end of the day, we’re solving many of the same problems. But what can private-sector workers learn from folks who come from a public-sector organization? And, as we think about what we build online, how can we also apply that thinking to our real-life communities? What is our role in shaping the public conversation around the use of technologies? I offer a few ideas here, but don’t want them to limit your thinking. Consider the public sector Here’s a thread about public service. ⚖️🏛️ 💪🏼💻🇺🇸 — Dana Chisnell (she / her) (@danachis) February 5, 2021 I don’t have a ton of time left today. I wanted to talk about public service like the very excellent Dana Chisnell here. Like I said, I’ve worked in the public sector, in higher ed, for a long time. It’s my bread and butter. It’s weird, it’s hard, it’s great. There’s a lot of work to be done, and it ain’t happening at civic hackathons or from external contractors. The call needs to come from inside the house. Working in the public sector Government should be – inclusive of all people – responsive to needs of the people – effective in its duties & purpose — Dana Chisnell (she / her) (@danachis) February 5, 2021 I want you to consider for a minute how many folks are working in the public sector right now, and how technical expertise — especially in-house expertise — is something that is desperately needed. Pictured here are the old website and new website for the city of Richmond. I have a whole ‘nother talk about that new Richmond website. I FOIA’d the contracts for this website. There are 112 accessibility errors on the homepage alone. It’s been in development for 3 years and still isn’t in full production. Bottom line, good government work matters, and it’s hard to find. Important work is put out for the lowest bidder and often external agencies don’t get it right. What would it look like to have that expertise in-house? Influencing technology policy We also desperately need lawmakers and citizens who understand technology and ask important questions about ethics and human impact of systems decisions. Pictured here are some headlines as well as a contract from the City of Richmond. Y’all know we spent $1.5 million on a predictive policing system that will disproportionately harm citizens of color? And that earlier this month, City Council voted to allow Richmond and VCU PD’s to start sharing their data in that system? The surveillance state abides. Technology facilitates. I dare say these technologies are designed to bank on the fact that lawmakers don’t know what they’re looking at. My theory is, in addition to holding deep prejudices, lawmakers are also deeply baffled by technology. The hard questions aren’t being asked, or they’re coming too late, and they’re coming from citizens who have to put themselves in harm’s way to do so. Technophobia is another harmful element that’s emerged in the past decades. What would a world look like where technology is not a thing to shrug off as un-understandable, but is instead deftly co-designed to meet our needs, rather than licensed to our city for 1.5 million dollars? What if everyone knew that technology is not neutral? Closing This is some of the future I can see. I hope that it’s sparked new thoughts for you. Let’s envision a future together. What has the light illuminated for you? Thank you! April 16, 2021 This car runs: Love letter to a 1997 Honda Accord Three years ago I sold my 1997 Honda Accord DX. Here’s the Craigslist ad love letter I wrote to it. 1997 Honda Accord DX – 4dr, automatic – This car runs. – $500 (Richmond, VA) 1997 Honda Accord DX 4 door 4 cylinders 206,193 miles Color: “Eucalyptus green pearl” aka the color and year that […] in Life, Richmond | April 1, 2021 Podcast interview: Names, binaries and trans-affirming systems on Legacy Code Rocks! In February I was honored to be invited to join Scott Ford on his podcast Legacy Code Rocks!. I’m embedding the audio below. View the full episode transcript — thanks to trans-owned Deep South Transcription Services! I’ve pulled out some of the topics we discussed and heavily edited/rearranged them for clarity. Names in systems Legal […] in Libraries | March 31, 2021 Post navigation ← Older posts Categories CategoriesSelect Category Bikes Conferences Libraries Life Projects Richmond Archives Archives Select Month April 2021 March 2021 May 2019 March 2019 March 2016 February 2016 September 2015 August 2015 January 2015 December 2014 September 2014 August 2014 May 2014 April 2014 March 2014 March 2013 February 2013 Contact E-mail me Follow @erinrwhite Independent Publisher empowered by WordPress
esm-rochester-edu-638 ---- History of the Howard Hanson Institute for American Music – The Howard Hanson Institute for American Music - Eastman School of Music Inquire Visit Apply Eastman Centennial Celebration University of Rochester Directory About Admissions Faculty Departments & Programs Student Life Concerts Sibley Music Library More Calendar Directory Offices and Services Registrar Rehearsal Schedules Room Reservations Sibley Music Library University of Rochester More >> About Admissions Faculty Departments & Programs Student Life Concerts Sibley Music Library More The Howard Hanson Institute for American Music History of the Howard Hanson Institute for American Music When Howard Hanson retired in 1964 after serving 40 years as the director of the Eastman School of Music, his service to the University of Rochester was extended as the director of a newly created Institute of American Music. The purpose of the Institute, which was established as a University entity outside of the administrative structure of the School, was to continue Dr. Hanson’s tradition for promoting the understanding and appreciation of American music through performance, publication, and recording. The modest funds upon which the Institute has operated derive principally from royalties on compositions and recordings executed during Dr. Hanson’s tenure at the Eastman School. When Howard Hanson died in 1981, his wife Peggy assumed the role of the Institute’s director for a short time. However, as her health declined over the years, the Institute became less active. Following Mrs. Hanson’s death in 1996, the Institute was reorganized and new board members named. About Howard Hanson By Ruth Watanabe Howard Hanson (1896-1981) was a composer, conductor, musical statesman, educator, and for 40 years (1924-1964), director of the Eastman School of Music. Born in Wahoo, Nebraska, on October 28, 1896, to Swedish-American parents who had settled in the Midwest, he was a child prodigy whose music lessons were begun with his mother. He continued his professional training at Lutheran College (Wahoo), the University of Nebraska School of Music (Lincoln), the Institute of Music Art (New York), and the School of Music, Northwestern University (Evanston), earning his Bachelor’s degree in 1916. That year he was appointed to the faculty of the College of the Pacific in San Jose, California, where three years later he became Dean of the School of Fine Arts. A declared neo-Romanticist, Hanson wrote music at once tuneful, vigorous, and accessible. Hanson’s earliest compositions, dating from around 1914, included songs, piano pieces, and two symphonic works, and culminated in his music for the California Forest Play of 1920. In 1923 he won the Prix de Rome with which he took up residence in Italy as the first American composer to be named a Rome Fellow. While there he completed his first symphony (“Nordic”), whose first performance by the Augusteo Orchestra he conducted in Rome, and wrote his great choral piece, The Lament for Beowulf, his String Quartet, and his two symphonic poems, North and West and Lux Aeterna. Early in 1924 Hanson returned to the United States to lead the New York Symphony Orchestra in his North and West and to conduct the Rochester Philharmonic Orchestra in the American premiere of his Nordic Symphony. Upon the invitation of President Rush Rhees and George Eastman, he became the second director of the recently established Eastman School of Music, taking office shortly before his 28th birthday. During the ensuing decades Hanson became one of the country’s most influential music educators. The Eastman School under his leadership developed into an institution in which students could receive a well-rounded education while concentrating upon their professional studies. Perhaps his greatest overall influence upon music was as protagonist of American culture. During the early decades of the century, music in America was dominated by European music and Old World influences. As an American composer striving to be heard, Hanson was fired with zeal to bring native music to the fore. In 1925, in a daring move for those years, he initiated the American Composers Concerts, during which works by our own writers were performed, many for the first time, by professional musicians from the Rochester Philharmonic Orchestra, assisted by the School’s artist faculty and advanced students. In 1930 he began an even more ambitious project: the annual Festivals of American Music, which continued through 1971, by which time more than 200 compositions had been given their first performance, with the composers being present for the rehearsals and the public concerts. While it may appear that the greatest emphasis was upon orchestral music, each Festival also featured a ballet, opera, chamber and choral music. Hanson’s inclusion of American works at symphony concerts he offered as guest conductor with major symphonies throughout the country and his national radio broadcasts over the NBC network during the 1930s and 1940s helped to create a large audience for contemporary works by our own composers. He was justly called the Dean of American Composers and spokesman for music in America. The outward signs of recognition accorded him by the public took the form of citations for his contributions to the quality of American life and culture, 34 honorary doctorates, election into the most prestigious national and international organizations, and buildings named in his honor. In 1996, we at the Eastman School of Music as well the country at large celebrated his glorious career on what would have been his 100th birthday and we continue to invite all music-lovers to share in his music. Save Save Save About HHIAM Commissions Howard Hanson Visiting Composers Board Members History ESM Home ESM Quick Links Eastman Journal Community Engagement Offices & Services Resources for Current Students Resources for Faculty and Staff Resources for Visitors Facebook Twitter Instagram Youtube Read Eastman Notes Back Issues CONTACT US Eastman School of Music 26 Gibbs St. Rochester, NY 14604 585-274-1000 Directions and Parking Questions and Comments © 2021 Eastman School of Music
evergreen-ils-org-4158 ---- Evergreen ILS – Evergreen – Open Source Library Software Skip to content Evergreen – Open Source Library Software Evergreen – Open Source Library Software About Us Overview Annual Reports F.A.Q. Evergreen Event Code of Conduct Project Governance Trademark Policy Documentation Official Documentation Documentation Interest Group Evergreen Roadmap Evergreen Wiki Tabular Release Notes Get Involved! Get Involved! Committees & Interest Groups Communications Mailing Lists IRC Calendar Blog Jobs Proposed Development Projects Merchandise T-shirts and more Conference All Conferences 2021 Evergreen International Online Conference 2020 Evergreen International Online Conference Event Photography Policy Code of Conduct Downloads Evergreen Downloads OpenSRF Downloads Evergreen Downloads Find Download files, install steps, etc. Learn more » Documentation Official Documentation, DokuWiki, and other resources... Learn more » Get Involved! Mailing Lists, IRC, and more. Come join our community! Learn more » Evergreen Maintenance Releases 3.7.1, 3.6.4, 3.5.5 Available The Evergreen Community is pleased to announce the release of Evergreen 3.7.1, 3.6.4 and 3.5.5. These new releases contain numerous bug fixes for the Angular staff catalog, Bootstrap OPAC and Evergreen in general. Also included are usability and accessibility improvements and many updates to documentation. The Evergreen Community wishes to […] Share this: Facebook Twitter More Reddit LinkedIn Pocket Pinterest Tumblr Print Community Spotlight: Chris Burton Chris Burton of Niagara Falls Public Library (NFPL) made a splash last year when he wrote an entire Bootstrap-based version of Evergreen’s OPAC. Most new contributors start small, but the Bootstrap OPAC – nicknamed BOOPAC by the community – was not only Chris’s first contribution to Evergreen, it was the […] Share this: Facebook Twitter More Reddit LinkedIn Pocket Pinterest Tumblr Print 2021 Evergreen International Online Conference We are just a couple weeks away from the 2021 Evergreen International Online Conference! The conference is taking place Tuesday, May 25th through Thursday, May 27th 2021. A separate preconference event will be held Monday, May 24th and a documentation and developer hackfest is planned for Friday, May 28th. We […] Share this: Facebook Twitter More Reddit LinkedIn Pocket Pinterest Tumblr Print Post navigation ← Older posts About Evergreen This is the project site for Evergreen, a highly-scalable software for libraries that helps library patrons find library materials, and helps libraries manage, catalog, and circulate those materials, no matter how large or complex the libraries. © 2008-2020 GPLS and others. Evergreen is open source software, freely licensed under GNU GPLv2 or later. The Evergreen Project is a 501(c)3 nonprofit organization. Community Links Evergreen Bug Tracker Evergreen on Open HUB Evergreen Wiki Git Repositories Join IRC! IRC Logs Official Documentation · © 2021 Evergreen ILS · Powered by · Designed with the Customizr theme ·
evergreen-ils-org-7402 ---- None
everybodyslibraries-com-2526 ---- 2020 vision #1: Opportunity | Everybody's Libraries Everybody's Libraries Libraries for everyone, by everyone, shared with everyone, about everything Skip to content Home About About the Free Decimal Correspondence Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge ← Wikipedia and the deep backfile 2020 vision #2: When We Were Very Young by A. A. Milne → 2020 vision #1: Opportunity Posted on December 2, 2019 by John Mark Ockerbloom In just thirty days from when this post appears, a new crop of works will join the public domain. Exactly what will come out of copyright will vary by country. In Europe and other places with “life+70 years” copyright terms, works by authors who died in 1949 will join the public domain on January 1, 2020. In countries that still have “life+50 years” terms, works by authors who died in 1969 will. And in the United States, copyrights that were secured in 1924 that are still in force will expire. As an American, I’m especially excited about the works in that last set. For most of the 21st century to date, almost nothing entered the public domain in the US, after a 1998 law extended copyright terms by 20 years. Then last year, all copyrights still active from 1923 expired, and we finally had a Public Domain Day here with lots of new published works that many people noted and celebrated. And it looks like we’re going to get another big set of works from 1924 in the public domain next month. Last year, I was so excited about the coming of the first substantial Public Domain Day here in a long time that I wrote advent calendar posts every day in December, discussing 31 works from 1923 that would (and did!) join the public domain in 2019. It was a lot of fun, but also a lot of work. I thought it worth the effort, though, to note such a big change in the copyright environment we’d grown accustomed to. But I wasn’t planning to do all that work again this year. A few thing, though, have made me reconsider, at least in part. One of them was an article I saw today about a new collection of stories by Zora Neale Hurston being published in early 2020, Hitting a Straight Lick with a Crooked Stick. Now recognized as a major 20th century American writer, Hurston published works in a variety of genres and forums from the 1920s through the 1950s. However, she was not well known outside of African American and literary scholarship circles until the 1970s, when Alice Walker wrote an article in Ms. Magazine in appreciation of her work, and her novel Their Eyes Were Watching God was reprinted and became a best-seller. Hurston’s new collection brings back into print a number of her early short stories, which the publisher’s blurb describes as “lost” and “in forgotten periodicals and archives”. My first thought on reading the blurb was to be annoyed about the erasure of the librarians and archivists who collected, cataloged, and preserved those publications and thereby ensured that they were not, in fact, lost or forgotten. But then, on further reflection, I realized that for much of the general public, they might as well have been lost, since many people do not have easy access to the libraries and archives that hold them. One of Hurston’s early stories, “Drenched in Light”, appeared in the December 1924 issue of Opportunity: Journal of Negro Life, which published a variety of articles, stories, poems, studies, and art by African Americans. The journal began in 1923, and HathiTrust opened access to its first volume on Public Domain Day at the start of this year. My listing for the journal also includes some later volumes of the magazine, since as it turns out, the publishers did not renew copyrights for issues prior to the 1940s. (Most of its authors didn’t renew their contributions either, as you can see in the full set of renewals we’ve found for Opportunity.) My listings do not yet, however, include the 1924 volume. HathiTrust has a scan of it, but neither they nor anyone else has yet opened access to it, presumably because no one with a scan feels confident enough about its rights status to do so yet. I expect it to become visible in 30 days, when 1924’s remaining copyrights expire in the US and HathiTrust opens its volumes from 1924. Those without access to Opportunity in print might be able to read “Drenched in Light” before then in Hurston’s previously published Complete Stories collection. But they won’t be able to view the rich context in which it first appeared, from all the other writers and artists who had work published in Opportunity in 1924– even though as I noted in one of last year’s advent calendar entries, many early African-American publications, including many of Hurston’s stories, did not get renewed copyrights. Between now and Public Domain Day 2020, I’ll be posting on works published in 1924, both the famous and the obscure, that I look forward to coming into clearer view in the new year. Some will be joining the public domain on January 1. Some, like the 1924 Opportunity issues, are already in the public domain, but are not as widely accessible as they could be. (Though many of them can be found in my library, and perhaps in yours.) I won’t write a post every day, but I hope to publish a fair number on a variety of works by the new year. You’re welcome to participate, either directly, such as by suggesting works or contributing comments, or indirectly, such as by contributing further information about what’s in the public domain or soon will be. (Our copyright information for Opportunity, for instance, is part of Penn’s serials copyright knowledge base that you can add to.) I hope Public Domain Day will be an annual cause for celebration in the United States and elsewhere. I want new arrivals to the public domain to become routine, but not taken for granted, lest the public domain be frozen again as it was for far too many years. I hope this series of posts, and other work being done by libraries, readers, and fans of the public domain worldwide, help us recognize the treasures of the public domain and bring more of them to light. Share this: Email Print Twitter Facebook Reddit Like this: Like Loading... Related About John Mark Ockerbloom I'm a digital library strategist at the University of Pennsylvania, in Philadelphia. View all posts by John Mark Ockerbloom → This entry was posted in publicdomain, serials. Bookmark the permalink. ← Wikipedia and the deep backfile 2020 vision #2: When We Were Very Young by A. A. Milne → Search for: RSS feed Pages About Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge Recent Posts Public Domain Day 2021: Honoring a lost generation Counting down to 1925 in the public domain From our subjects to yours (and vice versa) Everybody’s Library Questions: Finding films in the public domain Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Recent Comments Jason on Public Domain Day 2021: Honoring a lost generation John Mark Ockerbloom on Public Domain Day 2021: Honoring a lost generation Norma Bruce on Public Domain Day 2021: Honoring a lost generation Brent Reid on Counting down to 1925 in the public domain John Mark Ockerbloom on Counting down to 1925 in the public domain Archives January 2021 December 2020 March 2020 January 2020 December 2019 November 2019 October 2019 September 2019 July 2019 June 2019 January 2019 December 2018 October 2018 June 2018 January 2018 December 2017 September 2017 January 2017 October 2016 September 2016 July 2016 May 2016 January 2016 January 2015 June 2014 January 2014 October 2013 August 2013 April 2013 March 2013 February 2013 January 2013 December 2012 July 2012 May 2012 January 2012 October 2011 September 2011 June 2011 May 2011 April 2011 January 2011 December 2010 November 2010 October 2010 September 2010 August 2010 July 2010 June 2010 May 2010 April 2010 March 2010 February 2010 January 2010 December 2009 October 2009 September 2009 August 2009 July 2009 June 2009 May 2009 April 2009 March 2009 January 2009 December 2008 November 2008 October 2008 September 2008 August 2008 July 2008 June 2008 May 2008 April 2008 March 2008 February 2008 January 2008 December 2007 November 2007 Access for all Open Access News Copyrights and wrongs Copyfight Copyright & Fair Use Freedom to Tinker Lawrence Lessig General library-related news and comment LISNews TeleRead Interesting folks Jessamyn West John Scalzi Jonathan Rochkind K. G. Schneider Karen Coyle Lawrence Lessig Leslie Johnston Library Loon Lorcan Dempsey Paul Courant Peter Brantley Walt Crawford Metadata and friends Planet Cataloging Shiny tech Boing Boing O’Reilly Radar Planet Code4lib Tales from the repository RepositoryMan Writing and publishing if:book Making Light Publishing Frontier Everybody's Libraries Blog at WordPress.com. Send to Email Address Your Name Your Email Address Cancel Post was not sent - check your email addresses! Email check failed, please try again Sorry, your blog cannot share posts by email. %d bloggers like this:
everybodyslibraries-com-2973 ---- Public Domain Day advent calendar #1: The Prophet by Kahlil Gibran | Everybody's Libraries Everybody's Libraries Libraries for everyone, by everyone, shared with everyone, about everything Skip to content Home About About the Free Decimal Correspondence Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge ← Why pay for what’s free? Finding open access and public domain articles Public Domain Day advent calendar #2: ‘Twas the Night Before Christmas Cantata by Frances McCollin → Public Domain Day advent calendar #1: The Prophet by Kahlil Gibran Posted on December 1, 2018 by John Mark Ockerbloom “Your children are not your children […] For they have their own thoughts […] You are the bows from which your children as living arrows are sent forth.” The lines above are from one of the more well-known parts of The Prophet, written by Lebanese-American poet and artist Kahlil Gibran. Though they talk about one’s offspring, one could also see them as applying to one’s creations. They may originate from people (parents or authors) who start with great control and influence over them, but eventually they become independent of their origin. To quote another line in the poem, they “dwell in the house of tomorrow, which you cannot visit”. Since The Prophet was first published in 1923, it has to a large extent been under the control and influence of its author, and then, after his death in 1931, his estate. But over time it has entered the public domain in various countries around the world. It entered the public domain in many countries at the start of 1982, after 50 years had passed from the author’s death. It entered (and in some cases, re-entered) the public domain in many others in 2002, more than 70 years after his death. And finally, 31 days from now, it will enter the public domain in the United States, as part of the first batch of published works to enter the public domain in more than 20 years. During the month of December, this blog will feature various works from 1923 that will be joining the public domain in the US this coming January 1, Public Domain Day. The Prophet is fairly well-known and still easy to find in print. Many other interesting works from 1923 are not so well-known or easy to find, and I hope to feature a wide variety of works over the next 31 days. (I already have some works planned to feature, but have not yet filled out a full roster; if there are any in particular you’d like to suggest, let me know by commenting here or by contacting me.) I plan to keep most of the posts short, but I’ll have links to more information on the works and authors featured, and folks are also welcome to discuss them further here in the comments if they wish. Come the new year, I’ll also go back and add live links to online copies of the works when possible. (For now, I’ll just add a link to all online books I know of by Gibran, some of which are already public domain in the US, and some of which aren’t yet but are public domain elsewhere.) I may also sometimes take the opportunity to point out aspects of copyright relevant to the featured work. For instance, in this post I’ve directly copied material from Gibran’s book (by quoting from it) even though I’ve noted that it’s still under copyright where I am. I can do this thanks to the principle of fair use, which allows such copying under certain circumstances. There’s no universal algorithm for determining whether fair use applies in a particular case, but since I’m only quoting a small portion, in a noncommercial educational context, in order to provide original commentary and not to provide a substitute for the original work, a fair use defense would be very likely to prevail if a copyright dispute came up. Once The Prophet enters the public domain here, though, we’ll be able to use larger portions, or the whole work, for a much wider variety of purposes. I’ll post my next Public Domain Day advent calendar entry tomorrow. I hope you’ll come back then to read it, and welcome your comments. 2019 update: Link to the full text of The Prophet, now in the US public domain, courtesy Gutenberg Australia Share this: Email Print Twitter Facebook Reddit Like this: Like Loading... Related About John Mark Ockerbloom I'm a digital library strategist at the University of Pennsylvania, in Philadelphia. View all posts by John Mark Ockerbloom → This entry was posted in adventcalendar, copyright. Bookmark the permalink. ← Why pay for what’s free? Finding open access and public domain articles Public Domain Day advent calendar #2: ‘Twas the Night Before Christmas Cantata by Frances McCollin → Search for: RSS feed Pages About Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge Recent Posts Public Domain Day 2021: Honoring a lost generation Counting down to 1925 in the public domain From our subjects to yours (and vice versa) Everybody’s Library Questions: Finding films in the public domain Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Recent Comments Jason on Public Domain Day 2021: Honoring a lost generation John Mark Ockerbloom on Public Domain Day 2021: Honoring a lost generation Norma Bruce on Public Domain Day 2021: Honoring a lost generation Brent Reid on Counting down to 1925 in the public domain John Mark Ockerbloom on Counting down to 1925 in the public domain Archives January 2021 December 2020 March 2020 January 2020 December 2019 November 2019 October 2019 September 2019 July 2019 June 2019 January 2019 December 2018 October 2018 June 2018 January 2018 December 2017 September 2017 January 2017 October 2016 September 2016 July 2016 May 2016 January 2016 January 2015 June 2014 January 2014 October 2013 August 2013 April 2013 March 2013 February 2013 January 2013 December 2012 July 2012 May 2012 January 2012 October 2011 September 2011 June 2011 May 2011 April 2011 January 2011 December 2010 November 2010 October 2010 September 2010 August 2010 July 2010 June 2010 May 2010 April 2010 March 2010 February 2010 January 2010 December 2009 October 2009 September 2009 August 2009 July 2009 June 2009 May 2009 April 2009 March 2009 January 2009 December 2008 November 2008 October 2008 September 2008 August 2008 July 2008 June 2008 May 2008 April 2008 March 2008 February 2008 January 2008 December 2007 November 2007 Access for all Open Access News Copyrights and wrongs Copyfight Copyright & Fair Use Freedom to Tinker Lawrence Lessig General library-related news and comment LISNews TeleRead Interesting folks Jessamyn West John Scalzi Jonathan Rochkind K. G. Schneider Karen Coyle Lawrence Lessig Leslie Johnston Library Loon Lorcan Dempsey Paul Courant Peter Brantley Walt Crawford Metadata and friends Planet Cataloging Shiny tech Boing Boing O’Reilly Radar Planet Code4lib Tales from the repository RepositoryMan Writing and publishing if:book Making Light Publishing Frontier Everybody's Libraries Blog at WordPress.com. Send to Email Address Your Name Your Email Address Cancel Post was not sent - check your email addresses! Email check failed, please try again Sorry, your blog cannot share posts by email. %d bloggers like this:
everybodyslibraries-com-3812 ---- Everybody's Libraries Everybody's Libraries Libraries for everyone, by everyone, shared with everyone, about everything Public Domain Day 2021: Honoring a lost generation It’s Public Domain Day again. In much of Europe, and other countries with “life+70 years” copyright terms, works by authors who died in 1950, such as George Orwell, Karin Michaelis, George Bernard Shaw, and Edna St. Vincent Millay, have joined … Continue reading → Counting down to 1925 in the public domain We’re rapidly approaching another Public Domain Day, the day at the start of the year when a year’s worth of creative work joins the public domain. This will be the third year in a row that the US will have … Continue reading → From our subjects to yours (and vice versa) (TL;DR: I’m starting to implement services and publish data to support searching across library collections that use customized subject headings, such as the increasingly-adopted substitutes for LCSH terms like “Illegal aliens”. Read on for what I’m doing, why, and where … Continue reading → Everybody’s Library Questions: Finding films in the public domain Welcome to another installment of Everybody’s Library Questions, where I give answers to questions people ask me (in comments or email) that seem to be useful for general consumption. Before I start, though, I want to put in a plug … Continue reading → Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights The Library of Congress is seeking public input on abilities and priorities desired for the next Register of Copyrights, who heads the Copyright Office, a department within the Library of Congress. The deadline for comments as I write this is … Continue reading → Welcome to everybody’s online libraries As coronavirus infections spread throughout the world, lots of people are staying home to slow down the spread and save lives. In the US, many universities, schools, and libraries have closed their doors. (Here’s what happening at the library where … Continue reading → Public Domain Day 2020: Coming Around Again I’m very happy for 2020 to be arriving. As the start of the 2020s, it represents a new decade in which we can have a fresh start, and hope to make better decisions and have better outcomes than some of … Continue reading → 2020 vision #5: Rhapsody in Blue by George Gershwin It’s only a few hours from the new year where I write this, but before I ring in the new year, and a new year’s worth of public domain material, I’d like to put in a request for what music … Continue reading → 2020 vision #4: Ding Dong Merrily on High by George Ratcliffe Woodward and others It’s beginning to sound a lot like Christmas everywhere I go. The library where I work had its holiday party earlier this week, where I joined librarian colleagues singing Christmas, Hanukkah, and winter-themed songs in a pick-up chorus. Radio stations … Continue reading → 2020 vision #3: The Most Dangerous Game by Richard Connell “Be a realist. The world is made up of two classes–the hunters and the huntees. Luckily, you and I are hunters.” Sanger Rainsford speaks these words at the start of “The Most Dangerous Game”, one of the most famous short … Continue reading →
everybodyslibraries-com-8004 ---- Everybody's Libraries | Libraries for everyone, by everyone, shared with everyone, about everything Everybody's Libraries Libraries for everyone, by everyone, shared with everyone, about everything Skip to content Home About About the Free Decimal Correspondence Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge ← Older posts Public Domain Day 2021: Honoring a lost generation Posted on January 1, 2021 by John Mark Ockerbloom It’s Public Domain Day again. In much of Europe, and other countries with “life+70 years” copyright terms, works by authors who died in 1950, such as George Orwell, Karin Michaelis, George Bernard Shaw, and Edna St. Vincent Millay, have joined the public domain. Canada, and other countries that still have the Berne Convention’s “life+50 years” copyright terms, get works by authors like E. M. Forster, Nelly Sachs, Bertrand Russell, Elsa Triolet, and other authors who died in 1970 in the public domain. And in the United States, copyrights from 1925 that are still in force have expired, introducing to the public domain a wide variety of works I’ve covered in my prior blog post. The new public domain work that I’ve seen most widely noted is F. Scott Fitzgerald’s Jazz Age novel The Great Gatsby. My library has a copy of the first edition, and its scan of the volume became available on HathiTrust today. Though he doesn’t use the term in Gatsby, Fitzgerald and many other authors writing around 1925 are often considered both members and chroniclers of the “Lost Generation”. The term was coined by Gertrude Stein, and made famous by Ernest Hemingway, who used it in the epigraph to his novel The Sun Also Rises (one of many more works scheduled to join the US public domain a year from now). The Lost Generation describes an age cohort that was disrupted by the First World War, and all the deaths caused by that war and by the influenza pandemic that arose in its wake. Society would never be the same afterwards. It’s ironic that some of the definitive creations of that generation are themselves part of a largely lost generation. At the time of their publication, they were supposed to enter the public domain after 56 years at most, but that maximum term has been extended by 39 more years, well over a generation’s worth of time. The creators of these works that got the full copyright term are almost all now dead, and many of the less famous works in this cohort have also become lost from most people’s memories. Some, including many fragile films of that era, now have all copies lost as well. The generation that now sees these works joining the public domain also has many of the makings of a new “lost generation”. The number of deaths from COVID-19 in the United States, which badly botched its response compared to many similar countries, far exceeds the number of American deaths in World War I, and is a sizable and rapidly growing fraction of all the American deaths from the 1918-1920 flu pandemic. Many more people who have dealt with illness and quarantine have also experienced what feels like a lost year, one that hasn’t ended yet despite today’s change in the calendar. But it’s also important to recognize the key role of the public domain and of open access publications in preventing further loss. While Philadelphia, where I live, has been hit hard by this pandemic, it hasn’t been hit as hard as some other places, in part because masking and other behavioral changes have been more widely used and accepted here. Not long before the current pandemic started, the Mutter Museum’s Spit Spreads Death exhibit reminded us of the horrifying death toll of the 1918 flu pandemic here, caused in large part by failing to stop mass gatherings that made the flu spread like wildfire here. The exhibit’s narrative, which many other local media outlets further elaborated on, was able to freely draw on a wide variety of source materials of the era that were all in the public domain due to their age. The freely available sources from 1918 helped spread public health awareness here in 2020. Open access to resources also spurred the rapid development and testing of effective treatments against COVID. Open sharing of the novel coronavirus genomes, and related scientific data, enabled research on the virus and effective responses to be carried out by many different labs across the globe, and many of the resulting research papers and research materials have also been made freely available in venues that are usually limited to paid subscribers. While much of this work is not public domain, strictly speaking, it is being shared and built on largely as if it were. That has enabled vaccines to be safely rolled out much more quickly than they have been for other diseases. While we celebrate today’s belated additions to the public domain, it’s also important to promote and protect it, because there are still efforts to freeze it or roll it back. The successor to the NAFTA trade deal requires Canada to add 20 years to its copyright terms, for instance (though Canada has not yet implemented that provision). And while there is no current legislation to extend US copyright terms any further, such extensions have been proposed in the past, and we’ve just seen in Congress’s recent funding bill how questionable changes to copyright law can be jammed into “must-pass” legislation with little or no warning or recourse. The public domain enriches our culture, reminds us and lets us learn from our past, and helps us make better futures. As 2021 gives us opportunities to turn the page, let’s celebrate the new opportunities we have to enjoy, share, reuse, and build on our newly public domain works. And let’s make sure we don’t lose any more generations. Posted in online books, open access, publicdomain | 3 Comments Counting down to 1925 in the public domain Posted on December 15, 2020 by John Mark Ockerbloom We’re rapidly approaching another Public Domain Day, the day at the start of the year when a year’s worth of creative work joins the public domain. This will be the third year in a row that the US will have a full crop of new public domain works (after a prior 20-year drought), and once again, I’m noting and celebrating works that will be entering the public domain shortly. Approaching 2019, I wrote a one-post-a-day Advent Calendar for 1923 works throughout the month of December, and approaching 2020, I highlighted a few 1924 works, and related copyright issues, in a series of December posts called 2020 Vision. This year I took to Twitter, making one tweet per day featuring a different 1925 work and creator using the #PublicDomainDayCountdown hashtag. Tweets are shorter than blog posts, but I started 99 days out, so by the time I finish the series at the end of December, I’ll have written short notices on more works than ever. Since not everyone reads Twitter, and there’s no guarantee that my tweets will always be accessible on that site, I’ll reproduce them here. (This post has been updated to include all the tweets up to 2021, and in 2021 has been further updated to link to copies of some of the featured works.) The tweet links have been reformatted for the blog, and a few tweets have been recombined or otherwise edited. If you’d like to comment yourself on any of the works mentioned here, or suggest others I can feature, feel free to reply here or on Twitter. (My account there is @JMarkOckerbloom. You’ll also find some other people tweeting on the #PublicDomainDayCountdown hashtag, and you’re welcome to join in as well.) September 24: It’s F. Scott Fitzgerald’s birthday. His best-known book, The Great Gatsby, joins the US public domain 99 days from now, along with other works with active 1925 copyrights. #PublicDomainDayCountdown (Links to free online books by Fitzgerald here.) September 25: C. K. Scott-Moncrieff’s birthday’s today. He translated Proust’s Remembrance of Things Past (a controversial title, as the Public Domain Review notes). The Guermantes Way, his translation of Proust’s 3rd volume, joins the US public domain in 98 days. #PublicDomainDayCountdown September 26: Today is T.S. Eliot’s birthday. His poem “The Hollow Men” (which ends “…not with a bang but a whimper”) was first published in full in 1925, & joins the US public domain in 97 days. #PublicDomainDayCountdown More by & about him here. September 27: Lady Cynthia Asquith, born today in 1887, edited a number of anthologies that have long been read by children and fans of fantasy and supernatural fiction. Her first major collection, The Flying Carpet, joins the US public domain in 96 days. #PublicDomainDayCountdown September 28: As @Marketplace reported tonight, Agatha Christie’s mysteries remain popular after 100 years. In 95 days, her novel The Secret of Chimneys will join the US public domain, as will the expanded US Poirot Investigates collection. #PublicDomainDayCountdown September 29: Homer Hockett’s and Arthur Schlesinger, Sr.’s Political and Social History of the United States first came out in 1925, and was an influential college textbook for years thereafter. The first edition joins the public domain in 94 days. #PublicDomainDayCountdown September 30: Inez Haynes Gillmore Irwin died 50 years ago this month, after a varied, prolific writing career. This 2012 blog post looks at 4 of her books, including Gertrude Haviland’s Divorce, which joins the public domain in 93 days. #PublicDomainDayCountdown October 1: For some, spooky stories and themes aren’t just for October, but for the whole year. We’ll be welcoming a new year’s worth of Weird Tales to the public domain in 3 months. See what’s coming, and what’s already free online, here. #PublicDomainDayCountdown October 2: Misinformation and quackery has been a threat to public health for a long time. In 13 weeks, the 1925 book The Patent Medicine and the Public Health, by American quack-fighter Arthur J. Cramp joins the public domain. #PublicDomainDayCountdown October 3: Sophie Treadwell, born this day in 1885, was a feminist, modernist playwright with several plays produced on Broadway, but many of her works are now hard to find. Her 1925 play “Many Mansions” joins the public domain in 90 days. #PublicDomainDayCountdown October 4: It’s Edward Stratemeyer’s birthday. Books of his syndicate joining the public domain in 89 days include the debuts of Don Sturdy & the Blythe Girls, & further adventures of Tom Swift, Ruth Fielding, Baseball Joe, Betty Gordon, the Bobbsey Twins, & more. #PublicDomainDayCountdown October 5: Russell Wilder was a pioneering diabetes doctor, testing newly invented insulin treatments that saved many patients’ lives. His 1925 book Diabetes: Its Cause and its Treatment with Insulin joins the public domain in 88 days. #PublicDomainDayCountdown October 6: Queer British Catholic author Radclyffe Hall is best known for The Well of Loneliness. Hall’s earlier novel A Saturday Life is lighter, though it has some similar themes in subtext. It joins the US public domain in 87 days. #PublicDomainDayCountdown October 7: Edgar Allan Poe’s stories have long been public domain, but some work unpublished when he died (on this day in 1849) stayed in © much longer. In 86 days, the Valentine Museum’s 1925 book of his previously unpublished letters finally goes public domain. #PublicDomainDayCountdown October 8: In 1925, the Nobel Prize in Literature went to George Bernard Shaw. In 85 days, his Table-Talk, published that year, will join the public domain in the US, and all his solo works published in his lifetime will be public domain nearly everywhere else. #PublicDomainDayCountdown October 9: Author and editor Edward Bok was born this day in 1863. In Twice Thirty (1925), he follows up his Pulitzer-winning memoir The Americanization of Edward Bok with a set of essays from the perspective of his 60s. It joins the public domain in 84 days. #PublicDomainDayCountdown October 10: In the 1925 silent comedy “The Freshman”, Harold Lloyd goes to Tate University, “a large football stadium with a college attached”, and goes from tackling dummy to unlikely football hero. It joins the public domain in 83 days. #PublicDomainDayCountdown October 11: It’s François Mauriac’s birthday. His Le Desert de l’Amour, a novel that won the 1926 Grand Prix of the Académie Française, joins the US public domain in 82 days. Published translations may stay copyrighted, but Americans will be free to make new ones. #PublicDomainDayCountdown October 12: Pulitzer-winning legal scholar Charles Warren’s Congress, the Constitution, and the Supreme Court (1925) analyzes controversies, some still argued, over relations between the US legislature and the US judiciary. It joins the public domain in 81 days. #PublicDomainDayCountdown October 13: Science publishing in 1925 was largely a boys’ club, but some areas were more open to women authors, such as nursing & science education. I look forward to Maude Muse’s Textbook of Psychology for Nurses going public domain in 80 days. #PublicDomainDayCountdown #AdaLovelaceDay October 14: Happy birthday to poet E. E. Cummings, born this day in 1894. (while some of his poetry is lowercase he usually still capitalized his name when writing it out) His collection XLI Poems joins the public domain in 79 days. #PublicDomainDayCountdown October 15: It’s PG Wodehouse’s birthday. In 78 days more of his humorous stories join the US public domain, including Sam in the Suburbs. It originally ran as a serial in the Saturday Evening Post in 1925. All that year’s issues also join the public domain then. #PublicDomainDayCountdown October 16: Playwright and Nobel laureate Eugene O’Neill was born today in 1888. His “Desire Under the Elms” entered the US public domain this year; in 77 days, his plays “Marco’s Millions” and “The Great God Brown” will join it. #PublicDomainDayCountdown October 17: Not everything makes it to the end of the long road to the US public domain. In 76 days, the copyright for the film Man and Maid (based on a book by Elinor Glyn) expires, but no known copies survive. Maybe someone will find one? #PublicDomainDayCountdown October 18: Corra Harris became famous for her novel A Circuit Rider’s Wife and her World War I reporting. The work she considered her best, though, was As a Woman Thinks. It joins the public domain in 75 days. #PublicDomainDayCountdown October 19: Edna St. Vincent Millay died 70 years ago today. All her published work joins the public domain in 74 days in many places outside the US. Here, magazine work like “Sonnet to Gath” (in Sep 1925 Vanity Fair) will join, but renewed post-’25 work stays in ©. #PublicDomainDayCountdown October 20: All songs eventually reach the public domain. Authors can put them there themselves, like Tom Lehrer just did for his lyrics. But other humorous songs arrive by the slow route, like Tilzer, Terker, & Heagney’s “Pardon Me (While I Laugh)” will in 73 days. #PublicDomainDayCountdown October 21: Sherwood Anderson’s Winesburg, Ohio wasn’t a best-seller when it came out, but his Dark Laughter was. Since Joycean works fell out of fashion, that book’s been largely forgotten, but may get new attention when it joins the public domain in 72 days. #PublicDomainDayCountdown October 22: Artist NC Wyeth was born this day in 1882. The Brandywine Museum near Philadelphia shows many of his works. His illustrated edition of Francis Parkman’s book The Oregon Trail joins the public domain in 71 days. #PublicDomainDayCountdown October 23: Today (especially at 6:02, on 10/23) many chemists celebrate #MoleDay. In 70 days, they’ll also get to celebrate historically important chemistry publications joining the US public domain, including all 1925 issues of Justus Liebigs Annalen der Chemie. #PublicDomainDayCountdown October 24: While some early Alfred Hitchcock films were in the US public domain for a while due to formality issues, the GATT accords restored their copyrights. His directorial debut, The Pleasure Garden, rejoins the public domain (this time for good) in 69 days. #PublicDomainDayCountdown (Addendum: There may still be one more year of copyright to this film as of 2021; see the comments to this post for details.) October 25: Albert Barnes took a different approach to art than most of his contemporaries. The first edition of The Art in Painting, where he explains his theories and shows examples from his collection, joins the public domain in 68 days. #PublicDomainDayCountdown October 26: Prolific writer Carolyn Wells had a long-running series of mystery novels featuring Fleming Stone. Here’s a blog post by The Passing Tramp on one of them, The Daughter of the House, which will join the public domain in 67 days. #PublicDomainDayCountdown October 27: Theodore Roosevelt was born today in 1858, and died over 100 years ago, but some of his works are still copyrighted. In 66 days, 2 volumes of his correspondence with Henry Cabot Lodge, written from 1884-1918 and published in 1925, join the public domain. #PublicDomainDayCountdown October 28: American composer and conductor Howard Hanson was born on this day in 1896. His choral piece “Lament for Beowulf” joins the public domain in 65 days. #PublicDomainDayCountdown October 29: “Skitter Cat” was a white Persian cat who had adventures in several children’s books by Eleanor Youmans, illustrated by Ruth Bennett. The first of the books joins the public domain in 64 days. #PublicDomainDayCountdown #NationalCatDay October 30: “Secret Service Smith” was a detective created by Canadian author R. T. M. Maitland. His first magazine appearance was in 1920; his first original full-length novel, The Black Magician, joins the public domain in 9 weeks. #PublicDomainDayCountdown October 31: Poet John Keats was born this day in 1795. Amy Lowell’s 2-volume biography links his Romantic poetry with her Imagist poetry. (1 review.) She finished and published it just before she died. It joins the public domain in 62 days. #PublicDomainDayCountdown November 1: “Not just for an hour, not for just a day, not for just a year, but always.” Irving Berlin gave the rights to this song to his bride in 1926. Both are gone now, and in 2 months it will join the public domain for all of us, always. #PublicDomainDayCountdown November 2: Mikhail Fokine’s The Dying Swan dance, set to music by Camille Saint-Saëns, premiered in 1905, but its choreography wasn’t published until 1925, the same year a film of it was released. It joins the public domain in 60 days. #PublicDomainDayCountdown (Choreography copyright is weird. Not only does the term not start until publication, which can be long after 1st performance, but what’s copyrightable has also changed. Before 1978 it had to qualify as dramatic; now it doesn’t, but it has to be more than a short step sequence.) November 3: Herbert Hoover was the only sitting president to be voted out of office between 1912 & 1976. Before taking office, he wrote the foreword to Carolyn Crane’s Everyman’s House, part of a homeowners’ campaign he co-led. It goes out of copyright in 59 days. #PublicDomainDayCountdown November 4: “The Golden Cocoon” is a 1925 silent melodrama featuring an election, jilted lovers, and extortion. The Ruth Cross novel it’s based on went public domain this year. The film will join it there in 58 days. #PublicDomainDayCountdown November 5: Investigative journalist Ida Tarbell was born today in 1857. Her History of Standard Oil helped break up that trust in 1911, but her Life of Elbert H. Gary wrote more admiringly of his chairmanship of US Steel. It joins the public domain in 57 days. #PublicDomainDayCountdown November 6: Harold Ross was born on this day in 1892. He was the first editor of The New Yorker, which he established in coöperation with his wife, Jane Grant. After ninety-five years, the magazine’s first issues are set to join the public domain in fifty-six days. #PublicDomainDayCountdown November 7: “Sweet Georgia Brown” by Ben Bernie & Maceo Pinkard (lyrics by Kenneth Casey) is a jazz standard, the theme tune of the Harlem Globetrotters, and a song often played in celebration. One thing we can celebrate in 55 days is it joining the public domain. #PublicDomainDayCountdown November 8: Today I hiked on the Appalachian Trail. It was completed in 1937, but parts are much older. Walter Collins O’Kane’s Trails and Summits of the White Mountains, published in 1925 when the AT was more idea than reality, goes public domain in 54 days. #PublicDomainDayCountdown November 9: In Sinclair Lewis’ Arrowsmith, a brilliant medical researcher deals with personal and ethical issues as he tries to find a cure for a deadly epidemic. The novel has stayed relevant well past its 1925 publication, and joins the public domain in 53 days. #PublicDomainDayCountdown November 10: John Marquand was born today in 1893. He’s known for his spy stories and satires, but an early novel, The Black Cargo, features a sailor curious about a mysterious payload on a ship he’s been hired onto. It joins the US public domain in 52 days. #PublicDomainDayCountdown November 11: The first world war, whose armistice was 102 years ago today, cast a long shadow. Among the many literary works looking back to it is Ford Madox Ford’s novel No More Parades, part of his “Parade’s End” tetralogy. It joins the public domain in 51 days. #PublicDomainDayCountdown November 12: Anne Parrish was born on this day in 1888. In 1925, The Dream Coach, co-written with her brother, got a Newbery honor , and her novel The Perennial Bachelor was a best-seller. The latter book joins the public domain in 50 days. #PublicDomainDayCountdown November 13: In “The Curse of the Golden Cross”, G. K. Chesterton’s Father Brown once again finds a natural explanation to what seem to be preternatural symbols & events. As of today, Friday the 13th, the 1925 story is exactly 7 weeks away from the US public domain. #PublicDomainDayCountdown November 14: The pop standard “Yes Sir, That’s My Baby” was the baby of Walter Donaldson (music) and Gus Kahn (lyrics). It’s been performed by many artists since its composition, and in 48 days, this baby steps out into the public domain. #PublicDomainDayCountdown November 15: Marianne Moore, born on this day in 1887, had a long literary career, including editing the influential modernist magazine The Dial from 1925 on. In 47 days, all 1925 issues of that magazine will be fully in the public domain. #PublicDomainDayCountdown November 16: George S. Kaufman, born today in 1889, wrote or directed a play in every Broadway season from 1921 till 1958. In 46 days, several of his plays join the public domain, including his still-performed comedy “The Butter and Egg Man”. #PublicDomainDayCountdown November 17: Shen of the Sea was a Newbery-winning collection of stories presented as “Chinese” folktales, but written by American author Arthur Bowie Chrisman. Praised when first published, seen more as appropriation later, it’ll be appropriable itself in 45 days. #PublicDomainDayCountdown November 18: Jacques Maritain was a French Catholic philosopher who influenced the Universal Declaration of Human Rights. His book on 3 reformers (Luther, Descartes, and Rousseau) joins the public domain in 44 days. #PublicDomainDayCountdown November 19: Prevailing views of history change a lot over 95 years. The 1926 Pulitzer history prize went to a book titled “The War for Southern Independence”. The last volume of Edward Channing’s History of the United States, it joins the public domain in 43 days. #PublicDomainDayCountdown November 20: Alfred North Whitehead’s Science and the Modern World includes a nuanced discussion of science and religion differing notably from many of his contemporaries’. (A recent review of it.) It joins the US public domain in 6 weeks. November 21: Algonquin Round Table member Robert Benchley tried reporting, practical writing, & reviews, but soon found that humorous essays & stories were his forte. One early collection, Pluck and Luck, joins the public domain in 41 days. #PublicDomainDayCountdown November 22: I’ve often heard people coming across a piano sit down & pick out Hoagy Carmichael’s “Heart and Soul”. He also had other hits, one being “Washboard Blues“. His original piano instrumental version becomes public domain in 40 days. #PublicDomainDayCountdown November 23: Harpo Marx, the Marx Brothers mime, was born today in 1888. In his oldest surviving film, “Too Many Kisses” he does “speak”, but silently (like everyone else in it), without his brothers. It joins the public domain in 39 days. #PublicDomainDayCountdown November 24: In The Man Nobody Knows, Bruce Barton likened the world of Jesus to the world of business. Did he bring scriptural insight to management, or subordinate Christianity to capitalism? It’ll be easier to say, & show, after it goes public domain in 38 days. #PublicDomainDayCountdown November 25: Before Virgil Thomson (born today in 1896) was well-known as a composer, he wrote a music column for Vanity Fair. His first columns, and the rest of Vanity Fair for 1925, join the public domain in 37 days. #PublicDomainDayCountdown November 26: “Each moment that we’re apart / You’re never out of my heart / I’d rather be lonely and wait for you only / Oh how I miss you tonight” Those staying safe by staying apart this holiday might appreciate this song, which joins the public domain in 36 days. #PublicDomainDayCountdown (The song, “Oh, How I Miss You Tonight” is by Benny Davis, Joe Burke, and Mark Fisher, was published in 1925, and performed and recorded by many musicians since then, some of whom are mentioned in this Wikipedia article.) November 27: Feminist author Katharine Anthony, born today in 1877, was best known for her biographies. Her 1925 biography of Catherine the Great, which drew extensively on the empress’s private memoirs, joins the public domain in 35 days. #PublicDomainDayCountdown November 28: Tonight in 1925 “Barn Dance” (soon renamed “Grand Ole Opry”) debuted in Nashville. Most country music on it & similar shows then were old favorites, but there were new hits too, like “The Death of Floyd Collins”, which joins the public domain in 34 days. #PublicDomainDayCountdown (The song, with words by Andrew Jenkins and music by John Carson, was in the line of other disaster ballads that were popular in the 1920s. This particular disaster had occurred earlier in the year, and became the subject of song, story, drama, and film.) November 29: As many folks get ready for Christmas, many Christmas-themed works are also almost ready to join the public domain in 33 days. One is The Holly Hedge, and Other Christmas Stories by Temple Bailey. More on the book & author. #PublicDomainDayCountdown November 30: In 1925 John Maynard Keynes published The Economic Consequences of Sterling Parity objecting to Winston Churchill returning the UK to the gold standard. That policy ended in 1931; the book’s US copyright lasted longer, but will finally end in 32 days. #PublicDomainDayCountdown December 1: Du Bose Heyward’s novel Porgy has a distinguished legacy of adaptations, including a 1927 Broadway play, and Gershwin’s opera “Porgy and Bess”. When the book joins the public domain a month from now, further adaptation possibilities are limitless. #PublicDomainDayCountdown December 2: In Dorothy Black’s Romance — The Loveliest Thing a young Englishwoman “inherits a small sum of money, buys a motor car and goes off in search of adventure and romance”. First serialized in Ladies’ Home Journal, it joins the public domain in 30 days. #PublicDomainDayCountdown December 3: Joseph Conrad was born on this day in 1857, and died in 1924, leaving unfinished his Napoleonic novel Suspense. But it was still far enough along to get serialized in magazines and published as a book in 1925, and it joins the public domain in 29 days. #PublicDomainDayCountdown December 4: Ernest Hemingway’s first US-published story collection In Our Time introduced his distinctive style to an American audience that came to view his books as classics of 20th century fiction: It joins the public domain in 28 days. #PublicDomainDayCountdown December 5: Libertarian author Rose Wilder Lane helped bring her mother’s “Little House” fictionalized memoirs into print. Before that, she published biographical fiction based on the life of Jack London, called He Was a Man. It joins the public domain in 27 days. #PublicDomainDayCountdown December 6: Indiana naturalist and author Gene Stratton-Porter died on this day in 1924. Her final novel, The Keeper of the Bees, was published the following year, and joins the public domain in 26 days. One review. #PublicDomainDayCountdown December 7: Willa Cather was born today in 1873. Her novel The Professor’s House depicts 1920s cultural dislocation from a different angle than F. Scott Fitzgerald’s better-known Great Gatsby. It too joins the public domain in 25 days. #PublicDomainDayCountdown December 8: The last symphony published by Finnish composer Jean Sibelius (born on this day in 1865) is described in the Grove Dictionary as his “most remarkable compositional achievement”. It joins the public domain in the US in 24 days. #PublicDomainDayCountdown December 9: When the Habsburg Empire falls, what comes next for the people & powers of Vienna? The novel Old Wine, by Phyllis Bottome (wife of the local British intelligence head) depicts a society undergoing rapid change. It joins the US public domain in 23 days. #PublicDomainDayCountdown December 10: Lewis Browne was “a world traveler, author, rabbi, former rabbi, lecturer, socialist and friend of the literary elite”. His first book, Stranger than Fiction: A Short History of the Jews, joins the public domain in 22 days. #PublicDomainDayCountdown December 11: In 1925, John Scopes was convicted for teaching evolution in Tennessee. Books explaining the science to lay audiences were popular that year, including Henshaw Ward’s Evolution for John Doe. It becomes public domain in 3 weeks. #PublicDomainDayCountdown December 12: Philadelphia artist Jean Leon Gerome Ferris was best known for his “Pageant of a Nation” paintings. Three of them, “The Birth of Pennsylvania”, “Gettysburg, 1863”, and “The Mayflower Compact”, join the public domain in 20 days. #PublicDomainDayCountdown December 13: The Queen of Cooks, and Some Kings was a memoir of London hotelier Rosa Lewis, as told to Mary Lawton. Her life story was the basis for the BBC and PBS series “The Duchess of Duke Street”. It joins the public domain in 19 days. #PublicDomainDayCountdown December 14: Today we’re celebrating new films being added to the National Film Registry. In 18 days, we can also celebrate more Registry films joining the public domain. One is The Clash of the Wolves, starring Rin Tin Tin. #PublicDomainDayCountdown December 15: Etsu Inagaki Sugimoto, daughter of a high-ranking Japanese official, moved to the US in an arranged marriage after her family fell on hard times. Her 1925 memoir, A Daughter of the Samurai, joins the public domain in 17 days. #PublicDomainDayCountdown December 16: On the Trail of Negro Folk-Songs compiled by Dorothy Scarborough assisted by Ola Lee Gulledge, has over 100 songs. Scarborough’s next of kin (not Gulledge, or any of their sources) renewed its copyright in 1953. But in 16 days, it’ll be free for all. #PublicDomainDayCountdown December 17: Virginia Woolf’s writings have been slowly entering the public domain in the US. We’ve had the first part of her Mrs. Dalloway for a while. The complete novel, and her first Common Reader essay collection, join it in 15 days. #PublicDomainDayCountdown December 18: Lovers in Quarantine with Harrison Ford sounds like a movie made for 2020, but it’s actually a 1925 silent comedy (with a different Harrison Ford). It’ll be ready to go out into the public domain after a 14-day quarantine. #PublicDomainDayCountdown December 19: Ma Rainey wrote, sang, and recorded many blues songs in a multi-decade career. Two of her songs becoming public domain in 13 days are “Shave ’em Dry” (written with William Jackson) & “Army Camp Harmony Blues” (with Hooks Tilford). #PublicDomainDayCountdown December 20: For years we’ve celebrated the works of prize-winning novelist Edith Wharton as her stories join the public domain. In 12 days, The Writing of Fiction, her book on how she writes her memorable tales, will join that company. #PublicDomainDayCountdown December 21: Albert Payson Terhune, born today in 1872, raised and wrote about dogs he kept at what’s now a public park in New Jersey. His book about Wolf, who died heroically and is buried there, will also be in the public domain in 11 days. #PublicDomainDayCountdown December 22: In the 1920s it seemed Buster Keaton could do anything involving movies. Go West, a 1925 feature film that he co-wrote, directed, co-produced, and starred in, is still enjoyed today, and it joins the public domain in 10 days. #PublicDomainDayCountdown December 23: In 9 days, not only will Theodore Dreiser’s massive novel An American Tragedy be in the public domain, but so will a lot of the raw material that went into it. Much of it is in @upennlib‘s special collections. #PublicDomainDayCountdown December 24: Johnny Gruelle, born today in 1880, created the Raggedy Ann doll, and a series of books sold with it that went under many Christmas trees. Two of them, Raggedy Ann’s Alphabet Book and Raggedy Ann’s Wishing Pebble, join the public domain in 8 days. #PublicDomainDayCountdown December 25: Written in Hebrew by Joseph Klausner, translated into English by Anglican priest Herbert Danby, Jesus of Nazareth reviewed Jesus’s life and teachings from a Jewish perspective. It made a stir when published in 1925, & joins the public domain in 7 days. #PublicDomainDayCountdown December 26: “It’s a travesty that this wonderful, hilarious, insightful book lives under the inconceivably large shadow cast by The Great Gatsby.” A review of Anita Loos’s Gentlemen Prefer Blondes, also joining the public domain in 6 days. #PublicDomainDayCountdown December 27: “On revisiting Manhattan Transfer, I came away with an appreciation not just for the breadth of its ambition, but also for the genius of its representation.” A review of the John Dos Passos novel becoming public domain in 5 days. #PublicDomainDayCountdown December 28: All too often legal systems and bureaucracies can be described as “Kafkaesque”. The Kafka work most known for that sense of arbitrariness and doom is Der Prozess (The Trial), reviewed here. It joins the public domain in 4 days. #PublicDomainDayCountdown December 29: Chocolate Kiddies, an African American music and dance revue that toured Europe in 1925, featured songs by Duke Ellington and Jo Trent including “Jig Walk”, “Jim Dandy”, and “With You”. They join the public domain in 3 days. #PublicDomainDayCountdown December 30: Lon Chaney starred in 2 of the top-grossing movies of 1925. The Phantom of the Opera has long been in the public domain due to copyright nonrenewal. The Unholy Three, which was renewed, joins it in the public domain in 2 days. #PublicDomainDayCountdown (If you’re wondering why some of the other big film hits of 1925 haven’t been in this countdown, in many cases it’s also because their copyrights weren’t renewed. Or they weren’t actually copyrighted in 1925.) December 31: “…You might as well live.” Dorothy Parker published “Resumé” in 1925, and ultimately outlived most of her Algonquin Round Table-mates. This poem, and her other 1925 writing for periodicals, will be in the public domain tomorrow. #PublicDomainDayCountdown Posted in copyright, publicdomain | 3 Comments From our subjects to yours (and vice versa) Posted on December 3, 2020 by John Mark Ockerbloom (TL;DR: I’m starting to implement services and publish data to support searching across library collections that use customized subject headings, such as the increasingly-adopted substitutes for LCSH terms like “Illegal aliens”. Read on for what I’m doing, why, and where I would value advice and discussion on how to proceed.) I’ve run the Forward to Libraries service for a few years now. As I’ve noted in earlier posts here, it’s currently used on The Online Books Page and in some Wikipedia articles to search for resources in your local library (or any other library you’re interested in) on a subject you’re exploring. One of the key pieces of infrastructure that makes it work is the Library of Congress Subject Headings (LCSH) system, which many research libraries use to describe their holdings. Using the headings in the system, along with mappings between it and other systems for describing subjects (such as the English Wikipedia article titles that Forward to Libraries knows how to relate to LCSH) allows researchers to find materials on the same subjects across multiple collections, using common terminology. There are limitations to relying on LCSH for cross-collection subject searches, though. First of all, many libraries, particularly those outside the US, do not use LCSH. Some use other subject vocabularies. If a mapping has been defined between LCSH and another subject vocabulary (as has been done, for example, with MeSH) one can use that mapping to determine search terms to use in libraries that use that subject vocabulary. We don’t yet have that capability in Forward to Libraries, but I’m hoping to add it eventually. Changing the subjects I’m now also seeing more libraries that use LCSH, but that also use different terms for certain subjects that they find more appropriate for their users. While there is a process for updating LCSH terms (and its terms get updated on a monthly basis) the process can be slow, hard for non-specialists to participate in, and contentious, particularly for larger-scale subject heading changes. It can also be subject to pressure by non-librarians. The Library of Congress ultimately answers to Congress (as its name suggests), and members of Congress have used funding bills to block changes in subject headings that the librarian-run process had approved. They did that in 2016 for the subject heading “Illegal aliens”, where librarians had recommended using other terms to cover subjects related to unauthorized immigration. The documentary film “Change the Subject” (linked with context in this article) has a detailed report on this controversy. Four years after the immigration subject changes were blocked, some libraries have decided not to wait for LCSH to change, and are introducing their own subject terms. The University of Colorado Boulder, for example, announced in 2018 that they would use the term “Undocumented immigrants” where the Library of Congress had “Illegal aliens”. Other libraries have recently announced similar changes. Some library consortia have organized systematic programs to supersede outdated and offensive terms in LCSH in their catalogs. Some groups now maintain specialized subject vocabularies that can both supplement and supersede LCSH terms, such as Homosaurus for LGBT+-related subjects. And there’s also been increasing interest in using subject terms and classifications adapted to local communities. For instance, the Brian Deer Classification System is intended to be both used and shaped by local indigenous communities, and therefore libraries in different locations that use it may well use different terms for some subjects, depending on local usage and interests. Supporting cross-collection search in a community of localized catalogs We can still search across collections that use local terms, as long as we know what those terms are and how to translate between them. Forward to Libraries already uses a data file indicating Wikipedia article titles that correspond closely to LCSH subjects, and vice versa. By extension, we can also create a data file indicating terms to use at a given library that correspond to terms in LCSH and other vocabularies, so we can see what resources are available at different places on a given topics. You can see how that works in practice at The Online Books Page. As I write this, we’re still using the unaltered LCSH subjects (updated to October 2020), so we have a subject page showing free online books on “Illegal aliens”. You can follow links from there to see what other libraries have. If you select the “elsewhere” link in the upper left column and choose the Library of Congress as the library to search, you’ll see what they hold under that subject heading. But if you instead choose the University of Colorado Boulder, you’ll see what they have under “Undocumented immigrants”, the subject term they’ve adopted there. Similar routing happens from Wikipedia. The closest related Wikipedia article at present is “Illegal immigration”, and if you go down to the Further Reading section and select links in the Library Resources box, selecting “Online books” or most libraries will currently take you to their “Illegal aliens” subject search. But selecting University of Colorado Boulder (from “Resources in other libraries” if you don’t already have it specified as your preferred library in Wikipedia) will take you to their “Undocumented immigrants” search. This routing applies two mappings, one from Wikipedia terms to LCSH terms, and another from LCSH terms to local library terms. A common data resource These sorts of transformations are fundamentally data-driven. My Forward to Libraries Github repository now includes a data file listing local subject terms that different libraries use, and how they relate to LCSH subject terms. (The library codes used in the file are the same ones that are used in my libraries data file, and are based on OCLC and/or ISIL identifiers.) The local subject terms file is very short for now– as I write this, it only has enough data for the examples I’ve described above, but I’ll be adding more data shortly for other libraries that have announced and implemented subject headings changes. (And I’ll be glad to hear about more so I can add them.) As with other data in this repository, the data in this file is CC0, so it can be used by anyone for any purpose. In particular, it could be be used by services other than my Forward to Libraries tool, such as by aggregated catalogs that incorporate data from multiple libraries, some of which might use localized subject terms that have LCSH analogues. Where to go next What I’ve shown so far is not far removed from a proof-of-concept demo, but I hope it suggests ways that services can be developed to support searches among and across library collections with diverse subject headings. As I mentioned, I’ll be adding more data on localized subject headings as I hear about it, as well as adding more functionality to the Forward to Libraries service (such as the ability to link from a collection with localized subject headings, so I can support them in The Online Books Page, or in other libraries that have such headings and want to use to the service). There are some extensions that could be done to the basic data model to support scaling up these sorts of localizations, such as customizations used by all the libraries in a given consortium, or ones that adopt wholesale an alternative set of subjects, whether that be MeSH, Homosaurus, or the subject thesaurus of a national library outside the US. Even with data declarations supporting those sorts of “bulk” subject mappings, a universal subject mapping knowledge base could get large over time. I’ve created my own mapping file for my services, and for now I’m happy to grow it as needed and share the data freely. But if there is another suitable mapping hub already available or in the works, I’m happy to consider using that instead. It’s important to support exploration across a community of diverse libraries with a diverse array of subject terms and descriptions. I hope the tools and data I’ve described here will help advance us towards that goal, and that I can help grow them from their current nascent state to make them more broadly useful. Posted in discovery, metadata, subjects, wikipedia | Leave a comment Everybody’s Library Questions: Finding films in the public domain Posted on March 30, 2020 by John Mark Ockerbloom Welcome to another installment of Everybody’s Library Questions, where I give answers to questions people ask me (in comments or email) that seem to be useful for general consumption. Before I start, though, I want to put in a plug for your local librarians. Even though many library buildings are closed now (as they should be) while we’re trying to get propagation and treatment for COVID-19 under control, many of those libraries offer online services, including interactive online help from librarians. (Many of our libraries are also expanding the scope and hours of these services during this health crisis.) Your local librarians will have the best knowledge of what’s available to you, can find out more about your needs when they talk to you, and will usually be able to respond to questions faster than I or other specific folks on the Internet can. Check out your favorite library’s website, and look for links like “get help” or “online chat” and see what they offer. OK, now here’s the question, extracted from a comment made by Nicholas Escobar to a recent post: I am currently studying at the University of Edinburgh getting masters degree in film composition. For my final project I am required to score a 15 minute film. I was thinking of picking a short silent film (any genre) in the public domain that is 15 minutes (or very close to that length) and was wondering if you had any suggestions? There are three questions implied by this one: First, how do you find out what films exist that meet your content criteria? Second, how do you find out whether films in that set are in the public domain? Finally, how can you get access to a film so you can do things with it (such as write a score for it)? There are a few ways you can come up with films to consider. One is to ask your local librarian (see above) or professor to recommend reference works or data sources that feature short films. (Information about feature films, which run longer, are often easier to find, but there’s a fair bit out there as well on short films.) Another is to search some of the reference works and online data sources I’ll mention in the other answers below. The answer to the copyright question depends on where you are. In the United States, there are basically three categories of public domain films: First, there are films copyrighted before 1925. All such films’ copyrights have now expired in the US. This covers most, but not all, of the commercial silent-film era; once The Jazz Singer came out in 1927, movie studies quickly switched to films with sound. Second, there are US films that entered the public domain because they did not take the steps required to secure or maintain their copyrights. Researching whether this has occurred with a particular film can be complicated, but because there’s been so much interest in cinema history, others have already researched the copyright history of many US films. The Wikipedia article “List of films in the public domain in the United States” cites a number of reference sources you can check for the status of various films. (It also lists specific films believed to be in the public domain, but you should check sources cited in the article for those films, and not just take the word of what could be a random Internet user before relying on that information.) Third, there are films created in their entirety by the US government. There’s a surprisingly large number of these, in various genres and lengths, with tens of thousands or more digitized in the Internet Archive’s United States Government film collection or listed in the National Archives catalog. You can do lots of things with works of the United States government, which are generally not subject to copyright. That’s the situation in the United States, at least. However, if you’re not in the United States, different rules may apply. In Edinburgh and elsewhere in the United Kingdom (and in most of the rest of Europe), works are generally copyrighted until the end of the 70th year after the death of the last author. In the UK, the authors of a film are considered to be the principal director, the screenwriter(s), and the composer(s). (For more specifics, see the relevant portion of UK law.) However, some countries will also let the copyrights of foreign works expire when they do in their country of origin, and in those a US film that’s in the public domain in the US would also be public domain in those countries. As you can see in the UK law section I link to, the UK does apply such a “rule of the shorter term” to films from outside the European Economic Area (EEA), if none of the authors are EEA nationals. So you might be good to go in the UK with many, but not all, US films that are public domain in the US. (I’m not a UK copyright expert, though; you might want to talk to one to be sure.) Let’s suppose you’ve come up with some suitable possible films, either ones that are in the public domain, ones that have suitable Creative Commons licenses or you can otherwise get permission to score, or ones that are in-copyright but that you could score in the context of a study project, even if you couldn’t publish the resulting audiovisual work. (Educational fair use is a thing, though its scope also varies from country to country. Here a guide from the British Library on how it works in the UK.) We then move on to the last question: How do you get hold of a copy so you can write a score for it? The answer to that question depends on your situation. Right now, the situation for many of us is that we’re stuck at home, and can’t visit libraries or archives in person. (And our ability to get physical items like DVDs or videotapes may be limited too.) So for now, you may be limited to films you can obtain online. There are various free sources of public domain films: I’ve already mentioned the Internet Archive, whose moving image archive includes many films that are in the public domain (and many that are not, so check rights before choosing one to score). The Library of Congress also offers more than 2,000 compilations and individual films free to all online. And your local library may well offer more, as digital video, or as physical recordings (if you can still obtain those). A number of streaming services that libraries or individuals can subscribe to offer films in the public domain that you can free free to set to music. Check with your librarian or browse the collection of your favorite streaming service. I’m not an expert in films myself. Folks reading this who know more, or have more suggestions, should feel free to add comments to this post while comments are open. In general, the first librarians you talk to won’t usually be experts about the questions you ask. But even when we can’t give definitive answers on our own, we’re good at sending researchers in productive directions, whether that’s to useful research and reference sources, or to more knowledgeable people. I hope you’ll take advantage of your librarians’ help, especially during this health crisis. And, for my questioner and other folks who are interested in scoring or otherwise building on public domain films, I’ll be very interested in hearing about the new works you produce from them. Posted in copyright, publicdomain, Questions | Comments Off on Everybody’s Library Questions: Finding films in the public domain Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Posted on March 19, 2020 by John Mark Ockerbloom The Library of Congress is seeking public input on abilities and priorities desired for the next Register of Copyrights, who heads the Copyright Office, a department within the Library of Congress. The deadline for comments as I write this is March 20, though I’m currently having trouble getting the form to accept my input, and operations at the Library, like many other places, are in flux due to the COVID-19 pandemic. Below I reproduce the main portion of the comments I’m hoping to get in before the deadline, in the hope that they will be useful for both them and others interested in copyright. I’ve added a few hyperlinks for context. At root, the Register of Copyrights needs to do the job the position title implies: Build and maintain an effective copyright registry. A well designed, up-to-date digital registry should make it easy for rightsholders to register, and for the public to use registration information. Using today’s copyright registry involves outdated, cumbersome, and costly technologies and practices. Much copyright data is not online, and the usability of what is online is limited. The Library of Congress is now redesigning its catalogs for linked data and modern interfaces. Its Copyright Office thus also has an opportunity to build a modern copyright registry linked to Library databases and to the world, with compatible linked data technologies, robust APIs, and free open bulk downloads. The Copyright Office’s registry and the Library of Congress’s bibliographic and authority knowledge bases could share data, using global identifiers to name and describe entities they both cover, including publications, works, creators, rightsholders, publishers, serials and other aggregations, registrations, relationships, and transactions. The Copyright Office need not convert wholesale to BIBFRAME, or to other Library-specific systems. It simply needs to create and support identifiers for semantic entities described in the registry (“things, not strings“), associate data with them, and exchange data in standard formats with the Library of Congress catalog and other knowledge bases. As a comprehensive US registry for creative works of all types, the Copyright Office is uniquely positioned to manage such data. The Deep Backfile project at the University of Pennsylvania (which I maintain) provides one example of uses that can be made of linked copyright data. At <https://onlinebooks.library.upenn.edu/webbin/cinfo/colliers> is a page showing selected copyrights associated with Collier’s Magazine (1888-1957). It links to online copies of public domain issues, contents and descriptive information from external sources like FictionMags, Wikidata, and Wikipedia, and rights contact information for some of its authors. The information shown has no rights restrictions, and can be used by humans and machines. JSON files, and the entire Deep Backfile knowledge base, are available from this page and from Github. It is not the Copyright Office’s job to produce applications like these. But it can provide data that powers them. Much of our Deep Backfile data was copied manually from scanned Catalog of Copyright Entries pages, and from online catalogs lacking easily exported or linked data. The Copyright Office and the Library of Congress could instead produce such data natively (first prospectively, eventually retrospectively). In the process, they could also cross-pollinate each other’s knowledge bases. To implement this vision, the Register needs to understand library standards and linked open data technologies, gather and manage a skilled implementation team, and be sufficiently persuasive, trusted, and organized to bring stakeholders together inside and outside the Copyright Office and the Library of Congress to support and fund a new system’s development. If explained and implemented well, a registry of the sort described here could greatly benefit copyright holders and copyright users alike. The Register of Copyrights should also know copyright law thoroughly, implement sensible regulations required by copyright law and policy, and be a trusted and inclusive expert that rightsholders, users, and policymakers can consult. I expect other commenters to go into more detail about these skills, which are also useful in building a trustworthy registry of the sort I describe. But the Copyright Office is long overdue to be led by a Register who can revitalize its defining purpose: Register copyrights, in up-to-date, scalable, and flexible ways that encourage wide use of the creations they cover, and thus promote the progress of science and useful arts. Update, March 20: As of the late afternoon on the day of the deadline, the form appears to be still rejecting my submission, without a clear error message. It did, however, accept a very short submission without any attachment, and with a URL pointing here. So below I include the rest of my intended comment, listing 3 top priorities. (The essay above was for the longer comment asked for about knowledge, skills, and abilities.) These priorities largely restate in summary form what I wrote above. If anyone else reading this was unable to post their full comment by the deadline due to technical difficulties, you can try emailing something to me (or leaving a comment to this post) and posting a simple comment to that effect on the LC site, and I’ll do my best to get your full comment posted on this blog. Priority #1: Make copyright registration data easy to use: Data should be easy to search, consult, and analyze, individually and in bulk, by people and machines, linked with the Library of Congress’s rich bibliographic data, facilitating verification of copyright ownership, licensing from rightsholders, and cataloging and analysis by libraries, publishers, vendors, and researchers. Priority #2: Make effective copyright registration easy to do: Ensure copyright registration is simple, inexpensive, supports a variety of electronic and physical deposits, and where possible supports persistent, addressible identifiers and accompanying data for semantic entities described in registrations, and their relationships. Priority #3: Be a trusted, inclusive resource for understanding copyright and its uses: Creators, publishers, consumers, and policymakers all are concerned with copyright, and with possible reforms. The Register should help all understand their rights, and provide expert and impartial advice and mediation for diverse copyright stakeholders and policymaking priorities. Other factors: The Register of Copyrights should also be capable of creating, implementing, and keeping up to date appropriate regulations and practices required or implied by Congressional statutes. (For the “additional comments” attachment, I had a static PDF attachment showing the Collier’s web page linked from my main essay, as it was on March 19.) Posted in copyright, data, metadata, open access, serials | Comments Off on Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Welcome to everybody’s online libraries Posted on March 16, 2020 by John Mark Ockerbloom As coronavirus infections spread throughout the world, lots of people are staying home to slow down the spread and save lives. In the US, many universities, schools, and libraries have closed their doors. (Here’s what happening at the library where I work, which as I write this has closed all its buildings.) But lots of people are still looking for information, to continue studies online, or just to find something good to read. Libraries are stepping up to provide these things online. Many libraries have provided online information for years, through our own websites, electronic resources that we license, create, or link to, and other online services. During this crisis, as our primary forms of interaction move online, many of us will be working hard to meet increased demand for digital materials and services (even as many library workers also have to cope with increased demands and stresses on their personal lives). Services are likely to be in flux for a while. I have a few suggestions for the near term: Check your libraries’ web sites regularly. They should tell you whether the libraries are now physically open or closed (many are closed now, for good reason), and what services the library is currently offering. Those might change over time, sometimes quickly. Our main library location at Penn, for instance, was declared closed indefinitely last night, less than 12 hours before it was next due to reopen. On the other hand, some digitally mediated library services and resources might not be available initially, but then become available after we have safe and workable procedures set up for them and sufficient staffing. Many library web sites also prominently feature their most useful electronic resources and services, and have extensive collections of electronic resources in their catalogs or online directories. They may be acquiring more electronic resources to meet increased user demand for online content. Some providers are also increasing what they offer to their library customers during the crisis, and sometimes making some of their material free for all to access. If you need particular things from your library during this crisis, reach out to them using the contact information given on their website. When libraries know what their users need, they can often make those needs a priority, and can let you know if and when they can provide them. Check out other free online library services. I run one of them, The Online Books Page, which now lists over 3 million books and serials freely readable online due to their public domain status or the generosity of their rightsholders. We’ll be adding more material there over the next few weeks as we incorporate the listings of more collections, and respond to your requests. There are many other services online as well. Wikipedia serves not only as a crowd-sourced collection of articles on millions of topics, but also as a directory of further online resources related to those topics. And the Internet Archive also offers access millions of books and other information resources no longer readily commercially available, many through controlled digital lending and other manifestations of fair use. (While the limits of fair use are often subject to debate, library copyright specialists make a good case that its bounds tend to increase during emergencies like this one. See also Kyle Courtney’s blog for more discussion of useful things libraries can do in a health crisis with their copyright powers.) Support the people who provide the informative and creative resources you value. The current health crisis has also triggered an economic crisis that will make life more precarious for many creators. If you have funds you can spare, send some of them their way so they can keep making and publishing the content you value. Humble Bundles, for instance, offer affordable packages of ebooks, games, and other online content you can enjoy while you’re staying home, and pay for to support their authors, publishers, and associated charities. (I recently bought their Tachyon SF bundle with that in mind; it’s on offer for two more weeks as I write this.) Check the websites of your favorite authors and artists to see if they offer ways to sponsor their work, or specific projects they’re planning. Buy books from your favorite independent booksellers (and if they’re closed now, check their website or call them to see if you can buy gift cards to keep them afloat now and redeem them for books later on). Pay for journalism you value. Support funding robust libraries in your community. Consider ways you can help build up online libraries. Many research papers on COVID-19 and related topics have been opened to free access by their authors or publishers since the crisis began. Increasing numbers of scholarly and other works are also being made open access, especially by those who have already been paid for creating them. If you’re interested in sharing your work more broadly, and want to learn more about how you can secure rights to do so, the Authors’ Alliance has some useful resources. As libraries shift focus from in-person to online service, some librarians may be busy with new tasks, while others may be left hanging until new plans and procedures get put into motion. If you’re in the latter category, and want something to do, there are various library-related projects you can work on or learn about. One that I’m running is the deep backfile project to identify serial issues that are in the public domain in less-than-obvious ways, and to find or create free digital copies of these serials (so that, among other things, people who are stuck at home can read them online). I’ve recently augmented my list of serial backfiles to research to include serials held by the library in which I work, in the hopes that we could eventually find or produce digital surrogates for some of them that our readers (and anyone else interested) could access from afar. I can also add sets for other libraries; if you’re interested in one for yours, let me know and I can go into more detail about the data I’m looking for. (I’m not too worried about creating too many serial sets to research, especially since once information about a serial is added into one of the serial sets, it also gets automatically added into any other sets that include that serial.) Take care of yourself, and your loved ones. Whether you work in libraries of just use them, this is a stressful time. Give yourself and those around you room and resources to cope, as we disengage from much of our previous activities, and deal with new responsibilities and concerns. I’m gratified to see the response of the Wikimedia Foundation, for instance, which is committed both to keeping the world well-informed and up-to-date through Wikipedia and related projects, and also to letting its staff and contractors work half-time for the same pay during the crisis, and waiving sick-day limits. Among new online community support initiatives, I’m also pleased to see librarian-created resources like the Ontario Library Association’s pandemic information brief, with useful information for library users and workers, and the COVID4GLAM Discord community, a discussion space to support the professional and personal needs of people working in libraries, archives, galleries and museums. These will be difficult times ahead. Our libraries can make a difference online, even as our doors are closed. I hope you’ll be able to put them to good use. Posted in libraries, online books, open access | 4 Comments Public Domain Day 2020: Coming Around Again Posted on January 1, 2020 by John Mark Ockerbloom I’m very happy for 2020 to be arriving. As the start of the 2020s, it represents a new decade in which we can have a fresh start, and hope to make better decisions and have better outcomes than some of what we’ve gone through in recent years. And I’m also excited to have a full year’s worth of copyrighted works entering the public domain in much of the world, including in the US for the second year in a row after a 20-year public domain freeze. Outside the US, in countries that still use the Berne Convention‘s “life plus 50 years” copyright terms, works by authors who died in 1969 are now in the public domain. (Such countries include Canada, New Zealand, and a number of other countries mostly in Asia and Africa.) Many other countries, including most European countries, have extended copyright terms to life of the author(s) plus 70 years, often under pressure from the United States or the European Union. In those countries, works by authors who died in 1949 are now in the public domain. The Public Domain Review has a “class of 2020” post featuring some of these authors, along with links to lists of other people who died in the relevant years. In the US, nearly all remaining copyrights from 1924 have now expired, just as copyrights from 1923 expired at the start of last year. (The exceptions are sound recordings, which will still be under copyright for a little while longer. But thanks to recent changes in copyright law, those too will join the public domain soon instead of remaining indefinitely in state copyright.) I discussed some of the works joining the public domain in a series of blog posts last month, in the last one linking to some posts by others that mentioned new public domain arrivals from 1924. But I’m happy not just because of these specific works, but also because new arrivals to the US public domain are now an annual event, and not just something that happens with published works at rare intervals. I could get used to this. It isn’t all good news this year. The most recent draft of the intellectual property chapter of the US-Canada-Mexico trade agreement requires Canada to extend its copyrights another 20 years, making it freeze its public domain not long after we’ve unfrozen our own in the US. But the agreement hasn’t yet been ratified, and could conceivably still be changed or rejected. And the continued force of copyrights from the second half of the previous ’20s while we’re entering a new set of ’20s is a reminder that US copyright terms remain overlong; so long, in fact, that many works from that era are lost or severely deteriorated before their copyrights expire. But there’s now an annual checklist of things to do for me and for many other library organizations. For me, some of the things to do for The Online Books Page include: Updating our documentation on what’s public domain (done) and on what versions of our site are public domain (also done; as in previous years, I’m dedicating to the public domain works that I wrote whose copyrights I control that are were published more than 14 years ago. This year that includes the 2005 copyrights to The Online Books Page.) Removing the “no US access” notices from 1924 books I’d linked to at non-US sites, when I couldn’t previously establish that they were public domain here; and removing “US access only” notices for 1879 volumes at HathiTrust, which over the next few days will be making 140-year-old volumes globally accessible without requiring author-death-date review. (This and other activities below will start tomorrow and continue until done.) Updating our list of first active renewals for serials and our “Determining copyright status of serial issues” decision guide to reflect the expiration of 1924’s copyrights. As part of this process, I’ll be deleting all the 1924 serial issue and contribution renewals currently recorded in our serials knowledge base, since they’re no longer in force. If anyone wants to know what they were for historical or other analytical purposes, I have a zipped collection of all our serial renewals records as of the end of 2019, available on request. They can also be found in the January 1, 2020 commit of this Github directory. Adding newly opened or scanned 1924 books to our listings, through our automated OAI harvests of selected digital collections, readers’ suggestions and requests, surveys of prize winners and other relevant collections, and our own bibliographer selections. All of this is work I’m glad to be doing this year, and hope to be doing more in the years to come. (And I’m already streamlining our processes to make it easier to do in years to come.) Its the job of libraries to collect and preserve works of knowledge and creativity and make them easy for people to discover, access, and use. It’s also our job to empower our users to draw on those works to make new ones. As the public domain grows, we can freely collect and widely share more works, and our users can likewise build on and reuse more public domain works in their own creations. Supporting the public domain, then, is supporting the work and mission of libraries. I therefore hope that all libraries and their users will support a robust public domain, and have more works to celebrate and work with every year. Happy Public Domain Day! Posted in publicdomain | Comments Off on Public Domain Day 2020: Coming Around Again 2020 vision #5: Rhapsody in Blue by George Gershwin Posted on December 31, 2019 by John Mark Ockerbloom It’s only a few hours from the new year where I write this, but before I ring in the new year, and a new year’s worth of public domain material, I’d like to put in a request for what music to ring it in with: George Gershwin’s Rhapsody in Blue, which joins the public domain in the US as the clock strikes twelve, over 95 years after it was first performed. The unofficial song for Public Domain Day 2019 turned out to be “Yes! We Have No Bananas”, one of the members of the first big class of US public domain works in the last 20 years. That’s a fun novelty song, and certainly memorable, but not something I necessarily want to hear a lot. In contrast, for me Rhapsody in Blue has a freshness that makes it a joy for me to hear repeatedly, right from the opening clarinet glissando (apparently the idea of clarinetist Ross Gorman, who took the scale that Gershwin had composed for the piece and gave it the bendy, slidy wail that tells you right away that this is no ordinary concert piece). It’s brought together classical, popular, high-art and everyday music, as it’s been played and recorded countless times by jazz bands (the original scoring is for jazz band and piano), symphony orchestras, and pop musicans like Billy Joel. Even its licensing as an theme tune for an airline hasn’t diminished it. There’s lots of other work joining the public domain along with Gershwin’s tune. I’ve only had a chance to mention a few others in my short series, but others have mentioned more works you may find of interest. At the Internet Archive’s blog, Elizabeth Townsend Gard writes about Vera Brittain’s Not without Honour and other 1924 works that will be in the public domain very soon. Duke’s Public Domain Day 2020 post mentions various books, films, and musical compositions joining the public domain as well (and has more to say on Rhapsody in Blue). Wikipedia’s various 1924 articles also mention various works that will either be joining the public domain, or becoming more clearly established there. And Hathitrust will begin opening access to tens of thousands of scanned volumes from 1924 over the next few days. I’ll have more to say on the new arrivals tomorrow, sometime after the midnight bells chime. By tradition, the first tune played in the New Year is usually the public domain song “Auld Lang Syne”. But after that, at your new years’ party or at a later Public Domain celebration, you might enjoy hearing or playing Gershwin’s new arrival in the public domain. Posted in publicdomain | Comments Off on 2020 vision #5: Rhapsody in Blue by George Gershwin 2020 vision #4: Ding Dong Merrily on High by George Ratcliffe Woodward and others Posted on December 19, 2019 by John Mark Ockerbloom It’s beginning to sound a lot like Christmas everywhere I go. The library where I work had its holiday party earlier this week, where I joined librarian colleagues singing Christmas, Hanukkah, and winter-themed songs in a pick-up chorus. Radio stations and shopping centers play a familiar rotation of popular seasonal songs whose biggest hits are from a surprisingly narrow date range centered in the 1950s. And more traditional familiar Christmas carols, hymns, and songs are being sung and played in concert halls and churches well into January. The more “classic” Christmas music often feels timeless to those of us singing and hearing it. But while their roots often go back far, the form in which we know them is often much newer that we might think. Notice how the list in the previous link, for instance, includes “Carol of the Bells”, dated 1936. That’s when it was first published as a Christmas song, one that’s still under copyright. Its roots are older, and darker, as is made clear in a recent Slate article well worth reading. As noted there, the melody is based on a Ukrainian folk tune (date unknown), its full musical setting composed by Mykola Leontovych (assassinated by a Soviet agent in 1921), and Christmas-themed lyrics written by the Ukrainian-descended American musician Peter Wilhousky (who lived until 1978). While “Carol of the Bells” still has a number of years left to go on its copyright, another classic Christmas carol will most likely be joining the public domain in the US in just under two weeks. Like Carol of the Bells, “Ding Dong Merrily on High” is based on a folk tune, in this case a secular dance tune first published in France in the 16th century under the title “Branle de l’Official”. In 1924, George Ratcliffe Woodward, an English cleric already known for publishing collections of old songs, wrote lyrics for the tune recalling earlier ages, and included them in the Cambridge Carol-Book, published that year by the Society for Promoting Christian Knowledge. Charles Wood, who’d collaborated with Woodward on the earlier Cowley Carol Book, wrote a harmonization to go with it. While you won’t hear it at every Christmas service, it remains widely sung this time of year. That’s in large part because it’s so much fun to sing, with its dance-like rhythms, its long bell-like vocal runs on “Gloria” (something also heard in “Angels We Have Heard on High“), and its praise of various forms of music (musicians liking to hear good things about themselves as much as anyone else). I don’t actually know for sure that “Ding Dong Merrily on High” is still under copyright here. I have not found a 1951 or 1952 copyright renewal for the song or the book it was published in, but I’m assuming that, if nothing else, GATT restoration retroactively secured and automatically renewed a 1924 US copyright for the song as published in the Cambridge Carol-Book. (Folks with more knowledge or legal expertise are free to correct me on that.) Later published arrangements of the song may continue to have active copyrights, but only for material original to those arrangements. 1924’s remaining copyrights, on the other hand, all end in the US on January 1. (And since Woodward and Wood both died over 70 years ago, the song’s already public domain in most other countries.) The arrival of 2020, then, should at least clear up any ambiguity about the public domain status of the basic carol. I appreciate that, in part because this song, like many other Christmas carols, lives in a sort of liminal space between the private property regimes set up for copyright holders and the older, more informal understandings of folk culture. Both kinds of spaces have good reason to exist. On the one hand, it’s good to have more than a few people who can earn a living through music, and one important way many musicians do so is by controlling rights to their compositions. On the other hand, the folk process, which originally gave rise to the tunes for both “Ding Dong Merrily on High” and “Carol of the Bells”, is also a very good way of creating and passing on shared cultural works. Conflict can rage when two different sets of cultural expectations around creative works try to occupy the same space. That’s one reason we’ve seen decades of conflict in academia over open access, where scholarly work is largely published by companies that depend on its control and sale to earn money, while it’s largely written by scholars who earn their money in other ways, and tend to prefer free, widespread availability of their work. Sometimes informal arrangements work best to keep the peace. Publishers, for instance, have grown more used to free preprint servers, and memes and fan fiction communities have become more widely accepted (and even winning awards) as long as they stay well away from unauthorized commercial exploitation (where both big and small creators tend to draw the line). Sometimes, though, it’s best to have a more formal understanding that works are free for anyone to freely use as we like. That’s what we’ll have when 1924’s copyrights end, and the works they cover, such as “Ding Dong Merrily on High” are clearly seen to be in the public domain. And then, those of us who are so inclined can freely sing “hosanna in excelsis!“ Posted in publicdomain | Comments Off on 2020 vision #4: Ding Dong Merrily on High by George Ratcliffe Woodward and others 2020 vision #3: The Most Dangerous Game by Richard Connell Posted on December 13, 2019 by John Mark Ockerbloom “Be a realist. The world is made up of two classes–the hunters and the huntees. Luckily, you and I are hunters.” Sanger Rainsford speaks these words at the start of “The Most Dangerous Game”, one of the most famous short stories of all time. First published in Collier’s magazine in 1924, it’s been reprinted in numerous anthologies, been adapted for radio, TV, and multiple movies, and assigned in countless middle and high school English classes. The tropes established in the story, in which a hunter finds himself a “huntee”, are so well-established in present-day American culture that there are lengthy TV Tropes pages not just for the story itself, but for the trope named by its title. Up until now, the story’s been under copyright in the US, as well as in Europe and other countries that have “life plus 70 years” copyright terms. (The author, Richard Connell, died just over 70 years ago in 1949, so as of January 1, it will be public domain nearly everywhere in the world.) Anyone reprinting the story, or explicitly adapting it for drama or art has had to get permission or pay a royalty. On the other hand, many creators have reused its basic idea– humans being hunted for sport or entertainment– without getting such permission. That’s because ideas themselves are not copyrightable, but rather the expression of those ideas. And the basic idea long predates this particular story: Consider, for instance, gladiators in Roman arenas, or tributes being hunted down in the Labyrinth by the Minotaur of Greek mythology. But the particular formulation in Connell’s short story, in which General Zaroff, a former nobleman bored with hunting animals, lures humans to his private island to hunt and kill them for sport, is both distinctively memorable, and copyrightable. Stray too close to it, or quote too much from the story, and you may find yourself the target of lawyers. (But perhaps not if you yourself are dangerous enough game. I don’t know if the makers of “The Incredibles“, which also featured a rich recluse using his wits and inventions to hunt humans on a private island, paid royalties to Connell’s estate, or relied on fair use or arguments about uncopyrightable ideas. But in any case, Disney is better equipped to either negotiate or defend themselves against infringement lawsuits than others would be.) Rereading the story recently, I’m struck by both how it reflects its time in some ways, and in how its action is surprisingly economical. In 1924, we were still living in the shadow of the First World War, in which multiple empires and noble houses fell, while others continued but began to teeter. The deadly spectacles of public executions and lynchings were still not uncommon in the United States. And the dividing of people into two classes– those who are inherently privileged and those who are left in the cold or even considered fair game– was particularly salient that year, as the second incarnation of the Ku Klux Klan neared its peak in popularity, and as immigration law was changed to explicitly keep out people of the “wrong” national origin or race. Those sorts of division haunt our society to this day. Rainsford objects to Zaroff’s dehumanizing game in what we now tend to think of the story’s setup, which actually takes most of the story’s telling. (The description of the hunt itself is relatively brief, and no words at all are used to describe the final showdown, which implicitly takes place in the gap between the story’s last two sentences.) In the end, though, Rainsford prevails by beating his opponent at his own game. He doesn’t want to kill another human being, but when pressed to the extreme, he adopts his opponent’s rules (at the end giving Zaroff the sporting warning “I am still a beast at bay… Get ready”) and proves to be the better killer. With the story entering the public domain in less than three weeks, we’ll have the chance to reuse, adapt, and critique the story in quotation more freely than ever before. I hope we use the opportunity not just to recapitulate the story, but to go beyond it in new ways. That’s what happens in the best reuses of tropes. Consider for instance, how in the Hunger Games books, the main character Katniss repeatedly finds ways to subvert the trope of killing others for entertainment. Instead of prevailing by beating opponents at the deadly human-hunting game the enemy has created, she and her allies find ways to reject the game’s premise, cut it short, or prevent its recurrence. When, in 19 days, we get another year’s worth of public domain works, I hope we too find ways not just to revisit what’s come before, but make new and better work out of them. That’s something that the public domain allows everyone, and not just members of some privileged class, to do. Posted in publicdomain | Comments Off on 2020 vision #3: The Most Dangerous Game by Richard Connell ← Older posts Search for: RSS feed Pages About Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge Recent Posts Public Domain Day 2021: Honoring a lost generation Counting down to 1925 in the public domain From our subjects to yours (and vice versa) Everybody’s Library Questions: Finding films in the public domain Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Recent Comments Jason on Public Domain Day 2021: Honoring a lost generation John Mark Ockerbloom on Public Domain Day 2021: Honoring a lost generation Norma Bruce on Public Domain Day 2021: Honoring a lost generation Brent Reid on Counting down to 1925 in the public domain John Mark Ockerbloom on Counting down to 1925 in the public domain Archives January 2021 December 2020 March 2020 January 2020 December 2019 November 2019 October 2019 September 2019 July 2019 June 2019 January 2019 December 2018 October 2018 June 2018 January 2018 December 2017 September 2017 January 2017 October 2016 September 2016 July 2016 May 2016 January 2016 January 2015 June 2014 January 2014 October 2013 August 2013 April 2013 March 2013 February 2013 January 2013 December 2012 July 2012 May 2012 January 2012 October 2011 September 2011 June 2011 May 2011 April 2011 January 2011 December 2010 November 2010 October 2010 September 2010 August 2010 July 2010 June 2010 May 2010 April 2010 March 2010 February 2010 January 2010 December 2009 October 2009 September 2009 August 2009 July 2009 June 2009 May 2009 April 2009 March 2009 January 2009 December 2008 November 2008 October 2008 September 2008 August 2008 July 2008 June 2008 May 2008 April 2008 March 2008 February 2008 January 2008 December 2007 November 2007 Access for all Open Access News Copyrights and wrongs Copyfight Copyright & Fair Use Freedom to Tinker Lawrence Lessig General library-related news and comment LISNews TeleRead Interesting folks Jessamyn West John Scalzi Jonathan Rochkind K. G. Schneider Karen Coyle Lawrence Lessig Leslie Johnston Library Loon Lorcan Dempsey Paul Courant Peter Brantley Walt Crawford Metadata and friends Planet Cataloging Shiny tech Boing Boing O’Reilly Radar Planet Code4lib Tales from the repository RepositoryMan Writing and publishing if:book Making Light Publishing Frontier Everybody's Libraries Blog at WordPress.com. Everybody's Libraries Blog at WordPress.com. Loading Comments... Write a Comment... Email (Required) Name (Required) Website
everybodyslibraries-com-8064 ---- Counting down to 1925 in the public domain | Everybody's Libraries Everybody's Libraries Libraries for everyone, by everyone, shared with everyone, about everything Skip to content Home About About the Free Decimal Correspondence Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge ← From our subjects to yours (and vice versa) Public Domain Day 2021: Honoring a lost generation → Counting down to 1925 in the public domain Posted on December 15, 2020 by John Mark Ockerbloom We’re rapidly approaching another Public Domain Day, the day at the start of the year when a year’s worth of creative work joins the public domain. This will be the third year in a row that the US will have a full crop of new public domain works (after a prior 20-year drought), and once again, I’m noting and celebrating works that will be entering the public domain shortly. Approaching 2019, I wrote a one-post-a-day Advent Calendar for 1923 works throughout the month of December, and approaching 2020, I highlighted a few 1924 works, and related copyright issues, in a series of December posts called 2020 Vision. This year I took to Twitter, making one tweet per day featuring a different 1925 work and creator using the #PublicDomainDayCountdown hashtag. Tweets are shorter than blog posts, but I started 99 days out, so by the time I finish the series at the end of December, I’ll have written short notices on more works than ever. Since not everyone reads Twitter, and there’s no guarantee that my tweets will always be accessible on that site, I’ll reproduce them here. (This post has been updated to include all the tweets up to 2021, and in 2021 has been further updated to link to copies of some of the featured works.) The tweet links have been reformatted for the blog, and a few tweets have been recombined or otherwise edited. If you’d like to comment yourself on any of the works mentioned here, or suggest others I can feature, feel free to reply here or on Twitter. (My account there is @JMarkOckerbloom. You’ll also find some other people tweeting on the #PublicDomainDayCountdown hashtag, and you’re welcome to join in as well.) September 24: It’s F. Scott Fitzgerald’s birthday. His best-known book, The Great Gatsby, joins the US public domain 99 days from now, along with other works with active 1925 copyrights. #PublicDomainDayCountdown (Links to free online books by Fitzgerald here.) September 25: C. K. Scott-Moncrieff’s birthday’s today. He translated Proust’s Remembrance of Things Past (a controversial title, as the Public Domain Review notes). The Guermantes Way, his translation of Proust’s 3rd volume, joins the US public domain in 98 days. #PublicDomainDayCountdown September 26: Today is T.S. Eliot’s birthday. His poem “The Hollow Men” (which ends “…not with a bang but a whimper”) was first published in full in 1925, & joins the US public domain in 97 days. #PublicDomainDayCountdown More by & about him here. September 27: Lady Cynthia Asquith, born today in 1887, edited a number of anthologies that have long been read by children and fans of fantasy and supernatural fiction. Her first major collection, The Flying Carpet, joins the US public domain in 96 days. #PublicDomainDayCountdown September 28: As @Marketplace reported tonight, Agatha Christie’s mysteries remain popular after 100 years. In 95 days, her novel The Secret of Chimneys will join the US public domain, as will the expanded US Poirot Investigates collection. #PublicDomainDayCountdown September 29: Homer Hockett’s and Arthur Schlesinger, Sr.’s Political and Social History of the United States first came out in 1925, and was an influential college textbook for years thereafter. The first edition joins the public domain in 94 days. #PublicDomainDayCountdown September 30: Inez Haynes Gillmore Irwin died 50 years ago this month, after a varied, prolific writing career. This 2012 blog post looks at 4 of her books, including Gertrude Haviland’s Divorce, which joins the public domain in 93 days. #PublicDomainDayCountdown October 1: For some, spooky stories and themes aren’t just for October, but for the whole year. We’ll be welcoming a new year’s worth of Weird Tales to the public domain in 3 months. See what’s coming, and what’s already free online, here. #PublicDomainDayCountdown October 2: Misinformation and quackery has been a threat to public health for a long time. In 13 weeks, the 1925 book The Patent Medicine and the Public Health, by American quack-fighter Arthur J. Cramp joins the public domain. #PublicDomainDayCountdown October 3: Sophie Treadwell, born this day in 1885, was a feminist, modernist playwright with several plays produced on Broadway, but many of her works are now hard to find. Her 1925 play “Many Mansions” joins the public domain in 90 days. #PublicDomainDayCountdown October 4: It’s Edward Stratemeyer’s birthday. Books of his syndicate joining the public domain in 89 days include the debuts of Don Sturdy & the Blythe Girls, & further adventures of Tom Swift, Ruth Fielding, Baseball Joe, Betty Gordon, the Bobbsey Twins, & more. #PublicDomainDayCountdown October 5: Russell Wilder was a pioneering diabetes doctor, testing newly invented insulin treatments that saved many patients’ lives. His 1925 book Diabetes: Its Cause and its Treatment with Insulin joins the public domain in 88 days. #PublicDomainDayCountdown October 6: Queer British Catholic author Radclyffe Hall is best known for The Well of Loneliness. Hall’s earlier novel A Saturday Life is lighter, though it has some similar themes in subtext. It joins the US public domain in 87 days. #PublicDomainDayCountdown October 7: Edgar Allan Poe’s stories have long been public domain, but some work unpublished when he died (on this day in 1849) stayed in © much longer. In 86 days, the Valentine Museum’s 1925 book of his previously unpublished letters finally goes public domain. #PublicDomainDayCountdown October 8: In 1925, the Nobel Prize in Literature went to George Bernard Shaw. In 85 days, his Table-Talk, published that year, will join the public domain in the US, and all his solo works published in his lifetime will be public domain nearly everywhere else. #PublicDomainDayCountdown October 9: Author and editor Edward Bok was born this day in 1863. In Twice Thirty (1925), he follows up his Pulitzer-winning memoir The Americanization of Edward Bok with a set of essays from the perspective of his 60s. It joins the public domain in 84 days. #PublicDomainDayCountdown October 10: In the 1925 silent comedy “The Freshman”, Harold Lloyd goes to Tate University, “a large football stadium with a college attached”, and goes from tackling dummy to unlikely football hero. It joins the public domain in 83 days. #PublicDomainDayCountdown October 11: It’s François Mauriac’s birthday. His Le Desert de l’Amour, a novel that won the 1926 Grand Prix of the Académie Française, joins the US public domain in 82 days. Published translations may stay copyrighted, but Americans will be free to make new ones. #PublicDomainDayCountdown October 12: Pulitzer-winning legal scholar Charles Warren’s Congress, the Constitution, and the Supreme Court (1925) analyzes controversies, some still argued, over relations between the US legislature and the US judiciary. It joins the public domain in 81 days. #PublicDomainDayCountdown October 13: Science publishing in 1925 was largely a boys’ club, but some areas were more open to women authors, such as nursing & science education. I look forward to Maude Muse’s Textbook of Psychology for Nurses going public domain in 80 days. #PublicDomainDayCountdown #AdaLovelaceDay October 14: Happy birthday to poet E. E. Cummings, born this day in 1894. (while some of his poetry is lowercase he usually still capitalized his name when writing it out) His collection XLI Poems joins the public domain in 79 days. #PublicDomainDayCountdown October 15: It’s PG Wodehouse’s birthday. In 78 days more of his humorous stories join the US public domain, including Sam in the Suburbs. It originally ran as a serial in the Saturday Evening Post in 1925. All that year’s issues also join the public domain then. #PublicDomainDayCountdown October 16: Playwright and Nobel laureate Eugene O’Neill was born today in 1888. His “Desire Under the Elms” entered the US public domain this year; in 77 days, his plays “Marco’s Millions” and “The Great God Brown” will join it. #PublicDomainDayCountdown October 17: Not everything makes it to the end of the long road to the US public domain. In 76 days, the copyright for the film Man and Maid (based on a book by Elinor Glyn) expires, but no known copies survive. Maybe someone will find one? #PublicDomainDayCountdown October 18: Corra Harris became famous for her novel A Circuit Rider’s Wife and her World War I reporting. The work she considered her best, though, was As a Woman Thinks. It joins the public domain in 75 days. #PublicDomainDayCountdown October 19: Edna St. Vincent Millay died 70 years ago today. All her published work joins the public domain in 74 days in many places outside the US. Here, magazine work like “Sonnet to Gath” (in Sep 1925 Vanity Fair) will join, but renewed post-’25 work stays in ©. #PublicDomainDayCountdown October 20: All songs eventually reach the public domain. Authors can put them there themselves, like Tom Lehrer just did for his lyrics. But other humorous songs arrive by the slow route, like Tilzer, Terker, & Heagney’s “Pardon Me (While I Laugh)” will in 73 days. #PublicDomainDayCountdown October 21: Sherwood Anderson’s Winesburg, Ohio wasn’t a best-seller when it came out, but his Dark Laughter was. Since Joycean works fell out of fashion, that book’s been largely forgotten, but may get new attention when it joins the public domain in 72 days. #PublicDomainDayCountdown October 22: Artist NC Wyeth was born this day in 1882. The Brandywine Museum near Philadelphia shows many of his works. His illustrated edition of Francis Parkman’s book The Oregon Trail joins the public domain in 71 days. #PublicDomainDayCountdown October 23: Today (especially at 6:02, on 10/23) many chemists celebrate #MoleDay. In 70 days, they’ll also get to celebrate historically important chemistry publications joining the US public domain, including all 1925 issues of Justus Liebigs Annalen der Chemie. #PublicDomainDayCountdown October 24: While some early Alfred Hitchcock films were in the US public domain for a while due to formality issues, the GATT accords restored their copyrights. His directorial debut, The Pleasure Garden, rejoins the public domain (this time for good) in 69 days. #PublicDomainDayCountdown (Addendum: There may still be one more year of copyright to this film as of 2021; see the comments to this post for details.) October 25: Albert Barnes took a different approach to art than most of his contemporaries. The first edition of The Art in Painting, where he explains his theories and shows examples from his collection, joins the public domain in 68 days. #PublicDomainDayCountdown October 26: Prolific writer Carolyn Wells had a long-running series of mystery novels featuring Fleming Stone. Here’s a blog post by The Passing Tramp on one of them, The Daughter of the House, which will join the public domain in 67 days. #PublicDomainDayCountdown October 27: Theodore Roosevelt was born today in 1858, and died over 100 years ago, but some of his works are still copyrighted. In 66 days, 2 volumes of his correspondence with Henry Cabot Lodge, written from 1884-1918 and published in 1925, join the public domain. #PublicDomainDayCountdown October 28: American composer and conductor Howard Hanson was born on this day in 1896. His choral piece “Lament for Beowulf” joins the public domain in 65 days. #PublicDomainDayCountdown October 29: “Skitter Cat” was a white Persian cat who had adventures in several children’s books by Eleanor Youmans, illustrated by Ruth Bennett. The first of the books joins the public domain in 64 days. #PublicDomainDayCountdown #NationalCatDay October 30: “Secret Service Smith” was a detective created by Canadian author R. T. M. Maitland. His first magazine appearance was in 1920; his first original full-length novel, The Black Magician, joins the public domain in 9 weeks. #PublicDomainDayCountdown October 31: Poet John Keats was born this day in 1795. Amy Lowell’s 2-volume biography links his Romantic poetry with her Imagist poetry. (1 review.) She finished and published it just before she died. It joins the public domain in 62 days. #PublicDomainDayCountdown November 1: “Not just for an hour, not for just a day, not for just a year, but always.” Irving Berlin gave the rights to this song to his bride in 1926. Both are gone now, and in 2 months it will join the public domain for all of us, always. #PublicDomainDayCountdown November 2: Mikhail Fokine’s The Dying Swan dance, set to music by Camille Saint-Saëns, premiered in 1905, but its choreography wasn’t published until 1925, the same year a film of it was released. It joins the public domain in 60 days. #PublicDomainDayCountdown (Choreography copyright is weird. Not only does the term not start until publication, which can be long after 1st performance, but what’s copyrightable has also changed. Before 1978 it had to qualify as dramatic; now it doesn’t, but it has to be more than a short step sequence.) November 3: Herbert Hoover was the only sitting president to be voted out of office between 1912 & 1976. Before taking office, he wrote the foreword to Carolyn Crane’s Everyman’s House, part of a homeowners’ campaign he co-led. It goes out of copyright in 59 days. #PublicDomainDayCountdown November 4: “The Golden Cocoon” is a 1925 silent melodrama featuring an election, jilted lovers, and extortion. The Ruth Cross novel it’s based on went public domain this year. The film will join it there in 58 days. #PublicDomainDayCountdown November 5: Investigative journalist Ida Tarbell was born today in 1857. Her History of Standard Oil helped break up that trust in 1911, but her Life of Elbert H. Gary wrote more admiringly of his chairmanship of US Steel. It joins the public domain in 57 days. #PublicDomainDayCountdown November 6: Harold Ross was born on this day in 1892. He was the first editor of The New Yorker, which he established in coöperation with his wife, Jane Grant. After ninety-five years, the magazine’s first issues are set to join the public domain in fifty-six days. #PublicDomainDayCountdown November 7: “Sweet Georgia Brown” by Ben Bernie & Maceo Pinkard (lyrics by Kenneth Casey) is a jazz standard, the theme tune of the Harlem Globetrotters, and a song often played in celebration. One thing we can celebrate in 55 days is it joining the public domain. #PublicDomainDayCountdown November 8: Today I hiked on the Appalachian Trail. It was completed in 1937, but parts are much older. Walter Collins O’Kane’s Trails and Summits of the White Mountains, published in 1925 when the AT was more idea than reality, goes public domain in 54 days. #PublicDomainDayCountdown November 9: In Sinclair Lewis’ Arrowsmith, a brilliant medical researcher deals with personal and ethical issues as he tries to find a cure for a deadly epidemic. The novel has stayed relevant well past its 1925 publication, and joins the public domain in 53 days. #PublicDomainDayCountdown November 10: John Marquand was born today in 1893. He’s known for his spy stories and satires, but an early novel, The Black Cargo, features a sailor curious about a mysterious payload on a ship he’s been hired onto. It joins the US public domain in 52 days. #PublicDomainDayCountdown November 11: The first world war, whose armistice was 102 years ago today, cast a long shadow. Among the many literary works looking back to it is Ford Madox Ford’s novel No More Parades, part of his “Parade’s End” tetralogy. It joins the public domain in 51 days. #PublicDomainDayCountdown November 12: Anne Parrish was born on this day in 1888. In 1925, The Dream Coach, co-written with her brother, got a Newbery honor , and her novel The Perennial Bachelor was a best-seller. The latter book joins the public domain in 50 days. #PublicDomainDayCountdown November 13: In “The Curse of the Golden Cross”, G. K. Chesterton’s Father Brown once again finds a natural explanation to what seem to be preternatural symbols & events. As of today, Friday the 13th, the 1925 story is exactly 7 weeks away from the US public domain. #PublicDomainDayCountdown November 14: The pop standard “Yes Sir, That’s My Baby” was the baby of Walter Donaldson (music) and Gus Kahn (lyrics). It’s been performed by many artists since its composition, and in 48 days, this baby steps out into the public domain. #PublicDomainDayCountdown November 15: Marianne Moore, born on this day in 1887, had a long literary career, including editing the influential modernist magazine The Dial from 1925 on. In 47 days, all 1925 issues of that magazine will be fully in the public domain. #PublicDomainDayCountdown November 16: George S. Kaufman, born today in 1889, wrote or directed a play in every Broadway season from 1921 till 1958. In 46 days, several of his plays join the public domain, including his still-performed comedy “The Butter and Egg Man”. #PublicDomainDayCountdown November 17: Shen of the Sea was a Newbery-winning collection of stories presented as “Chinese” folktales, but written by American author Arthur Bowie Chrisman. Praised when first published, seen more as appropriation later, it’ll be appropriable itself in 45 days. #PublicDomainDayCountdown November 18: Jacques Maritain was a French Catholic philosopher who influenced the Universal Declaration of Human Rights. His book on 3 reformers (Luther, Descartes, and Rousseau) joins the public domain in 44 days. #PublicDomainDayCountdown November 19: Prevailing views of history change a lot over 95 years. The 1926 Pulitzer history prize went to a book titled “The War for Southern Independence”. The last volume of Edward Channing’s History of the United States, it joins the public domain in 43 days. #PublicDomainDayCountdown November 20: Alfred North Whitehead’s Science and the Modern World includes a nuanced discussion of science and religion differing notably from many of his contemporaries’. (A recent review of it.) It joins the US public domain in 6 weeks. November 21: Algonquin Round Table member Robert Benchley tried reporting, practical writing, & reviews, but soon found that humorous essays & stories were his forte. One early collection, Pluck and Luck, joins the public domain in 41 days. #PublicDomainDayCountdown November 22: I’ve often heard people coming across a piano sit down & pick out Hoagy Carmichael’s “Heart and Soul”. He also had other hits, one being “Washboard Blues“. His original piano instrumental version becomes public domain in 40 days. #PublicDomainDayCountdown November 23: Harpo Marx, the Marx Brothers mime, was born today in 1888. In his oldest surviving film, “Too Many Kisses” he does “speak”, but silently (like everyone else in it), without his brothers. It joins the public domain in 39 days. #PublicDomainDayCountdown November 24: In The Man Nobody Knows, Bruce Barton likened the world of Jesus to the world of business. Did he bring scriptural insight to management, or subordinate Christianity to capitalism? It’ll be easier to say, & show, after it goes public domain in 38 days. #PublicDomainDayCountdown November 25: Before Virgil Thomson (born today in 1896) was well-known as a composer, he wrote a music column for Vanity Fair. His first columns, and the rest of Vanity Fair for 1925, join the public domain in 37 days. #PublicDomainDayCountdown November 26: “Each moment that we’re apart / You’re never out of my heart / I’d rather be lonely and wait for you only / Oh how I miss you tonight” Those staying safe by staying apart this holiday might appreciate this song, which joins the public domain in 36 days. #PublicDomainDayCountdown (The song, “Oh, How I Miss You Tonight” is by Benny Davis, Joe Burke, and Mark Fisher, was published in 1925, and performed and recorded by many musicians since then, some of whom are mentioned in this Wikipedia article.) November 27: Feminist author Katharine Anthony, born today in 1877, was best known for her biographies. Her 1925 biography of Catherine the Great, which drew extensively on the empress’s private memoirs, joins the public domain in 35 days. #PublicDomainDayCountdown November 28: Tonight in 1925 “Barn Dance” (soon renamed “Grand Ole Opry”) debuted in Nashville. Most country music on it & similar shows then were old favorites, but there were new hits too, like “The Death of Floyd Collins”, which joins the public domain in 34 days. #PublicDomainDayCountdown (The song, with words by Andrew Jenkins and music by John Carson, was in the line of other disaster ballads that were popular in the 1920s. This particular disaster had occurred earlier in the year, and became the subject of song, story, drama, and film.) November 29: As many folks get ready for Christmas, many Christmas-themed works are also almost ready to join the public domain in 33 days. One is The Holly Hedge, and Other Christmas Stories by Temple Bailey. More on the book & author. #PublicDomainDayCountdown November 30: In 1925 John Maynard Keynes published The Economic Consequences of Sterling Parity objecting to Winston Churchill returning the UK to the gold standard. That policy ended in 1931; the book’s US copyright lasted longer, but will finally end in 32 days. #PublicDomainDayCountdown December 1: Du Bose Heyward’s novel Porgy has a distinguished legacy of adaptations, including a 1927 Broadway play, and Gershwin’s opera “Porgy and Bess”. When the book joins the public domain a month from now, further adaptation possibilities are limitless. #PublicDomainDayCountdown December 2: In Dorothy Black’s Romance — The Loveliest Thing a young Englishwoman “inherits a small sum of money, buys a motor car and goes off in search of adventure and romance”. First serialized in Ladies’ Home Journal, it joins the public domain in 30 days. #PublicDomainDayCountdown December 3: Joseph Conrad was born on this day in 1857, and died in 1924, leaving unfinished his Napoleonic novel Suspense. But it was still far enough along to get serialized in magazines and published as a book in 1925, and it joins the public domain in 29 days. #PublicDomainDayCountdown December 4: Ernest Hemingway’s first US-published story collection In Our Time introduced his distinctive style to an American audience that came to view his books as classics of 20th century fiction: It joins the public domain in 28 days. #PublicDomainDayCountdown December 5: Libertarian author Rose Wilder Lane helped bring her mother’s “Little House” fictionalized memoirs into print. Before that, she published biographical fiction based on the life of Jack London, called He Was a Man. It joins the public domain in 27 days. #PublicDomainDayCountdown December 6: Indiana naturalist and author Gene Stratton-Porter died on this day in 1924. Her final novel, The Keeper of the Bees, was published the following year, and joins the public domain in 26 days. One review. #PublicDomainDayCountdown December 7: Willa Cather was born today in 1873. Her novel The Professor’s House depicts 1920s cultural dislocation from a different angle than F. Scott Fitzgerald’s better-known Great Gatsby. It too joins the public domain in 25 days. #PublicDomainDayCountdown December 8: The last symphony published by Finnish composer Jean Sibelius (born on this day in 1865) is described in the Grove Dictionary as his “most remarkable compositional achievement”. It joins the public domain in the US in 24 days. #PublicDomainDayCountdown December 9: When the Habsburg Empire falls, what comes next for the people & powers of Vienna? The novel Old Wine, by Phyllis Bottome (wife of the local British intelligence head) depicts a society undergoing rapid change. It joins the US public domain in 23 days. #PublicDomainDayCountdown December 10: Lewis Browne was “a world traveler, author, rabbi, former rabbi, lecturer, socialist and friend of the literary elite”. His first book, Stranger than Fiction: A Short History of the Jews, joins the public domain in 22 days. #PublicDomainDayCountdown December 11: In 1925, John Scopes was convicted for teaching evolution in Tennessee. Books explaining the science to lay audiences were popular that year, including Henshaw Ward’s Evolution for John Doe. It becomes public domain in 3 weeks. #PublicDomainDayCountdown December 12: Philadelphia artist Jean Leon Gerome Ferris was best known for his “Pageant of a Nation” paintings. Three of them, “The Birth of Pennsylvania”, “Gettysburg, 1863”, and “The Mayflower Compact”, join the public domain in 20 days. #PublicDomainDayCountdown December 13: The Queen of Cooks, and Some Kings was a memoir of London hotelier Rosa Lewis, as told to Mary Lawton. Her life story was the basis for the BBC and PBS series “The Duchess of Duke Street”. It joins the public domain in 19 days. #PublicDomainDayCountdown December 14: Today we’re celebrating new films being added to the National Film Registry. In 18 days, we can also celebrate more Registry films joining the public domain. One is The Clash of the Wolves, starring Rin Tin Tin. #PublicDomainDayCountdown December 15: Etsu Inagaki Sugimoto, daughter of a high-ranking Japanese official, moved to the US in an arranged marriage after her family fell on hard times. Her 1925 memoir, A Daughter of the Samurai, joins the public domain in 17 days. #PublicDomainDayCountdown December 16: On the Trail of Negro Folk-Songs compiled by Dorothy Scarborough assisted by Ola Lee Gulledge, has over 100 songs. Scarborough’s next of kin (not Gulledge, or any of their sources) renewed its copyright in 1953. But in 16 days, it’ll be free for all. #PublicDomainDayCountdown December 17: Virginia Woolf’s writings have been slowly entering the public domain in the US. We’ve had the first part of her Mrs. Dalloway for a while. The complete novel, and her first Common Reader essay collection, join it in 15 days. #PublicDomainDayCountdown December 18: Lovers in Quarantine with Harrison Ford sounds like a movie made for 2020, but it’s actually a 1925 silent comedy (with a different Harrison Ford). It’ll be ready to go out into the public domain after a 14-day quarantine. #PublicDomainDayCountdown December 19: Ma Rainey wrote, sang, and recorded many blues songs in a multi-decade career. Two of her songs becoming public domain in 13 days are “Shave ’em Dry” (written with William Jackson) & “Army Camp Harmony Blues” (with Hooks Tilford). #PublicDomainDayCountdown December 20: For years we’ve celebrated the works of prize-winning novelist Edith Wharton as her stories join the public domain. In 12 days, The Writing of Fiction, her book on how she writes her memorable tales, will join that company. #PublicDomainDayCountdown December 21: Albert Payson Terhune, born today in 1872, raised and wrote about dogs he kept at what’s now a public park in New Jersey. His book about Wolf, who died heroically and is buried there, will also be in the public domain in 11 days. #PublicDomainDayCountdown December 22: In the 1920s it seemed Buster Keaton could do anything involving movies. Go West, a 1925 feature film that he co-wrote, directed, co-produced, and starred in, is still enjoyed today, and it joins the public domain in 10 days. #PublicDomainDayCountdown December 23: In 9 days, not only will Theodore Dreiser’s massive novel An American Tragedy be in the public domain, but so will a lot of the raw material that went into it. Much of it is in @upennlib‘s special collections. #PublicDomainDayCountdown December 24: Johnny Gruelle, born today in 1880, created the Raggedy Ann doll, and a series of books sold with it that went under many Christmas trees. Two of them, Raggedy Ann’s Alphabet Book and Raggedy Ann’s Wishing Pebble, join the public domain in 8 days. #PublicDomainDayCountdown December 25: Written in Hebrew by Joseph Klausner, translated into English by Anglican priest Herbert Danby, Jesus of Nazareth reviewed Jesus’s life and teachings from a Jewish perspective. It made a stir when published in 1925, & joins the public domain in 7 days. #PublicDomainDayCountdown December 26: “It’s a travesty that this wonderful, hilarious, insightful book lives under the inconceivably large shadow cast by The Great Gatsby.” A review of Anita Loos’s Gentlemen Prefer Blondes, also joining the public domain in 6 days. #PublicDomainDayCountdown December 27: “On revisiting Manhattan Transfer, I came away with an appreciation not just for the breadth of its ambition, but also for the genius of its representation.” A review of the John Dos Passos novel becoming public domain in 5 days. #PublicDomainDayCountdown December 28: All too often legal systems and bureaucracies can be described as “Kafkaesque”. The Kafka work most known for that sense of arbitrariness and doom is Der Prozess (The Trial), reviewed here. It joins the public domain in 4 days. #PublicDomainDayCountdown December 29: Chocolate Kiddies, an African American music and dance revue that toured Europe in 1925, featured songs by Duke Ellington and Jo Trent including “Jig Walk”, “Jim Dandy”, and “With You”. They join the public domain in 3 days. #PublicDomainDayCountdown December 30: Lon Chaney starred in 2 of the top-grossing movies of 1925. The Phantom of the Opera has long been in the public domain due to copyright nonrenewal. The Unholy Three, which was renewed, joins it in the public domain in 2 days. #PublicDomainDayCountdown (If you’re wondering why some of the other big film hits of 1925 haven’t been in this countdown, in many cases it’s also because their copyrights weren’t renewed. Or they weren’t actually copyrighted in 1925.) December 31: “…You might as well live.” Dorothy Parker published “Resumé” in 1925, and ultimately outlived most of her Algonquin Round Table-mates. This poem, and her other 1925 writing for periodicals, will be in the public domain tomorrow. #PublicDomainDayCountdown Share this: Email Print Twitter Facebook Reddit Like this: Like Loading... Related About John Mark Ockerbloom I'm a digital library strategist at the University of Pennsylvania, in Philadelphia. View all posts by John Mark Ockerbloom → This entry was posted in copyright, publicdomain. Bookmark the permalink. ← From our subjects to yours (and vice versa) Public Domain Day 2021: Honoring a lost generation → 3 Responses to Counting down to 1925 in the public domain Brent Reid says: January 12, 2021 at 10:41 am A great, useful list but it’s one year premature regarding Alfred Hitchcock’s The Pleasure Garden: https://www.brentonfilm.com/articles/alfred-hitchcock-collectors-guide-the-pleasure-garden-1925 Reply John Mark Ockerbloom says: January 12, 2021 at 2:52 pm Thanks for your comment! Determining the date of restored copyrights like this one can be tricky, since there’s often no registration that unambiguously gives a date for the start of the copyright term. If I recall correctly, my basis for assuming a 1925 start date (and therefore a 2020 end date) was a 1925 release of the film in Germany stated at places like IMDB. The article linked above disputes this release date, with the author citing a lack of contemporary evidence of general public release (either in Germany or elsewhere) prior to 1926. If the film’s US copyright term does start in 1926, as that would suggest, the film would indeed have one more year of copyright, and enter the public domain in 2022. Folks wanting to use this film before then should check the facts carefully before assuming its public domain, and I’ll add a note to my post warning about this. Thanks again! Reply Brent Reid says: January 12, 2021 at 3:51 pm You’re welcome but you can’t be expected to know every exact release or publication date, though it does highlight the danger of assuming they match the date of filming or completion. Also as per the article, it’s perhaps worth providing a little context as to what “public domain” actually entails, i.e. which copies can be used and which cannot. Leave a Reply Cancel reply Enter your comment here... Fill in your details below or click an icon to log in: Email (required) (Address never made public) Name (required) Website You are commenting using your WordPress.com account. ( Log Out / Change ) You are commenting using your Google account. ( Log Out / Change ) You are commenting using your Twitter account. ( Log Out / Change ) You are commenting using your Facebook account. ( Log Out / Change ) Cancel Connecting to %s Notify me of new comments via email. Notify me of new posts via email. Search for: RSS feed Pages About Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge Recent Posts Public Domain Day 2021: Honoring a lost generation Counting down to 1925 in the public domain From our subjects to yours (and vice versa) Everybody’s Library Questions: Finding films in the public domain Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Recent Comments Jason on Public Domain Day 2021: Honoring a lost generation John Mark Ockerbloom on Public Domain Day 2021: Honoring a lost generation Norma Bruce on Public Domain Day 2021: Honoring a lost generation Brent Reid on Counting down to 1925 in the public domain John Mark Ockerbloom on Counting down to 1925 in the public domain Archives January 2021 December 2020 March 2020 January 2020 December 2019 November 2019 October 2019 September 2019 July 2019 June 2019 January 2019 December 2018 October 2018 June 2018 January 2018 December 2017 September 2017 January 2017 October 2016 September 2016 July 2016 May 2016 January 2016 January 2015 June 2014 January 2014 October 2013 August 2013 April 2013 March 2013 February 2013 January 2013 December 2012 July 2012 May 2012 January 2012 October 2011 September 2011 June 2011 May 2011 April 2011 January 2011 December 2010 November 2010 October 2010 September 2010 August 2010 July 2010 June 2010 May 2010 April 2010 March 2010 February 2010 January 2010 December 2009 October 2009 September 2009 August 2009 July 2009 June 2009 May 2009 April 2009 March 2009 January 2009 December 2008 November 2008 October 2008 September 2008 August 2008 July 2008 June 2008 May 2008 April 2008 March 2008 February 2008 January 2008 December 2007 November 2007 Access for all Open Access News Copyrights and wrongs Copyfight Copyright & Fair Use Freedom to Tinker Lawrence Lessig General library-related news and comment LISNews TeleRead Interesting folks Jessamyn West John Scalzi Jonathan Rochkind K. G. Schneider Karen Coyle Lawrence Lessig Leslie Johnston Library Loon Lorcan Dempsey Paul Courant Peter Brantley Walt Crawford Metadata and friends Planet Cataloging Shiny tech Boing Boing O’Reilly Radar Planet Code4lib Tales from the repository RepositoryMan Writing and publishing if:book Making Light Publishing Frontier Everybody's Libraries Blog at WordPress.com. Send to Email Address Your Name Your Email Address Cancel Post was not sent - check your email addresses! Email check failed, please try again Sorry, your blog cannot share posts by email. %d bloggers like this:
everybodyslibraries-com-9241 ---- Public Domain Day advent calendar #30: In the Orchard by Virginia Woolf | Everybody's Libraries Everybody's Libraries Libraries for everyone, by everyone, shared with everyone, about everything Skip to content Home About About the Free Decimal Correspondence Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge ← Public Domain Day advent calendar #29: Success by A. A. Milne Public Domain Day advent calendar #31: New Hampshire by Robert Frost → Public Domain Day advent calendar #30: In the Orchard by Virginia Woolf Posted on December 30, 2018 by John Mark Ockerbloom “The world broke in two in 1922 or thereabouts,” Willa Cather wrote in a preface to a 1936 collection of essays. Many read her remark as referring to major changes in literary forms and styles underway in the early 1920s, particularly the rise of modernist and experimental literature. We’ve already looked at Jean Toomer’s Cane, a 1923 novel using some of those new styles, in a previous calendar entry. In that same year, Virginia Woolf published two short stories still read today as key examples of modernist literature, employing stream-of-consciousness techniques to illuminate a slice of their main characters’ lives. One of those stories will join the US public domain the day after tomorrow. The other one is already there. The story already in the public domain is “Mrs. Dalloway in Bond Street”, which relates a shopping trip of the title character and the thoughts and memories she experiences while going out to buy gloves. Much of what action exists in the story is internal or told in flashback, though the surface narration includes a “violent explosion” at the end whose nature is not made clear in the short story. Woolf later reworked and expanded this short story into the book Mrs. Dalloway, which was published in 1925, and will remain under copyright in the US for a couple of years longer. Mrs. Dalloway’s original 1923 short story, however, is already in the public domain. It was first published in the July 1923 issue of the American literary magazine The Dial, and there was no copyright renewal filed either for the magazine issue or for the story. (There was a renewal filed in 1953 for the 1925 book, but that renewal is too late to cover the 1923 story.) “Mrs. Dalloway in Bond Street” takes place over a small portion of a day. “In the Orchard” features an even shorter slice of life: only about a second, when the main character lies in a chair outdoors on the verge of sleep, and then leaps up exclaiming “Oh, I shall be late for tea!” But as in Mrs. Dalloway’s story, the main point is not the outward action, but a depiction of all that goes on around her, and in her own thoughts. Woolf’s shifts of perspective from Miranda lying in her chair to things happening above her and around her are reminiscent of a wide-scene painting or a cinematic pan and zoom, though the narrative relates a combination of sounds, sights and thoughts that a painting or a film can only partially convey. “In the Orchard” was first published in the April 1923 issue of The Criterion, a British literary magazine. Again, there’s no renewal for the magazine issue or for the short story. But this story, unlike “Mrs. Dalloway in Bond Street” is still under copyright in the US, at least for two more days. Why the difference? The reason is a trade agreement that the US made, and enacted into law, to exempt many works first published abroad from copyright formality requirements such as registration, renewal, and notice. (I alluded to this exemption in a previous calendar entry.) Eligible works were not only exempted from such requirements, but retroactively brought back into copyright, if they would still be under copyright as registered and renewed works. The Copyright Office’s Circular 38A describes in detail the rules of eligibility for copyright restoration. Here’s how they apply to these stories: Virginia Woolf was British, and her works were under copyright protection in Britain in 1996, when the copyright restorations went into effect. So works of hers that were first published outside the US at least 30 days before their first US publication are eligible for restoration. As I mentioned, The Criterion, where “In the Orchard” first appeared, was published in the UK (and not, to my knowledge, in the US). The first US publication of the story that I’m aware of, in the September 1923 issue of the American magazine Broom, was more than 30 days after the April 1923 Criterion, so copyright restoration applies. On the other hand, because “Mrs. Dalloway in Bond Street”, was first published in the US magazine The Dial, that story is not eligible for copyright restoration. In this case, the difference will be moot in two days, when “In the Orchard” joins “Mrs. Dalloway in Bond Street” in the public domain at the completion of its full 95-year term. If you haven’t read this story before, or aren’t sure you’d like its style of literature, you’ll have a good opportunity to check out this brief story then, for a little expenditure of time, and no expenditure of money. We’ve almost reached the end of this Public Domain Day advent calendar. If you’d like to continue reading about public domain works in the new year, though, I recommend checking out The Public Domain Review. It regularly publishes essays about all manner of public domain works, both those newly arrived there and those that have been there for a while. The authors of the essays are generally experts on the works they write about, and can also spend more time discussing the works and their contexts than I do here. If you’re already a fan of the Public Domain Review, you may want to consider supporting it by buying some of its merchandise or making a donation. One of that site’s regular features is an annual review of some of what’s coming into the public domain, both in the US and in other countries, in the coming year. The latest in this series, Class of 2019, has just been posted, and includes a mention of the Woolf story featured in this post. 2019 update: Link to full text of “In the Orchard” as published in the September 1923 issue of Broom, now in the US public domain, courtesy of the Blue Mountain Project Share this: Email Print Twitter Facebook Reddit Like this: Like Loading... Related About John Mark Ockerbloom I'm a digital library strategist at the University of Pennsylvania, in Philadelphia. View all posts by John Mark Ockerbloom → This entry was posted in adventcalendar. Bookmark the permalink. ← Public Domain Day advent calendar #29: Success by A. A. Milne Public Domain Day advent calendar #31: New Hampshire by Robert Frost → Search for: RSS feed Pages About Free Decimal Correspondence ILS services for discovery applications John Mark Ockerbloom The Metadata Challenge Recent Posts Public Domain Day 2021: Honoring a lost generation Counting down to 1925 in the public domain From our subjects to yours (and vice versa) Everybody’s Library Questions: Finding films in the public domain Build a better registry: My intended comments to the Library of Congress on the next Register of Copyrights Recent Comments Jason on Public Domain Day 2021: Honoring a lost generation John Mark Ockerbloom on Public Domain Day 2021: Honoring a lost generation Norma Bruce on Public Domain Day 2021: Honoring a lost generation Brent Reid on Counting down to 1925 in the public domain John Mark Ockerbloom on Counting down to 1925 in the public domain Archives January 2021 December 2020 March 2020 January 2020 December 2019 November 2019 October 2019 September 2019 July 2019 June 2019 January 2019 December 2018 October 2018 June 2018 January 2018 December 2017 September 2017 January 2017 October 2016 September 2016 July 2016 May 2016 January 2016 January 2015 June 2014 January 2014 October 2013 August 2013 April 2013 March 2013 February 2013 January 2013 December 2012 July 2012 May 2012 January 2012 October 2011 September 2011 June 2011 May 2011 April 2011 January 2011 December 2010 November 2010 October 2010 September 2010 August 2010 July 2010 June 2010 May 2010 April 2010 March 2010 February 2010 January 2010 December 2009 October 2009 September 2009 August 2009 July 2009 June 2009 May 2009 April 2009 March 2009 January 2009 December 2008 November 2008 October 2008 September 2008 August 2008 July 2008 June 2008 May 2008 April 2008 March 2008 February 2008 January 2008 December 2007 November 2007 Access for all Open Access News Copyrights and wrongs Copyfight Copyright & Fair Use Freedom to Tinker Lawrence Lessig General library-related news and comment LISNews TeleRead Interesting folks Jessamyn West John Scalzi Jonathan Rochkind K. G. Schneider Karen Coyle Lawrence Lessig Leslie Johnston Library Loon Lorcan Dempsey Paul Courant Peter Brantley Walt Crawford Metadata and friends Planet Cataloging Shiny tech Boing Boing O’Reilly Radar Planet Code4lib Tales from the repository RepositoryMan Writing and publishing if:book Making Light Publishing Frontier Everybody's Libraries Blog at WordPress.com. Send to Email Address Your Name Your Email Address Cancel Post was not sent - check your email addresses! Email check failed, please try again Sorry, your blog cannot share posts by email. %d bloggers like this:
faillab-wordpress-com-9143 ---- Fail!lab Fail!lab technology, libraries and the future! Luddites, Trumpism and Change: A crossroads for libraries “Globalization is a proxy for technology-powered capitalism, which tends to reward fewer and fewer members of society.” – Om Malik Corner someone and they will react. We may be seeing this across the world as change, globalization, technology and economic dislocation force more and more people into the corner of benefit-nots. They are reacting out […] Is 3D Printing Dying? Inc.’s John Brandon recently wrote about The Slow, Sad, and Ultimately Predictable Decline of 3D Printing. Uh, not so fast. 3D Printing is just getting started. For libraries whose adopted mission is to introduce people to emerging technologies, this is a fantastic opportunity to do so. But it has to be done right. Another dead […] The State of the Library Website T’was a time when the Library Website was an abomination. Those dark days have lightened significantly. But new clouds have appeared on the horizon. Darkest Before the Dawn In the dark ages of Library Websites, users suffered under UX regimes that were rigid, unhelpful and confusing. This was before responsive design became a standard in […] Virtual Realty is Getting Real in the Library My library just received three Samsung S7 devices with Gear VR goggles. We put them to work right away. The first thought I had was: Wow, this will change everything. My second thought was: Wow, I can’t wait for Apple to make a VR device! The Samsung Gear VR experience is grainy and fraught with […] W3C’s CSS Framework Review I’m a longtime Bootstrap fan, but recently I cheated on my old framework. Now I’m all excited by the W3C’s new framework. Like Bootstrap, the W3C’s framework comes with lots of nifty utilities and plug and play classes and UI features. Even if you have a good CMS, you’ll find many of their code libraries […] AI First Looking to the future, the next big step will be for the very concept of the “device” to fade away. Over time, the computer itself—whatever its form factor—will be an intelligent assistant helping you through your day. We will move from mobile first to an AI first world. Google Founder’s Letter, April 2016 My Library […] Google Analytics and Privacy Collecting web usage data through services like Google Analytics is a top priority for any library. But what about user privacy? Most libraries (and websites for that matter) lean on Google Analytics to measure website usage and learn about how people access their online content. It’s a great tool. You can learn about where people […] The L Word I’ve been working with my team on a vision document for what we want our future digital library platform to look like. This exercise keeps bringing us back to defining the library of the future. And that means addressing the very use of the term, ‘Library.’ When I first exited my library (and information science) […] Locking Down Windows I’ve recently moved Back to Windows for my desktop computing. But Windows 10 comes with enormous privacy and security issues that people need to take into account…and get under a semblance of control. Here’s how I did it. There has been much written on this subject, so what I’m including here is more of a […] Killer Apps & Hacks for Windows 10 Did the UX people at Microsoft ever test Windows 10? Here are some must have apps and hacks I’ve found to make life on Windows 10 quick and easy. Set Hotkeys for Apps Sometimes you just want to launch an app from your keyboard. Using a method on Laptopmag.com, you can do this for most […]
faillab-wordpress-com-9248 ---- Fail!lab | technology, libraries and the future! Fail!lab technology, libraries and the future! Menu Skip to content Home About Luddites, Trumpism and Change: A crossroads for libraries Posted on December 6, 2016 by mryanhess “Globalization is a proxy for technology-powered capitalism, which tends to reward fewer and fewer members of society.” – Om Malik Corner someone and they will react. We may be seeing this across the world as change, globalization, technology and economic dislocation force more and more people into the corner of benefit-nots. They are reacting out of desperation. It’s not rational. It’s not pretty. But it shouldn’t be surprising. Years ago at a library conference, one of the keynote speakers forecast that there would be a return to the analog (sorry my Twitter-based memory does not identify the person). The rapidity of digitization would be met by a reaction. People would scurry back to the familiar, he said. They always do. Fast forward to 2016, where the decades-long trends toward globalization, borderless labor markets, denationalization, exponential technological change and corresponding social revolutions has hit the wall of public reaction. Brexit. Global Trumpism. Call it what you will. We’re in a change moment. The reaction is here. Reacting to the Reaction People in the Blue Zones, the Technorati, the beneficiaries of cheap foreign labor, free trade and technological innovation are scratching their heads. For all their algorithms and AI, they didn’t see this coming. Everything looked good on their feeds. No danger could possibly burst their self-assured bubble of inevitability. All was quiet. It was like a clear blue, September 2001, morning in New York City. It was like the boardroom in the Federal Reserve in 2006. The serenity was over in an instant. Since Brexit, and then Trump’s election, the Glittery Digitarians have initiated a period of introspection. They’re looking up from their stock tickers and gold-plated smart watches to find a grim reality: the world is crowded with people that have lost much ground at the expense of the global maelstrom that has elevated a very small, lucky few to greatness. They are now seeing, as for the first time, the shuttered towns. The empty retail stores. The displaced and homeless. Suddenly their confident talk of personal AI assistants has turned from technolust to terror. Their success suddenly looks short-sighted. Om Malik wrote in his recent New Yorker op-ed, that Silicon Valley may soon find itself equated with the super villains on Wall Street. He posits that a new business model needs to account for the public good…or else. I recently read Throwing Rocks at the Google Bus: How Growth Became the Enemy of Prosperity by Douglas Rushkoff. If you haven’t read it, now would be a good time. Like Bernie Sanders and others, Rushkoff has been warning of this kind of reaction for awhile. The system is not designed for the public good, but only around a narrow set of shareholder requirements. All other considerations do not compute. My Reaction Let me put this in personal perspective. In my work, I engage the public in “the heart of Silicon Valley” on what they want from their community and what’s missing. What I hear is concern about the loss of quiet, of connection to others, of a pace of life that is not 24/7 always a click away. This is consistent. People feel overwhelmed. As one of the chief technologists for my library, this puts me in a strange place. And I’ve been grappling with it for the past few months. On the one hand, people are curious. They’re happy to try the next big thing. But you also hear the frustration. Meanwhile, the burden of the Tech Industry is more than inflated rents and traffic. There’s a very obvious divide between long-time residents and newcomers. There’s a sense that something has been lost. There’s anger too, even here in the shadow of Google and Facebook. The Library as a Philosophy The other day, I was visited by a Eurpean Library Director who wanted to talk about VR. He asked me where I thought we’d be in ten years. I hesitated. My thoughts immediately went back to the words of despair that I’d been hearing from the public lately. Of course, the genie’s out of the bottle. We can’t stop the digital era. VR interface revolutions will likely emerge. The robots will come. But we can harness this change to our benefit. We can add rules to heal it to our collective needs. This is where the Library comes in. We have a sharing culture. A model that values bridging divides, pooling resources and re-distributing knowledge. It’s a model that is practically unique to the library if you think about it. As I read Rushkoff, I kept coming back to the Librarian’s philosophy on sharing. In his book, he contends that we need to re-imagine (re-code) our economy to work for people. He recalls technologies like HTTP and RSS which were invented and then given away to the world to share and re-use. This sounded very ‘librarian’ to me. We share knowledge in the form of access to technology, after all. We host training on new maker gear, coding, robotics, virtual reality. Perhaps we need to double-down on this philosophy. Perhaps, we can be more than just a bridge. Maybe we can be the engine driving our communities to the other side. We can not just advocate, but do. Have a hackathon? Build a public alternative to the Airbnb app to be used by people in your town. Know the Future In the end, libraires, technologists and digitarians need to tell a better story. We need to get outside our bubbles and tell that story with words that resonate with the benefit-nots. And more, we need that story to be backed up with real-world benefits. It starts with asking the community what kind of world they want to live it? What obstacles keep them from living that way? And then how the library and technology can help make change. We have the philosophy, we have the spaces and we have public permission. Let’s get to work. Posted in innovation, librarianship, society, technology, Uncategorized | Leave a comment Is 3D Printing Dying? Posted on October 12, 2016 by mryanhess Inc.’s John Brandon recently wrote about The Slow, Sad, and Ultimately Predictable Decline of 3D Printing. Uh, not so fast. 3D Printing is just getting started. For libraries whose adopted mission is to introduce people to emerging technologies, this is a fantastic opportunity to do so. But it has to be done right. Another dead end? Brandon cites a few reasons for his pessimism: 3D printed objects are low quality and the printers are finicky 3D printing growth is falling behind initial estimates people in manufacturing are not impressed and the costs are too high I won’t get into all that’s wrong with this analysis, as I feel like most of it is incorrect, or at the very least, a temporary problem typical of a new technology. Instead, I’d like to discuss this in the library maker context. And in fact, you can apply these ideas to any tech project. How to make failure a win—no matter what Libraries are quick to jump on tech. Remember those QR Codes that would revolutionize mobile access? Did your library consider a Second Life branch? How about those Chromebooks! Inevitably, these experiments are going to fail. But that’s okay. As this blog often suggests, failure is a win when doing so teaches you something. Experimenting is the first step in the process of discovery. And that’s really what all these kinds of projects need to be. In the case of a 3D Printing project at your library, it’s important to keep this notion front and center. A 3D Printing pilot with the goal of introducing the public to the technology can be successful if people simply try it out. That seems easy enough. But to be really successful, even this kind of basic 3D Printing project needs to have a fair amount of up-front planning attached to it. Chicago Public Library created a successful Maker Lab. Their program was pretty simple: Hold regular classes showing people how to use the 3D printers and then allow those that completed the introductory course to use the printers in open studio lab times. When I tried this out at CPL, it was quite difficult to get a spot in the class due to popularity. The grant-funded project was so successful, based on the number of attendees, that it was extended and continues to this day. As a grant-funded endeavor, CPL likely wrote out the specifics before any money was handed over. But even an internally-funded project should do this. Keep the goals simple and clear so expectations on the front line match those up the chain of command. Figure out what your measurements of success are before you even purchase the first printer. Be realistic. Always document everything. And return to that documentation throughout the project’s timeline. Taking it to the next level San Diego Public Library is an example of a Maker Project that went to the next level. Uyen Tran saw an opportunity to merge startup seminars with their maker tools at her library. She brought aspiring entrepreneurs into her library for a Startup Weekend event where budding innovators learned how the library could be a resource for them as they launched their companies. 3D printers were part of this successful program. It’s important to note that Uyen already had the maker lab in place before she launched this project. And it would be risky for a library to skip the establishment of a rudimentary 3D printer program before trying for this more ambitious program. But it could be done if that library was well organized with solid project managers and deep roots in the target community. But that’s a tall order to fill. What’s the worst thing that could go wrong? The worst thing that could go wrong is doubling down on failure: repeating one failed project after another without changing the flawed approach behind it. I’d also add that libraries are often out ahead of the public on these technologies, so dead ends are inevitable. To address this, I would also add one more tactic to your tech projects: listening. The public has lots of concerns about a variety of things. If you ask them, they’ll tell you all about them. Many of their concerns are directly related to libraries, but we can often help. We have permission to do so. People trust us. It’s a great position to be in. But we have to ask them to tell us what’s on their mind. We have to listen. And then we need to think creatively. Listening and thinking outside the box was how San Diego took their 3D Printers to the next level. The Long Future of 3D Printing The Wright Brothers first flight managed only 120 feet in the air. A year later, they flew 24 miles. These initial attempts looked nothing like the jet age and yet the technology of flight was born from these humble experiments. Already, 3D printing is being adopted in multiple industries. Artists are using it to prototype their designs. Astronauts are using it to print parts aboard the International Space Station. Bio-engineers are now looking at printing stem-cell structures to replace organs and bones. We’re decades away from the jet age of 3D printing, but this tech is here to stay. John Brandon’s read is incorrect simply because he’s looking at the current state and not seeing the long-term promise. When he asks a Ford engineer for his take on 3D Printing in the assembly process, he gets a smirk. Not a hotbed of innovation. What kind of reaction would he have gotten from an engineer at Tesla? At Apple? Fundamentally, he’s approaching 3D Printers from the wrong perspective and this is why it looks doomed. Libraries should not make this mistake. The world is changing ever more quickly and the public needs us to help them navigate the new frontier. We need to do this methodically, with careful planning and a good dose of optimism. Posted in innovation, technology | Tagged 3D printing, innovation, project planning | 2 Comments The State of the Library Website Posted on September 28, 2016 by mryanhess T’was a time when the Library Website was an abomination. Those dark days have lightened significantly. But new clouds have appeared on the horizon. Darkest Before the Dawn In the dark ages of Library Websites, users suffered under UX regimes that were rigid, unhelpful and confusing. This was before responsive design became a standard in the library world. It was before search engine optimization started to creep into Library meetings. It was before user experience became an actual librarian job title. We’ve come a long way since I wrote The Ugly Truth About Library Websites. Most libraries have evolved beyond the old “website as pamphlet” paradigm to one that is dynamic and focused on user tasks. Public libraries have deployed platforms like BiblioCommons to serve responsive, task-oriented interfaces that integrate their catalogs, programming and website into a single social platform. Books, digital resources, programs and even loanable equipment are all accessible via a single search. What’s more, the critical social networking aspects of library life are also embedded along the user’s path. Celebrated examples of this integrated solution include the San Francisco Public Library and Chicago Public Library. Queens is also hard at work to develop a custom solution. In the academic realm, libraries have turned to unified discovery layers like WorldCat Discovery and EBSCO Discovery Service to simplify (Googlize) the research process. These systems put a single-search box front and center that access resources on the shelf, but also all those electronic resources that make up the bulk of academic budgets. And while there are still many laggards, few libraries ignore these problems outright. The Storm Ahead While the general state of online library interfaces has improved, the unforgiving, hyperbolic curve of change continues to press forward. And libraries cannot stay put. Indeed, we need to quicken our pace and prepare our organizations for ongoing recalibration as the tempo of change increases. The biggest problem for library websites, is that there is little future for the library website. That’s because people will get less and less information through web browsers. Indeed, consider how often you use a web browser on your phone versus an app. Developments in AI, Augmented Reality and Virtual Reality will compound that trend. If you’re like Chris Milk, videographer and VR evangelist, you see the writing on the wall. The modes of how we experience information are about to undergo a fundamental revolution. Milk likens the current state of VR to the old black and white silent films at the dawn of motion pictures. I’d extend this line of thinking to the web page. Within a decade or two, I expect people will look back on web pages as a brief, transitory medium bridging print information to linked data. And as our AI, VR and AR technologies take off, they will liberate information from the old print paradigms altogether. In short, people will interact with information in more direct ways. They will ask a computer to provide them the answer. They will virtually travel to a “space” where they can experience the information they seek. Get Ready to Re-invent the Library…again So where does the library fit into this virtualized and automated future? One possibility is that the good work to transform library data into linked data will enable us to survive this revolution. In fact, it may be our best hope. Another hope is that we continue to emphasize the library as a social space for people to come together around ideas. Whether its a virtual library space or a physical one, the library can be the place in both local and global communities where people meet their universal thirst for connecting with others. The modes of those ideas (books, ebooks, videos, games) will matter far less than the act of connecting. In a sense, you could define the future online library as something between an MMORPG, Meetup.com and the TED conference. So, the library website is vastly improved, but we won’t have long to rest on our laurels. Ready Player One? Put on your VR goggles. Call up Siri. Start rethinking everything you know about the Library website. Posted in information architecture, librarianship | Tagged internet, libraries, user experience, web design, websites | 1 Comment Virtual Realty is Getting Real in the Library Posted on June 20, 2016 by mryanhess My library just received three Samsung S7 devices with Gear VR goggles. We put them to work right away. The first thought I had was: Wow, this will change everything. My second thought was: Wow, I can’t wait for Apple to make a VR device! The Samsung Gear VR experience is grainy and fraught with limitations, but you can see the potential right away. The virtual reality is, after all, working off a smartphone. There is no high-end graphics card working under the hood. Really, the goggles are just a plastic case holding the phone up to your eyes. But still, despite all this, it’s amazing. Within twenty-four hours, I’d surfed beside the world’s top surfers on giant waves off Hawaii, hung out with the Masai in Africa and shared an intimate moment with a pianist and his dog in their (New York?) apartment. It was all beautiful. We’ve Been Here Before Remember when the Internet came online? If you’re old enough, you’ll recall the crude attempts to chat on digital bulletin board systems (BBS) or, much later, the publication of the first colorful (often jarringly so) HTML pages. It’s the Hello World! moment for VR now. People are just getting started. You can tell the content currently available is just scratching the surface of potentialities for this medium. But once you try VR and consider the ways it can be used, you start to realize nothing will be the same again. The Internet Will Disappear So said Google CEO Erik Schmidt in 2015. He was talking about the rise of AI, wearable tech and many other emerging technologies that will transform how we access data. For Schmidt, the Internet will simply fade into these technologies to the point that it will be unrecognizable. I agree. But being primarily a web librarian, I’m mostly concerned with how new technologies will translate in the library context. What will VR mean for library websites, online catalogs, eBooks, databases and the social networking aspects of libraries. So after trying out VR, I was already thinking about all this. Here are some brief thoughts: Visiting the library stacks in VR could transform the online catalog experience Library programming could break out of the physical world (virtual speakers, virtual locations) VR book discussions could incorporate virtual tours of topics/locations touched on in books Collections of VR experiences could become a new source for local collections VR maker spaces and tools for creatives to create VR experiences/objects Year Zero? Still, VR makes your eyes tired. It’s not perfect. It has a long way to go. But based on my experience sharing this technology with others, it’s addictive. People love trying it. They can’t stop talking about it afterward. So, while it may be some time before the VR revolution disrupts the Internet (and virtual library services with it), it sure feels imminent. Posted in innovation, librarianship, technology | Tagged gear vr, internet, oculus, samsung, virtual reality, vr | Leave a comment W3C’s CSS Framework Review Posted on May 10, 2016 by mryanhess I’m a longtime Bootstrap fan, but recently I cheated on my old framework. Now I’m all excited by the W3C’s new framework. Like Bootstrap, the W3C’s framework comes with lots of nifty utilities and plug and play classes and UI features. Even if you have a good CMS, you’ll find many of their code libraries quite handy. And if you’re CMS-deficient, this framework will save you time and headaches! Why a Framework? Frameworks are great for saving time. You don’t have to reinvent the wheel for standard UI chunks like navigation, image positioning, responsive design, etc. All you need to do is reference the framework in your code and you can start calling the classes to make your site pop. And this is really great since not all well-meaning web teams have an eye for good design. Most quality frameworks look really nice, and they get updated periodically to keep up with design trends. And coming from this well-known standards body, you can also be assured that the W3C’s framework complies with all the nitty-gritty standards all websites should aspire to. Things to Love Some of the things I fell in love with include: CSS-driven navigation menus. There’s really no good reason to rely on JavaScript for a responsive, interactive navigation menu. The W3C agrees. Icon support. This framework allows you to choose from three popular icon sets to bring icons right into your interface. Image support: Lots of great image styling including circular cropping, shadowing, etc. Cards. Gotta love cards in your websites and this framework has some very nice looking card designs for you to use. Built-in colors. Nuff sed. Animations. There are plenty of other nice touches like buttons that lift off the screen, elements that drop into place and much more. I give it a big thumbs up! Check it out at the W3C.org. Posted in reviews | Tagged css, frameworks, w3c, web design | 1 Comment AI First Posted on May 2, 2016 by mryanhess Looking to the future, the next big step will be for the very concept of the “device” to fade away. Over time, the computer itself—whatever its form factor—will be an intelligent assistant helping you through your day. We will move from mobile first to an AI first world. Google Founder’s Letter, April 2016 My Library recently finalized a Vision Document for our virtual library presence. Happily, our vision was aligned with the long-term direction of technology as understood by movers and shakers like Google. As I’ve written previously, the Library Website will disappear. But this is because the Internet (as we currently understand it) will also disappear. In its place, a new mode of information retrieval and creation will move us away from the paper-based metaphor of web pages. Information will be more ubiquitous. It will be more free-form, more adaptable, more contextualized, more interactive. Part of this is already underway. For example, people are becoming a data set. And other apps are learning about you and changing how they work based on who you are. Your personal data set contains location data, patterns in speech and movement around the world, consumer history, keywords particular to your interests, associations based on your social networks, etc. AI Emerging All of this information makes it possible for emerging AI systems like Siri and Cortana to better serve you. Soon, it will allow AI to control the flow of information based on your mood and other factors to help you be more productive. And like a good friend that knows you very, very well, AI will even be able to alert you to serendipitous events or inconveniences so that you can navigate life more happily. People’s expectations are already being set for this kind of experience. Perhaps you’ve noticed yourself getting annoyed when your personal assistant just fetches a Wikipedia article when you ask it something. You’re left wanting. What we want is that kernel of gold we asked about. But what we get right now, is something too general to be useful. But soon, that will all change. Nascent AI will soon be able to provide exactly the piece of information that you really want rather than a generalized web page. This is what Google means when they make statements like “AI First” or “the Web will die.” They’re talking about a world where information is not only presented as article-like web pages, but broken down into actual kernels of information that are both discrete and yet interconnected. AI First in the Library Library discussions often focus on building better web pages or navigation menus or providing responsive websites. But the conversation we need to have is about pulling our data out of siloed systems and websites and making it available to all modes like AI, apps and basic data harvesters. You hear this conversation in bits and pieces. The ongoing linked data project is part of this long-term strategy. So too with next-gen OPACs. But on the ground, in our local strategy meetings, we need to tie every big project we do to this emerging reality where web browsers are increasingly no longer relevant. We need to think AI First. Posted in librarianship, society, tech industry | Tagged artificial intelligence, google, internet, libraries, linked data | Leave a comment Google Analytics and Privacy Posted on April 27, 2016 by mryanhess Collecting web usage data through services like Google Analytics is a top priority for any library. But what about user privacy? Most libraries (and websites for that matter) lean on Google Analytics to measure website usage and learn about how people access their online content. It’s a great tool. You can learn about where people are coming from (the geolocation of their IP addresses anyway), what devices, browsers and operating systems they are using. You can learn about how big their screen is. You can identify your top pages and much much more. Google Analytics is really indispensable for any organization with an online presence. But then there’s the privacy issue. Is Google Analytics a Privacy Concern? The question is often asked, what personal information is Google Analytics actually collecting? And then, how does this data collection jive with our organization’s privacy policies. It turns out, as a user of Google Analytics, you’ve already agreed to publish a privacy document on your site outlining the why and what of your analytics program. So if you haven’t done so, you probably should if only for the sake of transparency. Personally Identifiable Data Fact is, if someone really wanted to learn about a particular person, it’s not entirely outside the realm of possibility that they could glean a limited set of personal attributes from the generally anonymized data Google Analytics collects. IP addresses can be loosely linked to people. If you wanted to, you could set up filters in Google Analytics that look at a single IP. Of course, on the Google side, any user that is logged into their Gmail, YouTube or other Google account, is already being tracked and identified by Google. This is a broadly underappreciated fact. And it’s a critical one when it comes to how approach the question of dealing with the privacy issue. In both the case of what your organization collects with Google Analytics and what all those web trackers, including Google’s trackers, collect, the onus falls entirely on the user. The Internet is Public Over the years, the Internet has become a public space and users of the Web should understand it as such. Everything you do, is recorded and seen. Companies like Google, Facebook, Mircosoft, Yahoo! and many, many others are all in the data mining business. Carriers and Internet Service Providers are also in this game. They deploy technologies in websites that identify you and then sell what your interests, shopping habits, web searches and other activities are to companies interested in selling to you. They’ve made billions on selling your data. Ever done a search on Google and then seen ads all over the Web trying to sell you that thing you searched last week? That’s the tracking at work. Only You Can Prevent Data Fires The good news is that with little effort, individuals can stop most (but not all) of the data collection. Browsers like Chrome and Firefox have plugins like Ghostery, Avast and many others that will block trackers. Google Analytics can be stopped cold by these plugins. But it won’t solve all the problems. Users also need to set up their browsers to delete cookies websites save to their browsers. And moving off of accounts provided from data mining companies “for free” like Facebook accounts, Gmail and Google.com can also help. But you’ll never be completely anonymous. Super cookies are a thing and are very difficult to stop without breaking websites. And some trackers are required in order to load content. So sometimes you need to pay with your data to play. Policies for Privacy Conscious Libraries All of this means that libraries wishing to be transparent and honest about their data collection, need to also contextualize the information in the broader data mining debate. First and foremost, we need to educate our users on what it means to go online. We need to let them know its their responsibility alone to control their own data. And we need to provide instructions on doing so. Unfortunately, this isn’t an opt-in model. That’s too bad. It actually would be great if the world worked that way. But don’t expect the moneyed interests involved in data mining to allow the US Congress to pass anything that cuts into their bottom line. This ain’t Germany, after all. There are ways with a little javascript to create a temporary opt-in/opt-out feature to your site. This will toggle tags added by Google Tag Manager on and off with a single click. But let’s be honest. Most people will ignore it. And if they do opt-out, it will be very easy for them to overlook everytime without a much more robust opt-in/opt-out functionality baked in to your site. But for most sites and users, this is asking alot. Meanwhile, it diverts attention from the real solution: users concerned about privacy need to protect themselves and not take a given websites word for it. We actually do our users a service by going with the opt-out model. This underlines the larger privacy problems on the Wild Wild Web, which our sites are a part of. Posted in online security & privacy, society | Tagged data mining, google analytics, online security & privacy | 2 Comments The L Word Posted on March 21, 2016 by mryanhess I’ve been working with my team on a vision document for what we want our future digital library platform to look like. This exercise keeps bringing us back to defining the library of the future. And that means addressing the very use of the term, ‘Library.’ When I first exited my library (and information science) program, I was hired by Adobe Systems to work in a team of other librarians. My manager warned us against using the word ‘Librarian’ among our non-librarian colleagues. I think the gist was: too much baggage there. So, we used the word ‘Information Specialist.’ Fast forward a few years to my time in an academic environment at DePaul University Library and this topic came up in the context of services the library provided. Faculty and students associated the library in very traditional ways: a quiet, book-filled space. But the way they used the library was changing despite the lag in their semantic understanding. The space and the virtual tools we put in place online helped users not only find and evaluate information, but also create, organize and share information. A case in point was our adoption of digital publishing tools like Bepress and Omeka, but also the Scholar’s Lab. I’m seeing a similar contradiction in the public library space. Say library and people think books. Walk into a public library and people do games, meetings, trainings and any number of online tasks. This disconnect between what the word ‘Library’ evokes in the mind’s eye and what it means in practice is telling. We’ve got a problem with our brand. In fact, we may need a new word. Taken literally, a library has been a word for a physical collection of written materials. The Library of Alexandria held scrolls for example. Even code developers rely on ‘libraries’ today, which are collections of materials. In every case, the emphasis is on the collection of things. Now, I’m not suggesting that we move away from books. Books are vessels for ideas and libraries will always be about ideas. In fact, this focus on ideas rather than any one mode for transmitting ideas is key. In today’s library’s people not only read about ideas, they meet to discuss ideas, they brainstorm ideas. I don’t pretend to have the magic word. In fact, maybe it’s taking so long for us to drop ‘Library’ because there is not a good word in existence. Maybe we need create a new one. One tactic that comes to mind as we navigate this terminological evolution is to retain the library, but subsume it inside of something new. I’ve seen this done to various degrees in other libraries. For example, Loyola University in Chicago built an entirely new building adjacent to the book-filled library. Administratively, the building is run by the library, but it is called the Klarchek Information Commons. In that rather marvelous space looking out over Lake Michigan, you’ll find the modern ‘library’ in all its glory. Computers, Collaboration booths, etc. I like this model for fixing our identity problem and I think it would work without throwing the baby out with the bathwater. However, its done, one thing is for sure. Our users have moved on from ‘the library’ and are left with no accurate way to describe that place that they love to go to when they want to engage with ideas. Let’s put our thinking caps on and puts a word on their lips that does justice to what the old library has become. Let’s get past the L Word. Posted in librarianship | Tagged branding, information commons | Leave a comment Locking Down Windows Posted on March 10, 2016 by mryanhess I’ve recently moved Back to Windows for my desktop computing. But Windows 10 comes with enormous privacy and security issues that people need to take into account…and get under a semblance of control. Here’s how I did it. There has been much written on this subject, so what I’m including here is more of a digest of what I’ve found elsewhere with perspective on how it worked out for me over time. Windows Tweaker This is a pretty good tool that does what Windows should do out of the box: give you one-stop access to all Windows’ settings. As it is, Windows 10 has spread out many settings, including those for Privacy, to the Settings screen as well as Registry Editor and Group Policy Editor. There are dozens of look and feel tweaks, including an easy way to force Windows to use the hidden Dark Theme. The Privacy Tab, however, is the single most important. There, you can easily turn of all the nasty privacy holes in Windows 10, such as how the OS sends things like keystrokes (that’s right!) back to Microsoft. The list of holes it will close is long: Telemetry, Biometrics, Advertising ID, Cortana, etc. Cortana Speaking of Cortana, I was really excited that this kind of virtual assistant was embedded in Windows 10. I looked forward to trying it out. But then I read the fine print. Cortana is a privacy nightmare. She can’t be trusted. She’s a blabbermouth and repeats back everything you tell her to not just Microsoft, but indirectly to all of their advertising partners. And who knows where all that data goes and how secure it is in the long run. Yuck! Turn her off. Pull the plug. Zero her out. The easiest way to disable her is to set up a Local Account. But there’s more info out there, including this at PC World. Local Account When you first install Windows 10, unplug the ethernet and shut down wifi. Then, when you’re certain that all of MSFT’s listeners can’t communicate with your machine, go through the Installation Set Up process and when asked to create/log in to your Microsoft Account, don’t. Instead, use the Local Account option. The down sides of going this route are that you can’t sync your experience, accounts and apps across devices. You also won’t be able to use Cortana. The up sides are that using a Local account means you will be far more secure and private in whatever you do with your computer (as long as you maintain the many other privacy settings). Reduce Risk and Streamline Your PC Windows 10 comes crammed with many programs you may not want. Some of these may even be tracking and sharing, so if you don’t actually use it, why not lighten the load on your system and remove them. You can do this the slow way, one app at a time, or you can use the Powershell nuclear option and kill them all at once. I did this and haven’t regretted it one bit. So fire away… Privacy Settings I won’t go into all of this. There is plenty of solid advise on reducing your exposure on other sites (like at PC World) and some lengthy YouTube videos which you can easily find. But it is critical that you go into the Settings panel and turn everything off at the very least. That’s my feeling. Some tell you that you even need to set up IP blocks to keep your machine from reporting back to Microsoft and its advertising partners. Others say this is somewhat overblown, and not unique to Windows, like over at LifeHacker, so I’ll leave it to you to decide. Conclusion It’s really too bad that operating systems have gone down this road. Our PCs should be tools for us and not the other way around. Imagine if everything that happened on your device stayed private. Imagine if it was all encrypted and nobody could hack into your PC or Microsoft’s servers or their advertisers’ databases and learn all kinds of things about you, your family, your work, your finances, your secrets. And yet, this is precisely what Microsoft (and iOS, Android and others) did, intentionally. Frankly, I think its bordering on criminal negligence, but good luck suing when your data gets exploited. Better safe than sorry…that’s my take. Do a little work and lock down your computer. Good luck out there… Posted in online security & privacy, technology | Tagged microsoft, online security & privacy, security, Windows | Leave a comment Killer Apps & Hacks for Windows 10 Posted on March 3, 2016 by mryanhess Did the UX people at Microsoft ever test Windows 10? Here are some must have apps and hacks I’ve found to make life on Windows 10 quick and easy. Set Hotkeys for Apps Sometimes you just want to launch an app from your keyboard. Using a method on Laptopmag.com, you can do this for most any program. I use this in combination with macros like those noted below. Quick Switch to VPN VPN Macro If you’re a smart and secure Internet user, you probably already use a VPN service to encrypt the data and web requests you send over the Internet (especially while on public wif-fi networks). But Windows 10 makes connecting to your VPN service a bit of a chore (I use Private Internet Access, by the way). It’s weird because Windows actually placed the Connect to VPN in the Communications Center, but you still need to click into that, then click the VPN you want and then click Connect…that’s 3 clicks if you’re counting. I’ve tried two methods to make this at least a little easier. One caveat on all of this: if you log in with an administrator account (which I don’t because I’m concerned about security after all!), you could have your VPN client launch at start, but you’d still need to click the connect button and anytime you put the machine to sleep, it would disconnect (why they do that is beyond me). With both methods, you need to manually add a VPN account to Windows built-in VPN feature. Anyway, here are my two methods: Macro Method You can record actions as a “macro” and then save it as an executable program. You can then save the program to your desktop, start or taskbar. It’s a bit of a chore and in the end, the best you get is two-click access to your VPN connection…not the one-click you would get on a Mac. If my memory serves, this method only works if you log-in with an administrator account. Otherwise, you’ll be prompted for an administrator password each time…an who wants that? Create shortcut to Settings page Add a hotkey to shortcut: Create Macro using something like JitBit that uses the new hotkey. Save as executable Create a shortcut to the desktop and pin to Start Optionally, change the icon to look pretty Pin the Communicator VPN app to your Start pane. This is actually how I ended up going in the end. To do this, you need to ‘hack’ a shortcut that points to your VPN settings panel (where the Connect button resides). On your desktop, right-click and select New > Shortcut A Shortcut wizard will open Paste ms-settings:network-vpn into the form Now pin the shortcut to your Start and you have quick access to the Connect dialog for your VPN Switch between Audio Devices Sometimes I want to jump between my speakers and my headphones and because I hate clicking and loath jumping out of Windows 10’s Metro design into the old-school looking Audio Device Controller, I followed the advice from The Windows Club. Their solution uses freeware called Audio Switcher to assign a hotkey to different audio devices. I added Audio Switcher to my startup to make this a little more automated. Unfortunately, because I normally work in a non-administrator account on Windows 10, I get asked for an Admin password to launch this app at Startup. Egads! In my case, I can now click the F1 (Headphones) and F2 (Speakers) keys to switch playback devices for sound. Overcoming the Windows Education or Windows Pro watermark Windows embeds a horrible little Windows Education or Windows Pro watermark over the lower right corner of your desktop if you use one of those versions. There are two solutions to removing this remarkably distracting bit of text. Use a white background to “disappear” the white text Or, have an app sit over that space. I use MusicBee (recommended by LifeHacker) and set position the mini-version over that spot. Supposedly there’s a Regex trick where you delete the text but that’s a bit much work for me for such a slight annoyance. Other Tricks There are a couple other tricks that I’ve used to clean up Windows. Removing Metro Apps. This allows you to remove all the built-in apps that are there simply to confound your privacy and peddle your identity to Microsoft’s advertising partners. Remove them. Removing default folders from Explorer. If you’re like me and want better performance, you use a separate hard disk drive for your music, video and images and another drive (probably an SSD) for your OS and programs. Windows 10 is confusing for people with this kind of set up by placing folders in the File Explorer to your Images, Documents, etc. on your C Drive. In my case, that’s not the right drive. So I used the method linked above to remove those from Explorer. Posted in technology | Tagged life hacks, macros, vpn, windows 10 | Leave a comment Post navigation ← Older posts Search Search Subscribe Enter your email address to subscribe to this blog and receive notifications of new posts by email. Join 150 other followers Email Address: Sign me up! Recent Luddites, Trumpism and Change: A crossroads for libraries Is 3D Printing Dying? The State of the Library Website Virtual Realty is Getting Real in the Library W3C’s CSS Framework Review Topics best practices (6) case studies (22) digital services (4) green tech (1) information architecture (13) innovation (33) international librarianship (2) librarianship (23) library management (18) online security & privacy (12) reviews (8) society (34) tech industry (21) technology (48) Uncategorized (2) Tweets RT @terraworld_work: Hello world! It's my pleasure to introduce a new project: #TerraWorld. TerraWorld is a virtual world where you can do… 18 hours ago RT @solstarterorg: Our Public TGE Whitelist will open May 11 19:30 UTC. Everyone deserves a fair chance, so we will also be distributing a… 3 months ago RT @techn0joy: I often check other library websites for design inspiration. Today, I found my very favorite stat on @UVaLibrary 's page htt… 3 years ago Archives Archives Select Month December 2016 October 2016 September 2016 June 2016 May 2016 April 2016 March 2016 January 2016 December 2015 November 2015 April 2015 February 2015 January 2015 December 2014 November 2014 September 2014 April 2014 March 2014 February 2014 November 2013 October 2013 July 2013 June 2013 May 2013 April 2013 March 2013 February 2013 January 2013 November 2012 October 2012 September 2012 August 2012 July 2012 March 2012 February 2012 January 2012 December 2011 October 2011 September 2011 August 2011 July 2011 June 2011 May 2011 April 2011 March 2011 February 2011 January 2011 December 2010 Blog at WordPress.com. Fail!lab Create a free website or blog at WordPress.com. Loading Comments... Write a Comment... Email (Required) Name (Required) Website Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use. To find out more, including how to control cookies, see here: Cookie Policy
feeds2-feedburner-com-5343 ---- <?xml version="1.0" encoding="UTF-8"?><rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" > <channel> <title>The Digital Librarian http://digitallibrarian.org Information. Organization. Access. Mon, 27 Jun 2016 19:04:01 +0000 en-US hourly 1 https://wordpress.org/?v=5.6.4 - Libraries and the state of the Internet http://digitallibrarian.org/?p=229 http://digitallibrarian.org/?p=229#respond Mon, 27 Jun 2016 12:04:01 +0000 http://digitallibrarian.org/?p=229 Libraries and the state of the Internet Read More »
]]> Mary Meeker presented her 2016 Internet Trends report earlier this month. If you want a better understanding of how tech and the tech industry is evolving, you should watch her talk and read her slides. This year’s talk was fairly time constrained, and she did not go into as much detail as she has in years past. That being said, there is still an enormous amount of value in the data she presents and the trends she identifies via that data.
Some interesting takeaways:
- The growth in total number of internet users worldwide is slowing (the year-to-year growth rate is flat; overall growth is around 7% new years per year)
- However, growth in India is still accelerating, and India is now the #2 global user market (behind China; USA is 3rd)
- Similarly, there is a slowdown in the growth of the number of smartphone users and number of smartphones being shipped worldwide (still growing, but at a slower rate)
- Android continues to demonstrate growth in marketshare; Android devices are continuing to be less costly by a significant margin than Apple devices.
- Overall, there are opportunities for businesses that innovate / increase efficiency / lower prices / create jobs
- Advertising continues to demonstrate strong growth; advertising efficacy still has a ways to go (internet advertising is effective and can be even more so)
- Internet as distribution channel continues to grow in use and importance
- Â Brand recognition is increasingly important
- Visual communication channel usage is increasing – Generation Z relies more on communicating with images than with text
- Messaging is becoming a core communication channel for business interactions in addition to social interactions
- Voice on mobile rapidly rising as important user interface – lots of activity around this
- Data as platform – important!
So, what kind of take-aways might be most useful to consider in the library context? Some top-of-head thoughts:
- In the larger context of the Internet, Libraries need to be more aggressive in marketing their brand and brand value. We are, by nature, fairly passive, especially compared to our commercial competition, and a failure to better leverage the opportunity for brand exposure leaves the door open to commercial competitors.
- Integration of library services and content through messaging channels will become more important, especially with younger users. (Integration may actually be too weak a term; understanding how to use messaging inherently within the digital lifestyles of our users is critical)
- Voice – are any libraries doing anything with voice? Integration with Amazon’s Alexa voice search? How do we fit into the voice as platform paradigm?
One parting thought, that I’ll try to tease out in a follow-up post: Libraries need to look very seriously at the importance of personalized, customized curation of collections for users, something that might actually be antithetical to the way we currently approach collection development. Think Apple Music, but for books, articles, and other content provided by libraries. It feels like we are doing this in slices and pieces, but that we have not yet established a unifying platform that integrates with the larger Internet ecosystem.
]]> http://digitallibrarian.org/?feed=rss2&p=229 0 - Meaningful Web Metrics http://digitallibrarian.org/?p=207 http://digitallibrarian.org/?p=207#respond Sun, 03 Jan 2016 20:10:52 +0000 http://digitallibrarian.org/?p=207 Meaningful Web Metrics Read More »]]> This article from Wired magazine is a must-read if you are interested in more impactful metrics for your library’s web site. At MPOE, we are scaling up our need for in-house web product expertise, but regardless of how much we invest in terms of staffing, it is likely that the amount of requested web support will always exceed the amount of resourcing we have for that support. Leveraging meaningful impact metrics can help us understand the value we get from the investment we make in our web presence, and more importantly help us define what types of impact we want to achieve through that investment. This is no easy feat, but it is good to see that others in the information ecosystem are looking at the same challenges. ]]> http://digitallibrarian.org/?feed=rss2&p=207 0
- Site migrated http://digitallibrarian.org/?p=154 http://digitallibrarian.org/?p=154#respond Mon, 01 Oct 2012 20:25:53 +0000 http://digitallibrarian.org/?p=154 Site migrated Read More »]]> Just a quick note – digitallibrarian.org has been migrated to a new server. You may see a few quirks here and there, but things should be mostly in good shape. If you notice anything major, send me a Challah. Really. A nice bread. Or just an email. Your choice.
]]> http://digitallibrarian.org/?feed=rss2&p=154 0 - The new iPad http://digitallibrarian.org/?p=141 http://digitallibrarian.org/?p=141#comments Sun, 18 Mar 2012 16:20:55 +0000 http://digitallibrarian.org/?p=141 The new iPad Read More »]]> I decided that it was time to upgrade my original iPad, so I pre-ordered a new iPad, which arrived this past Friday. After a few days, here are my initial thoughts / observations: Compared to the original iPad, the new iPad is a huge improvement. Much zipper, feels lighter (compared to the original), and of course the display is fantastic. I’ve just briefly tried the dictation feature, and though I haven’t used it extensively yet, the accuracy seems pretty darned good. I wonder if a future update will support Siri? The beauty of the display cannot be understated – crisp, clear (especially for someone with aging eyes) I purchased a 32-Gb model with LTE, but I have not tried the cell network yet. I did see 4G show up, so I’m hoping that Tucson indeed has the newer network. Not really new, but going from the original iPad to the new iPad, I really like the smart cover approach. Ditto with the form factor. Again, not specific to the new model, the ability to access my music, videos, and apps via iCloud means that I can utilize the storage on the iPad more effectively.
All-in-all, I can see myself using the new iPad consistently for a variety of tasks, not just for consuming information. Point-in-fact, this post was written with the new iPad.
]]> http://digitallibrarian.org/?feed=rss2&p=141 1 - 3rd SITS Meeting – Geneva http://digitallibrarian.org/?p=130 http://digitallibrarian.org/?p=130#respond Wed, 03 Aug 2011 09:38:19 +0000 http://digitallibrarian.org/?p=130 3rd SITS Meeting – Geneva Read More »]]> Back in June I attend the 3rd SITS (Scholarly Infrastructure Technical Summit) meeting, held in conjunction with the OAI7 workshop and sponsored by JISC and the Digital Library Federation. This meeting, held in lovely Geneva, Switzerland, brought together library technologists and technology leaders from North America, Europe, Australia, and Asia for the purpose of exploring common technology and technology-related issues that crossed our geographic boundaries.
This is the first SITS meeting that I attended – prior to this meeting, there were two other SITS meetings (one in London and one in California). As this SITS meeting was attached to the OAI7 conference, it brought together a group of stakeholders who’s roles in their organizations spanned from technology implementors to technology strategists and decision makers. From having chatted with some of the folks who had attended previous SITS meetings, the attendees at those meetings tended to weigh heavily on the technology implementer / developer side, while this particular instance of SITS had a broader range of discussion that, while centered on technology, also incorporated much of the context to which technology was being applied. For me, that actually made this a more intriguing and productive discussion, as I think that while there are certainly a great variety of strictly technical issues with which we grapple, what often gets lost when talking semantic web, linked data, digital preservation, etc. is the context and focus of the purpose of deploying said technology. So, with that particular piece of context, I’ll describe some of the conversation that occurred at this particular SITS event.
Due to the schedule of OAI7, this SITS meeting was held in two parts – the afternoon of 24 June, and the morning of 25 June. For the first session, the group met in one of the lecture rooms at the conference venue, and this worked out quite nicely. SITS uses an open agenda / open meeting format, which allows the attendees to basically nominate and elect the topics of discussion for the meeting. After initial introductions, we began proposing topics. I tried to capture as best I could all of the topics that were proposed, though I might have missed one or two:
* stable links for linked data vs. stable bitstreams for preservation
* authority hubs / clustered IDs / researcher IDs / ORCID in DSpace
* effective synchronization of digital resources
* consistency and usage of usage data
* digital preservation architecture – integration of tape-based storage and other storage anvironments (external to the library)
* integration between repositories and media delivery (i.e. streaming) – particularly to access control enforcement
* nano publications and object granularity
* pairing storage with different types of applications
* linking research data to scholarly publications to faculty assessment
* well-behaved document
* research impacts and outputs
* linked open data: from vision to deployment
* Relationship between open linked data and open research data
* Name disambiguation
Following process, we took the above brainstormed list and proceeded to vote on which topic to begin discussion. The first topic chosen was researcher identities, which began with discussion around ORCID, a project that currently has reasonable mindshare behind it. While there are a lot of backers of ORCID, it is not clear whether the approach of a singular researcher ID is a feasible approach, though I believe we’ll discover the answer based on the success (or not) of the project. In general, I think that most of the attendees will be paying attention to ORCID, but that also a wait and see approach is likely as there are many, many issues around researcher IDs that still need to be worked through.
The next topic was the assessment of research impacts and outputs. This particular topic was not particularly technically focused, but did bring about some interesting discussion about the impact of assessment activities, both positive and negative.
The next topic, linking research data to scholarly publications to faculty assessment, was a natural progression from the previous topic, and much of the discussion revolved around how to support such relationships. I must admit that while I think this topic is important, I didn’t feel that the discussion really resolved any of the potential issues with supporting researchers in linking data to publications (and then capturing this data for assessment purposes). What is clear is that the concept of publishing data, especially open data, is one that is not necessarily as straight-forward as one would hope when you get into the details, such as where to publish data, how to credit such publication, how is the data maintained, etc. There is a lot of work to be done here.
Next to be discussed was the preservation of data and software. It was brought up that the sustainability and preservation of data, especially open data, was somewhat analogous to the sustainability and preservation of software, in that both required a certain number of active tasks in order to ensure that both data and software were continually usable. It is also clear that much data requires the proper software in order to be usable, and therefore the issues of software and data sustainability and preservation are in my senses interwoven.
The group then moved to a brief discussion of the harvesting and use of usage data. Efforts such as COUNTER and popirus2 were mentioned. The ability to track data in a way that balances anonymity and privacy vs. added value back to the user was discussed – the fact that usage data can be leveraged to provide better services back to users was a key consideration.
The next discussion topic was influenced by the OAI7 workshop. The issue of the synchronisation of resources was discussed, and during OAI7, there was a breakout session that looked at the future of OAI-PMH, both in terms of 1.x sustainability as well as work that might end up with the result of OAI-PMH 2.0. Interestingly, there was some discussion of even the need for data synchronization with the advent of linked data; I can see why this would come up, but I personally believe that linked data isn’t at the point where other methods for ensuring synchronized data aren’t necessary (nor may it ever be).
Speaking of linked data, the concept arose in many of the SITS discussions, though the group did not officially address it until late in the agenda. I must admit that I’ve yet to drink the linked data lemonade, in the sense that I really don’t see it being the silver bullet that many of its proponents make it out to be, but I do see it as one approach for enabling extended use of data and resources. In the discussion, one of the challenges of the linked data approach that was discussed was the need to map between ontologies.
At this point, it was getting a bit late into the meeting, but we did talk about two more topics: One was very pragmatic, while the other was a bit more future-thinking (though there might be some disagreement on that). The first was a discussion about how organizationally digital preservation architectures were being supported – were they being supported by central IT, by the Library IT, or otherwise? It seemed that (not surprisingly) a lot depended upon the specific organization, and that perhaps more coordination could be undertaken through efforts such as PASIG. The second discussion was on the topic of “nano-publications”, which the group defined as “things that simply tell you what is being asserted (e.g. Europe is a continent)”. I must admit I got a bit lost about the importance and purpose of nano-publications, but again, it was close to the end of the meeting.
BTW, as I’m finishing this an email just came through with the official notes from the SITS meeting, which can be accessed at http://eprints.ecs.soton.ac.uk/22546/
]]> http://digitallibrarian.org/?feed=rss2&p=130 0 - David Lewis’ presentation on Collections Futures http://digitallibrarian.org/?p=126 http://digitallibrarian.org/?p=126#comments Wed, 02 Mar 2011 21:05:12 +0000 http://digitallibrarian.org/?p=126 David Lewis’ presentation on Collections Futures Read More »]]> Peter Murray (aka the Disruptive Library Technology Jester) has provided an audio-overlay of David Lewis’ slideshare of his plenary at the last June’s RLG Annual Partners meeting. If you are at all interested in understanding the future of academic libraries, you should take an hour of your time and listen to this presentation. Of particular note, because David says it almost in passing, is that academic libraries are moving away from being collectors of information to being provisioners of information – the difference being that instead of purchasing everything that might be used, academic libraries instead are moving to ensuring that there is a path for provisioning access to materials that actually requested for use by their users. Again, well worth an hour of your time. ]]> http://digitallibrarian.org/?feed=rss2&p=126 1
- Librarians are *the* search experts… http://digitallibrarian.org/?p=121 http://digitallibrarian.org/?p=121#respond Thu, 19 Aug 2010 14:22:46 +0000 http://digitallibrarian.org/?p=121 …so I wonder how many librarians know all of the tips and tricks for using Google that are mentioned here? ]]> http://digitallibrarian.org/?feed=rss2&p=121 0
- What do we want from Discovery? Maybe it’s to save the time of the user…. http://digitallibrarian.org/?p=119 http://digitallibrarian.org/?p=119#comments Wed, 18 Aug 2010 13:14:04 +0000 http://digitallibrarian.org/?p=119 What do we want from Discovery? Maybe it’s to save the time of the user…. Read More »]]> Just a quick thought on discovery tools – the major newish discovery services being vended to libraries (WorldCat local, Summon, Ebsco Discovery Service, etc.) all have their strengths, their complexity, their middle-of-the-road politician trying to be everything to everybody features. One question I have asked and not yet had a good answer to is “How does your tool save the time of the user?”. For me, that’s the most important feature of any discovery tool.
Show me data or study results that prove your tool saves the time of the user as compared to other vended tools (and Google and Google Scholar), and you have a clear advantage, at least in what I am considering when choosing to implement a discovery tool.
]]> http://digitallibrarian.org/?feed=rss2&p=119 1 - Putting a library in Starbucks http://digitallibrarian.org/?p=114 http://digitallibrarian.org/?p=114#respond Thu, 12 Aug 2010 09:40:58 +0000 http://digitallibrarian.org/?p=114 Putting a library in Starbucks Read More »]]>
It is not uncommon to find a coffee shop in a library these days. Turn that concept around, though – would you expect a library inside a Starbucks? Or maybe that’s the wrong question – how would you react to having a library inside a Starbucks? Well, that concept shuffling its way towards reality, as Starbucks is now experimenting with offering premium (i.e. non-free) content to users while they are on the free wireless that Starbucks provides. In fact, Starbucks actually has a collection development policy for their content – they are providing content in the following areas, which they call channels: News, Entertainment, Wellness, Business & Careers and My Neighborhood. They even call their offerings “curated content”. Obviously, this isn’t the equivalent of putting the full contents of a library into a coffee shop, but it is worth our time to pay attention to how this new service approach from Starbucks evolves. Starbucks isn’t giving away content for free just to get customers in the door; they are looking at how they might monetize this service through upsell techniques. The business models and agreements are going to have impact on how libraries do business, and we need to pay attention to how Starbucks brokers agreements with content providers. Eric Hellman’s current favorite term, monopsony, comes to mind here – though in reality Starbucks isn’t buying anything, as no money is actually changing hands, at least to start. Content providers are happy to allow Starbucks to provide limited access (i.e. limited by geographic location / network access) to content for free in order to promote their content and provide a discovery to delivery path that will allow users to extend their use of the content for a price.
This begs the question – should libraries look at upsell opportunities, especially if it means we can reduce our licensing costs? At the very least, the idea is worth exploring.
Source: Yahoo News
]]> http://digitallibrarian.org/?feed=rss2&p=114 0 - 1 week of iPad http://digitallibrarian.org/?p=101 http://digitallibrarian.org/?p=101#comments Wed, 14 Apr 2010 11:10:36 +0000 http://digitallibrarian.org/?p=101 1 week of iPad Read More »]]> It has been a little over a week since My iPad was delivered, and in that time I have had the opportunity to try it out at home, at work, and on the road. In fact, I’m currently typing this entry on it from the hotel restaurant at the CNI Spring task force meeting. I feel that I have used it enough now to provide some of my insights and thoughts about the iPad, how I am using it, and what I think of it.
So, how best to describe the iPad? Fun. Convenient. Fun again. The iPad is more than the sum of its parts; much like the iPhone, it provides an overall experience, one that is enjoyable and yes, efficient. Browsing is great fun; I have only run into one site where because of the lack of flash support was completely inaccessible (a local restaurant site). A number of sites that I regularly peruse have some flash aspect that is not available via the iPad, but typically this isn’t a big loss. For example, if there is an engadget article that contains video, I won’t get the video. However, the NY Times, ESPN, and other major sites are already supporting HTML 5 embedded video, and I expect to see a strong push towards HTML 5 and away from flash. In the grand scheme of things, most of the sites I browse are text and image based, and have no issues.
Likewise for email and calendaring – both work like a charm. Email on the iPad is easy, fun, and much better than on the iPhone. The keyboard, when in landscape mode, is actually much better than I expected, and very suitable for email replies (not to mention blog posts). I’d go as far to say that the usability of the onscreen keyboard (when the iPad is in landscape mode) is as good or better than a typical net book keyboard. Also, an unintended bonus is that typing on the keyboard is pretty much silent; this is somewhat noticeable during conference sessions where a dozen or so attendees are typing their notes and the clack of their keyboards starts to add up.
So, how am I using my iPad? Well, on this trip, I have used it to read (one novel and a bunch of work-related articles), do email, listen to music, watch videos, stream some netflix, browse the web, draft a policy document for my place of employment, diagram a repository architecture, and take notes during conference sessions. Could I do all of this on a laptop? Sure. Could I do all of this on a laptop without plugging in at any point in the day? Possibly, with the right laptop or net book. But here’s the thing – at the conference, instead of lugging my laptop bag around with me, my iPad replaced the laptop, my notepad, and everything else I would have dragged around in my bag. I literally only took my iPad, which is actually smaller than a standard paper notebook, and honestly I didn’t miss a beat. Quickly jot down a note? Easy. Sketch out an idea? Ditto. It’s all just right there, all the functionality, in a so-much-more convenient form factor.
Is the iPad perfect? By no means – the desktop interface is optimized for the iPhone / iTouch, and feels a bit inefficient for the larger iPad. Because of the current lack of multitasking (something that Apple has already announced will be available in the next version of the OS), I can’t keep an IM client running in the background. There is no inherent folder system, so saving files outside of applications is more complex then it should be. Fingerprints show up much more than I expected, though they wipe away fairly easily with a cloth. The weight (1.5 lbs) is just enough to make you need to shift how you hold the iPad after a period of time.
Again, here’s the thing: the iPad doesn’t need to be perfect, it needs to be niche. Is it niche? Ask my laptop bag.
]]> http://digitallibrarian.org/?feed=rss2&p=101 1
feeds-dltj-org-8538 ---- Disruptive Library Technology Jester Disruptive Library Technology Jester We're Disrupted, We're Librarians, and We're Not Going to Take It Anymore DLTJ Now Uses Webmention and Bridgy to Aggregate Social Media Commentary When I converted this blog from WordPress to a static site generated with Jekyll in 2018, I lost the ability for readers to make comments. At the time, I thought that one day I would set up an installation of Discourse for comments like Boing Boing did in 2013. But I never found the time to do that. Alternatively, I could do what NPR has done— abandon comments on its site in favor of encouraging people to use Twitter and Facebook—but that means blog readers don’t see where the conversation is happening. This article talks about IndieWeb—a blog-to-blog communication method—and the pieces needed to make it work on both a static website and for social-media-to-blog commentary. The IndieWeb is a combination of HTML markup and an HTTP protocol for capturing discussions between blogs. To participate in the IndieWeb ecosystem, a blog needs to support the “ h-card” and “ h-entry” microformats. These microformats are ways to add HTML markup to a site to be read and recognized by machines. If you follow the instructions at IndieWebify.me, the “Level 2” steps will check your site’s webpages for the appropriate markup. The Jekyll theme I use here, minimal-mistakes, didn’t include the microformat markup, so I made a pull request to add it. With the markup in place, dltj.org uses the Webmention protocol to notify others when I link to their content and receive notifications from others. If you’re setting this up for yourself, hopefully someone has already gone through the effort of adding the necessary Webmention communication bits to your blog software. Since DLTJ is a static website, I’m using the Webmention.IO service to send and receive Webmention information on behalf of dltj.org and a Jekyll plugin called jekyll-webmention_io to integrate Webmention data into my blog’s content. The plugin gets that data from webmention.io, caches it locally, and builds into each article the list of webmentions and pingbacks (another kind of blog-to-blog communication protocol) received. Webmention.IO and jekyll-webmention_io will capture some commentary. To get comments from Twitter, Mastodon, Facebook, and elsewhere, I added the Bridgy service to the mix. From their About page : “Bridgy periodically checks social networks for responses to your posts and links to your web site and sends them back to your site as webmentions.” So all of that commentary gets fed back into the blog post as well. I’ve just started using this Webmention/Bridgy setup, so I may have some pieces misconfigured. I’ll be watching over the next several blog posts to make sure everything is working. If you notice something that isn’t working, please reach out to me via one of the mechanisms listed in the sidebar of this site. Digital Repository Software: How Far Have We Come? How Far Do We Have to Go? Bryan Brown’s tweet led me to Ruth Kitchin Tillman’s Repository Ouroboros post about the treadmill of software development/deployment. And wow do I have thoughts and feelings. Ouroboros: an ancient symbol depicting a serpent or dragon eating its own tail. Or—in this context—constantly chasing what you can never have. Source: Wikipedia Let’s start with feelings. I feel pain and misery in reading Ruth’s post. As Bryan said in a subsequent tweet, I’ve been on both sides: a system maintainer watching much-needed features put off to major software updates (or rewrites) and the person participating in decisions to put off feature development in favor of major updates and rewrites. It is a bit like a serpent chasing its tail (a reference to “Ouroboros” in Ruth’s post title)—as someone who just wants a workable, running system, it seems like a never-ending quest to get what my users need. I think it will get better. I offer as evidence the fact that almost all of us can assume network connectivity. That certainly wasn’t always the case: routers used to break, file servers crash would under stress, network drivers go out of date at inopportune times. Now we take network connectivity for granted—almost (almost!) as if it a utility as common as water and electricity. We no longer have to chase our tail to assume those things. When we make those assumptions, we push that technology down the stack and layer on new things. Only after electricity is reliable can we layer on network connectivity. With reliable network connectivity, we layer on—say—digital repositories. Each layer goes through its own refinement process…getting better and better as it relies on the layers below it. Are digital repositories as reliable as printed books? No way! Without electricity and network connectivity, we can’t have digital repositories but we can still use books. Will there come a time when digital repositories are as reliable as electricity and network connectivity? That sounds like a Star Trek world, but if history is our guide, I think the profession will get there. (I’m not necessarily saying I’ll get there with it—such reliability is probably outside my professional lifetime.) So, yeah, I feel pain and misery in Ruth’s post about the achingly out-of-reach nature of repository software that can be pushed down the stack…that can be assumed to exist with all of the capabilities that our users need. That brings me around to one of Bryan’s tweets: If the idea of a digital preservation platform is that it is purpose-built to preserve assets for a long period of time, then isn't it an obvious design flaw to build it with an EOL in mind? If the system is no longer supported, then can it really be trusted for preservation?— Bryan J. Brown (@bryjbrown) June 22, 2021 Can digital repositories really be trusted in-and-of-themselves? No. (Not yet?) That isn’t to say that steps aren’t being made. Take, for example, HTTP and HTML. Those are getting pretty darn reliable, and assumptions can be built that rely on HTML as a markup language and HTTP as a protocol to move it around the network. I think that is a driver behind the growth of “static websites”—systems that rely on nothing more than delivering HTML and other files over HTTP. The infrastructure for doing that—servers, browsers, caching, network connectivity, etc.—is all pretty sound. HTML and HTTP have also stood the test of time—much like how we assume we will always understand how to process TIFF files for images. Now there are many ways to generate static websites. This blog uses Markdown text files and Jekyll as a pre-processor to create a stand-alone folder of HTML and supporting files. A more sophisticated method might use Drupal as a content management system that exports to a static site. Jekyll and Drupal are nowhere near as assumed-to-work as HTML and HTTP, but they work well as mechanisms for generating a static site. Last year, colleagues from the University of Iowa published a paper about making a static site front-end to CONTENTdm in the Code4Lib Journal, which could be the basis of a digital collection website development. So if your digital repository creates HTML to be served over HTTP and—for the purposes of preservation—the metadata can be encoded in HTML structures that are readily machine-processable? Well, then you might be getting pretty close to a system you can trust. But what about the digital objects themselves. Back in 2006, I crowed about the ability of Fedora repository software to recover itself just based on the files stored to disk. (Read the article for more details…it has the title “Why Fedora? Because You Don’t Need Fedora” in case that might make it more enticing to read.) Fedora used a bespoke method of saving digital objects as a series of files on disk, and the repository software provided commands to rebuild the repository database from those files. That worked for Fedora up to version 3. For Fedora version 4, some of the key object metadata only existed in the repository database. From what I understand of version 5 and beyond, Fedora adopted the Oxford Common File Layout (OCFL), “an application-independent approach to the storage of digital information in a structured, transparent, and predictable manner.” The OCFL website goes on to say: “It is designed to promote long-term object management best practices within digital repositories.” So Fedora is back again in a state where you could rebuild the digital object repository system from a simple filesystem backup. The repository software becomes a way of optimizing access to the underlying digital objects. Will OCFL stand the test of time like HTML, HTTP, TIFF, network connectivity, and electricity? Only time will tell. So I think we are getting closer. It is possible to conceive of a system that uses simple files and directories as long-term preservation storage. Those can be backed up and duplicated using a wide variety of operating systems and tools. We also have examples of static sites of HTML delivered over HTTP that various tools can create and many, many programs can deliver and render. We’re missing some key capabilities—access control comes to mind. I, for one, am not ready to push JavaScript very far down our stack of technologies—certainly not as far as HTML—but JavaScript robustness seems to be getting better over time. Ruth: I’m sorry this isn’t easy and that software creators keep moving the goalposts. (I’ll put myself in the “software creator” category.) We could be better at setting expectations and delivering on them. (There is probably another lengthy blog post in how software development is more “art” than it is “engineering”.) Developers—the ones fortunate to have the ability and permission to think long term—are trying to make new tools/techniques good enough to push down the stack of assumed technologies. We’re clearly not there for digital repository software, but…hopefully…we are moving in the right direction. Thoughts on Growing Up It ‘tis the season for graduations, and this year my nephew is graduating from high school. My sister-in-law created a memory book—”a surprise Book of Advice as he moves to the next phase of his life.” What an interesting opportunity to reflect! This is what I came up with: Sometime between when I became an adult and now, the word “adulting” was coined. My generation just called it “growing up.” The local top-40 radio station uses “hashtag-adulting” to mean all of those necessary life details that now become your own responsibility. (“Hashtag” is something new, too, for what that’s worth.) Growing up is more than life necessities, though. This is an exciting phase of life that you’ve built up to—many more doors of possibilities are opening and now you get to pick which ones to go through. Pick carefully. Each door you go through starts to close off others. Pick many. Use this life stage to try many things to find what is fun and what is meaningful (and aim for both fun and meaningful). You are on a solid foundation, and I’m eager to see what you discover “adulting” means to you. More Thoughts on Pre-recording Conference Talks Over the weekend, I posted an article here about pre-recording conference talks and sent a tweet about the idea on Monday. I hoped to generate discussion about recording talks to fill in gaps—positive and negative—about the concept, and I was not disappointed. I’m particularly thankful to Lisa Janicke Hinchliffe and Andromeda Yelton along with Jason Griffey, Junior Tidal, and Edward Lim Junhao for generously sharing their thoughts. Daniel S and Kate Deibel also commented on the Code4Lib Slack team. I added to the previous article’s bullet points and am expanding on some of the issues here. I’m inviting everyone mentioned to let me know if I’m mischaracterizing their thoughts, and I will correct this post if I hear from them. (I haven’t found a good comments system to hook into this static site blog.) Pre-recorded Talks Limit Presentation Format Lisa Janicke Hinchliffe made this point early in the feedback: @DataG For me downside is it forces every session into being a lecture. For two decades CfPs have emphasized how will this season be engaging/not just a talking head? I was required to turn workshops into talks this year. Even tho tech can do more. Not at all best pedagogy for learning— Lisa Janicke Hinchliffe (@lisalibrarian) April 5, 2021 Jason described the “flipped classroom” model that he had in mind as the NISOplus2021 program was being developed. The flipped classroom model is one where students do the work of reading material and watching lectures, then come to the interactive time with the instructors ready with questions and comments about the material. Rather than the instructor lecturing during class time, the class time becomes a discussion about the material. For NISOplus, “the recording is the material the speaker and attendees are discussing” during the live Zoom meetings. In the previous post, I described how the speaker could respond in text chat while the recording replay is beneficial. Lisa went on to say: @DataG Q+A is useful but isn't an interactive session. To me, interactive = participants are co-creating the session, not watching then commenting on it.— Lisa Janicke Hinchliffe (@lisalibrarian) April 5, 2021 She described an example: the SSP preconference she ran at CHS. I’m paraphrasing her tweets in this paragraph. The preconference had a short keynote and an “Oprah-style” panel discussion (not pre-prepared talks). This was done live; nothing was recorded. After the panel, people worked in small groups using Zoom and a set of Google Slides to guide the group work. The small groups reported their discussions back to all participants. Andromeda points out (paraphrasing twitter-speak): “Presenters will need much more— and more specialized—skills to pull it off, and it takes a lot more work.” And Lisa adds: “Just so there is no confusion … I don’t think being online makes it harder to do interactive. It’s the pre-recording. Interactive means participants co-create the session. A pause to chat isn’t going to shape what comes next on the recording.” Increased Technical Burden on Speakers and Organizers @ThatAndromeda @DataG Totally agree on this. I had to pre-record a conference presentation recently and it was a terrible experience, logistically. I feel like it forces presenters to become video/sound editors, which is obviously another thing to worry about on top of content and accessibility.— Junior Tidal (@JuniorTidal) April 5, 2021 Andromeda also agreed with this: “I will say one of the things I appreciated about NISO is that @griffey did ALL the video editing, so I was not forced to learn how that works.” She continued, “everyone has different requirements for prerecording, and in [Code4Lib’s] case they were extensive and kept changing.” And later added: “Part of the challenge is that every conference has its own tech stack/requirements. If as a presenter I have to learn that for every conference, it’s not reducing my workload.” It is hard not to agree with this; a high-quality (stylistically and technically) recording is not easy to do with today’s tools. This is also a technical burden for meeting organizers. The presenters will put a lot of work into talks—including making sure the recordings look good; whatever playback mechanism is used has to honor the fidelity of that recording. For instance, presenters who have gone through the effort to ensure the accessibility of the presentation color scheme want the conference platform to display the talk “as I created it.” The previous post noted that recorded talks also allow for the creation of better, non-real-time transcriptions. Lisa points out that presenters will want to review that transcription for accuracy, which Jason noted adds to the length of time needed before the start of a conference to complete the preparations. Increased Logistical Burden on Presenters @ThatAndromeda @DataG @griffey Even if prep is no more than the time it would take to deliver live (which has yet to be case for me and I'm good at this stuff), it is still double the time if you are expected to also show up live to watch along with everyone else.— Lisa Janicke Hinchliffe (@lisalibrarian) April 5, 2021 This is a consideration I hadn’t thought through—that presenters have to devote more clock time to the presentation because first they have to record it and then they have to watch it. (Or, as Andromeda added, “significantly more than twice the time for some people, if they are recording a bunch in order to get it right and/or doing editing.”) No. Audience. Reaction. @DataG @griffey 3) No. Audience. Reaction. I give a joke and no one laughs. Was it funny? Was it not funny? Talks are a *performance* and a *relationship*; I'm getting energy off the audience, I'm switching stuff on the fly to meet their vibe. Prerecorded/webinar is dead. Feels like I'm bombing.— Andromeda Yelton (@ThatAndromeda) April 5, 2021 Wow, yes. I imagine it would take a bit of imagination to get in the right mindset to give a talk to a small camera instead of an audience. I wonder how stand-up comedians are dealing with this as they try to put on virtual shows. Andromeda summed this up: @DataG @griffey oh and I mean 5) I don't get tenure or anything for speaking at conferences and goodness knows I don't get paid. So the ENTIRE benefit to me is that I enjoy doing the talk and connect to people around it. prerecorded talk + f2f conf removes one of these; online removes both.— Andromeda Yelton (@ThatAndromeda) April 5, 2021 Also in this heading could be “No Speaker Reaction”—or the inability for subsequent speakers at a conference to build on something that someone said earlier. In the Code4Lib Slack team, Daniel S noted: “One thing comes to mind on the pre-recording [is] the issue that prerecorded talks lose the ‘conversation’ aspect where some later talks at a conference will address or comment on earlier talks.” Kate Deibel added: “Exactly. Talks don’t get to spontaneously build off of each other or from other conversations that happen at the conference.” Currency of information Lisa points out that pre-recording talks before en event means there is a delay between the recording and the playback. In the example she pointed out, there was a talk at RLUK that pre-recorded would have been about the University of California working on an Open Access deal with Elsevier; live, it was able to be “the deal we announced earlier this week”. Conclusions? Near the end of the discussion, Lisa added: @DataG @griffey @ThatAndromeda I also recommend going forward that the details re what is required of presenters be in the CfP. It was one thing for conferences that pivoted (huge effort!) but if you write the CfP since the pivot it should say if pre-record, platform used, etc.— Lisa Janicke Hinchliffe (@lisalibrarian) April 5, 2021 …and Andromeda added: “Strong agree here. I understand that this year everyone was making it up as they went along, but going forward it’d be great to know that in advance.” That means conferences will need to take these needs into account well before the Call for Proposals (CfP) is published. A conference that is thinking now about pre-recording their talks must work through these issues and set expectations with presenters early. As I hoped, the Twiter replies tempered my eagerness for the all-recorded style with some real-world experience. There could be possibilities here, but adapting face-to-face meetings to a world with less travel won’t be simple and will take significant thought beyond the issues of technology platforms. Edward Lim Junhao summarized this nicely: “I favor unpacking what makes up our prof conferences. I’m interested in recreating that shared experience, the networking, & the serendipity of learning sth you didn’t know. I feel in-person conferences now have to offer more in order to justify people traveling to attend them.” Related, Andromeda said: “Also, for a conf that ultimately puts its talks online, it’s critical that it have SOMEthing beyond content delivery during the actual conference to make it worth registering rather than just waiting for youtube. realtime interaction with the speaker is a pretty solid option.” If you have something to add, reach out to me on Twitter. Given enough responses, I’ll create another summary. Let’s keep talking about what that looks like and sharing discoveries with each other. The Tree of Tweets It was a great discussion, and I think I pulled in the major ideas in the summary above. With some guidance from Ed Summers, I’m going to embed the Twitter threads below using Treeverse by Paul Butler. We might be stretching the boundaries of what is possible, so no guarantees that this will be viewable for the long term. Should All Conference Talks be Pre-recorded? The Code4Lib conference was last week. That meeting used all pre-recorded talks, and we saw the benefits of pre-recording for attendees, presenters, and conference organizers. Should all talks be pre-recorded, even when we are back face-to-face? Note! After I posted a link to this article on Twitter, there was a great response of thoughtful comments. I've included new bullet points below and summarized the responses in another blog post. As an entirely virtual conference, I think we can call Code4Lib 2021 a success. Success ≠ Perfect, of course, and last week the conference coordinating team got together on a Zoom call for a debriefing session. We had a lengthy discussion about what we learned and what we wanted to take forward to the 2022 conference, which we’re anticipating will be something with a face-to-face component. That last sentence was tough to compose: “…will be face-to-face”? “…will be both face-to-face and virtual”? (Or another fully virtual event?) Truth be told, I don’t think we know yet. I think we know with some certainty that the COVID pandemic will become much more manageable by this time next year—at least in North America and Europe. (Code4Lib draws from primarily North American library technologists with a few guests from other parts of the world.) I’m hearing from higher education institutions, though, that travel is going to be severely curtailed…if not for health risk reasons, then because budgets have been slashed. So one has to wonder what a conference will look like next year. I’ve been to two online conferences this year: NISOplus21 and Code4Lib. Both meetings recorded talks in advance and started playback of the recordings at a fixed point in time. This was beneficial for a couple of reasons. For organizers and presenters, pre-recording allowed technical glitches to be worked through without the pressure of a live event happening. Technology is not nearly perfect enough or ubiquitously spread to count on it working in real-time. 1 NISOplus21 also used the recordings to get transcribed text for the videos. (Code4Lib used live transcriptions on the synchronous playback.) Attendees and presenters benefited from pre-recording because the presenters could be in the text chat channel to answer questions and provide insights. Having the presenter free during the playback offers new possibilities for making talks more engaging: responding in real-time to polls, getting forehand knowledge of topics for subsequent real-time question/answer sessions, and so forth. The synchronous playback time meant that there was a point when (almost) everyone was together watching the same talk—just as in face-to-face sessions. During the Code4Lib conference coordinating debrief call, I asked the question: “If we saw so many benefits to pre-recording talks, do we want to pre-record them all next year?” In addition to the reasons above, pre-recorded talks benefit those who are not comfortable speaking English or are first-time presenters. (They have a chance to re-do their talk as many times as they need in a much less stressful environment.) “Live” demos are much smoother because a recording can be restarted if something goes wrong. Each year, at least one presenter needs to use their own machine (custom software, local development environment, etc.), and swapping out presenter computers in real-time is risky. And it is undoubtedly easier to impose time requirements with recorded sessions. So why not pre-record all of the talks? I get it—it would be different to sit in a ballroom watching a recording play on big screens at the front of the room while the podium is empty. But is it so different as to dramatically change the experience of watching a speaker at a podium? In many respects, we had a dry-run of this during Code4Lib 2020. It was at the early stages of the coming lockdowns when institutions started barring employee travel, and we had to bring in many presenters remotely. I wrote a blog post describing the setup we used for remote presenters, and at the end, I said: I had a few people comment that they were taken aback when they realized that there was no one standing at the podium during the presentation. Some attendees, at least, quickly adjusted to this format. For those with the means and privilege of traveling, there can still be face-to-face discussions in the hall, over meals, and social activities. For those that can’t travel (due to risks of traveling, family/personal responsibilities, or budget cuts), the attendee experience is a little more level—everyone is watching the same playback and in the same text backchannels during the talk. I can imagine a conference tool capable of segmenting chat sessions during the talk playback to “tables” where you and close colleagues can exchange ideas and then promote the best ones to a conference-wide chat room. Something like that would be beneficial as attendance grows for events with an online component, and it would be a new form of engagement that isn’t practical now. There are undoubtedly reasons not to pre-record all session talks (beyond the feels-weird-to-stare-at-an-unoccupied-ballroom-podium reasons). During the debriefing session, one person brought up that having all pre-recorded talks erodes the justification for in-person attendance. I can see a manager saying, “All of the talks are online…just watch it from your desk. Even your own presentation is pre-recorded, so there is no need for you to fly to the meeting.” That’s legitimate. So if you like bullet points, here’s how it lays out. Pre-recording all talks is better for: Accessibility: better transcriptions for recorded audio versus real-time transcription (and probably at a lower cost, too) Engagement: the speaker can be in the text chat during playback, and there could be new options for backchannel discussions Better quality: speakers can re-record their talk as many times as needed Closer equality: in-person attendees are having much the same experience during the talk as remote attendees Downsides for pre-recording all talks: Feels weird: yeah, it would be different Erodes justification: indeed a problem, especially for those for whom giving a speech is the only path to getting the networking benefits of face-to-face interaction Limits presentation format: it forces every session into being a lecture. For two decades CfPs have emphasized how will this season be engaging/not just a talking head? (Lisa Janicke Hinchliffe) Increased Technical Burden on Speaker and Organizers: conference organizers asking presenters to do their own pre-recording is a barrier (Junior Tidal), and organizers have added new requirements for themselves No Audience Feedback: pre-recording forces the presenter into an unnatural state relative to the audience (Andromeda Yelton) Currency of information: pre-recording talks before en event naturally introduces a delay between the recording and the playback. (Lisa Janicke Hinchliffe) I’m curious to hear of other reasons, for and against. Reach out to me on Twitter if you have some. The COVID-19 pandemic has changed our society and will undoubtedly transform it in ways that we can’t even anticipate. Is the way that we hold professional conferences one of them? Can we just pause for a moment and consider the decades of work and layers of technology that make a modern teleconference call happen? For you younger folks, there was a time when one couldn’t assume the network to be there. As in: the operating system on your computer couldn’t be counted on to have a network stack built into it. In the earliest years of my career, we were tickled pink to have Macintoshes at the forefront of connectivity through GatorBoxes. Go read the first paragraph of that Wikipedia article on GatorBoxes…TCP/IP was tunneled through LocalTalk running over PhoneNet on unshielded twisted pairs no faster than about 200 kbit/second. (And we loved it!) Now the network is expected; needing to know about TCP/IP is pushed so far down the stack as to be forgotten…assumed. Sure, the software on top now is buggy and bloated—is my Zoom client working? has Zoom’s service gone down?—but the network…we take that for granted. ↩ User Behavior Access Controls at a Library Proxy Server are Okay Earlier this month, my Twitter timeline lit up with mentions of a half-day webinar called Cybersecurity Landscape - Protecting the Scholarly Infrastructure. What had riled up the people I follow on Twitter was the first presentation: “Security Collaboration for Library Resource Access” by Cory Roach, the chief information security officer at the University of Utah. Many of the tweets and articles linked in tweets were about a proposal for a new round of privacy-invading technology coming from content providers as a condition of libraries subscribing to publisher content. One of the voices that I trust was urging caution: I highly recommend you listen to the talk, which was given by a university CIO, and judge if this is a correct representation. FWIW, I attended the event and it is not what I took away.— Lisa Janicke Hinchliffe (@lisalibrarian) November 14, 2020 As near as I can tell, much of the debate traces back to this article: Scientific publishers propose installing spyware in university libraries to protect copyrights - Coda Story https://t.co/rtCokIukBf— Open Access Tracking Project (@oatp) November 14, 2020 The article describes Cory’s presentation this way: One speaker proposed a novel tactic publishers could take to protect their intellectual property rights against data theft: introducing spyware into the proxy servers academic libraries use to allow access to their online services, such as publishers’ databases. The “spyware” moniker is quite scary. It is what made me want to seek out the recording from the webinar and hear the context around that proposal. My understanding (after watching the presentation) is that the proposal is not nearly as concerning. Although there is one problematic area—the correlation of patron identity with requested URLs—overall, what is described is a sound and common practice for securing web applications. To the extent that it is necessary to determine a user’s identity before allowing access to licensed content (an unfortunate necessity because of the state of scholarly publishing), this is an acceptable proposal. (Through the university communications office, Corey published a statement about the reaction to his talk.) In case you didn’t know, a web proxy server ensures the patron is part of the community of licensed users, and the publisher trusts requests that come through the web proxy server. The point of Cory’s presentation is that the username/password checking at the web proxy server is a weak form of access control that is subject to four problems: phishing (sending email to tricking a user into giving up their username/password) social engineering (non-email ways of tricking a user into giving up their username/password) credential reuse (systems that are vulnerable because the user used the same password in more than one place) hactivism (users that intentionally give out their username/password so others can access resources) Right after listing these four problems, Cory says: “But anyway we look at it, we can safely say that this is primarily a people problem and the technology alone is not going to solve that problem. Technology can help us take reasonable precautions… So long as the business model involves allowing access to the data that we’re providing and also trying to protect that same data, we’re unlikely to stop theft entirely.” His proposal is to place “reasonable precautions” in the web proxy server as it relates to the campus identity management system. This is a slide from his presentation: Slide from presentation by Cory Roach I find this layout (and lack of labels) somewhat confusing, so I re-imagined the diagram as this: Revised 'Modern Library Design' The core of Cory’s presentation is to add predictive analytics and per-user blocking automation to the analysis of the log files from the web proxy server and the identity management server. By doing so, the university can react quicker to compromised usernames and passwords. In fact, it could probably do so more quicker than the publisher could do with its own log analysis and reporting back to the university. Where Cory runs into trouble is this slide: Slide from presentation by Cory Roach In this part of the presentation, Cory describes the kinds of patron-identifying data that the university could-or-would collect and analyze to further the security effort. In search engine optimization, these sorts of data points are called “signals” and are used to improve the relevance of search results; perhaps there is an equivalent term in access control technology. But for now, I’ll just call them “signals”. There are some problems in gathering these signals—most notably the correlation between user identity and “URLs Requested”. In the presentation, he says: “You can also move over to behavioral stuff. So it could be, you know, why is a pharmacy major suddenly looking up a lot of material on astrophysics or why is a medical professional and a hospital suddenly interested in internal combustion. Things that just don’t line up and we can identify fishy behavior.” It is core to the library ethos that we make our best effort to not track what a user is interested in—to not build a profile of a user’s research unless they have explicitly opted into such data collection. As librarians, we need to gracefully describe this professional ethos and work that into the design of the systems used on campus (and at the publishers). Still, there is much to be said for using some of the other signals to analyze whether a particular request is from an authorized community member. For instance, Cory says: “We commonly see this user coming in from the US and today it’s coming in from Botswana. You know, has there been enough time that they could have traveled from the US to Botswana and actually be there? Have they ever access resources from that country before is there residents on record in that country?” The best part of what Cory is proposing is that the signals’ storage and processing is at the university and not at the publisher. I’m not sure if Cory knew this, but a recent version of EZProxy added a UsageLimit directive that builds in some of these capabilities. It can set per-user limits based on the number of page requests or the amount of downloaded information over a specified interval. One wonders if somewhere in OCLC’s development queue is the ability to detect IP addresses from multiple networks (geographic detection) and browser differences across a specified interval. Still, pushing this up to the university’s identity provider allows for a campus-wide view of the signals…not just the ones coming through the library. Also, in designing the system, there needs to be clarity about how the signals are analyzed and used. I think Cory knew this as well: “we do have to be careful about not building bias into the algorithms.” Yeah, the need for this technology sucks. Although it was the tweet to the Coda Story about the presentation that blew up, the thread of the story goes through TechDirt to a tangential paragraph from Netzpolitik in an article about Germany’s licensing struggle with Elsevier. With this heritage, any review of the webinar’s ideas are automatically tainted by the disdain the library community in general has towards Elsevier. It is reality—an unfortunate reality, in my opinion—that the traditional scholarly journal model has publishers exerting strong copyright protection on research and ideas behind paywalls. (Wouldn’t it be better if we poured the anti-piracy effort into improving scholarly communication tools in an Open Access world? Yes, but that isn’t the world we live in.) Almost every library deals with this friction by employing a web proxy server as an agent between the patron and the publisher’s content. The Netzpolitik article says: …but relies on spyware in the fight against „cybercrime“ Of Course, Sci-Hub and other shadow libraries are a thorn in Elsevier’s side. Since they have existed, libraries at universities and research institutions have been much less susceptible to blackmail. Their staff can continue their research even without a contract with Elsevier. Instead of offering transparent open access contracts with fair conditions, however, Elsevier has adopted a different strategy in the fight against shadow libraries. These are to be fought as „cybercrime“, if necessary also with technological means. Within the framework of the „Scholarly Networks Security Initiative (SNSI)“, which was founded together with other large publishers, Elsevier is campaigning for libraries to be upgraded with security technology. In a SNSI webinar entitled „Cybersecurity Landscape – Protecting the Scholarly Infrastructure“*, hosted by two high-ranking Elsevier managers, one speaker recommended that publishers develop their own proxy or a proxy plug-in for libraries to access more (usage) data („develop or subsidize a low cost proxy or a plug-in to existing proxies“). With the help of an „analysis engine“, not only could the location of access be better narrowed down, but biometric data (e.g. typing speed) or conspicuous usage patterns (e.g. a pharmacy student suddenly interested in astrophysics) could also be recorded. Any doubts that this software could also be used—if not primarily—against shadow libraries were dispelled by the next speaker. An ex-FBI analyst and IT security consultant spoke about the security risks associated with the use of Sci-Hub. The other commentary that I saw was along similar lines: [Is the SNSI the new PRISM? bjoern.brembs.blog](http://bjoern.brembs.net/2020/10/is-the-snsi-the-new-prism/) [Academics band together with publishers because access to research is a cybercrime chorasimilarity](https://chorasimilarity.wordpress.com/2020/11/14/academics-band-together-with-publishers-because-access-to-research-is-a-cybercrime/) [WHOIS behind SNSI & GetFTR? Motley Marginalia](https://csulb.edu/~ggardner/2020/11/16/snsi-getftr/) Let’s face it: any friction beyond follow-link-to-see-PDF is more friction than a researcher deserves. I doubt we would design a scholarly communication system this way were we to start from scratch. But the system is built on centuries of evolving practice, organizations, and companies. It really would be a better world if we didn’t have to spend time and money on scholarly publisher paywalls. And I’m grateful for the Open Access efforts that are pivoting scholarly communications into an open-to-all paradigm. That doesn’t negate the need to provide better options for content that must exist behind a paywall. So what is this SNSI thing? The webinar where Cory presented was the first mention I’d seen of a new group called the Scholarly Networks Security Initiative (SNSI). SNSI is the latest in a series of publisher-driven initiatives to reduce the paywall’s friction for paying users or library patrons coming from licensing institutions. GetFTR (my thoughts) and Seamless Access (my thoughts). (Disclosure: I’m serving on two working groups for Seamless Access that are focused on making it possible for libraries to sensibly and sanely integrate the goals of Seamless Access into campus technology and licensing contracts.) Interestingly, while the Seamless Access initiative is driven by a desire to eliminate web proxy servers, this SNSI presentation upgrades a library’s web proxy server and makes it a more central tool between the patron and the content. One might argue that all access on campus should come through the proxy server to benefit from this kind of access control approach. It kinda makes one wonder about the coordination of these efforts. Still, SNSI is on my radar now, and I think it will be interesting to see what the next events and publications are from this group. As a Cog in the Election System: Reflections on My Role as a Precinct Election Official I may nod off several times in composing this post the day after election day. Hopefully, in reading it, you won’t. It is a story about one corner of democracy. It is a journal entry about how it felt to be a citizen doing what I could do to make other citizens’ voices be heard. It needed to be written down before the memories and emotions are erased by time and naps. Yesterday I was a precinct election officer (PEO—a poll worker) for Franklin County—home of Columbus, Ohio. It was my third election as a PEO. The first was last November, and the second was the election aborted by the onset of the coronavirus in March. (Not sure that second one counts.) It was my first as a Voting Location Manager (VLM), so I felt the stakes were high to get it right. Would there be protests at the polling location? Would I have to deal with people wearing candidate T-shirts and hats or not wearing masks? Would there be a crash of election observers, whether official (scrutinizing our every move) or unofficial (that I would have to remove)? It turns out the answer to all three questions was “no”—and it was a fantastic day of civic engagement by PEOs and voters. There were well-engineered processes and policies, happy and patient enthusiasm, and good fortune along the way. This story is going to turn out okay, but it could have been much worse. Because of the complexity of the election day voting process, last year Franklin County started allowing PEOs to do some early setup on Monday evenings. The early setup started at 6 o’clock. I was so anxious to get it right that the day before I took the printout of the polling room dimensions from my VLM packet, scanned it into OmniGraffle on my computer, and designed a to-scale diagram of what I thought the best layout would be. The real thing only vaguely looked like this, but it got us started. What I imagined our polling place would look like We could set up tables, unpack equipment, hang signs, and other tasks that don’t involve turning on machines or breaking open packets of ballots. One of the early setup tasks was updating the voters’ roster on the electronic poll pads. As happened around the country, there was a lot of early voting activity in Franklin County, so the update file must have been massive. The electronic poll pads couldn’t handle the update; they hung at step 8-of-9 for over an hour. I called the Board of Elections and got ahold of someone in the equipment warehouse. We tried some of the simple troubleshooting steps, and he gave me his cell phone number to call back if it wasn’t resolved. By 7:30, everything was done except for the poll pad updates, and the other PEOs were wandering around. I think it was 8 o’clock when I said everyone could go home while the two Voting Location Deputies and I tried to get the poll pads working. I called the equipment warehouse and we hung out on the phone for hours…retrying the updates based on the advice of the technicians called in to troubleshoot. I even “went rogue” towards the end. I searched the web for the messages on the screen to see if anyone else had seen the same problem with the poll pads. The electronic poll pad is an iPad with a single, dedicated application, so I even tried some iPad reset options to clear the device cache and perform a hard reboot. Nothing worked—still stuck at step 8-of-9. The election office people sent us home at 10 o’clock. Even on the way out the door, I tried a rogue option: I hooked a portable battery to one of the electronic polling pads to see if the update would complete overnight and be ready for us the next day. It didn’t, and it wasn’t. Text from Board of Elections Polling locations in Ohio open at 6:30 in the morning, and PEOs must report to their sites by 5:30. So I was up at 4:30 for a quick shower and packing up stuff for the day. Early in the setup process, the Board of Elections sent a text that the electronic poll pads were not going to be used and to break out the “BUMPer Packets” to determine a voter’s eligibility to vote. At some point, someone told me what “BUMPer” stood for. I can’t remember, but I can imagine it is Back-Up-something-something. “Never had to use that,” the trainers told me, but it is there in case something goes wrong. Well, it is the year 2020, so was something going to go wrong? Fortunately, the roster judges and one of the voting location deputies tore into the BUMPer Packet and got up to speed on how to use it. It is an old fashioned process: the voter states their name and address, the PEO compares that with the details on the paper ledger, and then asks the voter to sign beside their name. With an actual pen…old fashioned, right? The roster judges had the process down to a science. They kept the queue of verified voters full waiting to use the ballot marker machines. The roster judges were one of my highlights of the day. And boy did the voters come. By the time our polling location opened at 6:30 in the morning, they were wrapped around two sides of the building. We were moving them quickly through the process: three roster tables for checking in, eight ballot-marking machines, and one ballot counter. At our peak capacity, I think we were doing 80 to 90 voters an hour. As good as we were doing, the line never seemed to end. The Franklin County Board of Elections received a grant to cover the costs of two greeters outside that helped keep the line orderly. They did their job with a welcoming smile, as did our inside greeter that offered masks and a squirt of hand sanitizer. Still, the voters kept back-filling that line, and we didn’t see a break until 12:30. The PEOs serving as machine judges were excellent. This was the first time that many voters had seen the new ballot equipment that Franklin County put in place last year. I like this new equipment: the ballot marker prints your choices on a card that it spits out. You can see and verify your choices on the card before you slide it into a separate ballot counter. That is reassuring for me, and I think for most voters, too. But it is new, and it takes a few extra moments to explain. The machine judges got the voters comfortable with the new process. And some of the best parts of the day were when they announced to the room that a first-time voter had just put their card into the ballot counter. We would all pause and cheer. The third group of PEOs at our location were the paper table judges. They handle all of the exceptions. Someone wants to vote with a pre-printed paper ballot rather than using a machine? To the paper table! The roster shows that someone requested an absentee ballot? That voter needs to vote a “provisional” ballot that will be counted at the Board of Elections office if the absentee ballot isn’t received in the mail. The paper table judges explain that with kindness and grace. In the wrong location? The paper table judges would find the correct place. The two paper table PEOs clearly had experience helping voters with the nuances of election processes. Rounding out the team were two voting location deputies (VLD). By law, a polling location can’t have a VLD and a voting location manager (VLM) of the same political party. That is part of the checks and balances built into the system. One VLD had been a VLM at this location, and she had a wealth of history and wisdom about running a smooth polling location. For the other VLD, this was his first experience as a precinct election officer, and he jumped in with both feet to do the visible and not-so-visible things that made for a smooth operation. He reminded me a bit of myself a year ago. My first PEO position was as a voting location deputy last November. The pair handled a challenging curbside voter situation where it wasn’t entirely clear if one of the voters in the car was sick. I’d be so lucky to work with them again. The last two hours of the open polls yesterday were dreadfully dull. After the excitement of the morning, we may have averaged a voter every 10 minutes for those last two hours. Everyone was ready to pack it in early and go home. (Polls in Ohio close at 7:30, so counting the hour early for setup and the half an hour for tear down, this was going to be a 14 to 15 hour day.) Over the last hour, I gave the PEOs little tasks to do. At one point, I said they could collect the barcode scanners attached to the ballot markers. We weren’t using them anyway because the electronic poll pads were not functional. Then, in stages (as it became evident that there was no final rush of voters), they could pack up one or two machines and put away tables. Our second to last voter was someone in medical scrubs that just got off their shift. I scared our last voter because she walked up to the roster table at 7:29:30. Thirty seconds later, I called out that the polls are closed (as I think a VLM is required to do), and she looked at me startled. (She got to vote, of course; that’s the rule.) She was our last voter; 799 voters in our precinct that day. Then our team packed everything up as efficiently as they had worked all day. We had put away the equipment and signs, done our final counts, closed out the ballot counter, and sealed the ballot bin. At 8:00, we were done and waving goodbye to our host facility’s office manager. One of the VLD rode along with me to the board of elections to drop off the ballots, and she told me of a shortcut to get there. We were among the first reporting results for Franklin County. I was home again by a quarter of 10—exhausted but proud. I’m so happy that I had something to do yesterday. After weeks of concern and anxiety for how the election was going to turn out, it was a welcome bit of activity to ensure the election was held safely and that voters got to have their say. It was certainly more productive than continually reloading news and election results pages. The anxiety of being put in charge of a polling location was set at ease, too. I’m proud of our polling place team and that the voters in our charge seemed pleased and confident about the process. Maybe you will find inspiration here. If you voted, hopefully it felt good (whether or not the result turned out as you wanted). If you voted for the first time, congratulations and welcome to the club (be on the look-out for the next voting opportunity…likely in the spring). If being a poll worker sounded like fun, get in touch with your local board of elections (here is information about being a poll worker in Franklin County). Democracy is participatory. You’ve got to tune in and show up to make it happen. Certificate of Appreciation Running an All-Online Conference with Zoom [post removed] This is an article draft that was accidentally published. I hope to work on a final version soon. If you really want to see it, I saved a copy on the Internet Archive Wayback Machine. With Gratitude for the NISO Ann Marie Cunningham Service Award During the inaugural NISO Plus meeting at the end of February, I was surprised and proud to receive the Ann Marie Cunningham Service award. Todd Carpenter, NISO’s executive director, let me know by tweet as I was not able to attend the conference. Pictured in that tweet is my co-recipient, Christine Stohn, who serves NISO with me as the co-chair of the Information Delivery and Interchange Topic Committee. This got me thinking about what NISO has meant to me. As I think back on it, my activity in NISO spans at least four employers and many hours of standard working group meetings, committee meetings, presentations, and ballot reviews. NISO Ann Marie Cunningham Service Award I did not know Ms Cunningham, the award’s namesake. My first job started when she was the NFAIS executive director in the early 1990s, and I hadn’t been active in the profession yet. I read her brief biography on the NISO website: The Ann Marie Cunningham Service award was established in 1994 to honor NFAIS members who routinely went above and beyond the normal call of duty to serve the organization. It is named after Ann Marie Cunningham who, while working with abstracting and information services such as Biological Abstracts and the Institute for Scientific Information (both now part of NISO-member Clarivate Analytics), worked tirelessly as an dedicated NFAIS volunteer. She ultimately served as the NFAIS Executive Director from 1991 to 1994 when she died unexpectedly. NISO is pleased to continue to present this award to honor a NISO volunteer who has shown the same sort of commitment to serving our organization. As I searched the internet for her name, I came across the proceedings of the 1993 NFAIS meeting, in which Ms Cunningham wrote the introduction with Wendy Wicks. These first sentences from some of the paragraphs of that introduction are as true today as they were then: In an era of rapidly expanding network access, time and distance no longer separate people from information. Much has been said about the global promise of the Internet and the emerging concept of linking information highways, to some people, “free” ways. What many in the networking community, however, seem to take for granted is the availability of vital information flowing on these high-speed links. I wonder what Ms Cunningham of 1993 would think of the information landscape today? Hypertext linking has certainly taken off, if not taken over, the networked information landscape. How that interconnectedness has improved with the adaptation of print-oriented standards and the creation of new standards that match the native capabilities of the network. In just one corner of that space, we have the adoption of PDF as a faithful print replica and HTML as a common tool for displaying information. In another corner, MARC has morphed into a communication format that far exceeds its original purpose of encoding catalog cards; we have an explosion of purpose-built metadata schemas and always the challenge of finding common ground in tools like Dublin Core and Schema.org. We’ve seen several generations of tools and protocols for encoding, distributing, and combining data in new ways to reach users. And still we strive to make it better…to more easily deliver a paper to its reader—a dataset to its next experimenter—an idea to be built upon by the next generation. It is that communal effort to make a better common space for ideas that drives me forward. To work in a community at the intersection of libraries, publishers, and service providers is an exciting and fulfilling place to be. I’m grateful to my employers that have given me the ability to participate while bringing the benefits of that connectedness to my organizations. I was not able to be at NISO Plus to accept the award in person, but I was so happy to be handed it by Jason Griffey of NISO about a week later during the Code4lib conference in Pittsburgh. What made that even more special was to learn that Jason created it on his own 3D printer. Thank you to the new NFAIS-joined-with-NISO community for honoring me with this service award. Tethering a Ubiquity Network to a Mobile Hotspot I saw it happen. The cable-chewing device The contractor in the neighbor’s back yard with the Ditch Witch trencher burying a cable. I was working outside at the patio table and just about to go into a Zoom meeting. Then the internet dropped out. Suddenly, and with a wrenching feeling in my gut, I remembered where the feed line was buried between the house and the cable company’s pedestal in the right-of-way between the properties. Yup, he had just cut it. To be fair, the utility locator service did not mark the my cable’s location, and he was working for a different cable provider than the one we use. (There are three providers in our neighborhood.) It did mean, though, that our broadband internet would be out until my provider could come and run another line. It took an hour of moping about the situation to figure out a solution, then another couple of hours to put it in place: an iPhone tethered to a Raspberry Pi that acted as a network bridge to my home network’s UniFi Security Gateway 3P. Network diagram with tethered iPhone A few years ago I was tired of dealing with spotty consumer internet routers and upgraded the house to UniFi gear from Ubiquity. Rob Pickering, a college comrade, had written about his experience with the gear and I was impressed. It wasn’t a cheap upgrade, but it was well worth it. (Especially now with four people in the household working and schooling from home during the COVID-19 outbreak.) The UniFi Security Gateway has three network ports, and I was using two: one for the uplink to my cable internet provider (WAN) and one for the local area network (LAN) in the house. The third port can be configured as another WAN uplink or as another LAN port. And you can tell the Security Gateway to use the second WAN as a failover for the first WAN (or as load balancing the first WAN). So that is straight forward enough, but do I get the Personal Hotspot on the iPhone to the second WAN port? That is where the Raspberry Pi comes in. The Raspberry Pi is a small computer with USB, ethernet, HDMI, and audio ports. The version I had laying around is a Raspberry Pi 2—an older model, but plenty powerful enough to be the network bridge between the iPhone and the home network. The toughest part was bootstrapping the operating system packages onto the Pi with only the iPhone Personal Hotspot as the network. That is what I’m documenting here for future reference. Bootstrapping the Raspberry Pi The Raspberry Pi runs its own operating system called Raspbian (a Debian/Linux derivative) as well as more mainstream operating systems. I chose to use the Ubuntu Server for Raspberry Pi instead of Raspbian because I’m more familiar with Ubuntu. I tethered my MacBook Pro to the iPhone to download the Ubuntu 18.04.4 LTS image and follow the instructions for copying that disk image to the Pi’s microSD card. That allows me to boot the Pi with Ubuntu and a basic set of operating system packages. The Challenge: Getting the required networking packages onto the Pi It would have been really nice to plug the iPhone into the Pi with a USB-Lightning cable and have it find the tethered network. That doesn’t work, though. Ubuntu needs at least the usbmuxd package in order to see the tethered iPhone as a network device. That package isn’t a part of the disk image download. And of course I can’t plug my Pi into the home network to download it (see first paragraph of this post). My only choice was to tether the Pi to the iPhone over WiFi with a USB network adapter. And that was a bit of Ubuntu voodoo. Fortunately, I found instructions on configuring Ubuntu to use a WPA-protected wireless network (like the one that the iPhone Personal Hotspot is providing). In brief: sudo -i cd /root wpa_passphrase my_ssid my_ssid_passphrase > wpa.conf screen -q wpa_supplicant -Dwext -iwlan0 -c/root/wpa.conf <control-a> c dhclient -r dhclient wlan0 Explanation of lines: Use sudo to get a root shell Change directory to root’s home Use the wpa_passphrase command to create a wpa.conf file. Replace my_ssid with the wireless network name provided by the iPhone (your iPhone’s name) and my_ssid_passphrase with the wireless network passphrase (see the “Wi-Fi Password” field in Settings -> Personal Hotspot). Start the screen program (quietly) so we can have multiple pseudo terminals. Run the wpa_supplicant command to connect to the iPhone wifi hotspot. We run this the foreground so we can see the status/error messages; this program must continue running to stay connected to the wifi network. Use the screen hotkey to create a new pseudo terminal. This is control-a followed by a letter c. Use dhclient to clear out any DHCP network parameters Use dhclient to get an IP address from the iPhone over the wireless network. Now I was at the point where I could install Ubuntu packages. (I ran ping www.google.com to verify network connectivity.) To install the usbmuxd and network bridge packages (and their prerequisites): apt-get install usbmuxd bridge-utils If your experience is like mine, you’ll get an error back: couldn't get lock /var/lib/dpkg/lock-frontend The Ubuntu Pi machine is now on the network, and the automatic process to install security updates is running. That locks the Ubuntu package registry until it finishes. That took about 30 minutes for me. (I imagine this varies based on the capacity of your tethered network and the number of security updates that need to be downloaded.) I monitored the progress of the automated process with the htop command and tried the apt-get command when it finished. If you are following along, now would be a good time to skip ahead to Configuring the UniFi Security Gateway if you haven’t already set that up. Turning the Raspberry Pi into a Network Bridge With all of the software packages installed, I restarted the Pi to complete the update: shutdown -r now While it was rebooting, I pulled out the USB wireless adapter from the Pi and plugged in the iPhone’s USB cable. The Pi now saw the iPhone as eth1, but the network did not start until I went to the iPhone to say that I “Trust” the computer that it is plugged into. When I did that, I ran these commands on the Ubuntu Pi: dhclient eth1 brctl addbr iphonetether brctl addif iphonetether eth0 eth1 brctl stp iphonetether on ifconfig iphonetether up Explanation of lines: Get an IP address from the iPhone over the USB interface Add a network bridge (the iphonetether is an arbitrary string; some instructions simply use br0 for the zero-ith bridge) Add the two ethernet interfaces to the network bridge Turn on the Spanning Tree Protocol (I don’t think this is actually necessary, but it does no harm) Bring up the bridge interface The bridge is now live! Thanks to Amitkumar Pal for the hints about using the Pi as a network bridge. More details about the bridge networking software is on the Debian Wiki. Note! I'm using a hardwired keyboard/monitor to set up the Raspbery Pi. I've heard from someone that was using SSH to run these commands, and the SSH connection would break off at brctl addif iphonetecther eth0 eth1 Configuring the UniFi Security Gateway I have a UniFi Cloud Key, so I could change the configuration of the UniFi network with a browser. (You’ll need to know the IP address of the Cloud Key; hopefully you have that somewhere.) I connected to my Cloud Key at https://192.168.1.58:8443/ and clicked through the self-signed certificate warning. First I set up a second Wide Area Network (WAN—your uplink to the internet) for the iPhone Personal Hotspot: Settings -> Internet -> WAN Networks. Select “Create a New Network”: Network Name: Backup WAN IPV4 Connection Type: Use DHCP IPv6 Connection Types: Use DHCPv6 DNS Server: 1.1.1.1 and 1.0.0.1 (CloudFlare’s DNS servers) Load Balancing: Failover only The last selection is key…I wanted the gateway to only use this WAN interfaces as a backup to the main broadband interface. If the broadband comes back up, I want to stop using the tethered iPhone! Second, assign the Backup WAN to the LAN2/WAN2 port on the Security Gateway (Devices -> Gateway -> Ports -> Configure interfaces): Port WAN2/LAN2 Network: WAN2 Speed/Duplex: Autonegotiate Apply the changes to provision the Security Gateway. After about 45 seconds, the Security Gateway failed over from “WAN iface eth0” (my broadband connection) to “WAN iface eth2” (my tethered iPhone through the Pi bridge). These showed up as alerts in the UniFi interface. Performance and Results So I’m pretty happy with this setup. The family has been running simultaneous Zoom calls and web browsing on the home network, and the performance has been mostly normal. Web pages do take a little longer to load, but whatever Zoom is using to dynamically adjust its bandwidth usage is doing quite well. This is chewing through the mobile data quota pretty fast, so it isn’t something I want to do every day. Knowing that this is possible, though, is a big relief. As a bonus, the iPhone is staying charged via the 1 amp power coming through the Pi.
feeds-feedburner-com-1276 ---- None
feeds-feedburner-com-1424 ---- None
feeds-feedburner-com-1541 ---- commonplace.net commonplace.net Data. The final frontier. Infrastructure for heritage institutions – Open and Linked Data In my June 2020 post in this series, “Infrastructure for heritage institutions – change of course ” , I said: “The results of both Data Licences and the Data Quality projects (Object PID’s, Controlled Vocabularies, Metadata Set) will go into the new Data Publication project, which will be undertaken in the second half of 2020. This project is aimed at publishing our collection data as open and linked data in various formats via various channels. A […] Infrastructure for heritage institutions – ARK PID’s In the Digital Infrastructure program at the Library of the University of Amsterdam we have reached a first milestone. In my previous post in the Infrastructure for heritage institutions series, “Change of course“, I mentioned the coming implementation of ARK persistent identifiers for our collection objects. Since November 3, 2020, ARK PID’s are available for our university library Alma catalogue through the Primo user interface. Implementation of ARK PID’s for the other collection description systems […] Infrastructure for heritage institutions – change of course In July 2019 I published the first post about our planning to realise a “coherent and future proof digital infrastructure” for the Library of the University of Amsterdam. In February I reported on the first results. As frequently happens, since then the conditions have changed, and naturally we had to adapt the direction we are following to achieve our goals. In other words: a change of course, of course. Projects I will leave aside the […] Infrastructure for heritage institutions – first results In July 2019 I published the post Infrastructure for heritage institutions in which I described our planning to realise a “coherent and future proof digital infrastructure” for the Library of the University of Amsterdam. Time to look back: how far have we come? And time to look forward: what’s in store for the near future? Ongoing activities I mentioned three “currently ongoing activities”: Monitoring and advising on infrastructural aspects of new projects Maintaining a structured dynamic overview […] Infrastructure for heritage institutions During my vacation I saw this tweet by LIBER about topics to address, as suggested by the participants of the LIBER 2019 conference in Dublin: It shows a word cloud (yes, a word cloud) containing a large number of terms. I list the ones I can read without zooming in (so the most suggested ones, I guess), more or less grouped thematically: Open scienceOpen dataOpen accessLicensingCopyrightsLinked open dataOpen educationCitizen science Scholarly communicationDigital humanities/DHDigital scholarshipResearch assessmentResearch […] Ten years linked open data This post is the English translation of my original article in Dutch, published in META (2016-3), the Flemish journal for information professionals. Ten years after the term “linked data” was introduced by Tim Berners-Lee it appears to be time to take stock of the impact of linked data for libraries and other heritage institutions in the past and in the future. I will do this from a personal historical perspective, as a library technology professional, […] Maps, dictionaries and guidebooks Interoperability in heterogeneous library data landscapes Libraries have to deal with a highly opaque landscape of heterogeneous data sources, data types, data formats, data flows, data transformations and data redundancies, which I have earlier characterized as a “data maze”. The level and magnitude of this opacity and heterogeneity varies with the amount of content types and the number of services that the library is responsible for. Academic and national libraries are possibly dealing with more […] Standard deviations in data modeling, mapping and manipulation Or: Anything goes. What are we thinking? An impression of ELAG 2015 This year’s ELAG conference in Stockholm was one of many questions. Not only the usual questions following each presentation (always elicited in the form of yet another question: “Any questions?”). But also philosophical ones (Why? What?). And practical ones (What time? Where? How? How much?). And there were some answers too, fortunately. This is my rather personal impression of the event. For a […] Analysing library data flows for efficient innovation In my work at the Library of the University of Amsterdam I am currently taking a step forward by actually taking a step back from a number of forefront activities in discovery, linked open data and integrated research information towards a more hidden, but also more fundamental enterprise in the area of data infrastructure and information architecture. All for a good cause, for in the end a good data infrastructure is essential for delivering high […] Looking for data tricks in Libraryland IFLA 2014 Annual World Library and Information Congress Lyon – Libraries, Citizens, Societies: Confluence for Knowledge After attending the IFLA 2014 Library Linked Data Satellite Meeting in Paris I travelled to Lyon for the first three days (August 17-19) of the IFLA 2014 Annual World Library and Information Congress. This year’s theme “Libraries, Citizens, Societies: Confluence for Knowledge” was named after the confluence or convergence of the rivers Rhône and Saône where the city of […]
feeds-feedburner-com-1596 ---- None
feeds-feedburner-com-1672 ---- None
feeds-feedburner-com-1898 ---- None
feeds-feedburner-com-2091 ---- None
feeds-feedburner-com-253 ---- None
feeds-feedburner-com-2567 ---- None
feeds-feedburner-com-2585 ---- None
feeds-feedburner-com-2637 ---- None
feeds-feedburner-com-28 ---- Dan Cohen Dan Cohen Vice Provost, Dean, and Professor at Northeastern University When We Look Back on 2020, What Will We See? It is far too early to understand what happened in this historic year of 2020, but not too soon to grasp what we will write that history from: data—really big data, gathered from our devices and ourselves. Sometimes a new technology provides an important lens through which a historical event is recorded, viewed, and remembered. […] More than THAT “Less talk, more grok.” That was one of our early mottos at THATCamp, The Humanities and Technology Camp, which started at the Roy Rosenzweig Center for History and New Media at George Mason University in 2008. It was a riff on “Less talk, more rock,” the motto of WAAF, the hard rock station in Worcester, Massachusetts. And […] Humane Ingenuity: My New Newsletter With the start of this academic year, I’m launching a new newsletter to explore technology that helps rather than hurts human understanding, and human understanding that helps us create better technology. It’s called Humane Ingenuity, and you can subscribe here. (It’s free, just drop your email address into that link.) Subscribers to this blog know […] Engagement Is the Enemy of Serendipity Whenever I’m grumpy about an update to a technology I use, I try to perform a self-audit examining why I’m unhappy about this change. It’s a helpful exercise since we are all by nature resistant to even minor alterations to the technologies we use every day (which is why website redesign is now a synonym […] On the Response to My Atlantic Essay on the Decline in the Use of Print Books in Universities I was not expecting—but was gratified to see—an enormous response to my latest piece in The Atlantic, “The Books of College Libraries Are Turning Into Wallpaper,” on the seemingly inexorable decline in the circulation of print books on campus. I’m not sure that I’ve ever written anything that has generated as much feedback, commentary, and […] What’s New Season 2 Wrap-up With the end of the academic year at Northeastern University, the library wraps up our What’s New podcast, an interview series with researchers who help us understand, in plainspoken ways, some of the latest discoveries and ideas about our world. This year’s slate of podcasts, like last year’s, was extraordinarily diverse, ranging from the threat […] When a Presidential Library Is Digital I’ve got a new piece over at The Atlantic on Barack Obama’s prospective presidential library, which will be digital rather than physical. This has caused some consternation. We need to realize, however, that the Obama library is already largely digital: The vast majority of the record his presidency left behind consists not of evocative handwritten […] Robin Sloan’s Fusion of Technology and Humanity When Roy Rosenzweig and I wrote Digital History 15 years ago, we spent a lot of time thinking about the overall tone and approach of the book. It seemed to us that there were, on the one hand, a lot of our colleagues in professional history who were adamantly opposed to the use of digital […] Presidential Libraries and the Digitization of Our Lives Buried in the recent debates (New York Times, Chicago Tribune, The Public Historian) about the nature, objectives, and location of the Obama Presidential Center is the inexorable move toward a world in which virtually all of the documentation about our lives is digital. To make this decades-long shift—now almost complete—clear, I made the following infographic […] Kathleen Fitzpatrick’s Generous Thinking Generosity and thoughtfulness are not in abundance right now, and so Kathleen Fitzpatrick‘s important new book, Generous Thinking: A Radical Approach to Saving the University, is wholeheartedly welcome. The generosity Kathleen seeks relates to lost virtues, such as listening to others and deconstructing barriers between groups. As such, Generous Thinking can be helpfully read alongside […]
feeds-feedburner-com-3181 ---- None
feeds-feedburner-com-3245 ---- Library Hat Library Hat http://www.bohyunkim.net/blog/ Blockchain: Merits, Issues, and Suggestions for Compelling Use Cases * This post was also published in ACRL TechConnect.*** Blockchain holds a great potential for both innovation and disruption. The adoption of blockchain also poses certain risks, and those risks will need to be addressed and mitigated before blockchain becomes mainstream. A lot of people have heard of blockchain at this point. But many are […] Taking Diversity to the Next Level ** This post was also published in ACRL TechConnect on Dec. 18, 2017.*** Getting Minorities on Board I recently moderated a panel discussion program titled “Building Bridges in a Divisive Climate: Diversity in Libraries, Archives, and Museums.”1 Participating in organizing this program was interesting experience. During the whole time, I experienced my perspective constantly shifting […] From Need to Want: How to Maximize Social Impact for Libraries, Archives, and Museums At the NDP at Three event organized by IMLS yesterday, Sayeed Choudhury on the “Open Scholarly Communications” panel suggested that libraries think about return on impact in addition to return on investment (ROI). He further elaborated on this point by proposing a possible description of such impact. His description was that when an object or […] How to Price 3D Printing Service Fees ** This post was originally published in ACRL TechConnect on May. 22, 2017.*** Many libraries today provide 3D printing service. But not all of them can afford to do so for free. While free 3D printing may be ideal, it can jeopardize the sustainability of the service over time. Nevertheless, many libraries tend to worry […] Post-Election Statements and Messages that Reaffirm Diversity These are statements and messages sent out publicly or internally to re-affirm diversity, equity, and inclusion by libraries or higher ed institutions. I have collected these – some myself and many others through my fellow librarians. Some of them were listed on my blog post, “Finding the Right Words in Post-Election Libraries and Higher Ed.” […] Finding the Right Words in Post-Election Libraries and Higher Ed ** This post was originally published in ACRL TechConnect on Nov. 15, 2016.*** This year’s election result has presented a huge challenge to all of us who work in higher education and libraries. Usually, libraries, universities, and colleges do not comment on presidential election result and we refrain from talking about politics at work. But […] Say It Out Loud – Diversity, Equity, and Inclusion I usually and mostly talk about technology. But technology is so far away from my thought right now. I don’t feel that I can afford to worry about Internet surveillance or how to protect privacy at this moment. Not that they are unimportant. Such a worry is real and deserves our attention and investigation. But […] Cybersecurity, Usability, Online Privacy, and Digital Surveillance ** This post was originally published in ACRL TechConnect on May. 9, 2016.*** Cybersecurity is an interesting and important topic, one closely connected to those of online privacy and digital surveillance. Many of us know that it is difficult to keep things private on the Internet. The Internet was invented to share things with others […] Three Recent Talks of Mine on UX, Data Visualization, and IT Management I have been swamped at work and pretty quiet here in my blog. But I gave a few talks recently. So I wanted to share those at least. I presented about how to turn the traditional library IT department and its operation that is usually behind the scene into a more patron-facing unit at the recent American Library Association Midwinter […] Near Us and Libraries, Robots Have Arrived ** This post was originally published in ACRL TechConnect on Oct. 12, 2015.*** The movie, Robot and Frank, describes the future in which the elderly have a robot as their companion and also as a helper. The robot monitors various activities that relate to both mental and physical health and helps Frank with various house chores. […]
feeds-feedburner-com-3300 ---- None
feeds-feedburner-com-3407 ---- None
feeds-feedburner-com-3583 ---- None
feeds-feedburner-com-3668 ---- None
feeds-feedburner-com-3993 ---- None
feeds-feedburner-com-4030 ---- None
feeds-feedburner-com-4422 ---- None
feeds-feedburner-com-45 ---- None
feeds-feedburner-com-4754 ---- Zotero Zotero Collect, organize, cite, and share your research Move Zotero Citations Between Google Docs, Word, and LibreOffice Last year, we added Google Docs integration to Zotero, bringing to Google Docs the same powerful citation functionality — with support for over 9,000 citation styles — that Zotero offers in Word and LibreOffice. Today we’re adding a feature that lets you move documents between Google Docs and Word or LibreOffice while preserving active Zotero citations. […] Retracted item notifications with Retraction Watch integration Zotero can now help you avoid relying on retracted publications in your research by automatically checking your database and documents for works that have been retracted. We’re providing this service in partnership with Retraction Watch, which maintains the largest database of retractions available, and we’re proud to help sustain their important work. How It Works […] Scan Books into Zotero from Your iPhone or iPad Zotero makes it easy to collect research materials with a single click as you browse the web, but what do you do when you want to add a real, physical book to your Zotero library? If you have an iPhone or iPad running iOS 12, you can now save a book to Zotero just by […] Zotero Comes to Google Docs We’re excited to announce the availability of Zotero integration with Google Docs, joining Zotero’s existing support for Microsoft Word and LibreOffice. The same powerful functionality that Zotero has long offered for traditional word processors is now available for Google Docs. You can quickly search for items in your Zotero library, add page numbers and other […] Improved PDF retrieval with Unpaywall integration As an organization dedicated to developing free and open-source research tools, we care deeply about open access to scholarship. With the latest version of Zotero, we’re excited to make it easier than ever to find PDFs for the items in your Zotero library. While Zotero has always been able to download PDFs automatically as you […] Introducing ZoteroBib: Perfect bibliographies in minutes We think Zotero is the best tool for almost anyone doing serious research, but we know that a lot of people — including many students — don’t need all of Zotero’s power just to create the occasional bibliography. Today, we’re introducing ZoteroBib, a free service to help people quickly create perfect bibliographies. Powered by the same technology […] Zotero 5.0.36: New PDF features, faster citing in large documents, and more The latest version of Zotero introduces some major improvements for PDF-based workflows, a new citing mode that can greatly speed up the use of the word processor plugin in large documents, and various other improvements and bug fixes. New PDF features Improved PDF metadata retrieval While the “Save to Zotero” button in the Zotero Connector […] Zotero 5.0 and Firefox: Frequently Asked Questions In A Unified Zotero Experience, we explained the changes introduced in Zotero 5.0 that affect Zotero for Firefox users. See that post for a full explanation of the change, and read on for some additional answers. What’s changing? Zotero 5.0 is available only as a standalone program, and Zotero 4.0 for Firefox is being replaced […] New Features for Chrome and Safari Connectors We are excited to announce major improvements to the Zotero Connectors for Chrome and Safari. Chrome The Zotero Connector for Chrome now includes functionality that was previously available only in Zotero for Firefox. Automatic Institutional Proxy Detection Many institutions provide a way to access electronic resources while you are off-campus by signing in to a […] A Unified Zotero Experience Since the introduction of Zotero Standalone in 2011, Zotero users have had two versions to choose from: the original Firefox extension, Zotero for Firefox, which provides deep integration into the Firefox user interface, and Zotero Standalone, which runs as a separate program and can be used with any browser. Starting with the release of Zotero […]
feeds-feedburner-com-4881 ---- None
feeds-feedburner-com-5022 ---- None
feeds-feedburner-com-5237 ---- None
feeds-feedburner-com-5315 ---- What I Learned Today… What I Learned Today… Taking a Break I’m sure those of you who are still reading have noticed that I haven’t been updating this site much in the past few years. I was sharing my links with you all but now Delicious has started adding ads to that. I’m going to rethink how I can use this site effectively going forward. For […] Bookmarks for May 3, 2016 Today I found the following resources and bookmarked them on Delicious. Start A Fire Grow and expand your audience by recommending your content within any link you share Digest powered by RSS Digest Bookmarks for April 4, 2016 Today I found the following resources and bookmarked them on Delicious. Mattermost Mattermost is an open source, self-hosted Slack-alternative mBlock Program your app, Arduino projects and robots by dragging & dropping Fidus Writer Fidus Writer is an online collaborative editor especially made for academics who need to use citations and/or formulas. Beek Social network for […] Bookmarks for February 25, 2016 Today I found the following resources and bookmarked them on Delicious. Connfa Open Source iOS & Android App for Conferences & Events Paperless Scan, index, and archive all of your paper documents Foss2Serve Foss2serve promotes student learning via participation in humanitarian Free and Open Source Software (FOSS) projects. Disk Inventory X Disk Inventory X is […] Bookmarks for January 9, 2016 Today I found the following resources and bookmarked them on Delicious. Superpowers The open source, extensible, collaborative HTML5 2D+3D game maker Sequel Pro Sequel Pro is a fast, easy-to-use Mac database management application for working with MySQL databases. Digest powered by RSS Digest Bookmarks for December 11, 2015 Today I found the following resources and bookmarked them on Delicious. Open Broadcaster Software Free, open source software for live streaming and recording Digest powered by RSS Digest Bookmarks for November 22, 2015 Today I found the following resources and bookmarked them on Delicious. NumFOCUS Foundation NumFOCUS promotes and supports the ongoing research and development of open-source computing tools through educational, community, and public channels. Digest powered by RSS Digest Bookmarks for November 16, 2015 Today I found the following resources and bookmarked them on Delicious. Smore Smore makes it easy to design beautiful and effective online flyers and newsletters. Ninite Install and Update All Your Programs at Once Digest powered by RSS Digest Bookmarks for November 13, 2015 Today I found the following resources and bookmarked them on Delicious. VIM Adventures Learning VIM while playing a game Digest powered by RSS Digest Bookmarks for November 10, 2015 Today I found the following resources and bookmarked them on Delicious. Star Wars: Building a Galaxy with Code Digest powered by RSS Digest Bookmarks for October 31, 2015 Today I found the following resources and bookmarked them on Delicious. Open Food Facts Open Food Facts gathers information and data on food products from around the world. Digest powered by RSS Digest Bookmarks for October 27, 2015 Today I found the following resources and bookmarked them on Delicious. VersionPress WordPress meets Git, properly. Undo anything (including database changes), clone & merge your sites, maintain efficient backups, all with unmatched simplicity. Digest powered by RSS Digest Bookmarks for October 20, 2015 Today I found the following resources and bookmarked them on Delicious. SOGo Share your calendars, address books and mails in your community with a completely free and open source solution. Let your Mozilla Thunderbird/Lightning, Microsoft Outlook, Android, Apple iCal/iPhone and BlackBerry users collaborate using a modern platform. GitBook GitBook is a modern publishing toolchain. Making […] Bookmarks for October 19, 2015 Today I found the following resources and bookmarked them on Delicious. Discourse Discourse is the 100% open source discussion platform built for the next decade of the Internet. It works as a mailing list, a discussion forum, and a long-form chat room Digest powered by RSS Digest Bookmarks for September 28, 2015 Today I found the following resources and bookmarked them on Delicious. Zulip A group chat application optimized for software development teams Digest powered by RSS Digest Bookmarks for September 25, 2015 Today I found the following resources and bookmarked them on Delicious. iDoneThis Reply to an evening email reminder with what you did that day. The next day, get a digest with what everyone on the team got done. Digest powered by RSS Digest Bookmarks for September 22, 2015 Today I found the following resources and bookmarked them on Delicious. Vector Vector is a new, fully open source communication and collaboration tool we’ve developed that’s open, secure and interoperable. Based on the concept of rooms and participants, it combines a great user interface with all core functions we need (chat, file transfer, VoIP and […] Bookmarks for September 11, 2015 Today I found the following resources and bookmarked them on Delicious. Roundcube Free and Open Source Webmail Software Bolt Bolt is an open source Content Management Tool, which strives to be as simple and straightforward as possible. It is quick to set up, easy to configure, uses elegant templates, and above all: It’s a joy […] Bookmarks for September 10, 2015 Today I found the following resources and bookmarked them on Delicious. MadEye MadEye is a collaborative web editor backed by your filesystem. Digest powered by RSS Digest Bookmarks for September 6, 2015 Today I found the following resources and bookmarked them on Delicious. Gimlet Your library’s questions and answers put to their best use. Know when your desk will be busy. Everyone on your staff can find answers to difficult questions. Digest powered by RSS Digest Bookmarks for September 2, 2015 Today I found the following resources and bookmarked them on Delicious. Thimble by Mozilla Thimble is an online code editor that makes it easy to create and publish your own web pages while learning HTML, CSS & JavaScript. Google Coder a simple way to make web stuff on Raspberry Pi Digest powered by RSS Digest Bookmarks for August 23, 2015 Today I found the following resources and bookmarked them on Delicious. MediaGoblin MediaGoblin is a free software media publishing platform that anyone can run. You can think of it as a decentralized alternative to Flickr, YouTube, SoundCloud, etc. The Architecture of Open Source Applications A web whiteboard A Web Whiteboard is touch-friendly online whiteboard app […] Bookmarks for August 6, 2015 Today I found the following resources and bookmarked them on Delicious. Computer Science Learning Opportunities We have developed a range of resources, programs, scholarships, and grant opportunities to engage students and educators around the world interested in computer science. Digest powered by RSS Digest Bookmarks for August 3, 2015 Today I found the following resources and bookmarked them on Delicious. Pydio The mature open source alternative to Dropbox and box.net Digest powered by RSS Digest Bookmarks for July 23, 2015 Today I found the following resources and bookmarked them on Delicious. hylafax The world’s most advanced open source fax server Digest powered by RSS Digest
feeds-feedburner-com-5531 ---- None
feeds-feedburner-com-5596 ---- HubLog by Alf Eatonsearch From PUB to pubpub: a history of rich text editing May 4, 2021 Continuous deployment of a web service on Cloud Run March 14, 2021 Creating and deploying a web service using Cloud Run's continuous deployment, GitHub integration and Cloud Build's buildpacks cloud runnode.jsgithubBuilding amd64 Docker images with arm64 (M1) macOS March 7, 2021 Using docker buildx bake to build Docker images for different system architectures docker"git scraping" data from the Office for National Statistics API March 7, 2021 Fetching and publishing regularly-updated data as a web service with GitHub Actions and Datasette github actiondatasettecsvsqliteDocker on a Raspberry Pi 400 December 14, 2020 Using armv8 Docker images on a Raspberry Pi 400 DockerRaspberry PiARMAn Express app as a web service in Cloud Functions July 6, 2020 Deploying a simple web service to Cloud Functions node.jscloud functionsAn Express app as a web service in Cloud Run July 5, 2020 Deploying a simple web service to Cloud Run node.jscloud runA single-author web app hosted on Cloud Run June 13, 2020 Developing, building and deploying a single-author web app blogjavascriptexpressnode.jscloud rungithubSending a raw HTTPS request May 1, 2020 Storing, editing and sending a multipart/form-data request over HTTPS Converting PDF to PNG or JPEG September 13, 2019 Tools and services for converting a page of a PDF to an image How to build a user interface April 4, 2019 The 5 steps of designing a software product May 20, 2018 Designing a user interface for moving data from one state to another OpenID Connect March 13, 2018 A summary of the OpenID Connect protocol and its usage for authentication in an SPA Serving a web application over HTTPS February 16, 2018 Using nginx and LetsEncrypt to serve a web application over HTTPS JANICE: a prototype re-implementation of JANE, using the Semantic Scholar Open Research Corpus January 19, 2018 Formatting a LaCie external drive for Time Machine January 18, 2018 Indexing Semantic Scholar's Open Research Corpus in Elasticsearch January 4, 2018 Building an Elasticsearch index of Semantic Scholar's Open Research Corpus dataset A single-user blog October 22, 2017 Building a simple blog using React and Firebase Recovering from a failed macOS High Sierra upgrade October 18, 2017 OAuth in a Chrome extension October 16, 2017 ES6 export/import August 14, 2017 Exporting/importing/re-exporting ES6 modules Styling and theming React Components August 10, 2017 Using CSS in JS to style and theme React components async is more than await April 20, 2017 Symfony Forms March 23, 2017 Symfony is best at allowing users to apply mutations to resources via HTML forms Polymer + Firebase Makefile October 17, 2016 A Makefile for deploying Polymer apps to Firebase Distributed Consensus April 1, 2016 What Aaron understood September 11, 2015 What colour is a tree? September 11, 2015 Collections of items in time and space Fetching Web Resources September 10, 2015 Using Resource and Collection interfaces to retrieve data from the web Quantifying journals September 10, 2015 Metrics for scoring and ranking journals It's a shame about Google Plus September 10, 2015 URLs for people Distributed Asynchronous Composable Resources September 10, 2015 Filling out data tables using promises and computed properties Access-Control-Allow-Origin: * April 21, 2015 Add the Access-Control-Allow-Origin: * header to the data you publish No More Documents April 19, 2015 Client-side XML validation in JavaScript April 18, 2015 Using an Emscripten port of xmllint to validate XML against a DTD in a web browser. Organising, building and deploying static web sites/applications March 1, 2015 Using Jekyll (remote or local) or Yeoman (local) to build, serve and deploy a GitHub Pages site or application Visualising political donations February 15, 2015 Using Tableau Public to visualise donations to UK political parties Force-directed tag clouds February 15, 2015 Using artists as the dark matter in a graph of tags, to visualise the thematic content of radio shows Exploring a personal Twitter network January 25, 2015 Using Gephi to create a network graph showing the most highly-connected Twitter friends of those I follow. Searching for mergeable tables January 12, 2015 Finding tabular data sets that can be merged, using URLs for data types UK Prospective Parliamentary Candidates January 4, 2015 The people who will be standing as candidates in the 2015 General Election Creating a map of Grade I listed buildings January 4, 2015 Filtering an Environment Agency Shapefile to create a custom map UK parliamentary constituencies January 3, 2015 Boundaries, names and codes of the UK's parliamentary constituencies The trouble with scientific software December 31, 2014 Scientific software is often opaque, and difficult to obtain and cite Archiving and displaying tweets with dat September 18, 2014 Don't just publish JSON-LD June 19, 2014 Publish plain, simple JSON, with a linked context document for consumers that want it vege-table: the data table that grows, with leaves May 16, 2014 The easiest, most resourceful way to harvest, explore and publish a collection of data. Line-oriented data formats February 26, 2014 Iterating Arrays February 20, 2014 JavaScript methods for iterating arrays Publishing research on the web January 27, 2014 Two examples of publishing code, data and a human-readable report jQuery Microdata January 13, 2014 A jQuery plugin for working with HTML Microdata Creating printable cards with HTML and CSS December 22, 2013 Use HTML and CSS to fill a printed card with content Post-humanist technology December 19, 2013 If you can't tell why a technology would be useful to you, it's for the robots Collecting article metrics with OpenRefine December 16, 2013 Using OpenRefine to collect article metrics data JSON templates December 16, 2013 Using JSON templates to describe objects and query by example JSON-LD December 12, 2013 Using context documents to map local property names to shared URLs CSV on the Web, with PHP December 12, 2013 Fetching, parsing and publishing CSV Publishing, Versioning and Persistence December 12, 2013 Some rules for publishing a resource online SELECT * FROM WEB December 11, 2013 OK Guha Describing Objects December 11, 2013 Using names and classes as shorthand for object properties Switching off HubMed's RSS and Atom feeds August 14, 2013 HubMed's RSS and Atom feeds are discontinued Web Components July 7, 2013 Using Web Components to define custom HTML elements Internet Surveillance June 10, 2013 Methods of gathering information from the internet. Citing Articles Within Articles March 2, 2013 HTML markup for inline citations in scholarly articles Open, Social, Academic Bookmarking: Save to App.net February 5, 2013 Using App.net's File API to create an open, personal reading library. HTML metadata for journal articles November 28, 2012 A summary of ontologies for describing journal articles Ten years of HubMed November 28, 2012 An overview of the ten years since HubMed was created Publishing a podcast using Google Drive (in theory) September 20, 2012 Generate a podcast feed for audio files stored on Google Drive, using Apps Script and Yahoo Pipes Publishing Articles Using Gists September 5, 2012 Introducing macrodocs.org, a client-side renderer for articles stored in Gists Music Seeds and More Like These August 17, 2012 Sources for music recommendation; querying by example Querying Data Sets using Google BigQuery August 17, 2012 Using Google Fusion Tables to provide an API to data files August 15, 2012 Resourceful Web Interfaces August 2, 2012 Classlessness June 26, 2012 A Resourceful Alternative to OAI-PMH June 4, 2012 Adding Files to Google Drive using PHP May 1, 2012 Working with the Harvard Library Bibliographic Dataset April 27, 2012 BBC Radio -> XSPF Bookmarklet March 12, 2012 How To Text Mine Open Access Documents February 22, 2012 Open Access Author Manuscripts in PubMed Central February 20, 2012 ISSN(L)s And Serial Title Abbreviations February 9, 2012 Extracting Text From A PDF Using Only Javascript November 18, 2011 Open Graph wins the Semantic Web September 29, 2011 Citing With URIs in Google Docs September 16, 2011 Client-Side PubMed Searching July 23, 2011 Capturing a manipulated web page with PhantomJS March 25, 2011 This Weblog In (Some) URLs March 6, 2011 A Modular System for Automatic Entity Extraction and Manual Annotation of Academic Papers February 3, 2011 Getting and Sending Binary Files with XMLHttpRequest December 15, 2010 AOTY 2010 November 18, 2010 ReCo: a music recommender October 18, 2010 Artists October 7, 2010 Creating a single file, lossless rip of a DVD chapter in Ubuntu August 22, 2010 London Cycle Hire data/apps August 7, 2010 Writing Firefox Add-ons with the JetPack SDK July 31, 2010 UK Fuel Consumption for Energy Use July 1, 2010 Current UK Reservoir Stocks July 1, 2010 eCryptfs in Ubuntu (Lucid) June 27, 2010 Using STIX fonts with @font-face June 10, 2010 Inline annotations/formatting in HTML May 20, 2010 Command line Twitter authentication using the PECL OAuth library May 20, 2010 Automatically mounting a remote directory in Ubuntu using autofs + sshfs May 15, 2010 A Simple Hit Counter with Node.js and Redis May 13, 2010 Voting Correlation (UK General Election 2010) May 9, 2010 UK General Election 2010 May 8, 2010 Installing PHP 5.3 etc on Ubuntu Karmic (9.10) May 5, 2010 Maps at the British Library, and on the BBC May 4, 2010 mapstvBillions April 15, 2010 Archiving Timestamped Copies of Bookmarked Web Content March 30, 2010 A WSDL 2.0 description of the EUtils EFetch web service March 28, 2010 phpschemaxmlREST Web Services, XML and Data Typing March 27, 2010 phpxmlGoogle Bookmarks Lists March 24, 2010 googlelistsmapsA Solr index of Wikipedia on EC2/EBS March 17, 2010 ec2lucenesolrMapping XML Named Character References to Unicode Characters March 16, 2010 A Pipe for New Episodes in a BBC series March 8, 2010 bbce4xjavascriptpipesrdfxmlyahooyqlIndependent UK Record Labels on Spotify March 4, 2010 Adding Spotify links to BBC Radio playlists, via RDFa, using Greasemonkey and rdfQuery March 2, 2010 Indexing JSON data in MongoDB using PHP February 23, 2010 Showing Delicious bookmarks of pages within a domain February 19, 2010 ElasticSearch in PHP February 16, 2010 Describing REST APIs with HTML5 forms February 2, 2010 The Top Google Search Result for each Unicode Character January 22, 2010 Listing Unicode Characters January 22, 2010 Spotify Playlist: The Hype Machine Top 1000 Albums of 2009 January 21, 2010 On A Bus updated January 19, 2010 Using the Bing Maps Web Services in PHP January 19, 2010 Publishing Files using a Public Folder in Google Docs January 12, 2010 Web Applications January 11, 2010 Installing platform-specific applications January 11, 2010 Operating Systems and Application Launching January 11, 2010 An OS X Single Site Browser with HTML5 Storage Support? January 6, 2010 A Basic Web App With A Settings Page, Using jQTouch and PHP January 5, 2010 OpenURL + OpenSearch January 4, 2010 Map Overlays January 2, 2010 mapsThird-Party Cookies December 23, 2009 Spotify lookup and Playdar in AOTY December 10, 2009 aotyplaydarspotifyOpenSearch + YQL December 10, 2009 Importing GeoPlanet data into MySQL December 10, 2009 Semantic Assistants November 16, 2009 Text Mining November 16, 2009 SoyLatte: Java 1.6 for 32-bit OS X November 11, 2009 javaosxTransforming XML files with XSLT 2.0 and Saxon-HE on OS X, using an XML catalog October 26, 2009 xmlLatest NPG articles in PubMed Central October 22, 2009 Exploring PubChem via SPARQL October 7, 2009 Bacode October 7, 2009 Yahoo! APIs Terms of Use changed October 2, 2009 Using PubMed's autocomplete data in JQuery September 30, 2009 HTML template September 30, 2009 htmlSheevaPlug as a Torrent Seed Box September 19, 2009 Graphing weather time series data with Timetric September 10, 2009 dataweatherConverting PDF to PNG using ImageMagick or Ghostscript August 20, 2009 The Music Industry (version) August 11, 2009 QR code testing on the iPhone August 7, 2009 Embedding chemical structure information in image files August 6, 2009 applescriptchemistryUsing the Tesco API with PHP August 5, 2009 apiphpTopic Modelling with MALLET August 3, 2009 Travel with an iPhone August 2, 2009 iphonetravelMarking up a bibliographic reference with RDFa July 30, 2009 Entities in Scientific News Stories June 18, 2009 onabus.com June 16, 2009 Annotation of Scientific Articles June 14, 2009 annotationNow Playing in Songbird June 14, 2009 musicnow-playingsongbirdA Private Radio Archive June 14, 2009 notuberadioDealing with election results data June 11, 2009 Adding Bing search results to Google June 4, 2009 Extracting keyphrases from documents using MeSH terms and KEA June 1, 2009 Scraping with YQL Execute June 1, 2009 scrapingClustering documents with CLUTO May 28, 2009 Exploring an OAI-PMH repository May 26, 2009 oaiYahoo! PlaceMaker May 21, 2009 apilocationyahooFetching article citation counts from Web of Science May 21, 2009 apiPHP, DOM, DTDs and named entities May 20, 2009 phpxmlPHP, DOM and XML encodings May 20, 2009 phpxmlRecording video from a webcam in Ubuntu May 17, 2009 ubuntuvideoQuerying BBC programmes in a Talis data store May 15, 2009 bbcrdfuriOAI, YQL and JSON May 14, 2009 phpyqlWhat's the Unicode character for "irony"? May 7, 2009 Updating local copies of databases and ontologies May 6, 2009 Server-side DOM scraping with Javascript: options April 29, 2009 domjavascriptSolr/Lucene on EC2/EBS April 20, 2009 ec2lucenesolrInstalling CouchDB from source on OS X April 17, 2009 Everything? April 7, 2009 Playdar as an OpenURL resolver? April 3, 2009 audiocoinsopenurlplaydarresolutionGraph of new albums added to Spotify April 1, 2009 Analysing 'science' bookmarks in Delicious March 29, 2009 deliciousPosting shared items from Google Reader to Delicious March 29, 2009 deliciousphpResolving URLs with PHP March 29, 2009 phpFinding all occurrences of a UTF-8-encoded needle in a UTF-8-encoded haystack March 25, 2009 phpUsing YQL and Pipes to make a screensaver of The Big Picture March 25, 2009 pipesyqlPages tagged as 'science' on Delicious, by co-tags March 21, 2009 delicioussciencePopular pages tagged as 'science' on Delicious March 21, 2009 deliciousscienceSelecting Wikipedia articles by InChI March 20, 2009 chemistryinchirdfContent Hashing March 19, 2009 similarityYQL Open Data Tables March 16, 2009 scrapingyqlFestive 50 Spotify Playlists March 15, 2009 playlistsradioxspfTfL feeds March 13, 2009 Semantic/Scientific Authoring Add-ins for Microsoft Word March 13, 2009 publishingsemanticData, Science and Stories March 12, 2009 dataMusic Recipe March 12, 2009 musicDelicious Network Meme Tracker March 12, 2009 deliciousComparing similar articles and categorisation with Wikipedia March 12, 2009 Fetching articles from the NY Times API March 11, 2009 apiGuardian + Lucene = Similar Articles + Categorisation March 10, 2009 Guardian Open Platform March 10, 2009 apiCloudMade February 23, 2009 mapsAn open question to authors of text mining tools February 22, 2009 text-miningHTML + WMV -> XSPF + MP4 February 21, 2009 phpvideoAnalysing the ticTOCs collection of journal TOC feeds February 18, 2009 Freebase: Types, Topics, Timelines and Mentions February 7, 2009 freebaseontologyGoogle, jQuery and plugin loading February 3, 2009 googlejavascriptjqueryYouMomus February 2, 2009 BigMaps with Modest Maps January 31, 2009 mapsQuestion for a map January 31, 2009 mapsBigMaps with CutyCapt and Xvfb January 30, 2009 ecsstract: Scraping in XULRunner with JSON/CSS selectors January 29, 2009 Generating Standard Chemical Identifiers (Standard InChI) January 22, 2009 PubMed XML in eXist on OS X January 21, 2009 Difficult Album Titles of 2008 January 19, 2009 musicPrivacy online: prevent tracking using Adblock Plus' site-specific filters January 19, 2009 adblockprivacyExtracting a certificate/key pair from a Java keystore January 19, 2009 Spotified SXSW Catalog January 19, 2009 greasemonkeyspotifyDefining scraper mappings using CSS selectors January 19, 2009 An Annotated Timeline of U.S. Public Debt, using Google Spreadsheet and Google Calendar January 16, 2009 dataGenerative art in Second Life January 13, 2009 Installing an independent PHP 5.3 to run from the command line January 13, 2009 phpNotes on using the Ubuntu EC2 AMI January 13, 2009 Events! January 11, 2009 Radio Now January 6, 2009 iplayerradioUbuntu on EC2 January 5, 2009 Displaying new episodes from BBC iPlayer January 4, 2009 bbciplayertvZemanta API January 2, 2009 Making a Lucene index of Wikipedia for MoreLikeThis queries January 2, 2009 lucenephpwikipediaAlbums of the Year collages January 1, 2009 musicEnd-of-year TV (UK only) January 1, 2009 tvSkyrails December 19, 2008 graphnetworkvisualisationSpotification December 19, 2008 greasemonkeyUniProt / RDF / SPARQL December 19, 2008 rdfuniprotGetting a visitor's location (city) December 15, 2008 Browse My Privates December 10, 2008 Firefox 3.1, maxVersion for extensions December 10, 2008 firefoxAlbums of the Year 2008 December 10, 2008 nokeepalive December 9, 2008 POTAtoo December 6, 2008 greasemonkeySongbird links and bookmarks December 3, 2008 Libxml2, PHP and UTF-8 December 2, 2008 The 16 Most Interesting Regions in Second Life November 24, 2008 secondlifeOn A Bus November 21, 2008 iphonemapstransportSecond Life person pseudo-APIs November 17, 2008 Second Life region APIs November 13, 2008 secondlifeSecond Life BigMap November 11, 2008 Mouse coordinates bookmarklet November 11, 2008 bookmarkletEncoding AAC/MP4 audio files on OS X November 11, 2008 audioosxInline Wikipedia History, updated November 11, 2008 greasemonkeywikipediaIntrepid vs NVIDIA November 9, 2008 ubuntuNational Public Transport Data Repository data November 9, 2008 transportRoyal Mail PAF data November 9, 2008 dataTransport Direct API November 9, 2008 apiphptransportGetting Started in Second Life November 8, 2008 secondlifeJSONP, Google Spreadsheet security October 29, 2008 securityUIMA October 28, 2008 Minimal PHP script for downloading PubMed XML October 23, 2008 phppubmedMinimal PHP script for downloading PubMed XML (with error checking) October 23, 2008 phppubmedHuffduffer October 22, 2008 Who Cares About Open Access October 21, 2008 publishingscienceSecond Life: "Teleport to Camera Position" October 9, 2008 second lifeVideo Encoding Recommendations October 2, 2008 videoMaximise OS X windows with a keyboard shortcut September 26, 2008 Query Parameters in URIs September 26, 2008 Logout/Login CSRF September 24, 2008 Pure Data September 22, 2008 audiopuredataPlaylist Builder using Freebase Suggest September 22, 2008 freebasemetadataWeb Playlist Tool September 22, 2008 mediaplaylistsPreprints and Categorisation September 18, 2008 Creating a Freebase data view September 18, 2008 datafreebaseRasmus Lerdorf on PHP performance September 14, 2008 phpUbiquity PubMed search September 12, 2008 Audacity September 12, 2008 PHP, SimpleXML, XPath and namespaced attributes September 11, 2008 Removing 'for each' from Javascript examples September 10, 2008 PubMed JSON API September 8, 2008 apijavascriptjsonpubmedLinux music players: compilations and watching folders September 7, 2008 audiolinuxBBC AOD Filter Pipe September 4, 2008 audiobbcpipesGoPubMed export API September 4, 2008 Ubiquity commands September 2, 2008 National Rail bus service sparklines September 1, 2008 businfographictransportGmail MenuExtra SSB in Fluid August 29, 2008 Veodia August 28, 2008 second lifevideoPulseAudio resampling August 28, 2008 audioprojectM-pulseaudio August 27, 2008 audioubuntu,visualisationLondon: cycling and walking route maps August 26, 2008 London: Visitors bus map, mobile TFL August 26, 2008 PulseAudio voodoo August 24, 2008 audioubuntuUKPA negotiates a licence for commercial music podcasting August 23, 2008 podcastGeoNames NearbyWikipedia API August 21, 2008 apijavascriptjquerylocationwikipediaAideRSS PostRank API August 21, 2008 apijqueryUK Postcode -> Bus Stop prototype August 20, 2008 maptransport400,000 bus stops August 20, 2008 locationphpFull-text feeds as a route around censorship August 20, 2008 feedsEPUB and Stanza August 20, 2008 epubliteraturepdfMendeley August 19, 2008 bibliographypdfCreating MapTube maps with Neighbourhood Statistics data August 19, 2008 mapsAn Amazon Wishlist Competition/Contest August 18, 2008 amazoncompetitionwishlistListen Later updated August 18, 2008 audiobbcextensionfirefoxMobile bus departures August 18, 2008 locationtransportUpload to Google Docs bookmarklet August 18, 2008 bookmarkletgoogleGrowl Alerts for Gmail Messages from Address Book August 18, 2008 applescriptgmailRadio 4 Comedy Feeds August 18, 2008 bbcradioSending a URL from Safari to Firefox August 18, 2008 applescriptosxWriting an Atom feed in PHP 5 August 13, 2008 atomphpHow to Share a Social Network August 12, 2008 portabilityprivacyLocatory August 11, 2008 Britain From Above August 10, 2008 bbctvMeta-TV August 8, 2008 tviPhone reader for Google Reader Starred Items August 8, 2008 feedsgoogleiphoneFree August 6, 2008 iphoneCOUNT/DISTINCT queries August 5, 2008 mysqlrdfxqueryManipulating Forms in Google Spreadsheets August 4, 2008 googlespreadsheetsTiddlyWiki zoomable interface August 4, 2008 tiddlywikiiPhone interface for Delicious Network August 4, 2008 deliciousiphoneMapping Statistics mini-presentation at BarCamb August 4, 2008 mapsDS Game Classics July 29, 2008 dsgamesLondon Age Distribution Maps Part 2 July 29, 2008 mapsLondon Age Distribution Maps July 29, 2008 mapsdata URI for a Google search box July 26, 2008 googleiphoneSecurity Email Addresses that are Black Holes July 26, 2008 securityBeware of the App July 26, 2008 iphonesecurityXMPP comments July 26, 2008 xmppUpcoming API (PHP5) July 24, 2008 apiphpSend PDFs from Skim to Gmail July 24, 2008 applescriptgmailpdfListen Direct /programmes July 17, 2008 bbcgreasemonkeyradioInstalling Java Advanced Imaging in Ubuntu Hardy July 12, 2008 javaubuntuConvert AMR files to WAV in Ubuntu Hardy July 9, 2008 audiolinuxubuntuNeighbourhood Statistics API July 4, 2008 apiphpsoapOrdnance Survey-based BigMap of the UK July 2, 2008 mapArtist -> BBC Radio Shows lookup June 24, 2008 bbcmusicphpradioSoul Bubbles June 22, 2008 gamesEssential Add-ons for Firefox 3 June 19, 2008 extensionsfirefoxChris Wetherell on Google Reader June 18, 2008 feedsgooglePod-U-Like June 17, 2008 app-enginepodcastsUsing Google to Fetch All of a Feed's Items June 17, 2008 apifeedsgooglephpFirefox, OpenSearch and Autocomplete June 14, 2008 firefoxopensearchOpenCalais API June 11, 2008 apiSkim: Open All With Papers June 9, 2008 applescriptosxpdfTumblr Auto-Pager June 9, 2008 greasemonkeyWebClipCountUpDown June 7, 2008 csssafariCreate a calendar from del.icio.us bookmarks June 6, 2008 calendardel.icio.usPod News June 5, 2008 podcastsBringing a publisher's content to the Life Science researcher May 29, 2008 presentationpublishingslidestext-miningThe rules of Web 3.0 May 28, 2008 Publications May 28, 2008 app-enginemedlineopensocialpublicationspythonOn the Rain-Slick Precipice of Darkness, from Penny Arcade May 25, 2008 gameOpenSocial terminology May 24, 2008 opensocialMy Speediest Gatherers updated May 21, 2008 del.icio.usphpUpgrading to Gmail May 11, 2008 emailWith or Without UIDs May 8, 2008 metadatapresentationsearchslidesxtechI'm Feeling Unlucky May 8, 2008 googlegreasemonkeyMeta Latest May 7, 2008 searchDealing with corrupt preference files on OS X May 4, 2008 osxRecipeBook April 29, 2008 drupalrecipebookrecipesMixingIt April 26, 2008 drupalminingphpradiotextGazelle April 22, 2008 musicp2pNow Playing on the radio April 22, 2008 bbcradioxmppRealPlayer 11 for Linux April 21, 2008 linuxradiorealplayerPubMed search URL April 16, 2008 pubmedHow to Make Someone Fetch a URL with a Blank Referer Header April 15, 2008 securityReification April 15, 2008 rdfSecurity against SQL injection in Wordpress April 14, 2008 phpsecuritywordpressTwubble April 10, 2008 twitterGoogle Docs April 7, 2008 Code quality in contributed Drupal modules April 5, 2008 drupalNDS April 2, 2008 dsgamesSecure password hashing April 1, 2008 drupalopenpasswordssecuritysourcewordpressHow IdentiFight works April 1, 2008 identifightprivacySemgine's myMap for exploring semantic networks of information April 1, 2008 datagraphinterfacerdfVST instruments in Linux March 30, 2008 linuxvstGoogle Site Search bookmarklet March 30, 2008 bookmarkletgoogleBookMooch, LibraryThing March 30, 2008 booksSneetchalizer March 28, 2008 audiolinuxLast.fm Fingerprinting Client March 28, 2008 last.fmmetadatamusicDecentralised music subscription services March 28, 2008 musicDrupalCPP March 28, 2008 drupalS01E01 March 28, 2008 tvPenguin March 28, 2008 booksIdentiFight additions March 27, 2008 identifightprivacyIdentiFight March 26, 2008 identifightprivacySpokeo March 18, 2008 identityPHP script for downloading MP4 files from iPlayer March 16, 2008 bbcphpTopCited March 13, 2008 citationpublishingDownload TV shows from the BBC iPlayer as MP4 March 8, 2008 bbctvClimate Change March 4, 2008 climate-changeconferenceparticipationLocating London Buses March 3, 2008 busesopen-dataBuilding a "Now Playing" Wall February 20, 2008 amarokxmppMusicBrainz artist info API February 17, 2008 apimusicbrainzphpLast.fm artist info API February 17, 2008 lastfmphp"Relation" metadata February 14, 2008 metadatapublishingXMPP, Publish-Subscribe, PEP and User Tune February 14, 2008 pubsubxmppFull OpenURL metadata from CrossRef February 14, 2008 openurlSetting the height of a cross-domain iframe using postMessage February 13, 2008 htmljavascriptNo Frills Fullscreen February 12, 2008 extensionsfirefoxKitte February 12, 2008 designwordpressCrossRef Citation plugin February 11, 2008 citationcrossref"Play in Sidebar" Firefox extension February 6, 2008 audioextensionfirefoxplaylistvlcCoding Niggles February 5, 2008 codeZowbar February 5, 2008 firefoxmetadatazoterorefactormycode February 3, 2008 codeWindows-less? February 3, 2008 linuxmusicrenoisewindowsCanon printers in Ubuntu February 3, 2008 printubuntuLinking to papers February 3, 2008 citationconversationsdisambiguationUnpredictability of influence January 29, 2008 XMPP January 27, 2008 firefoxxmppUpdating "Selected Text" Bookmarklets January 25, 2008 bookmarkletsFinding Conversations around Academic Publications January 24, 2008 citationconversationscintillaCanonical PubMed URLs January 22, 2008 pubmedListen Later January 22, 2008 bbcextensionfirefoxradioHow a Firefox Extension Works January 22, 2008 extensionsfirefoxFSDL January 21, 2008 searchSingle Window mode January 21, 2008 firefoxMozilla, Chrome and FUEL January 21, 2008 firefoxFirefox 3, del.icio.us posting extension January 21, 2008 del.icio.usextensionfirefoxOpenURLed January 18, 2008 openurlFeed Deltas: What's Changed? January 18, 2008 feedsBlog Remix January 16, 2008 musicxspfAnnotations in XML January 16, 2008 annotationSubmitting Author Manuscripts to PubMed Central January 15, 2008 publishingDepositing Nature articles in PubMed Central January 15, 2008 natureopen-accesspublishingBPR3 markup January 14, 2008 citationmicroformatsCrowbar January 14, 2008 scrapingzoteroThe Long Arm of Copyright January 13, 2008 copyrightgamesAll Nature papers now available online January 10, 2008 natureAccessing the UMLSKS SOAP Web Service using PHP5 January 10, 2008 apiphpCoverFlow-ish for Newest Amarok Albums January 6, 2008 amarokphpCommunicating with Amarok from a local web page January 6, 2008 amarokHTTP POST in PHP5 January 6, 2008 phpArchiving del.icio.us bookmarks January 3, 2008 del.icio.usdrupalprojectM in Amarok December 28, 2007 audiovisualisationContextLinks Amarok plugin December 23, 2007 amarokAmarok: Record Labels from MusicBrainz December 22, 2007 amarokmusicbrainzpythonAmarok: Album Release Dates from MusicBrainz December 22, 2007 amarokmusicbrainzpythonTV on the Internet December 20, 2007 bbctvBBC Cross-Platform iPlayer December 18, 2007 bbcradiotvBest Albums of 2007 lists December 18, 2007 drupalmusicPresenting replicates in a table December 11, 2007 datahtmlpublishingCharting features December 7, 2007 datajavascriptvisualisationAIR December 5, 2007 e4xEasylistener bookmarklet December 5, 2007 bookmarkletplayrAIDA Toolkit Entity Extraction API December 3, 2007 medlineminingReasons for loving CASH Music December 3, 2007 musicmyExperiment December 3, 2007 bioinformaticsXNAT workflow December 3, 2007 scienceFirefox's Sandbox December 2, 2007 firefoxsecurityjQuery in Zotero November 29, 2007 jqueryzoteroThe World is 67108864 Pixels at Zoom Level 5 November 28, 2007 googlemapConditionally hiding HTML elements with jQuery/CSS November 27, 2007 jqueryAmazon AWS API November 26, 2007 amazonapiPubChem (EUtilities) API November 20, 2007 apieutilsphpCross-platform Javascript omissions November 20, 2007 javascriptRenoise November 18, 2007 musicrenoiseSideload/MP3tunes vs EMI November 15, 2007 copyrightmusicPredictive accuracy is substantially improved when blending multiple predictors November 14, 2007 algorithmsServer-side scraping with Javascript November 12, 2007 javascriptmetadataCureHunter's graph viewer November 9, 2007 visualisationScraping web pages with PHP 5 November 8, 2007 phpscrapingMaking a screencast November 8, 2007 screencastvideorev="review" November 8, 2007 citationmicroformatsPreserving PDF metadata November 6, 2007 metadatapdfGutsy November 6, 2007 ubuntuBPR3 November 5, 2007 citationmicroformatsStill OiNK-less November 3, 2007 musicp2pted November 1, 2007 p2ptvMySpace -> File2HD Greasemonkey script November 1, 2007 greasemonkeyMetadata Scrapers October 31, 2007 metadatadel.icio.us / earlier October 31, 2007 del.icio.usHype Machine October 17, 2007 musicsongbirdGetting a local copy of MEDLINE October 9, 2007 medlinephppubmedBBC Radio Player as a separate application, with WebRunner October 6, 2007 bbcfirefoxradioI Forgot My Password October 3, 2007 securityXUL FTW October 3, 2007 xulFix SSH in Mac OS X by reinstalling Kerberos.framework October 1, 2007 osxMail -> Thunderbird October 1, 2007 emailMethods for private Atom/RSS feeds October 1, 2007 feedssecurityLinux and wireless devices September 30, 2007 linuxwifiGmail vulnerability September 27, 2007 emailsecurityThings that Taste Great Together September 20, 2007 Notes From DrupalCon Barcelona 2007 September 20, 2007 drupalUpdate: Artist popularity in specific countries September 12, 2007 lastfmNCBI Resource Locator September 11, 2007 pubmedhCalendar, Microformats and Google Calendar September 10, 2007 microformatsDealing with hard drives in Ubuntu September 8, 2007 ubuntuLondon Cinema Today September 4, 2007 cinemadrupalHigh Usage of PubMed's "Related Articles" August 23, 2007 pubmedsearchInline Wikipedia History August 22, 2007 greasemonkeywikipediaOn The Wire has a podcast August 21, 2007 radioMusicSun August 16, 2007 audioscrobblervisualisationNon-destructive faceted browsing August 15, 2007 searchvisualisationquite |kw?t| August 15, 2007 Adding Random Email Addresses to Facebook August 15, 2007 Geocoding APIs August 14, 2007 apigeoGene Network API August 14, 2007 apibioinformaticsphpPostgenomic API August 14, 2007 apicitationWhatizit API August 14, 2007 apibioinformaticsphpPubMed API August 13, 2007 apiphppubmedClearForest SWS API August 13, 2007 apimetadataphpCSS Workarounds for Internet Explorer < 7 August 3, 2007 cssWikipedia API July 31, 2007 apiFreebase API July 30, 2007 apiScopus API July 30, 2007 apicitationRSS Nightmare July 30, 2007 feedsLazyTube July 26, 2007 screencastvideoPublishing data tables July 26, 2007 datapublishingUser Styles July 19, 2007 cssFarewell Azureus July 19, 2007 p2pEPUB and Adobe Digital Editions July 14, 2007 publishingIf It's Ready, Release It July 13, 2007 musicOpera Mini 4 Beta July 9, 2007 Faceted Search in Solr/Drupal July 3, 2007 drupalsearchmusic.of.interest July 1, 2007 musicPeel Sessions July 1, 2007 drupalradioScintilla June 14, 2007 naturescintillaCreate a Google Custom Search Engine on the fly June 14, 2007 googlesearchXTech 2007 Science BOF slides June 7, 2007 presentationxtechUnofficial London RSS feeds June 6, 2007 feedslondonBenchmarking PHP 5.2.3 string manipulation June 5, 2007 phpBenchmarking PHP 5.1.4 string manipulation June 2, 2007 phpExpanding Abbreviations in HubMed June 1, 2007 hubmedMahalo June 1, 2007 searchPodule #10 May 31, 2007 podulesLast.fm listening graph May 31, 2007 lastfmvisualisationPodcast Awards May 30, 2007 podcastXSS vulnerabilities by PageRank May 30, 2007 securityRIAA-safe Top 100 May 24, 2007 musicp2pCompiling and installing Xalan on OS X May 24, 2007 osxProgramming Language Reference Widgets for Dashboard May 23, 2007 osxWebjay → last.fm playlists May 22, 2007 lastfmplaylistsNotes From XTech 2007 May 22, 2007 xtechPredictions/Observations for 2007 May 16, 2007 Mobile Feed Reader May 10, 2007 feedsReal-time, 32-bit audio processing May 10, 2007 audioPlay This Gene May 3, 2007 greasemonkeyItems You Rated in Amazon May 2, 2007 amazonrecommendationRate items quickly in Amazon with Greasemonkey April 30, 2007 amazongreasemonkeyXTech 2007 April 29, 2007 xtechMultiple "Related Articles" in PubMed April 26, 2007 pubmedR4DS April 25, 2007 ds2500 album covers April 25, 2007 musicvisualisationFetching cover art for a list of albums April 25, 2007 amarokmusicmusicbrainzpythonAdd publications from HubMed to PublicationsList.org April 23, 2007 greasemonkeyhubmedpublicationsMirror last.fm listening statistics April 4, 2007 lastfmmusicphpMobile Mapping/GPS April 3, 2007 gpsZotero ? HubMed Tags April 1, 2007 extensionfirefoxhubmedzoteroOwnership of user-contributed data March 31, 2007 data-portabilityTouchGraph relaunched March 29, 2007 touchgraphAmarok → Last.fm links (My First Ruby) March 29, 2007 amaroklastfmmusicrubyAdding MusicBrainz data to an Amarok database March 29, 2007 amarokmusicmusicbrainzpythonSmall Pieces Please March 27, 2007 p2pThe Sorry State of Online Music March 27, 2007 musicVideo Aggregators March 27, 2007 video32-bit Firefox on 64-bit Ubuntu March 27, 2007 ubuntuWhat's on your Google Homepage? March 26, 2007 googleVisual Scrapers March 26, 2007 automationscrapingXHTML vs HTML March 9, 2007 xhtmlFour Tenets of Web Security March 8, 2007 securityOne column layouts March 6, 2007 cssFirefox offline browsing March 4, 2007 firefoxpublishinglast.fm user listening data March 3, 2007 lastfmScientific article conversations and distributed libraries February 20, 2007 citationSearch-and-replace February 19, 2007 bashWarning: don't use hpmount February 17, 2007 linuxPLoS One February 13, 2007 publishingOpenSearchFox February 13, 2007 extensionfirefoxCopying bookmarks from del.icio.us to Connotea February 13, 2007 bookmarksdel.icio.use4xgreasemonkeyGetting an audio file in another format from an M4P on OS X February 8, 2007 audioosxmemcached and Drupal February 8, 2007 drupalDrupal module for Solr February 8, 2007 drupalsearchUbuntu Edgy, Bluetooth and Sony Ericsson k800i February 6, 2007 mobileubuntuMAME reviews February 5, 2007 drupalgamesA web interface to search and download albums in an Amarok library February 4, 2007 amarokphpQ: What am I using iTunes for? January 31, 2007 musicPosting machine tags to del.icio.us January 25, 2007 del.icio.usDrupal 5 January 21, 2007 drupalBeryl 0.2 beta2 January 21, 2007 berylubuntuBT have been busy January 21, 2007 btThings You Need To Play Arcade Games January 20, 2007 gamesdvd::rip January 19, 2007 dvdlinuxNew server January 13, 2007 server365 Days Of London widget January 2, 2007 drupallondonosxPLoS Too December 23, 2006 drupalpublishingmetrack December 21, 2006 del.icio.usgreasemonkeyAutomatically play YouTube videos in a full window December 17, 2006 greasemonkeyyoutubePlaying web video in fullscreen December 17, 2006 playlistsTits & Sharks & Acid December 5, 2006 audiomashupNautilus Actions December 1, 2006 ubuntuPlaying YouTube videos in Ubuntu December 1, 2006 ubuntuvideoSound from a microphone on HDA Intel in Ubuntu December 1, 2006 ubuntumetalicious November 28, 2006 javascriptperlMusicBrainz Picard Tagger November 26, 2006 metadatamusicmusicbrainzUniform Requirements for Manuscripts November 20, 2006 citationVisual jQuery user style November 13, 2006 cssjqueryCheap-ish Windows XP November 7, 2006 windowsGeocoding UK postcodes with PostcodeAnywhere November 7, 2006 geophpYahoo! Bookmarks November 2, 2006 bookmarksGMap Geocoding UK Postcodes November 2, 2006 geoLast.fm events calendar October 21, 2006 lastfmNovelty vs Necessity October 21, 2006 ubuntuFitting in Ubuntu October 19, 2006 firefoxubuntuAmarok, MySQL, JSON and Greasemonkey October 19, 2006 amarokgreasemonkeyphpThe case of the disappearing comments October 16, 2006 Wikipedia export format for citing papers from HubMed October 16, 2006 greasemonkeyhubmedunapiwikipediaTGN1412 analysis in The Lancet October 16, 2006 immunologytgn1412HubMed speed October 16, 2006 hubmedNNW Sneak Peek Release October 16, 2006 netnewswireZotero and compound documents October 11, 2006 metadatapublishingzoteroMetaphors that have had their day October 9, 2006 Google Webpage Gadgets October 4, 2006 googleprivacyDreamhost promotion today October 3, 2006 MSN.co.uk doesn't rank Firefox October 1, 2006 firefoxsearchI Candy September 30, 2006 ubuntuAll You Need On A (Consumer) PC September 29, 2006 appsosxubuntuwindowsUbuntu and Core2 Duo PCs September 25, 2006 ubuntuMigrate Movable Type to Drupal (4.7) September 22, 2006 drupalmtSecurity as a non-admin user in OS X September 21, 2006 securityNetNewsWire: "Mark All As Read And Proceed" September 20, 2006 netnewswireBuilding a site to handle images in Drupal September 17, 2006 drupalBT Home Hub September 16, 2006 btPodcasts For People Who Say They Don't Know Any Good Podcasts September 7, 2006 podcastsSharing a list of podcasts September 7, 2006 podcastsFirefox 2 Beta 2 September 4, 2006 firefoxWhy is MySpace popular August 30, 2006 myspace2 Steps to Making MySpace Nicer August 28, 2006 cssgreasemonkeymyspaceScan in iTunes August 21, 2006 applescriptitunesGenerate a bookmarklet to automate offprint requests August 12, 2006 bookmarkletpublishingNature.com CSS August 1, 2006 cssnaturestylishCleanliness July 28, 2006 osxNotate July 27, 2006 annotationpublishingAggademia July 26, 2006 aggregationdrupalnatureunAPI link enabler for Greasemonkey July 25, 2006 greasemonkeyunapiHubMed paper in Nucleic Acids Research July 17, 2006 hubmedSphere It! July 5, 2006 bookmarkletRSS feeds for Bloglines citation searches July 4, 2006 bloglinesfeedsFerret: Lucene for Ruby July 3, 2006 lucenerubysearch2006-06-28 Data Webs Conference June 28, 2006 conferenceMore About/Like This Page June 25, 2006 bookmarkletsMapping and Tagging Greasemonkey scripts June 22, 2006 connoteagreasemonkeyGraph your Connotea library June 22, 2006 connoteatouchgraphvisualisationXSL files for publishing from NLM XML May 30, 2006 publishingxslLucene 2.0 May 29, 2006 lucenesearchMeSH information in HubMed May 24, 2006 hubmedmeshPodule #8 May 22, 2006 podulesQuery statistics in HubMed May 17, 2006 hubmedSentence ordering in OTMI May 17, 2006 text-miningGoogle Co-op May 15, 2006 googlesearchAdd HubMed links to Google search results May 11, 2006 greasemonkeyhubmedAdd radio commands to BBC Radio Player May 11, 2006 bbcgreasemonkeyradioStructure of a scientific article May 9, 2006 publishingRelated Articles algorithms May 9, 2006 hubmedHealth-related queries in Google May 8, 2006 googleRecommendations from HubMed May 6, 2006 hubmedrecommendationA Plan for Publishing Journal Articles May 6, 2006 publishingTreemaps of MEDLINE May 3, 2006 medlinevisualisationPlaying Streaming Radio [RealAudio, BBC, OS X] Through an Airport Express May 3, 2006 osxA Network of Politicians and Interviewers/Journalists on the BBC May 1, 2006 touchgraophvisualisationTouchGraph of BBC TV/Radio Collaborators April 30, 2006 bbctouchgraphvisualisationRecent Papers in HubMed Search Results April 30, 2006 hubmedPersonalisation and Privacy April 28, 2006 hubmedpersonalisationMarkov-chained text from MEDLINE abstracts April 19, 2006 medlineiTunes Alarm Clock (iCal + Applescript) April 19, 2006 applescriptitunesosxEmail notifications in Gnome April 17, 2006 emailubuntuDocument clustering in HubMed April 12, 2006 hubmedRecording Streaming Radio (improved) April 12, 2006 bashradioVLC, XSPF, Dapper and Tango April 10, 2006 playlistsubuntuOpen Text Mining Interface (OTMI) April 7, 2006 text-miningInterDB links in HubMed April 7, 2006 hubmedex-HTML April 1, 2006 htmlHubMed extension for MediaWiki March 29, 2006 hubmedCTLA-4-Ig March 25, 2006 immunologyAdobe XMP SDK 4 beta March 25, 2006 metadatapdfxmpPeer Review with Marginalia March 25, 2006 annotationpublishingFulltext links from HubMed's feeds March 24, 2006 hubmedA Week of TV in Pictures (comedy, mostly) March 24, 2006 tvCriticker March 23, 2006 filmrecommendationFeedback down March 20, 2006 Playr's XSPF player March 20, 2006 playrPodule #7 March 18, 2006 podulesTGN1412 March 17, 2006 immunologytgn1412My Most Played Artists This Week, from Last.fm March 17, 2006 lastfmXHTML, SVG and MathML March 16, 2006 xhtmlGetting Document Elements Out Of The Clipboard March 16, 2006 bookmarkletHobbs on Rewind March 12, 2006 Lots of Comment Spam March 10, 2006 mtGetting Document Elements Into The Clipboard March 10, 2006 bookmarkletExclusive Photo of the New Google Colander March 8, 2006 googleCopy and Paste with unAPI March 7, 2006 unapiLinking and Storing Supplementary Data March 7, 2006 dataNotepress for Wordpress 2 March 6, 2006 wordpressConnecting to the Nintendo WFC March 1, 2006 dsSupplementary Data March 1, 2006 dataBluetooth Intellimouse Explorer on OS X March 1, 2006 osxSound in Ubuntu February 27, 2006 ubuntuTorrentbot missed some episodes February 26, 2006 p2pManaging Metadata for Academic PDFs February 21, 2006 bibdeskbibtexmetadatapdfScalable Bar Charts with Tables and CSS February 20, 2006 cssOpenURL For Music February 20, 2006 openurlPimp My Paper! February 18, 2006 publishingWhere to Download Firefox February 16, 2006 firefoxsearchUniProt Creative Commons licensed, available as RDF February 10, 2006 rdfThe state of online biomedical full text articles February 10, 2006 publishingAllFullText February 8, 2006 bookmarkletshubmedA_List of Podcasts February 7, 2006 podcastsThe State of Biomedical PDFs February 6, 2006 publishingManaging Academic Papers (almost) Like MP3s February 3, 2006 publishingQuery Expansion in HubMed February 3, 2006 hubmedWebphones February 3, 2006 audioAuthor Contributions in Scientific Paper Metadata February 2, 2006 publishingUpcoming.org simple event posting form February 2, 2006 calendareventsInterview with David Lipman of the NCBI February 2, 2006 pubmedBritish Albums vs Mercury Nominees February 2, 2006 musicPodule #6 January 31, 2006 podulesThings That Reek Of Greatness January 21, 2006 Normalising URIs January 18, 2006 citationAd-hoc XML databases with MySQL 5.1 January 18, 2006 mysqlxlmPubMed lookup for Structure Blogging January 12, 2006 hubmednotepressRelevance-ranked search results in HubMed January 12, 2006 hubmedPopulate iTunes With Webjay Playlists update January 11, 2006 applescriptituneswebjayNLM2MODS January 11, 2006 xsltCreating an Atom feed in Perl January 10, 2006 atomperlTV January 9, 2006 tvCreating an OpenOffice document in Perl January 9, 2006 openofficeperlA suggestion for OpenSearch January 9, 2006 opensearchListenable retrospectives January 7, 2006 feedsmusicBest Albums of 2006 January 7, 2006 musicrvwHubMed BibTeX changes January 6, 2006 bibtexhubmedCiteProxy January 5, 2006 citationidentifiersmodsxmlReading Feeds January 3, 2006 feedsosxsoftwaremp3blog TopList updated January 2, 2006 blogsmusicVideo chat between Mac and PC December 31, 2005 imosxvideoA script for Slogger December 30, 2005 bookmarksextensionfirefoxMachineProse December 18, 2005 biomedicalontologypublishingrdfAcademic metadata workflow December 17, 2005 metadataNow That's What I Call Weblogs... Vol 1 December 15, 2005 weblogsGoogle Music Search December 15, 2005 googleUpdated OpenSearch templates for Movable Type December 13, 2005 mtMore Useful Firefox Extensions December 12, 2005 firefoxDragThing [OS X] December 12, 2005 osxsoftwareEasyNews search plugin December 11, 2005 firefoxsearchpluginsSpacer December 11, 2005 bookmarkletExtracting Knowledge from Biomedical Text December 8, 2005 biomedicalhubmedrdftextBioinformatics Workflows December 8, 2005 bioinformaticsAlbums of 2005 snapshot December 5, 2005 musicThings of Interest Added to HubMed December 2, 2005 hubmedIndestructible user profiles December 2, 2005 searchGoggle update December 1, 2005 greasemonkeyRDF interoperability for social bookmarking tools December 1, 2005 feedshubmedrdftagsPopulate iTunes With Webjay Playlists November 29, 2005 applescriptituneswebjaySequence Manipulation En-Suite November 29, 2005 javascriptscienceIndex Diagnosticus November 29, 2005 searchBest Of: Bookmarklets November 27, 2005 bookmarkletsStylish November 27, 2005 firefoxBest Of: Games on OS X November 27, 2005 gamesosxBest Of: Applescripts for iTunes November 27, 2005 itunesosxBest Of: Firefox extensions November 27, 2005 extensionsfirefoxMechanical Turking November 23, 2005 amazonRDF export from HubMed Tags November 22, 2005 hubmedrdftagsContent Negotiation for HubMed Tags November 22, 2005 hubmedpiggybankrdftagsYahoo! Canada Movies feed November 22, 2005 cinemafeedCached web pages and Spurl November 20, 2005 bookmarkscacheUTF-8 citation export from HubMed November 17, 2005 hubmedA modular dynamic web page for bioinformatics searches November 16, 2005 bioinformaticsperlLast.fm search plugin November 16, 2005 firefoxlastfmDated web page snapshots with My Web November 16, 2005 bookmarkletcachemywebSubmitting reviews to Google Base November 16, 2005 googlegreasemonkeyrvwCreating a citable archive of a web page November 15, 2005 archivebookmarkscitationEeeeeeeeeeeevil November 14, 2005 googleThe Wire on Resonance FM podcast November 13, 2005 musicplayrpodcastMIME types and feed handlers November 13, 2005 feedspodcastsPodule #5 November 12, 2005 musicpodulesFOAF + hCard November 12, 2005 Yahoo's My Web 2.0 November 11, 2005 taggingVisible changes in HubMed this week November 11, 2005 hubmedDisabling Caps Lock in Ubuntu November 11, 2005 ubuntuVisible changes to HubMed this week November 4, 2005 hubmedBlogBridge November 3, 2005 softwareJEdit November 3, 2005 softwareTemporary feed subscriptions and individual item archives November 3, 2005 feedsOpenOffice 2 on OS X November 3, 2005 openofficeosxNotePress October 24, 2005 notepressresearchwordpressFlock October 22, 2005 firefoxflockHealthline October 19, 2005 healthsearchA definite lack of standards for academic metadata October 19, 2005 metadataLooking for MP3s? October 17, 2005 firefoxsearchpluginsTweaking Firefox for user-side accessibility October 16, 2005 accessibilitycssfirefoxstart.com gadgets October 15, 2005 A couple of music videos on slow servers October 15, 2005 musicPublishing whole documents using an open XML standard format October 13, 2005 publishingxmlSomeone Comes To Town October 7, 2005 torontoSomeone Leaves Town October 7, 2005 parisFixation October 6, 2005 hubmedrvwTiny Greasemonkey script for Flickr page titles October 6, 2005 flickrgreasemonkeyNews.com graph visualisation for related stories October 4, 2005 Anti-personal portal aggregators October 3, 2005 BlogPulse Alert Feed for Recently Played Artists September 28, 2005 audioscrobblerfeedslast.fmmusicPodule #4 September 26, 2005 musicpodulesOpenSearch Description and Atom-based Response templates for Movable Type September 24, 2005 atommovabletypeopensearchsearchUbuntu Breezy September 24, 2005 breezyubuntuReplace the Guardian logo September 22, 2005 greasemonkeyOpenSearch 1.1 September 20, 2005 firefoxopensearchsearchsruSpyware 2.0 September 20, 2005 security142 September 19, 2005 fruityloopsmusicFirefox search plugin for Google Blog Search September 16, 2005 firefoxgooglesearchpluginsMetadata in feeds (again) September 14, 2005 atommetadatardfreviewsThou shalt not make me squint September 14, 2005 accessibilitycssfirefoxFlickr vs Yahoo sign-up September 13, 2005 flickrsecurityyahooBookmark Folders September 12, 2005 bookmarksfirefoxChanging Feed Format September 12, 2005 atomfeedsrdfrssDVD ripping to Matroska September 12, 2005 dvdmatroskaoggxvidMovable Type + Tags September 7, 2005 movabletypetagAudioscrobbler Browser update September 7, 2005 last.fmmusictouchgraphCOinS Browser Extensions updated September 7, 2005 bookmarkletcoinsgreasemonkeyopenurlTV August 31, 2005 torrentbottvSort del.icio.us popular (again) August 31, 2005 deliciousgreasemonkeyGetting Firefox bookmarks into Spotlight August 31, 2005 firefoxspotlightDYLD_FALLBACK_LIBRARY_PATH (OS X) August 31, 2005 osxExport citations from HubMed to Refworks August 29, 2005 bookmarklethubmedSelf-contained Firefox search plugins August 28, 2005 firefoxsearchpluginsxsltFirefox Search Plugin Template for a Movable Type Weblog August 25, 2005 firefoxmovabletypesearchpluginsTalk To Google August 24, 2005 googleprivacyExtracting microcontent (XSLT, GRDDL, RDF) August 24, 2005 firefoxgreasemonkeymicrocontentrdfsome handy links for del.icio.us August 20, 2005 deliciousCOinS to CrossRef resolver script August 20, 2005 coinsgreasemonkeymicrocontentopenurlA better cite bookmarklet August 18, 2005 bookmarkletcitemicrocontentAdding to last.fm with Greasemonkey August 15, 2005 flittergreasemonkeylast.fmmusicTorrentbot additions August 15, 2005 torrentbotTurning a Java jar into an Application bundle (OS X) August 14, 2005 Jackson & His Computer Band (a test of Bleep.com's Web Tools) August 11, 2005 Hide Flickr comments from specific users August 11, 2005 flickrgreasemonkeyPlayr Atom feed August 11, 2005 atomplayrPandora August 9, 2005 musicAudioscrobbler & last.fm relaunch August 9, 2005 audioscrobblerlast.fmdel.icio.us Firefox extension security update August 8, 2005 deliciousfirefoxPodule #3 August 5, 2005 musicpodulesServer speed August 5, 2005 debianNTRSTNG (OS X) August 4, 2005 flickrperlHide Flickr Comments (Greasemonkey) August 3, 2005 flickrgreasemonkeyPublication of cytokines August 1, 2005 Converting RTF to plain text (OS X) July 31, 2005 osxGatherers of the Month #2 July 31, 2005 deliciousMaking a big old map July 30, 2005 perlPlayr's MP3 blogs section July 30, 2005 playrpodcastsOpenURL COinS July 30, 2005 coinsopenurlPodule #2 July 27, 2005 musicpodulesBBC Air Time July 23, 2005 bbcvisualisationAtom 1.0 in HubMed July 22, 2005 atomfeedshubmedLinux Applications July 18, 2005 linuxsoftwareubuntuFirefox form widgets in OS X July 16, 2005 firefoxosxAtom 1.0 July 15, 2005 atomfeedsInsecure RSS encryption July 15, 2005 greasemonkeysecuritydel.icio.us inbox in Firefox's sidebar July 12, 2005 deliciousfirefoxOS X URL handler to open links to local files July 11, 2005 applescriptosxwordpressFlickr Pro accounts July 11, 2005 Almost Everything About HubMed July 7, 2005 hubmedStatistics in Nature Immunology July 2, 2005 publishingstatisticsiTunes podcasts June 29, 2005 itunesplayrpodcastsExtracting Microcontent June 21, 2005 greasemonkeymicrocontentIt's about the catalogue June 19, 2005 musicp2pEasyNewzBin June 18, 2005 greasemonkeyHubMed Tag Storage June 17, 2005 hubmedtagGive us a big Back! June 12, 2005 cssfirefoxSpotlight June 9, 2005 osxSemantic weblog posts with Movable Type June 8, 2005 movabletyperdfTV June 6, 2005 tvMore feeds please, vicar June 4, 2005 feedsClient-side M3U generation June 4, 2005 playrGoggle update May 27, 2005 googlegreasemonkeyOperation D-Elite May 26, 2005 p2pWeb Assistants May 25, 2005 firefoxRDF data in HubMed May 24, 2005 hubmedpiggybankrdfParis 1911 May 22, 2005 mapsparisG.W.A. May 22, 2005 googleprivacyFoF May 22, 2005 feedonfeedsAbout reviews and microformats May 22, 2005 microcontentreviewsConcatenating multiple MP3s into one big playable MP3 May 22, 2005 musicsoftwarePodules May 21, 2005 musicpodcastspodulesTag search May 21, 2005 searchtagBagram May 21, 2005 M.I.A. loop May 21, 2005 musicGoggle May 19, 2005 firefoxgooglegreasemonkeyScreencast of HubMed and BibDesk May 12, 2005 bibliographyhubmedscreencastPubMed RSS May 9, 2005 Automator Plug-Ins May 4, 2005 osxGot Adblock? May 1, 2005 firefoxOpen Sourcing APIs April 28, 2005 opensourceThe Hype Machine April 28, 2005 musicEmail reply notifications (Mail and Growl) April 27, 2005 applescriptgrowlosxHow to get a Firefox that works (OS X) April 27, 2005 firefoxosxTargeted advertising April 26, 2005 cssnetnewswirePlay LHB Daily Downloads April 26, 2005 playrBrowser anti-aliasing April 24, 2005 firefoxItems for consideration April 23, 2005 bibliographyidentifiersopenurlSidєɳotÑ” April 20, 2005 osxsoftwareSkinning del.icio.us with Firefox and URIid April 19, 2005 deliciousfirefoxFirefox search plugin for Audioscrobbler April 19, 2005 audioscrobblerfirefoxsearchpluginsSend Me A File April 18, 2005 gpgJavascript benchmarks April 17, 2005 firefoxosxsafariSwitching from Safari to Firefox April 17, 2005 firefoxosxFirefox search plugin installer April 17, 2005 firefoxsearchpluginsBest albums of 2005 April 12, 2005 musicreviewsPrefetch Google ad links April 10, 2005 googlegreasemonkeyNew rvw! April 9, 2005 deliciousreviewsDeliciousify Audioscrobbler April 5, 2005 audioscrobblerdeliciousgreasemonkeyLesInrocksParis March 30, 2005 concertsfeedsparisFlash + XSPF in Playr March 29, 2005 xspfUpcoming API March 28, 2005 TV March 25, 2005 tvUpdates March 24, 2005 Why upcoming.org isn't more popular March 21, 2005 upcomingOpenSearch March 16, 2005 feedssearchFlitter v1.1 March 14, 2005 flittersearchGive Me All Your Cookies March 12, 2005 greasemonkeyOpenURL resolver bookmarklet March 7, 2005 bookmarkletopenurlAdd search links to Audioscrobbler artist pages March 5, 2005 audioscrobblerbookmarkletgreasemonkeyArtist popularity in specific countries March 4, 2005 audioscrobblermusicvisualisationRemove PDF delay for journal articles March 4, 2005 pithhelmetHubMed UTF-8 export March 1, 2005 bibtexhubmedrisutf-8US vs UK band popularity February 28, 2005 audioscrobblermusicvisualisationBlackwell's 'author pays' publishing February 27, 2005 biomedicalSkip SourceForge delay page February 26, 2005 pithhelmetHide selected content with CSS (in the future) February 21, 2005 cssnetnewswireSSL certificates for Apache2, Courier, Exim4 and Jabberd2 on Debian February 21, 2005 debiansslXML-based book authoring February 20, 2005 softwaresubversionWordPress 1.5 February 15, 2005 softwarewordpressChilibot February 15, 2005 biomedicaldatavisualisationRadio 4 RSS feeds February 15, 2005 bbcfeedsradioBD Graphit floating (modified) style for NetNewsWire February 15, 2005 cssnetnewswireTorrentbot moved February 15, 2005 torrentbotSorted lists of reviews, using rvw! and del.icio.us February 15, 2005 deliciousreviewsFlickrdesk update February 12, 2005 flickrsoftwareSorting del.icio.us/popular February 11, 2005 bookmarkletdeliciousMap interfaces February 8, 2005 googlemapsgre.gario.us February 7, 2005 deliciousDynamic OpenURL resolver links February 7, 2005 openurlPubMed tabs and Amplify February 6, 2005 biomedicalosxpubmedsoftwareMy Speediest Gatherers February 2, 2005 deliciousGatherers of the Month February 1, 2005 deliciousSwervedriver oddities February 1, 2005 musicPithHelmet HubMed redirect January 31, 2005 hubmedpithhelmetOrdnance Survey copyright annoyance (again) January 30, 2005 mapsMFeeds January 30, 2005 feedsmusicplayrBeagle January 29, 2005 linuxsoftwareWPA January 29, 2005 ubuntuMore Paris RSS feeds January 28, 2005 feedsparisOCLC software contest January 28, 2005 A9's street photos January 27, 2005 mapsGraph del.icio.us subscriptions network January 26, 2005 deliciousvisualisationGraph del.icio.us related tags January 26, 2005 deliciousvisualisationExplosion January 23, 2005 playrm3ucast update January 21, 2005 m3ucastosxplayrsoftwaregames TopList January 20, 2005 deliciousblogresearch TopList January 20, 2005 deliciousmp3blog TopList January 18, 2005 deliciousmusicYesterday's KEXP January 18, 2005 musicradioFlitter with del.icio.us links January 18, 2005 deliciousflitterLugRadio interviews Mark Shuttleworth January 17, 2005 radioubuntuCoral too slow January 17, 2005 p2pplayrFlitter with band photos January 14, 2005 flitterFlickrdesk update January 14, 2005 flickrsoftwareJavascript drag-and-drop ordered lists January 12, 2005 javascriptUnshuffly iPod January 12, 2005 SVG maps from PDF January 11, 2005 mapspdfsvgXSPF + SWF January 11, 2005 xspfListmania January 10, 2005 listsTechnorati TouchGraph January 9, 2005 touchgraphvisualisationA mini SVG map January 9, 2005 mapsparissvgUpcoming.org for Paris concerts January 6, 2005 feedsparisupcomingBreezy Listening January 4, 2005 Flitter bookmarklet January 2, 2005 flitteriTunes Music Store gift certificates January 2, 2005 musicp2pBands of 2004 January 2, 2005 musicBe The Coolest December 29, 2004 bookmarkletdeliciousCatching Up December 28, 2004 feedsmusicp2ptvLocalOpenURL and LocalSFX for HubMed pages December 13, 2004 openurlXSLT export from OmniOutliner Pro December 12, 2004 osxsoftwarexsltParis Concerts RSS feed update December 12, 2004 concertsfeedsparisCompiled live Swervedriver albums December 8, 2004 Search a restricted set of feeds December 7, 2004 feedssearchGoogle Reviews December 7, 2004 googlereviewsWi-Fi iPod December 7, 2004 musicp2pHubMed tutorials? December 7, 2004 hubmedAmiga Emulation December 6, 2004 emulationWindows Applications December 4, 2004 softwarewindowsVennMaster December 3, 2004 biomedicalvisualisationWorlds Apart December 3, 2004 musicFlitter December 2, 2004 musicMusic in del.icio.us December 2, 2004 playlistsHorizontal Amazon music thing December 1, 2004 amazonPricenoia December 1, 2004 amazonucomics Atom feeds for NetNewsWire November 30, 2004 feedperlGoogle Scholar bookmarklet November 27, 2004 bookmarkletTouchGraph browser for Amazon Citations November 24, 2004 touchgraphCiteSeer OAI compliance November 24, 2004 citeseerTouchGraph browser for Google Scholar November 22, 2004 googletouchgraphvisualisationPaper CD Case November 20, 2004 John Peel's final show November 20, 2004 musicAdium Groupchats November 18, 2004 Links to Google Scholar November 18, 2004 Free shipping for books at Amazon France November 17, 2004 More TV November 17, 2004 Mark Steel Lectures November 17, 2004 OS X Applications November 14, 2004 osxClusty PubMed November 12, 2004 Dowser November 12, 2004 Momentum November 11, 2004 CiteULike November 10, 2004 A decent setup for writing (OS X, with LaTeX) November 9, 2004 Sending files from one computer to another November 9, 2004 Motorcasting November 9, 2004 Fluxpod November 3, 2004 Visitors October 31, 2004 Flickrdesk: daily updated desktop pictures from Flickr (OS X) October 29, 2004 Define The Lie October 28, 2004 Netgear WG311FS and Airport Express on Ubuntu October 24, 2004 Ubuntu October 24, 2004 M3Ucast October 19, 2004 Desktop pictures from Flickr, using Magpie and OS X October 15, 2004 Making Podcasts from MP3 blogs October 13, 2004 What's in your menubar? October 13, 2004 RealPlayer update October 4, 2004 Fulltext links from HubMed October 4, 2004 Must... resist... October 4, 2004 Torrentbot missed episodes September 30, 2004 Bookmarklets September 30, 2004 Review sites reviewed September 30, 2004 reviewsFirefox extensions updated September 30, 2004 Glit_9 September 26, 2004 Hercules/PowerVR drivers September 26, 2004 Storing or aggregating microcontent September 26, 2004 NetNewsWire 2.0 beta September 22, 2004 Feed Your Reader September 20, 2004 MP3.com community features September 19, 2004 Albums for people who are bored of music September 19, 2004 deliciousPresidential candidates on science September 17, 2004 A Buttload of Bootlegs September 15, 2004 bootlegsNew web software releases September 14, 2004 softwareMolecular Systems Biology - a new open access journal from NPG September 14, 2004 open-accessMedical literature info sorting overload September 12, 2004 Aggregate feeds as impromptu record labels September 12, 2004 musicDivision of Laura Lee September 12, 2004 musicGoogle vs MEDLINE September 12, 2004 pubmedThe Return of STG September 10, 2004 p2pDocco September 10, 2004 documentssearchvisualisationDiebold's tamper-conducive vote counter August 31, 2004 securityCoral August 30, 2004 cacheData retention August 30, 2004 googleArtificial meme tracking August 30, 2004 memeNobel laureates call for open access to public-funded research August 30, 2004 open-accessThe 99p challenge August 28, 2004 radioFactory resetting an Airport Express August 25, 2004 appleiBook/PowerBook + iPod rebate August 25, 2004 appleDevendra Banhart August 24, 2004 musicThings Google knows about you August 24, 2004 googleBlogger's Next Blog tour August 22, 2004 IngentaConnect August 21, 2004 RSS munging with Urchin August 21, 2004 AWS 4.0 beta August 21, 2004 Rilo Kiley + others August 20, 2004 I wish I had a tripod August 19, 2004 The Guardian Digital Music survey August 18, 2004 ALAC droplet August 18, 2004 Some people say 'Tax the Rich' August 17, 2004 Audio channelling August 17, 2004 OSXPlanet is fantastic August 14, 2004 FLAC → ALAC August 13, 2004 What to do if you're running out of bandwidth August 12, 2004 RSS feeds of playlist recommendations from Playr August 12, 2004 Inducement to Hymn August 12, 2004 JustePort streams audio to an Airport Express August 11, 2004 Create a wishlist of videos to rent August 11, 2004 AllMusic desertion August 5, 2004 Caching media files August 5, 2004 Brain Hacks August 4, 2004 Joggle Tellybot August 4, 2004 Tagged reviews August 3, 2004 Cover art in del.icio.us RSS feeds August 3, 2004 Sidebar stars August 2, 2004 meme destruction project August 2, 2004 rvw! tool repurposed August 1, 2004 deliciousReview of an Airport Express August 1, 2004 AllConsuming book list July 29, 2004 Connected bands July 28, 2004 Cross-cluster navigation July 28, 2004 Nodule Organiser July 28, 2004 Hallowed be thy game July 26, 2004 Punk Voter playlist July 23, 2004 PageRank 10 sites July 23, 2004 PubMed search field tags July 23, 2004 PDF warning from CSS July 22, 2004 A 13.8GB torrent July 21, 2004 Open Source + Television July 18, 2004 DRM denial July 17, 2004 CacheM3U July 16, 2004 Mobile RFID reader July 16, 2004 Feed autodetection in Firefox July 16, 2004 iPapers July 15, 2004 BioMail July 14, 2004 OMG - NoMusic July 13, 2004 HTML2wget2M3U2mpg123 July 11, 2004 BBC News video console July 11, 2004 wget M3U playlist files July 10, 2004 MP3 blog playlists July 10, 2004 Simpler TODO RSS feed July 10, 2004 Music to go to sleep by July 9, 2004 Audioscrobbler Browser bugfix July 4, 2004 Twitch 14 July 3, 2004 CrossRef/Google search July 3, 2004 Choose your open access with Springer July 3, 2004 A Ghost Is Born July 2, 2004 RealPlayer 10 beta for OS X July 1, 2004 Getting the web out of the browser July 1, 2004 Data auto-detection in browsers July 1, 2004 Identifying papers with content hashes June 30, 2004 RIS format confusion June 30, 2004 Document publishing diagram June 30, 2004 HubMed.org June 29, 2004 Apple Tiger June 29, 2004 Compressing PDFs containing colour images June 29, 2004 Server switch June 29, 2004 Mail.app, IMAP and Courier June 27, 2004 Torrentbot updates June 22, 2004 Live music from the Sonar festival June 19, 2004 Webjay Alarm Clock June 17, 2004 clevercactus share June 17, 2004 SOAP interface for E-Utilities June 16, 2004 Suprnova discographies (-ish) feed June 16, 2004 Firefox 0.9 June 16, 2004 Favourite albums at/of the moment June 16, 2004 OS X root email account forwarding June 16, 2004 RVW 0.2 June 9, 2004 JEM archives June 8, 2004 Blogdigger Media June 7, 2004 Muziekhobbyist Webradio June 6, 2004 Your kids need drugs June 6, 2004 Pocket Radio June 4, 2004 Goliath X June 3, 2004 Scopus links from HubMed June 3, 2004 DrupalEd and DrupalBlog June 3, 2004 OME June 2, 2004 HubMed history tab June 2, 2004 Music file data hashes June 2, 2004 All Back To Mine May 31, 2004 rvw! formatter May 30, 2004 Détente May 29, 2004 Boosh on TV May 29, 2004 Elsevier author self-archiving May 28, 2004 Server co-op May 26, 2004 PNAS offers Open Access option May 24, 2004 Real BBC Radio May 23, 2004 That Man Will Not Hang May 21, 2004 Bastet May 20, 2004 Swervedriver May 20, 2004 MP3.com May 17, 2004 Safari vulnerability May 17, 2004 Google Groups Atom feeds May 17, 2004 Printing from Windows 98 to a shared CUPS printer on Panther using SAMBA May 17, 2004 Endnote incompatibility May 17, 2004 Infomediaries May 16, 2004 Sente: like iTunes, for biomedical literature May 16, 2004 Penance Soirée May 15, 2004 Red Cross reports May 15, 2004 Dropload May 11, 2004 Fillable, home-networked file servers May 11, 2004 HubMed search box May 11, 2004 RSS feeds for new album releases May 10, 2004 Rock Ahoy May 10, 2004 A big red blip May 9, 2004 Synchronized Multimedia Working Group May 8, 2004 Printer sharing May 8, 2004 The Golden Apples of the Sun May 7, 2004 Hey Hey 16k May 6, 2004 Franz Ferdinand 2004-04-22 May 6, 2004 prefuse visualisation toolkit May 6, 2004 Electric Chill Noise May 4, 2004 Searching scientific papers online May 3, 2004 Unbinding May 3, 2004 iPod pricing May 3, 2004 Returned-to Albums May 2, 2004 FNAC listings in Paris concerts RSS feed May 1, 2004 Be Not Afraid April 30, 2004 Blosxom 3 April 28, 2004 iTunes 4.5 April 28, 2004 Flickr photo badging April 27, 2004 GeneInfoViz April 27, 2004 Inline del.icio.us April 27, 2004 Random MP3.com playlist April 26, 2004 Inline Musilog April 25, 2004 Academic PDF workflow April 23, 2004 Collaborative playlists April 22, 2004 Current advantages of IM clients April 21, 2004 Follow mouse focus in X11 windows April 21, 2004 DaFONT April 21, 2004 Lab notebook database system April 21, 2004 Genotyping a meme April 20, 2004 OS X fonts in GTK2/Gimp April 20, 2004 Google ads April 19, 2004 Unicode vs Latin-1 April 19, 2004 Pixies Reunion Show April 16, 2004 PDF Browser plugin April 14, 2004 CulturePool April 13, 2004 ImageMagick 6 April 13, 2004 musiCompass April 12, 2004 TV torrent/RSS automation April 12, 2004 Spillsbury April 11, 2004 Fibonacci Ratios and Musical Intervals April 10, 2004 A shared word processor-bibliographic manager interface April 9, 2004 Musiclogging from Winamp April 8, 2004 Torrentbot Pt 2 April 8, 2004 Torrentbot April 8, 2004 Smell the satire April 7, 2004 Musiclogging April 6, 2004 MLtorrents bookmarklet April 5, 2004 Wonderfalls April 5, 2004 ml_www April 4, 2004 Outcesticide Set April 3, 2004 The live music archive is huge April 3, 2004 Repaying generosity April 3, 2004 BitTorrent command line client on OS X April 2, 2004 Bitcollider April 2, 2004 Entrez search updates April 2, 2004 MediaSeek April 2, 2004 Link extraction bookmarklet for Webjay March 31, 2004 User-centric data services March 31, 2004 AIBrainz March 31, 2004 AMG New Releases March 30, 2004 Gimp.app March 30, 2004 Album cover art tagging for Windows March 28, 2004 TV Shows March 28, 2004 OpenURL Router March 25, 2004 Text mining March 25, 2004 Science Commons March 24, 2004 Remembering konspire March 24, 2004 Music ownership in an open, online database March 23, 2004 PerlPrimer March 22, 2004 Music Publishers, Sales and Metadata March 22, 2004 Atomly March 22, 2004 HubMed SVG graphs March 19, 2004 Free Software directory March 15, 2004 LIARS March 12, 2004 Playr update March 10, 2004 Time Shifting March 10, 2004 pyget***** March 9, 2004 SHN and FLAC tools March 8, 2004 X11 on OS X March 8, 2004 Acknowledgements March 8, 2004 LaTeX add-ons March 8, 2004 LaTeX for Dummies March 8, 2004 LaTeX for the Modern Age March 8, 2004 How To Find (More Of) What You Want March 8, 2004 iPod Whamb skin with volume March 7, 2004 Join groups, find better music March 6, 2004 propa' mash-up ragga-rave dubplate bloodclot jungle tekno tour-de-force March 6, 2004 Semantic HiFi March 5, 2004 Document Handling LinkDump March 5, 2004 /cores March 5, 2004 Sparklines March 2, 2004 Closed-access data from open-acces publications March 1, 2004 HubMed Atom feeds March 1, 2004 Power laws and purchasing priorities February 29, 2004 One World in March February 29, 2004 Audioscrobbler Browser update February 29, 2004 Darkplace February 29, 2004 reviewsKimya Dawson February 28, 2004 Netlabel Catalogue February 27, 2004 Releasing Mac Word 6.0 February 27, 2004 Groupthinking, but on which side? February 26, 2004 The Advancement of Science and Culture February 25, 2004 Ranchero's Big Cat Scripts plugin February 25, 2004 Movable Type 'Edit This Entry' bookmarklet February 25, 2004 AdvanceMAME February 25, 2004 Zoom Player February 24, 2004 LaTeX February 20, 2004 GTK/Panther February 20, 2004 RAM February 19, 2004 Yahoo search bookmarklet February 19, 2004 Mperia February 17, 2004 Jukebox 45 MP3 collection for £3.99 February 13, 2004 Recommend playlists with Flickr February 13, 2004 Berlin Bastard Lesson February 12, 2004 Raster Noton February 11, 2004 Reviewr February 11, 2004 reviewsSubviral RNA February 11, 2004 America's Sweetheart February 10, 2004 Dear Microsoft Word February 10, 2004 Listening post February 10, 2004 DeepVacuum [OS X] February 8, 2004 Throttled [OS X] February 8, 2004 CiteSpace February 3, 2004 Open-source audio, tools for endless music [OS X] February 3, 2004 OmniaMea February 2, 2004 EndNote PubMed import filter February 2, 2004 Compiling an MP3-playing Helix Client on Panther February 1, 2004 Helix developer grants February 1, 2004 NetNewsWire has no Atom February 1, 2004 Ecto final January 31, 2004 betterPropaganda January 30, 2004 QuickTime for M3U January 30, 2004 Kazaa/Kapsule test needed January 30, 2004 Emotilinks January 30, 2004 USB floppy drive with Red Hat Linux January 29, 2004 Install Classic after Panther January 29, 2004 Primer design for cDNA amplification January 29, 2004 Vienna RNA January 28, 2004 It's called I Like January 26, 2004 Webjay.org January 26, 2004 Nothing in return January 25, 2004 Playlist bookmarklet update January 25, 2004 Sente January 23, 2004 Automatically update iTunes library with daapd January 23, 2004 Earth Map Desktop January 22, 2004 MacGDE January 22, 2004 Musicplasma January 22, 2004 iTunes Music Store RSS Generator January 22, 2004 MTCommentAuthorLink January 21, 2004 M3U playlists page January 20, 2004 Artemis sequence viewer January 20, 2004 iTunes Opener January 19, 2004 JPEGs progress January 18, 2004 Pick of the bastard pops January 18, 2004 RealPlayer 10 installation January 18, 2004 Copper, prions and TSE January 18, 2004 Suprnova RSS feed January 18, 2004 HubMed print-friendly pages January 17, 2004 Scientific stories January 17, 2004 MP3 to M3U or SMIL playlist January 16, 2004 Return of the Mac January 14, 2004 kX project and AVG January 14, 2004 Firebird Tabbrowser Extensions January 11, 2004 Morality of software patches January 11, 2004 Transmission 3000 January 10, 2004 Pitchfork Singles of 2003 January 7, 2004 Are you feeling throaty? January 7, 2004 1&1 free hosting January 7, 2004 largehearted boy January 5, 2004 What a difference a year makes January 5, 2004 Linking to MusicBrainz January 5, 2004 Fountain of Youth January 4, 2004 Collections of music files from distributed sources January 3, 2004 Trying this again January 2, 2004 iBook display problems? January 1, 2004 2003 Festive Fifty January 1, 2004 Happy New Year January 1, 2004 Some contributions to saving the internet December 31, 2003 Who represents my points of view December 31, 2003 Scientists for Dean December 31, 2003 Social software interfaces December 31, 2003 Movable Type plugins December 31, 2003 Using religion for aggression December 31, 2003 Playlist distribution December 31, 2003 GPSWeb December 31, 2003 RPXP web service December 19, 2003 MLDonkey [OS X] December 19, 2003 Vocal removal December 19, 2003 Pester December 18, 2003 Make GTK apps pretty December 17, 2003 MAD plugin eats track numbers December 17, 2003 The Signaling Gateway December 16, 2003 Movable Type on Windows XP December 16, 2003 XStream Radio December 16, 2003 SourceForge December 16, 2003 No Fink December 12, 2003 Fluorescence microscopy movies December 12, 2003 GoFigure December 12, 2003 Rumoured demise of BioMedNet December 11, 2003 SemBlogBibMan December 9, 2003 Not safe for work December 9, 2003 RDF for last played tracks, via Audioscrobbler December 9, 2003 MP3 blogs are switched on December 7, 2003 RSS feed for Paris concerts December 7, 2003 Google irregularity December 6, 2003 Festival Octopus December 4, 2003 Azureus December 4, 2003 0day audio December 4, 2003 Kid 606 video December 4, 2003 Album continuum December 3, 2003 Laptop DJ December 3, 2003 Firebird [OS X] December 3, 2003 Playlist tracklisting update December 3, 2003 WEASEL December 2, 2003 Electromagnetism December 2, 2003 QOTSA/Kyuss circle of collaboration December 1, 2003 musictouchgraphBBC Radio interface November 30, 2003 The Shins on KCRW November 29, 2003 Unfree the music November 28, 2003 Movable Type spam vulnerability November 26, 2003 French-speaking weblog rankings November 24, 2003 QTFairUse November 23, 2003 Got FOAF November 23, 2003 cgi_buffer November 22, 2003 blam2 for trial November 22, 2003 Vorbis updates November 21, 2003 BibDesk November 21, 2003 The perfect email November 20, 2003 Singingfish November 20, 2003 GLC November 19, 2003 bleep.com November 18, 2003 Free- or donation-ware updates for Panther November 18, 2003 You will require... November 8, 2003 XML for individual entries November 6, 2003 Eugene Garfield commentaries November 6, 2003 Styling RSS with CSS to make it browser-friendly November 6, 2003 SciDev Open Access section November 5, 2003 Reviews-enabled Movable Type November 5, 2003 Sublime electronica November 5, 2003 Excel add-in to remove low numbers November 4, 2003 Fixed the blaxm reviews exchange November 3, 2003 Blogware with reviews metadata November 2, 2003 A Tune Called Grin October 31, 2003 Longhorn October 30, 2003 iTunes playlist hint October 29, 2003 Facil-o-SMIL update for M3U and CC October 29, 2003 Phrase searching in PubMed October 28, 2003 The Knowledge Society October 28, 2003 FlowJo October 28, 2003 Wow. A big clock. October 28, 2003 PlayLouder MSP October 27, 2003 Soulseek recommendations October 25, 2003 WinAMP5 October 25, 2003 PDC Pokemon October 24, 2003 Fink upgrade for gcc 3.3 October 24, 2003 Google Glossary October 22, 2003 PLOS Biology October 21, 2003 Chutes Too Narrow October 19, 2003 Constant playlist October 18, 2003 Facil-o-SMIL October 18, 2003 Weed October 18, 2003 GNU Privacy Guard October 18, 2003 OS X IM: MSN IS ON October 18, 2003 PLOS Biology trackbacks in HubMed October 17, 2003 PLOS Biology October 17, 2003 From The Ashes October 17, 2003 Stop the Leaks October 16, 2003 tunA October 15, 2003 Empty pages in search results October 15, 2003 Steam [OS X] October 13, 2003 Calendar events from XHTML October 13, 2003 Sound October 12, 2003 In defence of open access October 10, 2003 EMusic pricing changes October 9, 2003 Digital Accretion October 9, 2003 Daily MP3s from Pitchforkmedia October 9, 2003 Albums Of The Year (so far) October 8, 2003 Dynamo playlist October 7, 2003 Pure Data DSP software October 7, 2003 Open Source Democracy October 6, 2003 Bad spiders October 6, 2003 Mercora October 6, 2003 Boom Selected October 2, 2003 HeadCloud October 2, 2003 Flat-fee P2P model October 2, 2003 Neuro-info-transmitters October 2, 2003 What's on my docks? October 2, 2003 Metadata in the MetaWeblog API October 1, 2003 RDF review vocabulary October 1, 2003 The Wellcome Trust supports open access October 1, 2003 Shareable playlists October 1, 2003 Bloglines recommendations October 1, 2003 Mini-links RSS feed September 30, 2003 Research Mapper September 30, 2003 Downstream September 29, 2003 iWebCal September 29, 2003 Dynamic event files September 29, 2003 Freak Up, Look Smart September 28, 2003 X11 goodies September 25, 2003 Export an event from a web page to iCal September 25, 2003 Terminally ill September 24, 2003 iCal events from web pages September 24, 2003 Fingertips September 24, 2003 NatureEvents September 24, 2003 KDE September 24, 2003 Share The Music September 22, 2003 Jumbled words September 22, 2003 Equinox September 19, 2003 Syncato September 18, 2003 WSIL for blogroll autodiscovery September 17, 2003 TV listings and audio streaming licensing September 17, 2003 Worst Jobs in Science September 17, 2003 Digital marketplace summary September 16, 2003 UK data surveillance measures September 16, 2003 Intellectual is not physical September 16, 2003 Collective payment September 15, 2003 ICARIS 2003 September 10, 2003 The importance of open access for semantic research September 10, 2003 DEVONagent [OS X] September 9, 2003 Polished turds September 9, 2003 Fame *and* fortune (if you're good enough) September 9, 2003 Open source bibliography format September 8, 2003 biologging September 8, 2003 Science and Religion forum September 8, 2003 Scientific publishing September 7, 2003 Konspire radio channel September 7, 2003 Subscribe to comments September 5, 2003 Trackbacks September 4, 2003 Nicotine September 4, 2003 Waypath September 4, 2003 my.PubMed RSS feeds September 4, 2003 Musical interlude September 4, 2003 Biotech protocols September 2, 2003 Smokescreen September 1, 2003 Openam.com subdomains August 29, 2003 Armagetron Tron clone August 26, 2003 NetNewsWire with WebKit August 26, 2003 Fun with XMLTV August 26, 2003 Peel Sessions August 25, 2003 The return of OpenAm August 25, 2003 BBC Creative Archive August 25, 2003 radioLaw Enforcement Against Prohibition August 21, 2003 EarthStation5 August 21, 2003 MSN network rejigged August 21, 2003 Tofu August 21, 2003 Album cover artwork August 21, 2003 FreakMachine August 20, 2003 Human Knowledge Navigator August 14, 2003 Peer review under scrutiny August 11, 2003 Tools for handling information August 11, 2003 mCode August 9, 2003 Classification of associations August 9, 2003 Morale-o-Meter August 9, 2003 Miranda IM August 9, 2003 PRISM for RDF August 9, 2003 Who's going to pay? August 8, 2003 Perception August 8, 2003 BluFilter August 8, 2003 Trillian Pro 2.0 beta August 7, 2003 Protein Interaction Browser August 7, 2003 Music Browser repaired August 6, 2003 109 August 6, 2003 Jobs as RSS extensions August 6, 2003 Quick Release August 5, 2003 Test August 1, 2003 OpenAm linking July 31, 2003 Rock-It Launcher July 30, 2003 AOL Journals July 29, 2003 Myths and legends of file sharing July 29, 2003 OS X Show Desktop July 28, 2003 The same thing, again July 28, 2003 Digital sales network July 25, 2003 YAPC July 25, 2003 Buy back continues July 22, 2003 blosxom.com July 21, 2003 Vague memories July 21, 2003 Amazon tracks search box July 18, 2003 Perl Culture July 18, 2003 We're all going straight to hell :-) July 17, 2003 BioMed Central links July 17, 2003 Faculty of 1000 links July 17, 2003 Open bibliography software July 15, 2003 Musical artifacts July 11, 2003 WireTap July 11, 2003 The Marigolds July 9, 2003 The Holy Grail July 9, 2003 Audioscrobbler + last.fm July 9, 2003 Safari FullScreen bookmarklet July 9, 2003 BioMed Central articles in one big zip July 9, 2003 Negative Feedback on eBay July 9, 2003 Copyright for scientific papers in Eprint archives July 7, 2003 Performance at the cost of expansibility July 7, 2003 I (heart symbol) MP3 July 7, 2003 When Fireworks Attack July 7, 2003 Online electronic hardware stores July 7, 2003 TouchGraph LiveJournal Browser July 7, 2003 Zane Lowe on Radio 1 July 4, 2003 Clutter update July 2, 2003 Endnote v7 July 2, 2003 RSS legacy July 2, 2003 Did you know? July 2, 2003 Open access conference reports June 30, 2003 Phone GPS June 30, 2003 Searching for the social benefits of technological progress June 30, 2003 EFF seeks P2P licensing scheme June 27, 2003 Cites and Insights July June 27, 2003 Public Access to Science Act June 27, 2003 Blosxom rating plugin June 27, 2003 PithHelmet June 25, 2003 NITLE Blog Census API June 25, 2003 Blogs ! US June 25, 2003 Concept clustering June 25, 2003 Molecular Graphics on OS X June 25, 2003 How I got Soulseek to work on OS X June 25, 2003 Handy hints June 25, 2003 Public Library of Science June 24, 2003 ID card consultation figures June 20, 2003 Nature PDF content extraction June 20, 2003 OpenURL draft standard June 20, 2003 Politics and the English Language June 20, 2003 Four Tet Favourites June 18, 2003 Costs of illicit MP3 downloading June 18, 2003 Spoogefest June 12, 2003 Unicode characters in HubMed June 11, 2003 Paid for software June 10, 2003 Site redesign June 10, 2003 Ontologies in scientific research June 10, 2003 Concert listings June 10, 2003 PDF annotation June 10, 2003 Spared from internet hell June 10, 2003 Political positioning June 6, 2003 Technicalities of a P2P Music Market June 5, 2003 Modelling social interactions June 5, 2003 Andromeda on OS X May 29, 2003 Back on Track May 27, 2003 RVW specification May 27, 2003 Jack Valenti says May 26, 2003 kast/konspire2b May 21, 2003 Come Together May 21, 2003 Emergence May 20, 2003 iTunes script May 20, 2003 Emusic signs Beggars Group May 20, 2003 Principles of Emergent Democracy May 20, 2003 Lo-Fi May 19, 2003 Jabber notification of new referrers May 19, 2003 LameBrain May 18, 2003 Kwiki and VoodooPad May 17, 2003 Music recommendations May 17, 2003 Technorati API in blaxm! May 17, 2003 If they want to do this the hard way... May 17, 2003 SFX/OpenURL interview May 16, 2003 Advertoys May 16, 2003 Nodalpoint - moderated bioinformatics papers from PubMed May 15, 2003 RVW success May 14, 2003 Test review for RVW markup in RSS 2.0 May 14, 2003 Photopal May 14, 2003 Geograffiti May 14, 2003 RVW format in RSS 2.0 May 14, 2003 Video Sans Frontieres May 14, 2003 The Scientist in RSS May 14, 2003 RVW format in RSS May 14, 2003 Arrowsmith May 13, 2003 WinAMP AAC/MP4 input plugin May 13, 2003 iSuck May 13, 2003 iTunes, again May 13, 2003 Global Friendster visualisation May 13, 2003 Peer-to-peer search spidering May 9, 2003 DRM within AAC files May 8, 2003 Processing Soda May 8, 2003 Improving science through online commentary May 8, 2003 RVW standard metadata format for reviews May 7, 2003 DJ Martian's page May 6, 2003 iTunes download May 5, 2003 FOS News catchup May 4, 2003 Scrobbleyou May 4, 2003 On The Wire May 1, 2003 EMusic upgrade May 1, 2003 iTunes 4 May 1, 2003 Electric Six - Fire April 30, 2003 iTunes Music Store top downloads April 30, 2003 CD industry seeks niche April 29, 2003 Echocloud April 29, 2003 Music licensing April 27, 2003 Semantic blogging demonstrator April 27, 2003 Modular, extensible RDF April 27, 2003 TouchGraph Audioscrobbler Browser April 26, 2003 Antisocial behaviour in online communities April 26, 2003 Laszlo April 22, 2003 The World Live Web April 21, 2003 Finding people April 21, 2003 The Wipers - Box Set -- Is This Real April 21, 2003 Librarians on the offensive April 20, 2003 Environmental Noise Retards Auditory Cortical Development April 20, 2003 The liberation will not be nationalised April 19, 2003 Fire with intent April 19, 2003 Thinkbot April 18, 2003 Globe Alive April 17, 2003 Journal of Mammalogy April 17, 2003 Open Access April 16, 2003 EQUATOR April 15, 2003 Last.fm April 15, 2003 Completion of the Human Genome Project April 15, 2003 RDF braindump April 14, 2003 WaveFinder, DAB April 14, 2003 Microsound April 13, 2003 Sumeria April 13, 2003 George Boosh April 11, 2003 Terrestrial jukebox April 10, 2003 Not content April 10, 2003 Summarise this April 10, 2003 Queens of the Stone Age - Feel Good Hit of the Summer April 10, 2003 Many to many April 10, 2003 Digital video April 10, 2003 Digital music streaming April 9, 2003 An excellent lab web page April 8, 2003 W3C drafting, drifting April 8, 2003 Internet Explorer 6 April 8, 2003 Winamp 2.9 April 6, 2003 Phoenix April 6, 2003 Clarity of Writing April 6, 2003 a miscommunication with civilians April 6, 2003 A few blam! and blaxm! updates April 6, 2003 Not in My Name ++ April 5, 2003 Some radio shows April 5, 2003 Automata and visualisation April 5, 2003 Complexity Digest RSS April 5, 2003 Political fiction April 5, 2003 Distributing music on plastic discs one album at a time April 4, 2003 Discussion from CTO forum April 4, 2003 Blueprint for phased access journals April 4, 2003 MP3 ripping and encoding benchmark April 3, 2003 New Clinic album April 3, 2003 A Tune April 3, 2003 Rock & Roll Library April 2, 2003 More sites on sticks April 1, 2003 The day music became priceless April 1, 2003 blaxm!, FOAF, RSS March 31, 2003 MP3 track IDs March 31, 2003 Death of an activist March 29, 2003 Iraqi opposition March 29, 2003 Web applications March 28, 2003 Anacubis visual Google March 27, 2003 BeOS file system with metadata for OS X March 26, 2003 BioinforMatrix March 26, 2003 AcroMed March 26, 2003 FOAF Browser March 26, 2003 Thinkbot March 25, 2003 Lock down March 25, 2003 Empire March 21, 2003 A global discussion forum, by invitation only. March 21, 2003 Techgnosis March 20, 2003 blam! + Radio March 20, 2003 blam! + Blogger March 19, 2003 XNap hint for OS X March 19, 2003 Standardised review metadata March 19, 2003 blam! + Moveable Type March 19, 2003 OAI searches from HubMed March 18, 2003 Newzcrawler update March 18, 2003 IMDB moveabletype hack March 18, 2003 Amazon CD track listings March 17, 2003 Not unexpectedly pleasant March 17, 2003 blam!: Amazon review creator March 17, 2003 Research buy-back March 15, 2003 Endnote March 15, 2003 MP3 Sushi March 15, 2003 But why? March 15, 2003 Making money March 13, 2003 ScienceDirect Backfiles March 13, 2003 A simplified valuation of commoditised art March 12, 2003 Apple Java Hooray March 11, 2003 iBook USB FM radio tuner March 11, 2003 More mini-things March 10, 2003 Digital collection and peer review March 10, 2003 SpirographX March 10, 2003 Biopedia March 8, 2003 The Ends of the Internet March 7, 2003 biologging part 2 March 6, 2003 Oral traditions in online communication March 4, 2003 Value of music March 4, 2003 Biologging March 4, 2003 Spiders March 3, 2003 Citation Trackbacks March 3, 2003 Keyboard shortcuts March 2, 2003 GiftBoX March 2, 2003 CNPS March 2, 2003 AllAbstracts bookmarklet March 2, 2003 Citation Maps February 28, 2003 Science Citation Index February 27, 2003 Medscape Headlines in RSS February 25, 2003 iScrobbler February 25, 2003 Open Access Literature Part III February 24, 2003 Open Access Literature Part II February 23, 2003 Visualisations of political polarisation February 23, 2003 Better late than never February 22, 2003 Andromeda/PHP on OS X February 18, 2003 Open Access Literature February 18, 2003 HubLink February 17, 2003 allmusic-to-magnet-URI bookmarklet February 15, 2003 Semantic Blogging and Bibliographies February 15, 2003 Linking Services February 14, 2003 Nice Titles February 14, 2003 EndNote import filter updated February 13, 2003 endnotehubmedExceptions to copyright February 10, 2003 Latent Semantic Indexing February 9, 2003 Fair use February 7, 2003 Proper P2P February 7, 2003 Taking the internet outside February 7, 2003 The Infography February 7, 2003 Safari cookies February 2, 2003 cookiessafariTOC alerts January 31, 2003 alertsnewsreaderpushrsszetoc evaluation January 31, 2003 ParaTools January 27, 2003 citationparaciteparsingIntegrated Comments and TrackBacks January 25, 2003 commentstrackbackFixed TouchGraph scripts January 23, 2003 applettouchgraphvisualisationCitation parser update January 22, 2003 citationparsereferencesCollaboration Network Browser January 22, 2003 Analogies with TrackBack variants January 21, 2003 analogiesbiomedicalliteraturenetworksself-organisingtrackbackMake A List January 21, 2003 collaborativelisttrackbackweblogEDINA Join-Up January 20, 2003 openurlCitation matcher updated for multiple references January 20, 2003 citationparseRIS citation export file suffix January 20, 2003 exportfilerisCitation matching January 18, 2003 citationopcitparseHubLog RSS update January 18, 2003 hublogrssTrackBack January 18, 2003 trackbackAlternative software for community-driven literature management January 15, 2003 blogcommunitysitesoftwarePersonal/group publishing January 15, 2003 knowledgeliteraturepersonalpublishingwebImmunoLog launched January 15, 2003 collaborativejournalJoining the dots - advances in online biomedical literature management. January 14, 2003 biomedicalknowledgeliteraturemanagementSafari, TouchGraph update January 11, 2003 touchgraphSFX Lookup bookmarklet January 10, 2003 bookmarkletsfx03-01-08: Perl scripts for organising PDFs January 9, 2003 acrobatperl03-01-03: Library Lookup ISSN bookmarklet January 9, 2003 bookmarkletlibrarylookup03-01-03: Experimental links January 9, 2003 citationdoi02-12-20: Gnutella P2P January 9, 2003 gnutellamagnetp2p02-12-16: BibTex output January 9, 2003 bibtexpubmed02-12-08: Endnote and RIS import filters January 9, 2003 endnoteexportpubmed02-12-04: Related Articles algorithm January 9, 2003 articlespubmedrelated02-12-03: LinkOut URLs January 9, 2003 fulltextlinkoutpubmed02-12-02: PubMed Javascript January 9, 2003 javascriptpubmed02-11-25: HubMed online. January 9, 2003 perlpubmedutilitiesxml
feeds-feedburner-com-5717 ---- None
feeds-feedburner-com-6397 ---- None
feeds-feedburner-com-6535 ---- None
feeds-feedburner-com-6743 ---- None
feeds-feedburner-com-6752 ---- None
feeds-feedburner-com-6851 ---- None
feeds-feedburner-com-6957 ---- None
feeds-feedburner-com-7136 ---- None
feeds-feedburner-com-7203 ---- None
feeds-feedburner-com-7480 ---- None
feeds-feedburner-com-7578 ---- None
feeds-feedburner-com-7594 ---- None
feeds-feedburner-com-7796 ---- None
feeds-feedburner-com-7832 ---- None
feeds-feedburner-com-788 ---- None
feeds-feedburner-com-789 ---- None
feeds-feedburner-com-7986 ---- None
feeds-feedburner-com-8067 ---- None
feeds-feedburner-com-8847 ---- None
feeds-feedburner-com-8968 ---- None
feeds-feedburner-com-8992 ---- None
feeds-feedburner-com-9154 ---- The Code4Lib Journal The Code4Lib Journal Editorial: Closer to 100 than to 1 With the publication of Issue 51, the Code4Lib Journal is now closer to Issue 100 than we are to Issue 1. Also, we are developing a name change policy. Adaptive Digital Library Services: Emergency Access Digitization at the University of Illinois at Urbana-Champaign During the COVID-19 Pandemic This paper describes how the University of Illinois at Urbana-Champaign Library provided access to circulating library materials during the 2020 COVID-19 pandemic. Specifically, it details how the library adapted existing staff roles and digital library infrastructure to offer on-demand digitization of and limited online access to library collection items requested by patrons working in a remote teaching and learning environment. The paper also provides an overview of the technology used, details how dedicated staff with strong local control of technology were able to scale up a university-wide solution, reflects on lessons learned, and analyzes nine months of usage data to shed light on library patrons’ changing needs during the pandemic. Assessing High-volume Transfers from Optical Media at NYPL NYPL’s workflow for transferring optical media to long-term storage was met with a challenge: an acquisition of a collection containing thousands of recordable CDs and DVDs. Many programs take a disk-by-disk approach to imaging or transferring optical media, but to deal with a collection of this size, NYPL developed a workflow using a Nimbie AutoLoader and a customized version of KBNL’s open-source IROMLAB software to batch disks for transfer. This workflow prioritized quantity, but, at the outset, it was difficult to tell if every transfer was as accurate as it could be. We discuss the process of evaluating the success of the mass transfer workflow, and the improvements we made to identify and troubleshoot errors that could occur during the transfer. A background of the institution and other institutions’ approaches to similar projects is given, then an in-depth discussion of the process of gathering and analyzing data. We finish with a discussion of our takeaways from the project. Better Together: Improving the Lives of Metadata Creators with Natural Language Processing DC Public Library has long held digital copies of the full run of local alternative weekly, Washington City Paper, but had no official status as a rights grantor to enable use. That recently changed due to a full agreement being reached with the publisher. One condition of that agreement, however, was that issues become available with usable descriptive metadata and subject access in time to celebrate the upcoming 40th anniversary of the publication, which at that time was in six months. One of the most time intensive tasks our metadata specialists work on is assigning description to digital objects. This paper details how we applied Python’s Natural Language Toolkit and OpenRefine’s reconciliation functions to the collection’s OCR text to simplify subject selection for staff with no background in programming. Choose Your Own Educational Resource: Developing an Interactive OER Using the Ink Scripting Language Learning games are games created with the purpose of educating, as well as entertaining, players. This article describes the potential of interactive fiction (IF), a type of text-based game, to serve as learning games. After summarizing the basic concepts of interactive fiction and learning games, the article describes common interactive fiction programming languages and tools, including Ink, a simple markup language that can be used to create choice based text games that play in a web browser. The final section of the article includes code putting the concepts of Ink, interactive fiction, and learning games into action using part of an interactive OER created by the author in December of 2020. Enhancing Print Journal Analysis for Shared Print Collections The Western Regional Storage Trust (WEST), is a distributed shared print journal repository program serving research libraries, college and university libraries, and library consortia in the Western Region of the United States. WEST solicits serial bibliographic records and related holdings biennially, which are evaluated and identified as candidates for shared print archiving using a complex collection analysis process. California Digital Library’s Discovery & Delivery WEST operations team (WEST-Ops) supports the functionality behind this collection analysis process used by WEST program staff (WEST-Staff) and members. For WEST, proposals for shared print archiving have been historically predicated on what is known as an Ulrich’s journal family, which pulls together related serial titles, for example, succeeding and preceding serial titles, their supplements, and foreign language parallel titles. Ulrich’s, while it has been invaluable, proves problematic in several ways, resulting in the approximate omission of half of the journal titles submitted for collection analysis. Part of WEST’s effectiveness in archiving hinges upon its ability to analyze local serials data across its membership as holistically as possible. The process that enables this analysis, and subsequent archiving proposals, is dependent on Ulrich’s journal family, for which ISSN has been traditionally used to match and cluster all related titles within a particular family. As such, the process is limited in that many journals have never been assigned ISSNs, especially older publications, or member bibliographic records may lack an ISSN(s), though the ISSN may exist in an OCLC primary record. Building a mechanism for matching on ISSNs that goes beyond the base set of primary, former, and succeeding titles, expands the number of eligible ISSNs that facilitate Ulrich’s journal family matching. Furthermore, when no matches in Ulrich’s can be made based on ISSN, other types of control numbers within a bibliographic record may be used to match with records that have been previously matched with an Ulrich’s journal family via ISSN, resulting in a significant increase in the number of titles eligible for collection analysis. This paper will discuss problems in Ulrich’s journal family matching, improved functional methodologies developed to address those problems, and potential strategies to improve in serial title clustering in the future. How We Built a Spatial Subject Classification Based on Wikidata From the fall of 2017 to the beginning of 2020 a project had been carried out to upgrade spatial subject indexing in North Rhine-Westphalian Bibliography (NWBib) from uncontrolled strings to controlled values. For this purpose, a spatial classification with around 4,500 entries was created from Wikidata and published as SKOS (Simple Knowledge Organization System) vocabulary. The article gives an overview over the initial problem and outlines the different implementation steps. Institutional Data Repository Development, a Moving Target At the end of 2019, the Research Data Service (RDS) at the University of Illinois at Urbana-Champaign (UIUC) completed its fifth year as a campus-wide service. In order to gauge the effectiveness of the RDS in meeting the needs of Illinois researchers, RDS staff developed a five-year review consisting of a survey and a series of in-depth focus group interviews. As a result, our institutional data repository developed in-house by University Library IT staff, Illinois Data Bank, was recognized as the most useful service offering by our unit. When launched in 2016, storage resources and web servers for Illinois Data Bank and supporting systems were hosted on-premises at UIUC. As anticipated, researchers increasingly need to share large, and complex datasets. In a responsive effort to leverage the potentially more reliable, highly available, cost-effective, and scalable storage accessible to computation resources, we migrated our item bitstreams and web services to the cloud. Our efforts have met with success, but also with painful bumps along the way. This article describes how we supported data curation workflows through transitioning from on-premises to cloud resource hosting. It details our approaches to ingesting, curating, and offering access to dataset files up to 2TB in size--which may be archive type files (e.g., .zip or .tar) containing complex directory structures. On the Nature of Extreme Close-Range Photogrammetry: Visualization and Measurement of North African Stone Points Image acquisition, visualization, and measurement are examined in the context of extreme close-range photogrammetric data analysis. Manual measurements commonly used in traditional stone artifact investigation are used as a starting point to better gauge the usefulness of high-resolution 3D surrogates and the flexible digital tool sets that can work with them. The potential of various visualization techniques are also explored in the context of future teaching, learning, and research in virtual environments. Optimizing Elasticsearch Search Experience Using a Thesaurus The Belgian Art Links and Tools (BALaT) (http://balat.kikirpa.be/) is the continuously expanding online documentary platform of the Royal Institute for Cultural Heritage (KIK-IRPA), Brussels (Belgium). BALaT contains over 750,000 images of KIK-IRPA’s unique collection of photo negatives on the cultural heritage of Belgium, but also the library catalogue, PDFs of articles from KIK-IRPA’s Bulletin and other publications, an extensive persons and institutions authority list, and several specialized thematic websites, each of those collections being multilingual as Belgium has three official languages. All these are interlinked to give the user easy access to freely available information on the Belgian cultural heritage. During the last years, KIK-IRPA has been working on a detailed and inclusive data management plan. Through this data management plan, a new project HESCIDA (Heritage Science Data Archive) will upgrade BALaT to BALaT+, enabling access to searchable registries of KIK-IRPA datasets and data interoperability. BALaT+ will be a building block of DIGILAB, one of the future pillars of the European Research Infrastructure for Heritage Science (E-RIHS), which will provide online access to scientific data concerning tangible heritage, following the FAIR-principles (Findable-Accessible-Interoperable-Reusable). It will include and enable access to searchable registries of specialized digital resources (datasets, reference collections, thesauri, ontologies, etc.). In the context of this project, Elasticsearch has been chosen as the technology empowering the search component of BALaT+. An essential feature of this search functionality of BALaT+ is the need for linguistic equivalencies, meaning a term query in French should also return the matching results containing the equivalent term in Dutch. Another important feature is to offer a mechanism to broaden the search with elements of more precise terminology: a term like "furniture" could also match records containing chairs, tables, etc. This article will explain how a thesaurus developed in-house at KIK-IRPA was used to obtain these functionalities, from the processing of that thesaurus to the production of the configuration needed by Elasticsearch. Pythagoras: Discovering and Visualizing Musical Relationships Using Computer Analysis This paper presents an introduction to Pythagoras, an in-progress digital humanities project using Python to parse and analyze XML-encoded music scores. The goal of the project is to use recurring patterns of notes to explore existing relationships among musical works and composers. An intended outcome of this project is to give music performers, scholars, librarians, and anyone else interested in digital humanities new insights into musical relationships as well as new methods of data analysis in the arts. Editorial Resuming our publication schedule Managing an institutional repository workflow with GitLab and a folder-based deposit system Institutional Repositories (IR) exist in a variety of configurations and in various states of development across the country. Each organization with an IR has a workflow that can range from explicitly documented and codified sets of software and human workflows, to ad hoc assortments of methods for working with faculty to acquire, process and load items into a repository. The University of North Texas (UNT) Libraries has managed an IR called UNT Scholarly Works for the past decade but has until recently relied on ad hoc workflows. Over the past six months, we have worked to improve our processes in a way that is extensible and flexible while also providing a clear workflow for our staff to process submitted and harvested content. Our approach makes use of GitLab and its associated tools to track and communicate priorities for a multi-user team processing resources. We paired this Web-based management with a folder-based system for moving the deposited resources through a sequential set of processes that are necessary to describe, upload, and preserve the resource. This strategy can be used in a number of different applications and can serve as a set of building blocks that can be configured in different ways. This article will discuss which components of GitLab are used together as tools for tracking deposits from faculty as they move through different steps in the workflow. Likewise, the folder-based workflow queue will be presented and described as implemented at UNT, and examples for how we have used it in different situations will be presented. Customizing Alma and Primo for Home & Locker Delivery Like many Ex Libris libraries in Fall 2020, our library at California State University, Northridge (CSUN) was not physically open to the public during the 2020-2021 academic year, but we wanted to continue to support the research and study needs of our over 38,000 university students and 4,000 faculty and staff. This article will explain our Alma and Primo implementation to allow for home mail delivery of physical items, including policy decisions, workflow changes, customization of request forms through labels and delivery skins, customization of Alma letters, a Python solution to add the “home” address type to patron addresses to make it all work, and will include relevant code samples in Python, XSL, CSS, XML, and JSON. In Spring 2021, we will add the on-site locker delivery option in addition to home delivery, and this article will include new system changes made for that option. GaNCH: Using Linked Open Data for Georgia’s Natural, Cultural and Historic Organizations’ Disaster Response In June 2019, the Atlanta University Center Robert W. Woodruff Library received a LYRASIS Catalyst Fund grant to support the creation of a publicly editable directory of Georgia’s Natural, Cultural and Historical Organizations (NCHs), allowing for quick retrieval of location and contact information for disaster response. By the end of the project, over 1,900 entries for NCH organizations in Georgia were compiled, updated, and uploaded to Wikidata, the linked open data database from the Wikimedia Foundation. These entries included directory contact information and GIS coordinates that appear on a map presented on the GaNCH project website (https://ganch.auctr.edu/), allowing emergency responders to quickly search for NCHs by region and county in the event of a disaster. In this article we discuss the design principles, methods, and challenges encountered in building and implementing this tool, including the impact the tool has had on statewide disaster response after implementation. Archive This Moment D.C.: A Case Study of Participatory Collecting During COVID-19 When the COVID-19 pandemic brought life in Washington, D.C. to a standstill in March 2020, staff at DC Public Library began looking for ways to document how this historic event was affecting everyday life. Recognizing the value of first-person accounts for historical research, staff launched Archive This Moment D.C. to preserve the story of daily life in the District during the stay-at-home order. Materials were collected from public Instagram and Twitter posts submitted through the hashtag #archivethismomentdc. In addition to social media, creators also submitted materials using an Airtable webform set up for the project and through email. Over 2,000 digital files were collected. This article will discuss the planning, professional collaboration, promotion, selection, access, and lessons learned from the project; as well as the technical setup, collection strategies, and metadata requirements. In particular, this article will include a discussion of the evolving collection scope of the project and the need for clear ethical guidelines surrounding privacy when collecting materials in real-time. Advancing ARKs in the Historical Ontology Space This paper presents the application of Archival Resource Keys (ARKs) for persistent identification and resolution of concepts in historical ontologies. Our use case is the 1910 Library of Congress Subject Headings (LCSH), which we have converted to the Simple Knowledge Organization System (SKOS) format and will use for representing a corpus of historical Encyclopedia Britannica articles. We report on the steps taken to assign ARKs in support of the Nineteenth-Century Knowledge Project, where we are using the HIVE vocabulary tool to automatically assign subject metadata from both the 1910 LCSH and the contemporary LCSH faceted, topical vocabulary to enable the study of the evolution of knowledge. Considered Content: a Design System for Equity, Accessibility, and Sustainability The University of Minnesota Libraries developed and applied a principles-based design system to their Health Sciences Library website. With the design system at its center, the revised site was able to achieve accessible, ethical, inclusive, sustainable, responsible, and universal design. The final site was built with elegantly accessible semantic HTML-focused code on Drupal 8 with highly curated and considered content, meeting and exceeding WCAG 2.1 AA guidance and addressing cognitive and learning considerations through the use of plain language, templated pages for consistent page-level organization, and no hidden content. As a result, the site better supports all users regardless of their abilities, attention level, mental status, reading level, and reliability of their internet connection, all of which are especially critical now as an elevated number of people experience crises, anxieties, and depression. Robustifying Links To Combat Reference Rot Links to web resources frequently break, and linked content can change at unpredictable rates. These dynamics of the Web are detrimental when references to web resources provide evidence or supporting information. In this paper, we highlight the significance of reference rot, provide an overview of existing techniques and their characteristics to address it, and introduce our Robust Links approach, including its web service and underlying API. Robustifying links offers a proactive, uniform, and machine-actionable way to combat reference rot. In addition, we discuss our reasoning and approach aimed at keeping the approach functional for the long term. To showcase our approach, we have robustified all links in this article. Machine Learning Based Chat Analysis The BYU library implemented a Machine Learning-based tool to perform various text analysis tasks on transcripts of chat-based interactions between patrons and librarians. These text analysis tasks included estimating patron satisfaction and classifying queries into various categories such as Research/Reference, Directional, Tech/Troubleshooting, Policy/Procedure, and others. An accuracy of 78% or better was achieved for each category. This paper details the implementation details and explores potential applications for the text analysis tool. Always Be Migrating At the University of California, Los Angeles, the Digital Library Program is in the midst of a large, multi-faceted migration project. This article presents a narrative of migration and a new mindset for technology and library staff in their ever-changing infrastructure and systems. This article posits that migration from system to system should be integrated into normal activities so that it is not a singular event or major project, but so that it is a process built into the core activities of a unit. Editorial: For Pandemic Times Such as This A pandemic changes the world and changes libraries. Open Source Tools for Scaling Data Curation at QDR This paper describes the development of services and tools for scaling data curation services at the Qualitative Data Repository (QDR). Through a set of open-source tools, semi-automated workflows, and extensions to the Dataverse platform, our team has built services for curators to efficiently and effectively publish collections of qualitatively derived data. The contributions we seek to make in this paper are as follows: 1. We describe ‘human-in-the-loop’ curation and the tools that facilitate this model at QDR; 2. We provide an in-depth discussion of the design and implementation of these tools, including applications specific to the Dataverse software repository, as well as standalone archiving tools written in R; and 3. We highlight the role of providing a service layer for data discovery and accessibility of qualitative data. Keywords: Data curation; open-source; qualitative data From Text to Map: Combing Named Entity Recognition and Geographic Information Systems This tutorial shows readers how to leverage the power of named entity recognition (NER) and geographic information systems (GIS) to extract place names from text, geocode them, and create a public-facing map. This process is highly useful across disciplines. For example, it can be used to generate maps from historical primary sources, works of literature set in the real world, and corpora of academic scholarship. In order to lead the reader through this process, the authors work with a 500 article sample of the COVID-19 Open Research Dataset Challenge (CORD-19) dataset. As of the date of writing, CORD-19 includes 45,000 full-text articles with metadata. Using this sample, the authors demonstrate how to extract locations from the full-text with the spaCy library in Python, highlight methods to clean up the extracted data with the Pandas library, and finally teach the reader how to create an interactive map of the places using ArcGIS Online. The processes and code are described in a manner that is reusable for any corpus of text Using Integrated Library Systems and Open Data to Analyze Library Cardholders The Harrison Public Library in Westchester County, New York operates two library buildings in Harrison: The Richard E. Halperin Memorial Library Building (the library’s main building, located in downtown Harrison) and a West Harrison branch location. As part of its latest three-year strategic plan, the library sought to use existing resources to improve understanding of its cardholders at both locations. To do so, we needed to link the circulation data in our integrated library system, Evergreen, to geographic data and demographic data. We decided to build a geodemographic heatmap that incorporated all three aforementioned types of data. Using Evergreen, American Community Survey (ACS) data, and Google Maps, we plotted each cardholder’s residence on a map, added census boundaries (called tracts) and our town’s borders to the map, and produced summary statistics for each tract detailing its demographics and the library card usage of its residents. In this article, we describe how we acquired the necessary data and built the heatmap. We also touch on how we safeguarded the data while building the heatmap, which is an internal tool available only to select authorized staff members. Finally, we discuss what we learned from the heatmap and how libraries can use open data to benefit their communities. Update OCLC Holdings Without Paying Additional Fees: A Patchwork Approach Accurate OCLC holdings are vital for interlibrary loan transactions. However, over time weeding projects, replacing lost or damaged materials, and human error can leave a library with a catalog that is no longer reflected through OCLC. While OCLC offers reclamation services to bring poorly maintained collections up-to-date, the associated fee may be cost prohibitive for libraries with limited budgets. This article will describe the process used at Austin Peay State University to identify, isolate, and update holdings using OCLC Collection Manager queries, MarcEdit, Excel, and Python. Some portions of this process are completed using basic coding; however, troubleshooting techniques will be included for those with limited previous experience. Data reuse in linked data projects: a comparison of Alma and Share-VDE BIBFRAME networks This article presents an analysis of the enrichment, transformation, and clustering used by vendors Casalini Libri/@CULT and Ex Libris for their respective conversions of MARC data to BIBFRAME. The analysis considers the source MARC21 data used by Alma then the enrichment and transformation of MARC21 data from Share-VDE partner libraries. The clustering of linked data into a BIBFRAME network is a key outcome of data reuse in linked data projects and fundamental to the improvement of the discovery of library collections on the web and within search systems. CollectionBuilder-CONTENTdm: Developing a Static Web ‘Skin’ for CONTENTdm-based Digital Collections Unsatisfied with customization options for CONTENTdm, librarians at University of Idaho Library have been using a modern static web approach to creating digital exhibit websites that sit in front of the digital repository. This "skin" is designed to provide users with new pathways to discover and explore collection content and context. This article describes the concepts behind the approach and how it has developed into an open source, data-driven tool called CollectionBuilider-CONTENTdm. The authors outline the design decisions and principles guiding the development of CollectionBuilder, and detail how a version is used at the University of Idaho Library to collaboratively build digital collections and digital scholarship projects. Automated Collections Workflows in GOBI: Using Python to Scrape for Purchase Options The NC State University Libraries has developed a tool for querying GOBI, our print and ebook ordering vendor platform, to automate monthly collections reports. These reports detail purchase options for missing or long-overdue items, as well as popular items with multiple holds. GOBI does not offer an API, forcing staff to conduct manual title-by-title searches that previously took up to 15 hours per month. To make this process more efficient, we wrote a Python script that automates title searches and the extraction of key data (price, date of publication, binding type) from GOBI. This tool can gather data for hundreds of titles in half an hour or less, freeing up time for other projects. This article will describe the process of creating this script, as well as how it finds and selects data in GOBI. It will also discuss how these results are paired with NC State’s holdings data to create reports for collection managers. Lastly, the article will examine obstacles that were experienced in the creation of the tool and offer recommendations for other organizations seeking to automate collections workflows. Testing remote access to e-resource with CodeceptJS At the Badische Landesbibliothek Karlsruhe (BLB) we offer a variety of e-resources with different access requirements. On the one hand, there is free access to open access material, no matter where you are. On the other hand, there are e-resources that you can only access when you are in the rooms of the BLB. We also offer e-resources that you can access from anywhere, but you must have a library account for authentication to gain access. To test the functionality of these access methods, we have created a project to automatically test the entire process from searching our catalogue, selecting a hit, logging in to the provider's site and checking the results. For this we use the End 2 End Testing Framework CodeceptJS.
feeds-feedburner-com-9181 ---- None
feeds-feedburner-com-921 ---- None
feeds-feedburner-com-9269 ---- None
feeds-feedburner-com-9359 ---- Hanging Together Hanging Together the OCLC Research blog A research roadmap for Building a National Finding Aid Network (NAFAN) I had the opportunity to develop and lead the OCLC project team in the user research design phase for the IMLS-funded project (grant number LG-246349-OLS-20), Building a National Finding Aid … The post A research roadmap for Building a National Finding Aid Network (NAFAN) appeared first on Hanging Together. How well does EAD tag usage support finding aid discovery? In November, we shared information with you about the Building a National Finding Aid Network project (NAFAN). This is a two-year research and demonstration project to build the foundation for a (US) national … The post How well does EAD tag usage support finding aid discovery? appeared first on Hanging Together. Social interoperability: Getting to know all about you Building and sustaining productive cross-campus partnerships in support of the university research enterprise is both necessary and fraught with challenges. Social interoperability – the creation and maintenance of working relationships … The post Social interoperability: Getting to know all about you appeared first on Hanging Together. Reimagine Descriptive Workflows: meeting the challenges of inclusive description in shared infrastructure In a previous blog post, I told you about our Reimagine Descriptive Workflows project, and the path we took to get there. In that post, I shared the three objectives … The post Reimagine Descriptive Workflows: meeting the challenges of inclusive description in shared infrastructure appeared first on Hanging Together. Fill your social interoperability toolbox Social interoperability – the creation and maintenance of working relationships across individuals and organizational units that promote collaboration, communication, and mutual understanding – is important. But it can be hard … The post Fill your social interoperability toolbox appeared first on Hanging Together. Filling our cups at the home office water cooler A few weeks ago I learned that Crystal, an OCLC colleague I barely knew, loves to play board games, that she and her husband just became empty nesters (like my … The post Filling our cups at the home office water cooler appeared first on Hanging Together. Working across campus is like herding flaming cats Do you work at a university? If so, did you know that you work in a complex, adaptive system? And did you know that that makes it hard to build … The post Working across campus is like herding flaming cats appeared first on Hanging Together. The REALM project: What we’ve learned and what’s next When the REALM project began in April 2020, little was known about the COVID-19 virus. Now, more than a year later, REALM has completed eight laboratory tests, synthesized emerging research … The post The REALM project: What we’ve learned and what’s next appeared first on Hanging Together. ‘Reimagine Descriptive Workflows’ in libraries and archives In the OCLC Research Library Partnership, we have a practice of “Learning Together” – we listen for issues that form a shared challenge space within our global partnership, then we … The post ‘Reimagine Descriptive Workflows’ in libraries and archives appeared first on Hanging Together. Join us for the Total Cost of Stewardship / #OCLC_TCoS Twitter Chat! On May 20th from noon-1pm PDT / 3-4pm EDT / 8-9pm BST, we are hosting a Twitter chat inspired by our recent report Total Cost of Stewardship: Responsible Collection Building … The post Join us for the Total Cost of Stewardship / #OCLC_TCoS Twitter Chat! appeared first on Hanging Together.
feeds-feedburner-com-9371 ---- None
feeds-feedburner-com-954 ---- Free Range Librarian Free Range Librarian K.G. Schneider's blog on librarianship, writing, and everything else (Dis)Association I have been reflecting on the future of a national association I belong to that has struggled with relevancy and with closing the distance between itself and its members, has distinct factions that differ on fundamental matters of values, faces declining national and chapter membership, needs to catch up on the technology curve, has sometimes […] I have measured out my life in Doodle polls You know that song? The one you really liked the first time you heard it? And even the fifth or fifteenth? But now your skin crawls when you hear it? That’s me and Doodle. In the last three months I have filled out at least a dozen Doodle polls for various meetings outside my organization. […] Memento DMV This morning I spent 40 minutes in the appointment line at the Santa Rosa DMV to get my license renewed and converted to REAL ID, but was told I was “too early” to renew my license, which expires in September, so I have to return after I receive my renewal notice. I could have converted […] An Old-Skool Blog Post I get up early these days and get stuff done — banking and other elder-care tasks for my mother, leftover work from the previous day, association or service work. A lot of this is writing, but it’s not writing. I have a half-dozen unfinished blog posts in WordPress, and even more in my mind. I […] Keeping Council Editorial note: Over half of this post was composed in July 2017. At the time, this post could have been seen as politically neutral (where ALA is the political landscape I’m referring to) but tilted toward change and reform. Since then, Events Have Transpired. I revised this post in November, but at the time hesitated […] What burns away We are among the lucky ones. We did not lose our home. We did not spend day after day evacuated, waiting to learn the fate of where we live. We never lost power or Internet. We had three or four days where we were mildly inconvenienced because PG&E wisely turned off gas to many neighborhoods, […] Neutrality is anything but “We watch people dragged away and sucker-punched at rallies as they clumsily try to be an early-warning system for what they fear lies ahead.” — Unwittingly prophetic me, March, 2016. Sometime after last November, I realized something very strange was happening with my clothes. My slacks had suddenly shrunk, even if I hadn’t washed them. After […] MPOW in the here and now I have coined a few biblioneologisms in my day, but the one that has had the longest legs is MPOW (My Place of Work), a convenient, mildly-masking shorthand for one’s institution. For the last four years I haven’t had the bandwidth to coin neologisms, let alone write about MPOW*. This silence could be misconstrued. I […] Questions I have been asked about doctoral programs About six months ago I was visiting another institution when someone said to me, “Oh, I used to read your blog, BACK IN THE DAY.” Ah yes, back in the day, that Pleistocene era when I wasn’t working on a PhD while holding down a big job and dealing with the rest of life’s shenanigans. […] A scholar’s pool of tears, Part 2: The pre in preprint means not done yet Note, for two more days, January 10 and 11, you (as in all of you) have free access to my article, To be real: Antecedents and consequences of sexual identity disclosure by academic library directors. Then it drops behind a paywall and sits there for a year. When I wrote Part 1 of this blog […]
feeds-feedburner-com-9598 ---- None
feeds-feedburner-com-9866 ---- None
feeds-fiander-info-9438 ---- Rapid Communications Rapid Communications Rapid, but irregular, communications from the frontiers of Library Technology Mac OS vs Emacs: Getting on the right (exec) PATH Finding ISBNs in the the digits of π Software Upgrades and The Parable of the Windows Using QR Codes in the Library A Manifesto for the Library I'm a Shover and Maker! LITA Tears Down the Walls A (Half) Year in Books The Desk Set Drinking Game July Book a Month Challenge: Independence June Book a Month Challenge: Knowledge Anthony Hope and the Triumph of the Public Domain May Book a Month Challenge: Mother Eric S. Raymond on Proprietary ILSs One Big Library Unconference in Toronto April Book A Month Challenge: Beauty Thinking About Dates on To-Do List Web Sites The Most Important Programming Language I've Learned Building Systems that Support Librarians Book A Month Challenge for March: Craft Social Aggregators On Keeping a Reading Journal BAM Challenge: Heart Where the Users Are My Top Technology Trends Slides
feeds-pinboard-in-9092 ---- Pinboard (items tagged code4lib) https://pinboard.in/t:code4lib/ Delivering Fast and Light Applications with Save-Data 2021-06-01T22:08:29+00:00 https://developers.google.com/web/fundamentals/performance/optimizing-content-efficiency/save-data jasonclark if ("connection" in navigator) { if (navigator.connection.saveData === true) { // Implement data saving operations here. } } _todo performance code4lib article energy green web green-digital-libraries javascript https://pinboard.in/ https://pinboard.in/u:jasonclark/b:d3cbb7baabf6/ How Web Content Can Affect Power Usage | WebKit 2021-06-01T20:00:15+00:00 https://webkit.org/blog/8970/how-web-content-can-affect-power-usage/ jasonclark performance code4lib article energy green web green-digital-libraries javascript https://pinboard.in/ https://pinboard.in/u:jasonclark/b:e0a250397e3f/ anelki.net | /home/anelki 2021-05-22T13:35:21+00:00 https://anelki.net/ edsu personal reflections in challenging times.
code4lib people https://pinboard.in/u:edsu/b:6e01aabf55b3/ Code4Lib - YouTube 2021-04-29T10:49:09+00:00 https://www.youtube.com/channel/UCNMKMDFo-Ul-iabnTouzh-Q/videos esperr code4lib conferences https://pinboard.in/ https://pinboard.in/u:esperr/b:cb240d6564da/ (400) https://twitter.com/rudokemper/status/1371454887721119748/photo/1 2021-03-23T15:36:56+00:00 https://twitter.com/rudokemper/status/1371454887721119748/photo/1 bsscdt RT @rudokemper: Floored and honored to have been invited to give a keynote for the #c4l21 #code4lib conference next Monday. I can't wait to share about our work building open-source tech for communities to map oral histories, and how my journey started in the library + archive space! @code4lib c4l21 code4lib https://twitter.com/ https://pinboard.in/u:bsscdt/b:393a9fefac65/ Untitled (https://d1keuthy5s86c8.cloudfront.net/static/ems/upload/files/code4lib21_discogs_blacklight.pdf) 2021-03-23T05:00:37+00:00 https://d1keuthy5s86c8.cloudfront.net/static/ems/upload/files/code4lib21_discogs_blacklight.pdf rybesh RT @sf433: Really happy to share, “Dynamic Integration of Discogs Data within a Blacklight Catalog” From now on I’m going to ask myself, “Can this talk be a poster?” #code4lib code4lib https://twitter.com/ https://pinboard.in/u:rybesh/b:731426d5f14f/ The Code4Lib Journal – Advancing ARKs in the Historical Ontology Space 2021-03-10T18:19:28+00:00 https://journal.code4lib.org/articles/15608 geephroh code4lib digitallibraries digitalpreservation data ontology identifiers digitalhumanities ark computationalarchivalscience cas archives journalarticle https://pinboard.in/ https://pinboard.in/u:geephroh/b:60093e26caf8/ The Code4Lib Journal – Managing an institutional repository workflow with GitLab and a folder-based deposit system 2021-02-16T00:56:37+00:00 https://journal.code4lib.org/articles/15650 aarontay Managing an institutional repository workflow with GitLab and a folder-based deposit system by Whitney R. Johnson-Freeman, @vphill, and Kristy K. Phillips #code4lib Journal issue 50. code4lib https://twitter.com/ https://pinboard.in/u:aarontay/b:95dfc9c36cda/ LISTSERV 16.5 - CODE4LIB Archives 2020-09-29T12:04:57+00:00 https://lists.clir.org/cgi-bin/wa?A2=CODE4LIB;e2bc9365.2009 miaridge RT @kiru: I forgot to post the call earlier: The Code4Lib Journal () is looking for volunteers to join its editorial committee. Deadline: 12 Oct. #code4lib code4lib https://twitter.com/ https://pinboard.in/u:miaridge/b:e26e92731fb6/ 20 - C4L [5] Future Role of Libraries in Researcher Workflows - Google Slides 2020-03-11T00:13:42+00:00 https://t.co/JCoE2mVhD5 elibtronic research-lifecycle code4lib publish scholarly-communication https://pinboard.in/u:elibtronic/b:7282952b4f7a/ Twitter 2020-02-18T09:20:53+00:00 https://twitter.com/i/web/status/1229697282284625920 aarontay New issue of the The #Code4Lib Journal published. Some terrific looking papers, including a review of PIDs for heri… Code4Lib https://twitter.com/ https://pinboard.in/u:aarontay/b:8525b50b475d/ (500) https://journal.code4lib.org/ 2020-02-18T08:24:34+00:00 https://journal.code4lib.org/ miaridge RT @kiru: I am very happy to announce the publication of the @Code4Lib Journal issue #47: webscraping… 47 code4lib https://twitter.com/ https://pinboard.in/u:miaridge/b:8f5c33d4d11c/ The Code4Lib Journal – COLUMN: We Love Open Source Software. No, You Can’t Have Our Code 2019-12-09T23:24:08+00:00 https://journal.code4lib.org/articles/527 pfhyper Librarians are among the strongest proponents of open source software. Paradoxically, libraries are also among the least likely to actively contribute their code to open source projects. This article identifies and discusses six main reasons this dichotomy exists and offers ways to get around them. Code4Lib library LIBT opensource finalproject https://pinboard.in/ https://pinboard.in/u:pfhyper/b:4da9d5a48b61/ The Code4Lib Journal – Barriers to Initiation of Open Source Software Projects in Libraries 2019-12-09T23:20:43+00:00 https://journal.code4lib.org/articles/10665 pfhyper Libraries share a number of core values with the Open Source Software (OSS) movement, suggesting there should be a natural tendency toward library participation in OSS projects. However Dale Askey’s 2008 Code4Lib column entitled “We Love Open Source Software. No, You Can’t Have Our Code,” claims that while libraries are strong proponents of OSS, they are unlikely to actually contribute to OSS projects. He identifies, but does not empirically substantiate, six barriers that he believes contribute to this apparent inconsistency. In this study we empirically investigate not only Askey’s central claim but also the six barriers he proposes. In contrast to Askey’s assertion, we find that initiation of and contribution to OSS projects are, in fact, common practices in libraries. However, we also find that these practices are far from ubiquitous; as Askey suggests, many libraries do have opportunities to initiate OSS projects, but choose not to do so. Further, we find support for only four of Askey’s six OSS barriers. Thus, our results confirm many, but not all, of Askey’s assertions. Code4Lib library LIBT opensource finalproject https://pinboard.in/ https://pinboard.in/u:pfhyper/b:74f337d2e129/ Twitter 2019-11-07T05:59:14+00:00 https://twitter.com/i/web/status/1191993029948780545 jbfink RT @kiru: The #Code4Lib Journal's issue 46 (2019/4) has been just published: . Worldcat Search API, Go… Code4Lib https://twitter.com/ https://pinboard.in/u:jbfink/b:d0cd0f6754e5/ Twitter 2019-11-01T15:40:51+00:00 https://twitter.com/i/web/status/1190292574008987648 jbfink RT @mjingle: Who's excited for the next #code4lib conference?! It will be in Pittsburgh, PA from March 8-11. Is your org interes… code4lib https://twitter.com/ https://pinboard.in/u:jbfink/b:14defc6eb027/ Attempto Project 2019-09-13T09:31:25+00:00 http://attempto.ifi.uzh.ch/site/ blebo nlp basic cnl computationalLinguistics controlledLanguage controlled_language code4lib compsci english knowledgeRepresentation https://pinboard.in/u:blebo/b:5a5b84f3a2fd/ Twitter 2019-08-22T22:54:45+00:00 https://twitter.com/i/web/status/1164566585371066368 danbri When our grandchildren ask about the Great #code4lib IRC Battle of the Tisane, we will serve them both tea and coff… code4lib https://twitter.com/ https://pinboard.in/u:danbri/b:3ce9a224628e/ Code4Lib 2019 Recap – bloggERS! 2019-07-23T17:38:41+00:00 https://saaers.wordpress.com/2019/04/02/code4lib-2019-recap/ geephroh code4lib digitallibraries research saa archives https://pinboard.in/ https://pinboard.in/u:geephroh/b:232421afd001/ Digital Technologies Development Librarian | NC State University Libraries 2019-07-09T15:54:39+00:00 https://www.lib.ncsu.edu/jobs/ehra/dtdl2019 cdmorris We're hiring a Digital Technologies Development Librarian @ncsulibraries ! #job #libjobs #code4lib #dlf #libtech dlf libtech code4lib job libjobs https://twitter.com/ https://pinboard.in/u:cdmorris/b:cf25e0f15239/ Twitter 2019-07-03T13:01:26+00:00 https://twitter.com/i/web/status/1146403575649787904 jbfink 3) All the men who want to preserve the idea of a #Code4Lib discussion space as one that's free of such topics as s… Code4Lib https://twitter.com/ https://pinboard.in/u:jbfink/b:d2f274738572/ Google Refine cheat sheet (code4lib) 2019-05-31T23:23:19+00:00 https://code4libtoronto.github.io/2018-10-12-access/GoogleRefineCheatSheets.pdf Psammead openRefine code4lib how-to cheatsheet https://pinboard.in/ https://pinboard.in/u:Psammead/b:d34452c7d709/ Untitled (https://www.youtube.com/watch?v=ICbLVnCHpnw) 2019-05-31T19:41:08+00:00 https://www.youtube.com/watch?v=ICbLVnCHpnw cdmorris Code4Lib Southeast happening today! Live stream starting at 9:30am eastern. #code4libse2019 #code4lib code4libse2019 code4lib https://twitter.com/ https://pinboard.in/u:cdmorris/b:d06090cf849c/ Twitter 2019-04-12T16:27:34+00:00 https://twitter.com/i/web/status/1116739648724897792 lbjay It occurs to me the #code4lib statement of support for Chris Bourg, , offers a better model… code4lib https://twitter.com/ https://pinboard.in/u:lbjay/b:d8424d01c06f/ GitHub - code4lib/c4l18-keynote-statement: Code4Lib Community Statement in Support of Chris Bourg 2019-04-12T16:27:34+00:00 https://github.com/code4lib/c4l18-keynote-statement lbjay It occurs to me the #code4lib statement of support for Chris Bourg, , offers a better model… code4lib https://twitter.com/ https://pinboard.in/u:lbjay/b:80b4ef487c08/ Twitter 2019-03-01T18:42:32+00:00 https://twitter.com/i/web/status/1101553322773770240 jbfink Now that the #code4lib Discord is up & running, I'm contemplating leaving Slack overall, with exception for plannin… code4lib https://twitter.com/ https://pinboard.in/u:jbfink/b:c5d0f0ddd90d/ (429) https://twitter.com/palcilibraries/status/1098658932589965312/photo/1 2019-02-22T03:01:16+00:00 https://twitter.com/palcilibraries/status/1098658932589965312/photo/1 cdmorris Talking privacy and RA21 at #c4l19 with Dave Lacy from @TempleLibraries #code4lib c4l19 code4lib https://twitter.com/ https://pinboard.in/u:cdmorris/b:9f144c1c99f8/ SCOPE: An access interface for DIPs from Archivematica 2019-02-21T00:55:32+00:00 https://github.com/CCA-Public/dip-access-interface sdellis archives code4lib https://pinboard.in/ https://pinboard.in/u:sdellis/b:1489ef99d5c6/ Review, Appraisal and Triage of Mail (RATOM) 2019-02-21T00:48:05+00:00 http://ratom.web.unc.edu/ sdellis archives code4lib https://pinboard.in/ https://pinboard.in/u:sdellis/b:5cdd23154090/ National Web Privacy Forum - MSU Library | Montana State University 2019-02-20T21:36:08+00:00 http://www.lib.montana.edu/privacy-forum/ sdellis privacy analytics code4lib https://pinboard.in/ https://pinboard.in/u:sdellis/b:0b1957db96e2/ The Code4Lib Journal 2019-01-16T14:25:26+00:00 https://journal.code4lib.org/ ratledge Code4lib Library_Technology Journal Journals_Code4Lib https://pinboard.in/ https://pinboard.in/u:ratledge/b:8a9f4c764b97/ Code4Lib | We are developers and technologists for libraries, museums, and archives who are dedicated to being a diverse and inclusive community, seeking to share ideas and build collaboration. 2018-12-05T14:35:01+00:00 https://code4lib.org/ ratledge Code4lib https://pinboard.in/ https://pinboard.in/u:ratledge/b:113cfc93ccb3/ Twitter 2018-11-15T09:00:52+00:00 https://twitter.com/i/web/status/1062993826913099781 verwinv Ne'er had the pleasure to attend #Code4lib myself ... but if you're thinking about it but can't afford to go - ther… Code4lib https://twitter.com/ https://pinboard.in/u:verwinv/b:f42046813ceb/ Twitter 2018-07-26T23:19:49+00:00 https://twitter.com/justindlc/status/1022612508979355649/photo/1 LibrariesVal RT @justindlc: Pre-conference meetup at Ormsby's for Code4Lib Southeast 2018! #code4libse2018 #code4lib code4lib code4libse2018 https://twitter.com/ https://pinboard.in/u:LibrariesVal/b:465c39ad24b0/ Twitter 2018-05-26T00:10:08+00:00 https://twitter.com/i/web/status/1000167164471529477 jbfink Thanks @lydia_zv @redlibrarian and Jolene (are you on Twitter, I can find you?) for a great #code4lib day! It was… code4lib https://twitter.com/ https://pinboard.in/u:jbfink/b:64faa19e4bad/ Twitter 2018-05-11T14:55:10+00:00 https://twitter.com/i/web/status/994954070707273728 jbfink My slides and speakers notes from #code4lib #c4ln18 on Ursula Franklin's "Real World of Technology" (which I really… code4lib c4ln18 https://twitter.com/ https://pinboard.in/u:jbfink/b:a2ed9a40fc54/ Twitter 2018-05-10T09:27:02+00:00 https://twitter.com/i/web/status/994509105006956544 jbfink In an unfortunate timing, it appears the code4lib wiki is down the first day of #code4lib North - there's a cache o… code4lib https://twitter.com/ https://pinboard.in/u:jbfink/b:099edcfb623c/ Twitter 2018-05-08T11:57:24+00:00 https://twitter.com/i/web/status/993775574291230720 jbfink RT @kiru: Just off the (word)press: the #Code4Lib Journal issue 40 is available: . Great articles writ… Code4Lib https://twitter.com/ https://pinboard.in/u:jbfink/b:db3c0bb083a8/ The Code4Lib Journal 2018-05-08T11:57:24+00:00 http://journal.code4lib.org/ jbfink RT @kiru: Just off the (word)press: the #Code4Lib Journal issue 40 is available: . Great articles writ… Code4Lib https://twitter.com/ https://pinboard.in/u:jbfink/b:9be441405213/ Twitter 2018-03-22T18:28:45+00:00 https://twitter.com/GitWishes/status/976754075164438528 lbjay this is all of #code4lib working on @bot4lib circa 2012. code4lib https://twitter.com/ https://pinboard.in/u:lbjay/b:3e91697b52b4/ Twitter 2018-03-19T19:07:46+00:00 https://twitter.com/gmcharlt/status/975810223842713601 danbri This is fabulous news for the cultural heritage open source world. Big ups to @code4lib and @CLIRDLF! #code4lib code4lib https://twitter.com/ https://pinboard.in/u:danbri/b:8cbe22ff2f58/ Twitter 2018-03-11T20:39:02+00:00 https://twitter.com/i/web/status/972894218237743105 miaridge RT @achdotorg: We too co-sign the #code4lib Community Statement in Support of @mchris4duke. We continue to admire an honor our col… code4lib https://twitter.com/ https://pinboard.in/u:miaridge/b:cf4f6d5494e3/ code4lib/c4l18-keynote-statement: Code4Lib Community Statement in Support of Chris Bourg 2018-03-10T00:33:33+00:00 https://github.com/code4lib/c4l18-keynote-statement jbfink code4lib github https://pinboard.in/ https://pinboard.in/u:jbfink/b:12610b3f6bd6/ Code4Lib Community Statement in Support of Chris Bourg | c4l18-keynote-statement 2018-03-09T22:50:57+00:00 https://code4lib.github.io/c4l18-keynote-statement/ wragge RT @CLIRDLF: We’re proud to stand with the #code4lib community in support of #c4l18 keynoter @mchris4duke: code4lib c4l18 https://twitter.com/ https://pinboard.in/u:wragge/b:d81e2b3e7158/ Matthew Reidsma : Auditing Algorithms 2018-02-20T16:41:34+00:00 https://matthew.reidsrow.com/talks/206 malantonio Talks about libraries, technology, and the Web by Matthew Reidsma.
algorithms bias search libraries technology code4lib code4lib-2018 https://pinboard.in/u:malantonio/b:7dd04c469f56/ For the love of baby unicorns: My Code4Lib 2018 Keynote | Feral Librarian 2018-02-19T17:49:48+00:00 https://chrisbourg.wordpress.com/2018/02/14/for-the-love-of-baby-unicorns-my-code4lib-2018-keynote/ petej code4lib diversity technology libraries inclusion mansplaining https://pinboard.in/ https://pinboard.in/u:petej/b:18d1e6f30875/ JIRA for archives - Google Slides 2018-02-15T14:37:38+00:00 https://docs.google.com/presentation/d/1uwYWg04-nT6Qjm-j5HAAvsoH88iKzUCAX0eFBNLcy34/edit#slide=id.g306a7ccaec_0_0 malantonio see https://youtu.be/4cNo3SERnXI?t=1h45m28s for presentation code4lib code4lib-2018 libraries work-life https://pinboard.in/u:malantonio/b:5fc7b215e268/ Twitter 2018-02-07T10:53:30+00:00 https://twitter.com/justin_littman/status/960859481914605568/photo/1 aarontay RT @justin_littman: Peer review of my #code4lib poster on "Where to get Twitter data for academic research." code4lib https://twitter.com/ https://pinboard.in/u:aarontay/b:c54955c97e7d/ Availability Calendar - Kalorama Guest House 2018-01-16T17:55:55+00:00 https://secure.rezovation.com/Reservations/AvailabilityCalendar.aspx?s=UT57fw2WiD skorasaurus KALORAMA GUEST HOUSE CODE4LIB https://pinboard.in/ https://pinboard.in/u:skorasaurus/b:10f300ea6594/ (429) https://twitter.com/i/web/status/941746243352563712 2017-12-20T21:22:21+00:00 https://twitter.com/i/web/status/941746243352563712 DocDre RT @nowviskie: ICYMI: #Code4Lib 2018 registration is open! @mmsubram & @mchris4duke to keynote, reception in the Great Hall… Code4Lib https://twitter.com/ https://pinboard.in/u:DocDre/b:9e19136f92cb/ (429) https://twitter.com/freethefiles/status/938843684572889090/photo/1 2017-12-07T18:52:31+00:00 https://twitter.com/freethefiles/status/938843684572889090/photo/1 verwinv Yay! I'm presenting at #code4lib. And I can say hello to Walter Forsberg, @hbmcd4 and @cristalyze! code4lib https://twitter.com/ https://pinboard.in/u:verwinv/b:86bf904d3371/ (429) https://twitter.com/i/web/status/938488557911576576 2017-12-06T19:21:23+00:00 https://twitter.com/i/web/status/938488557911576576 verwinv Registration for #code4lib is now open! And its being held in #WashingtonDC where our #MemoryLab is - so come visit… WashingtonDC code4lib MemoryLab https://twitter.com/ https://pinboard.in/u:verwinv/b:19769bc2fa8c/ code4lib 2018 - Washington, D.C. 2017-11-13T23:02:58+00:00 http://2018.code4lib.org/ verwinv Last day to vote #code4lib 2018 program! don't forget 😓! code4lib https://twitter.com/ https://pinboard.in/u:verwinv/b:1efcaa1db5a7/ 2018 Presentation Voting Survey 2017-10-23T19:49:45+00:00 https://www.surveymonkey.com/r/c4l2018-presentations verwinv vote #code4lib proposals rather than the presenters. new anonymity feature! check it: Got until 11/13 code4lib https://twitter.com/ https://pinboard.in/u:verwinv/b:81a15e672b49/ LODLAM Challenge Winners 2017-06-29T14:06:06+00:00 https://summit2017.lodlam.net/2017/06/29/lodlam-challenge-winners/ miaridge RT @LODLAM: #LODLAM Challenge prize winners congrats to DIVE+ (Grand) & WarSampo (Open data) teams #DH #musetech #code4lib DH musetech LODLAM code4lib https://twitter.com/ https://pinboard.in/u:miaridge/b:c6429902bd26/ JobBoard 2017-05-11T16:33:41+00:00 https://jobs.code4lib.org/ lbjay Some heroes don't wear capes, y'all. back online and and better than ever thanks to @ryanwick and @_cb_ #code4lib code4lib https://twitter.com/ https://pinboard.in/u:lbjay/b:a7f06f02b03e/ Digital Technologies Development Librarian | NCSU Libraries 2017-05-08T12:56:52+00:00 https://www.lib.ncsu.edu/jobs/ehra/digital-technologies-development-librarian jbfink RT @ronallo: Job opening: Digital Technologies Development Librarian @ncsulibraries #code4lib #libtechwomen Know someone? libtechwomen code4lib https://twitter.com/ https://pinboard.in/u:jbfink/b:3a5951bff6fd/ Who's Using IPFS in Libraries, Archives and Museums - Communities / Libraries, Archives and Museums - discuss.ipfs.io 2017-04-19T20:32:44+00:00 https://discuss.ipfs.io/t/whos-using-ipfs-in-libraries-archives-and-museums/130 sdellis career ipfs libraries code4lib https://pinboard.in/ https://pinboard.in/u:sdellis/b:df848f7bc65b/ Scott W. H. Young on Twitter: "Slides for my talk on participatory design with underrepresented populations. Thank you, #c4l17 :) https://t.co/rVS2Zdv25u" 2017-04-02T17:47:47+00:00 https://twitter.com/hei_scott/status/839523334744236033 brainwane refers to my Code4Lib keynote on empathy & UX yay Code4Lib https://pinboard.in/ https://pinboard.in/u:brainwane/b:4c2ef624cde4/ Twitter 2017-03-23T12:45:58+00:00 https://twitter.com/i/web/status/844892979965890560 lbjay Have not read the full report but based on the abstract seems useful to those involved in the #code4lib incorporati… code4lib https://twitter.com/ https://pinboard.in/u:lbjay/b:96f82f0b17b3/ ResistanceIsFertile - Google Drive 2017-03-09T18:06:41+00:00 https://drive.google.com/drive/folders/0B74oOQcTdnHjMy1WN003ZW5HTXc pmhswe code4lib harlow keynote https://pinboard.in/u:pmhswe/b:1760658453c2/ ResistanceIsFertile - Google Drive 2017-03-09T17:22:43+00:00 https://drive.google.com/drive/folders/0B74oOQcTdnHjMy1WN003ZW5HTXc markpbaggett code4lib harlow keynote https://pinboard.in/ https://pinboard.in/u:markpbaggett/b:cffeeb1e58e6/ Google Drive CMS 2017-03-09T16:08:39+00:00 https://www.drivecms.xyz/ jju webdev programming tech 2017 Code4Lib https://pinboard.in/u:jju/b:f9af0e34a8a0/ Code4Lib | Docker Presentation - Google Slides 2017-03-08T19:48:57+00:00 https://docs.google.com/presentation/d/12P1pR3p67dXIKXJWE5_sHa-RSktax-hzquo-Ffz-TH0/edit#slide=id.p markpbaggett code4lib docker https://pinboard.in/ https://pinboard.in/u:markpbaggett/b:bd340aec487e/ Best Catalog Results Page Ever 2017-03-08T19:05:25+00:00 https://www.dropbox.com/s/jbxe4jpbdck874z/deibel-c4l17-best-ever.pptx markpbaggett code4lib accessibility presentation https://pinboard.in/ https://pinboard.in/u:markpbaggett/b:56f2b0fea47a/ Participatory User Experience Design with Underrepresented Populations: A Model for Disciplined Empathy 2017-03-08T18:09:13+00:00 http://2017.code4lib.org/talks/Participatory-User-Experience-Design-with-Underrepresented-Populations-A-Model-for-Disciplined-Empathy brainwane Am honored & humbled to see #c4l17 Glad my talk/article was helpful! Wish I were at #code4lib to thank you in person c4l17 code4lib https://twitter.com/ https://pinboard.in/u:brainwane/b:9bf7ebd61d5d/ Twitter 2017-02-01T14:02:05+00:00 https://twitter.com/i/web/status/826792743464792065 bsscdt Why don't you join us in the #libux slack? Sign yourself up: #litaux #ux #code4lib… ux libux litaux code4lib https://twitter.com/ https://pinboard.in/u:bsscdt/b:961f3bd08a75/ Untitled (http://libux.co/slack?utm_content=buffer0f822&utm_medium=social&utm_source=twitter.com&utm_campaign=buffer) 2017-02-01T14:02:05+00:00 http://libux.co/slack bsscdt Why don't you join us in the #libux slack? Sign yourself up: #litaux #ux #code4lib… ux libux litaux code4lib https://twitter.com/ https://pinboard.in/u:bsscdt/b:839a04bf9612/ Twitter 2016-12-23T18:11:41+00:00 https://twitter.com/jschneider/status/812360040082456576/photo/1 jcarletonoh Ten Principles for User Protection: #code4lib #privacy #ISCHOOLUI ISCHOOLUI privacy code4lib https://twitter.com/ https://pinboard.in/u:jcarletonoh/b:3bf57dea160b/ Technology in Hostile States: Ten Principles for User Protection | The Tor Blog 2016-12-23T18:11:41+00:00 https://blog.torproject.org/blog/technology-hostile-states-ten-principles-user-protection jcarletonoh Ten Principles for User Protection: #code4lib #privacy #ISCHOOLUI ISCHOOLUI privacy code4lib https://twitter.com/ https://pinboard.in/u:jcarletonoh/b:729712aebf8a/
figshare-com-2281 ---- kazak.pptx Browse kazak.pptx (14.7 MB) kazak.pptx CiteDownload (14.7 MB)ShareEmbed presentation posted on 26.07.2021, 20:00 by Lorcan Dempsey This is a presentation about trends in metadata, focusing on two important issues. The first is entification, moving from strings to things. The second is pluralization, as we seek to better represent the diversity of perspectives, experiences and memories. It discusses an OCLC initiative associated with each trend. History Usage metrics Categories Library and Information Studies Keywords metadatapluralizationentificationknowledge graphdiversityoclc Licence CC BY 4.0 Exports Select an optionRefWorksBibTeXRef. managerEndnoteDataCiteNLMDC Hide footerAboutFeaturesToolsBlogAmbassadorsContactFAQsPrivacy PolicyCookie PolicyT&CsSitemap figshare. credit for all your research.
film-avclub-com-2404 ---- Criterion adds Harold Lloyd’s campus comedy The Freshman to its collection The A.V. Club Deadspin Gizmodo Jalopnik Jezebel Kotaku Lifehacker The Root The Takeout The Onion The Inventory Pop culture obsessives writing for the pop culture obsessed. ShopSubscribe HomeLatestFilmTVMusicGamesAUXNewsPop culture obsessives writing for the pop culture obsessed. HomeLatestFilmTVMusicGamesAUXNews Reviews Criterion adds Harold Lloyd’s campus comedy The Freshman to its collection ByMike D'Angelo 3/26/14 12:00AM Comments (164) ReviewsDVDs B+ The Freshman Director Fred C. Newmeyer, Sam Taylor Runtime 76 minutes Rating Not Rated Cast Harold Lloyd, Jobyna Ralston, Brooks Benedict Advertisement For all their popularity, Charlie Chaplin and Buster Keaton weren’t figures with whom the average American could identify, in the sense of thinking, “That’s me up there!” Harold Lloyd was the silent comic who fulfilled that need. The typical Lloyd hero is a perpetually bumbling go-getter who wants nothing more than to be liked, and who seems like enough of a normal guy, despite the proto-geeky horn-rimmed glasses, to pull that off after some requisite struggles. In 1925’s The Freshman, his character, Harold Lamb, repeatedly introduces himself as “just a regular fellow,” following the lead of his own favorite movie star, Lester Laurel (a fictional actor who stars in the fictional film The College Hero). And it’s in Harold’s determined efforts to prove himself worthy, rather than in the sort of sustained physical comedy practiced by Chaplin and Keaton, that Lloyd truly shines. The Freshman was so successful that Keaton wound up making his own campus comedy, 1927’s College, but this was Lloyd’s natural milieu. Another thing that distinguishes Lloyd’s films is that the intertitles are often as funny as the visual gags. Here, Tate University, the school Harold arrives at as a freshman, is described as “a large football stadium with a college attached,” deftly establishing the path he’ll need to take to earn the respect of the student body. Initially, however, he’s perceived as a laughingstock, in part because he insists on introducing himself to everybody by dancing a stupid little jig that he’d seen Lester Laurel perform. His willingness to buy ice cream for his so-called friends sustains the illusion of popularity, and of course there’s a pretty girl, Peggy (Jobyna Ralston, Lloyd’s regular love interest), who genuinely admires him. But Harold aspires to be Big Man On Campus, and it’s clear that only gridiron glory can make that happen. The movie’s climax was shot at the Rose Bowl (with crowd shots filmed separately at a game between Stanford and U.C. Berkeley), and sees Harold, who’s just the water boy, sent in as a desperation substitute after almost the entire Tate squad has been injured and carried off the field on stretchers. That’s a tad contrived (in a way that isn’t especially funny—it’s hard to root for Harold hoping his teammates get hurt, so that he can play), and is one of the reasons why The Freshman, just issued on Blu-ray as part of the Criterion Collection, isn’t quite as glorious as the previous Lloyd classic the company released, 1923’s Safety Last! Another reason is that a large chunk of the movie’s second half is devoted to material better suited to Keaton, including a party sequence in which Harold wears a hastily tailored suit that rips if he so much as raises an arm or bends a knee. There are some laughs as the tailor attempts to re-stitch his duds from behind a curtain, but it doesn’t achieve the steadily escalating lunacy to which it aspires. On the other hand, nobody but Lloyd could win audience empathy by having his alter ego agree to be a tackling dummy for the football team, gamely rising to his feet and getting knocked down again and again and again. Making intense neediness seem heroic is no easy task, but Lloyd makes it look easy; when the improbably happy ending arrives, with milquetoast Harold scoring the game-winning touchdown, it feels fully earned. As usual, Criterion has packed the disc with extras, including three Lloyd shorts (“The Marathon,” “An Eastern Westerner,” and “High And Dizzy”) and audio commentary (by Leonard Maltin and others). One of the more interesting notes, however, is buried in the booklet’s technical information, which most people probably don’t bother to read. As it turns out, the restored version of The Freshman seen today is mostly not the original film: Two versions were shot simultaneously, using separate cameras from slightly different angles, and approximately 60 percent of the Criterion edition (and pretty much every other edition you’re likely to see nowadays) was actually taken from the foreign-release version of the film, which was called College Days. UCLA, which restored The Freshman in 1998, opted to use that footage because it was in much better shape than the American negative, and the differences are presumably minor; nonetheless, it’s surprising to discover that over half of a classic film is now composed of (essentially) alternate takes. Then again, there’s no definitive text of Hamlet, either. And in the end, really, funny is funny. G/O Media may get a commission Galaxy Watch4 From $65 at Samsung FilmReviewsDVDs
foreignpolicy-com-9246 ---- Supposedly Green Cryptocurrency Chia Is Just Another Way of Wasting Resources Foreign Policy Magazine Sign In Subscribe Subscribe Upgrade to Insider Upgrade to Insider Latest News Analysis Podcasts The Magazine Channels Economics Security Shadow Government Her Power Close Newsletters Events Your FP Insider Access: Power Maps FP Live Special Reports Search latest China Is Protecting Its Thin Corridor to the Afghan Heartland The Wakhan Corridor is a fiercely contested imperial hangover. Argument | Sam Dunning Nothing But Pitch Black Darkness Ahmed Rabbani’s journey through the U.S. dark prison system to Guantanamo Feature | Fatima Bhutto The End of Coal Is Coming Sooner Than You Think Despair elides the progress made over the last two decades. Argument | Ketan Joshi The Coming Afghan Refugee Crisis Is Only a Preview More desperate migrants will head West in coming years—and the West’s migration policies must change in response. Argument | Anatol Lieven See All Stories FP Events FP Studios FP Analytics FP PeaceGames Subscription Services Reprint Permissions Writer’s Guidelines Work at FP FP Guides – Graduate Education FP For Education FP Archive Buy Back Issues Meet the Staff Advertising/Partnerships Contact Us Privacy Policy Sign In Subscribe Subscribe Upgrade to Insider Upgrade Search Toggle display of website navigation Argument: Chia Is a New Way to Waste Resources for Cryptocurrency Chia Is a New Way to Waste Resources for C... SHARE: Argument An expert's point of view on a current event. Chia Is a New Way to Waste Resources for Cryptocurrency What Bitcoin does for electricity and Ethereum for video cards, Chia does for hard disks. By David Gerard, the author of the book Attack of the 50 Foot Blockchain and the cryptocurrency and blockchain news blog of the same name. An employee displays a physically destroyed hard disk drive at the Tokyo Eco Recycle company on Jan. 19, 2017. Toshifumi Kitamura/AFP via Getty Images May 23, 2021, 6:00 AM Bitcoin, the first cryptocurrency, has a problem: It uses ghastly quantities of electricity and thus generates as much carbon emissions as a medium-sized country. This is by design. A new cryptocurrency, Chia, avoids this problem—in favor of creating huge amounts of a different kind of waste. Bitcoin was meant to be decentralized so as to stay out of any central control. The “proof-of-work mining” process allocates fresh coins by a lottery. You enter this lottery by guessing numbers and running calculations on them as fast as possible—that is, you waste electricity to show your commitment. There is one winner every 10 minutes; as more people join the lottery, the guessing gets harder to stay at one winner every 10 minutes. Bitcoin, the first cryptocurrency, has a problem: It uses ghastly quantities of electricity and thus generates as much carbon emissions as a medium-sized country. This is by design. A new cryptocurrency, Chia, avoids this problem—in favor of creating huge amounts of a different kind of waste. Bitcoin was meant to be decentralized so as to stay out of any central control. The “proof-of-work mining” process allocates fresh coins by a lottery. You enter this lottery by guessing numbers and running calculations on them as fast as possible—that is, you waste electricity to show your commitment. There is one winner every 10 minutes; as more people join the lottery, the guessing gets harder to stay at one winner every 10 minutes. As long as people can make money wasting electricity, they’ll add more computing resources to win more bitcoins in an ever-escalating arms race. Bitcoin thus uses as much electricity as the Netherlands. Proof of work has economies of scale: The bigger you are, the more efficiently you can create lottery tickets. Despite the grandiose claims of putting financial power in the public’s hands, bitcoin mining functionally centralized by 2014. The majority of bitcoin mining is three large pools. An electricity outage in one small area of Xinjiang in April 2021 took a quarter of all bitcoin mining offline. Bitcoin mining also uses specialized computers that just calculate cryptographic hashes as fast as possible; once the mining computers are obsolete, they’re just e-waste. Other cryptocurrencies are similarly wasteful. Ethereum uses as much electricity as Peru. There are smaller cryptocurrencies that don’t use this process, but Bitcoin and Ethereum are the two cryptos that are widely exchangeable for actual money. Cryptos failed as usable currencies, so their only remaining use case is to be traded in the hope of actual money. Bram Cohen is famed as the creator of the hugely popular BitTorrent file distribution protocol. Cohen turned his attention to the proof-of-work problem. He explicitly wanted a “green bitcoin,” so Chia, founded by Cohen, works very much like Bitcoin apart from proof of work. Chia’s business white paper advocates the same conspiracy theory economics that was embraced by the Bitcoin subculture: It assumes that governments fundamentally cannot be trusted to issue money and wasting a country’s worth of electricity is a better alternative. The resource Cohen chose to use for his so-called green cryptocurrency, Chia, was computer hard disk space. This is a generic, reusable form of computer hardware, it’s widely available, and he thought this would use less electricity than proof of work. Cohen anticipated that casual Chia users could use “the unused storage of your laptop, desktop, or corporate network.” To “farm” chia, the software writes a “plot,” a large chunk of cryptographic data, to the disk. The Chia blockchain software broadcasts a “challenge” every 18 seconds or so, 4,608 times a day; if you have a close enough answer to the challenge, you win two fresh chia tokens. As more disk space is added to the network, the challenges get harder. Cohen’s company, Chia Network, secured venture capital funding in 2018 and developed the Chia software. The network was launched in March 2021, with the promise users could run it in a “normal apartment.” Chia’s business white paper assumes that hard disk space is “over-provisioned.” However, aspiring chia farmers bought hard disks in vast quantities, thousands of terabytes at a time—as they only had to spend less money than they expected to make back. During the COVID-19 pandemic, manufacturing supply chains were already disrupted in multiple industries, leading to shortages of many basic components. By April, just a month after it was launched, chia farmers were straining the hard disk market, with reports from Hong Kong of large disks, over 4 terabytes, having tripled in price. Hard disk shortages and price rises were reported across Southeast Asia and in the United States. Chia’s initial plotting process is usually done on a solid-state drive (SSD), such as you’d find in a desktop or laptop. In normal usage, a modern SSD will last over a decade; an SSD that’s plotting chia may burn out in less than six weeks. SSD manufacturers are now refusing to honor warranties on SSDs used for crypto mining. Secondhand SSDs and hard disks manufactured since 2021 can no longer be trusted not to be burnt-out wrecks. In Germany, the popular cloud service Hetzner has banned chia farming. Instead of carbon dioxide, Chia produces vast quantities of e-waste—rare metals, assembled into expensive computing components, turned into toxic near-unrecyclable landfill within weeks. Cohen has tweeted that the claim that Chia destroys disks is mostly “just plain wrong”—though he ends the tweet thread by effectively admitting that it’s true but blames users for using “consumer SSD,” even though Chia’s own FAQ states that it can be run on mobile phones or laptops. Chia plotting is heavy on electricity, too—plotting requires arbitrary calculations by a computing device’s central processing unit (CPU), an intensive task. Chia’s business white paper anticipates farming on “one Raspberry Pi” (a small computer about as powerful as a 2007 iPhone)—but in practice, chia plotting requires multiple CPU threads running continuously at close to 100 percent. Chia failed at decentralization for the same reason that Bitcoin did: Centralization is more efficient. The largest Chia pool, HPool, is winning 36 percent of chia farming rewards and increasing. Smaller chia farmers have complained that HPool was given a head start by Chia Network. The first 21 million chia coins were created ahead of time and are held by Chia Network, in anticipation of being distributed in the event that Chia Network holds an initial public offering. Chia ran headlong into the known psychology of cryptocurrency mining: People will do anything that will generate a net profit—and damn the externalities. Cryptocurrency mining has also trashed the market for computer video cards. Bitcoin mining uses specialized chips that can only mine bitcoin; but ethereum and many other “altcoins” that use proof of work are still mined on video cards as they’re well suited to complex numerical computation. With the price of bitcoin in an economic asset bubble, the other coins have gone up as well; so high-end Nvidia video cards are all but unavailable, with prices going through the roof and the cards being snapped up as quickly as possible. The latest Nvidia cards have resorted to drivers—the software that runs the hardware—that detect and block cryptocurrency mining. And, just as with hard disks, secondhand video cards can’t be trusted not to be burnt-out wrecks. Almost any service that can do general computation is immediately swarmed by parasitical crypto miners. Continuous integration (CI) systems take computer program source code, and build it afresh after every change, to allow quick testing of all changes. Some public CI services used to offer a free tier for small projects—but crypto miners started spamming these services with CPU-based crypto mining. One CI service engineer said: “If we, for example, had a team of 20 working on our CI offering, we would have re-allocated at least 50% of them to work full-time on combating the miners. And this trend is not slowing, it is only accelerating.” Cryptocurrency decentralization is a performative waste of resources in order to avoid having to trust a government to issue currency. But since cryptocurrencies don’t actually function as currencies, it just generates new types of otherwise worthless magic beans to sell for real money. Your system will waste unlimited amounts of whatever resource you’re throwing away—and incentivize the theft of whatever resources other people can waste to turn into money. Cryptocurrency spews out a country’s worth of carbon dioxide and mountains of toxic e-waste, makes basic computing hardware that could be used for productive purposes unavailable, and destroys any sort of commons that someone might want to offer the world if general computation could be done on it. Decentralized cryptocurrencies are a cyberpunk parody of unregulated capitalism. They are a disastrous resource drain on the world, by design. The designers look only for fresh resources to abuse. The only functional purpose of decentralized cryptocurrencies is to further idiosyncratic bitcoin economic ideas that don’t work in the hope of making money from speculation. Every cryptocurrency is a new form of waste—and the only way to stop that is to stop cryptocurrencies. David Gerard is the author of the book Attack of the 50 Foot Blockchain and the cryptocurrency and blockchain news blog of the same name. His new book is Libra Shrugged: How Facebook Tried to Take Over the Money. Tags: Finance and Banking, United States NEW FOR SUBSCRIBERS: Want to read more on this topic or region? Click + to receive email alerts when new stories are published on United States Read More Twitter Got Lucky With the Great Bitcoin Heist The social media giant’s security failures could have allowed far more damage. Argument | David Gerard Latest China Is Protecting Its Thin Corridor to the Afghan Heartland August 14, 2021, 6:00 AM Nothing But Pitch Black Darkness August 14, 2021, 3:20 AM The End of Coal Is Coming Sooner Than You Think August 13, 2021, 3:00 PM The Coming Afghan Refugee Crisis Is Only a Preview August 13, 2021, 2:53 PM China Is Repeating U.S. Mistakes With Its Own Global Arrogance August 13, 2021, 2:51 PM See All Stories Trending 1 What Went Wrong With Afghanistan’s Defense Forces? 2 The Taliban Are Breaking Bad 3 China Is Protecting Its Thin Corridor to the Afghan Heartland 4 South Asia Is on the Front Lines of the Climate Crisis Latest Analysis China Is Protecting Its Thin Corridor to the Afghan Heartland Sam Dunning The End of Coal Is Coming Sooner Than You Think Ketan Joshi The Coming Afghan Refugee Crisis Is Only a Preview Anatol Lieven More from Foreign Policy Why China Is Cracking Down on Private Tutoring Regulations on the $120 billion industry reflect concerns over the education rat race. The Science Says Everyone Needs a COVID-19 Booster Shot—and Soon The biology of the delta variant has made mass revaccination an urgent necessity. How Pakistan Could Become Biden’s Worst Enemy The United States is banking on Islamabad to broker successful peace talks with the Taliban. That’s not likely to happen. ‘We Fell Off the Face of the Earth’ Opposition politicians are disappearing into Turkey’s massive new prison system. Trending What Went Wrong With Afghanistan’s Defense Forces? Dispatch | Lynne O’Donnell The Taliban Are Breaking Bad Dispatch | Lynne O’Donnell China Is Protecting Its Thin Corridor to the Afghan Heartland Argument | Sam Dunning South Asia Is on the Front Lines of the Climate Crisis South Asia Brief | Michael Kugelman Latest China Is Protecting Its Thin Corridor to the Afghan Heartland August 14, 2021, 6:00 AM Nothing But Pitch Black Darkness August 14, 2021, 3:20 AM The End of Coal Is Coming Sooner Than You Think August 13, 2021, 3:00 PM The Coming Afghan Refugee Crisis Is Only a Preview August 13, 2021, 2:53 PM China Is Repeating U.S. Mistakes With Its Own Global Arrogance August 13, 2021, 2:51 PM See All Stories Sign up for Morning Brief Foreign Policy’s flagship daily newsletter with what’s coming up around the world today from Foreign Policy’s newsletter writer Colm Quinn. Enter your email Sign Up ✓ Signed Up Unsubscribe By signing up, I agree to the Privacy Policy and Terms of Use and to occasionally receive special offers from Foreign Policy. You can support Foreign Policy by becoming a subscriber. Subscribe Today FP Events FP Studios FP Analytics FP PeaceGames Subscription Services Reprint Permissions Writer’s Guidelines Work at FP FP Guides – Graduate Education FP For Education FP Archive Buy Back Issues Meet the Staff Advertising/Partnerships Contact Us Privacy Policy Powered by WordPress VIP © 2021, The Slate Group
forms-gle-1536 ---- 2021 NDSA Coordinating Committee Nominations 2021 NDSA Coordinating Committee Nominations If you are interested in joining the Coordinating Committee or want to nominate another member, please complete this form with the following information by 11:59pm EDT Friday, August 13, 2021. NDSA is accepting nominations for 3 three-year terms, starting in 2022. * Required Nominee's Name * Your answer Nominee's Institution * Your answer Nominee's Title Your answer Nominee's Email * Your answer Nominee's Website (if any) Your answer Brief nominee-approved Bio/Candidate statement (up to 200 words) Your answer Additional Statement/Comments/Nominator's name/contact info if not self Your answer Submit Never submit passwords through Google Forms. This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy Forms
forms-gle-2464 ---- Connect 2021 Online: CFP for presentations and panels Connect 2021 Online: CFP for presentations and panels The Program Committee for Samvera Connect 2021 Online invites proposals for presentations and panels to be given on Monday, October 18th - Friday, October 22nd, between 11.00am and 2.30pm US EDT. Presentations should be up to 20 minutes long with an additional 5 minutes available for questions. Panels can be 20 or 40 minutes long and should include time for audience questions. This CFP is open until August 31st. * Required Email * Your email Name * Your answer Names of other presenters/panelists Whilst it will be helpful to the program committee to know the names of any additional presenters at this stage, you can provide or change these names later. Your answer Is this a proposal for a presentation panel? * Presentation (20 minutes) Panel (20 minutes) Panel (40 minutes) Title of session * Your answer Who is/are your target audience? * Administrators Developers Managers (specifically repository managers) Managers (more generally) Metadata specialists New or potential Community participants SysAdmins/DevOps UI/UX practitioners Other: Required Please give us a description of the session that we can use in the conference program * A few sentences - no more than 200 words or so. Your answer Please indicate the date(s) you are available to present: * Monday 18th October Tuesday 19th October Wednesday 20th October Thursday 21st October Friday 22nd October Required Please feel free to add any additional information you wish the Program Committee to take into consideration. Your answer Send me a copy of my responses. Submit Never submit passwords through Google Forms. reCAPTCHAPrivacyTerms This form was created inside of Samvera Community. Report Abuse Forms
forms-gle-2625 ---- Connect 2021 Online: CFP for workshops Connect 2021 Online: CFP for workshops The Program Committee for Samvera Connect 2021 Online invites proposals for workshops to be held on Thursday and Friday, 14th - 15th October. Workshops may be 1.5 hours or 3 hours long. These will be virtual sessions using Zoom (or similar software) and may start as early as 11.00AM EDT. Please feel free to propose a workshop that you would like to run yourself or with colleagues. Please also feel free to propose a workshop that you would like to see run by someone else on a topic that you would definitely attend. This CFP has been extended through August 31st. * Required Email * Your email Title of proposed workshop * Your answer Are you proposing to run this workshop yourself, or are you requesting that someone else run it? * I will run it on my own or with others I am requesting that someone else run it Next Never submit passwords through Google Forms. This form was created inside of Samvera Community. Report Abuse Forms
forms-gle-5105 ---- Connect 2021 Online: Call for posters Connect 2021 Online: Call for posters The Program Committee for Samvera Connect 2021 invites contributions for the conference "virtual poster session." All appropriate submissions will be accepted. The image should be supplied as a jpg file (preferably) or as a pdf. The image will be loaded to, and accessed from, Samvera's repository which operates under a CC-BY license. This call for posters will close Thursday, September 30th, 2021. In order to generate discussion, there will be a Slack channel devoted to the posters. Poster presenters will also have the option of a 30-minute slot (using Zoom or similar) to present and discuss their poster on Thursday, October 14th or Friday, October 15th. The Program Committee will follow up beginning in September with file submission information and to discuss a poster presentation time. Thank you! * Required Name(s) * Your answer Contact e-mail address(es) * Please provide at least one email address for correspondence about this poster. Your answer Institution * Your answer Likely theme and/or title of poster * Please give us a very brief indication of the theme for the poster. This is not binding on your part, you are free to change your ideas later. Your answer Please feel free to add any additional information you feel would be helpful to the Program Committee Your answer Submit Never submit passwords through Google Forms. This form was created inside of Samvera Community. Report Abuse Forms
forms-gle-5319 ---- Connect 2021 Online: CFP for lightning talks Connect 2021 Online: CFP for lightning talks The Program Committee for Samvera Connect 2021 Online invites proposals for lightning talks to be given the week of Monday, October 18th - Friday, October 22nd, between 11.00am and 2.30pm US EDT. Lightning talks should be seven minutes long and have a clear focus on one or a few ideas. There will be time for Q&A after a block of lightning talks. This CFP is open until September 30th. * Required Email * Your email Name * Your answer Title of lightning talk * Your answer Who is/are your target audience? * Administrators Developers Managers (specifically repository managers) Managers (more generally) Metadata specialists New or potential Community participants SysAdmins/DevOps UI/UX practicioners Other: Required Please give us a description of the talk that we can use in the conference program * A few sentences - no more than 150 words or so. Your answer Please indicate the dates you are available to give your talk: * Monday 18th October Tuesday 19th October Wednesday 20th October Thursday 21st October Friday 22nd October Required Please feel free to add any additional information you wish the Program Committee to take into consideration. Your answer Send me a copy of my responses. Submit Never submit passwords through Google Forms. reCAPTCHAPrivacyTerms This form was created inside of Samvera Community. Report Abuse Forms
forms-gle-7860 ---- Samvera Repository Online Tour Submission Form Samvera Repository Online Tour Submission Form We would love to include your repository in an online map/tour of Samvera-based repositories. Anyone associated with a given repository can complete this form. The repository tour will appear on the Samvera website and will be a communication tool to provide an overview of what's possible with Samvera-based repositories. Thank you for contributing! * Required Email * Your email Your name and title * Your answer Institution/organization * Your answer Name of repository * Your answer Repository link * Your answer Purpose of the repository (i.e., ETDs, research data, special collections, etc.) Your answer Link to and brief description (1-3 sentences) of one particularly notable holding in the repository * Your answer Anything you'd like to add? Your answer A copy of your responses will be emailed to the address you provided. Submit Never submit passwords through Google Forms. reCAPTCHAPrivacyTerms This form was created inside of Samvera Community. Report Abuse Forms
forum2021-diglib-org-833 ---- Home - DLF Forum 2021 Skip to content Home About Code of Conduct CoC Reporting Form Thank You Resources News Creating Accessible Presentations Affiliated Events Learn@DLF NDSA’s #DigiPres21 Sponsors & Fellows Sponsorship Opportunities Fellowship Opportunities Registration Search for... Search for... Toggle Navigation Toggle Navigation Home About Code of Conduct CoC Reporting Form Thank You Resources News Creating Accessible Presentations Affiliated Events Learn@DLF NDSA’s #DigiPres21 Sponsors & Fellows Sponsorship Opportunities Fellowship Opportunities Registration A world-class marketplace of ideas for digital GLAM practitioners since 1999 What's the DLF Forum? DLF programs stretch year-round, but we are perhaps best known for our signature event, the annual DLF Forum. The DLF Forum welcomes digital library, archives, and museum practitioners from member institutions and beyond—for whom it serves as a meeting place, marketplace, and congress. Learn about the event and plan to attend Attend our Affiliated Events! NDSA's Digital Preservation 2021 November 4 Digital Preservation is the annual conference of the National Digital Stewardship Alliance. DigiPres is expected to be a crucial venue for intellectual exchange, community-building, development of best practices, and national-level agenda-setting in the field. Learn@DLF November 8-10 Now in its fourth year, Learn@DLF returns in 2021 includes engaging, hands-on sessions where attendees will gain experience with new tools and resources, exchange ideas, and develop and share expertise with fellow community members as well as short tutorials about specific tools, techniques, workflows, or concepts. Make an Impact! Sponsor the DLF Forum and NDSA's #DigiPres21 DLF Forum starts in Days Hours Minutes Seconds NOW What makes the DLF Forum great? After nearly 14 years of academic library experience and subsequently participating in no less than 25 conferences, I can say that the DLF Forum was the most progressive and enlightening conference that I have ever attended. It was downright empowering. Ana Ndumu 2017 DLF Forum Fellow The thoughtful way the experience was designed was due to the efforts of the organizers...As a first-time participant, I am grateful to have been able to participate in this year’s virtual Forum and look forward to continuing to learn from the DLF community! Betsy Yoon 2020 DLF Forum Community Journalist Forum Updates What We’ve Learned: Major Takeaways from 2020 Virtual Forum and Affiliated Events Feedback August 4, 2021 As Team DLF works with Planning Committee members to help plan 2021 events, feedback from 2020 events is part of… Read more 2021 DLF Forum, DigiPres, and Learn@DLF Calls for Proposals April 8, 2021 We’re delighted to share that it’s CFP season for CLIR’s annual events. Based on community feedback, we’ve made the decision… Read more Want Forum news? Subscribe to our newsletter to stay informed! Subscribe Sponsorship Opportunities About DLF Join DLF Contact Menu Sponsorship Opportunities About DLF Join DLF Contact Envelope Facebook Twitter Youtube Instagram Linkedin Skip to content Open toolbar Accessibility Tools Increase Text Decrease Text Grayscale High Contrast Negative Contrast Light Background Links Underline Readable Font Reset Sitemap
freerangelibrarian-com-4398 ---- Free Range Librarian › K.G. Schneider's blog on librarianship, writing, and everything else Free Range Librarian K.G. Schneider's blog on librarianship, writing, and everything else Skip to content About Free Range Librarian Comment guidelines Writing: Clips & Samples (Dis)Association Monday, May 27, 2019 Walking two roses to their new home, where they would be planted in the front yard. I have been reflecting on the future of a national association I belong to that has struggled with relevancy and with closing the distance between itself and its members, has distinct factions that differ on fundamental matters of values, faces declining national and chapter membership, needs to catch up on the technology curve, has sometimes problematic vendor relationships, struggles with member demographics and diversity, and has an uneven and sometimes conflicting national message and an awkward at best relationship with modern communications; but represents something important that I believe in and has a spark of vitality that is the secret to its future. I am not, in fact, writing about the American Library Association, but the American Rose Society. Most readers of Free Range Librarian associate me with libraries, but the rose connection may be less visible. I’ve grown roses in nine places I’ve lived in the last thirty-plus years, starting with roses planted in front of a rental house in Clovis, New Mexico, when I was stationed at Cannon Air Force Base in the 1980s, and continuing in pots or slices of garden plots as I moved around the world and later, the United States. Basically, if I had an outdoor spot to grow in, I grew roses, either in-ground or in pots, whether it was a slice of sunny backyard in Wayne, New Jersey, a tiny front garden area in Point Richmond, California, a sunny interior patio in our fake Eichler rental in Palo Alto, or a windy, none-too-sunny, and cold (but still much-appreciated) deck in our rental in San Francisco. When Sandy and I bought our sweet little house in Santa Rosa, part of the move involved rolling large garden pots on my Radio Flyer from our rental two blocks away. Some of you know I’m an association geek, an avocation that has waxed as the years have progressed. I join associations because I’m from a generation where that’s done, but another centripetal pull for staying and being involved is that associations, on their own, have always interested me. It’s highly likely that a long time ago, probably when I was stationed in New Mexico and, later, Germany (the two duty stations where I had the ability to grow roses), that I was a member of the American Rose Society for two or three years. I infer this because I accumulated, then later recycled, their house magazine, American Rose, and I also have vague memories of receiving the annual publication, Handbook for Selecting Roses. Early this year I joined the Redwood Empire Rose Society and a few weeks after that joined the American Rose Society. I joined the local society because I was eager to plant roses in our new home’s garden and thought this would be a way to tap local expertise, and was won over by the society’s programming, a range of monthly educational events that ranged from how to sharpen pruning shears to the habits and benefits of bees (a program where the audience puffed with pride, because roses--if grown without toxic chemical intervention–are highly beneficial bee-attracting pollen plants). I joined the national society less out of need than because I was curious about what ARS had to offer to people like me who are rose-lovers but average gardeners, and I was also inquisitive about how the society had (or had not) repositioned itself over the years. My own practices around rose gardening have gradually changed, reflecting broader societal trends. Thirty years ago, I was an unwitting cog in the agricultural-industrial rose complex. I planted roses that appealed to my senses — attractive, repeat-blooming, and fragrant — and then managed their ability to grow and produce flowers not only through providing the two things all roses need to grow– sun and water — but also through liberal applications of synthetic food and toxic pest and disease products. The roses I purchased were bred for the most part with little regard for their ability to thrive without toxic intervention or for their suitability for specific regions. Garden by garden, my behavior changed. I slowly adopted a “thrive or die” mantra. If a rose could not exist without toxic chemical interventions, then it did not belong in my garden, and I would, in rosarian parlance, “shovel-prune” it and replace it with a rose that could succeed with sun, water, good organic food and amendments, and an occasional but not over-fussy attention. Eventually, as I moved toward organic gardening and became more familiar with sustainability in general, I absorbed the message that roses are plants, and the soil they grow in is like the food I put in my body: it influences their health. So I had the garden soil tested this winter while I was moving and replacing plants, digging holes that were close to two feet wide and deep. Based on the test results, I adjusted the soil accordingly: I used organic soil sulphur to lower the ph, dug in slow-release nitrogen in the form of feathermeal, and bathed the plants in a weak solution of organic liquid manganese. As I now do every spring, when it warmed up a bit I also resumed my monthly treatment of fish fertilizer, and this year, based on local rose advice, in a folksier vein dressed all the bushes with organic worm castings and alfalfa, both known to have good fertilizing capabilities. Alfalfa also has a lot of trace nutrients we know less about but appear to be important. Princesse Charlene de Monaco, hybrid tea rose bred by Meilland Guess what? Science is real! Nearly all of the rose bushes are measurably larger and more vigorous. Carding Mill, a David Austin rose, went from a medium shrub to a flowering giant. New roses I planted this spring, such as Grand Dame and Pinkerbelle, are growing much more vigorously than last year’s new plantings. Some of this is due to the long, gloomy, wet winter, which gave roses opportunities to snake their long roots deeper into the good soil we have in Sonoma County; my friends are reporting great spring flushes this year. But roses planted even in the last six weeks, such as Princesse Charlene de Monaco and Sheila’s Perfume, are taking off like a rocket, so it’s not just the rain or the variety. (You do not need to do all this to grow roses that will please you and your garden visitors, including bees and other beneficial insects. I enjoy the process. The key thing is that nearly all of my roses are highly rated for disease resistance and nearly all are reported to grow well in our region.) Science–under attack in our national conversations–is also an area of conflict within the ARS. Presidents of the ARS have three-year terms, and the previous president, Pat Shanley, was an advocate of sustainable rose growing. She spoke and wrote about the value of organic gardening, and championed selecting varieties that do not require toxic intervention to thrive. The theme of the 2018 American Rose Annual was “Roses are for Everyone,” and this Annual is a fascinating look at the sustainable-gardening wing of the ARS. Most of the articles emphasized the value of what Paul Zimmerman, a rose evangelist, calls “garden roses,” flowers that everyday people like you and me can grow and enjoy. The message in this Annual is reinforced by recent books by longtime rose advocates and ARS members, such as Peter Kukielski’s Roses without Chemicals and Zimmerman’s Everyday Roses, books I highly recommend for library collections as well as personal use. (Roses without Chemicals is a book I use when I wake up at odd hours worried about things, because it is beautifully written and photographed and the roses are listed alphabetically.) Now the ARS has a new president, Bob Martin, a longtime exhibitor, who in editorials has promoted chemical intervention for roses. “And yes Virginia we do spray our roses,” he wrote in the March/April “First Word” editorial in American Rose, the house organ of the ARS. “As does nearly every serious rose exhibitor and those who want their rose bushes to sustainably produce the most beautiful blooms [emphasis mine].” American Rose does not appear to publish letters to the editor. There is no section listed for letters that I can find in any recent issue, and the masthead only lists a street address for “member and subscription correspondence.” Otherwise, I would write a short letter protesting the misuse of the term “sustainably,” as well as the general direction of this editorial. I am a rose amateur, and make no bones about it. But I know that equating chemical spraying with sustainability is, hands-down, fake news. It’s one thing to soak roses in toxins and call it a “health maintenance” program, as he does in this article. That’s close to the line but not over it, since he’s from the exhibitors’ wing of ARS. But it’s just plain junk science to claim that there is anything connected to sustainability about this approach. I also can’t imagine that this “toxins forever” message is attracting new ARS members or encouraging them to renew. It feels disconnected from what motivates average gardeners like me to grow roses today (to enjoy them in their gardens) and from how they want to grow them today (in a manner that honors the earth). Frankly, one of the happiest moments in my garden last year was not from personal enjoyment of the flowers or even the compliments of neighbors and passers-by, but when I saw bees doing barrel-rolls in the stamens of my roses, knowing that I was helping, not hurting, their survival. The vast majority of people buying and planting roses these days have no idea there is a single-plant society dedicated to this plant, or even less that this society believes it understands their motivations for and interest in roses. My environmental scan of the literature and the quantities of roses provided by garden stores makes me suspect that many people buy roses based on a mix of personal recommendations, marketing guidance (what the vendors are promoting), and what they remember from their family gardens. (I would love to learn there had been market research in this area; vendors may have taken this up.) For average gardeners, their memories include roses such as Peace and Mr. Lincoln, which were bred in the middle of the last century, when the focus was not on disease resistance but on producing the hourglass hybrid tea shape that became the de facto standard for exhibiting. We can get sentimental about roses from the late 20th century, but many of these varieties also helped perpetuate the idea that roses are hard to grow, despite the many varieties that grew just fine for thousands of years (or in the case of Excellenz von Schubert, which I planted this year, 110 years and counting). Market persuasion continues today; vendors tempt buyers through savvy marketing plans such as the Downton Abbey rose series from Weeks or David Austin’s persistent messaging about “English” roses. Note — I own a lovely rose from the Downton Abbey line, Violet’s Pride, that is quite the garden champ, and have three David Austin roses (Carding Mill, Munstead Wood, and Gentle Hermione). I’m just noting market behavior. It is well-documented in rose literature that the rose that seems to have shaken the ARS to the core is the Knockout series, which introduced maintenance-free roses to a generation short on time and patience and increasingly invested in sustainable practices throughout their lives, including their gardens. Again, smart marketing was part of the formula, because there always have been sustainable roses, and ome companies, such as Kordes, moved to disease-resistant hybridizing decades ago. But the Knockout roses were promoted as an amazing breakthrough. (It may help to know that new varieties of roses have 20-year patents during which propagation is only legally through license. I don’t begrudge hybridizers their income, given how much work–sometimes thousands of seedlings–goes into producing a single good rose, but this does factor into how and why roses are marketed.) You don’t need a certificate as a master gardener or membership in a rose society to grow Knockout roses or newer competitors such as the Oso Easy line. You don’t really need to know anything about roses at all, other than roses grow in sun, not shade, and appreciate water. You also don’t need to spray Knockout roses with powerful fungicides to prevent blackspot and mildew. Regardless of the public’s reaction to easy-to-grow roses, the rose world’s reception of the Knockout rose by the rose world was mixed, to use an understatement. Though the Knockout rose was the 2004 ARS members’ choice rose, rumblings abounded, and Knockout was even blamed in popular literature as a vector for the rose rosette virus (RRV), though this was later debunked. Fifty years ago RRV was observed in a number of rose varieties, long before the Knockout rose appeared. (This mite-spread virus was promulgated in the United States to control a pest rose, rosa multiflora, that was itself introduced without realizing what havoc it would wreak.) Again, I’m no scientist, but I would think the appearance of RRV in “domesticated” roses was inevitable, regardless of which rose variety was first identified by name as carrying this disease. Rose hybridizing is now catching up with the public’s interests and the wider need for roses with strong disease resistance. Rose companies prominently tout disease resistance and many new varieties can be grown toxin-free. I selected Princesse Charlene de Monaco in part because it medaled as best hybrid tea in the 2018 Biltmore International Rose Trials, for which roses must perform well in terms of vigor and disease resistance as well as aesthetic qualities. There were companies such as Kordes who walked this walk before it was fashionable, but in typical change-adoption fashion, other vendors are adapting their own practices, because the market is demanding it. But association leadership is driven by different goals than that for for-profit companies. A colleague of mine, after sharing his support for my successful run for ALA Executive Board, commented that it takes expertise to run a $50 million organization–skills not everyone has in equal abundance. My further reflection is that the kind of leadership we need at any one time is also unique to that moment, though–with absolutely no aspersions on our current crop of excellent leaders in ALA–historically, we have not always selected leadership for either general expertise or current needs, an issue hardly unique to ARS or ALA. So I watch the ARS seesaw. As just one more example, recently I read an article within the same ARS email newsletter touting the value of lacewings for insect management, followed by an article about the value of chemical interventions that I know are toxic to beneficial insects. These aren’t just contradictory ideas; they are contradictory values, contradictory messages, and contradictory branding. And these conflicting messages are evident even before we look at the relationship between the national association and local societies (organized differently than ALA chapters but with the similar intent). If I could deduce the current priorities for ARS from its magazine, website, and email newsletters, it would be the renovation of the ARS garden in Shreveport. The plan to update the 84-year-old “national rosarium” makes sense, if you like rose gardens, but it sounds more like a call to the passionate few than the general public. It’s hard to infer other priorities when website sections such as “Cyber Rosarian” invite members to ask questions that then go unanswered for over a year. The section called “Endorsed Products” is its own conflicted mix of chemical interventions, artificial fertilizers, and organic rose food. The website section on rose preservation–a goal embedded in the ARS mission statement, “The American Rose Society exists to promote the culture, preservation and appreciation of the Rose”–is a blank page with a note it is under construction. A section with videos by Paul Zimmerman is useful, but the rose recommendations by district are incomplete, and also raise the issue that ARS districts are organized geopolitically, not by climate. A rose suited for the long dry summers of Sonoma County may not do as well in Maui. The ARS “Modern Roses” database has value, listing over 37,000 cultivars. But if I want insight into a specific rose, I use Helpmefind.com, which despite its generic name and rustic interface is the de facto go-to site for rose information, questions, and discussion, often in the context of region, climate, and approaches to sustainability. I pay a small annual fee for premium access, in part to get HMF’s extra goodies (advanced search, and access to lineage information) but primarily because this site gives me value and I want to support their work. Though I couldn’t find data on the ARS website for membership numbers in national, district, or local societies, I intuit membership overall is declining. It is in our local society, where despite great programming in a region where many people grow roses, I am one of the younger members. Again, there are larger forces at work with association membership, but pointing to those forces and then doing business as usual is a recipe for slow death. Interestingly, the local rose society is aware of its challenges and interested in what it might mean to reposition itself for survival. Most recently, we founded a Facebook group that anyone could join (look for Redwood Empire Rose Society). But the society doesn’t have very much time, and a Facebook group isn’t the magic bullet. To loop back to ALA for a moment: I can remember when the response to concerns about membership decline were that the library field was contracting as a whole and association membership was also less popular in general. But these days, ALA is invested in moving past these facts and asking, what then? ALA is willing to change to survive. And I believe that is why ALA will be around 100 years from now, assuming we continue to support human life on this continent. As I ponder all this, deep in my association geekiness, I’m left with these questions: if the ARS can’t save itself, who will be there for the roses? Will the ad hoc, de facto green-garden rosarians form a new society, will they simply soldier on as a loose federation, or will the vendors determine the future of roses? Have rose societies begun talking about strategic redirection, consolidation, and other new approaches? Does the ARS see itself as a change leader? Where does the ARS see itself in 25 years? Am I just a naive member in the field, totally missing the point, or is there something to what I’m observing, outside the palace walls? I’ve been writing this off and on for months. It’s Memorial Day and it’s now light enough outside to wander into our front yard, pruners and deadheading bucket in hand, iPhone in my pocket so I can share what bloomed while I slept. Over time I changed how I grow roses, but not why I grow roses. Somewhere in there is an insight, but it’s time to garden. Bookmark to: Filed in Uncategorized | | Comments Off on (Dis)Association I have measured out my life in Doodle polls Wednesday, April 10, 2019 You know that song? The one you really liked the first time you heard it? And even the fifth or fifteenth? But now your skin crawls when you hear it? That’s me and Doodle. In the last three months I have filled out at least a dozen Doodle polls for various meetings outside my organization. I complete these polls at work, where my two-monitor setup means I can review my Outlook calendar while scrolling through a Doodle poll with dozens of date and time options. I don’t like to inflict Doodle polls on our library admin because she has her hands full enough, including managing my real calendar. I have largely given up on earmarking dates on my calendar for these polls, and I just wait for the inevitable scheduling conflicts that come up. Some of these polls have so many options I would have absolutely no time left on my calendar for work meetings, many of which need to be made on fairly short notice. Not only that, I gird my loins for the inevitable “we can’t find a date, we’re Doodling again” messages that mean once again, I’m going to spend 15 minutes checking my calendar against a Doodle poll. I understand the allure of Doodle; when I first “met” Doodle, I was in love. At last, a way to pick meeting dates without long, painful email threads! But we’re now deep into the Tragedy of the Doodle Commons, with no relief in sight. Here are some Doodle ideas–you may have your own to toss in. First, when possible, before Doodling, I ask for blackout dates. That narrows the available date/time combos and helps reduce the “we gotta Doodle again” scenarios. Second, if your poll requires more than a little right-scrolling, reconsider how many options you’re providing. A poll with 40 options might as well be asking me to block out April. And I can’t do that. Third, I have taken exactly one poll where the pollster chose to suppress other people’s responses, and I hope to never see that again. There is a whole gaming side to Doodling in which early respondents get to drive the dates that are selected, and suppressing other’s responses eliminates that capability. Plus I want to know who has and hasn’t responded, and yes, I may further game things when I have that information. Also, if you don’t have to Doodle, just say no. Bookmark to: Filed in Uncategorized | | Comments (4) Memento DMV Saturday, March 30, 2019 This morning I spent 40 minutes in the appointment line at the Santa Rosa DMV to get my license renewed and converted to REAL ID, but was told I was “too early” to renew my license, which expires in September, so I have to return after I receive my renewal notice. I could have converted to REAL ID today, but I would still need to return to renew my license, at least as it was explained to me, and I do hope that was correct. CC BY 4.0, https://wellcomecollection.org/works/m8wh2kmc But–speaking as a librarian, and therefore from a profession steeped in resource management–I predict chaos in 2020 if DMV doesn’t rethink their workflow. We’re 18 months out from October 2020, the point at which people will not be able to board domestic flights if they don’t have a REAL ID or a valid passport, or another (and far less common) substitute. Then again, California DMV is already in chaos. Their longtime leader retired, the replacement lasted 32 days, and their new leader has been there ca. 60 days. Last year featured the license renewal debacle, which I suspect impacted the man standing behind me. He said he was there to apply for his license again because he never received the one he applied for last fall. And California DMV is one of 10 states that still needs a REAL ID extension because it didn’t have it together on time. Indeed, I was on the appointment line, and nearly everyone in that line was on their second visit to DMV for the task they were trying to accomplish, and not for lack of preparation on their part. Some of that was due to various DMV crises, and some of it is baked into DMV processes. Based on how their current policies were explained to me today at Window 13, I should never have been on that line in the first place; somewhere, in the online appointment process, the DMV should have prevented me from completing that task. I needlessly took up staff time at DMV. But the bigger problem is a system that gets in its own way, like libraries that lock book drops during the day to force users to enter the libraries to return books. With me standing there at Window 13 with my online appointment, my license, and my four types of ID, the smart thing to do would be to complete the process and get me out of the pipeline of REAL ID applicants–or any other DMV activity. But that didn’t happen. And I suspect I’m just one drop in a big, and overflowing, bucket. I suppose an adroit side move is to ensure your passport is current, but I hope we don’t reach the point where we need a passport to travel in our own country. Bookmark to: Filed in Uncategorized | | Comments Off on Memento DMV An Old-Skool Blog Post Friday, March 29, 2019 I get up early these days and get stuff done — banking and other elder-care tasks for my mother, leftover work from the previous day, association or service work. A lot of this is writing, but it’s not writing. I have a half-dozen unfinished blog posts in WordPress, and even more in my mind. I map them out and they are huge topics, so then I don’t write them. But looking back at the early days of this blog — 15 years ago! — I didn’t write long posts. I still wrote long-form for other media, but my blog posts were very much in the moment. So this is an old-skool post designed to ease me back in the writing habit. I’ll strive for twice a week, which is double the output of the original blogger, Samuel Johnson. I’ll post for 15 minutes and move on to other things. I am an association nerd, and I spend a lot of time thinking about associations of all kinds, particularly the American Library Association, the American Homebrewers Association, the American Rose Society, the Redwood Empire Rose Society, the local library advisory boards, my church, and our neighborhood association. Serving on the ALA Steering Committee on Organizational Effectiveness, I’m reminded of a few indelible truths. One is that during the change management process you need to continuously monitor the temperature of the association you’re trying to change and in the words of one management pundit, keep fiddling with the thermostat. An association didn’t get that big or bureaucratic overnight, and it’s not going to get agile overnight, either. Another is that the same people show up in each association, and–more interesting to me–stereotypes are not at play in determining who the change agents are. I had a great reminder of that 20 years ago, when I served as the library director for one of those tiny Barbie Dream libraries in upstate New York, and I led the migration from a card catalog to a shared system in a consortium. Too many people assumed that the library staff–like so many employees in these libraries, all female, and nearly all older women married to retired spouses–would be resistant to this change. In fact, they loved this change. They were fully on board with the relearning process and they were delighted and proud that they were now part of a larger system where they could not only request books from 30 other libraries but sometimes even lend books as well from our wee collection. There were changes they and the trustees resisted, and that was a good lesson too, but the truism of older women resisting technology was dashed against the rocks of reality. My 15 minutes are up. I am going in early today because I need to print things, not because I am an older woman who fears technology but because our home printer isn’t working and I can’t trust that I’ll have seatback room on my flight to Chicago to open my laptop and read the ALA Executive Board manual electronically, let alone annotate it or mark it up. I still remember the time I was on a flight, using my RPOD (Red Pen of Death, a fine-point red-ink Sharpie) to revise an essay, and the passenger next to me turned toward me wide-eyed and whispered, “Are you a TEACHER?” Such is the power of RPOD, an objective correlative that can immediately evoke the fear of correction from decades ago. Bookmark to: Filed in American Liberry Ass'n, Association Nerd | | Comments (1) Keeping Council Saturday, January 20, 2018 Editorial note: Over half of this post was composed in July 2017. At the time, this post could have been seen as politically neutral (where ALA is the political landscape I’m referring to) but tilted toward change and reform. Since then, Events Have Transpired. I revised this post in November, but at the time hesitated to post it because Events Were Still Transpiring. Today, in January 2018, I believe even more strongly in what I write here, but take note that the post didn’t have a hidden agenda when I wrote it, and, except where noted, it still reflects my thoughts from last July, regardless of ensuing events. My agendas tend to be fairly straightforward. — KGS Original Post, in which Councilors are Urged to Council Edits in 2018 noted with bolding. As of July 2017, I am back on ALA Council for my fifth (non-consecutive) term since joining the American Library Association in 1991. In June I attended Council Orientation, and though it was excellent–the whole idea that Councilors would benefit from an introduction to the process is a beneficial concept that emerged over the last two decades–it did make me reflect on what I would add if there had been a follow-on conversation with sitting Councilors called “sharing the wisdom.” I was particularly alerted to that by comments during Orientation which pointed up a traditional view of the Council process where ALA’s largest governing body is largely inactive for over 350 days a year, only rousing when we prepare to meet face to face. Take or leave what I say here, or boldly contradict me, but it does come from an abundance of experience. You are a Councilor year-round Most newly-elected Councilors “take their seats” immediately after the annual conference following their election — a factoid with significance. Council, as a body, struggles with being a year-round entity that takes action twice a year during highly-condensed meetings during a conference with many other things happening. I have written about this before, in a dryly wonky post from 2012 that also addresses Council’s composition and the role of chapters. I proposed that Council meet four times a year, in a solstice-and-equinox model. Two of those meetings (the “solstice” meetings) could be online. (As far back as 2007 I was hinting around about the overhead and carbon footprint of Midwinter.) I doubt Midwinter will go to an online format even within the next decade–it’s a moneymaker for ALA, if less so than before, and ALA’s change cycle is glacial–but the proposal was intended to get people thinking about how Council does, and doesn’t, operate. In lieu of any serious reconsideration of Council, here are some thoughts. First, think of yourself as a year-round Councilor, even if you do not represent a constituency such as a state chapter or a division that meets and takes action outside of ALA. Have at least a passing familiarity with the ALA Policy Manual. Bookmark it and be prepared to reference it. Get familiar with ALA’s financial model through the videos that explain things such as the operating agreement. Read and learn about ALA. Share news. Read the reports shared on the list, and post your thoughts and your questions. Think critically about what you’re reading. It’s possible to love your Association, believe with your heart that it has a bright future, and still raise your eyebrows about pat responses to budget questions, reassurances that membership figures and publishing revenue will rebound, and glib responses about the value of units such as the Planning and Budget Assembly. Come to Council prepared. Read everything you can in advance, speak with other Councilors, and apply solid reflection, and research if needed, before you finish packing for your trip. Preparation requires an awareness that you will be deluged with reading just as you are struggling to button up work at your library and preparing to be away for nearly a week, so skimming is essential. I focus on issues where I know I can share expertise, and provide input when I can. Also, I am proud we do memorial resolutions and other commemorations but I don’t dwell on them in advance unless I have helped write them or had close familiarity with the people involved. Fee, Fie, Foe, Forum Coming prepared to Council is one of those values Council has struggled with. Looking at the Council list for the week prior to Annual 2017, the only conversation was a discussion about the relocation of the Council Forum meeting room from one hotel to another, complete with an inquiry asking if ALA could rent a special bus to tote Councilors to and from the Forum hotel. Council Forum is an informal convening that has taken place for decades to enable Council to discuss resolutions and other actions outside of the strictures of parliamentary procedure. It meets three times during ALA, in the evening, and though it is optional, I agree with the Councilor who noted that important work happens at this informal gathering. I am conflicted about Forum. It allows substantive discussion about key resolutions to happen outside of the constrictive frameworks of parliamentary procedure. Forum is also well-run, with volunteer Councilors managing the conversation. But Forum also appears to have morphed into a substitute for reading and conversation in advance. It also means that Councilors have to block out yet more time to do “the work of the Association,” which in turn takes us away from other opportunities during the few days we are together as an Association. I don’t say this to whine about the sacrifice of giving up dinners and networking with ALA colleagues, though those experiences are important to me, but rather to point out that Forum as a necessary-but-optional Council activity takes a silo–that Brobdingnabian body that is ALA Council–and further silos it. That can’t be good for ALA. As Councilors, we benefit from cross-pollination with the work of the Association. Resolved: To tread lightly with resolutions New Councilors, and I was one of them once, are eager to solve ALA’s problems by submitting resolutions. Indeed, there are new Councilors who see resolutions as the work of Council, and there have been round tables and other units that clearly saw their work as generating reams of lightly-edited, poorly-written resolutions just prior to and during the conference. There are at least three questions to ask before submitting a resolution (other than memorial and other commemorative resolutions): Can the resolution itself help solve a problem? Has it been coordinated with the units and people involved in the issue it addresses? Is it clear and well-written? There are other questions worth considering, such as, if the issue this resolution proposed to address cropped up a month after Council met, would you still push it online with your Council colleagues, or ask the ALA Executive Board to address it? Which is another way to ask, is it important? Tread lightly with Twitter Overall, since coming through the stress of living through the Santa Rosa fires, I’m feeling weary, and perhaps wary, of social media. Though I appreciate the occasional microbursts taking on idiots insulting libraries and so on, right now much of social media feels at once small and overwrought. If I seem quieter on social media, that’s true. (But I have had more conversations with neighbors and area residents during and after the fires than I have since we moved to Santa Rosa in early 2015, and those convos are the real thing.) More problematically, as useful as Twitter can be for following real-world issues–including ALA–Twitter also serves as a place where people go to avoid the heavy lifting involved with crucial conversations. I find I like #alacouncil Twitter best when it is gently riffing on itself or amplifying action that the larger ALA body would benefit hearing about. [the following, to the end of this post, is all new content] I like #alacouncil Twitter least when it is used as a substitute for authentic conversation, used to insult other Councilors, or otherwise undermining the discourse taking place in the meatware world. Twitter is also particularly good at the unthinking pile-on, and many people have vulnerabilities in this area that are easily exploited. Sometimes those pile-ons hit me close to home, as happened a little over a year ago. Other times these pile-ons serve only to amuse the minx in me, such as when a Famous Author (™) recently scolded me for “trafficking in respectability politics” because I was recommending a list of books written by writers from what our fearless leader calls “s–thole countries.” Guilty as charged! Indeed, I have conducted two studies where a major theme was “Do I look too gay?” I basically have a Ph.D. in respectability politics. And like all writers–including Famous Author (™)–I traffic in them. I chuckled and walked on by. Walking on by, on Twitter, takes different forms. As an administrator, I practice a certain pleasant-but-not-sugary facial expression that stays on my face regardless of what’s going on in my head. I’m not denying my emotions, which would be the sugary face; I’m managing them. It’s a kind of discipline that also helps me fjord difficult conversations, in which the discipline of managing my face also helps me manage my brain. The equivalent of my Admin Face for me for #alacouncil Twitter is to exercise the mute button. I have found it invaluable. People don’t know they are muted (or unmuted). If only real life had mute buttons–can you imagine how much better some meetings would be if you could click a button and the person speaking would be silenced, unaware that you couldn’t hear them? Everyone wins. But that aside, I have yet to encounter a situation on Twitter when–for me–muting was the wrong call. It’s as if you stepped off the elevator and got away from that person smacking gum. Another car will be along momentarily. My last thought on this post has to do with adding the term “sitting” before Councilors in the first part of this post. When I was not on Council I tried very hard not to be “that” former Councilor who is always kibitizing behind scene, sending Councilors messages about how things should be and how, in the 1960s, ALA did something bad and therefore we can never vote online because nobody knows how to find ALA Connect and it’s all a nefarious plot hatched by the ALA President, his dimwitted sycophants, and the Executive Board, and why can’t MY division have more representation because after all we’re the 800-pound gorilla (ok, I just got political, but you’ll note I left out anything about what should or should not be required for a Very Special Job). Yes, once in a while I sent a note if I thought it was helpful, the way some of my very ALA-astute friends will whisper in my ear about policy and process I may be unfamiliar with. Michael Golrick, a very connected ALA friend of mine, must have a third brain hemisphere devoted to the ALA policy manual and bylaws. And during a time when I was asking a lot of questions about the ALA budget (boiling down to one question: who do you think you’re fooling?), I was humbled by the pantheon of ALA luminaries whispering in my ear, providing encouragement as well as crucial guidance and information. But when I am no longer part of something, I am mindful that things can and should change and move on, and that I may not have enough information to inform that change. We don’t go to ALA in horse-and-buggies any more, but we conduct business as if we do, and when we try to change that, the fainting couches are rolled out and the smelling salts waved around as if we had, say, attempted to change the ALA motto, which is, I regret to inform you, “The best reading, for the largest number, at the least cost”–and yes, attempts to change that have been defeated. My perennial question is, if you were starting an association today, how would it function? If the answer is “as it did in 1893” (when that motto was adopted), perhaps your advice on a current situation is less salient than you fancy. You may succeed at what you’re doing, but that doesn’t make you right. And with that, I go off to Courthouse Square today to make exactly that point about events writ much, much larger, and of greater significance, than our fair association. But I believe how we govern makes a difference, and I believe in libraries and library workers, and I believe in ALA. Especially today. Bookmark to: Filed in American Liberry Ass'n, Librarianship | | Comments (2) What burns away Thursday, November 16, 2017 We are among the lucky ones. We did not lose our home. We did not spend day after day evacuated, waiting to learn the fate of where we live. We never lost power or Internet. We had three or four days where we were mildly inconvenienced because PG&E wisely turned off gas to many neighborhoods, but we showered at the YMCA and cooked on an electric range we had been planning to upgrade to gas later this fall (and just did, but thank you, humble Frigidaire electric range, for being there to let me cook out my anxiety). We kept our go-bags near the car, and then we kept our go-bags in the car, and then, when it seemed safe, we took them out again. That, and ten days of indoor living and wearing masks when we went out, was all we went through. But we all bear witness. The Foreshadowing It began with a five-year drought that crippled forests and baked plains, followed by an soaking-wet winter and a lush spring that crowded the hillsides with greenery. Summer temperatures hit records several times, and the hills dried out as they always do right before autumn, but this time unusually crowded with parched foliage and growth. The air in Santa Rosa was hot and dry that weekend, an absence of humidity you could snap between your fingers. In the southwest section of the city, where we live, nothing seemed unusual. Like many homes in Santa Rosa our home does not have air conditioning, so for comfort’s sake I grilled our dinner, our 8-foot backyard fence buffering any hint of the winds gathering speed northeast of us. We watched TV and went to bed early. Less than an hour later one of several major fires would be born just 15 miles east of where we slept. Reports vary, but accounts agree it was windy that Sunday night, with windspeeds ranging between 35 and 79 miles per hour, and a gust northwest of Santa Rosa reaching nearly 100 miles per hour. If the Diablo winds were not consistently hurricane-strength, they were exceptionally fast, hot, and dry, and they meant business. A time-lapse map of 911 calls shows the first reports of downed power lines and transformers coming in around 10 pm. The Tubbs fire was named for a road that is named for a 19th-century winemaker who lived in a house in Calistoga that burned to the ground in an eerily similar fire in 1964. In three hours this fire sped 12 miles southwest, growing in size and intent as it gorged on hundreds and then thousands of homes in its way, breaching city limits and expeditiously laying waste to 600 homes in the Fountaingrove district before it tore through the Journey’s End mobile home park, then reared back on its haunches and leapt across a six-lane divided section of Highway 101, whereupon it gobbled up big-box stores and fast food restaurants flanking Cleveland Avenue, a business road parallel to the highway. Its swollen belly, fat with miles of fuel, dragged over the area and took out buildings in the the random manner of fires. Kohl’s and KMart were totaled and Trader Joe’s was badly damaged, while across the street from KMart, JoAnn Fabrics was untouched. The fire demolished one Mexican restaurant, hopscotched over another, and feasted on a gun shop before turning its ravenous maw toward the quiet middle-class neighborhood of Coffey Park, making short work of thousands more homes. Santa Rosa proper is itself only 41 square miles, approximately 13 miles north-south and 9 miles east-west, including the long tail of homes flanking the Annadel mountains. By the time Kohl’s was collapsing, the “wildfire” was less than 4 miles from our home. I woke up around 2 am, which I tend to do a lot anyway. I walked outside and smelled smoke, saw people outside their homes looking around, and went on Twitter and FaceBook. There I learned of a local fire, forgotten by most in the larger conflagration, but duly noted in brief by the Press Democrat: a large historic home at 6th and Pierson burned to the ground, possibly from a downed transformer, and the fire licked the edge of the Santa Rosa Creek Trail for another 100 feet. Others in the West End have reported the same experience of reading about the 6th Street house fire on social media and struggling to reconcile the reports of this fire with reports of panic and flight from areas north of us and videos of walls of flame. At 4 am I received a call that the university had activated its Emergency Operations Center and I asked if I should report in. I showered and dressed, packed a change of clothes in a tote bag, threw my bag of important documents in my purse, and drove south on my usual route to work, Petaluma Hill Road. The hills east of the road flickered with fire, the road itself was packed with fleeing drivers, and halfway to campus I braked at 55 mph when a massive buck sprang inches in front of my car, not running in that “oops, is this a road?” way deer usually cross lanes of traffic but yawing too and fro, its eyes wide. I still wonder, was it hurt or dying. As I drove onto campus I thought, the cleaning crew. I parked at the Library and walked through the building, already permeated with smoky air. I walked as quietly as I could, so that if they were anywhere in the building I would hear them. As I walked through the silent building I wondered, is this the last time I will see these books? These computers? The new chairs I’m so proud of? I then went to the EOC and found the cleaning crew had been accounted for, which was a relief. At Least There Was Food And Beer A few hours later I went home. We had a good amount of food in the house, but like many of us who were part of this disaster but not immediately affected by it, I decided to stock up. The entire Santa Rosa Marketplace– CostCo and Trader Joe’s, Target–on Santa Rosa Avenue was closed, and Oliver’s had a line outside of people waiting to get in. I went to the “G&G Safeway”–the one that took over a down-at-the-heels family market known as G&G and turned it into a spiffy market with a wine bar, no less–and it was without power, but open for business and, thanks to a backup system, able to take ATM cards. I had emergency cash on me but was loathe to use it until I had to. Sweating through an N95 mask I donned to protect my lungs, I wheeled my cart through the dark store, selecting items that would provide protein and carbs if we had to stuff them in our go-bags, but also fresh fruit and vegetables, dairy and eggs–things I thought we might not see for a while, depending on how the disaster panned out. (Note, we do already have emergency food, water, and other supplies.) The cold case for beer was off-limits–Safeway was trying to retain the cold in its freezer and fridge cases in case it could save the food–but there was a pile of cases of Lagunitas Lil Sumpin Sumpin on sale, so that with a couple of bottles of local wine went home with me too. And with one wild interlude, for most of the rest of the time we stayed indoors with the windows closed. I sent out email updates and made phone calls, kept my phone charged and read every Nexil alert, and people at work checked in with one another. My little green library emergency contact card stayed in my back pocket the entire time. We watched TV and listened to the radio, including extraordinary local coverage by KSRO, the Little Station that Could; patrolled newspapers and social media; and rooted for Sheriff Rob, particularly after his swift smack-down of a bogus, Breitbart-fueled report that an undocumented person had started the fires. Our home was unoccupied for a long time before we moved in this September, possibly up to a decade, while it was slowly but carefully upgraded. The electric range was apparently an early purchase; it was a line long discontinued by Frigidaire, with humble electric coils. But it had been unused until we arrived, and was in perfect condition. If an electric range could express gratitude for finally being useful, this one did. I used it to cook homey meals: pork loin crusted with Smithfield bacon; green chili cornbread; and my sui generis meatloaf, so named because every time I make it, I grind and add meat scraps from the freezer for a portion of the meat mixture. (It would be several weeks before I felt comfortable grilling again.) We cooked. We stirred. We sauteed. We waited. On Wednesday, we had to run an errand. To be truthful, it was an Amazon delivery purchased that Saturday, when the world was normal, and sent to an Amazon locker at the capacious Whole Foods at Coddington Mall, a good place to send a package until the mall closes down because the northeast section of the city is out of power and threatened by a massive wildfire. By Wednesday, Whole Foods had reopened, and after picking up my silly little order–a gadget that holds soda cans in the fridge–we drove past Russian River Brewing Company and saw it was doing business, so we had salad and beer for lunch, because it’s a luxury to have beer at lunch and the fires were raging and it’s so hard to get seating there nights and weekends, when I have time to go there, but there we were. We asked our waiter how he was doing, and he said he was fine but he motioned to the table across from ours, where a family was enjoying pizza and beer, and he said they had lost their homes. There were many people striving for routine during the fires, and to my surprise, even the city planning office returned correspondence regarding some work we have planned for our new home, offering helpful advice on the permitting process required for minor improvements for homes in historic districts. Because it turns out developers and engineers could serenely ignore local codes and build entire neighborhoods in Santa Rosa in areas known to be vulnerable to wildfire; but to replace bare dirt with a little white wooden picket fence, or to restore front windows from 1950s-style plate glass to double-hung wooden windows with mullions–projects intended to reinstate our house to its historic accuracy, and to make it more welcoming–requires a written justification of the project, accompanying photos, “Proposed Elevations (with Landscape Plan IF you are significantly altering landscape) (5 copies),” five copies of a paper form, a Neighborhood Context and Vicinity Map provided by the city, and a check for $346, followed by “8-12 weeks” before a decision is issued. The net result of this process is like the codes about not building on ridges, though much less dangerous; most people ignore the permitting process, so that the historic set piece that is presumably the goal is instead rife with anachronisms. And of course, first I had to bone up on the residential building code and the historic district guidelines, which contradict one another on key points, and because the permitting process is poorly documented I have an email traffic thread rivaling in word count Byron’s letters to his lovers. But the planning people are very pleasant, and we all seemed to take comfort in plodding through the administrivia of city bureaucracy as if we were not all sheltering in place, masks over our noses and mouths, go-bags in our cars, while fires raged just miles from their office and our home. The Wild Interlude, or, I Have Waited My Entire Career For This Moment Regarding the wild interlude, the first thing to know about my library career is that nearly everywhere I have gone where I have had the say-so to make things happen, I have implemented key management. That mishmosh of keys in a drawer, the source of so much strife and arguments, becomes an orderly key locker with numbered labels. It doesn’t happen overnight, because keys are control and control is political and politics are what we tussle about in libraries because we don’t have that much money, but it happens. Sometimes I even succeed in convincing people to sign keys out so we know who has them. Other times I convince people to buy a locker with a keypad so we sidestep the question of where the key to the key locker is kept. But mostly, I leave behind the lockers, and, I hope, an appreciation for lockers. I realize it’s not quite as impressive as founding the Library of Alexandria, and it’s not what people bring up when I am introduced as a keynote speaker, and I have never had anyone ask for a tour of my key lockers nor have I ever been solicited to write a peer-reviewed article on key lockers. However unheralded, it’s a skill. My memory insists it was Tuesday, but the calendar says it was late Monday night when I received a call that the police could not access a door to an area of the library where we had high-value items. It would turn out that this was a rogue lock, installed sometime soon after the library opened in 2000, that unlike others did not have a master registered with the campus, an issue we have since rectified. But in any event, the powers that be had the tremendous good fortune to contact the person who has been waiting her entire working life to prove beyond doubt that KEY LOCKERS ARE IMPORTANT. After a brief internal conversation with myself, I silently nixed the idea of offering to walk someone through finding the key. I said I knew where the key was, and I could be there in twenty minutes to find it. I wasn’t entirely sure this was the case, because as obsessed as I am with key lockers, this year I have been preoccupied with things such as my deanly duties, my doctoral degree completion, national association work, our home purchase and household move, and the selection of geegaws like our new gas range (double oven! center griddle!). This means I had not spend a lot of time perusing this key locker’s manifest. So there was an outside chance I would have to find the other key, located somewhere in an another department, which would require a few more phone calls. I was also in that liminal state between sleep and waking; I had been asleep for two hours after being up since 2 am, and I would have agreed to do just about anything. Within minutes I was dressed and again driving down Petaluma Hill Road, still busy with fleeing cars. The mountain ridges to the east of the road roiled with flames, and I gripped the steering wheel, watching for more animals bolting from fire. Once in the library, now sour with smoke, I ran up the stairs into my office suite and to the key locker, praying hard that the key I sought was in it. My hands shook. There it was, its location neatly labeled by the key czarina who with exquisite care had overseen the organization of the key locker. The me who lives in the here-and-now profusely thanked past me for my legacy of key management, with a grateful nod to the key czarina as well. What a joy it is to be able to count on people! Items were packed up, and off they rolled. After a brief check-in at the EOC, home I went, to a night of “fire sleep”–waking every 45 minutes to sniff the air and ask, is fire approaching?–a type of sleep I would have for the next ten days, and occasionally even now. How we speak to one another in the here and now Every time Sandy and I interact with people, we ask, how are you. Not, hey, how are ya, where the expected answer is “fine, thanks” even if you were just turned down for a mortgage or your mother died. But no, really, how are you. Like, fire-how-are-you. And people usually tell you, because everyone has a story. Answers range from: I’m ok, I live in Petaluma or Sebastopol or Bodega Bay (in SoCo terms, far from the fire), to I’m ok but I opened my home to family/friends/people who evacuated or lost their homes; or, I’m ok but we evacuated for a week; or, as the guy from Home Depot said, I’m ok and so is my wife, my daughter, and our 3 cats, but we lost our home. Sometimes they tell you and they change the subject, and sometimes they stop and tell you the whole story: when they first smelled smoke, how they evacuated, how they learned they did or did not lose their home. Sometimes they have before-and-after photos they show you. Sometimes they slip it in between other things, like our cat sitter, who mentioned that she lost her apartment in Fountaingrove and her cat died in the fire but in a couple of weeks she would have a home and she’d be happy to cat-sit for us. Now, post-fire, we live in that tritest of phrases, a new normal. The Library opened that first half-day back, because I work with people who like me believe that during disasters libraries should be the first buildings open and the last to close. I am proud to report the Library also housed NomaCares, a resource center for those at our university affected by the fire. That first Friday back we held our Library Operations meeting, and we shared our stories, and that was hard but good. But we also resumed regular activity, and soon the study tables and study rooms were full of students, meetings were convened, work was resumed, and the gears of life turned. But the gears turned forward, not back. Because there is no way back. I am a city mouse, and part of moving to Santa Rosa was our decision to live in a highly citified section, which turned out to be a lucky call. But my mental model of city life has been forever twisted by this fire. I drive on 101 just four miles north of our home, and there is the unavoidable evidence of a fire boldly leaping into an unsuspecting city. I go to the fabric store, and I pass twisted blackened trees and a gun store totaled that first night. I drive to and from work with denuded hills to my east a constant reminder. But that’s as it should be. Even if we sometimes need respite from those reminders–people talk about taking new routes so they won’t see scorched hills and devastated neighborhoods–we cannot afford to forget. Sandy and I have moved around the country in our 25 years together, and we have seen clues everywhere that things are changing and we need to take heed. People like to lapse into the old normal, but it is not in our best interests to do so. All of our stories are different. But we share a collective loss of innocence, and we can never return to where we were. We can only move forward, changed by the fire, changed forever. Bookmark to: Filed in Santa Rosa Living | | Comments Off on What burns away Neutrality is anything but Saturday, August 19, 2017 “We watch people dragged away and sucker-punched at rallies as they clumsily try to be an early-warning system for what they fear lies ahead.” — Unwittingly prophetic me, March, 2016. Sheet cake photo by Flickr user Glane23. CC by 2.0 Sometime after last November, I realized something very strange was happening with my clothes. My slacks had suddenly shrunk, even if I hadn’t washed them. After months of struggling to keep myself buttoned into my clothes, I gave up and purchased slacks and jeans one size larger. I call them my T***p Pants. This post is about two things. It is about the lessons librarians are learning in this frightening era about the nuances and qualifications shadowing our deepest core values–an era so scary that quite a few of us, as Tina Fey observed, have acquired T***p Pants. And it’s also some advice, take it or leave it, on how to “be” in this era. I suspect many librarians have had the same thoughts I have been sharing with a close circle of colleagues. Most librarians take pride in our commitment to free speech. We see ourselves as open to all viewpoints. But in today’s new normal, we have seen that even we have limits. This week, the ACRL Board of Directors put out a statement condemning the violence in Charlottesville. That was the easy part. The Board then stated, “ACRL is unwavering in its long-standing commitment to free exchange of different viewpoints, but what happened in Charlottesville was not that; instead, it was terrorism masquerading as free expression.” You can look at what happened in Charlottesville and say there was violence “from many sides,” some of it committed by “very fine people” who just happen to be Nazis surrounded by their own private militia of heavily-armed white nationalists. Or you can look at Charlottesville and see terrorism masquerading as free expression, where triumphant hordes descended upon a small university town under the guise of protecting some lame-ass statue of an American traitor, erected sixty years after the end of the Civil War, not coincidentally during a very busy era for the Klan. Decent people know the real reason the Nazis were in Charlottesville: to tell us they are empowered and emboldened by our highest elected leader. There is no middle ground. You can’t look at Charlottesville and see everyday people innocently exercising First Amendment rights. As I and many others have argued for some time now, libraries are not neutral. Barbara Fister argues, “we stand for both intellectual freedom and against bigotry and hate, which means some freedoms are not countenanced.” She goes on to observe, “we don’t have all the answers, but some answers are wrong.” It goes to say that if some answers are wrong, so are some actions. In these extraordinary times, I found myself for the first time ever thinking the ACLU had gone too far; that there is a difference between an unpopular stand, and a stand that is morally unjustifiable. So I was relieved when the national ACLU concurred with its three Northern California chapters that “if white supremacists march into our towns armed to the teeth and with the intent to harm people, they are not engaging in activity protected by the United States Constitution. The First Amendment should never be used as a shield or sword to justify violence.” But I was also sad, because once again, our innocence has been punctured and our values qualified. Every asterisk we put after “free speech” is painful. It may be necessary and important pain, but it is painful all the same. Many librarians are big-hearted people who like to think that our doors are open to everyone and that all viewpoints are welcome, and that enough good ideas, applied frequently, will change people. And that is actually very true, in many cases, and if I didn’t think it was true I would conclude I was in the wrong profession. But we can’t change people who don’t want to be changed. Listen to this edition of The Daily, a podcast from the New York Times, where American fascists plan their activities. These are not people who are open to reason. As David Lankes wrote, “there are times when a community must face the fact that parts of that community are simply antithetical to the ultimate mission of a library.” We urgently need to be as one voice as a profession around these issues. I was around for–was part of–the “filtering wars” of the 1990s, when libraries grappled with the implications of the Internet bringing all kinds of content into libraries, which also challenged our core values. When you’re hand-selecting the materials you share with your users, you can pretend you’re open to all points of view. The Internet challenged that pretense, and we struggled and fought, and were sometimes divided by opportunistic outsiders. We are fortunate to have strong ALA leadership this year. The ALA Board and President came up swinging on Tuesday with an excellent presser that stated unequivocally that “the vile and racist actions and messages of the white supremacist and neo-Nazi groups in Charlottesville are in stark opposition to the ALA’s core values,” a statement that (in the tradition of ensuring chapters speak first) followed a strong statement from our Virginia state association. ARL also chimed in with a stemwinder of a statement. I’m sure we’ll see more. But ALA’s statement also describes the mammoth horns of the library dilemma. As I wrote colleagues, “My problem is I want to say I believe in free speech and yet every cell in my body resists the idea that we publicly support white supremacy by giving it space in our meeting rooms.” If you are in a library institution that has very little likelihood of exposure to this or similar crises, the answers can seem easy, and our work appears done. But for more vulnerable libraries, it is crucial that we are ready to speak with one voice, and that we be there for those libraries when they need us. How we get there is the big question. I opened this post with an anecdote about my T***p pants, and I’ll wrap it up with a concern. It is so easy on social media to leap in to condemn, criticize, and pick apart ideas. Take this white guy, in an Internet rag, the week after the election, chastising people for not doing enough. You know what’s not enough? Sitting on Twitter bitching about other people not doing enough. This week, Siva Vaidhyanathan posted a spirited defense of a Tina Fey skit where she addressed the stress and anxiety of these political times. Siva is in the center of the storm, which gives him the authority to state an opinion about a sketch about Charlottesville. I thought Fey’s skit was insightful on many fronts. It addressed the humming anxiety women have felt since last November (if not earlier). It was–repeatedly–slyly critical of inaction: “love is love, Colin.” It even had a Ru Paul joke. A lot of people thought it was funny, but then the usual critics came out to call it naive, racist, un-funny, un-woke, advocating passivity, whatever. We are in volatile times, and there are provocateurs from outside, but also from inside. Think. Breathe. Step away from the keyboard. Take a walk. Get to know the mute button in Twitter and the unfollow feature in Facebook. Pull yourself together and think about what you’re reading, and what you’re planning to say. Interrogate your thinking, your motives, your reactions. I’ve read posts by librarians deriding their peers for creating subject guides on Charlottesville, saying instead we should be punching Nazis. Get a grip. First off, in real life, that scenario is unlikely to transpire. You, buried in that back cubicle in that library department, behind three layers of doors, are not encountering a Nazi any time soon, and if you did, I recommend fleeing, because that wackdoodle is likely accompanied by a trigger-happy militiaman carrying a loaded gun. (There is an entire discussion to be had about whether violence to violence is the politically astute response, but that’s for another day.) Second, most librarians understand that their everyday responses to what is going on in the world are not in and of themselves going to defeat the rise of fascism in America. But we are information specialists and it’s totally wonderful and cool to respond to our modern crisis with information, and we need to be supportive and not go immediately into how we are all failing the world. Give people a positive framework for more action, not scoldings for not doing enough. In any volatile situation, we need to slow the eff down and ask how we’re being manipulated and to what end; that is a lesson the ACLU just learned the hard way. My colleague Michael Stephens is known for saying, “speak with a human voice.” I love his advice, and I would add, make it the best human voice you have. We need one another, more than we know. Bookmark to: Filed in Intellectual Freedom, Librarianship | | Comments (2) MPOW in the here and now Sunday, April 9, 2017 Sometimes we have monsters and UFOs, but for the most part it’s a great place to work I have coined a few biblioneologisms in my day, but the one that has had the longest legs is MPOW (My Place of Work), a convenient, mildly-masking shorthand for one’s institution. For the last four years I haven’t had the bandwidth to coin neologisms, let alone write about MPOW*. This silence could be misconstrued. I love what I do, and I love where I am. I work with a great team on a beautiful campus for a university that is undergoing a lot of good change. We are just wrapping up the first phase of a visioning project to help our large, well-lit building serve its communities well for the decades to come. We’re getting ready to join the other 22 CSU libraries on OneSearch, our first-ever unified library management system. We have brought on some great hires, thrown some great events (the last one featured four Black Panthers talking about their life work — wow!). With a new dean (me) and a changing workforce, we are developing our own personality. It’s all good… and getting better The Library was doing well when I arrived, so my job was to revitalize and switch it up. As noted in one of the few posts about MPOW, the libraries in my system were undergoing their own reassessment, and that has absorbed a fair amount of our attention, but we continue to move forward. Sometimes it’s the little things. You may recall I am unreasonably proud of the automated table of contents I generated for my dissertation, and I also feel that way about MPOW’s slatwall book displays, which in ten areas beautifully market new materials in spaces once occupied by prison-industry bookcases or ugly carpet and unused phones (what were the phones for? Perhaps we will never know). The slatwall was a small project that was a combination of expertise I brought from other libraries, good teamwork at MPOW, and knowing folks. The central problem was answered quickly by an email to a colleague in my doctoral program (hi, Cindy!) who manages public libraries where I saw the displays I thought would be a good fit. The team selected the locations, a staff member with an eye for design recommended the color, everyone loves it, and the books fly off the shelves. If there is any complaining, it is that we need more slatwall. Installed slatwall needs to wait until we know if we are moving/removing walls as part of our building improvements. A bigger holdup is that we need to hire an Access Services Manager, and really, anything related to collections needs the insight of a collections librarian. People… who need people… But we had failed searches for both these positions… in the case of collections, twice. *cue mournful music* We have filled other positions with great people now doing great things, and are on track to fill more positions, but these two, replacing people who have retired, are frustrating us. The access services position is a managerial role, and the collections librarian is a tenure-track position. Both offer a lot of opportunity. We are relaunching both searches very soon (I’ll post a brief update when that happens), and here’s my pitch. If you think you might qualify for either position, please apply. Give yourself the benefit of the doubt. If you know someone who would be a good fit for either position, ask them to apply. I recently mentored someone who was worried about applying to a position. “Will that library hold it against me if I am not qualified?” The answer is of course not! (And if they do, well, you dodged that bullet!) I have watched far too many people self-select out of positions they were qualified for (hrrrrmmmm particularly one gender…). Qualification means expertise + capacity + potential. We expect this to be a bit of a stretch to you. If a job is really good, most days will have a “fake it til you make it” quality. This is also not a “sink or swim” institution. If it ever was, those days are in the dim past, long before I arrived. The climate is positive. People do great things and we do our best to support them. I see our collective responsibility as an organization as to help one another succeed. Never mind me and my preoccupation with slatwall (think of it as something to keep the dean busy and happy, like a baby with a binky). We are a great team, a great library, on a great campus, and we’re a change-friendly group with a minimum of organizational issues, and I mean it. I have worked enough places to put my hand on a Bible and swear to that. It has typical organizational challenges, and it’s a work in progress… as are we all. The area is crazily expensive, but it’s also really beautiful and so convenient for any lifestyle. You like city? We got city. You like suburb, or ocean, or mountain, or lake? We got that! Anyway, that’s where I am with MPOW: I’m happy enough, and confident enough, to use this blog post to BEG YOU OH PLEASE HELP US FILL THESE POSITIONS. The people who join us will be glad you did. ### * Sidebar: the real hilarity of coining neologisms is that quite often someone, generally of a gender I do not identify with, will heatedly object to the term, as happened in 2004 when I coined the term biblioblogosphere. Then, as I noted in that post from 2012, others will defend it. That leads me to believe that creating new words is the linguistic version of lifting one’s hind leg on a tree. Bookmark to: Filed in Uncategorized | | Comments (1) Questions I have been asked about doctoral programs Wednesday, March 29, 2017 About six months ago I was visiting another institution when someone said to me, “Oh, I used to read your blog, BACK IN THE DAY.” Ah yes, back in the day, that Pleistocene era when I wasn’t working on a PhD while holding down a big job and dealing with the rest of life’s shenanigans. So now the PhD is done–I watched my committee sign the signature page, two copies of it, even, before we broke out the champers and celebrated–and here I am again. Not blogging every day, as I did once upon a time, but still freer to put virtual pen to electronic paper as the spirit moves me. I have a lot to catch up on–for example, I understand there was an election last fall, and I hear it may not have gone my way–but the first order of business is to address the questions I have had from library folk interested in doctoral programs. Note that my advice is not directed at librarians whose goal is to become faculty in LIS programs. Dropping Back In One popular question comes from people who had dropped out of doctoral programs. Could they ever be accepted into a program again? I’m proof there is a patron saint for second chances. I spent one semester in a doctoral program in 1995 and dropped out for a variety of reasons–wrong time, wrong place, too many life events happening. At the time, I felt that dropping out was the academic equivalent of You’ll Never Eat Lunch In This Town Again, but part of higher education is a series of head games, and that was one of them. The second time around, I had a much clearer idea of what I wanted from a program and what kind of program would work for me, and I had the confluence of good timing and good luck. The advice Tom Galvin gave me in 1999, when Sandy and I were living in Albany and when Tom–a longtime ALA activist and former ALA Exec Director–was teaching at SUNY Albany, still seems sound: you can drop out of one program and still find your path back to a doctorate, just don’t drop out of two programs. I also have friends who suffered through a semester or two, then decided it wasn’t for them. When I started the program, I remember thinking “I need this Ph.D. because I could never get a job at, for example, X without it.” Then I watched as someone quite accomplished, with no interest in ever pursuing even a second masters, was hired at X. There is no shame in deciding the cost/benefit analysis isn’t there for you–though I learned, through this experience, that I was in the program for other, more sustainable reasons. Selecting Your Program I am also asked what program to attend. To that my answer is, unless you are very young and can afford to go into, and hopefully out of, significant amounts of debt, pick the program that is most affordable and allows you to continue working as a professional (though if you are at a point in life when you can afford to take a couple years off and get ‘er done, more power to you). That could be a degree offered by your institution or in cooperation with another institution, or otherwise at least partially subsidized. I remember pointing out to an astonished colleague that the Ed.D. he earned for free (plus many Saturdays of sweat equity) was easily worth $65,000, based on the tuition rate at his institution. Speaking of which, I get asked about Ph.D. versus Ed.D. This can be a touchy question. My take: follow the most practical and affordable path available to you that gets you the degree you will be satisfied with and that will be the most useful to you in your career. But whether Ed.D. or Ph.D., it’s still more letters after your name than you had before you started. Where Does It Hurt? What’s the hardest part of a doctoral program? For me, that was a two-way tie between the semester coursework and the comprehensive exams. The semester work was challenging because it couldn’t be set aside or compartmentalized. The five-day intensives were really seven days for me as I had to fly from the Left Coast to Boston. The coursework had deadlines that couldn’t be put aside during inevitable crises. The second semester was the hardest, for so many reasons, not the least of which is that once I had burned off the initial adrenaline, the finish line seemed impossibly far away; meanwhile, the tedium of balancing school and work was settling in, and I was floundering in alien subjects I was struggling to learn long-distance. Don’t get me wrong, the coursework was often excellent: managing in a political environment, strategic finance, human resources, and other very practical and interesting topics. But it was a bucket o’ work, and when I called a colleague with a question about chair manufacturers (as one does) and heard she was mired in her second semester, I immediately informed her This Too Shall Pass. Ah, the comprehensive exams. I would say I shall remember them always, except they destroyed so much of my frontal lobe, that will not be possible. The comps required memorizing piles of citations–authors and years, with salient points–to regurgitate during two four-hour closed-book tests. I told myself afterwards that the comps helped me synthesize major concepts in grand theory, which is a dubious claim but at least made me feel better about the ordeal. A number of students in my program helped me with comps. My favorite memory is of colleague Gary Shaffer, who called me from what sounded like a windswept city corner to offer his advice. I kept hearing this crinkling sound. The crinkling became louder. “Always have your cards with you,” Gary said. He had brought a sound prop: the bag of index cards he used to constantly drill himself. I committed myself to continuous study until done, helped by partnering with my colleague Chuck in long-distance comps prep. We didn’t study together, but we compared timelines and kept one another apprised of our progress. You can survive a doctoral program without a study buddy, but whew, is it easier if you have one. Comps were an area where I started with old tech–good old paper index cards–and then asked myself, is this how it’s done these days? After research, I moved on to electronic flashcards through Quizlet. When I wasn’t flipping through text cards on my phone, iPad, or computer, I was listening to the cards on my phone during my run or while driving around running errands. Writing != Not Writing So about that dissertation. It was a humongous amount of work, but the qualifying paper that preceded it and the coursework and instruction in producing dissertation-quality research gave me the research design skills I needed to pull it off. Once I had the data gathered, it was just a lot of writing. This, I can do. Not everyone can. Writing is two things (well, writing is many things, but we’ll stick with two for now): it is a skill, and it is a discipline. If you do not have those two things, writing will be a third thing: impossible. Here is my method. It’s simple. You schedule yourself, you show up, and you write. You do not talk about how you are going to write, unless you are actually going to write. You do not tweet that you are writing (because then you are tweeting, not writing). You do not do other things and feel guilty because you are not writing. (If you do other things, embrace them fully.) I would write write write write write, at the same chair at the same desk (really, a CostCo folding table) facing the same wall with the same prompts secured to the wall with painter’s tape that on warm days would loosen, requiring me to crawl under my “desk” to retrieve the scattered papers, which on many days was pretty much my only form of exercise. Then I would write write write write write some more, on weekends, holiday breaks, and the occasional “dissercation day,” as I referred to vacation days set aside for this purpose. Dissercation Days had the added value that I was very conscious I was using vacation time to write, so I didn’t procrastinate–though in general I find procrastinating at my desk a poor use of time; if I’m going to procrastinate, let me at least get some fresh air. People will advise you when and how to write. A couple weekends ago I was rereading Stephen King’s On Writing–now that I can read real books again–in which King recommends writing every day. If that works for you, great. What worked for me was using weekends, holidays, or vacation days; writing early in the day, often starting as early as 4 am; taking a short exercise break or powering through until mid-afternoon; and then stopping no later than 4 pm, many times more like 2 pm if I hadn’t stopped by then. When I tried to write on weekday mornings, work would distract me. Not actual tasks, but the thought of work. It would creep into my brain and then I would feel the urgent need to see if the building consultant had replied to my email or if I had the agenda ready for the program and marketing meeting. It also takes me about an hour to get into a writing groove, so by the time the words were flowing it was time to get ready for work. As for evenings, a friend of mine observed that I’m a lark, not an owl. The muse flees me by mid-afternoon. (This also meant I saved the more chore-like tasks of writing for the afternoon.) The key is to find your own groove and stick to it. If your groove isn’t working, maybe it’s not your groove after all. Do not take off too much time between writing sessions. I had to do that a couple of times for six to eight weeks each time, during life events such as household moves and so on, and it took some revisiting to reacquaint myself with my writing (which was Stephen King’s main, and excellent, point in his recommendation to write daily). Even when I was writing on a regular basis I often spent at least an hour at the start of the weekend rereading my writing from page 1 to ensure that my most recent writing had a coherent flow of reasoning and narrative and that the writing for that day would be its logical descendant. Another universal piece of advice is to turn off the technology. I see people tweeting “I’m writing my dissertation right now” and I think, no you aren’t. I used a Mac app called Howler timer to give me writing sieges of 45, 60, 75, or 90 minutes, depending on my degree of focus for that day, during which all interruptions–email, Facebook, Twitter, etc.–were turned off. Twitter and Facebook became snack breaks, though I timed those snacks as well. I had favorite Pandora stations to keep me company and drown out ambient noise, and many, many cups of herbal tea. Technology Will Save Us All A few technical notes about technology and doctoral programs. With the exception of the constant allure of social networks and work email, it’s a good thing. I used Kahn Academy and online flash cards to study for the math portion of the GRE. As noted earlier, I used Quizlet for my comps, in part because this very inexpensive program not only allowed me to create digital flashcards but also read them aloud to me on my iPhone while I exercised or ran errands. I conducted interviews using FaceTime with an inexpensive plug-in, Call Recorder, that effortlessly produced digital recordings, from which the audio files could be easily split out. I then emailed the audio files to Valerie, my transcriptionist, who lives several thousand miles away but always felt as if she were in the next room, swiftly and flawlessly producing transcripts. I used Dedoose, a cloud-based analytical product, to mark up the narratives, and with the justifiable paranoia of any doctoral student, exported the output to multiple secure online locations. I dimly recall life before such technology, but cannot fathom operating in such a world again, or how much longer some of the tasks would have taken. I spent some solid coin on things like paying a transcriptionist, but when I watch friends struggling to transcribe their own recordings, I have no regrets. There are parts of my dissertation I am exceptionally proud of, but I admit particular pride for my automatically-generated table of contents, just one of many skills I learned through YouTube (spoiler alert: the challenge is not marking up the text, it’s changing the styles to match your requirements. Word could really use a style set called Just Times Roman Please). And of course, there were various library catalogs and databases, and hundreds of e-journals to plumb, activity I accomplished as far away from your typical “library discovery layer” as possible. You can take Google Scholar away from me when you pry it from my cold, dead hands. I also plowed through a lot of print books, and many times had to do backflips to get the book in that format. Journal articles work great in e-format (though I do have a leaning paper pillar of printed journal articles left over from comps review and classes). Books, not so much. I needed to have five to fifteen books simultaneously open during a writing session, something ebooks are lame at. I don’t get romantic about the smell of paper blah blah blah, but when I’m writing, I need my tools in the most immediately accessible format possible, and for me that is digital for articles and paper for books. Nothing Succeeds Like Success Your cohort can be very important, and indeed I remember all of them with fondness but one with particular gratitude. Nevertheless, you alone will cross the finish line. I was unnerved when one member of our cohort dropped out after the first semester, but I shouldn’t have been. Doctoral student attrition happens throughout the academy, no less so in LibraryLand. Like the military, or marriage, you really have no idea what it’s like until you’re in it, and it’s not for everyone. It should be noted that the program I graduated from has graduated, or will graduate, nearly all of the students who made it past the first two semesters, which in turn is most of the people who entered the program in its short but glorious life–another question you should investigate while looking at programs. It turned out that for a variety of reasons that made sense, the cohort I was in was the last for this particular doctoral program. That added a certain pressure since each class was the last one to ever be offered, but it also encouraged me to keep my eyes on the prize. I also, very significantly, had a very supportive committee, and most critically, I fully believed they wanted me to succeed. I also had a very supportive spouse, with whom I racked up an infinity of backlogged honey-dos and I-owe-you-for-this promises. Regarding success and failure, at the beginning of the program, I asked if anyone had ever failed out of the program. The answer was no, everyone who left self-selected. I later asked the same question regarding comps: had anyone failed comps? The answer was that a student or two had retaken a section of comps in order to pass, but no one had completely failed (and you got one do-over if that happened). These were crucial questions for me. It also helped me to reflect on students who had bigger jobs, or were also raising kids, or otherwise were generally worse off than me in the distraction department. If so-and-so, with the big Ivy League job, or so-and-so, with the tiny infant, could do it, couldn’t I? (There is a fallacy inherent here that more prestigious schools are harder to administer, but it is a fallacy that comforted me many a day.) Onward I am asked what I will “do” with my Ph.D. In higher education, a doctorate is the expected degree for administrators, and indeed, the news of my successful doctoral defense was met with comments such as “welcome to the club.” So, mission accomplished. Also, I have a job I love, but having better marketability is never a bad idea, particularly in a political moment that can best be described as volatile and unpredictable. I can consult. I can teach (yes, I already could teach, but now more fancy-pants). I could make a reservation at a swanky bistro under the name Dr. Oatmeal and only half of that would be a fabrication. The world is my oyster! Frankly, I did not enter the program with the idea that I would gain skills and develop the ability to conduct doctoral-quality research (I was really shooting for the fancy six-sided tam), but that happened and I am pondering what to do with this expertise. I already have the joy of being pedantic, if only quietly to myself. Don’t tell me you are writing a “case study” unless it has the elements of a case study not to mention the components of any true research design. Otherwise it’s just anecdata. And of course, when it comes to owning the area of LGTBQ leadership in higher education, I am totally M.C. Hammer: u can’t touch this! I would not mind being part of the solution for addressing the dubious quality of so much LIS “research.” LibraryLand needs more programs such as the Institute for Research Design in Librarianship to address the sorry fact that basic knowledge of the fundamentals of producing industry-appropriate research is in most cases not required for a masters degree in library science, which at least for academic librarianship, given the student learning objectives we claim to support, is absurd. I also want to write a book, probably continuing the work I have been doing with documenting the working experiences of LGBTQ librarians. But first I need to sort and purge my home office, revisit places such as Hogwarts and Narnia, and catch up on some of those honey-dos and I-owe-you-for-this promises. And buy a six-sided tam. Bookmark to: Filed in Uncategorized | | Comments (2) A scholar’s pool of tears, Part 2: The pre in preprint means not done yet Tuesday, January 10, 2017 Note, for two more days, January 10 and 11, you (as in all of you) have free access to my article, To be real: Antecedents and consequences of sexual identity disclosure by academic library directors. Then it drops behind a paywall and sits there for a year. When I wrote Part 1 of this blog post in late September, I had keen ambitions of concluding this two-part series by discussing “the intricacies of navigating the liminal world of OA that is not born OA; the OA advocacy happening in my world; and the implications of the publishing environment scholars now work in.” Since then, the world, and my priorities have changed. My goals are to prevent nuclear winter and lead our library to its first significant building upgrades since it opened close to 20 years ago. But at some point I said on Twitter, in response to a conversation about posting preprints, that I would explain why I won’t post a preprint of To be real. And the answer is very simple: because what qualifies as a preprint for Elsevier is a draft of the final product that presents my writing before I incorporated significant stylistic guidance from the second reviewer, and that’s not a version of the article I want people to read. In the pre-Elsevier draft, as noted before, my research is present, but it is overshadowed by clumsy style decisions that Reviewer 2 presented far more politely than the following summary suggests: quotations that were too brief; rushing into the next thought without adequately closing out the previous thought; failure to loop back to link the literature review to the discussion; overlooking a chance to address the underlying meaning of this research; and a boggy conclusion. A crucial piece of advice from Reviewer 2 was to use pseudonyms or labels to make the participants more real. All of this advice led to a final product, the one I have chosen to show the world. That’s really all there is to it. It would be better for the world if my article were in an open access publication, but regardless of where it is published, I as the author choose to share what I know is my best work, not my work in progress. The OA world–all sides of it, including those arguing against OA–has some loud, confident voices with plenty of “shoulds,” such as the guy (and so many loud OA voices are male) who on a discussion list excoriated an author who was selling self-published books on Amazon by saying “people who value open access should praise those scholars who do and scorn those scholars who don’t.” There’s an encouraging appproach! Then there are the loud voices announcing the death of OA when a journal’s submissions drop, followed by the people who declare all repositories are Potemkin villages, and let’s not forget the fellow who curates a directory of predatory OA journals that is routinely cited as an example of what’s wrong with scholarly publishing. I keep saying, the scholarly-industrial complex is broken. I’m beyond proud that the Council of Library Deans for the California State University–my 22 peers–voted to encourage and advocate for open access publishing in the CSU system. I’m also excited that my library has its first scholarly communications librarian who is going to bat on open access and open educational resources and all other things open–a position that in consultation with the library faculty I prioritized as our first hire in a series of retirement/moving-on faculty hires. But none of that translates to sharing work I consider unfinished. We need to fix things in scholarly publishing and there is no easy, or single, path. And there are many other things happening in the world right now. I respect every author’s decision about what they will share with the world and when and how they will share it. As for my decision–you have it here. Bookmark to: Filed in Uncategorized | | Comments Off on A scholar’s pool of tears, Part 2: The pre in preprint means not done yet ‹ Older posts Search for: Recto and verso About Free Range Librarian Comment guidelines Writing: Clips & Samples You were saying… K.G. Schneider on I have measured out my life in Doodle polls Thomas Dowling on I have measured out my life in Doodle polls Chad on I have measured out my life in Doodle polls Dale McNeill on I have measured out my life in Doodle polls Walter Underwood on An Old-Skool Blog Post Recent Posts (Dis)Association I have measured out my life in Doodle polls Memento DMV An Old-Skool Blog Post Keeping Council Browse by month Browse by month Select Month May 2019 (1) April 2019 (1) March 2019 (2) January 2018 (1) November 2017 (1) August 2017 (1) April 2017 (1) March 2017 (1) January 2017 (1) November 2016 (1) September 2016 (1) June 2016 (1) March 2016 (3) January 2016 (2) September 2015 (1) August 2015 (1) July 2015 (1) April 2015 (1) March 2015 (1) January 2015 (1) October 2014 (1) September 2014 (1) August 2014 (1) June 2014 (1) April 2014 (1) February 2014 (1) January 2014 (1) December 2013 (2) October 2013 (1) August 2013 (1) July 2013 (1) June 2013 (2) April 2013 (2) March 2013 (4) February 2013 (2) January 2013 (2) December 2012 (2) November 2012 (1) September 2012 (1) August 2012 (2) July 2012 (2) June 2012 (2) May 2012 (4) April 2012 (3) March 2012 (5) February 2012 (3) January 2012 (5) December 2011 (1) November 2011 (1) October 2011 (1) September 2011 (1) August 2011 (1) July 2011 (1) June 2011 (2) May 2011 (1) April 2011 (1) March 2011 (1) February 2011 (4) January 2011 (2) December 2010 (2) November 2010 (2) September 2010 (6) August 2010 (2) July 2010 (4) June 2010 (4) May 2010 (3) April 2010 (6) March 2010 (3) February 2010 (2) January 2010 (5) December 2009 (6) November 2009 (4) October 2009 (7) September 2009 (9) August 2009 (4) July 2009 (5) June 2009 (6) May 2009 (6) April 2009 (8) March 2009 (6) February 2009 (9) January 2009 (20) December 2008 (11) November 2008 (16) October 2008 (11) September 2008 (7) August 2008 (8) July 2008 (10) June 2008 (15) May 2008 (12) April 2008 (14) March 2008 (15) February 2008 (9) January 2008 (15) December 2007 (17) November 2007 (30) October 2007 (21) September 2007 (23) August 2007 (34) July 2007 (41) June 2007 (34) May 2007 (34) April 2007 (28) March 2007 (15) February 2007 (12) January 2007 (11) December 2006 (9) November 2006 (20) October 2006 (21) September 2006 (21) August 2006 (25) July 2006 (24) June 2006 (26) May 2006 (30) April 2006 (31) March 2006 (32) February 2006 (45) January 2006 (37) December 2005 (25) November 2005 (27) October 2005 (18) September 2005 (26) August 2005 (22) July 2005 (47) June 2005 (25) May 2005 (31) April 2005 (41) March 2005 (44) February 2005 (33) January 2005 (37) December 2004 (35) November 2004 (26) October 2004 (14) September 2004 (9) August 2004 (26) July 2004 (5) June 2004 (34) May 2004 (22) April 2004 (31) March 2004 (22) February 2004 (29) January 2004 (34) December 2003 (27) November 2003 (36) July 2003 (3) Categories CategoriesSelect Category American Liberry Ass’n Annual Lists Another Library Blog Association Nerd Bad Entry Titles Best of FRL Blog Problems Blogging Blogging and Ethics Blogging and RSS BlogHer Blogs and Journalism Blogs Worth Reading Book Reviews Business 2.0 California Dreamin’ Car shopping Cats Who Blog CLA Shenanigans Conferences Congrunts Cooking creative nonfiction Cuba Customer Service Digital Divide Issues Digital Preservation ebooks Essays from the MP Ethics Evergreen ILS Family Values Five Minute Reviews Flickr Fun Flori-duh Friends FRL Blogroll Additions FRL Penalty Box FRL Spotlight Reviews Gardening Whatnots Gay Rights Gender and Librarianship Get a Grip Get Real! God’s Grammar Google Gormangate Hire Edukayshun Homebrewing Homosexual Agenda Hot Tech Intellectual Freedom Intellectual Property Ipukarea Katrina and Libraries Kudos and Woo-Hoos lastentries Leadership LGBT librarianship Librarian Wisdom Librarianship Library 2.0 Library Journal Librewians Lies damn lies Life Linkalicious LITA Councilor Memes MFA-O-Rama Military Life Movable Type Movie Reviews MPOW MPOW Wishlist Must-Read Blogs NASIG Paper Next Gen Catalog Online learning Onomies Open Access Open Data Open Source Software Our World People Sitings Podcasts Politics Postalicious Prayer Circle Product Reviews Reading Recipes Recto and Verso Regency Zombies Regular Issues Religion RSS-alicious Santa Rosa Living Search 4 Search Standards Schmandards tagging Talks and Tours Tallahassee Dining Tallahassee Living TANSTAAFL Test Entries The Big O This and That Top Tech Trends Travel Schmavel Treo Time Twitterprose Two Minutes Hate Uncategorized Upcoming gigs Uppity Wimmin Vast stupidity War No More WoGroFuBiCo Women WordPress Writing Writing for the Web Ye Olde Tech Tags ALA a mile down BACABI bush Castro CIL2008 cloud tests CNF creative nonfiction crowdvine david vann defragcon defragcon07 defrag07 defragcon defragcon07 defrag07 shootingonesownfoot defragcon defragcon2007 defrag07 Digital Preservation email environment essays flaming homophobia gay Gay Rights GLBT Harvey Milk Homebrew hybrid iasummit08 iasummit2008 idjits journals keating 5 LOCKSS mccain mea culpas mullets naked emperors obama ready fire aim San Francisco silly tags swift tag clouds tagging VALA-CAVAL WoGroFuBiCo Writing Scribbly stuff Log in Entries feed Comments feed WordPress.org © 2021 K.G. Schneider ¶ Thanks, WordPress. ¶ veryplaintxt theme by Scott Allan Wallick. ¶ It's nice XHTML & CSS.
futurearchives-blogspot-com-7858 ---- futureArch, or the future of archives... Monday, 5 September 2016 This blog is no longer being updated But you will find posts on some of our digital archives work here: http://blogs.bodleian.ox.ac.uk/archivesandmanuscripts/category/activity/digital-archives/ Posted by Susan Thomas at 17:33 No comments: Thursday, 31 October 2013 Born Digital: Guidance for Donors, Dealers, and Archival Repositories Today CLIR published a report which is designed to provide guidance on the acquisition of archives in a digital world. The report provides recommendations for donors and dealers, and for repository staff, based on the experiences of archivists and curators at ten repositories in the UK and US, including the Bodleian. You can read it here: http://www.clir.org/pubs/reports/pub159 Posted by Susan Thomas at 17:49 No comments: Labels: acquisitions, dealers, donors, guidance, scoping, sensitivity review, transfers Thursday, 31 January 2013 Digital Preservation: What I wish I knew before I started The Digital Preservation Coalition (DPC) and Archives and Records Association event ‘Digital Preservation: What I wish I knew before I started, 2013’ took place at Birkbeck College, London on 24 January 2013. A half-day conference, it brought together a group of leading specialists in the filed to discuss the challenges of digital collection. William Kilbride kicked off events with his presentation ‘What’s the problem with digital preservation’. He looked at the traditional -or in his words "bleak"- approach that is too often characterised by data loss. William suggested we need to create new approaches, such as understanding the actual potential and value of output; data loss is not the issue if there is no practical case for keeping or digitising material. Some key challenges facing digital archivists were also outlined and it was argued that impediments such as obsolescence issues and storage media failure are a problem bigger than one institution, and collaboration across the profession is paramount. Helen Hockx-Yu discussed how the British Library is collaborating with other institutions to archive websites of historical and cultural importance through the UK Web Archive. Interestingly, web archiving at the British Library is now a distinct business unit with a team of eight people. Like William, Helen also emphasised how useful it is to share experiences and work together, both internally and externally. Next, Dave Thompson, Digital Curator at the Wellcome Library stepped up with a lively presentation entitled ‘So You Want to go Digital’. For Dave, it is “not all glamour, metadata and preservation events”, which he illustrated with an example of his diary for the week. He then looked at the planning side of digital preservation, arguing that if digital preservation is going to work, not only are we required to be creative, but we need to be sure what we are doing is sustainable. Dave highlighted some key lessons from his career thus far: 1. We must be willing to embrace change 2. Data preservation is not solely an exercise in technology but requires engagement with data and consumers. 3. Little things we do everyday in the workplace are essential to efficient digital preservation, including backup, planning, IT infrastructure, maintenance and virus checking. 4. It needs to be easy to do and within our control, otherwise the end product is not preservation. 5. Continued training is essential so we can make the right decisions in appraisal, arrangement, context, description and preservation. 6. We must understand copyright access. Patricia Sleeman, Digital Archivist at University of London Computer Centre then highlighted a selection of practical skills that should underpin how we move forward with digital preservation. For instance, she stressed that information without context is meaningless and has little value without the appropriate metadata. Like the other speakers, she suggested planning is paramount, and before we start a project we must look forward and learn about how we will finish it. As such, project management is an essential tool, including the ability to understand budgets. Adrian Brown from the Parliamentary Archives continued with his presentation 'A Day in the Life of a Digital Archivist'. His talk was a real eye-opener on just how busy and varied the role is. A typical day for Adrian might involve talking to information owners about possible transfers, ingesting and cataloguing new records into the digital repository, web archiving, providing demos to various groups, drafting preservation policies and developing future requirements such as building software, software testing and preservation planning. No room to be bored here! Like Dave Thompson, Adrian noted that while there are more routine tasks such as answering emails and endless meetings, the rewards from being involved in a new and emerging discipline far outweigh the more mundane moments. We then heard from Simon Rooks from the BBC Multi-Media Archive who described the varied roles at his work (I think some of the audience were feeling quite envious here!). In keeping with the theme of the day, Simon reflected on his career path. Originally trained as a librarian, he argued that he would have benefited immensely as a digital archivist if he had learnt the key functions of an archivist’s role early on. He emphasised how the same archival principles (intake, appraisal and selection, cataloguing, access etc.) underpin our practices, whether records are paper or digital, and whether we are in archives or records management. These basic functions help to manage many of the issues concerning digital content. Simon added that the OAIS functional model is an approach that has encouraged multi-disciplinary team-work amongst those working at the BBC. After some coffee there followed a Q&A session, which proved lively and engaging. A lot of ground was covered including how appropriate it is to distinguish 'digital archivists' from 'archivists'. We also looked at issues of cost modelling and it was suggested that while we need to articulate budgets better, we should perhaps be less obsessed with costs and focus on the actual benefits and return of investment from projects. There was then some debate about what students should expect from undertaking the professional course. Most agreed that it is simply not enough to have the professional qualification, and continually acquiring new skill sets is essential. A highly enjoyable afternoon then, with some thought-provoking presentations, which were less about the techie side of digital preservation, and more a valuable lesson on the planning and strategies involved in managing digital assets. Communications, continued learning and project planning were central themes of the day, and importantly, that we should be seeking to build something that will have value and worth. Posted by Anonymous at 10:42 No comments: Tuesday, 13 November 2012 Transcribe at the arcHIVE I do worry from time to time that textual analogue records will come to suffer from their lack of searchability when compared with their born-digital peers. For those records that have been digitised, crowd-sourcing transcription could be an answer. A rather neat example of just that is the arcHIVE platform from the National Archives of Australia. arHIVE is a pilot from NAA's labs which allows anyone to contribute to the transcription of records. To get started they have chosen a selection of records from their Brisbane office which are 'known to be popular'. Not too many of them just yet, but at this stage I guess they're just trying to prove the concept works. All the items have been OCR-ed, and users can choose to improve or overwrite the results from the OCR process. There are lots of nice features here, including the ability to choose documents by a difficulty rating (easy, medium or hard) or by type (a description of the series by the looks of it). The competitive may be inspired by the presence of a leader board, while the more collaborative may appreciate the ability to do as much as you can, and leave the transcription for someone else to finish up later. You can register for access to some features, but you don't have to either. Very nice. Posted by Susan Thomas at 09:37 No comments: Labels: crowdsourcing, searchability, transcription Friday, 19 October 2012 Atlas of digital damages An Atlas of digital damage has been created on Flickr, which will provide a handy resource for illustrating where digital preservation has failed. Perhaps 'failed' is a little strong. In some cases the imperfection may be an acceptable trade off. A nice, and useful, idea. Contribute here. Posted by Susan Thomas at 17:48 No comments: Labels: corruption, damage Saturday, 13 October 2012 DayOfDigitalArchives 2012 Yesterday was Day of Digital Archives 2012! (And yes, I'm a little late posting...) This 'Day' was initiated last year to encourage those working with digital archives to use social media to raise awareness of digital archives: "By collectively documenting what we do, we will be answering questions like: What are digital archives? Who uses them? How are they created and managed? Why are they important?" . So in that spirit, here is a whizz through my week. Coincidentally not only does this week include the Day of Digital Archives but it's also the week that the Digital Preservation Coalition (or DPC) celebrated its 10th birthday. On Monday afternoon I went to the reception at the House of Lords to celebrate that landmark anniversary. A lovely event, during which the shortlist for the three digital preservation awards was announced. It's great to see three award categories this time around, including one that takes a longer view: 'the most outstanding contribution to digital preservation in the last decade'. That's quite an accolade. On the train journey home from the awards I found some quiet time to review a guidance document on the subject of acquiring born-digital materials. There is something about being on a train that puts my brain in the right mode for this kind of work. Nearing its final form, this guidance is the result of a collaboration between colleagues from a handful of archive repositories. The document will be out for further review before too long, and if we've been successful in our work it should prove helpful to creators, donors, dealers and repositories. Part of Tuesday I spent reviewing oral history guidance drafted by a colleague to support the efforts of Oxford Medical Alumni in recording interviews with significant figures in the world of Oxford medicine. Oral histories come to us in both analogue and digital formats these days, and we try to digitise the former as and when we can. The development of the guidance is in the context of our Saving Oxford Medicine initiative to capture important sources for the recent history of medicine in Oxford. One of the core activities of this initiative is survey work, and it is notable that many archives surveyed include plenty of digital material. Web archiving is another element of the 'capturing' work that the Saving Oxford Medicine team has been doing, and you can see what has been archived to-date via Archive-It, our web archiving service provider. Much of Wednesday morning was given over to a meeting of our building committee, which had very little to do with digital archives! In the afternoon, however, we were pleased to welcome visitors from MIT - Nancy McGovern and Kari Smith. I find visits like these are one of the most important ways of sharing information, experiences and know-how, and as always I got a lot out of it. I hope Nancy and Kari did too! That same afternoon, colleagues returned from a trip to London to collect another tranche of a personal archive. I'm not sure if this instalment contains much in the way of digital material, but previous ones have included hundreds of floppies and optical media, some zip discs and two hard disks. Also arriving on Wednesday, some digital Library records courtesy of our newly retired Executive Secretary; these supplement materials uploaded to BEAM (our digital archives repository) last week. On Thursday, I found some time to work with developer Carl Wilson on our SPRUCE-funded project. Becky Nielsen (our recent trainee, now studying at Glasgow) kicked off this short project with Carl, following on from her collaboration with Peter May at a SPRUCE mashup in Glasgow. I'm picking up some of the latter stages of testing and feedback work now Becky's started her studies. The development process has been an agile one with lots of chat and testing. I've found this very productive - it's motivating to see things evolving, and to be able to provide feedback early and often. For now you can see what's going on at github here, but this link will likely change once we settle on a name that's more useful than 'spruce-beam' (doesn't tell you much, does it?! Something to do with trees...) One of the primary aims of this tool is to facilitate collection analysis, so we know better what our holdings are in terms of format and content. We expect that it will be useful to others, and there will be more info. on it available soon. Friday was more SPRUCE work with Carl, among other things. Also a few meetings today - one around funding and service models for digital archiving, and a meeting of the Bodleian's eLegal Deposit Group (where my special interest is web archiving). The curious can read more about e-legal deposit at the DCMS website. One fun thing that came out of the day was that the Saving Oxford Medicine team decided to participate in a Women in Science wikipedia editathon. This will be hosted by the Radcliffe Science Library on 26 October as part of a series of 'Engage' events on social media organised by the Bodleian and the University's Computing Services. It's fascinating to contemplate how the range and content of Wikipedia articles change over time, something a web archive would facilitate perhaps. For more on working with digital archives, go take a look at the great posts at the Day of Digital Archives blog! Posted by Susan Thomas at 19:45 No comments: Labels: acquisition, collection analysis, DayofDigArc, DODA12, dpc, mashup, SPRUCE, webarchiving Friday, 8 June 2012 Sprucing up the TikaFileIdentifier As it's International Archives Day tomorrow, I thought it would be nice to quickly share some news of a project we are working on, which should help us (and others!) to carry out digital preservation work a little bit more efficiently. Following the SPRUCE mashup I attended in April, we are very pleased to be one of the organizations granted a SPRUCE Project funding award, which will allow us to 'spruce' up the TikaFileIdentifier tool. (Paul has written more about these funding awards on the OPF site.) TikaFileIdentifier is the tool which was developed at the mashup to address a problem several of us were having extracting metadata from batches of files, in our case within ISO images. Due to the nature of the mashup event the tool is still a bit rough around the edges, and this funding will allow us to improve on it. We aim to create a user interface and a simpler install process, and carry out performance improvements. Plus, if resources allow, we hope to scope some further functionality improvements. This is really great news, as with the improvements that this funding allows us to make, the TikaFileIdentifier will provide us with better metadata for our digital files more efficiently than our current system of manually checking each file in a disk image. Hopefully the simpler user interface and other improvements means that other repositories will want to make use of it as well; I certainly think it will be very useful! Posted by Rebecca Nielsen at 17:18 No comments: Labels: metadata, SPRUCE, TikaFileIdentifier Friday, 20 April 2012 SPRUCE Mashup: 16th-18th April 2012 Earlier this week I attended a 3 day mashup event in Glasgow, organised as part of the SPRUCE project. SPRUCE aims to enable Higher Education Institutions to address preservation gaps and articulate the business case of digital preservation, and the mashup serves as a way to bring practitioners and developers together to work on these problems. Practitioners took along a collection which they were having issues with, and were paired off with a developer who could work on a tool to provide a solution. Day 1 After some short presentations on the purpose of SPRUCE and the aims of the mashup, the practitioners presented some lightning talks on our collections and problems. These included dealing with email attachments, preserving content off Facebook, software emulation, black areas in scanned images, and identifying file formats with incorrect extensions, amongst others. I took along some disk images, as we find it very time-consuming to find out date ranges, file types and content of the files in the disk image, and we wanted a more efficient way to get this metadata. More information on the collections and issues presented can be found at the wiki. After a short break for coffee (and excellent cakes and biscuits) we were sorted into small groups of collection owners and developers to discuss our issues in more detail. In my group this led to conversations about natural language processing, and the possibilities of using predefined subjects to identify files as being about a particular topic, which we thought could be really helpful, but somewhat impossible to create in a couple of days! We were then allocated our developers. As there were a few of us with problems with file identification, we were assigned to the same developer, Peter May from the BL. The day ended with a short presentation from William Kilbride on the value of digital collections and Neil Beagrie's benefits framework. Day 2 The developers were packed off to another room to work on coding, while we collection owners started to look into the business case for digital preservation. We used Beagrie’s framework to consider the three dimensions of benefits (direct or indirect, near- or long-term, and internal or external), as they apply to our institutions. When we reported back, it was interesting to see how different organisations benefit in different ways. We also looked at various stakeholders and how important or influential they are to digital preservation. Write ups of these sessions are also available at the wiki. The developers came back at several points throughout the day to share their progress with us, and by lunchtime the first solution had been found! The first steps to solving our problem were being made; Peter had found a program, Apache Tika, which can parse a file and extract metadata (it can also identify the content type of files with incorrect extensions), and had written a script so that it could work through a directory of files, and output the information into a CSV spreadsheet. This was a really promising start, especially due to the amount of metadata that could potentially be extracted (provided it exists within the file), and the ability to identify file types with incorrect extensions. Day 3 We had another catch up with the developers and their overnight progress. Peter had written a script that took the information from the CSV file and summarised it into one row, so that it fits into the spreadsheets we use at BEAM. Unfortunately, mounting the ISO image to check it with Apache Tika was slightly more complicated than anticipated, so our disk images couldn't be checked this way without further work. While the developers set about finalizing their solutions, we continued to work on the business case, doing a skills gap analysis to consider whether our institutions had the skills and resources to carry out digital preservation. Reporting back, we had a very interesting discussion on skills gaps within the broader archives sector, and the need to provide digital preservation training to students as well as existing professionals. We then had to prepare an ‘elevator pitch’ for those occasions when we find ourselves in a lift with senior management, which neatly brought together all the things we had discussed, as we had to explain the specific benefits of digital preservation to our institution and our goals in about a minute. To wrap up the developers presented their solutions, which solved many of the problems we had arrived with. A last minute breakthrough in mounting ISO images using WinCDEmu and running scripts on them meant that we are able to use the Tika script on our disk images. However, because we were so short on time, there are still some small problems that need addressing. I'm really happy with our solution, and I was very impressed by all the developers and how much they were able to get done in such a short space of time. I felt that this event was a very useful way to get thinking about the business case for what we do, and to get to see what other people within the sector are doing and what problems they are facing. It was also really helpful as a non-techie to get to talk with developers and get an idea of what it is possible to build tools to do (and get them made!). I would definitely recommend this type of event – in fact, I’d love to go along again if I get the opportunity! Posted by Rebecca Nielsen at 15:52 2 comments: Monday, 26 March 2012 Media Recognition: DV part 3 DVCAM (encoding) Type: Digital videotape cassette encoding Introduced: 1996 Active: Yes, but few new camcorders are being produced. Cessation: - Capacity: 184 minutes (large), 40 minutes (MiniDV). Compatibility: DVCAM is an enhancement of the widely adopted DV format, and uses the same encoding. Cassettes recorded in DVCAM format can be played back in DVCAM VTRs (Video Tape Recorders), newer DV VTRs (made after the introduction of DVCAM), and DVCPRO VTRs, as long as the correct settings are specified (this resamples the signal to 4:1:1). DVCAM can also be played back in compatible HDV players. Users: Professional / Industrial. File Systems: - Common Manufacturers: Sony, Ikegami. DVCAM is Sony’s enhancement of the DV format for the professional market. DVCAM uses the same encoding as DV, although it records ‘locked’ rather than ‘unlocked’ audio. It also differs from DV as it has a track width of 15 microns and a tape speed of 28.215 mm/sec to make it more robust. Any DV cassette can contain DVCAM format video, but some are sold with DVCAM branding on them. Recognition DVCAM labelled cassettes come in large (125.1 x 78 x 14.6 mm) or MiniDV (66 x 48 x 12.2mm) sizes. Tape width is ¼”. Large cassettes are used in editing and recording decks, while the smaller cassettes are used in camcorders. They are marked with the DVCAM logo, usually in the upper-right hand corner. HDV (encoding) Type: Digital videotape cassette encoding Introduced: 2003 Active: Yes, although industry experts do not expect many new HDV products. Cessation: - Capacity: 1 hour (MiniDV), up to 4.5 hours (large) Compatibility: Video is recorded in the popular MPEG-2 video format. Files can be transferred to computers without loss of quality using an IEEE 1394 connection. There are two types of HDV, HDV 720p and HDV 1080, which are not cross-compatible. HDV can be played back in HDV VTRs. These are often able to support other formats such as DV and DVCAM. Users: Amateur/Professional File Systems: - Common Manufacturers: Format developed by JVC, Sony, Canon and Sharp. Unlike the other DV enhancements, HDV uses MPEG-2 compression rather than DV encoding. Any DV cassette can contain HDV format video, but some are sold with HDV branding on them. There are two different types of HDV: HDV 720p (HD1, made by JVC) and HDV 1080 (HD2, made by Sony and Canon). HDV 1080 devices are not generally compatible with HDV 720p devices. The type of HDV used is not always identified on the cassette itself, as it depends on the camcorder used rather than the cassette. Recognition HDV is a tape only format which can be recorded on normal DV cassettes. Some MiniDV cassettes with lower dropout rates are indicated as being for HDV, either with text or the HDV logo. These are not essential for recording HDV video. Posted by Rebecca Nielsen at 14:52 No comments: Labels: digital video, DVCAM, HDV, media recoginition, video Media Recognition: DV part 2 DV (encoding) Type: Digital videotape cassette encoding Introduced: 1995 Active: Yes, but tapeless formats such as MPEG-1, MPEG-2 and MPEG-4 are becoming more popular. Cessation: - Capacity: MiniDV cassettes can hold up to 80/120 minutes SP/LP. Medium cassette size can hold up to 3.0/4.6 hrs SP/LP. Files sizes can be up to 1GB per 4 minutes of recording. Compatibility: DV format is widely adopted. Cassettes recorded in the DV format can be played back on DVCAM, DVCPRO and HDV replay devices. However, LP recordings cannot be played back in these machines. Users: DV is aimed at a consumer market – may also be used by ‘prosumer’ film makers. File Systems: - Common Manufacturers: A consortium of over 60 manufacturers including Sony, Panasonic, JVC, Canon, and Sharp. DV has a track width of 10 microns and a tape speed of 18.81mm/sec. It can be found on any type of DV cassette, regardless of branding, although most commonly it is the format used on MiniDV cassettes. Recognition DV cassettes are usually found in the small size, known as MiniDV. Medium size (97.5 × 64.5 × 14.6 mm) DV cassettes are also available, although these are not as popular as MiniDV. DV cassettes are labelled with the DV logo. DVCPRO (encoding) Type: Digital videotape cassette encoding Introduced: 1995 (DVCPRO), 1997 (DVCPRO 50), 2000 (DVCPRO HD) Active: Yes, but few new camcorders are being produced. Cessation: - Capacity: 126 minutes (large), 66 minutes (medium). Compatibility: DVCPRO is an enhancement of the widely adopted DV format, and uses the same encoding. Cassettes recorded in DVCPRO format can be played back only in DVCPRO Video Tape Recorders (VTRs) and some DVCAM VTRs. Users: Professional / Industrial; designed for electronic news gathering File Systems: - Common Manufacturers: Panasonic, also Philips, Ikegami and Hitachi. DVCPRO is Panasonic’s enhancement of the DV format, which is aimed at a professional market. DVCPRO uses the same encoding as DV, but it features ‘locked’ audio, and uses 4:1:1 sampling instead of 4:2:0. It has an 18 micron track width, and a tape speed of 33.82 mm/sec which makes it more robust. DVCPRO uses Metal Particle (MP) tape rather than Metal Evaporate( ME) to improve durability. DVCPRO 50 and DVCPRO HD are further developments of DVCPRO, which use the equivalent of 2 or 4 DV codecs in parallel to increase the video data rate. Any DV cassette can contain DVCPRO format video, but some are sold with DVCPRO branding on them. Recognition DVCPRO branded cassettes come in medium (97.5 × 64.5 × 14.6mm) or large (125 × 78 × 14.6mm) cassette sizes. The medium size is for use in camcorders, and the large size in editing and recording decks. DVCPRO 50 and DVCPRO HD branded cassettes are extra-large cassettes (172 x 102 x 14.6mm). Tape width is ¼”. DVCPRO labelled cassettes have different coloured tape doors depending on their type; DVCPRO has a yellow tape door, DVCPRO50 has a blue tape door, and DVCPRO HD has a red tape door. Images of DVCPRO cassettes are available at the Panasonic website. Posted by Rebecca Nielsen at 14:31 No comments: Labels: digital video, DV, DVCPRO, media recoginition, video Media Recognition: DV part 1 DV can be used to refer to both a digital tape format, and a codec for digital video. DV tape usually carries video encoded with the DV codec, although it can hold any type of data. The DV format was developed in the mid 1990s by a consortium of video manufacturers, including Sony, JVC and Panasonic, and quickly became the de facto standard for home video production after introduction in 1995. Videos are recorded in .dv or .dif formats, or wrapped in an AVI, QuickTime or MXF container. These can be easily transferred to a computer with no loss of data over an IEEE 1394 (Fire Wire) connection. DV tape is ¼ inch (6.35mm) wide. DV cassettes come in four different sizes: Small, also known as MiniDV (66 x 48 x 12.2 mm), medium (97.5 × 64.5 × 14.6 mm), large (125.1 x 78 x 14.6 mm), and extra-large (172 x 102 x 14.6 mm). MiniDV is the most popular cassette size. DV cassettes can be encoded with one of four formats; DV, DVCAM, DVCPRO, or HDV. DV is the original encoding, and is used in consumer devices. DVCPRO and DVCAM were developed by Panasonic and Sony respectively as an enhancement of DV, and are aimed at a professional market. The basic encoding algorithm is the same as with DV, but a higher track width (18 and 15 microns versus DV’s 10 micron track width) and faster tape speed means that these formats are more robust and better suited to professional users. HDV is a high-definition variant, aimed at professionals and consumers, which uses MPEG-2 compression rather than the DV format. Depending on the recording device, any of the four DV encodings can be recorded on any size DV cassette. However, due to different recording speeds, the formats are not always backwards compatible. A cassette recorded in an enhanced format, such as HDV, DVCAM or DVCPRO, will not play back on a standard DV player. Also, as they are supported by different companies, there are some issues with playing back a DVCPRO cassette on DVCAM equipment, and vice versa. Although all DV cassette sizes can record any format of DV, some are marketed specifically as being of a certain type; e.g. DVCAM. The guide below looks at some of the most common varieties of DV cassette that might be encountered, and the encodings that may be used with them. It is important to remember that any type of encoding may be found on any kind of cassette, depending on what system the video was recorded on. MiniDV (cassette) Type: Digital videotape cassette Introduced: 1995 Active: Yes, but is being replaced in popularity by hard disk and flash memory recording. At the International Consumer Electronics Show 2011 no camcorders were presented which record on tape. Cessation: - Capacity: Up to 80 minutes SP / 120 minutes LP, depending on the tape used; 60/90 minutes SP/LP is standard. This can also depend on the encoding used (see further entries). Files sizes can be up to 1GB per 4 minutes of recording. Compatibility: DV file format is widely adopted. Requires Fire Wire (IEEE 1394) port for best transfer. Users: Consumer and ‘Prosumer’ film makers, some professionals. File Systems: - Common Manufacturers: A consortium of over 60 manufacturers including Sony, Panasonic, JVC, Canon, and Sharp MiniDV refers to the size of the cassette; as noted above, it can come with any encoding. As a consumer format they generally use DV encoding. DVCAM and HDV cassettes also come in MiniDV size. MiniDV is the most popular DV cassette, and is used for consumer and semi-professional (‘prosumer’) recordings due to its high quality. Recognition These cassettes are the small cassette size, measuring 66 x 48 x 12.2mm. Tape width is ¼”. They carry the MiniDV logo, as seen below: Posted by Rebecca Nielsen at 13:03 No comments: Labels: digital video, DV, media recoginition, MiniDV, video Monday, 30 January 2012 Digital Preservation: What I Wish I Knew Before I Started Tuesday 24th January, 2012 Last week I attended a student conference, hosted by the Digital Preservation Coalition, on what digital preservation professionals wished they had known before they started. The event covered a great deal of the challenges faced by those involved in digital preservation, and the skills required to deal with these challenges. The similarities between traditional archiving and digital preservation were highlighted at the beginning of the afternoon, when Sarah Higgins translated terms from the OAIS model into more traditional ‘archive speak’. Dave Thompson also emphasized this connection, arguing that digital data “is just a new kind of paper”, and that trained archivists already have 85-90% of the skills needed for digital preservation. Digital preservation was shown to be a human rather than a technical challenge. Adrian Brown argued that much of the preservation process (the "boring stuff") can be automated. Dave Thompson stated that many of the technical issues of digital preservation, such as migration, have been solved, and that the challenge we now face is to retain the context and significance of the data. The point made throughout the afternoon was that you don’t need to be a computer expert in order to carry out effective digital preservation. The urgency of intervention was another key lesson for the afternoon. As William Kilbride put it; digital preservation won’t do itself, won’t go away, and we shouldn't wait for perfection before we begin to act. Access to data in the future is not guaranteed without input now, and digital data is particularly intolerant to gaps in preservation. Andrew Fetherstone added to this argument, noting that doing something is (usually) better than doing nothing, and that even if you are not in a position to carry out the whole preservation process, it is better to follow the guidelines as far as you can, rather than wait and create a backlog. The scale of digital preservation was another point illustrated throughout the afternoon. William Kilbride suggested that the days of manual processing are over, due to the sheer amount of digital data being created (estimated to reach 35ZB by 2020!). He argued that the ability to process this data is more important to the future of digital preservation than the risks of obsolescence. The impossibility of preserving all of this data was illustrated by Helen Hockx-Yu, who offered the statistic the the UK Web Archive and National Archives Web Archive combined have archived less than 1% of UK websites. Adrian Brown also pointed out that as we move towards dynamic, individualised content on the web, we must decide exactly what the information is that we are trying to preserve. During the Q&A session, it was argued that the scale of digital data means that we have to accept that we can’t preserve everything, that not everything needs to be preserved, and that there will be data loss. The importance of collaboration was another theme which was repeated by many speakers. Collaboration between institutions on a local, national and even international level was encouraged, as by sharing solutions to problems and implementing common standards we can make the task of digital preservation easier. This is only a selection of the points covered in a very engaging afternoon of discussion. Overall, the event showed that, despite the scale of the task, digital preservation needn't be a frightening prospect, as archivists already have many of the necessary skills. The DPC have uploaded the slides used during the event, and the event was also live-tweeted, using the hashtag #dpc_wiwik, if you are interested in finding out more. Posted by Rebecca Nielsen at 09:41 1 comment: Labels: http://www.blogger.com/img/blank.gif Tuesday, 18 October 2011 What is ‘The Future of the Past of the Web’? ‘The Future of the Past of the Web’, Digital Preservation Coalition Workshop British Library, 7 October 2011 Chrissie Webb and Liz McCarthy In his keynote address to this event – organised by the Digital Preservation Coalition , the Joint Information Systems Committee and the British Library – Herbert van der Sompel described the purpose of web archiving as combating the internet’s ‘perpetual now’. Stressing the importance to researchers of establishing the ‘temporal context’ of publications and information, he explained how the framework of his Memento Project uses a ‘ timegate’ implemented via web plugins to show what a resource was like at a particular date in the past. There is a danger, however, that not enough is being archived to provide the temporal context; for instance, although DOIs provide stable documents, the resources they link to may disappear (‘link rot’). The Memento Project Firefox plugin uses a sliding timeline (here, just below the Google search box) to let users choose an archived date A session on using web archives picked up on the theme of web continuity in a presentation by The National Archives on the UK Government Web Archive, where a redirection solution using open source software helps tackle the problems that occur when content is moved or removed and broken links result. Current projects are looking at secure web archiving, capturing internal (e.g. intranet) sources, social media capture and a semantic search tool that helps to tag ‘unstructured’ material. In a presentation that reinforced the reason for the day’s ‘use and impact’ theme, Eric Meyer of the Oxford Internet Institute wondered whether web archives were in danger of becoming the ‘dusty archives’ of the future, contrasting their lack of use with the mass digitisation of older records to make them accessible. Is this due to a lack of engagement with researchers, their lack of confidence with the material or the lingering feeling that a URL is not a ‘real’ source? Archivists need to interrupt the momentum of ‘learned’ academic behaviour, engaging researchers with new online material and developing archival resources in ways that are relevant to real research – for instance, by helping set up mechanisms for researchers to trigger archiving activity around events or interests, or making more use of server logs to help them understand use of content and web traffic. One of the themes of the second session on emerging trends was the shift from a ‘page by page’ approach to the concept of ‘data mining’ and large scale data analysis. Some of the work being done in this area is key to addressing the concerns of Eric Meyer’s presentation; it has meant working with researchers to determine what kinds and sources of data they could really use in their work. Representatives of the UK Web Archive and the Internet Archive described their innovations in this field, including visualisation and interactive tools. Archiving social networks was also a major theme, and Wim Peters outlined the challenges of the ARCOMEM project, a collaboration between Sheffield and Hanover Universities that is tackling the problems of archiving ‘community memory’ through the social web, confronting extremely diverse and volatile content of varying quality for which future demand is uncertain. Richard Davis of the University of London Computer Centre spoke about the BlogForever project, a multi-partner initiative to preserve blogs, while Mark Williamson of Hanzo Archives spoke about web archiving from a commercial perspective, noting that companies are very interested in preserving the research opportunities online information offers. The final panel session raised the issue of the changing face of the internet, as blogs replace personal websites and social media rather than discrete pages are used to create records of events. The notion of ‘web pages’ may eventually disappear, and web archivists must be prepared to manage the dispersed data that will take (and is taking) their place. Other points discussed included the need for advocacy and better articulation of the demand for web archiving (proposed campaign: ‘Preserve!: Are you saving your digital stuff?’), duplication and deduplication of content, the use of automated selection for archiving and the question of standards. Posted by lizrosemccarthy at 13:40 No comments: Labels: Future of the Past of the Web, webarchives, workshop Older Posts Home Subscribe to: Posts (Atom) What's the futureArch blog? A place for sharing items of interest to those curating hybrid archives & manuscripts. Legacy computer bits wanted! At Bodleian Electronic Archives and Manuscripts (BEAM) we are always on the lookout for older computers, disk drives, technical manuals and software that can help us recover digital archives. If you have any such stuff that you would be willing to donate, please contact susan.thomas@bodleian.ox.ac.uk. Examples of items in our wish list include: an Apple Mac Macintosh Classic II Computer, a Wang PC 200/300 series, as well as myriad legacy operating system and word-processing software. Handy links Bodleian Electronic Archives & Manuscripts (BEAM) Bodleian Library Digital Preservation Coalition Oxford University Label Cloud 4n6umd (1) access (1) accession (1) accessioning (2) adapter (1) advisory board (2) agents (1) agrippa (1) Amatino Manucci (1) analysis (1) appraisal (1) arch enemy (1) archival dates (1) archival interfaces (7) archiving habits (1) ATA (1) audio (2) authority control (2) autogenerated metadata (3) autumn (1) BBC (2) BEAM architecture (1) blu-ray (1) buzz (1) cais (1) case studies (3) cd (3) cerp (1) chat (1) community (1) content model (2) copyright review (1) corruption (2) creator curation (1) cunning plan (1) D-Link (1) DAMS (1) data capture (5) data extraction (4) data recovery (5) dead media (1) Desktop (1) development (1) DGE-530T (1) digital archaeology (4) digital legacy (1) digital preservation (6) digitallivesconference (1) disk imaging (3) disks (1) documents (3) dundee (2) DVD (2) eac (1) ead (1) electronic records (1) email (5) emcap (1) emulation (1) emulators (1) eSATA (1) estate planning (1) etdf (1) facebook (1) faceted browser (1) file carving (1) file format recognition (2) file format specifications (1) file signatures (1) film (1) finding aids (1) FireWire (2) flash media (2) floppy disks (5) forensics (2) formats (1) friday post (1) funny (1) futureArch (1) gaip (1) geocities (1) Gigabit (1) gmail (1) google (1) googledocs (1) graduate traineeship (1) hard drive (5) highslide (1) holidays (1) hybrid archives (1) hybridity (1) hypertext exhibitions writers (1) images (1) indexing (1) ingest (2) interfaces (11) interoperability (2) intrallect (1) ipaper (1) ipr (1) iPres2008 (1) IPs (1) island of unscalable complexity (1) iso8601 (1) java (2) javascript (1) jif08 (1) JISC (1) job (1) kryoflux (1) lightboxes (1) linked data (1) literary (1) markup (2) may 2010 (1) media (2) media recoginition (14) metadata (4) microsoft (1) Microsoft Works (1) migration tools (4) moon landings (1) multitouch (1) music blogs (1) namespaces (1) never say never (1) normalisation (1) object characteristics (1) obsolescence (1) odd (1) office documents (2) online data stores (1) open source (5) open source development (2) open source software (2) optical media (4) osswatch (1) PCI (1) planets (2) planets testbed (1) plato (1) preservation planning (1) preservation policy (2) preservation tools (5) projects (2) pst (2) repositories (1) researchers (3) saa2009 (1) SAS (1) SATA (1) scat (1) scholars (1) scooters (1) scribd (1) SCSI (1) semantic (1) seminars (1) significant properties (1) snow (1) software (4) solr (1) sound (1) steganography (1) storage (1) tag clouds (1) tags (1) technical metadata (1) transfer bagit verify (1) twapperkeeper (1) tweets (1) USB (2) use cases (1) users (2) validation (1) value (1) video (6) vintage computers (2) weavers (1) webarchives (4) workshop (2) xena (1) xml (3) xmp (1) zip disks (1) Blog Archive ▼ 2016 (1) ▼ September (1) This blog is no longer being updated ► 2013 (2) ► October (1) ► January (1) ► 2012 (9) ► November (1) ► October (2) ► June (1) ► April (1) ► March (3) ► January (1) ► 2011 (16) ► October (2) ► September (1) ► August (2) ► July (1) ► May (1) ► April (4) ► March (3) ► February (1) ► January (1) ► 2010 (42) ► December (1) ► November (2) ► September (4) ► August (4) ► July (3) ► June (4) ► May (1) ► April (5) ► March (13) ► February (3) ► January (2) ► 2009 (51) ► December (4) ► November (3) ► October (2) ► September (2) ► August (5) ► July (6) ► June (5) ► May (6) ► April (5) ► March (1) ► February (6) ► January (6) ► 2008 (10) ► November (1) ► October (3) ► September (1) ► August (1) ► July (4) Subscribe To futureArch Posts Atom Posts All Comments Atom All Comments beamtweet Loading... My Blog List The Signal: Digital Preservation Passing the Mic to Our Audience: User Personas and Strategic Planning for the Sustainability of Digital Formats Website ArchivesBlogs Meet Ike Digital Archiving at the University of York Latest Booking System in Google Sheets (WORKING!) ArchivesNext Now available: “A Very Correct Idea of Our School”: A Photographic History of the Carlisle Indian Industrial School Practical E-Records Hello world! born digital archives Practical First Steps mgolson@stanford.edu's blog KEEP - Keeping Emulation Environments Portable Digital Curation Blog Thoughts before "The Future of the Past of the Web" Archives Hub Blog Open Planets Foundation UK Web Archive Technology Watch Digital Lives Bits Bytes & Archives branker's blog DPC RSS News Feed Loading... About Me Susan Thomas View my complete profile
futurearchives-blogspot-com-8446 ---- futureArch, or the future of archives... futureArch, or the future of archives... A place for thoughts on hybrid archives and manuscripts at the Bodleian Library. This blog is no longer being updated Born Digital: Guidance for Donors, Dealers, and Archival Repositories Digital Preservation: What I wish I knew before I started Transcribe at the arcHIVE Atlas of digital damages DayOfDigitalArchives 2012 Sprucing up the TikaFileIdentifier SPRUCE Mashup: 16th-18th April 2012 Media Recognition: DV part 3 Media Recognition: DV part 2 Media Recognition: DV part 1 Digital Preservation: What I Wish I Knew Before I Started What is ‘The Future of the Past of the Web’? Day of Digital Archives, 2011 Another source for old software Comparing software tools Mobile forensics Preserving born-digital video - what are good practices? Hidden Pages Media recognition - Floppy Disks part 3 Preserving Digital Sound and Vision: A Briefing 8th April 2011 Sharp font writer files Got any older? World backup day 2011 Advisory Board Meeting, 18 March 2011
galencharlton-com-3582 ---- Meta Interchange Meta Interchange Libraries, computing, metadata, and more Trading for images Let’s search a Koha catalog for something that isn’t at all controversial: What you search for in a library catalog ought to be only between... Entering 2019 A very brief post to start the new year. I’m not inclined to make elaborate resolutions for the new year other than being very firm... Data cleanup as a force for evil A quotidian concern of anybody responsible for a database is the messy data it contains. See a record about a Pedro González? Bah, the assumption of... On being wrong, wrong, wrong Yesterday I gave a lightning talk at the Evergreen conference on being wrong. Appropriately, I started out the talk on the wrong foot. I intended... Fostering a habit of nondisclosure It almost doesn’t need to be said that old-fashioned library checkout cards were terrible for patron privacy. Want to know who had checked out a... Scaling the annual Code4Lib conference One of the beautiful things about Code4Lib qua banner is that it can be easily taken up by anyway without asking permission. If I wanted... Amelia, 2000-2017 Last year, I wrote about the blossoming of the Mellie-cat, and closed with this line: “Sixteen years is not long enough to get to know... Mashcat at ALA Annual 2017 + shared notes I’m leaving for Chicago tomorrow to attend ALA Annual 2017 (and to eat some real pizza), and while going over the schedule I found some... What makes an anti-librarian? Assuming the order gets made and shipped in time (update 2017-06-22: it did), I’ll be arriving in Chicago for ALA Annual carrying a few tens... IMLS support for free and open source software The Institute of Museum and Library Services is the U.S. government’s primary vehicle for direct federal support of libraries, museums, and archives across the entire...
galencharlton-com-609 ---- Meta Interchange – Libraries, computing, metadata, and more Skip to content Meta Interchange Libraries, computing, metadata, and more Search for Submit Primary Menu About Comment policy Privacy Policy Search for Submit Trading for images Posted: 23 February 2020 Categories: Libraries, Patron Privacy Let’s search a Koha catalog for something that isn’t at all controversial: What you search for in a library catalog ought to be only between you and the library — and that, only briefly, as the library should quickly forget. Of course, between “ought” and “is” lies the Devil and his details. Let’s poke around with Chrome’s DevTools: Hit Control-Shift-I (on Windows) Switch to the Network tab. Hit Control-R to reload the page and get a list of the HTTP requests that the browser makes. We get something like this: There’s a lot to like here: every request was made using HTTPS rather than HTTP, and almost all of the requests were made to the Koha server. (If you can’t trust the library catalog, who can you trust? Well… that doesn’t have an answer as clear as we would like, but I won’t tackle that question here.) However, the two cover images on the result’s page come from Amazon: https://images-na.ssl-images-amazon.com/images/P/0974458902.01.TZZZZZZZ.jpg https://images-na.ssl-images-amazon.com/images/P/1849350949.01.TZZZZZZZ.jpg What did I trade in exchange for those two cover images? Let’s click on the request on and see: :authority: images-na.ssl-images-amazon.com :method: GET :path: /images/P/0974458902.01.TZZZZZZZ.jpg :scheme: https accept: image/webp,image/apng,image/,/*;q=0.8 accept-encoding: gzip, deflate, br accept-language: en-US,en;q=0.9 cache-control: no-cache dnt: 1 pragma: no-cache referer: https://catalog.libraryguardians.com/cgi-bin/koha/opac-search.pl?q=anarchist sec-fetch-dest: image sec-fetch-mode: no-cors sec-fetch-site: cross-site user-agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/80.0.3987.116 Safari/537.36 Here’s what was sent when I used Firefox: Host: images-na.ssl-images-amazon.com User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:73.0) Gecko/20100101 Firefox/73.0 Accept: image/webp,/ Accept-Language: en-US,en;q=0.5 Accept-Encoding: gzip, deflate, br Connection: keep-alive Referer: https://catalog.libraryguardians.com/cgi-bin/koha/opac-search.pl?q=anarchist DNT: 1 Pragma: no-cache Amazon also knows what my IP address is. With that, it doesn’t take much to figure out that I am in Georgia and am clearly up to no good; after all, one look at the Referer header tells all. Let’s switch over to using Google Book’s cover images: https://books.google.com/books/content?id=phzFwAEACAAJ&printsec=frontcover&img=1&zoom=5 https://books.google.com/books/content?id=wdgrJQAACAAJ&printsec=frontcover&img=1&zoom=5 This time, the request headers are in Chrome: :authority: books.google.com :method: GET :path: /books/content?id=phzFwAEACAAJ&printsec=frontcover&img=1&zoom=5 :scheme: https accept: image/webp,image/apng,image/,/*;q=0.8 accept-encoding: gzip, deflate, br accept-language: en-US,en;q=0.9 cache-control: no-cache dnt: 1 pragma: no-cache referer: https://catalog.libraryguardians.com/ sec-fetch-dest: image sec-fetch-mode: no-cors sec-fetch-site: cross-site user-agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/80.0.3987.116 Safari/537.36 x-client-data: CKO1yQEIiLbJAQimtskBCMG2yQEIqZ3KAQi3qsoBCMuuygEIz6/KAQi8sMoBCJe1ygEI7bXKAQiNusoBGKukygEYvrrKAQ== and in Firefox: Host: books.google.com User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:73.0) Gecko/20100101 Firefox/73.0 Accept: image/webp,/ Accept-Language: en-US,en;q=0.5 Accept-Encoding: gzip, deflate, br Connection: keep-alive Referer: https://catalog.libraryguardians.com/ DNT: 1 Pragma: no-cache Cache-Control: no-cache On the one hand… the Referer now contains only the base URL of the catalog. I believe this is due to a difference in how Koha figures out the correct image URL. When using Amazon for cover images, the ISBN of the title is normalized and used to construct a URL for an ![]()
tag. Koha doesn’t currently set a Referrer-Policy, so the default of no-referrer-when-downgrade is used and the full referrer is sent. Google Book’s cover image URLs cannot be directly constructed like that, so a bit of JavaScript queries a web service and gets back the image URLs, and for reasons that are unclear to me at the moment, doesn’t send the full URL as the referrer. (Cover images from OpenLibrary are fetched in a similar way, but full Referer header is sent.) As a side note, the x-client-data header sent by Chrome to books.google.com is… concerning. There are some relatively simple things that can be done to limit leaking the full referring URL to the likes of Google and Amazon, including Setting the Referrer-Policy header via web server configuration or meta tag to something like origin or origin-when-cross-origin. Setting referrerpolicy for