This is probably a simple question and I'm just wording it wrong but I can't figure out how to set this program as a favorite.  I just installed IBM SPSS stats program on Ubuntu GNOME 16.04. Unfortunately, the installation neglected to place a shortcut on my programs list. The only way to open it is to go to where I installed it and open it manually. Then, I have to left click the "stats" file and click execute, which opens a blank terminal with the title "stats" and then it opens the actual program. When I click the activities button in the upper left corner, it shows the program as open but does not allow me to add it to favorites. The only thing that can be added to favorites is the blank terminal which is only known as "unknown". I tried adding that to favorites and opening that but it only opens a blank terminal, no different than any other terminal.  MY question is, how do I set this up so I can open IBM SPSS without having to navigate through the file manager every time? I tried making a custom script that runs cd /opt/IBM/SPSS/Statistics/23/bin &amp;&amp; ./stats which works but can't be placed as a favorite and is not searchable on the activities menu.
Will Unity allow making custom launcher icons from .desktop files or via menu editing system? (Right now the launcher doesn't give the option to "keep in launcher" on all programs.  For some programs I use, I have to make custom launchers or .desktop files.  For instance, daily blender builds are generally just folders with an executable.  In basic Gnome or KDE, I can make a new menu entry with the menu editing system. Then, I can also add it to Docky either from the menu or by dragging a .desktop file to it. Unity launcher doesn't support drag and drop, so thats not a bug or anything, but when I open a .desktop file, it has unpredictable results. Most time it will not have "keep in launcher". Sometime it will have a pinnable item without the .desktop's icon, and if I pin the item to the launcher, it will not call upon the program again after closing it. I've also gotten it to just work with a .desktop file for celtx.
If you are not satisfied with answers on someone else's question, should you ask your own? Suppose you had a question, and you really want a good answer that would solve your problem, but noticed it was already asked by someone else. Now, a lot of answers had been posted and upvoted, and maybe one was accepted. However, none of the answers solved your problem. The system does not promote the question very much because it is not considered "unanswered", and a lot of users who would otherwise bother to give a correct answer will probably skip the question completely as there are already many highly-voted answers.  Now, what should you do in this case?  One idea is to ask a new, completely identical question, but now you're in control to decide when it is answered. But would that go against SE policy? Why is my camera metering indoor scenes as darker than I expect, forcing me to use a high ISO? I am shooting in natural light, with my subject facing a full floor-to-ceiling south facing window. You would think my meter would allow ISO between 200-400 in bright light, but I was lucky to get it to 640, with f/3.2 and 1/60 (manual mode).  I've read other places that people say put your ISO down to 100 for indoor shots for greatest clarity (especially sharp eyes) — but don't know how I can with subjects potentially moving. Is there a setting in my camera (Canon 5D Mark III) I am missing, or something that might be making my meter need more light? How does the kernel prevent a malicious program from reading all of physical RAM? If I write a program that tries to read memory at every possible address, and I run it on a "full" Unix, it will not be able to access all of the physical RAM.  But how does the operating system prevent it from doing so?  I am more familiar with small CPU architectures where any piece of assembly code can access everything. I don't understand how a program (the kernel) can detect such malicious operations. Determine when $\sum_1^\infty \frac{(2n)!x^n}{n(n!)^2}$ converges. By ratio test, when $|x|&lt;1/4$, the sum converges, $|x|&gt;1/4$ diverges. But I'm not sure about $|x|=1/4$. By Stirling's approximation $\frac{(2n)!(1/4)^n}{n(n!)^2}\sim\frac{4^n}{n{4^n}\sqrt{ \pi n}}\sim\frac{1}{\sqrt{\pi}n^{3/2}}$, so when $|x|=1/4$, the sum converges. But I haven't learned Stirling's approximation yet, so how to prove that when $|x|=1/4,$ the sum converges, without using it? In addition to the .tex and .dvi or .pdf files, TeX/LaTeX/ConTeXt produces and uses lots of other files. What do they do? Which ones are used to create the document and which ones are automatically created by the compiler. What files can I safely delete? Search all tags with no tag wiki Is there a way I can search the Tags for tags with no tag wiki created yet? Unable to change payment information to NONE in iOS Appstore How to change password using usermod? I am superadmin of a server and like to change password of an existing user . How can I do that ?  I tried   usermod -p 'new-password' john   but it didn't worked ? I'm trying to set an alias for sudo !! in Bash. I tried alias sbb='sudo !!', but it interprets that as a literal  !! and prints   sudo: !!: command not found   If I use double quotes, it substitutes the double bang in the string itself, so that doesn't work.  Is there any way to make this work? Or an alternative alias? ` Logic Behind StackOverflow Question IDs What cause the "from review" links to appear in comments? I sometimes see comments ending in "From Review" (hyperlinked to a review page) on questions and answers, e.g.        I spend a good bit of time in the review queues (on Unix &amp; Linux), but comments I make do not come with these "From Review" links. Note that I only have access to the "First post" and "Late answer" queues.  Do these links only appear for the higher-rep queues? I added a comment to  but something strange is happening. The end code reads "); but SO decided to change that to ";);.    I did not add a ; in front of the ).  To further explain what's happening here, the following:  "http://example.com/." http://example.com/. "http://example.com." http://example.com. "http://example.com" http://example.com   renders as: Natbib In-Text Citation displays (author?) Does anyone know of a simple Image Editor, with functionality comparable to ,  for Ubuntu?  I've always found GIMP to be overkill and too complicated for what I want to do. I have a Canon 7D, which has a crop factor of 1.6x.  When using a Canon EF-S lens I get the focal length stated on the lens, when using a Canon EF lens I get the focal length times 1.6 when used on the APS-C body. At least that's what I thought.  I just compared two lenses:   Canon EF-S 15-85mm f3.5-5.6 Canon EF 70-200mm f4   .  The top photo is shot with the 15-85, the bottom photo with the 70-200 - both lenses are set to 70mm. Now why do they look the same?  I thought I would get 112-320mm (70mm*1.6 crop factor). What did I misunderstand about the crop factor calculation? Lightroom also displays the photos as having "70mm" and not 112mm. Infinite product with sign changes. For infinite products I know the following theorems:  Theorem I. If $a_n \geq 0$ for all $n$ then $\prod (1+a_n)$ converges if and only if $\sum a_n$ converges.  Theorem II. If $-1 &lt; a_n \leq 0$ for all $n$ then $\prod (1+a_n)$ converges if and only if $\sum a_n$ converges.  My question is what are necessary and sufficient conditions (possibly including more restrictions than in I and II) for $\prod (1+a_n)$ convergence/divergence as related to  $\sum a_n$ convergence/divergence  if the sequence of terms $a_n$ can switch signs repeatedly but always stay greater than $-1$.  I already know the trivial equivalence of $\prod(1+a_n)$ and $\sum\ln(1+a_n)$. Why was Edo Tensei Madara young, when he had died at an old age? From Naruto manga and anime, I know that Uchiha Madara died as an old person after he helped Uchiha Obito.   But it was bit weird for me, when Kabuto summoned Uchiha Madara-sama with Edo Tensei, Madara was a younger person.  Again, when Chiyo was summoned, she was older as when she died.  How can it be possible? Is it possible to have connecting loop lines (like algorithm2e) in algorithmic? As the photo - Variable 'n' has already been declared.  I've tried clearing my cache, as well as using a new user profile with no extensions, but it doesn't work.  Might be useful to know so it can be fixed before more people are using Chrome (If it's SO's fault of course!) Using the quadratic formula, we have either 0, 1, or 2 solutions. I wonder if we could use it this formula for congruence? Or is there a formula to solve quadratic equation for congruence?  Edit Assume that $ax^2 + bx + c \equiv 0 \pmod{p}$, where $p$ is prime with $(a, p) = 1$, then is there a formula for this equation?    Thanks,