ULarn (Ultra-Larn) for Win32, built on Cygwin but runs natively
Ularn that runs on Windows 7!
Other Stuff
Miscellaneous
Aside from laptops and other mobile computing platforms, I am a long-time user of hand-held computing devices.
I’ve assembled a chronological list of the devices that were most used or useful to me.
Cooking a whole brisket is normally a 10 to 12 hour process for me, not including prep time, cooling time, nor the time it takes to cut it (brisket has to be cut properly, or it doesn’t turn out well). End to end, that works out to 14 to 15 hours.
I worked out a process for cooking a smoked, whole brisket in 4 hours (cook time), making the end-to-end time about 5.5 to 6 hours.
You might think that I sacrificed flavor or texture, but I didn’t!
Click to keep reading!
3/8/2015
We attended the North Texas Irish Festival, Whiskey tasting event.
Click here to read more…
I get asked about this all the time, so here are some instructions and tips
Abstract
This document outlines a method for encoding, storing, and transmitting a file to one or more recipients securely by creating multiple bit streams that essentially contain no viable content, but by which the recipient can re-construct the original content.
This is achieved by using a symmetric operation to decompose a “high value” byte sequence (such as a file containing confidential data) in to blocks of random bit strings, and using hash “label” values to retrieve known bit blocks in order to reconstruct the original high-value byte sequence, based on instructions and label values contained in a “blueprint” string sequence.
Technical Assertions:
- A symmetric bitwise operation, such as XOR or EQV can be used to split a high-value bit sequence in to two random sequences that can be recombined in to the original sequence
- A hash function can be used to generate hash “label” values for a given bit sequence, that can be used as an index for storing and retrieving a specific bit sequence.
- Salt Data can be used to generate multiple, unique hash values for the same bit sequence, and can be used to generate multiple, unique index functions.
- A blueprint string containing hash values and assembly instructions can be used to locate, download, transform, and assemble various blocks of random bit strings in order to reconstruct the original high-value bit sequence.
- Using overlapping hash indices, multiple equivalent blueprints can be constructed that represent the same original bit sequence. This allows mutation and randomization when sharing blueprints.
There has been more written on Telecommunications Etiquette than one could publish in a single volume, or even perhaps in ten.
This post is an attempt to frame out, at a high level, how to politely and professionally engage and communicate with someone electronically, and call out several major “DOs” and “DON’Ts”.
Continue Reading