• 3 Posts
  • 244 Comments
Joined 3 years ago
cake
Cake day: August 22nd, 2023

help-circle





  • Debian votes using the Schulze Method, which is a Condorcet method..

    Condorcet methods attempt to answer the question “who would win if we asked everyone to vote on every pair of candidates”. Most of the variations between methods deal vary only where there are cyclic preferences e.g. people vote B over A, A over C and C over B.

    They’re broadly considered the fairest voting systems available and they permit a candidate that everyone thinks is okay to win over polarising candidates (unlike first past the post and IRV, but like approval voting).

    Back to the numbers, the big table is the reconstruction of the pairwise votes (people actually vote by ranking candidates but the ordering is taken to show your pairwise preferences)

    Below that is the Schulze process steps being carried out. At the bottom the “Schwartz set” is the set of top, cyclic candidates. There is no cycle so there is only one candidate remaining and therefore a Condorcet candidate wins (the one people in general vote over everyone else).


  • The important bit is further down

    Our Phillips tips follow the ISO 8764-1 standard, which is compatible with the JIS standard B 4633. In fact, of the three main standards, ASME, ISO, and JIS, the least strict standard is JIS. As shown below, the JIS dimensions almost all fall within the ASME or ISO acceptable dimensions. Therefore, any Phillips screwdriver, such as our new Tekton Phillips screwdrivers, can be made to meet JIS standards. In fact, you should expect that all well-made drivers that meet the ASME or ISO standards will also meet the JIS standard.

    But yes, this doesn’t make clear if this has changed over time.




  • If it helps there’s a standalone version of the logic.

    At a rough scan, it looks like it tries to find a best guess “main content” node by stripping unlikely nodes and then scoring each node. Element type and content contribute to the score

    /**
           * Loop through all paragraphs, and assign a score to them based on how content-y they look.
           * Then add their score to their parent node.
           *
           * A score is determined by things like number of commas, class names, etc. Maybe eventually link density.
           **/
    






  • People with computer science degrees often work as software engineers but Computer Scientists are not Software Engineers. Computer Scientists are mathematicians. Theoretically you can do pretty good computer science without ever touching a computer - it’s the mathematics of computation, which is much broader than the machines we keep on our desks. Software Engineers are not typically mathematicians.

    I say this as someone who is qualified as a software engineer. I would absolutely love to be involved in computer science, but I’m trained for engineering not mathematics.