how to make a password list like the icloud keychain using crunch

i changed today the admin password of my server. To make the password difficult I used the password generator of my iPhone (icloud keychain), but now i can’t log in. Have no idea what happend and i cant also reset my password

so i found a brute force attack software on kali linux which probarly works i think, have seen a few videos on youtube. But to start the attack i need a list off passwords using crunch. i dont know much about programming, maybe you guys can help me? please?

a sample of the password:

vuhjyH-4jocju-bubkuj

as you can see the 5 first charachters are letters, then comes a minus (-) etc. THERE IS 1 CAPITAL LETTER INSIDE AND 1 NUMBER nothing more and less. no other symbols. the place of the number and the capital letter changes

thanks a lot

Are there techniques to know how many times loops like these will run?

How do you evaluate how many times some loops will run, when you start to complicate the boundaries conditions? For example, take this function:

def f(n):     s = 0     for i in range(n):         for j in range(i, (n + i**2) // (n - i) + 1):             s += 1     return s  for i in range(10):     print(i, "->", f(i)) 

Output:

0 -> 0 1 -> 2 2 -> 5 3 -> 10 4 -> 17 5 -> 28 6 -> 42 7 -> 60 8 -> 83 9 -> 109 ``` 

How to assign custom action to mouse middle click (something like libinput-gestures for mouse)?

I am running Ubuntu 18.04.2 and I want to assign a cstom action to middle click of my mouse. How that can be done? for example libinput-gestures (https://github.com/bulletmark/libinput-gestures) allows you to set custom actions to your trackpad gestures. Is there something like that for mouse also?

comp runs like its stuck in a windows update

New at this and not sure how to ask this accurately/succinctly. Occasionally my machine runs like an old windows box stuck in an update. The mouse hangs, doesn’t respond to movement or clicks, or the pointer disappears. Is there a way I can monitor activity to see what’s hogging resources? Is that even the right approach? running Ubuntu 18.04.3 LTS machine is a Dell SFF from about 2013. i5 2400 quad core 4gb ram 250gb hdd

Creating a “bubble” UI layout like used in the Apple Music app

I’ve been thinking about experimenting with a layout like the one used in the Apple Music app on iOS.

The interface is the “bubble” interface that is used to choose your preferences etc…

enter image description here

But I don’t really know where to even start with this. Is there a name for the general idea of creating these sort of semi-physics based layouts?

Would love to know what it is I need to search for in order to learn how these work.

I’d be writing it on iOS in Swift but looking more for the name of this sort of interface so I can learn the principals behind creating it.

Thanks

Side by side dynamic menu that looks like a table

I’ve seen a pretty uncommon UI design element that looks like a table and each cell is selectable. Usually the first cell you select in the first column changes the list in the next column and likewise with the next column.

I’ve looked for select table, table of radio buttons, and more.

Sorry no code, although it’s implied that some code updates the subsequent columns.

I expect it to behave like a table of radio buttons basically, but “table of radio buttons” doesn’t yield the UI element that I have seen before.

Which algorithm would be better to integrate “step” like functions

I have a function f[wr], in which the appearance is step like, first of all, the NIntegrate function is not handling this function, so I decided to do the integration algorithm by hand.

enter image description here

Without joined in plot

I have tried to integrate f[wr] using Riemann’s sum

data[mu_] :=   Module[{Te = 300., sum = 0., sum1 = 0., kb = 8.61*10^-5, a},    Do[    sum = sum + (f[wr] 0.01);     sum1 = sum1 + (f[wr] (wr - mu) 0.01);, {wr, mu - 30 kb Te,      mu + 30 kb Te, 0.01}]; sum1/(Te*sum)] 

and then, evaluate it with

Table[{data[mu],{mu,-1,1}] 

I think the results could be better if I try other algorithm. Could you suggest one?

edit: f[wr] algorithm https://pastebin.com/tfbGmhDa