Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: How should Perlmonks deal with Plagiarism?

by johngg (Abbot)
on Oct 08, 2006 at 17:53 UTC ( #577014=note: print w/ replies, xml ) Need Help??

in reply to How should Perlmonks deal with Plagiarism?

++ liverpole for bringing this distasteful matter into the open. ++ chargrill for the extra detective work. I find on reading the nodes that I upvoted several of them which is doubly annoying as, having cast my vote already, I can't downvote them as I would have had I known they were ripped off. Thus, IMHO, for every +ve vote two should be taken away.

"Keep pouring your downvotes"



Comment on Re: How should Perlmonks deal with Plagiarism?

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://577014]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (8)
As of 2015-12-01 08:18 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (796 votes), past polls