Client's website is not showing up as expected in Google local searches or maps I'm working for a client who runs a wellness center. He has a website as well as a Google Places account for the business. The Google Places account has a lot of tags associated with it that are relevant to the offerings from the center, and yet it doesn't show up on Google maps or in the local search results for really obvious searches like "massage [name of city]".   I don't have access to the Google Places account yet, but I'm wondering if there's any way to check to see if there's some obvious problem with how things are set up. I can include the link to the website/Google Places pages. I didn't want to do that right away in case it wasn't allowed.  Thanks in advance for any help!  It doesn't seem to me like this question is a duplicate of the one indicated. In this case there is a Google Places account, but it's not showing up in the local search results or anywhere on the map for anything other than the name of the wellness center itself. If this Google Place account isn't working properly, would it be advisable to create a new one for the same location, re-verify with google, mark the old one for deletion and then hope the new one works better? Are there any obvious configuration issues I should look for that might explain why this center doesn't even show up on the map for a search of "[name of first listed category] [name of city]"? I have worked with Google Places before and never encountered this type of problem.
Local SEO Strategies What are your strategies for local SEO? For example, if you had a web design company in Lincoln, Nebraska, what would you do for your website from an SEO perspective?
How to sort an array of objects containing null elements? Cannot open adobe reader on Ubuntu 12.10 64bits Correct tracked camera orientation How to get object size in memory? I need to know how much bytes my object consumes in memory (in C#). for example how much my Hashtable, or SortedList, or List&lt;String&gt;. Control a property with no socket (color ramp swatch, etc) from a Group Node input? The current process for self-deletion of a user account has several problematic aspects, both in the process itself and in the end result. Some of these issues are:   The process requires manual intervention of a mod or SE employee, leading to delays and sometimes mistakes. It is more complicated than it has to be, which can lead to the impression that SE is imposing some rather arbitrary-looking restrictions and steps one has to take. This can give the impression that the user isn't really in control of his private data at SE. It is irreversible once the account is deleted, although an account can be partially reconstructed with a lot of manual effort from an SE developer. There is no real protection against mod/SE employee errors, if an account is deleted in error, there is no easy way to undo the damage. Because it is manual, it consumes the time of SE employees that have to deal with it  (unless  is used), removing useful voting information and annoying users that lose reputation that way.   I'm proposing an alternative way of handling self-deletion that would be automated, and also reversible to some extent, while still being pretty much a hard-delete (and not a soft-delete that would be problematic with respect to user privacy). The process would work roughly like this:   The user clicks a "delete profile" button in his profile. There should be a way to indicate if you want to delete all profiles on all SE sites, only on this site and a way to select multiple sites from a list where the profile should be deleted. It is verified that the user has true access to the account in some way (confirmation mail?) and not just someone that found the unlocked computer of the user. A countdown until deletion is started (I'd go with 48h, but that could be different). The timer shouldn't be too long, but long enough to correct mistakes and leave users a bit of time to reconsider. Alternative options would be to enable users to override the countdown if they really want to nuke their account immediately. Another option would be to soft-delete the account immediately, and make the countdown only for hard-deletion of the user data. Upon deletion, the posts of the user and his votes are transferred to a newly created blank account, the original account itself is hard-deleted with all the remaining data it contains. The dummy account that holds the user's data should be flagged in some way as deleted, so that the profile links will be disabled, the profile won't be accessible and it won't appear in any user lists.  The user receives a private code that can be used to claim ownership of the account. Other ways are not possible as all private information is removed about the account. This allows for an automatic way of reclaiming most of the important parts of a deleted account. The ability to restore a deleted account might have to be somewhat restricted to avoid misusing it to get rid of the account history. It is more meant as an additional safeguard so that account reconstruction is more easily possible in rare cases. Such additional safeguards might be necessary as the deletion itself would be automatic and without oversight from SE or moderators.   I personally think that the information which posts and votes were connected to a (now anonymized) account is not sensitive enough that it would have to be removed on account deletion. My idea is that this would be close enough to a hard-delete that it satisfies any privacy concerns, but still allow reassociation of posts with a recovered account. The partial reversibility would alleviate concerns about removing the manual oversight by mods and SE employees over the account deletion process. How to make IntelliJ IDEA recognise code created by macros? Metaphors similar to "Trojan Horse" I'm looking for metaphors (non-jocular) with the same meaning as "Trojan Horse" - "A person or thing intended to undermine or destroy from within." Showing that localization is an exact functor How do I get the CPU temperature? How do I get the CPU temperature? Prove continuous functions $f$ and $g$ are equal Suppose $f,g$: $\Bbb R$ → $\Bbb R$ are continuous functions such that $f(r) = g(r)$ for all $r$ in $\Bbb Q$. That is to say, $f$ and $g$ are equal on the rational numbers.   Prove that  $f(x) = g(x)$  for all $x$ in $\Bbb R$ The Crumple-Horned Snorkack is one of various weird and wacky things which Luna Lovegood believes in and most people (especially the ever-rational Hermione) don't. Now we know that Luna is a bit ... odd, and believes in a lot of nonsense; but on the other hand, Hermione's pooh-poohing isn't always to be believed either - Divination, for instance, is a real thing in the Potterverse.  Is it ever established for sure, in canon, in-universe, whether or not Crumple-Horned Snorkacks exist? How to not count blank pages in frontmatter of two-sided document Waiting for user input with a timeout I have searched but apparently my google foo is weak. What I need is a way to prompt for user input in the console and have the request time out after a period of time and continue executing the script if no input comes in. As near as I can tell, Read-Host does not provide this functionality. Neither does $host.UI.PromptForChoice() nor does $host.UI.RawUI.ReadKey(). Thanks in advance for any pointers.  EDIT: Much thanks to Lars Truijens for finding the answer. I have taken the code that he pointed out and encapsulated it into a function. Note that the way that I have implemented it means there could be up to one second of delay between when the user hits a key and when script execution continues.  function Pause-Host {     param(             $Delay = 1          )     $counter = 0;     While(!$host.UI.RawUI.KeyAvailable -and ($counter++ -lt $Delay))     {         [Threading.Thread]::Sleep(1000)     } } For example, the square can be described with the equation $|x| + |y| = 1$. So is there a general equation that can describe a regular polygon (in the 2D Cartesian plane?), given the number of sides required?  Using the Wolfram Alpha site, this input gave an almost-square: PolarPlot(0.75 + ArcSin(Sin(2x+Pi/2))/(Sin(2x+Pi/2)*(Pi/4))) (x from 0 to 2Pi)  This input gave an almost-octagon: PolarPlot(0.75 + ArcSin(Sin(4x+Pi/2))/(Sin(4x+Pi/2)*Pi^2)) (x from 0 to 2Pi)  The idea is that as the number of sides in a regular polygon goes to infinity, the regular polygon approaches a circle. Since a circle can be described by an equation, can a regular polygon be described by one too? For our purposes, this is a regular convex polygon (triangle, square, pentagon, hexagon and so on).  It can be assumed that the centre of the regular polygon is at the origin $(0,0)$, and the radius is $1$ unit.  If there's no such equation, can the non-existence be proven? If there are equations, but only for certain polygons (for example, only for $n &lt; 7$ or something), can those equations be provided? "Within" and "in" when referring to time I know that both can mean "inside" but what I don't have clear is whether both mean the same when talking about time. For example:   The party is in two days = The party is within two days ??   According to this link  within means a limit that can be exceeded, so I'm wondering too if say "the party is within two days max" is correct or redundant. How to horizontally center an element Every finite commutative ring with no zero divisors contains a multiplicative identity? Two figures side by side Is 'clamp' a formally recognized mathematical function? I was surprised to find the clamp function absent from  and . Is this mainly a concept particular to computer programming? Is it known by another name in mathematics? I'll be editing the Wikipedia shortly to include a reference to this function but I want to make sure I'm not omitting some synonymous terms I'm currently unaware of.  $$   \operatorname{clamp}(x) = \max( a , \min( x , b ) ) \in [a,b] $$