Windows Docker and MS Server OS license
Can you help me with my software licensing issue?
What are the criteria for posts to be included in "Top network posts" on new profile page? From the name of it, certainly it looks for posts with the highest scores. However, recently I found that some of the posts are not listed. Example: My  (not sure if it's that good, just because hot network question) was included in some point, but then it's not listed on . I guess it's because the question was closed, e.g as a dupe? (I don't have any hidden communities on the settings)    However, it's listed normally on .    Also, what other criteria that makes the posts to be included/excluded in &quot;Top network posts&quot;? Submitting ACM Conference papers to ArXiv I'm a little confused. The  states:     ACM authors hold the right to post copies of their own peer-reviewed accepted ACM works on any non-commercial repository or aggregation that does not duplicate ACM tables of contents, i.e., whose patterns of links do not substantially duplicate an ACM-copyrighted volume or issue. Non-commercial repositories are here understood as repositories owned by non-profit organizations that do not charge a fee for accessing deposited articles and that do not sell advertising or otherwise profit from serving articles.   However, the  site states:     Can I publish the published version of my publication on arXiv?       No. An ACM author cannot grant arXiv.org or any other publisher rights to distribute their works that have been published by ACM.   SHERPA/Romeo shows ACM as being a "Green Publisher", which would support the case that I can upload to ArXiv.   states that I can upload pre- or postprints under certain circumstances, but does not explicitly mention Arxiv, positively or negatively.  So, what is it? Can I submit a paper I published with an ACM Conference (ACM WiSec, if that makes a difference) to ArXiv or not? As I understand it, ArXiv is a non-profit, so it would fit the terms of the publishing policy. Or is this related to the rights you have to grant ArXiv upon submission?  If I can only publish a specific version of the paper, which one? Inaccurate altitude GPS data with my Android? The Punjab is a rich state.   Is it correct to use the before Punjab? Is there a comma needed before quotation? I am trying to show the current date in my JSP page using JSTL. below is the code I am using.  &lt;jsp:useBean id="now" class="java.util.Date" scope="request" /&gt; &lt;fmt:formatDate value="${now}" pattern="MM.dd.yyyy" /&gt;   But the above code is not producing any results? Am I missing anything here or is there any better approach for this? I am using JSTL 1.1. I think there's an unintended motivation for users to post questions to higher-traffic Stack Exchange sites rather than their more specific or appropriate lower-traffic ones.  I think I have a solution.  What motivated this suggestion for me was that I am confident that if users were to post Android design questions to  beta and/or , that they would likely not be noticed by the appropriate audience compared to the vast army of Android experts here on Stack Overflow.    There are plenty of Android questions on SO that really should be on one or both of the aforementioned sites.  Presently there is little motivation for users to start questions like this on the appropriate site.  Is there something we could do to cross-pollinate related sites?  For instance, what if we let certain tags span certain sites?  Obviously the selection would be controlled by high-reputation users.   There could also be a feature to show (or explicitly hide) certain questions from other sites regardless of the tags.  This could be controlled by lower-reputation users than the global tag since it wouldn't have much statistical impact.  For instance, the android-layout tag could by default span sites, but OPs and other users could eliminate from the Graphic Design site questions that are of a purely technical nature.  Users interested in Android tagged questions would see related questions on design and UE sites--whether they are searching, posting, or viewing a question through the related items.  This would help eliminate cross-site duplicates, and encourage people to post on the correct site in the first place.   For related question lists and search results, there could even be a specific cross-site icon  next to an off-site question to show that it's from UX, for example. Which is the best visualization for contingency tables? Which is best plot, from statistical standpoint, to show a , which is typically being analyzed by chi-square test? Is it a dodged barplot, stacked barplot, heatmap, contour plot, jitterred scatterplot, multiple lines plot or something else? Should one show absolute values or percentages?  Edit: Or as @forecaster suggests in the comments, the table of numbers is itself a simple plot and should be sufficient. What level should I be to kill Alduin I am level 31 and I have the Elder Scroll. I am not sure if my level is high enough to go to Whiterun and trap one of Alduin's minions. What level should I be before I attempt it? Elsarticle - Abstract two columns wide I am currently trying to create an article in elsarticle style, twocolumn. The title and text end up in two columns, the abstract however is made two columns wide. Any ideas what I am doing wrong? Obviously I want my abstract to also be only in the first column.  \documentclass[a4paper,10pt,twocolumn,preprint]{elsarticle}  \usepackage{lipsum}  \journal{TexExchange}   \begin{document}     \begin{frontmatter}       \title{Two-column abstract}       \begin{abstract}         \lipsum[1]      \end{abstract}       \begin{keyword}        abstract      \end{keyword}    \end{frontmatter}   \section{Outline}    \lipsum[2-3]  \end{document} Find all functions $f$ such that $f:\mathbb{N}\rightarrow\  \mathbb{N}$ and $f(f(n))+f(n+1)=n+2$   Let us plug in $n=1$  $f(f(1))+f(2)=3$  Since the function is from $\mathbb{N}$ to $\mathbb{N}$, $f(2)$ can only take the values $1,2$. Now we divide the problem into cases.  Case-1: $f(f(1))=2,f(2)=1$  We can assume that $f(1)=c$ for the time being. Then plugging in $n=3$ and using $f(2)=1$ gives $$f(3)=4-c$$ and again since the range of the function is positive integers,then $4-c$ has to be positive and hence $c$ belongs to  {$1,2,3$}. Now, $$f(1)=c$$$$\implies f(f(1))=f(c)$$$$\implies 2=f(c)$$ by the assumption that $f(f(1))=2$ . Now,since $c$ can only take the values $1,2,3$,we start treating cases. If $c=1$,$$f(c)=2$$$$\implies f(1)=2$$ but we know from the deinition of $c$ that $f(1)=c=1$,a contradiction.If $c=2$,then $2=f(c)=f(2)$ but $f(2)=1$ by assumption. Finally,if $c=3$ $$2=f(c)=f(3)$$ but $$f(3)=4-c=4-3=1$$ which is once again a contradiction. Therefore there are no such functions in this case.  Case-2: $f(f(1))=1,f(2)=2$  Again assuming $f(1)=c$ and using $f(n)\le n$ along with plugging $n=c-1$ will give us that $f(1)=1$ and then it is easy to prove that such a function exists by recursion. I can only give a "sort of recursive" way to define the function. Here it goes $$f:\mathbb{N}\rightarrow \mathbb{N}$$$$f(1)=1$$$$f(n)=n+1-f(f(n-1))$$  But this case is harder to deal with.Some help will be appreciated. I was querying data from  using a LINQ query in LINQPAD and found that the data I got back is quite obsolete. I searched for Shekhar-Pro (me) by using a where clause on ID 399722 and the data returned was for 8 Jan 2011. Why was the data so old? Isn't the data updated in real time, or at least frequently? If not, where can I get realtime data? I want to close one tab of chrome. I tried killing the pid of the tab, but the tab doesn't close instead says "Aw, Snap! Something went wrong while displaying this webpage. To continue, reload or go to another page". How can I get rid of this. I would like to replace the usual \hat in maths with a larger one, but I do not want it to stretch. The size I want is "the smallest \widehat" (as in $\widehat{.}$). Is there a way to put that one above a wide character like M ($\widehat{M}$ would stretch and give be an even wider hat).  I guess I have a lack of understanding for the mechanism behind accents that extend, so feel free to explain. How to check if sed has changed a file I believe there's a way to find the kth largest element in an unsorted array of length n in O(n).  Or perhaps it's "expected" O(n) or something.  How can we do this? Math people:  The title is the question. I am convinced that uncountable sets exist, thanks to Cantor's diagonal proof.  It is not intuitively clear to me that uncountable ordinals or cardinals should exist.  What axioms of set theory are needed to accept their existence?  I think I have read here that the Axiom of Choice is not necessary.  I am reluctant to accept as "true" any theorems that rely on the Axiom of Choice.  EDIT: This question may be a duplicate: I just found  .  I apologize if this is so. The binomial sum   $$s_n=\binom{n+1}{0}+\binom{n}{1}+\binom{n-1}{2}+\cdots$$   satisfies the Fibonacci relation.   I failed to prove that $\binom{n-k+1}{k}=\binom{n-k}{k}+\binom{n-k-1}{k}$... Any hints or suggestions? Labeling all sides of the matrix with kbordermatrix I have a matrix with labels on the left and top. Now I want to have a label on all sides of the matrix. How can I change my code?  \documentclass[10 pt, a4paper, leqno, oneside] {report} \usepackage{kbordermatrix} \begin{document}  \renewcommand{\kbldelim}{(}% Left delimiter \renewcommand{\kbrdelim}{)}% Right delimiter \[   \tilde{\textbf{m}} = \kbordermatrix{     \mbox{} &amp; c_1 &amp; c_2 &amp; c_3 &amp; c_4 &amp; c_5 \\     % &amp; c_1 &amp; c_2 &amp; c_3 &amp; c_4 &amp; c_5 \\     r_1 &amp; 1 &amp; 1 &amp; 1 &amp; 1 &amp; 1 \\     r_2 &amp; 0 &amp; 1 &amp; 0 &amp; 0 &amp; 1 \\     r_3 &amp; 0 &amp; 0 &amp; 1 &amp; 0 &amp; 1 \\     r_4 &amp; 0 &amp; 0 &amp; 0 &amp; 1 &amp; 1 \\     r_5 &amp; 0 &amp; 0 &amp; 0 &amp; 0 &amp; 1    } \]  \end{document} I am wondering what we can say, if anything, about the population mean, $\mu$ when all I have is one measurement, $y_1$ (sample size of 1).  Obviously, we'd love to have more measurements, but we can't get them.  It seems to me that since the sample mean, $\bar{y}$, is trivially equal to $y_1$, then $E[\bar{y}]=E[y_1]=\mu$.  However, with a sample size of 1, the sample variance is undefined, and thus our confidence in using $\bar{y}$ as an estimator of $\mu$ is also undefined, correct?  Would there be any way to constrain our estimate of $\mu$ at all?