Stackoverflow continues to suffer from a quality problem. I don't think any amount of policing can solve the problem. Stuff may get cleaned up, but there's still a ton of garbage temporarily for me to see. No matter how fast the street sweepers go, when I look outside, there's still litter to see.  The real problem is that users that drive by and ask questions are not invested in the site. Not even a little. They want their answer, and there's enough smart reputation starved psychic debuggers out there to figure out there problem for them. We've massed an army of awesome super programming ninja. However, there's hordes of barbarians at the frontier. We know there's like 99 bad wanna-be can't fizz-buzz programmers out there for every competent programmer. We can't win a war of attrition with them. There's just too many bad programmer barbarians at the frontier of our Civilization to make a dent with moderation, down-voting, etc.  What we really want is question askers who are going to be invested in the community. People who, despite their newb status, want to learn and get better. We want people who don't just want their current problem solved, they want to make themselves better programmers.  I think we've reached the point where to participate, you have to prove your worth or at least interest to the community somehow. This is unabashably the Starship Troopers model of Stack Overflow. Force people to contribute before they take away. I think its a good model. If we don't do something, this is just going to devolve into the dead newsgroups of yore. Lots of newbs and lots of moderators. And nobody else. The true meat of society -- artisans, craftspeople, etc -- having long left the festering ruins for others to pick over. Because nobody cares about worrying about moderating every question (they just want to have fun providing answers). If the inside baseball takes over, then we're doomed.  I propose that a questioner on StackOverflow should have had to prove themselves to the community. The simplest way to do this is to require they answer a question and get it upvoted by somebody before they can ask questions. Maybe we should actually enforce a required amount of rep before a question can be asked. Maybe some rep on another, lower traffic SE site would be sufficient to prove some investment. Maybe there's other ideas I haven't thought of...  I'm wondering if I'm way off the mark? What are your thoughts?
I have used the websites of SO a lot the past few months because I am busy with a large scale web project. I feel I get better answers here on SO than when I just do a Google search, maybe because I can be more specific here with my problem, and the responses are really fast.  Occasionally when I am not working I try to answer some questions, but the question almost always has an answer which is 'as good as' or 'better' than the answer I would supply.  So my question/answer ratio is about 20/1 something, if not more. When I look at my profile page I see a bucket-load of questions and almost nothing I answered myself.  Is this considered bad behaviour? I can see that this looks a little egoistic.  : One devoted to one's own interests and advancement.
How would I change file permissions if the file name has a space in it in linux I would like to know how would I rename and change file permissions of a file that contains a space in the name on Linux.  Example  The name of my file is: my file   I have tried mv my%20file my_file  I have also tried chown -R 755 my%20file  but both of these don't work! Netgear WNA3100 wifi dongle not recognized Using (or not) the word "to" in a sentence ending with "be able" Predict() - Maybe I'm not understanding it Verbatim in beamer showing error: "File ended while scanning use of \@xverbatim." I am using Texmaker and MiKTeX on Windows 7. I have the following beamer code,  \documentclass{beamer} \theme{AnnArbor} \begin{document} \begin{frame} \begin{verbatim}     \begin{frame}[&lt;alignment&gt;]    \frametitle{Frame Title Goes Here}    Frame body text and/or LATEX code    \end{frame}  \end{verbatim} \end{frame} \end{document}   I was expecting the following output,         \begin{frame}[&lt;alignment&gt;]        \frametitle{Frame Title Goes Here}        Frame body text and/or LATEX code        \end{frame}   But instead I got the following Error Message,  File ended while scanning use of \@xverbatim.   Can any one please point out the error here. As far as I know verbatim can have anything inside it.  Also when I tried the following code,  \begin{verbatim}  \ begin{frame}[&lt;alignment&gt;]  \frametitle{Frame Title Goes Here}  Frame body text and/or LATEX code  \ end{frame} \end{verbatim}   I got the following output,      \ begin{frame}[&lt;alignment&gt;]      \frametitle{Frame Title Goes Here}      Frame body text and/or LATEX code     \ end{frame}   But I don't want space between \ and begin and \ and end. JSonNet boolean serialization How do I calculate the closest power of 2 or 10 a number is? What is the most efficient way to cacluate the closest power of a 2 or 10 to another number? e.g.  3.5 would return 4 for power of 2 and 1 for power of 10  123 would return 128 for power of 2 and 100 for power of 10  0.24 would return 0.25 for power of 2 and 0.1 for power of 10  I'm just looking for the algorithm and don't mind the language. Proving that $AB-BA=cI$ for nontrivial $c \in \mathbb{C}$ I have a homework question I can`t solve:  Let $X$ be a normed linear space, $A,B \in B(X)$. Show that there exists no nontrivial $c \in \mathbb{C} $ such that $AB-BA=cI$.  Thanks alot already guys! I seem to have a professor who gives impossible homework problems.  The hint he gave: $A^{n}B-BA^{n}=ncA^{n-1}$, $n \in \mathbb{N}$ Mean Time to Failure (MTTF): When disk manufacturers post this, how should you interpret their numbers? Mean Time to Failure (MTTF) is usually given in terms of hours, and by doing some calculations, it seems that a disk should fail only after a good number of years have gone by.  It seems that disks need repair more often than that. Does anyone know why this is so?  I figured that there is something fishy about this metric. Am interpreting something wrong here? How can I evaluate $\sum_{n=0}^\infty(n+1)x^n$? After Google Play Service update to version 13 I got an error Urdu language not listed in my ubuntu 16.04 LTS I am a new user of Ubuntu 16.04 LTS. To my surprise it does not have Urdu Language in language support widow. Kindly help.   The given answer to  is not helping me. GCD in a PID persists in extension domains Is there a nice solution to get a "presenter mode" for Latex presentations? I really like the way Keynote and MS Office (and also OpenOffice &amp; similar) support a presentation mode that displays the current slide, the next (and maybe previous) slide, the elapsed and current time, and also any notes attached to the slides on one screen and the presentation itself on the beamer/second screen.  It enables me to give good, professional presentations without having to know everything by heart (I suck at that).  I found a , but I am looking for alternatives, especially OS-independent would be great. Not having to create 3 different PDFs is a boon.  Any hints? How many ways can the average of n dice be a? How to find all the subclasses of a class given its name? In the movie Iron Man 2, Tony Stark figured out how to synthesize Vibranium. Why didn't he use it to make a new Iron Man armor? Partial Sums of Geometric Series Prove $\sum_{i=1}^n i! \cdot i = (n+1)! - 1$? Prove the summation:  $$\sum_{i=1}^n i! \cdot i = (n+1)! - 1$$ using induction.   base case:  $n=1$: \begin{align*} \sum_{i=1}^1 i! \cdot i &amp;= (1+1)! - 1 \\ 1 &amp;= 2 - 1 \\ 1 &amp;= 1 \end{align*}   This is a question from my test review packet, currently have the base case completed and I am a bit lost on where to go from there. Any help/hints are appreciated. Per the kernel documentation:  This control is used to define how aggressive the kernel will swap memory pages.  Higher values will increase aggressiveness, lower values decrease the amount of swap.   However this is kind of vague. I'm trying to figure out exactly what the parameter ultimately controls. I know it adjusts how aggressively the kernel tries to swap out pages, but what decision making process in the kernel code does it affect?  Does it adjust how long ago a page must have been accessed before the kernel swaps it out? If so what does the default value of 60 represent? And how much is changed by a increment/decrement of 1 (a formula would be nice)? Or does it swap out pages based on their access frequency? Or something else?