Creating prepopulated set in Java
How to initialize HashSet values by construction?
The general consensus on a similar question,  is that "highly significant" is a valid, though non-specific, way to describe the strength of an association that has a p-value far below your pre-set significance threshold. However, what about describing p-values that are slightly above your threshold? I have seen some papers use terms like "somewhat significant", "nearly significant", "approaching significance", and so on. I find these terms to be a little wishy-washy, in some cases a borderline disingenuous way to pull a meaningful result out of a study with negative results. Are these terms acceptable to describe results that "just miss" your p-value cutoff? Possible orders of permutations of $11$ symbols Prove: The pre-image of an ideal is an ideal. Let $\phi : R \to S$ be a homomorphism. If $N$ is an ideal of $S$, then $\phi ^{-1} (N)$ is an ideal of $R$. Single word that means "to look down on others"? "turn down the volume" or "turn the volume down" - phrasal verb structure I'm learning about phrasal verbs, but I'm not sure if I'll use them correctly. Which one of the following phrasal verb uses correct:  -I don't know how to turn down the volume? -I don't know how to turn the volume down?  I always think that they're same, but lately I feel like there must be a rule how to use them correctly, or perhaps they get different meanings? How to make my own Dropbox / Ubuntu One server at home? Does anybody know of any resources that can show me how to make my own "Dropbox, Ubuntu One" server at home?  I really like the idea of these services, but I don't want to put my 'stuff' in the clouds. Ideally, it should have a client that runs on Linux and Windows.  I tried to setup iFolder on my Ubuntu 10.04, but without any success so far. setuid root does not work Objective : Run a program as root (C++ binary). The same as :   And :   ./a.out output:  E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root? psurana  //output for "whoami" Look below for the code.   ls -l output:  -rwsrwxr-x 1 root    root    46136 Jun  7 20:13 a.out  The Code :   #include &lt;string&gt; #include &lt;stdlib.h&gt; int main(int argc, char *argv[]){         std::string input = "apt-get install " + std::string(argv[1]);         system(input.c_str());         system("whoami");         return 0; }   Details: : compiled the program and then did chown root:root a.out &amp;&amp; chmod u+s a.out. Please look above for ls -l output.  I still do not get the root privileges and the output for system("whoami") in the code is my own username on the machine.  Reading the two linked questions did not yield me anywhere. :(. both the creator and the owner of the file are root. The setuid bit is set, so it should work. The filesystem is not external either, it is my own machine. How can I make this work? Video grid with vstack and hstack es.SO questions aren't excluded from the Hot Questions list As figured out in  localized SE sites must not be displayed in the HNQ's. But  actually is.        Has to be fixed I guess? Short story as a letter to original colonisers of earth Show that $|z_1 + z_2|^2 < (1+C)|z_1|^2 + \left(1 + \frac{1}{C}\right) |z_2|^2$ Let $z_1$ and $z_2$ be two complex numbers. Show that there exists $C &gt; 0$ with   $$  |z_1 + z_2|^2 &lt; (1+C)|z_1|^2 + \left(1 + \frac{1}{C}\right) |z_2|^2. $$   I tried to simplify the L.H.S and R.H.S, SNF I was finally left to compare between a real number and a complex number  I really couldn't think of anything else. Please help. I've just executed a long-running process from the bash prompt. In hindsight, I wish I'd run time on it, or noted down the time at which I kicked it off.  Is there any way of getting this information retrospectively? The .bash_history doesn't seem to include timestamps.  In my particular case it's Mac OS X, but I'm interested in general Unix/Linux solutions.  To clarify, the process has now completed, and I'd prefer not to run it again unless absolutely necessary! How to run xrandr commands at startup in Ubuntu I've started using the dashicon fonts in my theme options page for WP 3.8+ users. To take care of users on &lt; 3.8, I've added the dashicon fonts to my theme folder and also an entry at the top of my custom admin stylesheet:  @font-face {     font-family: 'dashicons';     src: url('fonts/dashicons.eot'); }  @font-face {         font-family: 'dashicons';         src: url(data:application/x-font-woff;charset=utf-8;base64,xxx) format('woff'),         url('fonts/dashicons.ttf') format('truetype'),         url('fonts/dashicons.svg#dashicons') format('svg');     font-weight: normal;     font-style: normal; }   (I've left out the base64 encode for brevity)  This works great, however, I'm getting a bit of strange behavior with the fonts. When I leave the admin open in a tab and go away for a bit, then come back, every once in a while, the webfonts have turned to squares, as if the font is missing.  This does not happen every time. It appears to be somewhat random.  In those cases, simply doing a mouseover the page usually returns the webfonts to their proper symbols.  The screenshots below show the issue. The first screenshot is what I see when the problem occurs. The second screenshot is what I'm expecting to see when things go well.   Notice in the first shot, how the wordpress labels themselves have gone to a default serif font. I have the following $n\times n$ matrix:  $$A=\begin{bmatrix} a &amp; b &amp; \ldots &amp; b\\ b &amp; a &amp; \ldots &amp; b\\ \vdots &amp; \vdots &amp; \ddots &amp; \vdots\\ b &amp; b &amp; \ldots &amp; a\end{bmatrix}$$  where $0 &lt; b &lt; a$.  I am interested in the expression for the determinant $\det[A]$ in terms of $a$, $b$ and $n$.  This seems like a trivial problem, as the matrix $A$ has such a nice structure, but my linear algebra skills are pretty rusty and I can't figure it out.  Any help would be appreciated. Prove $ \sum \frac{\cos n} { \sqrt n}$ converges I have currently a strange problem on debian (wheezy/amd64).  I have created a chroot to install a server (i can't give any more detail about it, sorry). Let's call its path /chr_path/. To make things easy, I have initialized this chroot with a debootstrap (also wheezy/amd64).  All seemed to work well inside the chroot but when I started the installer script of my server I got : zsh: Not found /some_path/perl (the installer includes a perl binary for some reasons)  Naturally, I checked the /some_path/ location and I found the "perl" binary. file in chroot environment returns :  /some_path/perl ELF 32-bit LSB executable, Intel 80386, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.2.5, not stripped   The file exists, seems ok, has correct rights. I can use file, ls, vim on it but as soon as I try to execute it - ./perl for example - I get : zsh: Not found ./perl.  This situation is quite understandable for me. Moreover :   I can execute other basic binaries (/bin/ls,...) in the chroot without getting errors I have the same problems for other binaries that came with the project When I try to execute the binary from the main root (/chr_path/some_path/perl), it works. I have tried to put one of the binaries with a copy of my ls. I checked that the access rights were the same but this didn't change anything (one was working, and the other wasn't) Evaluating even binomial coefficients Can someone give me a hint how to evaluate $$ \binom{n}{0}+\binom{n}{2}+\cdots+\binom{n}{o(n)},$$ where $o(n)$ is $n$ if $n$ is even and $n-1$ otherwise ? use EntityFieldQuery to find user based on profile field value What does a "real" quantum computer need for cryptanalysis and/or cryptographic attack purposes? The cryptographic world has been buzzing the word "quantum" for a while now (even the NSA is currently preparing itself for a post-quantum crypto world) and quantum-related hardware engineering is evolving constantly. For example: the 5-qubit quantum computer created at MIT by using the technique of ion traps succeeded in prime-factorizing 15. Does that mean that since it succesfully managed that, that it is a all-purpose quantum computer which could be used for cryptanalysis and/or cryptographic attacks?   If that's not the case, what exactly would a "real" quantum computer need (think: rough description of expected technical abilities, aka specs) to enable its users to use it for cryptanalysis and/or cryptographic attack purposes? And - ignoring rumours about potentially existing but confidential governmental projects - does any such system already exist today?