Why can't I move apps to external sdcard?
How to move apps from internal to external storage?
IVP Differential Equation I have stumbled across a very old exam question from my linear algebra course and the solutions are not available. I was wondering if my working/logic is correct and if any improvements can be made.     Let  $\ B=\begin{pmatrix}     1 &amp; -1 &amp; 4 \\     6 &amp; -7 &amp; 2 \\     -3 &amp; 1 &amp; -6       \end{pmatrix}\ $ and $\ \vec{v_1}=\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$.      Part (i): Calculate $(B+5I)\vec{v_1}$ and $(B+5I)^2\vec{v_1}$.   Using simply matrix multiplication, I calculated $(B+5I)\vec{v_1}=\begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}$ and $(B+5I)^2\vec{v_1}=\vec{0}$.     Part (ii): Find all eigenvalues and eigenvectors of B.   From our calculations in part (i), we can see that $\ \lambda=-5,-5$ are two of the eigenvalues, with corresponding eigenvector $\ \begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}$ and generalised eigenvector $\ \begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$. From the trace of B, the remaining eigenvalue is $\lambda=-2$ with corresponding eigenvector $\begin{pmatrix} -2 \\ -2 \\ 1 \end{pmatrix}$.     Part (iii): Giving reasons, write down a basis for the generalised eigenspace $GE_{-5}$ of B.   I am unsure of this part of the question. If I had to guess, I would say a basis for $GE_{-5}=\left\{\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix},\begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}\right\}$. Is this correct?     Part (iv): Solve the initial value problem $\vec{y'}=B\vec{y}$ where $\ B=\begin{pmatrix}     1 &amp; -1 &amp; 4 \\     6 &amp; -7 &amp; 2 \\     -3 &amp; 1 &amp; -6       \end{pmatrix}\ $ and $\vec{y}(0)=\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$.   Well, the solution to this IVP will take the form $\vec{y}=e^{tB}\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$. I noticed that $\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}$ was a generalised eigenvector and hence we can write $\vec{y}=e^{-5t}\begin{pmatrix} 1 \\ 1 \\ -1 \end{pmatrix}+e^{-5t}\begin{pmatrix} 1 \\ 2 \\ -1 \end{pmatrix}t$. Thus $\vec{y}=e^{-5t}\begin{pmatrix} 1+t \\ 1+2t \\ -1-t \end{pmatrix}$ RSA leak bits to factor N Baby Rudin Theorem 1.20 (b) Proof I have a question about Rudin's proof of Theorem 1.20 (b) in his book Principles of Mathematical Analysis.  Theorem 1.20 is stated as follows:     (a) If $x\in R, y\in R$, and $x&gt;0$, then there is a positive integer $n$ such that $$nx&gt;y.$$   (b) If $x\in R, y\in R$, and $x&lt;y$, then there exists a $p\in Q$ such that $x&lt;p&lt;y$.     I understand Rudin's proof of (a).  The beginning of Rudin's proof of (b) is given below:     Since $x&lt;y$, we have $y-x&gt;0$, and (a) furnishes a positive integer $n$ such that $$n(y-x)&gt;1.$$  Apply (a) again, to obtain positive integers $m_1$ and $m_2$ such that $m_1&gt;nx$, $m_2&gt;-nx$.  Then $$-m_2&lt;nx&lt;m_1.$$  Hence there is an integer $m$ (with $-m_2\leq m\leq m_1$) such that $$m-1\leq nx&lt;m.$$   I don't understand the justification for this last sentence beginning "Hence...."  How is $m$ found, and why are $m_1$ and $m_2$ needed to find $m$? How do lexical closures work? Why is my mesh inversed when Imported to Unity? So I modeled this sword and all the parts were separate meshes. I used a mirror modifier when I was modeling and then I applied the modifier when I was done to make the parts into solid meshes. Put a UV map on everything and it all looked good in Blender.  Then I put it into Unity and I got what you see in the picture. Part of the sword is inversed. Oddly, the inversed part actually maintains the proper silhouette. It maintains the correct shape, but then is shaded like the front half is missing.  Does anyone have an idea of what's going on and how to fix it?  Thanks, James Square root of Positive Definite Matrix First, when I never had installed sl:  diogosaraiva@Ubuntu:~$ sl O programa 'sl' não está instalado actualmente. Pode instalá-lo escrevendo: sudo apt-get install sl   traslaction: "The program 'sl' is not currently installed. You can install it by typing:"  But when I'm tired of it and I remove it by typing sudo apt-get remove sl per example...  I get this when I type sl:  -bash: /usr/games/sl: Ficheiro ou directoria inexistente   translate: "-bash: /usr/games/sl: No such file or directory" instead of:    diogosaraiva@Ubuntu:~$ sl O programa 'sl' não está instalado actualmente. Pode instalá-lo escrevendo: sudo apt-get install sl   This appears with others packages too...  How I get rid of this: -bash: /usr/games/sl: Ficheiro ou directoria inexistente ?  I want see the original:  diogosaraiva@Ubuntu:~$ sl O programa 'sl' não está instalado actualmente. Pode instalá-lo escrevendo: sudo apt-get install sl   Output of type sl  sl está hasheado (/usr/games/sl) I've run across (personally or by proxy) a bunch of storage media that exhibited physical problems during their life. Hard disks, solid state drives and other flash storage media all fail after some time. The situation is worse with USB flash drives and flash cards because of the large amount of suppliers with inferior flash cell and flash controller quality.  How can I reliably detect if a storage drive suffers from physical damage?  Note that this question isn't about file system integrity (which can be checked with ). apt-get update fails to fetch files, “Temporary failure resolving …” error How do we explain the behavior of \rput, \psGetNodeCenter and saveNodeCoors? Introduction  I am writing a tutorial on a short introduction to PSTricks for newbies. I got obstacles to explain how  a node A (for example), \rput, (!\psGetNodeCenter{A} A.x A.y) and (!N-A.x N-A.y) work by design.  I have read the pst-node documentation as shown below.      And the following is taken from page 35-36:    The manual says:   The transformation matrix will be reset by \psGetNodeCenter. (!N-A.x N-A.y) is not affected by \rput.   Even though I read it many times, I still get confused. The statements are too short.  Problem  Please consider the following figure for the remaining discussion.     Case 1  A node A is defined outside \rput and a dot is translated by \rput.   with (!\psGetNodeCenter{A} A.x A.y)  \pnode(2,2){A} \rput(1,1){\psdots(!\psGetNodeCenter{A} A.x A.y)}  with (!N-A.x N-A.y)  \pnode(2,2){A} \rput(1,1){\psdots(!N-A.x N-A.y)}    The results are different. \rput only affects (!N-A.x N-A.y). Case 2  A node A is defined inside \rput and a dot is translated by \rput.   with (!\psGetNodeCenter{A} A.x A.y)  \rput(1,1){\pnode(2,2){A}\psdots(!\psGetNodeCenter{A} A.x A.y)}  with (!N-A.x N-A.y)  \rput(1,1){\pnode(2,2){A}\psdots(!N-A.x N-A.y)}    The results are identical. \rput affects both. Case 3  A node A is defined inside \rput and a dot is defined outside \rput.   with (!\psGetNodeCenter{A} A.x A.y)   \rput(1,1){\pnode(2,2){A}}  \psdots(!\psGetNodeCenter{A} A.x A.y)  with (!N-A.x N-A.y)   \rput(1,1){\pnode(2,2){A}}  \psdots(!N-A.x N-A.y)    The results are different. \rput only affects (!\psGetNodeCenter{A} A.x A.y).   The MWE is given as follows.  \documentclass[margin=12pt]{standalone} \usepackage{pst-node} \addtopsstyle{gridstyle}{gridlabels=5pt} \psset{saveNodeCoors,linecolor=red} \everypsbox{\color{blue}} \begin{document}  \begin{psmatrix} \begin{pspicture}[showgrid=bottom](3,3)     \rput(1,1){Case 1-A}     \pnode(2,2){A}     \rput(1,1){\psdots(!\psGetNodeCenter{A} A.x A.y)} \end{pspicture} &amp; \begin{pspicture}[showgrid=bottom](3,3)     \rput(1,1){Case 1-B}     \pnode(2,2){A}     \rput(1,1){\psdots(!N-A.x N-A.y)} \end{pspicture} \\ % case 2 \begin{pspicture}[showgrid=bottom](3,3)     \rput(1,1){Case 2-A}     \rput(1,1){\pnode(2,2){A}\psdots(!\psGetNodeCenter{A} A.x A.y)} \end{pspicture} &amp; \begin{pspicture}[showgrid=bottom](3,3)     \rput(1,1){Case 2-B}     \rput(1,1){\pnode(2,2){A}\psdots(!N-A.x N-A.y)} \end{pspicture} \\ % case 3 \begin{pspicture}[showgrid=bottom](3,3)     \rput(1,1){Case 3-A}     \rput(1,1){\pnode(2,2){A}}     \psdots(!\psGetNodeCenter{A} A.x A.y) \end{pspicture} &amp; \begin{pspicture}[showgrid=bottom](3,3)     \rput(1,1){Case 3-B}     \rput(1,1){\pnode(2,2){A}}     \psdots(!N-A.x N-A.y) \end{pspicture} \end{psmatrix} \end{document}   Question  How do I have to explain their behaviors to the newbies as the statements in the documentation seem to be unclear?  Note: As (!\psGetNodeCenter{A} A.x A.y) is identical to (A), (A) will not be discussed here.     If you are a teacher, how do you explain it to your   students? What would be a good term for continuous testing post-deployment? I'm thinking of live production sites here, where there is a continuous community or much content being updated, sort of like a newspaper site or community site (the one I work at is a healthcare improvement company) and we have news articles, programs and so on.  While the underlying code is tested and released there are often production issues that come up, maybe certain pages stop working, style sheets suddenly don't appear like they did due to a service patch or some tweak done to improve production security or performance.  There is Acceptance Testing for when a deployment goes out to make sure things work right, Regression Testing to make sure nothing has been broken since previous releases.  Considering we've done these types of tests and things are working fine what would you call testing, or checking, the site to make sure things still work fine?  To be sure new pages are being crawled for search indexing?  To check that newly added pages are using plug-ins correctly?  Or so on.  My manager and I were discussing some issues that have cropped up and decided we needed to do something like this, but then to sort of note it in our status reports we didn't really have a name for it.  Anyone done this and have a term that might be good?  Or would you consider it covered by something like Continuous Acceptance Testing or some such term? `apt update` failed on Debian Linux Attempting to upgrade testing/stretch Debian Linux:  $ sudo apt update  Ign:1 http://dl.google.com/linux/talkplugin/deb stable InRelease Hit:2 http://dl.google.com/linux/talkplugin/deb stable Release                                                                    ... Get:25 http://mirror.vorboss.net/debian unstable/main i386 Packages 2016-03-25-1456.28.pdiff [15.0 kB]              Fetched 686 kB in 7s (89.5 kB/s)                                                                                                                                                         Reading package lists... Done W: gpgv:/var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release.gpg: The repository is insufficiently signed by key 4CCA1EAF950CEE4AB83976DCA040830F7FAC5991 (weak digest) W: gpgv:/var/lib/apt/lists/deb.opera.com_opera_dists_stable_InRelease: The repository is insufficiently signed by key 419D0ACF314E8E993F7F92E563F7D4AFF6D61D45 (weak digest) W: Failed to fetch http://dl.google.com/linux/talkplugin/deb/dists/stable/Release  No Hash entry in Release file /var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release, which is considered strong enough for security purposes E: Some index files failed to download. They have been ignored, or old ones used instead.  What's wrong? How to fix it? Use of var keyword in C# After discussion with colleagues regarding the use of the 'var' keyword in C# 3 I wondered what people's opinions were on the appropriate uses of type inference via var?  For example I rather lazily used var in questionable circumstances, e.g.:-  foreach(var item in someList) { // ... } // Type of 'item' not clear. var something = someObject.SomeProperty; // Type of 'something' not clear. var something = someMethod(); // Type of 'something' not clear.   More legitimate uses of var are as follows:-  var l = new List&lt;string&gt;(); // Obvious what l will be. var s = new SomeClass(); // Obvious what s will be.   Interestingly LINQ seems to be a bit of a grey area, e.g.:-  var results = from r in dataContext.SomeTable               select r; // Not *entirely clear* what results will be here.   It's clear what results will be in that it will be a type which implements IEnumerable, however it isn't entirely obvious in the same way a var declaring a new object is.  It's even worse when it comes to LINQ to objects, e.g.:-  var results = from item in someList               where item != 3               select item;   This is no better than the equivilent foreach(var item in someList) { // ... } equivilent.  There is a real concern about type safety here - for example if we were to place the results of that query into an overloaded method that accepted IEnumerable&lt;int&gt; and IEnumerable&lt;double&gt; the caller might inadvertently pass in the wrong type.  var does maintain strong typing but the question is really whether it's dangerous for the type to not be immediately apparent on definition, something which is magnified when overloads mean compiler errors might not be issued when you unintentionally pass the wrong type to a method. I have a cron job that runs every minute on an Ubuntu 12.04 box  $sudo crontab -e * * * * * mylogin /pathto/file.sh &gt; /log/filelog   If I run file.sh, the bash script does some stuff and echos out runs:  $ ./file.sh  runs   If I check the log of cron tab it shows that the job is running:  Jul 10 12:41:01 localhost CRON[1811]: (root) CMD (mylogin /pathto/file.sh &gt; /log/filelog) Jul 10 12:41:01 localhost CRON[1810]: (CRON) info (No MTA installed, discarding output) Jul 10 12:42:01 localhost CRON[1813]: (root) CMD (mylogin /pathto/file.sh &gt; /log/filelog)   However, the script is not running. It is not doing it's work and not echoing runs to /log/filelog.  $cat /log/filelog  #shows nothing   What other steps can I take to debug this problem? NOTE: I would appreciate it if you provided a hint and not the whole solution.  BdMO 2014 Nationals:     In acute angled triangle ABC, considering a portion of side BC as diameter a    circle is drawn whose radius is 18 units and it touches AB and AC side. Similarly,    considering a portion of sides AC and AB as diameters, two other circles are    drawn whose radii are 6 and 9 units respectively. What is the radius of the incircle    of ∆ABC?   The main problem with this  problem is that the figure is incredibly messy.So I drew one circle,and tried getting information from it.I noticed that if $O$ is a centre of one of the above (semi)circles,and if $O$ is located on $AB$, then $CO$ is an angle bisector.Therefore,if we connect all the vertices with the centres,their intersection would be the incentre.Then we need to drop a perpendicular from this point to get the inradius.But that hardly helps us.I have found some similar triangles in the figure.But that does not help me at all.  I have also tried backtracking.I tried to put myself in the problem-maker's shoes and tried to imagine what I would do if I had to create a problem like this.Unfortunately,I couldn't do it..  Any insightful comment,hint will be very much  appreciated. Teleporting Castle I remember seeing a movie when I was younger, but can't find it online because I can't remember a whole lot about the story.  What I do remember is there was a group of soldiers trying to catch this castle that appeared only during the day and at the start of each new day it would teleport to a new random location.  I also remember the main character having this neat little flying blade disk that reminds me of something from the Predator movies that he could control with his mind.  Again I can't recall a lot about the movie, but if it sounds familiar I would be grateful.  Also it seems like at one point there were horses that ran so fast they caught fire! Consider the subset $B=\{(x,y):x^2+y^2\leq 1\}\ \subseteq \mathbb{R}^2$. Show that $\vert B \vert = \vert \mathbb{R}^2 \vert$.  It is easy to see tht $f:B\rightarrow\mathbb{R}^2$ defined as $f(x,y)=(x,y)$ is injective.   However, in the book I'm working out of (Book of Proof by Richard Hammack), the other injection noted is  $g:\mathbb{R}^2\rightarrow B$ defined as  $$g(x,y)=\left(\frac{x^2+y^2}{x^2+y^2+1}x,\frac{x^2+y^2}{x^2+y^2+1}y\right).$$  In the book I'm asked to verify this is indeed an injective function.  My approach was to assume $g(x,y)=g(m,n)$ and through basic algebra I was able to deduce  $x(m^2+n^2+1)(x^2+y^2)=m(x^2+y^2+1)(m^2+n^2)$  and  $y(m^2+n^2+1)(x^2+y^2)=n(x^2+y^2+1)(m^2+n^2)$  but how does this show $(x,y)=(m,n)$? Or is this the wrong approach? Methods to work around the problem of missing data in machine learning Virtually any database we want to make predictions using machine learning algorithms will find missing values ​​for some of the characteristics.  There are several approaches to address this problem, to exclude lines that have missing values ​​until they fill with the mean values ​​of the characteristics.  I would like to use for a somewhat more robust approach, which would basically run a regression (or another method) where the dependent variable (Y) would be each of the columns that have missing values ​​but only with the rows of the table that contain all the data , and predict the missing values ​​with this method, complete the table by the table and move to the next 'column' with missing values ​​and repeat the method until everything is filled.  But that gives me some doubts.  Why any column start? I believe that the one with the smallest missing values ​​until the one with the most  Is there any threshold of missing values ​​that is not worth trying to complete it? (for example, if this characteristic only has 10% of the values ​​filled would not it be more interesting to exclude it)  Is there any kind of implementation in traditional packages or other methods that are robust to missings? jQuery: Uncheck other checkbox on one checked ant deploy error - Maximum size of request reached I used to deploy metadata using ant migration tool successfully but from last night I am getting the below error:  John@John:~/mm_workspace/TEST_Project/deploy$ ant deployUnpackaged  Buildfile: /home/john/mm_workspace/TEST_Project/deploy/build.xml  deployUnpackaged:  BUILD FAILED /home/john/mm_workspace/TEST_Project/deploy/build.xml:72: Failed to submit request to https://cs19.salesforce.com/services/Soap/m/35.0/00D293456000Qaf for user john@test.com.dev. Error: {http://schemas.xmlsoap.org/soap/envelope/}Client - Maximum size of request reached. Maximum size of request is 52428800 bytes.  Total time: 2 minutes 10 seconds   I think this is because of too much metadata that I am trying to deploy. For now, I am deploying classes and then VF pages and so on but I am looking for an option to deploy everything in one go without running into the above error.  I am sure that people are working on more complex projects than mine with lots of metadata and I am wondering how are they deploying with out hitting this error?  Thanks