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 the act of writing about what happens in my life is important to me.

Sunday, December 8, 2019

Heliophile and more

I went to see the performance of Heliophile in Haaksbergen. I just missed the start of the performance, because I had left a little late and had to bike against the wind. This was the first performance where the background tracks were replaced with a life performance with a large modular synthesizer. It was also the last performance with Bernard, which means Heliophile will continue as a duo. In the room they were performing, there was also an exhibition of Fotobond Twente. I liked the photographs by Hans Wissink, Marinus Rouweler, and Anja Jalving. When I biked to Enschede, I saw several rainbows (which all originate from the same cloud, I guess). At 14:59. while I was biking on the Helweg, I saw a fragment (left) of a rainbow at the horizon. From 15:10 till about 15:13, I saw a rather bright, double partial (left) rainbow. Then at 15:16, I saw a partial (right) rainbow. It slowly started to rain, while the sun was still shining, and finally, around 15:20, I saw a full, but rather faint, rainbow. I went to Het Bolwerk, where the opening of the exhibition with drawings by Johan Leerkotte. There also were some music performances.


Saturday, December 7, 2019

Groninger Museum

Peter Struycken invited me to visit the Groninger Museum with him, where there is an exhibition of some of his works. After we had some coffee and tea with applepie, we went to the top floor. In the hall we were greated by three of the Boulez carpets, from left to right: Boulez 44, Boulez 27, and Boulez 45e. We sat on a bench and watched ...explosante-fixe... with music by Pierre Boulez and Skrjabins Vision with music by Alexander Scriabin, two 20 minute long animations on music displayed on five large screens. Next we saw the exhibition Presenc by Daan Roosegaarde and the exhibition Mondo Mendini about the Italian designer Alessandro Mendini. At this exhibition, I liked the following works:
  • Schermo for Porro by Alessandro Mendini, 2014.
  • Sinnoso for Maison Matisse by Alessandro Mendini, 2019.
  • (Without title) by Alessandro Mendini, nitro lacquer on wood, 1986.
  • (Without title) by Alessandro Mendini, nitro lacquer on wood, 1990.
  • Photograph of Goetheanum, Dornach designed by Rudolf Steiner.
  • Portret van Alessandro Mendini by Han Meilin, 2010.
  • With suprematistisch huis by Kazimir Malevich, 1920.
  • Stilemi enigmatici by Alessandro Mendini, 2015.
We also saw the museum collection. Of which I liked the following works:
  • Kerkje te Oostrum by Johan Dijkstra, 1922.
  • Meisje aan de pomp by Matthijs Maris, 1872.
  • Mijn atelier by Lawrence Alma-Tadema, 1867.
  • Figuren op het strand by Isaac Israës, about 1925.
  • Jahresteller 1981 for Rosenthal (one of 2500) by Morandini, 1980.
  • Job Hansen by Jan Altink, 1922-23.


Wednesday, December 4, 2019

Kirsen Everink

I went to see the exhibition at B93 with paintings by Kirsten Everink. I have seen many of her paintings at the Finals 2017 exhibition, which means she has not produced many new works in the past two years.

Duin

This evening, I finished reading Duin, the Dutch translation of the novel Dune by Frank Herbert. It was my fifth reading of the novel, fourth in Dutch, once in English. The last time, I finished reading the book (in English) was on Sunday, May 8, 2011. What surprised me during this reading, was my emotional responds to it at certain important points. Is this because I am older and have more emotional experiences of because I have become more sentimental. I started to read the book because at the moment, the book is made into a film again (for the third time). I have come to the conclusion it will be very hard to adapt the book and capture the depth of the struggle of Paul, which is so much hidden for the people around him.

Link


Sunday, December 1, 2019

Random maze

In the past weeks, I have been analyzing algorithms to generate random mazes. The kind of mazes that I am studying are mazes within a rectangular grid of rooms where the maze is a spanning tree, meaning that there is exactly one route between each two rooms. In such a maze the number of doors (compared to walls) is one minus the number of rooms. Knowing how many doors and walls there are to be, you can calculate the change that at some position there door and wall. From this you can also calculate the changes for the different types of rooms (with respect to the position of the doors). There are rooms with one door, two opposite doors, two doors with a turn, three doors, and four doors. But it seems rather hard to generate random mazes that match these 'ideal' distributions. Wilson's algorithm is a simple algorithm to generate an unbiased maze. It has almost half the number of rooms with four doors as the 'ideal' maze. I also implemented an algorithm that starting with a balanced random assignment of doors and passages and fixes this by randomly changing passages into doors to connect unconnected rooms and doors into passages to prevent multiple routes between rooms. This algorithm is named 'Random' below. Alternatives of this algorithm, called 'Digging' and 'Trees' below, start with a maze with only walls and only doors, respectively. I also implemented a recursive division algorithm, called 'Spit' below. The traditional depth-first algorithm is called 'Depth-first' in the table below. This table gives for each algorithm the average percentage for the different type of rooms when the algorithm is run 500 times for a 50 by 50 room maze, and also the average distance between every two rooms (with its standard deviation).

               one    opp.    turn   three   four   dist.(dev)
'ideal'     26.69%  13.32%  26.69%  26.65%  6.65%
Wilson      29.18%  17.35%  27.82%  22.18%  3.46%  111.14(12.72)
Random      30.57%  16.15%  26.80%  22.47%  4.01%   96.49(10.20)
Digging     31.70%  15.84%  25.25%  22.79%  4.42%   94.93(11.03)
Trees       30.50%  16.45%  26.78%  22.15%  4.13%   58.50( 1.75)
Split       28.11%  13.97%  32.90%  22.01%  3.01%  123.81(16.30)
Depth-first 10.12%  31.00%  49.00%   9.72%  0.16%  403.49(32.92)

The depth-first algorithm clearly gives a different kind of maze than the other algoritms, resulting in lots of rooms with only two doors and only a very few rooms with four doors. It is obvious that this will lead to a high average distance between two rooms. However, note that the algorithm 'Random' and 'Trees', which are rather similar with respect to the types of rooms they have, yet have a different average distance. The name 'Trees' refers to the fact that the walls grow like trees from the sides, which make that the rooms in the center have short connections to the rooms further away. I have no simple explaination for the fact that the number of rooms with more doors are lower for all algorithms compared to the 'ideal' distribution. I also have not yet found an algorithm that generates mazes that on average are closer to the ideal numbers.

Link


Thursday, November 28, 2019

Has always been dystopia

I went to the opening of the exhibition Has always been dystopia by Erica Ferrari at XPO.


Saturday, November 23, 2019

Overkill Festival: Day two

During the day, I helped as a volunteer at the expo with the VR installations Hana Hana Full Bloom and False Mirror. Later, I looked around and saw Camino Real by Fuckgamedev and Journey to Lavender Town. I also played a little with the modular synthesizer in the synth area. At the start of the evening, I attended a VR music performance by Sonotrope (which I did not find very interesting).


Friday, November 22, 2019

Overkill Festival: Day one

I went to opening of the Overkill Festival, which is this weekend. I watched the modular synth performances by Archeface (recording on SoundCloud) and Jungle of Wires. I also tried some of the VR installations and a game: Hana Hana Full Bloom, False Mirror, Pastoral by Theo Triantafyllidis, The Lacuna Shifts, and VR Wizard: A magical training ground by Power of Moo.


Sunday, November 17, 2019

Using git for file sync

It took me a long time to become a little confident with git after having used other version-control systems with a more friendly interface. Recently, I discovered it is rather easy to push your commits to a repository on an USB-memory stick and that such a repository can be used to syncronize edits between different computers, without having to rely on an external repository service, such as GitHub. Now I am just uses some directory synchronization tools for such purposes. I am considering to also put all the data for this website in a repository hosted on an external drive. The idea is to create a bare git repository on the drive, with a command like:
git init --bare targetdir
Next you have to set the origin of your git repository and next you can push it with commands like:
git remote add origin targetdir
git push
If you want to clone the repository in some other locations, you can simply use a command like:
git clone targetdir


Saturday, November 16, 2019

AKI open day

I attended the open day of AKI this morning. I first had a look at the library where they were selling old books. Not any catalogues. I talked with one of the teachers about the model drawing class that he gives every week. Visitors were invited to do some model drawing themselves. I also talked with a fourth year student about his work. I looked in the various studios and workplaces. I bought a card with a drawing of a bird by Nadie van Wijk for € 2.00. Near the entrance, I was invited to have my picture taken with the Trip to the moon background together with two students. This resulted in the picture shown above. (I asked their permission to publish it here.)


Thursday, November 14, 2019

Books

At 17:47, I bought the following two books from charity shop Het Goed:
  • The Netherlands: A Guide to Recent Architecture written by Kathy Battista and Florian Migsch, in English and published by Ellipsis London Limited in 1998, ISBN:9783829004756, for € 3.60.
  • JPod written by Douglas Coupland in English and published by Bloomsbury Publishing Plc in 2007, ISBN:9780747589150, for € 1.80.

Wifi tracking

I got a reply to my inquiry to City Traffic about their method of processing my MAC address. In the reply they state that they apply pseudonymization on the wifi-tracker and anonimization before it is stored in the database. They did not explain the specific method that they use for both methods. I do not see a reason why they would not publish their pseudonymization method and provide for an API to send the pseudonymized MAC adres for their opt-out register.


Tuesday, November 12, 2019

Go on 13×13

Some weeks ago, I met some go-player, who happens to have his lunch at the same place as I. We have decided to play a game of go during lunch time on a 13×13 board. This lunch was the second time we played and explained the game to others around us.


Saturday, November 9, 2019

Berlin Geisterbahn

Today, it is 30 years since the fall of the Berlin Wall. I went to visit Rijksmuseum Twenthe to see the exhibition Berlin Geisterbahn with pictures by Fons Brasser, which he took from ghost stations from the Berlin S-Bahn, the rapid transit railway system of Berlin. I studied the four maps, from different periods, of the S-Bahn that were on display, and tried to relate them. I took one of the information sheets, with a picture of the Schulzendorf station on the back, that had a map of all the S-Bahn stations during the period the pictures where taken in the first half of the eighties. All the ghost stations are marked with colours on this map.


Tuesday, November 5, 2019

Wifi trackin

The city of Enschede is using the services of the Dutch company City Traffic to measure footfall in city center. The company cleams that this is privacy proof. According to the Dutch GDPR laws, it is forbidden to track people using MAC addresses of their mobile phones. City Traffic defends themselves by stating that they are not storing MAC addresses but are anonymizing the addresses by applying a some hash function. They also have an opt-out register on their website. I wonder if they actually apply the same hash function to the MAC address entered there in the browser or that the MAC address is only hashed in their server. I would like to be opted-out, but not that they process my MAC adres any any form without my explicit permission. On the opt-out page, there is no mentioning of giving them the right to process the MAC address, which I think they should according to the Dutch GDPR laws. The fact that they do have an opt-out mechanism, seems to imply that they are not truely anonymizing the MAC addresses, but that they could still track my MAC address if someone would give it to them.


Sunday, November 3, 2019

Average distance

A property of a maze is the average distance between all the rooms, where the distances is defined as the number of passages on has to pass to arrive from one room to another room. To calculate it, you first have to calculate the (shortest) distance between all combinations of rooms, and than sum all those distances. To calculate all the distances, one could use the Floyd-Warshall algorithm, which requires a matrix of the size of the number of rooms. Because the distance is direction independent, the matrix is symmetric, and one only needs to store one half of the matrix. Still the memory consumption grows quadratic with the number of rooms. However, to calculate the average, one only needs to how often a certain distance occurs. As an alternative one could sequentially calculate the distances from each of the rooms using Dijkstra's algorithm. This would only require a memory storage linear equal to the number of rooms. If the maze is 'nice' in the sense that there is exactly one route between every two pair of rooms, one could use any recursive algorithm to visit the rooms starting from the first room. Once the distances are calculated from one room, one can count how often each distance occurs. These counts can easily be summed (using a storage equal to the number of rooms) for all the rooms. Note that each distance is counted twice, but for calculating the average distance this does not matter. This algorithm requires one to traverse the maze as many times as there are rooms. Last night, I came up with an algorithm for nice mazes that only require you to traverse the maze once, and which does not count the distances twice. While walking through the maze it keeps a list of distances from the rooms visited. When arriving in a new room, this list is used to update the global list of distances. If the room has only one passage not visited yet, the list is simply extended with room. This is done by adding the room to the front of the list and letting the position of in the list determine the distance. If there one more than one exit left that has not been visited, the current list is assigned to the room and an empty list is passed for the next step. After returning from that part of the tree, the list from there and the list kept at the room, can be used to calculate all the distances between the rooms counted by both list, and after this has been done, the two list can be added together for the remainder of the tree. (If there is still more than one passage not visited, the added list is again assigned to the room, otherwise it is passed to the next step.) This afternoon, I implemented the algorithm in the function _calcDistances in MazeGen.cpp, the maze generation program I have been developing.

Links


Saturday, October 26, 2019

In to the city

While biking to the city, I stopped at Kringloop Enschede. At 15:57, I bought the following two books:
  • De tweede helft: beeldende kunst na 1945 written by Ad de Visser in Dutch, published by SUN in 1998, ISBN:9789063037833, for € 3.00.
  • Pier+ocean: construction in the art of the seventies : an exhibition written by Gerhard von Graevenitz and Norman Dilworth in English and published by Arts Council of Great Britain in 1980, ISBN:9780728702394, for € 1.00.
I went to Concordia to watch the short movie: Fake Fiction, which is part of the exhibition Untitled Surface by Filip Markiewicz. On Sunday, September 29, I already saw this exhibition and watched part of the movie. Now I took time to see it from the start to the end only to discover that I already saw almost the whole movie. Nevertheless, it was an interesting experiecnce. After having eaten an ice cream (temperature reached 19.9°C at the weather station at Twenthe Airport), I went to bookshop Broekhuis, where at 17:12:58, I bought the book Famous For 15 Minutes: My Years With Andy Warhol written by Ultra Violet in English and published by Methuen London in 1989, ISBN:0413615308, for € 12.50.


Friday, October 25, 2019

Books and exhibition

At 16:27, I bought the book On the Road written by Jack Kerouac in English and published by Penguin Books in 1998, ISBN:9780140274158, from charity shop Het Goed for € 1.30. In the evening, I visited the last day of the exhibition Mixed (up) at B93. Around 18:25, I bought the artist book Street Poetry I. (5/30) from Esmee van Zeeventer for € 15.00 and also the artist book Crisis Sale (57/100) from Patric Jonkman.


Wednesday, October 23, 2019

Rule 30

When I read about Rule 110 being Turing complete, I adapted a program that I wrote for Rule 30 such that it works for Rule 110. The results looked promissing. Yesterday evening, I spend some time to write some JavaScript code to display the results. When today, I applied this to the results for Rule 110, the results where somewhat disappointing. A lot of repetitive patterns and some of the expected patterns did not appear. Below the visualisation of repeating patterns up to the area of 100. (A manually removed some dupplicates, so the list might be incomplete.)

This text is displayed if your browser does not support HTML5 Canvas.

Today, I read that Stephen Wolfram announced The Wolfram Rule 30 prizes, which are about the randomness of Rule 30. I think that all three questions are true, but very very hard to prove.


Monday, October 21, 2019

Link


Tuesday, October 15, 2019

Link


Sunday, October 13, 2019

Unravel

In the afternoon, I visited XPO to have a look at the exhibition Unravel with work Rhizoma by Melle Foortjes and the work 111 days in Jerusalem by Judith Glimmerveen. The exhibition is part of the Fotomanifestation Enschede. They are two students from AKI.

Crossless mazes

I was thinking about generating mazes in a rectangle of squares that have the property that non of squares with four squares to the left, the right, the top and the bottom, has no walls, e.g., is like a cross. One way to generate these is thus to allow such cross squares and apply an algoritm to elimintate them one by one. We assume only nice mazes, which are mazes where every two squares can be accessed through exactly one route, or in other words where the passages form a tree graph according to graph theory. I think the following algorithm works. As long as there is a still cross square, pick a cross square that is furthers away from the top left corner, where distances is calculated by adding the distance in horizontal and vertical direction. Now change either the passages to the top or the left into a wall, which makes that the square is no longer a 'cross' square. With doing this, some squares will no longer be reachable from the top left square. Now, either the square to the left or to the top will be included into these squares. Note that this square is closer to the top left square. Possibly there is even another square even closer that now no longer can be reached from the top left corner. Pick one of these squares. Now it must be that this square has only passages to the right and the bottom and that if there is a square to the left or the top, it must be reachable from the top left corner. Turn the wall into a passage for either the top or the left square. This might turn the square into a cross square, but that cross square is closer to the top left corner. Each step, will either remove a cross square or replace it by a cross square closer to the top left corner. (An implementation of the algorith could make some smart choices to prevent the latter case.) Because there is only a limited set of squares that might have to changed into a cross square, and this set becomes smaller whenever the last cross square at a certain distance is eliminated, the algorith must come to a halt, resulting in a maze that does not have cross squares.


Saturday, October 12, 2019

Museumnacht Enschede

Annabel and I went to the Museum Night Enschede. We had dinner at a local food hall. First we went to Concordia. We looked around a bit. The music from DJ Southern Depot was a little overshadowing everything. Did look a little at VJ The C-men. Next we went to Sickhouse. Here we saw (the last half) of Patric Jonkman performing with his (relatively small) modular synth to silent movie The Cabinet of Dr. Caligari and Thom Floris performing to chapter 1 of the silent movie Häxan. From this we went to Rijksmuseum Twente. I showed Annabel the painting by Claude Monet. I sat on the ground while listening to the performance of Lotte Pen and immediately slipped into a meditative state. She performed: Triptych, Chronon, Patternalism, and Tabernacle (if I remember correctly). We looked around a little more and paid short visits to the AKI and Tetem art place before going to De Museum Fabriek. There we joined the last demo of the oldest Zeiss Mark I planetarium projector, which is in the process of being restored. It was damaged during a fire in 1976 and had been in a storage room for a long time. It was only last year that the restoration started. It is not finished yet. Many of the projectors are not aligned correctly yet and need to be adjusted. (In 1968, I saw this planetarium in The Hague together with my father, my brother and two of my sisters.) We drank some tea in the cafe of the museum before we went home at midnight.


Thursday, October 10, 2018

Moleskin daily planner

At 17:26:43, I bought a Moleskin daily planner for 2020 from Bookshop Broekhuis for € 21.99.


Monday, October 7, 2019

Introduction

Diaries
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
2019
2018
2017
Alzheimer's Disease
-- contact --

Family

Frans
Li-Xia
Annabel
Andy
Honeymoon
Others
Pictures

Collecting

Books
Maps
Bookshelves
Art works
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 Programs

Puzzles

Hamilton cycles
cutting sticks
Califlower fractal
more...


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. I do not want to receive emails with advertisements of any kind. My email address is:

Privacy statement

This is a static website with no contact form and no way to add comments. It has no advertisements and no trackers. It does not use cookies. I am not using any method to analyse traffic to this website nor keeping any logs. I am not collecting personal data besides what is published on this website. If you want me to remove any personal data (including your name or link to your website), please contact me by above email address and I will make all effort to remove the data as soon as possible. I am private person and this website does not serve any economic purpose. All cost for maintenance are paid by myself. I do not receive any payments. The website is ad-free and does not have sponsored links.

Site statistics

If I did not count wrong, this site consists of 971 HTML-files with a total size of 22,525,202 characters, having 47,695 internal links and 11,085 external links to (more than) 3,780 websites. (At least 731 of the external links are broken.) Furthermore, it contains 212 C/C++ program files with a total size of 4,750,060 characters, 8 MySample scripts with a total size of 61,594 characters. and 3 PASCAL program files with a total size of 35,259 characters. There are 68 text files with a total size of 738,916 characters. With respect to images, this site containts 1252 JPEG images (total size 54,743,322 bytes), 146 GIF images (total size 3,765,046 bytes), 94 PNG images (total size 2,280,364 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), 9 PDF files (total size 789,074 characters), 22 zip files (total size 2,487,335 bytes), 3 gzipped tar files (total size 52,345 bytes), 45 SGF files with a total size of 85,019 bytes, 104 KML files with a total size of 4,333,995 bytes, and 2 EXE files with a total size of 38,340 bytes. It also uses 15 JavaScript files with a total size of 663,236 bytes, This leads to a total size of 101,626,167 bytes.

Copyright

Creative Commons License

I, Frans 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.


























(This space is intentionially left empty)