Added two mposts on ia and fsf

4 files changed, 51 insertions, 0 deletions

diff --git a/microposts/fsf-membership.md b/microposts/fsf-membership.md
new file mode 100644
index 0000000..a468300
--- /dev/null
+++ b/microposts/fsf-membership.md
@@ -0,0 +1,16 @@
+---
+date: 2020-08-02
+---
+
+I am a proud associate member of Free Software Freedom. For me the
+philosophy of Free Software is about ensuring the enrichment of a
+digital commons, so that knowledge and information are not
+concentrated in the hands of selected privileged people and locked up
+as "intellectual property". The genius of copyleft licenses like GNU
+(A)GPL ensures software released for the public, remains public. Open
+source does not care about that.
+
+If you also care about the public good, the hacker ethics, or the
+spirit of the web, please take a moment to consider joining FSF as an
+associate member. It comes with [numerous perks and
+benefits](https://www.fsf.org/associate/benefits).
\ No newline at end of file
diff --git a/microposts/fsf-membership.md~ b/microposts/fsf-membership.md~
new file mode 100644
index 0000000..614fd31
--- /dev/null
+++ b/microposts/fsf-membership.md~
@@ -0,0 +1,9 @@
+---
+date: 2020-08-02
+---
+
+The four big publishers Hachette, HarperCollins, Wiley, and Penguin Random House are still pursuing Internet Archive.
+
+> [Their] lawsuit does not stop at seeking to end the practice of Controlled Digital Lending. These publishers call for the destruction of the 1.5 million digital books that Internet Archive makes available to our patrons. This form of digital book burning is unprecedented and unfairly disadvantages people with print disabilities. For the blind, ebooks are a lifeline, yet less than one in ten exists in accessible formats. Since 2010, Internet Archive has made our lending library available to the blind and print disabled community, in addition to sighted users. If the publishers are successful with their lawsuit, more than a million of those books would be deleted from the Internet’s digital shelves forever.
+
+- [Libraries lend books, and must continue to lend books: Internet Archive responds to publishers’ lawsuit](https://blog.archive.org/2020/07/29/internet-archive-responds-to-publishers-lawsuit/)
\ No newline at end of file
diff --git a/microposts/ia-lawsuit.md b/microposts/ia-lawsuit.md
new file mode 100644
index 0000000..614fd31
--- /dev/null
+++ b/microposts/ia-lawsuit.md
@@ -0,0 +1,9 @@
+---
+date: 2020-08-02
+---
+
+The four big publishers Hachette, HarperCollins, Wiley, and Penguin Random House are still pursuing Internet Archive.
+
+> [Their] lawsuit does not stop at seeking to end the practice of Controlled Digital Lending. These publishers call for the destruction of the 1.5 million digital books that Internet Archive makes available to our patrons. This form of digital book burning is unprecedented and unfairly disadvantages people with print disabilities. For the blind, ebooks are a lifeline, yet less than one in ten exists in accessible formats. Since 2010, Internet Archive has made our lending library available to the blind and print disabled community, in addition to sighted users. If the publishers are successful with their lawsuit, more than a million of those books would be deleted from the Internet’s digital shelves forever.
+
+- [Libraries lend books, and must continue to lend books: Internet Archive responds to publishers’ lawsuit](https://blog.archive.org/2020/07/29/internet-archive-responds-to-publishers-lawsuit/)
\ No newline at end of file
diff --git a/microposts/ia-lawsuit.md~ b/microposts/ia-lawsuit.md~
new file mode 100644
index 0000000..e3e0f9c
--- /dev/null
+++ b/microposts/ia-lawsuit.md~
@@ -0,0 +1,17 @@
+---
+date: 2018-06-04
+---
+
+The [Boyer-Moore algorithm for finding the majority of a sequence of elements](https://en.wikipedia.org/wiki/Boyer–Moore_majority_vote_algorithm) falls in the category of "very clever algorithms".
+
+    int majorityElement(vector<int>& xs) {
+        int count = 0;
+        int maj = xs[0];
+        for (auto x : xs) {
+            if (x == maj) count++;
+            else if (count == 0) maj = x;
+            else count--;
+        }
+        return maj;
+    }
+