So I'm pretty new to ubuntu and I'm trying to make a simple bash script that all it does is running Rubymine so I don't have to write it down in the command line everytime and also so I can have it on the desktop. The code I have in there is:       #!/bin/bash     sudo 'opt/Ruby Mine/bin/rubymine.sh'   It is marked to execute as a program but everytime I try to open it it just opens with gedit.
When I double-click on a script in Nautilus to run it, the script just opens in my text editor with no option to run it. Using Nautilus, how do I run executable text files and/or scripts?
The use of nominative "whom" (as in “persons whom it is foreseeable are likely to...”) How to adopt SD card as internal storage on Samsung devices? Another way to write least prime factor. In definition of vector multiplication, the direction of the resulting vector is given by the right hand rule. However I don't know any mathematical requirement to pick right hand instead of left for this purpose. Is there any? Do we have name for these kind of "flat graphics" images? Copy current terminal prompt to clipboard Is there a way to copy the currently written content of the bash prompt? Say I wrote:  ping www.google.com   so that the lines in terminal looks like:  petr@sova:~$ ping www.google.com   and didn't hit return yet. I want to copy that text to clipboard. Is that possible?  The usual usecase would be hitting up several times and finding a command which I want to copy. How to fix broken taskbar icons in Windows 7 How should "do my homework" questions be closed? (Missing "demonstrate minimal understanding") Just recently,  question was posted. Here's the body of the question:     Write a function called highlight() that prompts the user for a string. Your code should ensure that the string is all lower case. Next, prompt the user for a smaller 'substring' of one or more characters. Then replace every occurrence of the substring in the first string with an upper case. Finally, report to the user how many changes were made (i.e., how many occurrences of the substring there were).      What would a script for this be?   This is basically a "do my homework for me" style question. In the past, I would have voted to close this question for lacking minimal understanding and moved on. However, it looks like this close reason was removed, and I'm having difficulty figuring out which alternative to use (if at all).  Here were some of the close reasons I was considering, and ultimately decided against since they didn't seem to precisely match:   Duplicate of    I sort of doubt there exists a precise duplicate of this question -- the question is a fairly specific request for some code. I could maybe link to a duplicate question that answers a part of the original (for example, checking if the string is lowercase), but it wouldn't answer every aspect of the problem. Problem that can't be reproduced/typographical error    This sort of matches, since it asks the user to produce a SSCCEE, but doesn't really match since there isn't even a problem to begin with (and closing a question because I couldn't "reproduce" a non-existent problem feels a bit silly to me) Unclear what you're asking    It's pretty obvious what the user is asking -- I could produce a 5 line script in about 20 seconds that precisely matches his spec. Too broad    The text for "Too broad" states that "There are either too many possible answers, or good answers would be too long for this format". This doesn't apply to this question -- once again, the answer I could give would be fairly short and would closely resemble solutions other people would give.   So, what should I do here? Am I misunderstanding how the close reasons should now be used? Should I use the "other" close reason and explain that the OP should have put in more effort? Should I simply downvote, perhaps leave a comment, and move on? Or is the new policy to embrace these kinds of questions and just post an answer? Proof of $\int_{[0,\infty)}pt^{p-1}\mu(\{x:|f(x)|\geq t\})d\mu(t)=\int_{[0,\infty)}\mu(\{x:|f(x)|^p\geq s\})d\mu(s)$ Computing the integral of $\log(\sin x)$ How to compute the following integral?  $$\int\log(\sin x)\,dx$$    Motivation: Since $\log(\sin x)'=\cot x$, the antiderivative $\int\log(\sin x)\,dx$ has the nice property $F''(x)=\cot x$. Can we find $F$ explicitly? Failing that, can we find the definite integral over one of intervals where $\log (\sin x)$ is defined? How do I install pdfedit? Cross-validation for timeseries data with regression Isomorphism of $S^1$. The state postulate is as follows: The state of a simple compressible system is completely specified by two independent, intensive properties. My first question is whether there is any justification for this postulate or whether it is simply an empirical law? That is, why is it not the case that 3 intensive variables are required to fix the state or even 4? If it is an empirical law with no justification and just happens to be a law our universe abides by, then why is it not one of the laws of thermodynamics as it clearly provides foundational value to the field of thermodynamics? My second question pertains to how we can know whether 2 intensive variables are in fact independant. Say temperature $T$ and specific volume $v$ for example. If we are given a thermodynamic problem, how would we know whether these are independent or not? or perhaps specific internal energy $u$ and pressure $P$. Are there certain combinations that are simply always independent of each other or does independence between intensive variables vary from problem to problem and require a full understanding of the problem at hand? Let us take a phase change for example. From my understanding of phase changes, I know that the boiling temperature is dependent on the pressure and hence I won't be able to use $T$ and $P$ as 2 variables to completely specify the state. But how would I know know what combinations of intensive variables will be independent in this case or any other case for that matter? Does it simply require rote memorization of all independent pairs of intensive variables for all thermodynamic problems or is there a more simple way to figure out what is independent and what isn't? I hope this question makes some sense and any help would be most appreciated! How do you reindex an array in PHP but with indexes starting from 1? Downloading from Play Store gives error 491 When I try to download anything from the Play Store it shows error 491 and can't finish the download. I have a Samsung Galaxy S 7582. How do I fix this? Is it possible to set a global Blender preference so that all keyframed motion is linear by default? I think I have found the final answer $\left(4 \left[\frac{2t \cosh(4t) - \sinh(4t)}{t^2}\right]\right)$ but need to verify it. Windows 8.1 64-bit: High memory usage I have 8GB of memory on a 64 bit windows 8.1 machine, and windows is telling me I'm using 91% of my memory, yet its simultaneously telling me I'm only using 3GB.  I literally just restarted my machine a few minutes ago because it was being incredibly rediculously slow. I'm currently only running chrome (with a ton of tabs, but doesn't add up to anywhere near 7.5GB). What could be going on here?   Here's a bunch of my current info       I took a look at this:  but I wasn's able to use xperf and the rest didn't lead me to a solution.  UPDATE - RamMap:   UPDATE 2: I checked Resource Monitor at Wouter's suggestion and found an "Image" called lxdecoms.exe with over 6GB of Commt (KB). I tried killing the process, but while it lowered my Commit Charge, it didn't affect "Used Physical Memory". So I restarted hoping to capture it again in full, but its not back yet and yet the problem persists.  I should note that I do have a Centos virtual box virtual machine running on my machine, not sure if that has any weird memory impacts that aren't reflected in the numbers in these tools.   I got xperf working, so here's my resource monitor and a wpa analysis of my xperf output (from xperf -on ReferenceSet -BufferSize 1024 -MaxFile 512 -FileMode Circular  &amp;&amp; timeout 5 &amp;&amp; xperf -d MemUsage.etl):     What is N/A that's taking up 2.7GB of memory? My VM? Prove $\operatorname{rank}A^TA=\operatorname{rank}A$ for any $A\in M_{m \times n}$