Adam Yi adamyi

## gist:e22e50cd52b7dffcf5a4db2b8ea4cce0

      
              1 file
            
          
              6 forks
            
          
              18 comments
            
          
              29 stars
            
          
                simonster
                / gist:e22e50cd52b7dffcf5a4db2b8ea4cce0
            
            
              Created
              April 19, 2017 20:21
            
              
                Next Generation MITnet
              
          
    To the members of the MIT community:
We are writing to inform you of plans to upgrade the MIT campus network, and in particular to upgrade MIT to the next generation of Internet addressing. (Please note that no action is required on your part.)
Machines on the Internet are identified by addresses. The current addressing scheme, called IPv4, was specified around 1980, and allowed for about 4 billion addresses. That seemed enough at the time, which was before local area networks, personal computers and the like, but the Internet research community recognized around 1990 that this supply of addresses was inadequate, and put in place a plan to replace the IPv4 addresses with a new address format, called IPv6. IPv6 uses a 128-bit address scheme and is capable of 340 undecillion addresses (340 times 10^36, or 340 trillion trillion trillion possible IP addresses). This stock of addresses allows great flexibility in how addresses are assigned to hosts, for example allowing every host to use a range of addresses to

  
## helloevolve.py
"""
helloevolve.py implements a genetic algorithm that starts with a base
population of randomly generated strings, iterates over a certain number of
generations while implementing 'natural selection', and prints out the most fit
string.

The parameters of the simulation can be changed by modifying one of the many
global variables. To change the "most fit" string, modify OPTIMAL. POP_SIZE
controls the size of each generation, and GENERATIONS is the amount of
generations that the simulation will loop through before returning the fittest

## ARMDebianUbuntu.md

      
              1 file
            
          
              7 forks
            
          
              0 comments
            
          
              14 stars
            
          
                bruce30262
                / ARMDebianUbuntu.md
            
            
              Last active
              June 12, 2023 11:43
                — forked from Liryna/ARMDebianUbuntu.md
            
              
                Emulating ARM on Debian/Ubuntu
              
          
    You might want to read this to get an introduction to armel vs armhf.
If the below is too much, you can try Ubuntu-ARMv7-Qemu but note it contains non-free blobs.
Running ARM programs under linux (without starting QEMU VM!)

First, cross-compile user programs with GCC-ARM toolchain. Then install qemu-arm-static so that you can run ARM executables directly on linux
If there's no qemu-arm-static in the package list, install qemu-user-static instead
	"""
	helloevolve.py implements a genetic algorithm that starts with a base
	population of randomly generated strings, iterates over a certain number of
	generations while implementing 'natural selection', and prints out the most fit
	string.

	The parameters of the simulation can be changed by modifying one of the many
	global variables. To change the "most fit" string, modify OPTIMAL. POP_SIZE
	controls the size of each generation, and GENERATIONS is the amount of
	generations that the simulation will loop through before returning the fittest