I have created short bash script to run some program 10 times and save the output to a file. While I was setting the executable permissions I thought that it would be nice to remove the write permission, so that the script can not be changed without sudo/root access. But what I got was this:  use@ubuntu:~/some/folder$ sudo chmod -w Run_SIM.sh  chmod: Run_SIM.sh: new permissions are r-xrwxr-x, not r-xr-xr-x   Why?
I just ran the following command in a directory with several files, some owned by root, some by a normal user. I got a strange message:  $ sudo chmod -rwx * chmod: example-file: new permissions are ----w----, not ---------   Why the heck does chmod refuse to clear all permissions, if a file had group write rights? What is the thought behind this behaviour?  And is there a way to force removing all permissions in one step, without having to execute sudo chmod g-w * afterwards?
Mixed content on many SE sites Many SE sites (like math.SE) have a problem with mixed content, which causes display bugs in recent browsers. This is particularly evident with math.SE (because of the huge use of MathJax) and with chat sections.  Will this be fixed?  How to reproduce  Visit  or   What happens  Mixed content is blocked, output is missing pieces of code (MathJax):    This picture also includes my main Firefox addons (top right), it relevant. It shows missing styles:    The white on the left is my tab list. permanent hat-like thing? I really like how, in the winter bash, there are hats. They are pretty cool and actually encourage me to get badges, something I didn't care about before. I think there should be something like this, but all year round, to encourage people to get badges. Badges, to me, seem currently pretty useless and I never want to get any because...there is no good reason to. Hats: well, hats are just awesome How to prove that the set $A = \left\{ {p:{p^2} < 2,p \in {\Bbb Q^+}} \right\}$ has no greatest element? More specifically, I have to find a $q$ in $A$ such that $q$ is larger than any $p$ in $A$.  The only thing I can think of is using (${2 - {p^2}}$) somehow, or ${(p+x)^2}&lt;2$, but other than that I don't know how to proceed. This exercise is taken from the very first chapter of Walter Rudin's Principles of Mathematical Analysis. Quoting the exercise:     To do this, we associate with each rational $p &gt; 0$ the number:     $$q = p - \frac{{{p^2} - 2}}{{p + 2}} = \frac{{2p + 2}}{{p + 2}}$$   But he didn't explain how he came up with that number.   The only thing I've thought of is the following procedure:  $$\eqalign{   &amp; {p^2} + (2 - {p^2}) = 2 \Rightarrow {p^2} + (\frac{{2 - {p^2}}}{2}) &lt; 2,{\text{ and since }}2 - {p^2}{\text{ is always positive,}}  \cr    &amp; {p^2} &lt; \left[ {{p^2} + (\frac{{2 - {p^2}}}{2})} \right] &lt; 2  \cr    &amp; {\text{Therefore, let }}q = \sqrt {{p^2} + (\frac{{2 - {p^2}}}{2})} ,{\text{ then:}}  \cr    &amp; p &lt; q &lt; \sqrt 2  \cr} $$  However, my result doesn't necessarily belong to ${\Bbb Q}$. I wonder how did he obtain the value of $q$ in the book.  EDIT: Feel free to point out if there are more appropriate tags for this question. If the cricket ground Lord's is a possessive, what if you want to describe something belonging to Lord's? Would you say:     I was very impressed by Lord's's customer services.   It doesn't look right, so what is the correct way of writing it? Is Dragonstone unoccupied after Stannis Baratheon's defeat? Is anything known about Dragonstone after:      Stannis Baratheon is killed in his bid for the Iron Throne?   As the seat of the naval defense of King's Landing and the birthplace of Daenerys Targaryen, she has a vested interest in taking it.   At the conclusion of Season 6 Episode 10, is Dragonstone unoccupied? Git ignore file for Xcode projects Getting a stack overflow exception when declaring a large array The following code is generating a stack overflow error for me  int main(int argc, char* argv[]) {     int sieve[2000000];     return 0; }   How do I get around this? I am using Turbo C++ but would like to keep my code in C  EDIT:  Thanks for the advice.  The code above was only for example, I actually declare the array in a function and not in sub main.  Also, I needed the array to be initialized to zeros, so when I googled malloc, I discovered that calloc was perfect for my purposes.  Malloc/calloc also has the advantage over allocating on the stack of allowing me to declare the size using a variable. Split file into multiple files based on pattern I have a large file that's a couple hundred lines long. This file is partitioned into many parts by a specific identifier, lets say 'ABC'. This line 'ABC' appears 6 times so I want 6 output files. I'm familiar with split and awk but can't seem to create a command line that will do what I've described, any ideas?  Here's an example  ABC line 1 line 2 line 3 ABC line 1 line 2 ABC line1   I'd like three files where ABC is the first line in the new file and it ends before the next ABC is encountered. How to delete all files in a current directory starting with a dot? I have the following problem: I correctly obtain a numbered bibliography at the end but along the text the cite_key appear instead of a number. How to fix this problem?   \documentclass[11pt]{book}  \usepackage[]{biblatex} \begin{document} %some text  ... \cite{ABKM2015}... %some text  \begin{thebibliography}{99} \bibitem{ABKM2015} Arroja, F. and Bartolo, N. and Karmakar P. and Matarrese, S. (2015). \newblock The Two Faces of Mimetic Horndeski Gravity             \newblock {\em ArXiV}, 1506.08575 (2015). \end{thebibliography} \end{document}   After compiling I get ... [ABKM2015] ... while I want for example  [1]. How many days a year is a U.S. citizen allowed to stay in Morocco? I arrived in Morocco in October of 2014 and renewed my visa by traveling to Spain by ship for a day and getting my passport stamped again in January of 2015. My question is, am I allowed to leave the country and repeat this process this year by traveling again to another country, other than my own in order to return to Morocco for another 90 days? And if so, how many times a year is this allowed? I have read 180 days on some websites but there is not any clear answers anywhere about this that I can find. Is temperature in vacuum zero? From      The temperature of an ideal monatomic gas is a measure of the average kinetic energy of its atoms.    Now if I remove all the particles from the box shown below will the temperature be zero? How do I make a program auto-start every time I log in? I frequently need to start several programs that I use every time I start my computer. How can I make it so that whenever I login the program is automatically launched? Should one downvote answers to off-topic questions? It annoys me when people post answers to obviously off-topic questions like , especially after those questions have already received several close votes. Migrations seem to happen rather infrequently these days, so there's probably no reputation to gain for questions that are likely to be closed. And although sure, the answer may help the OP, it also encourages bad behavior (posting off-topic questions.)  Is it appropriate to downvote these answers?   Personally, I think I could make a case for both sides. Eclipse says: “Workspace in use or cannot be created, chose a different one.” How do I unlock a workspace? Variables are often adjusted (e.g. standardised) before making a model - when is this a good idea, and when is it a bad one? In what circumstances would you want to, or not want to scale or standardize a variable prior to model fitting?  And what are the advantages / disadvantages of scaling a variable? In chapter 2 section 7 (pg 151) of Hartshorne's algebraic geometry there is an example given that talks about automorphisms of $\mathbb{P}_k^n$. In that example Hartshorne states that $\mathcal{O}(-1)$ has no global sections. However, we know that $\mathcal{O}(1)$ is generated by global sections. This is stated at the first of the section that if $\mathbb{P}_k^n = Proj k[x_0,...,x_n]$ then the $x_0,...,x_n$ give rise to global sections $x_0,...,x_n\in\Gamma(\mathbb{P}_k^n,\mathcal{O}(1))$.  I guess I don't understand this twisted structure sheaf very well, or to be honest I don't think I understand structure sheaves in general as well as I would like. The twisting part seems simple at first- you shift the grading of Proj over and then take the structure sheaf.  Admittedly I don't feel comfortable using the structure sheaf other than using the basic facts about it that Hartshorne gives when it is introduced. If anyone could give some insight as to what's going on here or how I might be able to understand this better it would be much appreciated. Thanks. How can I change what keys on my keyboard do? (How can I create custom keyboard commands/shortcuts?) Prevent browser caching of AJAX call result It looks like if I load dynamic content using $.get(), the result is cached in browser.  Adding some random string in QueryString seems to solve this issue (I use new Date().toString()), but this feels like a hack.   Is there any other way to achieve this? Or, if unique string is the only way to achieve this, any suggestions other than new Date()? High p-values for logistic regression variable that perfectly separates? I'm using R to run some logistic regression. My variables were continuous, but I used cut to bucket the data. Some particular buckets for these variables always result in dependent variable being equal to 1. As expcted, the coefficient estimate for this bucket is very high, but the p-value is also high. There are about ~90 observations in either these buckets, and around 800 total observations, so I don't think it's a problem of sample size. Also, this variable should not be related to other variables, which would naturally reduce their p-values.  Are there any other plausible explanations for the high p-value?  Example:  myData &lt;- read.csv("application.csv", header = TRUE) myData$FICO &lt;- cut(myData$FICO, c(0, 660, 680, 700, 720, 740, 780, Inf), right = FALSE) myData$CLTV &lt;- cut(myData$CLTV, c(0, 70, 80, 90, 95, 100, 125, Inf), right = FALSE) fit &lt;- glm(Denied ~ CLTV + FICO, data = myData, family=binomial())   Results are something like this:  Deviance Residuals:       Min        1Q    Median        3Q       Max   -1.53831  -0.77944  -0.62487   0.00027   2.09771    Coefficients:                 Estimate Std. Error z value Pr(&gt;|z|)     (Intercept)     -1.33630    0.23250  -5.747 9.06e-09 *** CLTV(70,80]     -0.54961    0.34864  -1.576 0.114930     CLTV(80,90]     -0.51413    0.31230  -1.646 0.099715 .   CLTV(90,95]     -0.74648    0.37221  -2.006 0.044904 *   CLTV(95,100]     0.38370    0.37709   1.018 0.308906     CLTV(100,125]   -0.01554    0.25187  -0.062 0.950792     CLTV(125,Inf]   18.49557  443.55550   0.042 0.966739     FICO[0,660)     19.64884 3956.18034   0.005 0.996037     FICO[660,680)    1.77008    0.47653   3.715 0.000204 *** FICO[680,700)    0.98575    0.30859   3.194 0.001402 **  FICO[700,720)    1.31767    0.27166   4.850 1.23e-06 *** FICO[720,740)    0.62720    0.29819   2.103 0.035434 *   FICO[740,780)    0.31605    0.23369   1.352 0.176236     --- Signif. codes:  0 ‘***’ 0.001 ‘**’ 0.01 ‘*’ 0.05 ‘.’ 0.1 ‘ ’ 1  (Dispersion parameter for binomial family taken to be 1)      Null deviance: 1037.43  on 810  degrees of freedom Residual deviance:  803.88  on 798  degrees of freedom AIC: 829.88  Number of Fisher Scoring iterations: 16   FICO in the range [0, 660) and CLTV in the range (125, Inf] indeed always results in Denial = 1, so their coefficients are very large, but why are they also "insignificant"?