The Philadelphia chapter of Papers We Love
What was the last paper within the realm of computing you read and loved? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research paper with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper. Otherwise, just come, listen, and discuss in a low ego, friendly environment.
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Sign-up: Please RSVP for meetings via Meetup.com
Info about the venue:
* check in at the front desk
* meeting will be on the 18th floor
* doors lock at six, so go around to the back of the building if you arrive late, and security will let you in.
Márk Jelasity, Rachid Guerraoui, Anne-Marie Kermarrec, and Maarten Van Steen. "The peer sampling service: Experimental evaluation of unstructured gossip-based implementations." In ACM/IFIP/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing, pp. 79-98. Springer, Berlin, Heidelberg, 2004.
Self-organizing algorithms enable the design of fully decentralized computing systems with useful properties that emulate those found in nature, such as adapting to changing conditions or self-healing when damaged. Many…
As software becomes more and more integrated in our daily lives, we
need, more than ever, for the software we write to work reliably in a
wide range of conditions--even, and especially, in unexpected
conditions. This paper, written by Robert Rasmussen from the Jet
Propulsion Laboratory, documents and explains some fundamental
principles about designing fault tolerant systems as learned through
the hard-won experience of designing Guidance, Navigation, and Control
(GN&C) systems for spacecraft. This paper is rich in principles,
examples, and advice, and has a lot to offer to our industry
generally--even if we don't actively work on software for spaceships!
Link to paper: https://trs.jpl.nasa.gov/bitstream/handle/2014/41696/08-0125.pdf?sequence=1
Presenter: Jon Moore - ht…
Scaling Visual Search with Locally Optimized Product Quantization
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search.
Yannis Kalantidis and Yannis Avrithi.
2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2014.
Approximate nearest neighbor (ANN) search is an essential technique for big data applications, and has only become more relevant as the scale of our data has increased dramatically in the past decade. At Curalate, we use ANN to power our visual search technology that enables our clients to identitfy apparel products in user-generated photos from social networks.
Kalantidis and Avrithi present an extremely fast and accurate ANN algorithm in their paper "Locally Optimized Product Quantization for Approximate Nearest Neighbor Se…
Harvest, Yield, and Scalable Tolerant Systems and Cluster-Based Scalable Network Services
The CAP theorem is one of the defining blocks of how we talk about and build distributed systems. We use its tenets to understand how a system is going to behave in the case of failure and what kind of measures we can take to prevent or alleviate them. We'll learn how it came to be and why it's still so important today, especially when dealing with servers and services in the cloud.
This lecture will not assume any background in distributed systems research from the audience.
Food and drinks will be available at 6:30PM and the talk will start at 7PM.
Harvest, Yield, and Scalable Tolerant Systems paper: https://www…
From System F to Typed Assembly Language
by Greg Morrisett, David Walker, Karl Crary and Neal Glew
We motivate the design of a typed assembly language (TAL) and present a type-preserving translation from System F to TAL. The typed assembly language we present is based on a conventional RISC assembly language, but its static type system provides support for enforcing high-level language abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the typing constructs admit many low-level compiler optimizations. Our translation to TAL is specified as a sequence of type-preserving transformations, including CPS and closure conversion phases; type-correct source programs are mapped to type-correct assembly language. A key contribution is an approach to polymorphic closure conversion that is considerably simpler than previous work. The …
Thanks to PromptWorks for hosting, and Comcast for the food!…