There's an option "This question only pertains to a specific site" when flagging "off-topic".  Is it possible to add a box which asks you about the site that the question belongs to, and auto posts the site recommendation as a comment?  Is it also possible if a majority of off-topic votes think that the question belongs to the same specific site, it auto move it to the site? It seems unclear when the close message only says "this question doesn't power the SE network".
Currently, the only way to ask for something to be migrated to a site that isn't part of the standard migration path is through a custom mod note.  I currently have two active custom mod notes on Stack Overflow that ask for migration that are not standard targets for SO.  I believe the questions could be better answered on another site.  Fortunately, or unfortunately, the questions have been answered, and answers have been up voted and accepted. At this point, a week and a half later, migrating either of the questions would be disruptive to both communities and not necessarily produce a better answer (they've got accepted answers).  The unfortunate part is I really do believe that both questions could have gotten better answers and more attention on another site.  What I would like to see is a more streamlined way to flag for moderator attention for migrations.  The UI would look something like this:    This would allow people to find the proper site easily.  No more "Migrate this to Mathamatica.SE" because, well, that doesn't exist.  Something that I didn't do on this mock up is add a link to the corresponding help/on-topic page for the target site.  Something people could check and click before hitting the submit button.  I don't have this quite right again, because while that shows a "closing for off topic", this is a flag and not a vote to close.    The "flag for migration" is only one part of this though.  The other part would be to make another flag queue style thingy for moderators in which they could look at just migration flags created through the above interface.  By providing the mods with a "just migration" view into the flags, questions that should be migrated can be quickly identified from the multitude of existing flags and handled promptly before the migration would be disruptive.
Could not find class If $E[X|Y]=Y$ almost surely and $E[Y|X]=X$ almost surely then $X=Y$ almost surely How do you find out which program is using too much memory? Ubuntu has been crashing on me recently. I think its because it runs out of memory so I ran the free -m command and found that my memory usage was really high. So then, i ran top to find the culprit, but the displayed processes were using less than 1.5% of memory. How do I know which program is making ubuntu crash/run out of memory? Below is the output:  shafee@shafee-pc:~$ free -m              total       used       free     shared    buffers     cached Mem:          3824       3714        110          0        978       1954 -/+ buffers/cache:        780       3044 Swap:           99          0         99  shafee@shafee-pc:~$ top top - 02:12:14 up  1:24,  2 users,  load average: 0.16, 0.42, 1.49 Tasks: 182 total,   1 running, 181 sleeping,   0 stopped,   0 zombie Cpu(s):  2.9%us,  1.9%sy,  0.3%ni, 79.3%id, 15.5%wa,  0.0%hi,  0.2%si,  0.0%st Mem:   3916708k total,  3803848k used,   112860k free,  1002308k buffers Swap:   102396k total,        0k used,   102396k free,  2001852k cached    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND              4200 root      20   0  289m  53m  38m S    2  1.4   1:06.45 Xorg                 5590 shafee    20   0 19348 1368  956 R    2  0.0   0:00.01 top                     1 root      20   0 24124 2136 1264 S    0  0.1   0:02.05 init                    2 root      20   0     0    0    0 S    0  0.0   0:00.00 kthreadd                3 root      20   0     0    0    0 S    0  0.0   0:24.23 ksoftirqd/0             6 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/0             7 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/1             9 root      20   0     0    0    0 S    0  0.0   0:00.11 ksoftirqd/1            11 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/2            13 root      20   0     0    0    0 S    0  0.0   0:03.89 ksoftirqd/2            14 root      RT   0     0    0    0 S    0  0.0   0:00.00 migration/3            16 root      20   0     0    0    0 S    0  0.0   0:00.16 ksoftirqd/3            17 root       0 -20     0    0    0 S    0  0.0   0:00.00 cpuset                 18 root       0 -20     0    0    0 S    0  0.0   0:00.00 khelper                19 root       0 -20     0    0    0 S    0  0.0   0:00.00 netns                  21 root      20   0     0    0    0 S    0  0.0   0:00.01 sync_supers         shafee@shafee-pc:~$   Or is it normal to have 110mb of free memory and is my issue related to something else? Ubuntu kernel not upgrading with upgrade to 15.10 How can angular velocity be constant even when there is a torque by friction? A cylinder at rest lying on a rough ground is given an impulse which imparts a translational velocity (no angular velocity) to it. The question goes ahead with finding time after which rolling starts etc. etc.  But I have another question: The friction from the ground will decrease the translational velocity but increase the angular velocity (as the torque of friction will be in the direction of rolling). After some time, the translational velocity will become equal to angular velocity and hence pure rolling will start.  After this time work done by friction will be 0 as the point of contact is not moving and hence translational velocity will be constant. Now my doubt is that, when translational velocity is constant, it implies angular velocity will also be constant (as translational velocity is a multiple of angular velocity). But the torque from friction (about the centre of mass) will not be zero which means angular velocity will not be constant. In some book where there was the same problem it was written friction will vanish. How can friction vanish? How can anguluar velocity be constant even when there is a torque by friction? How to work with iAds using xcode 3.1.3 I'm trying to identify a novel about an alien race coming to Earth. They are rabbit-like.    I thought it was Niven or Pournell but I cannot remember the title.  It was Quotzal or something like that. How to execute file I'm editing in Vi(m) Extracting embedded images from a PDF Before I started using Ubuntu I used Nitro PDF reader to automatically extract images from PDF files. Is there a PDF reader for Linux that does this?  I would like to be able to extract images faster/easier than when taking a snapshot. I'm trying to find a story for my father, from the 70s or earlier  Earth is at war with aliens (possibly Martians) and was unable to effectively fight back as the aliens had planetary (or at least city-protecting) force fields through which no bombardment was possible.  Earth eventually wins through invention of a device that allows them to teleport weapons (nukes?) under the force fields.  originally believed to be one of Harry Harrison's 'One step from earth' shorts, but this is not the case.  Thanks in advance for any help here! Why does Windows 7 ask for additional drivers when installing from a USB 3.0 drive? Prove that $371\cdots 1$ is not prime Prove that $371\cdots 1$ is not prime.   I tried mathematical induction in order to prove this, but I am stuck.  My partial answer:  To be proved is that $37\underbrace{111\cdots 1}_{n\text{ ones}}$ is never prime for $n\geq 1$. Let $P(n)$ be the statement that $37\underbrace{111\cdots 1}_{n\text{ enen}}$ is not prime.  For $n=1$, we can write $371=7\cdot 53$, and therefore $P(1)$ is true. Let $P(k)$ be true for $k&gt;1$. Then we now have to prove that $P(k+1)$ is true.  I found that $37\underbrace{111\cdots 1}_{k\text{ ones}}$ can be written as $37\cdot 10^k+10^{k-1}+10^{k-2}+\cdots +10^0$ and that $37\underbrace{1111\cdots 1}_{k+1\text{ ones}}$ can be written as $37\cdot 10^{k+1}+10^{k}+10^{k-1}+\cdots+10^0$.  I think I'm pretty close to the answer know, but I don't know how to proceed. How to write (La)TeX (with parentheses) [or any other TeX-related logo] Is there a quick way to get the control that's under the mouse? I need to find the control under the mouse, within an event of another control.  I could start with GetTopLevel and iterate down using GetChildAtPoint, but is there a quicker way? How can I resize an LVM partition? (i.e: physical volume) I want to shrink my second (LVM) partition, in order to create a new partition in the newly freed space. I am using the Live CD to do so, because I know I can't resize/move this partition while it is in use. When I opened GParted in the Live CD, I realized that I could not resize the partition, because when I right-click it, the option "resize/move" is disabled.  I tried to unmount it, to "lazy" unmount it (umount -l /dev/sda2) but it didn't work.  A screenshot from GParted: How to install Chrome browser properly via command line? I am trying to install chrome browser via command line.  I tried this:  $ apt-cache search chrome browser   The results show that the proper term is "chrome-browser," so I tried that:  $ sudo apt-get install chrome-browser   And then "Y" for the Y/n question.  But the installation threw errors.  Does someone see anything wrong with the commands I issued? Schadenfreude is the joy or pleasure derived from the misfortunes of others. What is the word for joy or pleasure derived from the happiness of others? use contradiction to prove that the square root of $p$ is irrational Vote can't be changed if answer is edited too quickly Solvable Lie algebra with codimension 1 ideal There is an exercise in Humphreys's An Introduction to Lie Algebras and Representation Theory: "Any nilpotent Lie algebra contains a codimension 1 ideal".  The proof I am thinking of is the following.  Suppose the Lie algebra $L$ satisfies $L\neq[L,L]$. Then $\pi\colon L\to L/[L,L]$ is a projection onto an abelian algebra. Choose a codimension 1 subspace $I\subset L/[L,L]$. Then $I$ is an ideal and its preimage $\pi^{-1}(I)$ is necessarily an ideal in $L$, because any subspace containing the derived algebra is an ideal. Moreover, $\pi^{-1}(I)$ has codimension 1. $\square$  The only condition on $L$ is that $L\neq[L,L]$, which holds for solvable Lie algebras as well. Is this proof correct? How come Humphreys didn't set the exercise with "nilpotent" replaced by "solvable"?