I have downloaded a .img file to use on my Android device.  I have to edit a file in the image in order to use it.  How can I mount the file so I can edit the text file and then re-pack the .img?
I'm a Windows/Mac/Ubuntu and Android user, so I know what I'm talking about, when I say: How do I open binary image files? (.img) They just won't open, on any OS…  I'm an Android dev… I'm currently working on a ROM, (I also program, using Windows) but I need to extract files, from .img files. I've converted them to .ext4.img but they just aren't recognized by Linux (Definitly not by Android), by Mac OS or Windows. In other words, I can't open, extract or mount them.  Can anyone help me? I'm kinda confused…
Investment options for f1 visa students in USA I am foreign graduate student in USA. I recently completed my undergrad (from USA) and have a bit of money saved up. I know that F1 students cannot work off campus and other business activities such stock trading etc are prohibited as well. I wanted to know if opening an account in an investment management firm like Charles Schwabb or Betterment is allowed. I would not be working but I will still be earning a small interest on my deposits. If that is not allowed, are there any good and legal ways for foreign students to earn a little interest on savings? AppFabric / WF 4.0 instances stuck despite no bookmark and pending timer My Windows 7 has suddenly stopped displaying Unicode symbols For some strange reason, my computer suddenly doesn't show certain unicode characters anymore! I have no idea what happened.  Affected applications include Windows Explorer (should be Japanese characters), Google Chrome (should be a heart), and Winamp (should be stars):      Russian, German etc. characters are displayed normally. Chrome also displays Japanese script on websites, but not in the GUI. How can I fix it?     TL;DR: A workaround is to put a shortcut with a Unicode name on the desktop so that explorer.exe is the first process to display a Unicode string after booting.     Update: I have tried to use System Restore to fix it. I needed to go back in time quite a while because the most recent restore points didn't solve it so I used one from the middle of November. After that restore, Unicode symbols were displayed again. Then I updated my system with Windows Update again because those were removed during the restore. After that, the error occurred again! I then did a restore to a point before my new updates, but the error persists, and the old restore point (which I used before) is gone and there are currently no other snapshots of the system. Any suggestions on what to do now?  Update 2: I could find a workaround:      Control Panel → Region and Language → Administration → Change Language for Unicode-incompatible programs to Japanese (Japan).    All mentioned programs display their symbols correctly again. However, I don't consider this a fix because these programs are not usually Unicode-incompatible, and it also leads to some (non-serious) artifacts in some programs. I still welcome an answer that tells me what went wrong here and how to fix the issue.  Update 3: I think I have isolated the particular Windows Update which causes the error. It is . I have installed all other updates except this one, and the error did not occur again.  Update 4: The true origin of this problem was Chrome, see accepted answer. Workaround: put shortcut with Unicode name on desktop so that explorer.exe is the first process to display a Unicode string after booting. Given this (very) tricky determinant, how can we calculate it easily?  $$\begin{pmatrix} \alpha + \beta &amp; \alpha \beta &amp; 0 &amp; ... &amp; ... &amp; 0 \\ 1 &amp; \alpha + \beta &amp;  \alpha \beta &amp; 0 &amp; ... &amp; 0 \\ 0 &amp; 1 &amp; \alpha + \beta &amp; \alpha \beta &amp; ... &amp; ... \\ ... &amp; ... &amp; ... &amp; ... &amp; ... &amp; 0 \\ ... &amp; ... &amp; .... &amp; ... &amp; ... &amp; \alpha \beta \\ 0 &amp; 0 &amp; 0 &amp; ... &amp; 1 &amp; \alpha + \beta   \\ \end{pmatrix} \in M_{n\times n}$$  EDIT:     I have to prove it is equal to $\frac{{\alpha}^{n+1} - {\beta}^{n+1}}{\alpha - \beta}$   Any help is appreciated, I just could not find a trick to ease it up! Using an NSString in a switch statement I just can't find a decent (and free) one. What can I use? Random Forest mtry Spit-to-Split Variable Sampling Procedure A theorem about Cesàro mean, related to Stolz-Cesàro theorem Original Title: Tauberian theorems and Cesàro sum  Theorem (Landau-Hardy, From Rudin's Principle of Mathematical Analysis Exercise 3.14)  $\newcommand\abs[1]{\left\lvert#1\right\rvert}$ If $\{s_n\}$ is a complex sequence, define its arithmetic means $\sigma_n$ by $$\sigma_n=\frac{s_0+s_1+\dotsb+s_n}{n+1}\qquad(n=0,1,2,\dotsc)$$ Put $a_n=s_n-s_{n-1}$ for $n\ge1$. Assume $M&lt;+\infty$ and $\abs{na_n}\le M$ for all $n$, and $\lim_{n\to\infty}\sigma_n=\sigma$, then $\lim_{n\to\infty}s_n=\sigma$.  The outline of the proof  If $m&lt;n$, then $$s_n-\sigma_n=\frac{m+1}{n-m}(\sigma_n-\sigma_m)+\frac1{n-m}\sum_{k=m+1}^n(s_n-s_k)\tag{*}$$ Notice that $\abs{s_n-s_k}\le(n-m-1)M\,/\,(m+2)$, fix $\epsilon&gt;0$ and associate with each $n$ the integer $m$ that satisfies $$m\le\frac{n-\epsilon}{1+\epsilon}&lt;m+1$$ Then $(m+1)\,/\,(n-m)\le1/\epsilon$ and $\abs{s_n-s_k}&lt;M\epsilon$. Hence $$\limsup_{n\to\infty}\,\abs{s_n-\sigma}\le M\epsilon$$  Questions and thoughts  It seems that the equation (*) comes out strangely. I wonder how to discover such kind of strange identities. So is there any observation, even deeper, to look through that equation?  Thanks! Have Blender on about 4 machines rendering animations. Just spotted on one of the machines its rendering something different from the actual scene that I have setup.    Top window shows a different set of layers objects to whats actually being rendered in the rendering window below.  In my scene contents, layers objects 1-5 are not visible, but these are the ones that look like they are being rendered.  The only thing I can assume is that perhaps it might be because I did not save the document before clicking render, but I would not have expected that behaviour (you dont need to save your word document before printing it).  Can anyone confirm why this is happening? states that if $f:X \rightarrow Y$ is a morphism of ringed space, $G$ is a locally free $O_Y$-module, then $f^*G$ is a locally free $O_X$ module.     Suppose that $G$ is a locally free $O_Y$ module, hence it is a free $O_Y|_U=O_U$ module. We have an induced map  $$f^{-1}(U) \rightarrow U$$ given by restriction of morphism of ringed spaces.   Hence, as $\bigoplus O_U \simeq G|_U$, $f^*:Mod(O_U) \rightarrow Mod(O_{f^{-1}(U)})$ is functorial, $f^*(G|_U) = (f^*G)|_{f^{-1}(U)}$, we have isomoprhism,  $$ \bigoplus O_{f^{-1}(U)} \simeq (f^*G)|_{f^{-1}(U)} $$ Is there an easy way to calculate the total cost of tolls for a trip within the United States? Why is asking a question on "best practice" a bad thing? Storing C++ template function definitions in a .CPP file I have some template code that I would prefer to have stored in a CPP file instead of inline in the header.  I know this can be done as long as you know which template types will be used.  For example:  .h file  class foo { public:     template &lt;typename T&gt;     void do(const T&amp; t); };   .cpp file  template &lt;typename T&gt; void foo::do(const T&amp; t) {     // Do something with t }  template void foo::do&lt;int&gt;(const int&amp;); template void foo::do&lt;std::string&gt;(const std::string&amp;);   Note the last two lines - the foo::do template function is only used with ints and std::strings, so those definitions mean the app will link.  My question is - is this a nasty hack or will this work with other compilers/linkers? I am only using this code with VS2008 at the moment but will be wanting to port to other environments. I would like to replace the usual \hat in maths with a larger one, but I do not want it to stretch. The size I want is "the smallest \widehat" (as in $\widehat{.}$). Is there a way to put that one above a wide character like M ($\widehat{M}$ would stretch and give be an even wider hat).  I guess I have a lack of understanding for the mechanism behind accents that extend, so feel free to explain. How do you breed animals? A is similar to $A^k$, then each eigenvalue of $A$ is a root of unity Let $A \in \mathbb{C}(n,n)$ and $k \geq 2$ be an integer such that $$A \sim A^k$$. Show that if $A$ is non-singular then each eigenvalue of $A$ is a root of unity.   Attempt: Since $A \sim A^k$, $$PA = A^kP$$ where $P$ is an invertible matrix. Since $A$ is invertible, $0$ cannot be an eigenvalue of $A$. Suppose $$Av = \lambda v \quad v \neq 0$$ then $$PAv = \lambda Pv$$ $$\therefore A^k(Pv) = \lambda (Pv) $$ but this implies that $Pv$ is an eigenvector of $A$. But the eigenvalues of $A^k$ are $\lambda^k$ $$\therefore \lambda^k=\lambda$$ which gives the conclusion required.   My questions is: Is the logic correct? If so, Am I missing any details? If not, then how could I approach this?   Thanks! How to handle a deliberate duplicate question I am looking for a clean and fast method to force GNOME in Ubuntu 14.04 to switch between active apps only on the current workspace when pressing the shortcut alt + tab. Performing test for homogeneity of variance without samples I'd like to perform a test for homogeneity of variance in r, but I don't have samples available to test.    I have the sample mean of each group, the sample deviation of each group, and the sample size of each group(100).  Brand    ybar_i  s_i    n_i --------------------------- LowTar   9.64    .291   100 A        10.22   .478   100 B        10.77   .372   100 C        11.57   .352   100 D        13.59   .469   100   I'm thinking I should use the Levene test from Lawstat package, but that requires samples to test.  Or I think I could use the Fmax test. but that also requires samples. I know that the Linux kernel supports TRIM as of version 2.6.33, so there should be TRIM support in ubuntu.  Is TRIM enabled by default or do I need to change some settings or install additional software for it to work? If so, how?