I've been active in SO for about 3 months and i was wondering why sometimes SO show those top 5% this month and others top 2% this quarter.      My questions are:   How SO decide to show monthly, quarterly, etc. Which one is better to show? (if there is any) Are this rank links showed to every user with enough rep? If so, how much rep is "enough"?
I always wondered on what algorihm the best league of mine is chosen.    I am in the 0.16% of this quarter. That is rank 171 this quarter. But I am also ranked 113th this month.  Why is the stat for the quarter displayed when I have a better ranking in the month?
Effects:  +25 attack damage +15% life steal +40% attack speed Passive  Unique: Your attacks deal 5% of the target's current health in physical damage (60 max vs minions and monsters). Active   Unique: Drains target champion, dealing 15% of the champion's maximum Health in physical damage and healing you by the same amount. Additionally you steal 30% of their movement speed for 4 seconds - 60 second cooldown. (500 range)  Cost: 3200g VS.   Effects:  +70 attack damage +12% life steal Passive: Gain +1 attack damage and +0.2% life steal per kill (maximum +30 attack damage and +6% life steal). Half of the bonuses are lost upon death.  Cost: 3200g What is better for what situations, and when should you build BT instead of BotRK and Vice Versa. Which provides more lifesteal, the only variable being the stats of the weapon? I find myself constantly questioning my decision on which weapon to get and would really love some in depth answers. Would be great if any examples given were given from the ADC side of the house. I was running out of space for Windows 10, so I deleted my Ubuntu partition and then combined the free space and added it to the Windows 10 partition into a single partition (the boot partition was untouched). Now all I get when I turn on my computer is:  Error no such partition. &gt;grub rescue   I have tried rebooting, but it did not work. Is there any way to fix it? My idea is that if i reinstalled Ubuntu it may fix it, but I'm not sure. I don't have a Windows repair disk, and I can't make one, but I do have a 4GB USB flash drive. I have a cryptography workshop question I'm having trouble with as follows;  Person A creates a cipher $E_k(m)$ which produces a ciphertext from message $m$ using key $k$. The function inside $E$ is kept secret but the length of $E_k(m)$ is known.  Person B recommends "increasing" security of the cipher by instead doing :   $(E_k(m) \oplus m)\ ||\ (E_k(m) \oplus 1111...11)$      Does this in fact increase security of the cipher or increase new problems.  My thinking is, depending on the function within $E$, xoring the output of the cipher with the plaintext message $m$ could expose the key $k$, meaning the extra complexity is for nothing. Am I on the right track, or am I missing something?  I have tried searching for examples of similar schemes and found nothing (which probably means it's not a good scheme) but I need to justify my answer.   Any steers in the right direction would be greatly appreciated, I'm more than happy to do the research myself just unsure what specifically to look for.   Unfortunately the above context is all I have been provided for this question. When going to any page of  with a new reputation gain, the achievements dropdown keeps showing a new badge green highlight:    And then trying to dismiss the notification by clicking on it gets rid of the green badge notification, but the +5 remains even after I've clicked away from the dropdown. How does QGIS Zonal Statistics handle partially overlapping pixels? There are a couple Stackexchange posts asking this question, but neither of them were sufficiently answered:       I am writing Python scripts that perform essentially the same operations as Zonal Stats, and I have been using Zonal Stats to check my scripts' outputs.   I have noticed that when there are many cells in the polygon being queried, my results match perfectly, but there are discrepancies when there are only a few raster cells in the polygon. The following is an example of this. I am computing "count" for each polygon.  Exhibit 1:   The returned count is 0.45, which looks roughly correct if pixels can be treated fractionally rather than simply in/out.  Exhibit 2:   Similar result; count is 0.39.  Exhibit 3:    With a larger poylgon, now we see the count is exactly 2. Note that there are exactly 2 pixel centers contained in the polygon.  Exhibit 4:    Here, only one pixel center is within the polygon. The count is 1.008, though. If you exclude the polygon area from the pixel whose center is in the polygon, the remaining area is obviously greater than 0.008 of a pixel.   From these exhibits, it seems that Zonal Statistics treats these cases specially. It looks like to me that if there are less than 2 pixel centers within the polygon, it performs some kind of averaging such as polygon_area/raster_cell_area to return the count. I should note that I have 48 of these polygons, and all returned counts greater than or equal to 2 are integers; fractional counts are only returned for &lt;2.  How are these fractional-pixel counts incorporated into the other statistics output by Zonal Stats?    indicates strange behavior with max/min when using large raster cells, and my own testing returns mean values not congruous with simple "pixel center in/out of the polygon." To reiterate, I get exact agreement when the underlying raster contains many pixels within the polygon. I couldn't find any documentation about this, and it may be important when people have never had problems with Zonal Stats but use a coarse raster and remain unaware that there is a different behavior when there are only a few pixels within the polygon. shortcut key to detach a tab in firefox (move tab to new window) In FF, I can move a tab to a new window by either dragging the tab out of the browser, or right clicking the "move to New window" option from the context menu. is there a shortcut key to move the current tab to a new window without dragging or using the context menu, or a way to set one up?  Often, I like to look at 2 tabs side by side, so I drag one out, then hit WINDOWS KEY+→ to put the detached tab on the right, then ALT+TAB to tab back to the main window, then WINDOWS KEY+← to put the main window on the left. It would be great if I could do the whole process on the keyboard.  I checked  documentation and did not find any shortcut key for detaching a tab: Proxy setting for R Disable UpdateOrchestrator Reboot task Easy way to model spiral engraving (knurling) that is usually used on metal for better grip? What is the easiest way to model this diamond grip pattern into a cylinder? Can someone explain how combinatorial proofs work?  I've included an example questions that's been giving me a hard time.  Any insight on the topic would be great.  $$\sum_{k=1}^{n}k{n \choose k} = n2^{n-1}$$  Another one:  $${2n \choose 2} = 2{n \choose 2} + n^2$$  The solution says:  LHS: Pick two people from a pool of n men and n women. RHS: Pick two women, pick two men, and pick one of each.  But I don't see how this applies.  How does $n^2$ show that we're picking "one of each?"  Thanks for the help :) Accessing bpy.context gives a '_RestrictContext' warning, how to fix this? Change all file type associations from one program to another Is it possible to easily change all file type associations that are currently associated with one program to another program in one batch?  In my case, I am trying to change all files types currently associated with Notepad to instead use Notepad++ in Windows 7.  It's a pain to go through Default Programs &gt; Set Associations because after each type the entire list re-populates, taking several seconds.  Is there a way I can do a search and replace in the registry, or something even easier? Prove that $\binom{m+n}{m}=\sum\limits_{i=0}^m \binom{m}{i}\binom{n}{i}$ I need to proof this following equality :  $$\binom{m+n}{m}=\sum_{i=0}^m \left(\binom{m}{i}\binom{n}{i}\right)$$  This is what I did combinatoric proof:  Left : subset with $m$ members from $m+n$  Right : $\binom{m}{i} \rightarrow$ The number of subsets in set $m$ could also be written as $2^m$ AND $\binom{n}{i} \rightarrow$ the number of subsets with $m$ members from set $n$  In case $ n \leq m \implies \binom{n}{i}=2^n$  So this is what I came up with I still can't see why those expression are equal.  Any ideas? Thanks. Batch file to delete files older than N days Extract current viewing parameters from a 3D view? Is "po-TAH-to" an acceptable pronunciation for "potato"? Immortalized in the George and Ira Gershwin song "Let's Call the Whole Thing Off" is the nitpicking of pronunciation differences:      You like potato and I like potahto,   You like tomato and I like tomahto,   Potato, potahto, tomato, tomahto!   According to  and other sources, the English do pronounce tomato as tə-MAH-toh rather than tə-MAY-toh. But this doesn't seem to be the case when it comes to potato.     (From the O.E.D.)           –  Pronunciation: /təˈmɑːtəʊ/     –  Pronunciation: /pəˈteɪtəʊ/   Is "potahto" actually an acceptable way to pronounce potato? Or is the song just wrong? Is convex open set in $\mathbb{R}^n$ is regular? Convex set $A$ in $\mathbb{R}^n$ iff for every $ x,y\in A,0\le\lambda\le1$, then $\lambda x+(1-\lambda)y\in A$.  $U$ is regular open set iff $A$ is open and $int(cl(A)) = A$.  Is convex open set in $\mathbb{R}^n$ is regular? libsensors5 or libsensors-config upgrade problem What are the benefits of modeling in one piece, or as separate parts? Training on the full dataset after cross-validation?