IP address Updated 2025-07-16
The Internet Protocol by Ben Eater (2014)
Source. Riseup Updated 2025-07-16
Internal symmetry Updated 2025-07-16
Spacetime symmetry Updated 2025-07-16
LGM-30 Minuteman Updated 2025-07-16
Ah, the choice of name, both grim and slightly funny, Dr. Strangelove comes to mind quite strongly. Also Fallout (franchise).
- youtu.be/VTQ8yZSyrC0?t=75 map of missile silos
- youtu.be/VTQ8yZSyrC0?t=210 shows a map of the communication copper wires linking up a silo farm. Presumably Hardened Intersite Cable System
Bibliography:
Intel GPU Updated 2025-07-16
Intel Research Updated 2025-07-16
Integer factorization algorithm Updated 2025-07-16
Instrumental convergence Updated 2025-07-16
Rotate object around a point in Inkscape Updated 2025-11-05
Set SVG background color in Inkscape Updated 2025-11-05
This is related to the underlying SVG pain point of SVG background color:
Mathematical consistency of quantum field theory Updated 2025-07-16
Definition of the indefinite orthogonal group Updated 2025-07-16
Given a matrix with metric signature containing positive and negative entries, the indefinite orthogonal group is the set of all matrices that preserve the associated bilinear form, i.e.:Note that if , we just have the standard dot product, and that subcase corresponds to the following definition of the orthogonal group: Section "The orthogonal group is the group of all matrices that preserve the dot product".
As shown at all indefinite orthogonal groups of matrices of equal metric signature are isomorphic, due to the Sylvester's law of inertia, only the metric signature of matters. E.g., if we take two different matrices with the same metric signature such as:and:both produce isomorphic spaces. So it is customary to just always pick the matrix with only +1 and -1 as entries.
Indefinite special orthogonal group Updated 2025-07-16
Like the special orthogonal group is to the orthogonal group, is the subset of with determinant equal to exactly 1.
Iterative in-order Updated 2025-07-16
This is a bit harder than iterative pre-order: now we have to check if there is a left or right element or not:
- (START) push current
- if there is left:
- move left
- else:
- (ELSE) pop
- visit
- if there is right
- move right
- GOTO START
- else:
- GOTO ELSE
The control flow can be slightly simplified if we allow NULLs: www.geeksforgeeks.org/inorder-tree-traversal-without-recursion/
IBM 705 Updated 2025-07-16
Hyperbolic sine Updated 2025-07-16
Hyperbolic cossine Updated 2025-07-16
Kirchhoff's diffraction formula Updated 2025-07-16
WebGL Updated 2025-07-16
HTML snippet:
new class extends OurbigbookCanvasDemo {
init() {
super.init('webgl', {context_type: 'webgl'});
this.ctx.viewport(0, 0, this.ctx.drawingBufferWidth, this.ctx.drawingBufferHeight);
this.ctx.clearColor(0.0, 0.0, 0.0, 1.0);
this.vertexShaderSource = `
#version 100
precision highp float;
attribute float position;
void main() {
gl_Position = vec4(position, 0.0, 0.0, 1.0);
gl_PointSize = 64.0;
}
`;
this.fragmentShaderSource = `
#version 100
precision mediump float;
void main() {
gl_FragColor = vec4(0.18, 0.0, 0.34, 1.0);
}
`;
this.vertexShader = this.ctx.createShader(this.ctx.VERTEX_SHADER);
this.ctx.shaderSource(this.vertexShader, this.vertexShaderSource);
this.ctx.compileShader(this.vertexShader);
this.fragmentShader = this.ctx.createShader(this.ctx.FRAGMENT_SHADER);
this.ctx.shaderSource(this.fragmentShader, this.fragmentShaderSource);
this.ctx.compileShader(this.fragmentShader);
this.program = this.ctx.createProgram();
this.ctx.attachShader(this.program, this.vertexShader);
this.ctx.attachShader(this.program, this.fragmentShader);
this.ctx.linkProgram(this.program);
this.ctx.detachShader(this.program, this.vertexShader);
this.ctx.detachShader(this.program, this.fragmentShader);
this.ctx.deleteShader(this.vertexShader);
this.ctx.deleteShader(this.fragmentShader);
if (!this.ctx.getProgramParameter(this.program, this.ctx.LINK_STATUS)) {
console.log('error ' + this.ctx.getProgramInfoLog(this.program));
return;
}
this.ctx.enableVertexAttribArray(0);
var buffer = this.ctx.createBuffer();
this.ctx.bindBuffer(this.ctx.ARRAY_BUFFER, buffer);
this.ctx.vertexAttribPointer(0, 1, this.ctx.FLOAT, false, 0, 0);
this.ctx.useProgram(this.program);
}
draw() {
this.ctx.clear(this.ctx.COLOR_BUFFER_BIT);
this.ctx.bufferData(this.ctx.ARRAY_BUFFER, new Float32Array([Math.sin(this.time / 60.0)]), this.ctx.STATIC_DRAW);
this.ctx.drawArrays(this.ctx.POINTS, 0, 1);
}
} There are unlisted articles, also show them or only show them.