LIVE USB: How to install apps on live session(running from ubb) on a completely offline pc?
How can I install software or packages without Internet (offline)?
Finding the perimeter of a right triangle with area given Statistics  () In Q1 of 2012 - 0.0134 such comments per question (~1.33%) In Q2 of 2012 - 0.0167 such comments per question (~1.66%) In Q3 of 2012 - 0.0169 such comments per question (~1.68%) In Q4 of 2012 - 0.0193 such comments per question (~1.92%) In Q1 of 2013 - 0.0223 such comments per question (~2.22%)  The vast majority of these questions need serious help.  Unfortunately, there is a growing trend towards abuse Along with the good, comes some bad -- as usual in life. These comments are bad when  Posting &quot;what have you tried&quot; multiple times per question is severely obnoxious Posting &quot;what have you tried&quot; when the user has clearly shown that they have tried to solve it on their own  It is becoming increasingly common to see &quot;what have you tried?&quot; comments in these scenarios. Some examples     Workarounds Flagging Comments - It is considered a good thing to be liberal with comment flagging -- that helps us clean up after the fact. &quot;Too Chatty&quot; is a no-brainer here. Unfortunately, that only cleans up after the damage has been done. All signs point toward the continued increase of the trend of using &quot;what have you tried&quot; comments. I spend a lot of time editing and cleaning up bad questions. This trend came up on my radar toward the end of last year and it is getting worse. So, I thought at the very least that I'd raise some awareness. I found many related questions on this site but I am still not sure about the rules. How can I decide if I need a visa to transit? Schengen members as of May 2021 are as follows:  Austria Belgium Czech Republic Denmark (excluding Greenland and the Faroe Islands - but an open border with the Schengen Area is maintained) Estonia Finland France (excluding overseas departments and collectivities) Germany Greece Hungary Iceland Italy Latvia Liechtenstein Lithuania Luxembourg Malta Netherlands (excluding Aruba, Curaçao, Sint Maarten and the Caribbean Netherlands) Norway (excluding Svalbard) Poland Portugal Slovakia Slovenia Spain (except Ceuta and Melilla) Sweden Switzerland How to recover a deleted NTFS partition with data I am on Ubuntu 12.04 64-bits  I accidentally deleted a NTFS 255 GB partition using Gparted, and yes it contains LOTS of important data.  Upon realizing the deletion I haven't yet created any file-system on it. So it still shows Unallocated.    I tried Testdisk , but it shows entire partitions created from the beginning.  This sdb is my secondary drive with Xubuntu and Kubuntu on it. And that 255 GB NTFS  partition was cross platform storage drive.  I am currently in sda with Ubuntu and Win7 in dual boot, which enables me to use it as Safe recovery option rather then Live USB drive.   First ,  should i allocate it to ? file-System for better recovery .  Second , i really need to recover data from this drive so please give me possible  suggestions and proven methods of data recovery.  Third ,does Testdisk requires deleted partition to be allocated for its recovery .  I am currently trying the answer seen here  with Testdisk scanning for partition second time, hoping to recover it.   It looks a duplicate but i can't confirm if the OP got it right. Since my first doubt is to allocate it or not.  If any clarification required please do comment ,i will add it.  Edit: TestDisk deeper search results.      The following partitions can't be recovered:          Partition               Start        End    Size in sectors     &gt;  HPFS - NTFS          22241 107 11 55592   3 27  535777280        FAT32 LBA            274460 158 19 460576 228 16 2989957948  NTFS, 274 GB / 255 GiB &amp; for FAT32 LBA 1530 GB / 1425 GiB I am putting together a GIS server using GeoServer and need some help with importing my layer styles from ArcGIS 10 to  format.    I have one layer in ArcMap properly symbolized and labeled, how can I get this layers symbolization and labeling into a SLD file? Is there a single word that describes both Witches and Wizards? In the Harry Potter world, there's the term "muggle" for people with no magical abilities, "muggle-born" for those with magical abilities who's parents are muggles and "squib" for those with no magical abilities who's parents are magical.  But is there any collective term for all magical people (as opposed to wizards for males and witches for females)?  I don't recall seeing any word that refers to all men and women and children with magical abilities, and it's the only group left without noun or collective noun to describe them. Use Stokes's Theorem to show $\oint_{C} y ~dx + z ~dy + x ~dz = \sqrt{3} \pi a^2$ I am a little stuck on the following problem:  Use Stokes's Theorem to show that  $$\oint_{C} y ~dx + z ~dy + x ~dz = \sqrt{3} \pi a^2,$$  where $C$ is the suitably oriented intersection of the surfaces $x^2 + y^2 + z^2 = a^2$ and $x + y + z = 0$.  OK, so Stokes's Theorem tells me that:  $$\oint_{C}\vec{F} \cdot d\vec{r} = \iint_{S}\operatorname{curl} \vec{F} \cdot \vec{N} ~dS$$  I have calculated:  $$\operatorname{curl} \vec{F} = -\vec{i} - \vec{j} - \vec{k}.$$  I then figured that on the surface $S$ we must have:  $$\vec{N}dS = \vec{i} + \vec{j} + \vec{k}dxdy$$  since this follows from the equation of the given plane.  However this will then give me:  $$\operatorname{curl} \vec{F} \cdot \vec{N} = -1 -1 -1 = -3$$  And thus I would get, if project this onto the $xy$-plane:  $$\iint_{S} \operatorname{curl} \vec{F} \cdot \vec{N} ~dS = -3 \iint_{A} dA = -3 \pi a^2$$  which is obviously not correct.  I would greatly appreciate it if someone could help me with this.  I actually had multivariable calculus a few years ago, and I know that I knew this stuff then.  However, now that I need it again I notice that I've become quite rusty.  Thanks in advance :) For a given inner product space $V$, I would like to prove the inequality $$\|\mathbf{x}+\mathbf{y}\|^2 + \|\mathbf{x}-\mathbf{y}\|^2 = 2(\|\mathbf{x}\|^2 + \|\mathbf{y}\|^2).$$  We see that $$\|\mathbf{x}+\mathbf{y}\|^2 + \|\mathbf{x}-\mathbf{y}\|^2 = \langle\mathbf{x}+\mathbf{y},\mathbf{x}+\mathbf{y}\rangle + \langle\mathbf{x}-\mathbf{y},\mathbf{x}-\mathbf{y}\rangle,$$  which by linearity $$=\langle\mathbf{x},\mathbf{x}+\mathbf{y}\rangle + \langle\mathbf{y},\mathbf{x}+\mathbf{y}\rangle + \langle\mathbf{x},\mathbf{x}-\mathbf{y}\rangle - \langle\mathbf{y},\mathbf{x}-\mathbf{y}\rangle.$$  I've been trying to figure out how to go about this proof using linearity in the second argument of an inner product, but my textbook does not say that linearity necessarily holds in the second component. If it does, how would I go about the rest of this proof? If not, should I be potentially using some aspect of conjugate symmetry to prove this statement? Logical volume is not mounted but is in use. Please close all applications using this device (eg iscsi) How do I resize a LVM partition using system-config-lvm?  As per   I clicked on the partition and tried to resize, but got a pop-up error from system-config-lvm.     Logical volume is not mounted but is in use. Please close all applications using this device (eg iscsi).     What's the problem and how can I fix it?    See also . Why are .NET timers limited to 15 ms resolution? Plotting complex numbers Why doesn't matter pass through other matter if atoms are 99.999% empty space? The ghostly passage of one body through another is obviously out of the question if the continuum assumption were valid, but we know that at the micro, nano, pico levels (and beyond) this is not even remotely the case. My understanding is that the volume of the average atom actually occupied by matter is a vanishingly small fraction of the atom's volume as a whole. If this is the case, why can't matter simply pass through other matter? Are the atom's electrons so nearly omnipresent that they can simultaneously prevent collisions/intersections from all possible directions? Partitions of $n$ into distinct odd and even parts proof I think that  is pretty good prima-facia evidence that  is just facilitating the deposition of crap. Increase close vote weight for gold tag badge holders What is the domain of $x^x$ as a real valued function? Consider the function $f(x) = x^x$.  Wolfram alpha tells me that this function's domain is $x : x&gt;0$, $x \in \mathbb{R}$. I can't see why it cannot be defined for a number like $(-2)$. I mean $(-2)^{-2}=0.25$, the same Wolfram Alpha told me. I realize that fractional powers for negative numbers may cause problems, but it could be defined for integers. Thanks for any help. Just that. By good I mean something at the level of SolidWorks, AutoCAD, or similar. This is a complete limitation for me (and many others) to use Ubuntu. How do I resize partitions using command line without using a GUI on a server? I only have access to the server via a terminal and I can't use graphical tools such as GParted! I want to create a new partition from a part of the root (about 768mb) for swap.  # df -h Filesystem      Size  Used Avail Use% Mounted on /dev/vda         20G  1.3G   18G   7% / udev             10M     0   10M   0% /dev tmpfs           199M  4.9M  194M   3% /run tmpfs           100M   12K  100M   1% /run/user tmpfs           5.0M  4.0K  5.0M   1% /run/lock For a moderately complex query I am trying to optimize, I noticed that removing the TOP n clause changes the execution plan.  I would have guessed that when a query includes TOP n the database engine would run the query ignoring the the TOP clause, and then at the end just shrink that result set down to the n number of rows that was requested.  The graphical execution plan seems to indicate this is the case -- TOP is the "last" step.  But it appears there is more going on.  My question is, how (and why) does a TOP n clause impact the execution plan of a query?  Here is a simplified version of what is going on in my case:  The query is matching rows from two tables, A and B.    Without the TOP clause, the optimizer estimates there will be 19k rows from table A and 46k rows from table B.  The actual number of rows returned is 16k for A and 13k for B.  A hash match is used to join these two results sets for a total of 69 rows (then a sort is applied).  This query happens very quickly.  When I add TOP 1001 the optimizer does not use a hash match; instead it first sorts the results from table A (same estimate/actual of 19k/16k) and does a nested loop against table B.  The estimated number of rows for table B is now 1, and the strange thing is that the TOP n directly affects the estimated number of executions (index seek) against B -- it appears to always be 2n+1, or in my case 2003.  This estimate changes accordingly if I change TOP n.  Of course, since this is a nested join the actual number of executions is 16k (the number of rows from table A) and this slows down the query.  The actual scenario is a bit more complex but this captures the basic idea/behavior.  Both tables are searched using index seeks.  This is SQL Server 2008 R2 Enterprise edition. Are $10\times 10$ matrices spanned by powers of a single matrix?