I submitted a question on Stackoverflow:   Googling last night, I came across this post:   1) Why is my question on another site  2) Did I sign up for my information (even though it is only a question) to be shared with other forum communities on sites?  I might be missing the point here..
of Stack Overflow, all content posted on Stack Exchange sites by their users (i.e. you wonderful people) has been provided to the whole universe under . For my fellow non-lawyers, that license basically means:   Anyone can use any Stack Exchange posts at any time without having to ask for permission Making money off of the copied content is permitted You don't even have to copy stuff from here verbatim; you can just use it as a starting point and make whatever edits you want There are just two rules you have to follow:   You have to provide . Simple links to the original post and author info are just fine. You have to  and allow other people to use your content, as long as they follow these very same rules. How meta!    (If you ever forget any of that, and want to refresh your memory, the license info is linked to in the footer of every page.)  There are, in fact, a lot of people who republish varying amounts of our content for assorted reasons. Unfortunately, there are some Stack Content Republishers Attributing Poorly and/or Excelling at Ranking (SCRAPERs, for short).  In this context, "attributing poorly" means any use that doesn't follow our attribution rules or make any other reasonable attempt at give credit. This can get pretty egregious; I've seen SCRAPERs that not only don't link back to SE originals, but also use fake author info and post dates to make it harder to find originals. By "excelling at ranking," I'm referring to copycat sites that end up higher in Google results than the original SE sites do for the same content. That's not necessarily wrong, but in some cases, it indicates inappropriate SEO hackery.  So, the question is: what can you do if you spot a SCRAPER?
Why was this very low quality flag declined? Question (since closed and deleted): . I know about the  of VLQ flags, and I can't fathom why anyone would think that question wouldn't be a candidate for removal.  Question text, for posterity:     Hey I want a Cyrus beck line algorithm program in c or c++. I have   searched a lot but hadn't got anything over Web..!!      If anyone of you have Program please give it to me and help me out.      Thank you in advance :)   I find  not compelling because it requires me to accept the premise that this question was not "unlikely to be salvageable". In counting degrees of freedom of a linear molecule, why is rotation about the axis not counted? Adding a reference between Eclipse Java projects What should I look for when buying chain lube / lubricant? In the past, I personally have only used WD-40.   However, I have occasionally had my bicycle looked over at the locally run, free service sessions and most of the mechanics there use a hand applied type of greasy gel (I forget the name).  Questions:   Is WD-40 suitable for bicycle chains? Would alternatives provide better chain longevity? When shopping around for lubricant, what are the most important things to look for? What do you use and why?  (optional added extra) Any tips for reducing chain wear? Is it possible to exclude questions I've already answered from the search criteria? Why singularity in a black hole, and not just "very dense"? Why does there have to be a singularity in a black hole, and not just a very dense lump of matter of finite size? If there's any such thing as granularity of space, couldn't the "singularity" be just the smallest possible size? Test to see if the title length requirement can be circumvented by appending lots of dots. Understanding relation between Quotient Space and $S^1$ There is this example at the Wikipedia article on Quotient spaces (QS):     Consider the set $X = \mathbb{R}$ of all real numbers with the ordinary topology, and write $x \sim y$ if and only if $x−y$ is an integer. Then the quotient space $X/\sim$ is homeomorphic to the unit circle $S^1$ via the homeomorphism which sends the equivalence class of $x$ to $\exp(2πix)$.   I understand relations, equivalence relation and equivalence class but quotient space is still too abstract for me. This seems like a simple enough example to begin with.  I understand (sort of) the definition but I can't visualize. And by this example and others, there is a lot of visualizing going on here! torus, circles etc. Left-align all equations in a block align environment without any explicit alignments points (given by &amp;) right justifies the equations in the block. They can be left justified by putting &amp; at the beginning of each equation. Is there any way to left justify them without starting &amp;-s? Maybe some special environment or option? It seems to be an extra work to tell the compiler again and again that I want left alignment on each line. Finding basis of $\mathbb{Q}(\sqrt{2},\sqrt{3},\sqrt{5})$ over $\mathbb{Q}$ Robust method to extract "pure" part of a variable I am trying to perform a multi linear regression model:  $$y_i = β_0 + β_1x_{i1} + β_2x_{i2} +... + β_px_{ip} + ε_i$$  where $$x_{i1}, x_{i2}, ..., x_{ip}$$ are highly correlated with each other (VIFs can be as low as 5 and high as 30).  I am just wondering if there exists a procedure with the following properties:  1) extracts the pure part of each independent variable, where pure is defined as a part of the variable which is uncorrelated with other variables.  2) the pure part and the original variable should be similar to each other, whether similar is defined as moments such as mean and variance and correlation coefficient (ideally >0.90) If I build a package from source how can I uninstall or remove completely? n tasks assigned to n computers, what is the EX value of a computer getting 5 or more tasks? Say a central server assigns each of n tasks uniformly and independently at random to n computers connected to it on a network. Say a computer is ‘overloaded’ if it receives 5 or more tasks.  Q: Calculate the expected number of overloaded computers.  I thought of doing [1 - Pr(a computer is not overloaded)] but that leads me to a complicated expression of: $$1 - PR(NotOver) = 1 - \sum_{i=0}^4  \left( \frac{1}{n} \right)^{i} { \left( \frac{n-1}{n} \right)}^{n-i}$$ multiplying this by n would(hopefully) give the Expected value. But the answer seems not very elegant atall, is there something I'm missing or an easier way to tackle this? Thanks! The error message is :the grub-efi-amd64-signed package failed to install into /target/. Without the GRUB bootloader the system will not boot  I'm trying to install on HP pavilion g6-2303 TX using USB.  How do I fix this problem? NSWindow Mac App Store like Title Bar When should I make explicit use of the `this` pointer? Repeat command n times? Is it possible to define a command, which repeats the following command n-times? Call it for example \Repeat, then   \Repeat[4] \command{...}    should be equivalent to   \command{...} \command{...} \command{...} \command{...} The dimension of the Hilbert space is determined by the number of independent basis vectors. There is a infinite discrete energy eigenbasis $\{|n\rangle\}$ in the problem of particle in a box which can be used to expand a general state $|\psi\rangle$ as: $$|\psi\rangle=\sum\limits_{n=0}^{\infty} C_n |n\rangle$$ Here, the basis implies that the Hilbert space has countably infinite number of basis vectors. But one could well expand $|\psi\rangle$ in any other basis as well, say the continuous position basis. Then that superposition, $$|\psi\rangle=\int dx \psi(x)|x\rangle$$ is also possible. But this basis $\{|x\rangle\}$ is continuous and uncountably infinite. Such sets cannot be equal because they have different cardinality. Then my questions is how many independent basis vectors are really there in this Hilbert space? How to find the number of automorphisms on $\mathbb Z_2\times \mathbb Z_4$ Well, I was trying find out the number of group homomorphisms from $U(20)$ onto $U(15)$ which I reduce to the problem of finding the number of automorphisms for $\mathbb Z_2\times \mathbb Z_4$. But don't know how shall I proceed.   Any help will be appreciated. Using natural deduction to prove that $p \implies q \vdash \lnot p \lor q$ Using only rules of natural deduction, I am trying to prove that $$p \implies q \vdash \lnot p \lor q$$ but am having a lot of difficulty. I was able to prove the other direction.   Could anyone show me or point me to the right direction?