https://en.wikipedia.org/w/api.php?action=feedcontributions&feedformat=atom&user=C-processorWikipedia - User contributions [en]2025-06-09T19:11:38ZUser contributionsMediaWiki 1.45.0-wmf.4https://en.wikipedia.org/w/index.php?title=User_talk:Dcoetzee&diff=388434911User talk:Dcoetzee2010-10-03T08:45:33Z<p>C-processor: /* When making changes to scientific articles you have to understand the subject */</p>
<hr />
<div>'''Archives:'''<br />
<br />
* [[User talk:Dcoetzee/Archive 2007 2 21|2003 &ndash; 2007/2/21]]<br />
* [[User talk:Dcoetzee/Archive 2009 4 15|2007/2/22 &ndash; 2009/4/15]]<br />
* [[User talk:Dcoetzee/Archive 2009 9 8|2009/4/16 &ndash; 2009/9/8]]<br />
<br />
==Yes, already==<br />
Hi. There's a question at MCQ that I'm worried is going to archive without answer. Can you help or point me to somebody who might? [[Wikipedia:Media copyright questions#Okay use or derivative work?]] --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:48, 8 November 2009 (UTC)<br />
:Done, hope it helps. :-) [[User:Dcoetzee|Dcoetzee]] 07:14, 9 November 2009 (UTC)<br />
::Thank you! And here I am again, cluttering your clean page. It looks like [[WP:CCI]] may go live soon. I've got a question about the ContributionSurveyor program at [[Wikipedia_talk:Contributor_copyright_investigations#A_couple_of_questions|its talk page]]. Your input, I expect, would be invaluable. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 18:58, 9 November 2009 (UTC)<br />
:::Hmm, could you point me to the specific question? I didn't spot it. Maybe you linked to the wrong section? Thanks. :-) [[User:Dcoetzee|Dcoetzee]] 06:15, 15 November 2009 (UTC)<br />
<br />
==[[Wikipedia:Article Rescue Squadron]] invitation==<br />
I loved your article [[Wikipedia:Criteria for speedy deletion/Overturned speedy deletions]] and mentioned it here: [[Wikipedia talk:Article_Rescue Squadron#Speedy deletion open request for comment and pages]] How did you gather that information from the [http://en.wikipedia.org/w/index.php?title=Special%3ALog&type=delete&user=&page=&year=&month=-1 deletion log]? What tools did you use? Please give me as much details as possible, because I would love to mimic your study. <br />
<br />
You maybe interested in a project I am a member of.<br />
<br />
{| style="border-spacing:2px; margin:0px" width="100%" <br />
{| class="MainPageBG" style="width: 55%; border:1px solid #FCF2D9; background-color:#FFF; color:#FFF;font-size: 90%"|<br />
{| width="100%" cellpadding="2" cellspacing="5" style="background-color:#E2E7FF"<br />
! <div style="margin: 0; background-color:#F4F7FA; border:1px solid red; text-align:left; color:#082840; padding-left:0.4em; padding-top: 0.4em; padding-bottom: 0.4em; padding-right: 0.4em;">[[File:Barnstar search rescue.png|left|70px|WikiProject Article Rescue Squadron]] Hello, Dcoetzee.<br>You have been invited to [[Wikipedia:ARS#How to become a member of Article Rescue Squadron|join]] the [[WP:ARS|Article Rescue Squadron]], a collaborative effort to rescue articles from deletion if they can be improved through regular editing. <br>For more information, please visit the [[Wikipedia:Article Rescue Squadron|project page]], where you can [[Wikipedia:Article_Rescue_Squadron/Members#All_Members|>> join <<]] and help rescue [[:Category:Articles tagged for deletion and rescue|articles tagged for deletion and rescue]]. [[User:Ikip|Ikip]] ([[User talk:Ikip|talk]]) 06:24, 13 November 2009 (UTC)<br />
|}</div><br />
<!--Template:Article Rescue Squadron invite--><br />
<br />
<br />
[[User:Ikip|Ikip]] ([[User talk:Ikip|talk]]) 06:24, 13 November 2009 (UTC)<br />
:{{wikithanks|Thank you for your response on [[Wikipedia talk:Article Rescue Squadron]], I was afaid you would say "manually" [[User:Ikip|Ikip]] ([[User talk:Ikip|talk]]) 19:57, 16 November 2009 (UTC)}}<br />
<br />
==Copyright problems?==<br />
Hi. [[Interceptor pattern]] is tagged as a copyvio of [http://www.cs.uu.nl/docs/vakken/no/interceptor.pdf], apparently based on the tables. I'm not able to assess the creativity of that material, hence its usability. Can you take a look? On a related note, there is an outstanding section on whether "instruction sets" are copyrightable at [[Wikipedia_talk:CP#Copyrightable.3F|WT:CP]]. Um, ? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:13, 14 November 2009 (UTC)<br />
:Hey. :-) It looks like a clear copyvio to me. Compare page 8 of the slides with the intro paragraph. To a lesser extent page 16 resembles the second paragraph. The example is also clearly lifted directly from the slides - compare pages 23-28 to the code in example section, they're identical. I'll comment on CP. :-) [[User:Dcoetzee|Dcoetzee]] 06:28, 15 November 2009 (UTC)<br />
==Commons deletion debate?==<br />
Hi. Has [[:Commons:Commons:Deletion requests/File:Azerbaijan Navy.jpg|this one]] been archived without closure, do you think? It's been sitting there for an awfully long time. :/ --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:40, 23 November 2009 (UTC)<br />
:Nope. Commons always has a really long deletion backlog. See [[:Commons:Commons:Deletion requests/2009/08/13]]. I should probably help clean it up sometime. :-) [[User:Dcoetzee|Dcoetzee]] 18:25, 24 November 2009 (UTC)<br />
<br />
==WP:CANVASS addition==<br />
<br />
Hi there. Regarding your addition to [[WP:CANVASS]] [http://en.wikipedia.org/w/index.php?title=Wikipedia:Canvassing&curid=7406238&diff=328712745&oldid=328640971 here], I agree with this addition. Good thinking, and good phrasing. [[User:Tanthalas39|<font color="#CC7722" face="Papyrus">'''Tan'''</font>]] &#124; [[User talk:Tanthalas39|<font color="#21421E" face="Papyrus">39</font>]] 02:25, 30 November 2009 (UTC)<br />
:Thanks! It was just a thought that crossed my mind while reading it and it seemed uncontroversial. Hopefully it'll prove to be so. [[User:Dcoetzee|Dcoetzee]] 11:13, 30 November 2009 (UTC)<br />
<br />
==Derivative work?==<br />
[[:File:SCPA Historical Marker.PNG]]? (being all pithy :)) If so, what to do? PUF? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 20:54, 1 December 2009 (UTC)<br />
:Hey. :-) That's almost certainly unfree. It's created by the state government of Ohio, which does not typically release its work into the public domain. It's in the US, where there is no freedom of panorama, so we're violating the copyright of the designer of the sign. Additionally, the text on the sign is legible and extensive, so we're violating the copyright of the writer (and this would probably apply even in a typical nation with FoP). I'd take it to PUF just because it's sufficiently complicated, but it seems like a sure delete to me. [[User:Dcoetzee|Dcoetzee]] 01:34, 2 December 2009 (UTC)<br />
::Thank you. I'll talk to the image uploader first, about potentially G7ing it. We're in communication about some pretty extensive text issues at the moment. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:41, 2 December 2009 (UTC)<br />
<br />
==Yes, another question==<br />
I'm trying to figure out PD status of some images that were published in a 1932 book. The initial conversation is at [[User_talk:Moonriddengirl#Quick_question_about_copyright|my talk page]].<br />
<br />
Brief story:<br />
*The book is an autobiography of Dane [[Christian Klengenberg]], who died in 1931. It was published in London and Toronto in 1932 by Canadian editor [[Tom MacInnes]], who died in 1951. It was also published in the US--unknown if it was within 30 days of original publication. Copyright was never renewed in the US. [[User:Jayvdb]] thinks there may be a good case for Canada as place of first publication, given the editor's nationality.<br />
<br />
*The book contains photographs of the subject. No photographer is identified for them. <br />
<br />
*As I understand it, if the book was first published in London and the photographer is unknown, it would be PD in the UK "70 years from end of year taken, or made available to the public if within 70 years of creation", according to [http://www.lr.mdx.ac.uk/copyright/index.htm], which would miss the 1996 cut off and (I believe) keep the photographs copyrighted in the US under the Uruguay Round Agreements Act. If the book was first published in Canada, I think, given that the photographer is unknown they would be PD either 50 years following publication or 75 years after the photograph was taken, whichever comes first (according to [[:commons:commons.wikimedia.org/wiki/Public_domain#Material_in_the_public_domain|Commons]]), either of which would make them PD by January 1996. <br />
<br />
Would photographs from an unknown photographer published in this book be accepted on Commons? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:41, 2 December 2009 (UTC)<br />
<br />
:May not need your input anymore. :) [[User:Physchim62]] weighs in at my talk page with the [[rebuttable presumption]] of copyright in the author and also suggests simultaneous publication in UK and Canada, as well as copyright concerns with the Danes. Unless you disagree that the images are unusable, this one may be over. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 16:49, 2 December 2009 (UTC)<br />
<br />
::Hey - this is a somewhat difficult case. The relevant tags at Commons would be [[:commons:Template:PD-UK-unknown]], [[:commons:Template:PD-Canada]], and [[:commons:Template:PD-US-not renewed]]. I think you can make a good case that all three of these apply in this case, but as you say, the URAA restored copyright in the US. The state of the URAA is an unsettled matter on Commons, see [[:commons:Commons:Licensing#Uruguay_Round_Agreements_Act]]. I'd say you ''could'' upload this (and tag with [[:commons:Template:Not-PD-US-URAA]]) but I wouldn't recommend it unless you have some really compelling reason to. [[User:Dcoetzee|Dcoetzee]] 06:11, 3 December 2009 (UTC)<br />
:::Thanks. I will pass that on. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:01, 3 December 2009 (UTC)<br />
<br />
==Unreferenced BLPs==<br />
[[File:Information.svg|30px]] Hello Dcoetzee! Thank you for your contributions. I am a [[WP:BOT|bot]] alerting you that '''2''' of the articles that you created are tagged as[[Wikipedia:Biographies_of_living_persons#Sources| Unreferenced Biographies of Living Persons]]. Please note that all biographies of living persons '''must be sourced'''. If you were to add [[WP:RELIABLE|reliable]], [[WP:SECONDARY|secondary]] [[WP:SOURCES|sources]] to these articles, it would greatly help us with the current ''[[:Category:All_unreferenced_BLPs|{{PAGESINCATEGORY:All_unreferenced_BLPs}}]]'' article backlog. Once the articles are adequately referenced, please remove the {{tl|unreferencedBLP}} tag. Here is the list:<br />
<br />
# [[John Adams (Ohio politician)]] - <small>{{findsources|John Adams (Ohio politician)}}</small><br />
# [[Richard Adams (Ohio politician)]] - <small>{{findsources|Richard Adams (Ohio politician)}}</small><br />
Thanks!--[[User:DASHBot|DASHBot]] ([[User talk:DASHBot|talk]]) 23:03, 2 January 2010 (UTC)<br />
<br />
==Commons image question==<br />
Hi, and Happy New Year. :) There's a question about an image on Commons at my userpage that you may be better able to address than I. Can you take a look at [[User_talk:Moonriddengirl#How_do_I_tag_commons_media_for_requested_deletion.3F|it]] and weigh in or take any action that seems necessary? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:06, 8 January 2010 (UTC)<br />
:Well, that one resolved swiftly already. :D So as not to have wasted your time in reading this altogether, might I ask you to take a look at [[:File:Roundel of the Slovenian Air Force.png]] and [[:File:Roundel of the Slovenian Air Force.svg]] and determine what if anything should be done with them? The uploader is certainly not the copyright holder, but I do not know Commons' stance on images of that kind. If they need to be retagged or other handled, can you help out? The contributor's other images are listed at [[:Commons:Commons:Deletion requests/Images of Slovenian military-patriot]]. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 16:33, 9 January 2010 (UTC)<br />
::Hey, sorry for the slow response! I'll take a look at this now. :-) [[User:Dcoetzee|Dcoetzee]] 12:01, 12 January 2010 (UTC)<br />
::The image [[:File:Roundel of the Slovenian Air Force.png]] is definitely a difficult case. It's unlikely of course that the uploader is the copyright holder (most likely the Slovenian Air Force itself is) but the image may be so simple as to fall under [[:commons:Template:PD-ineligible]]. Alternatively, works of the Slovenian government may be public domain (I doubt it, but I can't find any information on Slovenian copyright law). There's no harm in nominating it, but it would likely be kept, if only on the PD-ineligible theory. Hope this helps, and hope you're well. :-) [[User:Dcoetzee|Dcoetzee]] 12:18, 12 January 2010 (UTC)<br />
:::I'm doing fine, and glad to see you. :) I hope you're well also. I did not nominate it with the others because I thought it might be ineligible for copyright protection, but since images are not my main area thought to check with you. Given your response, I'll just leave it be. I've got plenty of others to work on. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 12:31, 12 January 2010 (UTC)<br />
<br />
==CCI image outstanding issue==<br />
Hi. Mer-C requests review of a couple of images at [[Wikipedia:Contributor_copyright_investigations#Requests]] (the ones for Blackknight12). Can you take a look and weigh in there? I believe most if not all of them should be clear, but because of my previous interactions with the contributor would prefer somebody else evaluate them. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:36, 17 January 2010 (UTC)<br />
:Done. :-) You're right, I think they are all okay. Hope this helps. [[User:Dcoetzee|Dcoetzee]] 00:02, 21 January 2010 (UTC)<br />
<br />
==William Burton and Hollar==<br />
<br />
I've figured this one out, but it is tricky: see [[Talk:William Burton]]. I have just created [[William Burton (antiquary)]] but that is the one who the portrait is not of. I can create the correct other antiquary [[William Burton (antiquary d.1657)]] any time I see that it is not going to be an orphan. [[User:Charles Matthews|Charles Matthews]] ([[User talk:Charles Matthews|talk]]) 14:43, 5 February 2010 (UTC)<br />
:Great, thanks for helping sort this out! I certainly never would have guessed there were two antiquaries named William Burton who were contemporaries. [[User:Dcoetzee|Dcoetzee]] 02:50, 6 February 2010 (UTC)<br />
<br />
== NPG ==<br />
<br />
So, what happened to that legal issue? Did they give up? [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 05:49, 19 February 2010 (UTC)<br />
:No new news as far as I know - WMF may have received direct correspondence from NPG, however. [[User:Dcoetzee|Dcoetzee]] 05:50, 19 February 2010 (UTC)<br />
<br />
== Region-based memory allocation ==<br />
<br />
Hi, regarding [[Special:WhatLinksHere/Region-based_memory_allocation]], can you please not create multiple redirects to an article that doesn't exist? Thanks. --[[User:Closedmouth|Closedmouth]] ([[User talk:Closedmouth|talk]]) 13:05, 24 February 2010 (UTC)<br />
:Er, I was in the process of writing that article at the time, which was a taxing process involving a lot of research, so it took a while. Maybe I should have created the redirects afterwards to avoid confusing anyone. [[User:Dcoetzee|Dcoetzee]] 13:16, 24 February 2010 (UTC)<br />
::Oops, look like I accidentally slightly changed the name of the final article and forgot to update the redirects. Sorry about that! [[User:Dcoetzee|Dcoetzee]] 13:17, 24 February 2010 (UTC)<br />
:::Thanks. I'm aware that people like to create redirects to articles they haven't written yet, so I usually leave those for a couple of days, especially if there's more than one. So yeah. I've forgotten what my point was. Bye. --[[User:Closedmouth|Closedmouth]] ([[User talk:Closedmouth|talk]]) 13:45, 24 February 2010 (UTC)<br />
::::Thanks for noticing this, I might have forgotten about checking those redirects otherwise. [[User:Dcoetzee|Dcoetzee]] 14:15, 24 February 2010 (UTC)<br />
<br />
== wp:quote talk ==<br />
<br />
[http://en.wikipedia.org/w/index.php?title=Wikipedia_talk:Quotations&diff=349535627&oldid=349533092 Seems] like you support the idea. Feel free to move your comment so it is more [http://en.wikipedia.org/w/index.php?title=Wikipedia_talk:Quotations&diff=next&oldid=349760867 readable].[[Special:Contributions/174.3.107.176|174.3.107.176]] ([[User talk:174.3.107.176|talk]]) 05:07, 15 March 2010 (UTC)<br />
:No, I'd rather not. [[User:Dcoetzee|Dcoetzee]] 23:33, 15 March 2010 (UTC)<br />
<br />
==Math stuff==<br />
Hi. :) There's a math article at CP today, [[Mesor]]. I don't have the math background to assess the creativity there. Can you take a look? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:35, 17 March 2010 (UTC)<br />
:Cleaned it. :-) This is really more of a medical analysis thing, but the copyvio was pretty obvious (I'm particularly annoyed at the idea of copying references without reading them from a website that isn't even primarily about the topic of the article...). [[User:Dcoetzee|Dcoetzee]] 22:45, 17 March 2010 (UTC)<br />
==Updates to copyright instructions==<br />
Hi. Based on some feedback I've received, I've updated the instructions at [[WP:SCV]] and [[WP:CP]]. I've left a more indepth explanation at [[Wikipedia talk:Suspected copyright violations#Header update]] along with a request for feedback. As we try to get more people involved in this work, we want to be sure instructions are clear. Given your work, your input there would be very much appreciated. :) [[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:49, 18 March 2010 (UTC)<br />
:Thank you for clarifying this. :-) It certainly was helpful to me to read. Hopefully it'll help others too. [[User:Dcoetzee|Dcoetzee]] 04:58, 19 March 2010 (UTC)<br />
<br />
==Connected Components==<br />
Hi Derrick.<br />
The definition of a connected component on the following page is incorrect: [[Connected_component_(graph_theory)]].<br />
It states: "In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and to which no more vertices or edges can be added while preserving its connectivity." However, "or edges" part of that sentence needs to be removed, as it is not true. Edges can be added to a connected component, while preserving its connectivity.<br />
See the NIST definition that you referred to: [http://www.itl.nist.gov/div897/sqg/dads/HTML/connectedComponents.html] which says: "such that no vertex of D can be added to S and it still be strongly connected". It does not say that edges cannot be added. Connected components of an undirected graph are not necessarily complete subgraphs; therefore edges can be added between nodes of the graph without threatening its status as a connected component. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/204.15.64.187|204.15.64.187]] ([[User talk:204.15.64.187|talk]]) 21:02, 22 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:You are both correct and also missing the point. Edges can be added to a graph which enlarge the edge set of some connected component. However, a connected component must ''partition'' the set of edges in the underlying graph - there cannot be any edge in the full graph which does not belong to a connected component of that graph. This is precisely what is implied by the statement that "no more edges can be added while preserving its connectivity." To consider a hypothetical example, a cycle graph may be divided into two "components" each containing half the cycle, and these two "components" together contain all vertices. They are not valid connected components because there are two edges in the underlying graph which are in neither component (in fact this graph has only one connected component).<br />
:Part of the confusion here may stem from the fact that the definition is not describing a partitioning of a graph into connected components, but rather defining a ''single'' connected component. In any case I've attempted to clarify the article. [[User:Dcoetzee|Dcoetzee]] 19:24, 24 March 2010 (UTC)<br />
<br />
==Image question at my talk page==<br />
Hi, Derrick. There's an image question at my talk page dealing with possibly copyright expired UK images and the impact on them of the URAA and CTEA. There seems to be some divergence between policy and practice (well, guideline, but I couldn't resist the alliteration) here, and I wanted to check with you to see if you can help answer the question. It's [[User_talk:Moonriddengirl#URAA.2C_US_copyright.2C_and_such|here]]. I'd be most grateful. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:24, 7 April 2010 (UTC)<br />
<br />
==Pestering you, as always==<br />
Hi. :D We're trying to figure out how non-admins can note that a CCI is ready to close. Can you determine if the last suggestion at [[Wikipedia talk:Contributor copyright investigations#How to flag an investigation complete]] is plausible? It's been sitting since the 7th, but nobody who knows 'bout such things has happened by. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 19:37, 13 April 2010 (UTC)<br />
<br />
:Could I also draw your attention to [[Wikipedia talk:Contributor copyright investigations#Listing generation question]], which seems to have your name on it. Thanks. --[[User:Tagishsimon|Tagishsimon]] [[User_talk:Tagishsimon|(talk)]] 16:44, 10 May 2010 (UTC)<br />
<br />
==Thank You ==<br />
<br />
<br />
{| style="border: 1px solid black; background-color: red; color:yellow"<br />
|rowspan="2" valign="middle" | [[Image:HumanSexualityBarnstar.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The [[Wikipedia:WikiProject Sexology and sexuality|Human Sexuality Barnstar]] '''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid black;" | Thank you for your heroic efforts fixing the damage done to articles by image deletion, [[User:Simonxag|Simon Speed]] ([[User talk:Simonxag|talk]]) 23:17, 10 May 2010 (UTC)<br />
|}<br />
:Thank you, I'm glad to help. :-) I hope going forward we'll see no more deletions of images that are in use for an educational purpose like these. [[User:Dcoetzee|Dcoetzee]] 00:34, 11 May 2010 (UTC)<br />
<br />
== lady, snow keep ==<br />
<br />
You ''don't'' get to close afds early. Snow keep is ''not'' a policy, and AFD is not a vote. DRV coming your way.- <small>[[User_talk:Wolfkeeper|''Wolfkeeper'']]</small> 03:43, 2 June 2010 (UTC)<br />
:Suit yourself. [[User:Dcoetzee|Dcoetzee]] 16:10, 2 June 2010 (UTC)<br />
::I would not have phrased it as adversarially as Wolfkeeper, but I agree that [[WP:SNOW]] was not applicable in this case. Would you consider reopening the AfD so that we don't have to go through DRV? [[User:LtPowers|Powers]] <sup><small><small>[[User talk:LtPowers|T]]</small></small></sup> 13:21, 3 June 2010 (UTC)<br />
:::It already went through DRV, where the closure was endorsed: [http://en.wikipedia.org/wiki/Wikipedia:Deletion_review/Log/2010_June_2]. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:24, 3 June 2010 (UTC)<br />
<br />
== Funnel sort ==<br />
<br />
I've started a draft at [[User:Gwern/Funnel sort]]. --[[User talk:Gwern |Gwern]] [[Special:Contributions/Gwern | (contribs)]] 18:26 17 June 2010 (GMT)<br />
<br />
== [automatically accepted] ==<br />
<br />
I want to ask a question about the “'''latest accepted revision'''” of pages on English Wikipedia. Does this option prevent me from seeing the latest version ''by default'' that was not marked as an ''accepted revision''? <small>--[[User:Mahmudmasri|Mahmudmasri]] ([[User talk:Mahmudmasri|talk]]) 05:41, 23 June 2010 (UTC)</small><br />
:There is a preference to always see the latest version by default. See Pending changes in your preferences. 06:27, 23 June 2010 (UTC)<br />
::Thanks, I'll see it. <small>--[[User:Mahmudmasri|Mahmudmasri]] ([[User talk:Mahmudmasri|talk]]) 07:29, 23 June 2010 (UTC)</small><br />
<br />
==Commons image?==<br />
Hi, Derrick. It's been forever since I've run into you. I keep an eye out, but evidently my timing has been bad. :) In any event, when I got a question about a Commons image on my talk page, it seemed a perfect excuse to drop by and say hi in context of asking your feedback. :D Could you take a look at [[User talk:Moonriddengirl#Help with an image]]? The uploader of [[:File:6 commando adour raid 1942.jpg]] is now concerned that he may have inadvertently licensed it incorrectly, and he is most anxious to do the right thing. Hi! --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:51, 23 June 2010 (UTC)<br />
:And since I'm already bothering you, um, [http://en.wikipedia.org/w/index.php?title=Millennium_Prize_Problems&diff=prev&oldid=369808717 what]? (No, I mean, [http://en.wikipedia.org/w/index.php?title=Code&diff=prev&oldid=369631588 what]? Really, [http://en.wikipedia.org/w/index.php?title=Time_complexity&diff=prev&oldid=369806950 what]?) Does any of that make sense? <small></puzzled></small> --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 21:34, 23 June 2010 (UTC)<br />
::Hey, good to hear from you. :-) All of those edits have been reverted. In the first edit, they claimed that they solved a long-standing open problems in computer science and that the source code they're pasting is the solution (in actuality it's not even remotely relevant). In the second edit they pasted a bunch of... what appear to be menu specifications into the general article on codes (which is completely unrelated). In the third they posted the same code as in the first one to a different article - it's still meaningless and irrelevant. They appear to be some crazy troll. :-) [[User:Dcoetzee|Dcoetzee]]<br />
:::Thank you. :) When I saw that similar edits had been permitted to stand for a day, I wasn't sure if it was because they weren't noticed or because there was something to them. It didn't look constructive to me, but.... Well, what do I know? :) If it says its related to computers, that is. And thanks for your feedback at my talk page question, too. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 10:46, 24 June 2010 (UTC)<br />
<br />
==Thanks==<br />
[http://en.wikipedia.org/w/index.php?title=User_talk:Moonriddengirl&curid=13355131&diff=372283438&oldid=372281688 Things get a bit sprawly] sometimes. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 21:38, 7 July 2010 (UTC)<br />
:Glad to help. :-) [[User:Dcoetzee|Dcoetzee]] 21:38, 7 July 2010 (UTC)<br />
<br />
==Request==<br />
Hi, Derrick. I know you're a busy fellow, but I'm wondering if you would mind watchlisting [[User:Pohick2]]. He is currently indefinitely blocked for copyright infringements (see [http://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard/IncidentArchive623#User:Pohick2_indef-block_review ANI thread]). He has yet to indicate even a desire to be unblocked, but since he may (he has certainly been a dedicated contributor) it would be good to have an experienced copyright admin who can work with him. There have been several conversations with him in the past, but the most extensive I've had is at [[User talk:Pohick2/Archive/#Copyright concerns]] and subsequent, in case you're wondering what ground has already been covered. I think that having a fresh person to talk to might be beneficial should he decide to consider resuming his account. Our last conversation, I'm afraid, didn't end well. :/ --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 01:49, 10 July 2010 (UTC)<br />
:Done :-) [[User:Dcoetzee|Dcoetzee]] 07:45, 10 July 2010 (UTC)<br />
<br />
== Context ==<br />
<br />
Hello. Please look at [http://en.wikipedia.org/w/index.php?title=Cantor%27s_intersection_theorem&diff=373743498&oldid=373656789 this edit]. I don't think the phrase "In real analysis,..." has the effect of telling the lay reader that mathematics is what the article is about. [[User:Michael Hardy|Michael Hardy]] ([[User talk:Michael Hardy|talk]]) 03:38, 16 July 2010 (UTC)<br />
:Okay. [[User:Dcoetzee|Dcoetzee]] 05:27, 16 July 2010 (UTC)<br />
<br />
==Image origin==<br />
Hi. A recently blocked contributor, [[User:Wiki id2]], acknowledged that all of the images he had uploaded under claim of his own authorship were not actually his, except one. Since that one ([[:File:Taha Hussain.PNG]]) was a clear crop, I suggested he upload the complete picture to help prove that he was the photographer. He has now uploaded [[:File:Taha Hussain.jpg]], and requests that we delete it once we are satisfied. Since images are way more your thing, would you mind taking a look? Should that alleviate my concerns about that image? It doesn't have metadata, but looks plausible. Your input would be appreciated. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:08, 20 July 2010 (UTC)<br />
:Hey :-) Based on contributions, I have every reason to suspect that Wiki id2 is a Pakistani person in the same age range as Taha Hussain, so may very well have been in a position to take a photograph of him (he's also himself responsible for the article). The resolution is unusual (it's probably a downscale of the original using some kind of standard photo editing tool, as no real camera would produce an image with this resolution), but it seems legit to me. [[User:Dcoetzee|Dcoetzee]] 20:05, 20 July 2010 (UTC)<br />
::Thank you kindly. :) I will not pursue this one further, then, but will regard it as plausible based on this and based on his coming clean, eventually, about the other content. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 19:22, 20 July 2010 (UTC)<br />
<br />
<br />
<br />
==Happy Dcoetzee's Day!==<br />
{| style="border: 2px ridge #4682B4; -moz-border-radius: 10px; background-color: #EAF5FF; margin: 0 auto; padding: 8px; text-align: center;"<br />
|[[Image:Featured article star.svg|150px|none|left]]<br />
|style="padding-left: 20px; padding-right: 10px; font-family: Comic Sans MS, sans-serif; font-size: 9pt; text-align: center;"|<br />
'''[[User:Dcoetzee]]''' has been identified as an '''''Awesome Wikipedian''''',<br /><br />
and therefore, I've officially declared today as [[User:Rlevse|Dcoetzee's day]]!<br /><br />
For being such a beautiful person and great Wikipedian,<br /><br />
enjoy being the Star of the day, dear Dcoetzee!<br />
<br />
Peace,<br />[[User:Rlevse|<b style="color:#090;">R<span style="color:#0A0;">l<span style="color:#0B0;">e<span style="color:#0C0;">v<span style="color:#0D0;">s</span>e</b>]]<br />01:47, 24 July 2010 (UTC)<br />
<br />
<small>A record of your Day will always be kept [[User:Rlevse/Today/Archive|here]].</small><br />
|}<br />
<br />
For a userbox you can add to your userbox page, see [[User:Rlevse/Today/Happy Me Day!]] and my own userpage for a sample of how to use it.<span style="font-family:Verdana,sans-serif"> — [[User:Rlevse|<b style="color:#060;"><i>R</i>levse</b>]] • [[User_talk:Rlevse|<span style="color:#990;">Talk</span>]] • </span> 01:47, 24 July 2010 (UTC)<br />
:Thank you, Rlevse. :-) [[User:Dcoetzee|Dcoetzee]] 01:50, 24 July 2010 (UTC)<br />
== Verifiability ==<br />
* {{On AFD|Universal data compression}}<br />
[http://en.wikipedia.org/w/index.php?title=Universal_data_compression&diff=373216859&oldid=371930172 Because] [http://en.wikipedia.org/w/index.php?title=Universal_data_compression&diff=370169528&oldid=370107143 you changed the article] so that it no longer matched the sources cited, deletion is being called for yet again, here. Please fix this, citing the source that you had for your different definition, to quash this argument. [[User:Uncle G|Uncle G]] ([[User talk:Uncle G|talk]]) 03:37, 25 July 2010 (UTC)<br />
:If I recall correctly my rewording was based on the references already listed in the article. I just put it in my own words, as we are required to do. If the fact that this is a rewording is unclear, perhaps the explanation is inadequate. If I recall incorrectly, then I can't remember where I found the sources I used, nor how I found them. [[User:Dcoetzee|Dcoetzee]] 04:35, 25 July 2010 (UTC)<br />
<br />
==Chime in==<br />
Could you chime in here and maybe update the article: [[User_talk:Jesse_Viviano#IPsec]]? Thanks. <span style="font-family:Verdana,sans-serif"> — [[User:Rlevse|<b style="color:#060;"><i>R</i>levse</b>]] • [[User_talk:Rlevse|<span style="color:#990;">Talk</span>]] • </span> 00:13, 28 July 2010 (UTC)<br />
<br />
==Close paraphrasing?==<br />
Hi, Derrick. :) There's a question at my talk page about the paraphrasing in [[Len Lawson]]. We could use another set of eyes. More information is available at its talk page and at mine, [[User_talk:Moonriddengirl#Copyviolation_or_just_close_paraphrasing_on_Len_Lawson.3F|here]], if you have time. It would, as always, be much appreciated. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 00:51, 28 July 2010 (UTC)<br />
<br />
==Math!==<br />
Yes, me again. :) There's a question at my talk page about whether an article that was once deleted for copyright concerns is now copyright-problem free. For background, see [[Wikipedia:AN#Deletion of Copyrighted Material]]. The question at my talk page is [[User_talk:Moonriddengirl#Thanks_for_your_Reply|here]]; the rewrite is [[Poincaré complex|here]] and the source is [http://eom.springer.de/p/p072990.htm here]. Can you take a look and give feedback at my talk page or at [[User talk:Fly by Night]]? I'd be ever so grateful. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 18:04, 6 August 2010 (UTC)<br />
:Replied, sorry for the delay. :-) [[User:Dcoetzee|Dcoetzee]] 06:10, 8 August 2010 (UTC)<br />
::Thanks Dcoetzee! I appreciate you taking the time to help. The use of <math>\scriptstyle \frown</math> in place of <math>\scriptstyle \cap</math> was two-fold. Firstly I think <math>\scriptstyle \frown</math> looks nicer, and secondly the [[cap product]] article uses <math>\scriptstyle \frown</math> insead of <math>\scriptstyle \cap</math>. <span style="white-space:nowrap;">— [[User:Fly by Night|<span style="font-family:Segoe print">'''''Fly by Night'''''</span>]] <font color="#000000">([[User talk:Fly by Night|<span style="font-family:Segoe print">talk</span>]])</font></span> 19:07, 8 August 2010 (UTC)<br />
:::Thanks, Derrick! You remain a prince among men. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 21:28, 8 August 2010 (UTC)<br />
::::She's a charmer, isn't she? ☺ <span style="white-space:nowrap;">— [[User:Fly by Night|<span style="font-family:Segoe print">'''''Fly by Night'''''</span>]] <font color="#000000">([[User talk:Fly by Night|<span style="font-family:Segoe print">talk</span>]])</font></span> 21:59, 8 August 2010 (UTC)<br />
:::::Always :-) Glad to help. [[User:Dcoetzee|Dcoetzee]] 02:08, 10 August 2010 (UTC)<br />
<br />
== about Willy On Wheels ==<br />
<br />
Hello,<br />
<br />
I'm french and i tried to read your essay about vandal called "willy on wheels"… but i do not understand everything. <br />
new comer on wikipédia, I cant find the way to find a translator of your essay for the french wikipedia. could you please help me ?<br />
<br />
thank you <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/93.15.245.176|93.15.245.176]] ([[User talk:93.15.245.176|talk]]) 11:48, 22 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Does [http://translate.google.com/translate?js=y&prev=_t&hl=en&ie=UTF-8&layout=1&eotf=1&u=http%3A%2F%2Fen.wikipedia.org%2Fwiki%2FUser%3ADcoetzee%2FWilly_on_Wheels%3AA_Case_Study&sl=en&tl=fr this help]? Since my French is very poor, I do not know if their translation is very good. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 23:04, 29 August 2010 (UTC)<br />
<br />
==Yes, c'est moi==<br />
[[User:Fly by Night]] has found another copyvio in a math related article. It's the last listing at [[Wikipedia:Copyright problems/2010 August 21]]. Can I possibly drop this on your lap? The rest of the day (including SCV) is done. I'd appreciate it. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 23:01, 29 August 2010 (UTC)<br />
:Sorry for the delay, taking a look now. :-) [[User:Dcoetzee|Dcoetzee]] 15:08, 2 September 2010 (UTC)<br />
::See my note there. Could unfortunately not resolve this without access to the source. [[User:Dcoetzee|Dcoetzee]] 15:17, 2 September 2010 (UTC)<br />
:::I may have downloaded the pdf at home. I'll take a look tonight and see if I still have it. [[User:VernoWhitney|VernoWhitney]] ([[User talk:VernoWhitney|talk]]) 15:57, 2 September 2010 (UTC)<br />
::::That would be great, Verno. :) I had the same issue with accessing the source, but I wasn't quite sure if it would be something that might be more obvious to you than to me. I appreciate your looking, Derrick. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 16:14, 2 September 2010 (UTC)<br />
:::::Okay, I do have the source, and noticed that it's a revised version of the paper located at http://at.yorku.ca/i/d/e/a/35.htm. If none of those formats work for you I can get you the pdf version somehow. [[User:VernoWhitney|VernoWhitney]] ([[User talk:VernoWhitney|talk]]) 01:17, 3 September 2010 (UTC)<br />
::::::Thanks - I really should've been able to find that as it was cited. The proof was quite long and copied character for character, which is not okay. The definition, like many mathematical definitions, is quite difficult to put in any other words, and that's okay - I rephrased it a bit just to be careful. All clean. [[User:Dcoetzee|Dcoetzee]] 07:13, 3 September 2010 (UTC)<br />
:::::::Thank you both. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 15:57, 3 September 2010 (UTC)<br />
<br />
==DNB WikiProject==<br />
<br />
I don't know how interesting this is for you: but [[Wikipedia:WikiProject Dictionary of National Biography]] has just been set up formally. This could be a good place to marry up historical images with articles on their subjects, at least. [[User:Charles Matthews|Charles Matthews]] ([[User talk:Charles Matthews|talk]]) 18:59, 9 September 2010 (UTC)<br />
<br />
== [[Wikipedia:Miscellany for deletion/Secret pages 2]] ==<br />
<br />
Because you participated in [[Wikipedia:Miscellany for deletion/User:Some Person/The Real Secret Page and Secret Barnstar]], you may be interested in [[Wikipedia:Miscellany for deletion/Secret pages 2]]. [[User:Cunard|Cunard]] ([[User talk:Cunard|talk]]) 06:27, 12 September 2010 (UTC)<br />
<br />
==Close paraphrasing explanation?==<br />
Hi, Derrick. I am trying to explain close paraphrasing at [[User talk:Trackinfo#Copyright violation]], but it's late in my part of the world. Knowing your familiarity with the issue (not to mention the essay :D), could you drop by and clarify? I'm sure you can explain it more succinctly than I. I'd be grateful. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 00:45, 13 September 2010 (UTC)<br />
:Oh, I should note, his latest version is much better than his first, but, in my opinion, still follows too closely: [http://en.wikipedia.org/w/index.php?title=Pat_McCormick_%28diver%29&action=historysubmit&diff=384493043&oldid=384490300]. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 00:47, 13 September 2010 (UTC)<br />
:Done. :-) [[User:Dcoetzee|Dcoetzee]] 00:58, 13 September 2010 (UTC)<br />
<br />
==You need a separate talk page just for my requests==<br />
Hi, Derrick.<br />
<br />
There's a Commons image copyright question at my talk page, and I am in need of somebody familiar with the ins-and-outs of Commons copyright to help out. If you have an oppportunity, could you weigh in at [[User_talk:Moonriddengirl#Arecibo_Telescope_Photo|this thread]]? If you don't have the opportunity, let me know, and I'll pester somebody else. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 19:31, 17 September 2010 (UTC)<br />
<br />
== [[Wikipedia:Adopt-a-User|Adopt-a-user]] reminder ==<br />
<br />
Hello, I have completed a general cleanup of the adopter information page for the adopt-a-user project, located [[Wikipedia:Adopt-a-User/Adoptee's_Area/Adopters|here]]. During my cleanup, I have removed several inactive and retired users. In order to provide interested adoptees with an easy location to find adopters, it is essential that the page be up-to-date with the latest information possible. Thus:<br />
<br />
* If you are no longer interested in being an adopter, please remove yourself from the list.<br />
* If you are still interested, please check the list to see if any information needs to be updated or added - especially your availability. Thank you.<br />
<br />
* You are receiving this message because you are listed as an adopter [[Wikipedia:Adopt-a-User/Adoptee's_Area/Adopters|here]].<br />
<br />
<small>Delivered by [[User:MessageDeliveryBot|MessageDeliveryBot]] on behalf of [[User:Netalarm|Netalarm]] ([[User talk:Netalarm|talk]]) at 03:34, 23 September 2010 (UTC).</small><br />
<!-- Delivery approved by [[User:Netalarm]]. --><br />
==Repeated links proposal==<br />
This is [[User:Michael C Price/links|a proposal]] to change the [[WP:REPEATLINK|Repeated links section]] of the MOS. Please edit &/or comment on the talk page as you see fit.<br />
<br />
Feel free to move the proposal/discussion straight to the [[Wikipedia talk:Manual of Style (linking)]] if you wish. I just thought we might establish some sort of consensus first, out of the heat and fury over [[Wikipedia talk:Manual of Style (linking)|there]]. --[[User:Michael C Price|Michael C. Price]] <sup>[[User talk:Michael C Price|talk]]</sup> 10:20, 28 September 2010 (UTC)<br />
<br />
==When making changes to scientific articles you have to understand the subject==<br />
You rearranged sections in arithmetic coding. Do you understand that first part is not clear for anyone who try to become familiar with the subject. It does not matter if it is right or wrong, it does not explain anything. The explanation that arithmetic coding narrows interval on every step is right or meaningless. People need to understand where compression comes from. Why narrowing down interval leads to shorter message? Why this shorter message is shortest possible? And how to restore message back from final interval? Besides that, first section does not mention that compression occur by choosing shortest fraction from final interval and not from narrowing down the interval itself. I wrote that sections that you moved down. I actually don't care if you remove them or not because I explained everything on my web site, which shown by Google on the first page even before wiki. Did you write your own arithmetic coder ever? I wrote several coders in open source that are used by people. If you want to arithmetic coding via narrowing interval starting from [0,1) that is fine, but explain how to encode, decode, explain why it is numerically stable and converge and what is the limit to which it converges. It takes two pages of printed text to explain this and reader needs to know high school math to understand it but it requires high level on understanding to be able to explain it. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 08:25, 3 October 2010 (UTC)<br />
<br />
If it is your explanation on the top part of arithmetic coding section I can tell you that even Claude Shannon would not understand it in 1948 if he read it. It may be correct but useless. You know the joke how two guys got lost at see on the boat and met another boat with fisherman. They asked "where are we" and got the answer "you are in the boat". They decided that fisherman was mathematician because the answer was precise but useless, so this is upper part of the article. You can make the whole article useless by removing my section and will have more readers on my site.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Dcoetzee&diff=388433131User talk:Dcoetzee2010-10-03T08:25:37Z<p>C-processor: </p>
<hr />
<div>'''Archives:'''<br />
<br />
* [[User talk:Dcoetzee/Archive 2007 2 21|2003 &ndash; 2007/2/21]]<br />
* [[User talk:Dcoetzee/Archive 2009 4 15|2007/2/22 &ndash; 2009/4/15]]<br />
* [[User talk:Dcoetzee/Archive 2009 9 8|2009/4/16 &ndash; 2009/9/8]]<br />
<br />
==Yes, already==<br />
Hi. There's a question at MCQ that I'm worried is going to archive without answer. Can you help or point me to somebody who might? [[Wikipedia:Media copyright questions#Okay use or derivative work?]] --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:48, 8 November 2009 (UTC)<br />
:Done, hope it helps. :-) [[User:Dcoetzee|Dcoetzee]] 07:14, 9 November 2009 (UTC)<br />
::Thank you! And here I am again, cluttering your clean page. It looks like [[WP:CCI]] may go live soon. I've got a question about the ContributionSurveyor program at [[Wikipedia_talk:Contributor_copyright_investigations#A_couple_of_questions|its talk page]]. Your input, I expect, would be invaluable. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 18:58, 9 November 2009 (UTC)<br />
:::Hmm, could you point me to the specific question? I didn't spot it. Maybe you linked to the wrong section? Thanks. :-) [[User:Dcoetzee|Dcoetzee]] 06:15, 15 November 2009 (UTC)<br />
<br />
==[[Wikipedia:Article Rescue Squadron]] invitation==<br />
I loved your article [[Wikipedia:Criteria for speedy deletion/Overturned speedy deletions]] and mentioned it here: [[Wikipedia talk:Article_Rescue Squadron#Speedy deletion open request for comment and pages]] How did you gather that information from the [http://en.wikipedia.org/w/index.php?title=Special%3ALog&type=delete&user=&page=&year=&month=-1 deletion log]? What tools did you use? Please give me as much details as possible, because I would love to mimic your study. <br />
<br />
You maybe interested in a project I am a member of.<br />
<br />
{| style="border-spacing:2px; margin:0px" width="100%" <br />
{| class="MainPageBG" style="width: 55%; border:1px solid #FCF2D9; background-color:#FFF; color:#FFF;font-size: 90%"|<br />
{| width="100%" cellpadding="2" cellspacing="5" style="background-color:#E2E7FF"<br />
! <div style="margin: 0; background-color:#F4F7FA; border:1px solid red; text-align:left; color:#082840; padding-left:0.4em; padding-top: 0.4em; padding-bottom: 0.4em; padding-right: 0.4em;">[[File:Barnstar search rescue.png|left|70px|WikiProject Article Rescue Squadron]] Hello, Dcoetzee.<br>You have been invited to [[Wikipedia:ARS#How to become a member of Article Rescue Squadron|join]] the [[WP:ARS|Article Rescue Squadron]], a collaborative effort to rescue articles from deletion if they can be improved through regular editing. <br>For more information, please visit the [[Wikipedia:Article Rescue Squadron|project page]], where you can [[Wikipedia:Article_Rescue_Squadron/Members#All_Members|>> join <<]] and help rescue [[:Category:Articles tagged for deletion and rescue|articles tagged for deletion and rescue]]. [[User:Ikip|Ikip]] ([[User talk:Ikip|talk]]) 06:24, 13 November 2009 (UTC)<br />
|}</div><br />
<!--Template:Article Rescue Squadron invite--><br />
<br />
<br />
[[User:Ikip|Ikip]] ([[User talk:Ikip|talk]]) 06:24, 13 November 2009 (UTC)<br />
:{{wikithanks|Thank you for your response on [[Wikipedia talk:Article Rescue Squadron]], I was afaid you would say "manually" [[User:Ikip|Ikip]] ([[User talk:Ikip|talk]]) 19:57, 16 November 2009 (UTC)}}<br />
<br />
==Copyright problems?==<br />
Hi. [[Interceptor pattern]] is tagged as a copyvio of [http://www.cs.uu.nl/docs/vakken/no/interceptor.pdf], apparently based on the tables. I'm not able to assess the creativity of that material, hence its usability. Can you take a look? On a related note, there is an outstanding section on whether "instruction sets" are copyrightable at [[Wikipedia_talk:CP#Copyrightable.3F|WT:CP]]. Um, ? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:13, 14 November 2009 (UTC)<br />
:Hey. :-) It looks like a clear copyvio to me. Compare page 8 of the slides with the intro paragraph. To a lesser extent page 16 resembles the second paragraph. The example is also clearly lifted directly from the slides - compare pages 23-28 to the code in example section, they're identical. I'll comment on CP. :-) [[User:Dcoetzee|Dcoetzee]] 06:28, 15 November 2009 (UTC)<br />
==Commons deletion debate?==<br />
Hi. Has [[:Commons:Commons:Deletion requests/File:Azerbaijan Navy.jpg|this one]] been archived without closure, do you think? It's been sitting there for an awfully long time. :/ --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:40, 23 November 2009 (UTC)<br />
:Nope. Commons always has a really long deletion backlog. See [[:Commons:Commons:Deletion requests/2009/08/13]]. I should probably help clean it up sometime. :-) [[User:Dcoetzee|Dcoetzee]] 18:25, 24 November 2009 (UTC)<br />
<br />
==WP:CANVASS addition==<br />
<br />
Hi there. Regarding your addition to [[WP:CANVASS]] [http://en.wikipedia.org/w/index.php?title=Wikipedia:Canvassing&curid=7406238&diff=328712745&oldid=328640971 here], I agree with this addition. Good thinking, and good phrasing. [[User:Tanthalas39|<font color="#CC7722" face="Papyrus">'''Tan'''</font>]] &#124; [[User talk:Tanthalas39|<font color="#21421E" face="Papyrus">39</font>]] 02:25, 30 November 2009 (UTC)<br />
:Thanks! It was just a thought that crossed my mind while reading it and it seemed uncontroversial. Hopefully it'll prove to be so. [[User:Dcoetzee|Dcoetzee]] 11:13, 30 November 2009 (UTC)<br />
<br />
==Derivative work?==<br />
[[:File:SCPA Historical Marker.PNG]]? (being all pithy :)) If so, what to do? PUF? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 20:54, 1 December 2009 (UTC)<br />
:Hey. :-) That's almost certainly unfree. It's created by the state government of Ohio, which does not typically release its work into the public domain. It's in the US, where there is no freedom of panorama, so we're violating the copyright of the designer of the sign. Additionally, the text on the sign is legible and extensive, so we're violating the copyright of the writer (and this would probably apply even in a typical nation with FoP). I'd take it to PUF just because it's sufficiently complicated, but it seems like a sure delete to me. [[User:Dcoetzee|Dcoetzee]] 01:34, 2 December 2009 (UTC)<br />
::Thank you. I'll talk to the image uploader first, about potentially G7ing it. We're in communication about some pretty extensive text issues at the moment. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:41, 2 December 2009 (UTC)<br />
<br />
==Yes, another question==<br />
I'm trying to figure out PD status of some images that were published in a 1932 book. The initial conversation is at [[User_talk:Moonriddengirl#Quick_question_about_copyright|my talk page]].<br />
<br />
Brief story:<br />
*The book is an autobiography of Dane [[Christian Klengenberg]], who died in 1931. It was published in London and Toronto in 1932 by Canadian editor [[Tom MacInnes]], who died in 1951. It was also published in the US--unknown if it was within 30 days of original publication. Copyright was never renewed in the US. [[User:Jayvdb]] thinks there may be a good case for Canada as place of first publication, given the editor's nationality.<br />
<br />
*The book contains photographs of the subject. No photographer is identified for them. <br />
<br />
*As I understand it, if the book was first published in London and the photographer is unknown, it would be PD in the UK "70 years from end of year taken, or made available to the public if within 70 years of creation", according to [http://www.lr.mdx.ac.uk/copyright/index.htm], which would miss the 1996 cut off and (I believe) keep the photographs copyrighted in the US under the Uruguay Round Agreements Act. If the book was first published in Canada, I think, given that the photographer is unknown they would be PD either 50 years following publication or 75 years after the photograph was taken, whichever comes first (according to [[:commons:commons.wikimedia.org/wiki/Public_domain#Material_in_the_public_domain|Commons]]), either of which would make them PD by January 1996. <br />
<br />
Would photographs from an unknown photographer published in this book be accepted on Commons? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:41, 2 December 2009 (UTC)<br />
<br />
:May not need your input anymore. :) [[User:Physchim62]] weighs in at my talk page with the [[rebuttable presumption]] of copyright in the author and also suggests simultaneous publication in UK and Canada, as well as copyright concerns with the Danes. Unless you disagree that the images are unusable, this one may be over. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 16:49, 2 December 2009 (UTC)<br />
<br />
::Hey - this is a somewhat difficult case. The relevant tags at Commons would be [[:commons:Template:PD-UK-unknown]], [[:commons:Template:PD-Canada]], and [[:commons:Template:PD-US-not renewed]]. I think you can make a good case that all three of these apply in this case, but as you say, the URAA restored copyright in the US. The state of the URAA is an unsettled matter on Commons, see [[:commons:Commons:Licensing#Uruguay_Round_Agreements_Act]]. I'd say you ''could'' upload this (and tag with [[:commons:Template:Not-PD-US-URAA]]) but I wouldn't recommend it unless you have some really compelling reason to. [[User:Dcoetzee|Dcoetzee]] 06:11, 3 December 2009 (UTC)<br />
:::Thanks. I will pass that on. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:01, 3 December 2009 (UTC)<br />
<br />
==Unreferenced BLPs==<br />
[[File:Information.svg|30px]] Hello Dcoetzee! Thank you for your contributions. I am a [[WP:BOT|bot]] alerting you that '''2''' of the articles that you created are tagged as[[Wikipedia:Biographies_of_living_persons#Sources| Unreferenced Biographies of Living Persons]]. Please note that all biographies of living persons '''must be sourced'''. If you were to add [[WP:RELIABLE|reliable]], [[WP:SECONDARY|secondary]] [[WP:SOURCES|sources]] to these articles, it would greatly help us with the current ''[[:Category:All_unreferenced_BLPs|{{PAGESINCATEGORY:All_unreferenced_BLPs}}]]'' article backlog. Once the articles are adequately referenced, please remove the {{tl|unreferencedBLP}} tag. Here is the list:<br />
<br />
# [[John Adams (Ohio politician)]] - <small>{{findsources|John Adams (Ohio politician)}}</small><br />
# [[Richard Adams (Ohio politician)]] - <small>{{findsources|Richard Adams (Ohio politician)}}</small><br />
Thanks!--[[User:DASHBot|DASHBot]] ([[User talk:DASHBot|talk]]) 23:03, 2 January 2010 (UTC)<br />
<br />
==Commons image question==<br />
Hi, and Happy New Year. :) There's a question about an image on Commons at my userpage that you may be better able to address than I. Can you take a look at [[User_talk:Moonriddengirl#How_do_I_tag_commons_media_for_requested_deletion.3F|it]] and weigh in or take any action that seems necessary? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:06, 8 January 2010 (UTC)<br />
:Well, that one resolved swiftly already. :D So as not to have wasted your time in reading this altogether, might I ask you to take a look at [[:File:Roundel of the Slovenian Air Force.png]] and [[:File:Roundel of the Slovenian Air Force.svg]] and determine what if anything should be done with them? The uploader is certainly not the copyright holder, but I do not know Commons' stance on images of that kind. If they need to be retagged or other handled, can you help out? The contributor's other images are listed at [[:Commons:Commons:Deletion requests/Images of Slovenian military-patriot]]. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 16:33, 9 January 2010 (UTC)<br />
::Hey, sorry for the slow response! I'll take a look at this now. :-) [[User:Dcoetzee|Dcoetzee]] 12:01, 12 January 2010 (UTC)<br />
::The image [[:File:Roundel of the Slovenian Air Force.png]] is definitely a difficult case. It's unlikely of course that the uploader is the copyright holder (most likely the Slovenian Air Force itself is) but the image may be so simple as to fall under [[:commons:Template:PD-ineligible]]. Alternatively, works of the Slovenian government may be public domain (I doubt it, but I can't find any information on Slovenian copyright law). There's no harm in nominating it, but it would likely be kept, if only on the PD-ineligible theory. Hope this helps, and hope you're well. :-) [[User:Dcoetzee|Dcoetzee]] 12:18, 12 January 2010 (UTC)<br />
:::I'm doing fine, and glad to see you. :) I hope you're well also. I did not nominate it with the others because I thought it might be ineligible for copyright protection, but since images are not my main area thought to check with you. Given your response, I'll just leave it be. I've got plenty of others to work on. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 12:31, 12 January 2010 (UTC)<br />
<br />
==CCI image outstanding issue==<br />
Hi. Mer-C requests review of a couple of images at [[Wikipedia:Contributor_copyright_investigations#Requests]] (the ones for Blackknight12). Can you take a look and weigh in there? I believe most if not all of them should be clear, but because of my previous interactions with the contributor would prefer somebody else evaluate them. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:36, 17 January 2010 (UTC)<br />
:Done. :-) You're right, I think they are all okay. Hope this helps. [[User:Dcoetzee|Dcoetzee]] 00:02, 21 January 2010 (UTC)<br />
<br />
==William Burton and Hollar==<br />
<br />
I've figured this one out, but it is tricky: see [[Talk:William Burton]]. I have just created [[William Burton (antiquary)]] but that is the one who the portrait is not of. I can create the correct other antiquary [[William Burton (antiquary d.1657)]] any time I see that it is not going to be an orphan. [[User:Charles Matthews|Charles Matthews]] ([[User talk:Charles Matthews|talk]]) 14:43, 5 February 2010 (UTC)<br />
:Great, thanks for helping sort this out! I certainly never would have guessed there were two antiquaries named William Burton who were contemporaries. [[User:Dcoetzee|Dcoetzee]] 02:50, 6 February 2010 (UTC)<br />
<br />
== NPG ==<br />
<br />
So, what happened to that legal issue? Did they give up? [[User:Pohta ce-am pohtit|Pcap]] [[User_talk:Pohta ce-am pohtit|<small>ping</small>]] 05:49, 19 February 2010 (UTC)<br />
:No new news as far as I know - WMF may have received direct correspondence from NPG, however. [[User:Dcoetzee|Dcoetzee]] 05:50, 19 February 2010 (UTC)<br />
<br />
== Region-based memory allocation ==<br />
<br />
Hi, regarding [[Special:WhatLinksHere/Region-based_memory_allocation]], can you please not create multiple redirects to an article that doesn't exist? Thanks. --[[User:Closedmouth|Closedmouth]] ([[User talk:Closedmouth|talk]]) 13:05, 24 February 2010 (UTC)<br />
:Er, I was in the process of writing that article at the time, which was a taxing process involving a lot of research, so it took a while. Maybe I should have created the redirects afterwards to avoid confusing anyone. [[User:Dcoetzee|Dcoetzee]] 13:16, 24 February 2010 (UTC)<br />
::Oops, look like I accidentally slightly changed the name of the final article and forgot to update the redirects. Sorry about that! [[User:Dcoetzee|Dcoetzee]] 13:17, 24 February 2010 (UTC)<br />
:::Thanks. I'm aware that people like to create redirects to articles they haven't written yet, so I usually leave those for a couple of days, especially if there's more than one. So yeah. I've forgotten what my point was. Bye. --[[User:Closedmouth|Closedmouth]] ([[User talk:Closedmouth|talk]]) 13:45, 24 February 2010 (UTC)<br />
::::Thanks for noticing this, I might have forgotten about checking those redirects otherwise. [[User:Dcoetzee|Dcoetzee]] 14:15, 24 February 2010 (UTC)<br />
<br />
== wp:quote talk ==<br />
<br />
[http://en.wikipedia.org/w/index.php?title=Wikipedia_talk:Quotations&diff=349535627&oldid=349533092 Seems] like you support the idea. Feel free to move your comment so it is more [http://en.wikipedia.org/w/index.php?title=Wikipedia_talk:Quotations&diff=next&oldid=349760867 readable].[[Special:Contributions/174.3.107.176|174.3.107.176]] ([[User talk:174.3.107.176|talk]]) 05:07, 15 March 2010 (UTC)<br />
:No, I'd rather not. [[User:Dcoetzee|Dcoetzee]] 23:33, 15 March 2010 (UTC)<br />
<br />
==Math stuff==<br />
Hi. :) There's a math article at CP today, [[Mesor]]. I don't have the math background to assess the creativity there. Can you take a look? --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 14:35, 17 March 2010 (UTC)<br />
:Cleaned it. :-) This is really more of a medical analysis thing, but the copyvio was pretty obvious (I'm particularly annoyed at the idea of copying references without reading them from a website that isn't even primarily about the topic of the article...). [[User:Dcoetzee|Dcoetzee]] 22:45, 17 March 2010 (UTC)<br />
==Updates to copyright instructions==<br />
Hi. Based on some feedback I've received, I've updated the instructions at [[WP:SCV]] and [[WP:CP]]. I've left a more indepth explanation at [[Wikipedia talk:Suspected copyright violations#Header update]] along with a request for feedback. As we try to get more people involved in this work, we want to be sure instructions are clear. Given your work, your input there would be very much appreciated. :) [[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:49, 18 March 2010 (UTC)<br />
:Thank you for clarifying this. :-) It certainly was helpful to me to read. Hopefully it'll help others too. [[User:Dcoetzee|Dcoetzee]] 04:58, 19 March 2010 (UTC)<br />
<br />
==Connected Components==<br />
Hi Derrick.<br />
The definition of a connected component on the following page is incorrect: [[Connected_component_(graph_theory)]].<br />
It states: "In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and to which no more vertices or edges can be added while preserving its connectivity." However, "or edges" part of that sentence needs to be removed, as it is not true. Edges can be added to a connected component, while preserving its connectivity.<br />
See the NIST definition that you referred to: [http://www.itl.nist.gov/div897/sqg/dads/HTML/connectedComponents.html] which says: "such that no vertex of D can be added to S and it still be strongly connected". It does not say that edges cannot be added. Connected components of an undirected graph are not necessarily complete subgraphs; therefore edges can be added between nodes of the graph without threatening its status as a connected component. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/204.15.64.187|204.15.64.187]] ([[User talk:204.15.64.187|talk]]) 21:02, 22 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:You are both correct and also missing the point. Edges can be added to a graph which enlarge the edge set of some connected component. However, a connected component must ''partition'' the set of edges in the underlying graph - there cannot be any edge in the full graph which does not belong to a connected component of that graph. This is precisely what is implied by the statement that "no more edges can be added while preserving its connectivity." To consider a hypothetical example, a cycle graph may be divided into two "components" each containing half the cycle, and these two "components" together contain all vertices. They are not valid connected components because there are two edges in the underlying graph which are in neither component (in fact this graph has only one connected component).<br />
:Part of the confusion here may stem from the fact that the definition is not describing a partitioning of a graph into connected components, but rather defining a ''single'' connected component. In any case I've attempted to clarify the article. [[User:Dcoetzee|Dcoetzee]] 19:24, 24 March 2010 (UTC)<br />
<br />
==Image question at my talk page==<br />
Hi, Derrick. There's an image question at my talk page dealing with possibly copyright expired UK images and the impact on them of the URAA and CTEA. There seems to be some divergence between policy and practice (well, guideline, but I couldn't resist the alliteration) here, and I wanted to check with you to see if you can help answer the question. It's [[User_talk:Moonriddengirl#URAA.2C_US_copyright.2C_and_such|here]]. I'd be most grateful. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:24, 7 April 2010 (UTC)<br />
<br />
==Pestering you, as always==<br />
Hi. :D We're trying to figure out how non-admins can note that a CCI is ready to close. Can you determine if the last suggestion at [[Wikipedia talk:Contributor copyright investigations#How to flag an investigation complete]] is plausible? It's been sitting since the 7th, but nobody who knows 'bout such things has happened by. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 19:37, 13 April 2010 (UTC)<br />
<br />
:Could I also draw your attention to [[Wikipedia talk:Contributor copyright investigations#Listing generation question]], which seems to have your name on it. Thanks. --[[User:Tagishsimon|Tagishsimon]] [[User_talk:Tagishsimon|(talk)]] 16:44, 10 May 2010 (UTC)<br />
<br />
==Thank You ==<br />
<br />
<br />
{| style="border: 1px solid black; background-color: red; color:yellow"<br />
|rowspan="2" valign="middle" | [[Image:HumanSexualityBarnstar.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The [[Wikipedia:WikiProject Sexology and sexuality|Human Sexuality Barnstar]] '''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid black;" | Thank you for your heroic efforts fixing the damage done to articles by image deletion, [[User:Simonxag|Simon Speed]] ([[User talk:Simonxag|talk]]) 23:17, 10 May 2010 (UTC)<br />
|}<br />
:Thank you, I'm glad to help. :-) I hope going forward we'll see no more deletions of images that are in use for an educational purpose like these. [[User:Dcoetzee|Dcoetzee]] 00:34, 11 May 2010 (UTC)<br />
<br />
== lady, snow keep ==<br />
<br />
You ''don't'' get to close afds early. Snow keep is ''not'' a policy, and AFD is not a vote. DRV coming your way.- <small>[[User_talk:Wolfkeeper|''Wolfkeeper'']]</small> 03:43, 2 June 2010 (UTC)<br />
:Suit yourself. [[User:Dcoetzee|Dcoetzee]] 16:10, 2 June 2010 (UTC)<br />
::I would not have phrased it as adversarially as Wolfkeeper, but I agree that [[WP:SNOW]] was not applicable in this case. Would you consider reopening the AfD so that we don't have to go through DRV? [[User:LtPowers|Powers]] <sup><small><small>[[User talk:LtPowers|T]]</small></small></sup> 13:21, 3 June 2010 (UTC)<br />
:::It already went through DRV, where the closure was endorsed: [http://en.wikipedia.org/wiki/Wikipedia:Deletion_review/Log/2010_June_2]. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 13:24, 3 June 2010 (UTC)<br />
<br />
== Funnel sort ==<br />
<br />
I've started a draft at [[User:Gwern/Funnel sort]]. --[[User talk:Gwern |Gwern]] [[Special:Contributions/Gwern | (contribs)]] 18:26 17 June 2010 (GMT)<br />
<br />
== [automatically accepted] ==<br />
<br />
I want to ask a question about the “'''latest accepted revision'''” of pages on English Wikipedia. Does this option prevent me from seeing the latest version ''by default'' that was not marked as an ''accepted revision''? <small>--[[User:Mahmudmasri|Mahmudmasri]] ([[User talk:Mahmudmasri|talk]]) 05:41, 23 June 2010 (UTC)</small><br />
:There is a preference to always see the latest version by default. See Pending changes in your preferences. 06:27, 23 June 2010 (UTC)<br />
::Thanks, I'll see it. <small>--[[User:Mahmudmasri|Mahmudmasri]] ([[User talk:Mahmudmasri|talk]]) 07:29, 23 June 2010 (UTC)</small><br />
<br />
==Commons image?==<br />
Hi, Derrick. It's been forever since I've run into you. I keep an eye out, but evidently my timing has been bad. :) In any event, when I got a question about a Commons image on my talk page, it seemed a perfect excuse to drop by and say hi in context of asking your feedback. :D Could you take a look at [[User talk:Moonriddengirl#Help with an image]]? The uploader of [[:File:6 commando adour raid 1942.jpg]] is now concerned that he may have inadvertently licensed it incorrectly, and he is most anxious to do the right thing. Hi! --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:51, 23 June 2010 (UTC)<br />
:And since I'm already bothering you, um, [http://en.wikipedia.org/w/index.php?title=Millennium_Prize_Problems&diff=prev&oldid=369808717 what]? (No, I mean, [http://en.wikipedia.org/w/index.php?title=Code&diff=prev&oldid=369631588 what]? Really, [http://en.wikipedia.org/w/index.php?title=Time_complexity&diff=prev&oldid=369806950 what]?) Does any of that make sense? <small></puzzled></small> --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 21:34, 23 June 2010 (UTC)<br />
::Hey, good to hear from you. :-) All of those edits have been reverted. In the first edit, they claimed that they solved a long-standing open problems in computer science and that the source code they're pasting is the solution (in actuality it's not even remotely relevant). In the second edit they pasted a bunch of... what appear to be menu specifications into the general article on codes (which is completely unrelated). In the third they posted the same code as in the first one to a different article - it's still meaningless and irrelevant. They appear to be some crazy troll. :-) [[User:Dcoetzee|Dcoetzee]]<br />
:::Thank you. :) When I saw that similar edits had been permitted to stand for a day, I wasn't sure if it was because they weren't noticed or because there was something to them. It didn't look constructive to me, but.... Well, what do I know? :) If it says its related to computers, that is. And thanks for your feedback at my talk page question, too. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 10:46, 24 June 2010 (UTC)<br />
<br />
==Thanks==<br />
[http://en.wikipedia.org/w/index.php?title=User_talk:Moonriddengirl&curid=13355131&diff=372283438&oldid=372281688 Things get a bit sprawly] sometimes. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 21:38, 7 July 2010 (UTC)<br />
:Glad to help. :-) [[User:Dcoetzee|Dcoetzee]] 21:38, 7 July 2010 (UTC)<br />
<br />
==Request==<br />
Hi, Derrick. I know you're a busy fellow, but I'm wondering if you would mind watchlisting [[User:Pohick2]]. He is currently indefinitely blocked for copyright infringements (see [http://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard/IncidentArchive623#User:Pohick2_indef-block_review ANI thread]). He has yet to indicate even a desire to be unblocked, but since he may (he has certainly been a dedicated contributor) it would be good to have an experienced copyright admin who can work with him. There have been several conversations with him in the past, but the most extensive I've had is at [[User talk:Pohick2/Archive/#Copyright concerns]] and subsequent, in case you're wondering what ground has already been covered. I think that having a fresh person to talk to might be beneficial should he decide to consider resuming his account. Our last conversation, I'm afraid, didn't end well. :/ --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 01:49, 10 July 2010 (UTC)<br />
:Done :-) [[User:Dcoetzee|Dcoetzee]] 07:45, 10 July 2010 (UTC)<br />
<br />
== Context ==<br />
<br />
Hello. Please look at [http://en.wikipedia.org/w/index.php?title=Cantor%27s_intersection_theorem&diff=373743498&oldid=373656789 this edit]. I don't think the phrase "In real analysis,..." has the effect of telling the lay reader that mathematics is what the article is about. [[User:Michael Hardy|Michael Hardy]] ([[User talk:Michael Hardy|talk]]) 03:38, 16 July 2010 (UTC)<br />
:Okay. [[User:Dcoetzee|Dcoetzee]] 05:27, 16 July 2010 (UTC)<br />
<br />
==Image origin==<br />
Hi. A recently blocked contributor, [[User:Wiki id2]], acknowledged that all of the images he had uploaded under claim of his own authorship were not actually his, except one. Since that one ([[:File:Taha Hussain.PNG]]) was a clear crop, I suggested he upload the complete picture to help prove that he was the photographer. He has now uploaded [[:File:Taha Hussain.jpg]], and requests that we delete it once we are satisfied. Since images are way more your thing, would you mind taking a look? Should that alleviate my concerns about that image? It doesn't have metadata, but looks plausible. Your input would be appreciated. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 17:08, 20 July 2010 (UTC)<br />
:Hey :-) Based on contributions, I have every reason to suspect that Wiki id2 is a Pakistani person in the same age range as Taha Hussain, so may very well have been in a position to take a photograph of him (he's also himself responsible for the article). The resolution is unusual (it's probably a downscale of the original using some kind of standard photo editing tool, as no real camera would produce an image with this resolution), but it seems legit to me. [[User:Dcoetzee|Dcoetzee]] 20:05, 20 July 2010 (UTC)<br />
::Thank you kindly. :) I will not pursue this one further, then, but will regard it as plausible based on this and based on his coming clean, eventually, about the other content. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 19:22, 20 July 2010 (UTC)<br />
<br />
<br />
<br />
==Happy Dcoetzee's Day!==<br />
{| style="border: 2px ridge #4682B4; -moz-border-radius: 10px; background-color: #EAF5FF; margin: 0 auto; padding: 8px; text-align: center;"<br />
|[[Image:Featured article star.svg|150px|none|left]]<br />
|style="padding-left: 20px; padding-right: 10px; font-family: Comic Sans MS, sans-serif; font-size: 9pt; text-align: center;"|<br />
'''[[User:Dcoetzee]]''' has been identified as an '''''Awesome Wikipedian''''',<br /><br />
and therefore, I've officially declared today as [[User:Rlevse|Dcoetzee's day]]!<br /><br />
For being such a beautiful person and great Wikipedian,<br /><br />
enjoy being the Star of the day, dear Dcoetzee!<br />
<br />
Peace,<br />[[User:Rlevse|<b style="color:#090;">R<span style="color:#0A0;">l<span style="color:#0B0;">e<span style="color:#0C0;">v<span style="color:#0D0;">s</span>e</b>]]<br />01:47, 24 July 2010 (UTC)<br />
<br />
<small>A record of your Day will always be kept [[User:Rlevse/Today/Archive|here]].</small><br />
|}<br />
<br />
For a userbox you can add to your userbox page, see [[User:Rlevse/Today/Happy Me Day!]] and my own userpage for a sample of how to use it.<span style="font-family:Verdana,sans-serif"> — [[User:Rlevse|<b style="color:#060;"><i>R</i>levse</b>]] • [[User_talk:Rlevse|<span style="color:#990;">Talk</span>]] • </span> 01:47, 24 July 2010 (UTC)<br />
:Thank you, Rlevse. :-) [[User:Dcoetzee|Dcoetzee]] 01:50, 24 July 2010 (UTC)<br />
== Verifiability ==<br />
* {{On AFD|Universal data compression}}<br />
[http://en.wikipedia.org/w/index.php?title=Universal_data_compression&diff=373216859&oldid=371930172 Because] [http://en.wikipedia.org/w/index.php?title=Universal_data_compression&diff=370169528&oldid=370107143 you changed the article] so that it no longer matched the sources cited, deletion is being called for yet again, here. Please fix this, citing the source that you had for your different definition, to quash this argument. [[User:Uncle G|Uncle G]] ([[User talk:Uncle G|talk]]) 03:37, 25 July 2010 (UTC)<br />
:If I recall correctly my rewording was based on the references already listed in the article. I just put it in my own words, as we are required to do. If the fact that this is a rewording is unclear, perhaps the explanation is inadequate. If I recall incorrectly, then I can't remember where I found the sources I used, nor how I found them. [[User:Dcoetzee|Dcoetzee]] 04:35, 25 July 2010 (UTC)<br />
<br />
==Chime in==<br />
Could you chime in here and maybe update the article: [[User_talk:Jesse_Viviano#IPsec]]? Thanks. <span style="font-family:Verdana,sans-serif"> — [[User:Rlevse|<b style="color:#060;"><i>R</i>levse</b>]] • [[User_talk:Rlevse|<span style="color:#990;">Talk</span>]] • </span> 00:13, 28 July 2010 (UTC)<br />
<br />
==Close paraphrasing?==<br />
Hi, Derrick. :) There's a question at my talk page about the paraphrasing in [[Len Lawson]]. We could use another set of eyes. More information is available at its talk page and at mine, [[User_talk:Moonriddengirl#Copyviolation_or_just_close_paraphrasing_on_Len_Lawson.3F|here]], if you have time. It would, as always, be much appreciated. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 00:51, 28 July 2010 (UTC)<br />
<br />
==Math!==<br />
Yes, me again. :) There's a question at my talk page about whether an article that was once deleted for copyright concerns is now copyright-problem free. For background, see [[Wikipedia:AN#Deletion of Copyrighted Material]]. The question at my talk page is [[User_talk:Moonriddengirl#Thanks_for_your_Reply|here]]; the rewrite is [[Poincaré complex|here]] and the source is [http://eom.springer.de/p/p072990.htm here]. Can you take a look and give feedback at my talk page or at [[User talk:Fly by Night]]? I'd be ever so grateful. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 18:04, 6 August 2010 (UTC)<br />
:Replied, sorry for the delay. :-) [[User:Dcoetzee|Dcoetzee]] 06:10, 8 August 2010 (UTC)<br />
::Thanks Dcoetzee! I appreciate you taking the time to help. The use of <math>\scriptstyle \frown</math> in place of <math>\scriptstyle \cap</math> was two-fold. Firstly I think <math>\scriptstyle \frown</math> looks nicer, and secondly the [[cap product]] article uses <math>\scriptstyle \frown</math> insead of <math>\scriptstyle \cap</math>. <span style="white-space:nowrap;">— [[User:Fly by Night|<span style="font-family:Segoe print">'''''Fly by Night'''''</span>]] <font color="#000000">([[User talk:Fly by Night|<span style="font-family:Segoe print">talk</span>]])</font></span> 19:07, 8 August 2010 (UTC)<br />
:::Thanks, Derrick! You remain a prince among men. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 21:28, 8 August 2010 (UTC)<br />
::::She's a charmer, isn't she? ☺ <span style="white-space:nowrap;">— [[User:Fly by Night|<span style="font-family:Segoe print">'''''Fly by Night'''''</span>]] <font color="#000000">([[User talk:Fly by Night|<span style="font-family:Segoe print">talk</span>]])</font></span> 21:59, 8 August 2010 (UTC)<br />
:::::Always :-) Glad to help. [[User:Dcoetzee|Dcoetzee]] 02:08, 10 August 2010 (UTC)<br />
<br />
== about Willy On Wheels ==<br />
<br />
Hello,<br />
<br />
I'm french and i tried to read your essay about vandal called "willy on wheels"… but i do not understand everything. <br />
new comer on wikipédia, I cant find the way to find a translator of your essay for the french wikipedia. could you please help me ?<br />
<br />
thank you <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/93.15.245.176|93.15.245.176]] ([[User talk:93.15.245.176|talk]]) 11:48, 22 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Does [http://translate.google.com/translate?js=y&prev=_t&hl=en&ie=UTF-8&layout=1&eotf=1&u=http%3A%2F%2Fen.wikipedia.org%2Fwiki%2FUser%3ADcoetzee%2FWilly_on_Wheels%3AA_Case_Study&sl=en&tl=fr this help]? Since my French is very poor, I do not know if their translation is very good. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 23:04, 29 August 2010 (UTC)<br />
<br />
==Yes, c'est moi==<br />
[[User:Fly by Night]] has found another copyvio in a math related article. It's the last listing at [[Wikipedia:Copyright problems/2010 August 21]]. Can I possibly drop this on your lap? The rest of the day (including SCV) is done. I'd appreciate it. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 23:01, 29 August 2010 (UTC)<br />
:Sorry for the delay, taking a look now. :-) [[User:Dcoetzee|Dcoetzee]] 15:08, 2 September 2010 (UTC)<br />
::See my note there. Could unfortunately not resolve this without access to the source. [[User:Dcoetzee|Dcoetzee]] 15:17, 2 September 2010 (UTC)<br />
:::I may have downloaded the pdf at home. I'll take a look tonight and see if I still have it. [[User:VernoWhitney|VernoWhitney]] ([[User talk:VernoWhitney|talk]]) 15:57, 2 September 2010 (UTC)<br />
::::That would be great, Verno. :) I had the same issue with accessing the source, but I wasn't quite sure if it would be something that might be more obvious to you than to me. I appreciate your looking, Derrick. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 16:14, 2 September 2010 (UTC)<br />
:::::Okay, I do have the source, and noticed that it's a revised version of the paper located at http://at.yorku.ca/i/d/e/a/35.htm. If none of those formats work for you I can get you the pdf version somehow. [[User:VernoWhitney|VernoWhitney]] ([[User talk:VernoWhitney|talk]]) 01:17, 3 September 2010 (UTC)<br />
::::::Thanks - I really should've been able to find that as it was cited. The proof was quite long and copied character for character, which is not okay. The definition, like many mathematical definitions, is quite difficult to put in any other words, and that's okay - I rephrased it a bit just to be careful. All clean. [[User:Dcoetzee|Dcoetzee]] 07:13, 3 September 2010 (UTC)<br />
:::::::Thank you both. :) --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 15:57, 3 September 2010 (UTC)<br />
<br />
==DNB WikiProject==<br />
<br />
I don't know how interesting this is for you: but [[Wikipedia:WikiProject Dictionary of National Biography]] has just been set up formally. This could be a good place to marry up historical images with articles on their subjects, at least. [[User:Charles Matthews|Charles Matthews]] ([[User talk:Charles Matthews|talk]]) 18:59, 9 September 2010 (UTC)<br />
<br />
== [[Wikipedia:Miscellany for deletion/Secret pages 2]] ==<br />
<br />
Because you participated in [[Wikipedia:Miscellany for deletion/User:Some Person/The Real Secret Page and Secret Barnstar]], you may be interested in [[Wikipedia:Miscellany for deletion/Secret pages 2]]. [[User:Cunard|Cunard]] ([[User talk:Cunard|talk]]) 06:27, 12 September 2010 (UTC)<br />
<br />
==Close paraphrasing explanation?==<br />
Hi, Derrick. I am trying to explain close paraphrasing at [[User talk:Trackinfo#Copyright violation]], but it's late in my part of the world. Knowing your familiarity with the issue (not to mention the essay :D), could you drop by and clarify? I'm sure you can explain it more succinctly than I. I'd be grateful. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 00:45, 13 September 2010 (UTC)<br />
:Oh, I should note, his latest version is much better than his first, but, in my opinion, still follows too closely: [http://en.wikipedia.org/w/index.php?title=Pat_McCormick_%28diver%29&action=historysubmit&diff=384493043&oldid=384490300]. --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 00:47, 13 September 2010 (UTC)<br />
:Done. :-) [[User:Dcoetzee|Dcoetzee]] 00:58, 13 September 2010 (UTC)<br />
<br />
==You need a separate talk page just for my requests==<br />
Hi, Derrick.<br />
<br />
There's a Commons image copyright question at my talk page, and I am in need of somebody familiar with the ins-and-outs of Commons copyright to help out. If you have an oppportunity, could you weigh in at [[User_talk:Moonriddengirl#Arecibo_Telescope_Photo|this thread]]? If you don't have the opportunity, let me know, and I'll pester somebody else. :D --[[User:Moonriddengirl|Moonriddengirl]] <sup>[[User talk:Moonriddengirl|(talk)]]</sup> 19:31, 17 September 2010 (UTC)<br />
<br />
== [[Wikipedia:Adopt-a-User|Adopt-a-user]] reminder ==<br />
<br />
Hello, I have completed a general cleanup of the adopter information page for the adopt-a-user project, located [[Wikipedia:Adopt-a-User/Adoptee's_Area/Adopters|here]]. During my cleanup, I have removed several inactive and retired users. In order to provide interested adoptees with an easy location to find adopters, it is essential that the page be up-to-date with the latest information possible. Thus:<br />
<br />
* If you are no longer interested in being an adopter, please remove yourself from the list.<br />
* If you are still interested, please check the list to see if any information needs to be updated or added - especially your availability. Thank you.<br />
<br />
* You are receiving this message because you are listed as an adopter [[Wikipedia:Adopt-a-User/Adoptee's_Area/Adopters|here]].<br />
<br />
<small>Delivered by [[User:MessageDeliveryBot|MessageDeliveryBot]] on behalf of [[User:Netalarm|Netalarm]] ([[User talk:Netalarm|talk]]) at 03:34, 23 September 2010 (UTC).</small><br />
<!-- Delivery approved by [[User:Netalarm]]. --><br />
==Repeated links proposal==<br />
This is [[User:Michael C Price/links|a proposal]] to change the [[WP:REPEATLINK|Repeated links section]] of the MOS. Please edit &/or comment on the talk page as you see fit.<br />
<br />
Feel free to move the proposal/discussion straight to the [[Wikipedia talk:Manual of Style (linking)]] if you wish. I just thought we might establish some sort of consensus first, out of the heat and fury over [[Wikipedia talk:Manual of Style (linking)|there]]. --[[User:Michael C Price|Michael C. Price]] <sup>[[User talk:Michael C Price|talk]]</sup> 10:20, 28 September 2010 (UTC)<br />
<br />
==When making changes to scientific articles you have to understand the subject==<br />
You rearranged sections in arithmetic coding. Do you understand that first part is not clear for anyone who try to become familiar with the subject. It does not matter if it is right or wrong, it does not explain anything. The explanation that arithmetic coding narrows interval on every step is right or meaningless. People need to understand where compression comes from. Why narrowing down interval leads to shorter message? Why this shorter message is shortest possible? And how to restore message back from final interval? Besides that, first section does not mention that compression occur by choosing shortest fraction from final interval and not from narrowing down the interval itself. I wrote that sections that you moved down. I actually don't care if you remove them or not because I explained everything on my web site, which shown by Google on the first page even before wiki. Did you write your own arithmetic coder ever? I wrote several coders in open source that are used by people. If you want to arithmetic coding via narrowing interval starting from [0,1) that is fine, but explain how to encode, decode, explain why it is numerically stable and converge and what is the limit to which it converges. It takes two pages of printed text to explain this and reader needs to know high school math to understand it but it requires high level on understanding to be able to explain it. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 08:25, 3 October 2010 (UTC)</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Reliable_sources/Noticeboard&diff=386131529Wikipedia:Reliable sources/Noticeboard2010-09-21T16:57:37Z<p>C-processor: /* Polar codes, by Andrew Polar */</p>
<hr />
<div>{{Wikipedia:Reliable sources/Noticeboard/Header}}<br />
{{User:MiszaBot/config<br />
|maxarchivesize = 250K<br />
|counter = 76<br />
|algo = old(3d)<br />
|archive = Wikipedia:Reliable sources/Noticeboard/Archive %(counter)d<br />
}}<br />
{{Archive box|auto=yes|}}<br />
<br />
__TOC__ <br />
__NEWSECTIONLINK__<br />
<br />
<!--<br />
------------------------------------------------------------------------------<br />
NEW ENTRIES GO TO THE BOTTOM OF THE PAGE AS A NEW SECTION<br />
------------------------------------------------------------------------------<br />
--><br />
<br />
== Sources for nutrition issue: Monosodium glutamate ==<br />
<br />
The following was written in the main monosodium glutamate article but then constantly removed by three editors: [http://en.wikipedia.org/wiki/User:Sciencewatcher sciencewatcher], [http://en.wikipedia.org/wiki/User:Dbrodbeck Ddbrodbeck] and [http://en.wikipedia.org/wiki/User:Sakkura Sakkura].<br />
<br />
''On the other side, [[John Olney]], who was elected to the Institute of Medicine of the United States National Academy of Sciences, stated: "[W]henI first reported that glutamate can kill neurons by exciting them to death, this finding was not only rejected, it was ridiculed by established authority. It required about 15 years before the pendulum began swinging in the other direction. ... it is my belief ... it probably is an occult contributor to neurodevelopmental disabilities in human populations throughout the civilized world."<ref name="University of Iowa">{{Cite| url=http://www.medicine.uiowa.edu/alumni/interviews/olney_john.html| work=Alumni Interview| accessdate=2010-09-13 | title=John Olney, M.D.| first=| last=| date=2008}}</ref> The [[American Academy of Family Physicians]], one of the largest medical organizations in the United States, concludes that an overstimulation by glutamate generally may result in neuronal damage and has been implicated in neurodegenerative disorders such as Alzheimer.<ref name="American Academy of Family Physicians">{{Cite| url=http://www.aafp.org/afp/2004/0315/p1491.html| work=| accessdate=2010-09-13 | title=Memantine (Namenda) for Moderate to Severe Alzheimer’s Disease| first=| last=| date=2004}}</ref> <br />
''Health risks of MSG remain a subject of controversy.''''<br />
<br />
Sources were the following:<br />
<br />
[http://www.medicine.uiowa.edu/alumni/interviews/olney_john.html University of Iowa] <br />
<br />
[http://www.aafp.org/afp/2004/0315/p1491.html American Academy of Family Physicians]<br />
<br />
<br />
The whole [http://en.wikipedia.org/wiki/Monosodium_glutamate#Health_concerns section] reads as follows:<br />
<br />
'''Health concerns'''<br />
<br />
{{Main|Glutamic acid (flavor)#Research into health effects|l1=Health effects research into Glutamic acid}}<br />
<br />
''A report from the [[Federation of American Societies for Experimental Biology]] ([[FASEB]]) compiled in [[1995]] on behalf of the [[Food and Drug Administration (United States)|United States Food and Drug Administration]] (FDA) concluded that MSG is safe for most people when “eaten at customary levels”. However, it also said that, based on [[Anecdotal evidence|anecdotal reports]], some people may have an MSG [[food intolerance|intolerance]] that causes “MSG symptom complex” and/or a worsening of [[asthma|asthmatic symptoms]].<ref>[http://vm.cfsan.fda.gov/~lrd/msg.html FDA Backgrounder: FDA and Monosodium Glutamate]</ref> Other research published in the "Journal of Nutrition" found that, while large doses of MSG given without food may elicit more symptoms than a placebo in individuals who believe that they react adversely to MSG, the frequency of the responses was low and the responses reported were inconsistent, not reproducible, and not observed when MSG was given with food.<ref name="geha"/> No [[association (statistics)|statistical association]] has been demonstrated under controlled conditions, even in studies with people convinced that they are sensitive to it.<ref name="geha"><br />
{{cite journal<br />
| author = Geha RS, Beiser A, Ren C, ''et al.''<br />
| title = Review of alleged reaction to monosodium glutamate and outcome of a multicenter double-blind placebo-controlled study<br />
| journal = J. Nutr.<br />
| volume = 130<br />
| issue = 4S Suppl<br />
| pages = 1058S–62S<br />
| year = 2000<br />
| month = April<br />
| pmid = 10736382<br />
| doi =<br />
| url = http://jn.nutrition.org/cgi/pmidlookup?view=long&pmid=10736382}}</ref><ref name="Tarasoff"><br />
{{cite journal<br />
| author = Tarasoff L., Kelly M.F.<br />
| title = Monosodium L-glutamate: a double-blind study and review<br />
| journal = Food Chem. Toxicol.<br />
| volume = 31<br />
| issue = 12<br />
| pages = 1019–1035<br />
| year = 1993<br />
| pmid = 8282275<br />
| doi = 10.1016/0278-6915(93)90012-N<br />
}}<br />
</ref><ref><br />
{{cite journal<br />
| author = Freeman M.<br />
| title = Reconsidering the effects of monosodium glutamate: a literature review<br />
| journal = J Am Acad Nurse Pract<br />
| volume = 18<br />
| issue = 10<br />
| pages = 482–6<br />
| year = 2006<br />
| month = October<br />
| pmid = 16999713<br />
| doi = 10.1111/j.1745-7599.2006.00160.x<br />
| url =<br />
}}<br />
</ref><ref>{{cite journal<br />
| author = Walker R<br />
| title = The significance of excursions above the ADI. Case study: monosodium glutamate<br />
| journal = Regul. Toxicol. Pharmacol.<br />
| volume = 30<br />
| issue = 2 Pt 2<br />
| pages = S119–S121<br />
| year = 1999<br />
| month = October<br />
| pmid = 10597625<br />
| doi = 10.1006/rtph.1999.1337<br />
| url = }}</ref> Adequately controlling for experimental bias includes a [[placebo-controlled studies|placebo-controlled]] [[blind experiment|double-blind]] experimental design and the application in capsules because of the strong and unique after-taste of glutamates.<ref name="Tarasoff" /><br />
<br />
''On the other side, [[John Olney]], who was elected to the Institute of Medicine of the United States National Academy of Sciences, stated: "[W]henI first reported that glutamate can kill neurons by exciting them to death, this finding was not only rejected, it was ridiculed by established authority. It required about 15 years before the pendulum began swinging in the other direction. ... it is my belief ... it probably is an occult contributor to neurodevelopmental disabilities in human populations throughout the civilized world."<ref name="University of Iowa">{{Cite| url=http://www.medicine.uiowa.edu/alumni/interviews/olney_john.html| work=Alumni Interview| accessdate=2010-09-13 | title=John Olney, M.D.| first=| last=| date=2008}}</ref> The [[American Academy of Family Physicians]], one of the largest medical organizations in the United States, concludes that an overstimulation by glutamate generally may result in neuronal damage and has been implicated in neurodegenerative disorders such as Alzheimer.<ref name="American Academy of Family Physicians">{{Cite| url=http://www.aafp.org/afp/2004/0315/p1491.html| work=| accessdate=2010-09-13 | title=Memantine (Namenda) for Moderate to Severe Alzheimer’s Disease| first=| last=| date=2004}}</ref> <br />
''Health risks of MSG remain a subject of controversy.''''<br />
<br />
<br />
Since the issue of possible health concerns connected to MSG is, indeed, an issue of controversy as it can be seen in {{Main|Glutamic acid (flavor)#Research into health effects|l1=Health effects research into Glutamic acid}} the main MSG page section should reflect a short summary of that controversy not just one side of the issue. <br />
Also, the sources for the critical side of the issue are reliable.<br />
<br />
<br />
Sakkura, Ddrodbeck and sciencewatcher claim these sources were not good, and were violating the weight which must be given to specific positions. I disagree. And others before me did too. If you see the [http://en.wikipedia.org/wiki/Talk:Monosodium_glutamate talk page] of the issue, it becomes evident that user sciencewatcher i. e. has removed all content in the past, which questioned the safety of MSG. But wikipedia should not become a place for industry agenda-pushing.<br />
<br />
<br />
There is also a dispute about the source EUFIC. EUFIC is linked to under [http://en.wikipedia.org/w/index.php?title=Monosodium_glutamate&diff=384642079&oldid=384628313 External Links] with the description "The facts on Monosodium Glutamate" (it has been changed by me, but will probably be reverted). EUFIC's funders, however, include: Coca-Cola, DSM Nutritional Products Europe Ltd., Ferrero, Groupe Danone, Kraft Foods, McDonald's, Nestlé, Pfizer, Procter & Gamble, Suedzucker, etc<br />
<br />
Sakkura, Ddrodbeck and sciencewatcher consider EUFIC to be a reliable source for nutrition issues nevertheless. They wrote the following:<br />
<br />
''Just because there is a conflict of interest in the funding does not make a source "unreliable". We include many drug studies funded by the drug companies themselves (and this is generally noted in the text). The EUFIC website does seem to represent the scientific consensus. --[[User:Sciencewatcher|sciencewatcher]] ([[User talk:Sciencewatcher|talk]]) 18:58, 13 September 2010 (UTC)<br />
<br />
:''Agreed. [[User:Dbrodbeck|Dbrodbeck]] ([[User talk:Dbrodbeck|talk]]) 19:47, 13 September 2010 (UTC)''<br />
<br />
::''I concur. It should also be noted that EUFIC receives funding from the EU, so it isn't just funded by the industry. [[User:Sakkura|Sakkura]] ([[User talk:Sakkura|talk]]) 21:08, 13 September 2010 (UTC)''<br />
<br />
<br />
So we need an opinion about the validity of three sources:<br />
<br />
EUFIC<br />
<br />
[http://www.medicine.uiowa.edu/alumni/interviews/olney_john.html University of Iowa] <br />
<br />
[http://www.aafp.org/afp/2004/0315/p1491.html American Academy of Family Physicians]<br />
<br />
Thx. And I ask the above mentioned editors to stay out of this. Just let third parties decide.[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 14 September 2010 (UTC)<br />
<br />
:Uninvolved user response. These three sources are all quite different. EUFIC is likely to receive much more industry funding than EU funding. It can't really be regarded as scientifically neutral, but is probably OK for an external link. The link should be described correctly. A university interview with an alumnus is not a suitable source for a science article. Moreover, it's not clear that the subject of the article is talking about dietary consumption of glutamate. ''American Family Physician'' is a regular peer-reviewed journal. The issue about using it in a science article is whether an individual article should be regarded as a primary source. Ideally, we are looking for reviews of the literature rather than individual items in the literature. [[User:Itsmejudith|Itsmejudith]] ([[User talk:Itsmejudith|talk]]) 10:42, 14 September 2010 (UTC)<br />
<br />
<br />
<br />
Thank you for your time, Itsmejudith. If EUFIC (although not reliable) is ok as an external link, then links to NGOs such as [http://www.truthinlabeling.org/ Truth in Labeling] should be also, right? Because such links have been removed by the above users. Truth in Labeling are an NGO campaigning for MSG to be labeled on food containing it. <br />
<br />
Also, the university interview was done with [[John Olney]], who was elected to the Institute of Medicine of the United States National Academy of Sciences. He has campaigned for greater regulation of monosodium glutamate (MSG), aspartame and other excitotoxins for over twenty years. So he is talking about MSG but I see your point that it does not become evident in the linked interview. What about the following source (as a better replacement source)? It was released by the United States General Accounting Office and states:<br />
<br />
<br />
"Dr. Olney said that large doses of aspartame or combined dosesdoses of aspartame and monosodium glutamate, another food additive, could cause brain damage in infants and young children. He claimed that, based on research done by himself and others, '''L-aspartic acid (a component of aspartame) exhibited the same toxic response in the brain''' '''as exhibited by monosodium glutamate''' in earlier studies. He stated that '''the neurotoxicity (poisonous to the nervous system) of the substances''' is augmented when they are combined. ... Regarding Dr. Olney's objections, '''the Bureau of Foods ... noted''' that''' L-aspartic acid and monosodium glutamate can act similarly and are of about equal potency''' but did not agree that their effect would be augmented when combined." [http://archive.gao.gov/f0402/099382.pdf USGAO source p 9-10]<br />
<br />
This should be a valid source. What do you say? <br />
<br />
<br />
So the three issues to be considered are:<br />
<br />
1 If EUFIC as an unreliable source is included under External Links, Truth in Labeling can be included also. <br />
<br />
2 The USGAO report explicitly mentions the effects of monosodium glutamate as described by [[John Olney]] and the Bureau of Foods. It constitutes a reliable source and should not be removed when included into a short summary about health concerns in the main monosodium glutamate article.<br />
<br />
3 Although the [[American Family Physician]] source may not be ideal, it is still considered valid and reliable and thus should not be removed.<br />
<br />
Do you agree on these three points or on some of them?[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 14 September 2010 (UTC)<br />
<br />
:I would say, regarding:<br />
:*1). No, sources should be evaluated individually. [http://www.truthinlabeling.org/ Truth in Labeling] home page says "This Web site is dedicated to people with problems that once defied medical diagnosis -- people who discovered that elimination of MSG from their diets let them be well," so they have a clear bias, and I note that many of the web pages there (all that I visited) lack references to any scientific material (see [http://www.truthinlabeling.org/SomethingToThinkAbout.html this], and [http://www.truthinlabeling.org/formulacopy.html this, which contains data from an unreferenced "canadian study". Clearly not reliable.<br />
:*2). Yes, the USGAO report you mentioned explicitly mentions that Dr. Olney ''claimed'' that monosodium glutamate is harmful, and that he ''claimed'' that conclusion was based on studies done by himself and others. I think it is a primary source that should probably not be used for that reason, could only be used in a very limited way if at all, but it basically reliable in terms of the claims made by Dr. Olney. Whether or not those statements should be in the article on MSG is another question.<br />
:*3). Yes, I think the site may be considered a reliable source, but [http://www.aafp.org/afp/2004/0315/p1491.html this blub] is not appropriate for the [[Monosodium glutamate]] article, since Monosodium glutamate is not mentioned in it. The statement "Overstimulation by glutamate may result in neuronal damage" appears there but is not sourced, and to draw any conclusions about MSG based on that statement would be [[WP:SYNTH]]. But that's another notice board. <span style="text-shadow:#DDDDDD 0.2em 0.2em 0.1em; class=texthtml">--[[User:Nuujinn|Nuujinn]] ([[User_talk:Nuujinn|talk]])</span> 09:15, 15 September 2010 (UTC)<br />
<br />
:: Sorry, but American Family Physician is not the highest quality source, and if it contradicts higher quality medical secondary reviews, should not be used. WRT [[Tourette syndrome]], the AFP physician printed several errors; it just isn't as high quality as some other medical sources. [[User:SandyGeorgia|Sandy<font color="green">Georgia</font>]] ([[User talk:SandyGeorgia|Talk]]) 16:25, 15 September 2010 (UTC)<br />
<br />
:::Just to be clear, I agree that it is not the best source and should not be used if better sources on the same topic are available. <span style="text-shadow:#DDDDDD 0.2em 0.2em 0.1em; class=texthtml">--[[User:Nuujinn|Nuujinn]] ([[User_talk:Nuujinn|talk]])</span> 10:53, 16 September 2010 (UTC)<br />
<br />
<br />
1) If a bias is reason for not including an NGO such as Truth in Labeling under External Links, EUFIC should not be included. An organization which evaluates the safety of food products, produced by some of its major funders is not a reliable source and not to be included. Either there are only reliable sources or sources with a bias are allowed. You cannot outrule the bias by one organization and allow the one by another. Agree?<br />
<br />
2) Since there are scientists (who enjoy a very high prestige among some scientists) who consider mononatrium glutamate to have considerable health effects, these concerns should be mentioned (if only shortly, but nonetheless mentioned) in a summary about MSG health concerns. Agree? Such a new health concern section could read:<br />
<br />
'''Health concerns'''<br />
<br />
{{Main|Glutamic acid (flavor)#Research into health effects|l1=Health effects research into Glutamic acid}}<br />
<br />
''A report from the [[Federation of American Societies for Experimental Biology]] ([[FASEB]]) compiled in [[1995]] on behalf of the [[Food and Drug Administration (United States)|United States Food and Drug Administration]] (FDA) concluded that MSG is safe for most people when “eaten at customary levels”. However, it also said that, based on [[Anecdotal evidence|anecdotal reports]], some people may have an MSG [[food intolerance|intolerance]] that causes “MSG symptom complex” and/or a worsening of [[asthma|asthmatic symptoms]].<ref>[http://vm.cfsan.fda.gov/~lrd/msg.html FDA Backgrounder: FDA and Monosodium Glutamate]</ref> One study published in the "Journal of Nutrition" found that, while large doses of MSG given without food may elicit more symptoms than a placebo in individuals who believe that they react adversely to MSG, the frequency of the responses was low and the responses reported were inconsistent, not reproducible, and not observed when MSG was given with food.<ref name="geha"/> The study stated that no [[association (statistics)|statistical association]] has been demonstrated under controlled conditions, even in studies with people convinced that they are sensitive to it.<ref name="geha"><br />
{{cite journal<br />
| author = Geha RS, Beiser A, Ren C, ''et al.''<br />
| title = Review of alleged reaction to monosodium glutamate and outcome of a multicenter double-blind placebo-controlled study<br />
| journal = J. Nutr.<br />
| volume = 130<br />
| issue = 4S Suppl<br />
| pages = 1058S–62S<br />
| year = 2000<br />
| month = April<br />
| pmid = 10736382<br />
| doi =<br />
| url = http://jn.nutrition.org/cgi/pmidlookup?view=long&pmid=10736382}}</ref><ref name="Tarasoff"><br />
{{cite journal<br />
| author = Tarasoff L., Kelly M.F.<br />
| title = Monosodium L-glutamate: a double-blind study and review<br />
| journal = Food Chem. Toxicol.<br />
| volume = 31<br />
| issue = 12<br />
| pages = 1019–1035<br />
| year = 1993<br />
| pmid = 8282275<br />
| doi = 10.1016/0278-6915(93)90012-N<br />
}}<br />
</ref><ref><br />
{{cite journal<br />
| author = Freeman M.<br />
| title = Reconsidering the effects of monosodium glutamate: a literature review<br />
| journal = J Am Acad Nurse Pract<br />
| volume = 18<br />
| issue = 10<br />
| pages = 482–6<br />
| year = 2006<br />
| month = October<br />
| pmid = 16999713<br />
| doi = 10.1111/j.1745-7599.2006.00160.x<br />
| url =<br />
}}<br />
</ref><ref>{{cite journal<br />
| author = Walker R<br />
| title = The significance of excursions above the ADI. Case study: monosodium glutamate<br />
| journal = Regul. Toxicol. Pharmacol.<br />
| volume = 30<br />
| issue = 2 Pt 2<br />
| pages = S119–S121<br />
| year = 1999<br />
| month = October<br />
| pmid = 10597625<br />
| doi = 10.1006/rtph.1999.1337<br />
| url = }}</ref> Adequately controlling for experimental bias includes a [[placebo-controlled studies|placebo-controlled]] [[blind experiment|double-blind]] experimental design and the application in capsules because of the strong and unique after-taste of glutamates.<ref name="Tarasoff" /><br />
<br />
''On the other side, scientists like Dr. [[John Olney]], who was elected to the Institute of Medicine of the United States National Academy of Sciences, stated that monosodium glutamate exhibits a toxic response in the brain.<ref name="U.S. General Accounting Office (USGAO) report">{{Cite| url=http://archive.gao.gov/f0402/099382.pdf | work=U.S. General Accounting Office (USGAO) report| accessdate=2010-09-14 | title=Regulation of the food additive Aspartame. Food and Drug Administration. Department of Health, Education and Welfare| first=| last=| date=2008}}</ref> Regarding Dr. Olney's findings about the neurotoxicity of monosodium glutamate the U.S. Bureau of Foods agreed that monosodium glutamate can act similarly as L-aspartic acid (a component of Aspartame) and both "are of about equal potency".<ref name="U.S. General Accounting Office (USGAO) report">{{Cite| url=http://archive.gao.gov/f0402/099382.pdf | work=U.S. General Accounting Office (USGAO) report| accessdate=2010-09-14 | title=Regulation of the food additive Aspartame. Food and Drug Administration. Department of Health, Education and Welfare| first=| last=| date=2008}}</ref> Health risks of MSG remain a subject of controversy among some experts.<ref name="U.S. General Accounting Office (USGAO) report">{{Cite| url=http://archive.gao.gov/f0402/099382.pdf | work=U.S. General Accounting Office (USGAO) report| accessdate=2010-09-14 | title=Regulation of the food additive Aspartame. Food and Drug Administration. Department of Health, Education and Welfare| first=| last=| date=2008}}</ref>''<br />
<br />
Do you consider that version appropriate?<br />
[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 15 September 2010 (UTC)<br />
<br />
<br />
:No, I don't, but my feeling is that it is better to have discussion of specific wording of the article on the article's talk page, rather than here. I will point out, however, that I think you are grossly misrepresenting the USGAO report, and suggest you might review [[WP:SYNTH]], BTANB.<br />
:Regarding 1) above, no, I do not agree. Truth in Labeling is clearly not a reliable source, whether or not it is an NGO, and my opinion on that hasn't anything to do with their bias. The "evidence" presented there is not supported by references, and they have no standing as a reliable source in general--claims based on personal email, anonymous quotations, and unnamed studies are simply not reliable, and thus Truth in Labeling is no more reliable than my personal blog.<br />
:Regarding 2), No, but not because I believe that such negative health effect do not exist (aspartame gives me severe headaches, and msg is apparently linked to migraines in some of my friends). The question is what can be properly sourced, and the USGAO report you present does not support the claims in the text above. <span style="text-shadow:#DDDDDD 0.2em 0.2em 0.1em; class=texthtml">--[[User:Nuujinn|Nuujinn]] ([[User_talk:Nuujinn|talk]])</span> 10:53, 16 September 2010 (UTC)<br />
<br />
<br />
Well, then we strongly disagree. <br />
<br />
Regarding 1): Truth in Labeling does source many of the information they give. See [http://www.truthinlabeling.org/Obesity_Data.html here], [http://www.truthinlabeling.org/Cancer.html here 2], or [http://www.truthinlabeling.org/l-manuscript.html here 3]. They use what you would call reliable scientific sources. <br />
<br />
Regarding 2): How do I mispresent the USGAO study? They write: "He [Dr. Olney] claimed that, based on research done by himself and others, L-aspartic acid (a component of aspartame) exhibited the same toxic response in the brain as exhibited by monosodium glutamate in earlier studies. He stated that the neurotoxicity (poisonous to the nervous system) of the substances is augmented when they are combined." I summarized: "[S]cientists like Dr. [[John Olney]], who was elected to the Institute of Medicine of the United States National Academy of Sciences, stated that monosodium glutamate exhibits a toxic response in the brain." (This is true and mentioned in the USGAO report.) The report further states: "Regarding Dr. Olney's objections, the Bureau of Foods ... noted that L-aspartic acid and monosodium glutamate can act similarly and are of about equal potency but did not agree that their effect would be augmented when combined." I summarized: "Regarding Dr. Olney's findings about the neurotoxicity of monosodium glutamate [should have added: and Aspartame] the U.S. Bureau of Foods agreed that monosodium glutamate can act similarly as L-aspartic acid (a component of Aspartame) and both "are of about equal potency"." (This is true and mentioned in the USGAO report also.) <br />
<br />
You guys are very well organized around here. You know the possible effects of MSG as you stated yourself. Everyone makes their own choices in life and is responsible for them. '''If''' you are interested in a correct presentation of the issue then tell me how you would shortly summarize the concerns by some scientists about the health effects.[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 16 September 2010 (UTC)<br />
<br />
<br />
:I'm not sure how to answer all of this, but I think most of it isn't relevant to this noticeboard. You're here to ask for feedback about the reliability of sources, and you're getting responses. I'm sorry you don't like them, but that's how it goes sometimes. <span style="text-shadow:#DDDDDD 0.2em 0.2em 0.1em; class=texthtml">--[[User:Nuujinn|Nuujinn]] ([[User_talk:Nuujinn|talk]])</span> 17:24, 16 September 2010 (UTC)<br />
<br />
Two questions: 1) why are primary sources being used in that article, and 2) why are such old sources being used? Per [[WP:MEDRS]], the sources should be secondary reviews, not primary sources, and there are plenty available at [[PubMed]]. See [[Wikipedia:Wikipedia Signpost/2008-06-30/Dispatches|this Dispatch]] for help in locating the kinds of secondary reviews that should be used in medical articles-- using high-quality recent reviews will help avoid disputes. [[User:SandyGeorgia|Sandy<font color="green">Georgia</font>]] ([[User talk:SandyGeorgia|Talk]]) 18:50, 16 September 2010 (UTC)<br />
<br />
This all sounds like cherry-picking. Observing the responses in brain tissue to glutamic acid (as described by Olney and the AAFP sources) does not mean that anyone who ingests glutamic acid is exposed to these harms. To make such claims you would need an experiment where it is proven beyond doubt that dietary GA actually crosses the blood-brain barrier. I therefore think this is a clear example of [[WP:SYNTH]]. Also, please bear in mind that an article published in an AAFP journal ''by no means'' reflects the official opinion of that body! [[User:Jfdwolff|JFW]]&nbsp;|&nbsp;[[User_talk:Jfdwolff|<small>T@lk</small>]] 18:54, 16 September 2010 (UTC)<br />
<br />
:This is pretty serious abuse of sources, as Jfdwolff has pointed out. The American Academy of Family Physicians article is about [[memantadine]]. A prescription drug. Olney's interview is about glutamate's neurotoxicity. Neither article is about MSG. Neither even ''mention'' MSG. It is generally agreed that glutamate is an excitotoxin, as Olney initially discovered. It is certainly ''not'' agreed (and not even contended by either source) that ingesting MSG leads to glutamate-induced neurotoxicity. This thread is way too tl;dr, but I'm deeply concerned by the sort of editing I'm perceiving here. '''[[User:MastCell|MastCell]]'''&nbsp;<sup>[[User Talk:MastCell|Talk]]</sup> 21:19, 16 September 2010 (UTC)<br />
<br />
I think the discussion as to whether the sources are reliable is irrelevant, what is more relevant is that they are being misused in [[WP:AGF|good faith]], to [[WP:SYN|synthesise]] an original hypothesis, this is original research and I would urge the editor proposing these additions to read the [[WP:NOR|no original research policy]]. Even if they were considered reliable they could not be used the way they are, they do not discuss MSG directly, but rather excess glutamate activity and its role in neurodegenerative diseases. The editor should wait for reliable sources to report on the neurotoxicity potential or lack thereof of MSG.--[[User:Literaturegeek|<span style="color:blue">Literature</span><span style="color:red">geek</span>]]&nbsp;|&nbsp;[[User_talk:Literaturegeek |<span style="color:orange">''T@1k?''</span>]] 23:23, 16 September 2010 (UTC)<br />
<br />
<br />
::In the USGAO report the term monosodium glutamate (MSG) and its possible effect as described by Dr. Olney and the Bureau of Foods is explicitly mentioned. The American Family Physicians article had already been dropped as a source. It is very interesting that none of you has come up with a better suggestion how to include the serious concerns issued by scientists such as Dr. [[John Olney]] or Dr. Russell Blaylock and others. I have considered SandyGeorgia's suggestion about PubMed. Resulting from that research I would now propose the following as text and sources to be added to the health concern section:<br />
<br />
''On the other side, health risks of MSG remain a subject of controversy among some experts. One case study found that patients diagnosed with fibromyalgia syndrome for two to 17 years, who had all undergone multiple treatment modalities with limited success, had complete, or nearly complete, resolution of their symptoms within months after eliminating monosodium glutamate (MSG) or MSG plus aspartame from their diet.<ref>{{cite | author = Ann Pharmacother| title = Relief of fibromyalgia symptoms following discontinuation of dietary excitotoxins.| journal = PubMed - indexed for MEDLINE| volume = | issue = | pages = | year = 2001| month =June| pmid =11408989| doi = | url =http://www.ncbi.nlm.nih.gov/pubmed/11408989?dopt=Abstract}}</ref> Another study was conducted with self-identified monosodium glutamate (MSG)-sensitive subjects to determine whether they had a statistically significant difference in the incidence of their specific symptoms after ingestion of MSG compared with placebo. Headache, muscle tightness, numbness/tingling, general weakness, and flushing occurred more frequently after MSG than placebo ingestion.<ref>{{cite | author = J Allergy Clin Immunol| title = The monosodium glutamate symptom complex: assessment in a double-blind, placebo-controlled, randomized study.| journal = PubMed - indexed for MEDLINE| volume = | issue = | pages = | year = 1997| month =June| pmid =9215242| doi = | url =http://www.ncbi.nlm.nih.gov/pubmed/9215242?dopt=Abstract}}</ref> Scientists like Dr. [[John Olney]]<ref name="U.S. General Accounting Office (USGAO) report">{{Cite| url=http://archive.gao.gov/f0402/099382.pdf | work=U.S. General Accounting Office (USGAO) report| accessdate=2010-09-14 | title=Regulation of the food additive Aspartame. Food and Drug Administration. Department of Health, Education and Welfare| first=| last=| date=2008}}</ref>'', ''who was elected to the Institute of Medicine of the United States National Academy of Sciences, and Dr. Russell Blaylock have campaigned for greater regulation of monosodium glutamate.''<br />
<br />
Sources are both from PubMed. Now, is there an agreement about these sources being used as proposed above to improve the MSG article's disputed neutrality?<br />
[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 17 September 2010 (UTC)<br />
<br />
:I fear that one of us is misunderstanding both the purpose of this noticeboard and the policy against [[WP:OR|original research]]. This noticeboard's purpose is not to vet text for an article, that should happen on the article's talk page. You need to try to reach a consensus with other editors there regarding what the article text should be. Regarding [http://www.ncbi.nlm.nih.gov/pubmed/11408989?dopt=Abstract this]] and [[http://www.ncbi.nlm.nih.gov/pubmed/9215242?dopt=Abstract this]], I believe, without assessing their quality or value, that they are generally reliable. But they are primary sources, and thus need to be used with care, and we should seek instead to use high quality secondary sources. What is more troubling to me is that your summaries do not accurately reflect the papers' abstracts (I have not read these papers in their entirety). In the first, you fail to mention that the cohort was four patients, that the authors called for further study, and only claimed that elimination of MSG had "the potential for dramatic results in a subset of patients". In the second, you do not mention that the dose of MSG is pretty large <s>nor do you mention that the subjects self-identified as MSG sensitive</s>. It seems to me that your representation of these sources involves sweeping generalizations and pushes a particular point of view--one with with, ironically enough, I am sympathetic, although for which in my own searching about, I have yet to find high quality reliable sources. <span style="text-shadow:#DDDDDD 0.2em 0.2em 0.1em; class=texthtml">--[[User:Nuujinn|Nuujinn]] ([[User_talk:Nuujinn|talk]])</span> 10:33, 17 September 2010 (UTC)<br />
<br />
::Then you obviously did not read carefully what I wrote. I indeed mentioned that the subjects self-identified as MSG sensitive. The author of the first study was impressed by his/her findings that he/she called for further study. So that can be included yet makes no difference to the study's results. I further consider these sources reliable and high quality.[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 17 September 2010 (UTC)<br />
<br />
:::You are correct regarding the self identification, I have struck that part of my comment, please accept my apology for my mistake. But I stand by my assessment that in these summaries you are apparently engaged in OR and are also apparently not interested in presenting the materials at hand with [[WP:DUE|due weight]] and a [[WP:NPOV|neutral point of view]]. I would also suggest that it might be time to take a look at [[WP:IDHT]]. What you really need to make your point is a secondary source from a reliable source that assesses from reliable primary sources, but that's a topic for other venues. You have my opinion and that of others--the question is, what will you do with those? I will be interested to see. <span style="text-shadow:#DDDDDD 0.2em 0.2em 0.1em; class=texthtml">--[[User:Nuujinn|Nuujinn]] ([[User_talk:Nuujinn|talk]])</span> 14:06, 17 September 2010 (UTC)<br />
<br />
: Regarding EUFIC it should go as per [[WP:EL]]. [[User:Richiez|Richiez]] ([[User talk:Richiez|talk]]) 08:52, 18 September 2010 (UTC)<br />
<br />
JCAlahe the sources are an improvement as they are not synthesising but they are still primary sources. Primary sources can be considered reliable sources if used cautiously but secondary sources are generally considered better sources. [http://books.google.co.uk/books?id=J7ei9UHS8uYC&pg=PA43 This source] and [http://books.google.co.uk/books?id=7We1IMLEN5oC&pg=PA716 this source] would probably be better choices of sources, rather than citing primary research studies. Here are [http://www.google.co.uk/search?tbs=bks%3A1&tbo=1&q=%22The+monosodium+glutamate+symptom+complex%3A+assessment+in+a+double-blind%2C+placebo-controlled%2C+randomized+study%22&btnG=Search+Books other secondary sources] and [http://www.google.co.uk/search?hl=en&tbo=1&tbs=bks%3A1&q=%22Relief+of+fibromyalgia+symptoms+following+discontinuation+of+dietary+excitotoxins%22&btnG=Search&aq=f&aqi=&aql=&oq=&gs_rfai= some more] for review. Not all will be as reliable as one another, check publisher and author for quality of books if using as secondary sources in articles.--[[User:Literaturegeek|<span style="color:blue">Literature</span><span style="color:red">geek</span>]]&nbsp;|&nbsp;[[User_talk:Literaturegeek |<span style="color:orange">''T@1k?''</span>]] 11:46, 18 September 2010 (UTC)<br />
:No matter my opinion regarding primary and secondary sources ... thanks for the hint, Literaturegeek.[[User:JCAla|—JCAla]] ([[User talk:JCAla|talk]]) 19 September 2010 (UTC)<br />
<br />
== Does typical WP practice demand "plagiarism lite", and does it matter? ==<br />
<br />
I would like to ask if others are sometimes uncomfortable with the following, and whether anyone has any practical suggestions about it. The most common scenario is something like this made-up case:- "this online review article looks well-written and well-sourced, great, but because RS debate is possible you should just use its handy bibliography for what you wanted to put in and not mention what led you there". Sound familiar? <br />
<br />
Even when people then get copies of the articles in said bibliography (as per [[WP:SAYWHEREYOUGOTIT]]) in many cases of course, what ends up being put into Wikipedia is structured and worded in ways which are ''inspired by'' the helpful author of the good but potentially questioned source. However, editors are effectively told not to say so. (Indeed many are presumably doing this the whole time and not talking about it.) Structuring of subject matter, simple observations, basic ways of explaining uncontroversial things, are often not "OR", raise no red flags, and their sources are hard to prove, so no one cares where they come from. But if such influences are so uncontroversial why is being honest about it considered such a no-no? <br />
<br />
I was recently involved in an example where a sourced quotation which had been subject to some questionable RS debate was removed, and a re-written sentence openly intended to capture something in the old material was then inserted without sourcing. The wording change possibly improves the article, and is (and was!) obvious enough not to ''need'' special sourcing, but I don't feel good about the ''deliberate'' lack of attribution. <br />
<br />
In academic literature one still sees authors who are correct enough to quote a source as something that they read in another source. Indeed this is often quite useful. In WP, it seems odd to see people on WP argue quite strongly sometimes that an apparently good source should be used indirectly and without attribution supposedly due to WP rules. In reality of course what people mean is that it is better to avoid a long RS debate about how the WP rules ''might'' apply, and to find a "path of least resistance". <br />
<br />
Just trying to think why this is happening, it occurs to me that it is relevant that if you put words in an article without sourcing, then someone needs to actually look at the content and understand it before they can judge if they need more sourcing. Feedback is likely to be informed in such cases. OTOH, if you try very hard to mention all sources, you can expect "feedback" which is generalized and awkward to deal with: based not on any reading of the content but upon quick browsing for theoretical sourcing warning signs. Are the incentives wrong?--[[User:Andrew Lancaster|Andrew Lancaster]] ([[User talk:Andrew Lancaster|talk]]) 13:17, 14 September 2010 (UTC)<br />
<br />
:I'm not sure that I understand the question, so let me tell you what I'm hearing: <br />
:* You read Mary's paper.<br />
:* Mary's paper cites John's book.<br />
:* You read John's book.<br />
:* You write about the subject, and cite John's book.<br />
:This is 100% acceptable: It is not necessary to document how you found John's book, or how many other sources you read before writing a sentence.<br />
:What's ''not'' acceptable is to read Mary and then falsely claim that you read John. If you only read Mary, you must cite Mary. [[User:WhatamIdoing|WhatamIdoing]] ([[User talk:WhatamIdoing|talk]]) 21:32, 16 September 2010 (UTC)<br />
:: I agree with WhatamIdoing. There's an unwritten rule when blogging to make sure to mention the intermediate steps (the ubiquitous "hat tip") but while that's of some importance to bloggers who are looking to take credit for their blogging, it is not an issue when assembling encyclopedic content. Having said that, if I felt that Mary's paper was the key to finding the info in John's book, I might try to find a way to cite Mary, if it could be done without compromising integrity.--<font style="font-family:Monotype Corsiva; font-size:15px;">[[User:Sphilbrick|<span style="background:#002868;color:#fff;padding:0 4px">SPhilbrick</span>]][[User talk:Sphilbrick|<span style="background:#ADD8E6;padding:0 4px;color:#fff;">T</span>]]</font> 16:37, 18 September 2010 (UTC)<br />
:::I think the two responses are both looking at the most controversial type of example. I'll try doing a rewrite of WhatamIdoing's useful summary which is both based on real (but more messy) experience and also more designed to show how this can become more ethically dubious in more realistic and less extreme cases:<br />
:::*You read Mary's paper. You consider it an RS.<br />
:::*Mary's paper reviews works by 10 authors in a particular are of research, categorizes them in a neat uncontroversial way, and gives some neat comments about them which are not particularly controversial but handy nevertheless.<br />
:::*You make an WP article citing Mary's paper as a source. You use Mary's neat way of summarizing the field, as well as some of her observations.<br />
:::*Another editor arrives and a content debate ensues during which the editor claims Mary's paper is not a good enough RS. Let's say for example the field is a quite technical one and Mary published in a less technical journal (not a blog). Let's say the visiting editor cites [[WP:REDFLAG]] for example.<br />
:::*After some circular discussions the two of you come to the practical compromise of getting around silly debate by simply pretending Mary is not a source, but instead the 50 authors. Direct quotes are simply reworded into new words that mean the same thing.<br />
:::*When the visiting editor sees what the result looks like after simply deleting mention of Mary, they are satisfied there is now no sourcing problem because nothing stands out as the kind of thing you would tag as needing a source. Nothing adapted from Mary was controversial. (Yes, this raises the question of why redflag was incited, but in the real WP, people are not always that consistent and you have to get past an argument.)<br />
:::*Let's say for the sake of making a clear example that you have actually read the 50, but the person who insisted on deleting mention of Mary has not and was basically a visitor to the article who noticed a perceived sourcing issue but does not really know the field. <br />
:::*Let's say this editor is unable to debate what is really controversial in the field and so simply takes a hard line of saying redflag can be assumed to be relevant whenever an article in a less technical journal seems to be trying to review something in a more technical field. <br />
:::*The implied defense of this compromise is that deleting mention of the source was OK because everything Mary wrote might have been arrived at by someone reading the 50 authors. <br />
:::It seems to me that if an academic or student got caught plagiarizing and gave this excuse it would be laughable?--[[User:Andrew Lancaster|Andrew Lancaster]] ([[User talk:Andrew Lancaster|talk]]) 12:07, 19 September 2010 (UTC)<br />
:::: It would be, because the academic wouldn't have to deal with drive-by editors. We do. Our work is the product of committee, so we must make compromises. If you want to soothe your conscience, you can remind yourself that we are quite different from academics or students, because they are expected to do original research. We're specifically forbidden to. An academic who writes what would be a Wikipedia featured article as a dissertation will rightly be criticised because it has no original work or at least analysis. All our work is required to be copied, and we are not allowed to enter our opinion. That's a much greater difference from academia. --[[User:GRuban|GRuban]] ([[User talk:GRuban|talk]]) 23:18, 19 September 2010 (UTC)<br />
::::: Hmmm. But just considering WP's own statements "to itself" so to speak, isn't this also a case where we break our own "rules"? Consider [[WP:SAYWHEREYOUGOTIT]]. Of course BTW I would not think this subject interesting if it was something that happened here and there ''at random''. The pressures and incentives (including the way things like this noticeboard can work, or be worked, sometimes) appear to me to create a positive tendency towards this particular type of compromise at the expense of principles like [[WP:SAYWHEREYOUGOTIT]]. I'd even go one step further and hypothesize that there are probably people who have learnt from the same pressures simply to avoid sourcing as much as possible, as a way to avoid drawing attention from drive-by editors in the first place.--[[User:Andrew Lancaster|Andrew Lancaster]] ([[User talk:Andrew Lancaster|talk]]) 14:35, 20 September 2010 (UTC)<br />
:::::: I'll call your hypothesis and raise: there are definitely people who have learnt not to edit the Wikipedia at all due to its multitudinous slings and arrows, and this one is by no means the most painful. But ... where does this lead? If you have a specific workable suggestion, please propose it. Just "say where you got it" doesn't work, because the article doesn't have just one owner/author, there is just the amorphous Wikipedia community, that can edit it at any time, and often do. Just because editor A got the information from source Bar by reading about it in Foo which references Bar, doesn't mean editor B can't get the same information from Bar directly. Does that mean that editor B isn't allowed to delete the reference to Foo, even though Foo isn't a reliable source, and the article now contains no information that directly depends on Foo, just because someone else who once edited the article once read Foo? --[[User:GRuban|GRuban]] ([[User talk:GRuban|talk]]) 22:56, 20 September 2010 (UTC)<br />
::::::: People leaving WP no longer affect WP. I think you are missing the point that I am noting cases where WP accepted habits seem to be pushing people to break WP's own stated policy, on WP. Your scenario section seems to amount to saying that no one will normally notice the plagiarism?--[[User:Andrew Lancaster|Andrew Lancaster]] ([[User talk:Andrew Lancaster|talk]]) 15:10, 21 September 2010 (UTC)<br />
<br />
== Jackie Evancho Forum Reference ==<br />
<br />
I have recently gotten into a debate with [[User:1archie99]] about the inclusion of [http://jackieevanchos.org/showthread.php?206-Her-voice-is-REAL!!!-Jackie-Proves-it!-%28Video%29&p=1052#post1052 this] reference to the [[Jackie Evancho]] article. This reference is being applied to the America's Got Talent section and the sentence, "One judge, Howie Mandel, had her sing a random voice exercise on the next evening's live show as proof that it was her voice that was heard.". I have tried to direct the user to the [[WP:RS|reliable sources]] guideline to show that forum posts are not counted as reliable sources because of their lack of verifiability and reliability. But the user have asked me to prove that the guideline directly states that that reference cannot be used. Instead, I am taking this here to have more experienced users weigh in. You can see my discussion with the user [[Talk:Jackie Evancho#Use of a forum reference|here]]. <font color="silver">[[User:Silver seren|Silver]]</font><font color="blue">[[User talk:Silver seren|seren]]</font><sup>[[Special:Contributions/Silver seren|C]]</sup> 02:41, 16 September 2010 (UTC)<br />
::Yes, forums are not reliable sources, neither is youtube. If the editor is trying to make the point that the voice is real I suggest this good article from the LA Times [http://articles.latimes.com/2010/aug/31/entertainment/la-et-jackie-evancho-20100831]. If this is to show that the described incident happened on the show no source may be required unless the action is in dispute. --[[User:Torchwoodwho|Torchwood Who?]] ([[User talk:Torchwoodwho|talk]]) 03:09, 16 September 2010 (UTC)<br />
:::Heh, I already put that source in myself a couple of days ago. Well, I hope your response helps explain things to him. I suppose i'll go take the forum reference out of the article then. <font color="silver">[[User:Silver seren|Silver]]</font><font color="blue">[[User talk:Silver seren|seren]]</font><sup>[[Special:Contributions/Silver seren|C]]</sup> 03:13, 16 September 2010 (UTC)<br />
::::Lol, no problem. In reference to sourcing events in TV shows tvguide.com has episode summaries for future use, but they are sparse [http://www.tvguide.com/tvshows/Americas-Got-2010/]. There may be other sites with more detail. Just FYI.--[[User:Torchwoodwho|Torchwood Who?]] ([[User talk:Torchwoodwho|talk]]) 03:30, 16 September 2010 (UTC)<br />
<br />
* Apparently, 1archie99 is not satisfied with just "one person" responding to this discussion I opened, per [http://en.wikipedia.org/w/index.php?title=Jackie_Evancho&action=historysubmit&diff=385109093&oldid=385106420 this] edit he made, re-adding in the forum reference. Can some other editors please explain to him how a forum thread is not a reliable source? <font color="silver">[[User:Silver seren|Silver]]</font><font color="blue">[[User talk:Silver seren|seren]]</font><sup>[[Special:Contributions/Silver seren|C]]</sup> 05:42, 16 September 2010 (UTC)<br />
*The document given at jackievanchos.org is not an RS as the forum post is SELF. Correct video citation would require locating an authorative copy where the judge makes that statement. [[User:Fifelfoo|Fifelfoo]] ([[User talk:Fifelfoo|talk]]) 05:59, 16 September 2010 (UTC)<br />
:Thank you. I am currently at 3RR, so either someone else will have to remove the forum link or i'll have to do it a day from now. (It would be a huge sign of good faith and responsibleness if 1archie99 did it himself...) <font color="silver">[[User:Silver seren|Silver]]</font><font color="blue">[[User talk:Silver seren|seren]]</font><sup>[[Special:Contributions/Silver seren|C]]</sup> 06:03, 16 September 2010 (UTC)<br />
*What looks like a regular anonymous user at a forum where anyone can post is not reliable. The video doesn't prove anything other than that the judge said that she didn't lipsync, and it's probably a copyright violation. The program itself (with episode number or broadcast date) could perhaps be cited if an official video isn't online. [[User:Jiiimbooh|Jiiimbooh]] ([[User talk:Jiiimbooh|talk]]) 06:10, 16 September 2010 (UTC)<br />
::Thanks for clarifying that. Where I said no other source required I was implying the material can self source if it's something like a plot summary or televised event.--[[User:Torchwoodwho|Torchwood Who?]] ([[User talk:Torchwoodwho|talk]]) 07:24, 16 September 2010 (UTC)<br />
:::I did not originally put the disputed citation into the article; just thought it was worthwhile to leave it in because it actually showed via video the actual portion of the broadcast that my edit described. Because the purists only took to the discussion, not even the editor that originally put the cite in the article spoke up; only a description, not the actual event remains as a citation. Readers will have to take it on faith that the remaining cite is a true depiction. I wanted to leave all doubt behind what actully occurred. Because only the fanactics spoke that is not happening. I will now consider the matter closed.[[User:1archie99|1archie99]] ([[User talk:1archie99|talk]]) 16:09, 18 September 2010 (UTC)<br />
* It was [http://en.wikipedia.org/w/index.php?title=Jackie_Evancho&action=historysubmit&diff=385238745&oldid=385234322 added] back in again by another user whose username clearly broadcasts a COI issue. I'm still at 3RR, so can someone else please help with this? <font color="silver">[[User:Silver seren|Silver]]</font><font color="blue">[[User talk:Silver seren|seren]]</font><sup>[[Special:Contributions/Silver seren|C]]</sup> 21:22, 16 September 2010 (UTC)<br />
<br />
== question about interpretations made by sources ==<br />
<br />
(<small>also posted [[Wikipedia:Editor assistance/Requests#question_about_interpretations_made_by_sources|here]], i'm not sure where is the best place for it)</small> there are two cases i'm dealing with that are quite similar & interesting. the first one is concerning the Arab Peace Process. israel has never "officially" responded to it (official, written response), however - the prime minister has made few comments about it during a speech. the vast majority of sources do not title it as an "official response", however, one (acceptable) source does. so according to wikipedia policies - it should be written in the article that israel HAS officially responded to it, even though some sources would claim that israel has never responded. israel's official response or lack thereof is an important fact, and i think it might be represented in wikipedia the wrong way, just because a single source chose to title the prime minister comments as an "official response". <br />
<br />
the same goes for Mahmud Ahmadenijad calling the holocaust a "myth". the dictionary definition of myth is<br />
a traditional or legendary story, usually concerning some being or hero or event,<br />
with or without a determinable basis of fact.<br />
so calling the holocaust a myth should probably not be considered as [[holocaust denial]]. myth is different from fiction - and most sources do not draw that conclusion - but some (acceptable sources) do! and in accordance with wikipedia policies, that is what would end up in the article - that it IS a denial, and he IS a holocaust denier according to that statement. Here, again - it just feels wrong. '''there is nothing to reflect that the vast majority of sources do NOT title that statement as holocaust denial'''. Is that really the right interpetation of wikipedia policies? Maybe there is a policy which addresses this absurd situation. If not, maybe there should be. [[User:Eyalmc|Eyalmc]] ([[User talk:Eyalmc|talk]]) 10:00, 16 September 2010 (UTC)<br />
:As to your first question, you will have to provide provide a diff to the challenged material. As to your second, you're fixating upon only one definition of the word "[[wiktionary:myth|myth]]". There are many sources indicating that Ahmadinejad's various comments about the Holocaust constitute [[holocaust denial]].[http://news.bbc.co.uk/2/hi/middle_east/4527142.stm][http://www.nytimes.com/2009/09/19/world/middleeast/19iran.html?_r=1&hp][http://www.dw-world.de/dw/article/0,2144,2149241,00.html]--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 12:38, 16 September 2010 (UTC)<br />
:: what does it mean to provide a "diff" ? also - your sources confirm my point exactly. the word "denial" or "deny" appear only on the first one, and it is based on the usage of the word myth. but that's exactly my point. some will interpret it as a denial, while possible many more wouldn't title it that way (probably because they do not see it as a denial. after all, holocaust denial does make a good headline, but they chose not to draw that conclusion). how should it be represented in wikipedia? [[User:Eyalmc|Eyalmc]] ([[User talk:Eyalmc|talk]]) 13:21, 16 September 2010 (UTC)<br />
:::Here is a link to a previous thread about this [http://en.wikipedia.org/wiki/Wikipedia:Editor_assistance/Requests#question_about_interpretations_made_by_sources] for reference.--[[User:Torchwoodwho|Torchwood Who?]] ([[User talk:Torchwoodwho|talk]]) 13:37, 16 September 2010 (UTC)<br />
:::Thank you Torchwood. But still, Eyalmc is going to have to tell us what article he's talking about and what source he's concerned with. Eyalmc, please see [[WP:DIFF]] on what a diff is and how to link to them.<br><br />
:::2)Again, on the holocaust issue, Eyalmc, you're being too pedantic about wording. The sources very clearly depict Ahmadinejad as asserting that the Holocaust did not occur in the way that is historically accepted. That is what holocaust denial means.--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 13:42, 16 September 2010 (UTC)<br />
::::Ahmadinejad certainly did not use the word "myth", as he was speaking in Farsi, not in English. There is a disagreement over the correct English translation of the term he used; having no knowledge of Farsi, I am not competent to judge who is correct. It seems to me that we should reflect this uncertainty, and neither assert nor deny that in this speech he denied the reality of the holocaust. <span style="font-family: Papyrus">[[User:RolandR|RolandR]] ([[User talk:RolandR|talk]])</span> 14:21, 16 September 2010 (UTC)<br />
:::::No, we should reflect what the reliable sources say, and these are all clear that he has, on several occasions, claimed that the holocaust did not occur in the way accepted by historians. We do not need to use the phrase "holocaust denial" to get that across. --[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 14:46, 16 September 2010 (UTC)<br />
:::::: Instead of just making assertions, please provide the sources you are discussing. Do they really say what you claim? Is the viewpoint you have articulated really the only significant viewpoint published by reliable sources? There is no way to judge those questions without actually looking at the sources. [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 17:52, 17 September 2010 (UTC)<br />
::::::: what's this game you're playing? In his previous post, [[User:Cuchullain|Cúchullain]] provided 3 such sources, the very first one, from the BBC no less, has as its ''headline '' '''"Iranian leader denies Holocaust"''': [http://news.bbc.co.uk/2/hi/middle_east/4527142.stm] [[User:HupHollandHup|HupHollandHup]] ([[User talk:HupHollandHup|talk]]) 18:04, 17 September 2010 (UTC)<br />
:::::::: <s>Your</s>The assertion was "''he has, on several occasions, claimed that the holocaust did not occur in the way accepted by historians''". The source you provided does not support that assertion. Anyway, I'm pretty sure that no one is denying that multiple reliable sources have reported that he called the Holocaust a myth. Is it a unanimous judgement of all reliable sources or do sources differ in their interpretation of his comments? [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 18:31, 17 September 2010 (UTC)<br />
:::::::::no, that was not my assertion, it was a claim by [[User:Cuchullain|Cúchullain]]. The topic of this thread is whether or not Ahmadinejad can be called a holocaust denier. 3 ultra-reliable sources who make that claim were provided. Kindly stop playing games. [[User:HupHollandHup|HupHollandHup]] ([[User talk:HupHollandHup|talk]]) 18:37, 17 September 2010 (UTC)<br />
:::::::::: Please refrain from accusing me of 'playing games' or other personal attacks. "''The topic of this thread is whether or not Ahmadinejad can be called a holocaust denier.''" In that case, you are in the wrong place. This noticeboard is for discussing the reliability of particular sources for particular citations, in context. Determining The Truth&trade; is beyond its scope. [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 18:45, 17 September 2010 (UTC)<br />
:::::::::::when someone provides 3 top-quality sources to support a claim, as [[User:Cuchullain|Cúchullain]] has done, and your response is "Instead of just making assertions, please provide the sources " - you are playing games , and pointing that out is not a personal attack. You may be correct that this is not the right notice board - but that comment should be directed at [[User:Eyalmc|Eyalmc]], who started this thread , not me. I'm ok with closing the discussion and marking it 'resolved'. [[User:HupHollandHup|HupHollandHup]] ([[User talk:HupHollandHup|talk]]) 18:52, 17 September 2010 (UTC)<br />
:::::::::::: Any comment on this noticeboard that has as its subject matter another editor is disrupitive and off-topic. The question posed was proper for this venue, although lacking in the necessary details for a resolution. Still missing from this discussion are the answers to the four questions I pose below. [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 19:10, 17 September 2010 (UTC)<br />
:::::::::::::This discussion has gotten muddled. Eyalmc's initial claim was that Ahmadinejad shouldn't be called a [[holocaust denier]], because he called it a "myth", and the definition of myth he chose to use was "a traditional or legendary story, usually concerning some being or hero or event, with or without a determinable basis of fact." Of course that's totally silly and pedantic, and he wouldn't have used an English word in the first place. What is certain is that any number of reliable sources, including the ones I've cited above (these: [http://news.bbc.co.uk/2/hi/middle_east/4527142.stm][http://www.nytimes.com/2009/09/19/world/middleeast/19iran.html?_r=1&hp][http://www.dw-world.de/dw/article/0,2144,2149241,00.html]), indicate that Ahmadinejad has, on several occasions, voiced the opinion that the Holocaust did not occur in the manner that is accepted by historians. Usually he claims that it was fabrication trumped up to justify the creation of Israel. In his poorly calculated 2006 letter to the German chancellor, he further suggested that it may have been trumped up by Britain to embarrass Germany. It is safe to say this is not what historians of the holocaust believe, and some sources go so far as to call Ahmadinejad a "holocaust denier" outright.[http://news.bbc.co.uk/2/hi/middle_east/4527142.stm] Eyalmc hasn't responded usefully to this, so the discussion should be closed.--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 12:40, 20 September 2010 (UTC)<br />
:::::::::::::: ''What is the exact url of the source in question? In which article is the source being used? What is the exact statement in the article that the source is supporting? Where is the relevant talk page discussion, if any?'' [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 18:15, 20 September 2010 (UTC)<br />
:::::::::::::::That's what's not clear. Eyalmc hasn't provided that information, and it doesn't look like they're going to. As such the discussion is effectively over.--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 18:38, 20 September 2010 (UTC)<br />
:::::::::::::::: Thank you for contributing that bit of wisdom. [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 23:11, 20 September 2010 (UTC)<br />
: If reliable sources differ in their interpretations, we report [[WP:UNDUE|all significant viewpoints]]. You can see an explanation of diffs at [[WP:DIFF]]. The operative questions here are: ''What is the exact url of the source in question? In which article is the source being used? What is the exact statement in the article that the source is supporting? Where is the relevant talk page discussion, if any?'' [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 18:02, 16 September 2010 (UTC)<br />
::I just did a quick search. Hopefully this adds helpful information. There seem to be several sources associating [[Mahmoud Ahmadinejad]] with [[Holocaust denial]]. This [http://www.google.com/search?hl=en&safe=off&client=opera&hs=TSe&rls=en&q=Mahmoud%20Ahmadinejad%20holocaust%20denial%20-wikipedia&um=1&ie=UTF-8&tbo=u&tbs=bks:1&source=og&sa=N&tab=wp link] shows books with his name and the phrase. Note that [http://books.google.com/books?id=QMts5Z36kjAC&pg=PA124&dq=Mahmoud+Ahmadinejad+holocaust+denial+-wikipedia&hl=en&ei=NmCSTMzQEIXSsAPnuZjACg&sa=X&oi=book_result&ct=result&resnum=2&ved=0CCkQ6AEwAQ#v=onepage&q=Mahmoud%20Ahmadinejad%20holocaust%20denial%20-wikipedia&f=false this one] says "Mahmoud Ahmadinejad is its most virulent and vocal champion". So there seems to be a lot of [[WP:RS]] that put him in that category. [[User:AliveFreeHappy|AliveFreeHappy]] ([[User talk:AliveFreeHappy|talk]]) 18:26, 16 September 2010 (UTC)<br />
::::Why did you post this as if it was a response to my comment? You seem to have completely ignored what I said, and don't appear to actually be engaging in a discussion. [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 17:48, 17 September 2010 (UTC)<br />
:::Somehow I doubt that a book called "Icon of Evil" and co-written by [[Alan Dershowitz]] would be acceptable as a reliable source for such information. <span style="font-family: Papyrus">[[User:RolandR|RolandR]] ([[User talk:RolandR|talk]])</span> 18:56, 16 September 2010 (UTC)<br />
::::really? Why is that? is there some wiki policy regrading titles of works that would disqualify them from being reliable sources? Or a specific policy that relates to Dershowitz and excludes him from being a reliable source? [[User:HupHollandHup|HupHollandHup]] ([[User talk:HupHollandHup|talk]]) 14:28, 17 September 2010 (UTC)<br />
:: google "Ahmadinejad holocaust myth" - 157,000 results. and "Ahmadinejad holocaust myth -denial -deny -denies" - 63,000 results. so about 40% of the sources do not even contain those words (from the sources that does, many are using the words in other context). So it's not a battle between two different interpretations - it's a battle between an interpretation, and lack thereof. I don't think there is a proper way to represent that duality in wikipedia. [[User:Eyalmc|Eyalmc]] ([[User talk:Eyalmc|talk]]) 06:24, 17 September 2010 (UTC)<br />
:::Yet again, you're being pedantic over the wording and trying to read your own interpretation into it. ''Every'' source I checked in a Google News search for [http://www.google.com/search?q=ahmadinejad&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a#hl=en&client=firefox-a&hs=iAv&rls=org.mozilla:en-US:official&q=ahmadinejad%2Bholocaust&um=1&ie=UTF-8&tbo=u&tbs=nws:1&source=og&sa=N&tab=wn&fp=6f32b8af52b7e0b8 ahmadinejad+holocaust] discuss Ahmadinejad rejecting that the Holocaust occurred in the historically accepted way. And he's done it on several occasions. Additionally, you've never told us what article on the mideast peace process it is you're talking about, and what the source you're concerned about it. I move we close this discussion.--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 12:20, 17 September 2010 (UTC)<br />
:::: Agree. Rejecting that the Holocaust occurred in the historically accepted way i sthe definition of Holocaust denial. [[User:HupHollandHup|HupHollandHup]] ([[User talk:HupHollandHup|talk]]) 14:28, 17 September 2010 (UTC)<br />
:::Eyalmc, you shouldn't look for reliable sources for such things in regular Google, but first try Google News and Google Books. While both have a significant number of unreliable sources as well, the percentage of reliable ones is much higher than in Google search. But even if you use Google, and you use your second search string, the first result is [http://www.news.com.au/world/holocaust-a-myth-israel-no-future-ahmadinejad/story-e6frfkyi-1225776906966 News.com.au], a reliable source, which clearly states "President Ahmadinejad raised the stakes against Israel and called the Holocaust a lie[...]" Sourcse like this one, without containing the word "denial" or a variation thereof, make it very, very clear which interpretation of "myth" is used by Ahmadinejad, and that the rest of his statements also indicate that he is a Holocaust denier ("a show", "a lie", "an unreliable claim", "this claim is corrupt", ...). If ''you'' want to argue that there is a duality in the interpretation of his statements, then ''you'' have to present reliable sources which claim that he isn't a holocaust denier. It isn't sufficient to show (or to proclaim) that there are sources which don't explicitly label him one, you need sources specifically stating that he isn't one if you want to present that point of view in Wikipedia as well. [[User:Fram|Fram]] ([[User talk:Fram|talk]]) 12:12, 20 September 2010 (UTC)<br />
<br />
== Conference papers ==<br />
<br />
I'm working on the article ''[[Lady of Quality]]'' (a book written in 1972 by [[Georgette Heyer]]; it's set in the early 19th century). In 2009, there was an academic conference on Heyer's work [http://www.lucy-cav.cam.ac.uk/pages/news-events/re-reading-georgette-heyer.php]. One of the presentations, by the organizer of the conference, contains information that may be useful for this article, but I don't know whether it is considered a reliable source. The author sent me her slides, with a note that she has not written this up or submitted to any journals, so it has not been peer-reviewed or officially published. The author is a university professor who teaches English literature. She has been previously published, but her focus has previously been Shakespeare and Renaissance literature (several centuries before Heyer). [http://www.anglia.ac.uk/ruskin/en/home/faculties/alss/deps/english_media/staff/professor_sarah_brown.html] I've got this article at FAC and want to make sure that the source is considered sound before I incorporate any of the information. Thanks for any opinions. [[User:Karanacs|Karanacs]] ([[User talk:Karanacs|talk]]) 14:29, 16 September 2010 (UTC)<br />
:I think so. The conference organizers would have to pass her, and also a presenter certainly puts her reputation on the line by getting up in front of peers. Write a very detailed reference note, though!--[[User:Wehwalt|Wehwalt]] ([[User talk:Wehwalt|talk]]) 14:41, 16 September 2010 (UTC)<br />
::(ec) She was the conference organizer (or at least the main contact), which made me a little more unsure. Thanks for the comment. [[User:Karanacs|Karanacs]] ([[User talk:Karanacs|talk]]) 14:44, 16 September 2010 (UTC) <br />
:I'd agree it should be used, especially in the absence of other sources. [[User:Johnbod|Johnbod]] ([[User talk:Johnbod|talk]]) 14:43, 16 September 2010 (UTC)<br />
::I wouldn't feel comfortable answering this question without knowing what sort of information is involved. [[User:Looie496|Looie496]] ([[User talk:Looie496|talk]]) 17:25, 16 September 2010 (UTC)<br />
:::The information likely would be considered reliable if it had been published, but since it hasn't been, how would any reasonable editor "check your work" that is supported by this information? This seems to defeat the entire reason for our policies requiring information to be backed up by reliable sources, and instead we'd be asking readers to rely on you. Nothing personal of course, I mean you in the royal sense. &mdash; [[User:E. Ripley|e. ripley]]\<sup>[[User talk:E. Ripley|talk]]</sup> 17:29, 16 September 2010 (UTC)<br />
:If you are sourcing to slides that are sent to you, and not published then they can not be used as a reliable source. Because they are not publicaly availiable. We do not allow sourcing to private correspondence. If they are puplished, but not peer reviewed, then they should be treated as a self puplished source. [[User:Taemyr|Taemyr]] ([[User talk:Taemyr|talk]]) 17:44, 16 September 2010 (UTC)<br />
Standards for conference presentations vary tremendously across fields. In my discipline we accept all contributions that are minimally on-topic, with no peer review. Note also there are people who organize sessions so they have a platform to present their pet views. I'm not saying that's going on here, but we have to be careful. [[User:Short Brigade Harvester Boris|Short Brigade Harvester Boris]] ([[User talk:Short Brigade Harvester Boris|talk]]) 17:47, 16 September 2010 (UTC)<br />
<br />
This is literary criticism, and the particular focus is a subject I have not seen covered in other sources (although, to be fair, there has been minimal work in serious criticism for this author/genre). To my knowledge, this was the first-ever conference devoted to this author's work; I don't know what the standards for inclusion were, nor am I very familiar with the overall standards for this type of conference.. The presentation was presented in public, but the author has yet to write it up as a formal paper. I am unsure whether the presentation itself counts as publication; if not, then I agree that this is an SPS and I don't think the author is an expert in this field. [[User:Karanacs|Karanacs]] ([[User talk:Karanacs|talk]]) 18:00, 16 September 2010 (UTC)<br />
<br />
:Which does make a lot of difference. As Short Brigade Harvester Boris has indicated, a lot of conferences more or less let anyone present anything at all relevant to the conference, and they may all get published eventually, so even if published I'd argue that only a presentation by someone who was a known expert in the field could possible be called a reliable source. [[User:Dougweller|Dougweller]] ([[User talk:Dougweller|talk]]) 18:37, 16 September 2010 (UTC)<br />
<br />
It doesn't appear to be published, therefore it is not [[WP:V|verifiable]], therefore it can't qualify as a reliable source. If it were published in some form we would use the standard criteria involving the publisher's reputation and so on, per [[WP:RS]]. [[User:Dlabtot|Dlabtot]] ([[User talk:Dlabtot|talk]]) 19:01, 16 September 2010 (UTC)<br />
<br />
:Agree, if it's not actually published, there's no way for anyone to check it. If the presenter does end up self-publishing it in some form, it would probably fall into the realm of [[WP:SPS|self-published sources]] we can potentially use (and if it gets published in a journal, so much the better).--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 12:41, 17 September 2010 (UTC)<br />
:Slides by themselves don't matter. What matters here is that the results of research have been a) Not peer reviewed b) Not published. Unpublished => Not RS. Wait until they publish the results of their research. [[User:Fifelfoo|Fifelfoo]] ([[User talk:Fifelfoo|talk]]) 12:44, 17 September 2010 (UTC)<br />
::If the organizer of the the only conference on the author, and an Eng. Lit. prof, is not an expert, per Karanacs, they are going to have difficulty finding "peers" to review her work! [[User:Johnbod|Johnbod]] ([[User talk:Johnbod|talk]]) 16:52, 18 September 2010 (UTC)<br />
<br />
== Compassionate Spirit website ==<br />
<br />
[http://www.compassionatespirit.com/Tabor-Jesus-Dynasty.htm This page] is currently used as a reference in the article [[The Jesus Dynasty]]. The author, Keith Akers, is a man of some repute in the field. I am just curious if the consensus is that it does qualify as a Reliable sources as per [[WP:RS]] or not, and also, separately, whether it is an acceptable source to establish notability. These questions are not, by the way, being asked in reference to this existing article, but in general. If it is sufficient both as a RS and as a NOTABILITY source, I am considering using it elsewhere as well. [[User:John Carter|John Carter]] ([[User talk:John Carter|talk]]) 21:29, 16 September 2010 (UTC)<br />
: It appears to be Aker's own website. So the question is if his opinion of the book is notable (the edit in question: "Keith Akers hailed the book as "a breath of fresh air in historical Jesus literature" and commended Tabor's use of extra-Biblical sources.") As tot he specific question of notability, other potential concerns are whether there's an association between Aker's and Tabor, whether they have the same publisher, whether they swim in the same fringe circles (or not) and so on. Taking a look now.[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 22:11, 16 September 2010 (UTC)<br />
:: Ok. Aker's isn't a scholar or a bigwig in biblical studies that I can tell (his own bio here [http://www.compassionatespirit.com/about_keith_akers.htm]). So what we have is a self-published book review. I don't think this would satisfy the "multiple, non-trival reviews" bit of the book notability guideline, so if this kind of review is all you have to establish notability for a book, i wouldn't think it would be enough (for what my opinion is worth). As for the reliable source question -- I could certainly see arguments against using him if people were objecting (if, say, he was praising his book from his personal website while magazines and scholarly journals were trashing it), but if no one is objecting...[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 22:17, 16 September 2010 (UTC)<br />
:::Understood. Like I said, I wasn't so much concerned about it in regards to this particular article, but in general. And there is no real doubt the book is notable, so I might just try to find some other reviews. Thanks for the responses. [[User:John Carter|John Carter]] ([[User talk:John Carter|talk]]) 22:21, 16 September 2010 (UTC)<br />
:::: Tabor has a page on his blog to reviews and press mentions here [http://www.jesusdynasty.com/blog/media-coverage/]. A lot of that looks a lot better than the Aker's cite (the first article appears to be a US News exploration of the questions raised in the book, though i could be wrong; just scanned through the article for half a tick).[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 22:30, 16 September 2010 (UTC)<br />
:::::Thanks for the pointer to the additional Tabor reviews. In defence of Akers I should say that he has published a book on Jesus, and ''that'' book has been independently and multiply reviewed. Perhaps he's not a scholar (I'm not sure) but do all reviewers have to be scholars to be cited on WP? --[[User:Michael C Price|Michael C. Price]] <sup>[[User talk:Michael C Price|talk]]</sup> 20:30, 17 September 2010 (UTC)<br />
:::::: No, doesn't have to be a "scholar" (lots of excellent and well-received popular histories are written by authors who don't have particular academic training, for instance) but we need some evidence that there's something that makes the self-published opinion notable. Judging by his self-description, he's an enthusaistic amateur with an idiosyncratic point of view. If his review had been published in a reliable source (particularly the quality press or specialty academic publications) that would make it easier to consider it reliable (since professional editors had determined that his opinions were worth broadcasting). But the bar gets higher if it's self-published (as it is in this case). As for Akers, it seems his 2000 book ''The Lost Religion of Jesus: Simple Living and Nonviolence in Early Christianity'' is the most relevant one. Hits in google scholar? 4 (two of those to Akers citing himself). ("Akers, Keith" yields 31, most of those seem to be about vegetarianism or Akers own work). While that's not positive evidence that he's not particularly notable in biblical studies, it's a good sign of that (Tabor gets 200 or so hits, a number of those appear to be citations in other academic works).[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 20:41, 17 September 2010 (UTC)<br />
::::::As I said above, the original question was not asked specifically about the article on [[The Jesus Dynasty]], but rather on the reliability of the source as an RS in general. That is currently the only page that cites it as a source. Whether the review deserves to be on that page, and the amount of weight it might be due, were as I thought I indicated not the real discussion. Basically, the author is a self-described "Ebionite", and he has written a significant amount on his website about an "Ebionite Community" to which he is not affiliated. If it makes it any clearer, the question was really about whether that website would be sufficient to serve as a second reliable source for a separate article on that group. [[User:John Carter|John Carter]] ([[User talk:John Carter|talk]]) 19:18, 19 September 2010 (UTC)<br />
: His self-published writings aren't good for anything but his own opinion. Since he doesn't seem to be any kind of a player academically or in any other area (certainly not an acknowledged biblical or historical scholar) I would say you probably shouldn't use him. He's just some dude with an opinion. If others start taking note of some of his opinions, and publish them, then those bits of his opinion become more useable.[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 19:21, 19 September 2010 (UTC)<br />
<br />
== [[Qeparo]] ==<br />
<br />
''Kleparo''^1 {{Verify source|date=September 2010}}.<br />
:An editor [http://en.wikipedia.org/w/index.php?title=Qeparo&diff=next&oldid=384536674] put the verify tag, in this article [[Qeparo]]. I'm not sure why he put it there: he either suspects I falsified the source, or doubts that [[Halil Inalcik]] (ed.) is a reliable source, I don't know. The Sûret is A ''Copy of the Fiscal Survey of the sanjak of Albania in 1431 A.D.'' The entry on Qeparo/Kleparo reads: The village of Klaparos, [[nahiye]] of Sopot: houses 10, revenues 615 ase/akçe. [[User:Beserks|Beserks]] ([[User talk:Beserks|talk]]) 10:28, 17 September 2010 (UTC)<br />
<br />
--References--<br />
<br />
1. ''Nâhiyet-i Sopot: Karye-i Klaparos (10 hane [houses], hâsıl 615 [revenues, in akçe])''... in, İnalcık, Halil: ''Hicrî 835 Tarihli: Sûret-i Defter-i Sancak-i Arvanid''. Ankara. 1954, p. 27 - 28.<br />
{{Reflist}}<br />
<br />
== Reliability on genealogy websites ==<br />
<br />
There has been some dispute over the reliability of either an accurate website of easy verifiability such as http://www.angelfire.com/realm/gotha/ and the biggest genealogy website in Portugal and perhaps in Europe, http://www.geneall.net/. Geneall.net, with more than a million entries, was part of a vaster project that was dropped by other countries, which prompted it to take the space others didn't want to fill. You can read about it on article here http://www.geneall.net/P/article.php?id=137 - a Portuguese translator is required. Such dispute is almost highly insulting to people in this environment who rely on them and are both qualified and this and other areas. This is something that should be cleared. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:21, 18 September 2010 (UTC)<br />
<br />
The first is a [[WP:SPS]] by someone called Paul Theroff, I'll let our genealogy people tell us if he's an established expert in this area. --[[User:Cameron Scott|Cameron Scott]] ([[User talk:Cameron Scott|talk]]) 16:48, 18 September 2010 (UTC)<br />
<br />
The second makes use of user generated content (I think from the submissions bit) but I'm not clear on the editorial policies. Since we currently use it on over 600 pages might be nice to sort that one out... I've removed both of these from BLPs (which is why this has ended up here) but will bow to the greater expertise on the matter. --[[User:Cameron Scott|Cameron Scott]] ([[User talk:Cameron Scott|talk]]) 16:52, 18 September 2010 (UTC)<br />
<br />
: The site has user generated content but nothing is added automatically nor without the consent and verifying of the author. Perhaps you should contact him through the webpage and he'll confirm it. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 17:43, 18 September 2010 (UTC)<br />
<br />
:So I looked up a random person on geneall.net: [[George Darwin]]. The site claims that he married Martha du Puy, but also states that she married his brother [[Francis Darwin|Francis]]: she did not. The site lists one child for George: he had four. This isn't what a reliable source looks like. [[User:Kenilworth Terrace|Kenilworth Terrace]] ([[User talk:Kenilworth Terrace|talk]]) 17:05, 18 September 2010 (UTC)<br />
<br />
:: I know it seems that just because you searched a random name and it had one or another flaw it seems like the whole website is equally flawed, but I can assure you as an everyday reader of that website that it's just a fluke. Errors like those I can find only very rarelly, if you can take a credit for my word. Check other lines if you have the time, please. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 17:48, 18 September 2010 (UTC)<br />
<br />
:: Incomplete doesn't mean wrong, sometimes it only includes one line and not the collaterals, but the line itself is as accurate as possible. The site has some flaws, of course, but that doesn't make it absolutely unreliable because of it. Read the article I mention above: there the author of the site criticizes people who are destructive towards the effort of such a huge project. Wikipedia has flaws too. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 17:43, 18 September 2010 (UTC)<br />
:::That's one of the reasons why Wikipedia also isn't considered a [[WP:RS|reliable source]]. &mdash; [[User:E. Ripley|e. ripley]]\<sup>[[User talk:E. Ripley|talk]]</sup> 18:15, 18 September 2010 (UTC)<br />
:: PS: [[User:Caponer]] is an expert. I invited him to this discussion but he doesn't show up since September 1. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 17:45, 18 September 2010 (UTC)<br />
<br />
*A website like this definitely wouldn't be a reliable source for anything but the opinions of its author. --[[User:John|John]] ([[User talk:John|talk]]) 18:26, 18 September 2010 (UTC)<br />
** So we have A. A self-published website by a person of no established expertise or reliability? And, 2. A website that is added to by just about anyone? Both A and B are unreliable. The geneaology stuff is just a mess.[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 18:30, 18 September 2010 (UTC)<br />
***Well perhaps this shouldn't surprise us; genealogy is pretty much non-science or pseudoscience, as between 1 and 20% of each generation's biological father isn't who they think it is. (See [[Non-paternity event]]). It doesn't take many generations with this sort of error before the whole thing becomes an article of faith, a social construct more than a scientific one. Until this fundamental problem with genealogy is addressed we will continue to have problems in this area. --[[User:John|John]] ([[User talk:John|talk]]) 18:44, 18 September 2010 (UTC)<br />
****Such low numbers, valid only for the present in which they were obtained but not for any epoch, make your statement irrelevant, they are clearly not enough to change whole ancestries, specially when the people who they cheat with are often people of a close environment and status, often with common ancestries, and sometimes even more or less closely related to their spouses. Specially when people have so many female lines with ancestries that often appear more than once. Plus, there is no matematical formula or average number for how many people cheat their spouses. And there are many cases when the actual father is discovered as being a famous lover. There were also ways of not getting pregnant from a lover since ages ago. And if tests can confirm the male line of old lineages, then female lines are even less susceptible of being false. In fact, if in the 12th century we have like more than a million ancestors are in our country the population back then was less than that, then the difference is not so huge. Also, if we see the physical and other similarities between parents and children we can realize that such claims are highly exagerated. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:12, 20 September 2010 (UTC)<br />
****You are making a very "republican" point. This is however irrelevant. [[Genealogy]] is not about [[gene]]s, but about ''[[family]]''. As to the question about science, genealogy is not studied at universities. Reliable sources in genealogy are generally produced by amateurs. This however does not in any way diminish their reliability. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]]) 19:32, 18 September 2010 (UTC)<br />
*****Genealogy is about ancestry, as it is perceived, that is, who are actually genetic ancestors. No one sees it in any other way. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:12, 20 September 2010 (UTC)<br />
******Reliable sources are RARELY produced by amateurs. If reliable sources with a reputation for fact checking accuracy dont exist, we cannot cover the subject. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 19:36, 18 September 2010 (UTC)<br />
*******An amateur can find solid elements and simply put them available. That doesn't make them unreliable. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:12, 20 September 2010 (UTC)<br />
*****So long as we are clear that we are talking about a faith-based belief rather than a scientific one, I agree with your first point. There's a school of thought that standards of reliability need to be even higher for pseudoscientific topics than for scientific ones. Amateurs, self-published sites and user-generated sites aren't normally considered as reliable sources. Why would be consider them to be in this case? --[[User:John|John]] ([[User talk:John|talk]]) 19:39, 18 September 2010 (UTC)<br />
******Just because some people have one or two children from another father it doesn't mean everyone is, and thus it doesn't make genealogy a pseudo-science. I don't know what the women you know do, but you seemed excessively biased. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:12, 20 September 2010 (UTC)<br />
******What's faith, that 98% of our ancestors are real or that 2% might not be? [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:14, 20 September 2010 (UTC)<br />
******We may be speaking of very different things. I do not think genealogy exist in the US beyond [[Ellis Island]] records. On the other hand, in countries with church records, even ordinary people can trace their roots to the 16. century. Likewise, European nobility is well covered in printed sources. As to the amateur sources, I am ''not'' referring to web sites, but printed sources reliably published. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]]) 19:53, 18 September 2010 (UTC)<br />
<br />
* Paul Theroff seems to be highly appreciated on the on-line genealogy community. Quoting from the [http://www.faqs.org/faqs/genealogy/german-faq/part2/ Frequently Asked Questions] file of <code>soc.genealogy.german</code> from 2005<br />
{{Cquote|Subject: 15. How can I learn about German noble families?<br />
<br />
The standard series of books on German nobility is the Gotha<br />
series, which has appeared under various titles since the late<br />
18th century. Look in your library catalog for a title similar<br />
to ''[[Gothaisches genealogisches Taschenbuch der adeligen Häuser]]''<br />
or ''[[Genealogisches Handbuch des Adels]]''. The latter has an online<br />
surname index at <http://www.rootsweb.com/~autwgw/sgi/index.htm><br />
<br />
Herbert Stoyan has an excellent online resource for noble<br />
genealogy called WW-Person at<br />
<http://www8.informatik.uni-erlangen.de/html/ww-person.html><br />
<br />
Paul Theroff has an online Gotha at<br />
<http://pages.prodigy.net/ptheroff/gotha/gotha.htm><br />
<br />
Please be advised, however, that stories of noble relations in<br />
American families are often exaggerated.<br />
}}<br />
:This however does not quite make him a reliable source. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]]) 18:40, 18 September 2010 (UTC)<br />
<br />
:: But how seriously do we take the views of online communities? --[[User:Cameron Scott|Cameron Scott]] ([[User talk:Cameron Scott|talk]]) 19:24, 18 September 2010 (UTC)<br />
:::Was that a rhetorical question? [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 19:40, 18 September 2010 (UTC)<br />
<br />
::::OK, let's take another random example. [http://www.geneall.net/W/per_page.php?id=556874 Adrian Carton de Wiart] is said to have one child by his first marriage and then to have married a second time to Joan Sutherland. At [[Adrian Carton de Wiart]] we read that he had two children by his first wife and that his second wife was called Ruth Myrtle Muriel Joan McKechnie. Not quite as bad as George Darwin, but still problematic. [[User:Kenilworth Terrace|Kenilworth Terrace]] ([[User talk:Kenilworth Terrace|talk]]) 20:36, 18 September 2010 (UTC)<br />
<br />
:::::The Wikipedia article also says the second wife, Joan McKechnie, was "known as Joan Sutherland" – with rather bad sourcing. The original source for all of this seems to be ''The Daily Telegraph'', 17 January, 2006, reprinted [http://peeragenews.blogspot.com/2006_02_01_archive.html here]. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]]) 21:26, 18 September 2010 (UTC)<br />
<br />
<br />
Genealogies generally do ''not'' list all children. This does not make them unreliable. Indeed, infant mortality and the reuse of names in a family occurs often. Also sites such as LDS do not check data offered. Major societies do (Mayflower, DAR etc.) and are reliable. As are Debrett etc. <br />
Lastly, women marrying the borther of their first husband are not rare at all, though I do not know if this is the Darwin case. See [[Henry VIII]]. [[User:Collect|Collect]] ([[User talk:Collect|talk]]) 12:32, 19 September 2010 (UTC)<br />
<br />
:Oh dear. My point is that I looked at exactly two entries. The Darwin entries contain ''errors'': Maud du Puy married George Darwin and she did not marry Francis Darwin. That error occurs in three places on the site: [http://www.geneall.net/U/per_page.php?id=537850 here], [http://www.geneall.net/U/per_page.php?id=516563 here] and [http://www.geneall.net/U/per_page.php?id=537849 here]. The de Wiart entry contains a ''serious inadequacy'': Joan Sutherland's correct name was Ruth Myrtle Muriel Joan McKechnie and that should have been recorded. Both entries are ''incomplete'' in respect of the list of children. Collect's points are valid in general, but irrelevant in this case -- the facts of which show the site in question to be quite unreliable. [[User:Kenilworth Terrace|Kenilworth Terrace]] ([[User talk:Kenilworth Terrace|talk]]) 16:17, 19 September 2010 (UTC)<br />
<br />
There is a Wikipedia article on the ''[[Almanach de Gotha]]''. The last edition, printed in [[Gotha (town)|Gotha]], is from 1944. On-line versions of the book [http://www.archive.org/search.php?query=almanach+de+gotha%20AND%20mediatype%3Atexts are available] at the [[Internet Archive]], the latest version seems to be from 1922. These are definitely [[WP:RS]] but are of little help in [[WP:BLP]]. There is another publication from London with the same name from 1998–2004, but it has been criticized for unreliability. It may well be that Paul Theroff's on-line Gotha may in fact be the most reliable. I do not think this notice board can pass judgment on Paul Theroff. The issue should be discussed and decided in [[Wikipedia:WikiProject Royalty and Nobility]] or maybe [[Wikipedia:WikiProject Genealogy]]. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]]) 16:54, 19 September 2010 (UTC)<br />
<br />
:As always, reliable for what purpose? Information in the ''Almanach de Gotha'' is probably reliable when it is dealing with people living at the time and their immediate ancestors and near relatives. The little historical sketches showing exactly how Prince Johannes Georg Ferdinand of Saxe-Saxe-Saxe is descended from Julius Caesar and how his family ruled X, Y and Z in the 12th century are not reliable in any sense since this kind of information is the province of historians. But in general, genealogical information which doesn't make it into plainly reliable sources probably isn't important and therefore one should not be looking for dubious sources with which to support it. An article without an ahnentafel or graphical family tree is usually all the better for that absence. [[User:Angusmclellan|Angus McLellan]] [[User talk:Angusmclellan|(Talk)]] 20:23, 19 September 2010 (UTC)<br />
<br />
::None of the sites mentioned (http://www.angelfire.com/realm/gotha/ , http://www.geneall.net/ ) are considered reliable sources by genealogists. They are self-published, have no editorial policies, accept any drivel submitted by anyone, and as already stated, are not reliable sources for anything but the opinions of their authors/contributors. There seems to be some misunderstanding about the nature of genealogy and its sources. Genealogical sources are not created ''by genealogists''; they consist largely of public records, (e.g., vital records, court records, censuses, ships' records, etc.) created in the past by public or governmental entities, and then cited as sources for the assertions of genealogists. Although genealogy is a mature field with [http://www.ngsgenealogy.org/cs/genealogical_standards_committee well-established standards], none of these sites employ those standards in determining what is posted there. Further, a genealogist can be a reliable source for ''how to conduct genealogical research'' without being a reliable source on the family tree of any given family.<br />
<br />
::To the sites already mentioned, I'd like to add another: http://www.wargs.com/ . It is used as a source in [http://en.wikipedia.org/w/index.php?title=Special:LinkSearch&target=http%3A%2F%2Fwww.wargs.com%2F&limit=500&offset=0 over 500 articles], many of which are biographies of living people. Each family tree there contains a disclaimer by the website owner: "The following material on the immediate ancestry of ''soandso'' should not be considered either exhaustive or authoritative, but rather as a first draft." Doesn't sound like it meets [[WP:RS]] to me. [[User:ProGene|ProGene]] ([[User talk:ProGene|talk]]) 20:43, 19 September 2010 (UTC)<br />
<br />
:::In my country, they are recognized as reliable, despite its flaws. As for the gotha one, if you compare with the actual Almanach of Gotha you'll see it's accurate. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:21, 20 September 2010 (UTC)<br />
<br />
::: A first draft essencially means incomplete, not wrong. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 16:16, 20 September 2010 (UTC)<br />
<br />
::: It's still a Self-published source (as far as I can tell) and should not be used. --[[User:Cameron Scott|Cameron Scott]] ([[User talk:Cameron Scott|talk]]) 16:18, 20 September 2010 (UTC)<br />
::::Whether first draft or not, anthing that has such a blatant "We do not stand behind the factual accuracy of the content you find here at this time" should not be used until they are willing to stand behind their claims. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 23:36, 20 September 2010 (UTC)<br />
<br />
::::: Such a blatant nothing. You're putting those words on the mouth of the author and trying to fit them in the claim that it is just a first draft. You can't infer that from "first draft". If I say something is still at the beginning you can't jump and accuse me of having inaccuracies as if you were inside my mind and work. [[User:LoveActresses|LoveActresses]] ([[User talk:LoveActresses|talk]]) 15:48, 21 September 2010 (UTC)<br />
<br />
:::::Does that mean it's OK to delete citations to http://www.wargs.com/ ? [[User:ProGene|ProGene]] ([[User talk:ProGene|talk]]) 23:41, 20 September 2010 (UTC)<br />
<br />
== Huffington Post RS Questions ==<br />
<br />
Problematic sourcing at huffington post<br />
{{La|The Huffington Post}}<br />
===Sexism===<br />
The Huffington Post is often criticized by feminists and conservatives alike for objectifying women by pushing disproportionately negative coverage of females, such as actress nipple slips.[35][36][37] The Huffington Post has also been accused of sexism in general, outside of its entertainment page.[38][39][40][41][42][43]<br />
<br />
Currently this looks like a minefield of sources that look questionable to say the least.<br />
*[http://jezebel.com/5284828/does-the-huffington-post-use-sexism-to-drive-liberal-page-views This article at jezebel.com]<br />
*[http://www.thefrisky.com/post/246-the-case-of-huffington-post-sexism/ The Frisky]<br />
*[http://www.washingtoncitypaper.com/blogs/sexist/2009/06/23/huffington-post-sexism-goes-green/ The Washington City paper]<br />
*[http://tpmcafe.talkingpointsmemo.com/talk/blogs/v/e/versharma/2009/06/peekaboo-sexism-at-the-huffing.php Talkingpointsmemo.com]<br />
*[http://www.undomesticgoddess.com/2010/02/guest-post-sexism-censorship-and-highly.html A blog at blogspot]<br />
*[http://open.salon.com/blog/cam_battley/2008/08/29/on_palinhuffington_post_wallowing_in_sexist_mud Open.Salon.com]<br />
*[http://community.feministing.com/2008/10/sexism-watch-and-the-huffingto.html community.feministing.com]<br />
<br />
The only one here looking remotely anything like a RS is Washingtoncitypaper.com which still can't have that high a ciruclation enough to be given Due weight escpieally since a [http://www.google.com/search?q=huffington+post+sexist&hl=en&safe=off&client=safari&rls=en&sa=X&ei=liWVTLrMDYGB8gbMpoiSDA&ved=0CBEQpwU&source=lnt&tbs=nws%3A1%2Ccdr%3A1%2Ccd_min%3A9%2F2%2F2006%2Ccd_max%3A9%2F18%2F2010 google search is not encouraging] [[User:ResidentAnthropologist|The Resident Anthropologist]] ([[User talk:ResidentAnthropologist|talk]]) 20:49, 18 September 2010 (UTC)<br />
:Even the best of those are nonnotable bloggers on a larger site. The first three had potential, but who are the people complaining even? Nobodies. Coverage would have to be more mainstream to be worth a mention in the HuffPo article. [[User:DreamGuy|DreamGuy]] ([[User talk:DreamGuy|talk]]) 18:43, 19 September 2010 (UTC)<br />
:: Here are a few better ones. [[The Weekly Standard]] [http://www.weeklystandard.com/weblogs/TWSFP/2009/11/huffpos_misogyny_the_nsfw_path.asp] [[National Organization for Women]] [http://www.now.org/issues/media/hall-of-shame/index.php/issues/sexism/?paged=2] Along with the one in the Washington City Paper, it's a clear trend, worth a mention in the HuffPo article. --[[User:GRuban|GRuban]] ([[User talk:GRuban|talk]]) 23:47, 19 September 2010 (UTC)<br />
<br />
===Antisemitism===<br />
the [[Institute for Global Jewish Affairs]] is the only source for:<br />
<br />
The Institute for Global Jewish Affairs has claimed that The Huffington Post promotes anti-semitism through its routine negative coverage of Israel, citing as examples its news stories, commentary, and the comments posters have made with regard to Jews.[29]<br />
<br />
[http://www.jcpa.org/JCPA/Templates/ShowPage.asp?DRIT=3&DBID=1&LNGID=1&TMID=111&FID=624&PID=0&IID=3211&TTL=Anti-Israelism_and_Anti-Semitism_in_Progressive_U.S._Blogs/News_Websites:_Influential_and_Poor Source]<br />
[[User:ResidentAnthropologist|The Resident Anthropologist]] ([[User talk:ResidentAnthropologist|talk]]) 20:54, 18 September 2010 (UTC)<br />
:Are you asking whether the Huffington Post is RS? We have discussed this before, look at the archives. I think the answer was yes. We can source articles to it without having to bring in any biases, whether sexist, antisemitic, liberal or otherwise. [[User:Itsmejudith|Itsmejudith]] ([[User talk:Itsmejudith|talk]]) 21:00, 18 September 2010 (UTC)<br />
::I think the OP is questioning the sources used for content in the Wikipedia Huff Post article itself, which do appear problematic to me. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:03, 18 September 2010 (UTC)<br />
As always, opinions from any source are usable as opinions, and referred to as such. WP does not vouchsafe that any opinions are "facts." [[User:Collect|Collect]] ([[User talk:Collect|talk]]) 12:20, 19 September 2010 (UTC)<br />
: This "institute" appears to be an arm of the [[Jerusalem_Center_for_Public_Affairs|JCPA]], which is an Israeli quango led by an Israeli diplomat and staffed largely by former/current Israeli army officers and diplomats. That qualifies it in my view as a promotional source along the lines of [[WP:QS]], so anything they say should be carefully attributed, that is if used at all. WP:V says that promotional sources shouldn't be used if the material can be seen as unduly self-serving, and labeling critics of Israel as anti-semites by the JCPA does sound self-serving to me. --[[User:Dailycare|Dailycare]] ([[User talk:Dailycare|talk]]) 16:30, 19 September 2010 (UTC)<br />
:Just saying that "opinions from any source are usable as opinions" is highly misleading, as there's the question of notability and fairness. If this is the only source making this claim the opinion is not notable, and it would be a violation of NPOV to include it in the article. [[User:DreamGuy|DreamGuy]] ([[User talk:DreamGuy|talk]]) 18:29, 19 September 2010 (UTC)<br />
:It is simply not true that "opinions from any source are usable as opinions"; this is a confusion of the guideline that self-published sources are usable for opinions about ''themselves'' (and which specifically excludes their opinions about third-parties). The site www.jcpa.org doesn't seem to meet any of our usual tests for a reliable source – peer-reviewed material, a defined editorial process, a reputation for accuracy. The 19 hits on Google Scholar don't show much evidence of being cited elsewhere. Unless someone can demonstrate that other reliable sources regard www.jcpa.org as reliable, then don't think it meets our requirements in RS. --[[User:RexxS|RexxS]] ([[User talk:RexxS|talk]]) 01:19, 21 September 2010 (UTC)<br />
<br />
===Jesse Ventura and 9/11 conspiracy theory===<br />
On March 9, 2010,The Huffington Post published and subsequently removed an article written by former Minnesota Governor Jesse Ventura with the following explanation: "Editor's Note: The Huffington Post's editorial policy, laid out in our blogger guidelines, prohibits the promotion and promulgation of conspiracy theories – including those about 9/11. As such, we have removed this post." Accusations of censorship soon followed.[30][31][32][33][34]<br />
<br />
*[http://www.huffingtonpost.com/jesse-ventura/for-some-the-search-for-w_b_491504.html The Removed Blog posting at Huff Post]<br />
*[http://www.democraticunderground.com/discuss/duboard.php?az=view_all&address=389x7904548 A forum]<br />
*[http://www.prisonplanet.com/huffington-post-kills-jesse-venturas-piece-on-911.html Parent Planet]<br />
*[http://www.infowars.com/huffington-post-sends-ventura-article-to-memory-hole Infowars.com]<br />
[[User:ResidentAnthropologist|The Resident Anthropologist]] ([[User talk:ResidentAnthropologist|talk]]) 21:04, 18 September 2010 (UTC)<br />
:Same as above. Notability. Including whining from some notoriously whiny blogs/boards when there is no real world coverage of it is making a mountain out of a molehill and violating NPOV in the process. [[User:DreamGuy|DreamGuy]] ([[User talk:DreamGuy|talk]]) 18:31, 19 September 2010 (UTC)<br />
<br />
== Newspaper question ==<br />
<br />
If a newspaper publishes a story - in the paper itself, rather than on its website - does that make it any the less of a story? I ask because a reference to a story in a newspaper has been questioned as "possibly fake" as it did not appear on the paper's website. (Although thousands of readers would have held the story in their hands). The "fake" comment crops up here, on 12 September: [http://en.wikipedia.org/w/index.php?title=Mark_A._Cooper_%28author%29&action=history]. A copy of the story has, however, been uploaded at Commons here: [http://commons.wikimedia.org/wiki/File:Cooperbook.jpg] - although it has been nominated for deletion. I have used refs to newspapers, books etc not found online in many articles without problem - so I just wondered if this was a new Wikipedia policy?--[[User: Myosotis_Scorpioides|'''<em style="font-family:Bradley Hand ITC;color:black"> Myosotis Scorpioides</em>''']] 21:19, 18 September 2010 (UTC)<br />
:Offline sources are fine becuase some one theoreitcally could track down the Micro-film of the paper that day. However the Scan on the commons seems to be an add that was placed in the paper rather than a "News story." So yes offline sources are fine but if its a recent date (especially in the last 10 years) and other stories that are contemporary to it are there and its not it would be a big [[WP:REDFLAG]]. [[User:ResidentAnthropologist|The Resident Anthropologist]] ([[User talk:ResidentAnthropologist|talk]]) 21:25, 18 September 2010 (UTC)<br />
:References should primarily be made to the printed versions of newspaper stories – with full page numbers etc., as they are persistent. Links to on-line versions should be provided, if they are available. However, in your case the article does not seem to be a newspaper story, but some kind of advertisement. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]]) 21:39, 18 September 2010 (UTC)<br />
:On top of that, most local community newspapers print all sorts of manner of junk that is not notable enough to be used as a source for demonstrating notability on Wikipedia. [[User:DreamGuy|DreamGuy]] ([[User talk:DreamGuy|talk]]) 18:47, 19 September 2010 (UTC)<br />
<br />
== Cited definitions - how should we treat them? ==<br />
<br />
I accept that copying large chunks of text without crediting the author is plagiarism, but where is the line? E.g. it is often useful to be able to cite a dictionary-style definition as part of an article, so the reader has a clear understanding of a particular term. Is it acceptable to copy the definition of the term verbatim from a source such as a dictionary, glossary or encyclopaedia as long as it is referenced? Does it have to be in quotes? And what if it's just one or two words different (without altering the sense)? An example is [[coal drop]] which is taken from the source cited. Of course, normally this would then get expanded with other material, whilst keeping the cite intact. --[[User:Bermicourt|Bermicourt]] ([[User talk:Bermicourt|talk]]) 23:07, 18 September 2010 (UTC)<br />
:IANAL, but; There is plagiarism and there is copyright violation. As long as we have correct references we are not comitting plagiarism. We might however be comitting a copyright violation. Also just altering a few words does not prevent violation of copyright. However facts are not copyrightable. [[User:Taemyr|Taemyr]] ([[User talk:Taemyr|talk]]) 00:06, 19 September 2010 (UTC)<br />
::<small>[[IANAL]]= "I am not a lawyer" - [[user:220.101.28.25|'''220.101''']] [[User talk:220.101.28.25|talk]]<sup>[[Special:Contributions/220.101.28.25|\Contribs]]</sup> 07:22, 19 September 2010 (UTC)</small><br />
:::I could be wrong, but I don't think it can be determined except by a judge in a court of law. If a source says "The house is red", we may be able to say "The house is red" (without the quotes), and it's not a copy vio or plagiarism because the statement is so simple that it doesn't need to be put in our own words. It's just simple information that cannot be copyrighted. If the statements become more complex, the possibility of running afoul in some way increases, and we need to summarize the information (which isn't copyrighted), without using the same wording or expression (which is copyrighted). This can be tricky per [[Wikipedia:Close paraphrasing]]. Anyways, it's always a judgement call unless an actual US judge makes a ruling, so we need to stay far from the line. - [[User:Peregrine Fisher|Peregrine Fisher]] ([[User talk:Peregrine Fisher|talk]]) 07:54, 19 September 2010 (UTC)<br />
Anent definitions - in technical areas, the term as used in a popular dictionary may not be congruent with scientific usage. Where any doubt exists, the more specific the source to the topic, the better. In the US, by the way, courts have held that simple statements of fact can not be copyrighted. This was pretty much a result of telephone directories (pretty much lists of numbers, names and addresses) were found not to be copyrightable. [[User:Collect|Collect]] ([[User talk:Collect|talk]]) 12:18, 19 September 2010 (UTC)<br />
<br />
:Normally, I'd recommend such a derivative sentence to be replaced by the source text inside quotes (making clear it's a quotation) and clearly referenced. There's no question that a properly-quoted short extract from an attributed source is acceptable for copyright purposes. By making the quote explicit, the editor does not commit plagiarism, since there's no inference that the editor is claiming the work as their own. Nevertheless, in this case, the entire article text consists of one sentence and a sentence fragment. By [[WP:DICTDEF]], it would be much more suitable for Wiktionary, unless it can be expanded substantially in the near future. I've created [[wikt:coal drop]] and attributed it to the present article. It's a new article, but if it is not expanded in a reasonable time, I'd suggest deletion – it's currently an orphan. --[[User:RexxS|RexxS]] ([[User talk:RexxS|talk]]) 02:06, 21 September 2010 (UTC)<br />
<br />
== YouTube video as wikipedia article reference ==<br />
<br />
Here [[WP:RD/M#YouTube video as wikipedia article reference]] or [http://en.wikipedia.org/w/index.php?title=Wikipedia:Reference_desk/Miscellaneous&oldid=385590561 DIFF] an editor has mentioned using several YouTube videos as references re [[Audi V8]] "to back up fact that this model haven't got an electronic speed limiter", and wondering why they were deleted. I mentioned [[wp:original research]], then realised that they were probably at the wrong venue. I suggested they come here. [[FYI]] and comment! Regards, - [[user:220.101.28.25|'''220.101''']] [[User talk:220.101.28.25|talk]]<sup>[[Special:Contributions/220.101.28.25|\Contribs]]</sup> 07:22, 19 September 2010 (UTC)<br />
:Creating and editing videos is only a little more difficult than writing text these days, so I can't see how a video from an anonymous uploader on YouTube is likely to meet our expectations for a [[WP:RS|reliable source]], as the site has no editorial process for ensuring the accuracy of what is presented. I'd suggest that the default assumption is that YouTube is not a reliable source, and the burden of proof in any individual case is on the editor wishing to use it as a source. --[[User:RexxS|RexxS]] ([[User talk:RexxS|talk]]) 02:25, 21 September 2010 (UTC)<br />
::The main exception is when it is a release from an organization such as Virgin Atlantic or something that is using Youtube for advertising purposes... but then it has to be treated as a primary source and with care that it is actually what is being presented.---'''[[User:Balloonman|<font color="purple">Balloonman</font>]]''' ''[[User talk:Balloonman|<b><sup><small>NO! I'm Spartacus!</small></sup></b>]]'' 02:39, 21 September 2010 (UTC)<br />
<br />
== Cato publications on Rand's centrality to Libertarianism ==<br />
<br />
From [[Libertarianism]]<br />
*Is Brian Doherty, [http://www.cato.org/research/articles/doherty-050405.html Ayn Rand at 100: "Yours Is the Glory"], [[Cato Institute]] Policy Report Vol. XXVII No. 2 (March/April 2005). reliable to substantiate "Ayn Rand has been described as "the most popular and influential libertarian figure of the twentieth century."" Given the grandiose claim, is it reliable to substantiate Ayn Rand as the most popular and influential libertarian figure of the twentieth century.<br />
::Cato Policy Reports are not listed as Peer Reviewed by Ulrich's<br />
*Is http://www.cato.org/special/threewomen/rand.html reliable to substantiate "Rand's "enormous contribution to the growth of libertarianism""<br />
*Is http://www.cato.org/special/threewomen/rand.html reliable to substantiate "that, "[m]any, and perhaps most, future libertarians first encountered libertarian ideas through Rand's novels, whether they ultimately accepted her Objectivist philosophy or not.""<br />
::Thanks for your time. Mentioned at [[Talk:Libertarianism#Ayn Rand]] [[User:Fifelfoo|Fifelfoo]] ([[User talk:Fifelfoo|talk]]) 12:08, 19 September 2010 (UTC)<br />
<br />
::: It depends on (wording of) the statement. <br />
::::#Is it a statement about what the Cato Institute says, or <br />
::::# is it a statement about what Ayn Rand is? <br />
::::[[User:North8000|North8000]] ([[User talk:North8000|talk]]) 14:58, 19 September 2010 (UTC)<br />
:::::[[Brian Doherty]] should be a good-enough commentator for Ayn Rand's significance in libertarianism; his opinions should be attributed. [[User:Itsmejudith|Itsmejudith]] ([[User talk:Itsmejudith|talk]]) 22:28, 19 September 2010 (UTC)<br />
::::::It is sad that some editors cannot tell the difference between an op-ed and reasoned commentary. We reject those sources in articles about social scientists for the same reason that we reject them for articles about natural sciences. [[User:The Four Deuces|TFD]] ([[User talk:The Four Deuces|talk]]) 01:22, 21 September 2010 (UTC)<br />
:::::::The Cato Institute does not seem to peer-review its contributions, nor state its editorial policies. However, it does attract numerous hits on Google Scholar, with many of its articles being cited elsewhere – although that's not a guarantee of reputation, it's at least an indication. The overall status of Cato Institute as a reliable source is unclear, and I'd recommend against using the second and third links as the sole source for a piece of text. On the other hand, using the piece by [[Brian Doherty (journalist)]] as a source could rely on Doherty's notability as a published "expert" in the field, but it would have to be treated as an opinion and attributed. --[[User:RexxS|RexxS]] ([[User talk:RexxS|talk]]) 02:50, 21 September 2010 (UTC)<br />
<br />
== Web based magazines as sources? ==<br />
<br />
I would like to know if the following web based e-magazines and e-"journals" are reliable sources for literary constructs:<br />
<br />
*Muse India [http://www.museindia.com]<br />
*Sketchbook [http://poetrywriting.org/]<br />
*Crisis Chronicles [http://library.crisischronicles.com]<br />
<br />
Thanks. --[[User:Ragib|Ragib]] ([[User talk:Ragib|talk]]) 16:33, 19 September 2010 (UTC)<br />
<br />
:To give more context to the above, I'm asking if these sources are reliable enough to show [[21 line fusion sonnet]] is a new kind of sonnet. (and given references are [http://www.museindia.com/regularcontent.asp?issid=33&id=2190], where one such sonnet is published, [http://poetrywriting.org/Sketchbook5-3MayJun2010/Sketchbook_5-3_MayJune_2010_Genre_Fusion_Sonnets_Sonnet_Mondal.htm], where the "creator" of such sonnets provide a definition). <small>(For the latter, please don't assume "Dr." implies a PhD ... apparently the "creator" of these sonnets uses "Dr." upon receiving an honorary D.Litt from a obscure local non-academic literary society.)</small>. --[[User:Ragib|Ragib]] ([[User talk:Ragib|talk]]) 16:58, 19 September 2010 (UTC)<br />
::I would be concearned about SPS here. Is there any evidacen that these onloijne magazines exercise any kind of editorial control?[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 17:46, 19 September 2010 (UTC)<br />
:::I doubt that any of them are anything other than SPS or blogs. [http://crisischronicles.com/ This] is definitely a personal blog published by [http://crisischronicles.com/About.html this person]. --[[User:Ragib|Ragib]] ([[User talk:Ragib|talk]]) 19:22, 19 September 2010 (UTC)<br />
:We'd need much better sources to establish newness of any literary form. [[User:DreamGuy|DreamGuy]] ([[User talk:DreamGuy|talk]]) 18:54, 19 September 2010 (UTC)<br />
:@Slatersteven-You can kindly visit the sites.They are old e-journals and reputed ones with very well edited contents.Apart from this the article has references of othe sites and journals also.Unsignificant materials have not never been published by these journals.[[Muse India]] also has a wiki article. {{unsigned|Poet009}}<br />
::I have and they look SPS vanity sites to me.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 19:17, 19 September 2010 (UTC)<br />
<br />
The other concern is this: I'm highly suspicious of any publication that prints content attributed to [http://poetrywriting.org/Sketchbook5-3MayJun2010/Sketchbook_5-3_MayJune_2010_Genre_Fusion_Sonnets_Sonnet_Mondal.htm "Dr. X"], when the person is clearly not the holder of an earned doctorate or a medical degree of any kind (only an honorary D. Litt, that too from a totally obscure non-academic organization). Reputable scholarly publications or one with at least some editorial control would never fail to catch a self-proclaimed "Dr.". --[[User:Ragib|Ragib]] ([[User talk:Ragib|talk]]) 19:16, 19 September 2010 (UTC)<br />
:There are other references too and many wikipedia articles have used these sites of muse india and other voices project or google books site as references before.I don't think they are vanity sites.{{unsigned|Poet009}}<br />
<br />
::That does not show these are reliable sources ... only means we need to remove them if used as sources in other Wikipedia articles, unless the sources are proved to be reliable. --[[User:Ragib|Ragib]] ([[User talk:Ragib|talk]]) 19:27, 19 September 2010 (UTC)<br />
<br />
::Can we have some soures toi sho0these sites being cited by RS please?[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 19:29, 19 September 2010 (UTC)<br />
<br />
::Ragib, Now you need to edit many things .Why haven't you done it before?yes they are reliable.Each of the journal has editors and one cannot just publish anything they want.The contents have passed through an editors' eyes.If they are non reliable you need to give proper evidence as so many wikipedia users cannot be wrong while using them as references.<br />
@Slatersteven let me browse the net to find Reliable sourse for these journals.<br />
For Muse India visit the link of one of the most reputed newspapers of India.[http://www.hindu.com/lr/2009/12/06/stories/2009120650020100.htm]<br />
<br />
:There is reference of google books in the article too and look this site can never be a SPS vanity [http://www.othervoicespoetry.org/vol45/mondal/index.html]<br />
::I would say that the Hindu referance does go a long way to establish that Muse is RS.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 20:08, 19 September 2010 (UTC)<br />
<br />
::It establishes that Muse is a web-journal/magazine, but I'm wondering if it is reliable as a scholarly publication. From the article, it seems that the author was using the word "journal" to mean "magazines", not a scholarly publication. --[[User:Ragib|Ragib]] ([[User talk:Ragib|talk]]) 20:15, 19 September 2010 (UTC)<br />
<br />
::Dear Ragib, then I must say no newspaper is also scholarly.Remove everything that is non scholarly.Does wikipedia says that the reference HAS TO BE scholarly.No.It says it must be reliable and it is dear Ragib.<br />
<br />
:::No that is a red herring. There is nothing to say that being 'just a magazine' invalidates anything as RS. However the Hindu article only says that Muse's themed issues are of a high standard. As such we really need a bit more.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 20:21, 19 September 2010 (UTC)<br />
<br />
::Another reference.After all my comment is that each of the website is not a vanity website.No one can post anything without editing and descission of the editors there and they are descent references for a short article.[http://archive.deccanherald.com/Content/Apr132008/artic2008041262369.asp]<br />
:::Actualy they can, its called my space and allows anyone to post poetry.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 20:41, 19 September 2010 (UTC)<br />
<br />
::Dear Slatersteven "my space" is for posting but only few selections from my space are entered into the main journal content per issue under the section selections from my space and the rest of the thematic contents book reviews etc are directly sent to the editor for consideration.Many major poets have contributed in this journal including Sunil Gangopadhyaya, the present Sahitya akademi president.<br />
<br />
:::None the less the magazine does in fact publish 'from the readers' material. it would therefore be neccersary to establish that any material that you are using as a source has undergone the editorial process (also the fact that major poest have been published there is as much of a red herring as it not being scholatic). I the case under discusionl you source only establishes tht this 21 line fusion sonnet has been writen by Mr Sonet, it does not establish anything else (including its newness). IN fact the source has published the poems wihtout any editorial comment so we cannot know if these are published becasue of their worth or becasue they were sent in. I also think there may be notabiltiy issues here rather the truely RS issues.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 20:58, 19 September 2010 (UTC)<br />
<br />
:The other site links in the article also needs to be checked.In none of the sites anyone can post their material except the editor.Also the other external links.[http://thehoustonliteraryreview.com/bookshelf.aspx] also google books link and other voices in Poetry link.Other voices was one of the sites listed in UNESCOs World Poetry Portal.As a whole I think notabily is there though there for the article to be there are bits of conflicting issues which might be solved keeping in track with new issues of reputed journals.<br />
<br />
:: I would be happier with more main stream sources revieing tnhis new form. What worries me is that none of them seem to.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 21:28, 19 September 2010 (UTC)<br />
<br />
::I would try to find them but these links are enough to keep this article but may be this article needs to get stronger with some more references.References of two print journals have also been added.Editor Yumugesa has quite an experience with editing sonnet articles and haikus etc.I am witing for his comment too.<br />
<br />
:::"Unlike the more common 14-line format, these sonnets comprise 21 lines, with new rhyming variations." is not supported by the text, the text is just the poetry itself. There is no anaylsis so you cannot claim the source says that this is a new form of Ryming or that they differ from any otehr type of ryme. Also the Crisi Chronical source was writen by the subject of the artciel so cannot be called third party so is not RS for this subject.As indead is the oterh source. So two thirds of the sources listed here are in fact by the subject (and the third appears to be as well). It dos not matter where a source is published (and there is some reason to say that Muse may be RS) it who writes it that is as important.[[User:Slatersteven|Slatersteven]] ([[User talk:Slatersteven|talk]]) 21:54, 19 September 2010 (UTC)<br />
<br />
== Blender Magazine as a source ==<br />
<br />
Is blender magazine a valid source? They had some criticism of [[Emerson Lake and Palmer]] which I would like to include in which they named ELP as the second worse band of all time. ELP has been a much criticized band but there is no indication of that from ELP's page here.--[[User:UhOhFeeling|UhOhFeeling]] ([[User talk:UhOhFeeling|talk]]) 23:18, 19 September 2010 (UTC)<br />
:Anyone? Buehler?--[[User:UhOhFeeling|UhOhFeeling]] ([[User talk:UhOhFeeling|talk]]) 14:59, 20 September 2010 (UTC)<br />
::[[Is there anybody out there?]]--[[User:UhOhFeeling|UhOhFeeling]] ([[User talk:UhOhFeeling|talk]]) 00:55, 21 September 2010 (UTC)<br />
:::From [http://www.blender.com/terms.html Terms & Conditions]:<br />
:::*"Dennis does not endorse or control the Submitted Content delivered to this Site, and Dennis has no obligation to monitor such Submitted Content. As such, Dennis does not guarantee the accuracy, integrity or quality of any such Submitted Content."<br />
:::If the criticism is "Submitted Content", then it's unequivocally not a reliable source. Given that the site itself is published in blog format and has no statement of editorial process for the rest of its content, I'd think it extremely unlikely that it meets [[WP:RS]] anyway. --[[User:RexxS|RexxS]] ([[User talk:RexxS|talk]]) 03:05, 21 September 2010 (UTC)<br />
<br />
== Linkedin BLP ==<br />
<br />
Is Linkedin good enough for sourcing an unreffed BLP? [[User:Us441|Us441]]([[User Talk:Us441|talk]])([[Special:Contributions/Us441|contribs]]) 00:15, 20 September 2010 (UTC)<br />
:Generally, no. The problem is that LinkedIn does nothing to verify that the person making the account is actually the person in question. As such, we can't reliably state that the information is accurate. Even if it were allowed, it would fall under the restrictions for self-published sources about themselves, which can be found at [[WP:SELFPUB]]; the fifth point on that list says that "[they may be used as long as] the article is not based primarily on such sources." [[User:Qwyrxian|Qwyrxian]] ([[User talk:Qwyrxian|talk]]) 00:52, 20 September 2010 (UTC)<br />
::Agree, generally not reliable, especially if there are no other sources at all.--[[User:Cuchullain|Cúchullain]] [[User talk:Cuchullain|<sup>t</sup>]]/[[Special:Contributions/Cuchullain|<small>c</small>]] 13:25, 20 September 2010 (UTC)<br />
<br />
== Le Monde Diplomatique ==<br />
<br />
Can Le Monde Diplomatique, particularly its maps, such as this one [http://www.monde-diplomatique.fr/cartes/albanie] be considered a reliable source? [[User:Athenean|Athenean]] ([[User talk:Athenean|talk]]) 01:46, 20 September 2010 (UTC)<br />
: Le Monde Diplomatique is a very high quality news source in general. As to the map, the question of reliability is transfered (partially). In this case to the source: "La Question alabanaise, Fayard, 1995." Le Monde generally does well with what it broadcasts, but is not infallible (of particular interest, if there is doubt, is ''when'' Le Monde ran this map; sometimes things are thought accurate that are changed/corrected later by further research. The book, after all, is 15 years old). All that said, if the book is not available for review, and there is no specific argument that the source is wrong, it's probably OK. However, a further question arises: Why would one use a map when, likely, the key piece of information desired (not clear what in this case) should be in a piece of text somewhere? Graphics in newspapers ''in general'' frequently fudge the precise contours or borders and simplify in other ways for visual force. Using maps, ''in general'', from newspapers as ''sources'' can be problematic because there interpretation can be subjective (can be, not always). Sorry I'm not more helpful (hopefully someone else will hapen along). My French isn't good enough to read and offer an opinion on the source of the map.[[User:Bali ultimate|Bali ultimate]] ([[User talk:Bali ultimate|talk]]) 02:21, 20 September 2010 (UTC)<br />
::This isn't ''its map'', but a map created by chartographer Philippe Rekacewicz, who claims to be using a book by [[Rexhep Qosja]] as a source. The thread isn't about Le Monde Diplomatique, which like every other newspaper doesn't take responsibility for the reliability of its external partners works. The map itself has many errors that make it unreliable. The most obvious are:<br />
*[[File:Kosovo ethnic 2005.png|thumb|100px]](The census was co-conducted by the [[OSCE]]) Leposavic, Zubin Potok, Zvecan and Strpce are districts were the Serbian population is the majority. The map presents only Leposavic as an area of Serbian majority in the north and in the south has replaced Strpce with the area of Dragas, an Albanian majority area.<br />
*[[File:Macedonia ethnic2002 03.png|thumb|left|100px]]The Rekacewicz map doesn't reflect the Albanian majority in Struga, Debar and it presents the area of [[Resen Municipality]] as 30-50% Albanian, while Albanians form only about 9-10% of the region.--<span style="background-color: maroon; color: white">[[User:ZjarriRrethues|<font color="white">'''—&nbsp;''ZjarriRrethues''&nbsp;—'''</font>]]</span>&nbsp;<sup>[[User_talk:ZjarriRrethues|talk]]</sup> 07:57, 20 September 2010 (UTC)<br />
:::All of that is beside the point. LMD, a reliable source, has published the map, which originates from a book published by [[Fayard]], a reputable publisher and itself a reliable source. The comments above about purported mistakes in the map appear to be original research, and in themselves do not invalidate its use. If you have reliable sources challenging the accuracy of the map, they could be cited in the relevant article. Our criterion, remember, is verifiability, not truth. This map is indeed verifiable from eminently reliable sources.<span style="font-family: Papyrus">[[User:RolandR|RolandR]] ([[User talk:RolandR|talk]])</span> 08:34, 20 September 2010 (UTC)<br />
(unindent)It can hardly be called original research because my comment is based on the two census maps that you can check yourself. Yes, I agree that our criterion is verifiability and like Bali ultimate said it would be great if someone actually had the book. Btw the map doesn't originate from the book, it was created by a chartographer who claims to be using the book as a source.--<span style="background-color: maroon; color: white">[[User:ZjarriRrethues|<font color="white">'''—&nbsp;''ZjarriRrethues''&nbsp;—'''</font>]]</span>&nbsp;<sup>[[User_talk:ZjarriRrethues|talk]]</sup> 09:56, 20 September 2010 (UTC)<br />
:::The map of LMD is actually verified by an endless bibliography, so I see no problem with that all.[[User:Alexikoua|Alexikoua]] ([[User talk:Alexikoua|talk]]) 11:54, 20 September 2010 (UTC)<br />
::::Which bibliography? The census itself challenges it. In addition is completely outdated: 1995 vs 2010 is a long time. We know that around 1 million people have emigrated within Albania only. Philippe Rekacewicz has made changes to Qosja's map in 1998, and there are no explanations on where he took the census data. Since he is not referencing his own work (he's simply saying that he has "updated" Qosja's map according to national censuses, without specifying which), although LMD is a reliable source, its cartographer's work may not be regarded as a reliable source: it fails reliability since there are no references. In fact putting the Albanians as a minority in the whole [[Korçë County]] is an absurdity. --<span style="font-family: Gothic;">[[User:Sulmues|'''<big>S</big>'''ulmues]] <sup>([[User talk:Sulmues|talk]])</sup></span> 12:26, 20 September 2010 (UTC)<br />
:::::We don't demand that our sources provide their own sources. LMD has its own editorial control and standards, and takes responsibility for what it publishes. It has always been considered a reliable source, and your own original research and synthesis above is certainly not sufficient reason to reconsider this. <span style="font-family: Papyrus">[[User:RolandR|RolandR]] ([[User talk:RolandR|talk]])</span> 13:09, 20 September 2010 (UTC)<br />
(unindent)Newspapers don't take responsibility about what their external partners do. We're here to discuss the map of the chartographer. The map is supposedly a 1998 map based on Qosja with updated issues. Obviously it's a wrong map as anyone can observe by checking the census of Kosovo and the one of Macedonia(there's nothing OR about checking someone's claims)--<span style="background-color: maroon; color: white">[[User:ZjarriRrethues|<font color="white">'''—&nbsp;''ZjarriRrethues''&nbsp;—'''</font>]]</span>&nbsp;<sup>[[User_talk:ZjarriRrethues|talk]]</sup> 13:50, 20 September 2010 (UTC)<br />
:Z, do you have other sources which disagree? You seemed to be saying you did? I think that direction of discussion is more important than arguing the logic of the situation because this noticeboard is intended to be for quite rules-based discussion.--[[User:Andrew Lancaster|Andrew Lancaster]] ([[User talk:Andrew Lancaster|talk]]) 14:22, 20 September 2010 (UTC)<br />
<br />
::I thought that the official census of Kosovo and Macedonia as sources were enough, but there are many sources disagreeing with the obvious errors of the map. Btw that cartographer created maps that contradict each other like this map which is about the same subject [http://mondediplo.com/maps/mosaic], but shows a different status(this map was created too on 2008). Philippe Rekacewicz created two maps about the same subject in 2008 and they contradict each other as well the official census of Macedonia, Kosovo, Montenegro etc. Andrew I can create a list of all the different sources that disagree with the cartographer but isn't the fact that he created two maps in the same time period about the same subject that contradict each other and the official census of numerous countries enough to prove that his work isn't reliable.--<span style="background-color: maroon; color: white">[[User:ZjarriRrethues|<font color="white">'''—&nbsp;''ZjarriRrethues''&nbsp;—'''</font>]]</span>&nbsp;<sup>[[User_talk:ZjarriRrethues|talk]]</sup> 14:36, 20 September 2010 (UTC)<br />
<br />
:::I always thought LMD was an excellent source, and I'm glad to see I have been vindicated. '''Background''': This dispute originated in the Commons over this map [http://commons.wikimedia.org/wiki/File:Presence_of_Albanians_in_%22Greater_Albania%22.png]. Originally the map was identical to version of LMD, then it was tampered with by ZjarriRrethues & Co. claiming "mistakes" (in other words, OR). Particularly odious is the use of grey to color the areas in Greece on the grounds that "no official data" apparently means "no data at all". When I present these users with data, e.g. from LMD, they claim "mistakes" and start [[WP:IDHT]]ing. It is impossible to get anywhere in the discussion in the Commons, so if some outside observers could participate, I would be much obliged. [[User:Athenean|Athenean]] ([[User talk:Athenean|talk]]) 14:47, 20 September 2010 (UTC)<br />
(unindent)This isn't about LMD and please don't IDHT the fact that you have two maps created by the same cartographer published both by LMD and they contradict each other and the official census of numerous countries. Athenean we're not discussing LMD's reliability but the map's reliability. This a map by Philippe Rekacewicz saying that he's using Qosja as a source not a map happened to be on LMD.--<span style="background-color: maroon; color: white">[[User:ZjarriRrethues|<font color="white">'''—&nbsp;''ZjarriRrethues''&nbsp;—'''</font>]]</span>&nbsp;<sup>[[User_talk:ZjarriRrethues|talk]]</sup> 15:12, 20 September 2010 (UTC)<br />
:The two maps don't appear to me to contradict each other. LMD is RS, not much more to be said. [[User:Itsmejudith|Itsmejudith]] ([[User talk:Itsmejudith|talk]]) 15:16, 20 September 2010 (UTC)<br />
::[[File:Kosovo ethnic 2005.png|thumb|100px|Census of Kosovo]]<br />
[[File:Macedonia ethnic2002 03.png|thumb|left|100px|Census of Macedonia]]<br />
[http://www.monde-diplomatique.fr/cartes/albanie Map 1]<br />
[http://mondediplo.com/IMG/pdf/mosaic.pdf Map 2]<br />
The differences are obvious, so not much more to be said.--<span style="background-color: maroon; color: white">[[User:ZjarriRrethues|<font color="white">'''—&nbsp;''ZjarriRrethues''&nbsp;—'''</font>]]</span>&nbsp;<sup>[[User_talk:ZjarriRrethues|talk]]</sup> 15:30, 20 September 2010 (UTC)<br />
:Indeed, I agree with Zjarri: The [[Korçë County]] looks completely different in the second one as compared to the first one. --<span style="font-family: Gothic;">[[User:Sulmues|'''<big>S</big>'''ulmues]] <sup>([[User talk:Sulmues|talk]])</sup></span> 15:53, 20 September 2010 (UTC)<br />
::The two maps are entirely compatible and make the same point, although one shows by means of hatching which two populations are ppresent and the other is a shaded thematic map of the percentage of Albanians only. Albanians are the majority in Albania apart from a few areas in the south east, in nearly all of Kosovo, as well as in some border areas of Montenegro and Macedonia. They tell the same story for [[Korçë County]], as well: both say that Albanians and another ethnic group are present. One map applies a different kind of shading to the north of the county than to the south; the other colours it all the same ''because it is a thematic map at county level''. And, on top of all that, it's in ''Le Monde Diplo'', a newspaper at the quality end of the market if ever there were one. [[User:Itsmejudith|Itsmejudith]] ([[User talk:Itsmejudith|talk]]) 16:05, 20 September 2010 (UTC)<br />
<br />
:::I have opened a discussion thread at the dispute resolution board in the Commons here [http://commons.wikimedia.org/wiki/Commons:Disputes_noticeboard#.22Greater_Albania.22]. Participation by editors <s>from uninvolved nationalities is particularly welcome (and from involved nationalities much less so),<s>who participated in this thread would be great as I feel that is the only way progress will be made. [[User:Athenean|Athenean]] ([[User talk:Athenean|talk]]) 16:19, 20 September 2010 (UTC)<br />
::::Uninvolved nationalities! No, we contribute as Wikipedia editors. I hereby formally declare myself to be involved because a) I speak French and Le Monde Diplomatique is a French publication and b) I am English and LMD is also published in English. We are all as involved or uninvolved as each other. [[User:Itsmejudith|Itsmejudith]] ([[User talk:Itsmejudith|talk]]) 16:24, 20 September 2010 (UTC)<br />
<br />
:''[[Le Monde Diplomatique]]'' is a WP:RS – and if I remember correctly – is world renowned for its reliable high-quality maps. -- [[User:Petri Krohn|Petri Krohn]] ([[User talk:Petri Krohn|talk]])<br />
:Subject only to [[WP:NEWSORG]], ''[[Le Monde Diplomatique]]'' is as good a reliable source as you'll get. If you have other reliable sources that contradict LMD, then take it to the article talk page and follow the guidance in [[WP:YESPOV]]. --[[User:RexxS|RexxS]] ([[User talk:RexxS|talk]]) 03:21, 21 September 2010 (UTC)<br />
<br />
==Independent Political Report==<br />
Is the [http://www.independentpoliticalreport.com/about/ Independent Political Report] a reliable source for news about minor political parties in the United States? Its website says it "is dedicated to covering America’s third parties and independent candidates, and providing a forum for the intelligent discussion thereof. IPR has been linked to by major sites like Politico, The Washington Post, Politics1, The American Spectator, Reason Magazine, and The American Conservative." [[User:The Four Deuces|TFD]] ([[User talk:The Four Deuces|talk]]) 14:43, 20 September 2010 (UTC)<br />
:Not RS. Articles do not appear to be signed. Editorial control does not appear to be in effect. Articles are primarily reprints of other news sources verbatim. Signed articles by accepted specialists would be okay. Unsigned articles do not appear to have any indication of oversight, verification, or editorial control. [[User:Fifelfoo|Fifelfoo]] ([[User talk:Fifelfoo|talk]]) 14:53, 20 September 2010 (UTC)<br />
::Per above, depends on who wrote it and/or if it also appeared in more reliable source. Case by case basis cause has good stuff and has unreliable tripe. [[User:Carolmooredc|CarolMooreDC]] ([[User talk:Carolmooredc|talk]]) 22:41, 20 September 2010 (UTC)<br />
<br />
== Polar codes, by Andrew Polar ==<br />
<br />
The editor {{userlinks|C-processor}}, wants to add information about Polar codes, which he invented. His articles have been deleted for lack of notability; I recented removed a bit on it from [[Shannon–Fano coding]] (see [[Talk:Shannon–Fano_coding#Polar_codes]]). On my talk page, he tells me: <br />
<br />
{{quote|Original concept is published by myself [http://www.ezcodesample.com/prefixer/prefixer_article.html Polar codes], it was found and incorporated by independent researcher into [http://code.google.com/p/lzham/ LZHAM] data compressor. ... Polar codes are also mentioned by expert in industry Matt Mahoney in his [http://mattmahoney.net/dc/text.html Large Text Compression Benchmark]. The site is long, search for Polar codes and you can find there an explanation. Explanation means recognition of novelty by industry expert. Mahoney do not explain other algorithms because they are known. I note that Polar codes is not an article. It is simple note in Wiki informing readers about one more way of entropy coding.}}<br />
<br />
In which the "Large Text Compression Benchmark" is what looks like a personal web site: http://mattmahoney.net/dc/text.html.<br />
<br />
I told him I don't think these meet [[WP:RS]], but I'll be happy to hear alternative views. Anybody? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon|talk]]) 07:07, 21 September 2010 (UTC)<br />
<br />
:The chances that anyone leave a message here are the same as winning lottery. The user who voted for keeping the article already exists. Here the link to [http://en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/Polar_Tree discussion] Sebastian Garth nominated article for deletion but during discussion changed his opinion after I provided reference to Mahoney test inventory. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 16:57, 21 September 2010 (UTC)<br />
<br />
== Etymonline.com ==<br />
<br />
Is Etymonline.com considered a reliable source? It was used as a source on the [[Puck (mythology)]] article until just recently, when [[User:Bloodofox|Bloodofox]] [http://en.wikipedia.org/w/index.php?title=Puck_%28mythology%29&action=historysubmit&diff=380212531&oldid=380211297 removed it], saying it was unreliable. The site was used to source the etymology of three words, but was not the main or only source. The etymologies given on the site looked legitimate to me. And, the site [http://www.etymonline.com/sources.php lists] all of its sources. But, I want to know what other editors think. ---<font face="Georgia">'''[[User:RepublicanJacobite|<span style="color:#009900">RepublicanJacobite</span>]]'''<sub>''[[User talk:RepublicanJacobite|<span style="color:#006600">The'FortyFive'</span>]]''</sub></font> 15:02, 21 September 2010 (UTC)</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Dicklyon&diff=386059603User talk:Dicklyon2010-09-21T07:00:08Z<p>C-processor: /* Removing Polar Coding from Shannon-Fano coding */</p>
<hr />
<div>{{wikibreak|Dick|eventually. After nearly four years and 43K+ edits, I think a year off is a good idea.}}<br />
<br />
''Please add new talk topics at the bottom of the page, and sign with <nowiki>~~~~</nowiki>''<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Barnstar.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The Original Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | I'm not sure why you haven't picked up a bevy of these already, but thanks for all your effort, particularly in tracking down good sources with diagrams, etc., on the photography- and color-related articles (not to mention fighting vandalism). Those areas of Wikipedia are much richer for your work. Cheers! —[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 02:05, 27 February 2008 (UTC)<br />
|}<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Barnstar-camera.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The Photographer's Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | To Dicklyon on the occasion of your [[:Image:Ivan Sutherland at CHM.jpg|photograph]] of [[Ivan Sutherland]] and his birthday! What a great gift. -[[User:SusanLesch]] 04:40, 23 May 2008 (UTC)<br />
|}<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Allaroundamazingbarnstar.png]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''All Around Amazing Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | For your hard work in improving and watching over the Ohm's law article [[User:Spinningspark|<font style="background:#FFF090;color:#00C000">'''Sp<font style="background:#FFF0A0;color:#80C000">in<font style="color:#C08000">ni</font></font><font style="color:#C00000">ng</font></font><font style="color:#2820F0">Spark'''</font>]] 00:59, 18 January 2009 (UTC)<br />
|}<br />
<br />
{{The Original Barnstar|For your improvements to the [[Centrifugal force]] articles. Your [[WP:UCS|common sense]] approach of creating a summary-style article at the simplified title, explaining the broad concepts in a way that is [[WP:MTAA|accessible to the general reader]] and linking to the disambiguated articles, has provided Wikipedia's readership with a desperately needed place to explain in simple terms the basic concepts involved in understanding these related phenomena. [[User:Wilhelm meis|Wilhelm_meis]] ([[User talk:Wilhelm meis|talk]]) 14:29, 6 May 2009 (UTC)}}<br />
<br />
----<br />
<br />
== Recreating [[Eugene F. Lally]] article ==<br />
<br />
Can I get a copy of [[Eugene F. Lally]] as it was when you deleted it? I now have a number of secondary sources in hand, which I think will serve to establish notability, and I'd rather not start from scratch. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon|talk]]) 19:25, 24 December 2009 (UTC)<br />
:Sure, done at [[User:Dicklyon/Eugene F. Lally]]. [[User:Stifle|Stifle]] ([[User talk:Stifle|talk]]) 22:44, 24 December 2009 (UTC)<br />
<br />
I may not get to working on this any time soon. If anyone wants copies of articles so they can help, let me know by email. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:50, 28 December 2009 (UTC)<br />
<br />
== December 2009 ==<br />
[[File:Nuvola apps important.svg|25px]] You currently appear to be engaged in an '''[[WP:Edit war|edit war]]'''&#32; according to the reverts you have made on [[:Pan]]. Note that the [[Wikipedia:Three-revert rule|three-revert rule]] prohibits making more than three reversions on a single page within a 24-hour period. Additionally, users who perform several reversions in content disputes may be blocked for edit warring even if they do not technically violate the [[Wikipedia:Three-revert rule|three-revert rule]]. When in dispute with another editor you should first try to [[Wikipedia:Talk page guidelines|discuss controversial changes]] to work towards wording and content that gains a [[Wikipedia:Consensus|consensus]] among editors. Should that prove unsuccessful, you are encouraged to seek [[WP:DR|dispute resolution]], and in some cases it may be appropriate to request [[WP:PP|page protection]]. Please stop the disruption, otherwise '''you may be [[Wikipedia:Blocking policy|blocked]] from editing'''. <!-- Template:uw-3rr --> [[User talk:Ucucha|Ucucha]] 18:30, 26 December 2009 (UTC)<br />
<br />
:I hardly think my edits there can be considered warring or disruptive, but I'll leave it alone for now. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 20:18, 26 December 2009 (UTC)<br />
<br />
== MHP FAQ ==<br />
<br />
Hi - I appreciate your efforts [[Talk:Monty Hall problem/FAQ|here]]. Glkanter seems to think the old version had a "pro-Morgan" POV. I have let him know I'd be happy to work with him to make it more NPOV. Although he rejected this offer outright, I think this is what's happening (by incremental editing - which is how it's actually supposed to work). -- [[user:Rick Block|Rick Block]] <small>([[user talk:Rick Block|talk]])</small> 18:11, 27 December 2009 (UTC)<br />
<br />
== Speed of light - 2 errors mentioned in your edit summary ==<br />
<br />
Hi. I fixed 2 errors (a misplaced semicolon and period) that I think you referred to in your edit summary. I'm curious why you didn't simply fix them yourself instead of reverting the other editor's edit. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:17, 27 December 2009 (UTC)<br />
<br />
:I couldn't see the point of the edit; the simple fix was to revert it. What was left? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:37, 27 December 2009 (UTC)<br />
::One thing I noticed was that the edit used periods and sentences that replaced the use of semicolons and consequent longer sentences. Like the editor, I think the periods and sentences style is better. --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:47, 27 December 2009 (UTC)<br />
<br />
:::I don't deny it. I tend to use too many semicolons, indefensibly. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:51, 27 December 2009 (UTC)<br />
<br />
::::That's so refreshing. I wish more editors had your attitude. Keep up the good work. Best regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:56, 27 December 2009 (UTC)<br />
<br />
::::A sabbatical! Best wishes, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 18:12, 28 December 2009 (UTC)<br />
<br />
== Wikibreak ==<br />
<br />
A whole year? I hope you aren't serious. Regardless, best wishes for a healthy, happy, and fulfilling New Year.—[[User talk:Finell|Finell]] 18:15, 28 December 2009 (UTC)<br />
<br />
<br />
== December 31 2009 ==<br />
Hello, I'm trying to get the wiki for my band "The Secretions" undeleted. The user who deleted it has been banned from the site so I can't appeal to them, your name was listed on the deletion record too. Why exactly was it deleted? Why did you flag it for deletion? Apparently we weren't "well known enough" to warrant a wiki? We have been playing shows all around the US and Mexico for 17 years now. Maybe we aren't on a major label or on MTV but I really don't think that should be a requirement for wikipedia. A lot of our fans worked long and hard on that page and I would like to have it restored, for history's sake as well as a reference for future business contacts. There are a lot of other pages that used to cross-reference it as well. Any tips you could give me on who I need to contact about this would be great. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Mickierat|Mickierat]] ([[User talk:Mickierat|talk]] • [[Special:Contributions/Mickierat|contribs]]) 23:10, 31 December 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:I have no recollection of it. How about a link to the deletion discussion? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 23:49, 31 December 2009 (UTC)<br />
<br />
::See [[Wikipedia:Articles for deletion/The Secretions]]. -- [[user:Rick Block|Rick Block]] <small>([[user talk:Rick Block|talk]])</small> 00:04, 1 January 2010 (UTC)<br />
<br />
:::Right. If there's new evidence of notability that can be cited, per [[WP:BAND]], I'd take it to [[Wikipedia:Deletion review]]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 00:34, 1 January 2010 (UTC)<br />
<br />
== Is this guy a quack? ==<br />
<br />
Hey, Dick,<br />
<br />
I've been reading ''The Return of the Sacred Architecture-: The Golden Ratio and the end of Modernism'' from Herbert Bangs. Specifically, the later chapters, after page 146, in which he starts talking about who has used "Sacred Geometry". He reached similar conclusions to the ones I've got so far: the golden ratio starts to appear ex-professedly with the discovery of the pentagram, then as "mean and extreme ratio" after the Greeks discover that it can also be produced from the square and pentagram, in the Renaissance it stops being used in architecture, not to return until Le Corbusier, who used it explicitly... However, he also attributes the presence of sacred Geometry, from the pyramids to the gothic cathedrals to the "brotherhood of Solomon" (the stone masons), sponsored by the Knights Templar in their later works... I noticed that there are indeed some eerie oddities like it's like it's relationship with the pitagorians (and the gate of Tartarus story), Ishtar, the number of the beast vs. the number of the followers of the lamb (both relate to a golden triangle trigonometrically) and the fact that the Gothic Cathedrals were created by masons, but a single brotherhood connecting all of that since Ancient Egypt, plus the Templars is just too much for me. <br />
<br />
The guy, Bangs, has some good credentials, specially working for Buckminster, a key figure when it comes to geometry+architecture. However, that "bortherhood of Solomon" thing... do you think he's a quack? <br />
<br />
--[[User:20-dude|20-dude]] ([[User talk:20-dude|talk]]) 17:27, 6 January 2010 (UTC)<br />
<br />
== Request for Amendment to Arbitration == <br />
<br />
Hello, Dicklyon. This is to inform you that there is a [[Wikipedia:Arbitration/Requests/Amendment#Request_to_amend_prior_case:_Speed_of_Light|request for amendement]] regarding an arbitration case that you have commented on.[[User:Likebox|Likebox]] ([[User talk:Likebox|talk]]) 05:03, 8<br />
<br />
=="megapixel lens"==<br />
<br />
Hello Dick. Can I perhaps interest you in [[Wikipedia:Reference_desk/Miscellaneous#.22megapixel_lens.22.2C_etc|this iggernant question]] of mine? -- [[User:Hoary|Hoary]] ([[User talk:Hoary|talk]]) 15:45, 15 February 2010 (UTC)<br />
<br />
==Ray Blanchard==<br />
<br />
Challenging a citation count as Not WP:RS? That's DICKLYON:BS. Knock it off. I have replaced the web of science with google scholar. You can do the count yourself, DICK. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/75.0.145.252|75.0.145.252]] ([[User talk:75.0.145.252|talk]]) 06:39, 19 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
:Please review [[WP:NPA]]. Also beware that playing with my name has led to a block in the past; you don't want to go down that route.<br />
<br />
:The right place to discuss this would be on the article's discussion page; I could do the count myself, yes, and that would be [[WP:OR]]; Google scholar is a research tool, not a publisher of facts. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 02:48, 20 March 2010 (UTC)<br />
<br />
== General blur spot ==<br />
<br />
Dick, it looks like you added the definition for a general blur spot as “the diameter of the smallest circle that can contain 90% of the optical energy” to [[Circle of confusion]] on 21 February 2006. Do you happen to know where you got it? It seems to be a concern for another editor ... [[User:JeffConrad|JeffConrad]] ([[User talk:JeffConrad|talk]]) 09:02, 19 April 2010 (UTC)<br />
<br />
:No, I don't recall. I've seen the concept of measuring spot size (or point spread function diameter) by an energy threshold, but I don't really recall where. I was attempting to put a more logical basis on what a diameter would mean, but I didn't base it on a source, so it wouldn't bother me much if it were removed. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 03:14, 20 April 2010 (UTC)<br />
<br />
:The concept appears to go by "encircled energy". Lots of hits in optics books and papers, but not specifically tied to "circle of confusion". Thresholds of 95%, 90%, 84%, 80%, 70%, and 50% are easy to find. E.g. [http://books.google.com/books?id=6mb0C0cFCEYC&pg=PA99&dq=%22encircled+energy%22&as_brr=3&ei=BCjNS_-OC5TglQTwwrGbBw&cd=2#v=onepage&q=%22encircled%20energy%22&f=false this book]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:08, 20 April 2010 (UTC)<br />
<br />
::As I feared, it's not quite as simple as I had hoped. Warren Smith covers the same topic (citing the 84% value), but all that I have handy is his chapter in an old edition of the OSA ''Handbook of Optics'', so the treatment is cursory. A greater issue seems to me that the cited values apply to various conditions of “best focus”, so I'm not sure how to handle a defocused system. I've reviewed Hopkins, Sokseth, and Williams and Becklund, and at least at first glance, have not found much that is helpful. Do I have the right take on this? I'm not sure we need a lengthy treatise, but it's probably reasonable to at least mention that the real world isn't quite as simple as we present it in the article.<br />
<br />
::Given that this seems to be more than just a simple query for a source supporting the statement, perhaps we should move this to the article Talk page. [[User:JeffConrad|JeffConrad]] ([[User talk:JeffConrad|talk]]) 08:03, 20 April 2010 (UTC)<br />
<br />
== Color diagrams ==<br />
<br />
Hi DickLyon, could you comment on the discussion we are having on my talk page at [[User_talk:PAR#colors_in_chromaticity_diagrams]]. Thanks. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 03:03, 11 May 2010 (UTC)<br />
<br />
: I guess I should have put that somewhere other than PAR’s talk page; I just figured since (s)he made a bunch of chromaticity diagrams that have been up for a while, (s)he might have input. How’s your wiki break going, Dick? :-) –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 03:49, 11 May 2010 (UTC)<br />
<br />
::Break is good. Your conversation is long. Is there a short question you want a comment on? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:43, 11 May 2010 (UTC)<br />
<br />
::: Okay, three questions: (1) is it a good idea to color in a chromaticity diagram all the way out to the spectrum locus? This seems a bit misleading to me, since only the colors in a computer display’s gamut can actually be represented accurately. In particular, a bunch of the colors commonly drawn near the spectrum locus are not remotely similar to actual colors at those chromaticities. (2) what’s a good choice for ''Y'' at each (''x'', ''y'') – currently in PAR’s diagrams and those derived from them, the maximum possible ''Y'' is chosen for each point, within sRGB, but this results in sort of nasty line luminance artifacts which users could easily mistake for a feature of chromaticity. (3) Should diagrams for uses like comparing RGB color spaces use the 1931 (''x'', ''y'') diagram, or the 1976 (''u''′, ''v''′) diagram? The latter is substantially more uniform w/r/t human vision. –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 07:07, 12 May 2010 (UTC)<br />
<br />
::::Depends on what you're trying to show; and depends on how much you respect the idea of sticking close to reliable sources. I would color just the triangle when illustrating an RGB color triangle, and color the whole thing when trying to illustrate the whole thing. Color accuracy is not the issue here. Even adding a light or dotted triangle to show the region in which the colors might be accurate is probably not that useful, and probably novel relative to most sources. The choice of Y is tricky; again, most sources don't show the kind of artifacts that you get by picking maximal Y in an RGB space, so we probably should avoid doing that. And yes I agree that a u'v' space is better for comparing color triangles and such. But it's so conventional to use xy that maybe we should do that, too? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 22:33, 12 May 2010 (UTC)<br />
<br />
::::: Most “reliable” sources are printed, either showing only a very rough schematic of color which is not remotely accurate, or avoiding any coloring whatsoever (just line drawings); it’s pretty impossible to get a very good representation of the whole chromaticity space with four-color printing, so this isn’t surprising. Chromaticity diagrams online are generally pretty inaccurate – the common representations are either a conversion from the printed ones, or based on a “pick max ''Y'' for each (''x'', ''y''), convert to RGB, then clip components to fall in range [0,1]” coloring strategy, which results in the whole top of the diagram having a uniform green color :). –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 17:20, 13 May 2010 (UTC)<br />
<br />
:::: I pretty much agree with DickLyon on every point, except to reiterate that I think accuracy of chromaticity inside the sRGB gamut is important and every effort should be made to find a luminance which minimizes artifacts. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 23:57, 12 May 2010 (UTC)<br />
<br />
== [[functional circle]] ==<br />
<br />
Hello Dicklyon,<br />
I remember you read the german pages of Wikipedia. So I would like to ask you if you could kindly read the following rather short page: [http://de.wikipedia.org/wiki/Funktionskreis Funktionskreis]. Please let me know, if there is a current translation such as “functional circle” for example? By the way there is an article of [[Jakob von Uexküll]] in English too. Many thanks. --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 20:58, 18 May 2010 (UTC)<br />
<br />
:I don't read much German, but it looks like "functional circle" would be an OK translation, as that's what's found in several English-language books on the topic ([http://www.google.com/search?hl=en&safe=off&tbo=p&tbs=bks%3A1&q=functional-circle&aq=f&aqi=&aql=&oq=&gs_rfai= see here]). [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:41, 19 May 2010 (UTC)<br />
<br />
::How can I return your very helpful services? --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 11:39, 19 May 2010 (UTC)<br />
<br />
:Actually, a better English translation than "circle" might be "loop", as in "feedback loop", "control loop", etc. More ideas [http://www.google.com/search?hl=en&safe=off&tbo=p&tbs=bks%3A1&q=Uexkull+loop&aq=f&aqi=&aql=&oq=&gs_rfai= here]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:43, 20 May 2010 (UTC)<br />
::Many many thanks!! --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 08:25, 5 June 2010 (UTC)<br />
::::in a German Medical Dictionary I found “feedback circuit” translation as well. --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 08:37, 5 June 2010 (UTC)<br />
<br />
== Pythag ==<br />
<br />
Hi! Your recent edit was rather coincidental with something I just started working on. I was going to follow up on the wikilink [[root rectangle]] that you provided on the talk page. I was just starting a draft that would keep the diagonal of a square and replace the triangle and pentagon with a discussion that uses root rectangles to find the square roots of 3, 5, etc. How does that sound? --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 04:02, 20 May 2010 (UTC)<br />
<br />
:It seems odd to reference a pseudo-science topic like dynamic rectangles from a mathematics page. Surely there are more mathematical sources, actually talking about the topic of the article, that could be relied on instead. Maybe some of [http://books.google.com/books?lr=&as_brr=0&q=%22square+root+of+3%22+%22pythagorean+theorem%22&btnG=Search+Books these]? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:36, 20 May 2010 (UTC)<br />
<br />
::I looked at the link [http://books.google.com/books?lr=&as_brr=0&q=%22square+root+of+3%22+%22pythagorean+theorem%22&btnG=Search+Books these]. The first two looked like possibilities but google books wouldn't show any of the pages, AFAICT. <br />
<br />
::Re "pseudoscience", I didn't understand that remark at all. In the article [[Dynamic rectangle]] that you previously gave the wikilink for, Figure 10 in the section [[Root_rectangle#Root_rectangles|Root rectangles]] is clearly a simple and sound way to construct lengths that are proportional to the square root of any integer, including square roots of 3, 5, etc. which are irrational. And Figure 10 appears to have a reliable source. If Figure 10 is unclear to you, I'm willing to try to explain it. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 07:41, 20 May 2010 (UTC)<br />
<br />
:::The figure and construction are clear enough, which is why I uploaded a scan to commons to illustrate this topic. But they come out of a topic that's not exactly mathematics; have you read any of Hambidge's stuff? I cleaned up the presentation to be as sensible as possible, but it's still basically just one guy's opinionated rantings. The point is just that for a math article, it would be better to use more rigorous or mathematical sources, rather than one person's unique terminology like "root rectangles" and "dynamic rectangles", which are unknown in math circles (see [http://www.google.com/search?q=%22root%20rectangle%22&oe=utf-8&um=1&ie=UTF-8&tbo=u&tbs=bks:1&source=og&sa=N&hl=en&tab=wp sources]). [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 07:20, 21 May 2010 (UTC)<br />
<br />
:::I reverted your edits there and added a link to the source, so that you can see more clearly that what you took to be letters r were actually square root symbols. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 07:27, 21 May 2010 (UTC)<br />
<br />
::::Thanks for the correction. I added a note to the figure caption to clarify. If you don't like it, I have no problem with you reverting it. <br />
::::Sorry, I wasn't aware that you were the one that uploaded Figure 10 and I also see from the [http://en.wikipedia.org/w/index.php?title=Root_rectangle&limit=500&action=history history] of the original "Root rectangle" article, that you were one of the main contributors, so you apparently know the subject better than I thought. <br />
::::Re "one guy's opinionated rantings" etc - (I presume you mean the author Hambidge.) And from a cursory look at the [http://en.wikipedia.org/wiki/Talk:Root_rectangle discussion] of the original article Root rectangle, which started with Finnell's comment "This stub appears to be utter nonsense", why wasn't it deleted if you and Finnell felt so negatively about it? --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 14:46, 21 May 2010 (UTC)<br />
<br />
:::::Deleting nonsense is often harder, and less productive, than converting it to something less nonsensical. When deleting is easy, it's what I do (I'm pretty much a deletionist). But when a supporter makes deletion impossible, then finding sources and converting nonsense to what little can be said with verifiability is a good way to go. With Brews, I've found steadfast opposition to both approaches. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:07, 21 May 2010 (UTC)<br />
<br />
== [[Wikipedia:Articles for deletion|Articles for deletion]] nomination of [[:Effective pixels]] ==<br />
<br />
<div class="floatleft" style="margin-bottom:0">[[File:Ambox warning pn.svg|42px]]</div>I have nominated [[Effective pixels]], an article that you created, for [[Wikipedia:Deletion policy|deletion]]. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at [[Wikipedia:Articles for deletion/Effective pixels]]. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.{{-}}Please contact me if you're unsure why you received this message. <!-- Template:AFDWarning --> [[User:Everyone Dies In the End|Everyone Dies In the End]] ([[User talk:Everyone Dies In the End|talk]]) 04:26, 29 May 2010 (UTC)<br />
<br />
== Perspectives ==<br />
<br />
Hi. There were some comments that you made that raises some personal issues in my mind, so I felt it may be better to discuss them here. <br />
<br />
Re "As for 'it is only a bad idea if it does not display well,' I find that idea abhorrent." - To call it abhorrent seemed rather extreme to me. "Abhorrent" seems more appropriate for things like genocide, rather than for issues regarding angle brackets. <br />
<br />
Re "Understandability and maintainability of the source is at least as important." - This seems to be completely from the perspective of an editor, rather than the readership, which is by far the greatest group that reads the article, and the vast majority of readers know nothing about what goes on behind the scenes of an article, IMO. Also note that unclear parts on an edit page can be made understandable by hidden comments.<br />
<br />
I think that in discussions on an article talk page, one can get carried away with the drive to win an argument. My comments here are just meant as friendly feedback. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 14:00, 29 May 2010 (UTC)<br />
<br />
:Thanks. I appreciate your friendly feedback. I got a bit too dramatic on that one. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:56, 29 May 2010 (UTC)<br />
<br />
== Angle brackets quiet ==<br />
<br />
Hi. It's been kinda quiet over there. From the lack of response, I'm not sure whether or not I've satisfactorily answered the objections to option 7. Did any part of my responses to you answer any of your objections satisfactorily? If not, I'll probably drop the subject of angle brackets. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 23:55, 30 May 2010 (UTC)<br />
<br />
:My feelings about option 7 haven't changed; I'll just not repeat the words. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 08:21, 31 May 2010 (UTC)<br />
<br />
== Peace and cooperation ==<br />
<br />
Hi Dick: We've had some unfortunate encounters in the recent past, but we also had some good ones in the more distant past. I wonder what the future holds?<br />
<br />
I'd like to extend the hope that we might find a mode of engagement that won't lead to bad tempers and bad actions.<br />
<br />
I have in my mind two activities of mine that seem to cause friction. <br />
<br />
One is my manner of editing. It appears to bother you when I make a large number of edits in quick succession. I have still this tendency, although I believe I have developed the habit of making a descriptive comment with each edit to indicate what it accomplishes. My editing, unlike yours, consists primarily of major additions or reconstructions of articles, and that activity requires big changes. I've found that no matter how long I spend in the editor window trying out different versions, once the thing is posted there is always something else that needs fixing. I would plead with you to indulge me in these difficulties.<br />
<br />
A second is what you call "bloat". I understand this problem as a difference in opinion about the nature of a WP article. You like short treatments of a subject. I like treatments that introduce connected topics and digressions that could lead the reader to a wider picture of a topic and how it fits in with others. I believe that a successful example where we both contributed is the battery of articles on centrifugal force. There were several of these before we became involved, and now there are more. The topic has been introduced nicely in [[Centrifugal force]] which links to [[Absolute rotation]], [[History of centrifugal and centripetal forces]], [[Reactive centrifugal force]] and [[Centrifugal force (rotating reference frame)]]. This topic proved to be rather more complicated than I expected, and there was a great deal of genuine confusion from many participants that was the cause of this proliferation of articles. I find the result satisfactory. Do you? <br />
<br />
The experience I draw from this example is that a great deal of patience is needed in handling these matters: many people have to be heard and heard again, and examples illustrating particular points are needed to make clear what is going on. In most cases we agreed on the points, although you didn't like the proliferation of examples.<br />
<br />
I hope that example is something like what the future holds: discussion and evolution rather than appeals to AN/I and bad tempers.<br />
<br />
What say you, Dick? [[User:Brews ohare|Brews ohare]] ([[User talk:Brews ohare|talk]]) 14:44, 30 June 2010 (UTC)<br />
<br />
:John, it seems you are making some progress in recognizing and discussing the behaviors that annoy me and so many others. A year ago when we were fighting over bloat and such in [[Wavelength]], an admin who blocked me for edit warring suggested that I take such problems to wikiproject physics to get some knowledgeable community input. So I did that, several times, with nearly zero action as a result. I don't think I've filed any AN/I or RfA or other such actions against you, but when you pissed off other editors enough to do that, I reported my view of the problem and argued for what I thought would be mild but effective restraints on your rate of editing of any give page. Even after you were sanctioned, you wasted a lot of people's time with your fight to rewrite the rules, and took your problem editing style to non-physics topics, as I had told them you would. So, while I bear you no ill will, I do not look forward to having you work on articles that I care about. But I'm still trying to take the year off and write a book, so I'll pretty much try to stay out of it and see how it goes. Do I find the centrifugal force result satisfactory? Not really, it's still basically a pile of bloat, mostly written and illustrated by you with nearly zero collaboration, since anyone who pushed back was swamped by you, pretty like your recent work on the [[Pythagorean theorem]], where you took it from a large 40KB to a bloated 93KB in about 700 edits while pretty much fighting off attempts to moderate what you were doing. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 03:50, 1 July 2010 (UTC)<br />
<br />
::A year is a short time to write a book. Good luck with it, it should be a fun enterprise. <br />
<br />
::I see from your remarks no softening of attitude, and instead an entirely negative assessment of all my activities, of which absolutely none are seen as positive for WP. That is saddening. [[User:Brews ohare|Brews ohare]] ([[User talk:Brews ohare|talk]]) 11:45, 1 July 2010 (UTC)<br />
<br />
:::No, that's an overreaction. I've tried to be clear about what behaviors I assess negatively, and it's far short of everything you do. On balance, I'd say that the negative effects like the huge time waste of many other editors and the net bloat is too much to pay for your contributions. I see no reason you can't correct that, by listening to others and collaborating with them. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:49, 2 July 2010 (UTC)<br />
<br />
John Brews, I see you've managed to pick up another indefinite ban, based on beating the same dead horse. Way to go. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:29, 5 August 2010 (UTC)<br />
<br />
== Absurd statement ==<br />
<br />
Hi DickLyon - I saw you remove an "absurd statement" from the [[Black body]] article. I'm sorry to say that I think I was responsible for that statement. I recalculated the rate of visible photon emission from a 1 m^2 black body surface at 300 K and I get about 1 photon every 41 seconds rather than every 1000 years. But this is still negligible. Before I put the correct statement back into the article, I just wanted to make clear that the problem with the person you were answering was that they were talking about photon emission in the infrared, while the 41 second figure is for visible photons only (390-750 nanometers). [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 11:40, 2 July 2010 (UTC)<br />
<br />
:Sorry, I had missed the word "visible" in there, which is why I thought it was absurd. Perhaps it's not so absurd after all, though the concept of "visible photon" is still a bit fuzzy, and the calculation is "original research". Per [[WP:NOR]], it shouldn't really go in without a source, right? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:46, 2 July 2010 (UTC)<br />
<br />
:: Well, I figured a visible photon was any photon with a wavelength between 390 and 750 nm, and yeah, I wondered about OR. Its just integrating the black body intensity divided by h-nu from 390 to 750 nm, then multiply by 2 pi. I numerically integrated it in Mathematica to get the answer, its really straightforward, one line. I think its on the ragged edge of OR. Maybe Mathematica as a reference? [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 02:36, 3 July 2010 (UTC)<br />
<br />
:::It's totally OR, not on the ragged edge. Even at 700 nm, most photons are not "visible", in the sense that the cone opsins have very low quantum efficiency there. There's no wavelength that sensibly separates "visible" from otherwise, is there? Or is there a source for this notion of "visible photons"? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:35, 3 July 2010 (UTC)<br />
<br />
:::: I used the Wikipedia page [[visible light]] which gives the referenced statement: "A typical human eye will respond to wavelengths from about 390 to 750 nm". A "visible photon" is obviously one that is capable of causing a visual response, not one that actually does, so the probability of a cone opsin responding to a photon is not an issue. Is a photon in the middle of the visible spectrum a visible photon? Of course it is, even though the cone opsin response there is not 100 percent either. Anyway, we are getting off the track. Looking at the original edit that I made, the sentence read:<br />
<br />
:::: <blockquote>Although Planck's formula predicts that a black body will radiate energy at all frequencies, the formula is only applicable when many photons are being measured. For example, a black body at room temperature (300 K) with one square meter of surface area will emit a photon in the visible range once every thousand years or so, meaning that for most practical purposes, the black body does not emit in the visible range.</blockquote><br />
<br />
:::: This sentence has been messed with to now read:<br />
<br />
:::: <blockquote>Due to the rapid fall-off of emitted photons with decreasing energy, a black body at room temperature (300 K) with 1 m2 of surface area emits a visible photon every thousand years or so, which is negligible for most purposes.</blockquote><br />
<br />
:::: which is now a sort of non-sequitur stuck in the middle, with no apparent point to it. The concept of "visible light" or, equivalently, "visible photon" is a fairly solid concept, and the wavelength range of 390-750 is a referenced number. All I wanted to do was to make the point that in the visible range, blackbody radiation at 300 K is not worth thinking about. For a reader who wants to know what is meant by "not worth thinking about" a concrete example serves best, and that's why I wrote it. If I use Mathematica to generate a graph of black body intensity, thats not OR. Is a numerical integration of that same equation OR? Because thats all it is. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 05:43, 3 July 2010 (UTC)<br />
<br />
:::::I recommend you take the issue to the article talk page. I'll stay out of it. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:42, 3 July 2010 (UTC)<br />
<br />
:::::: I don't feel that contentious about it, besides, we tend to agree on things more than disagree. If you think it should not be there or have a better idea, then ok. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 14:13, 3 July 2010 (UTC)<br />
<br />
:::::::Photons "in the visible wavelength range" would be more clear and objective, I think, but take it up on the article talk page. I'm going to try to respect my break. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 16:32, 3 July 2010 (UTC)<br />
<br />
== Crop factor ==<br />
<br />
"the field of view of the APS-C will be 1.6x of the original" sounds backwards; it has a smaller field of view, by 1.6x sounds like larger.<br />
<br />
-I'll do a bit of a rewrite on this one.<br />
<br />
" "the crop sensor has much smaller pixels and it will exhibit less contrast and saturation than its full frame counterpart" is pure superstition, since pixel size has no bearing on contrast or saturation. "<br />
<br />
-I don't know where you're getting your information, but bigger pixels resulting greater contrast and saturation has been tested and proven by many practicing pros, including Ken Rockwell.<br />
At the same time, bigger pixels allows for sharper images, better resolution of detail, amongst other things. We don't use full frame for no reason.<br />
<br />
" "One common misconception is that..." is the kind of statement that absolutely requires attribution or a source of some kind. " <br />
<br />
-I'll remove this line altogether, considering that it was on Wiki that someone posted the incorrect information.<br />
<br />
" Your statement about DOF didn't specify enough what's being kept constant, which would be needed to judge whether it might be correct, and it replaced a correct and fairly precisely worded statement. "<br />
<br />
-I hate to say this, but this is the basics in photography, you move closer to the subject, while focusing on them the DOF is brought closer to MFD, while away from infinity, appearing to have more background blur. The opposite will be reaching infinity, where all things "far away" appears to fall on the same flat plan, so when focusing to infinity those "near infinity" all appear to be acceptably sharp. Of course theres also hyperfocal distance, when focusing to this distance all from 1/2 that distance to infinity will be acceptably sharp.<br />
<br />
" "The major disadvantage is the change in perspective, since the focal length has not actually changed. In the case of a 50mm lens, it will be like shooting a 80mm shot with the perspective of 50mm." is uninterpretable within the usual meaning of "perspective". "<br />
<br />
-I don't know if you're a photographer, but this makes perfect sense, I'll rewrite to clarify: The full frame equivalent would be shooting with a 80mm lens' field of view while having a 50mm lens' perspective.<br />
<br />
Please don't claim information to be wrong without provide with some counterarguments, at least 20% of the stuff on the crop factor page is incorrect and in fact the source responsible for a lot of the misconception.<br />
<br />
<small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]] • [[Special:Contributions/Channel 49|contribs]]) 05:33, 9 July 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:I recommend you seek approval for these changes on the article talk page, as I won't be editing much, and might just revert some if they don't make sense. Especially if you think there are errors in the article, the talk page is the place to air that observation. See [http://dicklyon.com/tech/Photography/DepthOfField-Lyon.pdf] for an in-depth explanation of these issues, from my own point of view; other good papers are linked on the [[Depth of field]] article, and we're all in agreement on the facts. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:40, 9 July 2010 (UTC)<br />
<br />
::Well everything I've stated here has indirection relation to DOF but they don't challenge it. The DOF calculations on crop is done through this: [http://www.dofmaster.com/dofjs.html], same lens on FF and crop, same subject distance, crop will has less DOF. I'm no expert on DOF, but I'd think that calculator is correct. Anyways, I don't have time go back and forth to get something approved, I'm just sharing some information on common misconceptions and trying to removed incorrect or not completely correct facts from the page. If it takes me a tremendous amount of time, going through many steps, I'll just not do it altogether, I have better things to be doing such as taking photos. This was a quick write, but since its become complicated, I don't plan on investing that time. [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:11, 9 July 2010 (UTC)<br />
<br />
:::Sharing info on misconceptions is often dangerous or inappropriate, compared to just saying what's true, as misconceptions are seldom documented in [[WP:RS]]. Yes I agree that the DOF Master site gives correct answers, but if you don't specify exactly what conditions you are considering before specifying greater or less DOF, the result can't really be verifiable. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:56, 9 July 2010 (UTC)<br />
<br />
::::Rather, the correct wording would be correcting common misconceptions, a few of which I see on the crop factor page. You cannot judge a crop factor when theres change in perspective, or distance, that doesn't make a lot of sense. The comparison of two camera's DOF is when all other factors are the same, same lens, same aperture, same subject, same distance to subject, etc. What the page currently says is that DOF is greater on the crop camera, which is just an misinterpretation of the "foot zooming" that the photographer used to frame the picture the same way, but now the perspective has changed as well as focus, the DOF area itself, and thus the background will look more blurred.<br />
<br />
::::"On the other hand, compared to the 35 mm-equivalent focal length shooting a similarly-framed shot, the smaller camera's depth of field is greater."<br />
<br />
::::-This statement is equally meaningless, it does not make sense to frame the same shot with a FF and crop considering the perspective in the two are completely different, thus they are not the same picture. [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:11, 9 July 2010 (UTC)<br />
<br />
:::::On the article talk page, you'd have a chance of finding someone who understands your point. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:15, 9 July 2010 (UTC)<br />
<br />
== Perspective ==<br />
"The major disadvantage would be the lack of change in perspective, since the focal length has not actually changed it will be like shooting with the ''field of view'' of a 320mm lens on a full frame sensor while having the perspective of 200mm lens."<br />
<br />
-Theres the keyword I missed.<br />
<br />
Also, what is behind the assertion that "The resulting image will appear to have a less pleasing background blur, unlike using a real 320mm lens on a full frame sensor."?<br />
<br />
-This is in relation to full frame, as in the last sentence. Seems repetitive to add it again, all it means is that the perspective is different due to focal length not being changed. The perspective of a 320mm is appears a lot more "blurred" than a 200mm, simply due to perspective.<br />
<br />
[[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:21, 9 July 2010 (UTC)<br />
<br />
:The phrase "while having the perspective of 200mm lens" makes no sense. Perspective is a function of where you shoot from, and in some interpretations a function of your field of view. It is never a property of a focal length. <br />
<br />
::Again, in reference to full frame, the perspective of where you stand when you shoot with a 200mm lens on full frame.<br />
<br />
:"The perspective of a 320mm is appears a lot more "blurred" than a 200mm, simply due to perspective" also makes no sense. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:35, 9 July 2010 (UTC)<br />
<br />
::This is a lot easier to demonstrate. It could be more detailed, as I have explained on the talk page. Perhaps it could be worded better, but it makes perfect sense if you read that in detail.<br />
<br />
== variations of blue deletion discussion ==<br />
<br />
You might be interested if you didn't see it in the discussion at [[Wikipedia:Articles for deletion/Variations of blue]]. –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 15:26, 24 July 2010 (UTC)<br />
<br />
== Your msg ==<br />
<br />
I think you made a mistake, I never edited any article about catholic prediction. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/98.16.178.59|98.16.178.59]] ([[User talk:98.16.178.59|talk]]) 21:44, 31 July 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
:That was two years, and it was [[cathodic protection]]; someone using the same IP address as you. Don't worry about it. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:46, 31 July 2010 (UTC)<br />
<br />
== Templates ==<br />
<br />
If a template is at TfD it is disruptive to remove it from articles. So please don't. If and when it gets deleted then it can be removed, but removing before consensus is reached is prejudging the outcome. [[User:Fences and windows|<span style="background-color:white; color:red;">Fences</span>]]<span style="background-color:white; color:#808080;">&amp;</span>[[User talk:Fences and windows|<span style="background-color:white; color:black;">Windows</span>]] 00:28, 5 August 2010 (UTC)<br />
<br />
:Interesting theory. I was just going to remove it from the articles, but then thought a TfD would be more appropriate. What's wrong with doing both? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:12, 5 August 2010 (UTC)<br />
::It's the same reasoning as why you shouldn't depopulate a category before you nominate it for deletion. It makes it seem like a foregone conclusion: "Oh, if it's not being used, why should we keep it?" will be a common thought. If a template is removed, taken to TfD, and then not deleted, we'll need to restore its uses. [[User:Fences and windows|<span style="background-color:white; color:red;">Fences</span>]]<span style="background-color:white; color:#808080;">&amp;</span>[[User talk:Fences and windows|<span style="background-color:white; color:black;">Windows</span>]] 21:01, 5 August 2010 (UTC)<br />
:::On the contrary, if it's not deleted, we'll have to remove all its uses and explain each one individually. Unless someone comes up with a reason for this silly template... [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 01:39, 7 August 2010 (UTC)<br />
::::A bot automatically removed templates about to be deleted. You shouldn't worry about that. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:05, 7 August 2010 (UTC)<br />
<br />
==Color template.==<br />
Please join the [[Wikipedia: WikiProject Color]] discussion page about the new idea about the template. Thank you. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:07, 7 August 2010 (UTC)<br />
<br />
::Never mind. I noticed you replied on the template discussion page. Sorry. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:13, 7 August 2010 (UTC)<br />
<br />
==Requesting help with WP:SPS rewording==<br />
I have made the request to consider re wording of [[WP:SPS]] to have a more concise and simple definition. Could you please help with this?[[Wikipedia_talk:Verifiability#Self_Published_Sources_is_worded_in_a_way_which_is_too_broad]]<br />
<br />
Thanks --[[User:Hfarmer|Hfarmer]] ([[User talk:Hfarmer|talk]]) 14:30, 10 August 2010 (UTC)<br />
<br />
:I think that trying to solve that problem by hacking policy will be unlikely to lead to a satisfactory outcome, epsecially if the change is to narrow definitions. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 15:46, 10 August 2010 (UTC)<br />
<br />
== Wikipedia:WikiProject_Golden_ratio ==<br />
<br />
I was just wondering what you think of [[Wikipedia:WikiProject_Golden_ratio]]. You're one of only six members listed there, and the only one currently editing. The founder and next editor in line haven't edited in a while. <span style="color:green">Ten Pound Hammer</span>, his otters and a clue-bat • <sup>([[Special:Contributions/TenPoundHammer|Many otters]] • [[:User talk:TenPoundHammer|One bat]] • [[User:TenPoundHammer|One hammer]])</sup> 03:15, 18 August 2010 (UTC)<br />
<br />
:I didn't even know it existed. Ancient history. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 14:51, 18 August 2010 (UTC)<br />
<br />
== saiful_9999 ==<br />
Could you me , please Sir that why are you considering [[clipping path service]] is a company promotion article? As I know the article is fully designed to provide information about clipping path service in the digital world.<br />
<br />
:Use the linked article-for-deletion discussion page to make your case. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 15:18, 19 August 2010 (UTC)<br />
<br />
==Adding image==<br />
Could you say me please about image adding process in the Wikipedia, Sir? [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 03:39, 25 August 2010 (UTC)<br />
<br />
:Under "toolbox" on the left, use the "upload file" link ([http://en.wikipedia.org/wiki/Wikipedia:Upload here]). Then follow the instructions about how to upload, specify a license, etc. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:00, 25 August 2010 (UTC)<br />
: Thanks [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 04:44, 25 August 2010 (UTC)<br />
<br />
==Clipping path service==<br />
Unfortunately,The article clipping path service has been redirected to [[clipping path]] according to the administrative decision. Well, obviously I have respect and honor to the decision. At this situation, can I edit the [[clipping path]] article by adding content, Sir? Thanks for your consideration. [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 03:51, 27 August 2010 (UTC)<br />
<br />
:Yes, you can add a short section on clipping path service to the clipping path article, as long as what you say is sourced. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:42, 27 August 2010 (UTC)<br />
:Sir, I have added a new section “clipping path service” in the [[clipping path]] article, If any mistaking occurred in the editing, please let me know. Thanks. [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 06:03, 27 August 2010 (UTC)<br />
<br />
== Digital filters ==<br />
<br />
'''Thanks''' I don't think I'll bother fixing the SVG, as I'm pretty ignorant about the language. I've made a few images before, but it takes me awhile and I'm honestly just not invested in them. I appreciate your note, though. —[[User:Koavf|Justin (koavf)]]❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯ 20:32, 30 August 2010 (UTC)<br />
<br />
== Color Blindness ==<br />
<br />
Hello, I am responding to the removal of the EL I added to the color blindness page. I am confident that if you took the time to compare my website as a resource on the topic to the other EL's that you dont object to, you will find that mine is significantly more detailed and informative. I imagine you deal with spammers frequently? I'm not here to spam links to my website, i'm here because I am color blind and I have created a website with a goal to be as informative and useful as possible to others with my condition. Awareness and education on the issue are important to me. I belive my website can extend a persons educational experience should they reach the end of the wiki article with questions, or in search of some solid and comprehensive online tests, and information that goes beyond the science of the condition. For example, living with the condition, associated myths, and much more. In fairness, I believe my website most certainly provides a significantly better educational experience than numerous other external links on this page, So i'd appreciate you undoing your edit, or completing your cleanup task and removing other sites 'with no value'.<br />
[[Special:Contributions/203.144.30.47|203.144.30.47]] ([[User talk:203.144.30.47|talk]]) 01:24, 11 September 2010 (UTC)<br />
<br />
:The appropriate process for you to follow is described at [[Wikipedia:EL#Advertising_and_conflicts_of_interest]]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:06, 11 September 2010 (UTC)<br />
: Thankyou for the link, it seems i am not meant to add my own website. This is dissapointing because my website has a genuine and valuable contribution to the readers of this wiki page, I suppose i'll go find out how to get to that pages 'talk' and hopefully one of you wiki-nazi's will take time out of your busy day to review my contribution and add it. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/203.144.30.47|203.144.30.47]] ([[User talk:203.144.30.47|talk]]) 04:02, 12 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
::Use the "discussion" link at the top of the article. And please also review [[WP:NPA]] and realize that complaining about the rules and the community is not the most likely path to a good outcome. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:08, 12 September 2010 (UTC)<br />
<br />
== Removing Polar Coding from Shannon-Fano coding ==<br />
I thought you were another incompetent in the art of data compression individual but after visiting your profile I understood that I was wrong. You understand that Polar Coding is new technique of entropy coding leading to certain advantage at run-time and purposely deleted this section because you don't want any other name appear near Shannon, Fano and Huffman because it is not yours but someone else. Am I right?<br />
The list of entropy coding in Wikipedia is this:<br />
Shannon–Fano, Shannon–Fano–Elias, Huffman, Adaptive Huffman, Arithmetic, Range, Golomb, Universal (Gamma, Exp-Golomb, Fibonacci, Levenshtein). The last one Levenshtein has less independent publications than Polar Coding. Needless to say many of them are not very effective but mentioned because reader of Wikipedia should decide what to use and Wikipedia informs of what is available. On that reason Polar Coding should be in Wikipedia because it has strong advantages over many but some disadvantage as any other. It falls under category Wiki informs reader decides. <br />
I'm surprised how many people blocking advanced technologies. I can show everybody that you do not make real decision and there are other people that do that. Why don't you remove article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It stays there for a long time, does not explain anything, the algorithm is introduced in WinRK program that is proprietary, disassembling is against end-user agreement. No publications at all, no independent sources. Go ahead and try to remove the article. You will quickly be told not to touch it or your account will be removed. This is how Wiki is functioning. One rule for some and other rule for people without connections. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 06:30, 21 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:No, you're not right. I haven't looked at it enough to "understand that Polar Coding is new technique of entropy coding leading to certain advantage at run-time". And I didn't remove it because I "don't want any other name appear near Shannon, Fano and Huffman because it is not yours but someone else." I removed it because I'm an experienced wikipedia editor who respects [[WP:COI]] and [[WP:V]] and [[WP:RS]] and such. If you have sources that you think satisfy those requirements, tell me here, and I'll put it back, so you won't need to be tempted to do it yourself. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:35, 21 September 2010 (UTC)<br />
<br />
:Also see [[WP:OTHERSTUFFEXISTS]]. It is not my job to police all the other stuff, just what I happen to notice. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:37, 21 September 2010 (UTC)<br />
<br />
::Original concept is published by myself [http://www.ezcodesample.com/prefixer/prefixer_article.html Polar codes], it was found and incorporated by independent researcher into [http://code.google.com/p/lzham/ LZHAM] data compressor. You can't find evidence of usage in production of Levenshtein codes that have similar purpose also Gamma and Fibonacci. Yes, there are theoretical articles but not product that use it. In case of Polar codes there is product. Polar codes are also mentioned by expert in industry Matt Mahoney in his [http://mattmahoney.net/dc/text.html Large Text Compression Benchmark]. The site is long, search for Polar codes and you can find there an explanation. Explanation means recognition of novelty by industry expert. Mahoney do not explain other algorithms because they are known. I note that Polar codes is not an article. It is simple note in Wiki informing readers about one more way of entropy coding. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 06:50, 21 September 2010 (UTC)<br />
<br />
<br />
:I agree with you on [[Levenshtein coding]] and [[Reduced Offset Lempel Ziv]]; neither has any apparent sources to establish notability. So I have proposed deletion of both. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:47, 21 September 2010 (UTC)<br />
<br />
::It looks like you have an itch for removing of everything. There people that are very interested in maintaining ROLZ article. I can't wait to watch how they restore the article and explain you the limits of where rules extends. In the meantime I'm still wondering why those two links from independent people who both are professionals are not enough for my short note to be in Wiki. Do you know that publication in peer reviewed journal decided by one individual.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Dicklyon&diff=386058796User talk:Dicklyon2010-09-21T06:50:53Z<p>C-processor: /* Removing Polar Coding from Shannon-Fano coding */</p>
<hr />
<div>{{wikibreak|Dick|eventually. After nearly four years and 43K+ edits, I think a year off is a good idea.}}<br />
<br />
''Please add new talk topics at the bottom of the page, and sign with <nowiki>~~~~</nowiki>''<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Barnstar.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The Original Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | I'm not sure why you haven't picked up a bevy of these already, but thanks for all your effort, particularly in tracking down good sources with diagrams, etc., on the photography- and color-related articles (not to mention fighting vandalism). Those areas of Wikipedia are much richer for your work. Cheers! —[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 02:05, 27 February 2008 (UTC)<br />
|}<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Barnstar-camera.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The Photographer's Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | To Dicklyon on the occasion of your [[:Image:Ivan Sutherland at CHM.jpg|photograph]] of [[Ivan Sutherland]] and his birthday! What a great gift. -[[User:SusanLesch]] 04:40, 23 May 2008 (UTC)<br />
|}<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Allaroundamazingbarnstar.png]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''All Around Amazing Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | For your hard work in improving and watching over the Ohm's law article [[User:Spinningspark|<font style="background:#FFF090;color:#00C000">'''Sp<font style="background:#FFF0A0;color:#80C000">in<font style="color:#C08000">ni</font></font><font style="color:#C00000">ng</font></font><font style="color:#2820F0">Spark'''</font>]] 00:59, 18 January 2009 (UTC)<br />
|}<br />
<br />
{{The Original Barnstar|For your improvements to the [[Centrifugal force]] articles. Your [[WP:UCS|common sense]] approach of creating a summary-style article at the simplified title, explaining the broad concepts in a way that is [[WP:MTAA|accessible to the general reader]] and linking to the disambiguated articles, has provided Wikipedia's readership with a desperately needed place to explain in simple terms the basic concepts involved in understanding these related phenomena. [[User:Wilhelm meis|Wilhelm_meis]] ([[User talk:Wilhelm meis|talk]]) 14:29, 6 May 2009 (UTC)}}<br />
<br />
----<br />
<br />
== Recreating [[Eugene F. Lally]] article ==<br />
<br />
Can I get a copy of [[Eugene F. Lally]] as it was when you deleted it? I now have a number of secondary sources in hand, which I think will serve to establish notability, and I'd rather not start from scratch. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon|talk]]) 19:25, 24 December 2009 (UTC)<br />
:Sure, done at [[User:Dicklyon/Eugene F. Lally]]. [[User:Stifle|Stifle]] ([[User talk:Stifle|talk]]) 22:44, 24 December 2009 (UTC)<br />
<br />
I may not get to working on this any time soon. If anyone wants copies of articles so they can help, let me know by email. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:50, 28 December 2009 (UTC)<br />
<br />
== December 2009 ==<br />
[[File:Nuvola apps important.svg|25px]] You currently appear to be engaged in an '''[[WP:Edit war|edit war]]'''&#32; according to the reverts you have made on [[:Pan]]. Note that the [[Wikipedia:Three-revert rule|three-revert rule]] prohibits making more than three reversions on a single page within a 24-hour period. Additionally, users who perform several reversions in content disputes may be blocked for edit warring even if they do not technically violate the [[Wikipedia:Three-revert rule|three-revert rule]]. When in dispute with another editor you should first try to [[Wikipedia:Talk page guidelines|discuss controversial changes]] to work towards wording and content that gains a [[Wikipedia:Consensus|consensus]] among editors. Should that prove unsuccessful, you are encouraged to seek [[WP:DR|dispute resolution]], and in some cases it may be appropriate to request [[WP:PP|page protection]]. Please stop the disruption, otherwise '''you may be [[Wikipedia:Blocking policy|blocked]] from editing'''. <!-- Template:uw-3rr --> [[User talk:Ucucha|Ucucha]] 18:30, 26 December 2009 (UTC)<br />
<br />
:I hardly think my edits there can be considered warring or disruptive, but I'll leave it alone for now. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 20:18, 26 December 2009 (UTC)<br />
<br />
== MHP FAQ ==<br />
<br />
Hi - I appreciate your efforts [[Talk:Monty Hall problem/FAQ|here]]. Glkanter seems to think the old version had a "pro-Morgan" POV. I have let him know I'd be happy to work with him to make it more NPOV. Although he rejected this offer outright, I think this is what's happening (by incremental editing - which is how it's actually supposed to work). -- [[user:Rick Block|Rick Block]] <small>([[user talk:Rick Block|talk]])</small> 18:11, 27 December 2009 (UTC)<br />
<br />
== Speed of light - 2 errors mentioned in your edit summary ==<br />
<br />
Hi. I fixed 2 errors (a misplaced semicolon and period) that I think you referred to in your edit summary. I'm curious why you didn't simply fix them yourself instead of reverting the other editor's edit. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:17, 27 December 2009 (UTC)<br />
<br />
:I couldn't see the point of the edit; the simple fix was to revert it. What was left? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:37, 27 December 2009 (UTC)<br />
::One thing I noticed was that the edit used periods and sentences that replaced the use of semicolons and consequent longer sentences. Like the editor, I think the periods and sentences style is better. --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:47, 27 December 2009 (UTC)<br />
<br />
:::I don't deny it. I tend to use too many semicolons, indefensibly. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:51, 27 December 2009 (UTC)<br />
<br />
::::That's so refreshing. I wish more editors had your attitude. Keep up the good work. Best regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:56, 27 December 2009 (UTC)<br />
<br />
::::A sabbatical! Best wishes, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 18:12, 28 December 2009 (UTC)<br />
<br />
== Wikibreak ==<br />
<br />
A whole year? I hope you aren't serious. Regardless, best wishes for a healthy, happy, and fulfilling New Year.—[[User talk:Finell|Finell]] 18:15, 28 December 2009 (UTC)<br />
<br />
<br />
== December 31 2009 ==<br />
Hello, I'm trying to get the wiki for my band "The Secretions" undeleted. The user who deleted it has been banned from the site so I can't appeal to them, your name was listed on the deletion record too. Why exactly was it deleted? Why did you flag it for deletion? Apparently we weren't "well known enough" to warrant a wiki? We have been playing shows all around the US and Mexico for 17 years now. Maybe we aren't on a major label or on MTV but I really don't think that should be a requirement for wikipedia. A lot of our fans worked long and hard on that page and I would like to have it restored, for history's sake as well as a reference for future business contacts. There are a lot of other pages that used to cross-reference it as well. Any tips you could give me on who I need to contact about this would be great. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Mickierat|Mickierat]] ([[User talk:Mickierat|talk]] • [[Special:Contributions/Mickierat|contribs]]) 23:10, 31 December 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:I have no recollection of it. How about a link to the deletion discussion? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 23:49, 31 December 2009 (UTC)<br />
<br />
::See [[Wikipedia:Articles for deletion/The Secretions]]. -- [[user:Rick Block|Rick Block]] <small>([[user talk:Rick Block|talk]])</small> 00:04, 1 January 2010 (UTC)<br />
<br />
:::Right. If there's new evidence of notability that can be cited, per [[WP:BAND]], I'd take it to [[Wikipedia:Deletion review]]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 00:34, 1 January 2010 (UTC)<br />
<br />
== Is this guy a quack? ==<br />
<br />
Hey, Dick,<br />
<br />
I've been reading ''The Return of the Sacred Architecture-: The Golden Ratio and the end of Modernism'' from Herbert Bangs. Specifically, the later chapters, after page 146, in which he starts talking about who has used "Sacred Geometry". He reached similar conclusions to the ones I've got so far: the golden ratio starts to appear ex-professedly with the discovery of the pentagram, then as "mean and extreme ratio" after the Greeks discover that it can also be produced from the square and pentagram, in the Renaissance it stops being used in architecture, not to return until Le Corbusier, who used it explicitly... However, he also attributes the presence of sacred Geometry, from the pyramids to the gothic cathedrals to the "brotherhood of Solomon" (the stone masons), sponsored by the Knights Templar in their later works... I noticed that there are indeed some eerie oddities like it's like it's relationship with the pitagorians (and the gate of Tartarus story), Ishtar, the number of the beast vs. the number of the followers of the lamb (both relate to a golden triangle trigonometrically) and the fact that the Gothic Cathedrals were created by masons, but a single brotherhood connecting all of that since Ancient Egypt, plus the Templars is just too much for me. <br />
<br />
The guy, Bangs, has some good credentials, specially working for Buckminster, a key figure when it comes to geometry+architecture. However, that "bortherhood of Solomon" thing... do you think he's a quack? <br />
<br />
--[[User:20-dude|20-dude]] ([[User talk:20-dude|talk]]) 17:27, 6 January 2010 (UTC)<br />
<br />
== Request for Amendment to Arbitration == <br />
<br />
Hello, Dicklyon. This is to inform you that there is a [[Wikipedia:Arbitration/Requests/Amendment#Request_to_amend_prior_case:_Speed_of_Light|request for amendement]] regarding an arbitration case that you have commented on.[[User:Likebox|Likebox]] ([[User talk:Likebox|talk]]) 05:03, 8<br />
<br />
=="megapixel lens"==<br />
<br />
Hello Dick. Can I perhaps interest you in [[Wikipedia:Reference_desk/Miscellaneous#.22megapixel_lens.22.2C_etc|this iggernant question]] of mine? -- [[User:Hoary|Hoary]] ([[User talk:Hoary|talk]]) 15:45, 15 February 2010 (UTC)<br />
<br />
==Ray Blanchard==<br />
<br />
Challenging a citation count as Not WP:RS? That's DICKLYON:BS. Knock it off. I have replaced the web of science with google scholar. You can do the count yourself, DICK. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/75.0.145.252|75.0.145.252]] ([[User talk:75.0.145.252|talk]]) 06:39, 19 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
:Please review [[WP:NPA]]. Also beware that playing with my name has led to a block in the past; you don't want to go down that route.<br />
<br />
:The right place to discuss this would be on the article's discussion page; I could do the count myself, yes, and that would be [[WP:OR]]; Google scholar is a research tool, not a publisher of facts. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 02:48, 20 March 2010 (UTC)<br />
<br />
== General blur spot ==<br />
<br />
Dick, it looks like you added the definition for a general blur spot as “the diameter of the smallest circle that can contain 90% of the optical energy” to [[Circle of confusion]] on 21 February 2006. Do you happen to know where you got it? It seems to be a concern for another editor ... [[User:JeffConrad|JeffConrad]] ([[User talk:JeffConrad|talk]]) 09:02, 19 April 2010 (UTC)<br />
<br />
:No, I don't recall. I've seen the concept of measuring spot size (or point spread function diameter) by an energy threshold, but I don't really recall where. I was attempting to put a more logical basis on what a diameter would mean, but I didn't base it on a source, so it wouldn't bother me much if it were removed. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 03:14, 20 April 2010 (UTC)<br />
<br />
:The concept appears to go by "encircled energy". Lots of hits in optics books and papers, but not specifically tied to "circle of confusion". Thresholds of 95%, 90%, 84%, 80%, 70%, and 50% are easy to find. E.g. [http://books.google.com/books?id=6mb0C0cFCEYC&pg=PA99&dq=%22encircled+energy%22&as_brr=3&ei=BCjNS_-OC5TglQTwwrGbBw&cd=2#v=onepage&q=%22encircled%20energy%22&f=false this book]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:08, 20 April 2010 (UTC)<br />
<br />
::As I feared, it's not quite as simple as I had hoped. Warren Smith covers the same topic (citing the 84% value), but all that I have handy is his chapter in an old edition of the OSA ''Handbook of Optics'', so the treatment is cursory. A greater issue seems to me that the cited values apply to various conditions of “best focus”, so I'm not sure how to handle a defocused system. I've reviewed Hopkins, Sokseth, and Williams and Becklund, and at least at first glance, have not found much that is helpful. Do I have the right take on this? I'm not sure we need a lengthy treatise, but it's probably reasonable to at least mention that the real world isn't quite as simple as we present it in the article.<br />
<br />
::Given that this seems to be more than just a simple query for a source supporting the statement, perhaps we should move this to the article Talk page. [[User:JeffConrad|JeffConrad]] ([[User talk:JeffConrad|talk]]) 08:03, 20 April 2010 (UTC)<br />
<br />
== Color diagrams ==<br />
<br />
Hi DickLyon, could you comment on the discussion we are having on my talk page at [[User_talk:PAR#colors_in_chromaticity_diagrams]]. Thanks. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 03:03, 11 May 2010 (UTC)<br />
<br />
: I guess I should have put that somewhere other than PAR’s talk page; I just figured since (s)he made a bunch of chromaticity diagrams that have been up for a while, (s)he might have input. How’s your wiki break going, Dick? :-) –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 03:49, 11 May 2010 (UTC)<br />
<br />
::Break is good. Your conversation is long. Is there a short question you want a comment on? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:43, 11 May 2010 (UTC)<br />
<br />
::: Okay, three questions: (1) is it a good idea to color in a chromaticity diagram all the way out to the spectrum locus? This seems a bit misleading to me, since only the colors in a computer display’s gamut can actually be represented accurately. In particular, a bunch of the colors commonly drawn near the spectrum locus are not remotely similar to actual colors at those chromaticities. (2) what’s a good choice for ''Y'' at each (''x'', ''y'') – currently in PAR’s diagrams and those derived from them, the maximum possible ''Y'' is chosen for each point, within sRGB, but this results in sort of nasty line luminance artifacts which users could easily mistake for a feature of chromaticity. (3) Should diagrams for uses like comparing RGB color spaces use the 1931 (''x'', ''y'') diagram, or the 1976 (''u''′, ''v''′) diagram? The latter is substantially more uniform w/r/t human vision. –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 07:07, 12 May 2010 (UTC)<br />
<br />
::::Depends on what you're trying to show; and depends on how much you respect the idea of sticking close to reliable sources. I would color just the triangle when illustrating an RGB color triangle, and color the whole thing when trying to illustrate the whole thing. Color accuracy is not the issue here. Even adding a light or dotted triangle to show the region in which the colors might be accurate is probably not that useful, and probably novel relative to most sources. The choice of Y is tricky; again, most sources don't show the kind of artifacts that you get by picking maximal Y in an RGB space, so we probably should avoid doing that. And yes I agree that a u'v' space is better for comparing color triangles and such. But it's so conventional to use xy that maybe we should do that, too? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 22:33, 12 May 2010 (UTC)<br />
<br />
::::: Most “reliable” sources are printed, either showing only a very rough schematic of color which is not remotely accurate, or avoiding any coloring whatsoever (just line drawings); it’s pretty impossible to get a very good representation of the whole chromaticity space with four-color printing, so this isn’t surprising. Chromaticity diagrams online are generally pretty inaccurate – the common representations are either a conversion from the printed ones, or based on a “pick max ''Y'' for each (''x'', ''y''), convert to RGB, then clip components to fall in range [0,1]” coloring strategy, which results in the whole top of the diagram having a uniform green color :). –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 17:20, 13 May 2010 (UTC)<br />
<br />
:::: I pretty much agree with DickLyon on every point, except to reiterate that I think accuracy of chromaticity inside the sRGB gamut is important and every effort should be made to find a luminance which minimizes artifacts. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 23:57, 12 May 2010 (UTC)<br />
<br />
== [[functional circle]] ==<br />
<br />
Hello Dicklyon,<br />
I remember you read the german pages of Wikipedia. So I would like to ask you if you could kindly read the following rather short page: [http://de.wikipedia.org/wiki/Funktionskreis Funktionskreis]. Please let me know, if there is a current translation such as “functional circle” for example? By the way there is an article of [[Jakob von Uexküll]] in English too. Many thanks. --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 20:58, 18 May 2010 (UTC)<br />
<br />
:I don't read much German, but it looks like "functional circle" would be an OK translation, as that's what's found in several English-language books on the topic ([http://www.google.com/search?hl=en&safe=off&tbo=p&tbs=bks%3A1&q=functional-circle&aq=f&aqi=&aql=&oq=&gs_rfai= see here]). [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:41, 19 May 2010 (UTC)<br />
<br />
::How can I return your very helpful services? --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 11:39, 19 May 2010 (UTC)<br />
<br />
:Actually, a better English translation than "circle" might be "loop", as in "feedback loop", "control loop", etc. More ideas [http://www.google.com/search?hl=en&safe=off&tbo=p&tbs=bks%3A1&q=Uexkull+loop&aq=f&aqi=&aql=&oq=&gs_rfai= here]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:43, 20 May 2010 (UTC)<br />
::Many many thanks!! --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 08:25, 5 June 2010 (UTC)<br />
::::in a German Medical Dictionary I found “feedback circuit” translation as well. --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 08:37, 5 June 2010 (UTC)<br />
<br />
== Pythag ==<br />
<br />
Hi! Your recent edit was rather coincidental with something I just started working on. I was going to follow up on the wikilink [[root rectangle]] that you provided on the talk page. I was just starting a draft that would keep the diagonal of a square and replace the triangle and pentagon with a discussion that uses root rectangles to find the square roots of 3, 5, etc. How does that sound? --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 04:02, 20 May 2010 (UTC)<br />
<br />
:It seems odd to reference a pseudo-science topic like dynamic rectangles from a mathematics page. Surely there are more mathematical sources, actually talking about the topic of the article, that could be relied on instead. Maybe some of [http://books.google.com/books?lr=&as_brr=0&q=%22square+root+of+3%22+%22pythagorean+theorem%22&btnG=Search+Books these]? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:36, 20 May 2010 (UTC)<br />
<br />
::I looked at the link [http://books.google.com/books?lr=&as_brr=0&q=%22square+root+of+3%22+%22pythagorean+theorem%22&btnG=Search+Books these]. The first two looked like possibilities but google books wouldn't show any of the pages, AFAICT. <br />
<br />
::Re "pseudoscience", I didn't understand that remark at all. In the article [[Dynamic rectangle]] that you previously gave the wikilink for, Figure 10 in the section [[Root_rectangle#Root_rectangles|Root rectangles]] is clearly a simple and sound way to construct lengths that are proportional to the square root of any integer, including square roots of 3, 5, etc. which are irrational. And Figure 10 appears to have a reliable source. If Figure 10 is unclear to you, I'm willing to try to explain it. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 07:41, 20 May 2010 (UTC)<br />
<br />
:::The figure and construction are clear enough, which is why I uploaded a scan to commons to illustrate this topic. But they come out of a topic that's not exactly mathematics; have you read any of Hambidge's stuff? I cleaned up the presentation to be as sensible as possible, but it's still basically just one guy's opinionated rantings. The point is just that for a math article, it would be better to use more rigorous or mathematical sources, rather than one person's unique terminology like "root rectangles" and "dynamic rectangles", which are unknown in math circles (see [http://www.google.com/search?q=%22root%20rectangle%22&oe=utf-8&um=1&ie=UTF-8&tbo=u&tbs=bks:1&source=og&sa=N&hl=en&tab=wp sources]). [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 07:20, 21 May 2010 (UTC)<br />
<br />
:::I reverted your edits there and added a link to the source, so that you can see more clearly that what you took to be letters r were actually square root symbols. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 07:27, 21 May 2010 (UTC)<br />
<br />
::::Thanks for the correction. I added a note to the figure caption to clarify. If you don't like it, I have no problem with you reverting it. <br />
::::Sorry, I wasn't aware that you were the one that uploaded Figure 10 and I also see from the [http://en.wikipedia.org/w/index.php?title=Root_rectangle&limit=500&action=history history] of the original "Root rectangle" article, that you were one of the main contributors, so you apparently know the subject better than I thought. <br />
::::Re "one guy's opinionated rantings" etc - (I presume you mean the author Hambidge.) And from a cursory look at the [http://en.wikipedia.org/wiki/Talk:Root_rectangle discussion] of the original article Root rectangle, which started with Finnell's comment "This stub appears to be utter nonsense", why wasn't it deleted if you and Finnell felt so negatively about it? --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 14:46, 21 May 2010 (UTC)<br />
<br />
:::::Deleting nonsense is often harder, and less productive, than converting it to something less nonsensical. When deleting is easy, it's what I do (I'm pretty much a deletionist). But when a supporter makes deletion impossible, then finding sources and converting nonsense to what little can be said with verifiability is a good way to go. With Brews, I've found steadfast opposition to both approaches. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:07, 21 May 2010 (UTC)<br />
<br />
== [[Wikipedia:Articles for deletion|Articles for deletion]] nomination of [[:Effective pixels]] ==<br />
<br />
<div class="floatleft" style="margin-bottom:0">[[File:Ambox warning pn.svg|42px]]</div>I have nominated [[Effective pixels]], an article that you created, for [[Wikipedia:Deletion policy|deletion]]. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at [[Wikipedia:Articles for deletion/Effective pixels]]. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.{{-}}Please contact me if you're unsure why you received this message. <!-- Template:AFDWarning --> [[User:Everyone Dies In the End|Everyone Dies In the End]] ([[User talk:Everyone Dies In the End|talk]]) 04:26, 29 May 2010 (UTC)<br />
<br />
== Perspectives ==<br />
<br />
Hi. There were some comments that you made that raises some personal issues in my mind, so I felt it may be better to discuss them here. <br />
<br />
Re "As for 'it is only a bad idea if it does not display well,' I find that idea abhorrent." - To call it abhorrent seemed rather extreme to me. "Abhorrent" seems more appropriate for things like genocide, rather than for issues regarding angle brackets. <br />
<br />
Re "Understandability and maintainability of the source is at least as important." - This seems to be completely from the perspective of an editor, rather than the readership, which is by far the greatest group that reads the article, and the vast majority of readers know nothing about what goes on behind the scenes of an article, IMO. Also note that unclear parts on an edit page can be made understandable by hidden comments.<br />
<br />
I think that in discussions on an article talk page, one can get carried away with the drive to win an argument. My comments here are just meant as friendly feedback. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 14:00, 29 May 2010 (UTC)<br />
<br />
:Thanks. I appreciate your friendly feedback. I got a bit too dramatic on that one. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:56, 29 May 2010 (UTC)<br />
<br />
== Angle brackets quiet ==<br />
<br />
Hi. It's been kinda quiet over there. From the lack of response, I'm not sure whether or not I've satisfactorily answered the objections to option 7. Did any part of my responses to you answer any of your objections satisfactorily? If not, I'll probably drop the subject of angle brackets. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 23:55, 30 May 2010 (UTC)<br />
<br />
:My feelings about option 7 haven't changed; I'll just not repeat the words. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 08:21, 31 May 2010 (UTC)<br />
<br />
== Peace and cooperation ==<br />
<br />
Hi Dick: We've had some unfortunate encounters in the recent past, but we also had some good ones in the more distant past. I wonder what the future holds?<br />
<br />
I'd like to extend the hope that we might find a mode of engagement that won't lead to bad tempers and bad actions.<br />
<br />
I have in my mind two activities of mine that seem to cause friction. <br />
<br />
One is my manner of editing. It appears to bother you when I make a large number of edits in quick succession. I have still this tendency, although I believe I have developed the habit of making a descriptive comment with each edit to indicate what it accomplishes. My editing, unlike yours, consists primarily of major additions or reconstructions of articles, and that activity requires big changes. I've found that no matter how long I spend in the editor window trying out different versions, once the thing is posted there is always something else that needs fixing. I would plead with you to indulge me in these difficulties.<br />
<br />
A second is what you call "bloat". I understand this problem as a difference in opinion about the nature of a WP article. You like short treatments of a subject. I like treatments that introduce connected topics and digressions that could lead the reader to a wider picture of a topic and how it fits in with others. I believe that a successful example where we both contributed is the battery of articles on centrifugal force. There were several of these before we became involved, and now there are more. The topic has been introduced nicely in [[Centrifugal force]] which links to [[Absolute rotation]], [[History of centrifugal and centripetal forces]], [[Reactive centrifugal force]] and [[Centrifugal force (rotating reference frame)]]. This topic proved to be rather more complicated than I expected, and there was a great deal of genuine confusion from many participants that was the cause of this proliferation of articles. I find the result satisfactory. Do you? <br />
<br />
The experience I draw from this example is that a great deal of patience is needed in handling these matters: many people have to be heard and heard again, and examples illustrating particular points are needed to make clear what is going on. In most cases we agreed on the points, although you didn't like the proliferation of examples.<br />
<br />
I hope that example is something like what the future holds: discussion and evolution rather than appeals to AN/I and bad tempers.<br />
<br />
What say you, Dick? [[User:Brews ohare|Brews ohare]] ([[User talk:Brews ohare|talk]]) 14:44, 30 June 2010 (UTC)<br />
<br />
:John, it seems you are making some progress in recognizing and discussing the behaviors that annoy me and so many others. A year ago when we were fighting over bloat and such in [[Wavelength]], an admin who blocked me for edit warring suggested that I take such problems to wikiproject physics to get some knowledgeable community input. So I did that, several times, with nearly zero action as a result. I don't think I've filed any AN/I or RfA or other such actions against you, but when you pissed off other editors enough to do that, I reported my view of the problem and argued for what I thought would be mild but effective restraints on your rate of editing of any give page. Even after you were sanctioned, you wasted a lot of people's time with your fight to rewrite the rules, and took your problem editing style to non-physics topics, as I had told them you would. So, while I bear you no ill will, I do not look forward to having you work on articles that I care about. But I'm still trying to take the year off and write a book, so I'll pretty much try to stay out of it and see how it goes. Do I find the centrifugal force result satisfactory? Not really, it's still basically a pile of bloat, mostly written and illustrated by you with nearly zero collaboration, since anyone who pushed back was swamped by you, pretty like your recent work on the [[Pythagorean theorem]], where you took it from a large 40KB to a bloated 93KB in about 700 edits while pretty much fighting off attempts to moderate what you were doing. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 03:50, 1 July 2010 (UTC)<br />
<br />
::A year is a short time to write a book. Good luck with it, it should be a fun enterprise. <br />
<br />
::I see from your remarks no softening of attitude, and instead an entirely negative assessment of all my activities, of which absolutely none are seen as positive for WP. That is saddening. [[User:Brews ohare|Brews ohare]] ([[User talk:Brews ohare|talk]]) 11:45, 1 July 2010 (UTC)<br />
<br />
:::No, that's an overreaction. I've tried to be clear about what behaviors I assess negatively, and it's far short of everything you do. On balance, I'd say that the negative effects like the huge time waste of many other editors and the net bloat is too much to pay for your contributions. I see no reason you can't correct that, by listening to others and collaborating with them. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:49, 2 July 2010 (UTC)<br />
<br />
John Brews, I see you've managed to pick up another indefinite ban, based on beating the same dead horse. Way to go. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:29, 5 August 2010 (UTC)<br />
<br />
== Absurd statement ==<br />
<br />
Hi DickLyon - I saw you remove an "absurd statement" from the [[Black body]] article. I'm sorry to say that I think I was responsible for that statement. I recalculated the rate of visible photon emission from a 1 m^2 black body surface at 300 K and I get about 1 photon every 41 seconds rather than every 1000 years. But this is still negligible. Before I put the correct statement back into the article, I just wanted to make clear that the problem with the person you were answering was that they were talking about photon emission in the infrared, while the 41 second figure is for visible photons only (390-750 nanometers). [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 11:40, 2 July 2010 (UTC)<br />
<br />
:Sorry, I had missed the word "visible" in there, which is why I thought it was absurd. Perhaps it's not so absurd after all, though the concept of "visible photon" is still a bit fuzzy, and the calculation is "original research". Per [[WP:NOR]], it shouldn't really go in without a source, right? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:46, 2 July 2010 (UTC)<br />
<br />
:: Well, I figured a visible photon was any photon with a wavelength between 390 and 750 nm, and yeah, I wondered about OR. Its just integrating the black body intensity divided by h-nu from 390 to 750 nm, then multiply by 2 pi. I numerically integrated it in Mathematica to get the answer, its really straightforward, one line. I think its on the ragged edge of OR. Maybe Mathematica as a reference? [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 02:36, 3 July 2010 (UTC)<br />
<br />
:::It's totally OR, not on the ragged edge. Even at 700 nm, most photons are not "visible", in the sense that the cone opsins have very low quantum efficiency there. There's no wavelength that sensibly separates "visible" from otherwise, is there? Or is there a source for this notion of "visible photons"? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:35, 3 July 2010 (UTC)<br />
<br />
:::: I used the Wikipedia page [[visible light]] which gives the referenced statement: "A typical human eye will respond to wavelengths from about 390 to 750 nm". A "visible photon" is obviously one that is capable of causing a visual response, not one that actually does, so the probability of a cone opsin responding to a photon is not an issue. Is a photon in the middle of the visible spectrum a visible photon? Of course it is, even though the cone opsin response there is not 100 percent either. Anyway, we are getting off the track. Looking at the original edit that I made, the sentence read:<br />
<br />
:::: <blockquote>Although Planck's formula predicts that a black body will radiate energy at all frequencies, the formula is only applicable when many photons are being measured. For example, a black body at room temperature (300 K) with one square meter of surface area will emit a photon in the visible range once every thousand years or so, meaning that for most practical purposes, the black body does not emit in the visible range.</blockquote><br />
<br />
:::: This sentence has been messed with to now read:<br />
<br />
:::: <blockquote>Due to the rapid fall-off of emitted photons with decreasing energy, a black body at room temperature (300 K) with 1 m2 of surface area emits a visible photon every thousand years or so, which is negligible for most purposes.</blockquote><br />
<br />
:::: which is now a sort of non-sequitur stuck in the middle, with no apparent point to it. The concept of "visible light" or, equivalently, "visible photon" is a fairly solid concept, and the wavelength range of 390-750 is a referenced number. All I wanted to do was to make the point that in the visible range, blackbody radiation at 300 K is not worth thinking about. For a reader who wants to know what is meant by "not worth thinking about" a concrete example serves best, and that's why I wrote it. If I use Mathematica to generate a graph of black body intensity, thats not OR. Is a numerical integration of that same equation OR? Because thats all it is. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 05:43, 3 July 2010 (UTC)<br />
<br />
:::::I recommend you take the issue to the article talk page. I'll stay out of it. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:42, 3 July 2010 (UTC)<br />
<br />
:::::: I don't feel that contentious about it, besides, we tend to agree on things more than disagree. If you think it should not be there or have a better idea, then ok. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 14:13, 3 July 2010 (UTC)<br />
<br />
:::::::Photons "in the visible wavelength range" would be more clear and objective, I think, but take it up on the article talk page. I'm going to try to respect my break. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 16:32, 3 July 2010 (UTC)<br />
<br />
== Crop factor ==<br />
<br />
"the field of view of the APS-C will be 1.6x of the original" sounds backwards; it has a smaller field of view, by 1.6x sounds like larger.<br />
<br />
-I'll do a bit of a rewrite on this one.<br />
<br />
" "the crop sensor has much smaller pixels and it will exhibit less contrast and saturation than its full frame counterpart" is pure superstition, since pixel size has no bearing on contrast or saturation. "<br />
<br />
-I don't know where you're getting your information, but bigger pixels resulting greater contrast and saturation has been tested and proven by many practicing pros, including Ken Rockwell.<br />
At the same time, bigger pixels allows for sharper images, better resolution of detail, amongst other things. We don't use full frame for no reason.<br />
<br />
" "One common misconception is that..." is the kind of statement that absolutely requires attribution or a source of some kind. " <br />
<br />
-I'll remove this line altogether, considering that it was on Wiki that someone posted the incorrect information.<br />
<br />
" Your statement about DOF didn't specify enough what's being kept constant, which would be needed to judge whether it might be correct, and it replaced a correct and fairly precisely worded statement. "<br />
<br />
-I hate to say this, but this is the basics in photography, you move closer to the subject, while focusing on them the DOF is brought closer to MFD, while away from infinity, appearing to have more background blur. The opposite will be reaching infinity, where all things "far away" appears to fall on the same flat plan, so when focusing to infinity those "near infinity" all appear to be acceptably sharp. Of course theres also hyperfocal distance, when focusing to this distance all from 1/2 that distance to infinity will be acceptably sharp.<br />
<br />
" "The major disadvantage is the change in perspective, since the focal length has not actually changed. In the case of a 50mm lens, it will be like shooting a 80mm shot with the perspective of 50mm." is uninterpretable within the usual meaning of "perspective". "<br />
<br />
-I don't know if you're a photographer, but this makes perfect sense, I'll rewrite to clarify: The full frame equivalent would be shooting with a 80mm lens' field of view while having a 50mm lens' perspective.<br />
<br />
Please don't claim information to be wrong without provide with some counterarguments, at least 20% of the stuff on the crop factor page is incorrect and in fact the source responsible for a lot of the misconception.<br />
<br />
<small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]] • [[Special:Contributions/Channel 49|contribs]]) 05:33, 9 July 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:I recommend you seek approval for these changes on the article talk page, as I won't be editing much, and might just revert some if they don't make sense. Especially if you think there are errors in the article, the talk page is the place to air that observation. See [http://dicklyon.com/tech/Photography/DepthOfField-Lyon.pdf] for an in-depth explanation of these issues, from my own point of view; other good papers are linked on the [[Depth of field]] article, and we're all in agreement on the facts. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:40, 9 July 2010 (UTC)<br />
<br />
::Well everything I've stated here has indirection relation to DOF but they don't challenge it. The DOF calculations on crop is done through this: [http://www.dofmaster.com/dofjs.html], same lens on FF and crop, same subject distance, crop will has less DOF. I'm no expert on DOF, but I'd think that calculator is correct. Anyways, I don't have time go back and forth to get something approved, I'm just sharing some information on common misconceptions and trying to removed incorrect or not completely correct facts from the page. If it takes me a tremendous amount of time, going through many steps, I'll just not do it altogether, I have better things to be doing such as taking photos. This was a quick write, but since its become complicated, I don't plan on investing that time. [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:11, 9 July 2010 (UTC)<br />
<br />
:::Sharing info on misconceptions is often dangerous or inappropriate, compared to just saying what's true, as misconceptions are seldom documented in [[WP:RS]]. Yes I agree that the DOF Master site gives correct answers, but if you don't specify exactly what conditions you are considering before specifying greater or less DOF, the result can't really be verifiable. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:56, 9 July 2010 (UTC)<br />
<br />
::::Rather, the correct wording would be correcting common misconceptions, a few of which I see on the crop factor page. You cannot judge a crop factor when theres change in perspective, or distance, that doesn't make a lot of sense. The comparison of two camera's DOF is when all other factors are the same, same lens, same aperture, same subject, same distance to subject, etc. What the page currently says is that DOF is greater on the crop camera, which is just an misinterpretation of the "foot zooming" that the photographer used to frame the picture the same way, but now the perspective has changed as well as focus, the DOF area itself, and thus the background will look more blurred.<br />
<br />
::::"On the other hand, compared to the 35 mm-equivalent focal length shooting a similarly-framed shot, the smaller camera's depth of field is greater."<br />
<br />
::::-This statement is equally meaningless, it does not make sense to frame the same shot with a FF and crop considering the perspective in the two are completely different, thus they are not the same picture. [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:11, 9 July 2010 (UTC)<br />
<br />
:::::On the article talk page, you'd have a chance of finding someone who understands your point. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:15, 9 July 2010 (UTC)<br />
<br />
== Perspective ==<br />
"The major disadvantage would be the lack of change in perspective, since the focal length has not actually changed it will be like shooting with the ''field of view'' of a 320mm lens on a full frame sensor while having the perspective of 200mm lens."<br />
<br />
-Theres the keyword I missed.<br />
<br />
Also, what is behind the assertion that "The resulting image will appear to have a less pleasing background blur, unlike using a real 320mm lens on a full frame sensor."?<br />
<br />
-This is in relation to full frame, as in the last sentence. Seems repetitive to add it again, all it means is that the perspective is different due to focal length not being changed. The perspective of a 320mm is appears a lot more "blurred" than a 200mm, simply due to perspective.<br />
<br />
[[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:21, 9 July 2010 (UTC)<br />
<br />
:The phrase "while having the perspective of 200mm lens" makes no sense. Perspective is a function of where you shoot from, and in some interpretations a function of your field of view. It is never a property of a focal length. <br />
<br />
::Again, in reference to full frame, the perspective of where you stand when you shoot with a 200mm lens on full frame.<br />
<br />
:"The perspective of a 320mm is appears a lot more "blurred" than a 200mm, simply due to perspective" also makes no sense. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:35, 9 July 2010 (UTC)<br />
<br />
::This is a lot easier to demonstrate. It could be more detailed, as I have explained on the talk page. Perhaps it could be worded better, but it makes perfect sense if you read that in detail.<br />
<br />
== variations of blue deletion discussion ==<br />
<br />
You might be interested if you didn't see it in the discussion at [[Wikipedia:Articles for deletion/Variations of blue]]. –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 15:26, 24 July 2010 (UTC)<br />
<br />
== Your msg ==<br />
<br />
I think you made a mistake, I never edited any article about catholic prediction. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/98.16.178.59|98.16.178.59]] ([[User talk:98.16.178.59|talk]]) 21:44, 31 July 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
:That was two years, and it was [[cathodic protection]]; someone using the same IP address as you. Don't worry about it. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:46, 31 July 2010 (UTC)<br />
<br />
== Templates ==<br />
<br />
If a template is at TfD it is disruptive to remove it from articles. So please don't. If and when it gets deleted then it can be removed, but removing before consensus is reached is prejudging the outcome. [[User:Fences and windows|<span style="background-color:white; color:red;">Fences</span>]]<span style="background-color:white; color:#808080;">&amp;</span>[[User talk:Fences and windows|<span style="background-color:white; color:black;">Windows</span>]] 00:28, 5 August 2010 (UTC)<br />
<br />
:Interesting theory. I was just going to remove it from the articles, but then thought a TfD would be more appropriate. What's wrong with doing both? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:12, 5 August 2010 (UTC)<br />
::It's the same reasoning as why you shouldn't depopulate a category before you nominate it for deletion. It makes it seem like a foregone conclusion: "Oh, if it's not being used, why should we keep it?" will be a common thought. If a template is removed, taken to TfD, and then not deleted, we'll need to restore its uses. [[User:Fences and windows|<span style="background-color:white; color:red;">Fences</span>]]<span style="background-color:white; color:#808080;">&amp;</span>[[User talk:Fences and windows|<span style="background-color:white; color:black;">Windows</span>]] 21:01, 5 August 2010 (UTC)<br />
:::On the contrary, if it's not deleted, we'll have to remove all its uses and explain each one individually. Unless someone comes up with a reason for this silly template... [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 01:39, 7 August 2010 (UTC)<br />
::::A bot automatically removed templates about to be deleted. You shouldn't worry about that. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:05, 7 August 2010 (UTC)<br />
<br />
==Color template.==<br />
Please join the [[Wikipedia: WikiProject Color]] discussion page about the new idea about the template. Thank you. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:07, 7 August 2010 (UTC)<br />
<br />
::Never mind. I noticed you replied on the template discussion page. Sorry. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:13, 7 August 2010 (UTC)<br />
<br />
==Requesting help with WP:SPS rewording==<br />
I have made the request to consider re wording of [[WP:SPS]] to have a more concise and simple definition. Could you please help with this?[[Wikipedia_talk:Verifiability#Self_Published_Sources_is_worded_in_a_way_which_is_too_broad]]<br />
<br />
Thanks --[[User:Hfarmer|Hfarmer]] ([[User talk:Hfarmer|talk]]) 14:30, 10 August 2010 (UTC)<br />
<br />
:I think that trying to solve that problem by hacking policy will be unlikely to lead to a satisfactory outcome, epsecially if the change is to narrow definitions. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 15:46, 10 August 2010 (UTC)<br />
<br />
== Wikipedia:WikiProject_Golden_ratio ==<br />
<br />
I was just wondering what you think of [[Wikipedia:WikiProject_Golden_ratio]]. You're one of only six members listed there, and the only one currently editing. The founder and next editor in line haven't edited in a while. <span style="color:green">Ten Pound Hammer</span>, his otters and a clue-bat • <sup>([[Special:Contributions/TenPoundHammer|Many otters]] • [[:User talk:TenPoundHammer|One bat]] • [[User:TenPoundHammer|One hammer]])</sup> 03:15, 18 August 2010 (UTC)<br />
<br />
:I didn't even know it existed. Ancient history. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 14:51, 18 August 2010 (UTC)<br />
<br />
== saiful_9999 ==<br />
Could you me , please Sir that why are you considering [[clipping path service]] is a company promotion article? As I know the article is fully designed to provide information about clipping path service in the digital world.<br />
<br />
:Use the linked article-for-deletion discussion page to make your case. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 15:18, 19 August 2010 (UTC)<br />
<br />
==Adding image==<br />
Could you say me please about image adding process in the Wikipedia, Sir? [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 03:39, 25 August 2010 (UTC)<br />
<br />
:Under "toolbox" on the left, use the "upload file" link ([http://en.wikipedia.org/wiki/Wikipedia:Upload here]). Then follow the instructions about how to upload, specify a license, etc. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:00, 25 August 2010 (UTC)<br />
: Thanks [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 04:44, 25 August 2010 (UTC)<br />
<br />
==Clipping path service==<br />
Unfortunately,The article clipping path service has been redirected to [[clipping path]] according to the administrative decision. Well, obviously I have respect and honor to the decision. At this situation, can I edit the [[clipping path]] article by adding content, Sir? Thanks for your consideration. [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 03:51, 27 August 2010 (UTC)<br />
<br />
:Yes, you can add a short section on clipping path service to the clipping path article, as long as what you say is sourced. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:42, 27 August 2010 (UTC)<br />
:Sir, I have added a new section “clipping path service” in the [[clipping path]] article, If any mistaking occurred in the editing, please let me know. Thanks. [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 06:03, 27 August 2010 (UTC)<br />
<br />
== Digital filters ==<br />
<br />
'''Thanks''' I don't think I'll bother fixing the SVG, as I'm pretty ignorant about the language. I've made a few images before, but it takes me awhile and I'm honestly just not invested in them. I appreciate your note, though. —[[User:Koavf|Justin (koavf)]]❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯ 20:32, 30 August 2010 (UTC)<br />
<br />
== Color Blindness ==<br />
<br />
Hello, I am responding to the removal of the EL I added to the color blindness page. I am confident that if you took the time to compare my website as a resource on the topic to the other EL's that you dont object to, you will find that mine is significantly more detailed and informative. I imagine you deal with spammers frequently? I'm not here to spam links to my website, i'm here because I am color blind and I have created a website with a goal to be as informative and useful as possible to others with my condition. Awareness and education on the issue are important to me. I belive my website can extend a persons educational experience should they reach the end of the wiki article with questions, or in search of some solid and comprehensive online tests, and information that goes beyond the science of the condition. For example, living with the condition, associated myths, and much more. In fairness, I believe my website most certainly provides a significantly better educational experience than numerous other external links on this page, So i'd appreciate you undoing your edit, or completing your cleanup task and removing other sites 'with no value'.<br />
[[Special:Contributions/203.144.30.47|203.144.30.47]] ([[User talk:203.144.30.47|talk]]) 01:24, 11 September 2010 (UTC)<br />
<br />
:The appropriate process for you to follow is described at [[Wikipedia:EL#Advertising_and_conflicts_of_interest]]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:06, 11 September 2010 (UTC)<br />
: Thankyou for the link, it seems i am not meant to add my own website. This is dissapointing because my website has a genuine and valuable contribution to the readers of this wiki page, I suppose i'll go find out how to get to that pages 'talk' and hopefully one of you wiki-nazi's will take time out of your busy day to review my contribution and add it. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/203.144.30.47|203.144.30.47]] ([[User talk:203.144.30.47|talk]]) 04:02, 12 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
::Use the "discussion" link at the top of the article. And please also review [[WP:NPA]] and realize that complaining about the rules and the community is not the most likely path to a good outcome. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:08, 12 September 2010 (UTC)<br />
<br />
== Removing Polar Coding from Shannon-Fano coding ==<br />
I thought you were another incompetent in the art of data compression individual but after visiting your profile I understood that I was wrong. You understand that Polar Coding is new technique of entropy coding leading to certain advantage at run-time and purposely deleted this section because you don't want any other name appear near Shannon, Fano and Huffman because it is not yours but someone else. Am I right?<br />
The list of entropy coding in Wikipedia is this:<br />
Shannon–Fano, Shannon–Fano–Elias, Huffman, Adaptive Huffman, Arithmetic, Range, Golomb, Universal (Gamma, Exp-Golomb, Fibonacci, Levenshtein). The last one Levenshtein has less independent publications than Polar Coding. Needless to say many of them are not very effective but mentioned because reader of Wikipedia should decide what to use and Wikipedia informs of what is available. On that reason Polar Coding should be in Wikipedia because it has strong advantages over many but some disadvantage as any other. It falls under category Wiki informs reader decides. <br />
I'm surprised how many people blocking advanced technologies. I can show everybody that you do not make real decision and there are other people that do that. Why don't you remove article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It stays there for a long time, does not explain anything, the algorithm is introduced in WinRK program that is proprietary, disassembling is against end-user agreement. No publications at all, no independent sources. Go ahead and try to remove the article. You will quickly be told not to touch it or your account will be removed. This is how Wiki is functioning. One rule for some and other rule for people without connections. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 06:30, 21 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:No, you're not right. I haven't looked at it enough to "understand that Polar Coding is new technique of entropy coding leading to certain advantage at run-time". And I didn't remove it because I "don't want any other name appear near Shannon, Fano and Huffman because it is not yours but someone else." I removed it because I'm an experienced wikipedia editor who respects [[WP:COI]] and [[WP:V]] and [[WP:RS]] and such. If you have sources that you think satisfy those requirements, tell me here, and I'll put it back, so you won't need to be tempted to do it yourself. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:35, 21 September 2010 (UTC)<br />
<br />
:Also see [[WP:OTHERSTUFFEXISTS]]. It is not my job to police all the other stuff, just what I happen to notice. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:37, 21 September 2010 (UTC)<br />
<br />
::Original concept is published by myself [http://www.ezcodesample.com/prefixer/prefixer_article.html Polar codes], it was found and incorporated by independent researcher into [http://code.google.com/p/lzham/ LZHAM] data compressor. You can't find evidence of usage in production of Levenshtein codes that have similar purpose also Gamma and Fibonacci. Yes, there are theoretical articles but not product that use it. In case of Polar codes there is product. Polar codes are also mentioned by expert in industry Matt Mahoney in his [http://mattmahoney.net/dc/text.html Large Text Compression Benchmark]. The site is long, search for Polar codes and you can find there an explanation. Explanation means recognition of novelty by industry expert. Mahoney do not explain other algorithms because they are known. I note that Polar codes is not an article. It is simple note in Wiki informing readers about one more way of entropy coding. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 06:50, 21 September 2010 (UTC)<br />
<br />
<br />
:I agree with you on [[Levenshtein coding]] and [[Reduced Offset Lempel Ziv]]; neither has any apparent sources to establish notability. So I have proposed deletion of both. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:47, 21 September 2010 (UTC)</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Dicklyon&diff=386057053User talk:Dicklyon2010-09-21T06:30:15Z<p>C-processor: </p>
<hr />
<div>{{wikibreak|Dick|eventually. After nearly four years and 43K+ edits, I think a year off is a good idea.}}<br />
<br />
''Please add new talk topics at the bottom of the page, and sign with <nowiki>~~~~</nowiki>''<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Barnstar.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The Original Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | I'm not sure why you haven't picked up a bevy of these already, but thanks for all your effort, particularly in tracking down good sources with diagrams, etc., on the photography- and color-related articles (not to mention fighting vandalism). Those areas of Wikipedia are much richer for your work. Cheers! —[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 02:05, 27 February 2008 (UTC)<br />
|}<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Barnstar-camera.png|100px]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''The Photographer's Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | To Dicklyon on the occasion of your [[:Image:Ivan Sutherland at CHM.jpg|photograph]] of [[Ivan Sutherland]] and his birthday! What a great gift. -[[User:SusanLesch]] 04:40, 23 May 2008 (UTC)<br />
|}<br />
<br />
{| style="border: 1px solid gray; background-color: #fdffe7;"<br />
|rowspan="2" valign="middle" | [[Image:Allaroundamazingbarnstar.png]]<br />
|rowspan="2" |<br />
|style="font-size: x-large; padding: 0; vertical-align: middle; height: 1.1em;" | '''All Around Amazing Barnstar'''<br />
|-<br />
|style="vertical-align: middle; border-top: 1px solid gray;" | For your hard work in improving and watching over the Ohm's law article [[User:Spinningspark|<font style="background:#FFF090;color:#00C000">'''Sp<font style="background:#FFF0A0;color:#80C000">in<font style="color:#C08000">ni</font></font><font style="color:#C00000">ng</font></font><font style="color:#2820F0">Spark'''</font>]] 00:59, 18 January 2009 (UTC)<br />
|}<br />
<br />
{{The Original Barnstar|For your improvements to the [[Centrifugal force]] articles. Your [[WP:UCS|common sense]] approach of creating a summary-style article at the simplified title, explaining the broad concepts in a way that is [[WP:MTAA|accessible to the general reader]] and linking to the disambiguated articles, has provided Wikipedia's readership with a desperately needed place to explain in simple terms the basic concepts involved in understanding these related phenomena. [[User:Wilhelm meis|Wilhelm_meis]] ([[User talk:Wilhelm meis|talk]]) 14:29, 6 May 2009 (UTC)}}<br />
<br />
----<br />
<br />
== Recreating [[Eugene F. Lally]] article ==<br />
<br />
Can I get a copy of [[Eugene F. Lally]] as it was when you deleted it? I now have a number of secondary sources in hand, which I think will serve to establish notability, and I'd rather not start from scratch. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon|talk]]) 19:25, 24 December 2009 (UTC)<br />
:Sure, done at [[User:Dicklyon/Eugene F. Lally]]. [[User:Stifle|Stifle]] ([[User talk:Stifle|talk]]) 22:44, 24 December 2009 (UTC)<br />
<br />
I may not get to working on this any time soon. If anyone wants copies of articles so they can help, let me know by email. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:50, 28 December 2009 (UTC)<br />
<br />
== December 2009 ==<br />
[[File:Nuvola apps important.svg|25px]] You currently appear to be engaged in an '''[[WP:Edit war|edit war]]'''&#32; according to the reverts you have made on [[:Pan]]. Note that the [[Wikipedia:Three-revert rule|three-revert rule]] prohibits making more than three reversions on a single page within a 24-hour period. Additionally, users who perform several reversions in content disputes may be blocked for edit warring even if they do not technically violate the [[Wikipedia:Three-revert rule|three-revert rule]]. When in dispute with another editor you should first try to [[Wikipedia:Talk page guidelines|discuss controversial changes]] to work towards wording and content that gains a [[Wikipedia:Consensus|consensus]] among editors. Should that prove unsuccessful, you are encouraged to seek [[WP:DR|dispute resolution]], and in some cases it may be appropriate to request [[WP:PP|page protection]]. Please stop the disruption, otherwise '''you may be [[Wikipedia:Blocking policy|blocked]] from editing'''. <!-- Template:uw-3rr --> [[User talk:Ucucha|Ucucha]] 18:30, 26 December 2009 (UTC)<br />
<br />
:I hardly think my edits there can be considered warring or disruptive, but I'll leave it alone for now. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 20:18, 26 December 2009 (UTC)<br />
<br />
== MHP FAQ ==<br />
<br />
Hi - I appreciate your efforts [[Talk:Monty Hall problem/FAQ|here]]. Glkanter seems to think the old version had a "pro-Morgan" POV. I have let him know I'd be happy to work with him to make it more NPOV. Although he rejected this offer outright, I think this is what's happening (by incremental editing - which is how it's actually supposed to work). -- [[user:Rick Block|Rick Block]] <small>([[user talk:Rick Block|talk]])</small> 18:11, 27 December 2009 (UTC)<br />
<br />
== Speed of light - 2 errors mentioned in your edit summary ==<br />
<br />
Hi. I fixed 2 errors (a misplaced semicolon and period) that I think you referred to in your edit summary. I'm curious why you didn't simply fix them yourself instead of reverting the other editor's edit. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:17, 27 December 2009 (UTC)<br />
<br />
:I couldn't see the point of the edit; the simple fix was to revert it. What was left? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:37, 27 December 2009 (UTC)<br />
::One thing I noticed was that the edit used periods and sentences that replaced the use of semicolons and consequent longer sentences. Like the editor, I think the periods and sentences style is better. --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:47, 27 December 2009 (UTC)<br />
<br />
:::I don't deny it. I tend to use too many semicolons, indefensibly. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:51, 27 December 2009 (UTC)<br />
<br />
::::That's so refreshing. I wish more editors had your attitude. Keep up the good work. Best regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 21:56, 27 December 2009 (UTC)<br />
<br />
::::A sabbatical! Best wishes, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 18:12, 28 December 2009 (UTC)<br />
<br />
== Wikibreak ==<br />
<br />
A whole year? I hope you aren't serious. Regardless, best wishes for a healthy, happy, and fulfilling New Year.—[[User talk:Finell|Finell]] 18:15, 28 December 2009 (UTC)<br />
<br />
<br />
== December 31 2009 ==<br />
Hello, I'm trying to get the wiki for my band "The Secretions" undeleted. The user who deleted it has been banned from the site so I can't appeal to them, your name was listed on the deletion record too. Why exactly was it deleted? Why did you flag it for deletion? Apparently we weren't "well known enough" to warrant a wiki? We have been playing shows all around the US and Mexico for 17 years now. Maybe we aren't on a major label or on MTV but I really don't think that should be a requirement for wikipedia. A lot of our fans worked long and hard on that page and I would like to have it restored, for history's sake as well as a reference for future business contacts. There are a lot of other pages that used to cross-reference it as well. Any tips you could give me on who I need to contact about this would be great. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Mickierat|Mickierat]] ([[User talk:Mickierat|talk]] • [[Special:Contributions/Mickierat|contribs]]) 23:10, 31 December 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:I have no recollection of it. How about a link to the deletion discussion? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 23:49, 31 December 2009 (UTC)<br />
<br />
::See [[Wikipedia:Articles for deletion/The Secretions]]. -- [[user:Rick Block|Rick Block]] <small>([[user talk:Rick Block|talk]])</small> 00:04, 1 January 2010 (UTC)<br />
<br />
:::Right. If there's new evidence of notability that can be cited, per [[WP:BAND]], I'd take it to [[Wikipedia:Deletion review]]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 00:34, 1 January 2010 (UTC)<br />
<br />
== Is this guy a quack? ==<br />
<br />
Hey, Dick,<br />
<br />
I've been reading ''The Return of the Sacred Architecture-: The Golden Ratio and the end of Modernism'' from Herbert Bangs. Specifically, the later chapters, after page 146, in which he starts talking about who has used "Sacred Geometry". He reached similar conclusions to the ones I've got so far: the golden ratio starts to appear ex-professedly with the discovery of the pentagram, then as "mean and extreme ratio" after the Greeks discover that it can also be produced from the square and pentagram, in the Renaissance it stops being used in architecture, not to return until Le Corbusier, who used it explicitly... However, he also attributes the presence of sacred Geometry, from the pyramids to the gothic cathedrals to the "brotherhood of Solomon" (the stone masons), sponsored by the Knights Templar in their later works... I noticed that there are indeed some eerie oddities like it's like it's relationship with the pitagorians (and the gate of Tartarus story), Ishtar, the number of the beast vs. the number of the followers of the lamb (both relate to a golden triangle trigonometrically) and the fact that the Gothic Cathedrals were created by masons, but a single brotherhood connecting all of that since Ancient Egypt, plus the Templars is just too much for me. <br />
<br />
The guy, Bangs, has some good credentials, specially working for Buckminster, a key figure when it comes to geometry+architecture. However, that "bortherhood of Solomon" thing... do you think he's a quack? <br />
<br />
--[[User:20-dude|20-dude]] ([[User talk:20-dude|talk]]) 17:27, 6 January 2010 (UTC)<br />
<br />
== Request for Amendment to Arbitration == <br />
<br />
Hello, Dicklyon. This is to inform you that there is a [[Wikipedia:Arbitration/Requests/Amendment#Request_to_amend_prior_case:_Speed_of_Light|request for amendement]] regarding an arbitration case that you have commented on.[[User:Likebox|Likebox]] ([[User talk:Likebox|talk]]) 05:03, 8<br />
<br />
=="megapixel lens"==<br />
<br />
Hello Dick. Can I perhaps interest you in [[Wikipedia:Reference_desk/Miscellaneous#.22megapixel_lens.22.2C_etc|this iggernant question]] of mine? -- [[User:Hoary|Hoary]] ([[User talk:Hoary|talk]]) 15:45, 15 February 2010 (UTC)<br />
<br />
==Ray Blanchard==<br />
<br />
Challenging a citation count as Not WP:RS? That's DICKLYON:BS. Knock it off. I have replaced the web of science with google scholar. You can do the count yourself, DICK. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/75.0.145.252|75.0.145.252]] ([[User talk:75.0.145.252|talk]]) 06:39, 19 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
:Please review [[WP:NPA]]. Also beware that playing with my name has led to a block in the past; you don't want to go down that route.<br />
<br />
:The right place to discuss this would be on the article's discussion page; I could do the count myself, yes, and that would be [[WP:OR]]; Google scholar is a research tool, not a publisher of facts. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 02:48, 20 March 2010 (UTC)<br />
<br />
== General blur spot ==<br />
<br />
Dick, it looks like you added the definition for a general blur spot as “the diameter of the smallest circle that can contain 90% of the optical energy” to [[Circle of confusion]] on 21 February 2006. Do you happen to know where you got it? It seems to be a concern for another editor ... [[User:JeffConrad|JeffConrad]] ([[User talk:JeffConrad|talk]]) 09:02, 19 April 2010 (UTC)<br />
<br />
:No, I don't recall. I've seen the concept of measuring spot size (or point spread function diameter) by an energy threshold, but I don't really recall where. I was attempting to put a more logical basis on what a diameter would mean, but I didn't base it on a source, so it wouldn't bother me much if it were removed. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 03:14, 20 April 2010 (UTC)<br />
<br />
:The concept appears to go by "encircled energy". Lots of hits in optics books and papers, but not specifically tied to "circle of confusion". Thresholds of 95%, 90%, 84%, 80%, 70%, and 50% are easy to find. E.g. [http://books.google.com/books?id=6mb0C0cFCEYC&pg=PA99&dq=%22encircled+energy%22&as_brr=3&ei=BCjNS_-OC5TglQTwwrGbBw&cd=2#v=onepage&q=%22encircled%20energy%22&f=false this book]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:08, 20 April 2010 (UTC)<br />
<br />
::As I feared, it's not quite as simple as I had hoped. Warren Smith covers the same topic (citing the 84% value), but all that I have handy is his chapter in an old edition of the OSA ''Handbook of Optics'', so the treatment is cursory. A greater issue seems to me that the cited values apply to various conditions of “best focus”, so I'm not sure how to handle a defocused system. I've reviewed Hopkins, Sokseth, and Williams and Becklund, and at least at first glance, have not found much that is helpful. Do I have the right take on this? I'm not sure we need a lengthy treatise, but it's probably reasonable to at least mention that the real world isn't quite as simple as we present it in the article.<br />
<br />
::Given that this seems to be more than just a simple query for a source supporting the statement, perhaps we should move this to the article Talk page. [[User:JeffConrad|JeffConrad]] ([[User talk:JeffConrad|talk]]) 08:03, 20 April 2010 (UTC)<br />
<br />
== Color diagrams ==<br />
<br />
Hi DickLyon, could you comment on the discussion we are having on my talk page at [[User_talk:PAR#colors_in_chromaticity_diagrams]]. Thanks. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 03:03, 11 May 2010 (UTC)<br />
<br />
: I guess I should have put that somewhere other than PAR’s talk page; I just figured since (s)he made a bunch of chromaticity diagrams that have been up for a while, (s)he might have input. How’s your wiki break going, Dick? :-) –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 03:49, 11 May 2010 (UTC)<br />
<br />
::Break is good. Your conversation is long. Is there a short question you want a comment on? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:43, 11 May 2010 (UTC)<br />
<br />
::: Okay, three questions: (1) is it a good idea to color in a chromaticity diagram all the way out to the spectrum locus? This seems a bit misleading to me, since only the colors in a computer display’s gamut can actually be represented accurately. In particular, a bunch of the colors commonly drawn near the spectrum locus are not remotely similar to actual colors at those chromaticities. (2) what’s a good choice for ''Y'' at each (''x'', ''y'') – currently in PAR’s diagrams and those derived from them, the maximum possible ''Y'' is chosen for each point, within sRGB, but this results in sort of nasty line luminance artifacts which users could easily mistake for a feature of chromaticity. (3) Should diagrams for uses like comparing RGB color spaces use the 1931 (''x'', ''y'') diagram, or the 1976 (''u''′, ''v''′) diagram? The latter is substantially more uniform w/r/t human vision. –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 07:07, 12 May 2010 (UTC)<br />
<br />
::::Depends on what you're trying to show; and depends on how much you respect the idea of sticking close to reliable sources. I would color just the triangle when illustrating an RGB color triangle, and color the whole thing when trying to illustrate the whole thing. Color accuracy is not the issue here. Even adding a light or dotted triangle to show the region in which the colors might be accurate is probably not that useful, and probably novel relative to most sources. The choice of Y is tricky; again, most sources don't show the kind of artifacts that you get by picking maximal Y in an RGB space, so we probably should avoid doing that. And yes I agree that a u'v' space is better for comparing color triangles and such. But it's so conventional to use xy that maybe we should do that, too? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 22:33, 12 May 2010 (UTC)<br />
<br />
::::: Most “reliable” sources are printed, either showing only a very rough schematic of color which is not remotely accurate, or avoiding any coloring whatsoever (just line drawings); it’s pretty impossible to get a very good representation of the whole chromaticity space with four-color printing, so this isn’t surprising. Chromaticity diagrams online are generally pretty inaccurate – the common representations are either a conversion from the printed ones, or based on a “pick max ''Y'' for each (''x'', ''y''), convert to RGB, then clip components to fall in range [0,1]” coloring strategy, which results in the whole top of the diagram having a uniform green color :). –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 17:20, 13 May 2010 (UTC)<br />
<br />
:::: I pretty much agree with DickLyon on every point, except to reiterate that I think accuracy of chromaticity inside the sRGB gamut is important and every effort should be made to find a luminance which minimizes artifacts. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 23:57, 12 May 2010 (UTC)<br />
<br />
== [[functional circle]] ==<br />
<br />
Hello Dicklyon,<br />
I remember you read the german pages of Wikipedia. So I would like to ask you if you could kindly read the following rather short page: [http://de.wikipedia.org/wiki/Funktionskreis Funktionskreis]. Please let me know, if there is a current translation such as “functional circle” for example? By the way there is an article of [[Jakob von Uexküll]] in English too. Many thanks. --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 20:58, 18 May 2010 (UTC)<br />
<br />
:I don't read much German, but it looks like "functional circle" would be an OK translation, as that's what's found in several English-language books on the topic ([http://www.google.com/search?hl=en&safe=off&tbo=p&tbs=bks%3A1&q=functional-circle&aq=f&aqi=&aql=&oq=&gs_rfai= see here]). [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:41, 19 May 2010 (UTC)<br />
<br />
::How can I return your very helpful services? --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 11:39, 19 May 2010 (UTC)<br />
<br />
:Actually, a better English translation than "circle" might be "loop", as in "feedback loop", "control loop", etc. More ideas [http://www.google.com/search?hl=en&safe=off&tbo=p&tbs=bks%3A1&q=Uexkull+loop&aq=f&aqi=&aql=&oq=&gs_rfai= here]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:43, 20 May 2010 (UTC)<br />
::Many many thanks!! --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 08:25, 5 June 2010 (UTC)<br />
::::in a German Medical Dictionary I found “feedback circuit” translation as well. --[[User:Anaxo|Anaxo]] ([[User talk:Anaxo|talk]]) 08:37, 5 June 2010 (UTC)<br />
<br />
== Pythag ==<br />
<br />
Hi! Your recent edit was rather coincidental with something I just started working on. I was going to follow up on the wikilink [[root rectangle]] that you provided on the talk page. I was just starting a draft that would keep the diagonal of a square and replace the triangle and pentagon with a discussion that uses root rectangles to find the square roots of 3, 5, etc. How does that sound? --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 04:02, 20 May 2010 (UTC)<br />
<br />
:It seems odd to reference a pseudo-science topic like dynamic rectangles from a mathematics page. Surely there are more mathematical sources, actually talking about the topic of the article, that could be relied on instead. Maybe some of [http://books.google.com/books?lr=&as_brr=0&q=%22square+root+of+3%22+%22pythagorean+theorem%22&btnG=Search+Books these]? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:36, 20 May 2010 (UTC)<br />
<br />
::I looked at the link [http://books.google.com/books?lr=&as_brr=0&q=%22square+root+of+3%22+%22pythagorean+theorem%22&btnG=Search+Books these]. The first two looked like possibilities but google books wouldn't show any of the pages, AFAICT. <br />
<br />
::Re "pseudoscience", I didn't understand that remark at all. In the article [[Dynamic rectangle]] that you previously gave the wikilink for, Figure 10 in the section [[Root_rectangle#Root_rectangles|Root rectangles]] is clearly a simple and sound way to construct lengths that are proportional to the square root of any integer, including square roots of 3, 5, etc. which are irrational. And Figure 10 appears to have a reliable source. If Figure 10 is unclear to you, I'm willing to try to explain it. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 07:41, 20 May 2010 (UTC)<br />
<br />
:::The figure and construction are clear enough, which is why I uploaded a scan to commons to illustrate this topic. But they come out of a topic that's not exactly mathematics; have you read any of Hambidge's stuff? I cleaned up the presentation to be as sensible as possible, but it's still basically just one guy's opinionated rantings. The point is just that for a math article, it would be better to use more rigorous or mathematical sources, rather than one person's unique terminology like "root rectangles" and "dynamic rectangles", which are unknown in math circles (see [http://www.google.com/search?q=%22root%20rectangle%22&oe=utf-8&um=1&ie=UTF-8&tbo=u&tbs=bks:1&source=og&sa=N&hl=en&tab=wp sources]). [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 07:20, 21 May 2010 (UTC)<br />
<br />
:::I reverted your edits there and added a link to the source, so that you can see more clearly that what you took to be letters r were actually square root symbols. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 07:27, 21 May 2010 (UTC)<br />
<br />
::::Thanks for the correction. I added a note to the figure caption to clarify. If you don't like it, I have no problem with you reverting it. <br />
::::Sorry, I wasn't aware that you were the one that uploaded Figure 10 and I also see from the [http://en.wikipedia.org/w/index.php?title=Root_rectangle&limit=500&action=history history] of the original "Root rectangle" article, that you were one of the main contributors, so you apparently know the subject better than I thought. <br />
::::Re "one guy's opinionated rantings" etc - (I presume you mean the author Hambidge.) And from a cursory look at the [http://en.wikipedia.org/wiki/Talk:Root_rectangle discussion] of the original article Root rectangle, which started with Finnell's comment "This stub appears to be utter nonsense", why wasn't it deleted if you and Finnell felt so negatively about it? --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 14:46, 21 May 2010 (UTC)<br />
<br />
:::::Deleting nonsense is often harder, and less productive, than converting it to something less nonsensical. When deleting is easy, it's what I do (I'm pretty much a deletionist). But when a supporter makes deletion impossible, then finding sources and converting nonsense to what little can be said with verifiability is a good way to go. With Brews, I've found steadfast opposition to both approaches. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:07, 21 May 2010 (UTC)<br />
<br />
== [[Wikipedia:Articles for deletion|Articles for deletion]] nomination of [[:Effective pixels]] ==<br />
<br />
<div class="floatleft" style="margin-bottom:0">[[File:Ambox warning pn.svg|42px]]</div>I have nominated [[Effective pixels]], an article that you created, for [[Wikipedia:Deletion policy|deletion]]. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at [[Wikipedia:Articles for deletion/Effective pixels]]. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.{{-}}Please contact me if you're unsure why you received this message. <!-- Template:AFDWarning --> [[User:Everyone Dies In the End|Everyone Dies In the End]] ([[User talk:Everyone Dies In the End|talk]]) 04:26, 29 May 2010 (UTC)<br />
<br />
== Perspectives ==<br />
<br />
Hi. There were some comments that you made that raises some personal issues in my mind, so I felt it may be better to discuss them here. <br />
<br />
Re "As for 'it is only a bad idea if it does not display well,' I find that idea abhorrent." - To call it abhorrent seemed rather extreme to me. "Abhorrent" seems more appropriate for things like genocide, rather than for issues regarding angle brackets. <br />
<br />
Re "Understandability and maintainability of the source is at least as important." - This seems to be completely from the perspective of an editor, rather than the readership, which is by far the greatest group that reads the article, and the vast majority of readers know nothing about what goes on behind the scenes of an article, IMO. Also note that unclear parts on an edit page can be made understandable by hidden comments.<br />
<br />
I think that in discussions on an article talk page, one can get carried away with the drive to win an argument. My comments here are just meant as friendly feedback. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 14:00, 29 May 2010 (UTC)<br />
<br />
:Thanks. I appreciate your friendly feedback. I got a bit too dramatic on that one. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:56, 29 May 2010 (UTC)<br />
<br />
== Angle brackets quiet ==<br />
<br />
Hi. It's been kinda quiet over there. From the lack of response, I'm not sure whether or not I've satisfactorily answered the objections to option 7. Did any part of my responses to you answer any of your objections satisfactorily? If not, I'll probably drop the subject of angle brackets. Regards, --[[User:Bob K31416|Bob K31416]] ([[User talk:Bob K31416|talk]]) 23:55, 30 May 2010 (UTC)<br />
<br />
:My feelings about option 7 haven't changed; I'll just not repeat the words. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 08:21, 31 May 2010 (UTC)<br />
<br />
== Peace and cooperation ==<br />
<br />
Hi Dick: We've had some unfortunate encounters in the recent past, but we also had some good ones in the more distant past. I wonder what the future holds?<br />
<br />
I'd like to extend the hope that we might find a mode of engagement that won't lead to bad tempers and bad actions.<br />
<br />
I have in my mind two activities of mine that seem to cause friction. <br />
<br />
One is my manner of editing. It appears to bother you when I make a large number of edits in quick succession. I have still this tendency, although I believe I have developed the habit of making a descriptive comment with each edit to indicate what it accomplishes. My editing, unlike yours, consists primarily of major additions or reconstructions of articles, and that activity requires big changes. I've found that no matter how long I spend in the editor window trying out different versions, once the thing is posted there is always something else that needs fixing. I would plead with you to indulge me in these difficulties.<br />
<br />
A second is what you call "bloat". I understand this problem as a difference in opinion about the nature of a WP article. You like short treatments of a subject. I like treatments that introduce connected topics and digressions that could lead the reader to a wider picture of a topic and how it fits in with others. I believe that a successful example where we both contributed is the battery of articles on centrifugal force. There were several of these before we became involved, and now there are more. The topic has been introduced nicely in [[Centrifugal force]] which links to [[Absolute rotation]], [[History of centrifugal and centripetal forces]], [[Reactive centrifugal force]] and [[Centrifugal force (rotating reference frame)]]. This topic proved to be rather more complicated than I expected, and there was a great deal of genuine confusion from many participants that was the cause of this proliferation of articles. I find the result satisfactory. Do you? <br />
<br />
The experience I draw from this example is that a great deal of patience is needed in handling these matters: many people have to be heard and heard again, and examples illustrating particular points are needed to make clear what is going on. In most cases we agreed on the points, although you didn't like the proliferation of examples.<br />
<br />
I hope that example is something like what the future holds: discussion and evolution rather than appeals to AN/I and bad tempers.<br />
<br />
What say you, Dick? [[User:Brews ohare|Brews ohare]] ([[User talk:Brews ohare|talk]]) 14:44, 30 June 2010 (UTC)<br />
<br />
:John, it seems you are making some progress in recognizing and discussing the behaviors that annoy me and so many others. A year ago when we were fighting over bloat and such in [[Wavelength]], an admin who blocked me for edit warring suggested that I take such problems to wikiproject physics to get some knowledgeable community input. So I did that, several times, with nearly zero action as a result. I don't think I've filed any AN/I or RfA or other such actions against you, but when you pissed off other editors enough to do that, I reported my view of the problem and argued for what I thought would be mild but effective restraints on your rate of editing of any give page. Even after you were sanctioned, you wasted a lot of people's time with your fight to rewrite the rules, and took your problem editing style to non-physics topics, as I had told them you would. So, while I bear you no ill will, I do not look forward to having you work on articles that I care about. But I'm still trying to take the year off and write a book, so I'll pretty much try to stay out of it and see how it goes. Do I find the centrifugal force result satisfactory? Not really, it's still basically a pile of bloat, mostly written and illustrated by you with nearly zero collaboration, since anyone who pushed back was swamped by you, pretty like your recent work on the [[Pythagorean theorem]], where you took it from a large 40KB to a bloated 93KB in about 700 edits while pretty much fighting off attempts to moderate what you were doing. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 03:50, 1 July 2010 (UTC)<br />
<br />
::A year is a short time to write a book. Good luck with it, it should be a fun enterprise. <br />
<br />
::I see from your remarks no softening of attitude, and instead an entirely negative assessment of all my activities, of which absolutely none are seen as positive for WP. That is saddening. [[User:Brews ohare|Brews ohare]] ([[User talk:Brews ohare|talk]]) 11:45, 1 July 2010 (UTC)<br />
<br />
:::No, that's an overreaction. I've tried to be clear about what behaviors I assess negatively, and it's far short of everything you do. On balance, I'd say that the negative effects like the huge time waste of many other editors and the net bloat is too much to pay for your contributions. I see no reason you can't correct that, by listening to others and collaborating with them. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:49, 2 July 2010 (UTC)<br />
<br />
John Brews, I see you've managed to pick up another indefinite ban, based on beating the same dead horse. Way to go. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:29, 5 August 2010 (UTC)<br />
<br />
== Absurd statement ==<br />
<br />
Hi DickLyon - I saw you remove an "absurd statement" from the [[Black body]] article. I'm sorry to say that I think I was responsible for that statement. I recalculated the rate of visible photon emission from a 1 m^2 black body surface at 300 K and I get about 1 photon every 41 seconds rather than every 1000 years. But this is still negligible. Before I put the correct statement back into the article, I just wanted to make clear that the problem with the person you were answering was that they were talking about photon emission in the infrared, while the 41 second figure is for visible photons only (390-750 nanometers). [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 11:40, 2 July 2010 (UTC)<br />
<br />
:Sorry, I had missed the word "visible" in there, which is why I thought it was absurd. Perhaps it's not so absurd after all, though the concept of "visible photon" is still a bit fuzzy, and the calculation is "original research". Per [[WP:NOR]], it shouldn't really go in without a source, right? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 18:46, 2 July 2010 (UTC)<br />
<br />
:: Well, I figured a visible photon was any photon with a wavelength between 390 and 750 nm, and yeah, I wondered about OR. Its just integrating the black body intensity divided by h-nu from 390 to 750 nm, then multiply by 2 pi. I numerically integrated it in Mathematica to get the answer, its really straightforward, one line. I think its on the ragged edge of OR. Maybe Mathematica as a reference? [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 02:36, 3 July 2010 (UTC)<br />
<br />
:::It's totally OR, not on the ragged edge. Even at 700 nm, most photons are not "visible", in the sense that the cone opsins have very low quantum efficiency there. There's no wavelength that sensibly separates "visible" from otherwise, is there? Or is there a source for this notion of "visible photons"? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:35, 3 July 2010 (UTC)<br />
<br />
:::: I used the Wikipedia page [[visible light]] which gives the referenced statement: "A typical human eye will respond to wavelengths from about 390 to 750 nm". A "visible photon" is obviously one that is capable of causing a visual response, not one that actually does, so the probability of a cone opsin responding to a photon is not an issue. Is a photon in the middle of the visible spectrum a visible photon? Of course it is, even though the cone opsin response there is not 100 percent either. Anyway, we are getting off the track. Looking at the original edit that I made, the sentence read:<br />
<br />
:::: <blockquote>Although Planck's formula predicts that a black body will radiate energy at all frequencies, the formula is only applicable when many photons are being measured. For example, a black body at room temperature (300 K) with one square meter of surface area will emit a photon in the visible range once every thousand years or so, meaning that for most practical purposes, the black body does not emit in the visible range.</blockquote><br />
<br />
:::: This sentence has been messed with to now read:<br />
<br />
:::: <blockquote>Due to the rapid fall-off of emitted photons with decreasing energy, a black body at room temperature (300 K) with 1 m2 of surface area emits a visible photon every thousand years or so, which is negligible for most purposes.</blockquote><br />
<br />
:::: which is now a sort of non-sequitur stuck in the middle, with no apparent point to it. The concept of "visible light" or, equivalently, "visible photon" is a fairly solid concept, and the wavelength range of 390-750 is a referenced number. All I wanted to do was to make the point that in the visible range, blackbody radiation at 300 K is not worth thinking about. For a reader who wants to know what is meant by "not worth thinking about" a concrete example serves best, and that's why I wrote it. If I use Mathematica to generate a graph of black body intensity, thats not OR. Is a numerical integration of that same equation OR? Because thats all it is. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 05:43, 3 July 2010 (UTC)<br />
<br />
:::::I recommend you take the issue to the article talk page. I'll stay out of it. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:42, 3 July 2010 (UTC)<br />
<br />
:::::: I don't feel that contentious about it, besides, we tend to agree on things more than disagree. If you think it should not be there or have a better idea, then ok. [[User:PAR|PAR]] ([[User talk:PAR|talk]]) 14:13, 3 July 2010 (UTC)<br />
<br />
:::::::Photons "in the visible wavelength range" would be more clear and objective, I think, but take it up on the article talk page. I'm going to try to respect my break. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 16:32, 3 July 2010 (UTC)<br />
<br />
== Crop factor ==<br />
<br />
"the field of view of the APS-C will be 1.6x of the original" sounds backwards; it has a smaller field of view, by 1.6x sounds like larger.<br />
<br />
-I'll do a bit of a rewrite on this one.<br />
<br />
" "the crop sensor has much smaller pixels and it will exhibit less contrast and saturation than its full frame counterpart" is pure superstition, since pixel size has no bearing on contrast or saturation. "<br />
<br />
-I don't know where you're getting your information, but bigger pixels resulting greater contrast and saturation has been tested and proven by many practicing pros, including Ken Rockwell.<br />
At the same time, bigger pixels allows for sharper images, better resolution of detail, amongst other things. We don't use full frame for no reason.<br />
<br />
" "One common misconception is that..." is the kind of statement that absolutely requires attribution or a source of some kind. " <br />
<br />
-I'll remove this line altogether, considering that it was on Wiki that someone posted the incorrect information.<br />
<br />
" Your statement about DOF didn't specify enough what's being kept constant, which would be needed to judge whether it might be correct, and it replaced a correct and fairly precisely worded statement. "<br />
<br />
-I hate to say this, but this is the basics in photography, you move closer to the subject, while focusing on them the DOF is brought closer to MFD, while away from infinity, appearing to have more background blur. The opposite will be reaching infinity, where all things "far away" appears to fall on the same flat plan, so when focusing to infinity those "near infinity" all appear to be acceptably sharp. Of course theres also hyperfocal distance, when focusing to this distance all from 1/2 that distance to infinity will be acceptably sharp.<br />
<br />
" "The major disadvantage is the change in perspective, since the focal length has not actually changed. In the case of a 50mm lens, it will be like shooting a 80mm shot with the perspective of 50mm." is uninterpretable within the usual meaning of "perspective". "<br />
<br />
-I don't know if you're a photographer, but this makes perfect sense, I'll rewrite to clarify: The full frame equivalent would be shooting with a 80mm lens' field of view while having a 50mm lens' perspective.<br />
<br />
Please don't claim information to be wrong without provide with some counterarguments, at least 20% of the stuff on the crop factor page is incorrect and in fact the source responsible for a lot of the misconception.<br />
<br />
<small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]] • [[Special:Contributions/Channel 49|contribs]]) 05:33, 9 July 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
:I recommend you seek approval for these changes on the article talk page, as I won't be editing much, and might just revert some if they don't make sense. Especially if you think there are errors in the article, the talk page is the place to air that observation. See [http://dicklyon.com/tech/Photography/DepthOfField-Lyon.pdf] for an in-depth explanation of these issues, from my own point of view; other good papers are linked on the [[Depth of field]] article, and we're all in agreement on the facts. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:40, 9 July 2010 (UTC)<br />
<br />
::Well everything I've stated here has indirection relation to DOF but they don't challenge it. The DOF calculations on crop is done through this: [http://www.dofmaster.com/dofjs.html], same lens on FF and crop, same subject distance, crop will has less DOF. I'm no expert on DOF, but I'd think that calculator is correct. Anyways, I don't have time go back and forth to get something approved, I'm just sharing some information on common misconceptions and trying to removed incorrect or not completely correct facts from the page. If it takes me a tremendous amount of time, going through many steps, I'll just not do it altogether, I have better things to be doing such as taking photos. This was a quick write, but since its become complicated, I don't plan on investing that time. [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:11, 9 July 2010 (UTC)<br />
<br />
:::Sharing info on misconceptions is often dangerous or inappropriate, compared to just saying what's true, as misconceptions are seldom documented in [[WP:RS]]. Yes I agree that the DOF Master site gives correct answers, but if you don't specify exactly what conditions you are considering before specifying greater or less DOF, the result can't really be verifiable. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 05:56, 9 July 2010 (UTC)<br />
<br />
::::Rather, the correct wording would be correcting common misconceptions, a few of which I see on the crop factor page. You cannot judge a crop factor when theres change in perspective, or distance, that doesn't make a lot of sense. The comparison of two camera's DOF is when all other factors are the same, same lens, same aperture, same subject, same distance to subject, etc. What the page currently says is that DOF is greater on the crop camera, which is just an misinterpretation of the "foot zooming" that the photographer used to frame the picture the same way, but now the perspective has changed as well as focus, the DOF area itself, and thus the background will look more blurred.<br />
<br />
::::"On the other hand, compared to the 35 mm-equivalent focal length shooting a similarly-framed shot, the smaller camera's depth of field is greater."<br />
<br />
::::-This statement is equally meaningless, it does not make sense to frame the same shot with a FF and crop considering the perspective in the two are completely different, thus they are not the same picture. [[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:11, 9 July 2010 (UTC)<br />
<br />
:::::On the article talk page, you'd have a chance of finding someone who understands your point. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 06:15, 9 July 2010 (UTC)<br />
<br />
== Perspective ==<br />
"The major disadvantage would be the lack of change in perspective, since the focal length has not actually changed it will be like shooting with the ''field of view'' of a 320mm lens on a full frame sensor while having the perspective of 200mm lens."<br />
<br />
-Theres the keyword I missed.<br />
<br />
Also, what is behind the assertion that "The resulting image will appear to have a less pleasing background blur, unlike using a real 320mm lens on a full frame sensor."?<br />
<br />
-This is in relation to full frame, as in the last sentence. Seems repetitive to add it again, all it means is that the perspective is different due to focal length not being changed. The perspective of a 320mm is appears a lot more "blurred" than a 200mm, simply due to perspective.<br />
<br />
[[User:Channel 49|Channel 49]] ([[User talk:Channel 49|talk]]) 06:21, 9 July 2010 (UTC)<br />
<br />
:The phrase "while having the perspective of 200mm lens" makes no sense. Perspective is a function of where you shoot from, and in some interpretations a function of your field of view. It is never a property of a focal length. <br />
<br />
::Again, in reference to full frame, the perspective of where you stand when you shoot with a 200mm lens on full frame.<br />
<br />
:"The perspective of a 320mm is appears a lot more "blurred" than a 200mm, simply due to perspective" also makes no sense. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 17:35, 9 July 2010 (UTC)<br />
<br />
::This is a lot easier to demonstrate. It could be more detailed, as I have explained on the talk page. Perhaps it could be worded better, but it makes perfect sense if you read that in detail.<br />
<br />
== variations of blue deletion discussion ==<br />
<br />
You might be interested if you didn't see it in the discussion at [[Wikipedia:Articles for deletion/Variations of blue]]. –[[user:jacobolus|jacobolus]] [[User_talk:jacobolus|(t)]] 15:26, 24 July 2010 (UTC)<br />
<br />
== Your msg ==<br />
<br />
I think you made a mistake, I never edited any article about catholic prediction. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/98.16.178.59|98.16.178.59]] ([[User talk:98.16.178.59|talk]]) 21:44, 31 July 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
:That was two years, and it was [[cathodic protection]]; someone using the same IP address as you. Don't worry about it. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 21:46, 31 July 2010 (UTC)<br />
<br />
== Templates ==<br />
<br />
If a template is at TfD it is disruptive to remove it from articles. So please don't. If and when it gets deleted then it can be removed, but removing before consensus is reached is prejudging the outcome. [[User:Fences and windows|<span style="background-color:white; color:red;">Fences</span>]]<span style="background-color:white; color:#808080;">&amp;</span>[[User talk:Fences and windows|<span style="background-color:white; color:black;">Windows</span>]] 00:28, 5 August 2010 (UTC)<br />
<br />
:Interesting theory. I was just going to remove it from the articles, but then thought a TfD would be more appropriate. What's wrong with doing both? [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:12, 5 August 2010 (UTC)<br />
::It's the same reasoning as why you shouldn't depopulate a category before you nominate it for deletion. It makes it seem like a foregone conclusion: "Oh, if it's not being used, why should we keep it?" will be a common thought. If a template is removed, taken to TfD, and then not deleted, we'll need to restore its uses. [[User:Fences and windows|<span style="background-color:white; color:red;">Fences</span>]]<span style="background-color:white; color:#808080;">&amp;</span>[[User talk:Fences and windows|<span style="background-color:white; color:black;">Windows</span>]] 21:01, 5 August 2010 (UTC)<br />
:::On the contrary, if it's not deleted, we'll have to remove all its uses and explain each one individually. Unless someone comes up with a reason for this silly template... [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 01:39, 7 August 2010 (UTC)<br />
::::A bot automatically removed templates about to be deleted. You shouldn't worry about that. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:05, 7 August 2010 (UTC)<br />
<br />
==Color template.==<br />
Please join the [[Wikipedia: WikiProject Color]] discussion page about the new idea about the template. Thank you. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:07, 7 August 2010 (UTC)<br />
<br />
::Never mind. I noticed you replied on the template discussion page. Sorry. [[User:Jhenderson777|Jhenderson777]] ([[User talk:Jhenderson777|talk]]) 18:13, 7 August 2010 (UTC)<br />
<br />
==Requesting help with WP:SPS rewording==<br />
I have made the request to consider re wording of [[WP:SPS]] to have a more concise and simple definition. Could you please help with this?[[Wikipedia_talk:Verifiability#Self_Published_Sources_is_worded_in_a_way_which_is_too_broad]]<br />
<br />
Thanks --[[User:Hfarmer|Hfarmer]] ([[User talk:Hfarmer|talk]]) 14:30, 10 August 2010 (UTC)<br />
<br />
:I think that trying to solve that problem by hacking policy will be unlikely to lead to a satisfactory outcome, epsecially if the change is to narrow definitions. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 15:46, 10 August 2010 (UTC)<br />
<br />
== Wikipedia:WikiProject_Golden_ratio ==<br />
<br />
I was just wondering what you think of [[Wikipedia:WikiProject_Golden_ratio]]. You're one of only six members listed there, and the only one currently editing. The founder and next editor in line haven't edited in a while. <span style="color:green">Ten Pound Hammer</span>, his otters and a clue-bat • <sup>([[Special:Contributions/TenPoundHammer|Many otters]] • [[:User talk:TenPoundHammer|One bat]] • [[User:TenPoundHammer|One hammer]])</sup> 03:15, 18 August 2010 (UTC)<br />
<br />
:I didn't even know it existed. Ancient history. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 14:51, 18 August 2010 (UTC)<br />
<br />
== saiful_9999 ==<br />
Could you me , please Sir that why are you considering [[clipping path service]] is a company promotion article? As I know the article is fully designed to provide information about clipping path service in the digital world.<br />
<br />
:Use the linked article-for-deletion discussion page to make your case. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 15:18, 19 August 2010 (UTC)<br />
<br />
==Adding image==<br />
Could you say me please about image adding process in the Wikipedia, Sir? [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 03:39, 25 August 2010 (UTC)<br />
<br />
:Under "toolbox" on the left, use the "upload file" link ([http://en.wikipedia.org/wiki/Wikipedia:Upload here]). Then follow the instructions about how to upload, specify a license, etc. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:00, 25 August 2010 (UTC)<br />
: Thanks [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 04:44, 25 August 2010 (UTC)<br />
<br />
==Clipping path service==<br />
Unfortunately,The article clipping path service has been redirected to [[clipping path]] according to the administrative decision. Well, obviously I have respect and honor to the decision. At this situation, can I edit the [[clipping path]] article by adding content, Sir? Thanks for your consideration. [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 03:51, 27 August 2010 (UTC)<br />
<br />
:Yes, you can add a short section on clipping path service to the clipping path article, as long as what you say is sourced. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:42, 27 August 2010 (UTC)<br />
:Sir, I have added a new section “clipping path service” in the [[clipping path]] article, If any mistaking occurred in the editing, please let me know. Thanks. [[User:Saiful 9999|Md Saiful Alam]] ([[User talk:Saiful 9999|talk]]) 06:03, 27 August 2010 (UTC)<br />
<br />
== Digital filters ==<br />
<br />
'''Thanks''' I don't think I'll bother fixing the SVG, as I'm pretty ignorant about the language. I've made a few images before, but it takes me awhile and I'm honestly just not invested in them. I appreciate your note, though. —[[User:Koavf|Justin (koavf)]]❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯ 20:32, 30 August 2010 (UTC)<br />
<br />
== Color Blindness ==<br />
<br />
Hello, I am responding to the removal of the EL I added to the color blindness page. I am confident that if you took the time to compare my website as a resource on the topic to the other EL's that you dont object to, you will find that mine is significantly more detailed and informative. I imagine you deal with spammers frequently? I'm not here to spam links to my website, i'm here because I am color blind and I have created a website with a goal to be as informative and useful as possible to others with my condition. Awareness and education on the issue are important to me. I belive my website can extend a persons educational experience should they reach the end of the wiki article with questions, or in search of some solid and comprehensive online tests, and information that goes beyond the science of the condition. For example, living with the condition, associated myths, and much more. In fairness, I believe my website most certainly provides a significantly better educational experience than numerous other external links on this page, So i'd appreciate you undoing your edit, or completing your cleanup task and removing other sites 'with no value'.<br />
[[Special:Contributions/203.144.30.47|203.144.30.47]] ([[User talk:203.144.30.47|talk]]) 01:24, 11 September 2010 (UTC)<br />
<br />
:The appropriate process for you to follow is described at [[Wikipedia:EL#Advertising_and_conflicts_of_interest]]. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:06, 11 September 2010 (UTC)<br />
: Thankyou for the link, it seems i am not meant to add my own website. This is dissapointing because my website has a genuine and valuable contribution to the readers of this wiki page, I suppose i'll go find out how to get to that pages 'talk' and hopefully one of you wiki-nazi's will take time out of your busy day to review my contribution and add it. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/203.144.30.47|203.144.30.47]] ([[User talk:203.144.30.47|talk]]) 04:02, 12 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
::Use the "discussion" link at the top of the article. And please also review [[WP:NPA]] and realize that complaining about the rules and the community is not the most likely path to a good outcome. [[User:Dicklyon|Dicklyon]] ([[User talk:Dicklyon#top|talk]]) 04:08, 12 September 2010 (UTC)<br />
<br />
== Removing Polar Coding from Shannon-Fano coding ==<br />
I thought you were another incompetent in the art of data compression individual but after visiting your profile I understood that I was wrong. You understand that Polar Coding is new technique of entropy coding leading to certain advantage at run-time and purposely deleted this section because you don't want any other name appear near Shannon, Fano and Huffman because it is not yours but someone else. Am I right?<br />
The list of entropy coding in Wikipedia is this:<br />
Shannon–Fano, Shannon–Fano–Elias, Huffman, Adaptive Huffman, Arithmetic, Range, Golomb, Universal (Gamma, Exp-Golomb, Fibonacci, Levenshtein). The last one Levenshtein has less independent publications than Polar Coding. Needless to say many of them are not very effective but mentioned because reader of Wikipedia should decide what to use and Wikipedia informs of what is available. On that reason Polar Coding should be in Wikipedia because it has strong advantages over many but some disadvantage as any other. It falls under category Wiki informs reader decides. <br />
I'm surprised how many people blocking advanced technologies. I can show everybody that you do not make real decision and there are other people that do that. Why don't you remove article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It stays there for a long time, does not explain anything, the algorithm is introduced in WinRK program that is proprietary, disassembling is against end-user agreement. No publications at all, no independent sources. Go ahead and try to remove the article. You will quickly be told not to touch it or your account will be removed. This is how Wiki is functioning. One rule for some and other rule for people without connections.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Cirt&diff=384924088User talk:Cirt2010-09-15T04:41:06Z<p>C-processor: /* Quick demo of puppet functioning admin */</p>
<hr />
<div>{{User:Cirt/Contributions}} <br />
{{User:MiszaBot/config<br />
|maxarchivesize = 250K<br />
|counter = 12<br />
|minthreadsleft = 5<br />
|algo = old(7d)<br />
|archive = User talk:Cirt/Archive %(counter)d<br />
}}<br />
{{talkheader}}<br />
{{WikiProjectGATasks}} <br />
{| align=lef !important;<br />
|{{cent|float=left|width=100%}}<br />
|{{Signpost-subscription}}<br />
|}<br />
{| align=lef !important;<br />
|[[WP:AFD/T|AFD/T]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-7 days}}|T-7]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-2 days}}|T-2]] • [[WP:AFDO|AFDO]] • [[WP:AIV|AIV]] • [[CAT:RFUB|RFUB]] • [[WP:UAA|UAA]]/[[CAT:UAA|CAT]] • [[WP:RFPP|RFPP]] • [[CAT:PER|PER]] • [[CAT:CSD|CSD]] • [[CAT:AB|AB]] • [[WP:FAR|FAR]] • [[User:Deckiller/FAC urgents|FAC urgents]] • [[WP:TFAR|TFAR]] • [[WP:RSN|RSN]] • [[WP:BLPN|BLPN]] • [[WP:FTN|FTN]] • [http://www.google.com/custom?domains=en.wikipedia.org&sitesearch=en.wikipedia.org Google Search] {{Wikipedia:Bureaucrats' noticeboard/RfA Report}}<br />
|}<br />
__TOC__<br />
<br />
== Other neat portal ideas for longer term ==<br />
<br />
* Longer term ideas to think about from other portals:<br />
#'''Events''' section, like: "On this day" e.g., [[Portal:Biography|Biography]], [[Portal:Religion|Religion]], [[Portal:United States|United States]]; "Selected anniversaries" e.g., [[Portal:War|War]]; "Calendar" at [[Portal:Holidays|Holidays]]. Interesting idea of "Month selected anniversaries", at [[Portal:Oregon|Oregon]]. <br />
#Model intro with some rotating images, after [[Portal:Oregon]], [[Portal:Indiana]], [[Portal:Iceland/Intro]] and [[Portal:Philosophy of science/Intro]]. <br />
#Revamp DYK sections w/ free-use images, model after [[Portal:Criminal justice]] and [[Portal:Oregon]].<br />
#Portal palettes at [[User:RichardF/Palettes/Portals]]. Comparable color schemes can be developed from the various hue lists at [[User:RichardF/Palettes]]. Also see [[Portal:Box-header]].<br />
#If there are a lot of categories, then categories section to 2 columns, like in [[Portal:Indiana]].<br />
#:Also take some time to check out style/formatting at [[Portal:Indiana]] '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Note to self ==<br />
<br />
*[http://toolserver.org/~magnus/makeref.php MakeRef]<br />
*[http://toolserver.org/~dispenser/view/Reflinks Reflinks]<br />
*[http://reftag.appspot.com/ Citation tool for Google Books] <br />
*[http://reftag.appspot.com/doiweb.py Citation tool for DOIs]<br />
*[[Wikipedia:Wikipedia Signpost/2010-09-06/Dispatches|Tools, part 1: References, external links, categories and size]]<br />
<br />
[[Wikipedia:Verifiability#Sources|independent]] [[Wikipedia:Reliable sources|reliable]] [[Wikipedia:No original research#Primary, secondary and tertiary sources|secondary sources]]<br />
<br />
*[[User:Citation bot/use]]<br />
<br />
*{{tl|findsources}}<br />
<br />
;Cite templates<br />
<pre><br />
<ref>{{cite book| last = | first = | authorlink = | coauthors = | title = | publisher = | year = | location = | page = | url = | doi = | id = | isbn = }}</ref><br />
<br />
<ref>{{cite news| last = | first = | coauthors = | title = | work = | language = | publisher = | page = | date = | url = | accessdate = }}</ref><br />
<br />
<ref>{{cite journal|last =| first=| authorlink=| coauthors=|title=|journal=|volume=|issue=|page=|publisher=|location = | date = | url = | doi = | id = | accessdate = }}</ref><br />
<br />
<ref>{{cite web| last = | first = | authorlink = | coauthors = | title = | work = | publisher = | date = | url = | format = | doi = | accessdate = }}</ref><br />
</pre><br />
<br />
;Citation model<br />
[[The Simpsons (season 3)]]<br />
;Body text in-cite<br />
<pre><br />
<ref name="REFNAME">[[#LASTNAME|LASTNAME]], p. PAGENUMBER</ref><br />
</pre><br />
;References section<br />
(reference template from [[WP:CIT]])<br />
<pre><br />
*<cite id=LASTNAME>REFERENCE</cite><br />
</pre><br />
<br />
;Different model<br />
*[[Template:Citation]]<br />
*[[Template:Harvnb]]<br />
*<nowiki>Example: <ref name="REFNAME">{{Harvnb|LAST|YEAR|p=PAGENUMBER}}</ref></nowiki><br />
See models at [[The General in His Labyrinth]] and [[Mario Vargas Llosa]]. <br />
<br />
::[http://en.wikipedia.org/w/index.php?title=User_talk:Jbmurray&oldid=242692603#Citation_formatting_help.3F More info]. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
More at [[Wikipedia:Harvard citation template examples]]. <br />
:And [[Template talk:Harvard citation no brackets]]. <br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Dispatch ==<br />
<br />
Cirt, [http://en.wikipedia.org/wiki/Wikipedia_talk:FCDW#Suggestion_for_a_dispatch Awadewit suggested that] you might be interested in writing a [[WP:SIGNPOST|Signpost]] [[WP:FCDW|Dispatch]] article on Featured portals (the only area of featured content we haven't covered). Sample previous articles are at {{t1|FCDW}}. We've covered:<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-31/Dispatches|Featured content overview]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-17/Dispatches|Peer review]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-02/Dispatches|Did you know]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-12/Dispatches|Featured lists]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-19/Dispatches|Good articles]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-26/Dispatches|Featured sounds]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-09-08/Dispatches 1|Featured topics]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-13/Dispatches|Images]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-08-18/Dispatches|TFA]]<br />
* And Featured articles many times: [[Wikipedia:Wikipedia Signpost/2008-07-21/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-04-07/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-10-13/Dispatches]]<br />
<br />
None of them start out looking like that: if an editor initially just chunks in some text, many others chip in to tweak it up to Signpost standards. For example, someone wrote [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-08/Dispatches&oldid=249522488 this,] which Karanacs, Royalbroil and I turned into [[Wikipedia:Wikipedia Signpost/2008-11-08/Dispatches|this]], so if you just chunk in some text as a start, others can help finish it off. Another example, I put in [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-10/Dispatches&oldid=249800192 this outline,] and Karanacs brought it up to [[Wikipedia:Wikipedia Signpost/2008-11-10/Dispatches|this]]. Other editors have written almost complete and clean Dispatches without much need for other editing. If you're interested, please weigh in and coordinate at [[WT:FCDW]] In case you're interested, you could just begin sandboxing something at [[WP:FCDW/Portals]] and pop over to [[WT:FCDW]] to leave a note when you're ready for others to help out. Regards, [[User:SandyGeorgia|Sandy<font color="green">Georgia</font>]] ([[User talk:SandyGeorgia|Talk]]) 19:26, 17 November 2008 (UTC)<br />
:Will mull this over and most likely draft something up. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 11:54, 18 November 2108 (UTC)<br />
== Razzies progress ==<br />
<br />
*[[15th Golden Raspberry Awards]] through [[29th Golden Raspberry Awards]] = reformatting process done.<br />
**Note: Going to have to go back and model these after the modifications made subsequently to [[29th Golden Raspberry Awards]].<br />
*[[29th Golden Raspberry Awards]] - so far only one expanded with sourcing research. ([[WP:FL]])<br />
*[[Razzie Award for Worst New Star]] = reformatting process done, next to use '''[[Talk:Razzie Award for Worst Picture]]''' as model to reformat other pages in [[:Category:Golden Raspberry Awards by category]] (with subsection breaks by decade)<br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Betamax VOIP ==<br />
<br />
Can someone please explain to me why this page was deleted? It had a ready reference to all the various products available from Betamax. This was not as someone has said marketing because its actually not in Betamax's interest to have this page published...a little basic economics will tell you this. Each of the products competes with the others...in different markets. Its like having a DVD available in 15 different countries. This page told you which countries it was available in so that you could check the prices in each country and then buy it from the cheapest! There was no hint of marketing in the article it was purely informational and very useful too! If listing out all the products a company sells is marketing then I can think of a lot of pages on large Multinational Companies that will also have to be deleted.<br />
<br />
Hope someone will see the light.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:09, 2 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:I would suggest first you register for an account on Wikipedia. Then, you could work on a proposed draft version, within a subpage of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:44, 2 September 2010 (UTC)<br />
<br />
I am not proposing to work on a new draft I am proposing that the old article be reinstated. I have not written the previous article nor am I connected with Betamax in anyway. I am a user who found that article extremely useful and was quite disappointed to find the article deleted and also the reasons for the deletion. I don't have either the technical expertise or the time to learn how to discuss these things on Wikipedia however I don't see that as a reason to stay muted. I apologise if I haven't followed any protocl etc that is required here but I think I've made my point. Can you please review the previously deleted article and view it in the new light as I have suggested and I am sure that you will find that it is a neutral article written purely for the purposes of keeping the public informed and helping them make informed choices.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:49, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:You might find it worthwhile to at the very least attempt to try the recommended suggestion, above. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:43, 6 September 2010 (UTC)<br />
<br />
You are recommending that I open an account! Is this some devious scheme to get more people to sign up? Do you get some kind of commission for that? This discussion is against the spirit that Wikipedia was founded on! All I am asking is that you reconsider your decision...as a neutral party. I think you've been too harsh. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 09:41, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
== Proposed Quidco article ==<br />
<br />
Hi again, I've made some additions to the proposed Quidco article on my Talk page at http://en.wikipedia.org/wiki/User_talk:Stuartcoggins#Proposed_Quidco_article and was wondering if you could take another look? Many thanks, Stuart<br />
<br />
[[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 16:02, 3 September 2010 (UTC)<br />
:Try working on it on a separate page, at [[User:Stuartcoggins/Sandbox]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:30, 3 September 2010 (UTC)<br />
::Thank you, I've now moved the article to http://en.wikipedia.org/wiki/User:Stuartcoggins/Sandbox and developed it a little more. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 11:18, 7 September 2010 (UTC)<br />
:::If the article requires more development, please let me know. Alternatively, if the article that was in place just prior to deletion could be restored, I think that was a well-written and neutral piece, so if that were possible, that would be great. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:06, 7 September 2010 (UTC)<br />
::::Needs to demonstrate significant coverage in reliable secondary sources independent of the subject, per [[WP:NOTE]]. Please also read [[WP:RS]], [[WP:V]], and [[WP:CITE]] and [[WP:CIT]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:54, 7 September 2010 (UTC)<br />
:::::Thank you, I will work on that and get back to you. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:56, 7 September 2010 (UTC)<br />
::::::Okay, sounds good. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:29, 7 September 2010 (UTC)<br />
<br />
== Deletion of [[Lilias Rider Haggard]] article ==<br />
<br />
Hi,<br />
I was just wondering why this article was deleted after I provided a second reference and more biographical details. <br />
<br />
Thank you. <br />
[[Jcspurrell]] <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]] • [[Special:Contributions/Jcspurrell|contribs]]) 16:26, 7 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:Was deleted, after deletion discussion at [[WP:AFD]] process, here [[Wikipedia:Articles for deletion/Lilias Rider Haggard]]. Would be willing to provide a copy, as a subpage within your userspace, if you wish to work on a proposed draft version. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:31, 7 September 2010 (UTC)<br />
<br />
Hi,<br />
<br />
Thank you for your comments. However, I do still do not understand why the article was deleted. In the discussion, I said that I would provide more references and information. I began to do so, but the article was deleted before I had time to finish. If possible, I would like to take you up on your offer of working on a draft version on a subpage within my userspace so that I can continue to add information as and when I have time.<br />
<br />
Many thanks.<br />
<br />
Jcspurrell<br />
[[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 20:54, 13 September 2010 (UTC)<br />
:{{done}}, now at [[User:Jcspurrell/Lilias Rider Haggard]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 20:56, 13 September 2010 (UTC)<br />
<br />
Thank you. [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 21:19, 13 September 2010 (UTC)<br />
:You are most welcome! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:19, 13 September 2010 (UTC)<br />
<br />
== Tiny Ross ==<br />
<br />
I see you deleted this as a hoax? He may not be notable, and I have no idea whether the details in the article were true, but he was certainly a real actor and appeared in three films, most notably ''[[Time Bandits]]''... Was hoax really the right criteria to delete this article? [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:07, 7 September 2010 (UTC)<br />
:Feel free to recreate it, seems it was created in this instance, by a problem user. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:11, 7 September 2010 (UTC)<br />
<br />
::Nah, there's not really enough biographical data available. It's possible that the content was completely made up. The only real reliable source is a book on Monty Python and it only includes him in a cast list, no details. [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:14, 7 September 2010 (UTC)<br />
<br />
== The Military history WikiProject Newsletter : LIV (August 2010) ==<br />
<br />
{{WPMILHIST Newsletter header|LIV|August 2010| }}<br />
{| style="width: 100%;"<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Project news</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Project news|The return of reviewer awards, task force discussions, and more information on the upcoming coordinator election]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Articles</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Articles|A recap of the month's new Featured and A-Class articles, including a new featured sound]]''<br />
<br />
|-<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Members</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Members|Our newest A-class medal recipients and this August's top contestants]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Editorial</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Editorials|In the first of a two-part series, Moonriddengirl discusses the problems caused by copyright violations]]''<br />
<br />
|-<br />
| valign="top" colspan="2" style="padding: 0.5em; text-align: center; font-size: 85%; " |<br />
To change your delivery options for this newsletter please list yourself in the appropriate section [[Wikipedia:WikiProject Military history/News/Options|here]]. To assist with preparing the newsletter, please visit the [[Wikipedia:WikiProject Military history/Coordinators/Strategy think tank/News and editorials division|newsroom]]. [[User:BrownBot|BrownBot]] ([[User talk:BrownBot|talk]]) 23:04, 7 September 2010 (UTC)<br />
|}<br />
<br />
== Housekeeping ==<br />
<br />
Hello - you closed [[Wikipedia:Articles for deletion/Caesar Takeshi|this AfD]] as keep, however the AfD template is still displaying on the [[Takeshi Caesar|article page]]. --[[User:Ponyo|<b><font color="Navy">''Jezebel's''</font></b><font color="Navy">Ponyo</font>]]<sup>[[User_talk:Ponyo|<font color="Navy">''shhh''</font>]]</sup> 18:34, 8 September 2010 (UTC)<br />
:{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
<br />
== Selena FAC ==<br />
<br />
I think I took care of most of the concerns, the article is rather short because she had a short career, and I want to stick to the basics, not add extra information about her tours, etc. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 03:54, 9 September 2010 (UTC)<br />
:Link please? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
[[Wikipedia:Featured article review/Selena/archive1]] [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 18:34, 9 September 2010 (UTC)<br />
: I added citations where I could removed where I couldn't find it in the book, and beefed up the article just a little bit, I don't want to go into overdetail. Thanks [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 23:03, 12 September 2010 (UTC)<br />
: I reworded it to impact and merged the two sentence paragraph. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 14:35, 13 September 2010 (UTC)<br />
::{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:38, 13 September 2010 (UTC)<br />
::: I may need your help, I already broke 3RR on Selena trying to keep it as reliable as possible, protect the page please so the revert war will [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 22:42, 13 September 2010 (UTC)<br />
::::I will request full prot, at [[WP:RFPP]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:43, 13 September 2010 (UTC)<br />
<br />
== Blocking dummy available ==<br />
<br />
Wow, you're following up on some of my old COI tags. At this rate, you'll be the blocking king at the end of the night. Too bad I haven't been too active lately but there are a couple of recent ones from the past week. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:35, 9 September 2010 (UTC)<br />
:Heh, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:37, 9 September 2010 (UTC)<br />
::You're laughing and I'm serious! When I sometimes go on a Recent changes patrol, some of those COI jokers will find a nice little tag on their talkpage. I could make [[Rosey Grier]] look like a toothpick when I go plowing through; hence the blocking dummy would be me. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:50, 9 September 2010 (UTC)<br />
:::[[Rosey Grier]] is a cool dude, per [[Portal:Textile arts/Selected quote/2]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:52, 9 September 2010 (UTC)<br />
::::It's kind of funny but that whole Ram front four had a very humanistic, in touch with their inner spirit side. Now, call them a pansy to their face and you might be missing some teeth. My Dad used to force me to watch his "Lambs". He always swore at [[Roman Gabriel]] whenever they started losing. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 05:01, 9 September 2010 (UTC)<br />
:::::Picking up from where you left on yesterday? I wonder how many users I tagged with COIs in June and July. I'll try to work on September tonight so that you'll have something to do in a month or so. ;_) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 00:59, 10 September 2010 (UTC)<br />
::::::Okay, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:00, 10 September 2010 (UTC)<br />
{{od}}<br />
Now serving number one. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:19, 10 September 2010 (UTC)<br />
:Now serving number two. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:42, 10 September 2010 (UTC)<br />
::When you get to August, let me know. Looks like you're working July now. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:21, 11 September 2010 (UTC)<br />
:::Not sure what you mean by the other above messages. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 11 September 2010 (UTC)<br />
::::Which ones? If you're talking about number one and number two, the first was a COI who became or was a sock of number two that I saw later last night. Another admin blocked them at [[Wikipedia:Sockpuppet investigations/EdwinHarbor]]. Otherwise, you've been clearing up some of COI usernames dating back awhile. I noticed that you did several today as well. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:27, 11 September 2010 (UTC)<br />
:::::Oh, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:27, 11 September 2010 (UTC)<br />
::::::No, thank you. I noted that you went to May, moved to June and did some from July. September's been a little slow but I'm working on it. ;) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:30, 11 September 2010 (UTC)<br />
:::::::Sounds good, -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:32, 11 September 2010 (UTC)<br />
<br />
== Featured Portal review ==<br />
<br />
Hey Cirt. Can you close [[Portal:Business and economics]] [[Wikipedia:Featured portal review/Business and economics|FPR]]? There hasn't been any edits on the article since August 3rd and there's still problems to it. [[User:GamerPro64|GamerPro64]] ([[User talk:GamerPro64|talk]]) 20:55, 9 September 2010 (UTC)<br />
:Left notes for a couple users. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 23:07, 9 September 2010 (UTC)<br />
<br />
== Dammit Cirt ==<br />
<br />
You beat me to all my closes today :( (at least we agreed on them) --[[User:Ron Ritzman|Ron Ritzman]] ([[User talk:Ron Ritzman|talk]]) 00:23, 10 September 2010 (UTC)<br />
:Sorry, and great! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:24, 10 September 2010 (UTC)<br />
<br />
== A Very Merry Unauthorized Children's Scientology Pageant ==<br />
<br />
Hello, I have discovered this article by sheer luck and I have found it very interesting. The idea of this musical is just awesome ! It would be too bad if I did not try to translate it. Now, this play have at least one article in french :) Dosto [[Special:Contributions/86.71.74.243|86.71.74.243]] ([[User talk:86.71.74.243|talk]]) 01:26, 11 September 2010 (UTC)<br />
:Thank you! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== There was no Russia in 1970. ==<br />
<br />
It was called the Russian SFSR-the Russian Soviet Federative Socialist Republic. That's common knowledge. That doesn't need to be cited. Don't dumb down Wikipedia. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/139.84.242.65|139.84.242.65]] ([[User talk:139.84.242.65|talk]]) 02:00, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Please discuss, at [[Talk:Oksana Grigorieva]], thanks. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== OneVietnam Network, previously deleted--can it be put up again? ==<br />
<br />
Hi, a couple of months ago I created a page for OneVietnam Network. It was deleted because there were doubts on its significance and there was a lack of coverage on it. Since then, there has been a lot of new coverage on OneVietnam Network. If I want to create the page again, do I have to go through you (the deleting admin), or is it okay if I save new page again? Thank you very much for your time. [[User:Clockmonster|Clockmonster]] ([[User talk:Clockmonster|talk]]) 03:39, 11 September 2010 (UTC)<br />
:I would suggest first working on it, as a proposed draft version, within a subpage off of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:40, 11 September 2010 (UTC)<br />
<br />
== AfD closure of [[EXtremeDB]] ==<br />
<br />
You are invited to join the discussion at [[Wikipedia:Editor_assistance/Requests#Request_re_EXtremeDB]]. I'm sorry that the discussion there has got rather long. I think the relevant point is that in [[Wikipedia:Articles_for_deletion/EXtremeDB|this AfD]] you may have overlooked the nominator's withdrawal of the nomination. -- [[User:John of Reading|John of Reading]] ([[User talk:John of Reading|talk]]) 16:25, 11 September 2010 (UTC)<br />
:Nod, the user is welcome to come to me, here. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:06, 12 September 2010 (UTC)<br />
<br />
== Old username concerns ==<br />
<br />
Hi Cirt - You seem to be doing a great job of cleaning up (blocking) the old usernames that I have tagged as concerns. I am just wondering if you have any script or any dated category or if you are just going through the overall username category manually. I was going to use AWB to do the same, but if you've already found a good semi-automated way of doing it I'll let you finish (or I'm happy to replicate what you are doing). Let me know. Thanks. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 00:08, 12 September 2010 (UTC)<br />
:Was doing it manually, without a script. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:05, 12 September 2010 (UTC)<br />
::Ok - thanks. Can tell you are busy with it, because you show up as like half of my watchlist edits. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 03:18, 12 September 2010 (UTC)<br />
:::Heh, thanks for the kind words! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 12 September 2010 (UTC)<br />
<br />
== Review request ==<br />
<br />
Hello, Cirt. I'm posting here as I saw you were online while watching recent changes. Coincidentally, (your username popped up blocking for a username) this is regarding a [http://en.wikipedia.org/w/index.php?title=User_talk:Gingerbakercorp&diff=384321318&oldid=384280172 username] block I recently executed. If you have the time, would you check to make sure the block was warranted and executed properly? Feel free to undo my block or alter it as you see fit. Let me know and I'll make any apology to the user that's needed. Thanks [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:21, 12 September 2010 (UTC)<br />
:Responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 12 September 2010 (UTC)<br />
<br />
::Thanks for the quick action. See ya 'round [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:29, 12 September 2010 (UTC)<br />
:::You are most welcome. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:30, 12 September 2010 (UTC)<br />
<br />
== Your [[WP:GA|GA]] nomination of [[Lady Gaga: Queen of Pop]] ==<br />
<br />
The article [[Lady Gaga: Queen of Pop]] you nominated as a [[Wikipedia:Good article nominations|good article]] has been placed on hold [[Image:Symbol wait.svg|20px]]. The article is close to meeting the [[WP:GA?|good article criteria]], but there are some minor changes or clarifications needed to be addressed. If these are fixed within seven days, the article will pass, otherwise it will fail. See [[Talk:Lady Gaga: Queen of Pop]] for things which need to be addressed. [[User:Jezhotwells|Jezhotwells]] ([[User talk:Jezhotwells|talk]]) 10:52, 12 September 2010 (UTC)<br />
:Thanks, responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 18:18, 12 September 2010 (UTC)<br />
<br />
== Request for clarification ==<br />
<br />
A request for clarification [http://en.wikipedia.org/w/index.php?title=Wikipedia:Arbitration/Requests/Clarification&oldid=384453348] has been filed per [http://en.wikipedia.org/wiki/Wikipedia:Arbitration/Requests/Enforcement/Archive66#User:TimidGuy_and_User:Littleolive_oil_and_User:Edith_Sirius_Lee] Although it may not affect you directly, your name has been mentioned or referenced.([[User:Littleolive oil|olive]] ([[User talk:Littleolive oil|talk]]) 20:39, 12 September 2010 (UTC))<br />
<br />
== Deletion of article Polar Tree ==<br />
<br />
You deleted my article Polar Tree. Obviously to me the procedure of deleting of articles in Wikipedia is hypocritical with fake and orchestrated discussion similar to mid centuries inquisition court when executed heretic was provided the right to express his views before the judges who already made decisions. In my case the article described modification of known algorithm in data compression. This is not new research but slight modification of old research leading to certain benefits - that means no original research. I provided two independent links. One link to Google site where software developer incorporated my algorithm to his program and achieved certain benefits. Another link from expert in data compression Matt Mahoney who maintain largest data compression benchmark. On his site Matt reexplained my algorithm to readers confirming by this action the novelty, because all other known algorithms on his site not explained but mentioned. The individual that suggested to remove the article changed his opinion on the opposite and suggested to keep the article. The other two reviewers suggested to ask expert opinion. At this point someone who orchestrated the deleting of the article saw that well orchestrated action failing brought new player [[User:Whpq|Whpq]] who is totally incompetent in the subject and has many 5 lines articles about nothing. When another new vote was obtained you deleted the article. <br />
I can explain why I believe that Wikipedia orchestrated the deletion. My references are real, strong and independent. People found my algorithm without my soliciting. It is much better than publication in the journal because articles are sent by authors to the journals where one of the authors was previously published and sending is backed up by set of phone calls to editor-in-chief. It is arranged. Frequently the author without connection include the co-author with connections for the article to be published. In my case the researcher not just approved but took the algorithm and implemented it into a software. Needless to say that 99% of what is published in technical journals is junk that never implemented by anyone. When discussion went into wrong direction new member [[User:Whpq|Whpq]] appeared out of nowhere. And what is the reason that this individual having no idea about data compression suddenly read my article about data compression checked my references and found them unreliable. Look at what he writes - the data compression is out of his interest. The explanation is simple he was told to look and provide an opinion necessary to have an excuse to delete the article. I can also explain why I believe that decisions are made by some man in the shadow. During discussion I pointed out the other article as classical example of material without notability, references and even explanation. It is article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. Why all these critics that are very far from data compression found my article and did not notice the other article about data compression, that has no references at all and does not even provide an explanation and stay in Wikipedia over 2 years. The answer is simple. Because they were not told to do that. I mentioned in discussion that there is nothing wrong with ROLZ algorithm, but it is not publicly explained so there is notability issue, no references, not at all, nothing because it was proprietary, it was not published. <br />
Since I have my own web site where I can publish everything I decide. I will write an article about process of evaluation the articles in Wikipedia. My conclusion that articles must get back door approval by someone in control through connections otherwise independently on provided references they will be deleted and references will be announced unreliable. As scientist I have one role to deliver the people the explanation how the world is functioning. This is what scientists normally do. I think I have to explain to visitors of my site that publications in Wikipedia are arranged through the back door leading to administration that will help people to make right solution, avoid wasting time and so on. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 04:42, 13 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you register an account, then you could work on a proposed draft version, within a subpage of your userspace page. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== Crumplezone ==<br />
<br />
HEY YOU, WHY ARE YOU DELETING [[Crumplezone]], AND YOU ARE NOT SUPPOSED TO BE DELETED DO YOU UNDERSTAND!!?? [[User:75.142.152.104|75.142.152.104]] ([[User talk:75.142.152.104|talk]]) 04:50, 13 September 2010 (UTC)<br />
:Please read [[WP:AFD]], then [[Wikipedia:Articles for deletion/Crumplezone]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== FAR ping ==<br />
<br />
Hi Cirt - Could you please revisit your comments at the FARs for [[Selena]] and [[Michael Brown Okinawa assault incident]]? Also the one for [[Gliding]] - more specificity is needed regarding the sections you believe should be expanded: what information do you think is missing? Thank you, [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 13:06, 13 September 2010 (UTC)<br />
:{{done}}! Also, [[User:Dana boomer|Dana boomer]], I wanted to thank you for the courteous, polite, and kind way in which you have approached me to inquire about this - it is a rare and most appreciated quality. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:29, 13 September 2010 (UTC)<br />
::Awesome, thanks for the quick response! (And you're welcome!) [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 14:51, 13 September 2010 (UTC)<br />
<br />
== Deletion review for [[Topsite (www)]] ==<br />
<br />
An editor has asked for a [[Wikipedia:Deletion review#Topsite (www)|deletion review]] of [[Topsite (www)]]. Because you closed the deletion discussion for this page, speedily deleted it, or otherwise were interested in the page, you might want to participate in the deletion review. <!-- This originally was from the template {{subst:DRVNote|PAGE_NAME}} ~~~~ -->''[[User:Rich Farmbrough|Rich]]&nbsp;[[User talk:Rich Farmbrough|Farmbrough]]'', 15:04, 13 September 2010 (UTC).<br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:06, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Is there a reason you are now systematically sending perfectly notable subjects to deletion, other than the fact you thought I was rude to you on your talk page? Two films that were released in theaters in another nation are indeed notable.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:01, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:03, 13 September 2010 (UTC)<br />
::They are '''movies'''. They are notable. These articles are also '''just made'''. Give us time to work on the articles before sending everything into the trashbin.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:04, 13 September 2010 (UTC)<br />
:::The use of '''bold''' is not necessary. The articles could have been worked on in userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== Ryulong ==<br />
<br />
I'm terribly sorry to bother you about this, but Ryulong is concerned that you're AfDing articles that he created as a gesture of retaliation for his poor word choice on your usertalk; he's also quite distressed that this is happening when he's stuck on poor-grade WiFi and therefore can't really participate in the AfDs.<br />
<br />
Could you do something to assuage these concerns? Thank you. [[User:DragonflySixtyseven|DS]] ([[User talk:DragonflySixtyseven|talk]]) 21:03, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== AN discussion regarding username blocks ==<br />
<br />
Please see [http://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard#Nipples_-_I_have_two.2C_how_about_you.3F here]. Thanks. [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 21:08, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Perhaps a mass nomination is in order?<br />
* [[Kamen Rider Knight]]<br />
* [[Kamen Rider Ryuki (character)|Kamen Rider Ryuki]]<br />
* [[Kamen Rider Scissors]]<br />
* [[Kamen Rider Zolda]]<br />
* [[Kamen Rider Raia]]<br />
* [[Kamen Rider Gai]]<br />
* [[Kamen Rider Ouja]]<br />
* [[Kamen Rider Tiger]]<br />
* [[Kamen Rider Imperer]]<br />
* [[Kamen Rider Femme]]<br />
* [[Kamen Rider Ryuga]]<br />
* [[Kamen Rider Verde]]<br />
* [[Kamen Rider Odin]]<br />
[[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:26, 13 September 2010 (UTC)<br />
:To {{user|Active Banana}} - Agreed, replied at [[User talk:Active Banana]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:28, 13 September 2010 (UTC)<br />
::My "expertise" ends at the fact that this list appears in [[Kamen Rider Ryuki]]. I am not sure what is the best way to centralize an organized discussion when the content under question keeps getting shuttled around to other articles, with several AfD's already in progress. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:32, 13 September 2010 (UTC)<br />
<br />
== Re: Mission Dolores mural ==<br />
<br />
I have removed the COI several times now, because I am handling this issue and I am working with Ben to resolve any problems. Please use the talk page to explain any continuing problems as you see them. As a fully disinterested third party, I don't see a need for editors to keep adding maintenance tag when others are aware of the issue and are working to resolve any outstanding issues. Furthermore, there is nothing wrong with experts working on Wikipedia in their field, so the repeated adding of this tag does not help the working environment or encourage good faith. If there are COI problems that nobody has handled, use the talk page and explain them. I don't understand why editors think it helps to keep adding the tag. The COI is already explained on the talk page with the notable editor tag. Please review it. [[User:Viriditas|Viriditas]] ([[User talk:Viriditas|talk]]) 21:41, 13 September 2010 (UTC)<br />
:Alright, sounds good, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:42, 13 September 2010 (UTC)<br />
<br />
== Question ==<br />
<br />
I'm curious as to why, after being told multiple times that you ''were'' notified of the AN thread, that you [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard&diff=prev&oldid=384668039 asserted] on AN that I had not notified you. Your [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384660341 response] to Giftiger wunsch's statement [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384659677 here] appears to acknowledge that I notified you. Did you miss not only the notification I left on your talk page but also the multiple clarifications from Giftiger wunsch and me? [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 22:45, 13 September 2010 (UTC)<br />
:You are correct. I am sorry about that. I apologize. It was a mistake on my part. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:46, 13 September 2010 (UTC)<br />
<br />
== [[:File:Kamen rider eurodata.png]] ==<br />
<br />
I've removed the free copyright tags from this image. Do you think perhaps you could unlist it from "possibly unfree images" as it has been determined a year or so ago that it is actually not free?—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 23:27, 13 September 2010 (UTC)<br />
:Commented there. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:26, 14 September 2010 (UTC)<br />
<br />
== Deshastha Brahmin ==<br />
<br />
Hi Cirt - this is regarding the recent GAR for [[Deshastha Brahmin]] article. Do you have any comments on this [[Talk:Deshastha_Brahmin/GA1]]. Thanks. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 03:26, 14 September 2010 (UTC)<br />
:I would strongly recommend another [[WP:PR|peer review]], first, then renominating to try for [[WP:GAN]]. If you wish, you can keep me apprised, and I would be happy to take another look at the article once it is at the peer review stage, after those remaining issues have been fixed. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:59, 14 September 2010 (UTC)<br />
::No problem, I will make the changes, do the peer review then re-nominate. I appreciate your time on this. Thanks for the feedback, it has been helpful. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:11, 14 September 2010 (UTC)<br />
:::Please, feel free to keep me posted, I can check back in on it at that later stage. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:11, 14 September 2010 (UTC)<br />
::::Will do so. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:13, 14 September 2010 (UTC)<br />
:::::Okay, thanks! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:15, 14 September 2010 (UTC)<br />
<br />
== Quick demo of puppet functioning admin ==<br />
<br />
Cirt, you don't have real power and not free in your decisions regarding nomination and deleting the articles. You have a puppet master who telling you what to do. Look at the article describing [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It is published more than 3 years ago. It has no references since then and no explanation. It speaks about algorithm presumably implemented in [http://www.msoftware.co.nz/products/winrk WinRK] data compression software but WinRK did not say a word about algorithm. However WinRK is a corporation with influence and should you remove this article you yourself will be removed from admin position. Is that correct? <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:26, 14 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:The article, [[WinRK]], was previously deleted by two admins, {{user|Geni}} and {{user|Rjd0060}}. Not sure what you mean by the rest, the language used in the above comment is unclear, perhaps you could be more specific? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:31, 14 September 2010 (UTC)<br />
::How can you explain that article is back there? What I mean by the language that someone else decided what is deleted and what stays in Wikipedia not you. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 04:38, 14 September 2010 (UTC)<br />
:::Please read [[WP:AFD]]. Then please read [[WP:OTHERSTUFFEXISTS]]. Thank you, -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:40, 14 September 2010 (UTC)<br />
::::You move discussion to wrong direction. You make it look like my article is wrong and I try to keep it by pointing to other junk. That is not correct. My article was right and even ROLZ topic is right. ROLZ algorithm is perfect. The article about ROLZ is junk not the algorithm and this junk stays and you can not remove it because you are nobody. And there were other who tried to remove but because they do not make decision here as well the article is restored. Now, do not pretend that you are important person but tell us all who in Wikipedia has real power? [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 08:26, 14 September 2010 (UTC)<br />
:::::It appears you are complaining about [[Wikipedia:Articles for deletion/Polar Tree]], where the consensus to delete was quite clear. Perhaps if you like, I could move a version of that page's history to a subpage in your userspace, where you can work on a proposed draft version from which to improve it? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 08:55, 14 September 2010 (UTC)<br />
::::::The consensus means nothing because because it was reached by wrong people. Only one was computer programmer who voted to keep. I want to have text on my article on my subpage. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 04:41, 15 September 2010 (UTC)<br />
<br />
== Nomination of [[Joan Holmes]] for deletion ==<br />
<br />
<div class="floatleft" style="margin-bottom:0">[[File:Ambox warning pn.svg|42px]]</div>A discussion has begun about whether the article [[Joan Holmes]], which you created or to which you contributed, should be [[Wikipedia:Articles for deletion| deleted]]. While contributions are welcome, an article may be deleted if it is inconsistent with Wikipedia policies and guidelines for inclusion, explained in the [[Wikipedia:Deletion policy|deletion policy]].<br />
<br />
The article will be discussed at [[Wikipedia:Articles for deletion/Joan Holmes]] until a consensus is reached, and you are welcome to contribute to the discussion.<br />
<br />
You may edit the article during the discussion, including to address concerns raised in the discussion. However, do not remove the article-for-deletion template from the top of the article. [[User:Wolfview|Wolfview]] ([[User talk:Wolfview|talk]]) 04:36, 14 September 2010 (UTC)<br />
:Thank you for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:53, 14 September 2010 (UTC)<br />
== PrepExtra ==<br />
<br />
Hi. I've noticed that when you move stuff from prep extra you also move the PrepExtra-specific stuff too, towit: "When copying an update from this page to the Queue, please take the update closest to the TOP of the page, then delete the update from this page and add another copy of Template:Did you know/Clear to the BOTTOM of this page. Thanks, Gatoclass (talk)". I just now, and have fixed it with an edit like [https://secure.wikimedia.org/wikipedia/en/w/index.php?title=Template%3ADid_you_know%2FPreparation_area_2&action=historysubmit&diff=384757266&oldid=384733817 this one]. <span style="font-family:Verdana,sans-serif"> — [[User:Rlevse|<b style="color:#060;"><i>R</i>levse</b>]] • [[User_talk:Rlevse|<span style="color:#990;">Talk</span>]] • </span> 10:04, 14 September 2010 (UTC)<br />
:PrepExtra should be made to just have ''one'' set, just like the others, and be called, "Prep 3". :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:53, 14 September 2010 (UTC)<br />
::{{done}}, commented, at [[WT:DYK]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:31, 14 September 2010 (UTC)<br />
<br />
== Mlang.at.elisanet.fi ==<br />
<br />
User is requesting unblock. IIRC we stopped blocking email addresses a while back, and I also take heed of his argument that s/he uses the same name on fiwiki seriously, especially since a) other-language Wikipedias have allowed some email addies as usernames and b) with SUL we now have to deal with those usernames. [[User:Daniel Case|Daniel Case]] ([[User talk:Daniel Case|talk]]) 13:56, 14 September 2010 (UTC)<br />
:I will unblock the account. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:53, 14 September 2010 (UTC)<br />
::{{done}}, commented, at [[User talk:Mlang.Finn]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:58, 14 September 2010 (UTC)<br />
<br />
== VESK ==<br />
<br />
Hi Cirt,<br />
<br />
I know this was a long time ago now, and doubt that you remember, but I was wondering if i can put back the VESK article that i posted. I have now found information in Computer Weekly written by Citrix about VESK and what they offer. Is that a trusted enough source to put the article back? http://www.computerweekly.com/Articles/2010/09/06/242630/Virtual-desktop-helps-recruitment-firm-slash-IT-costs-and-speed-up-expansion.htm<br />
<br />
There is another PR article i have found, http://www.prfire.co.uk/press-release/astbury-marsden-cut-it-costs-by-40-per-cent-with-virtual-desktops-from-vesk-26660.html, that goes in to a little more detail. Also there are youTube videos on how it works at http://www.youtube.com/user/veskvirtualdesktop.<br />
<br />
Please could you let me know if this is acceptable to re-create the article.<br />
<br />
Kind Regards,<br />
[[User:Appipark|Appipark]] ([[User talk:Appipark|talk]]) 14:11, 14 September 2010 (UTC)<br />
:I will userfy it for you. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:53, 14 September 2010 (UTC)<br />
::{{done}}, now at [[User:Appipark/VESK]] -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:04, 14 September 2010 (UTC)<br />
<br />
== An FAR ping ==<br />
<br />
Hi Cirt, thanks for your comments on [[Wikipedia:Featured article review/Premier League/archive2|the FAR]] for [[Premier League]]. Could you please revisit it for the citation issues, Cordless Larry has added fact tags which have all been resolved and there have been a few structural changes. Could you also please elaborate on your LEAD issue? Is there anything in particular that stands out as missing? Thanks, [[User:Woody|Woody]] ([[User talk:Woody|talk]]) 15:50, 14 September 2010 (UTC)<br />
:I will revisit the page. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:53, 14 September 2010 (UTC)<br />
::{{done}}, will probably try to revisit again, at time of FARC. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:40, 14 September 2010 (UTC)<br />
:::Many thanks for that. I have dealt with all the citation requests now. Hopefully it won't need to go to FARC, regards. [[User:Woody|Woody]] ([[User talk:Woody|talk]]) 18:30, 14 September 2010 (UTC)<br />
<br />
== Deletion of Voluntary Content Rating ==<br />
<br />
Hi Cirt, <br />
<br />
Why did you delete the Article about the [[Voluntary Content Rating]] with just one vote? <br />
<br />
[[Wikipedia:Articles_for_deletion/Voluntary_Content_Rating]]<br />
<br />
I just discovered the deletion, because you broke my links to the site, for example on http://draketo.de/licht/ich/meine-seite-ist-ab-18<br />
<br />
When I read the article (more than a year ago) it was very useful for webmasters, because it gave very clear instructions how to mark your site as not-for-children, and in germany a new law is forcing us (since the beginning of this year) to mark all our sites appropriately – or enforce that people can only view them between 22:00 and 7:00 (don’t ask me for my opinion on the politicians who decided on that. My answer likely wouldn’t be fit for Wikipedia).<br />
<br />
Since it’s deleted, I can’t check, if the article changed to unuseful since then. <br />
<br />
Best wishes, <br />
[[User:ArneBab|Draketo]] ([[User talk:ArneBab|talk]])<br />
<br />
PS: Yes, I twittered/dented about that when I discovered that the site is gone. No, this is no try at meatpuppetry but the result of temporary rage on having my info-link wrecked. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:ArneBab|ArneBab]] ([[User talk:ArneBab|talk]] • [[Special:Contributions/ArneBab|contribs]]) 21:18, 14 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:I'd be happy to provide a copy for you to work on as a proposed draft version, within a subpage of your userspace. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:24, 14 September 2010 (UTC)</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Cirt&diff=384747445User talk:Cirt2010-09-14T08:26:47Z<p>C-processor: /* Quick demo of puppet functioning admin */</p>
<hr />
<div>{{User:Cirt/Contributions}} <br />
{{User:MiszaBot/config<br />
|maxarchivesize = 250K<br />
|counter = 12<br />
|minthreadsleft = 5<br />
|algo = old(7d)<br />
|archive = User talk:Cirt/Archive %(counter)d<br />
}}<br />
{{talkheader}}<br />
{{WikiProjectGATasks}} <br />
{| align=lef !important;<br />
|{{cent|float=left|width=100%}}<br />
|{{Signpost-subscription}}<br />
|}<br />
{| align=lef !important;<br />
|[[WP:AFD/T|AFD/T]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-7 days}}|T-7]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-2 days}}|T-2]] • [[WP:AFDO|AFDO]] • [[WP:AIV|AIV]] • [[CAT:RFUB|RFUB]] • [[WP:UAA|UAA]]/[[CAT:UAA|CAT]] • [[WP:RFPP|RFPP]] • [[CAT:PER|PER]] • [[CAT:CSD|CSD]] • [[CAT:AB|AB]] • [[WP:FAR|FAR]] • [[User:Deckiller/FAC urgents|FAC urgents]] • [[WP:TFAR|TFAR]] • [[WP:RSN|RSN]] • [[WP:BLPN|BLPN]] • [[WP:FTN|FTN]] • [http://www.google.com/custom?domains=en.wikipedia.org&sitesearch=en.wikipedia.org Google Search] {{Wikipedia:Bureaucrats' noticeboard/RfA Report}}<br />
|}<br />
__TOC__<br />
<br />
== Other neat portal ideas for longer term ==<br />
<br />
* Longer term ideas to think about from other portals:<br />
#'''Events''' section, like: "On this day" e.g., [[Portal:Biography|Biography]], [[Portal:Religion|Religion]], [[Portal:United States|United States]]; "Selected anniversaries" e.g., [[Portal:War|War]]; "Calendar" at [[Portal:Holidays|Holidays]]. Interesting idea of "Month selected anniversaries", at [[Portal:Oregon|Oregon]]. <br />
#Model intro with some rotating images, after [[Portal:Oregon]], [[Portal:Indiana]], [[Portal:Iceland/Intro]] and [[Portal:Philosophy of science/Intro]]. <br />
#Revamp DYK sections w/ free-use images, model after [[Portal:Criminal justice]] and [[Portal:Oregon]].<br />
#Portal palettes at [[User:RichardF/Palettes/Portals]]. Comparable color schemes can be developed from the various hue lists at [[User:RichardF/Palettes]]. Also see [[Portal:Box-header]].<br />
#If there are a lot of categories, then categories section to 2 columns, like in [[Portal:Indiana]].<br />
#:Also take some time to check out style/formatting at [[Portal:Indiana]] '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Note to self ==<br />
<br />
*[http://toolserver.org/~magnus/makeref.php MakeRef]<br />
*[http://toolserver.org/~dispenser/view/Reflinks Reflinks]<br />
*[http://reftag.appspot.com/ Citation tool for Google Books] <br />
*[http://reftag.appspot.com/doiweb.py Citation tool for DOIs]<br />
*[[Wikipedia:Wikipedia Signpost/2010-09-06/Dispatches|Tools, part 1: References, external links, categories and size]]<br />
<br />
[[Wikipedia:Verifiability#Sources|independent]] [[Wikipedia:Reliable sources|reliable]] [[Wikipedia:No original research#Primary, secondary and tertiary sources|secondary sources]]<br />
<br />
*[[User:Citation bot/use]]<br />
<br />
*{{tl|findsources}}<br />
<br />
;Cite templates<br />
<pre><br />
<ref>{{cite book| last = | first = | authorlink = | coauthors = | title = | publisher = | year = | location = | page = | url = | doi = | id = | isbn = }}</ref><br />
<br />
<ref>{{cite news| last = | first = | coauthors = | title = | work = | language = | publisher = | page = | date = | url = | accessdate = }}</ref><br />
<br />
<ref>{{cite journal|last =| first=| authorlink=| coauthors=|title=|journal=|volume=|issue=|page=|publisher=|location = | date = | url = | doi = | id = | accessdate = }}</ref><br />
<br />
<ref>{{cite web| last = | first = | authorlink = | coauthors = | title = | work = | publisher = | date = | url = | format = | doi = | accessdate = }}</ref><br />
</pre><br />
<br />
;Citation model<br />
[[The Simpsons (season 3)]]<br />
;Body text in-cite<br />
<pre><br />
<ref name="REFNAME">[[#LASTNAME|LASTNAME]], p. PAGENUMBER</ref><br />
</pre><br />
;References section<br />
(reference template from [[WP:CIT]])<br />
<pre><br />
*<cite id=LASTNAME>REFERENCE</cite><br />
</pre><br />
<br />
;Different model<br />
*[[Template:Citation]]<br />
*[[Template:Harvnb]]<br />
*<nowiki>Example: <ref name="REFNAME">{{Harvnb|LAST|YEAR|p=PAGENUMBER}}</ref></nowiki><br />
See models at [[The General in His Labyrinth]] and [[Mario Vargas Llosa]]. <br />
<br />
::[http://en.wikipedia.org/w/index.php?title=User_talk:Jbmurray&oldid=242692603#Citation_formatting_help.3F More info]. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
More at [[Wikipedia:Harvard citation template examples]]. <br />
:And [[Template talk:Harvard citation no brackets]]. <br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Dispatch ==<br />
<br />
Cirt, [http://en.wikipedia.org/wiki/Wikipedia_talk:FCDW#Suggestion_for_a_dispatch Awadewit suggested that] you might be interested in writing a [[WP:SIGNPOST|Signpost]] [[WP:FCDW|Dispatch]] article on Featured portals (the only area of featured content we haven't covered). Sample previous articles are at {{t1|FCDW}}. We've covered:<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-31/Dispatches|Featured content overview]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-17/Dispatches|Peer review]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-02/Dispatches|Did you know]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-12/Dispatches|Featured lists]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-19/Dispatches|Good articles]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-26/Dispatches|Featured sounds]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-09-08/Dispatches 1|Featured topics]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-13/Dispatches|Images]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-08-18/Dispatches|TFA]]<br />
* And Featured articles many times: [[Wikipedia:Wikipedia Signpost/2008-07-21/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-04-07/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-10-13/Dispatches]]<br />
<br />
None of them start out looking like that: if an editor initially just chunks in some text, many others chip in to tweak it up to Signpost standards. For example, someone wrote [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-08/Dispatches&oldid=249522488 this,] which Karanacs, Royalbroil and I turned into [[Wikipedia:Wikipedia Signpost/2008-11-08/Dispatches|this]], so if you just chunk in some text as a start, others can help finish it off. Another example, I put in [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-10/Dispatches&oldid=249800192 this outline,] and Karanacs brought it up to [[Wikipedia:Wikipedia Signpost/2008-11-10/Dispatches|this]]. Other editors have written almost complete and clean Dispatches without much need for other editing. If you're interested, please weigh in and coordinate at [[WT:FCDW]] In case you're interested, you could just begin sandboxing something at [[WP:FCDW/Portals]] and pop over to [[WT:FCDW]] to leave a note when you're ready for others to help out. Regards, [[User:SandyGeorgia|Sandy<font color="green">Georgia</font>]] ([[User talk:SandyGeorgia|Talk]]) 19:26, 17 November 2008 (UTC)<br />
:Will mull this over and most likely draft something up. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 11:54, 18 November 2108 (UTC)<br />
== Razzies progress ==<br />
<br />
*[[15th Golden Raspberry Awards]] through [[29th Golden Raspberry Awards]] = reformatting process done.<br />
**Note: Going to have to go back and model these after the modifications made subsequently to [[29th Golden Raspberry Awards]].<br />
*[[29th Golden Raspberry Awards]] - so far only one expanded with sourcing research. ([[WP:FL]])<br />
*[[Razzie Award for Worst New Star]] = reformatting process done, next to use '''[[Talk:Razzie Award for Worst Picture]]''' as model to reformat other pages in [[:Category:Golden Raspberry Awards by category]] (with subsection breaks by decade)<br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== AN/I: False accusations of vandalism ==<br />
<br />
Hello. This message is being sent to inform you that there currently is a discussion at [[Wikipedia:Administrators' noticeboard/Incidents]] regarding an issue with which you may have been involved. <!--Template:ANI-notice--> Thank you. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Ovadyah|Ovadyah]] ([[User talk:Ovadyah|talk]] • [[Special:Contributions/Ovadyah|contribs]]) </span></small><!-- Template:Unsigned --><br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:57, 31 August 2010 (UTC)<br />
<br />
While on the subject, a portion of my 4 September edit of the [[Oksana Grigorieva]] entry was reverted with the comment "fix prev vandalism." I don't have a problem with the reversion, but I don't feel the "vandalism" label was warranted. [[User:Cmholm|Cmholm]] ([[User talk:Cmholm|talk]]) 10:58, 6 September 2010 (UTC)<br />
:That was not meant to refer to you, sorry. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:42, 6 September 2010 (UTC)<br />
<br />
== Betamax VOIP ==<br />
<br />
Can someone please explain to me why this page was deleted? It had a ready reference to all the various products available from Betamax. This was not as someone has said marketing because its actually not in Betamax's interest to have this page published...a little basic economics will tell you this. Each of the products competes with the others...in different markets. Its like having a DVD available in 15 different countries. This page told you which countries it was available in so that you could check the prices in each country and then buy it from the cheapest! There was no hint of marketing in the article it was purely informational and very useful too! If listing out all the products a company sells is marketing then I can think of a lot of pages on large Multinational Companies that will also have to be deleted.<br />
<br />
Hope someone will see the light.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:09, 2 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:I would suggest first you register for an account on Wikipedia. Then, you could work on a proposed draft version, within a subpage of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:44, 2 September 2010 (UTC)<br />
<br />
I am not proposing to work on a new draft I am proposing that the old article be reinstated. I have not written the previous article nor am I connected with Betamax in anyway. I am a user who found that article extremely useful and was quite disappointed to find the article deleted and also the reasons for the deletion. I don't have either the technical expertise or the time to learn how to discuss these things on Wikipedia however I don't see that as a reason to stay muted. I apologise if I haven't followed any protocl etc that is required here but I think I've made my point. Can you please review the previously deleted article and view it in the new light as I have suggested and I am sure that you will find that it is a neutral article written purely for the purposes of keeping the public informed and helping them make informed choices.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:49, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:You might find it worthwhile to at the very least attempt to try the recommended suggestion, above. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:43, 6 September 2010 (UTC)<br />
<br />
You are recommending that I open an account! Is this some devious scheme to get more people to sign up? Do you get some kind of commission for that? This discussion is against the spirit that Wikipedia was founded on! All I am asking is that you reconsider your decision...as a neutral party. I think you've been too harsh. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 09:41, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
== Proposed Quidco article ==<br />
<br />
Hi again, I've made some additions to the proposed Quidco article on my Talk page at http://en.wikipedia.org/wiki/User_talk:Stuartcoggins#Proposed_Quidco_article and was wondering if you could take another look? Many thanks, Stuart<br />
<br />
[[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 16:02, 3 September 2010 (UTC)<br />
:Try working on it on a separate page, at [[User:Stuartcoggins/Sandbox]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:30, 3 September 2010 (UTC)<br />
::Thank you, I've now moved the article to http://en.wikipedia.org/wiki/User:Stuartcoggins/Sandbox and developed it a little more. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 11:18, 7 September 2010 (UTC)<br />
:::If the article requires more development, please let me know. Alternatively, if the article that was in place just prior to deletion could be restored, I think that was a well-written and neutral piece, so if that were possible, that would be great. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:06, 7 September 2010 (UTC)<br />
::::Needs to demonstrate significant coverage in reliable secondary sources independent of the subject, per [[WP:NOTE]]. Please also read [[WP:RS]], [[WP:V]], and [[WP:CITE]] and [[WP:CIT]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:54, 7 September 2010 (UTC)<br />
:::::Thank you, I will work on that and get back to you. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:56, 7 September 2010 (UTC)<br />
::::::Okay, sounds good. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:29, 7 September 2010 (UTC)<br />
<br />
== Living Control ==<br />
<br />
You deleted a page for Living Control. This is an important page as the company has gone in administration. Therfore several groups are being setup with links to support and advice over this matter and products. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/86.145.140.29|86.145.140.29]] ([[User talk:86.145.140.29|talk]]) 10:45, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you first create an account. Then, you could work on a proposed draft version, within a subpage of your userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:42, 6 September 2010 (UTC)<br />
<br />
== AFD closure ==<br />
<br />
While [[Wikipedia:Articles for deletion/Johanna Carreño]] was closed correctly based on the circumstances that existed at the time (unreferenced BLP, nothing turned up in the AFD), there's actually a lot of coverage of this girl in the Spanish-language press [http://www.eltiempo.com.ec/noticias-cuenca/2216-johanna-carrea-o-nominada-a-los-mtv/] [http://www.eluniverso.com/2008/09/11/0001/259/6E4FD68CBB984AA59FFEA7FC88CC7DF1.html] [http://www.eluniverso.com/2008/07/31/0001/259/A822E5B225474BA8B7A838DF78FD23B8.html]. Restoring the article might be more efficient than starting over. [[User:Peter Karlsen|Peter Karlsen]] ([[User talk:Peter Karlsen|talk]]) 01:29, 7 September 2010 (UTC)<br />
:I would be most willing to provide it, in your userspace as a subpage, so you could work on a proposed draft version. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:46, 7 September 2010 (UTC)<br />
::That would be great, thanks. [[User:Peter Karlsen|Peter Karlsen]] ([[User talk:Peter Karlsen|talk]]) 01:48, 7 September 2010 (UTC)<br />
:::{{done}}, now at [[User:Peter Karlsen/Johanna Carreño]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 02:55, 7 September 2010 (UTC)<br />
<br />
== Deletion of [[Lilias Rider Haggard]] article ==<br />
<br />
Hi,<br />
I was just wondering why this article was deleted after I provided a second reference and more biographical details. <br />
<br />
Thank you. <br />
[[Jcspurrell]] <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]] • [[Special:Contributions/Jcspurrell|contribs]]) 16:26, 7 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:Was deleted, after deletion discussion at [[WP:AFD]] process, here [[Wikipedia:Articles for deletion/Lilias Rider Haggard]]. Would be willing to provide a copy, as a subpage within your userspace, if you wish to work on a proposed draft version. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:31, 7 September 2010 (UTC)<br />
<br />
Hi,<br />
<br />
Thank you for your comments. However, I do still do not understand why the article was deleted. In the discussion, I said that I would provide more references and information. I began to do so, but the article was deleted before I had time to finish. If possible, I would like to take you up on your offer of working on a draft version on a subpage within my userspace so that I can continue to add information as and when I have time.<br />
<br />
Many thanks.<br />
<br />
Jcspurrell<br />
[[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 20:54, 13 September 2010 (UTC)<br />
:{{done}}, now at [[User:Jcspurrell/Lilias Rider Haggard]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 20:56, 13 September 2010 (UTC)<br />
<br />
Thank you. [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 21:19, 13 September 2010 (UTC)<br />
:You are most welcome! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:19, 13 September 2010 (UTC)<br />
<br />
== Tiny Ross ==<br />
<br />
I see you deleted this as a hoax? He may not be notable, and I have no idea whether the details in the article were true, but he was certainly a real actor and appeared in three films, most notably ''[[Time Bandits]]''... Was hoax really the right criteria to delete this article? [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:07, 7 September 2010 (UTC)<br />
:Feel free to recreate it, seems it was created in this instance, by a problem user. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:11, 7 September 2010 (UTC)<br />
<br />
::Nah, there's not really enough biographical data available. It's possible that the content was completely made up. The only real reliable source is a book on Monty Python and it only includes him in a cast list, no details. [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:14, 7 September 2010 (UTC)<br />
<br />
== The Military history WikiProject Newsletter : LIV (August 2010) ==<br />
<br />
{{WPMILHIST Newsletter header|LIV|August 2010| }}<br />
{| style="width: 100%;"<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Project news</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Project news|The return of reviewer awards, task force discussions, and more information on the upcoming coordinator election]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Articles</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Articles|A recap of the month's new Featured and A-Class articles, including a new featured sound]]''<br />
<br />
|-<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Members</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Members|Our newest A-class medal recipients and this August's top contestants]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Editorial</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Editorials|In the first of a two-part series, Moonriddengirl discusses the problems caused by copyright violations]]''<br />
<br />
|-<br />
| valign="top" colspan="2" style="padding: 0.5em; text-align: center; font-size: 85%; " |<br />
To change your delivery options for this newsletter please list yourself in the appropriate section [[Wikipedia:WikiProject Military history/News/Options|here]]. To assist with preparing the newsletter, please visit the [[Wikipedia:WikiProject Military history/Coordinators/Strategy think tank/News and editorials division|newsroom]]. [[User:BrownBot|BrownBot]] ([[User talk:BrownBot|talk]]) 23:04, 7 September 2010 (UTC)<br />
|}<br />
<br />
== Housekeeping ==<br />
<br />
Hello - you closed [[Wikipedia:Articles for deletion/Caesar Takeshi|this AfD]] as keep, however the AfD template is still displaying on the [[Takeshi Caesar|article page]]. --[[User:Ponyo|<b><font color="Navy">''Jezebel's''</font></b><font color="Navy">Ponyo</font>]]<sup>[[User_talk:Ponyo|<font color="Navy">''shhh''</font>]]</sup> 18:34, 8 September 2010 (UTC)<br />
:{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
<br />
== Selena FAC ==<br />
<br />
I think I took care of most of the concerns, the article is rather short because she had a short career, and I want to stick to the basics, not add extra information about her tours, etc. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 03:54, 9 September 2010 (UTC)<br />
:Link please? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
[[Wikipedia:Featured article review/Selena/archive1]] [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 18:34, 9 September 2010 (UTC)<br />
: I added citations where I could removed where I couldn't find it in the book, and beefed up the article just a little bit, I don't want to go into overdetail. Thanks [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 23:03, 12 September 2010 (UTC)<br />
: I reworded it to impact and merged the two sentence paragraph. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 14:35, 13 September 2010 (UTC)<br />
::{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:38, 13 September 2010 (UTC)<br />
::: I may need your help, I already broke 3RR on Selena trying to keep it as reliable as possible, protect the page please so the revert war will [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 22:42, 13 September 2010 (UTC)<br />
::::I will request full prot, at [[WP:RFPP]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:43, 13 September 2010 (UTC)<br />
<br />
== Blocking dummy available ==<br />
<br />
Wow, you're following up on some of my old COI tags. At this rate, you'll be the blocking king at the end of the night. Too bad I haven't been too active lately but there are a couple of recent ones from the past week. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:35, 9 September 2010 (UTC)<br />
:Heh, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:37, 9 September 2010 (UTC)<br />
::You're laughing and I'm serious! When I sometimes go on a Recent changes patrol, some of those COI jokers will find a nice little tag on their talkpage. I could make [[Rosey Grier]] look like a toothpick when I go plowing through; hence the blocking dummy would be me. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:50, 9 September 2010 (UTC)<br />
:::[[Rosey Grier]] is a cool dude, per [[Portal:Textile arts/Selected quote/2]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:52, 9 September 2010 (UTC)<br />
::::It's kind of funny but that whole Ram front four had a very humanistic, in touch with their inner spirit side. Now, call them a pansy to their face and you might be missing some teeth. My Dad used to force me to watch his "Lambs". He always swore at [[Roman Gabriel]] whenever they started losing. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 05:01, 9 September 2010 (UTC)<br />
:::::Picking up from where you left on yesterday? I wonder how many users I tagged with COIs in June and July. I'll try to work on September tonight so that you'll have something to do in a month or so. ;_) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 00:59, 10 September 2010 (UTC)<br />
::::::Okay, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:00, 10 September 2010 (UTC)<br />
{{od}}<br />
Now serving number one. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:19, 10 September 2010 (UTC)<br />
:Now serving number two. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:42, 10 September 2010 (UTC)<br />
::When you get to August, let me know. Looks like you're working July now. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:21, 11 September 2010 (UTC)<br />
:::Not sure what you mean by the other above messages. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 11 September 2010 (UTC)<br />
::::Which ones? If you're talking about number one and number two, the first was a COI who became or was a sock of number two that I saw later last night. Another admin blocked them at [[Wikipedia:Sockpuppet investigations/EdwinHarbor]]. Otherwise, you've been clearing up some of COI usernames dating back awhile. I noticed that you did several today as well. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:27, 11 September 2010 (UTC)<br />
:::::Oh, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:27, 11 September 2010 (UTC)<br />
::::::No, thank you. I noted that you went to May, moved to June and did some from July. September's been a little slow but I'm working on it. ;) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:30, 11 September 2010 (UTC)<br />
:::::::Sounds good, -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:32, 11 September 2010 (UTC)<br />
<br />
== Featured Portal review ==<br />
<br />
Hey Cirt. Can you close [[Portal:Business and economics]] [[Wikipedia:Featured portal review/Business and economics|FPR]]? There hasn't been any edits on the article since August 3rd and there's still problems to it. [[User:GamerPro64|GamerPro64]] ([[User talk:GamerPro64|talk]]) 20:55, 9 September 2010 (UTC)<br />
:Left notes for a couple users. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 23:07, 9 September 2010 (UTC)<br />
<br />
== Dammit Cirt ==<br />
<br />
You beat me to all my closes today :( (at least we agreed on them) --[[User:Ron Ritzman|Ron Ritzman]] ([[User talk:Ron Ritzman|talk]]) 00:23, 10 September 2010 (UTC)<br />
:Sorry, and great! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:24, 10 September 2010 (UTC)<br />
<br />
== A Very Merry Unauthorized Children's Scientology Pageant ==<br />
<br />
Hello, I have discovered this article by sheer luck and I have found it very interesting. The idea of this musical is just awesome ! It would be too bad if I did not try to translate it. Now, this play have at least one article in french :) Dosto [[Special:Contributions/86.71.74.243|86.71.74.243]] ([[User talk:86.71.74.243|talk]]) 01:26, 11 September 2010 (UTC)<br />
:Thank you! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== There was no Russia in 1970. ==<br />
<br />
It was called the Russian SFSR-the Russian Soviet Federative Socialist Republic. That's common knowledge. That doesn't need to be cited. Don't dumb down Wikipedia. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/139.84.242.65|139.84.242.65]] ([[User talk:139.84.242.65|talk]]) 02:00, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Please discuss, at [[Talk:Oksana Grigorieva]], thanks. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== OneVietnam Network, previously deleted--can it be put up again? ==<br />
<br />
Hi, a couple of months ago I created a page for OneVietnam Network. It was deleted because there were doubts on its significance and there was a lack of coverage on it. Since then, there has been a lot of new coverage on OneVietnam Network. If I want to create the page again, do I have to go through you (the deleting admin), or is it okay if I save new page again? Thank you very much for your time. [[User:Clockmonster|Clockmonster]] ([[User talk:Clockmonster|talk]]) 03:39, 11 September 2010 (UTC)<br />
:I would suggest first working on it, as a proposed draft version, within a subpage off of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:40, 11 September 2010 (UTC)<br />
<br />
== AfD closure of [[EXtremeDB]] ==<br />
<br />
You are invited to join the discussion at [[Wikipedia:Editor_assistance/Requests#Request_re_EXtremeDB]]. I'm sorry that the discussion there has got rather long. I think the relevant point is that in [[Wikipedia:Articles_for_deletion/EXtremeDB|this AfD]] you may have overlooked the nominator's withdrawal of the nomination. -- [[User:John of Reading|John of Reading]] ([[User talk:John of Reading|talk]]) 16:25, 11 September 2010 (UTC)<br />
:Nod, the user is welcome to come to me, here. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:06, 12 September 2010 (UTC)<br />
<br />
== Old username concerns ==<br />
<br />
Hi Cirt - You seem to be doing a great job of cleaning up (blocking) the old usernames that I have tagged as concerns. I am just wondering if you have any script or any dated category or if you are just going through the overall username category manually. I was going to use AWB to do the same, but if you've already found a good semi-automated way of doing it I'll let you finish (or I'm happy to replicate what you are doing). Let me know. Thanks. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 00:08, 12 September 2010 (UTC)<br />
:Was doing it manually, without a script. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:05, 12 September 2010 (UTC)<br />
::Ok - thanks. Can tell you are busy with it, because you show up as like half of my watchlist edits. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 03:18, 12 September 2010 (UTC)<br />
:::Heh, thanks for the kind words! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 12 September 2010 (UTC)<br />
<br />
== Review request ==<br />
<br />
Hello, Cirt. I'm posting here as I saw you were online while watching recent changes. Coincidentally, (your username popped up blocking for a username) this is regarding a [http://en.wikipedia.org/w/index.php?title=User_talk:Gingerbakercorp&diff=384321318&oldid=384280172 username] block I recently executed. If you have the time, would you check to make sure the block was warranted and executed properly? Feel free to undo my block or alter it as you see fit. Let me know and I'll make any apology to the user that's needed. Thanks [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:21, 12 September 2010 (UTC)<br />
:Responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 12 September 2010 (UTC)<br />
<br />
::Thanks for the quick action. See ya 'round [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:29, 12 September 2010 (UTC)<br />
:::You are most welcome. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:30, 12 September 2010 (UTC)<br />
<br />
== Your [[WP:GA|GA]] nomination of [[Lady Gaga: Queen of Pop]] ==<br />
<br />
The article [[Lady Gaga: Queen of Pop]] you nominated as a [[Wikipedia:Good article nominations|good article]] has been placed on hold [[Image:Symbol wait.svg|20px]]. The article is close to meeting the [[WP:GA?|good article criteria]], but there are some minor changes or clarifications needed to be addressed. If these are fixed within seven days, the article will pass, otherwise it will fail. See [[Talk:Lady Gaga: Queen of Pop]] for things which need to be addressed. [[User:Jezhotwells|Jezhotwells]] ([[User talk:Jezhotwells|talk]]) 10:52, 12 September 2010 (UTC)<br />
:Thanks, responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 18:18, 12 September 2010 (UTC)<br />
<br />
== Request for clarification ==<br />
<br />
A request for clarification [http://en.wikipedia.org/w/index.php?title=Wikipedia:Arbitration/Requests/Clarification&oldid=384453348] has been filed per [http://en.wikipedia.org/wiki/Wikipedia:Arbitration/Requests/Enforcement/Archive66#User:TimidGuy_and_User:Littleolive_oil_and_User:Edith_Sirius_Lee] Although it may not affect you directly, your name has been mentioned or referenced.([[User:Littleolive oil|olive]] ([[User talk:Littleolive oil|talk]]) 20:39, 12 September 2010 (UTC))<br />
<br />
== Deletion of article Polar Tree ==<br />
<br />
You deleted my article Polar Tree. Obviously to me the procedure of deleting of articles in Wikipedia is hypocritical with fake and orchestrated discussion similar to mid centuries inquisition court when executed heretic was provided the right to express his views before the judges who already made decisions. In my case the article described modification of known algorithm in data compression. This is not new research but slight modification of old research leading to certain benefits - that means no original research. I provided two independent links. One link to Google site where software developer incorporated my algorithm to his program and achieved certain benefits. Another link from expert in data compression Matt Mahoney who maintain largest data compression benchmark. On his site Matt reexplained my algorithm to readers confirming by this action the novelty, because all other known algorithms on his site not explained but mentioned. The individual that suggested to remove the article changed his opinion on the opposite and suggested to keep the article. The other two reviewers suggested to ask expert opinion. At this point someone who orchestrated the deleting of the article saw that well orchestrated action failing brought new player [[User:Whpq|Whpq]] who is totally incompetent in the subject and has many 5 lines articles about nothing. When another new vote was obtained you deleted the article. <br />
I can explain why I believe that Wikipedia orchestrated the deletion. My references are real, strong and independent. People found my algorithm without my soliciting. It is much better than publication in the journal because articles are sent by authors to the journals where one of the authors was previously published and sending is backed up by set of phone calls to editor-in-chief. It is arranged. Frequently the author without connection include the co-author with connections for the article to be published. In my case the researcher not just approved but took the algorithm and implemented it into a software. Needless to say that 99% of what is published in technical journals is junk that never implemented by anyone. When discussion went into wrong direction new member [[User:Whpq|Whpq]] appeared out of nowhere. And what is the reason that this individual having no idea about data compression suddenly read my article about data compression checked my references and found them unreliable. Look at what he writes - the data compression is out of his interest. The explanation is simple he was told to look and provide an opinion necessary to have an excuse to delete the article. I can also explain why I believe that decisions are made by some man in the shadow. During discussion I pointed out the other article as classical example of material without notability, references and even explanation. It is article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. Why all these critics that are very far from data compression found my article and did not notice the other article about data compression, that has no references at all and does not even provide an explanation and stay in Wikipedia over 2 years. The answer is simple. Because they were not told to do that. I mentioned in discussion that there is nothing wrong with ROLZ algorithm, but it is not publicly explained so there is notability issue, no references, not at all, nothing because it was proprietary, it was not published. <br />
Since I have my own web site where I can publish everything I decide. I will write an article about process of evaluation the articles in Wikipedia. My conclusion that articles must get back door approval by someone in control through connections otherwise independently on provided references they will be deleted and references will be announced unreliable. As scientist I have one role to deliver the people the explanation how the world is functioning. This is what scientists normally do. I think I have to explain to visitors of my site that publications in Wikipedia are arranged through the back door leading to administration that will help people to make right solution, avoid wasting time and so on. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 04:42, 13 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you register an account, then you could work on a proposed draft version, within a subpage of your userspace page. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== Crumplezone ==<br />
<br />
HEY YOU, WHY ARE YOU DELETING [[Crumplezone]], AND YOU ARE NOT SUPPOSED TO BE DELETED DO YOU UNDERSTAND!!?? [[User:75.142.152.104|75.142.152.104]] ([[User talk:75.142.152.104|talk]]) 04:50, 13 September 2010 (UTC)<br />
:Please read [[WP:AFD]], then [[Wikipedia:Articles for deletion/Crumplezone]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== FAR ping ==<br />
<br />
Hi Cirt - Could you please revisit your comments at the FARs for [[Selena]] and [[Michael Brown Okinawa assault incident]]? Also the one for [[Gliding]] - more specificity is needed regarding the sections you believe should be expanded: what information do you think is missing? Thank you, [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 13:06, 13 September 2010 (UTC)<br />
:{{done}}! Also, [[User:Dana boomer|Dana boomer]], I wanted to thank you for the courteous, polite, and kind way in which you have approached me to inquire about this - it is a rare and most appreciated quality. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:29, 13 September 2010 (UTC)<br />
::Awesome, thanks for the quick response! (And you're welcome!) [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 14:51, 13 September 2010 (UTC)<br />
<br />
==Deletion review for [[Topsite (www)]]==<br />
An editor has asked for a [[Wikipedia:Deletion review#Topsite (www)|deletion review]] of [[Topsite (www)]]. Because you closed the deletion discussion for this page, speedily deleted it, or otherwise were interested in the page, you might want to participate in the deletion review. <!-- This originally was from the template {{subst:DRVNote|PAGE_NAME}} ~~~~ -->''[[User:Rich Farmbrough|Rich]]&nbsp;[[User talk:Rich Farmbrough|Farmbrough]]'', 15:04, 13 September 2010 (UTC).<br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:06, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Is there a reason you are now systematically sending perfectly notable subjects to deletion, other than the fact you thought I was rude to you on your talk page? Two films that were released in theaters in another nation are indeed notable.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:01, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:03, 13 September 2010 (UTC)<br />
::They are '''movies'''. They are notable. These articles are also '''just made'''. Give us time to work on the articles before sending everything into the trashbin.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:04, 13 September 2010 (UTC)<br />
:::The use of '''bold''' is not necessary. The articles could have been worked on in userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== Ryulong ==<br />
<br />
I'm terribly sorry to bother you about this, but Ryulong is concerned that you're AfDing articles that he created as a gesture of retaliation for his poor word choice on your usertalk; he's also quite distressed that this is happening when he's stuck on poor-grade WiFi and therefore can't really participate in the AfDs.<br />
<br />
Could you do something to assuage these concerns? Thank you. [[User:DragonflySixtyseven|DS]] ([[User talk:DragonflySixtyseven|talk]]) 21:03, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== AN discussion regarding username blocks ==<br />
<br />
Please see [http://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard#Nipples_-_I_have_two.2C_how_about_you.3F here]. Thanks. [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 21:08, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Perhaps a mass nomination is in order?<br />
* [[Kamen Rider Knight]]<br />
* [[Kamen Rider Ryuki (character)|Kamen Rider Ryuki]]<br />
* [[Kamen Rider Scissors]]<br />
* [[Kamen Rider Zolda]]<br />
* [[Kamen Rider Raia]]<br />
* [[Kamen Rider Gai]]<br />
* [[Kamen Rider Ouja]]<br />
* [[Kamen Rider Tiger]]<br />
* [[Kamen Rider Imperer]]<br />
* [[Kamen Rider Femme]]<br />
* [[Kamen Rider Ryuga]]<br />
* [[Kamen Rider Verde]]<br />
* [[Kamen Rider Odin]]<br />
[[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:26, 13 September 2010 (UTC)<br />
:To {{user|Active Banana}} - Agreed, replied at [[User talk:Active Banana]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:28, 13 September 2010 (UTC)<br />
::My "expertise" ends at the fact that this list appears in [[Kamen Rider Ryuki]]. I am not sure what is the best way to centralize an organized discussion when the content under question keeps getting shuttled around to other articles, with several AfD's already in progress. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:32, 13 September 2010 (UTC)<br />
<br />
== Re: Mission Dolores mural ==<br />
<br />
I have removed the COI several times now, because I am handling this issue and I am working with Ben to resolve any problems. Please use the talk page to explain any continuing problems as you see them. As a fully disinterested third party, I don't see a need for editors to keep adding maintenance tag when others are aware of the issue and are working to resolve any outstanding issues. Furthermore, there is nothing wrong with experts working on Wikipedia in their field, so the repeated adding of this tag does not help the working environment or encourage good faith. If there are COI problems that nobody has handled, use the talk page and explain them. I don't understand why editors think it helps to keep adding the tag. The COI is already explained on the talk page with the notable editor tag. Please review it. [[User:Viriditas|Viriditas]] ([[User talk:Viriditas|talk]]) 21:41, 13 September 2010 (UTC)<br />
:Alright, sounds good, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:42, 13 September 2010 (UTC)<br />
<br />
== Question ==<br />
<br />
I'm curious as to why, after being told multiple times that you ''were'' notified of the AN thread, that you [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard&diff=prev&oldid=384668039 asserted] on AN that I had not notified you. Your [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384660341 response] to Giftiger wunsch's statement [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384659677 here] appears to acknowledge that I notified you. Did you miss not only the notification I left on your talk page but also the multiple clarifications from Giftiger wunsch and me? [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 22:45, 13 September 2010 (UTC)<br />
:You are correct. I am sorry about that. I apologize. It was a mistake on my part. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:46, 13 September 2010 (UTC)<br />
<br />
== [[:File:Kamen rider eurodata.png]] ==<br />
<br />
I've removed the free copyright tags from this image. Do you think perhaps you could unlist it from "possibly unfree images" as it has been determined a year or so ago that it is actually not free?—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 23:27, 13 September 2010 (UTC)<br />
:Commented there. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:26, 14 September 2010 (UTC)<br />
<br />
== Deshastha Brahmin ==<br />
<br />
Hi Cirt - this is regarding the recent GAR for [[Deshastha Brahmin]] article. Do you have any comments on this [[Talk:Deshastha_Brahmin/GA1]]. Thanks. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 03:26, 14 September 2010 (UTC)<br />
:I would strongly recommend another [[WP:PR|peer review]], first, then renominating to try for [[WP:GAN]]. If you wish, you can keep me apprised, and I would be happy to take another look at the article once it is at the peer review stage, after those remaining issues have been fixed. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:59, 14 September 2010 (UTC)<br />
::No problem, I will make the changes, do the peer review then re-nominate. I appreciate your time on this. Thanks for the feedback, it has been helpful. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:11, 14 September 2010 (UTC)<br />
:::Please, feel free to keep me posted, I can check back in on it at that later stage. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:11, 14 September 2010 (UTC)<br />
::::Will do so. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:13, 14 September 2010 (UTC)<br />
:::::Okay, thanks! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:15, 14 September 2010 (UTC)<br />
<br />
== Quick demo of puppet functioning admin ==<br />
Cirt, you don't have real power and not free in your decisions regarding nomination and deleting the articles. You have a puppet master who telling you what to do. Look at the article describing [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It is published more than 3 years ago. It has no references since then and no explanation. It speaks about algorithm presumably implemented in [http://www.msoftware.co.nz/products/winrk WinRK] data compression software but WinRK did not say a word about algorithm. However WinRK is a corporation with influence and should you remove this article you yourself will be removed from admin position. Is that correct? <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:26, 14 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:The article, [[WinRK]], was previously deleted by two admins, {{user|Geni}} and {{user|Rjd0060}}. Not sure what you mean by the rest, the language used in the above comment is unclear, perhaps you could be more specific? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:31, 14 September 2010 (UTC)<br />
::How can you explain that article is back there? What I mean by the language that someone else decided what is deleted and what stays in Wikipedia not you. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 04:38, 14 September 2010 (UTC)<br />
:::Please read [[WP:AFD]]. Then please read [[WP:OTHERSTUFFEXISTS]]. Thank you, -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:40, 14 September 2010 (UTC)<br />
::::You move discussion to wrong direction. You make it look like my article is wrong and I try to keep it by pointing to other junk. That is not correct. My article was right and even ROLZ topic is right. ROLZ algorithm is perfect. The article about ROLZ is junk not the algorithm and this junk stays and you can not remove it because you are nobody. And there were other who tried to remove but because they do not make decision here as well the article is restored. Now, do not pretend that you are important person but tell us all who in Wikipedia has real power? <br />
[[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 08:26, 14 September 2010 (UTC)<br />
<br />
== Nomination of [[Joan Holmes]] for deletion ==<br />
<br />
<div class="floatleft" style="margin-bottom:0">[[File:Ambox warning pn.svg|42px]]</div>A discussion has begun about whether the article [[Joan Holmes]], which you created or to which you contributed, should be [[Wikipedia:Articles for deletion| deleted]]. While contributions are welcome, an article may be deleted if it is inconsistent with Wikipedia policies and guidelines for inclusion, explained in the [[Wikipedia:Deletion policy|deletion policy]].<br />
<br />
The article will be discussed at [[Wikipedia:Articles for deletion/Joan Holmes]] until a consensus is reached, and you are welcome to contribute to the discussion.<br />
<br />
You may edit the article during the discussion, including to address concerns raised in the discussion. However, do not remove the article-for-deletion template from the top of the article. [[User:Wolfview|Wolfview]] ([[User talk:Wolfview|talk]]) 04:36, 14 September 2010 (UTC)</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Cirt&diff=384724207User talk:Cirt2010-09-14T04:38:39Z<p>C-processor: /* Quick demo of puppet functioning admin */</p>
<hr />
<div>{{User:Cirt/Contributions}} <br />
{{User:MiszaBot/config<br />
|maxarchivesize = 250K<br />
|counter = 12<br />
|minthreadsleft = 5<br />
|algo = old(7d)<br />
|archive = User talk:Cirt/Archive %(counter)d<br />
}}<br />
{{talkheader}}<br />
{{WikiProjectGATasks}} <br />
{| align=lef !important;<br />
|{{cent|float=left|width=100%}}<br />
|{{Signpost-subscription}}<br />
|}<br />
{| align=lef !important;<br />
|[[WP:AFD/T|AFD/T]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-7 days}}|T-7]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-2 days}}|T-2]] • [[WP:AFDO|AFDO]] • [[WP:AIV|AIV]] • [[CAT:RFUB|RFUB]] • [[WP:UAA|UAA]]/[[CAT:UAA|CAT]] • [[WP:RFPP|RFPP]] • [[CAT:PER|PER]] • [[CAT:CSD|CSD]] • [[CAT:AB|AB]] • [[WP:FAR|FAR]] • [[User:Deckiller/FAC urgents|FAC urgents]] • [[WP:TFAR|TFAR]] • [[WP:RSN|RSN]] • [[WP:BLPN|BLPN]] • [[WP:FTN|FTN]] • [http://www.google.com/custom?domains=en.wikipedia.org&sitesearch=en.wikipedia.org Google Search] {{Wikipedia:Bureaucrats' noticeboard/RfA Report}}<br />
|}<br />
__TOC__<br />
<br />
== Other neat portal ideas for longer term ==<br />
<br />
* Longer term ideas to think about from other portals:<br />
#'''Events''' section, like: "On this day" e.g., [[Portal:Biography|Biography]], [[Portal:Religion|Religion]], [[Portal:United States|United States]]; "Selected anniversaries" e.g., [[Portal:War|War]]; "Calendar" at [[Portal:Holidays|Holidays]]. Interesting idea of "Month selected anniversaries", at [[Portal:Oregon|Oregon]]. <br />
#Model intro with some rotating images, after [[Portal:Oregon]], [[Portal:Indiana]], [[Portal:Iceland/Intro]] and [[Portal:Philosophy of science/Intro]]. <br />
#Revamp DYK sections w/ free-use images, model after [[Portal:Criminal justice]] and [[Portal:Oregon]].<br />
#Portal palettes at [[User:RichardF/Palettes/Portals]]. Comparable color schemes can be developed from the various hue lists at [[User:RichardF/Palettes]]. Also see [[Portal:Box-header]].<br />
#If there are a lot of categories, then categories section to 2 columns, like in [[Portal:Indiana]].<br />
#:Also take some time to check out style/formatting at [[Portal:Indiana]] '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Note to self ==<br />
<br />
*[http://toolserver.org/~magnus/makeref.php MakeRef]<br />
*[http://toolserver.org/~dispenser/view/Reflinks Reflinks]<br />
*[http://reftag.appspot.com/ Citation tool for Google Books] <br />
*[http://reftag.appspot.com/doiweb.py Citation tool for DOIs]<br />
*[[Wikipedia:Wikipedia Signpost/2010-09-06/Dispatches|Tools, part 1: References, external links, categories and size]]<br />
<br />
[[Wikipedia:Verifiability#Sources|independent]] [[Wikipedia:Reliable sources|reliable]] [[Wikipedia:No original research#Primary, secondary and tertiary sources|secondary sources]]<br />
<br />
*[[User:Citation bot/use]]<br />
<br />
*{{tl|findsources}}<br />
<br />
;Cite templates<br />
<pre><br />
<ref>{{cite book| last = | first = | authorlink = | coauthors = | title = | publisher = | year = | location = | page = | url = | doi = | id = | isbn = }}</ref><br />
<br />
<ref>{{cite news| last = | first = | coauthors = | title = | work = | language = | publisher = | page = | date = | url = | accessdate = }}</ref><br />
<br />
<ref>{{cite journal|last =| first=| authorlink=| coauthors=|title=|journal=|volume=|issue=|page=|publisher=|location = | date = | url = | doi = | id = | accessdate = }}</ref><br />
<br />
<ref>{{cite web| last = | first = | authorlink = | coauthors = | title = | work = | publisher = | date = | url = | format = | doi = | accessdate = }}</ref><br />
</pre><br />
<br />
;Citation model<br />
[[The Simpsons (season 3)]]<br />
;Body text in-cite<br />
<pre><br />
<ref name="REFNAME">[[#LASTNAME|LASTNAME]], p. PAGENUMBER</ref><br />
</pre><br />
;References section<br />
(reference template from [[WP:CIT]])<br />
<pre><br />
*<cite id=LASTNAME>REFERENCE</cite><br />
</pre><br />
<br />
;Different model<br />
*[[Template:Citation]]<br />
*[[Template:Harvnb]]<br />
*<nowiki>Example: <ref name="REFNAME">{{Harvnb|LAST|YEAR|p=PAGENUMBER}}</ref></nowiki><br />
See models at [[The General in His Labyrinth]] and [[Mario Vargas Llosa]]. <br />
<br />
::[http://en.wikipedia.org/w/index.php?title=User_talk:Jbmurray&oldid=242692603#Citation_formatting_help.3F More info]. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
More at [[Wikipedia:Harvard citation template examples]]. <br />
:And [[Template talk:Harvard citation no brackets]]. <br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Dispatch ==<br />
<br />
Cirt, [http://en.wikipedia.org/wiki/Wikipedia_talk:FCDW#Suggestion_for_a_dispatch Awadewit suggested that] you might be interested in writing a [[WP:SIGNPOST|Signpost]] [[WP:FCDW|Dispatch]] article on Featured portals (the only area of featured content we haven't covered). Sample previous articles are at {{t1|FCDW}}. We've covered:<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-31/Dispatches|Featured content overview]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-17/Dispatches|Peer review]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-02/Dispatches|Did you know]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-12/Dispatches|Featured lists]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-19/Dispatches|Good articles]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-26/Dispatches|Featured sounds]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-09-08/Dispatches 1|Featured topics]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-13/Dispatches|Images]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-08-18/Dispatches|TFA]]<br />
* And Featured articles many times: [[Wikipedia:Wikipedia Signpost/2008-07-21/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-04-07/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-10-13/Dispatches]]<br />
<br />
None of them start out looking like that: if an editor initially just chunks in some text, many others chip in to tweak it up to Signpost standards. For example, someone wrote [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-08/Dispatches&oldid=249522488 this,] which Karanacs, Royalbroil and I turned into [[Wikipedia:Wikipedia Signpost/2008-11-08/Dispatches|this]], so if you just chunk in some text as a start, others can help finish it off. Another example, I put in [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-10/Dispatches&oldid=249800192 this outline,] and Karanacs brought it up to [[Wikipedia:Wikipedia Signpost/2008-11-10/Dispatches|this]]. Other editors have written almost complete and clean Dispatches without much need for other editing. If you're interested, please weigh in and coordinate at [[WT:FCDW]] In case you're interested, you could just begin sandboxing something at [[WP:FCDW/Portals]] and pop over to [[WT:FCDW]] to leave a note when you're ready for others to help out. Regards, [[User:SandyGeorgia|Sandy<font color="green">Georgia</font>]] ([[User talk:SandyGeorgia|Talk]]) 19:26, 17 November 2008 (UTC)<br />
:Will mull this over and most likely draft something up. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 11:54, 18 November 2108 (UTC)<br />
== Razzies progress ==<br />
<br />
*[[15th Golden Raspberry Awards]] through [[29th Golden Raspberry Awards]] = reformatting process done.<br />
**Note: Going to have to go back and model these after the modifications made subsequently to [[29th Golden Raspberry Awards]].<br />
*[[29th Golden Raspberry Awards]] - so far only one expanded with sourcing research. ([[WP:FL]])<br />
*[[Razzie Award for Worst New Star]] = reformatting process done, next to use '''[[Talk:Razzie Award for Worst Picture]]''' as model to reformat other pages in [[:Category:Golden Raspberry Awards by category]] (with subsection breaks by decade)<br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== AN/I: False accusations of vandalism ==<br />
<br />
Hello. This message is being sent to inform you that there currently is a discussion at [[Wikipedia:Administrators' noticeboard/Incidents]] regarding an issue with which you may have been involved. <!--Template:ANI-notice--> Thank you. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Ovadyah|Ovadyah]] ([[User talk:Ovadyah|talk]] • [[Special:Contributions/Ovadyah|contribs]]) </span></small><!-- Template:Unsigned --><br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:57, 31 August 2010 (UTC)<br />
<br />
While on the subject, a portion of my 4 September edit of the [[Oksana Grigorieva]] entry was reverted with the comment "fix prev vandalism." I don't have a problem with the reversion, but I don't feel the "vandalism" label was warranted. [[User:Cmholm|Cmholm]] ([[User talk:Cmholm|talk]]) 10:58, 6 September 2010 (UTC)<br />
:That was not meant to refer to you, sorry. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:42, 6 September 2010 (UTC)<br />
<br />
== Betamax VOIP ==<br />
<br />
Can someone please explain to me why this page was deleted? It had a ready reference to all the various products available from Betamax. This was not as someone has said marketing because its actually not in Betamax's interest to have this page published...a little basic economics will tell you this. Each of the products competes with the others...in different markets. Its like having a DVD available in 15 different countries. This page told you which countries it was available in so that you could check the prices in each country and then buy it from the cheapest! There was no hint of marketing in the article it was purely informational and very useful too! If listing out all the products a company sells is marketing then I can think of a lot of pages on large Multinational Companies that will also have to be deleted.<br />
<br />
Hope someone will see the light.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:09, 2 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:I would suggest first you register for an account on Wikipedia. Then, you could work on a proposed draft version, within a subpage of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:44, 2 September 2010 (UTC)<br />
<br />
I am not proposing to work on a new draft I am proposing that the old article be reinstated. I have not written the previous article nor am I connected with Betamax in anyway. I am a user who found that article extremely useful and was quite disappointed to find the article deleted and also the reasons for the deletion. I don't have either the technical expertise or the time to learn how to discuss these things on Wikipedia however I don't see that as a reason to stay muted. I apologise if I haven't followed any protocl etc that is required here but I think I've made my point. Can you please review the previously deleted article and view it in the new light as I have suggested and I am sure that you will find that it is a neutral article written purely for the purposes of keeping the public informed and helping them make informed choices.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:49, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:You might find it worthwhile to at the very least attempt to try the recommended suggestion, above. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:43, 6 September 2010 (UTC)<br />
<br />
You are recommending that I open an account! Is this some devious scheme to get more people to sign up? Do you get some kind of commission for that? This discussion is against the spirit that Wikipedia was founded on! All I am asking is that you reconsider your decision...as a neutral party. I think you've been too harsh. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 09:41, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
== Proposed Quidco article ==<br />
<br />
Hi again, I've made some additions to the proposed Quidco article on my Talk page at http://en.wikipedia.org/wiki/User_talk:Stuartcoggins#Proposed_Quidco_article and was wondering if you could take another look? Many thanks, Stuart<br />
<br />
[[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 16:02, 3 September 2010 (UTC)<br />
:Try working on it on a separate page, at [[User:Stuartcoggins/Sandbox]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:30, 3 September 2010 (UTC)<br />
::Thank you, I've now moved the article to http://en.wikipedia.org/wiki/User:Stuartcoggins/Sandbox and developed it a little more. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 11:18, 7 September 2010 (UTC)<br />
:::If the article requires more development, please let me know. Alternatively, if the article that was in place just prior to deletion could be restored, I think that was a well-written and neutral piece, so if that were possible, that would be great. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:06, 7 September 2010 (UTC)<br />
::::Needs to demonstrate significant coverage in reliable secondary sources independent of the subject, per [[WP:NOTE]]. Please also read [[WP:RS]], [[WP:V]], and [[WP:CITE]] and [[WP:CIT]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:54, 7 September 2010 (UTC)<br />
:::::Thank you, I will work on that and get back to you. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:56, 7 September 2010 (UTC)<br />
::::::Okay, sounds good. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:29, 7 September 2010 (UTC)<br />
<br />
== Living Control ==<br />
<br />
You deleted a page for Living Control. This is an important page as the company has gone in administration. Therfore several groups are being setup with links to support and advice over this matter and products. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/86.145.140.29|86.145.140.29]] ([[User talk:86.145.140.29|talk]]) 10:45, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you first create an account. Then, you could work on a proposed draft version, within a subpage of your userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:42, 6 September 2010 (UTC)<br />
<br />
== AFD closure ==<br />
<br />
While [[Wikipedia:Articles for deletion/Johanna Carreño]] was closed correctly based on the circumstances that existed at the time (unreferenced BLP, nothing turned up in the AFD), there's actually a lot of coverage of this girl in the Spanish-language press [http://www.eltiempo.com.ec/noticias-cuenca/2216-johanna-carrea-o-nominada-a-los-mtv/] [http://www.eluniverso.com/2008/09/11/0001/259/6E4FD68CBB984AA59FFEA7FC88CC7DF1.html] [http://www.eluniverso.com/2008/07/31/0001/259/A822E5B225474BA8B7A838DF78FD23B8.html]. Restoring the article might be more efficient than starting over. [[User:Peter Karlsen|Peter Karlsen]] ([[User talk:Peter Karlsen|talk]]) 01:29, 7 September 2010 (UTC)<br />
:I would be most willing to provide it, in your userspace as a subpage, so you could work on a proposed draft version. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:46, 7 September 2010 (UTC)<br />
::That would be great, thanks. [[User:Peter Karlsen|Peter Karlsen]] ([[User talk:Peter Karlsen|talk]]) 01:48, 7 September 2010 (UTC)<br />
:::{{done}}, now at [[User:Peter Karlsen/Johanna Carreño]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 02:55, 7 September 2010 (UTC)<br />
<br />
== Deletion of [[Lilias Rider Haggard]] article ==<br />
<br />
Hi,<br />
I was just wondering why this article was deleted after I provided a second reference and more biographical details. <br />
<br />
Thank you. <br />
[[Jcspurrell]] <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]] • [[Special:Contributions/Jcspurrell|contribs]]) 16:26, 7 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:Was deleted, after deletion discussion at [[WP:AFD]] process, here [[Wikipedia:Articles for deletion/Lilias Rider Haggard]]. Would be willing to provide a copy, as a subpage within your userspace, if you wish to work on a proposed draft version. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:31, 7 September 2010 (UTC)<br />
<br />
Hi,<br />
<br />
Thank you for your comments. However, I do still do not understand why the article was deleted. In the discussion, I said that I would provide more references and information. I began to do so, but the article was deleted before I had time to finish. If possible, I would like to take you up on your offer of working on a draft version on a subpage within my userspace so that I can continue to add information as and when I have time.<br />
<br />
Many thanks.<br />
<br />
Jcspurrell<br />
[[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 20:54, 13 September 2010 (UTC)<br />
:{{done}}, now at [[User:Jcspurrell/Lilias Rider Haggard]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 20:56, 13 September 2010 (UTC)<br />
<br />
Thank you. [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 21:19, 13 September 2010 (UTC)<br />
:You are most welcome! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:19, 13 September 2010 (UTC)<br />
<br />
== Tiny Ross ==<br />
<br />
I see you deleted this as a hoax? He may not be notable, and I have no idea whether the details in the article were true, but he was certainly a real actor and appeared in three films, most notably ''[[Time Bandits]]''... Was hoax really the right criteria to delete this article? [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:07, 7 September 2010 (UTC)<br />
:Feel free to recreate it, seems it was created in this instance, by a problem user. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:11, 7 September 2010 (UTC)<br />
<br />
::Nah, there's not really enough biographical data available. It's possible that the content was completely made up. The only real reliable source is a book on Monty Python and it only includes him in a cast list, no details. [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:14, 7 September 2010 (UTC)<br />
<br />
== The Military history WikiProject Newsletter : LIV (August 2010) ==<br />
<br />
{{WPMILHIST Newsletter header|LIV|August 2010| }}<br />
{| style="width: 100%;"<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Project news</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Project news|The return of reviewer awards, task force discussions, and more information on the upcoming coordinator election]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Articles</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Articles|A recap of the month's new Featured and A-Class articles, including a new featured sound]]''<br />
<br />
|-<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Members</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Members|Our newest A-class medal recipients and this August's top contestants]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Editorial</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Editorials|In the first of a two-part series, Moonriddengirl discusses the problems caused by copyright violations]]''<br />
<br />
|-<br />
| valign="top" colspan="2" style="padding: 0.5em; text-align: center; font-size: 85%; " |<br />
To change your delivery options for this newsletter please list yourself in the appropriate section [[Wikipedia:WikiProject Military history/News/Options|here]]. To assist with preparing the newsletter, please visit the [[Wikipedia:WikiProject Military history/Coordinators/Strategy think tank/News and editorials division|newsroom]]. [[User:BrownBot|BrownBot]] ([[User talk:BrownBot|talk]]) 23:04, 7 September 2010 (UTC)<br />
|}<br />
<br />
== Housekeeping ==<br />
<br />
Hello - you closed [[Wikipedia:Articles for deletion/Caesar Takeshi|this AfD]] as keep, however the AfD template is still displaying on the [[Takeshi Caesar|article page]]. --[[User:Ponyo|<b><font color="Navy">''Jezebel's''</font></b><font color="Navy">Ponyo</font>]]<sup>[[User_talk:Ponyo|<font color="Navy">''shhh''</font>]]</sup> 18:34, 8 September 2010 (UTC)<br />
:{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
<br />
== Selena FAC ==<br />
<br />
I think I took care of most of the concerns, the article is rather short because she had a short career, and I want to stick to the basics, not add extra information about her tours, etc. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 03:54, 9 September 2010 (UTC)<br />
:Link please? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
[[Wikipedia:Featured article review/Selena/archive1]] [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 18:34, 9 September 2010 (UTC)<br />
: I added citations where I could removed where I couldn't find it in the book, and beefed up the article just a little bit, I don't want to go into overdetail. Thanks [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 23:03, 12 September 2010 (UTC)<br />
: I reworded it to impact and merged the two sentence paragraph. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 14:35, 13 September 2010 (UTC)<br />
::{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:38, 13 September 2010 (UTC)<br />
::: I may need your help, I already broke 3RR on Selena trying to keep it as reliable as possible, protect the page please so the revert war will [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 22:42, 13 September 2010 (UTC)<br />
::::I will request full prot, at [[WP:RFPP]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:43, 13 September 2010 (UTC)<br />
<br />
== Blocking dummy available ==<br />
<br />
Wow, you're following up on some of my old COI tags. At this rate, you'll be the blocking king at the end of the night. Too bad I haven't been too active lately but there are a couple of recent ones from the past week. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:35, 9 September 2010 (UTC)<br />
:Heh, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:37, 9 September 2010 (UTC)<br />
::You're laughing and I'm serious! When I sometimes go on a Recent changes patrol, some of those COI jokers will find a nice little tag on their talkpage. I could make [[Rosey Grier]] look like a toothpick when I go plowing through; hence the blocking dummy would be me. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:50, 9 September 2010 (UTC)<br />
:::[[Rosey Grier]] is a cool dude, per [[Portal:Textile arts/Selected quote/2]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:52, 9 September 2010 (UTC)<br />
::::It's kind of funny but that whole Ram front four had a very humanistic, in touch with their inner spirit side. Now, call them a pansy to their face and you might be missing some teeth. My Dad used to force me to watch his "Lambs". He always swore at [[Roman Gabriel]] whenever they started losing. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 05:01, 9 September 2010 (UTC)<br />
:::::Picking up from where you left on yesterday? I wonder how many users I tagged with COIs in June and July. I'll try to work on September tonight so that you'll have something to do in a month or so. ;_) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 00:59, 10 September 2010 (UTC)<br />
::::::Okay, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:00, 10 September 2010 (UTC)<br />
{{od}}<br />
Now serving number one. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:19, 10 September 2010 (UTC)<br />
:Now serving number two. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:42, 10 September 2010 (UTC)<br />
::When you get to August, let me know. Looks like you're working July now. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:21, 11 September 2010 (UTC)<br />
:::Not sure what you mean by the other above messages. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 11 September 2010 (UTC)<br />
::::Which ones? If you're talking about number one and number two, the first was a COI who became or was a sock of number two that I saw later last night. Another admin blocked them at [[Wikipedia:Sockpuppet investigations/EdwinHarbor]]. Otherwise, you've been clearing up some of COI usernames dating back awhile. I noticed that you did several today as well. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:27, 11 September 2010 (UTC)<br />
:::::Oh, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:27, 11 September 2010 (UTC)<br />
::::::No, thank you. I noted that you went to May, moved to June and did some from July. September's been a little slow but I'm working on it. ;) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:30, 11 September 2010 (UTC)<br />
:::::::Sounds good, -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:32, 11 September 2010 (UTC)<br />
<br />
== Featured Portal review ==<br />
<br />
Hey Cirt. Can you close [[Portal:Business and economics]] [[Wikipedia:Featured portal review/Business and economics|FPR]]? There hasn't been any edits on the article since August 3rd and there's still problems to it. [[User:GamerPro64|GamerPro64]] ([[User talk:GamerPro64|talk]]) 20:55, 9 September 2010 (UTC)<br />
:Left notes for a couple users. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 23:07, 9 September 2010 (UTC)<br />
<br />
== Dammit Cirt ==<br />
<br />
You beat me to all my closes today :( (at least we agreed on them) --[[User:Ron Ritzman|Ron Ritzman]] ([[User talk:Ron Ritzman|talk]]) 00:23, 10 September 2010 (UTC)<br />
:Sorry, and great! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:24, 10 September 2010 (UTC)<br />
<br />
== A Very Merry Unauthorized Children's Scientology Pageant ==<br />
<br />
Hello, I have discovered this article by sheer luck and I have found it very interesting. The idea of this musical is just awesome ! It would be too bad if I did not try to translate it. Now, this play have at least one article in french :) Dosto [[Special:Contributions/86.71.74.243|86.71.74.243]] ([[User talk:86.71.74.243|talk]]) 01:26, 11 September 2010 (UTC)<br />
:Thank you! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== There was no Russia in 1970. ==<br />
<br />
It was called the Russian SFSR-the Russian Soviet Federative Socialist Republic. That's common knowledge. That doesn't need to be cited. Don't dumb down Wikipedia. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/139.84.242.65|139.84.242.65]] ([[User talk:139.84.242.65|talk]]) 02:00, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Please discuss, at [[Talk:Oksana Grigorieva]], thanks. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== OneVietnam Network, previously deleted--can it be put up again? ==<br />
<br />
Hi, a couple of months ago I created a page for OneVietnam Network. It was deleted because there were doubts on its significance and there was a lack of coverage on it. Since then, there has been a lot of new coverage on OneVietnam Network. If I want to create the page again, do I have to go through you (the deleting admin), or is it okay if I save new page again? Thank you very much for your time. [[User:Clockmonster|Clockmonster]] ([[User talk:Clockmonster|talk]]) 03:39, 11 September 2010 (UTC)<br />
:I would suggest first working on it, as a proposed draft version, within a subpage off of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:40, 11 September 2010 (UTC)<br />
<br />
== AfD closure of [[EXtremeDB]] ==<br />
<br />
You are invited to join the discussion at [[Wikipedia:Editor_assistance/Requests#Request_re_EXtremeDB]]. I'm sorry that the discussion there has got rather long. I think the relevant point is that in [[Wikipedia:Articles_for_deletion/EXtremeDB|this AfD]] you may have overlooked the nominator's withdrawal of the nomination. -- [[User:John of Reading|John of Reading]] ([[User talk:John of Reading|talk]]) 16:25, 11 September 2010 (UTC)<br />
:Nod, the user is welcome to come to me, here. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:06, 12 September 2010 (UTC)<br />
<br />
== Old username concerns ==<br />
<br />
Hi Cirt - You seem to be doing a great job of cleaning up (blocking) the old usernames that I have tagged as concerns. I am just wondering if you have any script or any dated category or if you are just going through the overall username category manually. I was going to use AWB to do the same, but if you've already found a good semi-automated way of doing it I'll let you finish (or I'm happy to replicate what you are doing). Let me know. Thanks. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 00:08, 12 September 2010 (UTC)<br />
:Was doing it manually, without a script. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:05, 12 September 2010 (UTC)<br />
::Ok - thanks. Can tell you are busy with it, because you show up as like half of my watchlist edits. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 03:18, 12 September 2010 (UTC)<br />
:::Heh, thanks for the kind words! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 12 September 2010 (UTC)<br />
<br />
== Review request ==<br />
<br />
Hello, Cirt. I'm posting here as I saw you were online while watching recent changes. Coincidentally, (your username popped up blocking for a username) this is regarding a [http://en.wikipedia.org/w/index.php?title=User_talk:Gingerbakercorp&diff=384321318&oldid=384280172 username] block I recently executed. If you have the time, would you check to make sure the block was warranted and executed properly? Feel free to undo my block or alter it as you see fit. Let me know and I'll make any apology to the user that's needed. Thanks [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:21, 12 September 2010 (UTC)<br />
:Responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 12 September 2010 (UTC)<br />
<br />
::Thanks for the quick action. See ya 'round [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:29, 12 September 2010 (UTC)<br />
:::You are most welcome. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:30, 12 September 2010 (UTC)<br />
<br />
== Your [[WP:GA|GA]] nomination of [[Lady Gaga: Queen of Pop]] ==<br />
<br />
The article [[Lady Gaga: Queen of Pop]] you nominated as a [[Wikipedia:Good article nominations|good article]] has been placed on hold [[Image:Symbol wait.svg|20px]]. The article is close to meeting the [[WP:GA?|good article criteria]], but there are some minor changes or clarifications needed to be addressed. If these are fixed within seven days, the article will pass, otherwise it will fail. See [[Talk:Lady Gaga: Queen of Pop]] for things which need to be addressed. [[User:Jezhotwells|Jezhotwells]] ([[User talk:Jezhotwells|talk]]) 10:52, 12 September 2010 (UTC)<br />
:Thanks, responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 18:18, 12 September 2010 (UTC)<br />
<br />
== Request for clarification ==<br />
<br />
A request for clarification [http://en.wikipedia.org/w/index.php?title=Wikipedia:Arbitration/Requests/Clarification&oldid=384453348] has been filed per [http://en.wikipedia.org/wiki/Wikipedia:Arbitration/Requests/Enforcement/Archive66#User:TimidGuy_and_User:Littleolive_oil_and_User:Edith_Sirius_Lee] Although it may not affect you directly, your name has been mentioned or referenced.([[User:Littleolive oil|olive]] ([[User talk:Littleolive oil|talk]]) 20:39, 12 September 2010 (UTC))<br />
<br />
== Deletion of article Polar Tree ==<br />
<br />
You deleted my article Polar Tree. Obviously to me the procedure of deleting of articles in Wikipedia is hypocritical with fake and orchestrated discussion similar to mid centuries inquisition court when executed heretic was provided the right to express his views before the judges who already made decisions. In my case the article described modification of known algorithm in data compression. This is not new research but slight modification of old research leading to certain benefits - that means no original research. I provided two independent links. One link to Google site where software developer incorporated my algorithm to his program and achieved certain benefits. Another link from expert in data compression Matt Mahoney who maintain largest data compression benchmark. On his site Matt reexplained my algorithm to readers confirming by this action the novelty, because all other known algorithms on his site not explained but mentioned. The individual that suggested to remove the article changed his opinion on the opposite and suggested to keep the article. The other two reviewers suggested to ask expert opinion. At this point someone who orchestrated the deleting of the article saw that well orchestrated action failing brought new player [[User:Whpq|Whpq]] who is totally incompetent in the subject and has many 5 lines articles about nothing. When another new vote was obtained you deleted the article. <br />
I can explain why I believe that Wikipedia orchestrated the deletion. My references are real, strong and independent. People found my algorithm without my soliciting. It is much better than publication in the journal because articles are sent by authors to the journals where one of the authors was previously published and sending is backed up by set of phone calls to editor-in-chief. It is arranged. Frequently the author without connection include the co-author with connections for the article to be published. In my case the researcher not just approved but took the algorithm and implemented it into a software. Needless to say that 99% of what is published in technical journals is junk that never implemented by anyone. When discussion went into wrong direction new member [[User:Whpq|Whpq]] appeared out of nowhere. And what is the reason that this individual having no idea about data compression suddenly read my article about data compression checked my references and found them unreliable. Look at what he writes - the data compression is out of his interest. The explanation is simple he was told to look and provide an opinion necessary to have an excuse to delete the article. I can also explain why I believe that decisions are made by some man in the shadow. During discussion I pointed out the other article as classical example of material without notability, references and even explanation. It is article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. Why all these critics that are very far from data compression found my article and did not notice the other article about data compression, that has no references at all and does not even provide an explanation and stay in Wikipedia over 2 years. The answer is simple. Because they were not told to do that. I mentioned in discussion that there is nothing wrong with ROLZ algorithm, but it is not publicly explained so there is notability issue, no references, not at all, nothing because it was proprietary, it was not published. <br />
Since I have my own web site where I can publish everything I decide. I will write an article about process of evaluation the articles in Wikipedia. My conclusion that articles must get back door approval by someone in control through connections otherwise independently on provided references they will be deleted and references will be announced unreliable. As scientist I have one role to deliver the people the explanation how the world is functioning. This is what scientists normally do. I think I have to explain to visitors of my site that publications in Wikipedia are arranged through the back door leading to administration that will help people to make right solution, avoid wasting time and so on. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 04:42, 13 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you register an account, then you could work on a proposed draft version, within a subpage of your userspace page. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== Crumplezone ==<br />
<br />
HEY YOU, WHY ARE YOU DELETING [[Crumplezone]], AND YOU ARE NOT SUPPOSED TO BE DELETED DO YOU UNDERSTAND!!?? [[User:75.142.152.104|75.142.152.104]] ([[User talk:75.142.152.104|talk]]) 04:50, 13 September 2010 (UTC)<br />
:Please read [[WP:AFD]], then [[Wikipedia:Articles for deletion/Crumplezone]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== FAR ping ==<br />
<br />
Hi Cirt - Could you please revisit your comments at the FARs for [[Selena]] and [[Michael Brown Okinawa assault incident]]? Also the one for [[Gliding]] - more specificity is needed regarding the sections you believe should be expanded: what information do you think is missing? Thank you, [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 13:06, 13 September 2010 (UTC)<br />
:{{done}}! Also, [[User:Dana boomer|Dana boomer]], I wanted to thank you for the courteous, polite, and kind way in which you have approached me to inquire about this - it is a rare and most appreciated quality. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:29, 13 September 2010 (UTC)<br />
::Awesome, thanks for the quick response! (And you're welcome!) [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 14:51, 13 September 2010 (UTC)<br />
<br />
==Deletion review for [[Topsite (www)]]==<br />
An editor has asked for a [[Wikipedia:Deletion review#Topsite (www)|deletion review]] of [[Topsite (www)]]. Because you closed the deletion discussion for this page, speedily deleted it, or otherwise were interested in the page, you might want to participate in the deletion review. <!-- This originally was from the template {{subst:DRVNote|PAGE_NAME}} ~~~~ -->''[[User:Rich Farmbrough|Rich]]&nbsp;[[User talk:Rich Farmbrough|Farmbrough]]'', 15:04, 13 September 2010 (UTC).<br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:06, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Is there a reason you are now systematically sending perfectly notable subjects to deletion, other than the fact you thought I was rude to you on your talk page? Two films that were released in theaters in another nation are indeed notable.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:01, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:03, 13 September 2010 (UTC)<br />
::They are '''movies'''. They are notable. These articles are also '''just made'''. Give us time to work on the articles before sending everything into the trashbin.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:04, 13 September 2010 (UTC)<br />
:::The use of '''bold''' is not necessary. The articles could have been worked on in userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== Ryulong ==<br />
<br />
I'm terribly sorry to bother you about this, but Ryulong is concerned that you're AfDing articles that he created as a gesture of retaliation for his poor word choice on your usertalk; he's also quite distressed that this is happening when he's stuck on poor-grade WiFi and therefore can't really participate in the AfDs.<br />
<br />
Could you do something to assuage these concerns? Thank you. [[User:DragonflySixtyseven|DS]] ([[User talk:DragonflySixtyseven|talk]]) 21:03, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== AN discussion regarding username blocks ==<br />
<br />
Please see [http://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard#Nipples_-_I_have_two.2C_how_about_you.3F here]. Thanks. [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 21:08, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Perhaps a mass nomination is in order?<br />
* [[Kamen Rider Knight]]<br />
* [[Kamen Rider Ryuki (character)|Kamen Rider Ryuki]]<br />
* [[Kamen Rider Scissors]]<br />
* [[Kamen Rider Zolda]]<br />
* [[Kamen Rider Raia]]<br />
* [[Kamen Rider Gai]]<br />
* [[Kamen Rider Ouja]]<br />
* [[Kamen Rider Tiger]]<br />
* [[Kamen Rider Imperer]]<br />
* [[Kamen Rider Femme]]<br />
* [[Kamen Rider Ryuga]]<br />
* [[Kamen Rider Verde]]<br />
* [[Kamen Rider Odin]]<br />
[[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:26, 13 September 2010 (UTC)<br />
:To {{user|Active Banana}} - Agreed, replied at [[User talk:Active Banana]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:28, 13 September 2010 (UTC)<br />
::My "expertise" ends at the fact that this list appears in [[Kamen Rider Ryuki]]. I am not sure what is the best way to centralize an organized discussion when the content under question keeps getting shuttled around to other articles, with several AfD's already in progress. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:32, 13 September 2010 (UTC)<br />
<br />
== Re: Mission Dolores mural ==<br />
<br />
I have removed the COI several times now, because I am handling this issue and I am working with Ben to resolve any problems. Please use the talk page to explain any continuing problems as you see them. As a fully disinterested third party, I don't see a need for editors to keep adding maintenance tag when others are aware of the issue and are working to resolve any outstanding issues. Furthermore, there is nothing wrong with experts working on Wikipedia in their field, so the repeated adding of this tag does not help the working environment or encourage good faith. If there are COI problems that nobody has handled, use the talk page and explain them. I don't understand why editors think it helps to keep adding the tag. The COI is already explained on the talk page with the notable editor tag. Please review it. [[User:Viriditas|Viriditas]] ([[User talk:Viriditas|talk]]) 21:41, 13 September 2010 (UTC)<br />
:Alright, sounds good, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:42, 13 September 2010 (UTC)<br />
<br />
== Question ==<br />
<br />
I'm curious as to why, after being told multiple times that you ''were'' notified of the AN thread, that you [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard&diff=prev&oldid=384668039 asserted] on AN that I had not notified you. Your [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384660341 response] to Giftiger wunsch's statement [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384659677 here] appears to acknowledge that I notified you. Did you miss not only the notification I left on your talk page but also the multiple clarifications from Giftiger wunsch and me? [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 22:45, 13 September 2010 (UTC)<br />
:You are correct. I am sorry about that. I apologize. It was a mistake on my part. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:46, 13 September 2010 (UTC)<br />
<br />
== [[:File:Kamen rider eurodata.png]] ==<br />
<br />
I've removed the free copyright tags from this image. Do you think perhaps you could unlist it from "possibly unfree images" as it has been determined a year or so ago that it is actually not free?—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 23:27, 13 September 2010 (UTC)<br />
:Commented there. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:26, 14 September 2010 (UTC)<br />
<br />
== Deshastha Brahmin ==<br />
<br />
Hi Cirt - this is regarding the recent GAR for [[Deshastha Brahmin]] article. Do you have any comments on this [[Talk:Deshastha_Brahmin/GA1]]. Thanks. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 03:26, 14 September 2010 (UTC)<br />
:I would strongly recommend another [[WP:PR|peer review]], first, then renominating to try for [[WP:GAN]]. If you wish, you can keep me apprised, and I would be happy to take another look at the article once it is at the peer review stage, after those remaining issues have been fixed. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:59, 14 September 2010 (UTC)<br />
::No problem, I will make the changes, do the peer review then re-nominate. I appreciate your time on this. Thanks for the feedback, it has been helpful. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:11, 14 September 2010 (UTC)<br />
:::Please, feel free to keep me posted, I can check back in on it at that later stage. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:11, 14 September 2010 (UTC)<br />
::::Will do so. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:13, 14 September 2010 (UTC)<br />
:::::Okay, thanks! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:15, 14 September 2010 (UTC)<br />
<br />
== Quick demo of puppet functioning admin ==<br />
Cirt, you don't have real power and not free in your decisions regarding nomination and deleting the articles. You have a puppet master who telling you what to do. Look at the article describing [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It is published more than 3 years ago. It has no references since then and no explanation. It speaks about algorithm presumably implemented in [http://www.msoftware.co.nz/products/winrk WinRK] data compression software but WinRK did not say a word about algorithm. However WinRK is a corporation with influence and should you remove this article you yourself will be removed from admin position. Is that correct? <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:26, 14 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:The article, [[WinRK]], was previously deleted by two admins, {{user|Geni}} and {{user|Rjd0060}}. Not sure what you mean by the rest, the language used in the above comment is unclear, perhaps you could be more specific? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:31, 14 September 2010 (UTC)<br />
:How can you explain that article is back there? What I mean by the language that someone else decided what is deleted and what stays in Wikipedia not you. [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]) 04:38, 14 September 2010 (UTC)<br />
<br />
== Nomination of [[Joan Holmes]] for deletion ==<br />
<br />
<div class="floatleft" style="margin-bottom:0">[[File:Ambox warning pn.svg|42px]]</div>A discussion has begun about whether the article [[Joan Holmes]], which you created or to which you contributed, should be [[Wikipedia:Articles for deletion| deleted]]. While contributions are welcome, an article may be deleted if it is inconsistent with Wikipedia policies and guidelines for inclusion, explained in the [[Wikipedia:Deletion policy|deletion policy]].<br />
<br />
The article will be discussed at [[Wikipedia:Articles for deletion/Joan Holmes]] until a consensus is reached, and you are welcome to contribute to the discussion.<br />
<br />
You may edit the article during the discussion, including to address concerns raised in the discussion. However, do not remove the article-for-deletion template from the top of the article. [[User:Wolfview|Wolfview]] ([[User talk:Wolfview|talk]]) 04:36, 14 September 2010 (UTC)</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User_talk:Cirt&diff=384723003User talk:Cirt2010-09-14T04:26:24Z<p>C-processor: </p>
<hr />
<div>{{User:Cirt/Contributions}} <br />
{{User:MiszaBot/config<br />
|maxarchivesize = 250K<br />
|counter = 12<br />
|minthreadsleft = 5<br />
|algo = old(7d)<br />
|archive = User talk:Cirt/Archive %(counter)d<br />
}}<br />
{{talkheader}}<br />
{{WikiProjectGATasks}} <br />
{| align=lef !important;<br />
|{{cent|float=left|width=100%}}<br />
|{{Signpost-subscription}}<br />
|}<br />
{| align=lef !important;<br />
|[[WP:AFD/T|AFD/T]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-7 days}}|T-7]] • [[Wikipedia:Articles for deletion/Log/{{#time:Y F j|-2 days}}|T-2]] • [[WP:AFDO|AFDO]] • [[WP:AIV|AIV]] • [[CAT:RFUB|RFUB]] • [[WP:UAA|UAA]]/[[CAT:UAA|CAT]] • [[WP:RFPP|RFPP]] • [[CAT:PER|PER]] • [[CAT:CSD|CSD]] • [[CAT:AB|AB]] • [[WP:FAR|FAR]] • [[User:Deckiller/FAC urgents|FAC urgents]] • [[WP:TFAR|TFAR]] • [[WP:RSN|RSN]] • [[WP:BLPN|BLPN]] • [[WP:FTN|FTN]] • [http://www.google.com/custom?domains=en.wikipedia.org&sitesearch=en.wikipedia.org Google Search] {{Wikipedia:Bureaucrats' noticeboard/RfA Report}}<br />
|}<br />
__TOC__<br />
<br />
== Other neat portal ideas for longer term ==<br />
<br />
* Longer term ideas to think about from other portals:<br />
#'''Events''' section, like: "On this day" e.g., [[Portal:Biography|Biography]], [[Portal:Religion|Religion]], [[Portal:United States|United States]]; "Selected anniversaries" e.g., [[Portal:War|War]]; "Calendar" at [[Portal:Holidays|Holidays]]. Interesting idea of "Month selected anniversaries", at [[Portal:Oregon|Oregon]]. <br />
#Model intro with some rotating images, after [[Portal:Oregon]], [[Portal:Indiana]], [[Portal:Iceland/Intro]] and [[Portal:Philosophy of science/Intro]]. <br />
#Revamp DYK sections w/ free-use images, model after [[Portal:Criminal justice]] and [[Portal:Oregon]].<br />
#Portal palettes at [[User:RichardF/Palettes/Portals]]. Comparable color schemes can be developed from the various hue lists at [[User:RichardF/Palettes]]. Also see [[Portal:Box-header]].<br />
#If there are a lot of categories, then categories section to 2 columns, like in [[Portal:Indiana]].<br />
#:Also take some time to check out style/formatting at [[Portal:Indiana]] '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Note to self ==<br />
<br />
*[http://toolserver.org/~magnus/makeref.php MakeRef]<br />
*[http://toolserver.org/~dispenser/view/Reflinks Reflinks]<br />
*[http://reftag.appspot.com/ Citation tool for Google Books] <br />
*[http://reftag.appspot.com/doiweb.py Citation tool for DOIs]<br />
*[[Wikipedia:Wikipedia Signpost/2010-09-06/Dispatches|Tools, part 1: References, external links, categories and size]]<br />
<br />
[[Wikipedia:Verifiability#Sources|independent]] [[Wikipedia:Reliable sources|reliable]] [[Wikipedia:No original research#Primary, secondary and tertiary sources|secondary sources]]<br />
<br />
*[[User:Citation bot/use]]<br />
<br />
*{{tl|findsources}}<br />
<br />
;Cite templates<br />
<pre><br />
<ref>{{cite book| last = | first = | authorlink = | coauthors = | title = | publisher = | year = | location = | page = | url = | doi = | id = | isbn = }}</ref><br />
<br />
<ref>{{cite news| last = | first = | coauthors = | title = | work = | language = | publisher = | page = | date = | url = | accessdate = }}</ref><br />
<br />
<ref>{{cite journal|last =| first=| authorlink=| coauthors=|title=|journal=|volume=|issue=|page=|publisher=|location = | date = | url = | doi = | id = | accessdate = }}</ref><br />
<br />
<ref>{{cite web| last = | first = | authorlink = | coauthors = | title = | work = | publisher = | date = | url = | format = | doi = | accessdate = }}</ref><br />
</pre><br />
<br />
;Citation model<br />
[[The Simpsons (season 3)]]<br />
;Body text in-cite<br />
<pre><br />
<ref name="REFNAME">[[#LASTNAME|LASTNAME]], p. PAGENUMBER</ref><br />
</pre><br />
;References section<br />
(reference template from [[WP:CIT]])<br />
<pre><br />
*<cite id=LASTNAME>REFERENCE</cite><br />
</pre><br />
<br />
;Different model<br />
*[[Template:Citation]]<br />
*[[Template:Harvnb]]<br />
*<nowiki>Example: <ref name="REFNAME">{{Harvnb|LAST|YEAR|p=PAGENUMBER}}</ref></nowiki><br />
See models at [[The General in His Labyrinth]] and [[Mario Vargas Llosa]]. <br />
<br />
::[http://en.wikipedia.org/w/index.php?title=User_talk:Jbmurray&oldid=242692603#Citation_formatting_help.3F More info]. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
More at [[Wikipedia:Harvard citation template examples]]. <br />
:And [[Template talk:Harvard citation no brackets]]. <br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== Dispatch ==<br />
<br />
Cirt, [http://en.wikipedia.org/wiki/Wikipedia_talk:FCDW#Suggestion_for_a_dispatch Awadewit suggested that] you might be interested in writing a [[WP:SIGNPOST|Signpost]] [[WP:FCDW|Dispatch]] article on Featured portals (the only area of featured content we haven't covered). Sample previous articles are at {{t1|FCDW}}. We've covered:<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-31/Dispatches|Featured content overview]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-17/Dispatches|Peer review]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-02/Dispatches|Did you know]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-12/Dispatches|Featured lists]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-19/Dispatches|Good articles]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-05-26/Dispatches|Featured sounds]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-09-08/Dispatches 1|Featured topics]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-03-13/Dispatches|Images]]<br />
* [[Wikipedia:Wikipedia Signpost/2008-08-18/Dispatches|TFA]]<br />
* And Featured articles many times: [[Wikipedia:Wikipedia Signpost/2008-07-21/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-04-07/Dispatches]], [[Wikipedia:Wikipedia Signpost/2008-10-13/Dispatches]]<br />
<br />
None of them start out looking like that: if an editor initially just chunks in some text, many others chip in to tweak it up to Signpost standards. For example, someone wrote [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-08/Dispatches&oldid=249522488 this,] which Karanacs, Royalbroil and I turned into [[Wikipedia:Wikipedia Signpost/2008-11-08/Dispatches|this]], so if you just chunk in some text as a start, others can help finish it off. Another example, I put in [http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2008-11-10/Dispatches&oldid=249800192 this outline,] and Karanacs brought it up to [[Wikipedia:Wikipedia Signpost/2008-11-10/Dispatches|this]]. Other editors have written almost complete and clean Dispatches without much need for other editing. If you're interested, please weigh in and coordinate at [[WT:FCDW]] In case you're interested, you could just begin sandboxing something at [[WP:FCDW/Portals]] and pop over to [[WT:FCDW]] to leave a note when you're ready for others to help out. Regards, [[User:SandyGeorgia|Sandy<font color="green">Georgia</font>]] ([[User talk:SandyGeorgia|Talk]]) 19:26, 17 November 2008 (UTC)<br />
:Will mull this over and most likely draft something up. '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 11:54, 18 November 2108 (UTC)<br />
== Razzies progress ==<br />
<br />
*[[15th Golden Raspberry Awards]] through [[29th Golden Raspberry Awards]] = reformatting process done.<br />
**Note: Going to have to go back and model these after the modifications made subsequently to [[29th Golden Raspberry Awards]].<br />
*[[29th Golden Raspberry Awards]] - so far only one expanded with sourcing research. ([[WP:FL]])<br />
*[[Razzie Award for Worst New Star]] = reformatting process done, next to use '''[[Talk:Razzie Award for Worst Picture]]''' as model to reformat other pages in [[:Category:Golden Raspberry Awards by category]] (with subsection breaks by decade)<br />
'''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]])<br />
<br />
== AN/I: False accusations of vandalism ==<br />
<br />
Hello. This message is being sent to inform you that there currently is a discussion at [[Wikipedia:Administrators' noticeboard/Incidents]] regarding an issue with which you may have been involved. <!--Template:ANI-notice--> Thank you. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Ovadyah|Ovadyah]] ([[User talk:Ovadyah|talk]] • [[Special:Contributions/Ovadyah|contribs]]) </span></small><!-- Template:Unsigned --><br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:57, 31 August 2010 (UTC)<br />
<br />
While on the subject, a portion of my 4 September edit of the [[Oksana Grigorieva]] entry was reverted with the comment "fix prev vandalism." I don't have a problem with the reversion, but I don't feel the "vandalism" label was warranted. [[User:Cmholm|Cmholm]] ([[User talk:Cmholm|talk]]) 10:58, 6 September 2010 (UTC)<br />
:That was not meant to refer to you, sorry. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:42, 6 September 2010 (UTC)<br />
<br />
== Betamax VOIP ==<br />
<br />
Can someone please explain to me why this page was deleted? It had a ready reference to all the various products available from Betamax. This was not as someone has said marketing because its actually not in Betamax's interest to have this page published...a little basic economics will tell you this. Each of the products competes with the others...in different markets. Its like having a DVD available in 15 different countries. This page told you which countries it was available in so that you could check the prices in each country and then buy it from the cheapest! There was no hint of marketing in the article it was purely informational and very useful too! If listing out all the products a company sells is marketing then I can think of a lot of pages on large Multinational Companies that will also have to be deleted.<br />
<br />
Hope someone will see the light.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:09, 2 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:I would suggest first you register for an account on Wikipedia. Then, you could work on a proposed draft version, within a subpage of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:44, 2 September 2010 (UTC)<br />
<br />
I am not proposing to work on a new draft I am proposing that the old article be reinstated. I have not written the previous article nor am I connected with Betamax in anyway. I am a user who found that article extremely useful and was quite disappointed to find the article deleted and also the reasons for the deletion. I don't have either the technical expertise or the time to learn how to discuss these things on Wikipedia however I don't see that as a reason to stay muted. I apologise if I haven't followed any protocl etc that is required here but I think I've made my point. Can you please review the previously deleted article and view it in the new light as I have suggested and I am sure that you will find that it is a neutral article written purely for the purposes of keeping the public informed and helping them make informed choices.<br />
<br />
Cheers,<br />
Mahtab <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 11:49, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:You might find it worthwhile to at the very least attempt to try the recommended suggestion, above. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:43, 6 September 2010 (UTC)<br />
<br />
You are recommending that I open an account! Is this some devious scheme to get more people to sign up? Do you get some kind of commission for that? This discussion is against the spirit that Wikipedia was founded on! All I am asking is that you reconsider your decision...as a neutral party. I think you've been too harsh. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/165.228.221.74|165.228.221.74]] ([[User talk:165.228.221.74|talk]]) 09:41, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<br />
== Proposed Quidco article ==<br />
<br />
Hi again, I've made some additions to the proposed Quidco article on my Talk page at http://en.wikipedia.org/wiki/User_talk:Stuartcoggins#Proposed_Quidco_article and was wondering if you could take another look? Many thanks, Stuart<br />
<br />
[[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 16:02, 3 September 2010 (UTC)<br />
:Try working on it on a separate page, at [[User:Stuartcoggins/Sandbox]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:30, 3 September 2010 (UTC)<br />
::Thank you, I've now moved the article to http://en.wikipedia.org/wiki/User:Stuartcoggins/Sandbox and developed it a little more. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 11:18, 7 September 2010 (UTC)<br />
:::If the article requires more development, please let me know. Alternatively, if the article that was in place just prior to deletion could be restored, I think that was a well-written and neutral piece, so if that were possible, that would be great. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:06, 7 September 2010 (UTC)<br />
::::Needs to demonstrate significant coverage in reliable secondary sources independent of the subject, per [[WP:NOTE]]. Please also read [[WP:RS]], [[WP:V]], and [[WP:CITE]] and [[WP:CIT]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:54, 7 September 2010 (UTC)<br />
:::::Thank you, I will work on that and get back to you. [[User:Stuartcoggins|Stuartcoggins]] ([[User talk:Stuartcoggins|talk]]) 15:56, 7 September 2010 (UTC)<br />
::::::Okay, sounds good. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 17:29, 7 September 2010 (UTC)<br />
<br />
== Living Control ==<br />
<br />
You deleted a page for Living Control. This is an important page as the company has gone in administration. Therfore several groups are being setup with links to support and advice over this matter and products. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/86.145.140.29|86.145.140.29]] ([[User talk:86.145.140.29|talk]]) 10:45, 6 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you first create an account. Then, you could work on a proposed draft version, within a subpage of your userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:42, 6 September 2010 (UTC)<br />
<br />
== AFD closure ==<br />
<br />
While [[Wikipedia:Articles for deletion/Johanna Carreño]] was closed correctly based on the circumstances that existed at the time (unreferenced BLP, nothing turned up in the AFD), there's actually a lot of coverage of this girl in the Spanish-language press [http://www.eltiempo.com.ec/noticias-cuenca/2216-johanna-carrea-o-nominada-a-los-mtv/] [http://www.eluniverso.com/2008/09/11/0001/259/6E4FD68CBB984AA59FFEA7FC88CC7DF1.html] [http://www.eluniverso.com/2008/07/31/0001/259/A822E5B225474BA8B7A838DF78FD23B8.html]. Restoring the article might be more efficient than starting over. [[User:Peter Karlsen|Peter Karlsen]] ([[User talk:Peter Karlsen|talk]]) 01:29, 7 September 2010 (UTC)<br />
:I would be most willing to provide it, in your userspace as a subpage, so you could work on a proposed draft version. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:46, 7 September 2010 (UTC)<br />
::That would be great, thanks. [[User:Peter Karlsen|Peter Karlsen]] ([[User talk:Peter Karlsen|talk]]) 01:48, 7 September 2010 (UTC)<br />
:::{{done}}, now at [[User:Peter Karlsen/Johanna Carreño]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 02:55, 7 September 2010 (UTC)<br />
<br />
== Deletion of [[Lilias Rider Haggard]] article ==<br />
<br />
Hi,<br />
I was just wondering why this article was deleted after I provided a second reference and more biographical details. <br />
<br />
Thank you. <br />
[[Jcspurrell]] <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]] • [[Special:Contributions/Jcspurrell|contribs]]) 16:26, 7 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:Was deleted, after deletion discussion at [[WP:AFD]] process, here [[Wikipedia:Articles for deletion/Lilias Rider Haggard]]. Would be willing to provide a copy, as a subpage within your userspace, if you wish to work on a proposed draft version. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 16:31, 7 September 2010 (UTC)<br />
<br />
Hi,<br />
<br />
Thank you for your comments. However, I do still do not understand why the article was deleted. In the discussion, I said that I would provide more references and information. I began to do so, but the article was deleted before I had time to finish. If possible, I would like to take you up on your offer of working on a draft version on a subpage within my userspace so that I can continue to add information as and when I have time.<br />
<br />
Many thanks.<br />
<br />
Jcspurrell<br />
[[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 20:54, 13 September 2010 (UTC)<br />
:{{done}}, now at [[User:Jcspurrell/Lilias Rider Haggard]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 20:56, 13 September 2010 (UTC)<br />
<br />
Thank you. [[User:Jcspurrell|Jcspurrell]] ([[User talk:Jcspurrell|talk]]) 21:19, 13 September 2010 (UTC)<br />
:You are most welcome! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:19, 13 September 2010 (UTC)<br />
<br />
== Tiny Ross ==<br />
<br />
I see you deleted this as a hoax? He may not be notable, and I have no idea whether the details in the article were true, but he was certainly a real actor and appeared in three films, most notably ''[[Time Bandits]]''... Was hoax really the right criteria to delete this article? [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:07, 7 September 2010 (UTC)<br />
:Feel free to recreate it, seems it was created in this instance, by a problem user. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 19:11, 7 September 2010 (UTC)<br />
<br />
::Nah, there's not really enough biographical data available. It's possible that the content was completely made up. The only real reliable source is a book on Monty Python and it only includes him in a cast list, no details. [[User:Yworo|Yworo]] ([[User talk:Yworo|talk]]) 19:14, 7 September 2010 (UTC)<br />
<br />
== The Military history WikiProject Newsletter : LIV (August 2010) ==<br />
<br />
{{WPMILHIST Newsletter header|LIV|August 2010| }}<br />
{| style="width: 100%;"<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Project news</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Project news|The return of reviewer awards, task force discussions, and more information on the upcoming coordinator election]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Articles</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Articles|A recap of the month's new Featured and A-Class articles, including a new featured sound]]''<br />
<br />
|-<br />
| valign="top" style="border: 1px gray solid; padding: 1em; width: 50%;" |<br />
; <big><font color=steelblue>Members</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Members|Our newest A-class medal recipients and this August's top contestants]]''<br />
<br />
| valign="top" style="border: 1px gray solid; padding: 1em;" |<br />
; <big><font color=steelblue>Editorial</font></big><br />
''[[Wikipedia:WikiProject Military history/News/August 2010/Editorials|In the first of a two-part series, Moonriddengirl discusses the problems caused by copyright violations]]''<br />
<br />
|-<br />
| valign="top" colspan="2" style="padding: 0.5em; text-align: center; font-size: 85%; " |<br />
To change your delivery options for this newsletter please list yourself in the appropriate section [[Wikipedia:WikiProject Military history/News/Options|here]]. To assist with preparing the newsletter, please visit the [[Wikipedia:WikiProject Military history/Coordinators/Strategy think tank/News and editorials division|newsroom]]. [[User:BrownBot|BrownBot]] ([[User talk:BrownBot|talk]]) 23:04, 7 September 2010 (UTC)<br />
|}<br />
<br />
== Housekeeping ==<br />
<br />
Hello - you closed [[Wikipedia:Articles for deletion/Caesar Takeshi|this AfD]] as keep, however the AfD template is still displaying on the [[Takeshi Caesar|article page]]. --[[User:Ponyo|<b><font color="Navy">''Jezebel's''</font></b><font color="Navy">Ponyo</font>]]<sup>[[User_talk:Ponyo|<font color="Navy">''shhh''</font>]]</sup> 18:34, 8 September 2010 (UTC)<br />
:{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
<br />
== Selena FAC ==<br />
<br />
I think I took care of most of the concerns, the article is rather short because she had a short career, and I want to stick to the basics, not add extra information about her tours, etc. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 03:54, 9 September 2010 (UTC)<br />
:Link please? -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:36, 9 September 2010 (UTC)<br />
[[Wikipedia:Featured article review/Selena/archive1]] [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 18:34, 9 September 2010 (UTC)<br />
: I added citations where I could removed where I couldn't find it in the book, and beefed up the article just a little bit, I don't want to go into overdetail. Thanks [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 23:03, 12 September 2010 (UTC)<br />
: I reworded it to impact and merged the two sentence paragraph. [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 14:35, 13 September 2010 (UTC)<br />
::{{done}}. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:38, 13 September 2010 (UTC)<br />
::: I may need your help, I already broke 3RR on Selena trying to keep it as reliable as possible, protect the page please so the revert war will [[User:Secret|Secret]] <sup>[[User talk:Secret|account]]</sup> 22:42, 13 September 2010 (UTC)<br />
::::I will request full prot, at [[WP:RFPP]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:43, 13 September 2010 (UTC)<br />
<br />
== Blocking dummy available ==<br />
<br />
Wow, you're following up on some of my old COI tags. At this rate, you'll be the blocking king at the end of the night. Too bad I haven't been too active lately but there are a couple of recent ones from the past week. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:35, 9 September 2010 (UTC)<br />
:Heh, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:37, 9 September 2010 (UTC)<br />
::You're laughing and I'm serious! When I sometimes go on a Recent changes patrol, some of those COI jokers will find a nice little tag on their talkpage. I could make [[Rosey Grier]] look like a toothpick when I go plowing through; hence the blocking dummy would be me. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 04:50, 9 September 2010 (UTC)<br />
:::[[Rosey Grier]] is a cool dude, per [[Portal:Textile arts/Selected quote/2]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:52, 9 September 2010 (UTC)<br />
::::It's kind of funny but that whole Ram front four had a very humanistic, in touch with their inner spirit side. Now, call them a pansy to their face and you might be missing some teeth. My Dad used to force me to watch his "Lambs". He always swore at [[Roman Gabriel]] whenever they started losing. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 05:01, 9 September 2010 (UTC)<br />
:::::Picking up from where you left on yesterday? I wonder how many users I tagged with COIs in June and July. I'll try to work on September tonight so that you'll have something to do in a month or so. ;_) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 00:59, 10 September 2010 (UTC)<br />
::::::Okay, thanks! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 01:00, 10 September 2010 (UTC)<br />
{{od}}<br />
Now serving number one. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:19, 10 September 2010 (UTC)<br />
:Now serving number two. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:42, 10 September 2010 (UTC)<br />
::When you get to August, let me know. Looks like you're working July now. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:21, 11 September 2010 (UTC)<br />
:::Not sure what you mean by the other above messages. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 11 September 2010 (UTC)<br />
::::Which ones? If you're talking about number one and number two, the first was a COI who became or was a sock of number two that I saw later last night. Another admin blocked them at [[Wikipedia:Sockpuppet investigations/EdwinHarbor]]. Otherwise, you've been clearing up some of COI usernames dating back awhile. I noticed that you did several today as well. ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:27, 11 September 2010 (UTC)<br />
:::::Oh, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:27, 11 September 2010 (UTC)<br />
::::::No, thank you. I noted that you went to May, moved to June and did some from July. September's been a little slow but I'm working on it. ;) ----[[User:Morenooso|moreno oso]] ([[User talk:Morenooso#top|talk]]) 03:30, 11 September 2010 (UTC)<br />
:::::::Sounds good, -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:32, 11 September 2010 (UTC)<br />
<br />
== Featured Portal review ==<br />
<br />
Hey Cirt. Can you close [[Portal:Business and economics]] [[Wikipedia:Featured portal review/Business and economics|FPR]]? There hasn't been any edits on the article since August 3rd and there's still problems to it. [[User:GamerPro64|GamerPro64]] ([[User talk:GamerPro64|talk]]) 20:55, 9 September 2010 (UTC)<br />
:Left notes for a couple users. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 23:07, 9 September 2010 (UTC)<br />
<br />
== Dammit Cirt ==<br />
<br />
You beat me to all my closes today :( (at least we agreed on them) --[[User:Ron Ritzman|Ron Ritzman]] ([[User talk:Ron Ritzman|talk]]) 00:23, 10 September 2010 (UTC)<br />
:Sorry, and great! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:24, 10 September 2010 (UTC)<br />
<br />
== A Very Merry Unauthorized Children's Scientology Pageant ==<br />
<br />
Hello, I have discovered this article by sheer luck and I have found it very interesting. The idea of this musical is just awesome ! It would be too bad if I did not try to translate it. Now, this play have at least one article in french :) Dosto [[Special:Contributions/86.71.74.243|86.71.74.243]] ([[User talk:86.71.74.243|talk]]) 01:26, 11 September 2010 (UTC)<br />
:Thank you! -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== There was no Russia in 1970. ==<br />
<br />
It was called the Russian SFSR-the Russian Soviet Federative Socialist Republic. That's common knowledge. That doesn't need to be cited. Don't dumb down Wikipedia. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/139.84.242.65|139.84.242.65]] ([[User talk:139.84.242.65|talk]]) 02:00, 11 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Please discuss, at [[Talk:Oksana Grigorieva]], thanks. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 11 September 2010 (UTC)<br />
<br />
== OneVietnam Network, previously deleted--can it be put up again? ==<br />
<br />
Hi, a couple of months ago I created a page for OneVietnam Network. It was deleted because there were doubts on its significance and there was a lack of coverage on it. Since then, there has been a lot of new coverage on OneVietnam Network. If I want to create the page again, do I have to go through you (the deleting admin), or is it okay if I save new page again? Thank you very much for your time. [[User:Clockmonster|Clockmonster]] ([[User talk:Clockmonster|talk]]) 03:39, 11 September 2010 (UTC)<br />
:I would suggest first working on it, as a proposed draft version, within a subpage off of your userpage space. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:40, 11 September 2010 (UTC)<br />
<br />
== AfD closure of [[EXtremeDB]] ==<br />
<br />
You are invited to join the discussion at [[Wikipedia:Editor_assistance/Requests#Request_re_EXtremeDB]]. I'm sorry that the discussion there has got rather long. I think the relevant point is that in [[Wikipedia:Articles_for_deletion/EXtremeDB|this AfD]] you may have overlooked the nominator's withdrawal of the nomination. -- [[User:John of Reading|John of Reading]] ([[User talk:John of Reading|talk]]) 16:25, 11 September 2010 (UTC)<br />
:Nod, the user is welcome to come to me, here. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:06, 12 September 2010 (UTC)<br />
<br />
== Old username concerns ==<br />
<br />
Hi Cirt - You seem to be doing a great job of cleaning up (blocking) the old usernames that I have tagged as concerns. I am just wondering if you have any script or any dated category or if you are just going through the overall username category manually. I was going to use AWB to do the same, but if you've already found a good semi-automated way of doing it I'll let you finish (or I'm happy to replicate what you are doing). Let me know. Thanks. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 00:08, 12 September 2010 (UTC)<br />
:Was doing it manually, without a script. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:05, 12 September 2010 (UTC)<br />
::Ok - thanks. Can tell you are busy with it, because you show up as like half of my watchlist edits. [[User talk:7|<span style="background:#acf;padding:2px;color:white;text-shadow:black 0.2em 0.2em 0.3em">&nbsp;'''7'''&nbsp;</span>]] 03:18, 12 September 2010 (UTC)<br />
:::Heh, thanks for the kind words! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:19, 12 September 2010 (UTC)<br />
<br />
== Review request ==<br />
<br />
Hello, Cirt. I'm posting here as I saw you were online while watching recent changes. Coincidentally, (your username popped up blocking for a username) this is regarding a [http://en.wikipedia.org/w/index.php?title=User_talk:Gingerbakercorp&diff=384321318&oldid=384280172 username] block I recently executed. If you have the time, would you check to make sure the block was warranted and executed properly? Feel free to undo my block or alter it as you see fit. Let me know and I'll make any apology to the user that's needed. Thanks [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:21, 12 September 2010 (UTC)<br />
:Responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:23, 12 September 2010 (UTC)<br />
<br />
::Thanks for the quick action. See ya 'round [[User:Tide rolls|'''<span style="color:White;background:darkRed">Tide</span>''']][[User talk:Tide rolls|'''<span style="color:darkRed">rolls'''</span>]] 03:29, 12 September 2010 (UTC)<br />
:::You are most welcome. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:30, 12 September 2010 (UTC)<br />
<br />
== Your [[WP:GA|GA]] nomination of [[Lady Gaga: Queen of Pop]] ==<br />
<br />
The article [[Lady Gaga: Queen of Pop]] you nominated as a [[Wikipedia:Good article nominations|good article]] has been placed on hold [[Image:Symbol wait.svg|20px]]. The article is close to meeting the [[WP:GA?|good article criteria]], but there are some minor changes or clarifications needed to be addressed. If these are fixed within seven days, the article will pass, otherwise it will fail. See [[Talk:Lady Gaga: Queen of Pop]] for things which need to be addressed. [[User:Jezhotwells|Jezhotwells]] ([[User talk:Jezhotwells|talk]]) 10:52, 12 September 2010 (UTC)<br />
:Thanks, responded there. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 18:18, 12 September 2010 (UTC)<br />
<br />
== Request for clarification ==<br />
<br />
A request for clarification [http://en.wikipedia.org/w/index.php?title=Wikipedia:Arbitration/Requests/Clarification&oldid=384453348] has been filed per [http://en.wikipedia.org/wiki/Wikipedia:Arbitration/Requests/Enforcement/Archive66#User:TimidGuy_and_User:Littleolive_oil_and_User:Edith_Sirius_Lee] Although it may not affect you directly, your name has been mentioned or referenced.([[User:Littleolive oil|olive]] ([[User talk:Littleolive oil|talk]]) 20:39, 12 September 2010 (UTC))<br />
<br />
== Deletion of article Polar Tree ==<br />
<br />
You deleted my article Polar Tree. Obviously to me the procedure of deleting of articles in Wikipedia is hypocritical with fake and orchestrated discussion similar to mid centuries inquisition court when executed heretic was provided the right to express his views before the judges who already made decisions. In my case the article described modification of known algorithm in data compression. This is not new research but slight modification of old research leading to certain benefits - that means no original research. I provided two independent links. One link to Google site where software developer incorporated my algorithm to his program and achieved certain benefits. Another link from expert in data compression Matt Mahoney who maintain largest data compression benchmark. On his site Matt reexplained my algorithm to readers confirming by this action the novelty, because all other known algorithms on his site not explained but mentioned. The individual that suggested to remove the article changed his opinion on the opposite and suggested to keep the article. The other two reviewers suggested to ask expert opinion. At this point someone who orchestrated the deleting of the article saw that well orchestrated action failing brought new player [[User:Whpq|Whpq]] who is totally incompetent in the subject and has many 5 lines articles about nothing. When another new vote was obtained you deleted the article. <br />
I can explain why I believe that Wikipedia orchestrated the deletion. My references are real, strong and independent. People found my algorithm without my soliciting. It is much better than publication in the journal because articles are sent by authors to the journals where one of the authors was previously published and sending is backed up by set of phone calls to editor-in-chief. It is arranged. Frequently the author without connection include the co-author with connections for the article to be published. In my case the researcher not just approved but took the algorithm and implemented it into a software. Needless to say that 99% of what is published in technical journals is junk that never implemented by anyone. When discussion went into wrong direction new member [[User:Whpq|Whpq]] appeared out of nowhere. And what is the reason that this individual having no idea about data compression suddenly read my article about data compression checked my references and found them unreliable. Look at what he writes - the data compression is out of his interest. The explanation is simple he was told to look and provide an opinion necessary to have an excuse to delete the article. I can also explain why I believe that decisions are made by some man in the shadow. During discussion I pointed out the other article as classical example of material without notability, references and even explanation. It is article about [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. Why all these critics that are very far from data compression found my article and did not notice the other article about data compression, that has no references at all and does not even provide an explanation and stay in Wikipedia over 2 years. The answer is simple. Because they were not told to do that. I mentioned in discussion that there is nothing wrong with ROLZ algorithm, but it is not publicly explained so there is notability issue, no references, not at all, nothing because it was proprietary, it was not published. <br />
Since I have my own web site where I can publish everything I decide. I will write an article about process of evaluation the articles in Wikipedia. My conclusion that articles must get back door approval by someone in control through connections otherwise independently on provided references they will be deleted and references will be announced unreliable. As scientist I have one role to deliver the people the explanation how the world is functioning. This is what scientists normally do. I think I have to explain to visitors of my site that publications in Wikipedia are arranged through the back door leading to administration that will help people to make right solution, avoid wasting time and so on. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 04:42, 13 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:Suggest you register an account, then you could work on a proposed draft version, within a subpage of your userspace page. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== Crumplezone ==<br />
<br />
HEY YOU, WHY ARE YOU DELETING [[Crumplezone]], AND YOU ARE NOT SUPPOSED TO BE DELETED DO YOU UNDERSTAND!!?? [[User:75.142.152.104|75.142.152.104]] ([[User talk:75.142.152.104|talk]]) 04:50, 13 September 2010 (UTC)<br />
:Please read [[WP:AFD]], then [[Wikipedia:Articles for deletion/Crumplezone]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 12:40, 13 September 2010 (UTC)<br />
<br />
== FAR ping ==<br />
<br />
Hi Cirt - Could you please revisit your comments at the FARs for [[Selena]] and [[Michael Brown Okinawa assault incident]]? Also the one for [[Gliding]] - more specificity is needed regarding the sections you believe should be expanded: what information do you think is missing? Thank you, [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 13:06, 13 September 2010 (UTC)<br />
:{{done}}! Also, [[User:Dana boomer|Dana boomer]], I wanted to thank you for the courteous, polite, and kind way in which you have approached me to inquire about this - it is a rare and most appreciated quality. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 14:29, 13 September 2010 (UTC)<br />
::Awesome, thanks for the quick response! (And you're welcome!) [[User:Dana boomer|Dana boomer]] ([[User talk:Dana boomer|talk]]) 14:51, 13 September 2010 (UTC)<br />
<br />
==Deletion review for [[Topsite (www)]]==<br />
An editor has asked for a [[Wikipedia:Deletion review#Topsite (www)|deletion review]] of [[Topsite (www)]]. Because you closed the deletion discussion for this page, speedily deleted it, or otherwise were interested in the page, you might want to participate in the deletion review. <!-- This originally was from the template {{subst:DRVNote|PAGE_NAME}} ~~~~ -->''[[User:Rich Farmbrough|Rich]]&nbsp;[[User talk:Rich Farmbrough|Farmbrough]]'', 15:04, 13 September 2010 (UTC).<br />
:Okay, thanks for the notice. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 15:06, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Is there a reason you are now systematically sending perfectly notable subjects to deletion, other than the fact you thought I was rude to you on your talk page? Two films that were released in theaters in another nation are indeed notable.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:01, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:03, 13 September 2010 (UTC)<br />
::They are '''movies'''. They are notable. These articles are also '''just made'''. Give us time to work on the articles before sending everything into the trashbin.—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 21:04, 13 September 2010 (UTC)<br />
:::The use of '''bold''' is not necessary. The articles could have been worked on in userspace. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== Ryulong ==<br />
<br />
I'm terribly sorry to bother you about this, but Ryulong is concerned that you're AfDing articles that he created as a gesture of retaliation for his poor word choice on your usertalk; he's also quite distressed that this is happening when he's stuck on poor-grade WiFi and therefore can't really participate in the AfDs.<br />
<br />
Could you do something to assuage these concerns? Thank you. [[User:DragonflySixtyseven|DS]] ([[User talk:DragonflySixtyseven|talk]]) 21:03, 13 September 2010 (UTC)<br />
:After I closed an AFD on a related topic, I began to investigate the related purported "merge" topics, and found that the parent "merge" targets, also notably fail [[WP:NOTE]], lack of significant coverage from reliable secondary sources. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:05, 13 September 2010 (UTC)<br />
<br />
== AN discussion regarding username blocks ==<br />
<br />
Please see [http://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard#Nipples_-_I_have_two.2C_how_about_you.3F here]. Thanks. [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 21:08, 13 September 2010 (UTC)<br />
<br />
== Kamen Rider ==<br />
<br />
Perhaps a mass nomination is in order?<br />
* [[Kamen Rider Knight]]<br />
* [[Kamen Rider Ryuki (character)|Kamen Rider Ryuki]]<br />
* [[Kamen Rider Scissors]]<br />
* [[Kamen Rider Zolda]]<br />
* [[Kamen Rider Raia]]<br />
* [[Kamen Rider Gai]]<br />
* [[Kamen Rider Ouja]]<br />
* [[Kamen Rider Tiger]]<br />
* [[Kamen Rider Imperer]]<br />
* [[Kamen Rider Femme]]<br />
* [[Kamen Rider Ryuga]]<br />
* [[Kamen Rider Verde]]<br />
* [[Kamen Rider Odin]]<br />
[[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:26, 13 September 2010 (UTC)<br />
:To {{user|Active Banana}} - Agreed, replied at [[User talk:Active Banana]]. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:28, 13 September 2010 (UTC)<br />
::My "expertise" ends at the fact that this list appears in [[Kamen Rider Ryuki]]. I am not sure what is the best way to centralize an organized discussion when the content under question keeps getting shuttled around to other articles, with several AfD's already in progress. [[Special:Contributions/Active_Banana|''Active'']] [[User:Active Banana|<font color="gold">'''Banana</font>''']] <font color="gold"> ''' ('''</font> [[User talk:Active Banana|<font color="gold"><sup>''bananaphone''</sup></font>]] 21:32, 13 September 2010 (UTC)<br />
<br />
== Re: Mission Dolores mural ==<br />
<br />
I have removed the COI several times now, because I am handling this issue and I am working with Ben to resolve any problems. Please use the talk page to explain any continuing problems as you see them. As a fully disinterested third party, I don't see a need for editors to keep adding maintenance tag when others are aware of the issue and are working to resolve any outstanding issues. Furthermore, there is nothing wrong with experts working on Wikipedia in their field, so the repeated adding of this tag does not help the working environment or encourage good faith. If there are COI problems that nobody has handled, use the talk page and explain them. I don't understand why editors think it helps to keep adding the tag. The COI is already explained on the talk page with the notable editor tag. Please review it. [[User:Viriditas|Viriditas]] ([[User talk:Viriditas|talk]]) 21:41, 13 September 2010 (UTC)<br />
:Alright, sounds good, thank you! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 21:42, 13 September 2010 (UTC)<br />
<br />
== Question ==<br />
<br />
I'm curious as to why, after being told multiple times that you ''were'' notified of the AN thread, that you [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard&diff=prev&oldid=384668039 asserted] on AN that I had not notified you. Your [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384660341 response] to Giftiger wunsch's statement [http://en.wikipedia.org/w/index.php?title=Wikipedia:Administrators%27_noticeboard/Incidents&diff=prev&oldid=384659677 here] appears to acknowledge that I notified you. Did you miss not only the notification I left on your talk page but also the multiple clarifications from Giftiger wunsch and me? [[User:Delicious carbuncle|Delicious carbuncle]] ([[User talk:Delicious carbuncle|talk]]) 22:45, 13 September 2010 (UTC)<br />
:You are correct. I am sorry about that. I apologize. It was a mistake on my part. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 22:46, 13 September 2010 (UTC)<br />
<br />
== [[:File:Kamen rider eurodata.png]] ==<br />
<br />
I've removed the free copyright tags from this image. Do you think perhaps you could unlist it from "possibly unfree images" as it has been determined a year or so ago that it is actually not free?—[[User:Ryulong|<font color="blue">Ryūlóng</font>]] ([[User talk:Ryulong|<font color="Gold">竜龙</font>]]) 23:27, 13 September 2010 (UTC)<br />
:Commented there. -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 00:26, 14 September 2010 (UTC)<br />
<br />
== Deshastha Brahmin ==<br />
<br />
Hi Cirt - this is regarding the recent GAR for [[Deshastha Brahmin]] article. Do you have any comments on this [[Talk:Deshastha_Brahmin/GA1]]. Thanks. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 03:26, 14 September 2010 (UTC)<br />
:I would strongly recommend another [[WP:PR|peer review]], first, then renominating to try for [[WP:GAN]]. If you wish, you can keep me apprised, and I would be happy to take another look at the article once it is at the peer review stage, after those remaining issues have been fixed. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 03:59, 14 September 2010 (UTC)<br />
::No problem, I will make the changes, do the peer review then re-nominate. I appreciate your time on this. Thanks for the feedback, it has been helpful. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:11, 14 September 2010 (UTC)<br />
:::Please, feel free to keep me posted, I can check back in on it at that later stage. :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:11, 14 September 2010 (UTC)<br />
::::Will do so. [[User:Zuggernaut|Zuggernaut]] ([[User talk:Zuggernaut|talk]]) 04:13, 14 September 2010 (UTC)<br />
:::::Okay, thanks! :) -- '''[[User:Cirt|Cirt]]''' ([[User talk:Cirt|talk]]) 04:15, 14 September 2010 (UTC)<br />
<br />
== Quick demo of puppet functioning admin ==<br />
Cirt, you don't have real power and not free in your decisions regarding nomination and deleting the articles. You have a puppet master who telling you what to do. Look at the article describing [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] algorithm. It is published more than 3 years ago. It has no references since then and no explanation. It speaks about algorithm presumably implemented in [http://www.msoftware.co.nz/products/winrk WinRK] data compression software but WinRK did not say a word about algorithm. However WinRK is a corporation with influence and should you remove this article you yourself will be removed from admin position. Is that correct?</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=382823109Wikipedia:Articles for deletion/Polar Tree2010-09-04T06:09:51Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 31#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
<del>Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject<del>. <ins>'''Keep'''. The author of the article has produced at least one significant citation.</ins>[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.<br />
:::*You don't understand how Wikipedia works. We are not here to discuss viability or whether or not some piece of code exists. Nobody doubts that. Wikipedia is a refernce of third resort. That means [[WP:V|under Wikipedia's verifiability]] policy, [[WP:RS|reliable sources]] '''''must''''' be provided. This may be the greatest snippet of code that ever existed, but unless you can source it, it does no good, and it can't stay here, by policy. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 06:49, 26 August 2010 (UTC)<br />
<br />
:::*Than go ahead and do same thing to [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] and let me see how you will be ignored. ROLZ allegedly was introduced in WinRK. But it is proprietary software, disassembling is against the law. In the same way that in Polar Tree the algorithm was taken and implemented in BALZ compressor. One implementation and no explanation. Do you see similarities? What makes ROLZ worse that Polar Tree it is not even explained in the article. So, what we have: no reliable source, original research and no explanation. Look when the topic was introduced and look how long it is staying and neither you nor Sebastian suggest to remove it. Do not suggest me to nominate ROLZ for deletion because for me it is great and important algorithm but for you it is not because it is not cited in reliable sources not properly explained and is original research. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 16:54, 26 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
::::*Right, so you are obviously unconcerned about Wikipedia policies. Bottom line: if you can't agree with the terms of use then you shouldn't be editing Wikipedia in the first place. Simple as that. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:51, 26 August 2010 (UTC)<br />
*'''Comment''' [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]), unfortunately Wikipedia takes a conservative approach to new ideas. You'll either have to publish your work in a peer-reviewed medium or get an article written about it in a well-known publication first, before it will be accepted here. I suggest you devote your energy to these goals. Good luck! I hope your article will be here soon. &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 18:20, 26 August 2010 (UTC)<br />
<br />
*You and others keep repeating same things over and over ignoring obvious facts that I point out. Wikipedia publish new ideas, and [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] is one of them. You and others, participating in this discussion, do not make any decision. There is a MAN IN THE SHADOW that decides what stays and what goes away. He nominated article to deletion and not willing to identify himself. <br />
:*Actually, it was I who nominated the article, and no, I don't decide "what stays and what goes". '''Anyone''' can nominate an article for deletion, revert edits, and add content to the encyclopedia. It is by consensus that we reach our decisions, '''together'''. Furthermore, the reason why I haven't looked into the ROLZ article, quite frankly, is because I don't feel like playing your little game of "tit for tat". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC) <br />
<br />
*I have Ph.D. in Automatic Control and published many articles in peer-reviewed journals. I know how it all arranged. Articles are rejected independently on their merits unless its publication is arranged by a confidential phone call to editor-in-chief from a person he knows very well. The reason of rejection is avoiding responsibility by a reviewer, who can not possibly keep track on everything what is happening and afraid to pass plagiarized materials. Only articles sent from individuals with established reputation are published. My original article is published on my web site where I do not need to bow editor. Since it is already published it can't be republished somewhere else, journals do not accept copies. Wikipedia is different. It informs public, so it explains materials published somewhere else. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 03:39, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*While it is no doubt challenging to publish material for the first time, it is by no means impossible. You could, for example, contact an expert in the field (who has published papers WRT information theory or the like) and ask if they would be willing to co-write an article with you or some such (a professor at the university that you attended might be a good candidate for such a request). Moreover, if you haven't already submitted your article to a reputable publication, do so. Someone there may be interested enough to take a chance on a good idea (it may help if you point out to them that you have published in another field). [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC)<br />
<br />
*New independent reference [http://mattmahoney.net/dc/text.html Matt Mahoney web catalog]. The site is long. To find reference you need to find expression Polar codes in it. The site holder Matt Mahoney is world expert in data compression. His program PAQ8 holds the world record in compression [http://www.maximumcompression.com/data/bmp.php]. And we did not meet. I showed more independent usage than ROLZ. <br />
*Sebastian, stop discussing unimportant details. Speak on the context. I presented independent acknowledgment. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:37, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
*------------------------------------------------------------------<br />
I presented independent references that can be considered as peer-reviewed, because my referees provided unsolicited testing and links in a record time since first publication. In Large Text Compression Benchmark Matt Mahoney also explained the matter of the algorithm to his readers with his own words. Taking into consideration that Polar Tree or Polar Codes is only modification of Huffman and Shannon-Fano codes and not represent completely new research but rather modification I insist on keeping this article in Wikipedia. The name introduced by independent referees and assigned in accordance with other two codes named after inventors Shannon-Fano and Huffman. I suggest the individual that nominated article to deletion come out of the shadow and confront me in open scientific discussion. It is perfectly clear that those who participated in discussion so far did not nominate this article to deletion and their opinions will not be considered in final determination. Should this article happened to be deleted the brief history of the process along with independent references will be published on my web space [http://www.ezcodesample.com/prefixer/prefixer_article.html]. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 07:43, 28 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
*Sure, the Mahoney article would serve as an adequate reference, I think. Accordingly, I've changed my opinion to "keep". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 15:06, 28 August 2010 (UTC)<br />
*Thanks, Sebastian. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 21:23, 28 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<hr style="width:50%;" /><br />
:<span style="color:#FF4F00;">'''[[WP:RELIST|Relisted]] to generate a more thorough discussion so consensus may be reached.'''</span><br /><small>Please add new comments below this notice. Thanks, -- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 22:03, 31 August 2010 (UTC)</small><!-- from Template:Relist -->[[Category:Relisted AfD debates|{{SUBPAGENAME}}]]<br />
<!-- User:Phantomsteve/note -->*<small>'''Note''': I have relisted as the nominator withdrew their nomination, but there were 'delete' recommendations. As a result, I am unwilling to close this as 'keep' at this time. However, if all those who commented here are in agreement that this should be kept, it can be closed before the 7 day relisting period is up, unless further 'delete's are added.{{#if:||-- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 22:08, 31 August 2010 (UTC)}}</small><br />
<br />
*I have to thank somebody who contributed to the article by editing my clumsy English. Now the article sounds much better its original version. Let me also summarize my reasons for keeping article:<br />
1. It is not radically new data compression technique but slight modification of other known methods and has same purpose and its own advantage and disadvantage.<br />
2. In data compression area there is no such thing as best algorithm, because it depends on data. If you ask any expert to advice which data compression method to use, the answer will be 'What is your data?'. Wikipedia role is to inform people and let them choose. <br />
3. Waiting when method is used by many researchers and referred by many people is unacceptable in computer science, because it needs at least 10 years and what would Wikipedia look like if it publishes achievements in computer science from 10 years ago. People would not address to it. The computer science novelties have to be published quicker. <br />
4. The suggested technique was noticed immediately after publication, incorporated into a big project (that does not happen very often) and cataloged by expert in industry, so we have two independent reviews.<br />
I apologize if I was not very polite during debate. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:20, 1 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<!-- User:Phantomsteve/note -->*<small>'''Note''': I have left messages on the talk pages of {{u|HowardBGolden}}, {{u|Scope creep}} and {{u|Everard Proudfoot}} asking if they would leave a further comment here{{#if:||-- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 14:50, 1 September 2010 (UTC)}}</small><br />
<br />
:I stand by my '''delete'''. Still not notable. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:55, 1 September 2010 (UTC)<br />
:I can remide first message of [[User:Everard Proudfoot|Everard Proudfoot]] that says: Can you provide independent, third party reliable sources?<br />
The source that I provided later is catalog of all known data compression algorithms and programs mainained by guru in data compression Matt Mahoney - the computer analyst who holds the record in data compression, which is above benchmarks of many corporations that sell software. Matt Mahoney has Ph.D. in computer science. His catalog has status of on-line journal and not different from other peer reviewed journals. Mr. Mahoney has a reputation, he capable to understan merits of data compression algorithm and will definitely not put into catalog something that is wrong or ineffective. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 01:57, 2 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:If Matt Mahoney is considered an expert in this field, then I think notability is established. (This isn't a field I know much about, nor have I read much about this subject, so I can't give any opinion on Matt Mahoney's eminence or lack thereof.) &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 02:42, 2 September 2010 (UTC)<br />
<br />
*'''Delete''' - There are zero reliable sources to indicate this is notable. Note that the reference to Matt Mahoney appears to be [http://mattmahoney.net/dc/text.html this] which specifically states "This is an open benchmark. Anyone may contribute results. Please read the rules first." -- [[User:Whpq|Whpq]] ([[User talk:Whpq|talk]]) 13:47, 3 September 2010 (UTC)<br />
:There is confirmation of novelty of the algorithm provided independently by industry expert in the form of notification to readers. So it is same as publication in peer reviewed journal. Anyone can contribute and many programs that are there effective but do not have novelties in algorithm. They are simply listed as benchmark. Polar codes are mentioned in different context. The benchmark shown, the matter of algorithm explained. The link to different from author implementation is provided. Wikipedia purpose is to notify public. Notability is not a goal. Notability is a means for preventing unverified materials to be published. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 14:39, 3 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:I consider comment of [[User:Whpq|Whpq]] as a personal attack by using specific exaggeration in the language and in tone. What means "There are zero reliable sources". The confidence of the tone directed to brainwash reader. This statement is totally and knowingly false. I remind that there are 2 independent sources. One is description of the improvement achieved by incorporating of the algorithm into large data compression software. What might be unreliable here. Does he believes that improvement is not achieved or algorithm is not incorporated. The [http://code.google.com/p/lzham/ code is published] the researcher that did that has professional reputation. The article indicated that decompression is 12% faster. Does user [[User:Whpq|Whpq]] understand that if it is video we can pass 12% more data for the same time and improve quality of HDTV. What happen if somebody beats olympic record on 12%. Is that not important either. Second link is Matt Mahoney site. Matt benchmarks everything but if there is no novelty in algorithm he does not indicate novelty but place a single record: name of program, ratio, compression time, decompression time, memory usage. In my case Matt Mahoney explained readers the novelty of the algorithm. That is not just benchmark, that is information about novelty, NOVELTY, N-O-V-E-L-T-Y. Does user [[User:Whpq|Whpq]] presume Matt not telling the truth or what? Benchmarking means that testing every program. Mahoney personally ran the program several times, measured used resources, looked at the code and so on. This is the matter of benchmarking. Can user [[User:Whpq|Whpq]] indicate any particular false or wrong statement on Mahoney site? I wish this user luck with his article about Mount Abbot in British Columbia that he started. Admin please instruct users to stick with academic language and to stop false and absurd exaggerations.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=382678064Wikipedia:Articles for deletion/Polar Tree2010-09-03T14:39:21Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 31#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
<del>Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject<del>. <ins>'''Keep'''. The author of the article has produced at least one significant citation.</ins>[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.<br />
:::*You don't understand how Wikipedia works. We are not here to discuss viability or whether or not some piece of code exists. Nobody doubts that. Wikipedia is a refernce of third resort. That means [[WP:V|under Wikipedia's verifiability]] policy, [[WP:RS|reliable sources]] '''''must''''' be provided. This may be the greatest snippet of code that ever existed, but unless you can source it, it does no good, and it can't stay here, by policy. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 06:49, 26 August 2010 (UTC)<br />
<br />
:::*Than go ahead and do same thing to [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] and let me see how you will be ignored. ROLZ allegedly was introduced in WinRK. But it is proprietary software, disassembling is against the law. In the same way that in Polar Tree the algorithm was taken and implemented in BALZ compressor. One implementation and no explanation. Do you see similarities? What makes ROLZ worse that Polar Tree it is not even explained in the article. So, what we have: no reliable source, original research and no explanation. Look when the topic was introduced and look how long it is staying and neither you nor Sebastian suggest to remove it. Do not suggest me to nominate ROLZ for deletion because for me it is great and important algorithm but for you it is not because it is not cited in reliable sources not properly explained and is original research. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 16:54, 26 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
::::*Right, so you are obviously unconcerned about Wikipedia policies. Bottom line: if you can't agree with the terms of use then you shouldn't be editing Wikipedia in the first place. Simple as that. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:51, 26 August 2010 (UTC)<br />
*'''Comment''' [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]), unfortunately Wikipedia takes a conservative approach to new ideas. You'll either have to publish your work in a peer-reviewed medium or get an article written about it in a well-known publication first, before it will be accepted here. I suggest you devote your energy to these goals. Good luck! I hope your article will be here soon. &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 18:20, 26 August 2010 (UTC)<br />
<br />
*You and others keep repeating same things over and over ignoring obvious facts that I point out. Wikipedia publish new ideas, and [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] is one of them. You and others, participating in this discussion, do not make any decision. There is a MAN IN THE SHADOW that decides what stays and what goes away. He nominated article to deletion and not willing to identify himself. <br />
:*Actually, it was I who nominated the article, and no, I don't decide "what stays and what goes". '''Anyone''' can nominate an article for deletion, revert edits, and add content to the encyclopedia. It is by consensus that we reach our decisions, '''together'''. Furthermore, the reason why I haven't looked into the ROLZ article, quite frankly, is because I don't feel like playing your little game of "tit for tat". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC) <br />
<br />
*I have Ph.D. in Automatic Control and published many articles in peer-reviewed journals. I know how it all arranged. Articles are rejected independently on their merits unless its publication is arranged by a confidential phone call to editor-in-chief from a person he knows very well. The reason of rejection is avoiding responsibility by a reviewer, who can not possibly keep track on everything what is happening and afraid to pass plagiarized materials. Only articles sent from individuals with established reputation are published. My original article is published on my web site where I do not need to bow editor. Since it is already published it can't be republished somewhere else, journals do not accept copies. Wikipedia is different. It informs public, so it explains materials published somewhere else. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 03:39, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*While it is no doubt challenging to publish material for the first time, it is by no means impossible. You could, for example, contact an expert in the field (who has published papers WRT information theory or the like) and ask if they would be willing to co-write an article with you or some such (a professor at the university that you attended might be a good candidate for such a request). Moreover, if you haven't already submitted your article to a reputable publication, do so. Someone there may be interested enough to take a chance on a good idea (it may help if you point out to them that you have published in another field). [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC)<br />
<br />
*New independent reference [http://mattmahoney.net/dc/text.html Matt Mahoney web catalog]. The site is long. To find reference you need to find expression Polar codes in it. The site holder Matt Mahoney is world expert in data compression. His program PAQ8 holds the world record in compression [http://www.maximumcompression.com/data/bmp.php]. And we did not meet. I showed more independent usage than ROLZ. <br />
*Sebastian, stop discussing unimportant details. Speak on the context. I presented independent acknowledgment. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:37, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
*------------------------------------------------------------------<br />
I presented independent references that can be considered as peer-reviewed, because my referees provided unsolicited testing and links in a record time since first publication. In Large Text Compression Benchmark Matt Mahoney also explained the matter of the algorithm to his readers with his own words. Taking into consideration that Polar Tree or Polar Codes is only modification of Huffman and Shannon-Fano codes and not represent completely new research but rather modification I insist on keeping this article in Wikipedia. The name introduced by independent referees and assigned in accordance with other two codes named after inventors Shannon-Fano and Huffman. I suggest the individual that nominated article to deletion come out of the shadow and confront me in open scientific discussion. It is perfectly clear that those who participated in discussion so far did not nominate this article to deletion and their opinions will not be considered in final determination. Should this article happened to be deleted the brief history of the process along with independent references will be published on my web space [http://www.ezcodesample.com/prefixer/prefixer_article.html]. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 07:43, 28 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
*Sure, the Mahoney article would serve as an adequate reference, I think. Accordingly, I've changed my opinion to "keep". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 15:06, 28 August 2010 (UTC)<br />
*Thanks, Sebastian. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 21:23, 28 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<hr style="width:50%;" /><br />
:<span style="color:#FF4F00;">'''[[WP:RELIST|Relisted]] to generate a more thorough discussion so consensus may be reached.'''</span><br /><small>Please add new comments below this notice. Thanks, -- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 22:03, 31 August 2010 (UTC)</small><!-- from Template:Relist -->[[Category:Relisted AfD debates|{{SUBPAGENAME}}]]<br />
<!-- User:Phantomsteve/note -->*<small>'''Note''': I have relisted as the nominator withdrew their nomination, but there were 'delete' recommendations. As a result, I am unwilling to close this as 'keep' at this time. However, if all those who commented here are in agreement that this should be kept, it can be closed before the 7 day relisting period is up, unless further 'delete's are added.{{#if:||-- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 22:08, 31 August 2010 (UTC)}}</small><br />
<br />
*I have to thank somebody who contributed to the article by editing my clumsy English. Now the article sounds much better its original version. Let me also summarize my reasons for keeping article:<br />
1. It is not radically new data compression technique but slight modification of other known methods and has same purpose and its own advantage and disadvantage.<br />
2. In data compression area there is no such thing as best algorithm, because it depends on data. If you ask any expert to advice which data compression method to use, the answer will be 'What is your data?'. Wikipedia role is to inform people and let them choose. <br />
3. Waiting when method is used by many researchers and referred by many people is unacceptable in computer science, because it needs at least 10 years and what would Wikipedia look like if it publishes achievements in computer science from 10 years ago. People would not address to it. The computer science novelties have to be published quicker. <br />
4. The suggested technique was noticed immediately after publication, incorporated into a big project (that does not happen very often) and cataloged by expert in industry, so we have two independent reviews.<br />
I apologize if I was not very polite during debate. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:20, 1 September 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<!-- User:Phantomsteve/note -->*<small>'''Note''': I have left messages on the talk pages of {{u|HowardBGolden}}, {{u|Scope creep}} and {{u|Everard Proudfoot}} asking if they would leave a further comment here{{#if:||-- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 14:50, 1 September 2010 (UTC)}}</small><br />
<br />
:I stand by my '''delete'''. Still not notable. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:55, 1 September 2010 (UTC)<br />
:I can remide first message of [[User:Everard Proudfoot|Everard Proudfoot]] that says: Can you provide independent, third party reliable sources?<br />
The source that I provided later is catalog of all known data compression algorithms and programs mainained by guru in data compression Matt Mahoney - the computer analyst who holds the record in data compression, which is above benchmarks of many corporations that sell software. Matt Mahoney has Ph.D. in computer science. His catalog has status of on-line journal and not different from other peer reviewed journals. Mr. Mahoney has a reputation, he capable to understan merits of data compression algorithm and will definitely not put into catalog something that is wrong or ineffective. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 01:57, 2 September 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
:If Matt Mahoney is considered an expert in this field, then I think notability is established. (This isn't a field I know much about, nor have I read much about this subject, so I can't give any opinion on Matt Mahoney's eminence or lack thereof.) &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 02:42, 2 September 2010 (UTC)<br />
<br />
*'''Delete''' - There are zero reliable sources to indicate this is notable. Note that the reference to Matt Mahoney appears to be [http://mattmahoney.net/dc/text.html this] which specifically states "This is an open benchmark. Anyone may contribute results. Please read the rules first." -- [[User:Whpq|Whpq]] ([[User talk:Whpq|talk]]) 13:47, 3 September 2010 (UTC)<br />
:There is confirmation of novelty of the algorithm provided independently by industry expert in the form of notification to readers. So it is same as publication in peer reviewed journal. Anyone can contribute and many programs that are there effective but do not have novelties in algorithm. They are simply listed as benchmark. Polar codes are mentioned in different context. The benchmark shown, the matter of algorithm explained. The link to different from author implementation is provided. Wikipedia purpose is to notify public. Notability is not a goal. Notability is a means for preventing unverified materials to be published.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=382216250Wikipedia:Articles for deletion/Polar Tree2010-09-01T04:20:40Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 31#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
<del>Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject<del>. <ins>'''Keep'''. The author of the article has produced at least one significant citation.</ins>[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.<br />
:::*You don't understand how Wikipedia works. We are not here to discuss viability or whether or not some piece of code exists. Nobody doubts that. Wikipedia is a refernce of third resort. That means [[WP:V|under Wikipedia's verifiability]] policy, [[WP:RS|reliable sources]] '''''must''''' be provided. This may be the greatest snippet of code that ever existed, but unless you can source it, it does no good, and it can't stay here, by policy. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 06:49, 26 August 2010 (UTC)<br />
<br />
:::*Than go ahead and do same thing to [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] and let me see how you will be ignored. ROLZ allegedly was introduced in WinRK. But it is proprietary software, disassembling is against the law. In the same way that in Polar Tree the algorithm was taken and implemented in BALZ compressor. One implementation and no explanation. Do you see similarities? What makes ROLZ worse that Polar Tree it is not even explained in the article. So, what we have: no reliable source, original research and no explanation. Look when the topic was introduced and look how long it is staying and neither you nor Sebastian suggest to remove it. Do not suggest me to nominate ROLZ for deletion because for me it is great and important algorithm but for you it is not because it is not cited in reliable sources not properly explained and is original research. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 16:54, 26 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
::::*Right, so you are obviously unconcerned about Wikipedia policies. Bottom line: if you can't agree with the terms of use then you shouldn't be editing Wikipedia in the first place. Simple as that. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:51, 26 August 2010 (UTC)<br />
*'''Comment''' [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]), unfortunately Wikipedia takes a conservative approach to new ideas. You'll either have to publish your work in a peer-reviewed medium or get an article written about it in a well-known publication first, before it will be accepted here. I suggest you devote your energy to these goals. Good luck! I hope your article will be here soon. &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 18:20, 26 August 2010 (UTC)<br />
<br />
*You and others keep repeating same things over and over ignoring obvious facts that I point out. Wikipedia publish new ideas, and [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] is one of them. You and others, participating in this discussion, do not make any decision. There is a MAN IN THE SHADOW that decides what stays and what goes away. He nominated article to deletion and not willing to identify himself. <br />
:*Actually, it was I who nominated the article, and no, I don't decide "what stays and what goes". '''Anyone''' can nominate an article for deletion, revert edits, and add content to the encyclopedia. It is by consensus that we reach our decisions, '''together'''. Furthermore, the reason why I haven't looked into the ROLZ article, quite frankly, is because I don't feel like playing your little game of "tit for tat". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC) <br />
<br />
*I have Ph.D. in Automatic Control and published many articles in peer-reviewed journals. I know how it all arranged. Articles are rejected independently on their merits unless its publication is arranged by a confidential phone call to editor-in-chief from a person he knows very well. The reason of rejection is avoiding responsibility by a reviewer, who can not possibly keep track on everything what is happening and afraid to pass plagiarized materials. Only articles sent from individuals with established reputation are published. My original article is published on my web site where I do not need to bow editor. Since it is already published it can't be republished somewhere else, journals do not accept copies. Wikipedia is different. It informs public, so it explains materials published somewhere else. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 03:39, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*While it is no doubt challenging to publish material for the first time, it is by no means impossible. You could, for example, contact an expert in the field (who has published papers WRT information theory or the like) and ask if they would be willing to co-write an article with you or some such (a professor at the university that you attended might be a good candidate for such a request). Moreover, if you haven't already submitted your article to a reputable publication, do so. Someone there may be interested enough to take a chance on a good idea (it may help if you point out to them that you have published in another field). [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC)<br />
<br />
*New independent reference [http://mattmahoney.net/dc/text.html Matt Mahoney web catalog]. The site is long. To find reference you need to find expression Polar codes in it. The site holder Matt Mahoney is world expert in data compression. His program PAQ8 holds the world record in compression [http://www.maximumcompression.com/data/bmp.php]. And we did not meet. I showed more independent usage than ROLZ. <br />
*Sebastian, stop discussing unimportant details. Speak on the context. I presented independent acknowledgment. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:37, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
*------------------------------------------------------------------<br />
I presented independent references that can be considered as peer-reviewed, because my referees provided unsolicited testing and links in a record time since first publication. In Large Text Compression Benchmark Matt Mahoney also explained the matter of the algorithm to his readers with his own words. Taking into consideration that Polar Tree or Polar Codes is only modification of Huffman and Shannon-Fano codes and not represent completely new research but rather modification I insist on keeping this article in Wikipedia. The name introduced by independent referees and assigned in accordance with other two codes named after inventors Shannon-Fano and Huffman. I suggest the individual that nominated article to deletion come out of the shadow and confront me in open scientific discussion. It is perfectly clear that those who participated in discussion so far did not nominate this article to deletion and their opinions will not be considered in final determination. Should this article happened to be deleted the brief history of the process along with independent references will be published on my web space [http://www.ezcodesample.com/prefixer/prefixer_article.html]. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 07:43, 28 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
*Sure, the Mahoney article would serve as an adequate reference, I think. Accordingly, I've changed my opinion to "keep". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 15:06, 28 August 2010 (UTC)<br />
*Thanks, Sebastian. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 21:23, 28 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
<hr style="width:50%;" /><br />
:<span style="color:#FF4F00;">'''[[WP:RELIST|Relisted]] to generate a more thorough discussion so consensus may be reached.'''</span><br /><small>Please add new comments below this notice. Thanks, -- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 22:03, 31 August 2010 (UTC)</small><!-- from Template:Relist -->[[Category:Relisted AfD debates|{{SUBPAGENAME}}]]<br />
<!-- User:Phantomsteve/note -->*<small>'''Note''': I have relisted as the nominator withdrew their nomination, but there were 'delete' recommendations. As a result, I am unwilling to close this as 'keep' at this time. However, if all those who commented here are in agreement that this should be kept, it can be closed before the 7 day relisting period is up, unless further 'delete's are added.{{#if:||-- '''''[[User:Phantomsteve|<font color="#307D7E">Phantom</font><font color="#55CAFA">Steve</font>]]'''''/[[User talk:Phantomsteve|<font color="#008000">talk</font>]]&#124;[[Special:Contributions/Phantomsteve|<font color="#000080">contribs</font>]]\ 22:08, 31 August 2010 (UTC)}}</small><br />
<br />
*I have to thank somebody who contributed to the article by editing my clumsy English. Now the article sounds much better its original version. Let me also summarize my reasons for keeping article:<br />
1. It is not radically new data compression technique but slight modification of other known methods and has same purpose and its own advantage and disadvantage.<br />
2. In data compression area there is no such thing as best algorithm, because it depends on data. If you ask any expert to advice which data compression method to use, the answer will be 'What is your data?'. Wikipedia role is to inform people and let them choose. <br />
3. Waiting when method is used by many researchers and referred by many people is unacceptable in computer science, because it needs at least 10 years and what would Wikipedia look like if it publishes achievements in computer science from 10 years ago. People would not address to it. The computer science novelties have to be published quicker. <br />
4. The suggested technique was noticed immediately after publication, incorporated into a big project (that does not happen very often) and cataloged by expert in industry, so we have two independent reviews.<br />
I apologize if I was not very polite during debate.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=381459041Wikipedia:Articles for deletion/Polar Tree2010-08-28T07:43:12Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.<br />
:::*You don't understand how Wikipedia works. We are not here to discuss viability or whether or not some piece of code exists. Nobody doubts that. Wikipedia is a refernce of third resort. That means [[WP:V|under Wikipedia's verifiability]] policy, [[WP:RS|reliable sources]] '''''must''''' be provided. This may be the greatest snippet of code that ever existed, but unless you can source it, it does no good, and it can't stay here, by policy. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 06:49, 26 August 2010 (UTC)<br />
<br />
:::*Than go ahead and do same thing to [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] and let me see how you will be ignored. ROLZ allegedly was introduced in WinRK. But it is proprietary software, disassembling is against the law. In the same way that in Polar Tree the algorithm was taken and implemented in BALZ compressor. One implementation and no explanation. Do you see similarities? What makes ROLZ worse that Polar Tree it is not even explained in the article. So, what we have: no reliable source, original research and no explanation. Look when the topic was introduced and look how long it is staying and neither you nor Sebastian suggest to remove it. Do not suggest me to nominate ROLZ for deletion because for me it is great and important algorithm but for you it is not because it is not cited in reliable sources not properly explained and is original research. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 16:54, 26 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
::::*Right, so you are obviously unconcerned about Wikipedia policies. Bottom line: if you can't agree with the terms of use then you shouldn't be editing Wikipedia in the first place. Simple as that. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:51, 26 August 2010 (UTC)<br />
*'''Comment''' [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]), unfortunately Wikipedia takes a conservative approach to new ideas. You'll either have to publish your work in a peer-reviewed medium or get an article written about it in a well-known publication first, before it will be accepted here. I suggest you devote your energy to these goals. Good luck! I hope your article will be here soon. &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 18:20, 26 August 2010 (UTC)<br />
<br />
*You and others keep repeating same things over and over ignoring obvious facts that I point out. Wikipedia publish new ideas, and [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] is one of them. You and others, participating in this discussion, do not make any decision. There is a MAN IN THE SHADOW that decides what stays and what goes away. He nominated article to deletion and not willing to identify himself. <br />
:*Actually, it was I who nominated the article, and no, I don't decide "what stays and what goes". '''Anyone''' can nominate an article for deletion, revert edits, and add content to the encyclopedia. It is by consensus that we reach our decisions, '''together'''. Furthermore, the reason why I haven't looked into the ROLZ article, quite frankly, is because I don't feel like playing your little game of "tit for tat". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC) <br />
<br />
*I have Ph.D. in Automatic Control and published many articles in peer-reviewed journals. I know how it all arranged. Articles are rejected independently on their merits unless its publication is arranged by a confidential phone call to editor-in-chief from a person he knows very well. The reason of rejection is avoiding responsibility by a reviewer, who can not possibly keep track on everything what is happening and afraid to pass plagiarized materials. Only articles sent from individuals with established reputation are published. My original article is published on my web site where I do not need to bow editor. Since it is already published it can't be republished somewhere else, journals do not accept copies. Wikipedia is different. It informs public, so it explains materials published somewhere else. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 03:39, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*While it is no doubt challenging to publish material for the first time, it is by no means impossible. You could, for example, contact an expert in the field (who has published papers WRT information theory or the like) and ask if they would be willing to co-write an article with you or some such (a professor at the university that you attended might be a good candidate for such a request). Moreover, if you haven't already submitted your article to a reputable publication, do so. Someone there may be interested enough to take a chance on a good idea (it may help if you point out to them that you have published in another field). [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC)<br />
<br />
*New independent reference [http://mattmahoney.net/dc/text.html Matt Mahoney web catalog]. The site is long. To find reference you need to find expression Polar codes in it. The site holder Matt Mahoney is world expert in data compression. His program PAQ8 holds the world record in compression [http://www.maximumcompression.com/data/bmp.php]. And we did not meet. I showed more independent usage than ROLZ. <br />
*Sebastian, stop discussing unimportant details. Speak on the context. I presented independent acknowledgment. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:37, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
<br />
*------------------------------------------------------------------<br />
I presented independent references that can be considered as peer-reviewed, because my referees provided unsolicited testing and links in a record time since first publication. In Large Text Compression Benchmark Matt Mahoney also explained the matter of the algorithm to his readers with his own words. Taking into consideration that Polar Tree or Polar Codes is only modification of Huffman and Shannon-Fano codes and not represent completely new research but rather modification I insist on keeping this article in Wikipedia. The name introduced by independent referees and assigned in accordance with other two codes named after inventors Shannon-Fano and Huffman. I suggest the individual that nominated article to deletion come out of the shadow and confront me in open scientific discussion. It is perfectly clear that those who participated in discussion so far did not nominate this article to deletion and their opinions will not be considered in final determination. Should this article happened to be deleted the brief history of the process along with independent references will be published on my web space [http://www.ezcodesample.com/prefixer/prefixer_article.html].</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=381402698Wikipedia:Articles for deletion/Polar Tree2010-08-27T23:37:34Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.<br />
:::*You don't understand how Wikipedia works. We are not here to discuss viability or whether or not some piece of code exists. Nobody doubts that. Wikipedia is a refernce of third resort. That means [[WP:V|under Wikipedia's verifiability]] policy, [[WP:RS|reliable sources]] '''''must''''' be provided. This may be the greatest snippet of code that ever existed, but unless you can source it, it does no good, and it can't stay here, by policy. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 06:49, 26 August 2010 (UTC)<br />
<br />
:::*Than go ahead and do same thing to [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] and let me see how you will be ignored. ROLZ allegedly was introduced in WinRK. But it is proprietary software, disassembling is against the law. In the same way that in Polar Tree the algorithm was taken and implemented in BALZ compressor. One implementation and no explanation. Do you see similarities? What makes ROLZ worse that Polar Tree it is not even explained in the article. So, what we have: no reliable source, original research and no explanation. Look when the topic was introduced and look how long it is staying and neither you nor Sebastian suggest to remove it. Do not suggest me to nominate ROLZ for deletion because for me it is great and important algorithm but for you it is not because it is not cited in reliable sources not properly explained and is original research. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 16:54, 26 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
::::*Right, so you are obviously unconcerned about Wikipedia policies. Bottom line: if you can't agree with the terms of use then you shouldn't be editing Wikipedia in the first place. Simple as that. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:51, 26 August 2010 (UTC)<br />
*'''Comment''' [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]), unfortunately Wikipedia takes a conservative approach to new ideas. You'll either have to publish your work in a peer-reviewed medium or get an article written about it in a well-known publication first, before it will be accepted here. I suggest you devote your energy to these goals. Good luck! I hope your article will be here soon. &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 18:20, 26 August 2010 (UTC)<br />
<br />
*You and others keep repeating same things over and over ignoring obvious facts that I point out. Wikipedia publish new ideas, and [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] is one of them. You and others, participating in this discussion, do not make any decision. There is a MAN IN THE SHADOW that decides what stays and what goes away. He nominated article to deletion and not willing to identify himself. <br />
:*Actually, it was I who nominated the article, and no, I don't decide "what stays and what goes". '''Anyone''' can nominate an article for deletion, revert edits, and add content to the encyclopedia. It is by consensus that we reach our decisions, '''together'''. Furthermore, the reason why I haven't looked into the ROLZ article, quite frankly, is because I don't feel like playing your little game of "tit for tat". [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC) <br />
<br />
*I have Ph.D. in Automatic Control and published many articles in peer-reviewed journals. I know how it all arranged. Articles are rejected independently on their merits unless its publication is arranged by a confidential phone call to editor-in-chief from a person he knows very well. The reason of rejection is avoiding responsibility by a reviewer, who can not possibly keep track on everything what is happening and afraid to pass plagiarized materials. Only articles sent from individuals with established reputation are published. My original article is published on my web site where I do not need to bow editor. Since it is already published it can't be republished somewhere else, journals do not accept copies. Wikipedia is different. It informs public, so it explains materials published somewhere else. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 03:39, 27 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*While it is no doubt challenging to publish material for the first time, it is by no means impossible. You could, for example, contact an expert in the field (who has published papers WRT information theory or the like) and ask if they would be willing to co-write an article with you or some such (a professor at the university that you attended might be a good candidate for such a request). Moreover, if you haven't already submitted your article to a reputable publication, do so. Someone there may be interested enough to take a chance on a good idea (it may help if you point out to them that you have published in another field). [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:02, 27 August 2010 (UTC)<br />
<br />
*New independent reference [http://mattmahoney.net/dc/text.html Matt Mahoney web catalog]. The site is long. To find reference you need to find expression Polar codes in it. The site holder Matt Mahoney is world expert in data compression. His program PAQ8 holds the world record in compression [http://www.maximumcompression.com/data/bmp.php]. And we did not meet. I showed more independent usage than ROLZ. <br />
*Sebastian, stop discussing unimportant details. Speak on the context. I presented independent acknowledgment.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=381243310Wikipedia:Articles for deletion/Polar Tree2010-08-27T03:39:25Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.<br />
:::*You don't understand how Wikipedia works. We are not here to discuss viability or whether or not some piece of code exists. Nobody doubts that. Wikipedia is a refernce of third resort. That means [[WP:V|under Wikipedia's verifiability]] policy, [[WP:RS|reliable sources]] '''''must''''' be provided. This may be the greatest snippet of code that ever existed, but unless you can source it, it does no good, and it can't stay here, by policy. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 06:49, 26 August 2010 (UTC)<br />
<br />
:::*Than go ahead and do same thing to [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] and let me see how you will be ignored. ROLZ allegedly was introduced in WinRK. But it is proprietary software, disassembling is against the law. In the same way that in Polar Tree the algorithm was taken and implemented in BALZ compressor. One implementation and no explanation. Do you see similarities? What makes ROLZ worse that Polar Tree it is not even explained in the article. So, what we have: no reliable source, original research and no explanation. Look when the topic was introduced and look how long it is staying and neither you nor Sebastian suggest to remove it. Do not suggest me to nominate ROLZ for deletion because for me it is great and important algorithm but for you it is not because it is not cited in reliable sources not properly explained and is original research. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/74.244.80.58|74.244.80.58]] ([[User talk:74.244.80.58|talk]]) 16:54, 26 August 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot--><br />
::::*Right, so you are obviously unconcerned about Wikipedia policies. Bottom line: if you can't agree with the terms of use then you shouldn't be editing Wikipedia in the first place. Simple as that. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:51, 26 August 2010 (UTC)<br />
*'''Comment''' [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]]), unfortunately Wikipedia takes a conservative approach to new ideas. You'll either have to publish your work in a peer-reviewed medium or get an article written about it in a well-known publication first, before it will be accepted here. I suggest you devote your energy to these goals. Good luck! I hope your article will be here soon. &mdash; [[User:HowardBGolden|HowardBGolden]] ([[User talk:HowardBGolden|talk]]) 18:20, 26 August 2010 (UTC)<br />
<br />
*You and others keep repeating same things over and over ignoring obvious facts that I point out. Wikipedia publish new ideas, and [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv ROLZ] is one of them. You and others, participating in this discussion, do not make any decision. There is a MAN IN THE SHADOW that decides what stays and what goes away. He nominated article to deletion and not willing to identify himself. <br />
<br />
*I have Ph.D. in Automatic Control and published many articles in peer-reviewed journals. I know how it all arranged. Articles are rejected independently on their merits unless its publication is arranged by a confidential phone call to editor-in-chief from a person he knows very well. The reason of rejection is avoiding responsibility by a reviewer, who can not possibly keep track on everything what is happening and afraid to pass plagiarized materials. Only articles sent from individuals with established reputation are published. My original article is published on my web site where I do not need to bow editor. Since it is already published it can't be republished somewhere else, journals do not accept copies. Wikipedia is different. It informs public, so it explains materials published somewhere else.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=381056701Wikipedia:Articles for deletion/Polar Tree2010-08-26T04:52:06Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice on ROLZ.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=381056469Wikipedia:Articles for deletion/Polar Tree2010-08-26T04:50:17Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::*Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=381056379Wikipedia:Articles for deletion/Polar Tree2010-08-26T04:49:26Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 04:02, 25 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
::*I'm sorry, where does "polar tree" appear in that reference? And who published it? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 18:35, 25 August 2010 (UTC)<br />
::*Projects hosted at Google Code, SourceForge, and the like are not publications; they are repositories for code (and not necessarily endorsed by the sites that maintain them, anyway), and as such they don't qualify as reliable sources. Moreover, you seem to be confused about the concept of original research. It really isn't that hard to grasp: the synthesis of ideas not based on verifiable sources. From [http://en.wikipedia.org/wiki/Wikipedia:Verifiability#Self-published_sources_.28online_and_paper.29 here]: <br />
:::"Anyone can create a website or pay to have a book published, then claim to be an expert in a certain field. For that reason self-published media—including but not limited to books, newsletters, personal websites, open wikis, personal or group blogs, Internet forum postings, and tweets—are largely not acceptable. [...] Self-published material may in some circumstances be acceptable when produced by an established expert on the topic of the article whose work in the relevant field has previously been published by reliable third-party publications."<br />
::Can you provide any such citations? [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 19:42, 25 August 2010 (UTC)<br />
<br />
::Proudfoot, You try to move discussion away from the matter. We have to discuss merits of the article among professionals. Instead you try to question the citation. Citation shows that algorithm was found by someone, tested and left in software, not thrown away, because it provided improvement of exact the same nature that is claimed in the article. <br />
As I already said, you and Sebastian are pretending to follow Wikipedia policy to a letter when speaking about my article while looking to the side when I mention [http://en.wikipedia.org/wiki/Reduced_Offset_Lempel_Ziv article about ROLZ algorithm]. Because if you or Sebastian nominate ROLZ to deletion somebody will tell you both SHUT UP and you do as ordered. And ROLZ article is a classical case of violation of most Wikipedia policy. I will not nominate ROLZ to deletion or report it because I judge articles for its scientific values and from my point of view this article should be written but from yours it should be deleted. Go ahead and show your blind justice.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380851558User:C-processor/Polar Tree2010-08-25T04:16:11Z<p>C-processor: /* The concept */</p>
<hr />
<div><!-- Please do not remove or change this AfD message until the issue is settled --><br />
<!-- The nomination page for this article already existed when this tag was added. If this was because the article had been nominated for deletion before, and you wish to renominate it, please replace "page=Polar Tree" with "page=Polar Tree (2nd nomination)" below before proceeding with the nomination.<br />
-->{{AfDM|page=Polar Tree|year=2010|month=August|day=24|substed=yes}}<br />
<!-- For administrator use only: {{Old AfD multi|page=Polar Tree|date=24 August 2010|result='''keep'''}} --><br />
<!-- End of AfD message, feel free to edit beyond this point --><br />
{{multiple issues|orphan =August 2010|notability =August 2010|wikify =August 2010|refimprove =August 2010}}<br />
<br />
== The concept ==<br />
'''Polar Tree''' is set of binary codes assigned to a set of symbols in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are known as [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are called prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrences. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated in identical way during both encoding and decoding operations. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitutes novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10, even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman.<br />
<br />
== History ==<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by adaptive resorting of symbols on every step.<br />
<br />
== Independent implementation ==<br />
Although the method was recently introduced it was already beta tested in [http://code.google.com/p/lzham/ LZHAM algorithm].<br />
<br />
== Additional optimization by adaptive sorting ==<br />
The advantage of the algorithm is quick generation of code lengths. The trees, however, are replaced periodically after each relatively large fragment. To improve compression in [http://ezcodesample.com/prefixer/prefixer_article.html original DEMO program] the author suggests concept of floating leafs on the tree. This floating leafs concept is adaptive sorting on every step according to accumulated frequency. Presume in the middle of adaptation interval symbol B became more frequent than A. In this case they simply switch while tree stays the same and most frequent symbol encoded by shortest code already in the middle of adaptation interval. The same scenario is reproduced in decoding thus making decoding unmistakeably reversible. The additional advantage of this adaptive sorting or floating leafs is, that at the point of recreation of the tree, symbols are already sorted and time is not spent on sorting alphabet according to frequency.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. And it might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to description of LZHAM Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may represent good ground for application of either of binary coding technique.<br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380851441User:C-processor/Polar Tree2010-08-25T04:15:06Z<p>C-processor: /* The concept */</p>
<hr />
<div><!-- Please do not remove or change this AfD message until the issue is settled --><br />
<!-- The nomination page for this article already existed when this tag was added. If this was because the article had been nominated for deletion before, and you wish to renominate it, please replace "page=Polar Tree" with "page=Polar Tree (2nd nomination)" below before proceeding with the nomination.<br />
-->{{AfDM|page=Polar Tree|year=2010|month=August|day=24|substed=yes}}<br />
<!-- For administrator use only: {{Old AfD multi|page=Polar Tree|date=24 August 2010|result='''keep'''}} --><br />
<!-- End of AfD message, feel free to edit beyond this point --><br />
{{multiple issues|orphan =August 2010|notability =August 2010|wikify =August 2010|refimprove =August 2010}}<br />
<br />
== The concept ==<br />
'''Polar Tree''' is set of binary codes assigned to a set of symbols in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are known as [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are called prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrences. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated in identical way during both encoding and decoding operations. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitutes novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman.<br />
<br />
== History ==<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by adaptive resorting of symbols on every step.<br />
<br />
== Independent implementation ==<br />
Although the method was recently introduced it was already beta tested in [http://code.google.com/p/lzham/ LZHAM algorithm].<br />
<br />
== Additional optimization by adaptive sorting ==<br />
The advantage of the algorithm is quick generation of code lengths. The trees, however, are replaced periodically after each relatively large fragment. To improve compression in [http://ezcodesample.com/prefixer/prefixer_article.html original DEMO program] the author suggests concept of floating leafs on the tree. This floating leafs concept is adaptive sorting on every step according to accumulated frequency. Presume in the middle of adaptation interval symbol B became more frequent than A. In this case they simply switch while tree stays the same and most frequent symbol encoded by shortest code already in the middle of adaptation interval. The same scenario is reproduced in decoding thus making decoding unmistakeably reversible. The additional advantage of this adaptive sorting or floating leafs is, that at the point of recreation of the tree, symbols are already sorted and time is not spent on sorting alphabet according to frequency.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. And it might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to description of LZHAM Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may represent good ground for application of either of binary coding technique.<br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380850643User:C-processor/Polar Tree2010-08-25T04:08:18Z<p>C-processor: /* Additional optimization by adaptive sorting */</p>
<hr />
<div><!-- Please do not remove or change this AfD message until the issue is settled --><br />
<!-- The nomination page for this article already existed when this tag was added. If this was because the article had been nominated for deletion before, and you wish to renominate it, please replace "page=Polar Tree" with "page=Polar Tree (2nd nomination)" below before proceeding with the nomination.<br />
-->{{AfDM|page=Polar Tree|year=2010|month=August|day=24|substed=yes}}<br />
<!-- For administrator use only: {{Old AfD multi|page=Polar Tree|date=24 August 2010|result='''keep'''}} --><br />
<!-- End of AfD message, feel free to edit beyond this point --><br />
{{multiple issues|orphan =August 2010|notability =August 2010|wikify =August 2010|refimprove =August 2010}}<br />
<br />
== The concept ==<br />
'''Polar Tree''' is set of binary codes assigned to a set of symbols in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are known as [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are called prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrences. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated in identical way during both encoding and decoding operations. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman.<br />
<br />
== History ==<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by adaptive resorting of symbols on every step.<br />
<br />
== Independent implementation ==<br />
Although the method was recently introduced it was already beta tested in [http://code.google.com/p/lzham/ LZHAM algorithm].<br />
<br />
== Additional optimization by adaptive sorting ==<br />
The advantage of the algorithm is quick generation of code lengths. The trees, however, are replaced periodically after each relatively large fragment. To improve compression in [http://ezcodesample.com/prefixer/prefixer_article.html original DEMO program] the author suggests concept of floating leafs on the tree. This floating leafs concept is adaptive sorting on every step according to accumulated frequency. Presume in the middle of adaptation interval symbol B became more frequent than A. In this case they simply switch while tree stays the same and most frequent symbol encoded by shortest code already in the middle of adaptation interval. The same scenario is reproduced in decoding thus making decoding unmistakeably reversible. The additional advantage of this adaptive sorting or floating leafs is, that at the point of recreation of the tree, symbols are already sorted and time is not spent on sorting alphabet according to frequency.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. And it might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to description of LZHAM Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may represent good ground for application of either of binary coding technique.<br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380850469User:C-processor/Polar Tree2010-08-25T04:06:52Z<p>C-processor: /* Additional optimization by adaptive sorting */</p>
<hr />
<div><!-- Please do not remove or change this AfD message until the issue is settled --><br />
<!-- The nomination page for this article already existed when this tag was added. If this was because the article had been nominated for deletion before, and you wish to renominate it, please replace "page=Polar Tree" with "page=Polar Tree (2nd nomination)" below before proceeding with the nomination.<br />
-->{{AfDM|page=Polar Tree|year=2010|month=August|day=24|substed=yes}}<br />
<!-- For administrator use only: {{Old AfD multi|page=Polar Tree|date=24 August 2010|result='''keep'''}} --><br />
<!-- End of AfD message, feel free to edit beyond this point --><br />
{{multiple issues|orphan =August 2010|notability =August 2010|wikify =August 2010|refimprove =August 2010}}<br />
<br />
== The concept ==<br />
'''Polar Tree''' is set of binary codes assigned to a set of symbols in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are known as [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are called prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrences. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated in identical way during both encoding and decoding operations. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman.<br />
<br />
== History ==<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by adaptive resorting of symbols on every step.<br />
<br />
== Independent implementation ==<br />
Although the method was recently introduced it was already beta tested in [http://code.google.com/p/lzham/ LZHAM algorithm].<br />
<br />
== Additional optimization by adaptive sorting ==<br />
The advantage of the algorithm is quick generation of code lengths. The trees, however, are replaced periodically after each relatively large fragment. To improve compression in [http://ezcodesample.com/prefixer/prefixer_article.html original DEMO program] the author suggests concept of floating leafs on the tree. This floating leafs concept is adaptive sorting on every step according to accumulated frequency. Presume in the middle of adaptation interval symbol B became more frequent than A. In this case they simply switch while tree stays the same and most frequent symbol encoded by shortest code already in the middle of adaptation interval. The same scenario is reproduced in decoding thus making decoding unmistakeably reversible. The additional advantage of this adaptive sorting or floating leafs is that at the point of recreation of the tree symbols are already sorted and time is not spent or sorting alphabet according to frequency.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. And it might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to description of LZHAM Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may represent good ground for application of either of binary coding technique.<br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=380849956Wikipedia:Articles for deletion/Polar Tree2010-08-25T04:02:21Z<p>C-processor: /* Polar Tree */</p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:C-processor|C-processor]] ([[User talk:C-processor|talk]] • [[Special:Contributions/C-processor|contribs]]) 23:06, 24 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot--><br />
:*Can you provide independent, third party [[WP:RS|reliable sources]]? [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 23:52, 24 August 2010 (UTC)<br />
:*Here http://code.google.com/p/lzham/ The person who published reference and tested algorithm is not my friend. I did not study with him in university and did not drink in a pub.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=Wikipedia:Articles_for_deletion/Polar_Tree&diff=380809252Wikipedia:Articles for deletion/Polar Tree2010-08-24T23:06:38Z<p>C-processor: </p>
<hr />
<div>===[[Polar Tree]]===<br />
{{REMOVE THIS TEMPLATE WHEN CLOSING THIS AfD|T}}<br />
<br />
:{{la|Polar Tree}} – (<includeonly>[[Wikipedia:Articles for deletion/Polar Tree|View AfD]]</includeonly><noinclude>[[Wikipedia:Articles for deletion/Log/2010 August 24#{{anchorencode:Polar Tree}}|View log]]</noinclude>{{•}} {{plainlink|1=http://toolserver.org/~betacommand/cgi-bin/afdparser?afd={{urlencode:Wikipedia:Articles for deletion/Polar Tree}}|2=AfD statistics}})<br />
:({{Find sources|Polar Tree}})<br />
Article is based on original research (unpublished material). Unable to find any reliable sources to sufficiently establish notability for this subject. [[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:01, 24 August 2010 (UTC)<br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Software|list of Software-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*<small class="delsort-notice">'''Note''': This debate has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. <!--Template:Deletion sorting--></small><small>—[[User:Sebastiangarth|Sebastian Garth]] ([[User talk:Sebastiangarth|talk]]) 17:14, 24 August 2010 (UTC)</small><br />
*'''Delete'''. I tagged this for further information and for notability, but that hasn't happened. No evidence of notability. [[User:Everard Proudfoot|Everard Proudfoot]] ([[User talk:Everard Proudfoot|talk]]) 19:54, 24 August 2010 (UTC)<br />
*'''Weak Delete''' I'd say it's WP:OR but can't be sure. A mathematician needs to look at it. Certainly their is no mention in Google books, and you would expect at least a few hits. [[User:scope_creep|scope_creep]] ([[User talk:scope_creep|talk]]) 23:26, 24 August 2010 (UTC)<br />
* Article provides improvement of two previously known since 60 years ago methods of constructing prefix codes. Original research started 60 years ago. The method is recognized and used by independent software developer, not affiliated with author. NO NOTABILITY, NO ORIGINAL RESEARCH. I suggest to ask an opinion of mathematicians involved in data compression. User Proudfoot published article about garden in China. That does not say anything about his qualification in the article subject.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380109160User:C-processor/Polar Tree2010-08-21T07:10:05Z<p>C-processor: /* Limitations of the method */</p>
<hr />
<div>== The concept ==<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
Although the method was recently introduced it was already beta tested. According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. And it might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to last reference Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may represent good ground for application of either of binary coding technique.<br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380108922User:C-processor/Polar Tree2010-08-21T07:07:31Z<p>C-processor: /* Limitations of the method */</p>
<hr />
<div>== The concept ==<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
Although the method was recently introduced it was already beta tested. According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. And it might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to last reference Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may be one of the possible application of considered algorithm.<br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380108168User:C-processor/Polar Tree2010-08-21T06:59:26Z<p>C-processor: /* The concept */</p>
<hr />
<div>== The concept ==<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operations, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
Although the method was recently introduced it was already beta tested. According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression.<br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. An might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to last reference Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may be one of the possible application of considered algorithm. <br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380107864User:C-processor/Polar Tree2010-08-21T06:55:48Z<p>C-processor: </p>
<hr />
<div>== The concept ==<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
Although the method was recently introduced it was already beta tested. According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression. <br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. An might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to last reference Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may be one of the possible application of considered algorithm. <br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380107799User:C-processor/Polar Tree2010-08-21T06:55:08Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
== The concept ==<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
Although the method was recently introduced it was already beta tested. According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression. <br />
<br />
== Limitations of the method ==<br />
Polar tree is subject to the same limitations in data compression as other two binary prefix coding. It can not possibly compress anything to less than 1 bit per symbol. An might be far from statistical limit established by [[entropy]] for the data that could be compressed to low entropy. In the same way as [[Huffman coding]] and [[Shannon-Fano coding]] application of Polar coding is justified to data with large alphabets, which entropy is at least over 4 bits/symbol. According to last reference Polar coding was applied to literals left after application of LZ algorithm. As it is known literals are not very well compressed and may be one of the possible application of considered algorithm. <br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380106679User:C-processor/Polar Tree2010-08-21T06:42:13Z<p>C-processor: /* References */</p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression. <br />
<br />
== External links ==<br />
*[http://ezcodesample.com/prefixer/prefixer_article.html A. Polar, Non-Huffman Binary Tree. July, 2010]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380106123User:C-processor/Polar Tree2010-08-21T06:36:14Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.<br />
<br />
According to [http://code.google.com/p/lzham/ details regarding LZHAM algorithm] incorporation of Polar tree code lengths generation improved performance of decompression. <br />
<br />
== References ==</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380105444User:C-processor/Polar Tree2010-08-21T06:28:19Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program], which offers additional optimization by resorting on every step. The symbols are adaptively resorted on every step. For example, presume we replace the tree after every 1000 symbols, but somewhere in the middle of this fragment symbol B became most frequent (not A). In this case B and A are switched and B is encoded as one bit, so the tree stays still but symbols are floating withing the tree. That saves time on resorting. In every point when tree is updated the sorted list of frequencies is already available. That adaptive sorting may require only two elements switch on each step but for the most steps it is not necessary, so this sorting adds insignificant slow down in processing the data.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380104322User:C-processor/Polar Tree2010-08-21T06:15:27Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by [http://ezcodesample.com/prefixer/prefixer_article.html DEMO program]</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380103703User:C-processor/Polar Tree2010-08-21T06:09:48Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by DEMO program<ref>[http://ezcodesample.com/prefixer/prefixer_article.html]</ref>.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380103526User:C-processor/Polar Tree2010-08-21T06:08:19Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of runs is rarely more than 10 even for trees built for 256 symbols. All that makes code lengths generation extremely fast and allows frequent updates of the tree in adaptive encoding, which overwhelmingly compensate slight non-optimality of Polar coding compared to Huffman. <br />
<br />
The algorithm is published in July 2010 and backed up by <ref>[http://ezcodesample.com/prefixer/prefixer_article.html]</ref>DEMO program.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380101926User:C-processor/Polar Tree2010-08-21T05:52:39Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. <br />
<br />
The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}<br />
<br />
The starting data for building of the tree must be sorted list of all frequencies. The sum of all frequencies 39 is rounded up to a next power 2 number, which is 64, and, all frequencies are rounded down to the next power 2 number. On the next step we move top to bottom and double every frequency, which can be doubled without exceeding the total of 64, which we call target total. The result 16,8,8,8,8 is shown in the fourth column. Now we keep repeating previous step until sum of all frequencies becomes equal to target total. As we can see we need to repeat this step only once and obtain final list 32,8,8,8,8. The difference in bit lengths between modified frequency and target total is the code length for each symbol in the tree. <br />
Having code lengths we build actual codes by adding 1 and shifting to the left of each coding fragment to correspondent length. The last operation of building actual codes from the code lengths is known and used in building Huffman trees and also known as compact way of saving trees. So only generation of code lengths constitute novelty of algorithm. Operation of double of frequency is binary shift. When we add intermediate frequencies the numbers have only one positive bit and number of steps is rarely more than 10 even for trees built for 256 symbols.</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380098311User:C-processor/Polar Tree2010-08-21T05:18:09Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
!Code length<br />
!Code<br />
|- align="center"<br />
|A<br />
|15<br />
|8<br />
|16<br />
|32<br />
|1<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|4<br />
|8<br />
|8<br />
|3<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|4<br />
|8<br />
|8<br />
|3<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|4<br />
|8<br />
|8<br />
|3<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380097808User:C-processor/Polar Tree2010-08-21T05:13:09Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}<br />
<br />
In this particular case Polar codes are identical to Huffman codes, but in general case there may be some difference. Same is true for Shannon-Fano coding, they might be identical to Huffman as well. The algorithm of constructing of Polar codes goes over code lengths generation as it is shown in the next table.<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Original frequency<br />
!First run<br />
!Second run<br />
!Third run<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380096016User:C-processor/Polar Tree2010-08-21T04:58:59Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix coding because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380095822User:C-processor/Polar Tree2010-08-21T04:57:32Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix codes because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation of the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. Polar tree, in general case, is different from Huffman tree although may coincide in many cases, but it can be created or updated by very small number of operation, what makes it attractive in usage in different adaptive algorithms, where trees have to be updated frequently. In the table below the codes for all three trees are presented for the same example as considered in [[Shannon-Fano coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380094303User:C-processor/Polar Tree2010-08-21T04:47:05Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix codes because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven later, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. In adaptive encoding the tree is not output into encoded stream but updated synchronously during both encoding and decoding. The tree is created based on already seen symbols and applied to those new symbols that appear in the message. On that reason the difference in codes is not as important as precision in estimation frequencies for symbols that did not yet occur. For example, presume in adaptive encoding we start from default tree and update it after every 1000 symbols. In both encoding and decoding we may use statistics collected on first 1000 symbols and recreate the tree. New tree will be applied for encoding of next 1000 symbols, that are not yet occurred, and usage of [[Shannon-Fano coding]] or [[Huffman coding]] makes fraction of percent in the length of encoded fragment, while adaptation interval, strategy in updating frequencies or other mechanism of tree adjustment may provide significantly higher contribution into compression ratio. On that reason, in adaptive algorithms, the most important role plays the speed and convenience in recreation the tree rather than its optimality, because optimality exists only for provided frequencies while actual frequencies in adaptive encoding are always different from presumed. <br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380091281User:C-processor/Polar Tree2010-08-21T04:21:52Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]]. All three methods of constructing codes are known as prefix codes because non of these codes is the prefix of another code, which allows unmistakably to restore sequence of symbols from encoded binary stream. Historically [[Shannon-Fano coding]] was introduced earlier than [[Huffman coding]] and as, it was proven later, [[Huffman coding]] provides shortest possible encoded message for a given set of frequencies of occurrence. On that reason [[Huffman coding]] replaced [[Shannon-Fano coding]] for a very long time until adaptive entropy encoding technique was introduced and replaced completely static encoding. <br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380089476User:C-processor/Polar Tree2010-08-21T04:07:01Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|15<br />
|0<br />
|00<br />
|0<br />
|- align="center"<br />
|B<br />
|7<br />
|100<br />
|01<br />
|100<br />
|- align="center"<br />
|C<br />
|6<br />
|101<br />
|10<br />
|101<br />
|- align="center"<br />
|D<br />
|6<br />
|110<br />
|110<br />
|110<br />
|- align="center"<br />
|E<br />
|5<br />
|111<br />
|111<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380088840User:C-processor/Polar Tree2010-08-21T04:01:58Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]].<br />
<br />
{| class="wikitable"<br />
!Symbol<br />
!Frequency<br />
!Huffman codes<br />
!Shannon-Fano codes<br />
!Polar codes<br />
|- align="center"<br />
|A<br />
|B<br />
|C<br />
|D<br />
|E<br />
|- align="center"<br />
|15<br />
|7<br />
|6<br />
|6<br />
|5<br />
|- align="center"<br />
|0<br />
|100<br />
|101<br />
|110<br />
|111<br />
|- align="center"<br />
|0<br />
|100<br />
|101<br />
|110<br />
|111<br />
|- align="center"<br />
|0<br />
|100<br />
|101<br />
|110<br />
|111<br />
|}</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380087644User:C-processor/Polar Tree2010-08-21T03:52:11Z<p>C-processor: </p>
<hr />
<div>{{unsourced}}{{notable}}<br />
Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman coding]].</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380087531User:C-processor/Polar Tree2010-08-21T03:51:21Z<p>C-processor: </p>
<hr />
<div>Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Shannon-Fano coding]] and [[Huffman]].</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380087380User:C-processor/Polar Tree2010-08-21T03:50:09Z<p>C-processor: </p>
<hr />
<div>Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are [[Fano-Shannon]] and [[Huffman]].</div>C-processorhttps://en.wikipedia.org/w/index.php?title=User:C-processor/Polar_Tree&diff=380086957User:C-processor/Polar Tree2010-08-21T03:46:53Z<p>C-processor: ←Created page with 'Polar Tree is set of binary codes assigned to a symbol set in the process known in information theory as entropy encoding. The goal is to reduce the length ...'</p>
<hr />
<div>Polar Tree is set of binary codes assigned to a symbol set in the process known in [[information theory]] as [[entropy encoding]]. The goal is to reduce the length taken by encoded fragment. Other binary trees created for the same purpose are Fano-Shannon and Huffman.</div>C-processor