Explore projects

Provided files for the 1920 Pintos lab exercise

This project contains a daemon (command-listener) which runs a specific hard wired command with additional arguments passed to it from a client passing the stdout of that command back to the client, and a suitable command-client to send it.

This project contains a daemon (command-listener) which runs a specific hard wired command with additional arguments passed to it from a client passing the stdout of that command back to the client, and a suitable command-client to send it.

Provided files for the 1920 Pintos lab exercise

Provided files for the 1920 Pintos lab exercise

This is a fork of the kstart provided by Russ Allbery at http://www.eyrie.org/~eagle/software/kstart/ with minor tweaks to enable the static compilation for HTCondor using condor_compile and the static Heimdal Kerberos 5 libs.

Provided files for the 1920 Pintos lab exercise

On the tradeoffs between explainability and robustness in deep neural networks

Provided files for the 1920 Pintos lab exercise

Implements the long awaited client-side of datadec: given datadec types like "expr = num(int n) or ...", let us write:

%when expr e is num(n) { return n; }

In LinkedIn's Plain Old C Programming group in , John Coloccia asked about whether "namespaces" would be a good idea for C. He explained that he meant some form of modularity, and I thought I've have a play - this is the result! A module generator!

An attempt to graft some form of C++-style namespaces into C ("C with namespaces: aka C+N") via another simple-minded pre-processor/translator that could be built in a matter of hours.

Backend of a shopping list example: a RESTful API, written as a Perl CGI script, reimplementing jhc02's Django-based RESTful API. Wanted to see what it's like without N levels of Clarkian magic getting in the way.

Tristan's "Do Not Shoot The Snowman" game, done in Perl/Tk (graphicalsnowman) and ANSI colour codes and Unicode..

Pancake numbers are an obscure number theory sequence, defined as:

pancake(n) = smallest number of "pancake stack flips" to get the worst case stack-of-n-pancakes sorted. p(1)=0; p(2)=1 [casse ba], p(3)=3]; p(18) unknown

A cutdown version of part2 of my mailing list flattening C example, a specialised form of the general "computing transitive closures of a directed graph" method