text:
User talk:Pne

Welcome
Hello, welcome to Wikipedia.

You might find these links helpful in creating new pages or helping with the above tasks: How to edit a page, How to write a great article, Naming conventions, Manual of Style. You should read our policies at some point too.

If you have any questions, see the help pages, add a question to the village pump or ask me on my talk page. I hope you enjoy editing here and being a Wikipedian!

 * If you made any edits before you got an account, you might be interested in assigning those to your username.

 * You can sign your name using three tildes, like this: . If you use four, you can add a datestamp too.

 * If you ever think a page or image should be deleted, please list it at the votes for deletion page. There is also a votes for undeletion page if you want to retrieve something that you think should not have been deleted.

Again, welcome! - UtherSRG 16:00, 17 Mar 2004 (UTC)

Thanks, that was my mistake :P -- EmperorBMA / ブライアン 18:40, 3 Apr 2004 (UTC)

Mathification of haversine formular
Hello. I think your "mathification" of haversine formula was a mistake. On most browsers, TeX looks good on Wikipedia when it is "displayed", but looks very bad when it is embedded in text. Michael Hardy 22:17, 12 Apr 2004 (UTC)
 * OK. It looked OK to me since I have my preferences set to render maths as HTML when it's simple (which included all examples in the running text, as they were mostly simple variable names. But keeping them as explicit italics (e.g. d instead of $$d$$ ) may be better. Thanks. pne 12:30, 13 Apr 2004 (UTC)

Germans
I've for long (a year, actually) been itched by the way Wikipedia-links are done with often sloppy distinctions between nationality, citizenship and ethnicity (with regard to persons) and also between nations and countries. This is particularly obvious in the case of people or entities that are denoted as German. A link to the Federal Republic of Germany is often outright unhistorical and wrong, but this has until now been the most usual.

That's why I'm considering an article on Germans, which I've started at the temporary location User:Ruhrjung/Germans. I would wish to avoid too much of edit wars after having started to link to the article. In particular, I would not wish to see the current disputes over German-Polish matters automatically extend also to this article, why I kindly ask you for comments now, in advance, in order to try to find wordings acceptable to as many as possible of concerned wikipedians.

(I guess I don't have to point out that ex-patriats often see these things much clearer than people who always have lived in Germany!)

I look forward to your comments at User talk:Ruhrjung/Germans. --Ruhrjung 00:04, 15 Apr 2004 (UTC)

 * Ich glaube nicht, dass ich dir hier groß helfen kann -- ich bin nicht wirklich das Maß aller Dinge in Bezug auf "was keinen Anstoß erregt". (Dafür bin ich überhaupt zu kurz dabei.) Trotzdem Danke für den Pointer, und viel Glück in deinem Vorhaben. -- pne 14:56, 16 Apr 2004 (UTC)

CPIDL
Hi, just returning your message.

It's not my fault if some people don't have IPA support. It is common practice on Wikipedia to give the name of a place or language in the native language, even when it uses non-basiclatin-characters, and policy basically says "Let the User be damned if He haþ not downlound proper support for It." (It referring to Unicode). What are the chances that somebody who can actually READ IPA will not have IPA support AND will stumble upon this page? Most readers are IPA-illiterate so it matters not either way. Also, SAMPA is ugly, caps-sensitive, and does not work for all languages. (thus you may advocate X-SAMPA, but...) I understand that you may disagree with me, but I have found that most users applaud my work to convert the page. As for the deletion of Finnish - I'm very sorry, it was not intentional and I will restore it presently. Common phrases in constructed languages - well, I was going to get to that, but in the mean time I'm converting SAMPA elsewhere on the 'pedia. Best Wishes, Node

 * SAMPA is ugly, caps-sensitive, and does not work for all languages.
 * It's also language-specific: a given symbol may have different meanings in different languages.
 * thus you may advocate X-SAMPA
 * Indeed. Or Kirshenbaum ASCII IPA. I don't mind much either way; Kirshenbaum was my first exposure to ASCIIfied IPA (on the alt.usage.english newsgroup), but since then, I've been exposed to X-SAMPA, e.g. on the CONLANG-L mailing list, and it seems to be more popular here on Wikipedia.
 * pne

Angela in Klingon
Hi. Feel free to fix my Klingon page. I have no objection to people editing my user pages. The majority of my user pages in other languages are probably ungrammatical and quite a few have been kindly fixed by people who speak the language better than I do. Angela. 04:07, 8 Jun 2004 (UTC)

Thanks Pne. I'll try to do my best :-) SweetLittleFluffyThing

Thanks!
I appreciate the info post. I don't think I've made any awful mistakes yet, but there are quite a few things in those links I hadn't seen yet. Mariko
 * Glad it helped. It's more or less what I was welcomed with :) -- pne 12:02, 16 Jun 2004 (UTC)

P.S. Also thanks for the Robert Jordan addition. I added those two authors because I'd looked at their entries recently -- I ought to go through and actively look for more... Mariko

;
Ive since changed my sig. :) Stevertigo 18:42, 17 Jun 2004 (UTC)

Privacy policy
Good evening. You recently weighed in with an opinion on the discussion at Wikipedia:Votes for deletion/User:Tim Starling/Password matches. On the basis of that discussion, I have proposed some changes to our privacy policy at Draft privacy policy. I would appreciate your thoughts if you have time. Rossami 22:20, 13 Jul 2004 (UTC)

HI
Good job, thanks for your contribution

user:Kolomonggo from Indonesia

PS: see me in Indonesian and Javanese Wikipedia too

Transcription of Greek spellings
Hi Pne,

The Latin character transcription of the Greek names in the List of country names in various languages needs to be made consistent. There are many ways of transcribing Greek, but the most important thing is to maintain internal consistency. I had attempted to use a more phonetic transcription style (e.g. y for γ before i and e, gh for γ elsewhere, dh for δ, but d for ντ, etc.) but Picapica changed the transcription style back to a more literal one that closely reflects the Greek letters. This is what I wrote to Picapica:

"You changed the Greek transcription style for all country names from the more phonetic one (Vélyio, Vulgharía, Dhanía, Éyiptos, etc.) which has the advantage of providing a clue to the pronunciation and avoids confusion with phonetic g, d corresponding to orthographic gk, nt (as in "dolmadhes" spelled "ntolmades"), to the more orthographic one (Vélgio, Vulgaría, Danía, Égiptos, etc.), which closely reflects the Greek spelling, but does not provide a clue to the pronunciation. Fine. Personally, I have a preference for the former style, but I am not going to argue about that. However, you overlooked Souidhía which you should have changed to Suidía."

So, you will probably understand now why I transcribed Γιουγκοσλαβική as Giunkoslavikí. I totally agree with you that γκ should be transcribed phonetically as g, however your current transcription Giugoslavikí is unacceptable, because it mixes two different transcription syles: the phonetic one (g for γκ) and the literal one (g for the initial γ). The transcription should be either entirely phonetic (i.e. Yiugoslavikí, which personally I would prefer) or entirely literal (i.e. Giunkoslavikí, or maybe even Giougkoslavikí to be absolutely faithful to the Greek letters).

My inclination would be to make all transcriptions phonetic. Please let me know what you think.

 * That is what I would prefer, too -- if you'll look at the edits I made several days ago, I used (though not completely consistently) spellings such as the dh and y which you mentioned. I would also prefer Yiugoslavikí or even Yugoslavikí.

 * As for ou vs. u, I don't have as strong an opinion, especially since the digraph ou is used for /u/ in other language such as French. It may be better to render Greek ου as u, though.

 * I'm divided on the spelling gh, which I'd render as g, though I agree that gh has merits, especially when contrasted with kh (my rendition of χ).

 * I think the main reason I meddled with Giunkoslavikí is that it also mixes phonetic and literal transcription - the n in it doesn't seem to make sense to me. Either write ng (phonetic) or gk (literal). Or to be hyper-literal, Giougkoslabikí or even, as I've seen occasionally (for modern Greek!) Giougkoslabikê (ick!). -- pne 07:32, 21 Jul 2004 (UTC)

P.S. BTW, it was also Picapica who removed i Káto Khóres - οι Κάτω Χώρες (for the Netherlands), which you had previously added. Thanks for putting it back. However, FYI, the Greek Wikipedia simply says: Káto Khóres - Κάτω Χώρες.

Pasquale 19:12, 20 Jul 2004 (UTC)

 * As Pasquale says: 'twas indeed I, Picapica, the thieving magpie, who stole Káto Hóres (as I would spell it). I honestly believe that this term really corresponds to English "the Low Countries", i.e. the Netherlands + Belgium, the historical Netherlands of Spanish and Austrian Netherlands fame. Much as I personally deplore the use of "Holland" and cognates to refer to the Netherlands, even the Royal Netherlands Embassy and Cultural Institute in Athens do not use Káto Hóres. But then again, I have been known to be wrong... :-) -- Picapica 19:33, 22 Jul 2004 (UTC)

 * P.S. pace Pasquale (and his "Picapica changed the transcription style back to a more literal one that closely reflects the Greek letters"), my transcription style -- though it eschews the non-phonemic distinctions sought by the use of dh / d and y / gh -- does not at all adhere rigidly to the Greek letters (that would, in any case, be transliteration, not transcription). Indeed, I have fought long and hard in various fora to be spared having to write such absurdities as "Ntoumpróvnik" for Dubrovnik, or even "Peiraiás/Peiraieús" for "Pireás/Pireéfs". (But don't get me on to all the difficulties involved in the dimotikí/katharévusa distinction!) -- Picapica 20:03, 22 Jul 2004 (UTC)

Planned/Constructed/Artificial Languages
I've seen your contributions there and would like to ask you to comment on a restructuring proposal at Talk:Planned language. -- Pjacobi

Hiligaynon vs. Ilonggo
Philip, I saw your query about the difference between Hiligaynon & Ilonggo on the Pages Needing Attention Page. Hiligaynon is the better term. Ilonggo refers to the dialect of Iloilo but nowadays it refers to the people and alternatively, the language. Hiligaynon is more inclusive and unambiguous. Furthermore, it's used by linguists in the field. --Chris 23:47, 2 Aug 2004 (UTC)

マイケル
Hey, I took your advice. A friend of mine had suggested the previous one, because I had orginally been using a really poor translation from bablefish. I asked him about it, and he said it's all just a matter of preference, so I switched to your suggestion. Thanks. — マイケル ₪  20:58, Aug 4, 2004 (UTC)

Ceqli
Pne, Ceqli language is up for undeletion and we really need your help in undeleting it. Too many Wikipedians are skipping right over my arguments for undeletion to vote "Keep deleted". Wiwaxia 04:04, 8 Oct 2004 (UTC)

 * We really need your vote and possibly your arguments. I know these people voted to keep deleted only because of the count of consensus, but they're really not in the spirit of VfU. If these articles were really deleted against consensus, we wouldn't need to put them on VfU to begin with. If you and enough people vote for the Ceqli article to be undeleted, they will undelete it. The undeleters don't even seem to pay attention to the reasons, only to the vote count. That's why we need someone like you. As for re-creating the article, articles that are re-created are supposed to be deleted -- immediately -- as a proper part of process. If you really want to undelete it properly, you'll need to vote undelete on Votes for Undeletion. Wiwaxia 04:11, 9 Oct 2004 (UTC)

Your name everywhere!
Just checked my watchlist and saw your name everywhere! Thanks for some very good edits on the breastfeeding article and numerous related ones. violet/riga (t) 07:42, 13 Oct 2004 (UTC)

Niuean language
I've just looked at Niuean language, which seems to be mostly your work, pne. Fantastic-looking job compared with the Maori language page, for example, which covers a language that has 15 times as many speakers.

 * Yes, indeed, the text is mostly by me, loosely based on some of the sources in the bibliography (but I tried to copy only facts rather than wording or presentation). And yes, I was a little proud that there was more on Niuean than on Maori :)

You may be interested to know that the New Zealand Prime Minister, Helen Clark, recently visited Niue and included in her speeches some reference to the fact that (as part of New Zealand's $3,000 per annum per resident subsidy to Niue) she was interested in helping to preserve the language.

 * Ah - interesting. Thanks. I had read it briefly on niuenews.nu but the fact had not really registered with me.

If anyone was interested in starting a Wikipedia for Niue, I would be willing to help, as I have for the Maori one. I could even write to the Prime Minister and ask her to publicise it if it got off the ground.

 * I think that would be very nifty! I'd thought about it in the past as well. However, I don't think there'd be enough contributors. I find Niuean interesting but I have next to no command of the language, so I'd be no use in writing articles.

I'm not sure how one should handle a language with two dialects!

 * The same way as in en, I'd say! After all, you have spelling variations (color/colour), word choice variations (truck/lorry), and grammar variations (went to the hospital/went to hospital) here, and the two main dialects appear to coexist fairly peacefully. I'd propose the same for a Niuean Wikipedia if it ever came to pass, with everyone editing in the dialect they're most familiar with. As far as I know, the two main dialects there are mutually comprehensible.

Robin Patterson 21:37, 1 Nov 2004 (UTC)

 * -- pne 04:57, 2 Nov 2004 (UTC)

Thank you, pne, for the informative responses. I tried to reply yesterday but WP staged a Go-slow just when I had a train to catch. Maybe we can post messages on Talk:Niue and Talk:Niuean language to see if there are any "speakers" who would like to take part in a joint project, with them doing the real writing and us playing around with machinery matters. I expect I know enough Maori language to be able to see if anyone's putting garbage on Niuean pages. Even one reasonably competent speaker willing to contribute an article a week would be better than what Wikipedia Maori has at present. Kind regards. Robin Patterson 06:30, 3 Nov 2004 (UTC)

Happy Birthday!
Happy birthday, Philip! Best wishes. --Whosyourjudas (talk) 03:15, 16 Nov 2004 (UTC)
 * Oooh, thanks! -~ pne 04:58, 16 Nov 2004 (UTC)

Hello!
Wow, who would have thought I'd find so many familiar faces on here! Just thought I'd wave and say hi! Redfarmer 14:59, 27 Nov 2004 (UTC)
 * Hi, Chris! -- pne 05:10, 29 Nov 2004 (UTC)

Article Licensing
Hi, I've started a drive to get users to multi-license all of their contributions that they've made to either (1) all U.S. state, county, and city articles or (2) all articles, using the Creative Commons Attribution-Share Alike (CC-by-sa) v1.0 and v2.0 Licenses or into the public domain if they prefer. The CC-by-sa license is a true free documentation license that is similar to Wikipedia's license, the GFDL, but it allows other projects, such as WikiTravel, to use our articles. Since you are among the top 1000 Wikipedians by edits, I was wondering if you would be willing to multi-license all of your contributions or at minimum those on the geographic articles. Over 90% of people asked have agreed. For More Information:
 * Multi-Licensing FAQ - Lots of questions answered
 * Multi-Licensing Guide
 * Free the Rambot Articles Project

To allow us to track those users who muli-license their contributions, many users copy and paste the " " template into their user page, but there are other options at Template messages/User namespace. The following examples could also copied and pasted into your user page:

 * Option 1
 * I agree to multi-license all my contributions, with the exception of my user pages, as described below:

OR
 * Option 2
 * I agree to multi-license all my contributions to any U.S. state, county, or city article as described below:

Or if you wanted to place your work into the public domain, you could replace " " with "  ". If you only prefer using the GFDL, I would like to know that too. Please let me know what you think at my talk page. It's important to know either way so no one keeps asking. -- Ram-Man (comment| talk)

Multi-licensing minor edits in sister projects
Thanks for helping me out. Do you happen to know if multi-licensing minor edits is possible in the sister projects, such as Wikiquote, and eventually Wikinews? (I know Wikinews is currently public domain.) —Vespristiano 05:16, 11 Dec 2004 (UTC)
 * My understanding is that you have copyright of your own edits and can, therefore, release them under as many licences as you want. An exception may be very minor edits such as correcting a typo or punctuation as there is no real "creative energy" in such changes, which is probably why some suggest putting such changes into the public domain -- since some hold such changes to be uncopyrightable anyway, and explicitly disclaiming copyright makes it unnecessary to guess. So I would guess that if you place an appropriate notice in an easily findable place (such as a user page) on other sites, you could do the same there, too. -- pne 06:49, 11 Dec 2004 (UTC)

Ashgabat???
Hi. I don't know how often you visit the List of European cities with alternative names these days, but there has been a controversy on its talk page for the past ten days or so, and I was wondering if you would care to review it and possibly intervene. Thank you. Pasquale 18:18, 17 Dec 2004 (UTC)

Klingon wikipedia needs admin
The Klingon wikipedia was devasteted by the autofellatio vandal, who moved around articles and edited the redirects thus it needs an admin to delete these redirect to move back to articles to their correct location. andy 12:20, 30 Mar 2005 (UTC)

Vandalism in progress
The Klingon Wikipedia badly needs your help. Can you permanently block tlh:lo'wI':Kevin baas (not to be confused with the admin on English Wikipedia)? This vandal is wreaking havoc on Klingon Wikipedia and using the aliases of English Wikipedia administators. →  Jarlaxle Artemis   21:57, Mar 30, 2005 (UTC)

 * I just figured out that the vandal's IP address is 203.172.255.253 . →  Jarlaxle  Artemis   03:01, Mar 31, 2005 (UTC)

 * Blocked name and IP for 6 months for now. Thanks for letting me know. -- pne 04:57, 31 Mar 2005 (UTC)

Zürich to Zurich
Zürich has been nominated on Requested moves for a page move to Zurich. Being a contributor to the previous vote you might like to express your opinion about this proposed move in the new vote on talk:Zürich. Philip Baird Shearer 09:15, 8 Apr 2005 (UTC)

India
How would I write India in klingon (both in Roman and the snative script)? =Nichalp (Talk)= 20:17, May 28, 2005 (UTC)

 * There isn't an official word for "India" in Klingon, to the best of my knowledge. I suppose one could write it phonetically.
 * Also, we don't know what the native Klingon writing system is like; the only thing we know about it is its name.
 * Why do you want to know? -- pne 10:22, 30 May 2005 (UTC)

 * Just noticed your reply, I wanted to make a page for India on the klingon wp. Regards, =Nichalp «Talk»=  July 6, 2005 12:57 (UTC)

 * FWIW, there is now a fairly official Klingon name for India: barat. (From the EuroTalk Talk Now! CD for Klingon.) But there’s no Klingon Wikipedia any more :) -- pne (talk) 11:36, 2 October 2012 (UTC)

lots of edits, not an admin
Hi - I made a list of users who've been around long enough to have made lots of edits but aren't admins. If you're at all interested in becoming an admin, can you please add an '*' immediately before your name in this list? I've suggested folks nominating someone might want to puruse this list, although there is certainly no guarantee anyone will ever look at it. Thanks. -- Rick Block (talk) 14:39, Jun 22, 2005 (UTC)

 * Interesting. I'm not sure whether I'd make a particularly good admin, but I starred myself on that page anyway -- if someone else would like to propose me, they can do so. -- pne 14:58, 22 Jun 2005 (UTC)

Stub templates
Hi - erm, you seem to have gone a little mad with Northern Virginia Regional Park Authority. You put stub, geo-stub, US-stub and US-south-geo-stub on it. US-south-geo-stub is the only one it should have, since that's a subcategory of both US stub and geo stub. And stub is only used on those which don't have more descriptive stub templates (as it says on the template!) So... nice work with the stub categorising, but just the best fitting template will do the job next time! :) Grutness...  wha?  06:32, 18 July 2005 (UTC)
 * Fair enough. The hierarchy's usually fairly straight forward (e.g., if it's Country-geo-stub it'll automatically be a subcategory of both country-stub and geo-stub), but better safe than sorry :). Grutness...  wha?  12:07, 18 July 2005 (UTC)

Geometric kite
Regarding the latest change, which is the former and which is the latter, it is unclear as you only mention kite flying in the sentence. Can you change it to "the geometric kite was inspired by the shape of the flying object" or whichever - I can't figureout which way it is. Onco_p53 11:14, 26 July 2005 (UTC)

List of country names in various languages under attack !!!
Dear Philip,

The List of country names in various languages, List of European regions with alternative names, List of European cities with alternative names, List of European rivers with alternative names, and others, have come under attack by a certain Mikka, who, having just stumbled into all these lists, having found them of little use to himself, and having repeatedly ridiculed them and their users, has then promptly filed a petition to delete the lists in question.

Please cast your vote to keep these valuable, informative, and indeed fascinating lists at Articles for deletion/List of country names in various languages.

Thanks! Pasquale 17:15, 2 November 2005 (UTC)

Well, Philip, I am truly sorry my attitude appeared to be disconcerting, but I truly was incensed. You have to realize that this began with Mikka criticizing the List of European regions with alternative names (on its talk page), which he had just happened upon for the first time (after apparently two years of Wikipedia contributions). In response, I pointed out to him (in a very civilized way, you can check) that there were many such sites, such as the List of country names in various languages, the List of European cities with alternative names, the List of European rivers with alternative names, and others. And what does Mikkalai do? He files a very broad AfD, just like that, referring to all those pages, immediately upon discovering their existence. Should I not have been incensed? Perhaps I still don't understand how the Wikipedia is supposed to work. Of the first three votes, two were in favor of the deletion, from people who had never contributed to any of those pages. That's when I decided I had to do something about it. Pasquale 20:58, 2 November 2005 (UTC)

Wikipedians/Germany is being replaced by a category
Hello! You were listed on the Wikipedians/Germany page as living in or being associated with Germany. As part of the User categorisation project, these lists are being replaced with user categories. If you would like to add yourself to the category that is replacing the page, or one of the Bundesland-based subcategories, please visit Category:Wikipedians in Germany for instructions. --Angr ( tɔk ) 15:17, 15 January 2006 (UTC)

New things for Germans and German-speakers
Hi again, I thought you might be interested in German-speaking Wikipedians' notice board and Portal:Germany. Angr/ talk 15:13, 10 February 2006 (UTC)

coincidence?
i searched through the history and the question at http://en.wikipedia.org/wiki/Talk:Telephone_numbering_plan#coincidence.3F relates to infomation you added. could you possiblly answer it? Plugwash 03:05, 16 February 2006 (UTC)
 * I posted a comment on that section of that talk page. -- pne (talk) 11:57, 16 February 2006 (UTC)

Please check your WP:NA entry
Greetings, editor! Your name appears on List of non-admins with high edit counts. If you have not done so lately, please take a look at that page and check your listing to be sure that following the particulars are correct: Thank you, and have a wiki wiki day! bd2412 T 03:23, 17 February 2006 (UTC)
 * 1) If you are an admin, please remove your name from the list.
 * 2) If you are currently interested in being considered for adminship, please be sure your name is in bold; if you are opposed to being considered for adminship, please cross out your name (but do not delete it, as it will automatically be re-added in the next page update).
 * 3) Please check to see if you are in the right category for classification by number of edits.

Java and Visual Studio
Hi. Thanks for tipping me off about the vfd.

I basically agree, but please see Talk:Java and Visual Studio. --Uncle Ed 16:20, 24 February 2006 (UTC)

Cardioid vs. Nephroid
Regarding your change to Caustic (optics), can you cite a reference that the form of the rays is a nephroid rather than a cardioid? There exists at least one reference that claims otherwise:, page 1.--Srleffler 03:33, 17 September 2006 (UTC)

 * Not a print reference, no. I went by what I read on the German Wikipedia, for example:

 * Ein typisches Beispiel dafür ist die „Kaffeetassen-Katakaustik“: wenn Licht schräg in eine Tasse mit glänzender Innenseite fällt, kann man am Tassenboden oder in einem etwas trüben Tasseninhalt herzförmige Lichtkringel beobachten, die durch die beschriebene Katakaustik gebildet werden. Dieser Lichtkringel wird mathematisch durch eine Nephroide beschrieben. (from de:Kaustik (Optik): a typical example is the "coffe-cup catacaustic": when light falls at an angle into a cup with a shiny inside, you can see heart-shaped light swirls at the bottom of the cup or on the surface of murky contents, which come from the mentioned catacaustic. These light swirls are described mathematically by a nephroid.)

 * Fällt Licht seitlich auf eine konkave, kreisförmige reflektierende Oberfläche, so bildet die Einhüllende der Lichtstrahlen die Hälfte einer Nephroide. Manchmal wird sie daher auch "Kaffeetassenkaustik" (Kaustik = Brennlinie) genannt. Man kann sie auch auf der Straße beobachten, wenn die blanken Felgen eines Fahrrades das Licht auf den Boden reflektieren: Da das Sonnenlicht den Zylindermantel der Fahrradfelge parallel trifft, bildet sich eine Brennfläche, deren Profil die Form einer halben Nephroide hat und die, wenn man sich leicht in die Kurve legt, mit dem ebenen Untergrund einen Teil einer Nephroide als Schnittfigur bildet.
 * Oft wird behauptet, die Lichterscheinung in einer Kaffeetasse, die von parallel einfallendem Licht getroffen wird, sei eine Kardioide. Das ist nicht richtig, es handelt sich bei Kardioide (algebraische Kurve 4. Grades) und Nephroide um verschiedene Kurven. (from de:Nephroide: [...] it is often claimed that the light phenomenon in a coffee cup struck by parallel rays is a cardioid. That is incorrect [...])

 * Oft wird behauptet, die Lichterscheinung in einer Kaffeetasse, die von parallel einfallendem Licht getroffen wird, sei eine Kardioide. Das ist nicht richtig, es handelt sich dabei um eine Nephroide. (from de:Kardioide: it is often claimed that the light phenomenon in a coffee cup struck by parallel rays is a cardioid. That is incorrect; it is a nephroid.)

 * On the other hand, this has also been challenged:

 * Für die Behauptung, die Kaffeetassenkaustik wäre keine Kardioide, würde ich gerne einen Beweis sehen. --Phrood 19:20, 24. Aug 2006 (CEST) (from de:Diskussion:Nephroide: I'd like to see some proof for the claim that the coffee cup caustic is not a cardioid)

 * However, the following bits from Mathworld seem relevant:

 * The cardioid [...] is the catacaustic formed by rays originating at a point on the circumference of a circle and reflected by the circle. (s.v. Cardioid)

 * Huygens showed in 1678 that the nephroid is the catacaustic of a circle when the light source is at infinity, an observation which he published in his Traité de la luminère in 1690 (MacTutor Archive). (s.v. Nephroid)

 * For radiant point at µ=∞, the catacaustic is the nephroid ''(s.v. Circle Catacaustic)'

 * See also Catacaustic, in particular the two lines starting with "circle catacaustic". So while I'm not experienced in optics or geometry, and don't know what the situation is for slanting parallel rays in 3D, the Mathworld bits do seem to me to support the claim that parallel rays in a coffee cup cause a nephroid rather than a cardioid. (And for "real-world" situations, where the rays do not come from an idealised point at infinity and where they are not exactly parallel, the shape is somewhere in between a nephroid and a cardioid -- an imperfect nephroid, if you will; at any rate, it has two cusps rather than one.) -- pne (talk) 06:02, 17 September 2006 (UTC)

Hello. I created a baby stub for the article benzethonium chloride.
Free free to jump into the contributions with this benzethonium chloride stub. Good Luck. BenzethoniumChloride 06:51, 28 September 2006 (UTC)

Ill Bethisad Article
Can you remember why you created the article? Did you know that it was recently deleted? (And restored by my protestations?) Bo-Lingua 20:10, 13 November 2006 (UTC)

 * Can you remember why you created the article? -- no, not specifically. I think it was a combination of the fact that a number of articles linked to it (with redlinks) and that it seemed a fairly notable conworld, as conworlds go, and deserved (in my mind) an article. Did you know that it was recently deleted? (And restored by my protestations?) No, I did not. Thank you, though! -- pne (talk) 08:54, 14 November 2006 (UTC)

 * I'm concerned it's going to be brought to a VfD; I know that it's notable enough in connection to the article on Brithenig and Wenedyk to merit its own space, given the notoriety of those two conlangs. You'll want to keep an eye out. :) Bo-Lingua 16:34, 14 November 2006 (UTC)

Non-clerical clothing
FYI, Haredi Jews wear a lot of interesting non-clerical religious clothing. Shtreimel etc. --Daniel575 | (talk) 12:09, 23 November 2006 (UTC)
 * Interesting. I wonder how much of this is specifically religious and how much is traditional/"ethnic"/etc. -- pne (talk) 13:02, 23 November 2006 (UTC)

Klingon Wikia - NEW
Hallo Pne! So findet man sich wieder ;-)

Ich wollte dich darüber informieren, dass der ehemalige Klingonische Teil von Wikipedia umgezogen ist, und nun wieder als Projekt aufgenommen wurde als Klingon Encyclopedia. Es würde mich freuen, dort wieder von dir zu hören/lesen.

I would like to inform you that the former Klingon section of Wikipedia (tlh) has moved to wikicities and will now be continued as Klingon Encyclopedia. I would be glad to hear/read from you there again.

Greetings, Lieven.

Articles you might like to edit, from SuggestBot
SuggestBot predicts that you will enjoy editing some of these articles. Have fun!

SuggestBot picks articles in a number of ways based on other articles you've edited, including straight text similarity, following wikilinks, and matching your editing patterns against those of other Wikipedians. It tries to recommend only articles that other Wikipedians have marked as needing work. Your contributions make Wikipedia better -- thanks for helping.

If you have feedback on how to make SuggestBot better, please tell me on SuggestBot's talk page. Thanks from ForteTuba, SuggestBot's caretaker.

P.S. You received these suggestions because your name was listed on the SuggestBot request page. If this was in error, sorry about the confusion. -- SuggestBot 14:49, 15 March 2007 (UTC)

Thought about archiving your talk page?
It's running a bit long. Cheers! bd2412 T 01:42, 4 May 2007 (UTC)

Rounding
Just noticed you manually rounded off census numbers in Wiseman, Alaska. I've pondered that in the past, but refrained because a) I didn't want to sign up to do all 30,000+ towns, and it would misleading inconsistent to have done some and not others, and b) it injects a bit of subjectivity into numbers, so they can't be mechanically verified in the future. Stan 15:49, 12 September 2007 (UTC)

Merger proposed: Hemlock Overlook Regional Park → Northern Virginia Regional Park Authority
It has been proposed to merge the content of Hemlock Overlook Regional Park into Northern Virginia Regional Park Authority. Since you have previously edited one of these articles, I thought you might be interested. You're welcome to participate in the discussion if you like. --B. Wolterding 18:30, 26 October 2007 (UTC)

November 2007
Welcome to Wikipedia. Everyone is welcome to contribute constructively to the encyclopedia. However, adding content without citing a reliable source is not consistent with our policy of verifiability. This is especially important when dealing with biographies of living people, but applies to all Wikipedia articles. Take a look at the welcome page to learn more about contributing to this encyclopedia. If you are already familiar with Citing sources please take this opportunity to add your original reference to the article. appears to be WP:OR... Anastrophe 15:51, 16 November 2007 (UTC)

AfD nomination of Ill Bethisad
An editor has nominated Ill Bethisad, an article on which you have worked or that you created, for deletion. We appreciate your contributions, but the nominator doesn't believe that the article satisfies Wikipedia's criteria for inclusion and has explained why in his/her nomination (see also "What Wikipedia is not").

Your opinions on whether the article meets inclusion criteria and what should be done with the article are welcome; please participate in the discussion by adding your comments at and please be sure to sign your comments with four tildes ( ~ ).

You may also edit the article during the discussion to improve it but should not remove the articles for deletion template from the top of the article; such removal will not end the deletion debate. Thank you. BJBot (talk) 21:44, 24 January 2008 (UTC)

WikiProject Germany Invitation
--Zeitgespenst (talk) 22:14, 10 March 2008 (UTC)

Rollback
I have granted rollback rights to your account; the reason for this is that after a review of some of your contributions, I believe I can trust you to use rollback correctly by using it for its intended usage of reverting vandalism, and that you will not abuse it by reverting good-faith edits or to revert-war. For information on rollback, see New admin school/Rollback and Rollback feature. If you do not want rollback, just let me know, and I'll remove it. Good luck and thanks. PeterSymonds (talk)  18:16, 16 June 2008 (UTC)

KP not in Hamburg
You're right about this. I must have had a brain malfunction. I believe she actually lives in or near Bonn, but I only have circumstantial evidence for that. BigBadaboom0 (talk) 13:21, 21 October 2008 (UTC)

Proposed deletion of Anabukinchan
A proposed deletion template has been added to the article Anabukinchan, suggesting that it be deleted according to the proposed deletion process  because of the following concern:
 * Insufficient notability. Mascot for non-notable companty w/o article

All contributions are appreciated, but this article may not satisfy Wikipedia's criteria for inclusion, and the deletion notice should explain why (see also "What Wikipedia is not" and Wikipedia's deletion policy). You may prevent the proposed deletion by removing the  notice, but please explain why you disagree with the proposed deletion in your edit summary or on its talk page.

Please consider improving the article to address the issues raised because, even though removing the deletion notice will prevent deletion through the proposed deletion process, the article may still be deleted if it matches any of the speedy deletion criteria or it can be sent to Articles for Deletion, where it may be deleted if consensus to delete is reached. Reywas92 Talk 19:33, 21 June 2009 (UTC)

Re:Anabukinchan
Just wanted to let you know that I put Anabukinchan up for deletion at Articles for deletion/Anabukinchan (3nd nomination). Reywas92 Talk 03:15, 28 June 2009 (UTC)

Proposed deletion of Qisda

The article Qisda has been proposed for deletion  because of the following concern:
 * Non-notable corporation

While all contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the  notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing  will stop the Proposed Deletion process, but other deletion processes exist. The Speedy Deletion process can result in deletion without discussion, and Articles for Deletion allows discussion to reach consensus for deletion. Oo7565 (talk) 05:24, 3 September 2009 (UTC)

Merge discussion for List of UK dialling codes covering Wales
An article that you have been involved in editing, List of UK dialling codes covering Wales, has been proposed for a merge with another article. If you are interested in the merge discussion, please participate by going, and adding your comments on the discussion page. Thank you. 90.208.56.217 (talk) 03:59, 29 July 2010 (UTC)

New message
Hello User:Pne, I came across your edit on Preity Zinta's article. Since you are quite familiar with the concept of phonetics and phonology, I was wondering if you could help me out by spelling Kareena Kapoor in IPA. I would really appreciate it if you could help me out with this. Thanks :) --  Bollywood Dreamz  talk 18:10, 25 August 2010 (UTC)

Speedy deletion nomination of Qisda

A tag has been placed on Qisda, requesting that it be speedily deleted from Wikipedia. This has been done under the criteria for speedy deletion, because the article seems to be unambiguous advertising that only promotes a company, product, group, service or person and would need to be fundamentally rewritten in order to become an encyclopedia article. Please read the general criteria for speedy deletion, particularly item 11, as well as the guidelines on spam.

If you can indicate why the subject of this article is not blatant advertising, you may contest the tagging. To do this, please add  on the top of Qisda and leave a note on |the article's talk page explaining your position. Please do not remove the speedy deletion tag yourself, but don't hesitate to add information to the article that would help make it encyclopedic, as well as adding any citations from independent reliable sources to ensure that the article will be verifiable. Feel free to leave a note on my talk page if you have any questions about this. USchick (talk) 22:49, 23 January 2011 (UTC)

Speedy deletion nomination of SoftMaker
The message placed here has been removed by the poster, please see below for the reason.

^^ Please ignore this message, it was placed in error whilst removing promotional edits from a blocked user. Sorry about that :) Barking Fish  14:25, 21 February 2011 (UTC)

File:Inuktitut.svg
Hi Pne, I noticed you reverted my change to File:Inuktitut.svg with the edit summary: apparently the ICI (Inuit Cultural Institute) orthography uses l with diagonal stroke (ł), not l with tilde (ɫ). I googled for this and I cannot find anything about this. There does not appear to be such an institute by that name. Do you have a link for this claim? Thanks! — Timwi (talk) 06:23, 26 June 2011 (UTC)

Inuktitut.svg: Response
I don't remember where I found the source of my information. It's possible, though, that it was http://www.gov.nu.ca/fonts/utilitiestechnicalguide.pdf#page=9 (pages 9 and 10), where the ICI orthography is described as using barred-el (ł).

On the other hand, http://www.nunatsiaqonline.ca/stories/article/taissumani_feb._4/ has a diagram that says it describes "The new “dual orthography” system that the Inuit Cultural Institute endorsed in 1976"; this diagram uses l-with-tilde (ɫ).

So I don't have an authoritative source either way - do you?

As for the existence of the ICI, the sources I found mostly refer to it in connection with the orthography standardisation process in 1976; it may well be that the organisation is defunct now, has merged with another organisation, and/or changed its name.

Some further pages mentioning the ICI are, (by one of the people present at that meeting, Mick Mallon),  (notable quote: "They had an institution in Eskimo Point [Arviat] at that time called the Inuit Cultural Institute", implying that the ICI is no longer), and  (which mentions the standardised orthography as "ICI (Inuit Cultural Institute) Roman or Syllabic Inuktitut"). Also, Inuktitut syllabics (which mentions "the Language Commission of the Inuit Cultural Institute" in connection with 1976), but then, Wikipedia itself is not a primary source. Finally, a brief mention in a book:.

For what it's worth, Louis-Jacques Dorais's The Inuit Language of Igloolik N.W.T. (Le Parler Inuit d’Igloolik T.N.O., IGLULINGMIUT UQAUSINGIT, ᐃᒡᓗᓕᖕᒥᐅᑦ ᐅᖃᐅᓯᖏᑦ; Université Laval, Québec, 1978; ISBN 2-920016-00-8) appears to use "ƚ" (with horizontal bar). It states that "The orthography is that approved by Inuit Tapirisat of Canada. The letter written ƚ stands for a voiceless l." I'm not sure what "the letter written ƚ" implies; it's possible that it means "the orthography approved by ITK contains no letter for this sound; we will write it ƚ", "the orthography contains a letter which we cannot reproduce due to technical limitations of the printing process and/or font used; we will therefore write the letter ƚ", "the orthography contains a letter ƚ which you may be unfamiliar with; will explain the value of this letter", or something else.

Mick Mallon's Introductory Inuktitut series uses l with a tilde running from \-\, i.e. reflected from the usual /-/ (~) shape. However, it also uses the letter ŋ, which may be helpful while learning (e.g. to recognise ŋŋ as a geminated ŋ; the relationship is a bit more obscure in the standard spellings nng vs. ng) but isn't standard ICI - so I'm not sure how much weight to attach to its spelling of the phoneme /ɬ/. (And in any case, it's possible that the spelling was influenced by the letters available in the fonts he had.) Also, where he doesn't use the usual font for Inuktitut but some other font, the letter may appear as "&" - for example, in the Exercises or Intermediate Inuktitut.

So, in summary, the impression I have received is that the ICI was real and did come up with an orthography, but it's not clear to me which Roman letter they proposed for the phoneme /ɬ/. And that in practice, printed texts may adhere more or less closely to the ICI standard orthography, and that the letter for /ɬ/ in particular seems to be chosen more by ease of typing or representation in fonts than by adherence to the standard. -- pne (talk) 08:35, 26 June 2011 (UTC)

 * Whoa! I didn’t expect such a detailed response :-) — Timwi (talk) 13:16, 26 June 2011 (UTC)

Disambiguation link notification for June 28
Hi. When you recently edited Speech balloon, you added a link pointing to the disambiguation page Pearls before Swine (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ* Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 15:00, 28 June 2012 (UTC)

 * Thanks for the notification! (And yes, I know you won’t read this; it’s for my own reference.) -- pne (talk) 20:45, 28 June 2012 (UTC)

Disambiguation link notification for October 2
Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited Huangpu District, Guangzhou, you added a link pointing to the disambiguation page Transcription (check to confirm | fix with Dab solver). Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ* Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 11:22, 2 October 2012 (UTC)

 * Thanks! I hadn’t checked the target of the link to see whether it’s a disambiguation page. Fixed now. -- pne (talk) 11:30, 2 October 2012 (UTC)

Inuit languages
Hi, I changed it to the more generic fish. After looking at some sources it could mean salmon, trout, char or just fish depending on the dialect. It would appear that the word does not really differentiate between different types of Salmonidae. CambridgeBayWeather (talk) 01:49, 4 October 2012 (UTC)

Bishop’s Stortford
Confused, what's the point of creating Bishop’s Stortford? Nyttend (talk) 23:32, 11 October 2012 (UTC)

 * I looked for the article under that lemma and didn’t find it, so I created a redirect. It’s the 21st century now and Unicode is getting more widely used, and I tend to expect “proper” typography to work in more and more places. -- pne (talk) 06:25, 12 October 2012 (UTC)

Speedy deletion nomination of File:Pngslimmer

A tag has been placed on File:Pngslimmer, requesting that it be speedily deleted from Wikipedia. This has been done for the following reason:

Moved image -No incoming links

Under the criteria for speedy deletion, articles that do not meet basic Wikipedia criteria may be deleted at any time.

If you think that the page was nominated in error, contest the nomination by clicking on the button labelled "Click here to contest this speedy deletion" in the speedy deletion tag. Doing so will take you to the talk page where you can explain why you believe the page should not be deleted. You can also visit the page's talk page directly to give your reasons, but be aware that once a page is tagged for speedy deletion, it may be removed without delay. Please do not remove the speedy deletion tag yourself, but do not hesitate to add information that is consistent with Wikipedia's policies and guidelines. If the page is deleted, you can contact one of these administrators to request that the administrator userfy the page or email a copy to you. Sfan00 IMG (talk) 20:18, 25 October 2012 (UTC)

FYI
After writing Kuspuk, I saw that it had been requested at WP:RA, and that you requested it! Just wanted to let you know that (four years later) we have the article. :) Calliopejen1 (talk) 01:06, 23 May 2014 (UTC)

Disambiguation link notification for December 7
Hi. Thank you for your recent edits. Wikipedia appreciates your help. We noticed though that when you edited List of Latin-script digraphs, you added a link pointing to the disambiguation page Cornish. Such links are almost always unintended, since a disambiguation page is merely a list of "Did you mean..." article titles. Read the FAQ* Join us at the DPL WikiProject.

It's OK to remove this message. Also, to stop receiving these messages, follow these opt-out instructions. Thanks, DPL bot (talk) 09:02, 7 December 2014 (UTC)

ArbCom elections are now open!
Hi, You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail. If you wish to participate, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 22:15, 30 November 2015 (UTC)

Proposed deletion of Ståle Schumacher

The article Ståle Schumacher has been proposed for deletion because of the following concern:
 * notability not established

While all constructive contributions to Wikipedia are appreciated, content or articles may be deleted for any of several reasons.

You may prevent the proposed deletion by removing the notice, but please explain why in your edit summary or on the article's talk page.

Please consider improving the article to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Ysangkok (talk) 23:34, 16 August 2016 (UTC)

A page you started (December solstice) has been reviewed!
Thanks for creating December solstice, Pne!

Wikipedia editor Kvng just reviewed your page, and wrote this note for you:

"revert"

To reply, leave a comment on Kvng's talk page.

Learn more about page curation.

~Kvng (talk) 02:34, 16 June 2017 (UTC)

A page you started (June solstice) has been reviewed!
Thanks for creating June solstice, Pne!

Wikipedia editor Kvng just reviewed your page, and wrote this note for you:

"revert"

To reply, leave a comment on Kvng's talk page.

Learn more about page curation.

~Kvng (talk) 02:35, 16 June 2017 (UTC)

Nomination of Claudio D. Zivic for deletion
A discussion is taking place as to whether the article Claudio D. Zivic is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Articles for deletion/Claudio D. Zivic until a consensus is reached, and anyone, including you, is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article. North America1000 11:18, 2 October 2018 (UTC)

ArbCom 2022 Elections voter message
 Hello! Voting in the 2022 Arbitration Committee elections is now open until 23:59 (UTC) on. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2022 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add to your user talk page. MediaWiki message delivery (talk) 00:25, 29 November 2022 (UTC)

ArbCom 2023 Elections voter message
 Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add to your user talk page. MediaWiki message delivery (talk) 00:20, 28 November 2023 (UTC)

title: User talk:Pne


text:
User:Trebor1990

See http://wiki.frath.net/index.php?title=User:Trebor.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User:Trebor1990


text:
Edward of Middleham, Prince of Wales

Edward of Middleham, Prince of Wales (c. December 1473 or 1476 – 9 April 1484), was the son and heir apparent of King Richard III of England by his wife Anne Neville. He was Richard's only legitimate child and died aged seven or ten.

Birth and titles
Edward was born at Middleham Castle, a stronghold close to York that became Richard and Anne's principal base in northern England. His birth date is usually given as around December 1473, but he may have been born as late as 1476. Professor Charles Ross wrote that the date 1473 "lacks authority. In fact, he was probably not born until 1476." The act of Parliament that settled the dispute between George of Clarence and Richard over Anne Beauchamp's inheritance just as if the Countess of Warwick "was naturally dead" was dated May 1474. The doubts cast by Clarence on the validity of Richard and Anne's marriage were addressed by a clause protecting their rights in the event they were divorced (i.e. of their marriage being declared null and void by the Church) and then legally remarried to each other, and also protected Richard's rights while waiting for such a valid second marriage with Anne. There were no provisions, however, for their heirs in case of this said divorce, which seems to confirm Richard and Anne had no children as of 1474. However, such provision was the province of the ruling king for those of royal blood, so would have been moot.

Edward was mostly kept at Middleham, and was known to be a sickly child.

In 1478, Edward was granted the title of Earl of Salisbury, previously held by the attainted George Plantagenet, 1st Duke of Clarence. The title became extinct on his death. His father became King of England on 26 June 1483, deposing his nephew Edward V. Edward did not attend his parents' coronation, probably due to illness. He was created Prince of Wales and Earl of Chester in a splendid ceremony in York Minster on 8 September 1483, following his parents' royal progress across England.

Death
Edward died on 9 April 1484, the anniversary of the death of his uncle, Edward IV. The reasons for his sudden death are unknown. The Croyland Chronicle reads:

However, in a short time after, it was fully seen how vain are the thoughts of a man who desires to establish his interests without the aid of God. For, in the following month of April, on a day not very far distant from the anniversary of king Edward, this only son of his, in whom all the hopes of the royal succession, fortified with so many oaths, were centred, was seized with an illness of but short duration, and died at Middleham Castle, in the year of our Lord, 1484, being the first of the reign of the said king Richard. On hearing the news of this, at Nottingham, where they were then residing, you might have seen his father and mother in a state almost bordering on madness, by reason of their sudden grief.

Edward's sudden death left Richard without a legitimate child. Contemporary historian John Rous recorded that Richard declared his nephew Edward, Earl of Warwick, his heir-presumptive, but there is no other evidence of this, and seems unlikely as Richard's own claim was based on the attainting of Warwick's father. Similarly, John de la Pole, 1st Earl of Lincoln also seemed to have been designated as Richard's heir-presumptive, but was never publicly proclaimed as such.

Richard's enemies were inclined to believe that Edward's sudden death was divine retribution for Richard's alleged involvement in the usurpation and subsequent disappearance of the sons of Edward IV, his nephews Edward V of England and Richard, Duke of York. It may have also emboldened them to renew hostilities.

Burial

The location of Edward's burial is unknown. A mutilated white alabaster cenotaph ("empty tomb") in the Church of St Helen and the Holy Cross at Sheriff Hutton, with an effigy of a child, was long believed to represent Edward of Middleham, but is now thought to be an earlier work depicting one of the Neville family.

Titles

 * 15 February 1478 onwards: Earl of Salisbury
 * 26 June 1483 onwards: Duke of Cornwall
 * 19 July 1483 onwards: Lord Lieutenant of Ireland
 * 8 September 1483 onwards: Prince of Wales and Earl of Chester

Arms
From 1483 to 1484, Edward used the arms of his father, debruised with a label of three points Argent.

title: Edward of Middleham, Prince of Wales


text:
Talk:Mickey Rooney

Sock
1) and all of his sockpuppets are EXPRESSLY banned for life.

2) Be on the look out for any edits from these IP addresses:
 * AOL NetRange: 92.10.0.0 - 92.13.255.255
 * AOL NetRange: 172.128.0.0 - 172.209.255.255
 * AOL NetRange: 195.93.0.0 - 195.93.255.255

I.E.
The article doesn't mention Rooney's autobiography I.E., and ought to IMO.—msh210℠ 08:51, 26 April 2023 (UTC)

title: Talk:Mickey Rooney


text:
Kademlia

Kademlia is a distributed hash table for decentralized peer-to-peer computer networks designed by Petar Maymounkov and David Mazières in 2002. It specifies the structure of the network and the exchange of information through node lookups. Kademlia nodes communicate among themselves using UDP. A virtual or overlay network is formed by the participant nodes. Each node is identified by a number or node ID. The node ID serves not only as identification, but the Kademlia algorithm uses the node ID to locate values (usually file hashes or keywords).

In order to look up the value associated with a given key, the algorithm explores the network in several steps. Each step will find nodes that are closer to the key until the contacted node returns the value or no more closer nodes are found. This is very efficient: like many other DHTs, Kademlia contacts only $O(\log n)$ nodes during the search out of a total of $$n$$ nodes in the system.

Further advantages are found particularly in the decentralized structure, which increases the resistance against a denial-of-service attack. Even if a whole set of nodes is flooded, this will have limited effect on network availability, since the network will recover itself by knitting the network around these "holes".

I2P's implementation of Kademlia is modified to mitigate Kademlia's vulnerabilities, such as Sybil attacks.

System details
Peer-to-peer networks are made of nodes, by design. The protocols that these nodes use to communicate, and locate information, have become more efficient over time. The first generation peer-to-peer file sharing networks, such as Napster, relied on a central database to co-ordinate lookups on the network. Second generation peer-to-peer networks, such as Gnutella, used flooding to locate files, searching every node on the network. Third generation peer-to-peer networks, such as Bittorrent, use distributed hash tables to look up files in the network. Distributed hash tables store resource locations throughout the network.

Kademlia uses a "distance" calculation between two nodes. This distance is computed as the exclusive or (XOR) of the two node IDs, taking the result as an unsigned integer number. Keys and node IDs have the same format and length, so distance can be calculated among them in exactly the same way. The node ID is typically a large random number that is chosen with the goal of being unique for a particular node (see UUID). It can and does happen that geographically far nodes – from Germany and Australia, for instance – can be "neighbors" if they have chosen similar random node IDs.

XOR was chosen because it acts as a distance function between all the node IDs. Specifically:
 * the distance between a node and itself is zero
 * it is symmetric: the "distances" calculated from A to B and from B to A are the same
 * it follows the triangle inequality: given A, B and C are vertices (points) of a triangle, then the distance from A to B is shorter than (or equal to) the sum of both the distance from A to C and the distance from C to B.

These three conditions are enough to ensure that XOR captures all of the essential, important features of a "real" distance function, while being cheap and simple to calculate.

Each Kademlia search iteration comes one bit closer to the target. A basic Kademlia search algorithm has complexity of  $O(log_{2} (n))$ , that means for network with $2^n$ nodes it will take at most $$n$$ steps to find that node.

Fixed-size routing tables
Fixed-size routing tables were presented in the pre-proceedings version of the original paper and are used in the later version only for some mathematical proofs. An actual Kademlia implementation does not have a fixed-size routing table, but a dynamically sized one.

Kademlia routing tables consist of a list for each bit of the node ID (e.g. if a node ID consists of 128 bits, a node will keep 128 such lists.) Every entry in a list holds the necessary data to locate another node. The data in each list entry is typically the IP address, port, and node ID of another node. Every list corresponds to a specific distance from the node. Nodes that can go in the nth list must have a differing nth bit from the node's ID; the first n-1 bits of the candidate ID must match those of the node's ID. This means that it is very easy to populate the first list as 1/2 of the nodes in the network are far away candidates. The next list can use only 1/4 of the nodes in the network (one bit closer than the first), etc.

With an ID of 128 bits, every node in the network will classify other nodes in one of 128 different distances, one specific distance per bit.

As nodes are encountered on the network, they are added to the lists. This includes store and retrieval operations and even helping other nodes to find a key. Every node encountered will be considered for inclusion in the lists. Therefore, the knowledge that a node has of the network is very dynamic. This keeps the network constantly updated and adds resilience to failures or attacks.

In the Kademlia literature, the lists are referred to as k-buckets. k is a system wide number, like 20. Every k-bucket is a list having up to k entries inside; i.e. for a network with k=20, each node will have lists containing up to 20 nodes for a particular bit (a particular distance from itself).

Since the possible nodes for each k-bucket decreases quickly (because there will be very few nodes that are that close), the lower bit k-buckets will fully map all nodes in that section of the network. Since the quantity of possible IDs is much larger than any node population can ever be, some of the k-buckets corresponding to very short distances will remain empty.

Consider the simple network to the right. The network size is 2^3 or eight maximum keys and nodes. There are seven nodes participating; the small circles at the bottom. The node under consideration is node six (binary 110) in black. There are three k-buckets for each node in this network. Nodes zero, one and two (binary 000, 001, and 010) are candidates for the farthest k-bucket. Node three (binary 011, not shown) is not participating in the network. In the middle k-bucket, nodes four and five (binary 100 and 101) are placed. Finally, the third k-bucket can only contain node seven (binary 111). Each of the three k-buckets are enclosed in a gray circle. If the size of the k-bucket was two, then the farthest 2-bucket can only contain two of the three nodes. For example, if node six has node one and two in the farthest 2-bucket, it would have to request a node ID lookup to these nodes to find the location (ip address) of node zero. Each node knows its neighbourhood well and has contact with a few nodes far away which can help locate other nodes far away.

It is known that nodes that have been connected for a long time in a network will probably remain connected for a long time in the future. Because of this statistical distribution, Kademlia selects long connected nodes to remain stored in the k-buckets. This increases the number of known valid nodes at some time in the future and provides for a more stable network.

When a k-bucket is full and a new node is discovered for that k-bucket, the least recently seen node in the k-bucket is PINGed. If the node is found to be still alive, the new node is placed in a secondary list, a replacement cache. The replacement cache is used only if a node in the k-bucket stops responding. In other words: new nodes are used only when older nodes disappear.

Protocol messages
Kademlia has four messages.
 * PING — Used to verify that a node is still alive.
 * STORE — Stores a (key, value) pair in one node.
 * FIND_NODE — The recipient of the request will return the k nodes in its own buckets that are the closest ones to the requested key.
 * FIND_VALUE — Same as FIND_NODE, but if the recipient of the request has the requested key in its store, it will return the corresponding value.

Each RPC message includes a random value from the initiator. This ensures that when the response is received it corresponds to the request previously sent (see magic cookie).

Locating nodes
Node lookups can proceed asynchronously. The quantity of simultaneous lookups is denoted by α and is typically three. A node initiates a FIND_NODE request by querying to the α nodes in its own k-buckets that are the closest ones to the desired key. When these recipient nodes receive the request, they will look in their k-buckets and return the k closest nodes to the desired key that they know. The requester will update a results list with the results (node IDs) it receives, keeping the k best ones (the k nodes that are closer to the searched key) that respond to queries. Then the requester will select these k best results and issue the request to them, and iterate this process again and again. Because every node has a better knowledge of its own surroundings than any other node has, the received results will be other nodes that are every time closer and closer to the searched key. The iterations continue until no nodes are returned that are closer than the best previous results. When the iterations stop, the best k nodes in the results list are the ones in the whole network that are the closest to the desired key.

The node information can be augmented with round trip times, or RTT. This information will be used to choose a time-out specific for every consulted node. When a query times out, another query can be initiated, never surpassing α queries at the same time.

Locating resources
Information is located by mapping it to a key. A hash is typically used for the map. The storer nodes will have information due to a previous STORE message. Locating a value follows the same procedure as locating the closest nodes to a key, except the search terminates when a node has the requested value in its store and returns this value.

The values are stored at several nodes (k of them) to allow for nodes to come and go and still have the value available in some node. Periodically, a node that stores a value will explore the network to find the k nodes that are close to the key value and replicate the value onto them. This compensates for disappeared nodes.

Also, for popular values that might have many requests, the load in the storer nodes is diminished by having a retriever store this value in some node near, but outside of, the k closest ones. This new storing is called a cache. In this way the value is stored farther and farther away from the key, depending on the quantity of requests. This allows popular searches to find a storer more quickly. Because the value is returned from nodes farther away from the key, this alleviates possible "hot spots". Caching nodes will drop the value after a certain time depending on their distance from the key.

Some implementations (e.g. Kad) have neither replication nor caching. The purpose of this is to remove old information quickly from the system. The node that is providing the file will periodically refresh the information onto the network (perform FIND_NODE and STORE messages). When all of the nodes having the file go offline, nobody will be refreshing its values (sources and keywords) and the information will eventually disappear from the network.

Joining the network
A node that would like to join the net must first go through a bootstrap process. In this phase, the joining node needs to know the IP address and port of another node—a bootstrap node (obtained from the user, or from a stored list)—that is already participating in the Kademlia network. If the joining node has not yet participated in the network it computes a random ID number, which by virtue of being a very large random number is extremely likely not to be already assigned to any other node. It uses this ID until leaving the network.

The joining node inserts the bootstrap node into one of its k-buckets. The joining node then performs a node lookup of its own ID against the bootstrap node (the only other node it knows). The "self-lookup" will populate other nodes' k-buckets with the new node ID, and will populate the joining node's k-buckets with the nodes in the path between it and the bootstrap node. After this, the joining node refreshes all k-buckets further away than the k-bucket the bootstrap node falls in. This refresh is just a lookup of a random key that is within that k-bucket range.

Initially, nodes have one k-bucket. When the k-bucket becomes full, it can be split. The split occurs if the range of nodes in the k-bucket spans the node's own id (values to the left and right in a binary tree). Kademlia relaxes even this rule for the one "closest nodes" k-bucket, because typically one single bucket will correspond to the distance where all the nodes that are the closest to this node are, they may be more than k, and we want it to know them all. It may turn out that a highly unbalanced binary sub-tree exists near the node. If k is 20, and there are 21+ nodes with a prefix "xxx0011....." and the new node is "xxx000011001", the new node can contain multiple k-buckets for the other 21+ nodes. This is to guarantee that the network knows about all nodes in the closest region.

Accelerated lookups
Kademlia uses an XOR metric to define distance. Two node IDs or a node ID and a key are XORed and the result is the distance between them. For each bit, the XOR function returns zero if the two bits are equal and one if the two bits are different. Distances in the XOR metric satisfy the triangle inequality: given A, B and C are vertices (points) of a triangle, then the distance from A to B is shorter than (or equal to) the sum of the distances from A to C and from C to B.

The XOR metric allows Kademlia to extend routing tables beyond single bits. Groups of bits can be placed in k-buckets. The group of bits are termed a prefix. For an m-bit prefix, there will be 2m-1 k-buckets. The missing k-bucket is a further extension of the routing tree that contains the node ID. An m-bit prefix reduces the maximum number of lookups from log2 n to log2m n. These are maximum values and the average value will be far less, increasing the chance of finding a node in a k-bucket that shares more bits than just the prefix with the target key.

Nodes can use mixtures of prefixes in their routing table, such as the Kad Network used by eMule. The Kademlia network could even be heterogeneous in routing table implementations, at the expense of complicating the analysis of lookups.

Academic significance
While the XOR metric is not needed to understand Kademlia, it is critical in the analysis of the protocol. The XOR arithmetic forms an abelian group allowing closed analysis. Other DHT protocols and algorithms require simulation or complicated formal analysis in order to predict network behavior and correctness. Using groups of bits as routing information also simplifies the algorithms.

Mathematical analysis of the algorithm
To analyze the algorithm, consider a Kademlia network of $$n$$ nodes with IDs $$x_1, \ldots, x_n$$, each of which is a string of length $$d$$ that consists of only ones and zeros. It can be modeled as a trie, in which each leaf represents a node, and the labeled path from the root to a leaf represents its ID. For a node $$x \in \{x_1, \ldots, x_n\}$$, let $$\mathcal D_i(x)$$ be the set of nodes (IDs) that share a prefix with $$x$$ of length $$d - i$$. Then filling the $$i$$-th bucket of $$x$$ can be modeled as adding pointers from the leaf $$x$$ to $$k$$ leaves (IDs) chosen uniformly at random from $$\mathcal D_i(x)$$. Thus routing can be seen as jumping among the leaves along these pointers such that each step goes towards the target ID as much as possible, i.e., in a greedy way.

Let $$T_{xy}$$ be number of jumps needed to go from the leaf $$x$$ to a target ID $$y$$. Assuming that $$x_1, \ldots, x_n$$ are chosen deterministically from $$\{0,1\}^d$$, it has been proved that
 * $$\sup_{x_1,\ldots, x_n} \, \sup_{x \in \{x_1,\ldots, x_n\}} \, \sup_{y \in \{0,1\}^d} \mathbb E[T_{xy}] \le (1+o(1)) \frac{\log n}{H_k} ,$$

where $$H_k$$ is the $$k$$-th harmonic number. Since $$H_k/\log k \to 1$$ as $$k \to \infty$$, when $$k$$ is large $$\mathbb E T_{xy}$$ is bounded from above by about $$\log_k n$$, however the IDs and the target are chosen. This justifies the intuition that in Kademlia only $$O(\log n)$$ nodes are contacted in searching for a target node.

To make the model closer to real Kademlia networks, $$x_1, \ldots, x_n$$ can also be assumed to be chosen uniformly at random without replacement from $$\{0,1\}^d$$. Then it can be proved that for all $$x \in \{x_1, \ldots, x_n\}$$ and $$y \in \{0,1\}^d$$,

\begin{align} & T_{xy} \xrightarrow{p} \frac{\log n}{c_k},\\ & \mathbb E[T_{xy}] \to \frac{\log n}{c_k}, \end{align} $$ where $$c_k$$ is a constant depending only on $$k$$ with $$c_k/H_k \to 1$$ as $$k \to \infty$$. Thus for $$k$$ large, $$\mathbb E T_{xy}/\log_k n$$ converges to a constant close $$1$$. This implies that the number of nodes need to be contact in searching for a target node is actually $$\Theta(\log n)$$ on average.

Use in file sharing networks
Kademlia is used in file sharing networks. By making Kademlia keyword searches, one can find information in the file-sharing network so it can be downloaded. Since there is no central instance to store an index of existing files, this task is divided evenly among all clients: If a node wants to share a file, it processes the contents of the file, calculating from it a number (hash) that will identify this file within the file-sharing network. Since file hashes and node IDs have the same length, the client can use the XOR distance function to search for several nodes whose ID is close to the hash, and instructs those nodes to store the publisher's IP address in an implementation-defined manner. Nodes with IDs closest to the file hash will therefore have a list of IP addresses of peers/publishers of this file, from which a client may in an implementation-defined manner download the file.

Clients that wish to download the file from this publisher do not have to know the publisher's IP address (there can be many publishers), but only the hash of the file. A searching client will use Kademlia to search the network for the node whose ID has the smallest distance to the file hash, then will retrieve the sources list that is stored in that node.

Since a key can correspond to many values, e.g. many sources of the same file, every storing node may have different information. Then, the sources are requested from all k nodes close to the key, k being the size of the bucket.

The file hash is usually obtained from a specially formed Internet magnet link found elsewhere, or included within an indexing file obtained from other sources.

Filename searches are implemented using keywords. The filename is divided into its constituent words. Each of these keywords is hashed and stored in the network, together with the corresponding filename and file hash. A search involves choosing one of the keywords, contacting the node with an ID closest to that keyword hash, and retrieving the list of filenames that contain the keyword. Since every filename in the list has its hash attached, the chosen file can then be obtained in the normal way.

Networks
Public networks using the Kademlia algorithm (these networks are incompatible with one another):
 * I2P: an anonymous overlay network layer.
 * Kad network: developed originally by the eMule community to replace the server-based architecture of the eDonkey network.
 * Ethereum: the node discovery protocol in the Ethereum blockchain network stack is based on a slightly modified implementation of Kademlia.
 * Overnet: With KadC a C library for handling its Kademlia is available. (development of Overnet is discontinued)

 * Mainline DHT: a DHT for BitTorrent based on an implementation of the Kademlia algorithm, for trackerless torrents.
 * Osiris (all version): used to manage distributed and anonymous web portal.
 * Retroshare: F2F decentralised communication platform with secure VOIP, instant messaging, file transfer etc.
 * Tox: a fully distributed messaging, VoIP and video chat platform
 * Gnutella DHT: originally by LimeWire to augment the Gnutella protocol for finding alternate file locations, now in use by other gnutella clients.
 * IPFS: a peer-to-peer distributed filesystem based on libp2p.

 * TeleHash: a mesh networking protocol that uses Kademlia to resolve direct connections between parties.
 * iMule: file sharing utility software for I2P.
 * OpenDHT: library providing an implementation of Kademlia, used by Jami and others.
 * GNUnet: alternative network stack for building secure, decentralized and privacy-preserving distributed applications. Uses randomized version of Kademlia called R5N.
 * Dat: a peer-to-peer file sharing tool based on the Hypercore Protocol.

title: Kademlia


text:
User:Nudder1

Nudder: One who nuds.

One: first, premiero, initial, original

title: User:Nudder1


text:
Aquaphobia

Aquaphobia is an irrational fear of water.

Aquaphobia is considered a specific phobia of natural environment type in the Diagnostic and Statistical Manual of Mental Disorders. A specific phobia is an intense fear of something that poses little or no actual danger.

Etymology
The correct Greek-derived term for "water-fear" is hydrophobia, from ὕδωρ (hudōr), "water" and φόβος (phobos), "fear". However, this word has long been used in many languages, including English, to refer specifically to a symptom of later-stage rabies, which manifests itself in humans as difficulty in swallowing, fear when presented with liquids to drink, and an inability to quench one's thirst. Therefore, fear or aversion to water in general is referred to as aquaphobia.

Prevalence
A study of epidemiological data from 22 low, lower-middle, upper-middle and high-income countries revealed "fear of still water or weather events" had a prevalence of 2.3%, across all countries; in the US the prevalence was 4.3%. In an article on anxiety disorders, Lindal and Stefansson suggest that aquaphobia may affect as many as 1.8% of the general Icelandic population, or almost one in fifty people. In America, 46% of American adults are afraid of deep water in pools and 64% are afraid of deep open waters.

Manifestation for aquaphobia
Specific phobias are a type of anxiety disorder in which a person may feel extremely anxious or have a panic attack when exposed to the object of fear. Specific phobias are a common mental disorder.

Psychologists indicate that aquaphobia manifests itself in people through a combination of experiential and genetic factors. Five common causes of aquaphobia: instinctive fear of drowning, experienced an incident of personal horror, has an overprotective parent/parent with aquaphobia, psychological difficulty adjusting to water and lack of trust in water.

In the case of a 37 year old media professor, he noted that his fear initially presented itself as a "severe pain, accompanied by a tightness of his forehead," and a choking sensation, discrete panic attacks and a reduction in his intake of fluids.

Signs and symptoms
Physical responses include nausea, dizziness, numbness, shortness of breath, increased heart rate, sweating, and shivering.

In addition the signs and symptoms above, some general signs and symptoms one may display in reaction to a specific phobia may include:
 * Physical Symptoms: trembling, hot flushes or chills, pain or tightness in chest, butterflies in stomach, feeling faint, dry mouth, ringing in ears, and confusion.
 * Psychological Symptoms: feeling fear of losing control, fainting, dread and dying.

Treatment and case studies
A few treatment options include:
 * Hypnosis and systematic desensitization - 28-year-old female, aquaphobia from childhood, hypnosis and systematic desensitization in an 8-week 5-session program, 2-month and 1-year follow up. 37-year-old male, 10 years of extreme aquaphobia (could not even drink water), 6 sessions of hypnotherapy, therapy was successful, no relapse and 6 month follow up.
 * Cognitive Behavioral Therapy
 * Exposure therapy
 * Medication

title: Aquaphobia


text:
Douglass Dumbrille

Douglass Rupert Dumbrille (October 13, 1889 – April 2, 1974) was a Canadian actor who appeared regularly in films from the early 1930s.

Life and career
Douglass Dumbrille was born in Hamilton, Ontario. As a young man, he was employed as a bank clerk in Hamilton while pursuing an interest in acting. He eventually left banking for the theatre, finding work with a stock company that led him to Chicago, Illinois, and another that toured the United States.

In 1913, the East Coast film industry was flourishing and that year he appeared in the film What Eighty Million Women Want, but it would be another 11 years before he appeared on screen again. In 1924, he made his Broadway debut and worked off and on in the theatre for several years while supplementing his income by selling such products as car accessories, tea, insurance, real estate, and books.

During the Great Depression, Dumbrille resumed his screen career in Hollywood, where he specialized in playing secondary character roles alongside the great stars of the day. His physical appearance and suave voice equipped him for roles as slick politician, corrupt businessman, crooked sheriff, or unscrupulous lawyer. He was highly regarded by the studios, and was sought out by Cecil B. DeMille, Frank Capra, Hal Roach and other prominent Hollywood filmmakers.

He played similar roles in Capra's film Broadway Bill (1934) (and the 1950 remake, Riding High), and DeMille's version of The Buccaneer (1938, and the 1958 remake). A friend of fellow Canadian-born director Allan Dwan, Dumbrille played Athos in Dwan's adaptation of The Three Musketeers (1939).

Dumbrille had roles in more than 200 motion pictures. He also played villainous roles in comedies, projecting a balance of menace and pomposity opposite the Marx Brothers, Abbott and Costello, and The Bowery Boys.

He portrayed the Egyptian priest and magician Jannes in DeMille's final film, The Ten Commandments (1956).

With the advent of television, Dumbrille made numerous appearances in the 1950s and 1960s. He played a flustered tycoon driven to distraction by Gracie Allen on the Burns and Allen episode "Company for Christmas" (1955). He was cast in six episodes of the religion anthology series, Crossroads. He portrayed Senator Bates in "Thanksgiving Prayer" (1956) with Ron Hagerthy of Sky King. Dumbrille then portrayed Mr. Willoughby in "Big Sombrero" (1957). He guest-starred in the 1957 episode "The Fighter" of the CBS situation comedy Mr. Adams and Eve. In 1958, he was cast as Mayor John Geary in three episodes of the NBC western series, The Californians. He subsequently guest-starred in Frank Aletter's CBS sitcom, Bringing Up Buddy. He portrayed Mr. Osborne in six episodes of the 1963–1964 situation comedy The New Phil Silvers Show.

Dumbrille made two guest appearances as a judge on CBS's Perry Mason; in 1964 he played Judge Robert Adler in "The Case of the Latent Lover", and in 1965 he played an unnamed judge in "The Case of the Duplicate Case". In his final television role, he portrayed a doctor in episode 10 of Batman in February 1966.

Personal life
Dumbrille's wife Jessie Lawson, mother of their son John and daughter Douglass (Dougie), died in 1957 after 47 years of marriage. In 1960, at the age of 70, Dumbrille married Patricia Mowbray, the 28-year-old daughter of his friend and fellow actor, Alan Mowbray. In response to criticism of the May–December marriage, Dumbrille rebuffed: "Age doesn’t mean a blasted thing. The important thing is whether two people can be happy together. Pat and I agreed that I had some years left and we could best share them together. We don’t give a continental damn what other people think."

Dumbrille died of a heart attack on April 2, 1974, at the Motion Picture Country Home and Hospital in Woodland Hills, California.

Selected filmography

 * What 80 Million Women Want (1913, silent film) as Minor Role
 * The Declaration of Independence (1924, Short) as Thomas Paine
 * His Woman (1931) as Alisandroe (uncredited)
 * The Wiser Sex (1932) as Chauffeur - aka The Wop
 * Blondie of the Follies (1932) as Murchenson
 * That's My Boy (1932) as Coach 'Daisy' Adams
 * The Pride of the Legion (1932) as McMahon
 * I Am a Fugitive from a Chain Gang (1932) as District Attorney (uncredited)
 * Laughter in Hell (1933) as Ed Perkins
 * Hard to Handle (1933) as District Attorney (uncredited)
 * Smoke Lightning (1933) as Sam Edson
 * King of the Jungle (1933) as Ed Peters
 * Rustlers' Roundup (1933) as Bill Brett
 * The Working Man (1933) as Hammersmith - Lawyer (uncredited)
 * Elmer, the Great (1933) as Stillman (uncredited)
 * The Silk Express (1933) as Myton Associate (uncredited)
 * Heroes for Sale (1933) as Jim - Chief Engineer (uncredited)
 * The Man Who Dared (1933) as Judge Collier
 * Baby Face (1933) as Brody
 * Voltaire (1933) as Actor - Oriental King in Play (uncredited)
 * The Big Brain (1933) as Dan Thomas
 * I Loved a Woman (1933) as U.S. Attorney Brandt (uncredited)
 * The Way to Love (1933) as Agent Chapusard
 * Female (1933) as George Mumford
 * The World Changes (1933) as Buffalo Bill Cody
 * Lady Killer (1933) as Spade Maddock
 * Convention City (1933)
 * Massacre (1934) as Sen. Emory - Chairman (uncredited)
 * Hi, Nellie! (1934) as Dawes
 * Journal of a Crime (1934) as Germaine Cartier
 * Harold Teen (1934) as H.H. Snatcher
 * Fog Over Frisco (1934) as Mayard
 * Operator 13 (1934) as Gen. Stuart
 * Treasure Island (1934) as Israel Hands
 * Hide-Out (1934) as DeSalle - Nightclub Owner
 * Broadway Bill (1934) as Eddie Morgan
 * The Secret Bride (1934) as Breeden
 * The Lives of a Bengal Lancer (1935) as Mohammed Khan
 * Naughty Marietta (1935) as Uncle
 * Cardinal Richelieu (1935) as Count Baradas
 * Air Hawks (1935) as Victor Arnold
 * Unknown Woman (1935) as Phil Gardner
 * Love Me Forever (1935) as Miller
 * The Public Menace (1935) as Mario Tonelli
 * Peter Ibbetson (1935) as Col. Forsythe
 * Crime and Punishment (1935) as Grilov
 * The Calling of Dan Matthews (1935) as Jeff Hardy
 * The Lone Wolf Returns (1935) as Morphew
 * You May Be Next (1936) as Beau Gardner
 * The Music Goes 'Round (1936) as Bishop
 * Mr. Deeds Goes to Town (1936) as John Cedar
 * The Witness Chair (1936) as Stanley Whittaker
 * The Princess Comes Across (1936) as Detective Lorel
 * M'Liss (1936) as Lou Ellis
 * End of the Trail (1936) as Bill Mason
 * Counterfeit Lady (1936) as August Marino
 * Woman in Distress (1937) as Jerome Culver
 * A Day at the Races (1937) as J.D. Morgan
 * The Emperor's Candlesticks (1937) as Mr. Korum - a Conspirator
 * The Firefly (1937) as Marquis de Melito
 * Ali Baba Goes to Town (1937) as Prince Musah
 * The Buccaneer (1938) as Governor William C.C. Claiborne
 * Stolen Heaven (1938) as Klingman
 * Fast Company (1938) as Arnold Stamper
 * The Mysterious Rider (1938) as Pecos Bill - aka Ben Wade
 * Crime Takes a Holiday (1938) as J.J. Grant
 * Storm Over Bengal (1938) as Ramin Khan
 * Sharpshooters (1938) as Count Maxim
 * Kentucky (1938) as John Dillon - 1861
 * The Three Musketeers (1939) as Athos
 * Mr. Moto in Danger Island (1939) as La Costa
 * Tell No Tales (1939) as Matt Cooper
 * Captain Fury (1939) as Preston
 * Charlie Chan at Treasure Island (1939) as Thomas Gregory
 * Thunder Afloat (1939) as District Commander
 * Rovin' Tumbleweeds (1939) as Stephen Holloway
 * Charlie Chan in City in Darkness (1939) as Petroff
 * Slightly Honorable (1939) as George Taylor
 * Virginia City (1940) as Major Drewery
 * South of Pago Pago (1940) as Williams
 * Michael Shayne, Private Detective (1940) as Gordon
 * Murder Among Friends (1941) as Carter Stevenson
 * The Round Up (1941) as Capt. Bob Lane
 * Road to Zanzibar (1941) as Slave Trader
 * Washington Melodrama (1941) as Donnelly
 * The Big Store (1941) as Mr. Grover
 * Ellery Queen and the Perfect Crime (1941) as John Matthews
 * Castle in the Desert (1942) as Paul Manderley
 * Ride 'Em Cowboy (1942) as Jake Rainwater
 * A Gentleman After Dark (1942) as Enzo Calibra
 * Ten Gentlemen from West Point (1942) as Gen. William Henry Harrison
 * I Married an Angel (1942) as Baron Szigethy
 * King of the Mounties (1942) as Harper
 * Stand By for Action (1942) as Capt. Ludlow
 * DuBarry Was a Lady (1943) as Willie / Duc de Rigor
 * False Colors (1943) as Mark Foster
 * Uncertain Glory (1944) as Police Commissioner LaFarge
 * Lumberjack (1944) as Daniel J. Keefer
 * Jungle Woman (1944) as District Attorney
 * Forty Thieves (1944) as Tad Hammond
 * Gypsy Wildcat (1944) as Baron Tovar
 * Lost in a Harem (1944) as Nimativ
 * Jungle Queen (1945) as Lang
 * A Medal for Benny (1945) as General
 * The Frozen Ghost (1945) as Inspector Brant
 * Flame of the West (1945) as Marshal Tom Nightlander
 * The Daltons Ride Again (1945) as Sheriff Hoskins
 * Road to Utopia (1945) as Ace Larson
 * Pardon My Past (1945) as Uncle Wills
 * The Catman of Paris (1946) as Henry Borchard
 * Night in Paradise (1946) as High Priest
 * The Cat Creeps (1946) as Tom McGalvey
 * Spook Busters (1946) as Dr. Coslow
 * Under Nevada Skies (1946) as Courtney
 * Monsieur Beaucaire (1946) as George Washington
 * It's a Joke, Son! (1947) as Big Dan Healey
 * Dishonored Lady (1947) as District Attorney O'Brien
 * Dragnet (1947) as Frank Farrington
 * Blonde Savage (1947) as Mark Harper
 * Christmas Eve (1947) as Dr. Bunyan
 * The Fabulous Texan (1947) as Luke Roland
 * Beyond Our Own (1947) as E.W. Osborne
 * Last of the Wild Horses (1948) as Charlie Cooper
 * Dynamite (1949) as Hank Gibbons
 * Riders of the Whistling Pines (1949) as Henry Mitchell
 * The Lone Wolf and His Lady (1949) as John J. Murdock
 * Addio Mimí! (1949) as Rouchard
 * Alimony (1949) as Burton (Burt) Crail
 * Joe Palooka in the Counterpunch (1949) as Capt. Lance
 * Tell It to the Judge (1949) as George Ellerby
 * Buccaneer's Girl (1950) as Capt. Martos
 * Riding High (1950, remake of Broadway Bill) as Eddie Howard
 * The Savage Horde (1950) as Col. Price
 * Abbott and Costello in the Foreign Legion (1950) as Sheik Hamud El Khalid
 * The Kangaroo Kid (1950) as Vincent Moller
 * Rapture (1950) as W.C. Hutton
 * A Millionaire for Christy (1951) as J.C. Thompson
 * Scaramouche (1952) as Assembly President (uncredited)
 * Son of Paleface (1952) as Sheriff McIntyre
 * Apache War Smoke (1952) as Maj. Dekker
 * Sky Full of Moon (1952) as Rodeo Official
 * Julius Caesar (1953) as Lepidus
 * Plunder of the Sun (1953) as Consul
 * Captain John Smith and Pocahontas (1953) as Chief Powhatan
 * World for Ransom (1954) as Insp. McCollum
 * The Lawless Rider (1954) as Marshal Brady
 * Jupiter's Darling (1955) as Scipio
 * A Life at Stake (1954) as Gus Hillman
 * Davy Crockett and the River Pirates (1956) as Saloon owner (uncredited) (archive footage)
 * Shake, Rattle & Rock! (1956) as Eustace Fentwick III
 * The Ten Commandments (1956) as Jannes
 * The Go-Getter (1956) as Dr. Baker
 * The Buccaneer (1958) as Collector of the Port
 * High Time (1960) as Judge Carter (uncredited)
 * Air Patrol (1962) as Millard Nolan
 * Johnny Cool (1963) as Corrupt City Council Member
 * What a Way to Go! (1964) as Minor Role (uncredited)
 * Shock Treatment (1964) as Judge (uncredited)

title: Douglass Dumbrille