This is the order in which a binary search tree should be traversed for ordered output, i.e.:
- everything to the left is smaller than parent
- everything to the right is larger than parent
This ordering makes sense for binary trees and not k-ary trees in general because if there are more than two nodes it is not clear what the top node should go in the middle of.
This is unlike pre-order depth-first search and post-order depth-first search which generalize obviously to general trees.
Generalization of orthogonal group to preserve different bilinear forms. Important because the Lorentz group is .
The OS is usually virualized, and you get only a certain share of the CPU by default.
The ELF standard specifies multiple file formats:
- Object files (
.o
).Intermediate step to generating executables and other formats:Source code | | Compilation | v Object file | | Linking | v Executable
Object files exist to make compilation faster: withmake
, we only have to recompile the modified source files based on timestamps.We have to do the linking step every time, but it is much less expensive.
- Executable files (no standard Linux extension).This is what the Linux kernel can actually run.
- Archive files (
.a
).Libraries meant to be embedded into executables during the Linking step.
- Shared object files (
.so
).Libraries meant to be loaded when the executable starts running.
- Core dumps.Such files may be generated by the Linux kernel when the program does naughty things, e.g. segfault.They exist to help debugging the program.
In this tutorial, we consider only object and executable files.
If either PAE and PSE are active, different paging level schemes are used:
- no PAE and no PSE:
10 | 10 | 12
- no PAE and PSE:
10 | 22
.22 is the offset within the 4Mb page, since 22 bits address 4Mb. - PAE and no PSE:
2 | 9 | 9 | 12
The design reason why 9 is used twice instead of 10 is that now entries cannot fit anymore into 32 bits, which were all filled up by 20 address bits and 12 meaningful or reserved flag bits.The reason is that 20 bits are not enough anymore to represent the address of page tables: 24 bits are now needed because of the 4 extra wires added to the processor.Therefore, the designers decided to increase entry size to 64 bits, and to make them fit into a single page table it is necessary reduce the number of entries to 2^9 instead of 2^10.The starting 2 is a new Page level called Page Directory Pointer Table (PDPT), since it _points_ to page directories and fill in the 32 bit linear address. PDPTs are also 64 bits wide.cr3
now points to PDPTs which must be on the fist four 4GB of memory and aligned on 32 bit multiples for addressing efficiency. This means that nowcr3
has 27 significative bits instead of 20: 2^5 for the 32 multiples * 2^27 to complete the 2^32 of the first 4GB. - PAE and PSE:
2 | 9 | 21
Designers decided to keep a 9 bit wide field to make it fit into a single page.This leaves 23 bits. Leaving 2 for the PDPT to keep things uniform with the PAE case without PSE leaves 21 for offset, meaning that pages are 2M wide instead of 4M.
The main interface between the central processing unit and software.
Simple example:output:
printf '00,11,22\n33,44,55\n' | csvgrep -H -c2 -r '^11$' | tail -n+2
00,11,22
Tested as of Ubuntu 20.04, there is no Mongo package available by default due to their change to Server Side Public License, which Debian opposed. Therefore, you have to add their custom PPA as mentioned at: docs.mongodb.com/manual/tutorial/install-mongodb-on-ubuntu/
Tested on Ubuntu 20.04:and from then on we can do
mkdir -p ~/miniconda3
wget https://repo.anaconda.com/miniconda/Miniconda3-py311_23.11.0-2-Linux-x86_64.sh -O ~/miniconda3/miniconda.sh
bash ~/miniconda3/miniconda.sh -b -u -p ~/miniconda3
rm -rf ~/miniconda3/miniconda.sh
~/miniconda3/bin/conda init bash
. ~/.bashrc
conda
commands normally.At that time, the exact installer under
latest
appears to have been: repo.anaconda.com/miniconda/Miniconda3-py311_23.11.0-2-Linux-x86_64.sh- 1972
- Transa (1972) album. Literally: "The Fuck", good old seventies. Caetano himself later mentions that this is one of his own favorite albums.[ref] The album was composed when he was living in London.
- 1975 Qualquer coisa album
- 1976 Doces Bárbaros (1976) albumUm Índio by Caetano Veloso (1976)Source. Recording from 1992. Also appeared in the Bicho (1977) album.
- 1977 Bicho (1977)Tigresa by Caetano Veloso (1977)Source. Talks about a strong willed, unapologetic, disenchanted, but also hopeful brown skinned lover: a tigress. Ciro once knew one, but it wasn't meant to be.
- 1978 album Muito (Dentro da Estrela Azulada)Sampa by Caetano Veloso (1978)Source."Sampa" is an affectionate slang for São Paulo City. The song perfectly captures the city, and reminds Ciro so badly of his University days there.
[D]a força da grana que ergue e destroi coisas belas
The power of money that builds and destroy beautiful thingsTerra by Caetano Veloso (1978)Source."Terra" means Earth in Portuguese.Ciro used to watch a television nature show called "Planeta Terra" in the legendary TV Cultura with his parents in the couch when he was young, and under a duvet when it was a bit cold. Those days were the best. The narrator's lady voice was particularly soothing, and would easily put you in a kind of sleepy trance, her name is Valéria GrilloTODO what was the original show exactly? Here is a sample: www.youtube.com/watch?v=vNwfYEMdrRU Very likely just a translation of some British nature show with a custom Brazilian intro and presenter. Credits at end mention English narrator: "Eugene Fraser", and "Thirteen WNET Nature" production, which produced Nature (1982) that ran since 1982, making that a likely candidate. - 1980Menino do Rio by Caetano Veloso (1980)Source. Apparently served as inspiration for the Menino do Rio (1980) movie, which is silly, but a worthwhile record of the times.
- 1984 Velô (1984)O Quereres by Caetano Veloso (1984)Source. Notable quote from the chorus that is often in Ciro's mind:translation:
Ah, bruta flor, do querer
Oh, brute flower of the wanting
Holds strings for the symbol table.
This section has
sh_type == SHT_STRTAB
.It is pointed to by outputs:
sh_link == 5
of the .symtab
section.readelf -x .strtab hello_world.o
Hex dump of section '.strtab':
0x00000000 0068656c 6c6f5f77 6f726c64 2e61736d .hello_world.asm
0x00000010 0068656c 6c6f5f77 6f726c64 0068656c .hello_world.hel
0x00000020 6c6f5f77 6f726c64 5f6c656e 005f7374 lo_world_len._st
0x00000030 61727400 art.
This implies that it is an ELF level limitation that global variables cannot contain NUL characters.
Worst We've Tested: Broken Intel Arc GPU Drivers by Gamers Nexus (2022)
Source. Generalization of AlphaGo Zero that plays Go, Chess and shogi.
- www.science.org/doi/10.1126/science.aar6404 A general reinforcement learning algorithm that masters Chess, Shogi, and Go through self-play by Silver et al. (2018), published without source code
- www.quora.com/Is-there-an-Open-Source-version-of-AlphaZero-specifically-the-generic-game-learning-tool-distinct-from-AlphaGo
www.quora.com/Which-chess-engine-would-be-stronger-Alpha-Zero-or-Stockfish-12/answer/Felix-Zaslavskiy explains that it beat Stockfish 8. But then Stockfish was developed further and would start to beat it. We know this because although AlphaZero was closed source, they released the trained artificial neural network, so it was possible to replay AlphaZero at its particular stage of training.
There are unlisted articles, also show them or only show them.