This is really weird but its happening. The domain is about 6 months old and was built with wordpress. It was hacked (a lot of pages were appending after domain name in chinese language etc. I could see using site:domain.com) but I am not getting any clicks from those hacked pages anymore.  Now it is in different hosting and built from scratch, not using wordpress anymore. I submitted new site to google and it shows indexed. One of the page (domain.com/certification) is even appearing in google search on page 1/2.   However when I type domain name 'domain' in search. Its not there. It shows whois domain, domain.sg or some other extension but not domain.com. Seems like my domain does not exist at all?  Does deleting domain from search console and starting from scratch helps? Does verifying domain ownership with different methods help?  Even brand new site shows up after a week or two but something is going on here. Can anyone help me how to fix this issue?
I am working on a website for a client, and even though the site ranks extremely well for various different keywords (which is good), if I search for the site's name the homepage does not appear even on the second page on Google. I have to add the .com so it will appear.  But, for big brands like Best Buy, Nike and millions of others it is enough to just search for the brand itself and the first or second suggestion on Google is the brand's homepage.  How can I raise my brand's authority in Google so it will appear in Google on the first page when some searches for it?  I have tried changing the breadcrumbs so instead of "HOME" it is now the brandname, linked to the homepage. I thought that it will help with internal linking if the anchor text is the brand's name instead of the word "HOME".  Any ideas please?
What is the best base to use? Helpful flags not getting updated after getting 'close question' privilege Possible Duplicate:          I recently got the ability to cast close votes. So, even if I flag a question as 'not constructive' or 'not a real question', it is still considered as a close vote. What is strange is that my 'helpful flag' count has stopped increasing after this change. Or at least it doesn't increase in cases where my flagging was automatically changed to a close vote and the post actually was closed. Is this how it is supposed to be?   I am guessing that once the post gets closed, the moderators are probably not bothered about marking flags as helpful. The only problem is that the Deputy badge will be much more difficult to get now. Earlier all the flags were getting converted to helpful, but now they just go in as close votes and don't show up on my profile page. 32-bit, 64-bit CPU op-mode on Linux Just wanted some feedback to ensure I did not make any mistakes with this proof. Thanks!  Since $G$ is abelian, every subgroup is normal. Since $G$ is simple, the only subgroups of $G$ are $1$ and $G$, and $|G| &gt; 1$, so for some $x\in G$ we have $x\neq 1$ and $\langle x\rangle\leq G$, so $\langle x\rangle = G$. Suppose $x$ has either infinite order or even order. Then $\langle x^2\rangle \leq G$ but $\langle x^2\rangle \neq \langle x \rangle$, a contradiction. So $x$, and therefore $G$, has odd order, and by Feit-Thompson, $G\cong Z_p$ for some prime $p$.  Edit: Thanks, I see that Feit-Thompson is too much.  Since $G$ is abelian, every subgroup is normal. Since $G$ is simple, the only subgroups of $G$ are $1$ and $G$, and $|G| &gt; 1$, so for some $x\in G$ we have $x\neq 1$ and $\langle x\rangle\leq G$, so $\langle x\rangle = G$. Suppose $x$ has infinite order. Then $\langle x^2\rangle \leq G$ but $\langle x^2\rangle \neq \langle x \rangle$, a contradiction. So $x$, and therefore $G$, has finite order. Suppose $x$ has composite order $n$ so for some $p &gt; 1$ that divides $n$, $\langle x^p \rangle$ is a proper non-trivial subgroup of $G$, so $G$ is not simple. So $G$ is a cyclic group of prime order. Maximum length of tags Possible Duplicate:        Is there a maximum limit on the length of tags? I noticed that the tag for SQL Server Management Studio is truncated to sql-server-management-stu.  It seems like this should be an easy thing to correct, if not to allow the creation of new longer tags, but to correct existing tags that have been truncated. Is there any way to increase the drop rate of items? Is there any cryptographic algorithm immune to side channel attacks based on scan chain? In VLSI point of view. What is the probability that $x_1+x_2+...+x_n \le n$? Let $\mathbb S = \varnothing$.      Then from the definition: $ \bigcap \mathbb S = \left\{{x: \forall X \in \mathbb S: x \in X}\right\}$      Consider any $x \in \mathbb U$.      Then as $\mathbb S = \varnothing$, it follows that: $\forall X \in \mathbb S: x \in X$ from the definition of vacuous truth.      It follows directly that: $\bigcap \mathbb S = \left\{{x: x \in \mathbb U}\right\}$      That is: $\bigcap \mathbb S = \mathbb U$. ()   Proofwiki uses the above "proof" to "prove" that intersection of the empty set is the whole universe.   My question is, is the use of vacuous truth really allowed in axiomatic set theory, like ZFC? I don't see how the use of vacuous truth is justified.   The next problem I can think of is that we cannot really "define" the elements of empty set (to my knowledge, there is no element in empty set) so how can we then prove as the above proof did? This seems to contradict the use of vacuous truth.  And of course, there is issue of using the whole universe as a set, and I don't think this is allowed.... (Maybe proof above is using a different axiomatic set theory, as I am using ZF-minded thoughts...) I have the following equation, where there is a lot of stuff under the sum symbol:  \begin{equation} d(\vec{x},\vec{y})=   \sum_{Z_{xy}\in\vec{Z}_{xy},\forall x\in\vec{x},\forall y\in\vec{y}}      f(Z_{xy}) \end{equation}   In the resulting document, I find it kind of hard to read. Is there a way to write the equation to make the result more readable, e.g. putting the stuff under the sum symbol on different lines? ARMA/GARCH estimation in sequence I know that symlinks have a separated inode from the original file and that they only point for the inode containing the data. My question is, where is the hardlink name stored if there's no field in the inode structure refering to "name". I know that this could be a a relatively easy question, but as all hardlinks have the same inode number i assume that no inode is created when creating a hard link. I would like to search an entire MS SQL 2000 database for one value. This would be to aid development only. Keep that in mind when considering this question.   This will get all the table names and the column of the data type I'm looking for:  SELECT Columns.COLUMN_NAME, tables.TABLE_NAME FROM INFORMATION_SCHEMA.Columns as Columns  JOIN INFORMATION_SCHEMA.TABLES as tables  On Columns.TABLE_NAME = tables.TABLE_NAME WHERE Columns.DATA_TYPE = 'INT'     I was thinking something like this:  -- Vars DECLARE @COUNTER INT DECLARE @TOTAL INT DECLARE @TABLE CHAR(128) DECLARE @COLUMN CHAR(128) DECLARE @COLUMNTYPE CHAR(128) DECLARE @COLUMNVALUE INT  -- What we are looking for SET @COLUMNTYPE = 'INT' SET @COLUMNVALUE = 3 SET @COUNTER = 0  -- Find out how many possible columns exist SELECT @TOTAL = COUNT(*)   FROM INFORMATION_SCHEMA.Columns as Columns  JOIN INFORMATION_SCHEMA.TABLES as tables  On Columns.TABLE_NAME = tables.TABLE_NAME WHERE Columns.DATA_TYPE = @COLUMNTYPE PRINT CAST(@TOTAL AS CHAR) + 'possible columns' WHILE @COUNTER &lt; @TOTAL BEGIN     SET @COUNTER = @COUNTER +1     -- ADD MAGIC HERE END   Any ideas?  UPDATE I recently found this  that works quite well. If $(a,b)=1$ then prove $(a+b, ab)=1$. Confidence interval for Bernoulli sampling I have a random sample of Bernoulli random variables $X_1 ... X_N$, where $X_i$ are i.i.d. r.v. and $P(X_i = 1) = p$, and $p$ is an unknown parameter.  Obviously, one can find an estimate for $p$: $\hat{p}:=(X_1+\dots+X_N)/N$.  My question is how can I build a confidence interval for $p$? Calculate the area on a sphere of the intersection of two spherical caps String manipulation with & or + in VB.NET Can an abstract class have a constructor?  If so, how can it be used and for what purposes? I think it's well established that for the basic premise in the Back to the Future Trilogy to work, we have a system of alternate timelines.  If this is the case though, then why would Marty in Back to the Future (the original) begin to fade?  Logically, there would simply be no Marty in the alternate timeline created when Marty travels back to 1955 for the first time; why should this affect the original Marty from the original timeline? Replacing all values in a table > $T$