<?xml version="1.0" encoding="UTF-8"?>
 <rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:cc="http://web.resource.org/cc/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:admin="http://webns.net/mvcb/">
  <channel rdf:about="http://pinboard.in">
    <title>Pinboard (bpo)</title>
    <link>https://pinboard.in/u:bpo/public/</link>
    <description>recent bookmarks from bpo</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://dl.acm.org/doi/10.1145/3357223.3362735"/>
	<rdf:li rdf:resource="http://jeffhuang.com/best_paper_awards.html"/>
	<rdf:li rdf:resource="https://blog.acolyer.org/2016/07/12/goods-organizing-googles-datasets/"/>
	<rdf:li rdf:resource="https://github.com/hioa-cs/IncludeOS/blob/master/doc/papers/IncludeOS_IEEE_CloudCom2015_PREPRINT.pdf"/>
	<rdf:li rdf:resource="http://blog.acolyer.org/2016/02/22/includeos/"/>
	<rdf:li rdf:resource="http://blog.acolyer.org/2016/02/16/capability-myths-demolished/"/>
	<rdf:li rdf:resource="https://www.usenix.org/conference/nsdi14/technical-sessions/dragojevi%C4%87"/>
	<rdf:li rdf:resource="http://journals.ametsoc.org/doi/abs/10.1175/WCAS-D-11-00052.1?journalCode=wcas&amp;"/>
	<rdf:li rdf:resource="http://research.google.com/pubs/pub41344.html"/>
	<rdf:li rdf:resource="http://arxiv.org/pdf/1307.3207v1.pdf"/>
	<rdf:li rdf:resource="http://harmful.cat-v.org/cat-v/unix_prog_design.pdf"/>
	<rdf:li rdf:resource="http://static.usenix.org/publications/library/proceedings/lisa97/full_papers/20.evard/20_html/main.html"/>
	<rdf:li rdf:resource="http://journal.sjdm.org/12/12810/jdm12810.html"/>
	<rdf:li rdf:resource="http://arxiv.org/pdf/1208.2534v1.pdf"/>
	<rdf:li rdf:resource="http://research.iu.hio.no/papers/virt.pdf"/>
	<rdf:li rdf:resource="http://chunghay.com/cyborg/Pang12-FlexStrainGaugeSensrNanofibr.pdf"/>
	<rdf:li rdf:resource="http://cfengine.com/markburgess/papers/totalfield.pdf"/>
	<rdf:li rdf:resource="http://www.nature.com/ncomms/journal/v2/n8/full/ncomms1454.html"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1107.3689"/>
	<rdf:li rdf:resource="http://www.cooley.com/files/84043_VF2011Q2.pdf"/>
	<rdf:li rdf:resource="http://www.cs.cmu.edu/~harchol/Papers/actual-icde-submission.pdf"/>
	<rdf:li rdf:resource="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1572705"/>
	<rdf:li rdf:resource="http://emergencysocialdata.posterous.com/the-case-for-integrating-crisis-response-with-0"/>
	<rdf:li rdf:resource="http://www.searchenginecaffe.com/2010/07/sigir-2010-workshops-crowdsourcing-for.html"/>
	<rdf:li rdf:resource="http://ids.snu.ac.kr/w/images/9/98/SC17.pdf"/>
	<rdf:li rdf:resource="http://wiki.freebase.com/images/e/e0/Hcomp10-anatomy.pdf"/>
	<rdf:li rdf:resource="http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html/"/>
	<rdf:li rdf:resource="http://research.yahoo.com/pub/2808"/>
	<rdf:li rdf:resource="http://www.cnr.berkeley.edu/ucce50/ag-labor/7research/7calag06.htm"/>
	<rdf:li rdf:resource="http://docs.google.com/viewer?a=v&amp;q=cache:ukpjkDLapwkJ:www.cl.cam.ac.uk/techreports/UCAM-CL-TR-754.pdf+cambridge+three+card+monte+valet&amp;hl=en&amp;gl=us&amp;pid=bl&amp;srcid=ADGEESiLzaDYH6wkg7Y7tUbOFkzOgfIkRjVZ4XRVulLRRb7quZBizP-IYEzCxe8DQ8Qe1Yjb0Dvk_5AHQ9WMUfujieav_p0Dt65ZsEj_xqJhAeU2R4ghBGgM4tYCWlZbkVjSvBpG7U7Z&amp;sig=AHIEtbQwhKncpGkClP39aYjYR19c7B9I3g"/>
	<rdf:li rdf:resource="http://journal.r-project.org/current.html"/>
	<rdf:li rdf:resource="http://blogs.sun.com/jrose/resource/pres/200910-VMIL.pdf"/>
	<rdf:li rdf:resource="http://www.fcc.gov/stage/pdf/Berkman_Center_Broadband_Study_13Oct09.pdf"/>
	<rdf:li rdf:resource="http://www.jstor.org/pss/2346806"/>
	<rdf:li rdf:resource="http://pages.stern.nyu.edu/~panos/publications/kdd2008.pdf"/>
	<rdf:li rdf:resource="http://www.thehowlingfantods.com/thesisteddywayne.htm"/>
	<rdf:li rdf:resource="http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html/index.html"/>
	<rdf:li rdf:resource="http://blogs.parc.com/blog/2009/07/experimenting-on-mechanical-turk-5-how-tos/"/>
	<rdf:li rdf:resource="http://jfm3.org/phosphorous.pdf"/>
	<rdf:li rdf:resource="http://www.aclweb.org/anthology/W/W09/W09-1904.pdf"/>
	<rdf:li rdf:resource="http://www.cs.mcgill.ca/~icml2009/papers/96.pdf"/>
	<rdf:li rdf:resource="http://www.math.upenn.edu/~wilf/website/recounting.pdf"/>
	<rdf:li rdf:resource="http://people.redhat.com/drepper/cpumemory.pdf"/>
	<rdf:li rdf:resource="http://citeseer.ist.psu.edu/bonwick94slab.html"/>
	<rdf:li rdf:resource="http://research.microsoft.com/~carlk/papers/algsweb.ps"/>
	<rdf:li rdf:resource="http://www.allthingsdistributed.com/2007/10/amazons_dynamo.html"/>
	<rdf:li rdf:resource="http://www.cis.upenn.edu/~bcpierce/courses/670Fall04/GreatWorksInPL.shtml"/>
	<rdf:li rdf:resource="http://www.bootstrap.org/institute/bibliography.html"/>
	<rdf:li rdf:resource="http://mekentosj.com/papers/"/>
	<rdf:li rdf:resource="http://labs.google.com/papers/mapreduce.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://dl.acm.org/doi/10.1145/3357223.3362735">
    <title>Seamless Offloading of Web App Computations From Mobile Device to Edge Clouds via HTML5 Web Worker Migration | Proceedings of the ACM Symposium on Cloud Computing</title>
    <dc:date>2020-01-31T07:16:21+00:00</dc:date>
    <link>https://dl.acm.org/doi/10.1145/3357223.3362735</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Future mobile applications, such as mobile cloud gaming or augmented reality, require not only high computation power but strict latency constraints. To provide computing resources with ultra-low latency, a new form of cloud infrastructure called edge cloud has been proposed, which distributes computing servers at the edges of the network. A primary concern of edge cloud is that a physical server running a service can change as the client moves, so the service has to be quickly migrated between servers for seamless computation offloading.

This paper tackles the issue in the context of web applications, whose computation-intensive codes are written in JavaScript and webassembly. The basic building block of our system is a mobile web worker, which extends HTML5 web worker to support migration across the client, edge, and cloud servers. Our system migrates a mobile web worker from mobile device to an edge server to minimize execution latency. The immigrated worker can move again to other servers for better performance or service recovery. To implement the runtime migration of the worker, we use a novel serialization algorithm that captures the web worker state where webassembly functions and JavaScript objects are intermingled. Experimental result showed that our system could successfully migrate a non-trivial web worker running webassembly-version OpenCV within a few seconds, and achieved up to 8.4x speedup compared to offloading of pure JavaScript.]]></description>
<dc:subject>paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:0e53539eea10/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jeffhuang.com/best_paper_awards.html">
    <title>Best Paper Awards in Computer Science (since 1996)</title>
    <dc:date>2018-07-14T15:00:13+00:00</dc:date>
    <link>http://jeffhuang.com/best_paper_awards.html</link>
    <dc:creator>bpo</dc:creator><dc:subject>paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:0261cf06c7f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://blog.acolyer.org/2016/07/12/goods-organizing-googles-datasets/">
    <title>Goods: organizing Google’s datasets | the morning paper</title>
    <dc:date>2016-07-12T22:03:12+00:00</dc:date>
    <link>https://blog.acolyer.org/2016/07/12/goods-organizing-googles-datasets/</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Everyone within the company just carries on creating and consuming datasets using whatever means they prefer, and Goods works in the background to figure out what datasets exist and to gather metadata about them. In other words, (surprise!) Google built a crawling engine… It turns out this is far from an easy problem (to start with, the current catalog indexes over 26 billion datasets – and this is just those whose access permissions make them readable by all Google engineers). As an approach to the problem of understanding what data exists, where it is, and its provenance, I find Goods hugely appealing vs the reality of the ever-losing battle for strict central control within an enterprise.]]></description>
<dc:subject>google data paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:5cd432c5a5b6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:google"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://github.com/hioa-cs/IncludeOS/blob/master/doc/papers/IncludeOS_IEEE_CloudCom2015_PREPRINT.pdf">
    <title>IncludeOS: A minimal, resource efficient unikernel for cloud systems</title>
    <dc:date>2016-02-29T02:47:13+00:00</dc:date>
    <link>https://github.com/hioa-cs/IncludeOS/blob/master/doc/papers/IncludeOS_IEEE_CloudCom2015_PREPRINT.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[The mechanism used for extracting only what is needed from the operating system, is the one provided by default by modern linkers. Each part of the OS is compiled into an object-file, such as ip4.o, udp.o, pci_device.o etc., which are then combined using ar to form a static library os.a. When a program links with this library, only what’s necessary will automatically be extracted by the linker and end up in the final binary. To facilitate this build process a custom GCC-toolchain has been created.]]></description>
<dc:subject>paper unikernel</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:79fc48cac5fd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:unikernel"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.acolyer.org/2016/02/22/includeos/">
    <title>IncludeOS: A minimal, resource efficient unikernel for cloud systems | the morning paper</title>
    <dc:date>2016-02-28T18:55:20+00:00</dc:date>
    <link>http://blog.acolyer.org/2016/02/22/includeos/</link>
    <dc:creator>bpo</dc:creator><dc:subject>unikernel paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:aa173b32c5b8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:unikernel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blog.acolyer.org/2016/02/16/capability-myths-demolished/">
    <title>Capability Myths Demolished | the morning paper</title>
    <dc:date>2016-02-16T13:36:19+00:00</dc:date>
    <link>http://blog.acolyer.org/2016/02/16/capability-myths-demolished/</link>
    <dc:creator>bpo</dc:creator><description><![CDATA["Furthermore, the properties we identified show that capability systems lack certain fatal flaws of ACL systems – namely, the susceptibility of ACLS to the confused deputy problems that are inherent in ambient authority systems, and the inability of ACLs to perform least-privilege delegation to new processes. Capability-based systems provide much stronger support for the precise, minimal, and meaningful delegation of authority, which is fundamental to secure operation."]]></description>
<dc:subject>security paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:db34956d90cc/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.usenix.org/conference/nsdi14/technical-sessions/dragojevi%C4%87">
    <title>FaRM: Fast Remote Memory | USENIX</title>
    <dc:date>2015-06-13T03:05:57+00:00</dc:date>
    <link>https://www.usenix.org/conference/nsdi14/technical-sessions/dragojevi%C4%87</link>
    <dc:creator>bpo</dc:creator><dc:subject>paper distributed memory</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:618c15b6ca03/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:memory"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://journals.ametsoc.org/doi/abs/10.1175/WCAS-D-11-00052.1?journalCode=wcas&amp;">
    <title>AMS Journals Online - Weather and Individual Happiness</title>
    <dc:date>2014-01-14T23:30:11+00:00</dc:date>
    <link>http://journals.ametsoc.org/doi/abs/10.1175/WCAS-D-11-00052.1?journalCode=wcas&amp;</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[This paper investigates the influence of weather on happiness. While previous studies have examined climatic influence by comparing the well-being of people living in different regions, this paper focuses on how daily changes in weather affect individuals living in a single location. The dataset consists of 516 days of data on 75 students from Osaka University. Daily information on outside events, as well as the daily physical condition and individual characteristics of the respondents, are used as controls. Subjective happiness is related to temperature: in a quadratic model, happiness is maximized at 13.9°C. The effects of other meteorological variables—humidity, wind speed, precipitation, and sunshine—are not significant. The sensitivity of happiness to temperature also depends on attributes such as sex, age, and academic department. Happiness is more strongly affected by current temperature than by average temperature over the day. While enjoyment (a positive affect measure) is affected by weather in a similar way to happiness, sadness and depression (negative affect measures) behave somewhat differently.]]></description>
<dc:subject>happiness paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:581bca041ff6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:happiness"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.google.com/pubs/pub41344.html">
    <title>F1: A Distributed SQL Database That Scales</title>
    <dc:date>2013-10-17T19:41:56+00:00</dc:date>
    <link>http://research.google.com/pubs/pub41344.html</link>
    <dc:creator>bpo</dc:creator><dc:subject>database sql paper research google</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:c6ccec92b6fd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:sql"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:google"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/pdf/1307.3207v1.pdf">
    <title>Scalable Eventually Consistent Counters over Unreliable Networks</title>
    <dc:date>2013-08-21T05:59:33+00:00</dc:date>
    <link>http://arxiv.org/pdf/1307.3207v1.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Counters are an important abstraction in distributed computing, and play a central role in large scale geo-replicated systems, counting events such as web page impressions or social network "likes". Classic distributed counters, strongly consistent, cannot be made both available and partition-tolerant, due to the CAP Theorem, being unsuitable to large scale scenarios. This paper defines Eventually Consistent Distributed Counters (ECDC) and presents an implementation of the concept, Handoff Counters, that is scalable and works over unreliable networks. By giving up the sequencer aspect of classic distributed counters, ECDC implementations can be made AP in the CAP design space, while retaining the essence of counting. Handoff Counters are the first CRDT (Conflict-free Replicated Data Type) based mechanism that overcomes the identity explosion problem in naive CRDTs, such as G-Counters (where state size is linear in the number of independent actors that ever incremented the counter), by managing identities towards avoiding global propagation and garbage collecting temporary entries. The approach used in Handoff Counters is not restricted to counters, being more generally applicable to other data types with associative and commutative operations.]]></description>
<dc:subject>distributed systems paper counters pdf crdt</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:bed128be9821/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:counters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:pdf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crdt"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://harmful.cat-v.org/cat-v/unix_prog_design.pdf">
    <title>Program Design in the UNIX Environment</title>
    <dc:date>2013-08-16T22:10:46+00:00</dc:date>
    <link>http://harmful.cat-v.org/cat-v/unix_prog_design.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Much of the power of the UNIX operating system comes from a style of program design that makes programs easy to use and, more important, easy to combine with other programs. This style has been called the use of software tools, and depends more on how the programs fit into the programming environment — how they can be used with other programs — than on how they are designed internally. But as the system has become commercially successful and has spread widely, this style has often been compromised, to the detriment of all users. Old programs have become encrusted with dubious features. Newer programs are not always written with attention to proper separation of function and design for interconnection. This paper discusses the elements of program design, showing by example good and bad design, and indicates some possible trends for the future.

---

The key to problem-solving on the UNIX system is to identify the right primitive operations and to put them at the right place. UNIX programs tend to solve general problems rather than special cases. In a very loose sense, the programs are orthogonal, spanning the space of jobs to be done (although with a fair amount of overlap for reasons of history, convenience or efficiency). Functions are placed where they will do the most good: there shouldn’t be a pager in every program that produces output any more than there should be filename pattern matching in every program that uses filenames.

One thing that UNIX does not need is more features. It is successful in part because it has a small number of good ideas that work well together. Merely adding features does not make it easier for users to do things — it just makes the manual thicker. The right solution in the right place is always more effective than haphazard hacking.]]></description>
<dc:subject>unix programming design paper tools</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:679e8c2ea4d0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:unix"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:tools"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://static.usenix.org/publications/library/proceedings/lisa97/full_papers/20.evard/20_html/main.html">
    <title>An analysis of UNIX system configuration - LISA 97</title>
    <dc:date>2013-03-17T21:53:52+00:00</dc:date>
    <link>http://static.usenix.org/publications/library/proceedings/lisa97/full_papers/20.evard/20_html/main.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Management of operating system configuration files is an essential part of UNIX systems administration. It is particularly difficult in environments with a large number of computers.

This paper presents a study of UNIX configuration file management. It compares existing systems and tools from the literature, presents several case studies of configuration file management in practice, examines one site in depth, and makes numerous observations on the configuration process.]]></description>
<dc:subject>paper sysadmin unix</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:e690af31c812/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:sysadmin"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:unix"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://journal.sjdm.org/12/12810/jdm12810.html">
    <title>The nonsense math effect</title>
    <dc:date>2013-02-12T01:32:34+00:00</dc:date>
    <link>http://journal.sjdm.org/12/12810/jdm12810.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Mathematics is a fundamental tool of research. Although potentially applicable in every discipline, the amount of training in mathematics that students typically receive varies greatly between different disciplines. In those disciplines where most researchers do not master mathematics, the use of mathematics may be held in too much awe. To demonstrate this I conducted an online experiment with 200 participants, all of which had experience of reading research reports and a postgraduate degree (in any subject). Participants were presented with the abstracts from two published papers (one in evolutionary anthropology and one in sociology). Based on these abstracts, participants were asked to judge the quality of the research. Either one or the other of the two abstracts was manipulated through the inclusion of an extra sentence taken from a completely unrelated paper and presenting an equation that made no sense in the context. The abstract that included the meaningless mathematics tended to be judged of higher quality. However, this "nonsense math effect" was not found among participants with degrees in mathematics, science, technology or medicine.]]></description>
<dc:subject>paper math</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:c8cac41a7592/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:math"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/pdf/1208.2534v1.pdf">
    <title>Locating the Source of Diffusion in Large-Scale Networks</title>
    <dc:date>2012-08-16T02:15:03+00:00</dc:date>
    <link>http://arxiv.org/pdf/1208.2534v1.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks—such as the Internet or the human social graph—it is usually infeasible to observe the state of all nodes in a network. We show that it is fundamentally possible to estimate the location of the source from measurements collected by sparsely-placed observers. We present a strategy that is optimal for arbitrary trees, achieving maximum probability of correct localization. We describe efficient implementations with complexity O(Nα), where α = 1 for arbitrary trees, and α = 3 for arbitrary graphs. In the context of several case studies, we determine how localization accuracy is affected by various system parameters, including the structure of the network, the density of observers, and the number of observed cascades.]]></description>
<dc:subject>network paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:c17bd46ba27e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:network"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.iu.hio.no/papers/virt.pdf">
    <title>Adaptive provisioning using virtual machines and autonomous role-based management</title>
    <dc:date>2012-08-14T18:05:10+00:00</dc:date>
    <link>http://research.iu.hio.no/papers/virt.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[A modern server system must deliver a complex set of obli- gations towards its users. We study the concept of roles as au- tonomous encapsulations of a set of promises. Using virtualiza- tion and configuration management, every defined role for a real- life computer system can be realized as a self managing agent that is aware of other, related roles within the same broader context. A prototype implementation that provides web hotel services for customers is presented and discussed.]]></description>
<dc:subject>paper infrastructure cfengine</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:4ae1663c27fd/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:infrastructure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:cfengine"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://chunghay.com/cyborg/Pang12-FlexStrainGaugeSensrNanofibr.pdf">
    <title>A flexible and highly sensitive strain-gauge sensor using reversible interlocking of nanofibres</title>
    <dc:date>2012-07-31T01:35:42+00:00</dc:date>
    <link>http://chunghay.com/cyborg/Pang12-FlexStrainGaugeSensrNanofibr.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Flexible skin-attachable strain-gauge sensors are an essential component in the development of artificial systems that can mimic the complex characteristics of the human skin. In general, such sensors contain a number of circuits or complex layered matrix arrays. Here, we present a simple architecture for a flexible and highly sensitive strain sensor that enables the detection of pressure, shear and torsion. The device is based on two interlocked arrays of high-aspect-ratio Pt-coated polymeric nanofibres that are supported on thin polydimethylsiloxane layers. When different sensing stimuli are applied, the degree of interconnection and the electrical resistance of the sensor changes in a reversible, directional manner with specific, discernible strain-gauge factors. The sensor response is highly repeatable and reproducible up to 10,000 cycles with excellent on/off switching behaviour. We show that the sensor can be used to monitor signals ranging from human heartbeats to the impact of a bouncing water droplet on a superhydrophobic surface.]]></description>
<dc:subject>qs sensor paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:b91beba8f570/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:qs"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:sensor"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://cfengine.com/markburgess/papers/totalfield.pdf">
    <title>On system rollback and totalised fields: An algebraic approach to system change</title>
    <dc:date>2012-02-06T20:59:23+00:00</dc:date>
    <link>http://cfengine.com/markburgess/papers/totalfield.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA["In system operations the term rollback is often used to imply that arbitrary changes can be reversed i.e. ‘rolled back’ from an erroneous state to a previously known acceptable state. We show that this assumption is ﬂawed and discuss error-correction schemes based on absolute rather than relative change."

"By formulating this problem algebraically, the discussion is distanced from the sometimes emotional standpoints that bind system administrators to the notion of rollback: desperately wanting does not make it possible. The discussion about totalisation of ﬁelds is particularly useful, as it maps nicely to the ﬂaws in this thinking. To deal with the inverse of a many-to-one map, one must invoke a policy or arbitrary selection."]]></description>
<dc:subject>paper deployment cfengine automation</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:6a321abf7798/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:deployment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:cfengine"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:automation"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.nature.com/ncomms/journal/v2/n8/full/ncomms1454.html">
    <title>Reverse electrowetting as a new approach to high-power energy harvesting : Nature Communications : Nature Publishing Group</title>
    <dc:date>2011-09-07T23:30:14+00:00</dc:date>
    <link>http://www.nature.com/ncomms/journal/v2/n8/full/ncomms1454.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Over the last decade electrical batteries have emerged as a critical bottleneck for portable electronics development. High-power mechanical energy harvesting can potentially provide a valuable alternative to the use of batteries, but, until now, a suitable mechanical-to-electrical energy conversion technology did not exist. Here we describe a novel mechanical-to-electrical energy conversion method based on the reverse electrowetting phenomenon. Electrical energy generation is achieved through the interaction of arrays of moving microscopic liquid droplets with novel nanometer-thick multilayer dielectric films. Advantages of this process include the production of high power densities, up to 103 W m−2; the ability to directly utilize a very broad range of mechanical forces and displacements; and the ability to directly output a broad range of currents and voltages, from several volts to tens of volts. These advantages make this method uniquely suited for high-power energy harvesting from a wide variety of environmental mechanical energy sources.]]></description>
<dc:subject>cyborg nature paper sensor</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:18ee9cec4a24/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:cyborg"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:nature"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:sensor"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1107.3689">
    <title>[1107.3689] Edit wars in Wikipedia</title>
    <dc:date>2011-08-16T16:40:59+00:00</dc:date>
    <link>http://arxiv.org/abs/1107.3689</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[We present a new, efficient method for automatically detecting severe conflicts `edit wars' in Wikipedia and evaluate this method on six different language WPs. We discuss how the number of edits, reverts, the length of discussions, the burstiness of edits and reverts deviate in such pages from those following the general workflow, and argue that earlier work has significantly over-estimated the contentiousness of the Wikipedia editing process.]]></description>
<dc:subject>wikipedia language analysis paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:3d27ff11ee72/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:wikipedia"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cooley.com/files/84043_VF2011Q2.pdf">
    <title>Cooley Venture Financing Report: Q2 2011 - A Robust Financing Environment</title>
    <dc:date>2011-08-16T04:37:18+00:00</dc:date>
    <link>http://www.cooley.com/files/84043_VF2011Q2.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[After seeing a slow and uneven recovery in general financing trends in late 2010 and Q1 2011, the second quarter of 2011 produced significant increases in both deal volume and dollars raised. In Q2 2011, we handled 112 deals representing more than $2 billion in invested capital, a dollar amount not seen since 2006. Additionally, the percentage of up rounds increased in Q2 2011 to approximately 72% of deals. Median pre-money valuations for all deal stages also increased in Q2. Most significantly, average valuations for Series A deals rose to $8 million, a level not seen since Q3 2010. In another signal of a strong environment, we saw a sharp increase in the number of deals with a pre-money valuation greater than $100 million from the prior quarter.

Second quarter deal terms also pointed to increased optimism on the part of investors. Liquidation preferences of greater than 1x decreased in all financing stages. Additionally, we observed a continuing trend of decreases in percentage of deals with participating preferred provisions. This decrease was most striking in Series B deals during the quarter.

Deal terms in other areas painted a mixed environment. We observed a decrease in the percentage of deals utilizing pay-to-play provisions to the lowest level seen since Q4 2007. This decrease was most pronounced in Series C deals. However, we also witnessed an increase in both tranched deals and the use of drag-alone provisions from the prior quarter.]]></description>
<dc:subject>startup funding paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:01406c783610/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:startup"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:funding"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.cmu.edu/~harchol/Papers/actual-icde-submission.pdf">
    <title>Priority Mechanisms for OLTP and Transactional Web Applications</title>
    <dc:date>2011-06-02T23:35:47+00:00</dc:date>
    <link>http://www.cs.cmu.edu/~harchol/Papers/actual-icde-submission.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of these applications is the performance bottleneck. Given the limited resources available to the database, transaction execution times can vary wildly as they compete and wait for critical resources. As the competitor is “only a click away,” valuable (high-priority) users must be ensured consistently good performance via QoS and transaction prioritization.

This paper analyzes and proposes prioritization for transactional workloads in conventional DBMS. This work ﬁrst conducts a detailed bottleneck analysis of resource usage by transactional workloads on commercial and noncommercial database systems (IBM DB2, PostgreSQL, Shore) under a variety of conﬁgurations. Our ﬁrst contribution is a demonstration that for TPC-C workloads, under all of the above DBMS, transaction execution times are dominated by time spent waiting on locks, whereas for TPC-W workloads, CPU largely dominates transaction execution times. The second component of this work is an implementation and evaluation of several preemptive and non-preemptive prioritization algorithms in PostgreSQL and Shore. The primary contribution is a demonstration that transaction prioritization can provide 3x improvement for high-priority transactions in generalpurpose DBMS. Furthermore, despite evaluating a widerange of scheduling algorithms, we ﬁnd that particularly simple scheduling policies are most effective in improving high-priority without signiﬁcantly penalizing low-priority transactions.]]></description>
<dc:subject>postgres performance analysis paper</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:bpo/b:86ee9d8fa6f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:postgres"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1572705">
    <title>SSRN-Detecting Deceptive Discussions in Conference Calls by David Larcker, Anastasia Zakolyukina</title>
    <dc:date>2010-09-24T04:19:23+00:00</dc:date>
    <link>http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1572705</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[We estimate classification models of deceptive discussions during quarterly earnings conference calls. Using data on subsequent financial restatements (and a set of criteria to identify especially serious accounting problems), we label the Question and Answer section of each call as "truthful" or "deceptive". Our models are developed with the word categories that have been shown by previous psychological and linguistic research to be related to deception. Using conservative statistical tests, we find that the out-of-sample performance of the models that are based on CEO or CFO narratives is significantly better than random by 4%- 6% (with 50% - 65% accuracy) and provides a significant improvement to a model based on discretionary accruals and traditional controls. We find that answers of deceptive executives have more references to general knowledge, fewer non-extreme positive emotions, and fewer references to shareholders value and value creation.
]]></description>
<dc:subject>linguistics finance paper psychology research</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:56156c7c6340/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:linguistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:finance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:psychology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://emergencysocialdata.posterous.com/the-case-for-integrating-crisis-response-with-0">
    <title>The Case for Integrating Crisis Response With Social Media - Emergency Social Data Summit</title>
    <dc:date>2010-08-18T23:48:09+00:00</dc:date>
    <link>http://emergencysocialdata.posterous.com/the-case-for-integrating-crisis-response-with-0</link>
    <dc:creator>bpo</dc:creator><dc:subject>paper social</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:40896e7d59a2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:social"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.searchenginecaffe.com/2010/07/sigir-2010-workshops-crowdsourcing-for.html">
    <title>Jeff's Search Engine Caffè: SIGIR 2010 Workshops: CrowdSourcing for Search Evaluation</title>
    <dc:date>2010-07-28T20:06:20+00:00</dc:date>
    <link>http://www.searchenginecaffe.com/2010/07/sigir-2010-workshops-crowdsourcing-for.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[A main highlight was the CrowdFlower keynote:
Better Crowdsourcing through Automated Methods for Quality Control
CrowdFlower provides commercial support for companies performing tasks on Mechanical Turk. Everyone had great things to say about this talk that kept people enthralled even though it was the end of the day; some said it was the best talk of the conference.
]]></description>
<dc:subject>research crowdsourcing crowdflower paper conference</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:d97871f7c96f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crowdsourcing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crowdflower"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:conference"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://ids.snu.ac.kr/w/images/9/98/SC17.pdf">
    <title>Freebase: A Collaboratively Created Graph Database For Structuring Human Knowledge</title>
    <dc:date>2010-07-08T20:47:13+00:00</dc:date>
    <link>http://ids.snu.ac.kr/w/images/9/98/SC17.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Freebase is a practical, scalable tuple database used to struc- ture general human knowledge. The data in Freebase is collaboratively created, structured, and maintained. Free- base currently contains more than 125,000,000 tuples, more than 4000 types, and more than 7000 properties. Public read/write access to Freebase is allowed through an HTTP- based graph-query API using the Metaweb Query Language (MQL) as a data query and manipulation language. MQL provides an easy-to-use object-oriented interface to the tuple data in Freebase and is designed to facilitate the creation of collaborative, Web-based data-oriented applications.
]]></description>
<dc:subject>paper freebase database</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:253734501229/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:freebase"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:database"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://wiki.freebase.com/images/e/e0/Hcomp10-anatomy.pdf">
    <title>The Anatomy of a Large-Scale Human Computation Engine</title>
    <dc:date>2010-07-06T21:41:47+00:00</dc:date>
    <link>http://wiki.freebase.com/images/e/e0/Hcomp10-anatomy.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[In this paper we describe RABJ (Redundant Array of Brains in a Jar), an engine designed to simplify collecting human input. We have used RABJ to collect over 2.3 million human judgments to augment data mining, data entry, data validation and curation tasks at Freebase over the course of a year. We illustrate several successful applications that have used RABJ to collect human judgment. We describe how the architecture and design decisions of RABJ are affected by the constraints of content agnosticity, data freshness, latency and visibility. We present work aimed at increasing the yield and reliability of human computation efforts. Finally, we discuss empirical observations and lessons learned in the course of a year of operating the service.
]]></description>
<dc:subject>paper computing</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:be8b42b54aa8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:computing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html/">
    <title>Why Events are a Bad Idea (for high-concurrency servers)</title>
    <dc:date>2010-04-26T23:47:50+00:00</dc:date>
    <link>http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html/</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Event-based programming has been highly touted in recent years as the best way to write highly concurrent applications. Having worked on several of these systems, we now believe this approach to be a mistake. Specifically, we believe that threads can achieve all of the strengths of events, including support for high concurrency, low overhead, and a simple concurrency model. Moreover, we argue that threads allow a simpler and more natural programming style.
]]></description>
<dc:subject>architecture concurrency events scalability threads paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:4b315ac06fc4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:architecture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:events"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:scalability"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:threads"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.yahoo.com/pub/2808">
    <title>Financial Incentives and the 'Performance of Crowds' | Yahoo! Research</title>
    <dc:date>2010-02-23T17:44:20+00:00</dc:date>
    <link>http://research.yahoo.com/pub/2808</link>
    <dc:creator>bpo</dc:creator><description><![CDATA["increased financial incentives increase the quantity, but not the quality, of work performed by participants, where the difference appears to be due to an “anchoring” effect: workers who were paid more also perceived the value of their work to be greater, and thus were no more motivated than workers paid less. In contrast with compensation levels, we find the details of the compensation scheme do matter—specifically, a “quota” system results in better work for less pay than an equivalent “piece rate” system. Although counterintuitive, these findings are consistent with previous laboratory studies, and may have real-world analogs as well"
]]></description>
<dc:subject>mechanicalturk crowdsourcing research paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:176c766f8c11/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mechanicalturk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crowdsourcing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cnr.berkeley.edu/ucce50/ag-labor/7research/7calag06.htm">
    <title>Piece Rate Pay Design</title>
    <dc:date>2009-12-20T18:46:17+00:00</dc:date>
    <link>http://www.cnr.berkeley.edu/ucce50/ag-labor/7research/7calag06.htm</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Individual incentive plans offer the clearest link between a worker’s effort and the reward. Probably the best known individual or small group incentive pay plan is piece rate. Piece rate is more suited to repetitive crew work (e.g., boysenberry picking, vineyard pruning) than to precision planting, fertilizing, or irrigating. As the tie between individual work and results is diminished, so is the motivating effect of the incentive on the individual. My on-going research on piece-rate pay spans over two decades, beginning in 1985. The objective of this paper is to summarize much of this work, and give clear and precise suggestions for the effective design of piece rate pay. A number of serious challenges that threaten the effectiveness of this pay method are also included. While my work has been primarily in agriculture, the principles can be easily adapted to other types of work.
]]></description>
<dc:subject>crowdsourcing research paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:e5b5e56d3d32/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crowdsourcing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://docs.google.com/viewer?a=v&amp;q=cache:ukpjkDLapwkJ:www.cl.cam.ac.uk/techreports/UCAM-CL-TR-754.pdf+cambridge+three+card+monte+valet&amp;hl=en&amp;gl=us&amp;pid=bl&amp;srcid=ADGEESiLzaDYH6wkg7Y7tUbOFkzOgfIkRjVZ4XRVulLRRb7quZBizP-IYEzCxe8DQ8Qe1Yjb0Dvk_5AHQ9WMUfujieav_p0Dt65ZsEj_xqJhAeU2R4ghBGgM4tYCWlZbkVjSvBpG7U7Z&amp;sig=AHIEtbQwhKncpGkClP39aYjYR19c7B9I3g">
    <title>Understanding scam victims: seven principles for systems security - Powered by Google Docs</title>
    <dc:date>2009-12-11T19:33:00+00:00</dc:date>
    <link>http://docs.google.com/viewer?a=v&amp;q=cache:ukpjkDLapwkJ:www.cl.cam.ac.uk/techreports/UCAM-CL-TR-754.pdf+cambridge+three+card+monte+valet&amp;hl=en&amp;gl=us&amp;pid=bl&amp;srcid=ADGEESiLzaDYH6wkg7Y7tUbOFkzOgfIkRjVZ4XRVulLRRb7quZBizP-IYEzCxe8DQ8Qe1Yjb0Dvk_5AHQ9WMUfujieav_p0Dt65ZsEj_xqJhAeU2R4ghBGgM4tYCWlZbkVjSvBpG7U7Z&amp;sig=AHIEtbQwhKncpGkClP39aYjYR19c7B9I3g</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[The success of many attacks on computer systems can be traced back to the security engineers not understanding the psychology of the system users they meant to protect. We examine a variety of scams and “short cons” that were investigated, documented and recreated for the BBC TV programme The Real Hustle and we extract from them some general principles about the recurring behavioural patterns of victims that hustlers have learnt to exploit.
We argue that an understanding of these inherent “human factors” vulnerabilities, and the necessity to take them into account during design rather than naïvely shifting the blame onto the “gullible users”, is a fundamental paradigm shift for the security engineer which, if adopted, will lead to stronger and more resilient systems security.
]]></description>
<dc:subject>paper security toread</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:cb8b2abcb804/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:security"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:toread"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://journal.r-project.org/current.html">
    <title>The R Journal</title>
    <dc:date>2009-12-10T18:17:20+00:00</dc:date>
    <link>http://journal.r-project.org/current.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[The R Journal is the refereed journal of the R project for statistical computing.
]]></description>
<dc:subject>stats r math paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:8d440ec4a48c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:stats"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:r"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blogs.sun.com/jrose/resource/pres/200910-VMIL.pdf">
    <title>Bytecodes meet Combinators: invokedynamic on the JVM</title>
    <dc:date>2009-11-30T18:53:27+00:00</dc:date>
    <link>http://blogs.sun.com/jrose/resource/pres/200910-VMIL.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[The Java Virtual Machine (JVM) has been widely adopted in part because of its classfile format, which is portable, compact, modu- lar, verifiable, and reasonably easy to work with. However, it was designed for just one language—Java—and so when it is used to express programs in other source languages, there are often “pain points” which retard both development and execution. The most salient pain points show up at a familiar place, the method call site.
To generalize method calls on the JVM, the JSR 292 Expert Group has designed a new invokedynamic instruction that pro- vides user-defined call site semantics. In the chosen design, invokedynamic serves as a hinge-point between two coexisting kinds of intermediate language: bytecode containing dynamic call sites, and combinator graphs specifying call targets. A dynamic compiler can traverse both representations simultaneously, pro- ducing optimized machine code which is the seamless union of both kinds of input.
]]></description>
<dc:subject>paper programming language jvm</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:a8049f3a6799/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:jvm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.fcc.gov/stage/pdf/Berkman_Center_Broadband_Study_13Oct09.pdf">
    <title>Next Generation Connectivity: A review of broadband Internet transitions and policy from around the world</title>
    <dc:date>2009-10-16T21:39:50+00:00</dc:date>
    <link>http://www.fcc.gov/stage/pdf/Berkman_Center_Broadband_Study_13Oct09.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA["The most surprising finding in our analysis is that open access policies contributed to the success of many of the highest performers during the first broadband transition, and as a result are now at the core of future planning processes in Europe and Japan.Contrary to perceptions in the United States, there is extensive evidence to support the position, adopted almost universally by other advanced economies, that open access policies, where undertaken with serious regulatory engagement, contributed to broadband penetration, capacity, and affordability in the first generation of broadband. We review the evidence here at length."
]]></description>
<dc:subject>web technology research internet paper culture</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:6d454415030f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:web"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:technology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:internet"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:culture"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.jstor.org/pss/2346806">
    <title>Maximum Likelihood Estimation of Observer Error-rates using the EM Algorithm</title>
    <dc:date>2009-09-06T19:03:08+00:00</dc:date>
    <link>http://www.jstor.org/pss/2346806</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[In compiling a patient record many facets are subject to errors of measurement. A model is presented which allows individual error-rates to be estimated for polytomous facets even when the patient's "true" response is not available. The EM algorithm is shown to provide a slow but sure way of obtaining maximum likelihood estimates of the parameters of interest. Some preliminary experience is reported and the limitations of the method are described.
]]></description>
<dc:subject>em algorithms stats mechanicalturk paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:8d420495d767/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:em"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:stats"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mechanicalturk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://pages.stern.nyu.edu/~panos/publications/kdd2008.pdf">
    <title>Get Another Label? Improving Data Quality and Data Mining Using Multiple, Noisy Labelers</title>
    <dc:date>2009-09-06T18:58:52+00:00</dc:date>
    <link>http://pages.stern.nyu.edu/~panos/publications/kdd2008.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[This paper addresses the repeated acquisition of labels for data items when the labeling is imperfect. We examine the improvement (or lack thereof ) in data quality via repeated labeling, and focus especially on the improvement of training labels for supervised induction. With the outsourcing of small tasks becoming easier, for example via Rent-A-Coder or Amazon’s Mechanical Turk, it often is possible to obtain less-than-expert labeling at low cost. With low-cost labeling, preparing the unlabeled part of the data can become considerably more expensive than labeling. We present repeated-labeling strategies of increasing complexity, and show several main results... The bottom line: the results show clearly that when labeling is not perfect, selective acquisition of multiple labels is a strategy that data miners should have in their repertoire; for certain label-quality/cost regimes, the beneﬁt is substantial.
]]></description>
<dc:subject>paper mechanicalturk stats data</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:7df82b17b2ff/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mechanicalturk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:stats"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:data"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.thehowlingfantods.com/thesisteddywayne.htm">
    <title>ADDICTION TO ITSELF</title>
    <dc:date>2009-09-04T17:26:47+00:00</dc:date>
    <link>http://www.thehowlingfantods.com/thesisteddywayne.htm</link>
    <dc:creator>bpo</dc:creator><dc:subject>dfw paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:894473b866f9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:dfw"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html/index.html">
    <title>Why Events Are A Bad Idea for High Concurrency Servers</title>
    <dc:date>2009-08-17T08:34:24+00:00</dc:date>
    <link>http://www.usenix.org/events/hotos03/tech/full_papers/vonbehren/vonbehren_html/index.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Event-based programming has been highly touted in recent years as the best way to write highly concurrent applications. Having worked on several of these systems, we now believe this approach to be a mistake. Specifically, we believe that threads can achieve all of the strengths of events, including support for high concurrency, low overhead, and a simple concurrency model. Moreover, we argue that threads allow a simpler and more natural programming style.
]]></description>
<dc:subject>programming paper performance concurrency threads</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:45a3d82f3d47/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:threads"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blogs.parc.com/blog/2009/07/experimenting-on-mechanical-turk-5-how-tos/">
    <title>Experimenting on Mechanical Turk: 5 How Tos - PARC blog</title>
    <dc:date>2009-07-23T17:42:32+00:00</dc:date>
    <link>http://blogs.parc.com/blog/2009/07/experimenting-on-mechanical-turk-5-how-tos/</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Performing human-subjects experiments on Amazon Mechanical Turk offers many benefits, including very low experiment costs, quick turn-around rates, and relatively simple approvals from human subjects boards. But you have to be careful to avoid bias and error; we describe some techniques...
]]></description>
<dc:subject>mechanicalturk paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:66d7bb441647/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mechanicalturk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://jfm3.org/phosphorous.pdf">
    <title>Phosphorous, the Popular Lisp</title>
    <dc:date>2009-07-10T21:32:00+00:00</dc:date>
    <link>http://jfm3.org/phosphorous.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[We present Phosphorous; a programming language that draws on the power and elegance of traditional Lisps such as Common Lisp and Scheme, yet which brings those languages into the 21st century by ruthless application of our “popular is better” philosophy into all possible areas of programming language design.
]]></description>
<dc:subject>programming language funny lisp java paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:4a46efcac787/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:funny"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:lisp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:java"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.aclweb.org/anthology/W/W09/W09-1904.pdf">
    <title>Data Quality from Crowdsourcing: A Study of Annotation Selection Criteria</title>
    <dc:date>2009-06-23T20:11:17+00:00</dc:date>
    <link>http://www.aclweb.org/anthology/W/W09/W09-1904.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[In this paper, we consider the difﬁcult problem of classifying sentiment in political blog snippets. Annotation data from both expert annotators in a research lab and non-expert annotators recruited from the Internet are examined. Three selection criteria are identiﬁed to select high-quality annotations: noise level, sentiment ambiguity, and lexical uncertainty. Analysis conﬁrm the utility of these criteria on improving data quality.  We conduct an empirical study to examine the effect of noisy annotations on the performance of sentiment classiﬁcation models, and evaluate the utility of annotation selection on classiﬁcation accuracy and efﬁciency.
]]></description>
<dc:subject>crowdsourcing paper nlp mechanicalturk</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:0e9ed0bc77fb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crowdsourcing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:nlp"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mechanicalturk"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cs.mcgill.ca/~icml2009/papers/96.pdf">
    <title>Supervised Learning from Multiple Experts: Whom to Trust when Everyone Lies a Bit</title>
    <dc:date>2009-06-16T23:58:09+00:00</dc:date>
    <link>http://www.cs.mcgill.ca/~icml2009/papers/96.pdf</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[We describe a probabilistic approach for supervised learning when we have multiple experts/annotators providing (possibly noisy) labels but no absolute gold standard. The proposed algorithm evaluates the different experts and also gives an estimate of the actual hidden labels. Experimental results indicate that the proposed method is superior to the commonly used majority voting baseline.
]]></description>
<dc:subject>crowdsourcing mechanicalturk paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:ea19c769e2d5/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:crowdsourcing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mechanicalturk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.math.upenn.edu/~wilf/website/recounting.pdf">
    <title>Recounting the Rationals</title>
    <dc:date>2008-04-24T19:15:42+00:00</dc:date>
    <link>http://www.math.upenn.edu/~wilf/website/recounting.pdf</link>
    <dc:creator>bpo</dc:creator><dc:subject>math paper fp</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:7c9a54be2e1a/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:math"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:fp"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://people.redhat.com/drepper/cpumemory.pdf">
    <title>What every programmer should know about memory</title>
    <dc:date>2008-02-14T08:16:17+00:00</dc:date>
    <link>http://people.redhat.com/drepper/cpumemory.pdf</link>
    <dc:creator>bpo</dc:creator><dc:subject>memory programming redhat paper fp</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:f794a468b595/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:memory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:redhat"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:fp"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://citeseer.ist.psu.edu/bonwick94slab.html">
    <title>The Slab Allocator: An Object-Caching Kernel Memory Allocator - Bonwick (ResearchIndex)</title>
    <dc:date>2008-01-18T18:49:04+00:00</dc:date>
    <link>http://citeseer.ist.psu.edu/bonwick94slab.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Abstract: This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex objects by retaining their state between uses.
]]></description>
<dc:subject>kernel memory paper solaris linux programming memcache</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:c8ef18f87d70/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:kernel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:memory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:solaris"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:linux"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:memcache"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://research.microsoft.com/~carlk/papers/algsweb.ps">
    <title>Empirical Analysis of Predictive Algorithms for Collaborative Filtering</title>
    <dc:date>2007-10-14T00:38:01+00:00</dc:date>
    <link>http://research.microsoft.com/~carlk/papers/algsweb.ps</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[An early example of model-based algorithms for CF, which proposes cluster models and Bayesian models.
]]></description>
<dc:subject>cf paper algorithms model</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:60628086817f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:cf"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:model"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.allthingsdistributed.com/2007/10/amazons_dynamo.html">
    <title>Amazon's Dynamo - All Things Distributed</title>
    <dc:date>2007-10-12T05:35:45+00:00</dc:date>
    <link>http://www.allthingsdistributed.com/2007/10/amazons_dynamo.html</link>
    <dc:creator>bpo</dc:creator><dc:subject>amazon architecture concurrency database distributed paper performance persistence programming toread</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:ace279776fbb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:amazon"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:architecture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:concurrency"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:database"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:performance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:persistence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:toread"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.cis.upenn.edu/~bcpierce/courses/670Fall04/GreatWorksInPL.shtml">
    <title>Great Works in Programming Languages</title>
    <dc:date>2007-03-07T04:43:02+00:00</dc:date>
    <link>http://www.cis.upenn.edu/~bcpierce/courses/670Fall04/GreatWorksInPL.shtml</link>
    <dc:creator>bpo</dc:creator><dc:subject>language history toread paper classics</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:e98759c392eb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:toread"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:classics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.bootstrap.org/institute/bibliography.html">
    <title>Bootstrap Institute: Engelbart papers</title>
    <dc:date>2007-02-18T00:16:42+00:00</dc:date>
    <link>http://www.bootstrap.org/institute/bibliography.html</link>
    <dc:creator>bpo</dc:creator><description><![CDATA[Articles by Douglas C. Engelbart available in HTML
]]></description>
<dc:subject>computing engelbart research programming history toread paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:f0a46bc9fd5e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:computing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:engelbart"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:toread"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mekentosj.com/papers/">
    <title>Papers... Your personal library of science</title>
    <dc:date>2007-02-08T01:34:49+00:00</dc:date>
    <link>http://mekentosj.com/papers/</link>
    <dc:creator>bpo</dc:creator><description><![CDATA["Papers will revolutionize the way you deal with scientific papers. Search for papers using PubMed, directly retrieve and archive PDFs, and read and study them all from within Papers, your personal library of Science."
]]></description>
<dc:subject>software osx mac science paper</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:f4e1241a519d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:software"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:osx"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mac"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://labs.google.com/papers/mapreduce.html">
    <title>Google Research Publication: MapReduce</title>
    <dc:date>2006-09-02T06:14:30+00:00</dc:date>
    <link>http://labs.google.com/papers/mapreduce.html</link>
    <dc:creator>bpo</dc:creator><dc:subject>google programming mapreduce distributed paper parallel functional</dc:subject>
<dc:identifier>https://pinboard.in/u:bpo/b:1b64aca44bce/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:google"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:mapreduce"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:distributed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:paper"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:parallel"/>
	<rdf:li rdf:resource="https://pinboard.in/u:bpo/t:functional"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>