Is it useful to have your company name as an  on every page? I saw a (quite okay) website where every page has the logo/title of the company as an . I was wondering if that is actually usefull or just ruining your SE(o)-score?  The full HTML line is &lt;h1 class="Logo"&gt;&lt;a href="/" class="Logo"&gt;Company name here&lt;/a&gt;&lt;/h1&gt;  And I got to add: Not the , but the  gets, via CSS, updated with a background image.
Website logo text - best tag for SEO purposes? I'm trying to develop a new website in HTML5 adhering to SEO standards where possible and I'm having a little trouble trying to figure out what tag my site name and slogan should live in.  Originally I had my site name in a &lt;h1&gt; tag and my sloagan in a &lt;h2&gt;, but soon realised this wasn't fitting with the "each page is a separate document/article" approach.  The site name is the largest text on the page (sometimes the same as my article heading), but I've currently got the text in a &lt;p&gt; tag with CSS doing all the styling work.  My questions is, what should I do with the site name and slogan? Is the &lt;h1&gt; appropriate, then use another &lt;h1&gt; tag for each page title or should I continue using the styled &lt;p&gt; tag? Or should I convert this into an image and use that for the site name/slogan?  (Side note: on my index page I want the site name and slogan to be &lt;h1&gt; and &lt;h2&gt;respectively as this makes sense with the homepage...)
Dynamic Object Intellisense Can I travel to Dublin, Republic of Ireland with UK Tier 2/Schengen visas with Indian Passport Return single column from a multi-dimensional array I started thinking about the number of associative (binary) operations on a set with $n$ elements today.  Looking online I found  which indicates only $113$ of the possible $19,683$ operations on a three-element set satisfy association.  So, $50\%$ of binary operations on a two-element set satisfy association, and less than $0.6\%$ of all binary operations on a three element set satisfy association.  For an $n$-element set, where $n$ denotes a natural number, is the ratio $R_{n}=A_{n}/B_{n}$, of the number of associative binary operations $A_{n}$ to the number of all binary operations $B_{n}$, in general small?  I don't mean the following questions as equivalent, but since they seem more concretely answerable in principle, does   $$ \lim_{n \to +\infty} \frac{A_{n}}{B_{n}} = 0 ? $$       Also, is $F : n \to R_{n}$ a monotonically decreasing function?  Some Background of the Question: In his Linear Algebra Problem Book 1995 on p. 6 Paul Halmos writes "The commonly accepted attitudes toward the commutative law and the associative law are different.  Many real life operations fail to commute; the mathematical community has learned to live with that fact and even to enjoy it.  Violations of the associative law, on the other hand, are usually considered by specialists only."  For all I know, Halmos might only have written that to motivate the study of Linear Algebra and doesn't quite literally mean what he appears to say.  But, if he means what he appears to say, and if $F : n \to R_{n}$ is monotonically decreasing, or $R_{n}$ is generally small, I think there's something amiss with what Halmos says, since non-associative operations seem so common that one may as well enjoy them. Developer Accounts for ExactTarget How do I show that $a^p + b^p > (a + b)^p$ for $a,b>0$ and $0<p<1$? A question on my math homework asks us to show that if $0 &lt; p &lt; 1$ and $a, b &gt; 0$, then $a^p + b^p &gt; (a + b)^p$. I have no idea how to do this, any pointers? Some months ago I watched  video of Blenderguru about "How to create a realistic earth in blender". In this video blender render is used and  now that I understand texturing in cycles a little better I am trying to rebuild this "realistic earth" with cycles.    In the video - starting at about 11:30 min - it is shown how to map the "earth day" and "earth night" image textures. Depending on the lights shining on the earth the earth or night image is projected. I tried to rebuild that in cycles but I think I a making mistakes. In the circled box the "night" nodes are found. What Is my mistake ?   P.S When you see other mistakes in this node tree, please let me know.  OK ... I now have implemented the advice of Uncle Snail (except moving the black slider). Below an image of the earth and the updated node tree (I also rearranged nodes for better overview).    In the Color Ramp, I did not move the slider. Is that really necessary ?? Duplicate objects transformation applies to both objects I'm facing this frustrating "feature" that I can't seem to remedy; when I duplicate an object (and now, even when I create two completely new objects), their transformations/scaling is synchronized. This is extremely annoying when trying to use any sort of transformation keyboard shortcut.  It should be noted by going to the properties menu (N) and manually setting the properties works just fine.  For instance, here is just the camera selected (trust me, I made sure):   And when I try to transform by clicking+dragging on the X axis OR by hitting G->X, this happens:   They are not grouped (verified by going to the Groups list up in the Scene panel) and they do not have parents (verified by going to Object->Relations).  I have tried the unlink command as well, to no avail.  I have seriously run out of options; what did I change to have my G->X shortcuts transform multiple objects? It seems completely at random, too; certain objects seemed to be "linked" to other random objects, and this "linking" is guaranteed when duplicating even when I do a non-linking duplicate (Shift+D).  What gives? Associativty of smash product on compact spaces Let $Y,Z$ be compact or $X,Z$ locally compact. Then the canonical bijection    $$ (X \wedge Y) \wedge Z \rightarrow X \wedge (Y \wedge Z) $$    is a homeomoprhism.    I can prove the case when $X,Z$ are locally compact using exponential law. But I don't see how one approaches the case when $Y,Z$ compact. Hints? I've added many PPAs using the add-apt-repository command. Is there a simple way to remove these PPAs? I've checked in /etc/apt/sources.list for the appropriate deb lines but they aren't there.   This is on a server system so a command line solution would be great! What are these dark spots in my pictures? I've been seeing these dark spots in my pictures. They appear a lot more on some pictures than others, but they are in the same place in the image and independent of the lens being used. Is this dust? I've also heard that you can get oil spots on the sensor.  The image is from a Nikon D7000. Infinite Series Convergence Verification I'm currently tackling the following infinite series in order to determine if it converges or not:  $$\sum_{n=1}^\infty \frac{\sqrt{n+1}-\sqrt{n}}{n}$$  What I've done is rearranged this to make use of the comparison test, shown below:  $$= \frac{\sqrt{n+1}-\sqrt{n}}{n} * (\frac{\sqrt{n+1}+\sqrt{n}}{\sqrt{n+1}+\sqrt{n}})$$  $$= \frac{(n+1)-(n)}{n(\sqrt{n+1}+\sqrt{n})}$$  $$= \frac{1}{n(\sqrt{n+1}+\sqrt{n})}$$  $$= \frac{1}{n^{3/2}+\sqrt{n+1}} &lt; \frac{1}{\sqrt{n+1}} &lt; \frac{1}{\sqrt{n}} $$  However, $\frac{1}{n}$ is smaller than $\frac{1}{\sqrt{n}}$, therefore:  $$  \frac{1}{n}   &lt; \frac{1}{\sqrt{n}}$$   This implies divergence by the comparison test due to the fact $\frac{1}{n}$ diverges, and if a smaller series diverges any larger series must as well.  Is this right? If I've made any mistakes in any part, please tell me! Does it exist a free interactive geometry software, like GeoGebra, which works for 3D geometry? I would be able to draw spheres, great circles, and so on. Correctness of questions without inversion, relying on intonation How can I mitigate edge halo when darkening skies in post-processing? Why do you have to use copy_to_user()/copy_from_user() to access user space from the kernel? What happened to the “‑est” and “‑eth” verb suffixes in English? What happened to them, and how were they once used? Straining my mind to sound archaic, I came up with the following:     Dost thou thinkest thou can escape thy sins?   and     Bringeth me mine armor and favorite sword.   I’d like to use these suffixes intelligently, so my questions are: how are ‑est and ‑eth properly appellated in conjugations, and  when and why did they disappear? How to perform a true GIS clip of polygons layer using a polygon layer in R? I would like to do a true GIS Clip in R of soils polygons using a series of single boundary polygons, but I cannot find an R function to properly do it. It should work just like the clip function in ESRI's ArcMap. I've tried the over method in sp package but it doesn't seem to work for polys over polys.   One suggestion was to use the gIntersection in rgeos package as a clip using the following code:  #------------------------------------ library(rgeos) library(maptools)  #Read layers as SpatialPolygonsDataFrame (both the same Albers projection) Soils_poly = readShapePoly("Soils_polygons")  #Note - Has 400 polygons clipper_poly = readShapePoly("clipper_polygon")  #Note - Has 1 polygon  #Try gintersection as clip  Clipped_polys = gIntersection(Clipper_Tile_poly, Soils_poly)  #-----------------------------------   This takes 5 minutes to run (way too slow) and errors with this:     Error in RGEOSBinTopoFunc(spgeom1, spgeom2, byid, id, drop_not_poly, "rgeos_intersection") :      TopologyException: no outgoing dirEdge found at -721459.77681285271 2009506.5980877089   I also tried this code to check for overlap:  gIntersects(Clipper_Tile_poly, Soils_poly)   and the result was TRUE. clip function in ESRI ArcMap works fine for this data.   Anyone knows of an R function to properly do a clip on spatial polygons using spatial polygons? Relationship between (algebraic) vector bundle and (topological) vector bundle on $\mathbb{RP}^{1}$($\mathbb{P}^{1}$) How is Russell’s Paradox equal to the universal set?