Webmaster tools showing 404 for non existent folder pages Google webmaster tools is reporting some/many 404 urls that don't exist on my site.  The links are things such as domain.com/xyz/   However that doesn't exist, but domain.com/xyz/index.html does exist.  The "linked from" pages all show proper links to the "/xyz/index.html".    The page without index.html DOES 404, but why is google even trying these urls if they are not linked to?  My real question, is there a way to have google stop attempting to load these pages, and ultimately remove these from the crawl errors report.  Thanks.
Thousands of 404 errors in Google Webmaster Tools Because of a former error in our ASP.Net application, created by my predecessor and undiscovered for a long time, thousands of wrong URLs where created dynamically. The normal user did not notice it, but Google followed these links and crawled itself through these incorrect URLs, creating more and more wrong links.  To make it clearer, consider the url     example.com/folder   should create the link     example.com/folder/subfolder   but was creating     example.com/subfolder   instead. Because of bad url rewriting, this was accepted and by default showed the index page for any unknown url, creating more and more links like this.     example.com/subfolder/subfolder/....   The problem is resolved by now, but now I have thousands of 404 errors listed in the Google Webmaster Tools, which got discovered 1 or 2 years ago, and more keep coming up.  Unfortunately the links do not follow a common pattern that I could deny for crawling in the robots.txt.  Is there anything I can do to stop google from trying out those very old links and remove the already listed 404s from Webmaster Tools?
I need to add a specific column if it does not exist. I have something like the following, but it always returns false:  IF EXISTS(SELECT *           FROM   INFORMATION_SCHEMA.COLUMNS           WHERE  TABLE_NAME = 'myTableName'                  AND COLUMN_NAME = 'myColumnName')    How can I check if a column exists in a table of the SQL Server database? Two "if"s in a row How do I get an iball 3.5G modem working on Ubuntu? I purchased iball 3.5G  connect wireless modem 1 month before. I am trying to connect it with my laptop which is having ubuntu Operating System. After plug-in it to the ubuntu system it is not connecting with net.   This modem is plug and play but after plugging it nothing is displaying to the system.  I am expecting step-by-step method to connect this modem with my ubuntu 12.04 LTS sysetm from your expert's advice. Twitter Bootstrap uses these break points for responsive design:  Large Display: 1200px Default: 980px Tablet: 768px Mobile: 480px  A client said they are using 1280px for their Large Display breakpoint.  Is there an industry standard for these or are they just made up as we go right now? How to call shell commands from Ruby How do I withdraw a paper from a journal after it was accepted but before it was fully published? On the advice of a senior colleague, I decided that I do not want to publish the paper anymore and with that journal. I wrote the editor several times; he has received the emails, but refuses to reply. I know he gets the emails because if its on other matters he has replied but not on the paper. I am ready to forfeit the processing fee I gave them but they refuse to reply and have already published the abstract of the paper to their site but not the full paper. Is legal action an option and do I have the right to sue? What are the guidelines in matters like these? If a subsequence of a Cauchy sequence converges, then the whole sequence converges. Let $(X,d)$ be a metric space, and say $(x_n)$ is a Cauchy sequence such that it has a convergent subsequence $(x_{n_k})$ that converges to $x$. We show $x_n \to x$. Let $\epsilon &gt; 0$. Take $N &gt;0$ such that for all $n,m &gt; N$, we have   $$d(x_n,x_m) &lt; \frac{\epsilon}{2}.$$  By hypothesis, we can take also $K &gt;0$ such that for all $n_k &gt; K$, we have  $$ d(x_{n_k},x) &lt; \frac{\epsilon}{2}.$$  Put $M = \max \{N,K\}$. Therefore, for all $n,m,n_k &gt; M$, we have  $$ d(x_n,x) \leq d(x_n, x_{n_k}) + d( x_{n_k},x) &lt; \frac{\epsilon}{2} + \frac{\epsilon}{2} = \epsilon.$$  Hence, $x_n \to x$ as desired.  Is this a correct approach? Thank you very much in advance. Unicode identifiers in Python? What resolution should a large format artwork for print be? UK Visitor Visa: Required Time or Interval Between Visits? I am a US citizen and have recently visted the UK  with simply a passport which allowed me to vist for 6months I have heard rumors that I am obligated to stay in the US for a Equal amount of time that I have visited the UK before I am able to return, but I am struggling tour no any proof of this obligation .. Am I missing somthing or is it simply not true Radical change of favourite tags doesn't reflect in questions list How to include a PDF image into a PDFLaTeX document I am generating a PDF file using pdflatex and need to include another PDF file. The reason is that I have a graphMl file which I exported from yEd graph editor to a PDF file, named sample.pdf. The TeX code to be compiled with pdflatex is given below. I need to include that file at the start of the document.   \documentclass[a4paper,leqno,twoside]{article}  \usepackage[latin1]{inputenc} \usepackage[english]{babel} \usepackage{multirow}  \begin{document}   [% FOREACH st IN Service %]    Name,Id:   [% st.Id %], [% st.Name %]     des:   [% st.Description %]    Customers:  [% FOREACH softservice IN st.Customers %]   [% FOREACH swid IN softservice.SW %]  [% swid.Service %]   [% FOREACH st IN Service %][% IF swid.Service == st.Id %]     ([% st.Name %])     [% END %] [% END %][% END %][% END %]    Suppliers:    [% FOREACH shservice IN st.Suppliers %]    [% FOREACH sw IN shservice.SW %][% sw.Service %]     [% FOREACH st IN Service %][% IF sw.Service == st.Id %]([% st.Name %])      [% END %][% END %][% END %]    [% FOREACH hw IN shservice.HW %][% hw.Type %][% hw.Nr %][% END %]   [% END %]   \newpage   [% END %] \end{document} I found this problem on a well-known problem solving website. It is apparently from Ramanujan.     With   $$\LARGE{a = \frac{1}{1 + \frac{e^{-2\pi}}{1 + \frac{e^{-4\pi}}{1 + \ddots}}}},$$   what is $a$?   The basic methods I know for questions of this type were not helpful to me.  I do not require a full solution, but feel free to post one if you would like. Hints or lecture notes on how to solve problems of this nature would be appreciated.   Keep in mind that I am at an undergraduate level in mathematics. I am writing a small KOMA-Script scrartcl document with multiple sections. In the table of contents, LaTeX fills the current line with dots between the end of the section name and the page number. Is there any way to customize this behavior? I would like to reduce the space between the single dots (i.e. use more dots in the same space). Where can I find documentation on formatting a date in JavaScript? Game Theory and Uniform Distribution question? In an Auction , two players are  bidding. Their bids will be a unknown fraction of their valuations. The valuations come from a uniform distribution $$[0,1] $$  If Player 2 bids $$ v/2 $$  and Player 1 bids $$b1&lt;1/2$$   What is the probability player 1 wins ? Clearly for player 1 to win,players 2 bid has to be less than player 1 bids. $$P(v/2 &lt; b1)$$  $$P(v &lt; 2b1)$$ I follow the question up to this stage. Now it says since its uniformly distributed the probability player 1 wins is $$2b1$$ Im confused how can you just get 2b1 from the inequality ?  Thanks in advance Is it possible to add a list of hosts that are only specific to a certain user? Perhaps a user-specific hosts file?  This mechanism should also complement the entries in the /etc/hosts file. Noticing that Newtonian gravity and electrostatics are equivalent, is there also a relationship between the general relativity and electrodynamics? reports:  Two mathematicians have uncovered a simple, previously unnoticed property of prime numbers [...]. Prime numbers, it seems, have decided preferences about the final digits of the primes that immediately follow them. Among the first billion prime numbers, for instance, a prime ending in 9 is almost 65 percent more likely to be followed by a prime ending in 1 than another prime ending in 9.  Do these insights make breaking keys based on primes more mathematically plausible in a shorter amount of time? Bash prompt error when pressing up arrow I've written this nice and colorful prompt for my OS X terminal:   parse_git_branch() {     git branch 2&gt; /dev/null | sed -e '/^[^*]/d' -e 's/* \(.*\)/ [\1]/' }  export PS1="\e]2;\w\a\e[1;30;1m\][\u@\[\033[0;36m\]\h\e[1;30;1m\]:\[\033[0;35m\]\w\e[1;30;1m\]] \[\033[0;31m\](\t) \[\033[0;33m\]\$(parse_git_branch)\n\[\033[0m\]\e[1;30;1m\]\$\[\e[0m\]"   I source ~/.bash_profile it and it works fine. except when I use the arrow up to navigate the history I get a weird thing happening.   basically the beginning of the source ~/.bash_profile command in the history, becomes part of the prompt. when I ctrl+c or enter it returns to normal, but as soon as I see the history of the source command the prompt changes again.   Here's an example where I've seen the history and then ctrl+u and typed ls:   [user@host:~/Documents] (14:01:40)  [branch] $source ~/.ls   Any clue about this?