Archive for Luxembourg

adv’surd! [jatp]

Posted in Statistics with tags , , , , , , , , , on September 3, 2021 by xi'an

AI for good

Posted in pictures, Statistics, Travel with tags , , , on December 26, 2017 by xi'an

Last week, I had a quick chat in front of the Luxembourg gardens with Julien Cornebise and he told me about the AI for Good Foundation with whom he was going to work through Element AI, after doing volunteer work with Amnesty International. Great!

champagne, not Guinness??? [jatp]

Posted in Statistics with tags , , , , on October 29, 2017 by xi'an


Posted in Books, Kids, pictures, Travel with tags , , , , , , , on October 22, 2017 by xi'an

As our son is doing an internship in Luxembourg City this semester, we visited him last weekend and took the opportunity to visit the Museum of Modern Art (or MUDAM) there. The building itself is quite impressive, inserted in the walls of the 18th Century Fort Thüngen designed by Vauban, with a very luminous and airy building designed by Ming Pei. The main exhibit at the MUDAM is a coverage of the work on Su-Mei Tse, an artist from Luxembourg I did not know but whom vision I find both original and highly impressive, playing on scales and space, from atoms to planets… With connections to Monet’s nympheas. And an almost raw rendering of rock forms that I appreciate most particularly!

The bottom floor also contains an extensive display of the political drawings of Ad Reinhardt, who is more (?) famous for his black-on-black series…

splitting a field by annealing

Posted in Kids, pictures, R, Statistics with tags , , , , , , , , on October 18, 2017 by xi'an

A recent riddle [from The Riddle] that I pondered about during a [long!] drive to Luxembourg last weekend was about splitting a square field into three lots of identical surface for a minimal length of separating wire… While this led me to conclude that the best solution was a T like separation, I ran a simulated annealing R code on my train trip to AutransValence, seemingly in agreement with this conclusion.I discretised the square into n² units and explored configurations by switching two units with different colours, according to a simulated annealing pattern (although unable to impose connectivity on the three regions!):

#counting adjacent units of same colour 
for (v in 1:n2) hood[v]=bourz(v,partz)
for (t in 1:T){
  colz=sample(1:3,2) #picks colours
#collection of squares impacted by switch 
  for (v in voiz) nood[v]=bourz(v,partt) 
  if (nood[a]*nood[b]>0){
    if (log(runif(1))<difz^3/(n^3)*(1+log(10*rep*t)^3)){
      if (el<minz){ minz=el;cool=partz}

(where bourz computes the number of neighbours), which produces completely random patterns at high temperatures (low t) and which returns to the T configuration (more or less):if not always, as shown below:Once the (a?) solution was posted on The Riddler, it appeared that one triangular (Y) version proved better than the T one [if not started from corners], with a gain of 3% and that a curved separation was even better with an extra gain less than 1% [solution that I find quite surprising as straight lines should improve upon curved ones…]