The mathematical concept of a "scheme" seems to pop up everywhere, but it's hard to get a good grasp on what a scheme actually is. Any time you might ask someone what a scheme is in passing, there never seems to be enough time to explain it. On the other hand, if someone finds the time to internaliz
In analyzing my data I wanted to classify it with a naive Bayesian classifier. I wasn't sure I had the math right, so I wrote a tiny abstract classifier to test with. The code is pretty cool:
A pyramid scheme is a non-sustainable business model that involves the exchange of money primarily for enrolling other people into the scheme, often without any product or service being delivered. Pyramid schemes are a form of fraud.
Well, first, getting a new URI scheme to be handled by Firefox is equivalent as getting it handled for Gnome, since for some reason, Firefox uses the generic gnome-open command to handled unknown URI schemes. I haven’t been able to find how or why, so I don’t know if that’s Debian specific or if this is true for any Firefox running on Linux et al.
In learning to write Scheme macros, I have noticed that it is easy to find both trivial examples and extraordinarily complex examples, but there seem to be no intermediate ones. I have discovered a few tricks in writing macros and perhaps some people will find them helpful.
Staapl is a collection of abstractions for metaprogramming microcontrollers from within PLT Scheme. The core of the system is a programmable code generator structured around a functional concatenative macro language adapted to a 2-stack machine model. On top of this it includes a syntax frontend for creating Forth style languages, a backend code generator for the Microchip PIC18 microcontroller architecture, and interaction tools for shortening the edit-compile-run cycle. It is structured as a code library to facilitate integration into larger systems employing a model-based design approach. The primary, practical goal is to provide a tool chain for programming low-end (8-bit) microcontrollers in a Forth-style language extended with powerful metaprogramming facilities. The secondary goal is to generalize and modularize this approach and extend it in two directions: to provide a standard machine model as an abstraction point for a large class of small embedded processo