I'm new to ubuntu and I have problem with the partitions. I have 3 mounted partitions but I can only go to OS by cd OS while I can't go to New Volume. That is probably because there is a space in its name.  How can I change its name (label) or how can I go to this partition by command line?
I'm completely new and lost in Ubuntu 12.04, I'm having trouble navigating to my Sublime folder which I know is in my /opt folder. Yet I've tried to no avail to navigate into it via Terminal window. The directory is colored in blue, no idea what this means...but I am able to access the folder using the GUI explorer...?  k@k-Ubuntu:~$ cd /opt k@k-Ubuntu:/opt$ ls Sublime Text 2 k@k-Ubuntu:/opt$ cd Sublime Text 2 bash: cd: Sublime: No such file or directory k@k-Ubuntu:/opt$ cd /Sublime Text 2 bash: cd: /Sublime: No such file or directory
How can I completely remove all traces of Java on my system?   I already know  in case I need it again. How can I deduce/identify an app from a notification icon? I would like to align the view straight on to a face, perpendicular to the normal. How do I align the 3D viewport to the face of a mesh? Desktop shows a white or black background instead of wallpapers Interview Question Asked In yahoo Can you find the smallest positive number such that if you shuffle the digits of the number in a particular order, the shuffled number becomes twice the original number.  Source:   I understand the answer is $125874 =&gt; 251748$  $251748$ is twice the $125874$ and have same digits $1,2,4,5,7$ &amp; $8$  but how to solve this non programmatic ? (1, eval)('this') vs eval('this') in JavaScript? How to Understand the Definition of Cardinal Exponentiation I'm having trouble understanding the definition of cardinal exponentiation.  Let's start with the definitions / claims I've been given:  For any finite sets $A,B$, such that if $|A|=a$ and $|B|=b\neq 0$ then the number of functions from $A$ to $B$ is $b^a$. ( I'm guessing this is only used when both sets are finite ).  For any sets $A,B$, $B^A$ is the set of functions from $A$ to $B$.  For every set $A$, $|P(A)|=|\left \{ 0,1 \right \}^A|$  Now for the definition and why I don't understand it:  Let $a,b$ be cardinal numbers.  Let $A,B$ be sets such that $|A|=a, |B|=b$.  Then $|B^A|=b^a$.  How analagous to normal exponentiation is this and where does in differ when we introduce cardinals like $\aleph_0$ or $C$?  Is $2^2=4$ and is $\frak c^2=c\cdot c=c\times c$? Fundamental group of a torus with points removed $[S]$ means linear span of S. Then $[S] = [[S]]$ My definition of span:   Suppose a vector space $(V,+,\cdot)$, and       $$S = \{u_1,\cdots,u_n\}$$      (and $S$ is a subset of $V$, not a subspace)      $$[S]=:\bigcap_{W\subset V, W\supseteq S} W$$      In other words, $[S]$ is, by definition, the intersection of all $W$,   such that $W$ is a subspace of $V$ and $W$ contains $S$.   Well, then I need to prove that   $$[S] = [[S]]$$  My strategy:  $[[S]]$ means the intersection of all subspaces that contain $[S]$. If all the subspaces contains $[S]$, so does their intersection. Therefore, $[S]\subset[[S]]$  However, I'm having trouble proving the converse:  $$[[S]]\subset[S]$$  Any hints? I know the minimum number of reference letters required at many U.S. PhD programs in the STEM fields is three -- and that it is also not uncommon for someone to submit a fourth letter.  What about a fifth letter?  Would a fifth letter of recommendation be perceived as "too many"? Proof that $\inf A = -\sup(-A)$ Immigration check between Northern Ireland/Republic of Ireland and Great Britain Do immigration checks exist between Northern Ireland and England/Scotland? (not just for flights but also ferry/bus/train) Do immigration checks exist between the Republic of Ireland and England/Scotland? I would like to know where to find the source code of Ubuntu. I'd like to see how far it is "open source". Prove that the sequence with $T(0)=1$ and $T(n) = 1 + \sum_{j=0}^{n-1}T(j)$ is given by $T(n)=2^n$ $T(0)=1 \\ T(n) = 1 + \sum_{j=0}^{n-1}T(j) \\ $  Show that $T(n) = 2^n$.  I know how to prove this by induction, but I would like to know how to show this using first principles.  Edit: The way I want to solve this problem is manipulate $T(n)$ in such a way that it ends up as $2^n$. Can you transfer a Windows 7 XP-mode VHD to a new PC without the need for reactivation? At the moment I am running Vista 32 bit and use VPC 2007 a lot. I have several Windows 2000 Virtual Machines set up with complex software configurations. For me, one of the advantages of working with VPCs is that a Virtual Machine can easily be copied to another PC (like a notebook). Also, when I move to a new PC, I can immediately work with my existing Virtual Machines without the need to reinstall all applications.   I am thinking about buying a new pc with Windows 7 64 bit pro, and using the XP-Mode Virtual Machine that comes with Windows 7. The advantages would be support for more memory (so being able to run more Virtual Machines simultaneously) and having a licenced XP Virtual Machine.  I would like to know if you can transfer a VHD that is based on the XP-mode VHD to another machine without Activation issues. The other machine will of course, also be running Windows 7. I would guess that this would not be a problem.   However, I did read about a guy who had to reinstall his Windows 7 because of a harddisk failure, and could not access his XP-mode VHD anymore because it demanded re-activation.  So can you transfer a Windows 7 XP-mode VHD to a new PC without the need for reactivation? Timeout on a function call releasing a second question concerning ordered stuff and set theory, which is very similar to my first question () which I'm putting here for reference.  The next problem that I'm stuck at in my book is this: we have an ordered triple $(a,b,c)$ and we want to define it using set theory. Why would $\{\{ a\} ,\{ a,b\} ,\{ a,b,c\}\}$ not work? The book requires from me to prove why it is not valid.  Additional info: I don't know how this matters but I'm gonna put it up anyhow. It is written within the book that the correct way to show it is $\{\{ a\} ,\{\{ a\} ,\{\{ b\} ,\{ b,c\}\}\}\}$  EDIT: Now, I consider that the correct case should matter. Besides pointing out why the first case is wrong I'm curious as to why the second one is correct I'm using a flow to set a field to a certain value (01, 02, 03) depending on the value of another field on the same record. I initially wanted to do it with process builder but because of the mapping it seems I would need three 'criteria nodes' or a formula field. Furthermore, it seems Salesforce is recommending using flows instead of process builder for before update actions as it is faster.  The problem with Flows is that I found a way to trigger it when the record is new or updated but not when the specific field is changed so it triggers every time the whole record is updated even when the field stay the same.  On Process Builder, you can use isChanged and then call the flow with specific record but that kinds of defeat the point of using flows for before Update.  So is there a possibility to do the same thing directly in flow ?  Thank you for the help ! How to add images in select list? Taylor series expansion for $f(x)=\sqrt{x}$ for $a=1$