'qt.qpa.screen: Could not connect to display' error when run python script at boot
Xdotool using "DISPLAY=:0" not works in Crontab
It seems the .NET Regex.Replace method automatically replaces all matching occurrences.  I could provide a MatchEvaluator delegate that returns the matched string after the first replacement, rendering no change, but that sounds very inefficient to me.  What is the most efficient way to stop after the first replacement? Compute Taylor error of $10^{-5}$ for $\cos(\pi/20)$ Why is my profile messed up on a single site and how can I revert it? I was just asking a question on Gardening SE and suddenly my user name there is a25bedc5-3d09-41b8-82fb-ea6c353d75aand my picture is replaced by a Gravatar. My location is also left blank.  Here's a   Curiously, my profiles on all other sites are fine.  I don't have a separate login for SE, I log in using my Google account. Nobody other than me has access to my Google account. I use two step authentication and I can see on "recent devices" in Google that no one but me has accessed my Google account. I only access SE from home, and nobody other than me has used my devices.   I tried to edit my Gardening SE profile back to the way I want it to be and I got the following message:     Oops! There was a problem updating your profile:   Display name may only be changed once every 30 days; you may change again on Jun 20 at 10:49   I'm assuming this is because I changed the "about me" on all SE sites two days ago.  I never edit my profiles individually. I always apply changes to all sites, using the same profile on all sites.  I have certainly not made such strange (or any) edits to my profile on Gardening SE.  Why did this happen, and how can I get my proper user name and picture back on Gardening SE? Do I really have to wait for a whole month? I want to use the site, and I want them to recognize me as the user they know. I don't want to wait a whole month.  Update: The Gardening SE moderator Niall C. helped me out, and he offered the following potentially relevant information:     I changed your display name on Gardening &amp; Landscaping back to "Fiksdal". Your profile history shows that your profile image (from your headshot on imgur.com to a gravatar), email, about me also changed at the same time as your display name on May 21. It also shows that I changed your profile image to a different gravatar when I changed your display name just now... weird! – Niall C. 1 hour ago I want to merge an audio file (.wav or .au format) with a video file (.mp4 format).  Please suggest me how to achieve this. I want to merge these file to new .mp4 video file. An ffmpeg command would be very welcome. What is the minimum distribution for LaTeX Is there a way to export each rendered layer as its own image? My scene uses multiple render layers.  I'd like to edit each rendered layer in Photoshop, and composite it in Photoshop.  Is there a way to export each layer as an individual image? Getting an error that a flow "was" activate and cannot be overwritten A rubber viewfinder cover is connected to my camera strap.  What's it for, and when do I use it?  What happens to a photo if I don't use it? How do I disable network manager permanently? I'm using Ubuntu 18.04.1 LTS. I want to disable network manager on an Ubuntu machine, because (1) I don't need it, (2) I prefer having hardcoded configuration, and (3) network manager regularly causes issues by changing the DHCP configuration. I tried to follow :  Stop network manager sudo systemctl stop NetworkManager.service  Disable network manager (permanently) to avoid it restarting after a reboot sudo systemctl disable NetworkManager.service   Despite this, the network manager is back again every time I reboot the machine. How can I make it go away? Help with packages in java - import does not work Can spells or spell-like abilities do non-lethal damage? I'm working on a Paladin/Warlock combination, based off of , and as part of this, I noticed Miniman's remark that Repelling Blast won't be that useful, because as a Paladin, you want people up close and personal when you're in a combat situation, not further away.  However, as a Paladin, your creed sometimes leads you to not want to engage in full-blown combat with a potential adversary -- you may want to drive them off or incapacitate/capture them instead.  With this, I wonder: can Repelling Blast, or other spells and spell-likes (such as invocations), be made to do non-lethal damage?  If so, I'm thinking that it'd be useful in exactly that sort of situation -- halting someone/pushing them away without having to wade into a melee with them or blow them to smithereens. I've read in several places that one motivation for category theory was to be able to give precise meaning to statements like, "finite dimensional vector spaces are canonically isomorphic to their double duals; they are isomorphic to their duals as well, but not canonically."  I've finally sat down to work through this, and -  Okay, yes, it is easy to see that the "canonical isomorphism" from $V$ to $V^{**}$ is a functor that has a natural isomorphism (in the sense of category theory) to the identity functor.  Also, I see that there is no way that the functor $V\mapsto V^*$ could have a natural isomorphism to the identity functor, because it is contravariant whereas the identity functor is covariant. My question amounts to:     Is contravariance the whole problem?   To elaborate:   I was initially disappointed by the realization that the definition of natural isomorphism doesn't apply to a pair of functors one of which is covariant and the other contravariant, because I was hoping that the lack of a canonical isomorphism $V\rightarrow V^*$ would feel more like a theorem as opposed to an artifact of the inapplicability of a definition.  Then I tried to create a definition of a natural transformation from a covariant functor $F:\mathscr{A}\rightarrow\mathscr{B}$ to a contravariant functor $G:\mathscr{A}\rightarrow\mathscr{B}$. It seems to me that this definition should be that all objects $A\in\mathscr{A}$ get a morphism $m_A:F(A)\rightarrow G(A)$ such that for all morphisms $f:A\rightarrow A'$ of $\mathscr{A}$, the following diagram (in $\mathscr{B}$) commutes:  $$\require{AMScd}\begin{CD} F(A) @&gt;m_A&gt;&gt; G(A)\\ @VF(f)VV @AAG(f)A\\ F(A') @&gt;&gt;m_{A'}&gt; G(A') \end{CD}$$  This is much more stringent a demand on the $m_A$ than the typical definition of a natural transformation.  Indeed, it is asking that $m_A=G(f)\circ m_{A'}\circ F(f)$, regardless of how $f$ or $A'$ may vary. Taking $\mathscr{A}=\mathscr{B}=\text{f.d.Vec}_k$, $F$ the identity functor and $G$ the dualizing functor, it is clear that this definition can never be satisfied unless $m_V$ is the zero map for all $V\in\text{f.d.Vec}_k$ (because take $f$ to be the zero map). In particular, it cannot be satisfied if $m_V$ is required to be an isomorphism.     Is this the right way to understand (categorically) why there is no natural isomorphism $V\rightarrow V^*$?   As an aside, are there any interesting cases of some kind of analog (the above definition or another) of natural transformations from covariant to contravariant functors?  Note: I have read a number of math.SE answers regarding why $V^*$ is not naturally isomorphic to $V$. None that I have found are addressed to what I'm asking here, which is about how categories make the question and answer precise. ( was closest.) Hence my question here. Proving that the sequence $F_{n}(x)=\sum\limits_{k=1}^{n} \frac{\sin{kx}}{k}$ is boundedly convergent on $\mathbb{R}$ Here is an exercise, on analysis which i am stuck.    How do I prove that if $F_{n}(x)=\sum\limits_{k=1}^{n} \frac{\sin{kx}}{k}$, then the sequence $\{F_{n}(x)\}$ is boundedly convergent on $\mathbb{R}$? Question:  Is exception handling in Java actually slow?  Conventional wisdom, as well as a lot of Google results, says that exceptional logic shouldn't be used for normal program flow in Java.  Two reasons are usually given,   it is really slow - even an order of magnitude slower than regular code (the reasons given vary),     and    it is messy because people expect only errors to be handled in exceptional code.     This question is about #1.  As an example,  describes Java exception handling as "very slow" and relates the slowness to the creation of the exception message string - "this string is then used in creating the exception object that is thrown. This is not fast."  The article  says that "the reason for this is due to the object creation aspect of exception handling, which thereby makes throwing exceptions inherently slow".  Another reason out there is that the stack trace generation is what slows it down.  My testing (using Java 1.6.0_07, Java HotSpot 10.0, on 32 bit Linux), indicates that exception handling is no slower than regular code.  I tried running a method in a loop that executes some code.  At the end of the method, I use a boolean to indicate whether to return or throw.  This way the actual processing is the same. I tried running the methods in different orders and averaging my test times, thinking it may have been the JVM warming up.  In all my tests, the throw was at least as fast as the return, if not faster (up to 3.1% faster).  I am completely open to the possibility that my tests were wrong, but I haven't seen anything out there in the way of the code sample, test comparisons, or results in the last year or two that show exception handling in Java to actually be slow.  What leads me down this path was an API I needed to use that threw exceptions as part of normal control logic.  I wanted to correct them in their usage, but now I may not be able to.  Will I instead have to praise them on their forward thinking?  In the paper , the authors suggest that the presence of exception handlers alone, even if no exceptions are thrown, is enough to prevent the JIT compiler from optimizing the code properly, thus slowing it down.  I haven't tested this theory yet. Questions about proving $\lnot \lnot a = a$ This is all in the context of a Hilbert system with modus ponens $A, A\to B \vdash B$ and axioms:  Axiom $1$: $A \to (B \to A)$   Axiom $2$: $(A \to (B \to C)) \to ((A \to B) \to (A \to C))$   Axiom $3$: $(\lnot B \to \lnot A) \to (A \to B)$  So I tried to prove double-negation elimination by doing the following:  \begin{array}{ccc} 1 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot a &amp; \text{Premise}\\ 2 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot a \to (\lnot \lnot \lnot \lnot a \to \lnot \lnot a)  &amp; \text{ Axiom } 1\\ 3 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot \lnot \lnot a \to \lnot \lnot a  &amp; \text{ Modus Ponens } 1, 2\\ 4 &amp; \{ \lnot \lnot a \} \vdash (\lnot \lnot \lnot \lnot a \to \lnot \lnot a) \to (\lnot a \to \lnot \lnot \lnot a)  &amp; \text{ Axiom } 3\\ 5 &amp; \{ \lnot \lnot a \} \vdash \lnot a \to \lnot \lnot \lnot a  &amp; \text{ Modus Ponens } 3, 4\\ 6 &amp; \{ \lnot \lnot a \} \vdash (\lnot a \to \lnot \lnot \lnot a) \to (\lnot \lnot a \to  a)  &amp; \text{ Axiom } 3\\ 7 &amp; \{ \lnot \lnot a \} \vdash \lnot \lnot a \to  a  &amp; \text{ Modus Ponens } 5, 6\\ 8 &amp; \{ \lnot \lnot a \} \vdash a  &amp; \text{ Modus Ponens } 1, 7\\ 9 &amp; \vdash \lnot \lnot a \to a  &amp; \text{ Deduction Theorem } \\ \end{array}  And then I continued on, to prove double negation introduction:  \begin{array}{ccc} 10 &amp; \vdash \lnot \lnot \lnot a \to \lnot a &amp; \text{Double Negation Elimination}\\ 11 &amp; \vdash (\lnot\lnot \lnot a \to \lnot a) \to (a \to \lnot \lnot a) &amp; \text{ Axiom } 3\\ 12 &amp; \vdash a \to \lnot \lnot a &amp; \text{ Modus Ponens } 10, 11\\ \end{array}  My questions:   Am I allowed to invoke the deduction theorem in the middle of a proof like this (step $9$)? Is this considered a context change? Is context-changing allowed? Are the proofs even right/correct? Assuming it's all correct: Are we able to combine them to say that $a \to \lnot \lnot a$ and $\lnot \lnot a \to a$, therefore $a \iff \lnot \lnot a$ or is this symbol not allowed? What ultimately let us say $\lnot \lnot a = a$, the use of the equal sign here? Is there a nice solution to get a "presenter mode" for Latex presentations? How does one find which files are taking up 80% of the space on a Linux webserver? The drive is constantly filling up. You've hunted down all the spare and random files you can. grep'd for coredump files and even removed some of the un-needed backups...  What would be your next move.  The actual server in question has 10GB of website files and the OS shouldn't take any more than 10GB so how do you track down what's filling a 50GB (virtual) drive? I need a number of different full-page DOM samples for my qUnit test suite Daily forecasting We have three years of data for online visits at a daily level. We want to forecast the daily visits for the next 90 days. What would be the best method to capture weekday seasonality , holiday seasons, and also the drift.  Can this be successfully done in R? We are currently using R. We have considered ARIMA but it does not capture seasonality.  While converting the data to a time series in R,  what should be the "frequency"?  Should we use ARIMA with regressors? How to calculate the confidence interval of the mean of means? Imagine that you repeat an experiment three times. In each experiment, you collect triplicate measurements. The triplicates tend to be fairly close together, compared to the differences among the three experimental means. Computing the grand mean is pretty easy. But how can one compute a confidence interval for the grand mean?  Sample data:  Experiment 1:   34, 41, 39  Experiment 2:   45, 51, 52  Experiment 3:   29, 31, 35  Assume that the replicate values within an experiment follow a Gaussian distribution, as does the mean values of each experiment. The SD of variation within an experiment is smaller than the SD among experimental means. Assume also that there is no ordering of the three values in each experiment. The left-to-right order of the three values in each row is entirely arbitrary.  The simple approach is to first compute the mean of each experiment: 38.0, 49.3, and 31.7, and then compute the mean, and its 95% confidence interval, of those three values. Using this method, the grand mean is 39.7 with the 95% confidence interval ranging from 17.4 to 61.9.   The problem with that approach is that it totally ignores the variation among triplicates. I wonder if there isn't a good way to account for that variation.