Location without combadge
Why is a person's location exclusively tied to their communicator?
I know I'm late with this; this could be the last bug report about the old topbar. But the text on the privilege progress indicator (on your profile page) appears above the dropdown menu coming from the Stack Exchange button, as can be seen in the picture below.     Changing the z-index property of .s-progress-bar._badge .-info, .s-progress-bar._privilege .-info from 2 to 1 solves the problem.    The new menu seems to have a high enough z-index so that this is no longer a problem anymore: I had this problem a week or two ago and I posted here but nothing from the suggested solutions seemed to work. I have managed to get some more details on it, in case anyone can help me, because this issue is causing me huge productivity problems and I really want it solved.  So I'm using Linux mint distribution, and I've installed Lyx via the software manager. Every time that I open a new document, I get an error claiming that some files are missing, and until they are installed, compiling the files or exporting them as pdfs is not possible. The file in question is called "extarticle.cls". Additionally, under Document->Settings->Document Class, every document class is marked as unavailable.  Here is the thing though.. this file is not missing... I have located it inside a folder associated with Lyx. It's definitely not missing.  I really need help with this one guys... It's been weeks since the problem came up and I really just want to be rid of it.. Why does this thing not work? Any help? Deactivate all \alt,\uncover in beamer (for printing) I have a big latex beamer that uses \alt, \uncover, ... to create "animations".  My goal is to deactivate all these commands temporary (let's say : just use the last state/slide each time there's this kind of thing) to print my document.  Is there a global command to do this or have I to do all this manually (comment manually the commands / or (simpler but still really long) suppress manually pages from the output) ?  Thanks very much in advance for your help. Using apostrophes correctly I've read a great article about the . But there are still some points that are unclear.  Why do we say...   school project but not school's project? car service but not car's service or even cars' service (plural form)? apostrophe usage but not apostrophe's usage or apostrophes' usage? How to compute $k$'th roots $\!\bmod n$? I have the following equation: $$ n \equiv M^k\mod(b) $$ where n, a, b are integers, and M is unknown. How do I solve this equation to find the M value? Those a and b are public keys of the RSA algorithm and n is the result of encryption. I need to find the encrypted message. Why is the ROC curve two-dimensional instead of three-dimensional? My problem is that, I can not give name of my folder or file with special characters like \ / : * ? " &lt; > | in windows based O.S. This is very important for me, that giving name of file/folder which contain this type of characters.  I already search and refer so many site,for this problems but all are hopeless. I also read Microsoft support page, they suggest use other characters. This is its link,    I already try Alt button + ASCII code number of this type of special characters, from numpad key, just example rename file/folder and press Alt+60 (for &lt; characters) Still it giving message that, A filename cannot contain any of the following characters: \ / : * ? " &lt; > |   Suggest me suitable solution so that I can give name of my file/folder with this type of special characters. I just discovered Matlab's factor()-function, and I randomly typed in 20081294819, and to my surprise it only had two factors (5099 and 3938281)! I had expected many more factors for such a big number and wondered how normal this was. The following is what I've done in my investigation so far.  In the first figure below, I have plotted the probability that some number below $10^k$ has $m$ indistinct prime factors.  The second figure shows the evolution of the probability of finding a number with $m$ indistinct prime factors as the numbers one is looking at grows, i.e. it is just another way to visualize the same data. I have left out all points of zero probability.  If one looks at the first part of the figure, it seems that the peak of the curve for some $k$ shifts toward higher $m$ as $k$ grows.   My first question is this: Does this behavior (i.e. the peak shifting toward higher $m$ as $k$ grows) continue indefinitely, or will the peak stabilize at some point? The latter seems unlikely but I can't be sure.  My second question is this: Approximately how fast does the peak-value $m_{peak}$ move as $k$ grows?  I briefly looked at the , but this involves distinct primes and I don't really know much number theory, so any help would be greatly appreciated! "You're too clever a man" Why is this command not working: "ps aux | grep xscreensaver" I didn't see any hits about this on google, so I'm asking you:  I just tried to run this command in an ssh session, local is Debian Wheezy KDE, remote is Fedora 21 Gnome:  ps aux | grep xscreensaver   and this is the output:  bash:  grep: command not found...   I never seen this before, what is the cause?  I just few hours before updated the system, but didn't see any packages marked for removal. There are only two users on the system, and only me installs or removes software on it.  EDIT #1  Here is the commands and output copied,notice that the space is not there the second time:  [root@Hostname ~]# ps aux |  grep xscreensaver bash:  : command not found... [root@Hostname ~]# ps aux | grep xscreensaver bash:  grep: command not found... Why does Python code use len() function instead of a length method? I know that python has a len() function that is used to determine the size of a string, but I was wondering why it's not a method of the string object.  Update  Ok, I realized I was embarrassingly mistaken. __len__() is actually a method of a string object. It just seems weird to see object oriented code in Python using the len function on string objects. Furthermore, it's also weird to see __len__ as the name instead of just len. About the term $-\nabla_{[u,v]}w$ in the definition of Riemann curvature tensor Is R-squared value appropriate for comparing models? I'm trying to identify the best model to predict the prices of automobiles, using the prices and features available on automobile classified advertisement sites.  For this I used a couple of models from the scikit-learn library and neural network models from pybrain and neurolab. The approach I used so far is to run a fixed amount of data through some models(machine learning algorithms) and compare there $R^2$ values which was calculated with the scikit-learn metrics module.   Is $R^2$ a good method to compare the performance of different models? Although I got quite acceptable results for models such as Elastic net and Random forests I got very poor $R^2$ values for Neural network models,so is $R^2$ an appropriate method for evaluating neural networks (or non-linear methods)? Using restroom on airplane while fasten seatbelt light is on? This question about  over on  made me wonder what a passenger is supposed to do when they urgently have to use the restroom while the fasten seat belt light is on. FAA regulations require passengers to obey the seat-belt sign, even if flight attendants do not.  I saw this happen on a flight where an older gentleman asked the flight attendant if he could use the restroom, and she said "not until the light is off". The flight had been free of turbulence for 15 minutes or so by this time, and the flight attendants were walking freely throughout the cabin, collecting post-meal trash, etc. The gentleman who asked to use the restroom appeared to be in quite some discomfort, and practically ran to the restroom when the light went off 10 minutes later.  So what is a passenger supposed to do when he isn't permitted to use the lavatory, when he has to go and can't wait? Just go in their seat? Running junit tests in parallel in a Maven build? I'm using JUnit 4.4 and Maven and I have a large number of long-running integration tests.  When it comes to parallelizing test suites there are a few solutions that allow me to run each test method in a single test-class in parallel. But all of these require that I change the tests in one way or another.  I really think it would be a much cleaner solution to run X different test classes in X threads in parallel. I have hundreds of tests so I don't really care about threading individual test-classes.  Is there any way to do this? I wanted to find a counter example to show that the completeness of the inner product space is necessary in . Please give an example of a bounded linear functional $T$ on an incomplete inner product space $X$ which do not have any inner product representation i.e. there does not exist any $z$ in $X$ s.t. $T(x)= \langle ,z\rangle$ for all $x$ in $X$. How to find out who called a method? Proving that a Hölder space is a Banach space I am trying to show that the Hölder space $C^{k,\gamma}(\bar{U})$ is a Banach space. To do this, I successfully proved that the mapping $\| \quad \| : C^{k,\gamma}(\bar{U}) \to [0,\infty)$ is a norm, by proving its properties.   But how do I show that the sequence $\{u_k\}_{k=1}^\infty \subset C^{k,\gamma}(\bar{U})$ converges to $u \in C^{k,\gamma}(\bar{U})$, that is, how do I show that $$\lim_{k \to \infty}\|u_k-u\|=0,$$ which would mean the normed linear space is complete, and hence a Banach space?  Here are the following taken from PDE Evans, 2nd edition, page 255:     Definition. The Hölder space $$C^{k,\gamma}(\bar{U})$$ consists of all functions $u \in C^k(\bar{U})$ for which the norm $$\|u\|_{C^{k,y}(\bar{U})}:= \sum_{|\alpha|\le k} \|D^\alpha u \|_{C(\bar{U})}+\sum_{|\alpha|=k} [D^\alpha u]_{C^{0,\gamma}(\bar{U})}$$ is finite.   Also from page 254,     Definitions. (i) If $u : U \to \mathbb{R}$ is bounded and continuous, we write $$\|u\|_{C(\bar{U})}:=\sup_{x\in U}|u(x)|.$$      (ii) The $\gamma$th-Hölder seminorm of $u : U \to \mathbb{R}$ is $$[u]_{C^{0,\gamma}(\bar{U})}:=\sup_{\substack{x,y\in U \\ x \neq y}} \left\{\frac{|u(x)-u(y)|}{|x-y|^\gamma} \right\},$$ and the $\gamma$th-Hölder norm is $$\|u\|_{C^{0,\gamma}(\bar{U})}:=\|u\|_{C(\bar{U})}+[u]_{C^{0,\gamma}(\bar{U})}.$$   This is all I got so far: \begin{align} \|u_k-u\|_{C^{k,\gamma}(\bar{U})}&amp;=\sum_{|\alpha|\le k} \|D^\alpha u \|_{C(\bar{U})}+\sum_{|\alpha|=k} [D^\alpha u]_{C^{0,\gamma}(\bar{U})} \\ &amp;= \sum_{|\alpha|\le k} \sup_{x\in U} |u_k(x)-u(x)|+ \sum_{|\alpha|=k} \sup_{\substack{x,y\in U \\ x \neq y}} \left\{\frac{|[u_k(x)-u(x)]-[u_k(y)-u(y)]|}{|x-y|^\gamma} \right\}. \end{align} Now, where can I go from here, to show that $\lim_{k \to \infty}\|u_k-u\|_{C^{k,\gamma}(\bar{U})}=0$? The sequence is Cauchy, and I have to use that fact somehow. As far as I know, those are the only two.  They should be pronounced Soogher and Soor, shouldn't they?  I looked them up on Dictionary.com, and their etymologies reveal no trace of an SH, except where the listing for sugar had:     Middle English sugre, sucre (noun) &lt; Middle French sucre  &lt; Medieval Latin succārum  &lt; Italian zucchero  &lt; Arabic sukkar;  obscurely akin to Persian shakar, Greek sákcharon   I see an obscure kinship to shakar, but the word morphed so many times since then that the SH disappeared pretty much completely.  And sure is even worse, with no sign of SH:     Middle English sur ( e ) &lt; Middle French sur, Old French seur  &lt; Latin sēcūrus   Why are these the only two like this? Just curious whether the process takes a while, and whether it scrapes through history to determine if it was once valid or not. Currently, I have 6 0-vote accepted answers and 20 1+-vote answers (), and that makes it > 5 and > 20% but not for long if voting goes up or down from here. ;-P  Update:  Special thanks to Grace Note for pointing out the  to follow. I upgraded this to a bug because it's been 48 hours during which the criteria supposedly were met. 6 0-votes, 20-23 1+ votes during the whole period. The criteria only last so long, so it may go out of scope soon. If it only checks every 3 days, I'm not sure if that's intentional or a bug.