july.md

July 2018 (collected in June)

THESE NEED TO BE ORGANIZED BETTER :)

• My tweet, Make #error_first_design a first-class citizen
• Stringify DOM nodes using JSON (and revive again)
  • toDOM(x) uses JSON.parse if x is a string
  • FIX: attributes are entered as arrays (index 0 contains the name, 1 contains the value) rather than name-value maps; see https://developer.mozilla.org/en-US/docs/Web/API/Element/attributes
• Firefox Accessibility Inspector
• Why My 11-Year Old Stopped Coding . . . Then Switched to Python
  • Wish I'd had python around as a kid ~ things computative would have made way more sense
• Lindasy Wild aka @stananick, How and Why We Unit Test Our Sass
• from @innovati, How to Write a Container Queries Plugin
• Really simple SVG Patterns using single unicode characters
• Get the benefits of JSX from React by Emulating React and JSX in Vanilla JS
  • gist with modified source react-jsx-in-vanilla.js
• Dr. Boolean (aka Brian Lonsdorf) on Debugging Functional JS
• Adrian Colyer reports on Debugging data flows in reactive programs
  • André Staltz, How to debug RxJS code
• Adrian Colyer reports on How not to structure your database-backed web applications: a study of performance bugs in the wild
  • (PDF) based on How not to structure your database-backed web applications: a study of performance bugs in the wild
  • (PDF) which includes Static Detection of Asymptotic Performance Bugs in Collection Traversals
• Proof by Infinite Descent
  • A proof by contradiction that relies on the least integer principle; see Diophantine equation (next)
• Uncle Bob Martin on Diophantine equations and Undecidability i.e., NOESTIMATES
• Sounds like famous last words, "Designing for Accessiblity is not hard"
• Python property-based testing with Hypothesis
• "Explore how your product should work, before building it" with Sketch.systems
• Uncle Bob on TDD and double entry bookkeeping The parallels between double entry bookkeeping and Test Driven Development are deep and plentiful
• Zoltan Kochan and why we should use pnpm
  • it's really fast because it uses symlinks rather than directory copying
  • see also Flat node_modules is not the only way
• commonstorage.googleapis.com collection of public test videos
• JSON collection of ISO country codes

math and logic

• Mathematical Logic https://medium.com/brandons-computer-science-notes/mathematical-logic-f53f9c60d8d9
• Knowledge Representation and Reasoning https://medium.com/brandons-computer-science-notes/knowledge-representation-and-reasoning-c7d441049715
• NAND logic https://en.wikipedia.org/wiki/NAND_logic
• (PDF) Sossinsky: Tolerance space theory and some applications https://www.researchgate.net/profile/Alexey_Sossinsky/publication/225214345_Tolerance_space_theory_and_some_applications/links/565ed2fc08aefe619b273973/Tolerance-space-theory-and-some-applications.pdf?origin=publication_detail
• (PDF) Homology Theories and Tolerance Automata https://ac.els-cdn.com/0012365X81901679/1-s2.0-0012365X81901679-main.pdf?_tid=89c0f377-4f73-4b12-85fc-53c18db6f285&acdnat=1530513985_a462c37b7ccf50ce4c23cefe3ce71095
• (PDF) Tolerance Automata http://www.kybernetika.cz/content/1967/3/223/paper.pdf
• bayes.js, MCMC in the browser http://www.sumsar.net/blog/2015/12/bayes-js-a-small-library-for-doing-mcmc-in-the-browser/
• MCMC and the case of the spilled seeds http://livefreeordichotomize.com/2017/10/14/mcmc-and-the-case-of-the-spilled-seeds/
• Markov chain https://en.wikipedia.org/wiki/Markov_chain
• Cellular automaton https://en.wikipedia.org/wiki/Cellular_automaton
• Topology https://en.wikipedia.org/wiki/Topology

Time, State, Transition

• (PDF) Andreas Griewank on Automatic Differentiation
  • (PDF) More about Automatic Differentiation, Or mathemagically finding derivatives along iwth implementations in Rust and Python
• Precolation Theory
  • Percolation transition in dynamical traffic network with evolving critical bottlenecks
  • "the first study to consider geographically localized attacks from the perspective of percolation theory," Localized attacks on spatially embedded networks with dependencies
• Symbolic dynamics

  • In mathematics, symbolic dynamics is the practice of modeling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the dynamics (evolution) given by the shift operator.

• Kripke structure
  • used in Model checking
  • variation of Transition System (see next), that can be representated as a graph whose nodes represent the reachable states of the system and whose edges represent state transitions
• Transition system - differ from finite state automata in several ways:
  • The set of states is not necessarily finite, or even countable.
  • The set of transitions is not necessarily finite, or even countable.
  • No "start" state or "final" states are given.
• Reversible cellular automaton

  • in which every configuration has a unique predecessor... a regular grid of cells, each containing a state drawn from a finite set of states, with a rule for updating all cells simultaneously based on the states of their neighbors, such that the previous state of any cell before an update can be determined uniquely from the updated states of all the cells

  • (PDF) Friedemann Mattern, Virtual Time and Global States of Distributed Systems
  • "Event structures," "Time slices," "Virtual time," "Vector time," "Distributed debugging"
• Yoshua Wuyts, Managing State in Browser Applications
  • includes Vector Clock
  • vector clock implementation in JS
• (PDF) Frank P. Ramsey, 1926, Truth and probability
  • more about the impressive Frank Ramsey
• Oleksii Trekhleb, Dynamic Programming vs Divide-and-Conquer
  • see also, Dynamic programming, implemented by memoization or tabulation
• (PDF) Richard Bellman, selections on the birth of dynamic programming
  • define dynamic programming
  • mentioned by Peter Norvig with respect to Coders at Work, e.g., https://pindancing.blogspot.com/2009/09/sudoku-in-coders-at-work.html
  • Constraint Propagation
  • Recursive Search
  • "Curse of Dimensionality"
• Vaidehi Joshi, Trying to Understand Tries
• Decision Tables
  • ...and from Hillel Wayne, "For a decision table to be "consistent", all possible inputs must map to exactly one row."
• Uncle Bob on BDD Gherkin triplets as state transition specifiers
• Time Series
  • Wiener filter
  • Kalman filter
  • see also, from July 2016, Kalman filter in JS

Objects vs. Data

• Struct may be the "concept" after all, When do you use a struct instead of a class?
• Memory, Strings are evil
• Speed, Fibonacci Hashing: The Optimization that the World Forgot (or: a Better Alternative to Integer Modulo)
• How Alby implemented consistent hashing efficiently

HEX - SAM Pattern

• Jean Jacques Dubray, HEX, a no-framework approach
• Jean Jacques Dubray, 20 lines of Javascript that “hash” HTML
• Javascript implementation of Java’s String.hashCode() method
• Axel Rauschmeyer, Exploring JS: template literals
  • see the escapeHTML section