I want to make a bootable USB of Windows 8.1 from Ubuntu 14.10 so that I can install it on my laptop.   I tried using winusb and UNetbootin, but both of them failed.   What else can I try?  I have Windows 8.1 Pro 64-bit iso, and I am using Ubuntu 14.10 64-bit.
I'd like to create a Windows bootable USB stick, but I don't have a Windows machine with me at the moment to do so. How could I achieve the same using Ubuntu?
Source shell script automatically in terminal How can I automatically source a particular shell script when I open a terminal window by right clicking somewhere and choosing "open in terminal"?  For example, every time I open a terminal I need to run the following command line:  source myscript   How can I make it so that I don't have to type this automatically?  My script is written in tsch:  #!/bin/tcsh setenv DISPLAY 127.0.0.1:10.0 cd /ast/dcm/data   I'm using CentOS 7. I am a Canadian citizen, and I intend to travel to the US for a student clinical elective at a university in Texas for the months of September and October. The university will help me obtain an F-1 status. However, I want to attend a few conferences and educational seminars which are being held in November/December for which I will be using a B1/B2 visa.  Will I have to leave the US and come back in November using a B1/B2 visa, or is there another way to change my visa status, or can I apply for both visas upon entering the US? 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? How do you convert a byte array to a hexadecimal string, and vice versa? How can you convert a byte array to a hexadecimal string, and vice versa? I have an ec2 instance on AWS which already installed a few Wordpress-es in it.  I want to set things up to let more people handle their own projects, with me also being able to go into the server using terminal if I still want to.  I have been following tutorials such as  and a few others.  I figured all of them just teach users how to sftp into their own home folder, also the steps keep saying addUser but some users already existed and removing them might cause some issue.  How can I give existing users the permission to use SFTP for Wordpress projects?  Let's say all my Wordpress projects are already under /var/www/ which has already been set up with www-data:www-data.  Really new with setting things like this.  Thanks in advance for any help. Does SQLDeveloper support executing scripts? Elementary proof for $\lim\limits_{n \to\infty}\frac{n!e^n}{n^n} = +\infty$ As seen in  question, the series $\sum\limits_{n=1}^{\infty} \dfrac{n!e^n}{n^n}$ diverges. (One way to see this is by noting that the terms of the sum are greater than $1$ and, therefore, don't converge to zero.)  However, more is true: not only are the terms greater than $1$, they blow up to $+\infty$! To see this, one can apply Stirling's approximation and get $\dfrac{n!e^n}{n^n} \sim \sqrt{2\pi n}$.  My question is: is there an elementary proof for $\lim_{n \to\infty}\dfrac{n!e^n}{n^n} = +\infty$?  The reason I'm asking this is that I'm taking a Calculus course and I was assigned the exercise of proving the divergence of the series above and I would feel more satisfied if I could prove that its terms go to $+\infty$ (as opposed to merely proving the terms are greater than $1$.) Obviously, things like Stirling's approximation are outside the scope of the course, so I can't really use them.  (To be clear, you can use anything one learns in $4$ semesters of standard Calculus courses. I hope this restriction is not too obscure.) Selecting the size of a System.Drawing.Icon? Clearly this is an edge case and I probably shouldn't have even tried awarding the bounty to a deleted answer, but why is the bounty award button even available?  It's not a bug since someone added in the notification seen in the final image.  But that sure seems like a roundabout way to let the user know that they can't award a bounty to a deleted answer.  The second step is particularly strange since the system really ought to know that the warning is pointless: no bounty can be awarded.  My suggestion is to rip-off the  and let bounties be awarded without the warning.  Then remove the single click button from deleted answers. How we fix (La)TeX math coding to be left aligned In display math (employing $$...$$) content normally gets aligned centered. But, I need it to be left aligned. Any suggestions?  Example  $$f(x) = \frac{{{{\sin }^2}x{\mkern 1mu} \cos x}}{{\sin x + \cos x}} -          \frac{1}{4}\tan (\frac{\pi }{4} - x){\mkern 1mu} {\mkern 1mu}           \forall {\mkern 1mu} x \in R - \{ n\pi  - \frac{\pi }{4}\} ,n \in I$$ Why was Count Dooku not given the title "Darth"? I don't know the exact significance of the word "Darth" in the Sith world, but I think it was a word of honor for powerful Sith. That's why Anakin was given this word in his new name.  All powerful Sith in canon had this word in their names: Darth Plagueis, Darth Bane, Darth Sidious, Darth Vader, Darth Maul, etc. As such name similarity can't be names given by their parents, I can assume they were given such words in names as a honor.   Now, look at Count Dooku... he was a powerful Sith too. So, why wasn't he given this title?    Darth word to address Dooku hasn't been used in the movies, as far as I know. If you are claiming that Darth and Lord words are same, give citations because my vocabulary rejects it. Is it possible to find out reason of suspension for another user? A user on Stack Overflow was recently temporarily suspended.  Out of curiosity I read through their posts (both questions and answers) and found them to be of decent quality.  They answer far more than they ask (about a 10 to 1 ratio) and always provides lots of sample code in their replies.  They're polite too.  I can't see a reason for suspension.  So, now I'm curious, and maybe I can even learn something from their experience.  Can I find out why they were suspended or is that strictly between the moderator and the user? Coefficients change signs I have a dataset where there is a high degree of multicollinearity, with all variables correlating positively with each other and the dependent variable. However, on some of the models I run I get a couple of significant negative coefficients. Basically there are two coefficients that depending on what variables I include in the model, I can manipulate their signs.  My understanding is that if the variance-covariance matrix only contain positive values, then all coefficients should also be positive. Is this correct? Is there a way to find out if I need a transit visa for Canada? GPU Rendering causing strange lines When I render using my r9 390 graphics card, weird lines are appearing over the render. This problem has just started happening recently, as a few days ago I was rendering the same scene without the lines appearing. I don't believe I've changed any settings in Blender and the below scene is from a new file, so render settings should be default.   Rendering using my CPU is fine:   The only thing I can think that has changed is I recently updated my card to the latest drivers. Playing games with it is still fine and the card is quite new so I wouldn't think it's a problem with the card itself. Using iOS 5 rich text editor How to change boot priority? How to find out if my system is i386 or x86_64 before installing Ubuntu? I have removed Windows 7 using GParted, and want my computer to boot straight into Ubuntu, but I still get the dual boot screen, how can I fix this? Can you prove that if $p$ is a prime greater than $5$, then the sum of the squares of the quadratic nonresidues modulo $p$ is divisible by $p$?  Note that I have just proved that the sum of the quadratic residues modulo $p$ is divisible by $p$ for $p$ greater than $3$.