Another milestone, I got CyanogenMod 12.0 (Android 5.0.1) nearly fully working on the Samsung Galaxy Alpha (SLTE) Exynos version. Video playback is not working but I’m sure it will just be a matter of time …
The source code is available are here.
Here is a totally computer unrelated post! Several people asked me how do I protect my bike to transport it safely on a plane. One possibility is to use a bike box, but the issue with a box is that airline personal likes big boxes, because they can use it to pile a lot of suitcases on it. I prefer to just wrap it with cardboard! Normally I go to a supermarket and ask if they have some spare cardboard for me. Normally they are happy to get rid of some. What you need bring from home in addition is a piece of rope, zip ties, duct tape, an old towel and a multitool or cutter.
I prepare everything at the supermarket. Cut the cardboard for the different pieces of the bike, put holes in the cardboard for the zip ties (first put duct tape on the cardboard then make the hole trough the duct tape and the cardboard!). Make sure you can still push the bike, the wheels should spin. In the end I have a small package like this:
This small package is easy to transport. Either on the back of the bike or on your back 😉
At the airport you remove the pedals and fix the crank. Put the towel over the saddle and fix it with duct tape or a piece of rope. Tie a rope from the saddle to the handle bar so you can carry it. This makes it also easier for the airport personal to lift it. Then cover the bike with cardboard. Some parts are fixed on the bike with zip ties so they can’t move. In the end it normally looks like this:
If you’re on a bike trip you normally have 4 bike panniers with you, but the airline only allows to carry one luggage. Either the airport offers to wrap them or you go to a grocery store and buy plastfoil for food. It is very thin so you need 60m. It is not really Eco-friendly but normally you get it everywhere and it is cheap.
First start to wrap the two biggest panniers:
I use a rope to connect them and make sure not to loose one. After the two are in a good shape (ca. 25m) put the smaller panniers on the side and start to wrap the whole thing:
Another possibility is to use 2 Ikea bags.
Have a safe trip!
Several people asked me about the status about the Active Directory Domain Controller support of Samba in Fedora. As Fedora and RHEL are using MIT Kerberos as its Kerberos infrastructure of choice, the Samba Active Directory Domain Controller implementation is not available with MIT Kerberos at the moment. But we are working on it!
Günther Deschner and I gave a talk at the SambaXP conference about our development efforts in this direction:
I hope this helps to understand that this is a huge task.
I’ve updated my PGP key. I’ve signed it with my old key. You can find the key gro.k1500568751limot1500568751pyrc@1500568751nsa-D15005687513E4101500568751CCx01500568751-gpg_key.asc">here.
The fingerprint of the new key is: 8DFF 53E1 8F2A BC8D 8F3C 9223 7EE0 FC4D CC01 4E3D
We just released version 4.0.0 of Samba. About 10 years in development this is a huge milestone. It is the first version that can be a domain controller in an Active Directory domain!
I wanted to reimplement kio_sftp with libssh since some month. This week is another openSUSE Hack Week. I’m in the SUSE office in Nürnberg with some KDE developers. Dirk Müller helps me with the implementation. I’m normally not a C++ developer so it is a good oppurtunity to get help and things done. More on Wednesday. The weather will be good tommorow so I plan to go climbing.
Yesterday was my last day officially working for Novell. Today is the “Labor Day” in Germany and I’m unemployed now.
Red-Black Trees were originally designed by taking a 2-3-4 tree and unrolling the big nodes into a cluster of simpler binary tree nodes. The 2-3-4 node operations are mapped to binary tree operations. Now Robert Sedgewick presented a new tree called Left-Leaning Red-Black Tree.
A Red-Black tree has a lot of cases you have to consider, especially if you delete a node. This makes the code complex. Left-Leaning Red-Black Trees are a simpler variant of Red-Black Trees. They are simpler to implement (less code) while maintaining the nice features of Red-Black Trees. Less code means faster insertion and deletion, but there are no benchmarks yet.