<?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 (Vaguery)</title>
    <link>https://pinboard.in/u:Vaguery/public/</link>
    <description>recent bookmarks from Vaguery</description>
    <items>
      <rdf:Seq>	<rdf:li rdf:resource="https://arxiv.org/abs/2411.19864"/>
	<rdf:li rdf:resource="https://egrove.olemiss.edu/cgi/viewcontent.cgi?article=1122&amp;context=studies_eng_new"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/2107.05383"/>
	<rdf:li rdf:resource="https://writing.kemitchell.com/2020/06/01/Round-Robin-1.0.0.html"/>
	<rdf:li rdf:resource="https://mathoverflow.net/questions/42512/awfully-sophisticated-proof-for-simple-facts"/>
	<rdf:li rdf:resource="http://www.newton.ac.uk/news/summer-maths-puzzles"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1805.08059"/>
	<rdf:li rdf:resource="https://publicdomainreview.org/conjectures/the-primordial-gound/"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1806.04510"/>
	<rdf:li rdf:resource="https://boingboing.net/2012/09/12/magic-the-gathering.html"/>
	<rdf:li rdf:resource="http://www.horg.com/horg/?page_id=377"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1707.06557"/>
	<rdf:li rdf:resource="http://eusa-riddled.blogspot.com/2017/10/your-master-hes-monster-he-will-come-on.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1709.07797"/>
	<rdf:li rdf:resource="https://jasmcole.com/2017/04/08/extractor-attractor/#more-76737"/>
	<rdf:li rdf:resource="https://jasmcole.com/2017/06/04/swype-right/"/>
	<rdf:li rdf:resource="http://eusa-riddled.blogspot.com/2017/07/still-working-through-backlog-of.html"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1708.00214"/>
	<rdf:li rdf:resource="http://www.triplec.at/index.php/tripleC/article/view/870/1031"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1406.5157"/>
	<rdf:li rdf:resource="http://www.sciencedirect.com/science/article/pii/S1751157712001034"/>
	<rdf:li rdf:resource="https://www.youtube.com/watch?v=5q-BH-tvxEg"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1701.08883"/>
	<rdf:li rdf:resource="https://arxiv.org/abs/1605.05102"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1604.01674"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1503.00244"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1501.03786"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1407.5298"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1505.02020"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1411.5732"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1508.06773"/>
	<rdf:li rdf:resource="https://esolangs.org/wiki/Call_Queue"/>
	<rdf:li rdf:resource="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2308659"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1412.1852"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1401.4661"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1411.5768"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1410.0640"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1409.3358"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1405.5608"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1312.5813"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1312.6197"/>
	<rdf:li rdf:resource="http://mjparnell.com/bullshit_science_ux_design/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1202.2026"/>
	<rdf:li rdf:resource="http://andrewgelman.com/2013/12/17/replication-backlash/"/>
	<rdf:li rdf:resource="http://www.reeseco.com/papers/abr12.htm"/>
	<rdf:li rdf:resource="http://blogs.discovermagazine.com/science-sushi/2013/06/07/on-the-danger-posed-by-non-expert-critiques-published-to-large-audiences/#.UbMOjRWJRV9"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1212.6055"/>
	<rdf:li rdf:resource="http://meaningness.wordpress.com/2012/08/22/charnel-ground/"/>
	<rdf:li rdf:resource="http://www.bogost.com/blog/speaking_of_fees.shtml"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1107.0500"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/0908.2741"/>
	<rdf:li rdf:resource="http://houseoffame.blogspot.com/2012/04/long-tyme-agoon-in-shire-far-away.html"/>
	<rdf:li rdf:resource="http://code.google.com/p/greaterlipsum/"/>
	<rdf:li rdf:resource="http://arxiv.org/abs/1112.1841"/>
	<rdf:li rdf:resource="http://www.futilitycloset.com/2011/09/17/presto-chango/"/>
	<rdf:li rdf:resource="http://www.avc.com/a_vc/2011/06/investing-in-the-cultural-revolution.html"/>
	<rdf:li rdf:resource="http://www.youtube.com/watch?v=uKfKtXYLG78"/>
	<rdf:li rdf:resource="http://www.thelovecraftsman.com/2011/04/why-cthulhu-never-gets-invited-to-play.html"/>
	<rdf:li rdf:resource="http://photosounder.com/"/>
	<rdf:li rdf:resource="http://www.savagechickens.com/2009/08/wacky-word-fun.html"/>
	<rdf:li rdf:resource="http://www.dieselsweeties.com/archive/2318"/>
	<rdf:li rdf:resource="http://www.toplessrobot.com/2009/06/bonus_robs_transformers_2_faqs.php"/>
	<rdf:li rdf:resource="http://www.hootingyard.org/archives/2548"/>
	<rdf:li rdf:resource="http://io9.com/5301898/michael-bay-finally-made-an-art-movie"/>
	<rdf:li rdf:resource="http://axiombox.com/rubx/"/>
	<rdf:li rdf:resource="http://agileconsulting.blogspot.com/2009/03/dangers-of-agile.html"/>
	<rdf:li rdf:resource="http://www.lazy8studios.com/cogs_gameplay_sneak_peek"/>
	<rdf:li rdf:resource="http://www.biais.org/blog/index.php/2009/01/05/72-genetic-algorithm-in-python-to-generate-file-converters"/>
	<rdf:li rdf:resource="http://seekingalpha.com/article/113091-the-rewriting-of-open-source-history?source=feed"/>
	<rdf:li rdf:resource="http://www.andyhopp.com/gallery_deepones01.html"/>
      </rdf:Seq>
    </items>
  </channel><item rdf:about="https://arxiv.org/abs/2411.19864">
    <title>[2411.19864] An Elementary Proof of a Remarkable Relation Between the Squircle and Lemniscate</title>
    <dc:date>2025-11-03T17:54:39+00:00</dc:date>
    <link>https://arxiv.org/abs/2411.19864</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[It is well known that there is a somewhat mysterious relation between the area of the quartic Fermat curve x4+y4=1, aka squircle, and the arc length of the lemniscate (x2+y2)2=x2−y2. The standardproof of this fact uses relations between elliptic integrals and the gamma function. In this article we generalize this result to relate areas of sectors of the squircle to arc lengths of segments of the lemniscate. We provide a geometric interpretation of this relation and an elementary proof of the relation, which only uses basic integral calculus. We also discuss an alternate version of this kind of relation, which is implicit in a calculation of Siegel.
]]></description>
<dc:subject>geometry mathematical-recreations mathematics polynomials plane-geometry rather-interesting amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:22e1e557fd59/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:polynomials"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:plane-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://egrove.olemiss.edu/cgi/viewcontent.cgi?article=1122&amp;context=studies_eng_new">
    <title>[PDF] Mark Twain and the Magazine World</title>
    <dc:date>2021-09-12T13:09:50+00:00</dc:date>
    <link>https://egrove.olemiss.edu/cgi/viewcontent.cgi?article=1122&amp;context=studies_eng_new</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We literary scholars have our opportunistic streak. For the Anglo- Saxon period we study any scrap of writing on any subject; if carbon dating gets more precise we will explicate the rocks. For the eighteenth century we revel in political or religious pamphlets and welcome any sort of newspaper or magazine that we can dredge up. For the nine­ teenth century, though, we can find enough “serious,” that is, estheti- cally self-conscious, literature so that we take only minor interest in popular fiction and then only if published or reprinted in hard covers. For Mark Twain we generally stick to his books written once he achieved that stage in his career, and we keep trying to minimize the fact that he was incorrigibly a humorist.]]></description>
<dc:subject>literary-biography Mark-Twain magazines publishing-schemes amusing the-Reissue</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:230b2fa56a8d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:literary-biography"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Mark-Twain"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:magazines"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:publishing-schemes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-Reissue"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/2107.05383">
    <title>[2107.05383] Not Quite 'Ask a Librarian': AI on the Nature, Value, and Future of LIS</title>
    <dc:date>2021-07-24T11:52:27+00:00</dc:date>
    <link>https://arxiv.org/abs/2107.05383</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[AI language models trained on Web data generate prose that reflects human knowledge and public sentiments, but can also contain novel insights and predictions. We asked the world's best language model, GPT-3, fifteen difficult questions about the nature, value, and future of library and information science (LIS), topics that receive perennial attention from LIS scholars. We present highlights from its 45 different responses, which range from platitudes and caricatures to interesting perspectives and worrisome visions of the future, thus providing an LIS-tailored demonstration of the current performance of AI language models. We also reflect on the viability of using AI to forecast or generate research ideas in this way today. Finally, we have shared the full response log online for readers to consider and evaluate for themselves.
]]></description>
<dc:subject>generative-art the-mangle-in-practice rather-odd amusing artificial-oracles</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:608f1019c246/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generative-art"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-odd"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-oracles"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://writing.kemitchell.com/2020/06/01/Round-Robin-1.0.0.html">
    <title>Round Robin 1.0.0 — /dev/lawyer</title>
    <dc:date>2021-07-03T00:39:17+00:00</dc:date>
    <link>https://writing.kemitchell.com/2020/06/01/Round-Robin-1.0.0.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Round Robin 1.0.0 is here! License text follows. There is also a simple website, roundrobinlicense.com, hosting the permalink.
]]></description>
<dc:subject>opensource licensing amusing rather-interesting to-watch</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b8ab9b3c59b1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:opensource"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:licensing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-watch"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://mathoverflow.net/questions/42512/awfully-sophisticated-proof-for-simple-facts">
    <title>soft question - Awfully sophisticated proof for simple facts - MathOverflow</title>
    <dc:date>2020-09-18T21:22:21+00:00</dc:date>
    <link>https://mathoverflow.net/questions/42512/awfully-sophisticated-proof-for-simple-facts</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[It is sometimes the case that one can produce proofs of simple facts that are of disproportionate sophistication which, however, do not involve any circularity. For example, (I think) I gave an example in this M.SE answer (the title of this question comes from Pete's comment there) If I recall correctly, another example is proving Wedderburn's theorem on the commutativity of finite division rings by computing the Brauer group of their centers.

Do you know of other examples of nuking mosquitos like this?
]]></description>
<dc:subject>mathematics amusing math-jokes proof rather-interesting pragmatics to-write-about consider:genetic-programming consider:the-genie-problem</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:519c835717a6/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:math-jokes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:proof"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pragmatics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:the-genie-problem"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.newton.ac.uk/news/summer-maths-puzzles">
    <title>Summer Maths Puzzles - Home Page | Isaac Newton Institute for Mathematical Sciences</title>
    <dc:date>2019-08-07T11:09:26+00:00</dc:date>
    <link>http://www.newton.ac.uk/news/summer-maths-puzzles</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Each weekday throughout August we will be publishing a new maths-based puzzle.  They won't require sophisticated maths to solve, but equally they won't be easy. Discussing your ideas might help. 

]]></description>
<dc:subject>mathematical-recreations puzzles amusing to-write-about to-simulate</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:600bc3be3409/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:puzzles"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-simulate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1805.08059">
    <title>[1805.08059] One Monad to Prove Them All</title>
    <dc:date>2019-04-25T11:08:22+00:00</dc:date>
    <link>https://arxiv.org/abs/1805.08059</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[One Monad to Prove Them All is a modern fairy tale about curiosity and perseverance, two important properties of a successful PhD student. We follow the PhD student Mona on her adventure of proving properties about Haskell programs in the proof assistant Coq. On the one hand, as a PhD student in computer science Mona observes an increasing demand for correct software products. In particular, because of the large amount of existing software, verifying existing software products becomes more important. Verifying programs in the functional programming language Haskell is no exception. On the other hand, Mona is delighted to see that communities in the area of theorem proving are becoming popular. Thus, Mona sets out to learn more about the interactive theorem prover Coq and verifying Haskell programs in Coq.]]></description>
<dc:subject>programming-language functional-programming amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f06298fc1c08/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:functional-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://publicdomainreview.org/conjectures/the-primordial-gound/">
    <title>The Primordial Gound – The Public Domain Review</title>
    <dc:date>2018-10-21T13:05:45+00:00</dc:date>
    <link>https://publicdomainreview.org/conjectures/the-primordial-gound/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The piece that follows displays a number of the signature characteristics of the classic nineteenth-century genre known as mystification. We have an author who takes us winningly into his confidence as he discusses an intricate tale of old texts lost and recovered, all the while tipping his hand concerning the ambiguous status of the source material at issue. Kant in Sumatra? The Third Critique and the cosmologies of Melanesia? What is going on? Read on, and make of all of this what you will (or can!). But a quick thought: much philosophy (Justin E. H. Smith’s stock-in-trade), like most argumentative writing in history and every other branch of learned endeavor, seeks to compel assent — to leave the reader as little room as possible for thought-escape. To think well in such a textual ecology demands the cultivation of a capacity to find what we might think of as “worm holes” in the world of learned scholarship: loci that drop open into the infinite space of other possibilities. Sometimes such trapdoors can be opened in a footnote or paratext, or, as here, in a tiny textual emendation, through which we are encouraged to glimpse a thoroughly different fundamental ground for all experience. I am not a Geisterseher, Professor Skrastiņš assures Professor Smith — not a ghost-seer. But is that what we need to be if we are to see clearly through the heavy curtains of erudition?
]]></description>
<dc:subject>history explorations amusing to-do to-write-about to-follow paratext</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:486f170eea19/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:explorations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-do"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-follow"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:paratext"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1806.04510">
    <title>[1806.04510] Dank Learning: Generating Memes Using Deep Neural Networks</title>
    <dc:date>2018-06-14T14:20:40+00:00</dc:date>
    <link>https://arxiv.org/abs/1806.04510</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We introduce a novel meme generation system, which given any image can produce a humorous and relevant caption. Furthermore, the system can be conditioned on not only an image but also a user-defined label relating to the meme template, giving a handle to the user on meme content. The system uses a pretrained Inception-v3 network to return an image embedding which is passed to an attention-based deep-layer LSTM model producing the caption - inspired by the widely recognised Show and Tell Model. We implement a modified beam search to encourage diversity in the captions. We evaluate the quality of our model using perplexity and human assessment on both the quality of memes generated and whether they can be differentiated from real ones. Our model produces original memes that cannot on the whole be differentiated from real ones.
]]></description>
<dc:subject>neural-networks generative-art generative-models rather-interesting amusing to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:90c6b1a71e91/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generative-art"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:generative-models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://boingboing.net/2012/09/12/magic-the-gathering.html">
    <title>Magic: The Gathering is Turing complete / Boing Boing</title>
    <dc:date>2018-02-19T13:19:12+00:00</dc:date>
    <link>https://boingboing.net/2012/09/12/magic-the-gathering.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Alex Churchill has posted a way to implement a Turing complete computer within a game of Magic: The Gathering ("Turing complete" is a way of classifying a calculating engine that is capable of general-purpose computation). The profound and interesting thing about the recurrence of Turing completeness in many unexpected places -- such as page-layout descriptive engines -- is that it suggests that there's something foundational about the ability to do general computation. It also suggests that attempts to limit general computation will be complicated by the continued discovery of new potential computing engines. That is, even if you lock down all the PCs so that they only play restricted music formats and not Ogg, if you allow a sufficiently speedy and scriptable Magic: The Gathering program to exist, someone may implement the Ogg player using collectible card games.

]]></description>
<dc:subject>computational-complexity computer-science amusing proof unconventional-representation-schemes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:f8027ab2e255/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-complexity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:proof"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:unconventional-representation-schemes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.horg.com/horg/?page_id=377">
    <title>» Haplognathidae HORG</title>
    <dc:date>2017-10-20T22:33:17+00:00</dc:date>
    <link>http://www.horg.com/horg/?page_id=377</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The Holotypic Occlupanid Research Group : A Database of Synthetic Taxonomy]]></description>
<dc:subject>cladistics amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:683f7b383143/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cladistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1707.06557">
    <title>[1707.06557] leave a trace - A People Tracking System Meets Anomaly Detection</title>
    <dc:date>2017-10-15T12:47:55+00:00</dc:date>
    <link>https://arxiv.org/abs/1707.06557</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Video surveillance always had a negative connotation, among others because of the loss of privacy and because it may not automatically increase public safety. If it was able to detect atypical (i.e. dangerous) situations in real time, autonomously and anonymously, this could change. A prerequisite for this is a reliable automatic detection of possibly dangerous situations from video data. This is done classically by object extraction and tracking. From the derived trajectories, we then want to determine dangerous situations by detecting atypical trajectories. However, due to ethical considerations it is better to develop such a system on data without people being threatened or even harmed, plus with having them know that there is such a tracking system installed. Another important point is that these situations do not occur very often in real, public CCTV areas and may be captured properly even less. In the artistic project leave a trace the tracked objects, people in an atrium of a institutional building, become actor and thus part of the installation. Visualisation in real-time allows interaction by these actors, which in turn creates many atypical interaction situations on which we can develop our situation detection. The data set has evolved over three years and hence, is huge. In this article we describe the tracking system and several approaches for the detection of atypical trajectories.
]]></description>
<dc:subject>amusing anomaly-detection computer-vision surveillance machine-learning the-mangle-in-practice to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2950d5dad53b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:anomaly-detection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-vision"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:surveillance"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eusa-riddled.blogspot.com/2017/10/your-master-hes-monster-he-will-come-on.html">
    <title>Riddled: Your master he's a monster He will come on a bridge of paper Inscribed with a hundred names of God</title>
    <dc:date>2017-10-11T00:55:11+00:00</dc:date>
    <link>http://eusa-riddled.blogspot.com/2017/10/your-master-hes-monster-he-will-come-on.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[UPDATE: Helpful Pubpeer brownie Macrophthalmus Grandidieri prepared a useful though now incomplete diagram of papers and their shared pictorial heritage, including twenty-seven 8-by-10 color glossy pictures with circles and arrows and a paragraph on the back of each one explaining what each one was.
]]></description>
<dc:subject>paper-mills academic-culture academia-doesn't-guarantee-acuity publishing amusing and-yet</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:78a0e516ebe7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:paper-mills"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academia-doesn't-guarantee-acuity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:publishing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:and-yet"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1709.07797">
    <title>[1709.07797] Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances</title>
    <dc:date>2017-09-26T14:33:44+00:00</dc:date>
    <link>https://arxiv.org/abs/1709.07797</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Some researchers have proposed using non-Euclidean metrics for clustering data points. Generally, the metric should recognize that two points in the same cluster are close, even if their Euclidean distance is far. Multiple proposals have been suggested, including the Edge-Squared Metric (a specific example of a graph geodesic) and the Nearest Neighbor Metric. 
In this paper, we prove that the edge-squared and nearest-neighbor metrics are in fact equivalent. Previous best work showed that the edge-squared metric was a 3-approximation of the Nearest Neighbor metric. This paper represents one of the first proofs of equating a continuous metric with a discrete metric, using non-trivial discrete methods. Our proof uses the Kirszbraun theorem (also known as the Lipschitz Extension Theorem and Brehm's Extension Theorem), a notable theorem in functional analysis and computational geometry. 
The results of our paper, combined with the results of Hwang, Damelin, and Hero, tell us that the Nearest Neighbor distance on i.i.d samples of a density is a reasonable constant approximation of a natural density-based distance function.]]></description>
<dc:subject>clustering metrics statistics amusing one-of-these-things-is-just-like-the-other computational-geometry</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:38f2196a8106/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:clustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:one-of-these-things-is-just-like-the-other"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computational-geometry"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://jasmcole.com/2017/04/08/extractor-attractor/#more-76737">
    <title>Extractor attractor – Almost looks like work</title>
    <dc:date>2017-08-12T12:48:08+00:00</dc:date>
    <link>https://jasmcole.com/2017/04/08/extractor-attractor/#more-76737</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Recently the extractor fan in my bathroom has started malfunctioning, occasionally grinding and stalling. The infuriating thing is that the grinding noise isn’t perfectly periodic – it is approximately so, but there are occasionally long gaps and the short gaps vary slightly. This lack of predictability makes the noise incredibly annoying, and hard to tune out. Before getting it fixed, I decided to investigate it a bit further.


The terminally curious may listen to the sound here:

https://www.dropbox.com/s/4xh1gmrjry10eky/FanSound.ts?dl=0

This was recorded from my phone, you can also hear me puttering around in the background.

After dumping the audio data, I looked at the waveform and realised it was quite difficult to extract the temporal locations of the grinding noises from the volume alone. As a good physicist I therefore had another look in the frequency domain, making a spectrogram.]]></description>
<dc:subject>mathematical-recreations looking-to-see data-analysis visualization physics nonlinear-dynamics amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0a14d13aad10/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:visualization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://jasmcole.com/2017/06/04/swype-right/">
    <title>Swype right – Almost looks like work</title>
    <dc:date>2017-08-12T12:46:39+00:00</dc:date>
    <link>https://jasmcole.com/2017/06/04/swype-right/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this post I’ll discuss optimising the layout of an English QWERTY keyboard in an effort to minimise the average distance a digit must travel to type a word. Let’s have a look.

]]></description>
<dc:subject>mathematical-recreations optimization natural-language-processing user-interface amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2ba5576a2eed/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:user-interface"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://eusa-riddled.blogspot.com/2017/07/still-working-through-backlog-of.html">
    <title>Riddled: Still working through the backlog of irritating mockademic-journal spam</title>
    <dc:date>2017-08-07T11:27:54+00:00</dc:date>
    <link>http://eusa-riddled.blogspot.com/2017/07/still-working-through-backlog-of.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Rajesh Varma -- the egregious fuckknuckle who came up with the respect-inspiring title "PeerTechz" when he leapt aboard the parasitic-publishing band-wagon juggernaut -- is evidently making so little money from the scam that he cannot afford last names for his "Managing Editor" sockpuppets. Leaving them to languish in initial-letter anonymity.
]]></description>
<dc:subject>spam amusing sorry-not-amusing-been-there-been-sued academic-culture</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c1512658ee40/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:spam"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:sorry-not-amusing-been-there-been-sued"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1708.00214">
    <title>[1708.00214] Natural Language Processing with Small Feed-Forward Networks</title>
    <dc:date>2017-08-05T11:30:12+00:00</dc:date>
    <link>https://arxiv.org/abs/1708.00214</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We show that small and shallow feed-forward neural networks can achieve near state-of-the-art results on a range of unstructured and structured language processing tasks while being considerably cheaper in memory and computational requirements than deep recurrent models. Motivated by resource-constrained environments like mobile phones, we showcase simple techniques for obtaining such small neural network models, and investigate different tradeoffs when deciding how to allocate a small memory budget.
]]></description>
<dc:subject>neural-networks natural-language-processing machine-learning amusing not-so-deep to-write-about metaheuristics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:22799e319e69/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:not-so-deep"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:metaheuristics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.triplec.at/index.php/tripleC/article/view/870/1031">
    <title>‘Predatory’ Open Access Journals as Parody: Exposing the Limitations of ‘Legitimate’ Academic Publishing | Bell | tripleC: Communication, Capitalism &amp; Critique. Open Access Journal for a Global Sustainable Information Society</title>
    <dc:date>2017-07-21T12:57:31+00:00</dc:date>
    <link>http://www.triplec.at/index.php/tripleC/article/view/870/1031</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Abstract: The concept of the 'predatory' publisher has today become a standard way of characterising a new breed of open access journals that seem to be more concerned with making a profit than disseminating academic knowledge. This essay presents an alternative view of such publishers, arguing that if we treat them as parody instead of predator, a far more nuanced reading emerges. Viewed in this light, such journals destabilise the prevailing discourse on what constitutes a 'legitimate' journal, and, indeed, the nature of scholarly knowledge production itself. Instead of condemning them outright, their growth should therefore encourage us to ask difficult but necessary questions about the commercial context of knowledge production, prevailing conceptions of quality and value, and the ways in which they privilege scholarship from the 'centre' and exclude that from the 'periphery'.

]]></description>
<dc:subject>academic-culture criticism rather-interesting publishing predatory-journals amusing to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:980607a59582/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:criticism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:publishing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:predatory-journals"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1406.5157">
    <title>[1406.5157] Enumerative Geometrical Genealogy (Or: The Sex Life of Points and Lines)</title>
    <dc:date>2017-04-21T11:24:58+00:00</dc:date>
    <link>https://arxiv.org/abs/1406.5157</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Joshua Cooper and Mark Walters initiated the subject that we call here Enumerative Geometric Genealogy, (and that lead to the hard-to-count OEIS sequence A140468) but they did not realize the broader impact of their research to the population explosion of a certain far-away planet, whose inhabitants are much smarter, and more civilized, than we are.]]></description>
<dc:subject>combinatorics plane-geometry amusing to-write-about enumeration nudge-targets consider:looking-to-see consider:rediscovery</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:88e66158e1b7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:plane-geometry"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:enumeration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:rediscovery"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.sciencedirect.com/science/article/pii/S1751157712001034">
    <title>Archetypal scientists</title>
    <dc:date>2017-02-27T01:37:18+00:00</dc:date>
    <link>http://www.sciencedirect.com/science/article/pii/S1751157712001034</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We introduce archetypal analysis as a tool to describe and categorize scientists. This approach identifies typical characteristics of extreme (‘archetypal’) values in a multivariate data set. These positive or negative contextual attributes can be allocated to each scientist under investigation. In our application, we use a sample of seven bibliometric indicators for 29,083 economists obtained from the RePEc database and identify six archetypes. These are mainly characterized by ratios of published work and citations. We discuss applications and limitations of this approach. Finally, we assign relative shares of the identified archetypes to each economist in our sample.

]]></description>
<dc:subject>archetypal-analysis amusing data-analysis machine-learning statistics clustering to-write-about</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:69a1035ab556/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:archetypal-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:clustering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://www.youtube.com/watch?v=5q-BH-tvxEg">
    <title>Machine with Concrete - Arthur Ganson - YouTube</title>
    <dc:date>2017-02-16T14:30:09+00:00</dc:date>
    <link>https://www.youtube.com/watch?v=5q-BH-tvxEg</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This machine was inspired by dreaming about gear ratios and considering the unexpected implications of exponential powers.

Each worm/worm gear pair reduces the speed of the motor by 1/50th. Since there are 12 pairs of gears, the final speed reduction is calculated by (1/50)12. The implications are quite large. With the motor turning around 200 revolutions per minute, it will take well over two trillion years before the final gear makes but one turn. Given the truth of this situation, it is possible to do anything at all with the final gear, even embed it in concrete.
]]></description>
<dc:subject>conceptual-art video engineering-design amusing via:ronjeffries mechanics</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c02f23fa0750/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:conceptual-art"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:video"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:ronjeffries"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mechanics"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1701.08883">
    <title>[1701.08883] A Covert Queueing Channel in Round Robin Schedulers</title>
    <dc:date>2017-02-11T13:36:52+00:00</dc:date>
    <link>https://arxiv.org/abs/1701.08883</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We study a covert queueing channel between two users sharing a round robin scheduler. Such a covert channel can arise when users share a resource such as a computer processor or a router arbitrated by a round robin policy. We present an information-theoretic framework to model and derive the maximum reliable data transmission rate, i.e., the capacity of this channel for both noiseless and noisy scenarios. Our results show that seemingly isolated users can communicate with high rate over the covert channel. Furthermore, we propose a practical finite-length code construction, which achieves the capacity limit.
]]></description>
<dc:subject>secret-messages rather-interesting amusing mathematical-recreations to-write-about exaptation nonlinear-dynamics information-theory consider:agent-based consider:looking-to-see</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3b7368602011/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:secret-messages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:exaptation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nonlinear-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:information-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:looking-to-see"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://arxiv.org/abs/1605.05102">
    <title>[1605.05102] Enumeration of Enumeration Algorithms</title>
    <dc:date>2017-01-07T16:42:32+00:00</dc:date>
    <link>https://arxiv.org/abs/1605.05102</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.
]]></description>
<dc:subject>enumeration combinatorics rather-interesting amusing to-write-about review</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ad5523aaa507/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:enumeration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:combinatorics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-write-about"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:review"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1604.01674">
    <title>[1604.01674] OFFl models: novel schema for dynamical modeling of biological systems</title>
    <dc:date>2016-07-01T21:09:52+00:00</dc:date>
    <link>http://arxiv.org/abs/1604.01674</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Flow diagrams are a common tool used to help build and interpret models of dynamical systems, often in biological contexts such as consumer-resource models and similar compartmental models. Typically, their usage is intuitive and informal. Here, we present a formalized version of flow diagrams as a kind of weighted directed graph which follow a strict grammar, which translate into a system of ordinary differential equations (ODEs) by a single unambiguous rule, and which have an equivalent representation as a relational database. (We abbreviate this schema of "ODEs and formalized flow diagrams" as OFFl.) Drawing a diagram within this strict grammar encourages a mental discipline on the part of the modeler in which all dynamical processes of a system are thought of as interactions between dynamical species that draw parcels from one or more source species and deposit them into target species according to a set of transformation rules. From these rules, the net rate of change for each species can be derived. The modeling schema can therefore be understood as both an epistemic and practical heuristic for modeling, serving both as an organizational framework for the model building process and as a mechanism for deriving ODEs. All steps of the schema beyond the initial scientific (intuitive, creative) abstraction of natural observations into model variables are algorithmic and easily carried out by a computer, thus enabling the future development of a dedicated software implementation. Such tools would empower the modeler to consider significantly more complex models than practical limitations might have otherwise proscribed, since the modeling framework itself manages that complexity on the modeler's behalf. In this report, we describe the chief motivations for OFFl, outline its implementation, and utilize a range of classic examples from ecology and epidemiology to showcase its features.
]]></description>
<dc:subject>models-and-modes representation visualization systems-biology formalization amusing theoretical-biology systems-thinking</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c4e23570d367/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models-and-modes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:visualization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:systems-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formalization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:theoretical-biology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:systems-thinking"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1503.00244">
    <title>[1503.00244] 23-bit Metaknowledge Template Towards Big Data Knowledge Discovery and Management</title>
    <dc:date>2016-03-14T11:34:01+00:00</dc:date>
    <link>http://arxiv.org/abs/1503.00244</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[I am reminded of a classmate in the SFI Summer School in 1991 whose startup was a simple unique cataloguing model of memory. That is, combinatorics as keyed lookup, and filling and using the stuff was somebody else's problem.]]></description>
<dc:subject>artificial-intelligence algorithms databases big-data amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3f91dbe64999/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-intelligence"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:databases"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:big-data"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1501.03786">
    <title>[1501.03786] Multi-view learning for multivariate performance measures optimization</title>
    <dc:date>2015-12-15T12:50:55+00:00</dc:date>
    <link>http://arxiv.org/abs/1501.03786</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper, we propose the problem of optimizing multivariate performance measures from multi-view data, and an effective method to solve it. This problem has two features: the data points are presented by multiple views, and the target of learning is to optimize complex multivariate performance measures. We propose to learn a linear discriminant functions for each view, and combine them to construct a overall multivariate mapping function for mult-view data. To learn the parameters of the linear dis- criminant functions of different views to optimize multivariate performance measures, we formulate a optimization problem. In this problem, we propose to minimize the complexity of the linear discriminant functions of each view, encourage the consistences of the responses of different views over the same data points, and minimize the upper boundary of a given multivariate performance measure. To optimize this problem, we employ the cutting-plane method in an iterative algorithm. In each iteration, we update a set of constrains, and optimize the mapping function parameter of each view one by one.
]]></description>
<dc:subject>performance-measure rubrics amusing lexicase-selection multiobjective-optimization nudge-targets system-of-professions consider:repeating-with-20-year-old-names</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:52f1802faa56/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rubrics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:lexicase-selection"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:system-of-professions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:repeating-with-20-year-old-names"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1407.5298">
    <title>[1407.5298] How the Experts Algorithm Can Help Solve LPs Online</title>
    <dc:date>2015-12-14T12:25:37+00:00</dc:date>
    <link>http://arxiv.org/abs/1407.5298</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention and the main focus is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraints) to allow (1+ϵ)-approximations online. It is known that the right-hand sides have to be Ω(ϵ−2logm) times the left-hand sides, where m is the number of constraints. 
In this paper we give a primal-dual algorithm that achieve this bound for mixed packing/covering LPs. Our algorithms construct dual solutions using a regret-minimizing online learning algorithm in a black-box fashion, and use them to construct primal solutions. The adversarial guarantee that holds for the constructed duals helps us to take care of most of the correlations that arise in the algorithm; the remaining correlations are handled via martingale concentration and maximal inequalities. These ideas lead to conceptually simple and modular algorithms, which we hope will be useful in other contexts.
]]></description>
<dc:subject>linear-programming mathematical-programming online-learning parameter-adjustment rather-interesting amusing algorithms no-free-lunch nudge-targets consider:controllers</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:86c27895e186/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:linear-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:online-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:parameter-adjustment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:no-free-lunch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:controllers"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1505.02020">
    <title>[1505.02020] Influence of Luddism on innovation diffusion</title>
    <dc:date>2015-12-13T14:46:22+00:00</dc:date>
    <link>http://arxiv.org/abs/1505.02020</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We generalize the classical Bass model of innovation diffusion to include a new class of agents --- Luddites --- that oppose the spread of innovation. Our model also incorporates ignorants, susceptibles, and adopters. When an ignorant and a susceptible meet, the former is converted to a susceptible at a given rate, while a susceptible spontaneously adopts the innovation at a constant rate. In response to the \emph{rate} of adoption, an ignorant may become a Luddite and permanently reject the innovation. Instead of reaching complete adoption, the final state generally consists of a population of Luddites, ignorants, and adopters. The evolution of this system is investigated analytically and by stochastic simulations. We determine the stationary distribution of adopters, the time needed to reach the final state, and the influence of the network topology on the innovation spread. Our model exhibits an important dichotomy: when the rate of adoption is low, an innovation spreads slowly but widely; in contrast, when the adoption rate is high, the innovation spreads rapidly but the extent of the adoption is severely limited by Luddites.
]]></description>
<dc:subject>artificial-life evolutionary-economics simulation agent-based amusing innovation social-dynamics to-do</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7c666a9860a9/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artificial-life"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-economics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:simulation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agent-based"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:innovation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:social-dynamics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-do"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1411.5732">
    <title>[1411.5732] A Joint Probabilistic Classification Model of Relevant and Irrelevant Sentences in Mathematical Word Problems</title>
    <dc:date>2015-09-13T20:28:54+00:00</dc:date>
    <link>http://arxiv.org/abs/1411.5732</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Estimating the difficulty level of math word problems is an important task for many educational applications. Identification of relevant and irrelevant sentences in math word problems is an important step for calculating the difficulty levels of such problems. This paper addresses a novel application of text categorization to identify two types of sentences in mathematical word problems, namely relevant and irrelevant sentences. A novel joint probabilistic classification model is proposed to estimate the joint probability of classification decisions for all sentences of a math word problem by utilizing the correlation among all sentences along with the correlation between the question sentence and other sentences, and sentence text. The proposed model is compared with i) a SVM classifier which makes independent classification decisions for individual sentences by only using the sentence text and ii) a novel SVM classifier that considers the correlation between the question sentence and other sentences along with the sentence text. An extensive set of experiments demonstrates the effectiveness of the joint probabilistic classification model for identifying relevant and irrelevant sentences as well as the novel SVM classifier that utilizes the correlation between the question sentence and other sentences. Furthermore, empirical results and analysis show that i) it is highly beneficial not to remove stopwords and ii) utilizing part of speech tagging does not make a significant improvement although it has been shown to be effective for the related task of math word problem type classification.
]]></description>
<dc:subject>natural-language-processing text-mining rather-interesting amusing sentiment-analysis data-fusion machine-learning nudge-targets digital-humanities-gone-bad</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:7b5eed9221c1/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:text-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:sentiment-analysis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:data-fusion"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:digital-humanities-gone-bad"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1508.06773">
    <title>[1508.06773] Ranking by pairwise comparisons for Swiss-system tournaments</title>
    <dc:date>2015-09-11T14:30:54+00:00</dc:date>
    <link>http://arxiv.org/abs/1508.06773</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Pairwise comparison matrices are widely used in Multicriteria Decision Making. This article applies incomplete pairwise comparison matrices in the area of sport tournaments, namely proposing alternative rankings for the 2010 Chess Olympiad Open tournament. It is shown that results are robust regarding scaling technique. In order to compare different rankings, a distance function is introduced with the aim of taking into account the subjective nature of human perception. Analysis of the weight vectors implies that methods based on pairwise comparisons have common roots. Visualization of the results is provided by Multidimensional Scaling on the basis of the defined distance. The proposed rankings give in some cases intuitively better outcome than currently used lexicographical orders.
]]></description>
<dc:subject>multiobjective-optimization benchmarking horse-races making-the-numbers-work-out estimation philosophy-of-engineering amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2bbc3dee9035/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:benchmarking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:horse-races"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:making-the-numbers-work-out"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:estimation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="https://esolangs.org/wiki/Call_Queue">
    <title>Call Queue - Esolang</title>
    <dc:date>2015-08-22T01:39:26+00:00</dc:date>
    <link>https://esolangs.org/wiki/Call_Queue</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Call Queue is an idea for a queue-based esoteric programming language, thought of by User:Koen in 2013. Basically, a program in Call Queue looks like a program in your average imperative programming language, except functions are executed using a "call queue" instead of the usual call stack.
]]></description>
<dc:subject>ReQ queues-again programming-language amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:b09a55f5ca94/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:ReQ"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:queues-again"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2308659">
    <title>Pseudo-Mathematics and Financial Charlatanism: The Effects of Backtest Overfitting on Out-of-Sample Performance by David H. Bailey, Jonathan M. Borwein, Marcos Lopez de Prado, Qiji Jim Zhu :: SSRN</title>
    <dc:date>2015-06-14T15:44:43+00:00</dc:date>
    <link>http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2308659</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We prove that high simulated performance is easily achievable after backtesting a relatively small number of alternative strategy configurations, a practice we denote “backtest overfitting”. The higher the number of configurations tried, the greater is the probability that the backtest is overfit. Because most financial analysts and academics rarely report the number of configurations tried for a given backtest, investors cannot evaluate the degree of overfitting in most investment proposals. 

The implication is that investors can be easily misled into allocating capital to strategies that appear to be mathematically sound and empirically supported by an outstanding backtest. Under memory effects, backtest overfitting leads to negative expected returns out-of-sample, rather than zero performance. This may be one of several reasons why so many quantitative funds appear to fail.

]]></description>
<dc:subject>financial-engineering back-testing statistics models amusing rather-interesting prediction models-and-modes</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:dc73868d0f27/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:financial-engineering"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:back-testing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rather-interesting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:prediction"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:models-and-modes"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1412.1852">
    <title>[1412.1852] Curious terminal turn of rolling rings</title>
    <dc:date>2014-12-21T14:55:36+00:00</dc:date>
    <link>http://arxiv.org/abs/1412.1852</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We report an unexpected reverse spiral turn in the final stage of the motion of rolling rings. It is well known that spinning disks have definite centers of rotation until they stop. While a spinning ring starts its motion with a similar kinematics, moving along a cycloidal path prograde with the direction of its rigid body rotation, the mean trajectory of its center of mass develops an inflection point so that the ring makes a spiral turn and revolves in a retrograde direction around a new center. Using high speed imaging and numerical simulations of models featuring a rolling rigid body, we show that the hollow geometry of a ring tunes the rotational air drag resistance so that the frictional force at the contact point with the ground changes its direction at the inflection point and puts the ring on a retrograde spiral trajectory. Our findings have potential applications in designing topologically new surface-effect flying objects capable of performing complex reorientation and translational maneuvers.
]]></description>
<dc:subject>physics classical-physics experiment amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:57fe9aa5acd0/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classical-physics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:experiment"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1401.4661">
    <title>[1401.4661] Significance level and positivity bias as causes for high rate of non-reproducible scientific results?</title>
    <dc:date>2014-11-30T14:23:01+00:00</dc:date>
    <link>http://arxiv.org/abs/1401.4661</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The high fraction of published results that turn out to be incorrect is a major concern of today's science. This paper contributes to the understanding of this problem in two independent directions. First, Johnson's recent claim that hypothesis testing with a significance level of 0.05 can alone lead to an unacceptably large proportion of false positives among all results is shown to be unfounded. Second, a way to quantify the effect of "positivity bias" (the tendency to consider only positive results as worthwhile) is introduced. We estimate the proportion of false positives among positive results in terms of the significance level used and the positivity ratio. The latter quantity is the fraction of positive results over all results, be they positive or not, published or not. In particular, if one uses a significance level of 0.05, and produces 4 (possibly unpublished) negative results for every positive result, then the proportion of false positives among positive results can climb to a high 21%.
]]></description>
<dc:subject>probability-theory statistics academic-culture publishing what's-wrong-with-people-these-days the-mangle-in-practice pragmatism-it-ain't amusing to-watch philosophy-of-science</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8438a94f393e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:probability-theory"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:statistics"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:publishing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:what's-wrong-with-people-these-days"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:the-mangle-in-practice"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pragmatism-it-ain't"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-watch"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:philosophy-of-science"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1411.5768">
    <title>[1411.5768] Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems</title>
    <dc:date>2014-11-27T18:22:49+00:00</dc:date>
    <link>http://arxiv.org/abs/1411.5768</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. In order to solve the problems, we provide a pre-processing scheme as well as exact and approximate mixed integer programming (MIP) solutions. Our experimental results show the effectiveness of the MIP solutions and in particular point out that the approximate MIP approach often leads to near optimal results within far less computation time than the exact approach.
]]></description>
<dc:subject>operations-research optimization multiobjective-optimization one-hand-tied-problems amusing nudge-targets consider:approximation consider:the-kitchen-sink</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:32bf19291b51/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:operations-research"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:one-hand-tied-problems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:approximation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:the-kitchen-sink"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1410.0640">
    <title>[1410.0640] Term-Weighting Learning via Genetic Programming for Text Classification</title>
    <dc:date>2014-10-05T13:21:40+00:00</dc:date>
    <link>http://arxiv.org/abs/1410.0640</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[This paper describes a novel approach to learning term-weighting schemes (TWSs) in the context of text classification. In text mining a TWS determines the way in which documents will be represented in a vector space model, before applying a classifier. Whereas acceptable performance has been obtained with standard TWSs (e.g., Boolean and term-frequency schemes), the definition of TWSs has been traditionally an art. Further, it is still a difficult task to determine what is the best TWS for a particular problem and it is not clear yet, whether better schemes, than those currently available, can be generated by combining known TWS. We propose in this article a genetic program that aims at learning effective TWSs that can improve the performance of current schemes in text classification. The genetic program learns how to combine a set of basic units to give rise to discriminative TWSs. We report an extensive experimental study comprising data sets from thematic and non-thematic text classification as well as from image classification. Our study shows the validity of the proposed method; in fact, we show that TWSs learned with the genetic program outperform traditional schemes and other TWSs proposed in recent works. Further, we show that TWSs learned from a specific domain can be effectively used for other tasks.
]]></description>
<dc:subject>text-mining natural-language-processing classification algorithms genetic-programming amusing because-they-cite-Langdon-but-not-the-paper-where-he-did-this-in-2000 this-one:http://www0.cs.ucl.ac.uk/staff/w.langdon/WBL_pre2003.html#langdon:2000:ngram</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:052f956e3a10/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:text-mining"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:natural-language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:classification"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:because-they-cite-Langdon-but-not-the-paper-where-he-did-this-in-2000"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:this-one:http://www0.cs.ucl.ac.uk/staff/w.langdon/WBL_pre2003.html#langdon:2000:ngram"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1409.3358">
    <title>[1409.3358] Building Program Vector Representations for Deep Learning</title>
    <dc:date>2014-09-15T21:16:52+00:00</dc:date>
    <link>http://arxiv.org/abs/1409.3358</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Deep learning has made significant breakthroughs in various fields of artificial intelligence. Advantages of deep learning include the ability to capture highly complicated features, weak involvement of human engineering, etc. However, it is still virtually impossible to use deep learning to analyze programs since deep architectures cannot be trained effectively with pure back propagation. In this pioneering paper, we propose the "coding criterion" to build program vector representations, which are the premise of deep learning for program analysis. Our representation learning approach directly makes deep learning a reality in this new field. We evaluate the learned vector representations both qualitatively and quantitatively. We conclude, based on the experiments, the coding criterion is successful in building program representations. To evaluate whether deep learning is beneficial for program analysis, we feed the representations to deep neural networks, and achieve higher accuracy in the program classification task than "shallow" methods, such as logistic regression and the support vector machine. This result confirms the feasibility of deep learning to analyze programs. It also gives primary evidence of its success in this new field. We believe deep learning will become an outstanding technique for program analysis in the near future.
]]></description>
<dc:subject>deep-learning machine-learning genetic-programming square-pegs-in-round-holes representation language-processing automated-code-generation amusing nudge-targets consider:combo-move</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e2d1c93248a3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:machine-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:square-pegs-in-round-holes"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:representation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:language-processing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:automated-code-generation"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:combo-move"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1405.5608">
    <title>[1405.5608] More Structural Characterizations of Some Subregular Language Families by Biautomata</title>
    <dc:date>2014-05-26T12:32:51+00:00</dc:date>
    <link>http://arxiv.org/abs/1405.5608</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic finite automata with the same property. In some cases, it is shown that there is no difference in characterization between deterministic finite automata and biautomata as for the permutation-freeness, but there are also other cases, where it makes a big difference whether one considers deterministic finite automata or biautomata. This is, for instance, the case when comparing strongly permutation-freeness, which results in the family of definite language for deterministic finite automata, while biautomata induce the family of finite and co-finite languages. The obtained results nicely fall into the known landscape on classical language families.
]]></description>
<dc:subject>automata computer-science formal-languages out-of-the-box nudge-targets amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3c69bc41d979/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:automata"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:computer-science"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:formal-languages"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:out-of-the-box"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1312.5813">
    <title>[1312.5813] Why does the unsupervised pretraining encourage moderate-sparseness?</title>
    <dc:date>2014-04-04T10:40:24+00:00</dc:date>
    <link>http://arxiv.org/abs/1312.5813</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[It is well known that direct training of deep multi-layer neural networks (DNNs) will generally lead to poor results. A major progress in recent years is the invention of various unsupervised pretraining methods to initialize network parameters and it was shown that such methods lead to good prediction performance. However, the reason for the success of the pretraining has not been fully understood, although it was argued that regularization and better optimization play certain roles. This paper provides another explanation for the effectiveness of the pretraining, where we empirically show the pretraining leads to a higher level of sparseness of hidden unit activation in the resulting neural networks, and the higher sparseness is positively correlated to faster training speed and better prediction accuracy. Moreover, we also show that rectified linear units (ReLU) can capture the sparseness benefits of the pretraining. Our implementation of DNNs with ReLU does not require the pretraining, but achieves comparable or better prediction performance than traditional DNNs with pretraining on standard benchmark datasets.
]]></description>
<dc:subject>deep-learning neural-networks performance-measure pre training tricks-and-hints amusing multiobjective-optimization but-they-forgot-or-never-learned nudge-targets consider:coevolutionary-prep</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c671308fc66c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:pre"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:training"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:tricks-and-hints"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:multiobjective-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:but-they-forgot-or-never-learned"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:coevolutionary-prep"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1312.6197">
    <title>[1312.6197] An empirical analysis of dropout in piecewise linear networks</title>
    <dc:date>2014-03-17T12:23:14+00:00</dc:date>
    <link>http://arxiv.org/abs/1312.6197</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The recently introduced dropout training criterion for neural networks has been the subject of much attention due to its simplicity and remarkable effectiveness as a regularizer, as well as its interpretation as a training procedure for an exponentially large ensemble of networks that share parameters. In this work we empirically investigate several questions related to the efficacy of dropout, specifically as it concerns networks employing the popular rectified linear activation function. We investigate the quality of the test time weight-scaling inference procedure by evaluating the geometric average exactly in small models, as well as compare the performance of the geometric mean to the arithmetic mean more commonly employed by ensemble techniques. We explore the effect of tied weights on the ensemble interpretation by training ensembles of masked networks without tied weights. Finally, we investigate an alternative criterion based on a biased estimator of the maximum likelihood ensemble gradient.
]]></description>
<dc:subject>neural-networks deep-learning amusing performance-space consider:belated-similarity-to-Pareto-GP</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:c093378e5871/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:neural-networks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:deep-learning"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-space"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:consider:belated-similarity-to-Pareto-GP"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://mjparnell.com/bullshit_science_ux_design/">
    <title>Why so much “science” used in design is bullshit</title>
    <dc:date>2014-02-26T11:06:56+00:00</dc:date>
    <link>http://mjparnell.com/bullshit_science_ux_design/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[The nature of the grift then is a system that encourages interaction and UX designers to provide empirical or theoretical basis for their decisions but often fails to examine the quality of that empirical or theoretical basis. It could just be bullshit, but as long as it is internally consistent bullshit then the “backs up designs with facts” box can be ticked. This is also true of badly-designed user tests (of which I’ve witnessed a few in my time) that provide little useful information about the design beyond internally consistent bullshit that ticks the “passed user testing” box.

]]></description>
<dc:subject>UX user-experience fads-and-fallacies amusing engineering-criticism</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3691653e1815/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:UX"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:user-experience"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fads-and-fallacies"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:engineering-criticism"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1202.2026">
    <title>[1202.2026] A quantum genetic algorithm with quantum crossover and mutation operations</title>
    <dc:date>2014-01-13T14:00:51+00:00</dc:date>
    <link>http://arxiv.org/abs/1202.2026</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.
]]></description>
<dc:subject>genetic-algorithm search-algorithms quantums algorithms nudge-targets amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:287975e79763/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetic-algorithm"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:search-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:quantums"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://andrewgelman.com/2013/12/17/replication-backlash/">
    <title>Replication backlash « Statistical Modeling, Causal Inference, and Social Science Statistical Modeling, Causal Inference, and Social Science</title>
    <dc:date>2013-12-18T14:17:39+00:00</dc:date>
    <link>http://andrewgelman.com/2013/12/17/replication-backlash/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[A result that is not sufficiently robust that it can be independently reproduced will not provide the basis for an effective therapy in an outbred human population. A result that is not able to be independently reproduced, that cannot be translated to another lab using what most would regard as standard laboratory procedures (blinding, controls, validated reagents etc) is not a result. It is simply a ‘scientific allegation’.
]]></description>
<dc:subject>publishing academic-culture community credentialing disintermediation-in-action amusing replicate-replicate</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e5d7d07e3f77/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:publishing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:community"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:credentialing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:disintermediation-in-action"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:replicate-replicate"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.reeseco.com/papers/abr12.htm">
    <title>Booksellers' Descriptions and Copyright</title>
    <dc:date>2013-07-29T13:27:54+00:00</dc:date>
    <link>http://www.reeseco.com/papers/abr12.htm</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[One clue to lifted descriptions are pet descriptive phrases favored by the bookseller. A former employee of mine, a skilled cataloger and bookseller, is very fond of the word "pleasing." He would use it at every opportunity, and I would try to edit it out just as fast. In my view a book can be many things – magnificent, awe-inspiring, wonderful, thought-provoking, or just plain nice – but not "pleasing." Despite my best efforts he got a number past me, and whenever I check something in old cataloging and find that word, I know who wrote the description. Another, now departed, bookseller of my acquaintance was fond of the cryptic term "measurably rare". What exactly does that mean? I never found out. Another formerly extant American bookseller employed the abbreviation "fxd" as a catch-all in his physical description of the book to indicate that it had – well, problems. Again, it was unclear what that meant; possibly "foxed," or "fixed," but almost certainly "f----d". "Fxd" was as clear a signature of authorship as that bookseller’s name.

]]></description>
<dc:subject>bookseller catalog copyright amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:4d4e63a2feb3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bookseller"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:catalog"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:copyright"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://blogs.discovermagazine.com/science-sushi/2013/06/07/on-the-danger-posed-by-non-expert-critiques-published-to-large-audiences/#.UbMOjRWJRV9">
    <title>On The Danger Posed By Non-Expert Critiques Published To Large Audiences</title>
    <dc:date>2013-06-08T13:39:17+00:00</dc:date>
    <link>http://blogs.discovermagazine.com/science-sushi/2013/06/07/on-the-danger-posed-by-non-expert-critiques-published-to-large-audiences/#.UbMOjRWJRV9</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Geoffrey North, the editor of Current Biology, has written a critical editorial that questions the role of social media in science (which I strongly suggest you read before continuing). In it,…]]></description>
<dc:subject>via:chapmanb amusing academic-culture publishing cultural-assumptions disintermediation-in-action I-already-said-amusing-right?</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:cc1945e5cc56/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:chapmanb"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:academic-culture"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:publishing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cultural-assumptions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:disintermediation-in-action"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:I-already-said-amusing-right?"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1212.6055">
    <title>[1212.6055] On The Optimization of Dijkstras Algorithm</title>
    <dc:date>2013-03-03T21:20:48+00:00</dc:date>
    <link>http://arxiv.org/abs/1212.6055</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[In this paper, we propose some amendment on Dijkstras algorithm in order to optimize it by reducing the number of iterations. The main idea is to solve the problem where more than one node satisfies the condition of the second step in the traditional Dijkstras algorithm. After application of the proposed modifications, the maximum number of iterations of Dijkstras algorithm is less than the number of the graphs nodes.]]></description>
<dc:subject>algorithms performance-measure meta-optimization amusing nudge-targets look-where-I'm-pointing-not-at-my-finger facepalm</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:537a0034342b/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:performance-measure"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:meta-optimization"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:look-where-I'm-pointing-not-at-my-finger"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:facepalm"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://meaningness.wordpress.com/2012/08/22/charnel-ground/">
    <title>Charnel ground | David Chapman at Wordpress</title>
    <dc:date>2012-11-11T13:58:34+00:00</dc:date>
    <link>http://meaningness.wordpress.com/2012/08/22/charnel-ground/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Sooner or later, you’ll die horribly. But you might as well do something interesting in the mean time, not just cower in a corner. Reality is a splatter movie, but it is also an adventure story and a romantic comedy—all at the same time."]]></description>
<dc:subject>Buddhism amusing to-read</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3be66be26972/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Buddhism"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:to-read"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.bogost.com/blog/speaking_of_fees.shtml">
    <title>Ian Bogost - Speaking of Fees...</title>
    <dc:date>2012-08-22T16:09:01+00:00</dc:date>
    <link>http://www.bogost.com/blog/speaking_of_fees.shtml</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["When we begin to see the world like this, thought as a kind of banking, so much makes sense. Ideas can "have currency." Ideas can "circulate." See what I mean? Thought is just nature's way of banking. It just took us humans to come along and establish the formal structures we call "banks" to help increase the flow of ideas, to help them circulate. What is money, after all, but latent ideas?

Think of it like this: banks are like aerobics for ideas. Like ideas gone jogging. Who in the room jogs? Good, most of you. Jogging increases your heart rate, improves your circulation, hones your body. Well, banks do the same for your mind."]]></description>
<dc:subject>TED-talks amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:83e4d971923e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:TED-talks"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1107.0500">
    <title>[1107.0500] Factorization of Matrices of Quaternions</title>
    <dc:date>2012-06-09T11:35:18+00:00</dc:date>
    <link>http://arxiv.org/abs/1107.0500</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["We review known factorization results in quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, the QR factorization. We prove there is a Schur factorization for commuting matrices, and from this derive the spectral theorem. We do not consider algorithms, but do point to some of the numerical literature. 

Rather than work directly with matrices of quaternions, we work with complex matrices with a specific symmetry based on the dual operation. We discuss related results regarding complex matrices that are self-dual or symmetric, but perhaps not Hermitian."]]></description>
<dc:subject>quantums algorithms matrices open-questions nudge-targets amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:edcb3e2bed4f/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:quantums"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:matrices"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:open-questions"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/0908.2741">
    <title>[0908.2741] B-Rank: A top N Recommendation Algorithm</title>
    <dc:date>2012-06-09T10:48:47+00:00</dc:date>
    <link>http://arxiv.org/abs/0908.2741</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["In this paper B-Rank, an efficient ranking algorithm for recommender systems, is proposed. B-Rank is based on a random walk model on hypergraphs. Depending on the setup, B-Rank outperforms other state of the art algorithms in terms of precision, recall (19% - 50%), and inter list diversity (20% - 60%). B-Rank captures well the difference between popular and niche objects. The proposed algorithm produces very promising results for sparse and dense voting matrices. Furthermore, a recommendation list update algorithm is introduced,to cope with new votes. This technique significantly reduces computational complexity. The implementation of the algorithm is simple, since B-Rank needs no parameter tuning."]]></description>
<dc:subject>algorithms peer-production benchmarking amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:a35ded81d121/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:peer-production"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:benchmarking"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://houseoffame.blogspot.com/2012/04/long-tyme-agoon-in-shire-far-away.html">
    <title>Geoffrey Chaucer Hath a Blog: A Long Tyme Agoon in a Shire Far Away</title>
    <dc:date>2012-04-16T11:46:17+00:00</dc:date>
    <link>http://houseoffame.blogspot.com/2012/04/long-tyme-agoon-in-shire-far-away.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["…A WHINY YOUTHE cam nexte, barleye a man,
With yelwe haire, tunique, and farmeres tan.
But aquaculture litel did he love,
He wolde been a pilot al above 
And bullseye oump-rattes yn a nimble craft.…"]]></description>
<dc:subject>amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:33ee90a6bfe8/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://code.google.com/p/greaterlipsum/">
    <title>greaterlipsum - Tired of the old Lipsum? Try Lovecraft!</title>
    <dc:date>2012-03-22T11:43:55+00:00</dc:date>
    <link>http://code.google.com/p/greaterlipsum/</link>
    <dc:creator>Vaguery</dc:creator><dc:subject>lorem-ipsum cthullu library via:arsyed graphic-design amusing</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0844bb0d6b7d/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:lorem-ipsum"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cthullu"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:library"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:arsyed"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:graphic-design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://arxiv.org/abs/1112.1841">
    <title>[1112.1841] Consistency of multidimensional combinatorial substitutions</title>
    <dc:date>2011-12-18T00:31:20+00:00</dc:date>
    <link>http://arxiv.org/abs/1112.1841</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in Z^d. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of the way they are glued together in the image by a substitution. Two problems can arise when defining a substitution in such a way: it can fail to be consistent, and the patterns in an image by the substitution might overlap. 

We prove that it is undecidable whether a two-dimensional substitution is consistent or overlapping, and we provide practical algorithms to decide these properties in some particular cases."]]></description>
<dc:subject>fractals rewriting-systems mathematical-recreations amusing nudge-targets undecodability</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:0940c4229478/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fractals"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rewriting-systems"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:undecodability"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.futilitycloset.com/2011/09/17/presto-chango/">
    <title>Presto Chango | Futility Closet</title>
    <dc:date>2011-10-01T13:10:43+00:00</dc:date>
    <link>http://www.futilitycloset.com/2011/09/17/presto-chango/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["It will be observed that this square when turned upside down is still magic."]]></description>
<dc:subject>mathematical-recreations amusing nudge-targets</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:da00fcc772ff/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:mathematical-recreations"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:nudge-targets"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.avc.com/a_vc/2011/06/investing-in-the-cultural-revolution.html">
    <title>A VC: Investing In The Cultural Revolution</title>
    <dc:date>2011-06-05T18:02:27+00:00</dc:date>
    <link>http://www.avc.com/a_vc/2011/06/investing-in-the-cultural-revolution.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["In the middle east, we've seen the power of the Internet in the Arab Spring. I believe we are in for a lot more of that sort of thing and that it will not be limited to repressive governments, but to all large institutions that seek to control people and their free will. This is the cultural revolution that I referred to in my talk with Erick at Disrupt.

I think investors should be aware of what is coming and seek to invest in it where it is investable. I'm curious what the AVC community thinks of this investment thesis and where we should be looking for opportunities that fit into this thesis."]]></description>
<dc:subject>disruptive-technology internet investing venture-capital amusing disintermediation-targets startup-culture-must-die</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:d354e427bfb3/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:disruptive-technology"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:internet"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:investing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:venture-capital"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:disintermediation-targets"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:startup-culture-must-die"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.youtube.com/watch?v=uKfKtXYLG78">
    <title>YouTube - Erlang: The Movie</title>
    <dc:date>2011-05-30T15:21:25+00:00</dc:date>
    <link>http://www.youtube.com/watch?v=uKfKtXYLG78</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["This is a short video about Erlang, the functional programming language."]]></description>
<dc:subject>amusing geek programming-language video</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:05d4523f51b2/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:geek"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:programming-language"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:video"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.thelovecraftsman.com/2011/04/why-cthulhu-never-gets-invited-to-play.html">
    <title>The Lovecraftsman: Why Cthulhu never gets invited to play Call of Cthulhu (comic)</title>
    <dc:date>2011-04-29T16:34:41+00:00</dc:date>
    <link>http://www.thelovecraftsman.com/2011/04/why-cthulhu-never-gets-invited-to-play.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Why Cthulhu never gets invited to play Call of Cthulhu]]></description>
<dc:subject>comix Cthulhu amusing</dc:subject>
<dc:source>https://pinboard.in/</dc:source>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e5abb02548ac/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:comix"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Cthulhu"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://photosounder.com/">
    <title>Photosounder.com - Image-sound editor &amp; synthesizer</title>
    <dc:date>2009-10-05T20:45:36+00:00</dc:date>
    <link>http://photosounder.com/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Photosounder is a one-of-a-kind image-sound editing program. It is unique in that it opens images and sounds indiscriminately, treats and processes them as images, and synthesizes them as sounds. Sounds, once turned into images, can be powerfully modified to achieve effects and results that couldn't be obtained in any other way, while images of all sorts reveal the infinite kinds of otherworldly sounds they contain. Ultimately, knowing how sounds look and how images sound, you'll be able to create images that sound like what you want to hear, or like what you couldn't imagine to hear."
]]></description>
<dc:subject>sound images synthesis modality transformer amusing algorithms algorithmic-art</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:9bceb112153c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:sound"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:images"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:synthesis"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:modality"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:transformer"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:algorithmic-art"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.savagechickens.com/2009/08/wacky-word-fun.html">
    <title>Wacky Word Fun Cartoon | Savage Chickens - Cartoons on Sticky Notes by Doug Savage</title>
    <dc:date>2009-08-04T12:35:03+00:00</dc:date>
    <link>http://www.savagechickens.com/2009/08/wacky-word-fun.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Advanced Mad Libs
]]></description>
<dc:subject>cartoon amusing</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:ad32ea2bb39e/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cartoon"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.dieselsweeties.com/archive/2318">
    <title>diesel sweeties: 8-bit robot romance webcomic and geeky t-shirts : Pint the Legend</title>
    <dc:date>2009-07-05T13:18:06+00:00</dc:date>
    <link>http://www.dieselsweeties.com/archive/2318</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[in preparation for the Michigan Brewers' Guild festival in a few weeks
]]></description>
<dc:subject>beer cartoon amusing artisanal craftsmanship-as-self-definition</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3dd9a44cae8c/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:beer"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:cartoon"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:artisanal"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:craftsmanship-as-self-definition"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.toplessrobot.com/2009/06/bonus_robs_transformers_2_faqs.php">
    <title>Transformers 2 FAQs</title>
    <dc:date>2009-07-03T00:42:29+00:00</dc:date>
    <link>http://www.toplessrobot.com/2009/06/bonus_robs_transformers_2_faqs.php</link>
    <dc:creator>Vaguery</dc:creator><dc:subject>via:nelson amusing crucial-plot-points-explained DO-NOT-SEE-LIST</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:984c60f71310/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:nelson"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:crucial-plot-points-explained"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:DO-NOT-SEE-LIST"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.hootingyard.org/archives/2548">
    <title>Lost Names at Hooting Yard</title>
    <dc:date>2009-07-02T11:54:52+00:00</dc:date>
    <link>http://www.hootingyard.org/archives/2548</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["“So, Ringo Starr, you continue to defy me?” hissed evil Nazi Obergruppenfuhrer Blind Jack of Knaresborough to his quailing captive. Suddenly, a rescue party led by daring trio Nova Pilbeam, Ivy Compton-Burnett, and Thomas De Quincey crashed in to the chamber. The Nazi hellhound spun on his heels, but was swiftly grappled to the floor by David Miliband.

Later, as the gung ho heroes sat in the helicopter taking them back to Blighty, they were moved to receive congratulatory radio messages from both Richard Milhous Nixon and Ayn Rand."
]]></description>
<dc:subject>amusing</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:827cea3afb44/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://io9.com/5301898/michael-bay-finally-made-an-art-movie">
    <title>io9 - Michael Bay Finally Made An Art Movie - Transformers: Revenge of the Fallen</title>
    <dc:date>2009-06-24T23:20:30+00:00</dc:date>
    <link>http://io9.com/5301898/michael-bay-finally-made-an-art-movie</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["So, to sum up: Transformers: Revenge Of The Fallen is one of the greatest achievements in the history of cinema, if not the greatest. You could easily argue that cinema, as an artform, has all been leading up to this. It will destabilize your limbic system, probably forever, and make you doubt the solidity of your surroundings. Generations of auteurs have struggled, in vain, to create a cinematic experience as overwhelming, and as liberating, as ROTF."
]]></description>
<dc:subject>movie amusing review</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e2336470efe7/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:movie"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:review"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://axiombox.com/rubx/">
    <title>Rubx</title>
    <dc:date>2009-04-07T11:56:36+00:00</dc:date>
    <link>http://axiombox.com/rubx/</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Rubx, a.k.a. Ruby Boobie, is your personal Ruby interpreter in Twitter. Whether you are trying to test some Ruby code, play around with it or see what's capable of, Rubx is here for you.

Think of Rubx as IRB (the Interactive Ruby Shell), built-in on Twitter."
]]></description>
<dc:subject>twitter Ruby interactivity amusing project bot</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:8cefc7ff3825/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:twitter"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Ruby"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:interactivity"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:project"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:bot"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://agileconsulting.blogspot.com/2009/03/dangers-of-agile.html">
    <title>Agile consulting: The Dangers of Agile</title>
    <dc:date>2009-03-10T06:58:32+00:00</dc:date>
    <link>http://agileconsulting.blogspot.com/2009/03/dangers-of-agile.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Everybody knows that agile provides some great ideas if you want to add value to software delivery projects. But what I haven’t seen is a fundamental look at the effects of agile on our health, on our sanity, and the safety of our environment..."
]]></description>
<dc:subject>agility fair-and-balanced amusing</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e032dfe3ba49/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:agility"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:fair-and-balanced"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.lazy8studios.com/cogs_gameplay_sneak_peek">
    <title>Cogs Gameplay Sneak Peek | Lazy 8 Studios</title>
    <dc:date>2009-02-16T14:44:25+00:00</dc:date>
    <link>http://www.lazy8studios.com/cogs_gameplay_sneak_peek</link>
    <dc:creator>Vaguery</dc:creator><dc:subject>via:bongboing puzzle game design steampunk amusing</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:e7ccffed91bb/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:bongboing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:puzzle"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:game"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:design"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:steampunk"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.biais.org/blog/index.php/2009/01/05/72-genetic-algorithm-in-python-to-generate-file-converters">
    <title>Genetic Algorithm in Python to Generate File Converters - biais.org</title>
    <dc:date>2009-01-05T18:28:24+00:00</dc:date>
    <link>http://www.biais.org/blog/index.php/2009/01/05/72-genetic-algorithm-in-python-to-generate-file-converters</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA[Actually, this is a form of linear genetic programming (GP). A "genetic algorithm" typically refers to mapping genes directly onto a fixed series of parameters. Genetic programming refers to search over the set of arbitrary-size executable code, or structures of arbitrary complexity.
]]></description>
<dc:subject>via:arthegall evolutionary-algorithms genetic-programming Python filters amusing</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:3f6977b2c8fe/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:via:arthegall"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:evolutionary-algorithms"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:genetic-programming"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Python"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:filters"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://seekingalpha.com/article/113091-the-rewriting-of-open-source-history?source=feed">
    <title>The Rewriting of Open Source History - Seeking Alpha</title>
    <dc:date>2009-01-04T23:22:45+00:00</dc:date>
    <link>http://seekingalpha.com/article/113091-the-rewriting-of-open-source-history?source=feed</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["The open source blogosphere featured two articles the last week of December 2008 that inaccurately draw software-market history timelines from which the authors then inaccurately position the place of open source software in the information technology (IT) market. I doubt if the statements are intentionally misleading; they are most likely the result of ignorance or sloppiness."
]]></description>
<dc:subject>open-source history rewriting amusing class-wars</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:79d97cfba512/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:open-source"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:history"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:rewriting"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:class-wars"/>
</rdf:Bag></taxo:topics>
</item>
<item rdf:about="http://www.andyhopp.com/gallery_deepones01.html">
    <title>Fantasy Illustration by Andy Hopp</title>
    <dc:date>2008-12-01T13:07:32+00:00</dc:date>
    <link>http://www.andyhopp.com/gallery_deepones01.html</link>
    <dc:creator>Vaguery</dc:creator><description><![CDATA["Where the Deep Ones Are"
]]></description>
<dc:subject>Cthulhu amusing illustration parody</dc:subject>
<dc:identifier>https://pinboard.in/u:Vaguery/b:2522837630c4/</dc:identifier>
<taxo:topics><rdf:Bag>	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:Cthulhu"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:amusing"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:illustration"/>
	<rdf:li rdf:resource="https://pinboard.in/u:Vaguery/t:parody"/>
</rdf:Bag></taxo:topics>
</item>
</rdf:RDF>