Merge remote-tracking branch 'refs/remotes/papers-we-love/master'

CODE_OF_CONDUCT.md

@@ -16,7 +16,8 @@ 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, the **paperswelove.slack.com** Slack, [PapersWeLove.org](http://paperswelove.org), or via remote presentations, please contact:
 
 - **Zeeshan Lakhani** [zeeshan@paperswelove.org](mailto:zeeshan@paperswelove.org)
-- **Clint Newsom** [clint@paperswelove.org](mailto:clint@paperswelove.org)
+- **Ines Sombra** [ines@paperswelove.org](mailto:ines@paperswelove.org)
+- **Elaine Greenberg** [elaine@paperswelove.org](mailto:elaine@paperswelove.org)
 - **Jeremy Heiler** (Github) [jeremy@paperswelove.org](mailto:jeremy@paperswelove.org)
 - **Darren Newton** (paperswelove.org) [darren@paperswelove.org](mailto:darren@paperswelove.org)
 - **All** [contact@paperswelove.org](mailto:contact@paperswelove.org)

README.md

@@ -25,9 +25,11 @@ Here are our official chapters. Let us know if you are interested in [starting o
 * [Hyderabad](http://www.meetup.com/papers-we-love-hyderabad/)
 * [Iasi](http://www.meetup.com/Papers-We-Love-Iasi/)
 * [Kathmandu](https://www.facebook.com/groups/PapersWeLoveKathmandu/)
+* [Lebanon](http://www.paperswelovelb.club)
 * [London](http://www.meetup.com/papers-we-love-london)
 * [Los Angeles](http://www.meetup.com/papers-we-love-la)
 * [Madrid](http://www.meetup.com/Papers-We-Love-Madrid/)
+* [Medellín](https://www.meetup.com/paperswelovemde/)
 * [Montreal](http://www.meetup.com/Papers-We-Love-Montreal/)
 * [Munich](http://www.meetup.com/Papers-We-Love-Munich/)
 * [New York City](http://www.meetup.com/papers-we-love/)
@@ -46,7 +48,7 @@ Here are our official chapters. Let us know if you are interested in [starting o
 * [Toronto](http://www.meetup.com/Papers-We-Love-Toronto/)
 * [Vienna](http://www.meetup.com/Papers-We-Love-Vienna/)
 * [Washington, DC](http://www.meetup.com/Papers-We-Love-DC-NoVA/)
-* [Winnipeg](http://www.meetup.com/Papers-We-Love-Winnipeg/)
+* [Winnipeg](http://pwlwpg.ca/)
 
 All of our meetups follow our [Code of Conduct](CODE_OF_CONDUCT.md).
 

computer_graphics/README.md

@@ -21,6 +21,9 @@ This is a really great paper that is both complex and straightforward. This pape
 ### Object modeling
 * [3-Sweep: Extracting Editable Objects from a Single Photo](http://www.cs.tau.ac.il/~dcor/articles/2013/3-Sweep-Extracting-Editable-Objects.pdf) - [Video](https://www.youtube.com/watch?v=Oie1ZXWceqM)
 
+### Photo editing
+* [Deep Photo Style Transfer](https://arxiv.org/pdf/1703.07511.pdf) (2017) - [Code](https://github.com/luanfujun/deep-photo-styletransfer) - A deep-learning approach to photographic style transfer (that is, taking the style of one photo and automatically applying it to another). The images in this paper are gorgeous.
+
 ### Lighting
 * [Light Propagation Volumes in CryEngine 3](http://www.crytek.com/download/Light_Propagation_Volumes.pdf)
 

datastores/README.md

@@ -42,7 +42,6 @@
 
 * [Towards a Next Generation Data Center Architecture: Scalability and Commoditization](http://research.microsoft.com/pubs/79348/presto27-greenberg.pdf)
 
-
 ## Hosted Papers
 
 * :scroll: [Bigtable: A Distributed Storage System for Structured Data](bigtable-a-distributed-storage-system-for-structured-data.pdf)
@@ -71,3 +70,4 @@
 
 * :scroll: [Warp: Multi-Key Transactions for Key-Value Stores](warp-multi-key-transactions-for-key-value-stores.pdf)
 
+* :scroll: [Spartan: A distributed array framework with smart tiling](spartan-a-distributed-array-framework-with-smart-tiling.pdf)

distributed_systems/README.md

@@ -31,7 +31,7 @@
 
 * [Omega: flexible, scalable schedulers for large compute clusters](http://research.google.com/pubs/archive/41684.pdf)
 
-* [Orleans: Distributed Virtual Actors for Programmability and Scalability] (http://research.microsoft.com/apps/pubs/default.aspx?id=210931)
+* [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)
 
@@ -253,6 +253,8 @@ Full Cluster Geo-replication](tiered-replication-a-cost-effective-alternative-to
 
 * :scroll: [Warp: Multi-Key Transactions for Key-Value Stores](../datastores/warp-multi-key-transactions-for-key-value-stores.pdf)
 
+* :scroll: [Spartan: A distributed array framework with smart tiling](../datastores/spartan-a-distributed-array-framework-with-smart-tiling.pdf)
+
 ### Physics
 
 * :scroll: [“On the Electrodynamics of Moving Bodies” (1905) — Einstein](../physics/on-the-electrodynamics-of-moving-bodies.pdf)

gossip/README.md

@@ -1,7 +1,7 @@
 ## Gossip 
 
 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)
+* [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.
@@ -16,6 +16,6 @@ Briefly, a peer sampling service is a system that maintains a restricted set (pa
 * [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)
+* [A Gossip-Style Failure Detection Service](https://ecommons.cornell.edu/bitstream/handle/1813/7341/98-1687.pdf)
 * [The ϕ Accrual Failure Detector ](http://ddg.jaist.ac.jp/pub/HDY+04.pdf)
 

information_retrieval/README.md

@@ -47,5 +47,5 @@ The included documents are
 
 * [:scroll:](hits.pdf) [Hits Algorithm](https://www.cs.cornell.edu/home/kleinber/auth.pdf) - Jon M. Kleinberg
 
-This paper introduces the HITS algorithm, a link analysis algorithm that rates webpages. Unlike the more famous page rank algorithm, the hits algorithm makes a distinction between webpage behavior   classifies them as hubs and autho  rities. A page is authoratitative (in the sense the page has a large number of  incoming links) or acts as a hub (a directory of sort, which can be measured by the number of outgoing link). The hits algorithm computes two scores for a page (authority and hub score) where the algorithm iteratively computes the hub  score as sum of authority scores of outgoing links and authority scores as sum  of hub scores of incoming links until a convergence is attained. These scores can then be used to rank documents. While this algorithm is famous in academia, its not very widely used in the industry (a variant of this algorithm was used by a company called Teoma which was acquired by AskJeeves)
+This paper introduces the HITS algorithm, a link analysis algorithm that rates webpages. Unlike the more famous page rank algorithm, the hits algorithm makes a distinction between webpage behavior   classifies them as hubs and authorities. A page is authoratitative (in the sense the page has a large number of  incoming links) or acts as a hub (a directory of sort, which can be measured by the number of outgoing link). The hits algorithm computes two scores for a page (authority and hub score) where the algorithm iteratively computes the hub  score as sum of authority scores of outgoing links and authority scores as sum  of hub scores of incoming links until a convergence is attained. These scores can then be used to rank documents. While this algorithm is famous in academia, its not very widely used in the industry (a variant of this algorithm was used by a company called Teoma which was acquired by AskJeeves)
   

operating_systems/README.md

@@ -1,13 +1,27 @@
 ## Operating Systems 
 
-* [Xen and the Art of Virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)
+* :scroll: [The UNIX Time-Sharing System](unix-time-sharing-system.pdf)
 
 * [The operating system: should there be one?](http://plosworkshop.org/2013/preprint/kell.pdf)
 
 * [The Scalable Commutativity Rule: Designing Scalable Software for Multicore Processors](https://people.csail.mit.edu/nickolai/papers/clements-sc.pdf)
 
+## System Virtualization
+
+* [Xen and the Art of Virtualization](http://www.cl.cam.ac.uk/research/srg/netos/papers/2003-xensosp.pdf)
+
+* :scroll: [kvm: the Linux Virtual Machine Monitor](kvm-linux-virtual-machines-monitor.pdf)
+
+### Live migration of Virtual Machines
+
 * :scroll: [Live Migration of Virtual Machines](live-migration-of-virtual-machines.pdf)
 
+## Jails and containers
+
 * :scroll: [Jails: Confining the omnipotent root.](https://us-east.manta.joyent.com/bcantrill/public/ppwl-cantrill-jails.pdf)
 
 * :scroll: [Solaris Zones: Operating System Support for Consolidating Commercial Workloads](https://us-east.manta.joyent.com/bcantrill/public/ppwl-cantrill-zones.pdf)
+
+
+
+

quantum_computing/README.md

@@ -2,4 +2,8 @@
 
 ## Included Papers
 
-* [:scroll:](advance_in_quantum_machine_learning.pdf) [Advances in quantum machine learning (2015)](https://arxiv.org/abs/1512.02900) (Jeremy Adcock, Euan Allen, Matthew Day, Stefan Frick, Janna Hinchliff, Mack Johnson, Sam Morley-Short, Sam Pallister, Alasdair Price, Stasja Stanisic)
+* [:scroll:](advance_in_quantum_machine_learning.pdf) [Advances in quantum machine learning (2015)](https://arxiv.org/abs/1514.02900) (Jeremy Adcock, Euan Allen, Matthew Day, Stefan Frick, Janna Hinchliff, Mack Johnson, Sam Morley-Short, Sam Pallister, Alasdair Price, Stasja Stanisic)
+
+* [:scroll:](shors_algorithm.pdf) [Shors algorithm for polynomial time prime factorization (1995)](https://arxiv.org/pdf/quant-ph/9508027.pdf) (Peter W Shor)
+
+* [:scroll:](grovers_algorithm.pdf) [A fast quantum mechanical algorithm for database search](https://arxiv.org/pdf/quant-ph/9605043.pdf) (Lov K. Grover)

streaming_algorithms/README.md

@@ -0,0 +1,7 @@
+ ## Streaming Algorithms
+ 
+ [Counting large numbers of events in small registers](http://www.inf.ed.ac.uk/teaching/courses/exc/reading/morris.pdf) by Robert Morris
+ 
+ [Probabilistic Counting Algorithms for Data Base Applications](http://algo.inria.fr/flajolet/Publications/FlMa85.pdf) by Philppe Flajolet, Nigel Martin
+ 
+ [The Space Complexity of Approximating the Frequency Moments](http://www.cs.ucsb.edu/~veronika/MAE/spacecomplexityapproxfreqmoments_alon_99.pdf) by Noga Alon, Yossi Matias, Mario Szegedy

systematic_review/README.md

@@ -0,0 +1,3 @@
+## Systematic Review
+
+* :scroll: [Systematic Review in Software Engineering](http://www.elizabete.com.br/site/Outros/Entradas/2012/11/19_Revisao_Sistematica_files/ConceitosRevisaoSistematica_Biolchini.pdf)

time_series/README.md

@@ -17,7 +17,14 @@ The included documents are:
   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. 
-
+  operators which cover a wide set of typical applications.
 
+* [:scroll:](https://github.com/papers-we-love/papers-we-love/blob/master/time_series/ts-asap.pdf)
+  [ASAP: Automatic Smoothing for Attention Prioritization in Streaming Time Series Visualization](http://futuredata.stanford.edu/asap/)  - Kexin Rong, Peter Bailis
 
+  Time Series smoothing method to better prioritize attention in time series
+  exploration and monitoring visualizations, smooth the time series as much as
+  possible to remove noise while still retaining large-scale structure. We
+  develop a new technique for automatically smoothing streaming time series
+  that adaptively optimizes this trade-off between noise reduction (i.e.,
+  variance) and outlier retention (i.e., kurtosis).