"I am seeing" or "I am going to see"?
Present continuous and simple future
Merging bib files from within LaTeX What's the difference between Invoke() and BeginInvoke() Just wondering what the difference between BeginInvoke() and Invoke() are?   Mainly what each one would be used for.  EDIT: What is the difference between creating a threading object and calling invoke on that and just calling BeginInvoke() on a delegate? or are they the same thing? What is a "callback" in C and how are they implemented? From the reading that I have done, Core Audio relies heavily on callbacks (and C++, but that's another story).    I understand the concept (sort of) of setting up a function that is called by another function repeatedly to accomplish a task.  I just don't understand how they get set up and how they actually work.  Any examples would be appreciated. Reflexive and relation Please give me feedback on my answer to this question. Question:  For all $x,y\in R$ define that $x\equiv y$ if $x^{2}=y^{2}$. Then $\equiv$ is an equivalence relation on $R$, there are infinitely many equivalence classes, one of them consists of one element and the rest consist of two elements. Answer: False, since;  $x\equiv y$   if $x^{2}=y^{2}$  on $R$  To show $\equiv$   is reflexive, we need to show that ,  $\forall x\in R:X\equiv x.$  Let $x\in R$,   $X\equiv x$   if $X^{2}=x^{2}$  , which is obvious.  $[x]\triangleq:\{y\in R/x\equiv y\}$  $[0]=[y\in R/0\equiv y\},$  when $y=0$,  Then $y^{2}=0^{2}=0$  Thus; there are not many infinity many equivalence classes. I have a samba share on my LAN that requires a username and password to obtain write access (otherwise it defaults to read-only).  I can't figure out where in the Unity desktop I can connect to the share and be prompted for my login credentials.  I can mount the drive, of course, but then I'm browsing as a guest (read-only).  What gives? Is there a way to choose a beginning and ending edge and auto select all the edges in between? I have been using Blender for quite a long time and I just want to make sure that there isn't a better way of selecting edges, that I might not be aware of. It is so cumbersome to have to click every single edge when I don't want to select an entire edge loop but a portion of one instead. I was wondering if there is some way in to specify a start edge and an end edge and then be able to auto select every edge in between? How do I choose an element from a non-empty set? Suppose I have a non-empty set $A$.     How do I choose an element $x\in A$?   More precisely, I believe I would like to find a formula $P(x,y)$ of ZF such that for every non-empty set $y$ there is exactly one $x\in y$ such that $P(x,y)$ is true.  I have thought about this for a while without success and I am beginning to doubt such a formula is even possible. But in mathematical proofs it is quite common to "choose a fixed element" from a non-empty set. So how exactly do we achieve such a thing? Am I missing something?  Thank you in advance. Terence Tao, Analysis I, Ex. 5.5.2: Entry point needed Terence Tao, Analysis I, 3e, Exercise 5.5.2:     Let $E$ be a non-empty subset of $\mathbb{R}$, let $n \ge 1$ be an   integer, and let $L &lt; K$ be integers. Suppose that $K/n$ is an upper   bound for $E$, but that $L/n$ is not an upper bound for $E$. Without   using Theorem 5.5.9, show that there exists an integer $L &lt; m \le K$   such that $m/n$ is an upper bound for $E$, but that $(m-1)/n$ is not   an upper bound for $E$. (Hint: prove by contradiction, and use   induction. It may also help to draw a picture of the situation.)    does not do the trick for me, since I'm looking for the proof by contradiction, equipped only with the set of propositions and theorems covered so far.  What I'm actually looking for is an entry point to the proof, since I find it quite hard to negate the assumption.  My attempt is to induct over $n$. Assume I have been able to prove the statement for $n = 1$, is the following a valid negation of the assumption?  For all integers in the range $(L, K]$, at least one of the following statements holds:   $(m-1)/(n+1)$ is not an upper bound and $m/(n+1)$ is not an upper bound. $(m-1)/(n+1)$ is an upper bound and $m/(n+1)$ is not an upper bound. $(m-1)/(n+1)$ is an upper bound and $m/(n+1)$ is an upper bound.   If I were able to prove that there is an integer in the given range such that none of the above holds, am I done?       Theorem 5.5.9 (Existence of least upper bound). Let $E$ be a non-empty subset of $\mathbb{R}$. If $E$ has an upper bound, (i.e.,   $E$ has some upper bound $M$), then it must have exactly one least   upper bound.     I went through another loop considering  of Steve Kass, but I ended up wondering why the proof needs induction at all:  Assume for all integers $m$ where $L &lt; m \le K$ we have that $m/n$ and $(m-1)/n$ are upper bounds of $E$. Then $(m-1)/n = L/n$ is also an upper bound. But $L/n$ is no upper bound, by assumption. Assume $m/n$ and $(m-1)/n$ are no upper bounds. Then $m/n = K/n$ is also no upper bound. But $K/n$ is an upper bound, by assumption.   Hence, there is an integer in the range $(L, K]$ s.t. $m/n$ is an upper bound for $E$, and $(m-1)/n$ is not. GeoReference tiff image into the Google map? I want to Geo-reference a tiff image contain a Map for a specific region, I need to add this region(image) and Geo-reference it on the Google map, SO I can see on the map for the region I select the image which I have inserted.  the image also need information such as the Latitude and Longitude of corners and size, and the pixel per meter measurement.  How to do the correct Geo-reference for that ? Proper to add tense to acronyms, abbreviations and initialisms Diamond is not shown for mod name under wiki posts If a diamond mod is an author of a wiki post then the diamond is not displayed besides the mod name. E.g. :        Even when the name refers to the user profile page (in case of more then one author) like in :        Is it intentional or a bug? Prevent mail being marked as spam This is a  about avoiding outgoing mail being classified as spam.   Also related:                    I'm wondering how to prevent my emails from my site being marked as spam? I'm using sendmail.  I'm trying to send emails through my ruby-on-rails application. The mails are all written in swedish (if that does make a difference?). I don't know why they keep getting marked as spam.  Are there any things that I can do to minimize the risk? Help with math symbols in BibTeX How do I explain current and voltage to a lay man? A man asked me this question in suburban train when I told him that I am an electrical engineer. Of course I replied him that current is the flow of electrons and in order for the current to flow there should be a potential difference between them. But the man didn't know what electron or potential difference was either. Need help finding a good book on Riemann Geometry How to programmatically send SMS on the iPhone? How to write (La)TeX (with parentheses) [or any other TeX-related logo] I'm looking after a macro to write the (La)TeX logo (with parentheses), i.e. something similar to \TeX, \LaTeX, but where the output includes ()'s. Limit of Multivariate Probability Density Function as one or more or all variables approach positive or negative infinity Could someone point out a good source or provide justification as to whether the limit of a multivariate probability density function, as one or more or all variables tends to positive or negative infinity, goes to zero.  $$\lim_{x_{1}\to\pm\infty}f(x_{1},x_{2},...,x_{n})=0$$  $$\lim_{x_{1},x_{2}\to\pm\infty}f(x_{1},x_{2},...,x_{n})=0$$  $$\lim_{x_{1},x_{2},...,x_{n}\to\pm\infty}f(x_{1},x_{2},...,x_{n})=0$$  I have found this related question for the univariate case: Apache answer both HTTP and HTTPS on the same port I want to write a conditional expression such as the following.    What is the best way to express such conditional expressions in Latex?