What is the best ViewModel naming convention?
How do you name your ViewModel classes?
onClick to get the ID of the clicked button Orthogonal Projection onto the $ {L}_{\infty} $ Unit Ball What is the Orthogonal Projection onto the $ {\ell}_{\infty} $ Unit Ball?  Namely, given $ x \in {\mathbb{R}}^{n} $ what would be:  $$ {\mathcal{P}}_{ { \left\| \cdot \right\| }_{\infty} \leq 1 } \left( x \right) = \arg \min_{{ \left\| y \right\| }_{\infty} \leq 1} \left\{ {\left\| y - x \right\|}_{2}^{2} \right\} $$  I managed to get an answer using the . Yet I would be happy to see if someone can derive the answer directly.  Thank You. Can we insert or update FieldSets using apex code? What is the "Templates" folder in the home directory for? For as long as I can remember, every time I install Ubuntu there is a folder in the home directory called "Templates." I've always just deleted it, but I'm curious: what's it supposed to be used for, and why is it in the default install? Removing files matching a numeric range regular expression I have a folder which has many files. Some of the data files are labelled 1, 2, 3, ..., 300  I want to remove these data files using the terminal. How do I do this?   I want to do something like   rm some-regular-expression-giving-numbers-from-0--300 How do you force constructor signatures and static methods? Is there a way of forcing a (child) class to have constructors with particular signatures or particular static methods in C# or Java?  You can't obviously use interfaces for this, and I know that it will have a limited usage. One instance in which I do find it useful is when you want to enforce some design guideline, for example:  Exceptions They should all have the four canonical constructors, but there is no way to enforce it. You have to rely on a tool like FxCop (C# case) to catch these.  Operators There is no contract that specifies that two classes can be summed (with operator+ in C#)  Is there any design pattern to work around this limitation? What construct could be added to the language to overcome this limitation in future versions of C# or Java? Something's been bugging me about SO for a while now, that is the inaccuracy of "length of time" strings.  The best example I can give at the moment is .  If you look at the length of time he's been registered, it says 1 year.  He joined the site September 2008, which is only 3 months off two years.  It's the same with answers - you can give an answer 50 seconds before anyone else, but at certain times page views will show both as "5 minutes ago" or whatever.  That's not quite as bad, but with answers being sorted "randomly by votes" by default you could lose out on votes or being marked as the correct answer to the slower answer even if they're both the same.  There's probably a better method amongst these, IMO:   "Vulgar fraction" unicode characters     Member for 1½ years   answered 5¼ minutes ago asked 3⅓ hours ago  Different units   Member for 21 months (at least it's better than "1 year") Answered 306 seconds ago (ugly, I know) Asked 64 minutes ago (also ugly)  Combining units   Member for 1 year 9 months (fits easily on the profile screen) Answered 5 minutes 6 seconds ago (probably too long) Asked 3 hours 20 minutes ago (also long)  Rounding up   I personally prefer option 1, unicode fraction characters.  "Member for 21 months" is pretty good too because it's easy to quickly work out.  "Asked 452 seconds" ago is horrible though.  EDIT: I'm completely aware of the timestamp hover because I am forced into using it so much. It's a great feature, but it's not really in your face so not everyone knows about it. I still think there's a better "glancing" solution than having to hover over the time string. Proof that all abelian simple groups are cyclic groups of prime order Just wanted some feedback to ensure I did not make any mistakes with this proof. Thanks!  Since $G$ is abelian, every subgroup is normal. Since $G$ is simple, the only subgroups of $G$ are $1$ and $G$, and $|G| &gt; 1$, so for some $x\in G$ we have $x\neq 1$ and $\langle x\rangle\leq G$, so $\langle x\rangle = G$. Suppose $x$ has either infinite order or even order. Then $\langle x^2\rangle \leq G$ but $\langle x^2\rangle \neq \langle x \rangle$, a contradiction. So $x$, and therefore $G$, has odd order, and by Feit-Thompson, $G\cong Z_p$ for some prime $p$.  Edit: Thanks, I see that Feit-Thompson is too much.  Since $G$ is abelian, every subgroup is normal. Since $G$ is simple, the only subgroups of $G$ are $1$ and $G$, and $|G| &gt; 1$, so for some $x\in G$ we have $x\neq 1$ and $\langle x\rangle\leq G$, so $\langle x\rangle = G$. Suppose $x$ has infinite order. Then $\langle x^2\rangle \leq G$ but $\langle x^2\rangle \neq \langle x \rangle$, a contradiction. So $x$, and therefore $G$, has finite order. Suppose $x$ has composite order $n$ so for some $p &gt; 1$ that divides $n$, $\langle x^p \rangle$ is a proper non-trivial subgroup of $G$, so $G$ is not simple. So $G$ is a cyclic group of prime order. Proving a direct product of groups is a group I am trying to prove the following and am looking toward the math.stackexchange community to comment on whether I am on the right track or not. Thank you in advance.    Let $n \geq 1$ be an integer. Suppose $\{G_1,...,G_n\}$ is a finite set of groups. Define the set $G = G_1 \times G_2 \times ... \times G_n$ of ordered n-tuples $(g_1,g_2,...,g_n)$ where $g_i \in G_i$. Show that the operation $\bullet$: $G \times G \rightarrow G$ given by $(g_1,g_2,...,g_n) \bullet (g'_1,g'_2,...,g'_n) = (g_1g'_1,g_2g'_2,...,g_ng'_n)$ makes $G$ into a group.    Proof of associativity: $((g_1,g_2,...,g_n) \bullet (g'_1,g'_2,...g'_n)) \bullet (g''_1,g''_2,...,g''_n)$ = $(g_1g'_1,g_2g'_2,...,g_ng'_n) \bullet (g''_1,g''_2,...,g''_n) $ = $(g_1g'_1g''_1,g_2g'_2g''_2,...,g_ng'_ng''_n)$ = $(g_1,g_2,...,g_n) \bullet (g'_1g''_1,g'_2g''_2,...,g'_ng''_n) = (g_1,g_2,...,g_n) \bullet ((g'_1,g'_2,...,g'_n) \bullet (g''_1,g''_2,...,g''_n))$  \  Proof of the existence of an identity For each $G_i \in G$, take its identity element $e_i$ and multiply it as follows: $(g_1,g_2,...,g_n) \bullet (e_1,e_2,...,e_3)$ = $(g_1,g_2,...,g_n)$.  \  Proof of the existence of an inverse: Since each $G_i \in G$ is a group, simply takes its multiplicative inverse $g_i^{-1}$ and multiply it: $(g_1,g_2,...,g_n) \bullet (g_1^{-1},g_2^{-1},...,g_n^{-1}) = (e_1,e_2,...,e_n)$. Can HTML checkboxes be set to readonly? I thought they could be, but as I'm not putting my money where my mouth was (so to speak) setting the readonly attribute doesn't actually seem to do anything.  I'd rather not use Disabled, since I want the checked check boxes to be submitted with the rest of the form, I just don't want the client to be able to change them under certain circumstances. Why does demand for stock rise when a company appears to have high future value? This question is related to a couple of other questions ( and ) relating to some material that I teach in sampling theory.  Consider the critical points of the  defined as follows.  The value $t_{n-1, \alpha/2}$ is a function of $n$ defined by the implicit equation: $$\frac{\alpha}{2} = \frac{1}{\sqrt{(n-1) \pi}} \cdot \frac{\Gamma(\tfrac{n}{2})}{\Gamma(\tfrac{n-1}{2})} \int \limits_{t_{n-1, \alpha/2}}^\infty \Big( 1+ \frac{r^2}{n-1} \Big)^{-n/2} dr.$$ Normally we treat the input $n&gt;1$ as an integer, but it is possible to extend the treatment to consider it a real value (since the T-distribution is well-defined for non-integer degrees-of-freedom).  I'm trying to come up with a (relatively simple) proof that this critical point value is decreasing in $n$, but I seem to be making quite a mess.  Differentiation using Leibniz rule gets part way, but it quickly becomes a bit of a mess.  Consequently, I would like to solicit proofs of this result --- this simpler the better. Question: How do you prove that this critical point is strictly decreasing in $n$? nginx: Redirect https traffic without subdomain to subdomain (non-www to www) My current ssl certificate covers the subdomains www.example.com and static.example.com  So if a users try to access my site via  I want to redirect him to  .   How can I do that within in my nginx conf?  I know that similiar questions have been asked here, but I could not find the solution here. Many apps are missing from Ubuntu Software app I tried to enable additional repositories according to the instructions from , however my Ubuntu Software app is still missing a lot of popular apps. Is there anything I'm missing?  Ubuntu 16.10 Ubuntu Software app 3.20.1 Is there an efficient method of converting an integer into the written numbers, for example:  string Written = IntegerToWritten(21);   would return "Twenty One".  Is there any way of doing this that doesn't involve a massive look-up table? "Would" & " Used to" Only actions taken are displayed on question while checking the history of Low Quality Posts review On Ask Ubuntu, when I try to view my Low Quality Posts review history and click on the action taken on questions, I can only see the actions taken and no preview of the question.   :    The question still exists on the site:   It seems question review history page is missing this HTML class:  &lt;div class="reviewable-post reviewable-post-post_id"&gt;   On the other hand, everything is working fine for answers. How to get first N elements of a list in C#? I would like to use Linq to query a bus schedule in my project, so that at any time I can get the next 5 bus arrival times. How can I limit my query to the first 5 results?  More generally, how can I take a slice of a list in C#? (In Python I would use mylist[:5] to get the first 5 elements.) How can I draw a horizontal line spanning only some of the table cells? In a table, how can I draw a horizontal line that goes only through some of the cells? I mean a line like the one in the Foo and in the Bar area of this table:  +----+-----+ |Foo |1 |2 | |    |1 |2 | |    +--+--+ |    |1 |2 | |    |1 |2 | +----+-----+ |Bar |1 |2 | |    |1 |2 | |    +--+--+ |    |1 |2 | |    |1 |2 | +----+--+--+ Prove $R < ( 1 + (\sum |a_{i}|^{p} )^{q/p})^{1/q}$ for absolute value of polynomial zeros