On my C:\ drive, the installed software takes only 3.3GB of space. The total drive space is 30GB. I do not have any restore points, nothing in my recycle bin, but still I only have 1.54GB of free space. I have even tried to "Free up disk space", (Control Panel\System and Security\Free up disk space), but still nothing. Where does the rest go to? I really need it back. Please help.  I'm on windows 7. My antivirus is 360 Total Security.
How can I visualize which folders and files are taking up all of the space on my hard drive?  I'm getting some conflicting reports on the size of hard drive contents. Namely what is and isn't there and what folders are actually using the space.   I need to know which of the files or folders the culprits behind all this hidden bloat. Also there should be a print option to get it on paper.
How do I enable or disable Apport? The system crash dialog is annoying me, how can I turn it off? I'd also like to know how to turn it back on just in case I need it to report a problem. maximize volume of triangle in given perimeter How to remove all white spaces just between brackets [] using Unix tools? What do I need to consider to choose between dSLR, mirrorless, or a compact as my first "serious" camera? Mean Value theorem problem?(inequality) I'm trying to solve this mean value theorem problem but confused where to start,     If $0&lt;a&lt;b$ prove that $(1-\frac{a}{b})&lt;\ln\frac{b}{a}&lt;\frac{b}{a}-1$   Can someone please lend me a hand? How many physical degrees of freedom does the $\mathrm{SU(N)}$ Yang-Mills theory have? The $\mathrm{U(1)}$ QED case has two physical degrees of freedom, which is easy to understand because the free electromagnetic field must be transverse to the direction of propagation. But what are the physical degrees of freedom the $\mathrm{SU(N)}$ Yang-Mills theory?   I believe that the $\mathrm{SU(N)}$ Y.M. theory has four degrees of freedom, and it is easy to see that by gauge fixing (such as the Lorentz condition or the Coulomb condition) that we can always remove one redundant degree of freedom. But then we still haven't completely fixed the redundant degrees of freedom. Thus my question is:     How many physical degrees and how many are redundant degrees of freedom does the Y.M. theory have?    I would be interested to understand how we can determine this mathematically, and also to understand what the physical intuition behind this is? How do I  prevent .xsession-errors from eating disk space? Is there any way to completely disable the .xsession-errors file?  I have it as a symlink to /tmp so that my laptop hard disk can (hopefully) go to sleep for once, but at least 95% of the stuff in the file (it fills up at about 500k an hour) is...  (nautilus:1618): GLib-GObject-CRITICAL **: g_value_get_object: assertion `G_VALUE_HOLDS_OBJECT (value)' failed  which is total garbage to me.  I have tried doing a symlink to /dev/null but that does not work (the resulting link is overwritten), and I also do not want the activity so that hopefully my laptop can go to sleep for once.  I am using Ubuntu 11.04, with no special add-ons to Nautilus. Numbering in algorithmicx I have simple code:  \documentclass{article}  \usepackage{algorithm}  \usepackage{algpseudocode}  \begin{document}  \begin{algorithm}   \caption{Examples}\label{alg:Examples}   \begin{algorithmic}[1]   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$    \end{algorithmic} \end{algorithm}          \end{document}     How to put a point after the number of the algorithm? I use chapters in report:  \documentclass[a4paper,12pt]{report}  \usepackage{algorithm}  \usepackage{algpseudocode}  \begin{document}  \chapter{Chapter 1}  \begin{equation} X_2=4 \end{equation}  \begin{algorithm}   \caption{Examples}\label{alg:Examples}   \begin{algorithmic}[1]   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$   \State $X=45$    \end{algorithmic} \end{algorithm}  \end{document}     How to change the numbering to take into account the chapters? How do you reset timers? How can I return NULL from a generic method in C#? What is the typical post processing work flow for amateur photographers? I love photography; I hate postprocessing.  Seeing that I am an amateur, not just by virtue of not getting paid for it, but also being rather new to the whole affair, I already am used to most of my shots just not being that great. While reading blogs and websites I get the impression that condensing ~100 frames in maybe a handful of shareworthy photos is not rare.  But even so, after a vacation quite a few photos have accrued. What is a common workflow to sort, post-process and share photographs for a beginner? What are common postprocessing steps? What kind of automations do people use?    Edit: I phrased the question generically so that it can be of use to as many people as possible. But I understand that without anything to go by, it might be a bit hard to answer. Therefore, while I own no paid-for software, this is what I use:   I have an EOS 500D crop camera as picture source and I use  for development,  for any touching up I need to do. (Which is not much, so far.)  (in a VM) is my photo catalog. My destination is my Flickr stream for the most part, sometimes I send photos directly to family and friends.   On the input side, I mostly am in practice mode; shooting whatever I can place in front of my lens. I have not yet picked a specialty. I would like to minimize time spent fine-tuning photos in software. These sort of "batch processes" are a part I realize is important, but not much fun to me.  I am quite computer-literate, so I am not afraid of piecing together tools that can be of use, but the more "" this can be, the more people who don't spend their life in front of a PC can benefit too. :) If spending money on something will make my life easier, I am quite willing to consider it. However as photography does not bring any income, something as large as Photoshop (for example) is somewhat hard to justify as an investment. Execute vs Read bit. How do directory permissions in Linux work? How do I choose between "as to", "on", "of", and "about"? Example where union of increasing sigma algebras is not a sigma algebra Limit point versus limit and implications for convergence I understand that similar questions to this have been asked  and  but I believe my question is different because with regards to (1) I am not asking about the set $X$ that contains the points of my sequence and with regard to (2) because I have the distinct definitions of limit and limit point in mind. That said:  My Question: My textbook, Fundamental Ideas of Analysis by Michael Reed, defines a limit point as:     Definition: Let $(a_n)$ be a sequence of real numbers. A number $d$ is called a limit point if, given $\epsilon &gt; 0$ and an integer $N$, there exists $\color{red}{\mathrm{ an }} \ n \ge N$ so that $|a_n - d| \le \epsilon$.    The definition of a limit is as follows:     Definition: We say that a sequence $(a_n)$ converges to a limit $a$ if, for every $\epsilon \ge 0$, there is an integer $N(\epsilon)$ so that $|a_n - a| \le \epsilon \color{red}{\text{  for all  }} n \ge N$.    From these definitions, and given this question:     If a sequence converges it has exactly one limit point. Is the converse true? If not, provide a counterexample   Can I conclude that the converse is indeed true simply by appealing to the definitions, or do I need a tighter proof. And if I do, I'm a little stuck on how to refine this proof. I was looking at the decomposition of Fibonacci numbers using the definition of $F_n = F_{n-1} + F_{n-2}$, and noted the pattern in the coefficients of the terms were Fibonacci numbers. It appears to hold, and I believe it's true, but I haven't seen a proof for it. Does one exist?  $F_n = 1F_{n-1} + 1F_{n-2}$ $F_n = 2F_{n-2} + 1F_{n-3}$ $F_n = 3F_{n-3} + 2F_{n-4}$ $F_n = 5F_{n-4} + 3F_{n-5}$ etc  This can be generalized to $F_n = F_xF_{n-(x-1)}+F_{x-1}F_{n-x}$ Render just part of a final image from Cycles? Why does factoring eliminate a hole in the limit? tcolorbox Spanning Two Columns in {paracol} Environment The paracol environment allows figures to span two columns by using an asterisk in the figure's environment declaration: \begin{figure*} ... \end{figure*}.  I'm not familiar with the guts of why that works, and I was curious to know if there's something analogous for an environment derived from tcolorbox (like \newtcolorbox{NewBox}[1][!htbp]{...float=#1}). That is, in this example, can I get a NewBox that spans both paracol columns the way I wrongly assumed \begin{NewBox*} ... \end{NewBox*} would.  PS The tag below is "parcolumns" because I don't have a high enough reputation to create the tag 'paracol' (in reference to this CTAN package: ) When is a gerund supposed to be preceded by a possessive adjective/determiner?