Weblog


Weblog

Brute Force Searchengine in PHP

14.05.2003, 17:04 · Martin · Permalink

view the code to the searchengine on the right. Less than 80 lines of code but works ok.

Google-style Web rankings up to five times faster

14.05.2003, 16:21 · Martin · Permalink

The mentioned publications can be found here: Stanford Database Group Publication Server

via lcom

Cognitive Walkthrough for the Web

14.05.2003, 13:00 · Martin · Permalink

This paper proposes a transformation of the Cognitive Walkthrough (CW), a theory-based usability inspection method that has proven useful in designing applications that support use by exploration. The new Cognitive Walkthrough for the Web (CWW) is superior for evaluating how well websites support users' navigation and information search tasks. The CWW uses Latent Semantic Analysis to objectively estimate the degree of semantic similarity (information scent) between representative user goal statements (100-200 words) and heading/link texts on each web page. Using an actual website, the paper shows how the CWW identifies three types of problems in web page designs. Three experiments test CWW predictions of users' success rates in accomplishing goals, verifying the value of CWW for identifying these usability problems.

PDF 8 pages, 161KB

there's a demo: Cognitive Walkthrough for the Web -- encarta.msn trial

How long 'till they betray me?

14.05.2003, 11:26 · Martin · Permalink

As I have been assosciated with the name 'Jesus' before, and as it is common knowledge that the one fron Nazereth was betrayed at age 33... Luckily I don't know anybody by the name of 'Judas' personally ;)

YOU can still be the first

14.05.2003, 11:22 · Martin · Permalink

to put forward your electronical well wishes to my b-day (my family and my collegues beat you all to being up and personal).

Or, you could actually be the first to give me a present ;)
(Well, that's not quite fair to the people mentioned above, as we are having a party tonight and I guess the are all saving their gifts for then)

And the winner is: Pepino, Danke!
Now let's see who's second?

finally, 33

14.05.2003, 09:25 · Martin · Permalink

anyway I look at my age this year from today on it stays the same. No more turning around numbers to be younger...

no one follows links in a newsreader?

13.05.2003, 22:30 · Martin · Permalink

not true here. But I don't click on the link in the NR, I copy it and open it in a browser of choice... So you'd be seeing the referer as a 'direct hit'... (oh, but by copying the URL I also copied the ?rss, so anybody coming from here would seems to be coming from a newsreader...)

Der Jesus der deutschen Weblogszene

11.05.2003, 09:43 · Martin · Permalink

ist heute 50 geworden! Na dann mal einen harzigen Glühstrumpf auf die nächsten 150 oder so!

EditThisPage button....

10.05.2003, 18:13 · Martin · Permalink

I'm not sure why Dave thinks the 'Edit this Page' button in Manila was such a big deal in '99. It wasn't very innovative even then. Wikis had the 'edit' link long before...
The real deal was bringing the 'edit' link into a mainstream(???) CMS.
And I honestly think if MT useres wanted an edit-button on their pages, they'd have one...

MoveableType and Graphics::Magick

10.05.2003, 17:06 · Martin · Permalink

just a quick heads-up for people strugeling with Image::Magick install problems like me (on SuSE 7.2): I successfully installed Graphics::Magick, and got MT to properly use it!

noch 4 dann ist er 33

10.05.2003, 09:40 · Martin · Permalink

advance warning. In just four days your humble host will turn 33. I survived turning thirty, so I guess there's no threat to my well being this year either.

Traumwind - Compression Analysis

10.05.2003, 00:52 · Martin · Permalink

similar entries at it again...
Compression Analysis is a technique that can identify certain characteristics about text, without actually requiring a human to read the text. It uses ordinary file compression programs such as gzip, winzip, or arc

TextCat Language Guesser

10.05.2003, 00:02 · Martin · Permalink

TextCat is an implementation of the text categorization algorithm presented in Cavnar, W. B. and J. M. Trenkle, ``N-Gram-Based Text Categorization'' In Proceedings of Third Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, NV, UNLV Publications/Reprographics, pp. 161-175, 11-13 April 1994.

via Idle words

Another point in a debate that seems to ensue about meta-info vs. categorizing content by it's nature. This script uses N_Grams to identify about 69 natural languages

Paul Graham: Hackers and Painters

09.05.2003, 21:56 · Martin · Permalink

Ok, almost everybody linked it already. I wanted to comment - in lenght - on this piece, but it might be suffice to say that I identify strongly with the ideas he puts forth. Maybe simply for the fact that I - too - am both.

Funny thing, I seem to find more and more people that have been painters/artists in one period and are 'hackers' now.

"You don't need a degree in computer science to do some" (And sometimes it doesn't even help)

Whatis Oblique Strategizing

09.05.2003, 09:10 · Martin · Permalink

The commonplace is one thing that Eno studiously tries to avoid at all times. His tool for eliminating preconceived notions is a set of cards he developed with fellow artist Peter Schmidt. "Oblique Strategies" functions as a kind of technological tarot deck, an oracle that can be drawn upon when you're stuck on a particular problem or just want to get a fresh perspective on a situation.

For someone like me who is familliar and friends with I-Ging et al, this is intriguing...

css Zen Garden: The Beauty in CSS Design

09.05.2003, 07:54 · Martin · Permalink

finally one site where one can 'steal from the masters'... a good quote:
"To date, most examples of neat tricks and hacks have been demonstrated by structurists and coders. Designers have yet to make their mark. This needs to change."

Java Pro - Build a Smarter Search Engine

09.05.2003, 07:50 · Martin · Permalink

Create a search engine, using Java and case based reasoning, that produces the best match rather than the exact match

ToReadList addition by Andi

Explains some concepts like the 'Nearest Neighbor Algorithm', and illustrates it in simple math. I really like the tone of this article. 'you can understand it' style (The author seems to say: 'you already know this!'). Choice quote:

Once upon a time I was the AI specialist for a large consumer electronics retailer. I spent a lot of time at AI conferences, which are typically filled with academics and military researchers. I was a popular curiosity at those conferences, with the most common question asked of me being why an IT person from a retail company would care about AI. My response was that AI is more valuable to the business world than to the academics and engineers. I've also known a lot of business programmers who've asked why I waste my time studying AI when everyone knows that only scientists can and should use that stuff. My reply is that the old classics are just as valuable, if not more so, than memorizing the latest APIs and, besides, this stuff is easy!

The Regex Coach

09.05.2003, 00:10 · Martin · Permalink

When Keith first linked to The Regex Coach I thought: 'nice tool for people who can't figure regex(yet), but not for me'. To clarify, there are people who claimed I breathe regex. (Mostly due to the fact I seem to be the only one who has any kind of basic understanding of them, and yes, I often use regex where others would rather use substring & stringlength juggeling)

Well, we all breathe air each minute, but that still does not make us expert breathers, does it? So I guess it might not do any harm to take some breating lessons.

Whatis BlogDigger

08.05.2003, 23:42 · Martin · Permalink

find some info here

Some thought on similarity

08.05.2003, 23:18 · Martin · Permalink

As my readers have gatherd, I'm rather fond of my 'similar entries' feature I have running here. Now I often combine it with a quick keyword search using my brute force regex search.

One thought that allways shows up with any kind of 'autogenerated categorisation' is this: 'Why are those two entries related, or why are they considered related?'
Problem is, there are usually serveral kinds of relation entries can share. Same keywords, linking the same URL, by the same author etc.

I my experience thought rhat usually matters very little. Once one learns to take the results with some curiousness, and is expecting a surprise here and there, most relations auto-generated make perfect sense.

Given the realm I use this kind of FOA in, the 'surprises' are actually welcome. Boosting assosiative recall, finding buried knowledge, making new, unespected connections between materials.


alles Bild, Text und Tonmaterial ist © Martin Spernau, Verwendung und Reproduktion erfordert die Zustimmung des Authors

Martin Spernau
© 1994-2026


amazon.de Wunschliste

Facebook me!
Google+

powered by Traumtank