Best performance evaluation measure for GARCH model?
Evaluate forecasting ability of GARCH models with RMSE and MAE
R linear regression categorical variable "hidden" value Help resizing posted images I often add pictures to my questions. Most of the time they come out the right size. Well, that used to be OK always, up until I started posting screenshots taken by my mobile. For example, this one:  This way, I'm sure you'll agree it is huge, decidedly too big, it takes up the whole body of the question, I mean. At present, the only way I have to resize it is the following code: &lt;sub&gt;(Click image to enlarge)&lt;/sub&gt;  [&lt;img src=&quot;http://i.stack.imgur.com/hKmRp.jpg&quot; width=&quot;210&quot; height=&quot;350&quot; alt=&quot;&quot;&gt;][1]  which I do not remember, and always have to recover from . Is there a simpler, less HTML-hacky (and, I'd expect, more Markdown-based) way of resizing it? PS The output of the above code is: (Click image to enlarge) How to convert QString to std::string? Chromatic Number The smallest number of colors needed to color a graph $G$ is called its chromatic number, and is often denoted $\chi(G)$.  Show that if graph $G$ is simple, then $$ \chi \ge \frac{V^2}{V^2 - 2E}. $$ Let $f:[0;1]\to\mathbb R$ be continiously differentiable This is a reformulation of a deleted question:  If  $a_1 &gt; 0$ and $a_2 &gt; 0$ and $2a_{n+2} \le a_{n+1}+a_n$,  show that  $\lim \sup a_n \le \frac23 a_2 + \frac13 a_1$.  My proof involves showing that $a_{n+2} \le u_{n} a_{n+1} + (1-u_n)a_n $ where $u_n \to \frac23$, and I wondered if there is a simpler proof.  I will post my proof in a couple of days if no one does. "wait more than" vs. "wait FOR more than" If you make him wait (for) more than ten minutes, he'll just walk away.  I found both instances on Google Books:  and . So I'm a bid confused. Before I start, don't lecture me on the fact that FAT32 is old and hasn't been updated for nearly 20 years. Right now I have sorted that. I am trying to install Ubuntu Linux onto a 64GB flash drive and it wants me to format it to one of the EXT file systems.  The problem is if I put the flash drive into a Windows PC, I can't use it. I also can't install the required software onto every Windows PC that I will use. When I tried to install it on FAT32 I got an error and there is no option for NTFS.  Does anyone know how I could do this? Maybe a Windows based tool? Thanks in advance. Suppose $\lim \limits_{n \to ∞} a_n=L$. Prove that $\lim\limits_{n \to ∞} \frac{a_1+a_2+\cdots+a_n}{n}=L$ I have a problem when a lot of figures are in question. Some figures tend to "fly around", that is, be a paragraph below, although I placed them before that paragraph. I use code:  \begin{figure}[ht] \begin{center} \advance\leftskip-3cm \advance\rightskip-3cm \includegraphics[keepaspectratio=true,scale=0.6]{slike/visina8} \caption{} \label{visina8} \end{center}\end{figure}   to place my figures. How can I tell latex I REALLY want the figure in that specific place, no matter how much whitespace will be left? Write a formula in an Excel Cell using VBA I'm trying to use VBA to write a formula into a cell in Excel. My problem is that when I use a semicolon (;) in my formula, I get an error:     Run-time error 1004   My macro is the following :   Sub Jours_ouvres()     Dim Feuille_Document As String     Feuille_Document = "DOCUMENT"             Application.Worksheets(Feuille_Document).Range("F2").Formula = "=SUM(D2;E2)"     End Sub Why is the minimum size of a generating set for a finite group at most $\log_2 n$? It seems to be known that the minimum size of a generating set for a finite group of order $n$ is at most $\log_2 n$. Can someone explain why this is true?  Edit: noted that the logarithm is base 2, and $n$ represents the order of the group. In how many ways can a number be expressed as a sum of consecutive numbers? How do I find out a name of class that created an instance of an object in Python if the function I am doing this from is the base class of which the class of the instance has been derived?  Was thinking maybe  might have helped me out here, but it doesn't seem to give me what I want. And short of parsing the __class__ member, I'm not sure how to get at this information. What blueprints become available during story? As I progress, I realize that some blueprints open up throughout the story and don't have to be researched. Are these random or are they always the same and is there a list over those? Seems you can easily waste research point if you don't know that. Duplicate explanation should encourage improvement of original check if Gutenberg is currently in use How can I check if the editor that is currently being used is Gutenberg in a WordPress plugin?  I need this because Gutenberg lacks post_submitbox_misc_actions, so I need a fallback which will only be used if the current editor is Gutenberg. Prove that there exist two integers such that i - j is divisible by n. Here's the full question:  Prove that, for any $n + 1$ integers, $\{x_0, x_1, x_2, . . . , x_n\}$, there exist two integers $x_i$ and $x_j$ with $i \neq j$ such that $x_i − x_j$ is divisible by $n$.  Now, the integers aren't necessarily consecutive, positive, or without repeats. I've tried breaking this into cases, such as "$x_i = x_j, \dfrac{0}{n} = 0$" etc. But I don't think it's possible to exhaust the cases.  I feel like there should be an easy way to contradict this one, by saying that $x_i - x_j$ isn't divisible by $n$. But I just wasn't getting anywhere with that one.  I thought about using induction, but I would have just as hard a time proving this for $n$ integers before $n+1$ integers, so I don't think it would be possible for me to do it that way.  If anyone could help out, that would be wonderful. I'm pretty stuck here. Java's Virtual Machine and CLR As a sort of follow up to the question called , what is the (major) differences or similarity in how the Java Virtual Machine works versus how the .NET Framework Common Language Runtime (CLR) works?  Also, is the .NET framework CLR a "virtual machine" or does it not have the attributes of a virtual machine? Check if url has domain name and not an ip