Ciro Santilli @cirosantilli  40

Circa 2023, the feed is an unbearable list of stupid suggestions, never-ending idiotic memes, and you just end up missing posts you actually care about from people you actually follow.

www.komando.com/social-media/facebook-customized-feeds/847500/
www.quora.com/How-do-I-limit-my-news-feed-to-friends-only-on-Facebook
www.youtube.com/watch?v=SIA8VydqiNQ OK they split their feed into multiple feeds. However on page follows www.facebook.com/?filter=pages&sk=h_chr you very quickly reach:
You're all caught up on Most Recent posts Check back later for more updates
the history doesn't go back even a few days as of November 2023! And the favorites feed www.facebook.com/?filter=favorites&sk=h_chr is more explicit on their ridiculous timing:
You're up to date on posts from the last 3 days
OMG!

 Read the full article

Gaussian function Updated 2025-07-16

 Read the full article

Elon Musk's family Updated 2025-08-08

 Read the full article

Delft University of Technology Updated 2025-07-16

 Read the full article

Whole-genome sequencing Updated 2025-07-16

 Read the full article

DNA sequencing milestone Updated 2025-07-16

 View more

Most of these are going to be Whole-genome sequencing of some model organism:

1975 by Sanger et al.: 5 kbp of the single-stranded bacteriophage ΦX174 using Sanger's radiolabelling method
1981 by Sanger et al.: 17 kbp of human mitochondrial DNA via Sanger method, known as the Cambridge Reference Sequence
2003: Human Genome Project (3 Gbp)

en.wikipedia.org/wiki/Whole_genome_sequencing#History lists them all. Basically th big "firsts" all happened in the 1990s and early 2000s.

 Read the full article

Ciro's call hierarchy notation Updated 2025-07-16

 View more

This is a simple hierarchical plaintext notation Ciro Santilli created to explain programs to himself.

It is usuall created by doing searches in an IDE, and then manually selecting the information of interest.

It attempts to capture intuitive information not only of the call graph itself, including callbacks, but of when things get called or not, by the addition of some context code.

For example, consider the following pseudocode:

f1() {
}

f2(i) {
  if (i > 5) {
    f1()
  }
}

f3() {
  f1()
  f2_2()
}

f2_2() {
  for (i = 0; i < 10; i++) {

    f2(i)
  }
}

main() {
  f2_2()
  f3()
}

Supose that we are interested in determining what calls f1.

Then a reasonable call hierarchy for f1 would be:

f2(i)
  if (i > 5) {
    f1()

  f2_2()
    for (i = 0; i < 10; i++) {
      f2(i)

    main
    f3
f3()
  main()

Some general principles:

start with a regular call tree
to include context:
- remove any blank lines from the snippet of interest
- add it indented below the function
- and then follow it up with a blank line
- and then finally add any callers at the same indentation level

 Read the full article

Stored procedure Updated 2025-07-16

 Read the full article

 There are unlisted articles, also show them or only show them.