2,267 karma · joined March 20, 2017
* https://www.iwriteiam.nl/ * https://github.com/FransFaase * https://fjfaase.at.hn
[1] https://www.iwriteiam.nl/counting.html
[2] https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)#G...
I recently started weeding at the farming cooperative that I became a member of at the start of July [1]. There is a short instruction movie where you hear one of the farmers give some instruction on how to use the hoe [2]. She explains, in Dutch, that you have to make light movements, just below the surface of the soil.
I enjoy helping out on the farming cooperative. It are simple tasks, that still require some concentration, and with an immediate result. It often brings me into a meditating like state. I meditated a bit in the past, but felt that it often wore off shortly after stopping, but with this that seems less the case, probably because I have achieved something useful. I guess, this is one of the reasons why many people like gardening. I do not have a large garden and working at the farming cooperative often means you have to repeat the same kind of work for much longer than you could have done in my own garden.
[1] https://www.iwriteiam.nl/D2306.html#18
[2] https://www.flickr.com/photos/197736829@N05/52960240223/in/a...
[1] https://en.wikipedia.org/wiki/Peter_Struycken
[2] http://pstruycken.nl/EnDyn.html?D,tag=P&w
[3] https://en.wikipedia.org/wiki/Carel_Struycken
With respect to consciousness, Joshua Bach has an interesting view: https://www.youtube.com/watch?v=e3K5UxWRRuY
A lot of software development done is because computers are too slow for our demand.[1] It is nice to have an integer type 'nat' that can hold arbitrary large integer numbers (at least as large as fits in the memory model, I presume), but it is not very efficient to use it for every purpose. You also would like to have methods to verify that a certain implementation of a program using a certain 'limited' representation of integers, is correct.
Last year, I found Volume 2 of the 1932 edition from The Odyssey Press in a charity shop for just €0.50 [1]. At home I discovered a round paper sticker with the words 'Buning' and 'Djokja'. It seems it either was sold in Yogyakarta are belonged to someone who lived there [2].
[2] https://berthub.eu/articles/posts/resignation-as-intelligenc...
I wonder if you will be happy when you small website will be rewarded as you may suddenly get a lot of traffic resulting in either becoming unavailable due to heavy traffic or forced on a more costly plan by the ISP. That is one reason why I am hesitant to post links here to my private website.
My advise would be to find someone that is an expert in the field of the paper and ask advice with respect to what would be a good journal. You could also try to contact any of the authors whoes papers you reference. If you paper has not any references, you would have to find relevant references. If a paper does not have any references, it is not very likely to be accepted by any journal.
[1] https://www.adlinktech.com/fr/ProRail
[2] https://github.com/ADLINK-IST/opensplice
[3] https://github.com/eclipse-cyclonedds/cyclonedds
[4] https://cyclonedds.io/docs/cyclonedds/0.10.2/config/cycloned...
[0] https://bootstrappable.org/ [1] https://bootstrapping.miraheze.org/wiki/Live-bootstrap
After two picks, you have three cases. If you picked two different colored balls, the distribution should be a uniform distribution again, just like the initial state. The two other distribution should mirror eachother, and thus be linear again.
Maybe that something interesting happens with three picks. Or maybe, you always end up with linear distributions with tilted slopes. In that case it is rather boring.
Recursive decent, where the parser asks the 'scanner' to accept a certain symbol at a certain location in the input stream, resolves most of these problems, such as for example the fact that in HTML the tags are case insensitive while JavaScript the keywords are case sensitive.
If you try to develop a parser that is user-friendly, but maybe not the most efficient (if you allow back-tracking) the whole problem of parsing become far less complicated. (There a good methods to counter performance problems due to back-tracking.)