How to put on and off comments while publishing latex documents into PDF
Are comments safely hidden once the document is compiled?
Spaces in files names in \input or \includegraphics I'm going crazy...  I have a file I want to include which path is C:\Users\Matthieu\Documents\Folder withOneSpace\myFile.tex. (As you can see with the \, I'm on windows actually)  I tried the following but none works:  \input{C:/Users/Matthieu/Documents/Folder withOneSpace/myFile} \input{C:/Users/Matthieu/Documents/Folder\ withOneSpace/myFile} \input{C:/Users/Matthieu/Documents/Folder withOneSpace/myFile.tex} \input{C:/Users/Matthieu/Documents/Folder\ withOneSpace/myFile.tex}   I also tried to put the file out of the folder with a space and it works (no surprise):  \input{C:/Users/Matthieu/Documents/myFile} --&gt; Works   All I found is to put a \ before the space but it doesn't work at all. --> Please help ! :) Why don't we include $\rho g h$ in a hydraulic jack below? Consider a hydraulic jack with massless pistons as follows.    The famous equation for this system is   $$ \frac{F_1}{A_1}=\frac{F_2}{A_2} $$  My question is why isn't the equation as follows?  $$ \frac{F_1}{A_1}=\frac{F_2}{A_2} + \rho g h $$  It is based on  my understanding that any points in the same horizontal line have the same pressure.  Could you spot my misconception? Is there a simple way to flatten a list of iterables with a list comprehension, or failing that, what would you all consider to be the best way to flatten a shallow list like this, balancing performance and readability?  I tried to flatten such a list with a nested list comprehension, like this:  [image for image in menuitem for menuitem in list_of_menuitems]   But I get in trouble of the NameError variety there, because the name 'menuitem' is not defined.  After googling and looking around on Stack Overflow, I got the desired results with a reduce statement:  reduce(list.__add__, map(lambda x: list(x), list_of_menuitems))   But this method is fairly unreadable because I need that list(x) call there because x is a Django QuerySet object.  Conclusion:   Thanks to everyone who contributed to this question.  Here is a summary of what I learned.  I'm also making this a community wiki in case others want to add to or correct these observations.  My original reduce statement is redundant and is better written this way:  &gt;&gt;&gt; reduce(list.__add__, (list(mi) for mi in list_of_menuitems))   This is the correct syntax for a nested list comprehension (Brilliant summary !):  &gt;&gt;&gt; [image for mi in list_of_menuitems for image in mi]   But neither of these methods are as efficient as using itertools.chain:  &gt;&gt;&gt; from itertools import chain &gt;&gt;&gt; list(chain(*list_of_menuitems))   And as @cdleary notes, it's probably better style to avoid * operator magic by using chain.from_iterable like so:  &gt;&gt;&gt; chain = itertools.chain.from_iterable([[1,2],[3],[5,89],[],[6]]) &gt;&gt;&gt; print(list(chain)) &gt;&gt;&gt; [1, 2, 3, 5, 89, 6] If $\int_0^x f \ dm$ is zero everywhere then $f$ is zero almost everywhere I have been thinking on and off about a problem for some time now. It is inspired by an exam problem which I solved but I wanted to find an alternative solution. The object was to prove that some sequence of functions converges weakly to zero in $L^2$.   I managed to show (with some help) that the limit $f$ (of a subsequence) satisfies $\int_0^x f \ dm=0$ for all $x&gt;0 $. From this I want to conclude that $f=0$ a.e. I can do this with the fundamental theorem of calculus in its Lebesgue version but there ought to be a more elementary proof.  Can someone here help me out? Traverse a list in reverse order in Python So I can start from len(collection) and end in collection[0].  I also want to be able to access the loop index. How do I pluralize Italian foods, like pasta noodles (spaghetti, macaroni)? Possible Duplicate:             Is it proper to say spaghettis for more than one spaghetti noodle?  What about macaronis as a plural for more than one macaroni noodle? I have my own AppleID ("Bob") but I don't use this email addy "Bob" anymore. I want to add my current, daily used email addy ("Jim") to my ID, or better yet, make it my only AppleID and delete "Bob". BUT... I already used "Jim" for an AppleID for an older friend who had no email address, so set it up for him on mine, "Jim".  My older friend now has an email address ("Ivan") so can I   add "Ivan" to his AppleID, make it the primary email address, and then delete "Jim" from it? Or... delete his AppleID and create a new one for him "Ivan" knowing he would lose his minor purchases   And most importantly, this would all be pointless unless: - will deleting/removing "Jim" as linked to my friend's AppleID then make "Jim" available for me and no longer registered to another account? Symbols of derivatives Is there any matrix $2\times 2$ such that $A\neq I$ but $ A^3=I$? Is there any $2 \times 2$ matrix $A \neq I$ such that $A^3=I$?  In my opinion: no. Thank you very much. Basic mathematical induction regarding inequalities These are just the examples from my textbook, but I don't think it did not explain well.  One of the problem was to prove the inequality   $$n&lt;2^n$$  for all integers $n$.  I understand we assume if $P(n)$ is true, $P(k+1)$ is true.  Thus $k+1&lt; 2^{k+1}$  But in the text book, they added one more line that I don't understand:  $$k+1&lt;2^k+1 \le 2^k+2^k=2\cdot2^k=2^{k+1}$$  I understand  $$k+1&lt;2^{k+1}$$  But how do I know $2^k+1$ is larger than $k+1$, and smaller than $2^{k+1}$?  I have one another example just in case,  proving $2^n&lt;n!$ using induction.  $$2^{k+1}=2\cdot 2^k&lt;2\cdot k!&lt;(k+1)k!=(k+1)!$$  I understand we should start with $2^{k+1}&lt;(k+1)!$, but  Where did $2\cdot k!$ come from? Textbook says it came from inductive hypothesis, but I still don't get it.  Please advise. If $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$ Let $a_1,a_2,a_3,\ldots$ be reals. Prove that if $\sum_{n=1}^{\infty} a_n^{2}$ converges, then so does $\sum_{n=1}^{\infty} \frac {a_n}{n}$.   For this I have shown the case for when $ a_n^{2} \le\frac {|a_n|}{n}$ $\Rightarrow$ $ |a_n|\le\frac {1}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le \frac{1}{n^{2}}$ and we know that $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges and hence $\sum_{n=1}^{\infty}\frac {a_n}{n}$ converges by the comparison test. Now considering $ a_n^{2} \ge\frac {|a_n|}{n}$ $\Rightarrow$ $\frac {|a_n|}{n} \le a_n^{2}$ $\rightarrow$ combining the two cases for any n we have: $\frac {|a_n|}{n}\le\frac{1}{n^{2}}+a_n^{2}$ Hence using the comparion test again we know that $\sum_{n=1}^{\infty} a_n^{2}$ converges and $\sum_{n=1}^{\infty} \frac {1}{n^{2}}$ converges hence the sum converges so we can conclude that $\sum_{n=1}^{\infty} \frac {a_n}{n}$ is absoluetly convergent $\Rightarrow$ convergent.  Not to sure if this is correct, any help would be much appreciated, many thanks. Debugging automatic properties how to get the original entity on hook_entity_presave? i actually need it for the content_moderation_state entity   function hook_entity_presave(Drupal\Core\Entity\EntityInterface $entity) { if ($entity-&gt;getEntityTypeId() !== 'content_moderation_state' ) {     return; }     $moderation_state = $entity-&gt;get('moderation_state')-&gt;getString();   //code to get the original entity moderation state Logistic regression is predicting all 1, and no 0 I am running an analysis on the probability of loan default using logistic regression and random forests.    When I use logistic regression, the prediction is always all '1' (which means good loan).  I have never seen this before, and do not know where to start in terms of trying to sort out the issue.  There are 22 columns with 600K rows.  When I decrease the # of columns I get the same result with logistic regression.   Why could the logistic regression be so wrong?  **Actual from the data**  0 :   41932  1 :   573426  **Logistic regression output**   prediction for 1 when actually 0: 41932 prediction for 1 when actually 1:573426  A**s you can see, it always predicts a 1**   **Random forests does better:**  actual 0, pred 0 : 38800  actual 1, pred 0 : 27  actual 0, pred 1 : 3132 actual 1, pred 1 : 573399 How can I move all the window controls to the right (or left)? Downloaded Ubuntu tweak and set window controls to the right side. Only some programs follow the rule. Pidgin as an example has window controls on the right. But Chrome, Thunderbird, Geany, still have controls on the left.  How can I move ALL window controls(close/min/max) to the right (or left)? Writing a function inside the main method - Java Is natural projection a natural transformation? ATI Radeon HD 7770 no GPU rendering? Clone internal HDD to new SSD I recently installed an SSD into my machine. The machine itself is a Lenovo thinkpad W520, and it previously had an internal HDD. I moved the internal HDD into an expansion bay (replacing the CD-ROM), and put the new SSD into the internal bay.   The problem I'm having is that I have my Ubuntu configuration EXACTLY the way I want it - I originally spent many hours configuring it to get it to the way it is now. I'd rather not do this again. But, I'd also like the boot-up gains I would get from the OS being on the SSD.  So, what I'd like to do is clone my Ubuntu partition onto the SSD. The catch is that the standard HDD is significantly bigger than the SSD. And it has a windows partition that I don't need on the SSD (I never use Windows, so if it boots off of the other hard drive, that's fine). The layout of my hard drives are as follows:  /dev/sda (SSD):     Model: ATA M4-CT256M4SSD2 (scsi)     Disk /dev/sda: 256GB     Sector size (logical/physical): 512B/512B     Partition Table: msdos  Number  Start   End    Size   Type     File system  Flags  1      1049kB  147GB  147GB  primary  ext4         boot   /dev/sdb (HDD): Model: ATA ST9500420AS (scsi) Disk /dev/sdb: 500GB Sector size (logical/physical): 512B/512B Partition Table: msdos  Number  Start   End     Size    Type      File system     Flags  1      1049kB  1259MB  1258MB  primary   ntfs            boot  2      1259MB  269GB   268GB   primary   ntfs  4      269GB   483GB   214GB   extended  5      269GB   416GB   147GB   logical   ext4  7      416GB   475GB   58.9GB  logical   linux-swap(v1)  6      475GB   483GB   8470MB  logical  3      483GB   500GB   16.8GB  primary   ntfs   What I've tried so far:  1) Resizing the partitions /dev/sdb5 and /dev/sda1 to be the same size. 2) Booting into Ubuntu 11.04 (from /dev/sdb5) and running dd if=/dev/sdb5 of=/dev/sda1 (of course this causes problems with booting, so I had to reinstall grub.. I can get it to boot, but then I have problems with initrd not finding some files ... presumably it can't load some partitions I think).  Now, I think those two steps are the wrong approach, because it will clone /dev/sdb5 EXACTLY - including references in fstab which point to the wrong hard drive. I'm not sure exactly how to rectify this. I could install Ubuntu 11.04 onto the SSD, then try and copy over all of my configurations, but I'm concerned that I'm going to lose something, or that I'm going to overwrite something like fstab that points back to the original hard drive.   Note that currently, I can still boot from the HDD, so it's not imperative that I get this figured out right away, but I do want it to be exactly how it is right now, so that I can maintain my current level of productivity (it's a work laptop).  Suggestions on how I might be able to overcome this difficulty?   Thanks in advance! Is there a way to force Google Photos to recognize new faces? I have "Face grouping" enabled in my Google account and I can see around 10 faces successfully tagged when I go to my Albums. However, there's a lot of other people who are not tagged, as well as some unrecognized photos of people who are already tagged.   Is there a way to force Google Photos to run the facial recognition algorithm on a given photo, so that it adds new faces or maps a new photo to an existing face?