micycle1

def modified_duration(y, m):
    """
    Approximates the modified duration of a risk-free bond at par value.

    :param y: Yield-to-maturity in decimal terms
    :param m: Maturity in years
    :return: Modified duration of a risk-free bond
    """
    return (1-(1/(1+0.5*y)**(2*m)))/(y)

micycle1

def print_first_non_null_dates(df):
    non_null_dates = {}
    
    for column in df.columns:
        non_null_values = df[column].dropna()
        if not non_null_values.empty:
            first_non_null_date = non_null_values.index[0]
            non_null_dates[column] = first_non_null_date

    sorted_dates = sorted(non_null_dates.items(), key=lambda x: x[1])

micycle1

• Search for album on Apple Music.

• Open album art image in new tab.

Example (which gives 12KB image):

https://is5-ssl.mzstatic.com/image/thumb/Music113/v4/e5/f2/6c/e5f26c29-2ab0-372b-0997-e76a2f6ce876/190295292126.jpg/316x316bb.webp

We can play around with the last few parameters to get much better resolution and quality (and change file format).

micycle1

	/**
	 * Computes a pair of magic numbers used to optimise integer division by a fixed
	 * divisor <code>d</code>.
	 * <p>
	 * The function is given the maximum value of the dividend <code>nmax</code> and
	 * the divisor <code>d</code>. It returns a pair of integers: the magic number
	 * <code>m</code> and a shift amount <code>p</code>.
	 * <p>
	 * To divide a dividend x by d, one multiplies x by m and then shifts the (full
	 * length) product right p bits: <code>x / d === ((x * m) >> p)</code>.

micycle1

public class T2Q extends java.applet.Applet {
	
	public static void main(String[] args) {
		T2Q applet = new T2Q();
		applet.init();
		applet.start();

		// Create a window (JFrame) and make applet the content pane.
		javax.swing.JFrame window = new javax.swing.JFrame("T2Q");
		window.setContentPane(applet);

micycle1

import org.locationtech.jts.geom.Coordinate;

import java.util.ArrayList;
import java.util.List;

/**
 * Implementation of linear minimum area enclosing triangle algorithm.
 * Computational and Applied Mathematics, 35(2), 423–438.
 * doi:10.1007/s40314-014-0198-8
 * 

micycle1

package com.badlogic.gdx;

/**
 * A simple implementation of the ear cutting algorithm to triangulate simple
 * polygons without holes. For more information:
 * <ul>
 * <li><a href=
 * "http://cgm.cs.mcgill.ca/~godfried/teaching/cg-projects/97/Ian/algorithm2.html">http://cgm.cs.mcgill.ca/~godfried/
 * teaching/cg-projects/97/Ian/algorithm2.html</a></li>
 * <li><a href=

micycle1

http://momentsingraphics.de/CubicRoots.html#_Blinn06a

Returns the three real roots of the cubic polynomial (of form 1 + 2x + 3x^2 + 4x^3)

float3 SolveCubic(float4 Coefficient){
    // Normalize the polynomial
    Coefficient.xyz/=Coefficient.w;
    // Divide middle coefficients by three
    Coefficient.yz/=3.0f;
    // Compute the Hessian and the discrimant

micycle1

static PGraphics cloneGraphics(PGraphics source) {

		final String renderer;
		switch (source.parent.sketchRenderer()) {
		case "processing.opengl.PGraphics2D":
			renderer = P2D;
			break;
		case "processing.opengl.PGraphics3D":
			renderer = P3D;
			break;

micycle1

http://stereopsis.com/2div.html

Ben and 2 Divides
Two years ago, Ben Weiss (the guy who wrote Kai's Power Tools, Goo, Soap, etc.) was telling me about this idea he had to combine two divides. I just didn't pay attention.
Luckily, he told me again.

Ben's idea is really simple, and I use it everywhere now.

2 divides at once
Suppose you want to compute: