Wondering if having identical, verified correct by the Google Structured Data Testing Tool, JSON-LD Schema data on index and the same JSON-LD Schema Data on all subpages would create any sort of problem with google search engine?  Could this be hurting my ranking?  Webmaster Console recognizes pages with it, and is not complaining.
We have added JSON-LD structured data to our website, so Google knows information about our company (company name, url, logo, address, etc.). We worked from the template on Google's .  One thing I couldn't find an answer to is where exactly should this JSON-LD snippet be included on our website? Right now, I only have it on our home page. I didn't know if it would look bad to search engines to have the Organization markup on every single page. But is there any recommendation?  Should Organization markup about our company be included on every page or only on certain pages?
Does visiting Canada from USA under ESTA reset the visa waiver? What is a subnet mask, and the difference between a subnet mask of 255.255.255.0 and 255.0.0.0? My DSL/WiFi router provided by my ISP has an internal IP address of 10.0.0.138, the addresses provided by DHCP are in the format of 10.0.0.xxx.  Now, I want to start using static IP addresses on my local network, and I don't know what to provide for the subnet mask.  What is a subnet mask?  Should I be using 255.255.255.0 or 255.0.0.0 as my subnet mask? What is the difference? Return matched elements' attribute ar array using jQuery Based on Logman dictionary:       happen to do something: if you happen to do something, you do it by chance.   for example take a look at these examples:     They happen to be unemployed at the time. I happen to have a degree in computer science.    So based on the definition of the happen to do something, first one means they are probably unemployed at the time. and the second one means I probably have a degree in computer science.     Am I right? android expandablelistview how to set space between groups items This is an example from Munkres's Topology (Example 4 in Section 22 titled &quot;The Quotient Topology&quot;, 2nd edition).  Example 4: Let $X$ be the closed unit ball $$\{ x \times y \mid x^2 + y^2 \le 1\}$$ in $\mathbb{R}^2$, and let $X^{\ast}$ be the partition of $X$ consisting of all the one-point sets $\{ x \times y \}$ for which $x^2 + y^2 &lt; 1$, along with the set $S^1= \{ x \times y \mid x^2 + y^2 = 1 \}$. Typical saturated open sets in $X$ are pictured by the shaded regions in the figure below. One can show that $X^{\ast}$ is homeomorphic with the subspace of $\mathbb{R}^3$ called the unit 2-sphere, defined by $$S^2 = \{ x \times y \times z \mid x^2 + y^2 + z^2 =1 \}.$$  I am confused about two points in the example.  Problem 1: About the saturated open sets in $X$. In the example, the typical ones are pictured by the shaded regions ($U, V$) in the figure. However, I am not sure whether the boundaries (visually, by picture) of $U$ and $V$ are included. Particularly, there are two boundaries for $U$. Are they both contained in $U$? And why? Problem 2: How to show that $X^{\ast}$ is homeomorphic with $S^2$? What is the mapping between them?  The following is my understanding:  Solution to problem 1: For $V$, the boundary is not included. For $U$, the outer boundary is included, while the inner one not. Is this solution right? MySQL ERROR 1045 (28000): Access denied for user 'bill'@'localhost' (using password: YES) I'm trying to convert some strings that are in French Canadian and basically, I'd like to be able to take out the French accent marks in the letters while keeping the letter. (E.g. convert é to e, so crème brûlée would become creme brulee)  What is the best method for achieving this? Lower bound for $\phi(n)$: Is $n/5  1$? Is it true that :  $\frac {n}{5} &lt; \phi (n) &lt; n$ for all $n &gt; 1$ where $\phi (n)$ is  .  Since $\phi(n)$ has maximum value when $n$ is a prime it follows that maximum value of $\phi(n)$ in term of $n$ is $n-1$ , therefore $\phi(n)&lt; n$ for all $n$. What is the best lower bound for $\phi(n)$? I think it would be useful if we could join across databases in the data-explorer.  For example, I'd like to query up a list of questions that I had a hand in migrating away from SO, and see what percentage of them were subsequently closed or re-migrated.  I realise I could download the various data dumps and do this on my own machine, but it would be nice if it were allowed on the online version.  Is this possible/practical? After Factory Reset, In order to use Play store and Gmail I want to setup Google account on Samsung GT-S6802. When I tries to setup Google Account, In-spite of right user-name and password, following window appearers:    When I open gmail form browser, I've mail from google subject:Sign-in attempt prevented and says:     Someone just tried to sign in to your Google Account hidden@gmail.com from an app that doesn't meet modern security standards.     When I review, it shows unknown device but on browser it detects my device.  So, How do I face this issue and setup google account? Combinatorial proof of $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$. What are nodes, and how do I use them? I'm a bit new to Blender, and in trying to learn more, I've stumbled across nodes.  What are nodes, and how do I use them? Prove upper bound for recurrence I am working on  problem 3 from MIT's Fall 2010 OCW class 6.042J. This is covered in  which is about recurrences.  Here is the problem:  $$A_0 = 2$$ $$A_{n+1} = A_n/2 + 1/A_n, \forall n \ge 1$$  Prove   $$A_n \le \sqrt2 + 1/2^n,  \forall n \ge 0$$  I have graphed the recurrence and the upper bound and they seem to both converge on $\sqrt2$.    Also, if you ignore the boundary condition $A_0 = 2$ then you find that $\sqrt2$ is a solution to the main part of the recurrence. i.e. $\sqrt2 = \sqrt2/2 + 1/\sqrt2$.  The chapter and videos on recurrences have a lot to say about a kind of cookbook solution to divide and conquer recurrences which they call the Akra-Bazzi Theorem. But this recurrence does not seem to be in the right form for that theorem. If it were in the form $A_{n+1} = A_n/2 + g(n)$ then the theorem would give you an asymptotic bound. But $1/A_n$ is not a simple function of $n$ like a polynomial. Instead it is part of the recurrence.  Also, the chapter has a variety of things to say about how to guess the right solution and plug it into an inductive proof, but I haven't had much success. I have tried possible solutions of various forms like $a_n = \sqrt2+a/b^n$ and tried solving for the constants $a$ and $b$ but to no avail.  So, if someone can point me in the right direction that would be great. I always assume that the problem sets are based on something taught in the videos and in the text of the book but I am having trouble tracking this one down.  Bobby How can I connect two different DC power sources together? How can I connecting two different DC power sources together? for example 15Vdc(5Amp) with 5Vdc(2Amp). I want to make one DC source (20Vdc,7Amp) by more powerful supplies. Installing particular versions when repo has newer versions? How do I find playtesters? Obviously the first tester group would be your own group. But beyond that? It would seem to make sense to have at least more than one group test out your game, as different groups want different things and play differently. Fresh eyes find different bugs, etc. etc.  Are there resources out there to help aspiring game designers without a lot of contacts find people willing and eager to test out their game?  Or is this in essence a "" issue?  To clarify my own situation:  I have the mechanics finished. The setting is still under development, but in accordance with the motto "fail faster" I want to go ahead and test the mechanics (in a different setting for now) to see if they work and are fun or if I need to go back to the drawing board. I have a sort-of group, but I don't know them very well and they don't meet often, and so I'm not excited about the prospect of presenting the mechanics to them right now (as I'm sure there are a dozen issues I've overlooked). Also, I'd like to test the game (including the setting, later) on more than one group, as mentioned above. I've put out some feelers among my current friends and acquaintances, but nobody's really been excited about playtesting or even really giving in-depth feedback, and I don't want to be that person who's always shoving their project in your face. I'm willing to run something online as well. I'm also interested in having others run a game without me present, and giving me their feedback.  Also, I'm looking for something of a guide-type answer that might help someone besides just me. Why do modern mountain bike forks no longer use boots on fork stanchions? Why do modern mountain bike forks no longer use boots on fork stanchions? Older mountain bikes used to have them on the forks, and lefty and headshocks still do. Why have these fallen out of fashion and would putting aftermarket fork boots on your stanchions be productive or not? Is it possible to install Windows from an external hard drive?  I have Windows XP installed on my laptop, and I want to remove it and install Windows 7.  My Windows 7 installation is in an .iso format on an external USB hard drive.  Is it possible to install it or will I need to put in a DVD before I start installing? Expression Versus Statement I'm asking with regards to c#, but I assume its the same in most other languages.  Does anyone have a good definition of expressions and statements and what the differences are?