Merge pull request #1 from papers-we-love/master

Pulling from base

CODE_OF_CONDUCT.md

@@ -1,11 +1,29 @@
-Papers We Love meet-ups are for anyone insterested in Computer Science, Computer Engineering and its history to discuss academic research in a fun, engaging and respectful environment. 
+# Code of Conduct
 
-We value the participation of each member of the community and want all attendees to have an enjoyable and fulfilling experience. Accordingly, all attendees are expected to show respect and courtesy to other attendees throughout the meet-up and at all Papers We Love events and interactions on the GitHub repository and Meetup site(s).
+> Local chapters should fork this document and modify to meet the needs of their communities.
 
-To make clear what is expected, all attendees, speakers, exhibitors, organizers, contributors and volunteers are required to conform to the following Code of Conduct. Organizers will enforce this code of conduct.
+All attendees, speakers, exhibitors, organizers, contributors and volunteers are required to conform to the following Code of Conduct.
 
-The Short Version
------------------
+Papers We Love events are for anyone interested in Computer Science/Computer Engineering, its history, and related fields to discuss academic research in a fun, engaging and respectful environment.
+
+**Be an adult, don't be a jerk.**
+
+We value the participation of each member of the community and want all attendees to have an enjoyable and fulfilling experience. Accordingly, all attendees are expected to show respect and courtesy to other attendees throughout the meet-ups and at all Papers We Love events and interactions on the GitHub repository.
+
+Need help?
+----------
+
+If you are experiencing harassment on or have concerns about content within the [GitHub repo](https://github.com/papers-we-love/papers-we-love), the **#paperswelove** IRC channel on Freenode, or [PapersWeLove.org](http://paperswelove.org) please contact:
+
+- **Zeeshan Lakhani** zeeshan.lakhani@gmail.com
+- **Clint Newsom** hcnewsom@gmail.com
+- **Jeremy Heiler** (Github) jeremyheiler@gmail.com
+- **Darren Newton** (paperswelove.org) info@v25media.com
+
+The organizers of your local Papers We Love meet-up/event are available to help you with any issues or concerns at live events.
+
+What it means
+-------------
 
 Papers We Love is dedicated to providing a harassment-free experience for everyone, regardless of gender, sexual orientation, disability, physical appearance, body size, race, or religion. We do not tolerate harassment of meet-up participants in any form.
 
@@ -17,44 +35,22 @@ Attendees violating these rules may be asked to leave the meet-up at the sole di
 
 Thank you for helping make this a welcoming, friendly event for all.
 
-The Longer Version
-------------------
+Spelling it out
+---------------
 
 Harassment includes offensive verbal comments related to gender, sexual orientation, disability, physical appearance, body size, race, religion, sexual images in public spaces, deliberate intimidation, stalking, following, harassing photography or recording, sustained disruption of talks or other events, inappropriate physical contact, and unwelcome sexual attention.
 
 Participants asked to stop any harassing behavior are expected to comply immediately.
 
-Contributors to the GitHub repository and the Meetup site, sponsors, or similar are also subject to the anti-harassment policy. Organizers (including volunteers) should not use sexualized clothing/uniforms/costumes, or otherwise create a sexualized environment.
+Contributors to the GitHub repository, the Meetup and/or event-related sites, sponsors, or similar are also subject to the anti-harassment policy. Organizers (including volunteers) should not use sexualized clothing/uniforms/costumes, or otherwise create a sexualized environment..
 
-Be careful in the words that you choose. Remember that sexist, racist, and other exclusionary jokes can be offensive to those around you. Excessive swearing and offensive jokes are not appropriate for Papers We Love.
+Local Chapters
+--------------
 
-If a participant engages in behavior that violates this code of conduct, the meet-up organizers may take any action they deem appropriate, including warning the offender or expulsion from the meet-up.
+As noted above, local chapters are encouraged to fork and modify the Code of Conduct to best meet the needs of their communities. Some available sources:
 
-Social Rules
-------------
+- [Geek Feminism](http://geekfeminism.org/about/code-of-conduct/)
+- [JS Conf EU](http://2014.jsconf.eu/code-of-conduct.html)
+- [Pycon](https://github.com/python/pycon-code-of-conduct/blob/master/code_of_conduct.md)
+- [Hacker School's Social Rules](https://www.hackerschool.com/manual#sub-sec-social-rules)
 
-In addition to having a code of conduct as an anti-harassment policy, we have a small set of [social rules](https://www.hackerschool.com/manual#sub-sec-social-rules) we follow. We (the Papers We Love organizers) learned and lifted these rules from [!!Con](http://bangbangcon.com/conduct.html), who in turn got them from [Hacker School](https://www.hackerschool.com/), where we felt that they contributed enormously to a supportive, productive, and fun learning environment. We'd like Papers We Love to share that environment. These rules are intended to be lightweight, and to make more explicit certain social norms that are normally implicit. Most of our social rules really boil down to “don't be a jerk“ or “don't be annoying.” Of course, almost nobody sets out to be a jerk or annoying, so telling people not to be jerks isn't a very productive strategy.
-
-Unlike the anti-harassment policy, violation of the social rules will not result in expulsion from the meet up or a strong warning from conference organizers. Rather, they are designed to provide some lightweight social structure for conference attendees to use when interacting with each other.
-
-**[The social rules.](https://www.hackerschool.com/manual#sub-sec-social-rules)**
-
-If you have any questions about any part of the code of conduct or social rules, please feel free to reach out to any of the Papers We Love organizers in your area.
-
-Contact Information
--------------------
-
-If you are being harassed, notice that someone else is being harassed, or have any other concerns, please contact a member of Papers We Love.
-
-If the matter is especially urgent, please contact any of these individuals:
-
-- Zeeshan Lakhani zeeshan.lakhani@gmail.com
-- Clint Newsom hcnewsom@gmail.com
-
-
-License
--------
-
-This Code of Conduct was forked from the example policy from the [Geek Feminism wiki, created by the Ada Initiative and other volunteers.](http://geekfeminism.wikia.com/wiki/meet-up_anti-harassment/Policy) which is under a Creative Commons Zero license.
-
-Portions were also taken from the [!!Con](http://bangbangcon.com/conduct.html) code of conduct and the [Hacker School](https://www.hackerschool.com/) social rules.

README.md

@@ -1,27 +1,56 @@
-## Papers We Love
+## ![Papers We Love](http://papers-we-love.github.io/images/logo-top.svg)
 
-Repository related to the following meetups:
+**Papers We Love** is a community built around reading, discussing and learning more about academic computer science papers. This repository serves as a directory of some of the best papers the community can find, bringing together documents scattered across the web.
 
-* [NYC - Papers We Love](http://www.meetup.com/papers-we-love/)
-* [SF - Papers We Love too](http://www.meetup.com/papers-we-love-too/)
-* [London - Papers We Love](http://www.meetup.com/papers-we-love-london)
-* [Saint Louis - Papers We Love](http://www.meetup.com/Papers-We-Love-in-saint-louis/)
-* [Colorado - Papers We Love](http://www.meetup.com/Papers-We-Love-Boulder/)
-* [Ohio - Papers We Love](http://www.meetup.com/Papers-We-Love-Columbus/)
+Due to [licenses](https://github.com/papers-we-love/papers-we-love#respect-content-licenses) we cannot always host the papers themselves (when we do, you will see a :scroll: emoji next to its title in the directory README) but we can provide links to their locations.
 
-Let us know if you are interested in starting a [chapter](https://github.com/papers-we-love/papers-we-love/wiki/Creating-a-PWL-chapter)!
+If you enjoy the papers, perhaps stop by a local chapter meetup and join in on the vibrant discussions around them.
+
+### Chapters
+
+Here are our official chapters. Let us know if you are interested in [starting one](https://github.com/papers-we-love/papers-we-love/wiki/Creating-a-PWL-chapter) in your city!
+
+* [New York City](http://www.meetup.com/papers-we-love/)
+* [San Francisco](http://www.meetup.com/papers-we-love-too/) || [Meetup list](https://github.com/papers-we-love/papers-we-love/tree/master/_meetups/SanFrancisco)
+* [Chicago](http://www.meetup.com/Papers-We-Love-Chicago)
+* [London](http://www.meetup.com/papers-we-love-london)
+* [Colorado](http://papersweloveco.org)
+* [Ohio](http://www.meetup.com/Papers-We-Love-Columbus/)
+* [Berlin](http://www.meetup.com/Papers-We-Love-Berlin/)
+* [Pune](http://www.meetup.com/Doo-Things)
+* [Boston](http://www.meetup.com/Papers-We-Love-Boston/)
+* [St. Louis](http://www.meetup.com/Papers-We-Love-in-saint-louis/)
+* [Singapore](https://www.facebook.com/groups/paperswelovesg/)
+* [Bangalore](http://www.meetup.com/Papers-we-love-Bangalore/)
+* [Washington, DC](http://www.meetup.com/Papers-We-Love-DC/)
+* [Montreal](http://www.meetup.com/Papers-We-Love-Montreal/)
+* [Seattle](http://www.meetup.com/Papers-We-Love-Seattle/)
+* [Toronto](http://www.meetup.com/Papers-We-Love-Toronto/)
+* [Hamburg](http://www.meetup.com/Papers-We-Love-Hamburg/)
+* [Reykjavík](http://www.meetup.com/Papers-We-Love-Reykjavik)
+* [Dallas](http://www.meetup.com/Papers-We-Love-Dallas/)
+* [Vienna](http://www.meetup.com/Papers-We-Love-Vienna/)
+* [Munich](http://www.meetup.com/Papers-We-Love-Munich/)
+* [Hyderabad](http://www.meetup.com/papers-we-love-hyderabad/)
+* [Madrid](http://www.meetup.com/Papers-We-Love-Madrid/)
+
+All of our meetups follow our [Code of Conduct](CODE_OF_CONDUCT.md).
 
 ### Past Presentations
 
 View a complete list of [past presentations](https://github.com/papers-we-love/papers-we-love/wiki/Past-Presentations) or check out our [Youtube](http://www.youtube.com/user/PapersWeLove) and [MixCloud](http://www.mixcloud.com/paperswelove/) (audio-only format) channels.
 
 ## Search this Repo!
-[@polyfractal](https://github.com/polyfractal) indexed this repository with Elastic Search. Find papers [here](http://findpaperswelove.com)!
+[@polyfractal](https://github.com/polyfractal) indexed this repository with Elastic Search. Find papers [here](http://findpaperswelove.com) !
 
 ## Info
 
 We're looking for pull requests related to papers we should add, better organization of the papers we do have, and/or links to other paper-repos we should point to.
 
+### Other Good Places to Discuss Papers
+
+* [Papers We Love reddit](http://www.reddit.com/r/paperswelove)
+
 ### Other Good Places to Find Papers
 
 * [Bell System Technical Journal, 1922-1983](http://alcatel-lucent.com/bstj/)
@@ -39,6 +68,10 @@ We're looking for pull requests related to papers we should add, better organiza
 * [netlib](http://www.netlib.org/)
 * [Services Engineering Reading List](https://github.com/mmcgrana/services-engineering)
 * [Readings in Distributed Systems](http://christophermeiklejohn.com/distributed/systems/2013/07/12/readings-in-distributed-systems.html)
+* [Gradual Typing Bibliography](http://samth.github.io/gradual-typing-bib/)
+* [Security Data Science Papers](http://www.covert.io/security-datascience-papers/)
+* [Research Papers from Robert Harper, Carnegie Mellon University](http://www.cs.cmu.edu/~rwh/papers.htm)
+* [Lobste.rs tagged as PDF](https://lobste.rs/t/pdf)
 
 Please check out our [wiki-page](https://github.com/papers-we-love/papers-we-love/wiki/Other-Good-Sources-of-Reading-Material) for links to blogs, books, exchanges that are worth a good read.
 
@@ -69,3 +102,7 @@ We want to help bring academic research closer to practitioners and we strive to
 
 * Directory names are undercased and separated by underscores (example: artificial_intelligence)
 * Paper names are undercased and separated by dashes (example: out-of-the-tar-pit.pdf). Use the full title when possible.
+
+### Copyright
+
+The name "Papers We Love" and the logos for the organization are copyrighted, and under the ownership of Papers We Love NYC, all rights reserved. When starting a chapter, please review [our guidelines](https://github.com/papers-we-love/papers-we-love/wiki/Creating-a-PWL-chapter) and ask us about using the logo.

_meetups/SanFrancisco/2014_meetups.md

@@ -0,0 +1,49 @@
+### PWLSF#1 => Dapper, a Distributed Systems Tracing Infrastructure
+Speaker: [Ryan Kennedy](https://twitter.com/rckenned)
+Date: [March 26, 2014](http://www.meetup.com/papers-we-love-too/events/168085182/)
+Links: [Paper](http://research.google.com/pubs/pub36356.html) || [Video](https://www.youtube.com/watch?v=ya9X63VPgV8) || [Slides](https://speakerdeck.com/paperswelove/pwl-sf-number-1-equals-ryan-kennedy-on-dapper-a-distributed-systems-tracing-infrastructure)
+
+### PWLSF#2 => The Akamai Network
+Speaker: [Andy Gross](https://twitter.com/argv0)
+Date: [April 24, 2014](http://www.meetup.com/papers-we-love-too/events/168294502/)
+Links: [Paper](http://www.akamai.com/dl/technical_publications/network_overview_osr.pdf) || [Video](https://www.youtube.com/watch?v=bQCT93D1bsM) || Slides: N/A
+
+### PWLSF#3 => Bimodal Multicast
+Speaker: [Bruce Spang](https://twitter.com/brucespang)
+Date: [May 22, 2014](http://www.meetup.com/papers-we-love-too/events/168461962/)
+Links: [Paper](http://www.csl.mtu.edu/cs6461/www/Reading/Birman99.pdf) || [Video](https://www.youtube.com/watch?v=iBvWB2K2ULU) || [Slides](https://speakerdeck.com/paperswelove/pwlsf-number-3-equals-bruce-spang-on-bimodal-multicast)
+
+### PWLSF#4 => Calvin
+Speaker: [Joel VanderWerf](https://twitter.com/JoelVanderWerf)
+Date: [April 24, 2014](http://www.meetup.com/papers-we-love-too/events/171291972/)
+Links: [Paper](http://www.cs.yale.edu/homes/dna/papers/calvin-sigmod12.pdf) || [Video](https://www.youtube.com/watch?v=RxMBqVLfei0) || [Slides](https://speakerdeck.com/paperswelove/pwlsf-number-4-equals-joel-vanderwerf-on-calvin)
+
+### PWLSF#5 => Impossibility of Distributed Consensus with One Faulty Process
+Speaker: [Henry Robinson](https://twitter.com/HenryR)
+Date: [July 24, 2014](http://www.meetup.com/papers-we-love-too/events/168566452/)
+Links: [Paper](http://macs.citadel.edu/rudolphg/csci604/ImpossibilityofConsensus.pdf)|| [Video](https://www.youtube.com/watch?v=HAimnwG4Qv4) || [Slides](https://speakerdeck.com/paperswelove/pwlsf-number-5-equals-henry-robinson-on-flp-imp-of-distributed-consensus-w-one-faulty-process)
+
+### PWLSF#6 => Using Reasoning about Knowledge to Analyze Distributed Systems
+Speaker: [Peter Alvaro](https://twitter.com/palvaro)
+Date: [August 21, 2014](http://www.meetup.com/papers-we-love-too/events/168821902/)
+Links: [Paper](https://www.cs.cornell.edu/home/halpern/papers/UsingRAK.pdf) || [Video](https://www.youtube.com/watch?v=CxZrBwhXHdo) || [Slides](https://speakerdeck.com/paperswelove/pwlsf-number-6-equals-peter-alvaro-using-reasoning-about-knowledge-to-analyze-distributed-systems)
+
+### PWLSF#7 => SWIM
+Speaker: [Armon Dadgar](https://twitter.com/armon)
+Date: [September 25, 2014](http://www.meetup.com/papers-we-love-too/events/176288712/)
+Links: [Paper](http://www.cs.cornell.edu/~asdas/research/dsn02-swim.pdf) || [Video](https://www.youtube.com/watch?v=aVYEY75qn3c) || [Slides](https://speakerdeck.com/paperswelove/pwlsf-number-7-equals-armon-dadgar-on-swim)
+
+### PWLSF#8 => On the attraction between two perfectly conducting plates
+Speaker: [Kyle Kingsbury](https://twitter.com/aphyr)
+Date: [October 22, 2014](http://www.meetup.com/papers-we-love-too/events/187600122/)
+Links: [Paper](https://github.com/papers-we-love/papers-we-love/blob/master/physics/on-the-attraction-of-two-perfectly-conducting-plates.pdf?raw=true) || [Video]() || [Slides]()
+
+### PWLSF#9 => Level Ancestor Simplified
+Speaker: [Leif Walsh](https://twitter.com/leifwalsh)
+Date: [November 13, 2014](http://www.meetup.com/papers-we-love-too/events/197577972/)
+Links: [Paper](https://github.com/papers-we-love/papers-we-love/blob/master/data_structures/level-ancestor-simplified.pdf) || [Video]() || [Slides]()
+
+### PWLSF#10 => Managing Update Conflicts in Bayou
+Speaker: [Peter Bailis](http://twitter.com/pbailis)
+Date: [December 17, 2014](http://www.meetup.com/papers-we-love-too/events/197678922/)
+Links: [Paper](http://db.cs.berkeley.edu/cs286/papers/bayou-sosp1995.pdf) || [Video]() || [Slides]()

_meetups/SanFrancisco/README.md

@@ -0,0 +1,6 @@
+### San Francisco Papers We Love Meetups
+Our [Meetup Page](http://www.meetup.com/papers-we-love-too)
+
+Here is the list of all meetups and links to their resources. Enjoy!
+* [2014 Meetups](2014_meetups.md)
+* 2015 - coming soon!

android/README.md

@@ -0,0 +1,8 @@
+# Android
+
+## Security
+
+* Referenced by [Two Secure Coding Tools for Analyzing Android Apps](http://blog.sei.cmu.edu/post.cfm/secure-coding-tools-analyzing-android-apps-118) :
+    * [Analyzing Inter-Application Communication in Android](https://www.eecs.berkeley.edu/~daw/papers/intents-mobisys11.pdf)
+    * [Effective Inter-Component Communication Mapping in Android with Epicc: An Essential Step Towards Holistic Security Analysis](http://www.cse.psu.edu/~duo114/pubs/octeau-sec13.pdf)
+    * [FlowDroid: Precise Context, Flow, Field, Object-sensitive and Lifecycle-aware Taint Analysis for Android Apps](http://www.bodden.de/pubs/far+14flowdroid.pdf)

api_design/README.md

@@ -1 +1 @@
-[REST-Roy-Fielding-dissertation.pdf](https://www.ics.uci.edu/~fielding/pubs/dissertation/fielding_dissertation.pdf)
+[Architectural Styles and the Design of Network-based Software Architectures (REST) by Roy Fielding](https://www.ics.uci.edu/~fielding/pubs/dissertation/fielding_dissertation.pdf)

artificial_intelligence/README.md

@@ -0,0 +1,7 @@
+## Artificial Intelligence
+
+[Analysis of Three Bayesian Network Inference Algorithms:Variable Elimination, Likelihood Weighting, and Gibbs Sampling](https://github.com/papers-we-love/papers-we-love/blob/master/artificial_intelligence/3-bayesian-network-inference-algorithm.pdf) by Rose F. Liu, Rusmin Soetjipto
+
+[Computing Machinery and Intelligence](http://www.csee.umbc.edu/courses/471/papers/turing.pdf) by A.M. Turing
+
+[Judea Pearl](http://bayes.cs.ucla.edu/jp_home.html) folder - Papers by Judea Pearl, 2011 winner of the ACM Turing Award.

artificial_intelligence/judea_pearl/README.md

@@ -0,0 +1,29 @@
+[Reverend Bayes on inference engines: A distributed hierarchical approach](http://ftp.cs.ucla.edu/pub/stat_ser/r30.pdf) -
+> The paper that began the probabilistic revolution in AI
+> by showing how several desirable properties of reasoning systems
+> can be obtained through sound probabilistic inference.
+> It introduced tree-structured networks as concise representations of
+> complex probability models, identified conditional independence
+> relationships as the key organizing principle for uncertain knowledge,
+> and described an efficient, distributed, exact inference algorithm.
+> -- <cite>[ACM Turing Award Short Annotated Bibliography][1]</cite>
+
+[A theory of inferred causation](http://ftp.cs.ucla.edu/pub/stat_ser/r156-reprint.pdf) - with Thomas S. Verma.
+> Introduces minimal-model semantics as a basis for causal discovery,
+> and shows that causal directionality can be inferred from patterns
+> of correlations without resorting to temporal information.
+> -- <cite>[ACM Turing Award Short Annotated Bibliography][1]</cite>
+
+[Causal diagrams for empirical research](http://ftp.cs.ucla.edu/pub/stat_ser/R218-B-L.pdf) - extended version linked.
+> Introduces the theory of causal diagrams and its associated do-calculus;
+> the first (and still the only) mathematical method to enable a
+> systematic removal of confounding bias in observations.
+> -- <cite>[ACM Turing Award Short Annotated Bibliography][1]</cite>
+
+[The algorithmization of counterfactuals](http://ftp.cs.ucla.edu/pub/stat_ser/r360.pdf) -
+> Describes a computational model that explains how humans generate,
+> evaluate and distinguish counterfactual statements so swiftly and
+> consistently.
+> -- <cite>[ACM Turing Award Short Annotated Bibliography][1]</cite>
+
+[1]: http://amturing.acm.org/bib/pearl_2658896.cfm

audio_comp_sci/README.md

@@ -0,0 +1,5 @@
+## Audio-related Computer Science
+
+[An ethnographic and technological study of breakbeats in Hardcore, Jungle, and Drum & Bass](https://github.com/papers-we-love/papers-we-love/blob/master/audio_comp_sci/an-ethnographic-and-technological-study-of-breakbeats.pdf) by Jason A. Hockman 
+
+[An Industrial-Strength Audio Search Algorithm](https://github.com/papers-we-love/papers-we-love/blob/master/audio_comp_sci/shazam-audio-search-algorithm.pdf) by Avery Li-Chun Wang

biocomputing/README.md

@@ -6,4 +6,8 @@ Some resources that may assist in understanding papers in this section:
 ---------
 * [Molecular Computation of Solutions to Combinatorial Problems](http://www.cs.duke.edu/courses/cps296.4/spring04/papers/Adleman94.pdf)
     - An interesting and inspiring approach to solving the (NP-complete) Hamiltonian Graph problem. 
-    
+
+* [The chemical basis of morphogenesis](http://www.dna.caltech.edu/courses/cs191/paperscs191/turing.pdf)    
+    - How we can generate patterns from reaction-diffusion models and how those models apply in real life situations: cells self-organisation and pattern creation.
+    - Includes advance mathematical concepts, basic chemistry, basic biology.
+    - By Alan Turing

caching/README.md

@@ -0,0 +1,3 @@
+[An O(1) algorithm for implementing the LFU cache eviction scheme](https://github.com/papers-we-love/papers-we-love/blob/master/caching/a-constant-algorithm-for-implementing-the-lfu-cache-eviction-scheme.pdf) by Prof. Ketan Shah, Anirban Mitra, Dhruv Matani
+
+[2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm](http://www.vldb.org/conf/1994/P439.PDF) by Theodore Johnson and Dennis Shasha

clojure/README.md

@@ -1,6 +1,6 @@
 # Clojure
 
-This is a cross-listing of papers related to Clojure, it's core, contrib and popular libraries. Papers noted at at Clojure talks, meetups, and conferences can be found here as well.
+This is a cross-listing of papers related to Clojure, it's core, contrib and popular libraries. Papers noted at Clojure talks, meetups, and conferences can be found here as well.
 ## Data Structures
 * core.rrb-vector
   * [RRB-Trees: Efficient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf)

clustering_algorithms/README.md

@@ -0,0 +1,3 @@
+## Clustering Algorithms
+
+[On the resemblance and containment of documents](http://gatekeeper.dec.com/ftp/pub/dec/SRC/publications/broder/positano-final-wpnums.pdf) (Andrei Z. Broder)

comp_sci_fundamentals_and_history/README.md

@@ -1,2 +1,8 @@
-* [Turing, On computable numbers, with an application to the Entscheidungsproblem](http://www.turingarchive.org/browse.php/B/12)
-* [Mealy, A Method for Synthesizing Sequential Circuits] (http://www3.alcatel-lucent.com/bstj/vol34-1955/bstj-vol34-issue05.html)
+## Computer Science Fundamentals and History
+
+* [Turing, On computable numbers, with an application to the Entscheidungsproblem](http://www.turingarchive.org/browse.php/B/12) by Alan Turing
+* [Mealy, A Method for Synthesizing Sequential Circuits] (http://www3.alcatel-lucent.com/bstj/vol34-1955/articles/bstj34-5-1045.pdf) by George H. Mealy
+* :scroll: [Back to the Future - The Story of Squeak, A Practical Smalltalk Written in Itself](https://github.com/papers-we-love/papers-we-love/blob/master/comp_sci_fundamentals_and_history/story-of-squeak-a-practical-smalltalk-written-in-itself.pdf) by Dan Ingalls, Ted Kaehler, John Maloney, Scott Wallace & Alan Kay
+* :scroll: [Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I](https://github.com/papers-we-love/papers-we-love/blob/master/comp_sci_fundamentals_and_history/recursive-functions-of-symbolic-expressions-and-their-computation-by-machine-parti.pdf) by John McCarthy
+* :scroll: [An Axiomatic Basis for Computer Programming](https://github.com/papers-we-love/papers-we-love/blob/master/comp_sci_fundamentals_and_history/axiomatic-basis-computer-programming.pdf) by C. A. R. HOARE 
+* :scroll: [On the Computational Complexity of Algorithims](http://www.ams.org/journals/tran/1965-117-00/S0002-9947-1965-0170805-7/S0002-9947-1965-0170805-7.pdf) by J. HARTMANIS AND R. E. STEARNS

computer_architecture/README.md

@@ -0,0 +1,3 @@
+# Computer Architecture
+
+* [Piranha: A Scalable Architecture Based on Single-Chip Multiprocessing](http://barroso.org/publications/isca00.pdf)

computer_graphics/README.md

@@ -1,7 +1,18 @@
 ### Rendering
+
+* [Digital Video Stabilization and Rolling Shutter Correction using
+  Gyroscopes](http://graphics.stanford.edu/papers/stabilization/karpenko_gyro.pdf)
+This is a really great paper that is both complex and straightforward.
+This paper "present a robust, real-time video stabilization and rolling
+shutter correction technique based on gyroscopes". I think
+this is a great paper because it makes a clever use of a commodity technology
+(smartphones' gyroscopes) to make a state-of-the-art improvement to a
+central components of phones: video cameras by removing the shakes
+and rolling shutter artifacts of a video in real-time.
+
 * [An Improved Illumination Model for Shaded Display](https://www.cs.drexel.edu/~david/Classes/CS586/Papers/p343-whitted.pdf)
 
-* [The Rendering Equation](http://x86.cs.duke.edu/courses/cps124/fall09/notes/16_rendering/p143-kajiya.pdf)
+* [The Rendering Equation](http://www.cs.rpi.edu/~cutler/classes/advancedgraphics/S08/lectures/kajiya.pdf)
 * [GigaVoxels : Ray-Guided Streaming for Efficient and Detailed Voxel Rendering](http://maverick.inria.fr/Publications/2009/CNLE09/CNLE09.pdf) - [Web page](http://maverick.inria.fr/Publications/2009/CNLE09/) - [Project page](http://gigavoxels.imag.fr/) - [Video](https://www.youtube.com/watch?v=HScYuRhgEJw)
 
 ### Surface reconstruction
@@ -20,3 +31,16 @@
 
 ### Interior mapping
 * [Interior Mapping: A new technique for rendering realistic buildings](http://www.proun-game.com/Oogst3D/CODING/InteriorMapping/InteriorMapping.pdf)
+
+### Procedural modeling
+* Both of these papers are great examples of a non-traditional
+  application of grammar-driven generation:
+  - [Procedural Modeling of Buildings](http://www.peterwonka.net/Publications/pdfs/2006.SG.Mueller.ProceduralModelingOfBuildings.final.pdf)
+  - [Instant Architecture](http://www.peterwonka.net/Publications/pdfs/2003.SG.Wonka.InstantArchitecture.high.pdf)
+
+### Shape grammars
+
+* [Shape Grammars and the Generative Specification of Painting and Sculpture](http://shapegrammar.org/ifip/SGBestPapers72.pdf)
+  - A seminal paper that lead to many interesting applications in
+    graphics as well as more broadly in design; see also the
+    bibliography at [shapegrammar.org](http://shapegrammar.org/).

concurrency/README.md

@@ -5,3 +5,9 @@
 * [Heap Architectures For Concurrent Languages Using Message Passing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.108.1302&rep=rep1&type=pdf)
 
 * [Message Analysis for Concurrent Languages](http://user.it.uu.se/~kostis/Papers/escape.pdf)
+
+* [Finding Race Conditions in Erlang with QuickCheck and PULSE](http://publications.lib.chalmers.se/records/fulltext/125252/local_125252.pdf)
+
+* [The Semantics of x86-CC Multiprocessor Machine Code](http://www.cl.cam.ac.uk/~pes20/weakmemory/popl09.pdf)
+
+    *Note: This contribution here is the focus on the rigorous semantics for x86 multiprocessor programs and an axiomatic definition of the memory model. Their definitions and proofs are backed by the [HOL](http://en.wikipedia.org/wiki/HOL_(proof_assistant))(Higher Order Logic) proof assistant.*

cryptography/README.md

@@ -1,2 +1,11 @@
 * [A Method for Obtaining Digital Signatures and Public-Key Cryptosystems](http://people.csail.mit.edu/rivest/Rsapaper.pdf)
 * [Twenty Years of Attacks on the RSA Cryptosystem](https://crypto.stanford.edu/~dabo/papers/RSA-survey.pdf)
+* [Communication Theory of Secrecy Systems](communication-theory-of-secrecy-systems.pdf)
+* [New Directions in Cryptography](http://www-ee.stanford.edu/~hellman/publications/24.pdf)
+
+## Related Works
+### [A Mathematical Theory of Cryptography (1945)](http://www.cs.bell-labs.com/who/dmr/pdfs/shannoncryptshrt.pdf) - Shannon
+The original classified memo for Bell Labs that was republished in 1949 as ["Communication Theory of Secrecy Systems"](communication-theory-of-secrecy-systems.pdf).
+
+### [A Mathematical Theory of Communication (1948)](../information_theory/a-mathematical-theory-of-communication-1948.pdf) - Shannon
+Shannon said that his wartime insights into communication theory and cryptography developed simultaneously and that "they were so close together you couldn’t separate them". ["Communication Theory of Secrecy Systems"](communication-theory-of-secrecy-systems.pdf) incorporates many concepts and formulations that also appeared in his 1948 paper.

datastores/README.md

@@ -1 +1,2 @@
 * [Calvin: Fast Distributed Transactions for Partitioned Database Systems](http://cs.yale.edu/homes/thomson/publications/calvin-sigmod12.pdf)
+* [f4: Facebook’s Warm BLOB Storage System](http://www-bcf.usc.edu/~wyattllo/papers/f4-osdi14.pdf)

distributed_systems/README.md

@@ -2,6 +2,8 @@
 
 ## External Papers
 
+* :scroll: [A Note on Distributed Computing](http://www.eecs.harvard.edu/~waldo/Readings/waldo-94.pdf)
+
 * [A simple totally ordered broadcast protocol](http://labs.yahoo.com/files/ladis08.pdf)
 
 * [Above the Clouds: A Berkeley View of Cloud Computing](http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-28.pdf)
@@ -38,10 +40,14 @@
 
 * [Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial](https://www.cs.cornell.edu/fbs/publications/SMSurvey.pdf)
 
+* [Introduction to a System for Distributed Databases SDD-1](http://www.few.vu.nl/~kgr700/sdd1.pdf)
+
 * [Kafka: a Distributed Messaging System for Log Processing](http://research.microsoft.com/en-us/um/people/srikanth/netdb11/netdb11papers/netdb11-final12.pdf)
 
 * [Linearizability: A Correctness Condition for Concurrent Objects](http://cs.brown.edu/~mph/HerlihyW90/p463-herlihy.pdf)
 
+* [Making Reliable Distributed Systems in the Presence of Software Errors](http://www.erlang.org/download/armstrong_thesis_2003.pdf)
+
 * [Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System](http://zoo.cs.yale.edu/classes/cs422/2013/bib/terry95managing.pdf)
 
 * [Map-Reduce-Merge: Simplified Relational Data Processing on Large Clusters](http://www.cs.duke.edu/courses/cps399.28/current/papers/sigmod07-YangDasdanEtAl-map_reduce_merge.pdf)
@@ -50,10 +56,12 @@
 
 * [MillWheel: Fault-Tolerant Stream Processing at Internet Scale](http://static.googleusercontent.com/media/research.google.com/en/us/pubs/archive/41378.pdf)
 
-* [Omega: flexible, scalable schedulers for large compute clusters](http://research.google.com/pubs/archive/41684.pdf) 
+* [Omega: flexible, scalable schedulers for large compute clusters](http://research.google.com/pubs/archive/41684.pdf)
 
 * [Optimistic replication](http://pages.cs.wisc.edu/~remzi/Classes/739/Spring2004/Papers/optimistic-survey.pdf)
 
+* [Orleans: Distributed Virtual Actors for Programmability and Scalability] (http://research.microsoft.com/apps/pubs/default.aspx?id=210931)
+
 * [Paxos Made Live - An Engineering Perspective](http://www.cs.utexas.edu/users/lorenzo/corsi/cs380d/papers/paper2-1.pdf)
 
 * [Practical Byzantine Fault Tolerance and Proactive Recovery](http://www.itu.dk/stud/speciale/bepjea/xwebtex/litt/practical-byzantine-fault-tolerance-and-proactive-recovery.pdf)
@@ -70,6 +78,8 @@
 
 * [The Byzantine Generals Problem](http://www.andrew.cmu.edu/course/15-749/READINGS/required/resilience/lamport82.pdf)
 
+* :scroll: [The Chubby Lock Service for Loosely-Coupled Distributed Systems](http://static.googleusercontent.com/media/research.google.com/en/us/archive/chubby-osdi06.pdf)
+
 * [The Dangers of Replication and a Solution](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.21.2707&rep=rep1&type=pdf)
 
 * [The Part-Time Parliament](http://research.microsoft.com/en-us/um/people/lamport/pubs/lamport-paxos.pdf)
@@ -94,4 +104,4 @@
 
 ### [“On the Electrodynamics of Moving Bodies” (1905) — Einstein](../historical/physics/on-the-electrodynamics-of-moving-bodies.pdf)
 
-By solving the [asymmetries](http://en.wikipedia.org/wiki/Moving_magnet_and_conductor_problem) that arise in Maxwell’s equations, Einstein’s 1905 paper set the stage for current distributed systems work by demonstrating that there is no absolute frame of reference and by providing an upper bound on the speed of communication. 
+By solving the [asymmetries](http://en.wikipedia.org/wiki/Moving_magnet_and_conductor_problem) that arise in Maxwell’s equations, Einstein’s 1905 paper set the stage for current distributed systems work by demonstrating that there is no absolute frame of reference and by providing an upper bound on the speed of communication.

economics/README.md

@@ -0,0 +1,5 @@
+# Economics 
+
+## Auctions and Bidding
+
+* [Auctions and bidding: A guide for computer scientists](http://www.sci.brooklyn.cuny.edu/~parsons/projects/mech-design/publications/bluffers-final.pdf) by Simon Parsons

experimental_algorithmics/README.md

@@ -0,0 +1,8 @@
+# Experimental Algorithmics
+
+Experimental algorithmics (sometimes also called empirical algorithmics) is the area within computer science that uses empirical methods to study the behaviour of algorithms.
+It can be used in the analysis of algorithms [(Wikipedia)](http://en.wikipedia.org/wiki/Empirical_algorithmics).
+
+## Included Papers
+
+* [A Theoretician's Guide to the Experimental Analysis of Algorithms](http://davidsjohnson.net/papers/experguide.pdf) (David S. Johnson): An exceptionally well-written guide to correctly evaluating algorithms by experimental analysis. The techniques described in this paper do not only apply to theoreticians although the title might lead one to believe so. The examples used in this paper and specifically the method of listing straight-forward principles illustrated by pit-falls and pet peeves make for an excellent must-read for everyone intending to publish experimental algorithm results.

functional_progamming/README.md

@@ -1,11 +0,0 @@
-# Functional Programming
-
-## Applicative Programming
-
-* [Backtracking Iterators](https://www.lri.fr/~filliatr/publis/enum2.pdf)
-
-* [Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design](http://www.cs.tufts.edu/~nr/cs257/archive/chris-okasaki/breadth-first.pdf)
-
-## Concatenative Programming
-
-* :scroll: [Concatenative Programming: An Overlooked Paradigm in Functional Programming](http://mitarbeiter.hs-heilbronn.de/~herzberg/Publications/ICSOFT.2009.pdf)

functional_programming/README.md

@@ -0,0 +1,17 @@
+# Functional Programming
+
+* :scroll: [Organizing Programs Without Classes](http://cs.au.dk/~hosc/local/LaSC-4-3-pp223-242.pdf)
+
+## Applicative Programming
+
+* [Backtracking Iterators](https://www.lri.fr/~filliatr/publis/enum2.pdf)
+
+* [Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design](http://www.cs.tufts.edu/~nr/cs257/archive/chris-okasaki/breadth-first.pdf)
+
+## Concatenative Programming
+
+* :scroll: [Concatenative Programming: An Overlooked Paradigm in Functional Programming](https://github.com/dterei/Research-Papers/blob/master/To%20Read/CONCATENATIVE%20PROGRAMMING%0AAn%20Overlooked%20Paradigm%20in%20Functional%20Programming.pdf)
+
+## Imperative Programming - Functional Programming
+
+* [Crossing the Gap from Imperative to Functional Programming through Refactoring](http://dig.cs.illinois.edu/papers/lambdaRefactoring.pdf)

gamification/README.md

@@ -2,7 +2,7 @@
 
 ## External Papers
 
-* [Defining Gamification - A Service Marketing Perspective](http://www.hiit.fi/u/hamari/Defining_Gamification-A_Service_Marketing_Perspective.pdf)
+* [Defining Gamification - A Service Marketing Perspective](http://www.rolandhubscher.org/courses/hf765/readings/p17-huotari.pdf)
 
 * [Design Requirements for Technologies that Encourage Physical Activity](http://www.katherineeveritt.com/papers/p457-consolvo.pdf)
 
@@ -12,4 +12,4 @@
 
 * [MoviPill: Improving Medication Compliance for Elders - Using a Mobile Persuasive Social Game](http://www.ic.unicamp.br/~oliveira/doc/Ubicomp2010_MoviPill.pdf)
 
-* [Removing Gamification from an Enterprise SNS](http://www.jennthom.com/papers/gamification.pdf)
+* [Removing Gamification from an Enterprise SNS](http://www.jennthom.com/papers/gamification.pdf)

garbage_collection/README.md

@@ -1,5 +1,7 @@
 * [A Unified Theory of Garbage Collection](http://www.cs.virginia.edu/~cs415/reading/bacon-garbage.pdf)
-
-* [Teaching Garbage Collection without Implementing Compilers or Interpreters](http://faculty.cs.byu.edu/~jay/static/cooper-sigcse2013.pdf)
-
-* [Message Analysis Guided Allocation and Low Pause Incremental GC in a Concurrent Language](http://user.it.uu.se/~kostis/Papers/ismm04.pdf)
+* [A LISP Garbage-Collector for Virtual-Memory Computer Systems](https://www.cs.purdue.edu/homes/hosking/690M/p611-fenichel.pdf)
+* [Incremental Collection of Mature Objects](http://pdf.aminer.org/000/465/194/incremental_collection_of_mature_objects.pdf)
+* :scroll: [Incremental Mature Garbage Collection Using the Train Algorithm](https://www.sics.se/~seif/DatalogiII/Book/train.ps)
+* [Incremental Garbage Collection: The Train Algorithm](http://www.ssw.uni-linz.ac.at/General/Staff/TW/Wuerthinger05Train.pdf)
+* :scroll: The Lisp II Garbage Collector (ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-019.pdf)
+* [The Treadmill: Real-Time Garbage Collection Without Motion Sickness](http://home.pipeline.com/~hbaker1/NoMotionGC.html)

gossip/README.md

@@ -0,0 +1,19 @@
+If you only read one of these papers, start with the classic Demers, et al paper:
+* [Epidemic Algorithms for Replicated Database Maintenance] (http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/CSL-89-1_Epidemic_Algorithms_for_Replicated_Database_Maintenance.pdf)
+
+# Peer sampling services
+Briefly, a peer sampling service is a system that maintains a restricted set (partial view) of the all machines participating in a gossip system.
+* [The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations](http://infoscience.epfl.ch/record/83409/files/neg--1184036295all.pdf)
+* [HyParView](http://gsd.di.uminho.pt/jop/pdfs/LPR07b.pdf)
+* [SWIM: Scalable Weakly-consistent Infection-style Process Group Membership Protocol](http://www.cs.cornell.edu/~asdas/research/dsn02-swim.pdf)
+
+# Epidemic broadcast 
+* [Large-Scale Newscast Computing on the Internet ](http://www.soc.napier.ac.uk/~benp/dream/dreampaper17.pdf)
+* [Bimodal Multicast](http://www.csl.mtu.edu/cs6461/www/Reading/Birman99.pdf)
+* [Efficient Reconciliation and Flow Control for Anti-Entropy Protocols](http://idning-paper.googlecode.com/svn/trunk/reference/ignore/Scuttlebutt_Efficient_reconciliation_and_flow_control_for_anti-entropy_protocols.pdf)
+* [Epidemic Broadcast Trees](http://www.gsd.inesc-id.pt/~ler/reports/srds07.pdf)
+
+# Failure Detectors
+* [A Gossip-Style Failure Detection Service](http://ecommons.cornell.edu/bitstream/1813/7341/2/98-1687.ps)
+* [The ϕ Accrual Failure Detector ](http://ddg.jaist.ac.jp/pub/HDY+04.pdf)
+

haskell/README.md

@@ -1,4 +1,5 @@
 # Haskell
 
-
-* [Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell](../haskell/tackling-the-awkward-squad-monadic-input-output-concurrency-exceptions-and-foreign-language-calls-in-haskell.pdf) by Simon Peyton Jones
+* :scroll: [Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell](../haskell/tackling-the-awkward-squad-monadic-input-output-concurrency-exceptions-and-foreign-language-calls-in-haskell.pdf) by Simon Peyton Jones
+* :scroll: [Making a Fast Curry: Push/Enter vs. Eval/Apply for Higher-order Languages](../haskell/making-a-fast-curry-push-enter-versus-eval-apply-for-higher-order-languages.pdf) by Simon Marlow and Simon Peyton Jones. A classic... describes well the execution model GHC uses for Haskell, and catches the brilliant authors in a design pivot from original intuition to new conclusions based on empirical data.
+* :scroll: [A Poor Man's Concurrency Monad](../haskell/a-poor-mans-concurrency-monad.pdf) by Koen Claessen. Paper describes how without adding any primitives to the language, you could define a concurrency monad transformer in Haskell.

information_retrieval/README.md

@@ -4,9 +4,8 @@ Information retrieval is the activity of obtaining information resources relevan
 
 The included documents are
 
-*
-  [Graph of Word and TW-IDF](http://www.lix.polytechnique.fr/~rousseau/papers/rousseau-cikm2013.pdf) - Francois Rousseau & Michalis Vazirgiannis
-  
+* [Graph of Word and TW-IDF](http://www.lix.polytechnique.fr/~rousseau/papers/rousseau-cikm2013.pdf) - Francois Rousseau & Michalis Vazirgiannis
+
   The traditional IR system stores term-specific statistics (typically
   a term's frequency in each document - which we call TF) in an index.
   Such a model ignores dependencies between terms and considers a
@@ -17,3 +16,5 @@ The included documents are
   TW statistic based on the graph constructed and achieve
   significantly better results that popular existing models. This
   paper won a honorable mention at CIKM 2013.
+
+* [The Anatomy of a Large-Scale Hypertextual Web Search Engine](http://infolab.stanford.edu/~backrub/google.html)

information_theory/README.md

@@ -0,0 +1,6 @@
+* :scroll: [A Mathematical Theory of Communication](http://cm.bell-labs.com/cm/ms/what/shannonday/shannon1948.pdf)
+
+* [Differential Privacy](http://www.msr-waypoint.com/pubs/64346/dwork.pdf)
+  - How do we quantify the exposure an individual faces from being
+    included in a statistical dataset?  How do we anonymize aggregated
+    data in a way that has formal guarantees?

logic_and_programming/README.md

@@ -1 +1,2 @@
-* [Purely Functional Lazy Non-deterministic Programming](http://www.cs.rutgers.edu/~ccshan/rational/lazy-nondet.pdf)
+* [Purely Functional Lazy Non-deterministic Programming](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.524)
+* :scroll: [On the Meanings of the Logical Constants and the Justifications of the Logical Laws](http://www.pps.univ-paris-diderot.fr/~saurin/Enseignement/LMFI/articles/Martin-Lof83.pdf)

logic_and_programming/event-calculus.txt

@@ -0,0 +1,19 @@
+"The Event Calculus as a Linear Logic Program"
+Vladimir Alexiev
+
+http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9953
+
+Direct download:
+http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.9953&rep=rep1&type=pdf
+
+Abstract:
+
+The traditional presentation of Kowalski's Event Calculus as a logic program uses
+Negation-as-Failure (NAF) in an essential way to support persistence of fluents. 
+In this paper we present an implementation of Event Calculus as a purely logical
+(without NAF) Linear Logic (LL) program. This work demonstrates some of the
+internal non-monotonic features of LL and its suitability for knowledge update
+(as opposed to knowledge revision). Although NAF is an ontologically sufficient
+solution to the frame problem, the LL solution is implementationally superior.
+Handling of incomplete temporal descriptions and support for ramifications
+(derived fluents) are also considered.

macros/README.md

@@ -1,2 +1,2 @@
-* [D-Expressions: Lisp Power, Dylan Sytle](http://people.csail.mit.edu/jrb/Projects/dexprs.pdf)
+* [D-Expressions: Lisp Power, Dylan Style](http://people.csail.mit.edu/jrb/Projects/dexprs.pdf)
 * [Fortifying Macros](http://www.ccs.neu.edu/racket/pubs/icfp10-cf.pdf)

memory_management/README.md

@@ -0,0 +1,12 @@
+* [A Unified Theory of Garbage Collection](http://www.cs.virginia.edu/~cs415/reading/bacon-garbage.pdf)
+
+* [Teaching Garbage Collection without Implementing Compilers or Interpreters](http://faculty.cs.byu.edu/~jay/static/cooper-sigcse2013.pdf)
+
+* [Message Analysis Guided Allocation and Low Pause Incremental GC in a Concurrent Language](http://user.it.uu.se/~kostis/Papers/ismm04.pdf)
+
+* [And Then There Were None: A Stall-Free Real-Time Garbage Collector for Reconfigurable Hardware](http://researcher.watson.ibm.com/researcher/files/us-bacon/Bacon12AndThen.pdf)
+
+* :scroll:
+  [ScatterAlloc: Massively Parallel Dynamic Memory Allocation for the GPU](http://www.icg.tugraz.at/Members/steinber/scatteralloc-1)
+  - Presents a useful algorithm as well as considerations relevant to
+    designing algorithms for GPUs.

operating_systems/README.md

@@ -1 +1,3 @@
 * [Xen and the Art of Virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)
+
+* [The operating system: should there be one?](http://plosworkshop.org/2013/preprint/kell.pdf)

pattern_matching/README.md

@@ -0,0 +1,6 @@
+# Pattern Matching
+
+* :scroll: [Compiling Pattern Matching to good Decision Trees](../pattern_matching/compiling-pattern-matching-to-good-decision-trees.pdf) by Luc Maranget. Paper address the issue of compiling ML pattern matching to efficient decisions trees.
+* :scroll: [Extensible Pattern Matching in an Extensible Language](../pattern_matching/extensible-pattern-matching-extensible-language.pdf) by Sam Tobin-Hochstadt. Paper present a sophisticated pattern matcher for [Racket](http://racket-lang.org/), implemented as language extension using macros.
+* :scroll: [Warnings for pattern matching](../pattern_matching/warnings-for-pattern-matching.pdf) by Luc Maranget. Paper examine the ML pattern-matching anomalies of useless clauses and non-exhaustive matches.
+* :scroll: [Efficient String Matching: An Aid to Bibliographic Search](../pattern_matching/aho-corasick-string-matching.pdf) by Alfred V. Aho and Margaret J. Corasick. A single-pass pattern matching algorithm used in early versions of fgrep and similar projects. [Aho–Corasick entry](http://xlinux.nist.gov/dads//HTML/ahoCorasick.html) in NIST's Dictionary of Algorithms and Data Structures.

physics/README.md

@@ -0,0 +1,3 @@
+# Physics
+
+* :scroll: [On the attraction of two perfectly conducting plates](on-the-attraction-of-two-perfectly-conducting-plates.pdf)

plt/README.md

@@ -3,3 +3,9 @@
 * [Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs](http://www.thocp.net/biographies/papers/backus_turingaward_lecture.pdf)
 
 * [Programming and Reasoning with Algebraic Effects and Dependent Types](http://eb.host.cs.st-andrews.ac.uk/drafts/effects.pdf)
+
+* [Programming Languages: History and Future](http://www.csee.umbc.edu/courses/undergraduate/CMSC331/resources/papers/sammet1972.pdf)
+
+* [Soft Typing](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.24.9333&rep=rep1&type=pdf)
+
+* :scroll: [Composable and Compilable Macros: You Want it When?](https://www.cs.utah.edu/plt/publications/macromod.pdf)

processes/README.md

@@ -1 +1,2 @@
 * [Communicating Sequential Processes](http://www.cs.ucf.edu/courses/cop4020/sum2009/CSP-hoare.pdf)
+* [Calculus of Communicating Systems](https://moodle.risc.jku.at/pluginfile.php/3407/mod_resource/content/1/A%20Calculus%20of%20Communicating%20Systems%5B1980%5D.pdf)

robotics/README.md

@@ -0,0 +1,44 @@
+Robotics
+====
+
+[Adaptive Road Following using Self-Supervised Learning and Reverse Optical Flow](http://www.roboticsproceedings.org/rss01/p36.pdf)
+
+[DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks](http://people.ee.duke.edu/~lcarin/Lihan4.21.06a.pdf)
+
+[The Dynamic Window Approach to Collision Avoidance](http://www.cs.washington.edu/node/4749)
+
+[Online Trajectory Generation: Basic Concepts for Instantaneous Reactions to Unforeseen Events](http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5350749)
+
+[Probablistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces](http://www.kavrakilab.org/sites/default/files/kavraki1996prm-high-dim-conf.pdf)
+
+[Rapidly-Exploring Random Trees: A New Tool for Path Planning](http://msl.cs.uiuc.edu/~lavalle/papers/Lav98c.pdf)
+
+[RGB-D Mapping: Using Depth Cameras for Dense 3D Modeling of Indoor Environments](http://www.cs.washington.edu/robotics/postscripts/3d-mapping-iser-10-final.pdf)
+
+
+
+Reasoning for the new papers:
+
+The dynamic window approach to collision avoidance is an influential
+paper for mobile robots. The method is based on a robot's dynamics
+rather than higher-level representations of a robot and/or obstacles in
+an environment.
+
+The PRM and RRT algorithms are two seminal papers in robot motion
+planning. The problem of motion planning scales exponentially with the
+degrees of freedom a robot has and the degrees of freedom the obstacles
+in an environment have. Thus, planning with high degrees of freedom leads to many problems
+such as incompleteness and extremely slow speed. The PRM method was the first to
+propose a sampling-based stratey to deal with motion planning and
+created a practical method for offline planning of robot manipulators.
+The RRT method modified PRM by using a tree structure rather than a
+graph so that non-holonomic and other constraints could be considered
+when planning.
+
+The Instantaneous Trajectory Generation method is relatively new, but
+very important. It allows for extremely fast trajectory generation for
+robots of high degrees of freedom (motion states generated within 1
+millisecond). It has been used to implement robot sword fighting and
+other activities that require fast reaction-based planning. The author
+started a business based simply on the work and has shown the
+algorithm's success in many robot applications.

security/README.md

@@ -0,0 +1,7 @@
+* [Reflections on Trusting Trust](http://www.ece.cmu.edu/~ganger/712.fall02/papers/p761-thompson.pdf)
+* [Internet Census via Insecure Routers](http://internetcensus2012.bitbucket.org/paper.html)
+* [Looking inside the (Drop) box](http://ictc.aeoi.org.ir/sites/default/files/US-13-Prado-SSL-Gone-in-30-seconds-A-BREACH-beyond-CRIME-WP_0.pdf)
+* [Making Programs Forget: Enforcing Lifetime For Sensitive Data](https://www.usenix.org/events/hotos11/tech/final_files/Kannan.pdf)
+* [Breach: Reviving The Crime Attack](http://breachattack.com/resources/BREACH%20-%20SSL,%20gone%20in%2030%20seconds.pdf)
+* [Why Silent Updates Boost Security](http://www.techzoom.net/Papers/Browser_Silent_Updates_%282009%29.pdf)
+* :scroll: [Macaroons: Cookies with Contextual Caveats for Decentralized Authorization in the Cloud](http://research.google.com/pubs/archive/41892.pdf)

speech_recognition/README.md

@@ -0,0 +1,9 @@
+# Speech Recognition
+
+## External Papers
+
+[A tutorial on hidden Markov models and selected applications in speech recognition](http://luthuli.cs.uiuc.edu/~daf/courses/Signals%20AI/Papers/HMMs/0.pdf)
+
+[Weighted Finite-State Transducers in Speech Recognition](http://www.cs.nyu.edu/~mohri/pub/csl01.pdf)
+
+[Decoding speech in the presence of other sources](http://www.ee.columbia.edu/~dpwe/pubs/BarkCE05-sfd-spcomm.pdf)

stringology/README.md

@@ -0,0 +1,10 @@
+# Stringology
+
+## External Papers
+
+* [A Taxonomy of Suffix Array Construction Algorithms](http://www.cas.mcmaster.ca/~bill/best/algorithms/07Taxonomy.pdf)
+    - A great introduction to
+      [suffix arrays](http://en.wikipedia.org/wiki/Suffix_array), but
+      also a survey paper that is more than the sum of its citations,
+      clarifying the presentation of all the algorithms with a
+      unifying framework.

time_series/README.md

@@ -0,0 +1,23 @@
+Important papers relating to time-series data
+
+Time-series data presents specific but very common problems for efficient 
+analysis, resulting in the need for columnar data stores and iterative 
+one-pass processing.
+
+The included documents are:
+
+* :scroll: [Operators on Inhomogeneous Time Series] (http://papers.ssrn.com/sol3/papers.cfm?abstract_id=208278) - Gilles O. Zumbach and Ulrich A. Müller
+
+  We present a toolbox to compute and extract information from
+  inhomogeneous (i.e. unequally spaced) time series. The toolbox
+  contains a large set of operators, mapping from the space of
+  inhomogeneous time series to itself.
+
+  These operators are computationally efficient (time and memory-wise)
+  and suitable for stochastic processes. This makes them attractive for
+  processing high-frequency data in finance and other fields. Using a
+  basic set of operators, we easily construct more powerful combined
+  operators which cover a wide set of typical applications. 
+
+
+