I want to create the shortcuts:    Super: Run dmenu  Super&#8592; Left arrow: Move current window to the left   I have both of them working, however when I depress  Super it opens dmenu right away. When I then press &#8592; Left arrow, it moves the window.  Instead, I want pressing  Super and &#8592; Left arrow without releasing  Super to move the window. dmenu should only start when  Super is pressed and released on it's own.  Is this possible? I know that it works well in gnome-shell and cinnamon, so there has to be a way.
I want to have my super key start dmenu. I have set it as a keyboard shortcut in my rc.xml as follows:  &lt;keybind key="0xffeb"&gt;       &lt;action name="Execute"&gt;         &lt;command&gt;dmenu_run&lt;/command&gt;       &lt;/action&gt; &lt;/keybind&gt;   I tried specifying it in the key attribute as W, W-, and 0xffeb, but none of these worked. W responds to pressing the letter w, and the others appear to do nothing.  I want the shortcut to trigger when the super key is pressed and released on it's own. Is this possible?    This is  from super user as per the . I've read this question: , but I didn't see any useful information in it.
Do we have any other evidence other than red shift? Is anyone trying to disapprove inflation? Also, can red shift occur because of large distance, not only because two objects are going farther from each other? How do I change my Stack Exchange password? How do I change my password?  I have a Stack Exchange account but can't seem to find the option to change my password.  Help please? Move item to folder when added/edited (SP2013 or O365) What is the difference between buy and purchase If I need to use Blender within a colour-accurate workflow, what do I have to do to set that up (including hardware calibration, etc)? The standard files/tools that report memory seem to have different formats on different Linux distributions. For example, on Arch and Ubuntu.   Arch  $ free               total        used        free      shared  buff/cache   available Mem:        8169312     3870392     2648348       97884     1650572     4110336 Swap:      16777212      389588    16387624   $ head /proc/meminfo  MemTotal:        8169312 kB MemFree:         2625668 kB MemAvailable:    4088520 kB Buffers:          239688 kB Cached:          1224520 kB SwapCached:        17452 kB Active:          4074548 kB Inactive:        1035716 kB Active(anon):    3247948 kB Inactive(anon):   497684 kB  Ubuntu  $ free              total       used       free     shared    buffers     cached Mem:      80642828   69076080   11566748    3063796     150688   58358264 -/+ buffers/cache:   10567128   70075700 Swap:     20971516    5828472   15143044   $ head /proc/meminfo  MemTotal:       80642828 kB MemFree:        11565936 kB Buffers:          150688 kB Cached:         58358264 kB SwapCached:      2173912 kB Active:         27305364 kB Inactive:       40004480 kB Active(anon):    7584320 kB Inactive(anon):  4280400 kB Active(file):   19721044 kB    So, how can I portably (across Linux distros only) and reliably get the amount of memory—excluding swap—that is available for my software to use at a particular time? Presumably that's what's shown as "available" and "MemAvailable" in the output of free and cat /proc/meminfo in Arch but how do I get the same in Ubuntu or another distribution? I've seen the identity $\displaystyle \sum_{i \mathop = 0}^n \binom n i^2 = \binom {2 n} n$ used here recently.  I checked for proofs here   I couldn't have figured out the combinatorial proof by myself, and the inductive proof assumes you already know the answer...  So my question is : do you know how to prove directly through computation that $\displaystyle \sum_{i \mathop = 0}^n \binom n i^2 = \binom {2 n} n$ ? Firefox running with rare arguments I got this output from ps aux|grep firefox command:  $ ps aux|grep firefox auraham   5443 17.3 11.0 2600628 426484 ?      Sl   18:10   0:54 /usr/lib/firefox/firefox auraham   5496 24.0 17.9 2558108 691700 ?      Sl   18:10   1:15 /usr/lib/firefox/firefox -contentproc -childID 1 -isForBrowser -intPrefs 5:50|6:-1|18:0|28:1000|33:20|34:10|43:128|44:10000|49:0|51:400|52:1|53:0|54:0|59:0|60:120|61:120|91:2|92:1|106:5000|117:0|119:0|130:10000|155:24|156:32768|158:0|159:0|167:5|171:1048576|172:100|173:5000|175:600|176:4|177:1|186:2|200:60000| -boolPrefs 1:0|2:0|4:0|26:1|27:1|30:0|35:1|36:0|37:0|38:0|41:1|42:1|45:0|46:0|47:0|48:0|50:0|55:1|56:1|57:0|58:1|62:1|63:1|64:0|65:1|66:1|67:0|68:1|71:0|72:0|75:1|76:1|80:1|81:1|82:1|83:0|85:0|86:0|87:1|88:0|93:1|94:0|100:0|105:0|108:1|109:0|111:1|112:1|114:1|118:0|120:0|122:0|124:1|125:1|131:0|132:0|133:1|135:0|146:0|153:0|154:0|157:1|160:0|162:1|164:1|165:0|170:0|174:1|179:0|180:0|181:0|182:1|183:0|184:0|185:1|188:1|192:0|193:0|194:1|195:1|196:0|197:1|198:1|199:1|201:0|202:0|204:0|212:1|213:1|214:0|215:0|216:0| -stringPrefs 3:7;release|134:3;1.0|151:332;  ¼½¾ǃː??։֊׃״؉؊٪۔܁܂܃܄ᅟᅠ᜵           ???‐’․‧??????? ‹›⁁⁄⁒ ⅓⅔⅕⅖⅗⅘⅙⅚?⅜⅝⅞⅟∕∶⎮╱⧶⧸⫻⫽⿰⿱⿲⿳⿴⿵⿶⿷⿸⿹⿺⿻　。〔〕〳゠ㅤ㈝㈞㎮㎯㏆㏟꞉︔︕︿﹝﹞?．／｡ﾠ???￼�|152:8;moderate| -greomni /usr/lib/firefox/omni.ja -appomni /usr/lib/firefox/browser/omni.ja -appdir /usr/lib/firefox/browser 5443 true tab auraham   5694  0.0  0.0  15444  1092 pts/2    S+   18:15   0:00 grep --color=auto firefox   According to , this error occurs after firefox crashes. However, every time I run Firefox again, that large line of arguments appears too.  I already try these things:   Run Firefox with addons disabled Reinstall Firefox (sudo apt-get purge firefox; sudo apt-get install firefox)   However, it did not work.  Is it possible to remove such a line of arguments? Opportunity attack when moving in and out of range of a creature in the same move? Let's say I'm 10ft away from an enemy. In my turn, I choose to move 5ft to get close enough to attack, I do attack, then I use my remaining movement to move out of range of the enemy. Does this still allow them an opportunity attack? We are Indian passport holders, with valid visas for Canada. Plan is to take the EgyptAir flight Mumbai to Toronto, via Cairo. Problem is Egypt embassy website says we don't need Transit Visa if transit is up to 12 hours but here transit is 14 hours.    Has anyone with a Indian passport traveled this route? What was your experience at Cairo? Did you need a transit visa? I want to work on a small app that will use Telegram from within Ubuntu but wanted to first know if there was already a work in progress for this since I noticed that, for example, pidgin has support for WhatsApp. With this in mind, is there a messenger app that has support (even basic support) for Telegram from within Ubuntu. Changing affiliation on publication I am moving from one job to another (postdoc to tenure track) this summer and I have papers in several stages of being written, these go from handwritten notes with all the necessary arguments to under revision at a journal. All the papers will have my new contact information put on them but where is the line for changing affiliation? It seems obvious to me that the one that is still in the handwritten notes stage will get the new affiliation and that the ones under revision won't. So somewhere in between is a line.   Where is it?  There are some similar questions so far (see  and  but they do not seem to be quite the same situation since I am not changing fields and the appointments are not concurrent. Why is there an unexplainable gap between these inline-block div elements? Let's re-evaluate the Question Timer I know this seems like a good idea, but this far into the game you should be able to tell from network behavior that I'm not a spammer…  I had a compound question. I broke it up because breaking it up was possible—it probably isn't even necessary in that it wouldn't otherwise get closed. Now I doubt either of my questions will be easily answered, but it stinks when you want to run (irl) to have to wait on a question timer which means posting one at a later time. Can't we fight spammers more effectively in a different way?  You know it's my intent to ask the question (or you'd give me a captcha). You also know that historically my questions have been   Can't we find a way to make this not stupid? Proving that a Binary Tree of $n$ nodes has a height of at least $\log(n)$. Discriminant analysis vs logistic regression I found some pros of discriminant analysis and I've got questions about them. So:     When the classes are well-separated, the parameter estimates for   logistic regression are surprisingly unstable. Coefficients may go to   infinity. LDA doesn't suffer from this problem.      If number of features is small and the distribution of the predictors   $X$ is approximately normal in each of the classes, the linear   discriminant model is again more stable than the logistic regression   model.    What is stability and why is it important? (If logistic regression provides a good fit that does its job, then why should I care about stability?)      LDA is popular when we have more than two response classes, because it   also provides low-dimensional views of the data.    I just don't understand that. How does LDA provide low-dimensional views? If you can name more pros or cons, that would be nice. Integer solutions to combinations of floating point numbers Imagine two kids each sitting in the center of their own tilt-a whirl®, each holding steady a flashlight (or laser) whose beam is parallel to the deck.  Each machine rotates and precesses (we'll leave out nutation) at different, real, rates.  How do we determine the least number of rotations to alignment, for each kid. If you prefer another analogy: Saturn and Jupiter orbit with different (real) periods.  How many orbits for each until conjunction in precisely the same position in space?  Simplify by assuming circular, observer-centric, orbits. specifically solutions to: aC1 + bC2 = N where a, b, N are positive integers of your own choosing and C1, C2 are constant, unique, positive, non-integer(real) numbers where C1 &lt; C2. I am hoping to avoid rigorous computational methods involving modulus tests. Hope I clarified the ambiguities. Thanks, @DonThousand the Bezout identity looks interesting. Is "Five dollars is all I have" correct? How do I increase my code coverage, or why can't I cover these lines? This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the  tag.  This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources:   How is code coverage obtained and calculated? How do I increase my coverage?  Why can't I cover these lines? Why isn't the body of my loop or conditional statement covered? Recurrence relation for the integral, $ I_n=\int\frac{dx}{(1+x^2)^n} $ Express recurrence relation  of the integral  $$ I_n=\int\frac{dx}{(1+x^2)^n} $$  [My Answer]  $$ I_n = \int\frac{1+x^2}{(1+x^2)^n}dx-\int\frac{x^2}{(1+x^2)^n}dx $$  $$ I_n=I_{n-1}-\int x\cdot\frac{x}{(1+x^2)^n}dx $$  $$ I_n=I_{n-1}-\frac{x}{2(1-n)(x^2+1)^{n-1}}+\frac{1}{2(1-n)}I_{n-1} $$  $$ I_n=\frac{2n-3}{2(n-1)}I_{n-1}+\frac{x}{2(n-1)(x^2+1)^{n-1}} \ \ \ \ (n&gt;1) $$  $$ I_1=\arctan(x) $$  Is my answer correct?