We are preparing a new paper and my supervisor tells me that we have to put the name of a person on our paper because he was involved in getting us the grant. He says it is because of future grants and that we want to show that he was involved in the research -- and obviously he was not. I think we are supposed to work with him on the last year of my PhD, but not now. My supervisor already knows that I am against it and tells me that this is an “order” and it is because of some sort of “politics”. I can reject but I am not sure what are the consequences. What a PhD student should do in such a situation?
There's a department at my university where the head of department is routinely put as author on papers he didn't contribute to, and where researchers from overseas who had no input (but who provide funding to the department) are put on papers.    As a pragmatic matter, how should a PhD student respond when they are told to put three names on a paper, when those people didn't contribute?  Assume that refusing to put the co-authors on is not an option, because:   There will be bad consequences if they do not, and  This practice is routinely done at a high level, and there is nobody at the university to complain to about it.   This is not a duplicate of , because its answer assumes that it is practical for the student to refuse.
Cohen's d for 2x2 interaction I have a significant 2x2 interaction in a between-subjects design.  I would normally report omega-squared as my effect-size measure, but I've been asked to provide Cohen's d instead?  Can Cohen's d be computed for an interaction?  If so, how? Prove or Disprove the Existence of Solutions... Adding dynamic text to layout from attribute table with Data Driven Pages I was trying to figure out how to use dynamic text from an attribute table in a collection of Data Driven Pages in ArcGIS 10.   I've looked in the help files, but can't find anything on dynamic text from attribute tables. Upon the risk of being down voted as no MWE is present, but at the moment just trying to get some pointers. I updated my MiKTeX installation to the newest available version at the moment (MiKTeX-pdfTeX 4.1 (MiKTeX 20.12)) and now I get an error while building my documentation: Appendix D. (../html/examples/group/latex/refman_doc.tex (../html/examples/group/latex//gro up__group1.tex) [243] ! I can't write on file `../html/examples/group/latex//group__group2.aux'. \@include ...mmediate \openout \@partaux &quot;#1.aux&quot;                                                   \immediate \write \@partau... l.3 \include{group__group2}  Please type another output file name ! Emergency stop. \@include ...mmediate \openout \@partaux &quot;#1.aux&quot;                                                   \immediate \write \@partau... l.3 \include{group__group2}  *** (job aborted, file error in nonstop mode)  some small background:  Started normally with pdflatex doxygen_manual.tex in here is the statement: \subinputfrom{../html/examples/group/latex/}{refman_doc} and in this file again: \include{group__group2} as far as I know the disk is not full and the protections of the files and directories are OK as well  It looks like that now an attempt is made to write to the directory ../html/examples/group/latex/ whilst in the past the file was written to the current directory. I already tried -shell-escape and -enable-write18 (as well as --shell-escape and --enable-write18) but to no avail.  Any known changes in respect to writing the aux file? Any hints  edit I asked another question () with the details and MWE but that was closed with the reason that it was a duplicate of this one ... So I'm adding the information now here: In the question  asked about the problems I encountered due to an update of my MiKTeX distribution, but didn't take the time (at that moment) to create a MWE, so it didn't attract much response. I have the directory structure:  main  manual.tex   group  group__group2.tex refman_doc.tex    manual.tex \documentclass{book} \usepackage{import} \usepackage{hyperref}  \begin{document} \subinputfrom{../group}{refman_doc} \end{document}  group__group2.tex \hypertarget{group__group2}{}{The Second Group}  refman_doc.tex {Module Documentation} \include{group__group2}  When running in the directory main the command pdflatex manual.tex I get the error: ... (../group/../group/refman_doc.tex [1{C:/Users/User/AppData/Local/MiKTeX/2.9/pdf tex/config/pdftex.map}] ! I can't write on file `../group//group__group2.aux'. \@include ...mmediate \openout \@partaux &quot;#1.aux&quot;                                                   \immediate \write \@partau... l.2 \include{group__group2}  Please type another output file name:  but in a non interactive mode (the usual way to run. i.e. with \batchmode) one doesn't get an opportunity to specify the file and the generation crashes. As written in the original question adding options like -shell-escape and / or -enable-write18 didn't help.  Is there a solution for this problem?  edit 2 I did some further test. I replaced the \subinputfrom with an \input statement, although this worked for the limited example above it didn't work for my larger codebase as here (again just a limited view) we have in the refman_doc.tex {Module Documentation} \input{group__group1} \include{group__group2}  with the contents of group_group1.tex similar to group__group2.tex and the file is also parallel to group__group2.tex. This results in the error: (manual.out) (manual.out) (../group/refman_doc.tex  ! LaTeX Error: File `group__group1.tex' not found.  Type X to quit or &lt;RETURN&gt; to proceed, or enter new name. (Default extension: tex)  Enter file name: ! Emergency stop. &lt;read *&gt;  l.2 \input{group__group1}  !  ==&gt; Fatal error occurred, no output PDF file produced! I have configured my MySQL Database to require passwords on all users, even root from the machine itself.  Now I discovered that there are empty Users in my Database  Reproduce: mysql -u root -p and then use mysql; &amp; select * from user;  It gives me 2 entries, one with "localhost" and user &lt;empty&gt; and one with the machine's hostname and &lt;empty&gt;.  Now I tried to access the account with mysql -u ' ' (yes it's correct, leave a space between the ' things) and I log in without a password. The user can "only" see information_schema and test, the two databases created by default. He does not has access to mysql or any other custom created databases.  I already changed the Password of this user to something I won't tell you  mysql -u root -p use mysql; UPDATE mysql.user SET Password=PASSWORD('thisisasecretpassword') WHERE USER='root'; FLUSH PRIVILEGES;   Now my Questions:   Is any MySQL Server vulnerable for an attack with this entry? Could an attacker break out of this account or the two default databases? Should I password-protect those Users or can I delete them? Are They required for some MySQL-internal things? Density of ring of algebraic integers in $\mathbb C$ Clearly, $\mathbb Z$ is not dense in $\mathbb Q$ (and not dense in $\mathbb C$).  But why is the ring of algebraic integers $\overline{\mathbb Z}$ dense in $\overline{\mathbb Q}$?  In particular, if this is so, it is dense in $\mathbb C$. Can a Half-Elf have Drow Ancestry? I have several AppExchange apps installed that are failing tests. What is the recommended approach to resolving this? Are tests run when a new package is installed? Is there a way to determine what is actually failing besides the name of the method and something like "expected true, actually false"? The test results rarely show enough information to be useful.   What I'm doing atm, is checking for updates for the packages, and then writing the company with the failing test results.   Any feedback would be appreciated. I want to know how to format a storage drive from the terminal. Helpful things to provide in the answer would be often used options for commands and base knowledge that one can use to extrapolate future uses. Specifically I would like to know how to format in the different file systems such as NTFS, FAT32, EXT4, etc. Information on how to partition the drive via terminal is also wanted.  I am trying to format a high capacity external hard drive (EHDD) into NTFS - from the terminal.   I know I can use gparted for this as well as other GUI programs, but I still want to now how to do it from the terminal. How do electrons know which path to take in a circuit? The current is maximum through those segments of a circuit that offer the least resistance. But how do electrons know beforehand that which path will resist their drift the least? How to understand the memory usage and load average in linux server I am using a linux server which has 128GB of memory and 24 cores. I use top to see how much it is used. Its output is pasted at the end of the post. Here are two questions:  (1) I see that each of the running processes occupies a very small percentage of memory (%MEM no more than 0.2%, and most just 0.0%), but how the total memory is almost used as in the fourth line of output ("Mem:  130766620k total, 130161072k used,   605548k free,   919300k buffers")? The sum of used percentage of memory over all processes seems unlikely to achieve almost 100%, doesn't it?  (2) how to understand the load average on the first line ("load average: 14.04, 14.02, 14.00")?   Thanks and regards!  Edit:  Thanks!  I also really like to hear some rough numbers based on used percentage of memory to determine if a server is heavily loaded, since I once became the one who cramed the server without understanding the current load.  Is swap regarded as almost the same as memory? For example, when memory and swap are almost of same size, if the memory is almost running out but the swap is still largely free, may I just view it as if the used percentage of memory + swap is still not high and run other new processes?  How would you consider together CPU or memory (or memory + swap) usage? Do you become worried if either of them reaches too high or both?  Output of top：  $ top    top - 12:45:33 up 19 days, 23:11, 18 users,  load average: 14.04, 14.02, 14.00 Tasks: 484 total,  12 running, 472 sleeping,   0 stopped,   0 zombie Cpu(s): 36.7%us, 19.7%sy,  0.0%ni, 43.6%id,  0.0%wa,  0.0%hi,  0.0%si,  0.0%st Mem:  130766620k total, 130161072k used,   605548k free,   919300k buffers Swap: 63111312k total,   500556k used, 62610756k free, 124437752k cached    PID USER      PR  NI  VIRT  RES  SHR S %CPU %MEM    TIME+  COMMAND  6529 sanchez   18  -2 1075m 219m  13m S  100  0.2  13760:23 MATLAB 13210 timothy   18  -2 48336  37m 1216 R  100  0.0   3:56.75 absurdity 13888 timothy   18  -2 48336  37m 1204 R  100  0.0   2:04.89 absurdity 14542 timothy   18  -2 48336  37m 1196 R  100  0.0   1:08.34 absurdity 14544 timothy   18  -2  2888 2076  400 R  100  0.0   1:06.14 gatherData  6183 sanchez   18  -2 1133m 195m  13m S  100  0.2  13676:04 MATLAB  6795 sanchez   18  -2 1079m 210m  13m S  100  0.2  13734:26 MATLAB 10178 timothy   18  -2 48336  37m 1204 R  100  0.0  11:33.93 absurdity  12438 timothy   18  -2 48336  37m 1216 R  100  0.0   5:38.17 absurdity 13661 timothy   18  -2 48336  37m 1216 R  100  0.0   2:44.13 absurdity 14098 timothy   18  -2 48336  37m 1204 R  100  0.0   1:58.31 absurdity 14335 timothy   18  -2 48336  37m 1196 R  100  0.0   1:08.93 absurdity 14765 timothy   18  -2 48336  37m 1196 R   99  0.0   0:32.57 absurdity 13445 timothy   18  -2 48336  37m 1216 R   99  0.0   3:01.37 absurdity 28990 root      20   0     0    0    0 S    2  0.0  65:50.21 pdflush 12141 tim       18  -2 19380 1660 1024 R    1  0.0   0:04.04 top  1240 root      15  -5     0    0    0 S    0  0.0  16:07.11 kjournald  9019 root      20   0  296m 4460 2616 S    0  0.0  82:19.51 kdm_greet     1 root      20   0  4028  728  592 S    0  0.0   0:03.11 init     2 root      15  -5     0    0    0 S    0  0.0   0:00.00 kthreadd     3 root      RT  -5     0    0    0 S    0  0.0   0:01.01 migration/0     4 root      15  -5     0    0    0 S    0  0.0   0:08.13 ksoftirqd/0     5 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/0     6 root      RT  -5     0    0    0 S    0  0.0  17:27.31 migration/1     7 root      15  -5     0    0    0 S    0  0.0   0:01.21 ksoftirqd/1     8 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/1     9 root      RT  -5     0    0    0 S    0  0.0  10:02.56 migration/2    10 root      15  -5     0    0    0 S    0  0.0   0:00.34 ksoftirqd/2    11 root      RT  -5     0    0    0 S    0  0.0   0:00.00 watchdog/2    12 root      RT  -5     0    0    0 S    0  0.0   4:29.53 migration/3    13 root      15  -5     0    0    0 S    0  0.0   0:00.34 ksoftirqd/3 Steward badge can now be awarded multiple times -- backfill details As we announced in our post on  to the Review Queues, the Steward badge can now be earned more than once per queue. The purpose of this post is not to debate the merits of this decision ( already exists), but to explain the nuts and bolts of how it will be backfilled. This is how it will appear on your profile if you have earned it multiple times:  Once we push the visual design changes live across the network, this is how badge attainment will look on /review/close/stats:  For those of you who have already completed enough reviews to earn multiple Steward badges, we will be retroactively awarding them to you, starting today. The backfill script will run about twice an hour, and your achievements trophy will light up as each one is awarded. For those of you who have done thousands and thousands of reviews, things may be a bit noisy, so we thank you in advance for your patience. It may take up to two days for all of your badges to show up. Additive group contains exactly three elements of the set $\{p,p+q,pq,p^q,q^p\}$ A pitcher contains $X + 1$ blue balls and $Y + 1$ red balls. It is known that $X, Y$ are independent random variables, and it is given that $X \sim \mathrm{Poisson}(n), Y \sim\mathrm{Poisson}(2n)$. Calculate the limit: $\displaystyle\lim_{n\to \infty}\mathbb P (X + n = Y) $   I tried to condition on the value of $Y$ and to use the Law of total probability but it did not lead to a solution. ( I tried to sum: $ \sum_{i=0}^\infty\mathbb P(X+n=Y|Y=i)\mathbb P(Y=i) $ and get an expression that I can calculate its limit as n goes to infinity) In sampling without replacement the probability of any fixed element in the population to be included in a random sample of size $r$ is $\frac{r}{n}$. In sampling with replacement the corresponding probability is $\left[1- \left(\frac{1}{1-n}\right)^r\right]$.  Please help me show how this is proved. So first let me state my homework problem:  Let $X$ be a set, let $\{A_k\}$ be a sequence of subsets of $X$, let $B = \bigcup_{n=1}^{+\infty} \bigcap_{k=n}^{+\infty} A_k$, and let $C = \bigcap_{n=1}^{+\infty} \bigcup_{k=n}^{+\infty} A_k$. Show that (a) $\liminf_k\; {\xi_A}_{_k} = \xi_B$, and $(b)$ $\limsup_k \;{\chi_A}_{_k} = \chi_C.$  I know that, in the context I am familiar with, that $$\liminf_{k\rightarrow +\infty}\; X_k = \bigcup_{k=1}^{+\infty} \bigcap_{n=k}^{+\infty} X_n$$ and $$\limsup_{k\rightarrow +\infty}\;X_k = \bigcap_{k=1}^{+\infty} \bigcup_{n=k}^{+\infty} X_n.$$   I also know that the characteristics (indicator) function is defined as $\chi_A(x) = \begin{cases} 1, &amp; x \in A \\ 0, &amp; x \notin A .\end{cases} $  So I wrote out $B$ in some of its `glory': $B= (A_1 \cap A_2 \cap A_3 \cap \cdots) \cup (A_2 \cap A_3 \cap \cdots) \cup (A_3 \cap A_4 \cap \cdots) \cup \cdots$, and as the first argument is the smallest, with increasing size to the right, the last term in the expression for $B$ would be $B$, which would be the largest.  So if I replace the $X_k$'s above with $\chi$'s I still don't see how I can get the correct answer - though it looks pretty clear from the definition of $B$ and that of $\liminf$ being basically the same, except in this case for the $\chi$.  Any direction would be greatly appreciated. By the way, I have checked out  but I was somewhat confused by the topology, the meets/joins, etc.  Thanks much, Nate Ignore Pulses Less than a Given Width in a Pulse Train Let's say I have a 5V pulse train that varies between 0 and 75000 pulses per second. Pulse width, let's say, is 5 microseconds. How could I calculate or determine the best way to filter out all pulses less than 4 microseconds in width? Is there a way to see what were the Candidate Execution Plans generated by the Query Optimizer? The Query Optimizer creates more than one possible execution plan. How can I see all the plans generated before the executed one was chosen?   :     The Query Optimizer must analyze the possible plans and choose the one   with the lowest estimated cost.   Please, notice that I'm not talking about , I'm talking about candidate execution plans, the ones that were generated but not selected to be executed.  According to Benjamin Nevarez's article :     The generation of candidate execution plans is performed inside the   Query Optimizer using transformation rules, and the use of heuristics   limits the number of choices considered in order to keep the   optimization time reasonable. Candidate plans are stored in memory   during the optimization, in a component called the Memo.   Would it be possible to visualize the candidate plans rendered the way we can ? How to redirect and append both stdout and stderr to a file with Bash? How to test for an hold item name in Minecraft? I'm trying to make a command block that spawns an item in front of you if you are holding an item with a specific name. I've got these two working scripts;  /testfor @p[r=10] {Inventory:[{tag:{display:{Name:"Item Name"}}}]}  /testfor @p[r=10] {SelectedItemSlot:0,Inventory:[{Slot:0b,­id:"minecraft:diamond_sword"}]­}   but I can't get them together. The block should only look for an item in the active slot.