Blender takes high RAM when use high resolution texture
Why does Blender use so much memory for large textures?
Calculating slope in percentage with QGIS I'm working with QGIS, v. 2.0.1. I have several soil types. They are (amongst others) described with slope indications. I already calculated the slope from the DTM in degrees, but as description of the soil types is in percentage, I need to calculate the slope in percentage. I tried two things:  I tried the analysis tool from the raster section, but it didn't work. The result was just black with values from 0 to 0. The same happened when I tried to calculate the percentage in the raster calculator but the result was the same.  Maybe I need to say that the terrain is pretty plain. What else can I do? Update I tried the raster calculator and did what @radouxju suggested. It gave me a black picture with values from 1756.64 to 1756.64. But as soon as I click in the picture the values are &quot;normal&quot;, say 5.88 or 13.224 or something like that. The same happens when I try the gdaldem tool but with values from 0 to 0. I also tried to change the contrast enhancement (like stretch to min/max) but it didn't change anything. Update 2 I just  that maybe I have to set the scale to 111120  but that doesn't work neither (result: black, values 0-0). bash aliases equivalent for powershell? By default my Windows PowerShell starts in C:\Users\Santosh, my XAMPP installation is in D:\ so the htdocs folder is located at D:\xampp\htdocs. If I have to edit something in htdocs folder then I have to type full cd D:\xampp\htdocs\ (autocompletion is not so kind) then edit that file.  If this PowerShell were a Bash I would do this in .bash_aliases file:  alias htdocs='cd D:\xampp\htdocs'  Is it possible to maintain Bash aliases like file and alias any command in PowerShell? Finding an example of a discrete-time strict local martingale. Does DTIME(O(n)) = REGULAR? (I don't think that this is a good fit on cstheory, since I figure that this question already has a known answer.  However, if you think that this would be a better fit there, please feel free to migrate it)  It can easily be shown that REGULAR (the class of regular languages) is contained in DTIME(O(n)), because for any regular language L we can decide membership in that language in O(n) time by converting a DFA that decides L into a TM that decides L in a single pass over the input.  However, is it also true that DTIME(O(n)) is contained in REGULAR; that is, that any language that can be decided in O(n) time by a single-tape TM is necessarily regular?  I have no idea how to approach this problem, and every language I can think of in DTIME(O(n)) seems to be regular.  Intuitively, this would make sense, since if you're only allowed to make finitely many passes over the input, you could only remember finitely many things about it, which it seems like you could simulate with a sufficiently large DFA.  However, the fact that you can write to the input tape seems like it might complicate things.  And no, this isn't a homework problem.  I'm actually teaching a course that covers computability and complexity theory and thought it would be interesting to present the answer to this question in lecture. :-)  Thanks! What is the lifespan of an SSD drive? Are SSDs comparable to HDDs for reliability and is there published research on this?  Also are all SSD manufacturers at a similar 'reliability level'? How do I compile a C# script at runtime and attach it as a component to a game object The idea here is to let users program the behaviour of an agent in a way that reminds of the "Screeps" game, where you get to develop code which later runs and dictates the behaviour of your units.  My idea is to let users develop the behaviour or their units with C# code, compile that code at runtime and attach it as a MonoBehavior to an existing game object.  How can I achieve this? My wireless/WiFi connection does not work. What information is needed to diagnose the issue? Your situation   You have successfully installed Ubuntu.  You have just downloaded and booted Ubuntu live media.  The latest LTS (see also ) or latest non-LTS release are preferred. See the list of  that are currently supported.) You upgraded your Ubuntu installation to the latest release that the software updater offered you. WiFi worked before, but not now on the new release. You  to new hardware.   Your problem   The wireless of your laptop or desktop is not working. You tried switching the wireless switch off and on and you tried rebooting several times, but you don't see any WiFi access points. You can see your wireless access point, but you cannot establish a connection. You want to analyze the problem, but you don't know where to start or what information you can provide.   This question and answer was written to give people the wireless script that will provide the information needed in most cases to diagnose their wireless issue's.   Related questions This seems to be a basic issue, but I just realized that I actually don't know how to test equality of coefficients from two different regressions. Can anyone shed some light on this?   More formally, suppose I ran the following two regressions:  $$ y_1 = X_1\beta_1 + \epsilon_1 $$ and  $$ y_2 = X_2\beta_2 + \epsilon_2 $$ where $X_i$ refers to the design matrix of regression $i$, and $\beta_i$ to the vector of coefficients in regression $i$. Note that $X_1$ and $X_2$ are potentially very different, with different dimensions etc. I am interested in for instance whether or not $\hat\beta_{11} \neq \hat\beta_{21}$.   If these came from the same regression, this would be trivial. But since they come from different ones, I am not quite sure how to do it. Does anyone have an idea or can give me some pointers?   My problem in detail: My first intuition was to look at the confidence intervals, and if they overlap, then I would say they are essentially the same. This procedure does not come with the correct size of the test, though (i.e. each individual confidence interval has $\alpha=0.05$, say, but looking at them jointly will not have the same probability). My "second" intuition was to conduct a normal t-test. That is, take   $$ \frac{\beta_{11}-\beta_{21}}{sd(\beta_{11})} $$  where $\beta_{21}$ is taken as the value of my null hypothesis. This does not take into account the estimation uncertainty of $\beta_{21}$, though, and the answer may depend on the order of the regressions (which one I call 1 and 2).   My third idea was to do it as in a standard test for equality of two coefficients from the same regression, that is take  $$ \frac{\beta_{11}-\beta_{21}}{sd(\beta_{11}-\beta_{21})} $$   The complication arises due to the fact that both come from different regressions. Note that   $$ Var(\beta_{11}-\beta_{21}) = Var(\beta_{11}) + Var(\beta_{21}) -2 Cov(\beta_{11},\beta_{21}) $$ but since they are from different regressions, how would I get $Cov(\beta_{11},\beta_{21})$?  This led me to ask this question here. This must be a standard procedure / standard test, but I cound not find anything that was sufficiently similar to this problem. So, if anyone can point me to the correct procedure, I would be very grateful! New question asking form sometimes leads to accidental double posts of questions I've noticed that with the new question asking form, sometimes, attempting to submit a question will post two identical copies of the same question.  I've  (), but at the time, I assumed it was just a temporary fluke. As far as I remember, I just reviewed the question, saw no errors, and submitted it. (That's all the info I have.)  However, I just saw this happen to someone else, so it can't just be a fluke on my end. , and . The author claims there that they did indeed double click the "Review" button, but their question didn't go through since it didn't have a required tag, but when they tried to submit the question with the required tag, they only clicked it once.  Also, now that I think about it, it could not have been just a temporary client-side issue on both our ends. The system is supposed to  if one tries to post more than one question in 30 seconds. Neither of us got a CAPTCHA. This means that the server accepted the double post, and so it's a server issue.  This has the effect of denying users badges that they would have otherwise qualified for, since a single negatively-received, closed, or deleted question . This means that even if the double post is deleted and the original is upvoted, the user won't qualify for that day since they've made a "bad" question on that day. (While they may be able to later reverse this 60 days later by undeleting and re-deleting their question - questions deleted more than 60 days later aren't considered "deleted" for the check - they often won't be able to, since most of the time, users will have downvoted the double post, which also disqualifies one from the badges.)  Can an employee go through server logs to see what happened in both these cases, and add some safeguards to prevent accidental double submissions of questions? This seems to have come up when the new asking form was deployed.  Update: There was another case just now:  was . As both have the exact same time of submission, this is an instance of this bug, since as I said above, this thing is ordinarily prevented by a CAPTCHA. Why does TeX Live "require" yearly updates? Every year TeX Live provides a new version. My recollection is that soon after a new version is released, the old version's tlmgr stops fetching updates to packages. They provide  with the disclaimer     This procedure is not bullet-proof, or especially recommended   There is no upgrade path for Windows. Looking at the , it is not clear to me what is actually changing between releases such that a full new install is required/recommended. I always thought of TeX Live as providing useful binaries (e.g., pdflatex, biber, and makeindex) and a convenient way of updating  packages. What am I missing? Why does TeX Live need a new install every year? Prove that subsequence converges to limsup Given a sequence of real numbers, $\{ x_n \}_{n=1}^{\infty}$, let $\alpha =$ limsup$x_n$ and $\beta = $ liminf$x_n$.   Prove that there exists a subsequence $\{ x_{n_k}\}$ that converges to $\alpha$ as $k \rightarrow \infty$.   Not sure how to start this without since I'm not given that the subsequence is bounded.. Enabling GPU rendering for Cycles? delay JQuery effects I want to fade out an element and all its child elements after a delay of a few seconds. but I haven't found a way to specify that an effect should start after a specified time delay. Bibliography error: "Use of \blx@bbl@verbadd@i doesn't match its definition. \verb" Currently having problems with compiling my Master's thesis after downloading the newest version of TeXStudio and MiKTeX. The error message is as follows:  Use of \blx@bbl@verbadd@i doesn't match its definition. \verb   The only other place I found a similar question regarding this error message was found here:   I am not sure how this applies to my problem, but from what I understand this is due to some problem in an external file. If you need the bibliography-entry, I can provide you with that on short notice, though it is rather long (which is why I didn't include it here in the first place).  I am using Mendeley Desktop v1.16.1 to automatically generate my BibTeX database.   I am using biblatex as follows:  \usepackage[backend = bibtex,         style = numeric-comp,         sorting = none,         natbib = true,         doi = false,         isbn = true,         hyperref = true]{biblatex}   I also have some code to change how the bibliography output, but I doubt it is causing the problem, as commenting it out did not help.  Hope anyone knows what causes my problem and how to fix it.  Thanks. The Degree of Zero Polynomial. I wonder why the degree of the zero polynomial is $-\infty$ ?  I heard that, it is $-\infty$ to make the formula $\deg(fg)=\deg(f)+\deg(g)$ hold when one of these polynomials is zero. However, if that was the only reason we could have said that it is $\infty$ instead. How to plot a surface from a set of data? Disclaimer: I already read questions like  and  but these did not solve my problem.  I have this set of data:  x       y       z 2.17    0.001   0.82044815 2.17    0.002   0.82345825 2.17    0.004   0.82679255 2.17    0.008   0.83334715 2.17    0.016   0.84395915 2.17    0.032   0.8584953 2.21    0.001   0.77582165 2.21    0.003   0.78520505 2.21    0.009   0.80205985 2.21    0.027   0.83085105 2.24    0.001   0.7227885 2.24    0.002   0.73391615 2.24    0.005   0.7543979 2.24    0.015   0.78798745 2.24    0.003   0.74176635 2.24    0.009   0.77064805 2.24    0.027   0.81042375 2.26    0.001   0.66545585 2.26    0.003   0.7012046 2.26    0.005   0.721067 2.26    0.009   0.7447984 2.26    0.015   0.76715245 2.26    0.027   0.794177 2.27    0.001   0.62916195 2.27    0.003   0.6774642 2.27    0.009   0.72961785 2.27    0.027   0.7861086 2.28    0.001   0.5750828 2.28    0.003   0.65059675 2.28    0.005   0.6802631 2.28    0.009   0.7145367 2.28    0.015   0.74447695 2.28    0.027   0.7774403 2.29    0.001   0.51357255 2.29    0.002   0.581053 2.29    0.003   0.6173075 2.29    0.009   0.6972096 2.29    0.027   0.76793225 2.31    0.001   0.36997965 2.31    0.002   0.474415 2.31    0.003   0.53649295 2.31    0.009   0.6587164 2.31    0.016   0.70870255 2.31    0.027   0.7482423 2.31    0.05    0.7912395 2.34    0.001   0.2204104 2.34    0.002   0.316308 2.34    0.003   0.39256745 2.34    0.004   0.45240835 2.34    0.009   0.5883453 2.34    0.016   0.6590771 2.34    0.027   0.71444205 2.34    0.05    0.7690014 2.38    0.001   0.13286995 2.38    0.002   0.1828288 2.38    0.004   0.2980268 2.38    0.008   0.4507145 2.38    0.016   0.58417075 2.38    0.032   0.6833616   And if I plot it in Mathematica (with ListPlot3D[data]) it looks, without further tweaking and fiddling around, like:    But if I try this pgfplots code  \begin{tikzpicture}   \begin{axis}     \addplot3 [surf] table {data.txt};   \end{axis} \end{tikzpicture}   I only get this:    What do I have to do to get a surface like in Mathematica (color, smoothness, style, etc. does not matter, just a closed surface)? Compute the (multiplicative) inverse of $4x+3$ in the field $\frac {\Bbb F_{11}[x]}{\langle x^2+1 \rangle}$? So I am finding a polynomial $px+q$ ($p,q \in \Bbb F_{11}$) which is multiplicative inverse of $4x+3$ in $\frac {\Bbb F_{11}[x]}{\langle x^2+1 \rangle}$.  i.e. $[(4x+3)+\langle x^2+1 \rangle][(px+q)+\langle x^2+1 \rangle]=1+\langle x^2+1 \rangle$   $\Rightarrow$  $(4x+3)(px+q)+\langle x^2+1 \rangle=1+\langle x^2+1 \rangle$  $\Rightarrow$  $4px^2+(4q+3p)x+3q+\langle x^2+1 \rangle=1+\langle x^2+1 \rangle$.  We see that the remainder,when $(4x+3)(px+q)$ is divided by $x^2+1$, is $1$. So by Division algorithm,  $$ \require{enclose} \begin{array}{r} 4p \\[-3pt] x^2+1 \enclose{longdiv}{4px^2+(4q+3p)x+3q} \\[-3pt] \underline{4px^2+4p} \\[-3pt] (4q+3p)x+(3q-4p) \\[-3pt] \end{array} $$    So I equate $(4q+3p)x+(3q-4p)=1$ and solve the simultaneous linear equations  $4q+3p=0, 3q-4p=1$. I get $p=6,q=1$  Hence $6x+1$ is the required inverse.  I am pretty sure that the answer is correct but is the method to achieve it right? I am looking for a novel that I'd love to re-read it with my wife (my 13-year old self must be proud of me I guess). Key Plot points The plot was about humanity finding an alien station on an orbit of Earth. (I'm not sure if it wasn't Moon itself). On this station there were thousands of ships ready to travel so there rose a company that paid people to get on those ships and explore the galaxy. The problem was humans didn't understand how to steer those ships so they had to rely on preset targets. Of course there was no telling where particular ship was to go and fair amount of them never returned. Chronology and other relevant information I read it as an early teenager back in early 2000s. It was Polish translation of a foreign (possibly English) story. I think (not sure) that the book wasn't new at the time. It was just one of those books you dig out in a library and take to see if it's good. I don't recall cover either and even if I did it'd be of the Polish version. Additional information could be that the narration was led along the psychoanalytics of the main protagonists where he relives his memories from inside the station and his journeys. Prove $\chi(G)\chi(\bar{G}) \geq n$ for chromatic number of graph and its complement How many characters have appeared in both Marvel and DC comics?