Does it really matter in SEO if my URL is:   https://example.com/test/18-apr-2019/author https://example.com/18-apr-2019/test/author https://example.com/author/test/18-apr-2019   Does it really matters which keyword comes first? As you can see URLs have the same keywords as parameters. But does it really matter which one is first and which last?  Will any of the above examples affect the way Google indexes and displays my page?
A coworker and I are locked in a debate over the value of SEO keywords in the URL of a page. She wants to change all the filenames of the HTML pages of a fencing company so they look like residential-home-chicago.html, contact-chicago-contractor.html, and so on. She is convinced that because Google highlights keywords in URLs in search results, that means that putting keywords here is more valuable.  My position is that these do not improve SEO, since Google doesn't seem to give keywords in the URL any more weight than keywords in the body of the page, and . In the meantime, they make it harder for me to find the pages I want when its time to edit them, and the site as a whole looks cheap and spammy.   suggests to me that yes, keywords in URLs are useful, but not superior, and that they are more useful for human readability than search engine rankings.  I'm looking for authoritative sources that support either position, not blog articles from SEO optimization companies trying to promote themselves.
Concatenate all arguments and wrap them with double quotes I just received a PhD invitation letter from a German University which mentions that my remuneration will be 2/3 of full TV-L 13 position. I do not know what a TV-L 13 position is (Google is of no help here), and didn't want to be rude, so I am asking here first. Is this a common position or specific to Germany? If anyone knows, currently how much remuneration corresponds to a TV-L position? Behaviour of printf when printing a %d without supplying variable name I've just encountered a weird problem, I'm trying to printf an integer variable, but I forgot to specify the variable name, i.e.  printf("%d");   instead of  printf("%d", integerName);   Surprisingly the program compiles, there is output and it is not random. In fact, it happens to be the very integer I wanted to print in the first place, which happens to be m-1.  The errorneous printf statement will consistently output m-1 for as long as the program keeps running... In other words, it's behaving exactly as if the statement reads  printf("%d", m-1);   Anybody knows the reason behind this behaviour? I'm using g++ without any command line options.  #include &lt;iostream&gt; #define maxN 100 #define ON 1 #define OFF 0  using namespace std;  void clearArray(int* array, int n); int fillArray(int* array, int m, int n);  int main() {     int n = -1, i, m;     int array[maxN];     int found;      scanf("%d", &amp;n);      while(n!=0)     {         found=0;         m = 1;         while(found!=1)         {             if(m != 2 &amp;&amp; m != 3 &amp;&amp; m != 4 &amp;&amp; m != 6 &amp;&amp; m != 12)             {                 clearArray(array, n);                 if(fillArray(array, m, n) == 0)                 {                     found = 1;                 }             }             m++;         }          printf("%d\n");          scanf("%d", &amp;n);     }      return 0; }  void clearArray(int* array, int n) {     for(int i = 1; i &lt;= n; i++)         array[i] = ON; }  int fillArray(int* array, int m, int n) {     int i = 1, j, offCounter = 0, incrementCounter;      while(offCounter != n)     {         if(*(array+i)==ON)          {             *(array+i) = OFF;             offCounter++;                }         else          {             j = 0;             while((*array+i+j)==OFF)             {                 j++;             }             *(array+i+j) = OFF;             offCounter++;                    }         if(*(array+13) == OFF &amp;&amp; offCounter != n) return 1;         if(offCounter ==n) break;          incrementCounter = 0;                while(incrementCounter != m)         {             i++;             if(i &gt; n) i = 1;             if(*(array+i) == ON) incrementCounter++;          }            }      return 0; } Rubbing eggplants in salt Analogous results to Euler's theorem Fermat's little theorem and its generalization, Euler's theorem holds for pair of relatively prime integers. Are there any analogous results for not relatively prime integers ? Thanks in advance. I was told that computers with more than 2 gig's memory need a 64 bit operating system to utilize all RAM.  Is the 64bit Ubuntu download really JUST for AMD processors? I am asking because the disk image I downloaded says AMD64.  So will my new Intel 2.3Ghz Core i3 Dual Core processor work with 64 bit Ubuntu?  It runs the 64bit version of Windows without any qualm. Matrix Multiplication in context of row and column vectors Expected value of subset of variables in Bayesian setting Assume we have $N$ random variables $X_1, \ldots, X_N$ with known (posterior) distributions that are easy to sample from. For simplicity, assume that I am interested in the expected value of the ten largest of these random variables. There will be some uncertainty surrounding this expected value as there is uncertainty with respect to the rank of a given $X_i$ in case the distributions of $X_1, \ldots, X_N$ overlap. I want to use simulation based methods. My approach is to simulate $M$ samples from the distributions of $X_1, \ldots, X_N$, where in each iteration, I construct a binary indicator of length $N$ indicating whether random variable $i$ is within the set of the ten largest samples or not. Averaging over these $M$ draws gives me the probability that random variable $i$ is member of the top ten group. Denote this probability as $\pi_i$. Define a binary random variable that indicates membership in the top ten group as $S_i$. $S_i$ follows a Bernoulli distribution s.t. $S_i \sim Ber(\pi_i)$. In a second step, I draw $L$ samples from the distribution of $S_i$ and from the distributions of $X_1, \ldots, X_N$. Given a draw of $S_i$, I can select the top ten out of the samples of $X_1, \ldots, X_N$ in each iteration and average the respective samples within the top ten group. I save this average, so the result after $L$ iterations will be the distribution of the average outcome within the top ten group, taking into account all relevant sources of uncertainty. My questions are: Is this simulation approach valid in general? From a Bayesian perspective, is this simulation valid or do I need to treat additional quantities (e.g. $S_i$ or $\pi_i$) as random variables that need a prior? Small snap loop devices visible in gnome-disk-utility OR what is the function of snap ubuntu-core I just realized using gnome-disk-utility (3.18.3.1) that my 16.04 installation is featuring several small loop devices.  In detail:   78 MB Loop Device (/var/lib/snapd/sn_ntu-core_352.snap -> /dev/loop0) 76 MB Loop Device (/var/lib/snapd/sn_ntu-core_216.snap -> /dev/loop1) 79 MB Loop Device (/var/lib/snapd/sn_ntu-core_423.snap -> /dev/loop2) 705 KB Loop Device (/var/lib/snapd/snaps/tpad_12.snap -> /dev/loop3) 684 KB Loop Device (/var/lib/snapd/snaps/tpad_11.snap -> /dev/loop5) 705 KB Loop Device (/var/lib/snapd/snaps/tpad_13.snap -> /dev/loop6)   Image showing gnome-disk-utility    My questions are as follows:   What are those loop devices used for? Is that an expected behaviour in 16.04? Can  I remove them? And if so - how (just by unmounting)? Is there any risk in removing the 2 installed snaps mentioned below (tpad and ubuntu-core)   UPDATE  Installed snaps  According to snap list I do have   tpad (1.8.1) ubuntu-core (16.04.1)   installed. I remember I did tinker with snaps for a short time when  I realized this option - but am pretty unsure if  I  installed those 2 snaps - or if they are pre-/auto-installed.  tpad is a Terminal text editor with GUI-like user interface  I  did install manually, as  I don't use it  I removed it now via sudo snap remove tpad. As a result the 2 loop devices pointing to tpad are gone in gnome-disk-utility.  So - at the current point  I am still having 1 snap installed called ubuntu-core and I don't know what it is used for. The summary of this particular snap is   The ubuntu-core OS snap I need to somehow retrieve the client's IP address using JavaScript; no server side code, not even SSI.  However, I'm not against using a free 3rd party script/service. I am trying to disable the touchscreen on my Asus S200E laptop.  In Ubuntu 16.04, I was able to do so with this:  Section "InputClass"     Identifier "evdev touchscreen catchall"     MatchIsTouchscreen "on"     MatchDevicePath "/dev/input/event*"     Driver "libinput" EndSection   How can this be done on Ubuntu 18.04? If my app is live and users are facing a critical issue, can I upload another build and ask Apple to make it live within a day or two? There is a very bad problem with the "Blank screen" function in Ubuntu 17.10. I refer to the setting accessed via Settings->Power->Blank Screen. This seems to actually perform a screen lock, since I need to enter my password after un-blanking the screen. (However, given the behavior described below it's not clear exactly what this function actually does - maybe it just logs you out? maybe it reboots the machine?)  The problem is that a simple screen lock, which one would expect to lock the screen without affecting the state of any applications, in fact closes all applications that are open when the screen lock activates. In other words, if you have the screen lock set to 5 minutes, and you walk away from your machine to get a sandwich or whatever, when you come back and unlock the machine all your apps have closed without saving their state. So far, the only work-around I have found is to entirely disable screen locking in Ubuntu 17.10. My question is, how can this be fixed so that screen locking works properly - that is: the screen locks on schedule after a period of inactivity, and when unlocked all applications that were running are still running?  I am asking a new question for the following reasons:  1) The existing answers to (and comments on)  do not address the issue, and in fact misrepresent the actual problem in ways that make me think the comment writers have not understood what is happening;  2) I cannot usefully address that question because I do not have sufficient reputation to either upvote the question or comment on it, and I cannot answer the question because I have no idea why this problem occurs;  3) I will probably never achieve a reputation of 15, much less 50, on StackExchange. Which is fine, that's not among my life goals.  4) But this question is important and deserves to be addressed. It is a drastically unacceptable bug. An infinite subset of a countable set is countable In my book, it proves that an infinite subset of a coutnable set is countable. But not all the details are filled in, and I've tried to fill in all the details below. Could someone tell me if what I wrote below is valid?  Let $S$ be an infinite subset of a countable set $T$. Since $T$ is countable, there exists a bijection $f: \mathbb{N} \rightarrow T$. And $S \subseteq T = \{ f(n) \ | \ n \in \mathbb{N} \}$. Let $n_{1}$ be the smallest positive integer such that $f(n_{1}) \in S$. And continue where $n_{k}$ is the smallest positive integer greater than $n_{k-1}$ such that $f(n_{k}) \in S$. And because $S$ is infinite, we continue forever. Now consider the function $\beta : \mathbb{N} \rightarrow S$ which sends $k \rightarrow f(n_{k})$.   So in order for $S$ to be countable, $\beta$ would have to be a bijection. $\beta$ is injective since if $f(n_{k}) = f(n_{j})$, then $n_{k} = n_{j}$ because $f$ is injective. We also can conclude $k = j$ because the various $n_{i}$ chosen were strictly increasing.   Edit: $\beta$ also needs to be surjective. So for every $r \in S$ there exists a $q \in \mathbb{N}$ such that $\beta(q) = f(n_{q}) = r$. We know that $f^{-1}(r) \in \{n_{1}, n_{2}, ..., n_{k} ... \}$, so we can let $f^{-1}(r) = n_{d}$. Thus $\beta(d) = f(n_{d}) = r$. Recently as per this       For individuals who have chosen to receive automatic updates through   Windows Update, we help upgradable devices get ready for Windows 10 by   downloading the files they’ll need if they decide to upgrade.   but Microsoft seems to be downloading hidden update in windows 7 :  according to this  :     An INQUIRER reader pointed out to us that, despite not having   'reserved' a copy of Windows 10, he had found that the ~BT folder,   which has been the home of images of the new operating system since   before rollout began, had appeared on his system. He had no plans to   upgrade and had not put in a reservation request.   As per the above two articles there was hidden update for windows 10 with respective to windows 7 and 8 machines ,whats the effective way to stop this hidden update?  right now i cant disable windows update since i wish to patch my system with latest updates,  i checked the question which was marked as possible  :     inorder to clarify how it differs it talks about the cancelled update   ,but this was latest issue which was araised two days before,i didnt   dig much about that and believe both were different ,apart from that   it was about after the cancellation of update a   nd this one was about preventing such an update from downloading to my pc  any suggestions to avoid this update? Recently I paid a lot (almost one month of my salary) for repairing my car. I am wondering if there is a way to get deduction on federal or state taxes (USA, California). Let $f(z)$ be a holomorphic function on a disk of radius $&gt;1$ about the origin, and suppose that $|f(z)|\leq 1$ for $z$ with $|z|=1$ and $\text{Re}(z)&gt;0$ and $|f(z)|\leq 2$ for $z$ with $|z|=1$ and $\text{Re}(z)\leq 0$.  How does one show the bound $|f(0)|\leq \sqrt{2}$? Find the value of : $\lim_{n\to\infty}\prod_{k=1}^n\cos\left(\frac{ka}{n\sqrt{n}}\right)$ I'm fairly excited for Unity, as it looks like a promising new direction for Ubuntu.  However, I do have a concern - will it be possible to use Unity without the global menu?  I have my window manager set to focus-follows-mouse/sloppy focus, and find the productivity gains to be immense. Sloppy focus is incompatible, however, with global menus, as it is possible for the focus to change while you move from window to menu.  Will Unity support an option to use window menus while still using Unity? How to detect if a mob has been hit in minecraft with command blocks? i am making a boss battle for my minecraft adventure map, and using a mob spawned with commands as the boss. When the mob gets hit, some command blocks will give the player a potion effect, but I can't figure out how to activate the command block when the mob gets hit. I am in the latest snapshot (16w03a). please help me (the person who answers my question will be given credit for it in my map)