Older blog entries for mdupont (starting at number 32)

DotGNU x11 control ideas :

1. VCG graph layout control

2. RDF editor control

3. IP address control

Here you go DeepNorth, now you can certify bytesplit as a Troll. To bad advogato ignores it.

Troll Certification

<form method="post"

action="http://www.advogato.org/acct/certify.html">

Certify Who? as:

<select name="level" value="level"> <option> Master </option>

<option> Journeyer </option>

<option> Apprentice </option>

<option selected="selected"> Troll </option>

<option> Observer </option>

</select>

<input type="submit" value="Certify">

<input name="subject"

value="bytesplit">

</form>

RFC : SPAMCENTER

The spamcenter is a place to deliver spam to.

By collecting spam there, instead of bouncing it or delivering it to the user, you will be able to reach the following goals :

1. See who is spamming.

2. See what is being spammed.

3. See when the spammers are spamming

4. Alow users to retrieve non-spam

5. Allow patterns to be set up to compress the spam as just differences to other spam.

6. Allow tester of antispam software to run on the data files.

7. Allow people to route their mail via the SPAMCENTER for screening.

8. use certifications and webs of trust to allow certified users to report new spam.

9. Allow certified users to create patterns to catch spam.

10. store all the data under the GFDL and GPL.

treecc-info.owl ontology The treecc introspector ontology main file

This ontology is extract out of the c header of the treecc program.

It will allow the RDF markup of the instances of the compiler objects defined using the treecc language.

In that sense, it is a meta-meta-model.

The treecc grammer for a language is a form of a meta-model of that language.

The supporting files are also here : input contains many enum values that will be used to mark various nodes, they will become owl:Classes on thier own right.

This file Parser contains support properties about the results of the parser

eg : treecc-parse:TreeCCParse will have the owl:Domain of a TreeCCDocument and the owl:Range of a TreeCCIntrospected file

mike

Linux in the time of WAR!

Is is not very interesting that there is all this talk of war, so much aggression and strife?

Well, I think that it might have something to do with the planet mars getting so close. The lunatics among us might feel the same.

Mars Pic

mike

@prefix slashdot: <http://slashdot.org/moderation.shtml#> .

@prefix owl: <http://www.w3.org/2002/07/owl#>.

slashdot:moderate a owl:Predicate.

slashdot:Normal slashdot:moderate "0".

slashdot:Offtopic slashdot:moderate "1".

slashdot:Flamebait slashdot:moderate "2".

slashdot:Troll slashdot:moderate "3".

slashdot:Redundant slashdot:moderate "4".

slashdot:Insightful slashdot:moderate "5".

slashdot:Interesting slashdot:moderate "6".

slashdot:Informative slashdot:moderate "7".

slashdot:Funny slashdot:moderate "8".

slashdot:Overrated slashdot:moderate "9".

slashdot:Underrated slashdot:moderate "10".

# mike

1. Have been hacking away a the treecc.

2. Working with JQL on smoke

3. Researching more into REDHAT and how they are financing non-free licenses with taxpayer money.

4. Looking into m4 in parrot.

5. Learning all about CWM, posted a CWM mapping from terms to internal functions.

6. Been thinking about c# attributes

7. Thinking about transforming n3/cwm programs into perl/c++

Have made good progress on the treecc ontology http://rdfig.xmlhack.com/2003/08/24/2003-08-24.html#1061744012.986722

http://rdfig.xmlhack.com/2003/08/24/2003-08-24.html#1061745339.916668

The next step will be transfom the strings into rdf names for the ontology

Progress on treecc and cwm.

Hacking CWM scripts to process the GCC rdf output of the introspector.

Soon we will have a script that will convert a c program into a skeleton RDF ontology!

Is it possible transform this CWM proof into a perl program that uses redland directly. Or a C++ program?

How can you make CWM dump all the data about the proof and how it is executing it so that it is possible to optimize it.

Maybe a trace of the execution in such a way that it is easy to recognise reoccuring elements. It should be possible to turn the proof into a Finite state automaton.

mike

I have been reading some of the other journal entries, and noticed that mine are not very well written in comparison.

Just been working on CWM for processing the n3 files from the introspector.