While staying with some relatives, I noticed that all their windows experience terrible interior condensation at night and am wondering about what they can do to prevent it.  The house is kept to 70 degrees with gas-powered hot water baseboard heaters, and the windows are vinyl double-paned units. The house is 2x4 frame construction with interior drywall, exterior stucco, and I'm being told that the walls are uninsulated(!!!).  They live in a colder part of the high desert southwest where the humidity is very low during the day but rises at night, and where the temperature gets down into the single digits at night during the winter. During this season, the interior of their windows become entirely covered with condensation at around 8 or 9 PM every night without fail. It's kinda weird. What's causing this, and what can they do about it?
On the street, temperatures at night are about -5 &deg;С and about 8 &deg;C during the day. In the apartment it is about 25 &deg;C. So, there is condensation on the windows and I don't want to wipe the windows every time.  How do I prevent condensation on the balcony windows?
Is simply connectedness preserved after deleting a high codimension set Proof of a basic $AC_\omega$ equivalence On  it is mentioned that "...  in order to prove that every accumulation point $x$ of a set $S\subseteq \mathbf R$ is the limit of some sequence of elements of $S\setminus \{x\}$, one uses (a weak form of) the axiom of countable choice. When formulated for accumulation points of arbitrary metric spaces, the statement becomes equivalent to $AC_\omega$. ..."  I have Herrlich's paper "Choice principles in elementary topology and analysis" where in theorem 2.4. it is stated that these are indeed equivalent. Then I looked up the reference he quotes, [4], which are Bentley H.L., Herrlich H., Countable choice and pseudometric spaces which does not contain the proof and  does also not contain the proof, hence my question:   Where can I see a proof of      "if $S$ is a set in a metric space $X$ with accumulation point $s$   then there exists a sequence $s_n$ in $S$ converging to $s$"   $\implies$ $AC_\omega$   ? (the other implication is clear to me). Thanks. Recovering from a move of /home when it's encrypted (ecryptfs) I had a 20GB / partition at work that dual-booted with Windows and it quickly ran out of space. I usually do 20GB / and 160GB (or whatever the rest of the hard drive is) as /home, so I intended on recovering the space Windows was taking up and turning that into /home.  That went fine and I was able to mount the partition and rsync all my files over.  However, I forgot that the partition was encrypted, so now all my files are sitting in /home/.ecrypt and /home/$USER is empty.  How can I recover my files from /home/.ecrypt and move them to /home/$USER?  I followed this tutorial: This option, which was present in the "Mouse and Touchpad" settings panel in previous versions, is for some reason absent in 16.04 LTS. Does anyone know why this is, and/or how to fix it? Thanks. I had a look at Knuth's The Art of Computer Programming, book 1. In chapter 1, section 1.2.2, exercise 25, he presents the following algorithm for calculating logarithm:  given $x\in[1,2)$, do the following:  L1: [Initialize] Set $y\leftarrow0$, $z\leftarrow x/2$, $k\leftarrow1$.  L2: [Test for end] If $x=1$, stop.  L3: [Compare] If $x-z&lt;1$, go to L5.  L4: [Reduce values] Set $x\leftarrow x-z$, $z\leftarrow x/2^k$, $y\leftarrow y+\log_b(2^k/(2^k-1))$, and go to L2.  L5: [Shift] Set $z\leftarrow z/2$, $k\leftarrow k+1$, and go to L2.  (The algorithm needs an auxiliary table which stores $\log_b2$, $\log_b(4/3)$, and so on, to as many values as the precision of the computer.  Then Knuth concludes: this exercise is to explain why the above algorithm will terminate and why it computes an approximation of $y=\log_b x$.  Well, I see that it works, but I am not able to explain why... During Winterbash 2014, there was a hat called , which was earned by giving an answer scoring 5 or better to question that had a score of −3 or worse at the time of answering and later rose to a score of +3 or better.  I’ve already shared the . Those cases give me a great deal of confidence that this would be a challenging badge trigger that would produce good behavior with a minor tweak. Here are the Red Barons earned on other sites:    (Logan Maingi) Mathematics  (Mike Miller) Mathematics  (Hugo) English Language and Usage  (tchrist) English Language and Usage  (Mr. Shiny and New 安宇) English Language and Usage  (Darth Satan) Science Fiction and Fantasy  (DVK) Science Fiction and Fantasy  (rolfl) Code Review  (Heslacher and Hosch250) Code Review  (Edward) Code Review  (janos and Manny Meng) Code Review  (Mark Mayo, Rory Alsop and MeNoTalk) Travel      (DJClayworth) Christianity  (McMagister) Puzzling   Looking through the timelines, I’m convinced that the answerer’s votes should be excluded from the pre-answer question score calculation. Doing that would have reduced the number of Red Barons to 16 across the network. However, the cost of making a badge harder to obtain is worth the benefit of avoiding giving people an incentive to manipulate question scores¹.  To wrap up, the hat seemed to have encouraged a number of great answers and rescued some questions that would otherwise have been lost to time. My outstanding questions are:   Were there any problems on questions where people were attempting to earn the hat, but failed? (Or any other problems I didn’t observe.) If not, should we  or create a new badge? If we create a new badge, what should it be called?   I’m especially interested in feedback that counters my own bias in favor of this idea. If I’m missing any problems, I’d like to know about them now.    ¹ Several questions were downvoted, answered, edited (sometimes trivially)  and upvoted by the user who earned the hat. OpenSSL and error in reading openssl.conf file Why is "if not someobj:" better than "if someobj == None:" in Python? Just noticed this:  Someone @replied to me in a question which appropriately showed up in my feed.  I go to click on that notice in the feed, and it presents me with "Loading the question failed."  I'd show a picture, but I don't think that it's entirely relevant - I believe it's reproducible if an answer is posted, someone makes a reply, the answer is removed, then that someone else goes back in the feed to try and revisit the post.  Alternatively, why not synchronize the interface between what a 10K user sees on the site, and what they see in the app?  As a 10K user, I would expect to see deleted questions and answers. Is there a word for describing people who know many things but superficially? Is there an appropriate word for the antonym of "full-stack", as in programming? Someone who knows a lot of things just as a full-stack programmer, but without mastering them. dpkg:error:parsing file '/var/lib/dpkg/status' near line 1146 package 'python-minimal' Can "Mr", "Mrs", etc. be used with a first name? How do I uninstall the command line tools for Xcode? We have a bunch of Mac at work that no longer require Xcode or command line tools so we'd like to remove them so the compilers aren't hanging around and we don't have to keep updating them when updates arrive. , but now that Xcode is an app store app you are left with the tools if you ever install them. Can we clean this other than wiping the OS for macs running 10.10 and newer? I'm writing a custom module for Drupal 8. It defines a field storage configuration object, in a file called modules/mymod/config/install/field.storage.bloom_stem.bs_twitter_ac.yml.  The problem is that this is not removed when I uninstall the module; it is apparently left behind because, when I re-install the module, I get a crash.   drush -y pm-uninstall mymod drush cr drush -y en mymod      exception 'Drupal\Core\Config\PreExistingConfigException' with message 'Configuration objects (field.storage.bloom_stem.bs_twitter_ac) provided by mymod already exist in active configuration'   So it seems I need to some how manually remove this configuration object. Do I need to provide some more code that deletes it when the module is uninstalled? I regularly find sites that copy content from elsewhere (mailing lists, etc) while not providing any added value. Quite to the contrary, they are pretty heaped with ads.  I'd like to remove those sites as permanently as possible from my Google search results. Any ideas? I've setup a plane with a particle emitter system. When I render the footage and the particles are glowing. Where do I find the settings for that? Are there any subtle differences between "somebody" and "someone", or can they be used completely interchangeably? Similarly, can you imagine a situation in which you would prefer "anybody" to "anyone" or vice versa? Is sum of two orthogonal matrices singular? I am trying to solve following problem.      Let $A, B \in \mathbb{R}^{n\times n}$ be an orthogonal matrices and $\det(A) = -\det(B)$. How can it be proven that $A+B$ is singular?   I could start with implication:  $\det(A)=-\det(B) \Rightarrow B$ is created from $A$ by swapping two lines or columns.   But I am not sure if this implication is correct. Fastest converging method for calculating e My foreign school book is not clearest at this point, what is really needed with this? What does it mean that "assign definite integral for $\lim_{n\rightarrow \infty}\sum_{k=1}^{n} \frac{1}{n+k}$"? I am not sure, whether I should assign it like this $\lim_{n\rightarrow \infty} \int_{1}^{n} \frac{1}{n+x} dx$ and noticing that it is continuous then trying to find borders so that $F(a) - F(b)$?  (the book messes up all kind of Leibniz stuff at this point, a bit messy -- and just stating $\int f(x)\,dx= F(a)-F(b)$, but not even paying attention to different borders. As far as I know, it is important to specify whether borders depend on the integration factor)