Fruitbox

It’s out, in a lot of places! Google it.
Voice selection is in, but ’save to mp3′ is still missing. Hopefully it’ll be there in the next release.

It’s out! Where? Head over to CodePlex!
http://www.codeplex.com/clipspeak

It’s out, ClipSpeak 0.9!
Head over to CodePlex to check it out: http://www.codeplex.com/clipspeak.

Just a little post noting that the visitor counter turned 4000 today!

ClipSpeak is a lightweight text-to-speech tool that speaks text you copy to the clipboard. It’s small, and tries not to be in the way, keeping user interfaces and interaction to a minimum. I intend this to be a quick and easy tool to use when you need something read aloud.
Right now it just sits in the system tray’s icon area, reading whatever you copy to the clipboard with the currently selected SAPI5 synthesizer in the control panel’s speech dialogue.

I intend to have the first release up on CodePlex within the next month.

ClipSpeak at CodePlex

Flimag hasn’t had much progress since my last post. I’ve been poking around at this thing and that and thought about things now and then. This project is quite difficult, and requires much time, so I’ve decided to work on something else for awhile. Check out the post above!

So I’ve been looking at this thing and that, trying to figure out what to use for Flimag, and I found out that Windows Vista finally has a compositing window manager, Desktop Window Manager. With composition, windows are drawn separately into buffers, and this sounds like it could be very useful for a screen magnifier. I believe many of the Linux magnifiers use this methodology.

Here is a great Turing machine simulator (Java applet):
Turing Machine Simulator. You can load predefined programs, including busy beavers, or why not create your own program?

A Screen Magnifier Using “High Level” Implementation Techniques.
This is yet another great paper, not relying on DirectX overlays!

I just wanted to post that I’ve now gotten a page at The Mod Archive, modarchive.com. Check it out: here!

In Prolog, it is very easy to make a predicate that tests whether a string/list of given length is a palindrome, and thus, since we’re talking Prolog, this predicate can be used to generate all palindromes of a given length!
I wrote this in SWI-Prolog, and it depends on the lists library.
Call pal(Alphabet, Length, L), where A is a list of allowed symbols (the alphabet being the most obvious one), Length is the length of the palindrome and L is a palindrome fulfilling the constraints.
The idea is the following: For L to be a correct palindrome, we first check that L has length S, then we say that each element (letter) has to belong to the alphabet A, and finally we state the fact that reversing L will yield L itself, simple enough.

:- use_module(library(lists)).

pal(A, S, L) :-
    length(L, S),
    maplist(mymember(A), L),
    reverse(L, L).

mymember(A, E) :- member(E, A).

The predicate mymember is used so that maplist works the way it should.

The Keybuoy!
If you drop your keys in the water, they’ll float right back at you, this is the Keybuoy! (did I spell that right).

I laughed so much while listening to this:
Daily Giz Wiz 149: Keybuoy

So you want more visitors to your website, homepage, weblog, blog, blogsite, webpage, bloghomesitepage, whatever?
I got an answer to the question: Write about how to increase website traffic!

What a wonderful recursion.

Here’s a very interesting paper:
Full-screen magnification for Windows using DirectX overlays [PDF]
This is exactly what I’m after, so now I’m trying to decide which tools to use. Managed DirectX, SlimDX, OpenGL, …?