In QGIS add new attribute table features from updated csv
Pulling a CSV file from website into QGIS with ability to automatically refresh?
I have this problem: I'm used to compile and run .c files with CodeBlocks. If I do that from my Desktop (ext4 partition) it works without problems, but doing this from my secondary hard drive (NTFS partition) makes CodeBlocks to say permission denied while running a .c file.  I have read it's because of the partition type is it correct? But I don't know how to solve it. I tried to edit fstab (sudo gedit /etc/fstab) adding this line:   /dev/sda /media/Dati ntfs user,exec 0 1   but after rebooting Ubuntu I had a warning on boot about a problem mounting a drive, that's because I set KDE to auto mount my Dati drive on boot.   So I should auto mount my NTFS drive with execute permission? How can I do that? I'm writing a math paper in LaTeX and for math formulas I'm just using $$math formula$$. Is is possible to numerate formulas? Or do I have to you use some specific commands such as align? Enlarge a partition without losing data with Windows 7 diskmgmt? I have a 320GB hard drive currently partitioned as below:     A long time ago, a computer expert formatted my hard drive like this because I wanted to install Ubuntu. I'm now ready to do this, but I'll never need so much free space (103.09GB). I want to enlarge the D:\ volume because it already has lots of data on it.  I know that when I open diskmgmt.msc, I could possibly enlarge the D:\ volume using some free space from the unformatted 103.09GB volume, because the program offers me the option to enlarge. However I'm afraid that I might lose data doing this.  Is it possible to enlarge the partition with this Windows 7 tool or am I better using GParted via "Try Ubuntu" on my Live CD? Would either of them cause data loss in this scenario? The special linear group $\text{SL}_n(\mathbb{R})$ is its own commutator Let $SL_n(\mathbb{R})$ be the set of $n\times n$ matrix with determinant one. Where can I find a proof that $[SL_n(\mathbb{R}),SL_n(\mathbb{R})]=SL_n(\mathbb{R})$? I've seen this result mentioned in several places, but couldn't find a proof.  For reference, the commutator $[SL_n(\mathbb{R}),SL_n(\mathbb{R})]$ is defined as the group generated by the set of all elements of the form $a^{-1}b^{-1}ab$, with $a,b\in SL_n(\mathbb{R})$. $\sum_{n=1}^\infty \log \frac{n+1}{n}$  $\sum_{n=1}^\infty \log \frac{n+1}{n}$ =  $\displaystyle\lim_{n \to{+}\infty}(\log2 - \log1)+(\log3-\log2)+...+(\log(n+1)-\log n)$=$\displaystyle\lim_{n \to{+}\infty}\log(n+1)\to \infty$. So, the series diverges.  Is my procedure correct? Develop rich API exposing Stack Overflow functionality I would love to see an actual native iPhone app for Stack Overflow, Server Fault, Super User, etc.  I've actually developed a number of iPhone apps myself, and would certainly be interested and willing in doing the bulk of the legwork, but it would be necessary for the SO team to expose a real API, instead of simply RSS feeds.  Maybe if there's enough demand behind this, we can convince the SO team to build a rich API, which could be useful for many other applications, not just an iPhone app. Can I have multiple DHCP servers on one network? This is a  about Redundant DHCP Servers.   Is it possible to have more than one DHCP server on the same LAN? What are the implications of doing this?    What happens if there is more than one DHCP server available? How do my clients know which one to use?  How can I have DHCP servers supplying addresses to more than one subnet\network segment? How can I configure multiple DHCP servers to supply addresses for the same subnet. Prove that the ideal $(X_1-a_1,...,X_n-a_n)$ is maximal in $K[X_1,\dots,X_n]$ Let $K$ be a field, and $a_1,\dots,a_n \in K$. Prove that the ideal $$(X_1-a_1,\dots,X_n-a_n)$$ is maximal in $K[X_1,\dots,X_n]$.   I tried proving that the only elements outside the ideal are the invertibles of $K$ (I should still prove that this implies maximality, but it shouldn't be too difficult).  Is there a better strategy, or another stategy? See code:   var file1 = "50.xsl"; var file2 = "30.doc"; getFileExtension(file1); //returns xsl getFileExtension(file2); //returns doc  function getFileExtension(filename) {     /*TODO*/ } Why do you write "occurred" but "listened"? The past tense of to occur is occurred (not occured), but the past tense of to listen is listened (not listenned).  Why? What is the general rule that is applied to make the past tense of a verb? If $\psi h$ is in $L^2$ for all $h\in L^2$, must $\psi$ be essentially bounded? If $\psi:[a,b]\to\mathbb C$ is a (measurable) function such that $\psi h$ is in $L^2[a,b]$ for all $h\in L^2[a,b]$, then must $\psi$ be essentially bounded?  The converse direction is clear: If $\psi$ is essentially bounded, then $\|\psi h\|_2\leq \|\psi\|_\infty\|h\|_2$ for all $h\in L^2$, and thus the multiplication operator $M_\psi:h\mapsto \psi h$ is defined and bounded.  The question here is whether, without prior assumptions on $\psi$, simply having $M_\psi(L^2)\subseteq L^2$ implies that $\psi$ is bounded. My book says:     For most of the small objects, both are same. But for mammoth ones, they are really different ones. And in a gravity-less environment, COG is absent; COM still exists.   Ok, what's the big deal when things are small and big? How these two :  &amp; ? array package: problem with >{declarations} in preamble: Extra alignment tab has been changed to \cr I have a document that uses both the longtable and the array package. At first I ascribed the problem to an interaction of both. After testing, it seems array is the only culprit.  Here's a minimal example.  \documentclass{article} \usepackage{array} \begin{document}  \begin{tabular}{p{0.4\textwidth}&gt;{\raggedright}p{0.4\textwidth}} 1 &amp; a \\ 2 &amp; b \\ 3 &amp; c \\ \end{tabular} \end{document}   It produces the error  ! Extra alignment tab has been changed to \cr. Bash auto_completion with Xubuntu and xrdp from windows I'm using Xubuntu and connecting over RemoteDesktop with Windows 7.  Everything works fine, but the auto_completion in my bash doesn't work. I checked the .bashrc file in my home directory and also the /etc/bash.bashrc.  I uncommend the lines below in my local bashrc configuration and also in bash.bashrc, but nothing changes.  if ! shopt -oq posix; then   if [ -f /usr/share/bash-completion/bash_completion ]; then     . /usr/share/bash-completion/bash_completion   elif [ -f /etc/bash_completion ]; then     . /etc/bash_completion   fi fi What is the list of keys and their corresponding wins?  I have it listing that the highest number of wins I've had in arena is a Champion key, but it doesn't say how many wins it was. Prove if $a\mid b$ and $b\mid a$, then $|a|=|b|$ , $a, b$ are integers. Form the assumption, we can say $b=ak$ ,$k$ integer, $a=bm$, $m$ integer.  Intuitively, this conjecture makes sense. But I can't make further step. I'm confused. Running Fedora Linux, lscpu yields:  Architecture:            i686 CPU op-mode(s):          32-bit, 64-bit ...   But when I try to install a 64-bit program (Chrome) I get error like:     Package /....x86_64.rpm has incompatible architecture x86_64. Valid architectures are ['i686', 'i586', 'i486', i386']   I'm less interested in being able to install Chrome and more interested in why lscpu says that my CPU can run in 64-bit mode; clearly this can't mean I can run 64-bit programs. Can anyone clarify? Subdivision surface modifier creates pinching at corners I've only been 3D modelling for a few days now, so this may just be a newbie mistake:  However, because this model is for use in a game I am trying to stay away from proximity loops for performance reasons. Instead, I have used edge creases to maintain the structure of the model. It has led to certain vertices not being affected by the subsurf modifier, causing undesirable lighting at high subsurf levels.  Manually moving each point in a bit seems kind of sloppy but I'm not too sure what the best way to go about this is.  If any more information is needed I'll give what I can, thanks in advance :) how many linearly independed vectors combinations may I extract from a set of vectors Consider the set of $n$ vectors $\mathcal{S}=\{v_1,v_2,\dots,v_n\}$, with $v_i \in \mathbb{R}^n$. Let that set generate a subspace $\mathbb{V}$ of $\mathbb{R}^n$ of dimension $r\le n$. How many different unordered basis of  $\mathbb{V}$ may be constructed by picking up $r$ vectors from $\mathcal{S}$. There is a method to find them? Show that a Cauchy sequence has a fast-Cauchy subsequence