I wonder because the rugarch library on R allows to generate an ARMA-GARCH, but the coefficients of the ARMA are totally different from those generated by Arima from the forecast package.  I thought that the addition of the GARCH was only done by adding the GARCH, and not by re-estimating the model, am I right or am I wrong?
I have a time series that shows a nonstationary seasonal autoregressive component as well as known heteroshedasticity. In order to model the series, I have fit a seasonal ARIMA model for the mean with the auto.arima model in the forecast package in R and a GARCH model on the residuals of the ARIMA model.   Is the procedure of sequentially estimating ARIMA and GARCH model correct or would it have been better to jointly model the mean and the variance of the series? If this were correct, is there a (possibly R) function to do it?
The top bar is showing (again) the suggested edits count and 10K flags count, like it was before.  On Stack Overflow it looks like this: (that's the original color, same as in old top bar)        And on this very Meta site:        Same top bar. But different colors! Consistency broken.  I've just noticed the suggested edits count on Meta:        Black on black, I can see just a floating number - really confusing and out of any context.  In the name of Consistency, can we please have the same color on all sites? How to install Redis on Ubuntu 16.04? I am working with Laravel but i have installed all on my own (php, mysql, composer, nginx) and now i need to install Redis and configure it so i could use it for queue driver in Laravel.  How to install it, because it cannot be installed through apt-get install redis  i get this error:  ubuntu@ubuntu:~$ sudo apt-get install redis [sudo] password for ubuntu:  Reading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package redis messenger()->addMessage not working after a $form_state->setResponse In the submitForm of a custom form, I have this:    switch ($form_state-&gt;getValue('suscribe')) {   case 0:     $iStatus = 1;     break;   case 1:     $iStatus = 3;     $sFileName = 'sites/default/files/_private/bulletins/' . $form_state-&gt;getValue('adherent')[1] . ".pdf";     $response = new BinaryFileResponse($sFileName);     $response-&gt;setContentDisposition(       ResponseHeaderBag::DISPOSITION_ATTACHMENT,       'bulletin.pdf'     );     $form_state-&gt;setResponse($response);     break; }  $storage = \Drupal::entityTypeManager()-&gt;getStorage('member'); $id = $form_state-&gt;getValue('adherent')[0]; $entity = $storage-&gt;load($id); $entity-&gt;status = $iStatus; $entity-&gt;save();  \Drupal::messenger()-&gt;addMessage($this-&gt;t('Your wish has been recorded.'));   suscribe is a Yes/No radio button. $form_state-&gt;setResponse($response); triggers the automatic download of a pdf document.    The message (Your wish...) is correctly displayed in case 0. In case 1, the message shows only if I refresh the page (or go to another page). How can I have the message displayed without doing another action after submitting the form in case 1?    By the way, database is correctly updated in both cases. I'm using Drupal 8.6.10. I'm designing an algorithm to do the following: Given array A[1... n], for every i &lt; j, find all inversion pairs such that A[i] &gt; A[j]. I'm using merge sort and copying array A to array B and then comparing the two arrays, but I'm having a difficult time seeing how I can use this to find the number of inversions. Any hints or help would be greatly appreciated. Why does $\log(n!)$ and $\log(n^n)$ have the same big-O complexity? In an example that I found, it is said that $\log(n!)$ has the same big-O complexity as $\log(n^n)$. Please explain why this is the case. RegEx: Grabbing values between quotation marks I have a value like this:  "Foo Bar" "Another Value" something else   What regex will return the values enclosed in the quotation marks (e.g. Foo Bar and Another Value)? In Harry Potter, Do Spells Travel in a Straight Line? In the Harry Potter world, when a magical person casts a spell, sometimes they target a specific object, like when Harry has a wand only and needs his broom, he casts "Accio Firebolt" and his broom comes to him.  But a lot of the time people point their wands just in the direction of someone to cast a spell.  One example would be in a duel.  When they do this, are they casting a spell on a particular person or at that person?  It seems, from what I remember of the movies, that some spells travel in a straight line while others specifically target a person or object.  Do any spells travel in one direction, like a laser beam?  What kind of spells are directional (instead of focusing on a particular person or object)?  And can directional spells be deflected or blocked by something like a mirror or another physical object?  (By "directional," I could have said linear, but didn't want to start sounding mathematical or scientific.  In other words, do they travel in one direction, like a laser beam would, or will they change direction to hit the intended target?) A positive integer is divisible by $3$ iff 3 divides the sum of its digits I am having trouble proving the two following questions:    If $p|N$, $q|N$ and gcd(p,q)=1, then prove that $pq|N$ If $x$ is non zero positive integer number, then prove that $3|x$ if and only if 3 divides the sum of all digits of $x$.   For both questions I tried to use theorems of discrete mathematics, but I could not find the way to solve them. Travelling on Business visa to UK for tourism purposes I already have a 6 month valid UK business visa received prior to April 24 2015. I was supposed to travel to the UK in April, but my trip was cancelled on medical grounds.  I am now planning to visit the UK in July for tourism. Would it be fine for me to do so? Will I be allowed to enter the UK? Should I carry the original invite letter and medical certificate to prove why I didn't go the first time? How can I write a unit test to determine whether an object can be garbage collected? There is already a similar post, that has an answer to my question, but it is quite short and I don't get it... So I am trying to show that  \begin{align} \{e_K |~ K \subset G~ conjugacy~ class \} \end{align} is a basis for $Z(\mathbb{Z}[G])$. Serre even writes "one immediately checks that the $e_K$ form a basis", but even reading the other post  I don't see that...  My approach to this is:  Be $x \in Z(\mathbb{Z}[G])$, which is equivalent to: $x = gxg^{-1}$ for all $g \in G$. Writing  $x = \sum\limits_{h \in G} \lambda_h h$, we get $x = \sum\limits_{h \in G} \lambda_h ghg^{-1}$. I don't really know how to go on at this point. I mean, I know that when $a,b \in K$ (same conjugacy class) you get $\sum\limits_{s \in K} \mu_s s = \mu\sum\limits_{s \in K} s$, since \begin{align} a = hbh^{-1} \Rightarrow \mu_a = \mu_b ~\forall a,b\in K \end{align} So all elements in the same conjugacy class have the same scalar.  But from here I don't really know how I can generate the $x = \sum\limits_{h \in G} \lambda_h ghg^{-1}$ with the $e_K$ ...  I would be really thankful, if someone could give me quite a basic proof that even I understand... How do  I create a desktop wallpaper slideshow with my own set of images?   With the images coming from a pictures folder, or pre-selected With the images displayed in order, or randomly With the images changing every few minutes, or after random periods of time Let’s take an example of a movie site. So a well structured set of URLs for this site can be:     Movie page - example.com/movies/the-matrix Review for movie - example.com/movies/the-matrix/reviews Trailers for movie - example.com/movies/the-matrix/trailers Specific trailer for movie - example.com/movies/the-matrix/trailers/trailer1   where it’s possible to navigate the resource even by directly deleting/appending resource name seamlessly.  For SEO purpose I read somewhere that for two given pages, Google will prefer the page which have search query up in the URL hierarchy among other things. So for the given 2 URLs and the query "the matrix trailer"    example.com/movies/the-matrix/trailers example.org/trailers/the-matrix/    `     Google might prefer the second URL as it has the keyword "trailer" at first level comparing to first URL which has "trailer" at 3rd level (a resource deeper in URL hierarchy may be less important).    If it is correct, one may be tempted to create URL hierarchy somewhat like      Movie page - example.com/movies/the-matrix Review for movie - example.com/reviews/the-matrix/ Trailers for movie - example.com/trailers/the-matrix/ Specific trailer for movie - example.com/trailers/the-matrix/trailer1     which will break the seamless hierarchy.    My questions are:   Is it true that resource deeper in URL hierarchy is tend to be less important when comparing to URLs of other site?   Is sacrificing meaningful, seamless hierarchy worth for this SEO optimization? Why use getters and setters/accessors? Split comma-separated values Number of moves necessary to solve Rubik's cube by pure chance Suppose, random moves are made to solve Rubik's cube. A move consists of a $90$-degree-rotation of some side. The starting position is also random.   What is $E(X)$, where $X$ is the number of moves until the cube is solved ? How many moves must be made, that the probability that the cube is solved, exceeds $99$% ? Use Expect in a Bash script to provide a password to an SSH command I'm trying to search and replace a string in all files matched by grep: grep -n 'foo' * will give me output in the form: [filename]:[line number]:[text]  For each file returned by grep, I'd like to modify the file by replacing foo with bar. Determine all $f: \mathbb{R} \rightarrow \mathbb{R}$ such that, for all $x, y \in \mathbb{R}$, $$f((x + 1) f(y)) = y (f(x) + 1).$$    Source: Vuong Lam Huy, on a Facebook group. Experimental observation of matter/antimatter in the universe