I log into a system via ssh (ubuntu). Recently, when I start up mc directly from the command prompt, it takes ages to start and finally present the familiar two-pane screen. Also, I can't drop to the command prompt subshell (using ctrl-o). If I start it under tmux, it starts up instantly, and ctrl-o works normally.   running strace on mc directly:    compared to strace on mc under tmux:     It seems some environment setting is causing a tremendous stall, but I can't pinpoint it. Can someone help, please?  Thanks, Jon
Is there any way to prevent mc from taking 10-30 seconds to open?
My friend had a  on the board with 10 counters on it.  If I destroy it and he sacs it in response to gain the life, is there anything that can be done about that?  Like, can I put another destroy artifact on the stack to resolve before his sac resolves? How can I draw simple trees in LaTeX? I need to draw a tree, and constantly using dotty and including the PNGs is starting to be a pain. Is there a way to get LaTeX to draw it's own trees that doesn't involve learning an entirely new language like TikZ? How do I remove diacritics (accents) from a string in .NET? I'm trying to convert some strings that are in French Canadian and basically, I'd like to be able to take out the French accent marks in the letters while keeping the letter. (E.g. convert é to e, so crème brûlée would become creme brulee)  What is the best method for achieving this? How to imitate commercial fried chicken? I'm trying to develop my own "secret" fried chicken recipe, something that is similar to Popeye's or Church's. I'm a LONG ways from getting there. Here's what I did in my last experiment:   Chicken was marinated in buttermilk with Cajun spices and Tabasco sauce for 24 hours I used a deep fryer and canola oil. 175C. Prior to "dressing" the chicken, I let the excess buttermilk brine drip off the chicken. I then seasoned it with Cajun seasoning I made a batter using an egg, self rising flour, milk, baking powder I also tried using just plain flour for breading   Results:   Using the batter, the chicken came out looking burned and too smooth (didn't have that crunchy look). It burned too much that I couldn't finish cooking the chicken. Using the flour, the chicken came out with a thin crust, somewhat crispy, but also too burnt. Dipping the chicken in the batter AND then flour gave a bulky &amp; crunchy look. However, again, the result looked too burnt.   Modifications:  I then changed the the breading. I used bread flour and corn starch. I dipped the chicken in the batter again, then used the new breading. The bread flour was a bit lighter. And the corn starch was even more lighter. But they were still burn looking (just lighter shades). I also dropped the temperature to 160C.  Results:  Burnt chicken whose crust wasn't really sticking to the skin/meat.  Questions:  Any suggestions on what I can do to improve? I'm guessing something in the batter is causing the burnt coat. What flour should I use? What can I do to make the coat stick to the skin/meat? Any other suggestions on what to do? "Yesterday" time specification shown when it was actually the day before yesterday Looking at , I see "asked yesterday" (which I really hate; I'd like to see an exact time specification rather than this vague one, especially in the list of questions). But it was not asked yesterday! When I hover over it to show the exact time, it shows it was actually the day before yesterday!  This snapshot was taken at 2012-03-31 15:00 UTC (plus or minus a few minutes):    Whatever different opinions you may have on the implementation, yesterday is a word with a certain meaning. Redefining it is not a good idea. At least rephrase this as "1 day ago" or something. How do I generate random integers within a specific range in Java? Proof that no polynomial with integer coefficients can only produce primes Doing a discrete math review and am trying to solve problem 1.6 in the text found here:  - I believe I've gotten parts (a) and (b) correctly, but (c) is a bit tricky for me. Would appreciate a review of a/b and a hint for c if possible. Restatement here:  For n = 40, the value of polynomial $p(n)::=n^2 + n + 41$ is not prime, as noted in Section 1.1. But we could have predicted based on general principles that no nonconstant polynomial can generate only prime numbers.  In particular, let $q(n)$ be a polynomial with integer coefﬁcients, and let $c::=q(0)$ be the constant term of q.  (a) Verify that $q(cm)$ is a multiple of c for all $m \in Z$  Proof: Since q is a polynomial, it will be of the form: $q(x) = a_nx^n+a_{n-1}x^{n-1} + ... + a_1x + c$  If $x = cm$, then notice that cm will be inside every term of the polynomial, and since the final term is c, c can be factored out of every term. Hence, q(cm) is a multiple of c for all $m \in Z$.  b) Show that if q is nonconstant and c > 1, then as n ranges over the nonnegative integers, $N$, there are infinitely many $q(n) \in Z$ that are not primes.  Proof: Continuing from the result found in (a), it is easy to see that for all $m \in Z$, there will be an infinite number of multiples of c that will be generated by q. Since c > 1, these multiples are guaranteed not to be prime.  c) Conclude that for every nonconstant polynomial, q, there must be an $n \in N$ such that $q(n)$ is not prime. Hint: Only one easy case remains.  c = 0 is trivially easy to prove using the (b) above.  I assume the "easy" case is referring to c = 1, but in this case I'm not sure how to continue, since the result of (a) and (b) don't apply: I can't use them since adding 1 to any even number may make it prime. If the result of the terms not including c is odd, then adding 1 to that result makes it even and it is not prime. However, if the terms add up to an even number, I don't see a way of using the knowledge I have so far to prove conclusively that that number + 1 will NOT in fact be prime. Blender resizing my image in half I have a problem. I'm trying to render an image and the resolution is 500x280. After I render the image and save it, for some reason the image gets resized to 250x140. I'm unsure why it happends. Using a foreign driver's license in California when staying with a J-1 visa I'm planning to attend a Californian university as a visiting scholar (not paid by the university) on a J-1 visa, for a total of four weeks; a colleague of mine will do the same, but for 12 weeks. I've been told (personally, ie. no citable sources) that, if you're staying on a J-1, you're effectively a California resident for the time you're there, and, therefore, need a Californian driver's license.  I've read up on this and found  that states:     If you are a visitor in California over 18 and have a valid driver   license from your home state or country, you may drive in this state   without getting a California driver license as long as your home state   license remains valid.      If you become a California resident, you must get a California driver   license within 10 days. Residency is established by voting in a   California election, paying resident tuition, filing for a homeowner's   property tax exemption, or any other privilege or benefit not   ordinarily extended to nonresidents.   I'm not planning to vote in any elections, nor will I own a home there, but I'm not sure what would constitute "privileges or benefits not ordinarily extended to nonresidents".  Do we need to get driver's licenses in California, or can we use our foreign licenses? How about day trips to Arizona or Nevada?  Note: this seems to be related to , but my question is specifically about staying there on a J-1. Detach (move) subdirectory into separate Git repository Inequality: $ab^2+bc^2+ca^2 \le 4$, when $a+b+c=3$. At the end of the scene in the cemetery in GoF, the spirits who emerged from Voldemort's wand tell Harry to go grab the trophy (which, of course, was a portkey that took Harry and Cedric from the maze to the cemetery), and that the trophy portkey would take Harry back to Hogwarts.  Why would the portkey do that?  Are all the portkeys 2-way?  If possible, I would prefer as much of the answer based on canon (or JKR) as feasible I came across this proof while looking for hints on my homework, and I think it's only gotten me more confused. This is from .  Lemma 5.4 If $(H,h)$ is a homogeneous Riemannian manifold, then $(H,h)$ is complete. Proof. By the Hopf-Rinow Theorem, it suffices to show that $(H,h)$ is geodesically complete. Thus suppose that $c:[a,1) \rightarrow H$ is a unit speed geodesic which is not extendible to $t=1$. Choosing any $p \in H$, we may find a constant $\alpha &gt; 0$ such that any unit speed geodesic starting at $p$ has length $\ell \geq \alpha$. Set $\delta = \min\{\alpha/2, (1-a)/2\} &gt; 0$. Since isometries preserve geodesics, it follows from the homogeneity of $(H,h)$ that any unit speed geodesic starting at $c(1-\delta)$ may be extended to a geodesic of length $\ell \geq 2 \delta$. In particular, $c$ may be extended to a geodesic $c:[a, 1+\delta) \rightarrow H$, in contradiction to the inextendibility of $c$ to $t=1$.  How exactly does it &quot;follow from homogeneity&quot; that we are able to extend unit speed geodesics? Isn't that what we're trying to show in the lemma? And how does considering geodesics based at $c(1-\delta)$ lead us to extending $c$ to $c:[a,1+\delta) \rightarrow H$? Eclipse Scala IDE - class file needed by X is missing Can't change mouse influence in proportional editing mode I press O and I see it change to Proportional Editing mode, but when I press G and mouse wheel down/up, or arrow keys down/up, it doesn't change the influence area.    And I am, I press G and then I tried to scroll to change influence, but it's not working.    Done this aswell and it's not working Illustrator Vector Graphics Appearing Pixellated This has been puzzling me for a few days now, and I asked a graphic designer I knew before trying here and haven't been able to solve it yet. It's quite weird so please bear with me for a bit.  I am using Adobe Illustrator to create a logo, and I have something that can potentially work. I have used only the pen tool with strokes (no fill), but the issue is, when I view the logo at 100%, it looks pixellated! I know vectors should not even be able to appear pixellated, but they are. Here is the screenshot from AI, without exporting to anything:     That was just done using the snipping tool within Windows, and it's at 100% zoom.  I have anti-aliasing turned on from Edit > Preferences > General, and the document resolution is at 300 ppi (I get the same result with 72 ppi).   Could anyone help me with this?   If relevant: Using CS6, and have a 24 inch Dell U2412M at 1920x1200 resolution. I do have a 21.6" Samsung at 1680x1050 and I get the same result there as well. Let me know if you need any other settings, or if you would like the file, I'd be happy to provide it to be able to solve this problem. How to calculate $\lim \limits_{n \to \infty}(1 +\frac{a}{n})^n$? How do I wire two lights with a switch? Dismiss flags on the same posts with different validities Sometimes a post has both valid flags and invalid flags. As far as I can tell, all the flags on the same post have to be dismissed with the same validity.  The scenario I encountered (on ):   A low-quality question is closed. The asker improves the question and flags for reopening. A moderator reopens the question, but doesn't dismiss the flag yet. Someone else flags the question as “off topic”.   Since I agree with the reopening, and I don't consider the question off-topic, I would like to dismiss the first flag as valid and the second flag as invalid. But there's only one set of buttons for both flags.  And just now, two flags on a closed question: one that says “delete it”, the other one that says “reopen it”. The correct course of action is neither (the ideal outcome would be for the question to be edited then reopened). I should provide different feedback to the two flaggers, but I can't.  Unless I've missed something, please allow multiple flags on the same post to be dismissed separately. Invocable method Apex class is not visible in Process builder