As you see in the image, The &amp;nbsp content is adding to the pages. these are not there in the actual code.
So just now, I had a bug in my site that caused my custom navigation bar's buttons to be sized and spaced incorrectly. I had no idea where this bug came from, and had to search around for awhile to find the answer. It turns out that SharePoint decided it would be a good idea to inexplicably add a few lines of:  nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;  nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;nbsp;   between my   in my DevHome.aspx (I'm using Angular for this particular project). So, why does Sharepoint do this, and how do I prevent it? This is not the first time SharePoint has randomly added an nbsp to my page.  Thanks in advance.
Can an integrated HDMI port work both ways? Say I had a laptop [Correction: notebook, don't want my thighs medium rare], any OS, and it has an HDMI port built into the side. Would it be remotely possible to hack it into an input, provided it wasn't already designed for that? I would figure all video ports operate straight off the graphics chip, however, are there ways to override that functionality on the driver level? Driver hacks already exist for plenty of things such as the classic example: Bluetooth adapters (so we can play with our PS3 controllers and save a buck) However, is HDMI one of these tamperable interfaces? As far as the interface standard is concerned, are HDMI ports designed to be either way or are they Input/Output specific? Sort Order on Close Vote Queue The Close-Vote queue is large and growing. I searched for definitive information on how that queue is sorted for reviewers, and the nearest I could find is that it is randomized - but that post was some years old.  Would it be possible to sort on order of votes already received? That is, all questions with 4 votes to close are surfaced first (in random order) to reviewers? Questions with 3 votes would come up before ones with 2, etc. In that manner a given question gets out of 'will it close?' limbo faster.   This feature request would, in my opinion, be supportable if the majority of reviewer votes were going to single-vote questions. I cannot (I think) actually find these numbers. If this is the case, the majority of the work is going to an ever-increasing queue, and proportionally fewer votes are being resolved.  Note there are other distributions that could help get in this direction without being a strict ordering, like weighting the chance a given question is surfaced to a reviewer by the number of votes. However, for discussion purposes I thought I'd keep it simple.  Usual apology if this has actually been addressed. Search is sad-making. What should main() return in C and C++? Function to determine if two numbers are nearly equal when rounded to n significant decimal digits I have been asked to test a library provided by a 3rd party. The library is known to be accurate to n significant figures. Any less-significant errors can safely be ignored. I want to write a function to help me compare the results:  def nearlyequal( a, b, sigfig=5 ):   The purpose of this function is to determine if two floating-point numbers (a and b) are approximately equal. The function will return True if a==b (exact match) or if a and b have the same value when rounded to sigfig significant-figures when written in decimal.   Can anybody suggest a good implementation? I've written a mini unit-test. Unless you can see a bug in my tests then a good implementation should pass the following:  assert nearlyequal(1, 1, 5)  assert nearlyequal(1.0, 1.0, 5)  assert nearlyequal(1.0, 1.0, 5)  assert nearlyequal(-1e-9, 1e-9, 5)  assert nearlyequal(1e9, 1e9 + 1 , 5)  assert not nearlyequal( 1e4, 1e4 + 1, 5)  assert nearlyequal( 0.0, 1e-15, 5 )  assert not nearlyequal( 0.0, 1e-4, 6 )    Additional notes:   Values a and b might be of type int, float or numpy.float64. Values a and b will always be of the same type. It's vital that conversion does not introduce additional error into the function. Lets keep this numerical, so functions that convert to strings or use non-mathematical tricks are not ideal. This program will be audited by somebody who is a mathematician who will want to be able to prove that the function does what it is supposed to do. Speed... I've got to compare a lot of numbers so the faster the better. I've got numpy, scipy and the standard-library. Anything else will be hard for me to get, especially for such a small part of the project. I am getting this message every time I do something like starting or stopping a service.  perl: warning: Setting locale failed.    perl: warning: Please check that your locale settings:            LANGUAGE = "en_US:en",            LC_ALL = (unset),            LC_MESSAGES = "en_US.UTF-8",            LANG = "en_US.UTF-8"        are supported and installed on your system.    perl: warning: Falling back to the standard locale ("C").    locale: Cannot set LC_CTYPE to default locale: No such file or directory    locale: Cannot set LC_MESSAGES to default locale: No such file or directory    locale: Cannot set LC_ALL to default locale: No such file or directory    (Reading database ... 21173 files and directories currently installed.)   Removing bind9 ...    * Stopping domain name service... bind9                                        [ OK ] Processing triggers for man-db ...    locale: Cannot set LC_CTYPE to default locale: No such file or directory    locale: Cannot set LC_MESSAGES to default locale: No such file or directory    locale: Cannot set LC_ALL to default locale: No such file or directory      How do I fix this error ? How do I add myself into the sudoers group? Possible Duplicate:          I've added myself back into the admin's group I think, by following   But I still can't do commands like:  sudo aptitude update   I get the message  oshirowanen is not in the sudoers file.  This incident will be reported.   How do I add myself into the sudoers group now that I am in the admin group? As in the title, I must prove that: If a complex function $f$ is Entire, and there exist $k,R &gt; 0$, $n \in N$ such that $|f(z)| &gt; k|z|^n$ for all $|z| &gt; R$: Then f is a polynomial.  We've already had a similar question with the inequality reversed, and found that it had to be a polynomial with degree less than n. I was able to show that if it was a polynomial, then it had to have degree less than n, but not that it had to be a polynomial in the first place.  Once again, I'm face with the same problem. I assume this time, the degree of the polynomial will have degree greater than or equal to n, but how do I show that such $f$ must be a polynomial?  It's not like I can go through every other possible function there is, can I? I can show it doesn't work for exponentials, for example, but I just can't think of how to show that this ONLY works for a polynomial... I have a table that I want to insert on a page, but at least one (perhaps both) of the following conditions are met:   The table is too wide to fit within the text block or page. That is, I'm exceeding some horizontal restriction. The table is too tall to fit within the text block or page. That is, I'm exceeding some vertical restriction.   What are my options to make this table fit? If it doesn't fit, regardless of my attempts, what other options exist? Changing units of measurement in a simple regression model vinegar pickles safety Where exactly does energy quantisation come in for light? Planck quantised the energy of light in order to solve the black body radiation problem. However, I am confused as to exactly what he quantised. On one hand, I have seen that he quantised the energy of oscillators in the black body (source below).     However, the second version of the story I've heard is that it is simply that light energy is given off in discrete chunks (where every photon itself can have any value of energy it likes depending on frequency and is not quantised).   To me, the first idea doesn't make sense because $E=hf$ and as $f$ can be any real number that means the energy of each photon can be any real number. I would believe the second version, however I don't understand how this version of quantisation leads to reducing the number of high frequency waves emitted and thus solving the UV catastrophe. Could you please explain exactly how releasing energy in chunks (of arbitrary size themselves) means less will be released in the higher frequencies? How to use siunitx with non numerical values? Show that $|z_1 + z_2|^2 < (1+C)|z_1|^2 + \left(1 + \frac{1}{C}\right) |z_2|^2$ Let $z_1$ and $z_2$ be two complex numbers. Show that there exists $C &gt; 0$ with   $$  |z_1 + z_2|^2 &lt; (1+C)|z_1|^2 + \left(1 + \frac{1}{C}\right) |z_2|^2. $$   I tried to simplify the L.H.S and R.H.S, SNF I was finally left to compare between a real number and a complex number  I really couldn't think of anything else. Please help. Android: TextView automatically truncate and replace last 3 char of String Is there a problem with closing the lid of a MacBook Pro when using an external monitor? I am using an external monitor and the only way (that doesn't involve jumping through hoops) to turn off the MacBook Pro monitor is to close the lid.  Does closing the lid causes any problems? I have read the following on :     You can still run a single external monitor if you close the lid of   your laptop, but that restricts airflow and exposes your display to a   lot of heat. Not good. for working with MS word files in python, there is python win32 extensions, which can be used in windows. How do I do the same in linux? Is there any library? UBUNTU 14.04 cheese booth not detect webcam Cheese Booth shows an error:     There was an error playing video from the webcam     I test if webcam works fine or not by opening google hangout, its works fine.    Please tell, what is the issue in cheese booth.  Note: Sometimes the cheese booth works fine but most of time not Search only for the currently active language On a series involving harmonic numbers What is approximate error of Pythagorean Theorem vs. Haversine Formula in measuring distances on sphere at various scales? Many people when first trying to calculate distances between two longitude / latitude pairs  ask if Pythagorean theorem works as an appropriate distance function.  Most often people answer "no, the Pythagorean theorem only works on a 2D Euclidean plane." Rarely, however, do people mention the effect of scale and location on the sphere on how inaccurate the Pythagorean theorem is.  The basic idea being at very small scales, the surface of a sphere looks very much like a plane. At very large scales, it distances along the surface are more curved and therefore the difference between the incorrect Pythagorean Theorem and the correct Haversine Formula is greater.  Does anyone know a formula or rule of thumb that tells you the difference between the two distance measures based on the scale of the distance you are trying to measure?   I think having this explicitly would help in:   explaining why the Pythagorean Theorem isn't perfect; and in letting people who are looking for more "rough" distances know when Pythagoras actually will serve their purposes.