How to resize the view of specific software
Is it possible to scale specific apps on Windows 10?
I've seen papers (e.g., in Science) where the first two authors are listed in non-alphabetical order, and yet there are asterisks behind their names to say that they contributed equally.   It seems strange to me, because if the two authors are in alphabetical order, then it could be that the first author contributed more or the two contributed equally, and this can be made clear with asterisks in the paper if it's the latter case. When they're in non-alphabetical order, however, if someone only sees the author list without seeing the paper, he/she will likely assume that the first author contributed most.  So my question is: Are there particular reasons why people do that? (This  is related, but I don't think the answers there get to my question.) Multiple regression or partial correlation coefficient? And relations between the two I don't even know if this question makes sense, but what is the difference between multiple regression and partial correlation (apart from the obvious differences between correlation and regression, which is not what I am aiming at)?  I want to figure out the following: I have two independent variables ($x_1$, $x_2$) and one dependent variable ($y$). Now individually the independent variables are not correlated with the dependent variable. But for a given $x_1$ $y$ decreases when $x_2$ decreases. So do I analyze that by means of multiple regression or partial correlation?  edit to hopefully improve my question: I am trying to understand the difference between multiple regression and partial correlation. So, when $y$ decreases for a given $x_1$ when $x_2$ decreases, is that due to the combined effect of $x_1$ and $x_2$ on $y$ (multiple regression) or is it due to removing the effect of $x_1$ (partial correlation)? Why do ICs have NC (No Connection or No Function) pins? Title of short story: God granting immortality to others to find a way to kill himself Find all functions $f:\mathbb{N_{0}} \rightarrow \mathbb{N_{0}}$ satisfying the equation $f(f(n))+f(n)=2n+3k,$ for all &amp; $n\in \mathbb{N_{0}}$, where $k$ is a fixed natural number.  A friend of mine suggested me to use recurrence relation. While it is unfortunate that I have problems understanding recurrence relation. Please refer information to understand difference equation, homogeneous equation &amp; auxillary equation.  Thanks in advance! Kindly don't down vote for not showing my attempt. I am seriously not able to understand the question and the process suggested to use. Is there any intuition or meaning regarding Cauchy-Riemann equations? Becoming Thieves Guild Guildmaster, am I bugged? I've completed the Thieves Guild main questline () and chosen my special power (Shadowcloak of Nocturnal). It says completed in my quest log.  I also completed the  in each city you can give Thieves guild influence to (Markarth, Whiterun, Windhelm, and Solitude) and done their special jobs from Delvin. They show completed in my quest log. I've even done at least one of each kind of job from Vex and Delvin (but not in each city).  I got  in the Ragged Flagon and have done the quest for Tonilia (delivering the Moon Sugar to a caravan) and Vekel (getting the 4 books). I've also upgrade one of my pieces of Thief Armor.  I talk to  to become guild master and I get no dialogue options but he just says he's busy and we'll talk another time. There is a guild chest in front of his desk but it's locked and I don't have the key.  What am I missing? Is there some bug I've encountered? How to install and run CPUSim 4.0.11 on Ubuntu 18.04 LTS? I'm going according to the steps mentioned on the cs colby .  First, I installed java on my system by typing the following commands-  sudo add-apt-repository ppa:linuxuprising/java sudo apt-get update sudo apt-get install oracle-java10-set-default sudo apt install oracle-java10-set-default     Then, according to the instructions, I downloaded the .zip file, extracted it and then in the terminal typed   java -cp .:richtextfx-fat-0.6.10.jar:reactfx-2.0-MR.jar -jar CPUSim-4.0.11.jar   But this didn't work.  of command 1 terminal.  Here is a screenshot of all the files that are there in the CPUSim folder,   On observing the names of the folders present, I thought that the previous command was wrong. So I tried the following ones,  java -cp .:richtextfx-fat-0.6.10.jar:reactfx-2.0-M4.jar -jar CPUSim-4.0.11.jar java -cp .:richtextfx-0.6.10.jar:reactfx-2.0-M4.jar -jar CPUSim-4.0.11.jar   But none of them seems to work. Now when I click on the CPUSim-4.0.11.jar file, nothing happens. I have just switched to Ubuntu from Windows 10, and have a very little knowledge about how things work here. Please tell me how I could install and run CPUSim 4.0.11 on Ubuntu 18.04 LTS. I am trying to implement the following K-map with a table    AB C     00 01 11 10       ______________     0| 1  0  1  0     1| 0  1  1  0   I implemented it like this:   \begin{table}[htdp] \begin{center} \begin{tabular}{c|c|c|c|c|}  &amp;00 &amp; 01&amp; 11&amp; 10 \\ \hline 0&amp;1&amp;1&amp;1&amp;1\\ 1&amp;0&amp;0&amp;0&amp;0\\ \end{tabular} \end{center} \label{default} \end{table}   However on the top row I have vertical lines that I'd like to not see. I went with this approach because if i was to use a one row with the information so that I wouldn't have to worry about aligning the headings. So is there a way I can get the vertical lines not to appear in the heading row? Showing that $X^2$ and $X^3$ are irreducible but not prime in $K[X^2,X^3]$ Show that $X^2$ and $X^3$ are irreducible but not prime in $K[X^2,X^3]$.   My reasoning is as follows:  Since the only ways $X^2$ and $X^3$ can be factored in $K[X^2,X^3]$ are $X^2 = X^2 * 1$ and $X^3=X^3*1$ it follows that $X^2$ and $X^3$ are irreducible.  To show that they are not prime in $K[X^2,X^3]$ I argue that $X^2\mid X^3*X^3$ but $X^2\nmid X^3$ and $X^3\mid X^4*X^2$ but $X^3\nmid X^4$ or $X^3\nmid X^2$.  Is that correct? The vote fraud script breaks legitimate polling questions - A serial downvoter's lament I've downvoted several of the answers on these Meta discussions:       Both questions are typical self evaluations, Stack Exchange runs them on all young Beta sites and as you may have noticed they are essentially polls, a series of example questions from the site that we are supposed to vote on.  Today I noticed that almost all of my votes have disappeared on both evaluations, only an upvote remains in the later one. My votes triggered the serial voting script, something that :      Heh, it appears I just serially downvoted you (I downvoted a lot of the answers here), hopefully the script is smart enough to not reverse my votes. Will check back in 24h, and if it does, I'll rant about it on MSO ;)    My voting behaviour on both evaluations was very simple:   I had the evaluation open in the left monitor, Opened all the example questions in their own tab, in the right monitor, Scanned each question quickly, and voted on the Meta answer (most of my votes were downvotes), Repeat for the next one, and so on...   I didn't spend more than a few seconds on any question, as I'm fairly regular on the site and I've already read all of them while casually browsing the site. In fact, if my memory isn't failing me, I had voted (up/down) and/or commented, and/or voted to close on each of the 20 example questions. I might have spend a minute or two re-reading a couple, but I mostly scanned through them. In any case I think my voting pattern is quite normal, and the script should be somehow tweaked to take serial posts, posted by the same user in quick succession, into consideration, especially on Metas.   Since I had anticipated that the script would kick in, I could have tried to fool it by pausing a bit between votes or trying to look for other Meta posts to vote on, in between voting on the evaluation answers. However I'm a very active voter on Meta Workplace, there aren't many posts I haven't already voted on, and the few that I haven't is probably because I neither agree or disagree with (my opinion on them is simply "meh"). In any case I think my voting behaviour was natural, and although the serial voting script is awesome, this time it caught and reversed a perfectly legitimate behaviour.  Animuson, in , mentions that the script isn't really optimal on Area51 as well:      Yes, please implement this on Area 51 proposals too! Oftentimes a single user would suggest a plethora of "example" questions to their own proposal which are just terrible, yet all of everyone's votes get reversed and the question just sits there at 0. I've noticed several times that my votes have gotten reversed.    I haven't noticed it myself, but it certainly seems plausible, especially early in a proposal's life.  Mysticial found a related discussion, , but it's focused on voting patterns on main sites, where reputation is also a factor. I can understand jumping through hoops to satisfy the script on main sites where, unfortunately, there are a lot of people trying to get some cheap rep or "punish" others with their downvotes, but not on Metas, and especially not on these evaluation posts.   Voting fraud is a problem, and more often than not the script works wonderfully, but in my case it was extremely counterproductive. Critical evaluations are essential for a young Beta site, and their answers typically only get a handful of votes. I wonder how many of these votes have silently gone away...  Fix this please. Series of binomial coefficients: $\sum\limits_{n=k}^{\infty}{\binom nk}x^n=\frac{x^k}{(1-x)^{k+1}}$ Any hint to prove this? I tried with properties of binomial coefficient but I can't get anything. $$\sum_{n=k}^{\infty}{{n}\choose{k}}x^n=\dfrac{x^k}{(1-x)^{k+1}}$$ I have always wondered why diamonds shine. Can anyone tell me why? Unable to mount Windows (NTFS) filesystem due to hibernation Delay jquery hover event? I would like to delay a hover event in jquery.  I am reading from a file when user hovers over a link or label.  I don't want this event to occur immediately in case the user is just moving the mouse across the screen.  Is there a way to delay the event from firing?  Thank you.  Example code:  $(function() {     $('#container a').hover(function() {         $('&lt;div id="fileinfo" /&gt;').load('ReadTextFileX.aspx',             {filename:'file.txt'},             function() {                 $(this).appendTo('#info');             }          );     },         function() { $('#info').remove(); }     }); });   UPDATE: (1/14/09) After adding the HoverIntent plugin the above code was changed to the following to implement it.  Very simple to implement.  $(function() {     hiConfig = {         sensitivity: 3, // number = sensitivity threshold (must be 1 or higher)         interval: 200, // number = milliseconds for onMouseOver polling interval         timeout: 200, // number = milliseconds delay before onMouseOut         over: function() {             $('&lt;div id="fileinfo" /&gt;').load('ReadTextFileX.aspx', {filename:'file.txt'},                 function() {                    $(this).appendTo('#info');                 }              );         }, // function = onMouseOver callback (REQUIRED)         out: function() { $('#info').remove();  } // function = onMouseOut callback (REQUIRED)     }     $('#container a').hoverIntent(hiConfig) } How do I rename all folders and files to lowercase on Linux? Why doesn't Stack Apps have its own meta? TeXstudio not large enough to use on a 4k display Every power series is the Taylor series of some $C^{\infty}$ function In Clan Wars, what factors are used to determine the opponent clan? In the clan wars matchmaking, what criteria is used to determine the clan that you are fighting against? Is it based on Clan Total Points (i.e. trophies), or something else?  If you win many wars in a row, does this mean you will get harder opponents?