Are portions of amorphous matter objects?
Can the Telekinesis spell be used to manipulate liquids?
I want to create a standalone python script using QGIS python API (PYQGIS) for education. First I create a model and export that model to python script.  original python script from the export :  ##=name ##raster=raster ##stat=output html outputs_QGISRASTERLAYERSTATISTICS_1=processing.runalg('qgis:rasterlayerstatistics', raster,stat)   Next I read this  and I tried to follow this tutorial to create my script.  Final script :  import sys from qgis.core import QgsApplication from PyQt4.QtGui import QApplication app = QApplication([]) QgsApplication.setPrefixPath("/usr", True) QgsApplication.initQgis()  # Prepare processing framework  sys.path.append('/home/username/.qgis2/python') from processing.core.Processing import Processing dem='aster.tif' slope='slope.tif' aspect='aspect.tif' outputs_SAGASLOPEASPECTCURVATURE_1=processing.runalg('saga:slopeaspectcurvature', dem,6,1,1,slope,aspect,None,None,None,None,None,None,None,None,None,None) Processing.initialize()  # Exit applications QgsApplication.exitQgis() QApplication.exit()   If I run this script it works fine without error but I don't take some export like aspect and slope (these can't be found?). Any idea why I can't take exports ?  I use Ubuntu and python 2.7 and QGIS 2.18.1.    i try to this script :  import sys from qgis.core import QgsApplication sys.path.append('/usr/share/qgis/python/plugins') import processing a=processing.alglist() print a processing.alghelp("saga:slopeaspectcurvature")   and i take that print any idea why ?  Algorithm not found   but if i use this module in QGIS work fine. Is it ever bad to use \left and \right? Scripting `rm` and `rm -i` I want to create a script that whenever there are more than three files being removed, it invokes rm -i by default. I know it will go in initialization files but can't seem to get it working.  So far:  if [$file -ge 3]; then   rm -i    exit 0  else   rm exit 1 How to trick a command into thinking its output is going to a terminal Given a command that changes its behaviour when its output is going to a terminal (e.g. produce coloured output), how can that output be redirected in a pipeline while preserving the changed behaviour?  There must be a utility for that, which I am not aware of.  Some commands, like grep --color=always, have option flags to force the behaviour, but the question is how to work around programs that rely solely on testing their output file descriptor.  If it matters, my shell is bash on Linux. Does a finite $[E:K]_s$ imply that $[E_s:K]$ is finite? Let $E/K$ be an algebraic extension of fields and denote by $E_s$ the separable closure of $K$ in $E$, i.e. the set of all elements of $E$ that are separable over $K$ (which can be shown is a (separable) subfield of $E$).  I would like to show that the implication     $\left[E:K\right]_s &lt; \infty \implies \left[E_s:K\right] &lt; \infty$   holds, where $\left[E:K\right]_s$ denotes the separable degree of $E/K$ and $\left[E_s:K\right]$ the 'ordinary' degree of $E_s/K$.  In the textbook I am learning with, it is said that one could use the Primitive Element Theorem to do this, but I would also be fine with any other approach, as long as it's not getting too fancy and staying in the realm of 'common' textbook theorems known when dealing with separable extensions (and I didn't see how the Primitive Element Theorem would help).  This is not my focus (I want to write a Bachelor's thesis about polynomial factorizing elements of $\mathbb{Z}[X]$), but I'm in the process of reading into commutative algebra after about 1.5 years break from it.  My idea was something like assuming $\left[E_s:K\right] &lt; \infty$ and $\left[E_s:K\right] = \infty$ to construct infinitely many $K$-homomorphisms $E_s/K \longrightarrow C/K$, where $C$ is some algebraic closure of $E_s$, which would then contradict $\left[E_s:K\right]_s = \left[E_s:K\right] &lt; \infty$. Of course, an infinite basis would yield infinitely many $K$-vector space homomorphisms, but getting (infinitely many) ring morphisms seems to by an entirely different ting (unsurprisingly so...). Thought of using something like     Given two roots of the minimal polynomial of one of the infinitely many elements of a $K$-basis of $E_s/K$, there is a $K$-morphism $E_s/K \longrightarrow C/K$ that sends one to the other.   but this didn't seem very fruitful. I admit I haven't spent hours on this, I just didn't get very far and should focus on moving on, while still getting an answer on the 'howto' along the road would be really nice. Placing a single algorithm in two columns Why are my photos not crisp? I use a Canon EOS Rebel T3i (600D) with the kit lens. I have experimented a lot with different settings and modes, but I feel like I have wasted many good shots that could have looked amazing, if only they were a little bit sharper.  I use auto-focus on most of my pictures and make sure to choose the right focus point, but all of my photos are still a little bit out of focus. When I zoom in, I can see that the pixels are not very crisp or well-aligned.  I am not sure if this issue is caused by my equipment or skills. What is the difference between "I am done" and "I am through"? is it possible to redefine { and } in C? What "allocation unit size" should I use for a drive with a single NTFS partition? I'm formatting a 1TB external hard drive as a single NTFS partition.  This drive is mainly meant for storing media.  Should I choose something other than the default allocation unit size?  The options range from 512 bytes to 64K.  Are there any guidelines that I should use with partitions storing other data?  Should I stop poking around and just leave it at "default"? How to type special/accented letters in LaTeX? How to type these special letters from European languages in latex? ä, é, and L'? Proving the cross product matrix tranformation identity with an alternative solution I'm solving a problem from the book, Mathematics for 3D Game Programming and Computer Graphics, Third Edition, by Eric Lengley. The problem goes:  Let $N$ be the normal vector to a surface at a point $P$, and let $S$ and $T$ be tangent vectors at the point $P$ such that $S \times T = N$. Given an invertible 3 $\times$ 3 matrix $M$, show that $(MS) \times (MT) = (\text{det}M(M^{-1})^{T}(S \times T)$, supporting the fact that normals are correctly transformed by the inverse transpose of the matrix $M$.  The author provided a hint stating we can represent $(MS) \times (MT)$ as $$ (MS) \times (MT) = \begin{bmatrix} 0 &amp; -(MS)_{z} &amp; (MS)_{y} \\  (MS)_{z} &amp; 0 &amp; -(MS)_{x} \\  -(MS)_{y} &amp; (MS)_{x} &amp; 0  \end{bmatrix} MT $$ We then find a matrix $G$ such that $$ GU = \begin{bmatrix} 0 &amp; -(MS)_{z} &amp; (MS)_{y} \\  (MS)_{z} &amp; 0 &amp; -(MS)_{x} \\  -(MS)_{y} &amp; (MS)_{x} &amp; 0  \end{bmatrix} M $$ where $$ U = \begin{bmatrix} 0 &amp; -S_{z} &amp; S_{y} \\  S_{z} &amp; 0 &amp; -S_{x} \\  -S_{y} &amp; S_{x} &amp; 0  \end{bmatrix} $$ and show that $G = (\text{det}M)(M^{-1})^{T}$ to solve the problem. I am aware that there is an  to this problem, but I would like to solve it through the hints provided. Unfortunately, I am only able to go as far doing: $$ G = \begin{bmatrix} 0 &amp; -(MS)_{z} &amp; (MS)_{y} \\  (MS)_{z} &amp; 0 &amp; -(MS)_{x} \\  -(MS)_{y} &amp; (MS)_{x} &amp; 0  \end{bmatrix} M U^{-1} $$ At this point, I do not know how to proceed with showing that $G = (\text{det}M)(M^{-1})^{T}$. How would you proceed? I'd like to ask for hints on solving the problem. Simple way of finding the locus of $z$? I am tasked to sketch the locus of complex numbers $z$ that satisfies $$(z-2+i)^2 + (z^*-2-i)^2 + 2zz^* + 6 = 0$$ I was wondering if there’s a special trick to this question, or if this is only solvable by plugging in $z=x+iy$ ? I noticed that the second term is the conjugate of the first, and wanted to substitute $w = z-2+i$, however this gives me a complicated expression for $zz^*$ which makes it more confusing. Is there a trick I’m missing out? Thanks! Edit: I have already solved it through direct substitution (parabola intersecting real axis at $x=3$ and $x=-1$) but it took a good 5 minutes or so, expanding everything correctly, which seems rather long (I was attempting it under exam conditions). I was just wondering if it is possible to exploit the $w$ substitution I made in particular. Use the view from other cameras in the scene as VideoTexture in Cycles I have a scene with monitors that display video from cameras in the same scene (or other scenes, but all of them are linked i.e., same objects in the scene). The cameras shown on the monitors do not view the monitors, so no looping should occur.  I found  that shows how to get the effect in the Game Engine.  I would like to do this in cycles.  Essentially I would like a material input node that corresponds to the output of the composition of a particular scene. The incoming image should honor the render settings of the particular scene and any compositing applied to it.  The Render Layer node does not appear to honor the resolution or compositing settings of the scene it comes from, and is not available to apply as a texture in the material node editor (that I can find).  I understand that this could be done by rendering the animation from the various cameras, then applying that video as textures to the monitors, then rendering the camera of the monitors. That's super tedious if your making changes to the whole scene, and I don't want to do that. When choosing cards for a deck, one of the most important things to consider is the number of land you put in. The biggest issue is mana curve, of course. What shortcuts are best for determining the proper amount of land with a given mana curve? What constitutes an observation/measurement in QM? Fundamental notions of QM have to do with observation, a major example being The Uncertainty Principle.    What is the technical definition of an observation/?  If I look at a QM system, it will collapse. But how is that any different from a bunch of matter "looking" at the same system?  Can the system tell the difference between a person's eyes and the bunch of matter?  If not, how can the system remain QM?  Am I on the right track? Some webpages forces mobile version even I change user-agent. I changed user-agent in built-in browser and "Dolphin Browser HD",  I am checking it on page www.user-agent-string.info  Main problem is engadget.com, always in mobile version. I tried to clean cookies, restart browsers etc.  This is my results:   in built-in browser, user-agent - "desktop"   () doesn't work, redirects to mobile version   in "Dolphin Browser HD", user-agent - "desktop"    (NSFW: redtube.com) doesn't work, redirects to mobile version  (allegro.pl) works fine  in "Dolphin Browser HD", user-agent - "IPad"   () doesn't work, redirects to mobile version  (allegro.pl) works fine (NSFW: redtube.com) works fine  in "Dolphin Browser HD", user-agent - "custom": Mozilla/5.0 (Windows NT 6.0; rv:7.0.1) Gecko/20100101 Firefox/7.0.1   (engadget.com]) doesn't work, redirects to mobile version  (NSFW: redtube.com) doesn't work, redirects to mobile version  (allegro.pl) works fine    Maybe this pages using "adobe flash" user-agent detection ?  (I'am using Asus Transformer TF101, Android 3.2.1, Adobe Flash Player 11) How do you kill a java.lang.Thread in Java? Borel-Cantelli-related exercise: Show that $\sum_{n=1}^{\infty} p_n < 1 \implies \prod_{n=1}^{\infty} (1-p_n) \geq 1- S$. This is supposed to be related to the  (my justification for the independence tag). In Williams' Probability with Martingales, 2BCL is proven and then the following is given as an exercise:  Prove $S \doteq \sum_{n=1}^\infty p_n &lt; \infty \implies \prod_{n=1}^\infty (1-p_n) &gt; 0$ assuming $0 \leq p_n &lt; 1$. Hint: Show that $S &lt; 1 \implies \prod_{n=1}^\infty (1-p_n) \geq 1 - S$.   Proving the hint: I tried to find $\{a_n\}$ s.t. $$\prod_{n=1}^\infty (1-p_n) \geq \prod_{n=1}^\infty e^{a_n} = e^{\sum_{n=1}^\infty a_n} \geq 1 - \sum_{n=1}^\infty a_n \geq 1 - S &gt; 0$$ That is, find $\{a_n\}$ s.t.: 1a. $1 - p_n \geq e^{a_n}$ 1b. $a_n \leq p_n$ I thought of $a_n = \ln(1-p_n)$ (a reason why $p_n &lt; 1$, I guess) Is that right? Edit: Actually, assuming my proof is right, is $S &lt; 1$ used in the proof? If so, where?  From Williams book: Subgroup of $\mathbb{R}$ either dense or has a least positive element?