I'm making an application which edits specific memory addresses of a process chosen by the user. I've to convert a string for example "0x7ffe0030,0x7ffe6000" to a list of strings and for every string in the list I've to paste the plain text of the string as int for example: if the string is "0x7ffe0030", the int must be 0x7ffe0030.  I've trivially tried to do that:  foreach (var address in addressListRaw) {  int a = Int32.Parse(address); }   but it obviously doesn't work.  Console.WriteLine("Select the memory addresses to modify.\n" +             "You can write more than one address separating\n" +             "every address using the character ','\n" +             "example: 0x7ffe0030,0x7ffe6000");   string addressesRaw = Console.ReadLine(); List&lt;string&gt; addressListRaw; addressListRaw = addressesRaw.Split(',').ToList();  foreach (var address in addressListRaw) {  int a = Int32.Parse(address);  Console.WriteLine(a.ToString()); }
uint color;  bool parsedhex = uint.TryParse(TextBox1.Text, out color);  //where Text is of the form 0xFF0000 if(parsedhex)    //...   doesn't work. What am i doing wrong?
Performing Raster Reclassification in QGIS? Is there a way to perform a reclassify of a raster image in QGIS?  In ArcGIS you can do that in Spatial analyst Tools→Reclass→Reclassify  Any ideas? As a new user without much rep, what should I do if someone else has already asked a question I have, but it has no answers? Suppose you had a question, and you really want a good answer that would solve your problem, but noticed it was already asked by someone else. However, no one has posted any answers. The question is technically considered "unanswered", but a lot of users who would otherwise bother to give a correct answer probably skip the question completely for some reason.  What should I do in this case?  One idea is to ask a new, completely identical question, in the hope users will notice the new question and post an answer there. But would that go against SE policy?     Note: This is adapted from , but that doesn't cover the case where the original question is unanswered. Also, it is not a duplicate of , as that question asks about getting attention for one's own questions, while this one and the one linked above ask about getting an answer if someone else has already posted the same thing. Is there any difference between “which” and “that”? Make browser window blink in task Bar How do I make a user's browser blink/flash/highlight in the task bar using JavaScript? For example, if I make an AJAX request every 10 seconds to see if the user has any new messages on the server, I want the user to know it right away, even if he is using another application at the time.  Edit: These users do want to be distracted when a new message arrives. Currently, a user does not get any notification when a trivial edit (less than 6 characters, by a user who has the ) is made on one of his/her posts. As in .  Even though the user is trust-worthy (owing to the rep of the user), wouldn't it be nice for the OP to get a notification whenever an edit is made, even trivial? Can the Flash do things like build muscle faster than normal (do his muscles grow right after a work-out or meal)? Can he heal faster than normal? Does he have a faster immune system to stop all illness or at least make the flu last 2 minutes or something along those lines? Embedding ordinals in $\mathbb{Q}$ All countable ordinals are embeddable in $\mathbb{Q}$.  For "small" countable ordinals, it is simple to do this explicitly.  $\omega$ is trivial, $\omega+1$ can be e.g. done as $\{\frac{n}{n+1}:n\in \mathbb{N}\} \cup \{1\}$.   $\omega*2$ can be done as $\{\frac{n}{n+1}:n\in \mathbb{N}\} \cup \{1+\frac{n}{n+1}:n\in \mathbb{N}\}$, and $\omega*n$ as $\bigcup_{i\le n} \{i+\frac{n}{n+1}:n\in \mathbb{N}\}$  That immediately also gives $\omega^2$ as  $\bigcup_{i \in \mathbb{N}} \{i+\frac{n}{n+1}:n\in \mathbb{N}\}$  And going further is still relatively easy: We can biject the above embedding of $\omega^2$ onto a single interval $(0,1)$, e.g. through $f(x)=1-\frac{1}{x+1}$ since this is an order preserving bijection from $\mathbb{Q}^+$ to $(0,1)$, allowing us to get $\omega^2+n$, $\omega^2*n$ etc. And by iterating that process, we can get any ordinal below $\omega^\omega$.   But this sort of embedding fails at $\omega^\omega$ as the iteration of $f$ doesn't seem compatible with taking the infinite union - figuratively speaking, we'd squish things to $0$. So what would an explicit embedding of $\omega^\omega$ look like? And the question, then, is if it is possible to give an explicit embedding of $\epsilon_0$? Is the fact that Peano arithmetic cannot prove well-foundedness of $\epsilon_0$ an indication that it cannot be embedded by such elementary functions and their iterations?  And what about even bigger countable ordinals such as the Veblen ordinals, Feferman-Schütte, Bachmann-Howard? From its definition, even if the above all are possible, I assume that the definitive bound of where one can define an effective procedure for the embedding must be Church–Kleene - is that a correct conclusion?  Lastly, does the situation change when we use $\mathbb{R}$ instead of $\mathbb{Q}$, which would allow us to use, perhaps, more easily understood yet inherently complex functions?  Edited because $\omega^2 \neq \omega^\omega$ Prove by induction. How do I prove $\sum\limits_{i=0}^n2^i=2^{n+1}-1$ with induction? $\displaystyle\sum_{i=0}^n2^i=2^{n+1}-1$.  I don't understand induction so I could use some help. What are the uses of "using" in C#? I would like to know how to write the Exec command of a .desktop file to open a new terminal and execute a shell script in it. The shell script is working and accessible by all users. When launching the script from the terminal everything works, but it doesn't when trying to launch the script from a .desktop file.  Here are some combinations I have already tried:  Exec=gnome-terminal -x sh -c 'echo hello' Exec=sh -c 'gnome-terminal echo hello' Exec=sh -c 'echo hello' Exec=echo hello   The .desktop terminal option is set to true. How to install Chrome browser properly via command line? I am trying to install chrome browser via command line.  I tried this:  $ apt-cache search chrome browser   The results show that the proper term is "chrome-browser," so I tried that:  $ sudo apt-get install chrome-browser   And then "Y" for the Y/n question.  But the installation threw errors.  Does someone see anything wrong with the commands I issued? In Stein's Fourier Analysis i'm having trouble Justifying the following calculations for the Fourier Coefficients in $(1.)$  $(1.)$  Let $f(\theta) = \theta$ for $ -\pi \leq \theta \leq \pi$ in the case when $n \neq 0$:  $$f(n)=\frac{1}{2 \pi}\int_{-\pi}^{\pi}\theta e^{-in \theta} d \theta = \frac{1}{2 \pi}[-\frac{\theta}{in}e^{-in \theta}]_{-\pi}^{\pi} + \frac{1}{2 \pi in} \int_{-\pi}^{\pi}e^{-in\theta}d \theta = \frac{(-1)^{n+1}}{in} $$  Then the Fourier Series of $f$ is given by:  $$ f(n) = \sum_{n \neq 0}  \frac{(-1)^{n+1}}{in}$$ Is there a way to determine the respective canonical status of Tolkien's Middle-earth related works? It is almost always difficult to determine the canonicity (if that's a word) of different works within a fictional universe, but the problems are even more complicated in regards to Tolkien's Middle-earth/Arda related material.  It is safe to say that LotR, the second edition of The Hobbit, and probably the published Silmarillion are canon.  But even the published Silmarillion is, in large part, the work of Christopher Tolkien, although to a lesser degree than it is the work of his more famous father.    When we look at the rest of the corpus, things become even more opaque.  Unfinished Tales contains different versions of the same stories.  The same is true, in even greater degree, of The History of Middle-earth.  These volumes might be considered an almost equal endeavor on the parts of Christopher and J.R.R Tolkien.    Is there a tentative canon of Tolkien's Middle-earth related works, and if not, is it possible to create one?    With such a large body of work, of varying degrees of canonicity, it would be very helpful to have something like the now-outdated levels of canon associated with the Star Wars universe, ranked by a series of letters.  Has anyone put together such a system for Tolkien's Middle-earth related works? Array versus List: When to use which? MyClass[] array; List&lt;MyClass&gt; list;   What are the scenarios when one is preferable over the other? And why? "Total number of votes for 'N' answers" is wrong in "Deleted Recent Answers" Below are the two screenshots. First one shows the number of votes          In above image a post which was deleted shown ) votes. Now in below image which is actual post deleted is having 1 vote. Show that for $\eta > 0$, $\alpha_\eta=-\infty$ and for the Cauchy problem $z'=x-z^2,z(0)=\eta$ the saturated solution is defined up to $+\infty$. We consider the differential equation $y'=x+y^2$ and for any $\eta \geq 0$ we denote by $\phi_\eta:(\alpha_\eta,\beta_\eta)\rightarrow\mathbb{R}$ the unique saturated solution of the Cauchy Problem $y'=x+y^2$, $y(0)=\eta$. I am required to do the change of variable $z(x)=y(-x)$ and I succeded here, obtaining $y'(-x)=y^2(-x)-x$ and so $z'(x)=x-z^2(x)$, then I was required to represent the $0-isocline$ and it was also simple as I obtained a parabolla and also I was required to write the equation of the tangent in the point $(0,\eta)$ which was also pretty simple as I obtained $\phi'_\eta(0)=\eta^2$ and the equation of the tangent is $y=\eta+\eta^{2}x$. Now, I am required to find $\phi^{(5)}_0(0)$( that $5$ indicates the number of differentiations), which puzzles me as I don't know the form of the solution and if it can be found out and also I am told to show that $\frac{1}{\eta}\geq\beta_\eta$ What I did not prove after the first edit : and that for $\eta &gt; 0$, $\alpha_\eta=-\infty$ and for the Cauchy problem $z'=x-z^2,z(0)=\eta$ the saturated solution is defined up to $+\infty$. At this last ones I am lost. Any help, please? Edit: I have passed beyond finding $\phi^{(5)}_0(0)$ and I think I did show that $\frac{1}{\eta}\geq\beta_\eta$, now it remains to prove the last questions. Generalized RBF Kernels There is the notion of Generalized RBF Kernels, for example in "Towards Optimal Bag-of-Features for Object Categorization and Semantic Video Retrieval" from Jiang (1) or in formula (2.72) in  (2).  They define: Gen. RBF Kernel: $e^{-pd(x,y)}$, where (1) says d can be any distance function and (2) requires it to be a metric.  I now have been wondering for a long time: Is a function defined by $e^{-pd(x,y)}$ where d is a metric always a Mercer's Kernel? I think in (2) it sounds like it, but if it were true, not many people know of it, since they are still looking to prove that $e^{-EMD(x,y)}$ is a kernel, where EMD = Earth Mover's Distance, which is a metric.  If its not a Mercer's Kernel - do you know of any counter example? What is the name of the vertical bar in $(x^2+1)\vert_{x = 4}$ or $\left.\left(\frac{x^3}{3}+x+c\right) \right\vert_0^4$? I've always wanted to know what the name of the vertical bar in these examples was:  $f(x)=(x^2+1)\vert_{x = 4}$ (I know this means evaluate $x$ at $4$) $\int_0^4 (x^2+1) \,dx = \left.\left(\frac{x^3}{3}+x+c\right) \right\vert_0^4$ (and I know this means that you would then evaluate at $x=0$ and $x=4$, then subtract $F(4)-F(0)$ if finding the net signed area)  I know it seems trivial, but it's something I can't really seem to find when I go googling and the question came up in my calc class last night and no one seemed to know. Also, for bonus internets; What is the name of the horizontal bar in $\frac{x^3}{3}$? Is that called an obelus? Find the expected value of $\frac{1}{X+1}$ where $X$ is binomial The problem:  X is a binomial random variable, find $E[\frac{1}{X+1}]$ n and p are not given  PDF for a binomial distribution is $\binom{n}{k}p^k(1-p)^{n-k}$  Expected value is $\sum{x_ip(x_i)}$  But this is where I get stuck, I'm really rusty on my statistics and I'm not sure exactly how to structure it in the next step? I think I want to get the form of the following out of the summation  $\sum _{k=0}^{n} \binom{n}{k}p^k(1-p)^{n-k} = (p + 1 - p)^n = 1$  But I'm not sure if it should look like  $\sum \frac{1}{xp(x)+1} $  and if it should where to go from here? How to send text to Notepad in C#/Win32? I'm trying to use SendMessage to Notepad, so that I can insert written text without making Notepad the active window.  I have done something like this in the past using SendText, but that required giving Notepad focus.  Now, first I'm retrieving the Windows handle:  Process[] processes = Process.GetProcessesByName("notepad"); Console.WriteLine(processes[0].MainWindowHandle.ToString());   I've confirmed it's the right handle for Notepad, the same shown within Windows Task Manager.  [DllImport("User32.dll", EntryPoint = "SendMessage")] public static extern int SendMessage(int hWnd, int Msg, int wParam, int lParam);   From here, I haven't been able to get SendMessage to work in all my experimentation.  Am I going in the wrong direction?