callcentric Call Centric phone service and Ekiga For a record for those who might wish to find this, we use CallCentric as our phone service, which works remarkably well. However, I sometimes have trouble getting Ekiga to work with it. I have to remember each time that you may have to

release cycle Rapid Releases in Software Today's software culture, especially in the Open-source world, seems to be about quick, rapid releases of software, whether it is stable or not. That's something I have mixed feelings about. It is really nice to be able to see the

apl Fork-Join parallelism using Signals in APLX In preparation for some research work I'm doing in parallelism, I finally managed to get some comprehension of tasks and multi-programming in APLX. I came up with the following code, and I would appreciate any improvements or suggestions. It's fast

code Self-documenting Code There are a lot of people who follow the school of self-documenting code, some of whom I respect as some of the best programmers I have ever met. On the other hand, in my practice, I have found that self-documenting code doesn't

chez ChezWEB tangling ChezWEB For those of you who don't know, I have been working on the next major version of ChezWEB (2.0), which is a complete rewrite of the old system, preserving the good things about the old system, while dropping and removing things

geek XTerm Colors, DIE! So, I finally got fed up with trying to change all of the colors in all of my programs so that they didn't conflict with the careful imbalance of my eyeballs. Instead, I chose the background and foreground colors that I wanted

cde OpenCDE: A great new find Some of you may know that I greatly enjoy using the Motif toolkit, as a stable, reliable, and comprehensive solution for GUI programs. I've always wanted to have a desktop environment like CDE that used the Motif toolkit instead of being based

apl APL Hacking: Project Euler (#30) I figure it's about time I posted another Project Euler.Problem #30: ∇Z←PETHIRTY;M [1] ⍝ Find the sum of all the numbers that can be written as [2] ⍝ the sum of fifth powers of their decimal digits. [3] Z←+/1↓((⍳M)

tech Softmaker Office for Free! Hey! What do you know? I've been recommending Softmaker Office to Linux user's who are sick of using OpenOffice.org for a while now, and they finally offer a free version (one version behind the latest). If you have not

apl Revisiting Send + More = Money In my last post I attempted to solve the Send + More = Money Cryptarithmetic problem. I didn't quite understand how I could do this quickly using a better algorithm, so I tried to find a simple brute force solution. As it turns out,

apl Send + More = Money After talking with Prof. Friedman, he gave me an interesting constraint problem. This is a well known example of a problem well suited to constrain based techniques. The goal is to figure out what number to assign to each letter to make the equation

apl APL Hacking: Project Euler (#29) Problem #29:∇Z←PETWENTYNINE;⎕IO ⎕IO←1 ⍝ Compute the cardinality of the set ⍝ {a*b | 2≤a≤100 ^ 2≤b≤100} ⍝ Easy to do by computing the sequence, ⍝ ordering it, and then removing duplicates. Z←⍴(-1⌽1↓(Z≠-1⌽Z),1)/Z←Z[⍋Z←

apl APL Hacking: Project Euler (#28) Problem #28:Z←PETWENTYEIGHT ⍝ Sum of the diagonals of a 1001 by 1001 spiral Z←+/+1,4/2×⍳500 This one is too easy to talk about. Basically, we can realize the nature of the spiral and the diagonals is easy to think about

apl APL Hacking; Project Euler (#27) Problem #27:∇Z←PETWENTYSEVEN;A;B;X;P ⍝ Find the product of the coefficients A and B ⍝ that have the longest consecutive n values from 0 ⍝ for the quadratic formula. ⍝ P is the prime table used by CONS∆PRMS. ⍝ Seed it with the primes

apl APL Hacking: Project Euler (#26) Problem #26:∇Z←CYCLE∆LENGTH N;A;I;R ⍝ Find the length of the cycle of 1÷N. Z←0 ⋄ I←0 ⋄ A←N⍴0 ⋄ R←1 LP:I←I+1 ⋄ Z←I-A[R] ⋄ →(0≠A[R])/0 A[R]←I ⋄ R←N|R×

chez ANN: ChezWEB 1.3.0 I am pleased to announce the release of ChezWEB 1.3.0.The major changes here are the introduction of a new form to evaluate code for side effects during weaving, and finally, a solution to the ellipses annoyance in previous versions when defining

apl APL Hacking: Project Euler (#25) Problem #25:∇R←PETWENTYFIVE;I;A;X;⎕IO;B;D ⎕IO←1 ⍝ What is the first fibonnacci term to contain 1,000 digits? D←1000000000 ⍝ Use nine-digit numbers. A←B←X←¯112↑1 ⍝ Need 112 9-digit numbers to get 1,000 digits. I←2

apl APL Hacking: Project Euler (#24) Problem #24:∇R←PETWENTYFOUR;N;A;I ⍝ Compute the 1,000,000th Lexicographic Permutation of ⍝ 0 through 9. N←10 →(N≥3 2 1)/C3,C2,C1 R←1 0⍴0 ⋄ →0 C1:R←1 1⍴⎕IO ⋄ →0 C2:R←2 2⍴⎕IO+0

apl APL Hacking: Project Euler (#23) Problem #23:∇R←PETWENTYTHREE;ABDP;N;X ⍝ Find the sum of all the positive integers ⍝ which cannot be written as the sum ⍝ of two abundant numbers. ⊣⎕FX 'R←ABDP N' 'R←N<+/(0=(⍳N-1)|N)/⍳N-1' R←+/(~N∊X∘.+X←(ABDP¨N)/N)

apl APL Hacking: Project Euler (#22) Problem 22:∇R←PETWENTYTWO NAMES;X ⍝ Receiving a 1×N matrix of name vectors, ⍝ sort the names alphabetically, and then compute the ⍝ total of their numeric counts times their sorted ⍝ positions. R←+/(⍳↑⍴X)×+/X×~((⍴X)⍴27)=X←⎕AV[97+⍳26]⍳X[⍋X;]⊣X←⊃NAMES[

bx pro Building GUI Applications in Scheme (Part 2) In this second half of my little two-part series, I spend plenty of time detailing and going through the actual action of programming the GUI functionality into the GUI that we designed in the previous section. Until now, we have not written any code,

bx pro Building GUI Applications in Scheme (Part 1) This is the first of a multi-part series on how to integrate Scheme (a high-level language) with a GUI Builder (BX Pro 6.2, Motif) to build sophisticated or at least, effective GUIs quickly, without having to have some meta-language of GUIs. This is

apl.euler APL Hacking: Project Euler (#20) I was avoiding this one for a while simply because I wanted to have a better carry algorithm in mind. On the other hand, it does not seem to matter if I have a bad carry algorithm, because the program runs fairly quickly regardless.

apl APL Hacking: Project Euler (#19) I didn't really have a good idea of how to solve this one until I started playing around with some things on the APL session. Actually, what do you call the APL REPL, anyways?At any rate, it turned out to be

monotone Monotone 1.0 Released! Just a quick yippee :hat: post. Monotone 1.0 has been released. I have not built it yet, but most of the changes look to be pretty good. Grab it while its hot!http://www.monotone.ca