I really like the storyline, and I kinda miss it since the series hasn't released a new chapter in a long time.  Why is there no progress anymore on H.O.T.D?
I was really happy when I heard that HoTD would be continued. And even happier when the first new chapter actually came. but now after several months of waiting there still has been no other chapter. So my question is, has HoTD gone on hiatus again ?
How to panelize gerber files? I am planning on ordering a panel with four different designs on it. Two were made in Altium, while the other two were made in Eagle.  Altium has a great tool for panelizing boards designed in it, but I don't believe it can put designs from other programs on the panel.  How can I panelize these PCBs? How does new shield system work? After the upgrade I can't figure out how the new shield system works. I have the option to discard the shield, and I notice I have a new potion in the inventory.  More importantly, I got attacked (and lost) twice in a short amount of time and don't have a shield. When do you now get shield? I am trying to auto-mount my NFS drives, but it doesn't work too well sadly.  What does work is mounting from CLI:  me@client:/$ sudo mount 192.168.178.4:/mountdir /mnt/mountdir me@client:/$ mount -t nfs 192.168.178.4:/mountdir on /mnt/mountdir type nfs (rw,addr=192.168.178.4)   when I try to add mountdir in the fstab, I cannot mount it due to "protocol not supported" (which seems strange as I can mount it)  $ sudo mount films_d3 mount.nfs: Protocol not supported   So there might be something wrong with my fstab entry. This is my current entry:  192.168.178.4:/mountdir /mnt/mountdir  nfs auto,_netdev,noatime,nolock,bg,nfsvers=4,intr,tcp,actimeo=1800 0 0   During startup I also get this error twice: I was trying to fix the mount-from-fstab first, then worry about that, but nevertheless this might be a different problem:  init: idmapd-mounting (/mnt/kazemat/films_d3) main process (445) killed by TERM signal   This seems to be before the eth0 is initialised, while I thought the "_netdev" option would make the entry wait for the network to be up?  can anywone see the mistake in my fstab entry? I read a book a while ago in which a device is invented which opens up "tunnels" back through time. These tunnels cannot be traveled through, but can be used to view what happened in the past. I believe it starts out narrating the invention of the device, then skips ahead to after it is widely in use. There is another device created, a cloak of sorts,  which hides the user from the view of someone using the tunnel device. Does this ring a bell with anyone? Ackermann function - how to calculate the number of times it calls itself Purely for my own amusement I've been playing around with the .  The Ackermann function is a non primitive recursive function defined on non-negative integers by:  $A(m,n) = n+1$, if $m=0$  $A(m,n) = A(m-1,1)$, if $m&gt;0$ and $n=0$  $A(m,n) = A(m-1,A(m,n-1))$, if $m&gt;0$ and $n&gt;0$  I'm not interested in values of the function itself, rather I'm interested in the number of recursions the function takes to arrive at a value. For example:  $A(1,2) = A(0,A(1,1)) = A(0,A(0,A(1,0))) = A(0,A(0,A(0,1))) = A(0,A(0,2)) = A(0,3) = 4$  That's 6 steps, so if we define $RA(m,n)$ as the number of recursions to calculate $A(m,n)$, then $RA(1,2) = 6$.  I made a short Excel macro to calculate $RA(m,n)$ for any given $m$ and $n$. The problem I have is that $RA(m,n)$ grows even faster than $A(m,n)$ and I quickly run out of stackspace. The table below shows $RA(m,n)$ for very small values of $m$ and $n$. The numbers shown for $RA(3,10)$ and $RA(4,1)$ are the number of steps before crashing!    A formula for $RA(1,n)$ is trivial, and it is relatively easy to see that $RA(2,n) = 5(n+1) + 4n(n+1)/2$.  So my questions: can anyone see an explicit formula for $RA(3,n)$? More generally, does a formula exist for $RA(m,n)$, in the same way that $A(m,n)$ can be expressed using Knuth arrows?   For the low values shown of $m$ and $n$, $RA(m,n)$ looks about order of magnitude larger than $A(m,n)$. Can we prove that $RA(m,n) &gt; A(m,n)$ for all $m,n$. Intuitively, it should be.  For bonus points, can $RA(m,n)$ be expressed in terms of $A(m,n)$? Get URL of ASP.Net Page in code-behind Okay setting the scene. I have three tables, (Table1, Table2 and DataTable) and I want to insert into Table1 and Table2 using DataTable as source. So for every row in DataTable I want a row in Table1 and Table2, and Table2 needs to have the inserted id (PK) from Table1...  If I were to do this...  INSERT INTO Table1 SELECT A, B, C FROM MyTable INSERT INTO Table2 SELECT IDENTITY_INSERT(), D, E, F FROM MyTable   I'd get the ID of the last inserted record into Table1.  Is a CURSOR or WHILE loop the only ways to do this? The repository 'http://ppa.launchpad.net/mdeguzis/libregeek/ubuntu focal Release' does not have a Release file count() returns a different amount than a simple select Why couldn't River Song's memories bring back The Doctor in the rebooted universe? In the season 5 finale of Doctor Who, in the wedding ceremony of Amy, River Song showed up outside the door. Moments later, we discovered that she gifted Amy her blank diary which was supposed to contain information about The Doctor. It means River Song remembered The Doctor.  Memories of The Doctor was able to bring The Doctor back to existence in the rebooted Spacetime. Why couldn't River Song's memories work? I'm looking for a way to access raster layers in an Esri File-GeoDatabase without using ArcObjects or ArcPy, specifically I would like to access the raster layers with GDAL. I understand that the GDAL FileGDB and OpenFileGDB give access to vector datasets within File-GeoDatabases, and that ESRI's own FileGDB C++ API does not support raster access.   Is anyone out there aware of any open source solutions? Encrypt home drive after installation I declined to encrypt to my home drive whilst installing ubuntu.  Is it possible to encrypt it after installation?  if so, how? How do I import a dxf? I am a noob with blender. Please be as specific as possible. College students have been doing this for me, but I am unable to understand them. Finding the variable name passed to a function Let me use the following example to explain my question: public string ExampleFunction(string Variable) {     return something; }  string WhatIsMyName = &quot;Hello World&quot;; string Hello = ExampleFunction(WhatIsMyName);  When I pass the variable WhatIsMyName to the ExampleFunction, I want to be able to get a string of the original variable's name. Perhaps something like: Variable.OriginalName.ToString()  Is there any way to do this? MonoTouch.Dialog: How to set limit of number of characters for EntryElement "Where will you go" vs. "Where you will go" Which sentence is correct between these?      Where will you go?     Where you will go? Encrypting a key with the same key, for instance using AES I am new to crypto and trying to understand if it would be insecure to use a cipher such as AES to encrypt a key with the same key. If it is insecure, then why would it be insecure?  Basically, something like this:  encrypt(key, key)   What happens when both key and message are the same (128 bits)?  The obvious question would be why would I want to do that. If I have a secure channel to send the key, why encrypt it? My question is more for understanding. CK2 is a big game with lots of variables, so I'll stick to adding them upon being requested to minimize the hassle.  Anyway, let's say that you have a lot of children and the oldest one claims all the land according to laws of succession. After the father dies, the circumstances will obviously piss off a lot of people (in my case that would be 6 out of 8 vassals and 4 siblings with an opinion of -50 and below one of which is a sister married to the Basileus of the Byzantine friggin' Empire, a case of excommunication, 4 failed assassination attempts under 3 years... and lots and lots of vikings). Let's also say that the current playable character is completely incompetent compare to the next sibling in line.  So, what would be the most optimal methods to off myself without further screwing over the countryside so the next heir in line has to fix it (if we assume that said heir is actually capable of doing so)?  This is my list of DLCs (not including music and unit packs):   Charlemange Legacy of Rome Sword of Islam The Republic Way of Life How do I list all files under a directory recursively and sort the output by modification time?  I normally use ls -lhtc but it doesn't find all files recursively. I am using Linux and Mac.  ls -l on Mac OS X can give  -rw-r--r--    1 fsr  user      1928 Mar  1  2011 foo.c -rwx------    1 fsr  user      3509 Feb 25 14:34 bar.c   where the date part isn't consistent or aligned, so a solution have to take this into account.  Partial solution  stat -f "%m%t%Sm %N" ./* | sort -rn | head -3 | cut -f2-   works, but not recursively. iPhone App CrashReport