What is the difference between framerate independent vs framerate dependent?
When should I use a fixed or variable time step?
How can I multiply each item in an array easily with PHP? Is there a program that can make live USBs for any distro, iso, you get the point. I can only find ones that make live USBs for other linux distributions and none for anything else. Difference between Sort and SortBy Unknown apps/processes with number only are shown in data usage A mysterious app named &quot;10102&quot; shows up in my data usage. It bears only the standard Android app icon (the Bugdroid logo with a cube on its torso). From what the graph tells me, it has used 36 megabytes of data in the background and zero on the foreground. I think I haven't uninstalled anything for months. Is it malware? I haven't sideloaded anything and only authorized my laptop as a USB debugger. If it's malware, how do I remove it? I have no idea how to find its package name and 10102 isn't in the list of downloaded apps in settings. I'm running stock &amp; never-been-rooted Android 4.4.4 on Nexus 4. It is quite easy to calculate the total number of functions from a set $X$ with $m$ elements to a set $Y$ with $n$ elements ($n^{m}$), and also the total number of injective functions ($n^{\underline{m}}$, denoting the falling factorial). But I am thinking about how to calculate the total number of surjective functions $f\colon X \twoheadrightarrow Y $.  The way I thought of doing this is as follows: firstly, since all $n$ elements of the codomain $Y$ need to be mapped to, you choose any $n$ elements from the $m$ elements of the set $X$ to be mapped one-to-one with the $n$ elements of $Y$. This results in $n!$ possible pairings. But the number of ways of choosing $n$ elements from $m$ elements is $\frac{m!}{(m-n)!\,n!}$, so the total number of ways of matching $n$ elements in $X$ to be one-to-one with the $n$ elements of $Y$ is $\frac{m!}{(m-n)!\,n!} \times n! = \frac{m!}{(m-n)!}$.  Now we have 'covered' the codomain $Y$ with $n$ elements from $X$, the remaining unpaired $m-n$ elements from $X$ can be mapped to any of the elements of $Y$, so there are $n^{m-n}$ ways of doing this. Therefore I think that the total number of surjective functions should be $\frac{m!}{(m-n)!} \, n^{m-n}$.  Is this anything like correct or have I made a major mistake here? I am looking to build a camera trap for wildlife viewing, able to capture pictures (or even videos) in decent quality to be able to identify distinct features. I do however need to be able to see the pictures in real time, so the camera would need some sort of wireless connection to a receiving device such as a phone.  I thought of using an FPV setup as used in drone racing, but the quality and range seems to be quite low, and the strengths of an analog signal seem to be latency and fps, which are both not important to me. It would be nice to have some sort of digital signal to be able to do some editing, such as storing pictures. It would also be cool to connect several cameras to one device.  Are there any solutions to this problem? Would a raspberry pi/arduino setup work in some way? Thanks! Why do my xmodmap binds involving AltGr only work on some keys? I want to remap my AltGR+Right_Windows but I can't figure out how. No matter what I try, pressing the right windows key emits the name keysym when right alt is pressed or not.  These are the contents of the xmodmap file I am testing right now. In my keyboard, 38 is the keycode for "a", 48 is the keycode for aportrophe/doublequote and 134 is the keycode for the right windows key.  keycode  38 = 1 2 3 4 5 6 7 8 keycode  48 = 1 2 3 4 5 6 7 8 keycode 134 = 1 2 3 4 5 6 7 8   When I press Right_Alt+apostrophe, it outputs 5 but Right_Alt+a and Right_Alt+Right_Windows give 1 (both when right alt is pressed and when it isn't) which is not what I wanted.  My current keyboard layout is us(alt-intl) and the right alt is apparently set up to act as AltGr / Iso_Level3_Shift. The output of xmodmap -pm is the following:  xmodmap:  up to 4 keys per modifier, (keycodes in parentheses):  shift       Shift_L (0x32),  Shift_R (0x3e) lock        Caps_Lock (0x42) control     Control_L (0x25),  Control_R (0x69) mod1        Alt_L (0x40),  Meta_L (0xcd) mod2        Num_Lock (0x4d) mod3       mod4        Super_L (0x85),  Super_R (0x86),  Super_L (0xce),  Hyper_L (0xcf) mod5        ISO_Level3_Shift (0x5c),  Mode_switch (0xcb) A user just posted his question a second time here on meta after the first was closed as a duplicate. I wrote a comment on the second post, explaining that the answer to his question is in the linked duplicate and that he shouldn't circumvent the closure process by asking a second identical question.  When the second post was closed as a duplicate my comment was automatically deleted. As far as I understand this is a heuristic that removes obsolete comments, which it considers every comment that contains a link to one of the duplicates.  This heuristic is too aggressive and removes comments that go beyond "Duplicate here: link". I suggest that it should be changed to only remove the default duplicate comment, and not any comment that was edited by the owner nor any free-form comment that happens to include a link to the duplicate.  This also triggers for any comment that contains the word "duplicate" and link to any question, not only the question being chosen as duplicate, which makes this much worse. Everytime, I read about blackbody, I always get confused at the point where it is written     Under thermal equilibrium conditions , the blackbody radiation depends only on temperature. ..... . At equilibrium , electromagnetic waves bounce around with the walls of the cavity.   What is this equilibrium all about? Why is it important here?? If there is thermal equilibrium, why does the body radiate?? Please help. Get full path of the files in PowerShell For $p$ prime, show that $\Phi_{p^n}(x) = 1 + x^{p^{n-1}} + x^{2p^{n-2}} + \dots +x^{(p-1)^{p^n-1}}$ Well I attempted to try this but I failed to solve it: So $$\Phi_{p^{n}}(x)= \frac{x^{p^{n}} - 1}{\Phi_{1}(x) \Phi_{p^{2}}(x) \dots \Phi_{p^{n-1}}(x)}$$  Now I'm just stuck here. I saw a result somewhere on the net that said $\Phi_{p^n}(x) = \Phi_p(x^{p^{n-1}})$. I would just use that, but I don't see why that result is true or know how to show that's true.  How do I approach this? What's is the origin of Orbital Angular Momentum of electrons in atoms? Consider the Hydrogen 1s electron. We know that, in the quantum picture, the electron isn't orbiting or rotating at all, rather we simply state that the electron is spread over the entire space with the probability of finding it being maximum a radial distance $R$ (=Bohr radius) away from the nucleus. This helps explain why the electron does not radiate EM radiation while in the atom.  But, with this understanding, I do not understand the source of the orbital angular momentum. Is it intrinsic like the spin? A proof for the inequality $\sum_{i=0}^{t-2}{\frac{1}{t+3i}} \leq \frac{1}{2} $ for all $t \geq 2$ I'm struggling with proving the following inequality: $$\sum_{i=0}^{t-2}{\frac{1}{t+3i}} \leq \frac{1}{2}$$  for all $t \geq 2$. I think it is monotonic non-increasing in $t$, which would suffice.  Thanks in advance! Can you launch Remote Desktop via URL? Any way to send a personal message to another user? There has been quite a few times that I wished I could send a message to another user on SO - not ask a question for everyone to see, but just a short message informing them of something or requesting them to do something.  Are there any plans to allow this to happen in the future?  Related: How can I use the "signature" function in Preview on Mac Mini with no camera? I have a Mac Mini with no attached camera. I would like to use the feature of Preview that allows you to insert a signature. This relies on taking an image of your signature using an isight/facetime/webcam. I do not have on.  I do have a MacBook pro on which I use the signature function. Is there a way to copy a file from the the MacBook Pro to the Mac Mini to enable this function on the Mini? Calculating a spherical polygon centroid Isomorphism involving Eilenberg-Maclane space, Tors. Let $\pi$ be a group and let $K(\pi, 1)$ be a connected CW complex such that $\pi_1(K(\pi, 1)) = \pi$ and $\pi_q(K(\pi, 1)) = 0$ for $q \neq 1$. Does there exist an isomorphism between $H_*(K(\pi, 1); A)$ and $\text{Tor}_*^{\mathbb{Z}[\pi]}(A, \mathbb{Z})$? As mentioned on :     For something that can be done so   easily by accident, there should be   the ability to undo mistakes.   I know that I have clicked several times on a comment up-vote without actually wanting to.  I would suggest being able to cancel the up-vote (maybe only for a couple of minutes or even less than a minute, no problem, as long as I can undo a miss-click). How are shorter power-plays counted in power play percentage?