Does Furious Finish work with both hits of Cleaving Smash?

Cleaving Smash (from Weapon Trick – Two-Handed Weapon):

When you use Cleave, you can add the additional damage from Vital Strike to both your initial and your secondary attacks. If you also have the Greater Vital Strike feat, you can instead add the damage from Improved Vital Strike to both your initial and your secondary attacks.

Furious Finish:

While raging, when you use the Vital Strike feat, you can choose not to roll your damage dice and instead deal damage equal to the maximum roll possible on those damage dice. If you do, your rage immediately ends, and you are fatigued (even if you would not normally be).

Does Furious Finish apply to both hits of Cleaving Smash, or does rage suddenly end mid-swing?

Or are they not compatible at all since Cleaving Smash doesn’t directly state that you’re actually using the Vital Strike "feat", only that you’re getting all the benefits of it?

If I expanded all my movement, and Zephyr strike increase it by 30ft after my attack, can I finish my movement with the increased speed?

My character is a Ranger with the spell Zephyr Strike, which increase my speed by 30ft after the attack. If I used all my movement to reach the ennemy, can I use the increased 30ft to move away after my attack?

What are the repercussions of being able to finish a short rest in only 10 minutes instead of taking 1 hour?

Currently we are playing a horror adventure in D&D 5e. Due to circumstances (beings locked in a haunted house, rooms changing just when we close the doors, etc.), a 1-hour rest is hardly possible.

Our DM ruled that short rests can be as short as 10 minutes. The obvious result is that we can take it. What are other changes that we, both players and DM, should be aware of?

If it matters, party consists of Lore Bard, Vengeance Paladin, Chaos Sorcerer and Divination Wizard, all level 3.

Can Improved Cleaving Finish proc on itself?

Improved Cleaving Finish

If you make a melee attack, and your target drops to 0 or fewer hit points as a result of your attack, you can make another melee attack using your highest base attack bonus against another opponent within reach.

The way I understand it, Cleaving Finish is a passive proc. So, if I make a melee attack, kill Goblin A, I may immediately attack Goblin B. If this attack kills Goblin B, may I attack Goblin C? (D, E, F … )

(Note that Improved Cleaving Finish explicitly states that you can use Cleaving Finish any number of times per round)

How to Get Backups & Restores Start and Finish Times?

I backup my databases from prod environment to file server. After taking my backups, i restore them to my report server. And i want to know that if i can get information about when backup and restore has started and finished or not. How can i query how long it takes to complete its each process?

Wait Command so Unrar will finish the first .rar then move to next

Below is the command user3140225 helped me out with and it works fine:

find /home/username/source/directory/ -type f -name "*.rar" -exec unrar e -o- {} /home/username/copy/extracted/to \; -delete && rm -r /home/username/source/directory

Except I noticed it is uraring the .rar files from the separate folders (Folder1, 2) all at one time.

My structure is

• SourceDirectory

Folder1

File .rar

Folder2

File .rar

I would like the one unrar to finish first before it goes on to the next one.

I am using cronjobs to run these commands. So if there is another way I would be grateful.

DP for Weighted Interval Scheduling: Can we sort start time in ascending order instead of the finish time?

Problem In the weighted interval scheduling problem, we want to find the maximum-weight subset of nonoverlapping jobs, given a set $$J$$ of jobs that have weights associated with them. Job $$i \in J$$ has a start time $$s_i$$, a finish time $$f_i$$, and a weight $$w_i > 0$$. We seek to find an optimal schedule — a subset $$\cal{O}$$ of non-overlapping jobs in $$J$$ with the maximum possible sum of weights.

Dynamic Programming Solution In almost all textbooks or materials I could get access to, a DP algorithm is given as follows: First all jobs are sorted in order of ascending finish time: $$f_1\le f_2 \le \dots \le f_n$$. Let $$OPT(i)$$ be the maximum total weight of non-overlapping jobs in $$\{1,2, \cdots ,i\}$$, $$p_i$$ be the largest index $$j < i$$ such that job $$j$$ and $$i$$ are compatible. Then we see that $$OPT(i) = \max\{{w_i + OPT(p_i), OPT(i-1)}\}$$

My question I think I could understand why this DP algorithm works. However I didn’t see the necessasity for the sorting step. What if we sort the finish time in ascending order instead? As far as I can see, it’s also correct.

MAAS using PXE won’t finish enlisting

Following the instructions in https://maas.io/install on a blade server I got stuck on the enlisting step. The PXE booting loads the image but after some reasonable time waiting nothing else happens. The blade is not shown in the Machines section. This is the PXE boot screen:

This is the server log when the blade PXE boots

Blade 1, where MAAS is installed is Ubuntu 18.04.3 LTS (GNU/Linux 4.15.0-58-generic x86_64) and MAAS is 2.4.2-7034-g2f5deb8b8-0ubuntu1

I followed these steps for installation:

• Installed the maas package with sudo apt install maas