So when you do @User, it does notify the user, but I'd appreciate it if it became a link to their profile automatically, which can also be turned off as you type it. i.e. when you do the @ symbol, someones name comes up in a box. Next to that name we could have a "do not link" if they don't wanna link the profile.  Sort of like facebook.  Edit: i'd say this is partially duplicate.  The people in that question believe that this won't work. I suggest, in the suggestion box that comes up when you type @, there can be a list of the usernames. e.g. when you do @RegisteredUser, there are a bunch of Registered User names so just list them with profile pictures so the user can select which one. All of this is in the box where normally the site would suggest the name you're about to tag.
When you respond to someone in a comment you use @PersonsName. Is there anyway it could be linked like this @
Which function ($f$) is continuous nowhere but $|f(x)|$ is continuous everywhere? Which function ($f$) is continuous nowhere but $|f(x)|$ is continuous everywhere?   I found this question , the question seems much interesting but for obvious reason it is closed there, I was wondering how to derive such a function? Prove that $T$ has a cyclic vector iff its minimal and characteristic polynomials are the same One of is followed by plural noun/pronoun and singular helping verb Positive integer multiples of an irrational mod 1 are dense I'm not sure how to solve this one. Thank you!  $2.$ For any $\alpha\in \mathbb R$ we define $$\lfloor \alpha \rfloor = \max_{n\in\mathbb Z}\{\,n\mid n\leq \alpha\,\}$$ and $$\alpha\bmod 1 = \alpha - \lfloor \alpha \rfloor$$ Let $\alpha$ be irrational. (a) Given $n\in\mathbb N$ show that $\{\,k\alpha\bmod1\mid k\in\mathbb N\,\}\cap\left[0,\frac{1}{n}\right]\neq\emptyset$ (b) Prove that $\{\,n\alpha\bmod 1\mid n\in\mathbb N\,\}$ is dense in $[0,1]$. Java: GUI - JButton opening new JPanel and reading the JTextFields 'Possible duplicate' comment not appearing for questions with deleted comments containing the link I posted a comment to a duplicate question on . But I decided to delete it. Afterwards I voted as duplicate and thought a comment would be generated like     possible duplicate of ...   But it didn't. My guess is that the duplicate-comment won't be generated if a comment exists with that link, even if deleted. Let be the next equivalence relation on $B= \{R \subseteq \mathbb{N}\times\mathbb{N} \ | \ R \ is \ a \ well-order \ on \  \mathbb{N}\}$ : $$"R \equiv R' \leftrightarrow \ (\mathbb{N},R) \cong (\mathbb{N},R') \ are \ well-ordering \ sets \  isomorphic" $$  Which is the cardinality of $B/\equiv$?  Firstly, we can notice that each well-ordering set is isomorphic to an ordinal $\alpha \ $such that $\alpha &lt; \aleph_{1}$, and so it is enough to count how many ordinals are isomorphic to a subset of $\mathbb{N}$. For example, if we consider $A$ the set of the even numbers and $B$ the set of odd numbers with the usual order relation, $A \oplus B$ is isomorphic to $\omega + \omega$. Another example could be: if we consider the order of $\mathbb{N}$ that we use in Sharkowski Theorem, that order is isomorphic to $ \omega^{2} + \omega$. Working with prime numbers we could build also $\omega^{n} \ \forall n \in \mathbb{N}$, and so $\omega^{\omega}$ and maybe something bigger. However, we know that each countable ordinal is isomorphic to a subset of $\mathbb{Q}$, but I bet that the same result is not true for $\mathbb{N}$ because it is "too small".  What can I do? I've seen many boads with weird zig-zag shaped tracks just like the one below. Why are they designed like that? No reason for anyone to see pending close votes, except OP (and maybe people who already voted) Is there a term for switching syllables of words? Loop-cut won't go all the way around Alright so I've seen some postings about loop cuts and done some research. I am very new to blender and modeling overall. I am trying to loop cut this concrete barrier. Now I'm following a tutorial and kind of did my own thing in some areas. I cleaned it up following some instructions in another answer here on stack exchange.  I can't for the life of me figure out why I can loop cut around the whole bottom:   ...but not the whole middle:   I see this marked as answered by another question. That question refers to ngons and inside faces. Now once again I'm totally new to this. I looked on the inside. I don't believe I have inside faces or any ngons by the terms I've read online in my research.  Here is a wireframe picture and the inside view:     Maybe I'm missing something the answers on other posts are saying. If so and you know what it is I'd be very appreciative of what it is. Obviously, most beers are carbonated with carbon dioxide, while some stouts/porters are "carbonated" with nitrogen.  I was curious if there has been any notable experimentation with other gasses to "carbonate" beer. If nitrogen can introduce a "creamy" texture to a beer, I would think that other gasses would also be able to introduce their own characteristics on beer. If any of these experiments have done, what characteristics do these other gases impart?  I'm sure cost would be an issue for certain gasses that would prohibit its use in beer, but for purposes of this question, cost is irrelevant.  As an aside, what is the correct term to use, as opposed to "carbonate", for a question of this nature? How can I left-align a caption? I am using this for captions:  \usepackage[font=small,format=plain,labelfont=bf,up,textfont=normal,up]{caption}   But they all come out centred - I want them aligned with the left margin - how can I do this? I killed my first wife once I found out there is a mercenary you can marry who gives you up to 300 gold a day (in Whiterun). The only requirement, of course, being that I had to hire her first. So I hired her, and then I popped the question, to which she replied the usual: tell the priest to arrange the wedding.   When we reached Riften I told her to wait, just outside the bee and barb, and arranged the wedding. I went through the process, and the second it finished she left, I followed but as I left she was nowhere to be seen. I have tried going back to my house, the pub where I hired her and that same spot in Riften about 6 times each now, some during the day, some during the night and cannot find her at all.   Now this isn't to much of a problem because I can re-marry...oh wait, to remarry, my spouse has to die, so I can't claim gold off her and can't remarry, and the autosaves have been used up fast travelling to the places I thought she might've been. My last save is something like 6 levels ago, and I don't want to have to load it.   What should I do about this situation? What is wrong with "Where should this car be parked?"? Homework - set theory infinite union A question from my homework I'm having trouble understanding. We are given:  $A(1) = \{\varnothing\}$, $A(n+1) = A(n)\cup (A(n)\times A(n))$  $A=A(1)\cup A(2)\cup A(3)\cup \cdots \cup A(n)\cup A(n+1) \cup \cdots$ to infinity  The questions are:  1) show that $A\times A \subseteq A$  2) Is $A \times A = A$?  Thank you for your help.  I've tried writing $A(2)$ but it gets really complicated and I'm having trouble understanding what the sets are. Let alone solve the question. What is duplicate content and how can I avoid being penalized for it on my site? Prove that if prime $p$ divide $a_{2k}-2$, then $p$ divide also $a_{2k+1}-1$. Deserialize JSON object into dynamic object using Json.net Increase close vote weight for gold tag badge holders In order to increase the efficiency with which poor quality questions are closed, it could make sense to have weighted close votes for a small subset of qualified users.   A very good way to measure the qualified users would be to leverage the tag badges. However, it needs to be rationally limited to a set of users that are knowledgeable with the subject. A very good way to measure the top users in a tag would be to look at those who have a gold badge in the tag.  If two users who have a gold tag badge pertinent to a question issue a close vote, the question should probably be closed (or probably will be very soon under the current system). I think it would make sense to allow users with a gold tag badge to have a 3x weight for close votes in those tags.  Please keep in mind, this isn't suggesting full moderator one click closure. It only adds weight to the vote. A single user could not do it on their own. These singular users cast close votes all the time, so that aspect would not change. Some will vote to close, some wont, but the ones who do should have a stronger weight to their vote. Even with 3x it will require 2 of said votes to accomplish, or still 2 other users (meaning 3 agreed it should be closed - which is the same amount of high rep users it takes to delete a question and that has a much greater impact than closure).  tldr;  Allow gold tag badge users to have a weighted close vote in their tag