I'm trying to create an interpolation of xyz data in QGIS. The data has successfully interpolated, but there is some strange striping or banding on the final result that I cannot seem to get rid of. See the images   The first (black and white) was created by saving the data points as a shapefile, then interpolating. Parameters in TIN interpolation were cubic method, with x and y set to 5 meters. I let col and row define themselves- how would that affect the result?  The second was with the xyz data loaded as a deliminated text layer. Interpolated the same as above.  The methods with the basic interpolation package do not change the result. Banding appeared with both linear and cubic options. I also looked at contours which exhibit the same problem (see the third image). Data itself is fine.   The banding might have a geographic cause- it is occuring over an area deeper than the surroundings. However, I do not expect it to create this level of an issue.
This is a lake of approximately 13 ha with 81 sampled depth points in about 10 transect lines:    Previously in ARCgis with a 50 ha lake and about a 100 depth sampling points, I got decent output with the TopotoRaster tool. However, no such exact equivalent seems to exist with QGIS or open source software.  In QGIS, I got the interpolated raster below, using the TIN method in the Raster Interpolation plugin. However, this seemed to be a lucky outcome, when I tried to repeat, I got different results (unsatisfactory) in spite of not really varying any parameter.    These are more urban (constructed) tanks than lakes, therefore, they are fairly regular in their bed profile, hence the low point sampling density. Some articles seemed to suggest Inverse Distance Weighting (IDW) as the most suitable technique, yet I seemed to get the worst results with that (possibly owing to low point density).  Are there any heuristics which can be employed here considering the size of the lake, its regular profile and the point sampling density to arrive at which interpolation method is apt? (between Kriging, IDW, Bilinear, Cubic convolution, TIN or spline)  Or is it always a bit of trial and error?
Which equals operator (== vs ===) should be used in JavaScript comparisons? I'm using  to go through JavaScript, and it's returning many suggestions to replace == (two equals signs) with === (three equals signs) when doing things like comparing idSele_UNVEHtype.value.length == 0 inside of an if statement.  Is there a performance benefit to replacing == with ===?   Any performance improvement would be welcomed as many comparison operators exist.  If no type conversion takes place, would there be a performance gain over ==? How can I make something that looks like this?  --------   Text   ---------  where the horizontal rules extend to the margin on either side? Showing $\sum\limits_{p \in P} \frac{1}{p}$ where $P$ is the set of all primes is divergent Can I use Wilcoxon Signed-Rank Test to test pairs of data in a time series? I have a dataset of measurements (non-normally distributed). Each line of this dataset is composed of two measurements of the same variable at a specific time (i.e. XYY [time, meas1, meas2]). This dataset contains 24 lines.  Is it correct to use the Wilcoxon Signed-Rank Test to compare these two measurements? Is it correct to use this test to compare the mean value of these measurements between different experiments?  Thanks Exercise from Atiyah-Macdonald, Chapter 1, 2.iv) Let $A$ be a ring and let $A[x]$ be the ring of polynomials in an indeterminate $x,$ with coefficients in $A.$ Let $f=a_0 + a_1x+\cdots+a_nx^n \in A[x].$ $f$ is said to be primitive if $(a_0,a_1,\ldots,a_n)=(1).$     Prove that if $f,g\in A[x],$ then $f$ and $g$ are primitive $\Rightarrow$ $fg$ is primitive.   I know Gauss lemma holds true for UFDs, but in this case it isn't required $A$ to be UFD: is it possible to drop the assumption, or is some hypothesis missing here? Possible Duplicate:          Prove $$\cos(\alpha) + \cos(\alpha + \beta) + \cos(\alpha + 2\beta) + \dots + \cos[\alpha + (n-1)\beta] = \frac{\cos(\alpha + \frac{n-1}{2}\beta) \cdot \sin\frac{n\beta}{2}}{\sin\frac{\beta}{2}} $$ Third grade spiral in TikZ - dimension too large I'm trying to draw a smooth third grade spiral (r^3 = a^3\cdot \varphi) over $60\times 60$mm grid and I'm getting the "Dimension too large"-error if I set $a &gt; 320$ but I need to fill the grid area completely:  \begin{tikzpicture}[x=1mm, y=1mm]      \draw[step=1, line width=0.1mm, opacity=0.3] (-30, -30) grid (30, 30);      \draw [domain=0:50, variable=\t, samples=1000]          plot ({\t r}:{pow(320*\t, 1/3)}); \end{tikzpicture}     Is there any way to avoid this error? Using a transistor as a switch I am attaching a motor to an ATmega32 chip. I want to build an H-bridge but before doing that, I want to control the motor using the chip. I bought few NPN Transistors from RadioShack. I have 5V running though the breadboard. I attached Vcc to the Collector, Base to the Pin, and Emitter to the motor. And other wire of motor is hooked up to Ground. Unfortunately, the power coming out of the transistor is too low, the motor is barely moving (As opposed to when I hook up my motor straight to 5V). What is wrong? Do I need a different transistor or is my setup wrong? If it is the transistor, can you please recommend the right one, I am not too good at those. Multiplication of matrices &mdash; taking the dot product of the $i$th row of the first matrix and the $j$th column of the second to yield the $ij$th entry of the product &mdash; is not a very intuitive operation: if you were to ask someone how to mutliply two matrices, he probably would not think of that method. Of course, it turns out to be very useful: matrix multiplication is precisely the operation that represents composition of transformations. But it's not intuitive. So my question is where it came from. Who thought of multiplying matrices in that way, and why? (Was it perhaps multiplication of a matrix and a vector first? If so, who thought of multiplying them in that way, and why?) My question is intact no matter whether matrix multiplication was done this way only after it was used as representation of composition of transformations, or whether, on the contrary, matrix multiplication came first. (Again, I'm not asking about the utility of multiplying matrices as we do: this is clear to me. I'm asking a question about history.) If the velocity is a relative quantity, will it make inconsistent equations when applying it to the conservation of energy equations?  For example:  In the train moving at $V$ relative to ground, there is an object moving at $v$ relative to the frame in the same direction the frame moves. Observer on the ground calculates the object kinetic energy as $\frac{1}{2}m(v+V)^2$. However, another observer on the frame calculates the energy as $\frac{1}{2}mv^2$. When each of these equations is plugged into the conservation of energy, they will result in 2 distinct results (I think). Command to run an application with Administrator privileges, but NOT AS administrator (prompt with UAC) Stars and pins are retained when chat messages are moved! I want to put a table and a figure side-by-side. The table should fill two third of the text width, and the figure the last third.  So I'd like to achieve one of the following effects (which are equivalent in my case):   One table with 3 columns. The first two columns contain text, the third column contains a lengthy image. The height of the image should be determined by the height of the whole table, if that's possible Or, a divided page like in newspapers. On the left side I have the table, on the right side the image.   What I have tried:  \begin{multicols}{2} \begin{tabular}{ l l } Text &amp; Text \\ Text &amp; Text \\ ... &amp; ... \\ \end{tabular} \vfill \begin{figure}[H]     \includegraphics[]{images/image} \end{figure} \end{multicols}   But this places the picture directly on top of the table.  I also tried using \usepackage[export]{adjustbox} and \includegraphics[right]{images/image} but the caption is still in the center of the page and therefor on top of the table. I was recently watching Episode 3 and a few clone wars episodes, and I found myself thinking during the opening battle between the Republic and General Grievous' forces above Coruscant, on a planet so densely populated where potentially thousands of inhabitants can be killed from a drifting capital class ship with a decaying orbit during space battles what defenses are in place?  Is there any instances of some form of emergency services that tractor beam chunks of debris to safe landing places or repulsor towers that can slow or suspend it until it can be taken apart safely? Even disintegration lasers or emergency force field generators like the types deployed on Hoth as they must have the energy output capable of sustaining it. This IS the galactic capital so must have some advanced tech at its deposal. Even now in our own development humans have certain preventative measures for all types of threats and ways of tracking them, plus responses or fall back plans. How do I delete all my mail from my Gmail account? How do I install Ubuntu alongside a pre-installed Windows with UEFI? I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu? If a linear operator has an adjoint operator, it is bounded This is a question I'm struggling with for a while:  Let $H$ be a Hilber space. Let  $T,S: H\rightarrow H$ be linear operators (not neccessarily bounded) such that for every $x,y\in H$: $\langle Tx,y\rangle=\langle x,Sy \rangle$.  Prove $T,S$ are bounded.    What I did so far:  First attempt:  $||Tx||^2=\langle Tx,Tx\rangle=\langle x,STx\rangle\le||x||*||STx||\le||x||*||S||*||Tx||$  I'm not entirly sure I'm allowed to do the last inequallity, since $||S||$ might be $\infty$.  It follows $||Tx||\le ||x||*||S||$  and analogly  $||Sx||\le ||x||*||T||$  From the first I'd get $||T||\le ||S||$ and from the second $||S||\le||T||$. Therefore $||S||=||T||$. I don't know where to go from here.  Second Attempt: assume  $T$ isn't bounded, therefore so is $S$, therefore there are series $(x_n),(y_n)\subset H$ such that $||x_n||=||y_n||=1$ and $\lim ||Tx_n||=\infty,\lim ||Sy_n||=\infty$. I'll keep it going soon, but it didn't go so well..    I'd love some guide. Not neccessarily the whole solution, but something that would tell me what i'm missing.  Thanks :) Too many password attempts While I was out, someone attempted to guess my phone password. They couldn't guess it and now it displays the 'too many password attempts' screen, which needs to be unlocked with a google account. However, my google account is not working. I enter the username and password correctly, and have attempted to do so about 10 times. So why is it not unlocking? Do I need an internet connection to unlock it? Problem with finding the GCD in the Field of Polynomials mod p I am really having trouble working a problem in my course. I will post it and then add what I have thought etc.  Let p be an odd prime, then using the Euclidian Algorithm, calculated the GCD of of $x^{p-1}-1$ and $x^2+1$ in $\mathbb{Z} / p\mathbb{Z}[x]$  Also, how does $p=1 (mod4)$ tell us that  $-1$ is a square in $\mathbb{Z} / p\mathbb{Z}$, infact that $-1$ is a square here if and only if $p=1(mod4)$.  My thoughts:   I know that $$x^{p}-x=(x)(x-1)(x-2)…(x-(p-1))$$ and so that in this sense our roots will be the congruence classes of $1,2,…p-1$  and also that $$x^{p-1}-1=(x-1)(x-2)…(x-(p-1))$$  But I get lost when trying to apply the EA to these polynomials,  like how can I do it when p is arbitrary?  Preferably id like to be able to understand/see how to do the first part first i.e. using division with residue and then move on to the second part. Any insight/hint or solution to this would be great,  Thank you all  Update:  When I try to do division with residue, I just get  $$x^{p-1}-1=(x^2+1)(x^{p-3}-x^{p-5}+x^{p-7}-x^{p-9}...)$$  for example,  $p=7$  $$(x^{6}-1)=(x^2+1)(x^4-x^2+1)$$  for $p=11$  $$(x^{10}-1)=(x^2+1)(x^{8}-x^{6}+x^{4}-x^{2}+1)$$  which for specific cases tells me that 1 is the gcd, but I dont know how to generalize that for the case with arbitrary prime p. Recently the keyboard and trackpad on my 2015 13" MacBook Pro have stopped working. This is the second laptop to do this, the same issue happened about 6 months ago and Apple gave me a new one when they could not figure it out.  The issue usually starts with force touch not working then progresses to the keyboard and trackpad not being recognized at all. Currently the power button works and force touch works but all other keys and the trackpad don't work.  When this happens there are a lot of errors in the console regarding the AppleHSSPIController.  4/21/16 6:56:47.000 AM  kernel[0]   Error: AppleHSSPIDevice::start failed to get device descriptor 4/21/16 6:56:47.000 AM  kernel[0]   Error: AppleHSSPIController::_enumerateDevice Start failed 4/21/16 6:56:47.000 AM  kernel[0]   Error: AppleHSSPIController::_handleEnumerationFailureGated Giving up on device   You can see the full log here: