Dutch / Nederlands
Site map

I write, therefore I am

With this variation on a famous statement by the philosopher Descartes, I would like to express that writing about what happens in my life is important to me.

Sunday, May 13, 2012

IParse: Parallel parser

This weekend, I worked on the parallel parser in IParse. I removed a number of bugs but I am still encounting problems, which become harder and harder to debug. Also added code to assist debugging. However, I do have good faith that I will be able to weed out these bugs. Today, I discovered that performance is very bad compared to the other parsers. Implementing an alternative memory allocation strategy (keeping a list of deallocated objects to avoid calls to system allocation routines) did not show a significant improvement. I am afraid it is becoming a rather academic exercise, one that I will finish anyway.

Friday, May 11, 2012

IParse: Parallel parser

In the past weeks, I worked on a parallel parse version of IParse. The first parser that I implemented as part of IParse was a recursive back-tracking version, which jumps for- and backwards through the text in an attempt to parse the text according to the given grammar. For a very long time, I have been thinking about a version that would try all alternatives in parallel and would be strickly speaking only move forward through the text. This evening, I managed to parse the first text ("12") with a very simple grammar ("root : int eof .") succesfully. I does not look much, but I still consider it as an important milestone, because the parallel parser is a rather complex thing. It maintains two tree like structures in parallel. One tree like structure represents all the alternatives. The second tree is an memory efficient implementation of a collection of stacks, where each stack belongs to one of the active alternatives. Each stack represent the nesting of the rules that have been applied to parse the text up until the given point. The structure of the actual parsing routines looks very much like the one used for the heap implementation of the back-tracking implementation (which was released on October 2, 2011) and in the past week, I realized that they could be combined, where only the execution part would be different. Maybe that will be my next project, when this will be finished.

Tuesday, May 8, 2012

P. Struycken: Five books

Today, the five books about/by P. Struycken that I ordered from Luïscius Antiquarian Booksellers arrived. The books with the prices are:
  • P. Struycken. Komputerstructuren. (1970)  €12.
  • P. Struycken. (1974)  €18.
  • P. Struycken. Splash 1972/1974.  €10.
  • Struycken. Beelden en Projecten. (1977)  €5.
  • P. Struycken. Trooping the colour/colour colours. ISBN:9789080425743. (Signed by author on January 26, 2002.)  €20.

Saturday, May 5, 2012

Link

Wednesday, May 2, 2012

Peter Struycken: Structure 7

Last Sunday, I looked at Structuur 4,5,6,7 made by Peter Struycken and the algorithm used to make it. I did not notice the rather obvious structure, which I read about yesterday evening in the book P. Struycken on page 108, that it build-up with squares of four elementary squares. This evening, I spend some time turning the bottom pattern of the work of art (downloaded from Kunst.Nu) into a binary representation using a script for the MySample editor. In the process, I made some fixes to this editor as well. The image that is produced by this script is:

Tuesday, May 1, 2012

Peter Struycken

At 17:11, I bought the book P. Struycken (ISBN:9789056626051) from bookshop De Slegte for € 16.99, which is about the works of Peter Struycken, a Dutch artist who often used computer programs during the creation of his art works.

Sunday, April 29, 2012

Tetem 2 and 21Rozendaal

This afternoon, I went to Tetem 2 and looked at the exposition of The Artery Show where I found one drawing by Billy Foley: "24.3.99 no 1. 90x111.1 cm". It is currently owned by Dave Blank. I also looked at Structuur 4,5,6,7 by Peter Struyken, and thought about the algorithm that he could have used to produce it. Next, I went to 21Rozendaal and experienced Tide. Interesting.

Saturday, April 28, 2012

Books

I bought two books from bookshop De Slegte and used a € 2.50 coupon, I got last month. I had two of such coupons which are only valid this month if you spend at least 15 Euro. The books I bought are:
  • Het karakter van China by Cecilia Lindqvist (ISBN:9789050188685) for € 11.99.
  • Everything is Illuminated by Johanthan Safran Foer (ISBN:79780141020365) for € 5.00.

The Kuks Collection

I went to the opening of the exposition of "The Kuks Collection" at art galery "Beeld & Aambeeld". There were only two paintings by Billy Foley, but one of them, I had not seen before. It is a work from the late ninethies with rather pale colours and but a few strokes that became so characteristic in his later works. And one painting that I remember having seen on Sunday, November 16, 2008. I heard that there were also some paintings on display at "Tetem 2". I also looked at the drawings by Billy Foley that they still have in stock. Some look interesting.

Tuesday, April 24, 2012

Link

Saturday, April 21, 2012

Painting Billy Foley

Today, when I visited gallery "Beeld & Aambeeld", I met Stefan Kuks by accident and he told me that my favourite painting by Billy Foley will not be included in the exposition that opens next Saturday as part of The Artery Show. The most important reason being the large size of the painting, which, besides makes it difficult to transport, would make it take a large part of the exposition. We talked a little about my 'obsession' with the painting and my desire to calculate the number of ways it could have been painted. He thinks that the number of possibilities must be infinite. If it is made with a finite number of strokes, than it must be a finite number, ableit large, no larger than the factorial of the number of strokes. But if of many strokes the order can be determined, the number might be much smaller. It might be very difficult to calculate the number, but that is another matter.

Sunday, April 15, 2012

Random tile design

This afternoon, I was phoned by one of my brothers-in-law with the question if I could write a program for generating random tile designs for his back garden. He told me that it was 13 tiles wide and he would lay a rectangle 22 tiles deep and than (besides the shed) a sqaure of 6 by 6 tiles. He told me that he had tiles in four colours: 69 white, 42 pink, 102 yellow, and 109 blue tiles. I told him that I wrote write a web page for the design. He also send me some links to images of tiles on ImageShack. It took me about two hours develop the page using JavaScript. I remarked to him that it was truely random and this means that tiles of the same colour might be clogged together, but he was quite happy with it. (Below an adapted version of the script is used that uses colours instead of images to judge yourself. A new pattern will be generated on each reload.) I did think about an algorithm to prevent groups of tiles with the same colour to appear, but realized that it would not be simple.

Thursday, April 12, 2012

Alternative URU worlds

Yesterday evening and to night, I tried to explore some alternatives of URU Live. Yesterday evening, I had some trouble downloading the installer of Open URU, but tonight it worked without problems. So I tried The Open Cave. When I ran the installer, it appeared I had an outdated version of URU live. I just starting URU live, copied the new files (using xcopy), and ran the installer again without any problems. When I tried The Open Cave MOUL, it crashed when I linked to the linking book. Next I walked throught the dessert cleft and after this, the crash no longer appeared. In Bevin, one of the stands linked to an age that I had not seen before and that looked quite nice. (Later, I discovered that it belongs to the original game.) Tonight, I installed URU open and played with it, but did not find anything new. Next I tried URU live and found the city deserted, while the last time I went there it was still quite crowded. Then I started The Open Cave again and went to City of Dimensions, which is a copy of the normal city with some enhancements. Although the enhancement looked clever, the texturing was really poor making it look very amateuristic. I went to the normal city and encountered some people there. When I went back to the City of Dimensions, it crashed when I entered a new vessel. I decided to leave it there. (See Logbook for some more details.) On YouTube I watched some movies from Let's Play Myst Online URU Live Again.

Link

Tuesday, April 10, 2012

Back-tracking language

Not so long ago, I was working on an adaptation of my IParse program to generate back-tracking parsing routines in a simple scripting language. This generated a function for each non-terminal and used various variables to keep track of the parsing state. Later, I realized that it would be an interesting idea to extend the script language with some constructs for parsing and I realized that I could generalize it into support for back-tracking. The idea is that each function can either return a result (of what has been parsed) or return a failure. Returning a failure is kind like raising an exception. But with parsing (and also back-tracking) a failure often means to reset the values of some variables and try again along a different path. For example, one could have the "or" language construct that would combine two blocks of code. If the first finds the result, that is returned. If the first returns a failure, the second is executed. And the "opt" language construct, when followed by a block of code, would mean that a possible failure would simply be ignored. A "seq" language construct could be used to indicate that a block of code should be execute (at least once, if not followed by "opt") repeatingly until it failed. And there should also be three kind of loop statements (in many language indicated by a "for" or "while" statement), one that would fail whenever the body would fail, one that would simply continue with the next option, and one that would stop on the first option resulting in a success. These could be named "forall", "forany", and "forone". The language could use boolean expressions (possibly preceded by a keyword like "check") that when evaluated to false would signal a failure. There also needs to be a special statement to start a back-tracking execution from within a normal procedural part, for example with the keywords "try" and "on failure". In case of parsing, it would also be interesting to know at which point the failure occured. Parsing often only suggest one result, where general back-tracking algorithms often can produce multiple results. That leads to a problem, because expression generally only return one result. There are several methods to approach this problem. One is to let produce a possible empty list of results. Another solution is to introduce an "output" statement, which like the "return" statements produces a result, but does not stop the execution at that give point. The language would also need to have a statement to combine the results of all the output statements, or as an alternative, allows the creation of an iterator by which the results can be returned one by one. The language might also benefit from a statement like the "!" operator in Prolog to indicate that other alternatives in the current closure should not be tried in case of a failure following that statement. IParse uses memorization of intermediate results to speed-up parsing. Maybe this could also be applied to other back-tracking algorithms. It could be possible to add a paradigm to the language to add to a back-tracking function to indicate that memorization should be applied.

Saturday, April 7, 2012

It starts with housing

This afternoon at 16:41, I bought the book Het begint met wonen / It starts with housing (ISBN:9789068684773) with 75% off for € 9.98 from bookshop Broekhuis. The book (with text both in Dutch and English) is about all the historic buildings of the housing cooperatives Ymere.

Links

Wednesday, April 4, 2012

Links

Tuesday, April 3, 2012

Copyright violation of picture

Neha Lobana op Tumblr has used a picture made by Annabel in a post without reference and after removing the text "eyepolish.blogspot". The post got more than ten thousands of likes and notes. Because this is a clear violation of the copyrights of Annabel, I send the following email to dmca@tumblr.com in which I request the picture to be removed and the likes and notes to be transfered. I am looking forward to how they are going to respond to this.

    Dear Sirs,

    I am making a DMCA notice with respect to the image

    http://nehalobana.tumblr.com/post/19878725657

    which is a copy (after removing the clearly visible eyepolish.blogspot text) of

    http://eyepolish.blogspot.com/2012/03/giraf_23.html

    which was placed on Tumblr by the link:

    http://annabelester.tumblr.com/post/19795875569/www-eyepolish-blogspot-com-for-more-do-it-your

    The image is copyrighted by Annabel Ester Faase and she has not granted anyone to use this image for any purpose.

    I hereby request you remove the image in violation and transfer all the thousands of likes and such to the image on tumblr crediting the rightful owner.

Update: This evening we were informed by Tumblr that they have removed the offending image. But that was just part of my request. It seems that Tumblr does not have a mechanism to transfer all the likes and notes to the rightful owner of the image, and Annabel did thus not receive the credits that she deserved. Tumblr will terminate an account in case many copyright infringments have been reported. It is possible that Neha Lobana found the image on weheartit where also a version without text can be found. But note that a link to the blog is shown with the image.

Sunday, April 1, 2012

Magnolia

Not very surprising that many of the flowers of magnolia have turned brown, after the temperatures dropped to 10 degrees Celsius below zero during the night. This is not the first time this has happened and it would not surprise me if it would blossom again later this spring.

Tuesday, March 27, 2012

Introduction

Diaries
May 2012
April 2012
March 2012
February 2012
2012
2011
Alzheimer's Disease
Trip to China 2010
-- contact --

Family

Frans
Li-Xia
Annabel
Andy
Honeymoon
Faase
Family tree
Friends
Others
Pictures

Kabuki Syndroom

Collecting

Books
Maps
Computers
Cameras
Trips
Flights
Weddings
Funerals
Reading
Movies
Useless lists

Hacking

My life as a hacker
Signature programs
Software enginering
The Art of Programming
HTML to LaTeX
JavaScript
eXtreme Programming

Puzzles

Hamilton cycles
cutting sticks
Califlower fractal
more...

Faith

Sceptic
Jesus Christ
Know God
The existence of God
May 24, 1979
My final words

Katla

Earthquakes
Graphs
Tremors
Helirecorders
Volcano Blog


Email

The email address below, may only be used for private communications. This email address may not be put on any mailing list. We do not want to receive emails with advertisements of any kind. Our email address is:

Site statistics

If I did not count wrong, this site consists of 788 HTML-files with a total size of 17,031,409 characters, having 34256 internal links and 7081 external links. (About 685 of the external links are broken.) Furthermore, it contains 130 C/C++ program files with a total size of 3,181,111 characters, and 3 PASCAL program files with a total size of 35,259 characters. There are 51 text files with a total size of 283,779 characters. With respect to images, this site containts 1088 JPEG images (total size 46,360,291 bytes), 180 GIF images (total size 4,202,339 bytes), 82 PNG images (total size 2,229,698 bytes), and 2 BMP images (total size 3,727 bytes). With respect to sounds, it contains 14 WAV files with a total size of 389,002 bytes and 1 MP3 files with a total size of 70,182 bytes. It also contains 43 PostScript files (total size 308,387 bytes), 2 LaTeX files (total size 132,020 characters), 6 PDF files (total size 455,654 characters), 14 zip files (total size 1,103,014 bytes), 3 gzipped tar files (total size 69,802 bytes), 44 SGF files with a total size of 83,527 bytes, 81 KML files with a total size of 4,193,212 bytes, and 2 EXE files with a total size of 38,340 bytes. It also uses 15 JavaScript files with a total size of 464,149 bytes,

Copyright

Creative Commons License

I, Frans Faase hold the copyrights of this and all other pages on this website. For this website a Creative Commons License is applicable. You may not use this work for commercial purposes. I consider all computer programs to be copyrighted by me under the GNU General Public License, unless stated explicitly otherwise. All quotes (text and program fragments) from other sources are excluded from this, and should be considered as copyrighted by their authors.

An alternative link for this website is: http://5z8.info/back-to-africa_b2t1i_super-nsfw.
(This space is intentionially left empty)