KDE: URLs are opened by Kate instead of the browser
Kate forces itself to be the default application for HTML
Showing that $\displaystyle\lim_{s \to{1+}}{(s-1)\zeta(s)}=1$ I need prove the following: ($\zeta(s)$ is the Riemann zeta function)  $\displaystyle\lim_{s \to{1+}}{(s-1)\zeta(s)}=1$  I really don't know, I have tried hard, but have obtained nothing for now. Why is it disadvantageous in graduate admissions to have a higher degree? indicates that holders of a master’s degree are held to higher standards when it comes to graduate admissions. The stated requirements for some graduate programs () also outright exclude applicants with doctoral degrees. These seem to be saying that holding a higher degree prior to application is a disadvantage (a fatal one in the case of a PhD). This also applies to private universities: Stanford  (at least in computer science); .  I don't understand why:   If there are two applicants, Alice and Bob, who have achieved largely similar things, it seems logical that both should have a roughly equal chance of being admitted. However, based on JeffE's answer, if Alice has a Masters degree while Bob does not, it's Bob that gets admitted instead of Alice. JeffE's answer even indicates that if Alice has achieved slightly more than Bob, it's still Bob that gets admitted.  If graduate admissions is looking for students that are capable of succeeding in its program, then Alice should be more likely to succeed than Bob since she's already had some experience of graduate study. This should be even more the case if Alice already has a PhD – if she can do it once, she should be able to do it again.    JeffE's answer indicates that since Alice has had more opportunities than Bob, she should also be held to higher standard. However it should also be true that Alice has already achieved what Bob has yet to and in fact might not be able to achieve. Further, JeffE's answer seems to be saying that Alice should do the academic equivalent of financial engineering and pass her graduate-level courses &amp; thesis without getting a master’s degree even if she qualifies for it, which sounds silly.  As for applicants with PhD degrees, my first guess would be that this is because , and the university is acting in the applicant's best interests. However if this is the case, then this is effectively telling the applicant "I know what you want better than you do", which also sounds silly. UC Berkeley's requirements also seem to be saying that if someone with a CV worthy of a tenured position were to apply for a PhD student position, the university will say "no" even though it's clearly better in their best interests (in terms of research output) to say "yes".   Presumably I'm misunderstanding something because if this behavior were irrational, it would already have been changed. What am I missing?  EDIT: I wonder if things are different in programs where the student is involved in research directly without spending time on coursework? Which one should be used?      To me, it makes no difference, but I'm not really sure why.   vs     For me, it makes no difference, but I'm not really sure why. Cancellation of addition on convex sets I  found a question about a property of the . However the question was not properly answered (it used a projection argument which might not be true in a general Banach space).  I was wondering whether the following (weaker) statement holds:  Let $X$ be a Banach space and suppose $A,B,C_0\subset X$ are bounded, closed, convex and non-empty subset. Do we then have $$A+C_0=B+C_0\implies A=B?$$ I have been attending a number of academic / professional conferences recently and one thing that really awed me was the flawless and natural way in which the speakers presented on their topics.  Sure, they had the occasional mispronunciations or awkward pauses but they spoke with authority and confidence.   Some of them used powerpoint slides but were not reading from the slides; they were just talking on the points and they had so much to say on each point that I felt they could not do it without notes, but they were not even looking at their notes most of the time.  (The advantages of not looking at their notes too much was that they could maintain eye contact and could use very interesting slides that were not crammed with the dot points of their speeches.)  I hate to think that they had memorised their speech notes but some of the presentations went for more than an hour.  I know rehearsal is important but I wonder how could anyone remember so much in a nervous situation. (Its one thing to know everything on your topic; its another thing to present that 'everything'!)  Question:  What background / foreground things do presenters do that make their presentations flawless and natural? How to cd into a directory with this name "-2" (starting with the hyphen)? I have a directory named:  -2   I want to cd into it but the cd complains:  bash: cd: -2: invalid option   With no success, I've tried:  cd "-2" cd '-2' cd \-2   Any solution?  Edit: no file browsers like mc, etc. available on the server. Standard nomenclature for component types What prefixes should be used on reference designators for components of various types?  I think we can all agree that "R##" refers to a resistor, "C##" refers to a capacitor, and "L##" refers to an inductor.  Beyond that, it appears to be a mishmash of conventions.    I've seen both "IC" and "U" used for chips.   "Q", "T", and "M" have been used for transistors and MOSFETs.  Ordinarily, "D##" is used for diodes, but LEDs and Zeners get special treatment on some boards.    What standards are available for reference, and who endorses them?  JEDEC, ISO, IEEE, and other standardization bodies are welcome references (though I'd prefer an inexpensive standard), but I'm also curious to see what's used at various companies other than my own.    Edit:  What I'd really like to see is a list in an answer here which complies with the standard (even if it's just a quote). difference fn(String... args) vs fn(String[] args) Whats this syntax useful for :       function(String... args)   Is this same as writing       function(String[] args)    with difference only while invoking this method or is there any other feature involved with it ? What's the appropriate reaction to an answer that doesn't attribute the source it's copied from? Find a recurrence relation for the number of $n$-digit binary sequences with no pair of consecutive $1$s.  I know my base case:$$a_1 = 2$$ for either $1$ or $0$. Normally to construct the recurrent relation I would say fill in $n-1$ spaces then add a $1$ or $0$, which is simply:$$a_n = 2\cdot a_{n-1}$$However, I don't believe this is right, because this doesn't take into account that there can't be any consecutive $1$s.  Even when I use the base case of $2$ digits:$$a_2 = 3$$for either $01$, $10$, or $00$, I still get the recurrence relation of:$$a_n = 3\cdot a_{n-2}$$which also does not account for $01$ and $10$ occurring consecutively.   So how would I express this? Error "WIF10201: No valid key mapping found" when trying to create claims from SAML How do I stop sharing call history between two iPhones? My husband and I both just upgraded to iOS 8.3.  Now I notice that if I have a missed call it shows up on his notice screen and all my calls show up in his recent call history (and vice versa).  Both phones don't ring and they don't need to be near each other or connected by Wi-Fi.  We do share an iTunes account.  How do I stop sharing call history between the two phones? We can apply l’Hôpital’s Rule to the indeterminate quotients $ \dfrac{0}{0} $ and $ \dfrac{\infty}{\infty} $, but why can’t we directly apply it to the indeterminate difference $ \infty - \infty $ or to the indeterminate product $ 0 \cdot \infty $?  Furthermore, why can’t we call $ \infty + \infty $ and $ \infty \cdot \infty $ indeterminate forms?  I’m new to calculus, so please clear up my concepts if you can. Thanks! How can I host my own Minecraft server? How would you explain covariance to someone who understands only the mean? ...assuming that I'm able to augment their knowledge about variance in an intuitive fashion (  ) or by saying: It's the average distance of the data values from the 'mean' - and since variance is in square units, we take the square root to keep the units same and that is called standard deviation.  Let's assume this much is articulated and (hopefully) understood by the 'receiver'. Now what is covariance and how would one explain it in simple English without the use of any mathematical terms/formulae? (I.e., intuitive explanation. ;)  Please note: I do know the formulae and the math behind the concept. I want to be able to 'explain' the same in an easy to understand fashion, without including the math; i.e., what does 'covariance' even mean? Can I give a creature trample after blockers have been assigned? I declare my attack with a 3/3 creature &amp; then my opponent assigns a 1/1 creature to block.  Am I allowed to use the ability of an  (1 Green Mana - Target creature gains trample until end of turn) on my original 3/3 creature to make sure that, in addition to his creature dying, he receives 2 damage to himself as well?  Or would that give my opponent the chance to go back and assign a secondary blocker? CSS selector for first element with class windows bat file error If nonempty, nonsingleton $Y$ is a proper convex subset of a simply ordered set $X$, then $Y$ is ray or interval? This is from Exercise 7 in p. 92 in Munkres's Topology.  Except for the trivial cases such as $Y$ is empty set or singleton, it seems if $Y$ is convex in an simply ordered set $X$ then $Y$ is interval or ray.  But I cannot start my proof because I cannot use $\sup$ or $\max$ functions.  What should I do? I'm developing a messenger application with encrypted chats.   In the first version of the app I've used PBKDF2 (10000 iterations, SHA1, random salt) to extend a short user password and generate keys to encrypt (AES256) and sign message (HMAC).  In the current version of the app I generate a random 130-bit key and use it instead of a user password. I think that using PBKDF2 with such a key has some overhead.   I see 2 possible ways to improve the current approach:   Keep using PBKDF2 and decrease iterations to 1 or 10. Don't use PBKDF2 and use HKDF instead.   What are the advantages and disadvantages of each approach? Are there any other options?