<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:media="http://search.yahoo.com/mrss/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	xmlns:custom="https://www.oreilly.com/rss/custom"

	>

<channel>
	<title>Four Short Links &#8211; Radar</title>
	<atom:link href="https://www.oreilly.com/radar/topics/four-short-links/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.oreilly.com/radar</link>
	<description>Now, next, and beyond: Tracking need-to-know trends at the intersection of business and technology</description>
	<lastBuildDate>Tue, 17 Feb 2026 22:35:09 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9</generator>

<image>
	<url>https://www.oreilly.com/radar/wp-content/uploads/sites/3/2025/04/cropped-favicon_512x512-160x160.png</url>
	<title>Four Short Links &#8211; Radar</title>
	<link>https://www.oreilly.com/radar</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Four short links: 14 Dec 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-14-dec-2020/</link>
				<pubDate>Tue, 15 Dec 2020 14:52:18 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13589</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Entity Resolution, Mobile Apps, Thinking, and Language History]]></custom:subtitle>
		
				<description><![CDATA[End-to-end Entity Resolution for Big Data — Introduction to the entity resolution pipeline and the algorithms at the different stages. Includes a summary of open source tools and their features. (via Adrian Colyer) 33 Engineering Challenges of Building Mobile Apps at Scale — Part 1, covering the first 10, is up. They are: 1. State [&#8230;]]]></description>
								<content:encoded><![CDATA[
<ol class="wp-block-list"><li><a href="https://dl.acm.org/doi/abs/10.1145/3418896">End-to-end Entity Resolution for Big Data</a> — <em>Introduction to the entity resolution pipeline and the algorithms at the different stages. Includes a summary of open source tools and their features.</em> (via <a href="https://blog.acolyer.org/2020/12/14/entity-resolution/">Adrian Colyer</a>)</li><li><a href="https://blog.pragmaticengineer.com/10-engineering-challenges-due-to-the-nature-of-mobile-applications/">33 Engineering Challenges of Building Mobile Apps at Scale</a> — <em>Part 1, covering the first 10, is up. They are: </em><i>1. State management; 2. Mistakes are hard to revert; 3. The long tail of old app versions; 4. Deeplinks; 5. Push and background notifications; 6. App crashes; 7. Offline support; 8. Accessibility; 9. CI/CD and the build train; 10. Device &amp; OS fragmentation.</i> </li><li><a href="https://elifesciences.org/articles/59410">Cognitive Effort vs Physical Pain</a> — <i>We found that cognitive effort can be traded off for physical pain and that people generally avoid exerting high levels of cognitive effort.</i> This explains why more people don&#8217;t use (your favourite editor).</li><li><a href="https://github.com/ericfischer/if-then-else/blob/master/if-then-else.md">If-Then-Else Had to be Invented</a> — The history of where &#8220;else&#8221; came from, and it&#8217;s a fascinating archaeological romp through the ages of programming. E.g., <i>Flow-Matic, Grace Murray Hopper&#8217;s predecessor to COBOL, made the three-way if a little easier to think about by talking about comparing two numbers instead of about the signs of numbers. It introduced the name &#8220;otherwise&#8221; for the case where the comparison wasn&#8217;t what you were looking for.</i></li></ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 8 Dec 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-8-dec-2020/</link>
				<pubDate>Tue, 15 Dec 2020 14:49:14 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13584</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[NLP Text Attack Framework, Developer Metrics, Legacy Code, and Distributed Systems Reading List]]></custom:subtitle>
		
				<description><![CDATA[TextAttack — Framework for generating adversarial examples for NLP models. (Paper) (via The Data Exchange) Measuring Developer Productivity — There is no useful measure that operates at a finer grain than “tasks multiplied by complexity.” Measuring commits, lines of code, or hours spent coding, as some tools do, is no more useful at a team [&#8230;]]]></description>
								<content:encoded><![CDATA[
<ol class="wp-block-list"><li><a href="https://github.com/QData/TextAttack">TextAttack</a> — <em>Framework for generating adversarial examples for NLP models.</em> (<a href="https://arxiv.org/abs/2005.05909">Paper</a>) (via <a href="https://thedataexchange.media/increasing-the-robustness-of-natural-language-applications/">The Data Exchange</a>)</li><li><a href="https://stackoverflow.blog/2020/12/07/measuring-developer-productivity/">Measuring Developer Productivity</a> — <i>There is no useful measure that operates at a finer grain than “tasks multiplied by complexity.” Measuring commits, lines of code, or hours spent coding, as some tools do, is no more useful at a team scale than it is at an individual scale. There simply is no relation between the number of code artifacts a team produces, or the amount of time they spend on them, and the value of their contributions.</i> When engineering managers gather in the hotel bar after the conference day ends, this is one of the subjects they will debate endlessly.</li><li><a href="https://understandlegacycode.com/blog/key-points-of-beyond-legacy-code/">Legacy Code</a> — <em>All the things I wish I&#8217;d known twenty years ago. The top-level bullet-points: (1) Writing code isn’t the limiting factor; (2) Start with “why”; (3) Reduce the feedback loop; (4) Make people collaborate; (5) Different strategies to approach Legacy Code.</em></li><li><a href="https://dancres.github.io/Pages/">Distributed Systems Reading List</a> — <i>I often argue that the toughest thing about distributed systems is changing the way you think. Here is a collection of material I&#8217;ve found useful for motivating these changes.</i></li></ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 4 Dec 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-4-dec-2020/</link>
				<pubDate>Fri, 04 Dec 2020 20:56:00 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13536</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[NAND Game, Game AI, In-Database Machine Learning, and Datastores at Scale]]></custom:subtitle>
		
				<description><![CDATA[NAND Game &#8212; You start with a single component, the nand gate. Using this as the fundamental building block, you will build all other components necessary. (See also NAND to Tetris) Facebook&#8217;s Game AI &#8212; today we are unveiling Recursive Belief-based Learning (ReBeL), a general RL+Search algorithm that can work in all two-player zero-sum games, [&#8230;]]]></description>
								<content:encoded><![CDATA[
<ol class="wp-block-list"><li><a href="http://nandgame.com/">NAND Game</a> &#8212; <i>You start with a single component, the nand gate. Using this as the fundamental building block, you will build all other components necessary.</i> (See also <a href="https://www.nand2tetris.org/">NAND to Tetris</a>)</li><li><a href="https://ai.facebook.com/blog/rebel-a-general-game-playing-ai-bot-that-excels-at-poker-and-more/">Facebook&#8217;s Game AI</a> &#8212; <i>today we are unveiling Recursive Belief-based Learning (ReBeL), a general RL+Search algorithm that can work in all two-player zero-sum games, including imperfect-information games. ReBeL builds on the RL+Search algorithms like AlphaZero that have proved successful in perfect-information games. Unlike those previous AIs, however, ReBeL makes decisions by factoring in the probability distribution of different beliefs each player might have about the current state of the game, which we call a public belief state (PBS). In other words, ReBeL can assess the chances that its poker opponent thinks it has, for example, a pair of aces.</i></li><li><a href="https://btw.informatik.uni-rostock.de/download/tagungsband/B6-1.pdf">In-Database Machine Learning</a> &#8212; <i>We demonstrate our claim by implementing tensor algebra and stochastic gradient descent using lambda expressions for loss functions as a pipelined operator in a main memory database system. Our approach enables common machine learning tasks to be performed faster than by extended disk-based database systems or as well as dedicated tools by eliminating the time needed for data extraction. This work aims to incorporate gradient descent and tensor data types into database systems, allowing them to handle a wider range of computational tasks.</i></li><li><a href="https://slack.engineering/scaling-datastores-at-slack-with-vitess/">Scaling Datastores at Slack with Vitess</a> &#8212; <a href="https://vitess.io/">Vitess</a> is YouTube&#8217;s MySQL horizontal-scaling solution. This article is a really good write-up of what they were doing, why it didn&#8217;t work, how they tested the waters with Vitess, and how it&#8217;s working for them so far.</li></ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 1 Dec 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-1-dec-2020/</link>
				<pubDate>Tue, 01 Dec 2020 20:54:00 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13533</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[AlphaFold, Purpose-First Programming, 2000 to 2020, and 3D in DNA]]></custom:subtitle>
		
				<description><![CDATA[AlphaFold &#8212; This is astonishing: protein-folding solved by Google&#8217;s DeepMind. Figuring out what shapes proteins fold into is known as the “protein folding problem”, and has stood as a grand challenge in biology for the past 50 years. In a major scientific advance, the latest version of our AI system AlphaFold has been recognised as [&#8230;]]]></description>
								<content:encoded><![CDATA[
<ol class="wp-block-list"><li><a href="https://deepmind.com/blog/article/alphafold-a-solution-to-a-50-year-old-grand-challenge-in-biology">AlphaFold</a> &#8212; This is astonishing: protein-folding solved by Google&#8217;s DeepMind. <i>Figuring out what shapes proteins fold into is known as the “protein folding problem”, and has stood as a grand challenge in biology for the past 50 years. In a major scientific advance, the latest version of our AI system AlphaFold has been recognised as a solution to this grand challenge by the organisers of the biennial Critical Assessment of protein Structure Prediction (CASP).</i> And from <a href="https://www.sciencemag.org/news/2020/11/game-has-changed-ai-triumphs-solving-protein-structures">Science</a>: <i>The organizers even worried DeepMind may have been cheating somehow. So Lupas set a special challenge: a membrane protein from a species of archaea, an ancient group of microbes. For 10 years, his research team tried every trick in the book to get an x-ray crystal structure of the protein. &#8220;We couldn’t solve it.&#8221; But AlphaFold had no trouble. It returned a detailed image of a three-part protein with two long helical arms in the middle. The model enabled Lupas and his colleagues to make sense of their x-ray data; within half an hour, they had fit their experimental results to AlphaFold’s predicted structure. &#8220;It’s almost perfect,&#8221; Lupas says. &#8220;They could not possibly have cheated on this. I don’t know how they do it.&#8221; Far more useful (and to me, more impressive) than AlphaGo.</i></li><li><i><a href="https://computinged.wordpress.com/2020/11/30/purpose-first-programming-a-programming-learning-approach-for-learners-who-care-most-about-what-code-achieves-katie-cunninghams-defense/">Purpose-First Programming</a> &#8212; Some students resist the cognitively-heavy tasks of simulating program execution. The secret to teaching those folks to program may be &#8220;purpose-first programming&#8221;: <i>She used Github repositories and expert interviews to identify a few programming plans (just like Elliot Soloway and Jim Spohrer studied years ago) that were in common use in a domain that her participants cared about. She then taught those plans. Students modified and combined the plans to create programs that the students found useful. Rather than start with syntax or semantics, she started with the program’s purpose.</i> Very reminiscent of the late 90s Perl and PHP copy-and-change coding boom that got orders of magnitude more people programming than were coming through CS courses at the time.</i></li><li><a href="https://ftrain.medium.com/web-conversations-with-the-year-2000-f0c40fb8b19c">Conversations with The Year 2000</a>&nbsp;— Paul Ford is a genius.<br><em>’00: How does HTML work now?<br>’20: It’s pretty simple, you define app logic as unidirectional dataflow, then fake up pseudo-HTML components that mirror state, and a controller mounts fake-page deltas onto the browser surface.<br>’00: How do you change the title?<br>’20: You can’t.</em></li><li><a href="https://github.com/pallada-92/dna-3d-engine">cube3d.dna</a>&nbsp;— A raytracer implemented in DNA.&nbsp;<em>How to deploy: (1) Synthesize the oligonucleotides from the cube3d.dna file. (2) Arrange the test tubes as shown in the diagram below. (3) Don’t forget to provide the initial concentrations according to the table below. (4) Use a pipette to encode the position (row and column) of each tube to start the computation.</em></li></ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 27 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-27-nov-2020/</link>
				<pubDate>Fri, 27 Nov 2020 20:51:00 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13525</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Unix History, Robot OS Talks, Learning with Language, and Easy Theory]]></custom:subtitle>
		
				<description><![CDATA[Brian Kernighan Interviews Ken Thompson &#8212; From a fun interview: McIlroy keeps coming up. He&#8217;s the smartest of all of us and the least remembered (or written down)&#8230; McIlroy sat there and wrote &#8212;on a piece of paper, now, not on a computer&#8212; TMG [a proprietary yacc-like program] written in TMG&#8230; And then! He now [&#8230;]]]></description>
								<content:encoded><![CDATA[
<p><ol>
<li><a href="https://www.youtube.com/watch?v=EY6q5dv_B-o&amp;feature=youtu.be&amp;t=2314">Brian Kernighan Interviews Ken Thompson</a> &#8212; From a fun interview: <i>McIlroy keeps coming up. He&#8217;s the smartest of all of us and the least remembered (or written down)&#8230; McIlroy sat there and wrote &#8212;on a piece of paper, now, not on a computer&#8212; TMG [a proprietary yacc-like program] written in TMG&#8230; And then! He now has TMG written in TMG, he decided to give his piece of paper to his piece of paper and write down what came out (the code). Which he did. And then he came over to my editor and he typed in his code, assembled it, and (I won&#8217;t say without error, but with so few errors you&#8217;d be astonished) he came up with a TMG compiler, on the PDP-7, written in TMG. And it&#8217;s the most basic, bare, impressive self-compilation I&#8217;ve ever seen in my life.</i> (via <a href="https://news.ycombinator.com/item?id=25182238">Hacker News</a>)</li>
<li><a href='https://discourse.ros.org/t/ros-world-talks-are-posted/17436'>ROS World 2020 Videos</a> &#8212; <i>all of the ROS World videos, including all the lightning talks</i>. ROS = Robot Operating System.</li>
<li><a href='http://ai.stanford.edu/blog/learning-from-language/'>Learning from Language</a> &#8212; <i>we propose a simple approach called Language Shaped Learning (LSL): if we have access to explanations at training time, we encourage the model to learn representations that are not only helpful for classification, but are predictive of the language explanations.</i> (<a href="https://arxiv.org/abs/1911.02683">Paper</a>)</li>
<li><a href='https://www.easytheory.org/'>Easy Theory</a> &#8212; YouTube lectures on computer science theory. <i>Mondays: Algorithms; Wednesdays: Theory of Computation; Fridays: Theory of Computation; Sundays: Livestream/bonus</i>. </li>
</ol></p>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 24 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-24-nov-2020/</link>
				<pubDate>Tue, 24 Nov 2020 12:44:17 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13424</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[OpenStreetMap Numbers, Drone Warfare, Pattern-Aware Graph Mining, and Declining Researcher Productivity]]></custom:subtitle>
		
				<description><![CDATA[OpenStreetMap is Having a Moment &#8212; Apple was responsible for more edits in 2019 than Mapbox accounted for in its entire corporate history. See also the 2020: Curious Cases of Corporations in OpenStreetMap talk from State of the Map. (via Simon Willison) Drone Warfare &#8212; The second point, &#8220;SkyNet&#8221;, is the interesting bit. Azerbaijan and [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://joemorrison.medium.com/openstreetmap-is-having-a-moment-dcc7eef1bb01">OpenStreetMap is Having a Moment</a> &#8212; <i>Apple was responsible for more edits in 2019 than Mapbox accounted for in its entire corporate history. See also the <a href="https://www.youtube.com/watch?v=BI0VrPyAtcQ">2020: Curious Cases of Corporations in OpenStreetMap</a> talk from State of the Map. (via <a href="https://simonwillison.net/2020/Nov/20/joe-morrison/">Simon Willison</a>)</i></li>
<p><i></i></p>
<p><i></p>
<li><a href="https://thetriad.thebulwark.com/p/why-wont-republicans-take-the-next?token=eyJ1c2VyX2lkIjo0MDU1OTAxLCJwb3N0X2lkIjoxOTU5NTE3NywiXyI6IkhqQVpRIiwiaWF0IjoxNjA2MTc0NDQ3LCJleHAiOjE2MDYxNzgwNDcsImlzcyI6InB1Yi04NzI3NCIsInN1YiI6InBvc3QtcmVhY3Rpb24ifQ.qjeFm1Vh_VHi8fB5xAZhJBqcT5nJqtHYRdeTZ8qHGXQ">Drone Warfare</a> &#8212; The second point, &#8220;SkyNet&#8221;, is the interesting bit. Azerbaijan and Armenia fought a war and drones enabled some very asymmetric outcomes. Quoting a Washington Post story, <i>Azerbaijan, frustrated at a peace process that it felt delivered nothing, used its Caspian Sea oil wealth to buy arms, including a fleet of Turkish Bayraktar TB2 drones and Israeli kamikaze drones (also called loitering munitions, designed to hover in an area before diving on a target). [&#8230;] Azerbaijan used surveillance drones to spot targets and sent armed drones or kamikaze drones to destroy them, analysts said. [&#8230;] Their tally, which logs confirmed losses with photographs or videos, listed Armenian losses at 185 T-72 tanks; 90 armored fighting vehicles; 182 artillery pieces; 73 multiple rocket launchers; 26 surface-to-air missile systems, including a Tor system and five S-300s; 14 radars or jammers; one SU-25 war plane; four drones and 451 military vehicles.</i> (via <a href="https://cheeseburgergothic.substack.com/p/the-rise-of-the-machines/comments">John Birmingham</a>)</li>
<li><a href="https://github.com/pdclab/peregrine">Peregrine</a> &#8212; <i>an efficient, single-machine system for performing data mining tasks on large graphs. Some graph mining applications include: Finding frequent subgraphs; Generating the motif/graphlet distribution; Finding all occurrences of a subgraph. Peregrine is highly programmable, so you can easily develop your own graph mining applications using its novel, declarative, graph-pattern-centric API. To write a Peregrine program, you describe which graph patterns you are interested in mining, and what to do with each occurrence of those patterns. You provide the what and the runtime handles the how.</i></li>
<li><a href="https://twitter.com/tamaybes/status/1330510091586588675">Declining Marginal Returns of Researchers</a> &#8212; (Tamay Besiroglu) <i>I found that the marginal returns of researchers are rapidly declining. There is what’s called a “standing on toes” effect: researcher productivity declines as the field grows. Because ML has recently grown very quickly, this makes better ML models much harder to find.</i> (<a href="https://static1.squarespace.com/static/5fb98ea9a787c521ab066091/t/5fba5c3ddb275d51d91825eb/1606048834827/AreModels.pdf">Dissertation</a>)</li>
<p></i><i></i></ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 20 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-20-nov-2020/</link>
				<pubDate>Fri, 20 Nov 2020 12:25:49 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13421</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[CLI ePub Reader, Biology, Technical Debt, and APIs for Databases]]></custom:subtitle>
		
				<description><![CDATA[epr &#8212; Terminal/CLI Epub reader. I Should Have Loved Biology &#8212; Conveys well the magic of the field. Notable also for the reference to A Computer Scientist&#8217;s Guide to Cell Biology, which I didn&#8217;t realise existed. Ur-Technical Debt &#8212; Reviving Ward Cunningham&#8217;s take on technical debt. Simply put, ur-technical debt arises when my ideas diverge [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://github.com/wustho/epr">epr</a> &#8212; <i>Terminal/CLI Epub reader</i>.</li>
<li><a href="https://jsomers.net/i-should-have-loved-biology/">I Should Have Loved Biology</a> &#8212; Conveys well the magic of the field. Notable also for the reference to <a href="https://www.springer.com/gp/book/9780387482750">A Computer Scientist&#8217;s Guide to Cell Biology</a>, which I didn&#8217;t realise existed.</li>
<li><a href="https://ieeexplore.ieee.org/document/9121630">Ur-Technical Debt</a> &#8212; Reviving Ward Cunningham&#8217;s take on technical debt. <i>Simply put, ur-technical debt arises when my ideas diverge from my code. That divergence is inevitable with an iterative process. [&#8230;] &#8220;[I]f you develop a program for a long period of time by only adding features and never reorganizing it to reflect your understanding of those features, then eventually that program simply does not contain any understanding and all efforts to work on it take longer and longer.&#8221;</i></li>
<li><a href="https://github.com/directus/directus">Directus</a> &#8212; <i>a real-time [REST and GraphQL] API and App dashboard for managing SQL database content.</i></li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 17 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-17-nov-2020/</link>
				<pubDate>Tue, 17 Nov 2020 12:21:43 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13414</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Security Papers, Security in Syntax, Mistakes, and GraphQL Editor]]></custom:subtitle>
		
				<description><![CDATA[NDSS Symposium 2020 Papers &#8212; Large pile of security research from the 2020 Network and Distributed System Security Symposium, including papers on topics as wide-reaching as hypervisor fuzzing and The Attack of the Clones Against Proof-of-Authority which sounds like a very niche Star Wars sequel indeed. Liquid Information Flow Control &#8212; We present Lifty, a [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://www.ndss-symposium.org/ndss-program/2020-program/">NDSS Symposium 2020 Papers</a> &#8212; Large pile of security research from the 2020 <i>Network and Distributed System Security Symposium</i>, including papers on topics as wide-reaching as <a href="https://www.ndss-symposium.org/ndss-paper/hyper-cube-high-dimensional-hypervisor-fuzzing/">hypervisor fuzzing</a> and <a href="https://www.ndss-symposium.org/ndss-paper/the-attack-of-the-clones-against-proof-of-authority/">The Attack of the Clones Against Proof-of-Authority</a> which sounds like a very niche Star Wars sequel indeed.</li>
<li><a href="https://cseweb.ucsd.edu/~npolikarpova/publications/icfp20-lifty.pdf">Liquid Information Flow Control</a> &#8212; <i>We present Lifty, a domain-specific language for data-centric applications that manipulate sensitive data. A Lifty programmer annotates the sources of sensitive data with declarative security policies, and the language statically and automatically verifies that the application handles the data according to the policies. Moreover, if verification fails, Lifty suggests a provably correct repair, thereby easing the programmer burden of implementing policy enforcing code throughout the application.</i></li>
<li><a href="https://meta.wikimedia.org/wiki/So_you%27ve_made_a_mistake_and_it%27s_public...">So You&#8217;ve Made a Mistake and It&#8217;s Public</a> &#8212; Wikipedians&#8217; excellent advice for what to do when you&#8217;ve been busted making a mistake.</li>
<li><a href="https://github.com/graphql-editor/graphql-editor">GraphQL Editor</a> &#8212; <i>Create a schema by using visual blocks system. GraphQL Editor will transform them into code.</i></li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 13 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-13-nov-2020/</link>
				<pubDate>Fri, 13 Nov 2020 12:20:52 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13409</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[SoC Lecture Notes, Flix, Megatrends, and Credential Management]]></custom:subtitle>
		
				<description><![CDATA[Advanced System on a Chip Lecture Notes (2016) &#8212; Topics: 1. Basic Processor &#38; Memory hierarchy; 2. Advanced Out-of-Order Processor; 3. Data-parallel processors; 4. Micro-controller introduction; 5. Multicore; 6. RISC-V core; 7. Advanced Multicore; 8. Multicore programming; 9. Graphics Processing Unit (GPU); 10. Heterogeneous SoC; 11. GPU Programming; 12. Application-Specific Instruction-Set Processor (ASIP); 13 PULP: [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://iis-people.ee.ethz.ch/~gmichi/asocd/lecturenotes/">Advanced System on a Chip Lecture Notes (2016)</a> &#8212; Topics: <i>1. Basic Processor &amp; Memory hierarchy; 2. Advanced Out-of-Order Processor; 3. Data-parallel processors; 4. Micro-controller introduction; 5. Multicore;  6. RISC-V core; 7. Advanced Multicore; 8. Multicore programming; 9. Graphics Processing Unit (GPU); 10. Heterogeneous SoC; 11. GPU Programming; 12. Application-Specific Instruction-Set Processor (ASIP); 13 PULP: Parallel Ultra-Low-Power Computing; 14. Architecture in the Future &#8211; Wrap-up</i> (via <a href="https://news.ycombinator.com/item?id=25057889">Hacker News</a>).</li>
<li><a href="https://flix.dev/">Flix</a> &#8212; <i>Next-generation reliable, safe, concise, and functional-first programming language.<br />
Flix is a principled and flexible functional-, logic-, and imperative- programming language that takes inspiration from F#, Go, OCaml, Haskell, Rust, and Scala. Flix looks like Scala, but its type system is closer to that of OCaml and Haskell. Its concurrency model is inspired by Go-style processes and channels. Flix compiles to JVM bytecode, runs on the Java Virtual Machine, and supports full tail call elimination.</i> And <i>supports first-class Datalog constraints enriched with lattice semantics.</i></li>
<li><a href="https://peterhdiamandis.medium.com/metatrends-shaping-the-next-decade-d09718144961">20 Megatrends for the 2020s</a> &#8212; <i>Abundance, connectivity, healthspan, capital, AR and Spatial Web, smart devices, human-level AI, AI-Human collaboration, software shells, renewable energy, insurance industry switches to prevention, autonomous vehicles and flying cars, on-demand production and delivery, knowledge, advertising, cellular agriculture, brain-computer interfaces, VR, sustainability/environment, and CRISPR.</i> Even if you don&#8217;t believe these are the trends of the future, it&#8217;s worth knowing what your customers/partners are being told.</li>
<li><a href="https://devopsdirective.com/posts/2020/11/credential-management/">Credential Management</a> &#8212; <i>Level -2: No Authentication; Level -1: All Passwords = “password”; Level 0: Hardcode Everywhere; Level +1: Move Secrets into a Config File; Level +2: Encrypt the Config File; Level +3: Use a Secret Manager; Level +4: Dynamic Ephemeral Credentials</i>.</li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 10 November 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-10-november-2020/</link>
				<pubDate>Tue, 10 Nov 2020 12:13:23 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13404</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
		
				<description><![CDATA[Hypothesis as Liability &#8212; Would the mental focus on a specific hypothesis prevent us from making a discovery? To test this, we made up a dataset and asked students to analyze it. [&#8230;] The most notable “discovery” in the dataset was that if you simply plotted the number of steps versus the BMI, you would [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-020-02133-w">Hypothesis as Liability</a> &#8212; <i>Would the mental focus on a specific hypothesis prevent us from making a discovery? To test this, we made up a dataset and asked students to analyze it. [&#8230;] The most notable “discovery” in the dataset was that if you simply plotted the number of steps versus the BMI, you would see an image of a gorilla waving at you (Fig. 1b).</i></li>
<li><a href="https://www.reddit.com/r/EnoughMuskSpam/comments/99sbwa/former_tesla_programmers_anecdotes_about_problems/">Tesla Engineering Inside Goss</a> &#8212; Lots and lots of inside engineering horror stories (2 years old by now). <i>my issue was the fact that the systems doing the flashing were running the yocto images and perl and the guy writing the perl was also responsible for writing the thing that actually updates the car. that thing (the car-side updater) is about ~100k lines of C in a single file. code reviews were always a laugh riot.</i></li>
<li><a href="https://smalldata.tech/blog/2019/02/09/teach-testing-first">Teach Testing First</a> &#8212; An extremely good idea. Testers and security specialists have a different mindset to regular programmers: they look to pervert and break the software, not simply to find the golden path whereby it produces the right behaviour for the right inputs. Perhaps if more people learned testing first, we&#8217;d end up with more secure software.</li>
<li><a href="https://www.youtube.com/watch?v=D8_VmWWRJgE">Realistic and Interactive Robotic Gaze</a> &#8212; Astonishingly creepy prototype with astonishingly life-like eyeballs. Great work from Disney Research. (<a href="https://la.disneyresearch.com/publication/realistic-and-interactive-robot-gaze/">Paper</a>)</li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 6 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-6-nov-2020/</link>
				<pubDate>Fri, 06 Nov 2020 11:59:34 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13399</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Hardware Security, Ubooquity, Noisepage, and Technical Debt]]></custom:subtitle>
		
				<description><![CDATA[Dealing with Security Holes in Chips &#8212; system security starts at the hardware layer. Ubooquity &#8212; free home server for your comics and ebooks library. &#8220;Like plex for books.&#8221; Noisepage &#8212; a relational database management system developed by the Carnegie Mellon Database Group. The research goal of the NoisePage project is to develop high-performance system [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://semiengineering.com/dealing-with-security-holes-in-chips/">Dealing with Security Holes in Chips</a> &#8212; <i>system security starts at the hardware layer</i>.</li>
<li><a href="https://vaemendis.net/ubooquity/">Ubooquity</a> &#8212; <i>free home server for your comics and ebooks library</i>. &#8220;Like plex for books.&#8221;</li>
<li><a href="https://github.com/cmu-db/noisepage">Noisepage</a> &#8212; <i>a relational database management system developed by the Carnegie Mellon Database Group. The research goal of the NoisePage project is to develop high-performance system components that support autonomous operation and optimization as a first-class design principle.</i>  Also interesting in databases this week: <a href="https://joe.schafer.dev/procella-youtube-analytical-database/">a rundown on Procella</a>, YouTube&#8217;s analytical database.</li>
<li><a href="https://daverupert.com/2020/11/technical-debt-as-a-lack-of-understanding/">Technical Debt</a> &#8212; Where I first found this excellent description of technical debt, by Ward Cunningham: &#8220;If you develop a program for a long period of time by only adding features but never reorganizing it to reflect your understanding of those features, then eventually that program simply does not contain any understanding and all efforts to work on it take longer and longer.&#8221;</li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 4 Nov 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-4-nov-2020/</link>
				<pubDate>Wed, 04 Nov 2020 11:46:23 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13396</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Bald AI, Dates and Times, UX, and Tools]]></custom:subtitle>
		
				<description><![CDATA[The AI Who Mistook a Bald Head for a Football &#8212; Second-tier Scottish football club Inverness Caledonian Thistle doesn’t have a camera operator for matches at their stadium so the club uses an AI-controlled camera that’s programmed to follow the ball for their broadcasts. But in a recent match against Ayr United, the AI controller [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://kottke.org/20/11/the-ai-who-mistook-a-bald-head-for-a-soccer-ball">The AI Who Mistook a Bald Head for a Football</a> &#8212; <i>Second-tier Scottish football club Inverness Caledonian Thistle doesn’t have a camera operator for matches at their stadium so the club uses an AI-controlled camera that’s programmed to follow the ball for their broadcasts. But in a recent match against Ayr United, the AI controller kept moving the camera off the ball to focus on the bald head of the linesman, making the match all but unwatchable. No fans allowed in the stadium either, so the broadcast was the only way to watch.</i> Watch the video, it is hilarious and tragic. I&#8217;m sure there&#8217;s a serious lesson to be drawn from this, but I&#8217;m too busy snickering to draw it.</li>
<li><a href="https://stackoverflow.com/questions/6841333/why-is-subtracting-these-two-times-in-1927-giving-a-strange-result">Why Is Subtracting These Two Times (in 1927) Giving a Strange Result?</a> &#8212; You already knew timezones are a hellmouth, but now you have another example of how deep the hellmouth goes. <i>Basically at midnight at the end of 1927, the clocks went back 5 minutes and 52 seconds.</i> (via Jarkko Hietaniemi)</li>
<li><a href="https://www.nngroup.com/articles/ux-gains-shrinking/">Average UX Improvements Are Shrinking Over Time</a> &#8212; <i>On average, UX improvements have substantially decreased since 2006–2008: from 247% to 75% (a 69% decrease). This difference is statistically significant (p = 0.01) — we can be quite confident that average improvement scores are lower now than they were 12–14 years ago.</i></li>
<li><a href="http://schasins.com/cs294-usable-programming-2020/">CS294: Building User-Centred Programming Tools</a> &#8212; <i>This hands-on course explores a selection of techniques from Programming Languages and Human-Computer Interaction that can help us create useful, usable programming languages and programming tools. We will cover strategies for designing programming systems—e.g., need finding, formative studies, user-centered design broadly. We will also cover tools and techniques that help us build user-friendly programming systems—e.g., program synthesis, structure editors, abstraction design, program slicing. For the final project, individuals or teams will develop a usable abstraction, language, or programming tool of their own design.</i> What looks like an awesome course at Berkeley. The readings alone are excellent.</li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 30 Oct 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-30-oct-2020/</link>
				<pubDate>Fri, 30 Oct 2020 11:05:49 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13385</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Mutation Testing, Causal Reasoning, Pointing and Calling, and Software Architecture]]></custom:subtitle>
		
				<description><![CDATA[Mutation Testing &#8212; in this paper, we semi-automatically learn error-inducing patterns from a corpus of common Java coding errors and from changes that caused operational anomalies at Facebook specifically. We combine the mutations with instrumentation that measures which tests exactly visited the mutated piece of code. Results on more than 15,000 generated mutants show that [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://arxiv.org/abs/2010.13464">Mutation Testing</a> &#8212; <i>in this paper, we semi-automatically learn error-inducing patterns from a corpus of common Java coding errors and from changes that caused operational anomalies at Facebook specifically. We combine the mutations with instrumentation that measures which tests exactly visited the mutated piece of code. Results on more than 15,000 generated mutants show that more than half of the generated mutants survive Facebook&#8217;s rigorous test suite of unit, integration, and system tests.</i></li>
<li><a href="https://colab.research.google.com/github/deepmind/deepmind_research/blob/master/causal_reasoning/Causal_Reasoning_in_Probability_Trees.ipynb">Causal Reasoning in Probability Trees</a> &#8212; A Colab notebook tutorial that <i>is the companion tutorial for the paper <a href="https://arxiv.org/abs/2010.12237">&#8220;Algorithms for Causal Reasoning in Probability trees&#8221; by Genewein T. et al. (2020)</a>. Probability trees are one of the simplest models of causal generative processes.They possess clean semantics and are strictly more general than causal Bayesian networks, being able to e.g. represent causal relations that causal Bayesian networks can’t. Even so, they have received little attention from the AI and ML community. In this tutorial we present new algorithms for causal reasoning in discrete probability trees that cover the entire causal hierarchy (association, intervention, and counterfactuals), operating on arbitrary logical and causal events.</i></li>
<li><a href="https://en.wikipedia.org/wiki/Pointing_and_calling">Pointing and Calling</a> &#8212; <i>a method in occupational safety for avoiding mistakes by pointing at important indicators and calling out the status.</i> The name of the technique <a href="https://rachelbythebay.com/w/2020/10/26/num/">that prevents mistakes</a>.</li>
<li><a href="https://danuker.go.ro/the-grand-unified-theory-of-software-architecture.html">Grand Unified Theory of Software Architecture</a> &#8212; <i>reduce the imperative shell and move code into the functional core</i>.</li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 28 Oct 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-28-oct-2020/</link>
				<pubDate>Wed, 28 Oct 2020 11:39:13 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13382</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Split-Second Phantom Attacks, Deep Fakery, Serverless, and RE McDonalds API]]></custom:subtitle>
		
				<description><![CDATA[Phantom of the ADAS &#8212; In this paper, we investigate &#8220;split-second phantom attacks,&#8221; a scientific gap that causes two commercial advanced driver-assistance systems (ADASs), Telsa Model X (HW 2.5 and HW 3) and Mobileye 630, to treat a depthless object that appears for a few milliseconds as a real obstacle/object. Turns out neural networks can [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://www.nassiben.com/phantoms">Phantom of the ADAS</a> &#8212; <i>In this paper, we investigate &#8220;split-second phantom attacks,&#8221; a scientific gap that causes two commercial advanced driver-assistance systems (ADASs), Telsa Model X (HW 2.5 and HW 3) and Mobileye 630, to treat a depthless object that appears for a few milliseconds as a real obstacle/object.</i> Turns out neural networks can have subliminal message problems. (via <a href="https://gradientflow.substack.com/">Gradient Flow</a>)</li>
<li><a href="https://blog.adobe.com/en/2020/10/20/photoshop-the-worlds-most-advanced-ai-application-for-creatives.html">Photoshop Adds Deep Fakery</a> &#8212; Everyone&#8217;s going to be doing it. Photoshop adds controls to let you change facial expressions in a photo, among other things. Digital images weren&#8217;t real, but somehow they feel less real now.</li>
<li><a href="https://chaordic.io/blog/serverless-distributed-system-productivity/">Serverless &amp; Distributed Systems Productivity</a> &#8212; <i>1. Prefer running your system in the cloud over local emulation. 2. CI/CD Pipelines are not enough, local deployment automation is crucial. 3. For AWS Serverless &amp; “Function-as-a-Service” &#8211; monolithic functions are OK. 4. Consider adopting a monorepo, with tooling appropriate for monorepos. 5. Implement all three pillars of observability.</i></li>
<li><a href="https://twitter.com/rashiq/status/1319346264992026624">Reverse-Engineering McDonalds&#8217; Internal API</a> &#8212; <i>I reverse engineered mcdonald&#8217;s internal api and I&#8217;m currently placing an order worth $18,752 every minute at every mcdonald&#8217;s in the US to figure out which locations have a broken ice cream machine.</i></li>
</ol>
]]></content:encoded>
										</item>
		<item>
		<title>Four short links: 21 Oct 2020</title>
		<link>https://www.oreilly.com/radar/four-short-links-21-oct-2020/</link>
				<pubDate>Wed, 21 Oct 2020 11:34:42 +0000</pubDate>
					<dc:creator><![CDATA[Nat Torkington]]></dc:creator>
						<category><![CDATA[Four Short Links]]></category>
		<category><![CDATA[Commentary]]></category>

		<guid isPermaLink="false">https://www.corp.oreilly.com/radar/?p=13376</guid>

		
					<media:content 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750.png" 
				medium="image" 
				type="image/png" 
				width="1400" 
				height="750" 
			/>

			<media:thumbnail 
				url="https://www.oreilly.com/radar/wp-content/uploads/sites/3/2019/06/4_short_links_logo-1400x750-160x160.png" 
				width="160" 
				height="160" 
			/>
		
				<custom:subtitle><![CDATA[Antitrust, Differential Dataflow, Multilanguage Translation, and Time]]></custom:subtitle>
		
				<description><![CDATA[Justice Department Antitrust Filing Against Google &#8212; Claims advertising was an artificially limited market because of their exclusivity deals, including the Android anti-forking arrangements and Browser paid-default-search deals. New York Times has a write-up. This may be more important, historically, than the election results. Differential Dataflow &#8212; Differential dataflow programs look like many standard &#8220;big [&#8230;]]]></description>
								<content:encoded><![CDATA[<ol>
<li><a href="https://assets.documentcloud.org/documents/7273457/10-20-20-US-v-Google-Complaint.pdf">Justice Department Antitrust Filing Against Google</a> &#8212; Claims advertising was an artificially limited market because of their exclusivity deals, including the Android anti-forking arrangements and Browser paid-default-search deals. <a href="https://www.nytimes.com/2020/10/20/technology/google-antitrust.html">New York Times</a> has a write-up. This may be more important, historically, than the election results.</li>
<li><a href="https://timelydataflow.github.io/differential-dataflow/introduction.html">Differential Dataflow</a> &#8212; <i>Differential dataflow programs look like many standard &#8220;big data&#8221; computations, borrowing idioms from frameworks like MapReduce and SQL. However, once you write and run your program, you can change the data inputs to the computation, and differential dataflow will promptly show you the corresponding changes in its output. Promptly meaning in as little as milliseconds.</i> A book by Microsoft Research, with open source.</li>
<li><a href="https://github.com/pytorch/fairseq/tree/master/examples/m2m_100">https://github.com/pytorch/fairseq/tree/master/examples/m2m_100</a> &#8212; <i>In this work, we create a true Many-to-Many multilingual translation model that can translate directly between any pair of 100 languages. Our focus on non-English-Centric models brings gains of more than 10 BLEU when directly translating between non-English directions while performing competitively with the best single systems of WMT.</i> Open source from <a href="https://about.fb.com/news/2020/10/first-multilingual-machine-translation-model/">Facebook</a>.</li>
<li><a href="https://gist.github.com/timvisee/fcda9bbdff88d45cc9061606b4b923ca">Falsehoods Programmers Believe About Time</a> &#8212; I love these &#8216;falsehoods&#8217; articles. We model the world in our code, and we find it easy to forget how complicated the world is. (Especially with artificial constructs like calendars and clocks)</li>
</ol>
]]></content:encoded>
										</item>
	</channel>
</rss>

<!--
Performance optimized by W3 Total Cache. Learn more: https://www.boldgrid.com/w3-total-cache/?utm_source=w3tc&utm_medium=footer_comment&utm_campaign=free_plugin

Object Caching 58/65 objects using Memcached
Page Caching using Disk: Enhanced (Page is feed) 
Minified using Memcached

Served from: www.oreilly.com @ 2026-03-25 00:31:00 by W3 Total Cache
-->