For years URLs nesting did matter. Structures like category/subcategory/article were useful to send signal to Google - these things are related.  Then some of big players overcome to flat structures, like    example.com/category1,  example.com/category2,  example.com/category1-article1,  example.com/category2-article2   In such flat structures the only signal of topical relation is an internal linking.  Q   How are your experiences at the moment?  Do you feel any boost of nesting? Specially in non-straight ecommerce environments (content projects and/or lead generation)   There are indeed some questions about the same topic - but they are seven respective four years old - my question is about your current experience (still matter)
I have a website with url like that :  www.xxxxxx.com/card/wow/20-euros   In term of SEO is it better to use slash or hyphen?  www.xxxxxx.com/card-wow-20-euros   Even though it will be trickier with hyphen to route correctly with only hyphen ...  Or it doesn't matter?
A library to convert ANSI escapes (terminal formatting/color codes) to HTML I'm looking for a code library that converts ANSI escape sequences into HTML color, via plain  tags or CSS. For example, something that would convert this:  ESC[00mESC[01;34mbinESC[00m ESC[01;34mcodeESC[00m ESC[01;31mdropbox-lnx.x86-0.6.404.tar.gzESC[00m ESC[00mfooESC[00m  Into this:  &lt;span style="color:blue"&gt;bin&lt;/span&gt; &lt;span style="color:blue"&gt;code&lt;/span&gt; &lt;span style="color:red"&gt;dropbox-lnx.x86-0.6.404.tar.gz&lt;/span&gt; foo   Converting breaks into &lt;br/&gt; isn't necessary, it's just the escape codes that I don't know. I could hack it together myself, but I'd probably miss something important like underlines or mess up how background colors work. I'd rather just sit on top of someone else's code.  Does such a tool (command line linux) or library (perl, python, or ruby preferably) exist? How to create bootable ISO from an installed OS? Say I have two systems A and B.  I have installed Ubuntu 12.04 on system A and need same set of settings in system B, for which I am thinking to make a bootable iso from System A(creating as a backup). so that I can make Live USB from the generated iso and boot the System B which will be now the replica of System A.  Could you please tell is there any method or tool in doing this process? How to show $f=g$ almost everywhere  Let two real-valued measurable functions $f$ and $g$ be such that for any measurable set $E$ the integrals $\int_E f\,d\mu$  and  $\int_E g\,d\mu$ coincide.  Could you please help.  It seems obvious. we could define the integrals as charges. can we do sth from here. but I do not know how to approach. Increase close vote weight for gold tag badge holders In order to increase the efficiency with which poor quality questions are closed, it could make sense to have weighted close votes for a small subset of qualified users.   A very good way to measure the qualified users would be to leverage the tag badges. However, it needs to be rationally limited to a set of users that are knowledgeable with the subject. A very good way to measure the top users in a tag would be to look at those who have a gold badge in the tag.  If two users who have a gold tag badge pertinent to a question issue a close vote, the question should probably be closed (or probably will be very soon under the current system). I think it would make sense to allow users with a gold tag badge to have a 3x weight for close votes in those tags.  Please keep in mind, this isn't suggesting full moderator one click closure. It only adds weight to the vote. A single user could not do it on their own. These singular users cast close votes all the time, so that aspect would not change. Some will vote to close, some wont, but the ones who do should have a stronger weight to their vote. Even with 3x it will require 2 of said votes to accomplish, or still 2 other users (meaning 3 agreed it should be closed - which is the same amount of high rep users it takes to delete a question and that has a much greater impact than closure).  tldr;  Allow gold tag badge users to have a weighted close vote in their tag Why crontab scripts are not working? Got less output with print0 option on find? I have read the man page and other references, but I am still confused by the behavior of find with -print0 option.  -print0      This primary always evaluates to true.  It prints the pathname of              the current file to standard output, followed by an ASCII NUL              character (character code 0).   First command:  $ find /some/path/ -iname "*intro*jpeg" -o -iname "*intro*jpg" 2&gt; /dev/null /some/path//asdf199Intro-5kqlw.jpeg /some/path/199intro-2jjaj.JPEG /some/path/199intro-3.jpg /some/path/wuer199intro-4.JPG /some/path/xbzf199INTRO-1.jpg   Second command:  $ find /some/path/ -iname "*intro*jpeg" -o -iname "*intro*jpg" 2&gt; /dev/null -print0 /some/path/136intro-3.jpg/some/path/wuer136intro-4.JPG/some/path/xbzf136INTRO-1.jpg   I can see that the the filenames from the second command are null character separated, but why do I get 3 output as opposed to 5 above? How to install Eclipse? Symmetrical twin paradox in a closed universe Take the following gedankenexperiment in which two astronauts meet each other again and again in a perfectly symmetrical setting - a hyperspherical (3-manifold) universe in which the 3 dimensions are curved into the 4. dimension so that they can travel without acceleration in straight opposite directions and yet meet each other time after time.  On the one hand this situation is perfectly symmetrical - even in terms of homotopy and winding number. On the other hand the Lorentz invariance should break down according to , so that one frame is preferred - but which one?  So the question is: Who will be older? And why?  And even if there is one prefered inertial frame - the frame of the other astronaut should be identical with respect to all relevant parameters so that both get older at the same rate. Which again seems to be a violation of SRT in which the other twin seems to be getting older faster/slower...  How should one find out what the preferred frame is when everything is symmetrical - even in terms of GRT?  And if we are back to a situation with a preferred frame: what is the difference to the classical Galilean transform? Don't we get all the problems back that seemed to be solved by RT - e.g. the speed limit of light, because if there was a preferred frame you should be allowed to classically add velocities and therefore also get speeds bigger than c ?!? (I know  is only a local theory but I don't understand why the global preferred frame should not 'override' the local one).  Could anyone please enlighten me (please in a not too technical way because otherwise I wouldn't understand!)  EDIT Because there are still things that are unclear to me I posted a follow-up question: Quick directory navigation in the bash shell Lens upgrade paths (sub $1000) for the EF-S 18-55mm IS kit lens for Canon APS-C cameras Feature request: Add pronouns to usercards? Collage of six photos, not Facebook Lookback movie How to combine paths in Java? Is there a Java equivalent for  in C#/.NET? Or any code to accomplish this?  This static method combines one or more strings into a path. It is given $23!=2585201xy38884976640000$. Now it is required to find the value of $x$ and $y$. I know I could find it by using divisibility rules and solving simultaneous equations. Is there any other way to solve it (without computing it by a calculator)? This question is just out of curiosity. I remember reading a time travel book when I was young, which means it would have been written no later than the '80s, but probably much before that.  It featured an adult and some kids back in time and them trying to get back to the present.  I recall that the time travel effect was a ring, as at one point the ring opened up and a "brontosaurus" hit it and burned it's leg sending chunks of it back through the ring.  I recall a section where they were with "cave people" who had just hunted and killed some animal, and they used their pocket knife to extract more meat from the carcass, and actually cooking the meat unlike their paleolithic 'friends'.  (I seem to recall that one of the paleolithic girls seemed to fancy the boy time traveler, much to his discomfort.)  I am pretty sure that at one point they were watching the time ring appear over water, knowing they could not reach it, and waiting for it to be reachable.  I think the close of the book was them freezing to death in the ice age, commenting on how in the future when their bodies are found how it would be hard to explain how they got there, and then finally being rescued before it was too late.  I hope that's enough to go on?  Any ideas? How to permanently assign a different keyboard layout to a USB keyboard? I often plugin a USB keyboard to my laptop (in addition to external monitor and mouse, which all virtually convert my laptop to a desktop computer) and I prefer using a different keyboard layout then.  I have to manually change the current keyboard layout each time I plugin this USB keyboard.  And I'd like to use an automated way for this, if possible.  's answer to the question  gives some clues, but it seems I'll need a startup script for this task as the device ID for my USB keyboard changes every time the computer starts.  This startup script will probably first include the command xinput -list | grep "USB Keyboard", and another command to grab the first USB Keyboard ID number displayed and then use it in the final command to set my chosen layout for that USB keyboard as below:  setxkbmap -device &lt;NUMBER&gt; -layout &lt;LAYOUT&gt; Prove that if b is coprime to 6 then $b^2 \equiv 1 $ (mod 24) Let $\gcd(b,6) = 1$. Prove that $b^2 \equiv 1 $ (mod 24).  Now I have that as $\gcd(b,6) = 1$, we know that  $3\nmid b $ and $2\nmid b$ (else the GCD would be 3 or 2 resp.)  So as $2\nmid b$, $b$ must be odd. Hence $b^2$ is also odd.  Then I'm not sure where to take it from here? Maybe I've gone down the wrong path to start with, and should be looking more along the lines of the Chinese Remainder Theorem? I'm not sure. I have an instance of an application running in the cloud on Amazon EC2 instance, and I need to connect it from my local Ubuntu. It works fine on one of local ubuntu and also laptop. I got message "Permission denied (publickey)" when trying to access SSH to EC2 on another local Ubuntu. It's so strange to me.  I'm thinking some sort of problems with security settings on the Amazon EC2 which has limited IPs access to one instance or certificate may need to regenerate.  Does anyone know a solution? How can I search for special characters? Situation: It started out as me  for the literal string C-c in  but it ended up omitting the - sign and showing results which contained the strings C/C++ and C &amp; C++.  is an example of a post which contains that string of characters (yet fails to show up in the results).  Things I've tried:   post suggests that I can use the undocumented code: operator, but when I do that, it just wraps the whole term in double quotes like .  As @terdon in Unix &amp; Linux chat has , using this  does yield some relevant results, but it doesn't show me  that is supposed to be there. edit: It appears that the Symbolhound query no longer returns that result.  Finally,  says that you can search for literal characters, but as you can see:    Quoted phrases are exact matches except for case-sensitivity, for example, you can search  or .  The second example (symbols) leads to 0 results.  So by now I assume that the search engine has changed (but the old documentation still lingers on this site). Is there a method for me to search for strings that include special (or is it literal?) characters? A Banach space is reflexive if and only if its dual is reflexive How to show that a Banach space $X$ is reflexive if and only if its dual $X'$ is reflexive?