windows folder size more than 30 GB
My windows directory is huge
Sending Text Cross Domain By Bookmarklet What's a way to implement a flexible buff/debuff system? I had an article, but I lost it.  It showed and described a couple of C/C++ tricks that people should be careful. One of them interested me but now that I am trying to replicate it I'm not being able to put it to compile.  The concept was that it is possible to change by accident the value of a const in C/C++  It was something like this:  const int a = 3;          // I promise I won't change a const int *ptr_to_a = &amp;a; // I still promise I won't change a int *ptr; ptr = ptr_to_a;  (*ptr) = 5;               // I'm a liar; a is now 5   I wanted to show this to a friend but now I'm missing a step.  Does anyone know what's missing for it to start compiling and working?  ATM I'm getting invalid conversion from 'const int*' to 'int*' but when I read the article I tried and it worked great. How do I survive in the Underworld? How do you survive the underworld with max health, an amethyst staff and a godly ice blade? I always die from the enemies and hellstone, but all the enemies are a bit stupid because they stay away from you (demons and fire imps do it). I always enter hell and land on hellstone (there is a  hellstone brick building under my hell-evator). I just die in the first 10 seconds. It's a bit annoying. How to express trigonometric equation in terms of of given trigonometric function? Train loss and accuracy In theory, is it possible that the loss on the train set will increase together with the train set accuracy? (in the normal case the train set loss should go down) And vice versa, can the train loss decrease along with the accuracy?   Note: This is obviously different than the classic underfit / overfit cases which are easier to grasp. How much marmelade can I bring into the US? I want to bring homemade berry marmelade in little glass jars with me to the US from Europe as gifts for friends. I have found the following site on importing foods into the US  and would assume that marmelade falls under the condiments category, which should be admissible. However, I am wondering however if there is any limit to how much one is allowed to bring. Will there be any issues if, say, I bring 3 kilograms (6 lbs 10 oz)?   Also on related note, would they be suspiscious when they see many glass jars in my bag? Do I risk getting my bag searched or getting asked what the jars are? Is there anything I can do to avoid any such trouble? Make mod_wsgi use python2.7.2 instead of python2.6? i am running Ubuntu 10.04.1 LTS  and it came pre-packed with python2.6 but i need to replace it with python2.7.2.   (The reason is simple, 2.7 has a lot of features backported from 3 )  i had installed python2.7.2 using  ./configure make make altinstall   the altinstall option installed it, without touching the system default version, to /usr/local/lib/python2.7 and placed the interpreter in /usr/local/bin/python2.7  Then to help mod_wsgi find python2.7 i added the following to /etc/apache2/sites-available/wsgisite  WSGIPythonHome /usr/local   i start apache and run a test wsgi app BUT i am greeted by python 2.6.5  and not Python2.7  Later i replaced the default python simlink to point to python 2.7  ln -f /usr/local/bin/python2.7 /usr/bin/python   Now typing 'python' on the console opens python2.7 but somehow mod_wsgi still picks up python2.6  Next i tried,  PATH=/usr/local/bin:$PATH export PATH   then do a quick restart apache, but yet again its python2.6 !!    Here is my $PATH  /usr/local/bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games   contents of /etc/apache2/sites-available/wsgisite  WSGIPythonHome /usr/local   &lt;VirtualHost *:80&gt;      ServerName wsgitest.local     DocumentRoot /home/wwwhost/pydocs/wsgi     &lt;Directory /home/wwwhost/pydocs/wsgi&gt;         Order allow,deny         Allow from all     &lt;/Directory&gt;      WSGIScriptAlias / /home/wwwhost/pydocs/wsgi/app.wsgi  &lt;/VirtualHost&gt;   app.wsgi  import sys  def application(environ, start_response):     status = '200 OK'     output = sys.version      response_headers = [('Content-type', 'text/plain'),                         ('Content-Length', str(len(output)))]     start_response(status, response_headers)      return [output]   Apache error.log  'import site' failed; use -v for traceback [Sun Jun 19 00:27:21 2011] [info] mod_wsgi (pid=23235): Initializing Python. [Sun Jun 19 00:27:21 2011] [notice] Apache/2.2.14 (Ubuntu) mod_wsgi/2.8 Python/2.6.5 configured -- resuming normal operations [Sun Jun 19 00:27:21 2011] [info] Server built: Nov 18 2010 21:20:56 [Sun Jun 19 00:27:21 2011] [info] mod_wsgi (pid=23238): Attach interpreter ''. [Sun Jun 19 00:27:21 2011] [info] mod_wsgi (pid=23239): Attach interpreter ''. [Sun Jun 19 00:27:31 2011] [info] mod_wsgi (pid=23238): Create interpreter 'wsgitest.local|'. [Sun Jun 19 00:27:31 2011] [info] [client 192.168.1.205] mod_wsgi (pid=23238, process='', application='wsgitest.local|'): Loading WSGI script '/home/wwwhost/pydocs/$ [Sun Jun 19 00:27:50 2011] [info] mod_wsgi (pid=23239): Create interpreter 'wsgitest.local|'.   Has anybody ever managed to make mod_wsgi run on a non-system default version of python ? Software to draw illustrative figures in papers I would like to have suggestions of good software for drawing illustrations in research papers. I already know about , but this works only on Linux and is at times, clunky when it comes to text. Moreover the resolution is not always perfect making it difficult to manoeuvre the objects. Besides it is tough to learn and master, with all its weird click procedures.   I would love to know about better alternatives. Not talking about graphs here, just block diagrams and explanatory illustrations. I have a problem understanding the proof of Rencontres numbers (Derangements) I understand the whole concept of Rencontres numbers but I can't understand how to prove this equation  $$D_{n,0}=\left[\frac{n!}{e}\right]$$  where $[\cdot]$ denotes the rounding function (i.e., $[x]$ is the integer nearest to $x$). This equation that I wrote comes from solving the following recursion, but I don't understand how exactly the author calculated this recursion.  $$\begin {align*}  D_{n+2,0} &amp; =(n+1)(D_{n+1,0}+D_{n,0}) \\ D_{0,0} &amp; = 1 \\ D_{1,0} &amp; = 0  \end {align*} $$ So what I'm looking for here is something like PHP's  function.  This is so I can debug my scripts by seeing what's the state of the object in question. Vertically center contents of table cell Consider the following example:  \documentclass{article}  \usepackage{pstricks-add} \usepackage{booktabs}   \psset{   unit = 0.7,   dimen = middle,   ticks = none,   labels = none }  \newcommand*\pind[2]{%  \psset{linecolor = red}   \psline(#1,0)(#1,#2)   \psline(!#1 0.2 sub #2)(!#1 0.2 add #2) } \newcommand*\enkeltobservationer{%   \begin{pspicture}(-0.5,-0.2)(5.9,6.3)     \psaxes{-&gt;}(0,0)(-0.2,-0.2)(5.4,5.5)[\small{$x$},0][\small{$h(x)$},90]     \pind{0.5}{3}     \pind{1.0}{5}     \pind{1.5}{3}     \pind{2.0}{3}     \pind{2.5}{4}     \pind{3.0}{2}     \pind{3.5}{5}     \pind{4.0}{1}     \pind{4.5}{4}     \pind{5.0}{2}   \end{pspicture}% } \newcommand*\soejle[2]{%  \psset{fillcolor = red}   \psframe[fillstyle = solid](!#1 0.5 sub 0)(#1,#2) } \newcommand*\intervaller{%   \begin{pspicture}(-0.5,-0.2)(5.9,6.3)     \psaxes{-&gt;}(0,0)(-0.2,-0.2)(5.4,5.5)[\small{$x$},0][\small{$h(x)$},90]     \soejle{0.5}{3}     \soejle{1.0}{5}     \soejle{1.5}{3}     \soejle{2.0}{3}     \soejle{2.5}{4}     \soejle{3.0}{2}     \soejle{3.5}{5}     \soejle{4.0}{1}     \soejle{4.5}{4}     \soejle{5.0}{2}   \end{pspicture}% }   \begin{document}  \begin{table}  \centering   \begin{tabular}{l c c c}     \toprule      Begreb               &amp;      Forkortelse          &amp;      Enkeltobservationer  &amp;      Intervaller            \\      \midrule      Hyppighed            &amp;      $h(x)$               &amp;      \enkeltobservationer &amp;      \intervaller           \\     \bottomrule    \end{tabular} \end{table}  \end{document}     I would like to vertically center Hyppighed and $h(x)$ relative to the figures; how do I do that? Let $G$ be a group and $H$ be a subgroup of $G$ of index $2$ .Then show that if $a,b\notin H$ then $ab\in H$. Let $G$ be  a group and $H$ be a subgroup of $G$ of index $2$ .Then show that if $a,b\notin H$ then $ab\in H$.   $a,b\notin H\implies aH,bH\neq H\implies $ $aH=bH$  since $H$ has only two distinct left cosets in $G$.  $\implies a^{-1}b\in H$  How to show that $ab\in H$ from here? The question at hand is:  "Two capacitors of capacitances $C_1$ and $C_1$ have charge $Q_1$ and $Q_2$. How much energy, $\Delta w$, is dissipated when they are connected in parallel. Show explicitly that $\Delta w$ is non-negative."  I'm confused about what the physical situation is. I took the assumption that these capacitors were somehow pre-charged, and then connected to each other in parallel without a voltage source. However, I don't understand how this would work. If a circuit is composed of only 2 elements, I don't see how they could be in any arrangement but series. Nevertheless, I tried solving it that way:  Two capacitors in parallel have the same voltage drop. Charge will be redistributed to make it the same voltage for both. Let $Q_1'$ and $Q_2'$ be the charges on the capacitors after they are connected. Now, picture the equivalent capacitor  $C_{eq} = C_1 + C_2 =$ $\frac{Q_1' + Q_2'}{V_f}$   conservation of charge:  $Q_1' + Q_2'= Q_1 + Q_2$,        $C_{eq} =$ $\frac{Q_1 + Q_2}{V_f}$  $V_f = $$\frac{Q_1 + Q_2}{C_1 + C_2}$  The initial energy of the capactiors is:  $U_0 = $$\frac{Q_1^2}{2C_1}$$+\frac{Q_2^2}{2C_2}$  $U_f = $$\frac{1}{2}$$(C_1 + C_2)V_f^2 = $$\frac{(Q_1 + Q_2)^2}{2(C_1 + C_2)}$  $\Delta U$$ = $$\frac{(Q_1 + Q_2)^2}{2(C_1 + C_2)}$-$\frac{Q_1^2}{2C_1}$$-\frac{Q_2^2}{2C_2}$  However, I don't see how this is necessarily non-negative. Is true that $\sum_{k=1}^n\frac{[kx]}{k}\leq[nx]$, for every $x\in\mathbb{R}$ and for every $n\in\mathbb{Z}^+$? Is true that $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]$, for every $x\in\mathbb{R}$ and for every $n\in\mathbb{Z}^+$?  My work:  Let $x\in\mathbb{R}$ be given. For every $k=1,\dots,n$, define $i_k\in\{0,1,\dots,k-1\}$ such that  $$ [x]+\frac{i_k}{k}\leq x&lt;[x]+\frac{i_k+1}{k}\hspace{20mm} (*). $$  On one hand, we have that $[kx]=k[x]+i_k$ for every $k=1,\dots,n$.  So  $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}=n[x]+\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}=[nx]+\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}-i_n$  Thus  $$\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]\Leftrightarrow\displaystyle\sum_{k=1}^n\dfrac{i_k}{k}\leq i_n\,.$$  On the other hand, from $(*)$ is direct that $i_k=[k(x-[x])]$. Thus  $$\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]\Leftrightarrow\displaystyle\sum_{k=1}^n\dfrac{[k(x-[x])]}{k}\leq [n(x-[x])]\,.$$  In other words, we can assume that $x\in[0,1)$.   Now the questions is:  Is true that $\displaystyle\sum_{k=1}^n\dfrac{[kx]}{k}\leq[nx]$, for every $x\in[0,1)$ and for every $n\in\mathbb{Z}^+$?  Any simpler approach? Any thoughts? We want to find the solution $x$ to the congruence system  $$\begin{align} x &amp;\equiv r_1 \!\!\!\pmod{\!m_1}\\ x &amp;\equiv r_2 \!\!\!\pmod{\!m_2}\end{align},\ \ {\rm where}\ \  \gcd(m_1, m_2) = 1$$  These can be rewritten as  $$\begin{align} x &amp;= r_1 + m_1 j\\ x &amp;= r_2 - m_2k\end{align}$$  for unknown integers $j, k$. So we set those two equations as equal and rearrange them to  $$m_1j + m_2k = r_2 - r_1$$  Now assume we perform $\text{egcd}(m_1, m_2)$, which gives us the solution to  $$m_1u + m_2v = \gcd(m_1, m_2)$$  Let the integer $\,h\,$ make $\,h \gcd(m_1, m_2) = r_2 - r_1$.  Then $\qquad hm_1u + hm_2v = h\gcd(m_1, m_2) =  r_2 - r_1 = m_1j + m_2k$  At this point I am lost because I don't think we can just assume  $hm_1u = m_1j$ and extract $j = hu$.   How do I get the values of $j$ or $k$ so I can get the value of $x$? Given that   $x^x = y$; and  given some value for $y$   is there a way to expressly solve that equation for $x$? Prevent abstract environment to reset pagenumbering GRUB doesn't show Windows 10 Whenever I boot into my system, Linux directly boots. If I press shift, GRUB shows only Linux, not Windows. Here are results of fdisk and update-grub. I think I have installed Linux the wrong way.  $ fdisk WARNING: GPT (GUID Partition Table) detected on '/dev/sda'! The util fdisk doesn't support GPT. Use GNU Parted.   Disk /dev/sda: 1000.2 GB, 1000204886016 bytes 255 heads, 63 sectors/track, 121601 cylinders, total 1953525168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes I/O size (minimum/optimal): 4096 bytes / 4096 bytes Disk identifier: 0x00000000     Device Boot      Start         End      Blocks   Id  System /dev/sda1               1  1953525167   976762583+  ee  GPT Partition 1 does not start on physical sector boundary.  $ update-grub Generating grub configuration file ... Warning: Setting GRUB_TIMEOUT to a non-zero value when GRUB_HIDDEN_TIMEOUT is set is no longer supported. Found linux image: /boot/vmlinuz-3.19.0-32-generic Found initrd image: /boot/initrd.img-3.19.0-32-generic Found memtest86+ image: /boot/memtest86+.elf Found memtest86+ image: /boot/memtest86+.bin   No volume groups found done Headless linux install