There ain't nothing worse than a double negative

## Saturday, 23 September 2017

## Friday, 24 February 2017

### Synthetic Phonics Audio Resources

Chilli recently volunteered to help adults learn and improve their English reading and writing skills. This meant having to teach

Looking at the various free resources available on the web, it quickly became apparent that there wasn't a single page where you could easily listen to the forty-two phonic sounds using a nice clean interface. The BBC has an excellent interactive phonics tool, but it relies on Adobe Flash which makes it unsuitable for some devices.

Fortunately, the good folks at Jolly Learning Ltd have made available audio files that I've wrapped in a minimum of HTML5 for use on most devices (including iPads).

The forty-two sounds are divided into their seven groups and can be played with either a British or American accent: here.

*herself*about synthetic phonics.Looking at the various free resources available on the web, it quickly became apparent that there wasn't a single page where you could easily listen to the forty-two phonic sounds using a nice clean interface. The BBC has an excellent interactive phonics tool, but it relies on Adobe Flash which makes it unsuitable for some devices.

Fortunately, the good folks at Jolly Learning Ltd have made available audio files that I've wrapped in a minimum of HTML5 for use on most devices (including iPads).

The forty-two sounds are divided into their seven groups and can be played with either a British or American accent: here.

## Wednesday, 22 February 2017

### Three More Letterboxd Lists

After completing my Monsters of the Movies list, I decided to curate three more lists on letterboxd.

"theyshootpictures.com Top 50 Horror Movies (2016)" is fairly self-explanatory, providing that you realise that they're horror movies from the 2016 TSPDT list, not just movies released in 2016! So far, I've seen forty of them.

"99 Years, 99 Movies" has one film from each year 1901 to 1999 inclusive. Mostly, they're critically-acclaimed movies, but for the sparse years at the beginning of the century, I selected films that are popular on letterboxd. I've currently only seen 39 of the 99.

Finally, "Twentieth Century Movies by Duration" is a quirky list of 100 films ordered by duration in minutes from 61 minutes to 160 minutes (as reported by letterboxd). Again, it includes classic movies with some oddballs to fill the gaps. I've seen 68 of them.

Needless to say, I'm going to be ploughing through these lists over the next few months, desperately trying to improve my "scores".

"theyshootpictures.com Top 50 Horror Movies (2016)" is fairly self-explanatory, providing that you realise that they're horror movies from the 2016 TSPDT list, not just movies released in 2016! So far, I've seen forty of them.

"99 Years, 99 Movies" has one film from each year 1901 to 1999 inclusive. Mostly, they're critically-acclaimed movies, but for the sparse years at the beginning of the century, I selected films that are popular on letterboxd. I've currently only seen 39 of the 99.

Finally, "Twentieth Century Movies by Duration" is a quirky list of 100 films ordered by duration in minutes from 61 minutes to 160 minutes (as reported by letterboxd). Again, it includes classic movies with some oddballs to fill the gaps. I've seen 68 of them.

Needless to say, I'm going to be ploughing through these lists over the next few months, desperately trying to improve my "scores".

**STOP PRESS**: TSPDT has released their 2017 list, but I don't believe any of the lists above will have changed as a result.### Computus 4

I noticed a few days ago that Dr J R Stockton's web pages on Computus are now longer available. The last impression of the site in the Wayback Machine was 2015-09-07. In it he lists a number of JavaScript algorithms for the calculation of the date of Easter Sunday in the Gregorian calendar. The result of the following functions are "the day of March" such that 1 indicates March 1st, 32 indicates April 1st, etc.

The first version is my own humble attempt (here translated to C/C++):

int EasterDayOfMarch(int year) {

// 25 ops = 2 div, 3 rem, 2 mul, 5 shift, 8 add, 5 sub

int a = year % 19;

This is derived from Gauss's algorithm and subsequent revisions. However, the calculation of 'g' is my own work and chosen such that it can be computed on a 16-bit machine efficiently (though it works for all integer sizes).

There are other minor variations outlined on Dr Stockton's page:

// Lichtenberg

int g = 28 + f - ((f + a / 11) / 29);

and

// Hutchins

int g = 28 + f - ((a + f * 11) / 319);

There is also a C implementation which is the equivalent of:

// Pemberton

int g = 28 + f - (int)((f + g + (int)(a > 10)) > 28);

As mentioned previously, Al Petrofsky came up with another variation on the theme:

int EasterDayOfMarchPetrofsky(int year) {

// 21 ops = 4 div, 3 rem, 4 mul, 1 shift, 6 add, 3 sub

int a = (year % 19) * 6060;

int b = year >> 2;

int c = b / 25;

int p = (c * 2267) - ((b / 100) * 6775) + 3411;

int q = ((a + ((p / 25) * 319) - 1) % 9570) / 330;

int r = 28 + q - (year + b + p + q) % 7;

return r;

}

This cleverly uses fewer operations, though requires integer sizes greater than sixteen bits for larger years (not a great imposition, these days!)

The first version is my own humble attempt (here translated to C/C++):

int EasterDayOfMarch(int year) {

// 25 ops = 2 div, 3 rem, 2 mul, 5 shift, 8 add, 5 sub

int a = year % 19;

int b = year >> 2;

int c = (b / 25) + 1;

int d = (c * 3) >> 2;

int e = ((c << 3) + 5) / 25;

int f = (a * 19 + d - e + 15) % 30;

int g = f + ((29578 - a - (f << 5)) >> 10);

int h = g - ((year + b - d + g + 2) % 7);

return h;

}

}

This is derived from Gauss's algorithm and subsequent revisions. However, the calculation of 'g' is my own work and chosen such that it can be computed on a 16-bit machine efficiently (though it works for all integer sizes).

There are other minor variations outlined on Dr Stockton's page:

// Lichtenberg

int g = 28 + f - ((f + a / 11) / 29);

and

// Hutchins

int g = 28 + f - ((a + f * 11) / 319);

There is also a C implementation which is the equivalent of:

// Pemberton

int g = 28 + f - (int)((f + g + (int)(a > 10)) > 28);

As mentioned previously, Al Petrofsky came up with another variation on the theme:

int EasterDayOfMarchPetrofsky(int year) {

// 21 ops = 4 div, 3 rem, 4 mul, 1 shift, 6 add, 3 sub

int a = (year % 19) * 6060;

int b = year >> 2;

int c = b / 25;

int p = (c * 2267) - ((b / 100) * 6775) + 3411;

int q = ((a + ((p / 25) * 319) - 1) % 9570) / 330;

int r = 28 + q - (year + b + p + q) % 7;

return r;

}

This cleverly uses fewer operations, though requires integer sizes greater than sixteen bits for larger years (not a great imposition, these days!)

To convert a "day of March" 'h' to an actual date, the following code can be used:

void Easter(int year, int* month, int* day) {

int a = year % 19;

int b = year >> 2;

int c = (b / 25) + 1;

int d = (c * 3) >> 2;

int e = ((c << 3) + 5) / 25;

int f = (a * 19 + d - e + 15) % 30;

int g = f + ((29578 - a - (f << 5)) >> 10);

int h = g - ((year + b - d + g + 2) % 7);

int i = h >> 5; // is it April?

*month = i + 3;

*day = (h & 31) + i;

}

void Easter(int year, int* month, int* day) {

int a = year % 19;

int b = year >> 2;

int c = (b / 25) + 1;

int d = (c * 3) >> 2;

int e = ((c << 3) + 5) / 25;

int f = (a * 19 + d - e + 15) % 30;

int g = f + ((29578 - a - (f << 5)) >> 10);

int h = g - ((year + b - d + g + 2) % 7);

int i = h >> 5; // is it April?

*month = i + 3;

*day = (h & 31) + i;

}

Subscribe to:
Posts (Atom)